{"version":3,"sources":["webpack:///livepoll-c7d620350a9b1b48aff5.js","webpack:///webpack/bootstrap 5cf8666b8fbd1b7d86c1","webpack:///./node_modules/@firebase/util/dist/cjs/index.js","webpack:///./node_modules/preact/dist/preact.esm.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/util/util.js","webpack:///./src/shared/helpers/bem.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/util/Path.js","webpack:///./src/shared/helpers/themeToClassName.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/snap/indexes/PriorityIndex.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/snap/ChildrenNode.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/snap/Node.js","webpack:///./src/shared/components/Result/components/ResultList/components/ResultItem/ResultItem.css","webpack:///./src/shared/helpers/breakpointToClassName.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/util/validation.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/operation/Operation.js","webpack:///./node_modules/date-fns/parse/index.js","webpack:///./src/shared/components/StemningIcon/StemningIcon.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/view/Change.js","webpack:///./src/client/helpers/nodelistToArray.js","webpack:///(webpack)/buildin/global.js","webpack:///./node_modules/domready/ready.js","webpack:///./src/shared/components/Result/components/ResultList/components/ResultItem/components/Bar/Bar.css","webpack:///./src/shared/widgets/LivePoll/helpers/cookieUtils.js","webpack:///./node_modules/@firebase/app/dist/esm/index.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/snap/indexes/KeyIndex.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/snap/nodeFromJSON.js","webpack:///./src/client/init.js","webpack:///./src/client/helpers/uuid.js","webpack:///./node_modules/promise-polyfill/promise.js","webpack:///./node_modules/process/browser.js","webpack:///./src/shared/components/Button/Button.js","webpack:///./src/shared/helpers/get-text-max-length.js","webpack:///./src/shared/components/Error/Error.js","webpack:///./src/shared/components/Loader/Loader.js","webpack:///./src/shared/widgets/LivePoll/components/LivePoll/RetryButton/RetryButton.js","webpack:///./src/shared/helpers/pure-components.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/storage/storage.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/realtime/Constants.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/snap/indexes/Index.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/snap/LeafNode.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/util/SortedMap.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/Repo.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/view/CacheNode.js","webpack:///./node_modules/regenerator-runtime/runtime.js","webpack:///(webpack)/buildin/module.js","webpack:///./src/client/polyfills/array.prototype.includes.js","webpack:///./src/client/polyfills/array.prototype.find.js","webpack:///./node_modules/timers-browserify/main.js","webpack:///./node_modules/setimmediate/setImmediate.js","webpack:///./src/shared/components/Button/Button.css","webpack:///./src/shared/widgets/LivePoll/components/LivePoll/VoteCounter/VoteCounter.js","webpack:///./src/shared/widgets/LivePoll/components/LivePoll/VoteCounter/VoteCounter.css","webpack:///./src/shared/helpers/formatNumber.js","webpack:///./src/shared/components/Result/Result.js","webpack:///./src/shared/components/Result/Result.css","webpack:///./src/shared/components/Result/components/ResultList/ResultList.js","webpack:///./src/shared/components/Result/components/ResultList/ResultList.css","webpack:///./src/shared/components/Result/components/ResultList/components/ResultItem/ResultItem.js","webpack:///./src/shared/components/Result/components/ResultList/helpers/getScorePercent.js","webpack:///./src/shared/components/Result/components/ResultList/components/ResultItem/components/Bar/Bar.js","webpack:///./src/shared/components/Result/components/ResultList/components/ResultItem/components/Percent/Percent.js","webpack:///./src/shared/components/Result/components/ResultList/components/ResultItem/components/Number/Number.js","webpack:///./src/shared/components/Error/Error.css","webpack:///./src/shared/components/Loader/Loader.css","webpack:///./src/shared/components/StemningIcon/StemningIcon.css","webpack:///./src/shared/widgets/LivePoll/components/LivePoll/RetryButton/RetryButton.css","webpack:///./node_modules/browser-cookies/src/browser-cookies.js","webpack:///./src/shared/components/Branding/Branding.js","webpack:///./src/shared/components/Branding/Branding.css","webpack:///./node_modules/@firebase/util/dist/cjs/src/constants.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/api/Reference.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/api/DataSnapshot.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/util/ImmutableTree.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/view/filter/IndexedFilter.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/stats/StatsManager.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/RepoManager.js","webpack:///./src/client/utils/devtools.js","webpack:///./node_modules/date-fns/difference_in_seconds/index.js","webpack:///./node_modules/date-fns/locale/_lib/build_formatting_tokens_reg_exp/index.js","webpack:///./src/shared/db/firebase.js","webpack:///./node_modules/@firebase/util/dist/cjs/src/assert.js","webpack:///./node_modules/@firebase/util/dist/cjs/src/crypt.js","webpack:///./node_modules/@firebase/util/dist/cjs/src/json.js","webpack:///./node_modules/@firebase/util/dist/cjs/src/obj.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/api/Database.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/util/libs/parser.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/RepoInfo.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/api/onDisconnect.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/api/Query.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/snap/snap.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/snap/indexes/ValueIndex.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/snap/IndexMap.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/snap/childSet.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/snap/comparators.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/snap/indexes/PathIndex.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/util/ServerValues.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/SparseSnapshotTree.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/util/CountedSet.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/operation/Overwrite.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/SyncPoint.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/view/ViewCache.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/stats/StatsListener.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/PersistentConnection.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/util/EventEmitter.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/realtime/Connection.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/realtime/BrowserPollConnection.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/realtime/WebSocketConnection.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/ServerActions.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/view/filter/RangedFilter.js","webpack:///./src/client/widgets/livepoll/index.js","webpack:///./src/client/widgets/livepoll/polyfills.js","webpack:///./src/shared/widgets/LivePoll/LivePollWidget.js","webpack:///./src/shared/widgets/LivePoll/LivePollWidget.css","webpack:///./src/shared/widgets/LivePoll/components/LivePoll/LivePoll.js","webpack:///./src/shared/widgets/LivePoll/components/LivePoll/LivePoll.css","webpack:///./src/shared/widgets/LivePoll/components/LivePoll/AlternativeList/AlternativeList.js","webpack:///./src/shared/widgets/LivePoll/components/LivePoll/AlternativeList/AlternativeList.css","webpack:///./src/shared/widgets/LivePoll/components/LivePoll/AlternativeList/components/Alternative.js","webpack:///./src/shared/widgets/LivePoll/components/LivePoll/AlternativeList/components/Alternative.css","webpack:///./src/shared/widgets/LivePoll/components/LivePoll/LastUpdatedTime/LastUpdatedTime.js","webpack:///./node_modules/date-fns/distance_in_words/index.js","webpack:///./node_modules/date-fns/compare_desc/index.js","webpack:///./node_modules/date-fns/is_date/index.js","webpack:///./node_modules/date-fns/difference_in_milliseconds/index.js","webpack:///./node_modules/date-fns/difference_in_months/index.js","webpack:///./node_modules/date-fns/difference_in_calendar_months/index.js","webpack:///./node_modules/date-fns/compare_asc/index.js","webpack:///./node_modules/date-fns/locale/en/index.js","webpack:///./node_modules/date-fns/locale/en/build_distance_in_words_locale/index.js","webpack:///./node_modules/date-fns/locale/en/build_format_locale/index.js","webpack:///./node_modules/date-fns/locale/nb/index.js","webpack:///./node_modules/date-fns/locale/nb/build_distance_in_words_locale/index.js","webpack:///./node_modules/date-fns/locale/nb/build_format_locale/index.js","webpack:///./src/shared/widgets/LivePoll/components/LivePoll/LastUpdatedTime/LastUpdatedTime.css","webpack:///./src/shared/widgets/LivePoll/components/LivePoll/LiveResult/LiveResult.js","webpack:///./src/shared/widgets/LivePoll/components/LivePoll/LiveResult/LiveResult.css","webpack:///./src/shared/widgets/LivePoll/WithVotingState.js","webpack:///./src/shared/widgets/LivePoll/helpers/createVote.js","webpack:///./src/shared/db/registerVote.js","webpack:///./node_modules/firebase/app/index.js","webpack:///./node_modules/@firebase/polyfill/dist/esm/index.js","webpack:///./node_modules/@firebase/polyfill/dist/esm/src/polyfills/promise.js","webpack:///./node_modules/@firebase/polyfill/dist/esm/src/shims/find.js","webpack:///./node_modules/@firebase/polyfill/dist/esm/src/shims/findIndex.js","webpack:///./node_modules/@firebase/app/dist/esm/src/firebaseApp.js","webpack:///./node_modules/@firebase/util/dist/cjs/src/deepCopy.js","webpack:///./node_modules/@firebase/util/dist/cjs/src/deferred.js","webpack:///./node_modules/@firebase/util/dist/cjs/src/environment.js","webpack:///./node_modules/@firebase/util/dist/cjs/src/errors.js","webpack:///./node_modules/@firebase/util/dist/cjs/src/jwt.js","webpack:///./node_modules/@firebase/util/dist/cjs/src/query.js","webpack:///./node_modules/@firebase/util/dist/cjs/src/sha1.js","webpack:///./node_modules/@firebase/util/dist/cjs/src/hash.js","webpack:///./node_modules/@firebase/util/dist/cjs/src/subscribe.js","webpack:///./node_modules/@firebase/util/dist/cjs/src/validation.js","webpack:///./node_modules/@firebase/util/dist/cjs/src/utf8.js","webpack:///./node_modules/firebase/database/index.js","webpack:///./node_modules/@firebase/database/dist/cjs/index.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/storage/DOMStorageWrapper.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/storage/MemoryStorage.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/api/TransactionResult.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/util/NextPushId.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/view/EventRegistration.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/view/Event.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/SyncTree.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/operation/AckUserWrite.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/operation/ListenComplete.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/operation/Merge.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/view/View.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/view/ViewProcessor.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/view/ChildChangeAccumulator.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/view/CompleteChildSource.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/view/EventGenerator.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/WriteTree.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/CompoundWrite.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/SnapshotHolder.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/AuthTokenProvider.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/stats/StatsCollection.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/stats/StatsReporter.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/view/EventQueue.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/util/VisibilityMonitor.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/util/OnlineMonitor.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/realtime/TransportManager.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/realtime/polling/PacketReceiver.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/ReadonlyRestClient.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/view/QueryParams.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/view/filter/LimitedFilter.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/Repo_transaction.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/core/util/Tree.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/api/internal.js","webpack:///./node_modules/@firebase/database/dist/cjs/src/api/test_access.js","webpack:///./node_modules/firebase/auth/index.js","webpack:///./node_modules/@firebase/auth/dist/auth.js","webpack:///./src/shared/widgets/LivePoll/WithPollState.js","webpack:///./src/shared/widgets/LivePoll/helpers/pollUtils.js","webpack:///./src/shared/widgets/LivePoll/WithResultState.js","webpack:///./src/shared/widgets/LivePoll/helpers/prepareResult.js","webpack:///./src/shared/widgets/LivePoll/components/LivePoll/AriaLive/AriaLive.js","webpack:///./src/shared/widgets/LivePoll/helpers/alternativeUtils.js","webpack:///./src/shared/helpers/debounce.js"],"names":["modules","__webpack_require__","moduleId","installedModules","exports","module","i","l","call","m","c","d","name","getter","o","Object","defineProperty","configurable","enumerable","get","n","__esModule","object","property","prototype","hasOwnProperty","p","s","__export","value","VNode","h","nodeName","attributes","lastSimple","child","simple","children","EMPTY_CHILDREN","arguments","length","stack","push","pop","undefined","String","key","options","vnode","extend","obj","props","cloneElement","slice","enqueueRender","component","_dirty","items","debounceRendering","defer","rerender","list","renderComponent","isSameNodeType","node","hydrating","splitText","_componentConstructor","isNamedNode","normalizedNodeName","toLowerCase","getNodeProps","defaultProps","createNode","isSvg","document","createElementNS","createElement","removeNode","parentNode","removeChild","setAccessor","old","style","cssText","_typeof","IS_NON_DIMENSIONAL","test","innerHTML","__html","useCapture","replace","substring","addEventListener","eventProxy","removeEventListener","_listeners","setProperty","removeAttribute","ns","removeAttributeNS","setAttributeNS","setAttribute","className","e","this","type","event","flushMounts","mounts","afterMount","componentDidMount","diff","dom","context","mountAll","parent","componentRoot","diffLevel","isSvgMode","ownerSVGElement","ret","idiff","appendChild","out","prevSvgMode","_component","nodeValue","createTextNode","replaceChild","recollectNodeTree","vnodeName","buildComponentFromVNode","firstChild","fc","vchildren","a","nextSibling","innerDiffNode","dangerouslySetInnerHTML","diffAttributes","isHydrating","j","f","vchild","originalChildren","childNodes","keyed","keyedLen","min","len","childrenLen","vlen","_child","__key","trim","insertBefore","unmountOnly","unmountComponent","ref","removeChildren","lastChild","next","previousSibling","attrs","collectComponent","constructor","components","createComponent","Ctor","inst","render","Component","doRender","nextBase","splice","state","setComponentProps","opts","_disable","__ref","base","componentWillMount","componentWillReceiveProps","prevContext","prevProps","syncComponentUpdates","isChild","rendered","cbase","previousProps","previousState","prevState","previousContext","isUpdate","initialBase","initialChildComponent","skip","shouldComponentUpdate","componentWillUpdate","getChildContext","toUnmount","childComponent","childProps","_parentComponent","baseParent","componentRef","t","unshift","componentDidUpdate","afterUpdate","_renderCallbacks","originalComponent","oldDom","isDirectOwner","isOwner","beforeUnmount","componentWillUnmount","inner","merge","Symbol","iterator","Promise","resolve","then","bind","setTimeout","setState","callback","forceUpdate","preact","default","util_1","util_2","util_3","util_4","util_5","util_6","storage_1","util_7","LUIDGenerator","id","sha1","str","utf8Bytes","stringToByteArray","Sha1","update","sha1Bytes","digest","base64","encodeByteArray","buildLogMessage_","var_args","_i","message","Array","isArray","apply","stringify","logger","firstLog_","enableLogging","logger_","persistent","assert","console","log","SessionStorage","set","remove","logWrapper","prefix","concat","error","fatal","Error","warn","warnIfPageIsSecure","window","location","protocol","indexOf","warnAboutUnsupportedMethod","methodName","isInvalidJSONNumber","data","Number","POSITIVE_INFINITY","NEGATIVE_INFINITY","executeWhenDOMReady","fn","isNodeSdk","readyState","called_1","wrappedFn_1","body","Math","floor","attachEvent","MIN_NAME","MAX_NAME","nameCompare","b","aAsInt","tryParseInt","bAsInt","stringCompare","requireKey","ObjectToUniqueKey","keys","k","sort","splitStringBySize","segsize","dataSegs","each","forEach","val","bindCallback","doubleToIEEE754String","v","ln","bits","Infinity","abs","pow","LN2","round","reverse","join","hexByteString","hexByte","parseInt","substr","toString","isChromeExtensionContentScript","href","isWindowsStoreApp","Windows","UI","errorForServerCode","code","query","reason","path","toUpperCase","INTEGER_REGEXP_","RegExp","intVal","exceptionGuard","callUserCallback","beingCrawled","search","exportPropGetter","fnGet","setTimeoutNonBlocking","time","timeout","_toConsumableArray","arr","arr2","from","bem","_len","modifiers","_key","filter","Boolean","map","modifier","Path","pathOrString","pieceNum","pieces_","split","copyTo","pieceNum_","getFront","getLength","popFront","getBack","pathString","toUrlEncodedString","encodeURIComponent","begin","pieces","childPathObj","childPieces","isEmpty","relativePath","outerPath","innerPath","outer","comparePaths","left","right","leftKeys","rightKeys","cmp","equals","other","contains","ValidationPath","errorPrefix_","parts_","byteLength_","max","stringLength","checkValid_","last","MAX_PATH_LENGTH_BYTES","MAX_PATH_DEPTH","toErrorString","themeToClassName","theme","setNodeFromJSON","nodeFromJSON","setMaxNode","MAX_NODE","__extends","extendStatics","setPrototypeOf","__proto__","__","create","Index_1","Node_1","LeafNode_1","PriorityIndex","_super","compare","aPriority","getPriority","bPriority","indexCmp","compareTo","isDefinedOn","indexedValueChanged","oldNode","newNode","minPost","NamedNode","MIN","maxPost","LeafNode","makePost","indexValue","priorityNode","Index","PRIORITY_INDEX","EMPTY_NODE","SortedMap_1","snap_1","PriorityIndex_1","KeyIndex_1","IndexMap_1","comparators_1","ChildrenNode","children_","priorityNode_","indexMap_","lazyHash_","validatePriorityNode","SortedMap","NAME_COMPARATOR","IndexMap","Default","isLeafNode","updatePriority","newPriorityNode","getImmediateChild","childName","getChild","front","hasChild","updateImmediateChild","newChildNode","namedNode","newChildren","newIndexMap","newPriority","removeFromIndexes","insert","addToIndexes","updateChild","newImmediateChild","numChildren","count","exportFormat","numKeys","maxKey","allIntegerKeys","forEachChild","childNode","array","hash","toHash_1","priorityHashText","childHash","getPredecessorChildName","index","idx","resolveIndex_","predecessor","getPredecessorKey","getFirstChildName","indexDefinition","minKey","getFirstChild","getLastChildName","getLastChild","action","inorderTraversal","wrappedNode","getIterator","getIteratorFrom","startPost","Wrap","peek","getNext","getReverseIterator","getReverseIteratorFrom","endPost","withIndex","KEY_INDEX","hasIndex","addIndex","isIndexed","otherChildrenNode","thisIter","otherIter","thisCurrent","otherCurrent","MaxNode","defineProperties","MAX","KeyIndex","__EMPTY_NODE","__childrenNodeConstructor","resultItem","resultItem__label","resultItem__score-wrapper","resultItem__score","resultItem__score--hidden","resultItem__score-text","score-text-wrapper","resultList__sr","resultList__bars","resultList__text","getCurrentBreakpoint","width","BREAKPOINTS","find","bp","breakpointToClassName","currentBreakpoint","XS","S","M","L","XL","Path_1","INVALID_KEY_REGEX_","INVALID_PATH_REGEX_","MAX_LEAF_SIZE_","isValidKey","isValidPathString","isValidRootPathString","isValidPriority","priority","validateFirebaseDataArg","fnName","argumentNumber","optional","validateFirebaseData","errorPrefix","path_","hasDotValue_1","hasActualChild_1","validateFirebaseMergePaths","mergePaths","curPath","prevPath","validateFirebaseMergeDataArg","validatePriority","validateEventType","eventType","validateKey","validatePathString","validateRootPathString","validateWritablePath","validateUrl","parsedUrl","repoInfo","host","namespace","validateCredential","cred","validateBoolean","bool","validateString","string","validateObject","validateObjectContainsKey","opt_type","safeGet","OperationType","OperationSource","fromUser","fromServer","queryId","tagged","User","Server","forServerTaggedQuery","parse","argument","dirtyOptions","isDate","Date","getTime","additionalDigits","DEFAULT_ADDITIONAL_DIGITS","dateStrings","splitDateString","parseYearResult","parseYear","date","year","restDateString","parseDate","offset","timestamp","parseTime","timezone","parseTimezone","getTimezoneOffset","MILLISECONDS_IN_MINUTE","dateString","timeString","parseTokenDateTimeDelimeter","parseTokenPlainTime","token","parseTokenTimezone","exec","parseTokenYYY","parseTokensYYY","parseTokenYYYYY","parseTokensYYYYY","parseTokenYYYY","yearString","parseTokenYY","centuryString","month","week","setUTCFullYear","parseTokenMM","parseTokenDDD","dayOfYear","parseTokenMMDD","day","parseTokenWww","dayOfISOYear","parseTokenWwwD","hours","minutes","parseTokenHH","parseFloat","MILLISECONDS_IN_HOUR","parseTokenHHMM","parseTokenHHMMSS","seconds","timezoneString","absoluteOffset","parseTokenTimezoneZ","parseTokenTimezoneHH","parseTokenTimezoneHHMM","isoYear","fourthOfJanuaryDay","getUTCDay","setUTCDate","getUTCDate","StemningIcon","_preact","_StemningIcon","_StemningIcon2","_bem","_themeToClassName","stemningIcon","xmlns","height","fill-rule","Change","snapshotNode","oldSnap","prevName","valueChange","snapshot","VALUE","childAddedChange","childKey","CHILD_ADDED","childRemovedChange","CHILD_REMOVED","childChangedChange","newSnapshot","oldSnapshot","CHILD_CHANGED","childMovedChange","CHILD_MOVED","nodelistToArray","nodeList","g","Function","eval","definition","listener","fns","doc","hack","documentElement","doScroll","loaded","shift","bar","bar--slim","resultList--theme-sport-inverted","resultList--theme-sport-inverted-gray","resultList--theme-monsen","bar__main","bar__main--highlighted","bar__main--theme-sport","bar__main--theme-sport-inverted","bar__main--theme-sport-inverted-gray","bar__main--theme-monsen","toCookieName","pollId","COOKIE_PREFIX","getSelectedAlternativeId","cookie","getCookie","selectedAlternativeId","cookieName","cookieValueAsString","_browserCookies2","JSON","setHasVoted","alternativeId","cookieValue","hasVoted","cookieOptions","expires","COOKIE_MAXAGE","cookiesEnabled","navigator","cookieEnabled","_browserCookies","firebase","_firebaseApp","createFirebaseNamespace","assertionError","json","ChildrenNode_1","jsonLeaf","USE_HINZE","node_1","jsonObj_1","childData","children_1","childrenHavePriority_1","hinzeJsonObj_1","childSet","childSet_1","buildChildSet","NAME_ONLY_COMPARATOR","sortedChildSet","getCompare",".priority","init","rootElementClassName","mountFn","callbackFn","elements","findElements","el","_uuid","uuid","_nodelistToArray","getElementsByClassName","isInitialized","random","setImmediate","root","noop","thisArg","TypeError","_state","_handled","_value","_deferreds","doResolve","handle","self","deferred","_immediateFn","cb","onFulfilled","onRejected","reject","promise","newValue","finale","_unhandledRejectionFn","Handler","done","ex","setTimeoutFunc","prom","all","args","res","remaining","race","values","err","_setImmediateFn","_setUnhandledRejectionFn","defaultSetTimout","defaultClearTimeout","runTimeout","fun","cachedSetTimeout","runClearTimeout","marker","cachedClearTimeout","clearTimeout","cleanUpNextTick","draining","currentQueue","queue","queueIndex","drainQueue","run","Item","process","nextTick","title","browser","env","argv","version","versions","on","addListener","once","off","removeListener","removeAllListeners","emit","prependListener","prependOnceListener","listeners","binding","cwd","chdir","dir","umask","_classCallCheck","instance","Constructor","_possibleConstructorReturn","ReferenceError","_inherits","subClass","superClass","writable","Button","_createClass","target","descriptor","protoProps","staticProps","_Button","_Button2","_Component","getPrototypeOf","classes","button","onClick","getMaxLength","arrOfLengths","_Error","_Error2","Loader","_Loader","_Loader2","loader","RetryButton","_RetryButton","_RetryButton2","retryButton","aria-hidden","xlinkHref","shallowEqual","PureComponent","DOMStorageWrapper_1","MemoryStorage_1","createStoragefor","domStorageName","domStorage","setItem","removeItem","DOMStorageWrapper","MemoryStorage","PersistentStorage","PROTOCOL_VERSION","VERSION_PARAM","TRANSPORT_SESSION_PARAM","REFERER_PARAM","FORGE_REF","FORGE_DOMAIN","LAST_SESSION_PARAM","WEBSOCKET","LONG_POLLING","oldWrapped","newWrapped","value_",".value","getValue","toHash","compareToLeafNode_","otherLeaf","otherLeafType","thisLeafType","otherIndex","VALUE_TYPE_ORDER","thisIndex","SortedMapIterator","startKey","comparator","isReverse_","resultGenerator_","nodeStack_","result","hasNext","LLRBNode","color","RED","copy","reverseTraversal","min_","fixUp_","removeMin_","isRed_","moveRedLeft_","smallest","rotateRight_","moveRedRight_","rotateLeft_","colorFlip_","nl","nr","checkMaxDepth_","blackDepth","check_","BLACK","LLRBEmptyNode","comparator_","root_","rightParent","resultGenerator","ServerValues_1","nodeFromJSON_1","SparseSnapshotTree_1","SyncTree_1","SnapshotHolder_1","AuthTokenProvider_1","StatsManager_1","StatsReporter_1","StatsListener_1","EventQueue_1","PersistentConnection_1","ReadonlyRestClient_1","Database_1","Repo","repoInfo_","forceRestClient","app","_this","dataUpdateCount","statsListener_","eventQueue_","EventQueue","nextWriteId_","interceptServerDataCallback_","onDisconnect_","SparseSnapshotTree","persistentConnection_","authTokenProvider","AuthTokenProvider","stats_","StatsManager","getCollection","server_","ReadonlyRestClient","onDataUpdate_","onConnectStatus_","authOverride","PersistentConnection","onServerInfoUpdate_","addTokenChangeListener","refreshAuthToken","statsReporter_","getOrCreateReporter","StatsReporter","transactions_init_","infoData_","SnapshotHolder","infoSyncTree_","SyncTree","startListening","tag","currentHashFn","onComplete","infoEvents","getNode","applyServerOverwrite","stopListening","updateInfo_","serverSyncTree_","listen","status","events","raiseEventsForChangedPath","unlisten","secure","serverTime","offsetNode","generateServerValues","generateWithValues","isMerge","taggedChildren","raw","applyTaggedQueryMerge","taggedSnap","applyTaggedQueryOverwrite","changedChildren","applyServerMerge","snap","affectedPath","rerunTransactions_","interceptServerData_","connectStatus","runOnDisconnectEvents_","updates","updateSnapshot","getNextWriteId_","setWithPriority","newVal","log_","serverValues","newNodeUnresolved","resolveDeferredValueSnapshot","writeId","applyUserOverwrite","queueEvents","put","errorReason","success","clearEvents","ackUserWrite","callOnCompleteCallback","abortTransactions_","childrenToMerge","empty","changedKey","changedValue","writeId_1","applyUserMerge","changedPath","resolvedOnDisconnectTree","resolveDeferredValueTree","forEachTree","Empty","onDisconnectCancel","forget","onDisconnectSet","onDisconnectPut","remember","onDisconnectSetWithPriority","onDisconnectUpdate","onDisconnectMerge","addEventCallbackForQuery","eventRegistration","addEventRegistration","raiseEventsAtPath","removeEventCallbackForQuery","removeEventRegistration","interrupt","resume","stats","showDelta","StatsListener","longestName","reduce","previousValue","currentValue","stat","statsIncrementCounter","metric","incrementCounter","includeStat","__database","Database","CacheNode","node_","fullyInitialized_","filtered_","isFullyInitialized","isFiltered","isCompleteForPath","isCompleteForChild","global","wrap","innerFn","outerFn","tryLocsList","protoGenerator","Generator","generator","Context","_invoke","makeInvokeMethod","tryCatch","arg","GeneratorFunction","GeneratorFunctionPrototype","defineIteratorMethods","method","AsyncIterator","invoke","record","hasOwn","__await","unwrapped","enqueue","callInvokeWithMethodAndArg","previousPromise","GenStateSuspendedStart","GenStateExecuting","GenStateCompleted","doneResult","delegate","delegateResult","maybeInvokeDelegate","ContinueSentinel","sent","_sent","dispatchException","abrupt","GenStateSuspendedYield","return","info","resultName","nextLoc","pushTryEntry","locs","entry","tryLoc","catchLoc","finallyLoc","afterLoc","tryEntries","resetTryEntry","completion","reset","iterable","iteratorMethod","iteratorSymbol","isNaN","Op","$Symbol","asyncIteratorSymbol","asyncIterator","toStringTagSymbol","toStringTag","inModule","runtime","regeneratorRuntime","IteratorPrototype","getProto","NativeIteratorPrototype","Gp","displayName","isGeneratorFunction","genFun","ctor","mark","awrap","async","iter","skipTempReset","prev","charAt","stop","rootEntry","rootRecord","rval","exception","loc","caught","hasCatch","hasFinally","finallyEntry","complete","finish","catch","thrown","delegateYield","webpackPolyfill","deprecate","paths","includes","searchElement","fromIndex","x","y","predicate","kValue","Timeout","clearFn","_id","_clearFn","setInterval","clearInterval","close","unref","enroll","item","msecs","_idleTimeoutId","_idleTimeout","unenroll","_unrefActive","active","_onTimeout","clearImmediate","task","tasksByHandle","nextHandle","registerImmediate","runIfPresent","currentlyRunningATask","attachTo","postMessage","importScripts","postMessageIsAsynchronous","oldOnMessage","onmessage","messagePrefix","onGlobalMessage","source","MessageChannel","channel","port1","port2","html","script","onreadystatechange","button--theme-sport","button--theme-sport-inverted","button--theme-sport-inverted-gray","button--theme-monsen","VoteCounter","voteCount","_VoteCounter2","voteCounter","role","voteCounter__count","_formatNumber","formatNumber","_VoteCounter","voteCounter--theme-monsen","number","toLocaleString","sortItems","votes","Result","_Result","_Result2","_ResultList","reload","_props","highlightedResultItemId","clickable","totalVotes","marginBottom","handleRetryButtonClick","TitleBar","result__titleBar","result__title","ResultList","highlightedId","result__voteCount","_ResultList2","_breakpointToClassName","_ResultItem","_getTextMaxLength","_ref","_temp","_ret","showNumber","toggleShowNumber","_context","isSlim","resultList","ScreenReaderList","BarList","TextList","resultList--medium","resultList--large","resultList--extra-large","resultList--theme-sport","resultList--clickable","shouldHighlight","getTextRepresentation","scorePercent","formattedScorePercent","toFixed","text","ScreenReaderItem","TextItem","BarItem","_ResultItem2","_getScorePercent","_Bar","_Percent","_Number","class","getScorePercent","isHighlighted","data-alternativeid","Bar","hidden","Percent","getTransform","transform","WebkitTransform","MozTransform","msTransform","OTransform","transitionDelay","_Bar2","isMounted","_this2","requestAnimationFrame","isInteractive","_ref$hidden","prettyPrintScorePercent","prettyPrintNumber","anim","stemningIcon--theme-sport","stemningIcon--theme-sport-inverted-gray","stemningIcon--theme-sport-inverted","stemningIcon--theme-monsen","animate","animate--once","animate--infinite","rect-1","rect-2","rect-3","retryButton--theme-sport","defaults","domain","httponly","expDate","toUTCString","cookies","cookieLength","separatorIndex","decodeURIComponent","erase","Branding","_Branding","_Branding2","branding","branding--theme-sport","CONSTANTS","NODE_CLIENT","NODE_ADMIN","SDK_VERSION","onDisconnect_1","TransactionResult_1","NextPushId_1","Query_1","Repo_1","QueryParams_1","validation_1","SyncPoint_1","Reference","repo","QueryParams","DEFAULT","getKey","validateArgCount","getParent","parentPath","getRoot","databaseProp","database","validateCallback","Deferred","wrapCallback","objectToMerge","newObjectToMerge","transaction","transactionUpdate","applyLocally","promiseComplete","committed","TransactionResult","startTransaction","setPriority","now","nextPushId","thennablePushRef","pushRef","onDisconnect","OnDisconnect","Query","__referenceConstructor","SyncPoint","DataSnapshot","ref_","index_","exportVal","toJSON","exists","childPathString","childPath","childRef","hasChildren","getRef","emptyChildrenSingleton","EmptyChildren","ImmutableTree","fromObject","tree","childSnap","findRootMostMatchingPathAndValue","childExistingPathAndValue","findRootMostValueAndPath","subtree","childTree","toSet","newChild","setTree","newTree","fold","fold_","pathSoFar","accum","findOnPath","findOnPath_","pathToFollow","nextChild","foreachOnPath","foreachOnPath_","currentRelativePath","foreach","foreach_","foreachChild","Change_1","IndexedFilter","optChangeAccumulator","oldChild","trackChildChange","updateFullNode","newSnap","filtersNodes","getIndexedFilter","getIndex","StatsCollection_1","hashString","collections_","StatsCollection","creatorFunction","reporters_","parser_1","_staticInstance","RepoManager","repos_","useRestClient_","getInstance","appName","dbUrl","databaseFromApp","url","parseRepoInfo","createRepo","deleteRepo","appRepos","toURLString","enableDevtools","differenceInSeconds","dirtyDateLeft","dirtyDateRight","differenceInMilliseconds","ceil","buildFormattingTokensRegExp","formatters","formatterKeys","formattingTokens","commonFormatterKeys","getFirebaseInstance","authConfig","firebaseInstance","_app2","initializeApp","_extends","projectId","assign","_app","constants_1","assertion","output","charCodeAt","byteArrayToString","bytes","fromCharCode","chunk","byteToCharMap_","charToByteMap_","byteToCharMapWebSafe_","charToByteMapWebSafe_","ENCODED_VALS_BASE","ENCODED_VALS","ENCODED_VALS_WEBSAFE","HAS_NATIVE_SUPPORT","atob","input","opt_webSafe","init_","byteToCharMap","byte1","haveByte2","byte2","haveByte3","byte3","outByte1","outByte2","outByte3","outByte4","encodeString","btoa","decodeString","decodeStringToByteArray","charToByteMap","haveByte4","byte4","base64Encode","base64Decode","jsonEval","objTo","objFrom","clone","isNonNullObject","getCount","rv","opt_obj","findKey","opt_this","findValue","getAnyKey","getValues","every","Reference_1","RepoManager_1","repo_","INTERNAL","DatabaseInternals","checkDeleted_","refFromURL","apiName","parsedURL","goOffline","goOnline","ServerValue","TIMESTAMP",".sv","delete","decodePath","pathStringDecoded","piece","RepoInfo_1","dataURL","parseURL","subdomain","webSocketOnly","scheme","RepoInfo","port","colonInd","slashInd","parts","Constants_1","persistenceKey","internalHost","needsQueryParam","isCacheableHost","isDemoHost","isCustomHost","updateHost","newHost","connectionURL","params","connURL","pairs","cancel","ValueIndex_1","PathIndex_1","EventRegistration_1","queryParams_","orderByCalled_","validateQueryEndpoints_","startNode","endNode","hasStart","getIndexStartValue","hasEnd","getIndexEndValue","tooManyArgsError","wrongArgTypeError","getIndexStartName","getIndexEndName","PathIndex","VALUE_INDEX","validateLimit_","hasLimit","hasAnchoredLimit","validateNoPreviousOrderByCall_","getQueryParams","cancelCallbackOrContext","getCancelAndContextArgs_","onValueEvent","callbacks","onChildEvent","cancelCallback","container","ValueEventRegistration","ChildEventRegistration","validateContextObject","valueCallback","userCallback","cancelOrContext","firstCall","onceCallback","limitToFirst","limit","limitToLast","orderByChild","parsedPath","newParams","orderBy","orderByKey","orderByPriority","orderByValue","startAt","endAt","equalTo","queryObject","getQueryObject","queryIdentifier","isEqual","sameRepo","samePath","sameQueryIdentifier","ValueIndex","valueNode","_defaultIndexMap","fallbackObject","indexes_","indexSet_","indexKey","sortedMap","existingChildren","childList","sawIndexedValue","newIndex","indexName","newIndexSet","newIndexes","indexedChildren","existingSnap","SortedMap_2","LOG_2","Base12Num","num","current_","mask","bits_","nextBitIsOne","keyFn","mapSortFn","buildBalancedTree","low","high","middle","base12","buildPennant","chunkSize","attachPennant","pennant","isOne","indexPath_","extractChild","aChild","bChild","resolveDeferredValue","resolvedTree","rawPri","leafNode","childrenNode","CountedSet_1","CountedSet","add","self_1","prefixPath","func","clear","Operation_1","Overwrite","OVERWRITE","operationForChild","CacheNode_1","ViewCache_1","View_1","views_","applyOperation","operation","writesCache","optCompleteServerCache","view","events_1","serverCache","serverCacheComplete","eventCache","calcCompleteEventCache","eventCacheComplete","calcCompleteEventChildren","viewCache","ViewCache","View","getInitialEvents","cancelError","removed","cancelEvents","hadCompleteView","hasCompleteView","viewQueryId","getQuery","loadsAllData","getQueryViews","getCompleteServerCache","viewForQuery","getCompleteView","viewExistsForQuery","eventCache_","serverCache_","updateEventSnap","eventSnap","filtered","updateServerSnap","serverSnap","getEventCache","getCompleteEventSnap","getServerCache","getCompleteServerSnap","collection_","last_","newStats","delta","app_1","VisibilityMonitor_1","OnlineMonitor_1","Connection_1","ServerActions_1","RECONNECT_MIN_DELAY","RECONNECT_MAX_DELAY_DEFAULT","authTokenProvider_","authOverride_","nextPersistentConnectionId_","interruptReasons_","listens_","outstandingPuts_","outstandingPutCount_","onDisconnectRequestQueue_","connected_","reconnectDelay_","maxReconnectDelay_","securityDebugCallback_","lastSessionId","establishConnectionTimer_","visible_","requestCBHash_","requestNumber_","realtime_","authToken_","forceTokenRefresh_","invalidAuthTokenCount_","firstConnection_","lastConnectionAttemptTime_","lastConnectionEstablishedTime_","scheduleConnect_","VisibilityMonitor","onVisible_","OnlineMonitor","onOnline_","sendRequest","onResponse","curReqNum","msg","r","isDefault","listenSpec","hashFn","sendListen_","req","payload","warnOnListenWarnings_","removeListen_","warnings","indexSpec","indexPath","tryAuth","reduceReconnectDelayIfAdminCredential_","credential","isAdmin","token_1","authMethod","isValidFormat","requestData","onAuthRevoked_","sendUnlisten_","queryObj","sendOnDisconnect_","request","response","putInternal","sendPut_","queued","reportStats","onDataMessage_","reqNum","onDataPush_","onListenRevoked_","onSecurityDebugPacket_","onReady_","sessionId","handleTimestamp_","sendConnectStats_","restoreState_","establishConnection_","visible","online","onRealtimeDisconnect_","cancelSentTransactions_","shouldReconnect_","timeSinceLastConnectSucceeded","timeSinceLastConnectAttempt","reconnectDelay","onDataMessage_1","onReady_1","connId_1","nextConnectionId_","lastSessionId_1","canceled_1","connection_1","closeFn_1","sendRequestFn","forceRefresh","getToken","accessToken","Connection","serverTimeOffset","q","normalizedPathString","statusCode","explanation","notifyForInvalidToken","queries","clientName","isMobileCordova","isReactNative","currentlyOnline","ServerActions","EventEmitter","allowedEvents_","listeners_","trigger","validateEventType_","eventData","getInitialEvent","et","TransportManager_1","onMessage_","onKill_","connectionCount","pendingDataMessages","state_","transportManager_","TransportManager","start_","conn","initialTransport","conn_","nextTransportId_","primaryResponsesRequired_","onMessageReceived","connReceiver_","onConnectionLost","disconnReceiver_","tx_","rx_","secondaryConn_","isHealthy_","open","healthyTimeout_ms","healthyTimeout_","bytesReceived","markConnectionHealthy","bytesSent","everConnected","onConnectionLost_","onSecondaryConnectionLost_","onPrimaryMessageReceived_","onSecondaryMessageReceived_","dataMsg","sendData_","tryCleanupConnection","connId","onSecondaryControl_","controlData","cmd","upgradeIfSecondaryHealthy_","secondaryResponsesRequired_","parsedData","layer","proceedWithUpgrade_","send","start","onControl_","onPrimaryResponse_","onHandshake_","onConnectionShutdown_","onReset_","sendPingOnPrimaryIfNecessary_","handshake","ts","onConnectionEstablished_","tryStartUpgrade_","upgradeTransport","startUpgrade_","onMessage","closeConnections_","PacketReceiver_1","FIREBASE_LONGPOLL_START_PARAM","FIREBASE_LONGPOLL_CLOSE_COMMAND","FIREBASE_LONGPOLL_COMMAND_CB_NAME","FIREBASE_LONGPOLL_DATA_CB_NAME","FIREBASE_LONGPOLL_ID_PARAM","FIREBASE_LONGPOLL_PW_PARAM","FIREBASE_LONGPOLL_SERIAL_PARAM","FIREBASE_LONGPOLL_CALLBACK_ID_PARAM","FIREBASE_LONGPOLL_SEGMENT_NUM_PARAM","FIREBASE_LONGPOLL_SEGMENTS_IN_PACKET","FIREBASE_LONGPOLL_DATA_PARAM","FIREBASE_LONGPOLL_DISCONN_FRAME_PARAM","FIREBASE_LONGPOLL_DISCONN_FRAME_REQUEST_PARAM","BrowserPollConnection","transportSessionId","everConnected_","urlFn","curSegmentNum","myPacketOrderer","PacketReceiver","isClosed_","connectTimeoutTimer_","onClosed_","scriptTagHolder","FirebaseIFrameScriptHolder","command","arg1","arg2","incrementIncomingBytes_","password","sendNewPolls","closeAfter","pN","handleResponse","urlParams","uniqueCallbackIdentifier","connectURL","addTag","startLongPoll","addDisconnectPingFrame","forceAllow","forceAllow_","forceDisallow","forceDisallow_","isAvailable","shutdown_","myDisconnFrame","dataStr","base64data","MAX_URL_DATA_SIZE","enqueueSegment","pw","src","display","commandCB","onMessageCB","outstandingRequests","pendingSegs","currentSerial","myIFrame","createIFrame_","iframeContents","write","iframe","contentWindow","contentDocument","alive","myID","myPW","theURL","nodeRestRequest","newRequest_","curDataString","theSeg","seg","addLongPollTag_","segnum","totalsegs","serial","doNewRequest","keepaliveTimeout","readyStateCB","loadCB","doNodeLongPoll","newScript_1","onload","rstate","onerror","setWebSocketImpl","impl","WebSocketImpl","MozWebSocket","WebSocket","WebSocketConnection","keepaliveTimer","frames","totalFrames","connectionURL_","device","headers","User-Agent","platform","proxy","origin","mySock","onopen","onclose","handleIncomingFrame","isOldAndroid","userAgent","oldAndroidRegex","oldAndroidMatch","match","previouslyFailed","isInMemoryStorage","appendFrame_","fullMess","jsonMess","handleNewFrameCount_","frameCount","extractFrameCount_","mess","resetKeepAlive","remainingData","sendString_","responsesRequiredToBeHealthy","healthyTimeout","IndexedFilter_1","RangedFilter","indexedFilter_","startPost_","getStartPost_","endPost_","getEndPost_","getStartPost","getEndPost","matches","startName","endName","preloadedState","dataset","clientId","showResult","resultMessage","AppComponent","_LivePollWidget","LivePollWidget","_domready","_domready2","_init","_devtools","_promisePolyfill","_promisePolyfill2","getBaseColorClass","skin","_LivePollWidget2","_LivePoll","_WithVotingState","_WithPollState","_WithResultState","_AriaLive","_alternativeUtils","_debounce","_pureComponents","_PureComponent","debouncedResize","rootEl","breakpoint","handleResize","debounce","offsetWidth","renderWithPollState","loadPollError","poll","loading","_this$props","livePollWidget","handleRetryButtonClicked","WithVotingState","renderWithVotingState","vote","voteError","onRegisterVote","isDisplayVoteConfirmedMessage","_this$props2","resultState","WithResultState","renderWithResultState","rest","resultError","lastUpdatedTime","_this$props3","LivePoll","AriaLive","alternativeIdToAlternativeText","alternatives","WithPollState","livePollWidget--medium","livePollWidget--large","livePollWidget--extra-large","livePollWidget--theme-monsen","livePollWidget--theme-sport","livePollWidget--theme-sport-inverted-gray","_LivePoll2","_AlternativeList","_LastUpdatedTime","_LiveResult","livePoll","livePoll__header","livePoll__title","livePoll__content","AlternativeList","onAlternativeClicked","LiveResult","livePoll__footer","LastUpdatedTime","livePoll--medium","livePoll--large","livePoll--extra-large","isLastItem","_AlternativeList2","_Alternative","alternativesItems","acc","alternative","currentMaxTextLength","fullWidthMobile","oddEven","two","alternativeList","alternativeList__item","Alternative","totalAlternativesCount","alternativeList--full-width","alternativeList--small","alternativeList--extra-small","alternativeList__item--full-width","alternativeList--medium","alternativeList--large","alternativeList--extra-large","_Alternative2","handleAlternativeClicked","alternative--extra-small","alternative--part-of-odd-list","alternative--last-item","alternative--medium","alternative--large","alternative--extra-large","_interopRequireDefault","_difference_in_seconds2","shouldShow","_LastUpdatedTime2","_distance_in_words2","includeSeconds","locale","_distance_in_words","_difference_in_seconds","_nb","_nb2","distanceInWords","dirtyDateToCompare","dirtyDate","comparison","compareDesc","localize","enLocale","dateLeft","dateRight","localizeOptions","addSuffix","months","MINUTES_IN_DAY","MINUTES_IN_ALMOST_TWO_DAYS","MINUTES_IN_MONTH","MINUTES_IN_TWO_MONTHS","differenceInMonths","monthsSinceStartOfYear","years","timeLeft","timeRight","sign","compareAsc","difference","differenceInCalendarMonths","setMonth","getMonth","getFullYear","buildDistanceInWordsLocale","buildFormatLocale","format","distanceInWordsLocale","one","lessThanXSeconds","xSeconds","halfAMinute","lessThanXMinutes","xMinutes","aboutXHours","xHours","xDays","aboutXMonths","xMonths","aboutXYears","xYears","overXYears","almostXYears","months3char","monthsFull","weekdays2char","weekdays3char","weekdaysFull","meridiemUppercase","meridiemLowercase","meridiemFull","MMM","MMMM","dd","getDay","ddd","dddd","A","getHours","aa","formatterToken","ordinal","formattingTokensRegExp","rem100","lastUpdatedTime--invisible","getHighlightedResultItemId","_cookieUtils","_LiveResult2","_props$showResult","_props$resultMessage","viewBox","fill","stroke","stroke-linecap","stroke-linejoin","stroke-width","live-result","live-result__paragraph","live-result__check","live-result--theme-sport","live-result--theme-sport-inverted","live-result--theme-monsen","_asyncToGenerator","gen","step","_createVote","_registerVote","_initialiseProps","nextProps","handleRegisterVote","_callee","errorMessage","createVote","registerVote","t0","_x","_firebase","credentials","pollVotesRef","voted","auth","signInAnonymously","uid","channelId","_x2","__global","findIndex","removeApp","callAppHooks","apps_","DEFAULT_ENTRY_NAME","FirebaseAppImpl","getApps","registerService","createService","serviceProperties","appHook","allowMultipleInstances","factories","appHooks","serviceNamespace","appArg","_util","deepExtend","_getService","extendNamespace","eventName","serviceName","factoryName","useAsService","useService","apps","createSubscribe","ErrorFactory","patchProperty","appErrors","tokenListeners","firebase_","isDeleted_","services_","name_","options_","deepCopy","getUid","addAuthTokenListener","removeAuthTokenListener","checkDestroyed_","services","serviceKey","instanceKey","service","instanceIdentifier","instanceSpecifier","extendApp","errors","no-app","bad-app-name","duplicate-app","app-deleted","duplicate-service","sa-not-supported","invalid-app-argument","dateValue","prop","getUA","patchCapture","captureFake","captureStackTrace","ERROR_NAME","FirebaseError","err_1","pattern","template","fullCode","crypt_1","json_1","decode","header","claims","signature","isValidTimestamp","validSince","validUntil","issuedAtTime","decoded","obj_1","querystring","querystringParams","arrayVal","querystringDecode","hash_1","chain_","buf_","W_","pad_","inbuf_","total_","blockSize","compress_","buf","opt_offset","W","opt_length","lengthMinusBlock","inbuf","totalBits","Hash","executor","onNoObservers","ObserverProxy","subscribe","onError","implementsAnyMethods","methods","methods_1","observers","unsubscribes","observerCount","finalized","forEachObserver","observer","nextOrObserver","unsub","unsubscribeOne","finalError","sendOne","argName","validateNamespace","minCount","maxCount","argCount","argError","assert_1","registerDatabase","unused","TEST_ACCESS","DataSnapshot_1","domStorage_","prefix_","prefixedName_","storedVal","getItem","cache_","PUSH_CHARS","lastPushTime","lastRandChars","duplicateTime","timeStampChars","Event_1","callback_","cancelCallback_","context_","respondsTo","createEvent","change","DataEvent","getEventRunner","ctx","getEventType","cancelCB_1","cb_1","createCancelEvent","CancelEvent","hasAnyCallback","callbacks_","eventToCheck","cancelCB_2","cb_2","otherCount","otherKey","thisKey","getPath","AckUserWrite_1","ImmutableTree_1","ListenComplete_1","Merge_1","Overwrite_1","WriteTree_1","listenProvider_","syncPointTree_","pendingWriteTree_","WriteTree","tagToQueryMap_","queryToTagMap_","newData","addOverwrite","applyOperationToSyncPoints_","addMerge","changeTree","Merge","revert","getWrite","removeWrite","affectedTree_1","AckUserWrite","applyListenComplete","ListenComplete","queryKey","queryKeyForTag_","parseQueryKey_","queryPath","op","applyTaggedOperation_","applyTaggedListenComplete","foundAncestorDefaultView","pathToSyncPoint","sp","syncPoint","childSyncPoint","completeCache","viewAlreadyExists","makeQueryKey_","getNextQueryTag_","childWrites","setupListener_","maybeSyncPoint","removedAndEvents","removingDefault","covered","parentSyncPoint","newViews","collectDistinctViewsForSubTree_","newQuery","createListenerForView_","queryForListening_","tagForQuery_","queryToRemove","tagToRemove","removeTags_","writeIdsToExclude","writeTree","maybeChildSyncPoint","childMap","views_1","childViews","removedQuery","removedQueryKey","removedQueryTag","queriesToStop","queries_1","childQueries","queryToStop","splitIndex","nextQueryTag_","applyOperationHelper_","syncPointTree","applyOperationDescendantsHelper_","childOperation","childServerCache","childWritesCache","affectedTree","ACK_USER_WRITE","LISTEN_COMPLETE","MERGE","ViewProcessor_1","EventGenerator_1","query_","initialViewCache","eventRegistrations_","indexFilter","getNodeFilter","processor_","ViewProcessor","initialServerCache","initialEventCache","newServerCache","newEventCache","viewCache_","eventGenerator_","EventGenerator","cache","path_1","registration","maybeEvent","existing","completeServerCache","oldViewCache","assertIndexed","generateEventsForChanges_","changes","initialChanges","registrations","generateEventsForChanges","ChildChangeAccumulator_1","CompleteChildSource_1","ProcessorResult","filter_","newViewCache","filterServerNode","accumulator","ChildChangeAccumulator","overwrite","applyUserOverwrite_","applyServerOverwrite_","applyUserMerge_","applyServerMerge_","revertUserWrite_","ackUserWrite_","listenComplete_","getChanges","maybeAddValueEvent_","isLeafOrEmpty","oldCompleteSnap","generateEventCacheAfterServerEvent_","changePath","oldEventSnap","shadowingWrite","serverNode","completeChildren","completeEventChildren","completeNode","oldEventNode","updatedPriority","calcEventCacheAfterServerOverwrite","childChangePath","newEventChild","eventChildUpdate","calcCompleteChild","changedSnap","oldServerSnap","serverFilter","newServerNode","NO_COMPLETE_CHILD_SOURCE","WriteTreeCompleteChildSource","getCompleteChild","newEventSnap","cacheHasChild_","curViewCache","writePath","applyMerge_","viewMergeTree","serverChild","childMergeTree","isUnknownDeepMerge","ackPath","changedChildren_1","changedChildren_2","mergePath","serverCachePath","oldServerNode","oldEventCache","serverChildren","changeMap_","oldChange","oldType","NoCompleteChildSource_","getChildAfterChild","writes_","optCompleteServerCache_","completeServerData","nodes","calcIndexedSlice","eventRegistrations","moves","generateEventsForType_","filteredChanges","compareChanges_","materializedChange","materializeSingleChange_","aWrapped","bWrapped","CompoundWrite_1","visibleWrites_","CompoundWrite","allWrites_","lastWriteId_","WriteTreeRef","addWrite","addWrites","writeToRemove","removedWriteWasVisible","removedWriteOverlapsWithOtherWrites","currentWrite","recordContainsPath_","resetTree_","getCompleteWriteData","getCompleteNode","treePath","includeHiddenWrites","childCompoundWrite","hasCompleteWrite","mergeAtPath","layerTree_","layeredCache","shadowingNode","subMerge","completeServerChildren","topLevelSet","merge_1","getCompleteChildren","existingEventSnap","existingServerSnap","childMerge","toIterate","writeRecord","DefaultFilter_","writes","treeRoot","compoundWrite","deepNode","treePath_","writeTree_","existingServerCache","rootmost","rootMostPath","newWrite","applySubtreeWrite_","priorityWrite_1","rootNode_","newSnapshotNode","app_","removeTokenChangeListener","counters_","amount","FIRST_STATS_MIN_TIME","FIRST_STATS_MAX_TIME","collection","statsToReport_","reportStats_","reportedStats","haveStatsToReport","eventLists_","recursionDepth_","eventDataList","currList","eventPath","EventList","raiseQueuedEventsMatchingPredicate_","sentAll","eventList","raise","events_","eventFn","EventEmitter_1","visibilityChange","online_","BrowserPollConnection_1","WebSocketConnection_1","initTransports_","isWebSocketsAvailable","isSkipPollConnection","transports_","transports_1","ALL_TRANSPORTS","transport","pendingResponses","currentResponseNum","closeAfterResponse","onClose","responseNum","requestNum","this_1","toProcess","getListenId_","listenId","thisListen","queryStringParamaters","toRestQueryStringParameters","restRequest_","status_1","queryStringParameters","authTokenData","authToken","xhr","XMLHttpRequest","responseText","LimitedFilter_1","RangedFilter_1","limitSet_","startSet_","startNameSet_","endSet_","endNameSet_","limit_","viewFrom_","indexStartValue_","indexStartName_","indexEndValue_","indexEndName_","isViewFromLeft","WIRE_PROTOCOL_CONSTANTS_","VIEW_FROM_LEFT","getLimit","copy_","newLimit","VIEW_FROM_RIGHT","WIRE_PROTOCOL_CONSTANTS","INDEX_START_VALUE","INDEX_START_NAME","INDEX_END_VALUE","INDEX_END_NAME","LIMIT","viewFrom","VIEW_FROM","INDEX","LimitedFilter","REST_CONSTANTS","REST_QUERY_CONSTANTS_","qs","ORDER_BY","START_AT","END_AT","LIMIT_TO_FIRST","LIMIT_TO_LAST","rangedFilter_","reverse_","fullLimitUpdateChild_","inRange","indexCompare_1","foundStartPost","changeAccumulator","indexCmp_1","newChildNamedNode","windowBoundary","oldChildSnap","compareNext","TransactionStatus","Tree_1","MAX_TRANSACTION_RETRIES_","transactionQueueTree_","Tree","watchRef","unwatcher","order","retryCount","abortReason","currentWriteId","currentInputSnapshot","currentOutputSnapshotRaw","currentOutputSnapshotResolved","currentState","getLatestState_","RUN","queueNode","subTree","nodeQueue","setValue","priorityForNode","sendReadyTransactions_","excludeSets","pruneCompletedTransactionsBelowNode_","buildTransactionQueue_","sendTransactionQueue_","setsToIgnore","txn","latestState","snapToSend","latestHash","SENT","dataToSend","pathToSend","COMPLETED","SENT_NEEDS_ABORT","NEEDS_ABORT","rootMostTransactionNode","getAncestorTransactionNode_","rerunTransactionQueue_","txnsToRerun","abortTransaction","currentNode","newDataNode","hasExplicitPriority","oldWriteId","newNodeResolved","lastInput","transactionNode","transactionQueue","aggregateTransactionQueuesForNode_","to","forEachAncestor","abortTransactionsOnNode_","forEachDescendant","lastSent","TreeNode","childCount","parent_","pathObj","updateParents_","includeSelf","childrenFirst","forEachImmediateDescendantWithValue","updateChild_","childEmpty","childExists","forceLongPolling","forceWebSockets","setSecurityDebugCallback","interceptServerData","DataConnection","simpleListen","echo","onEcho","RealTimeConnection","hijackHash","newHash","oldPut","opt_onComplete","opt_hash","ConnectionTarget","listens","firebaseRef","ba","ca","da","propertyIsEnumerable","ea","fa","ha","ka","la","ma","ib","Nc","u","oa","qa","ra","sa","ta","ua","va","wa","xa","ya","za","Aa","Ca","Fa","Ga","Ha","Ba","Ia","Ja","Ka","La","Ma","Pa","Qa","Ra","Sa","Ta","Ua","Wa","Va","Xa","Ya","Za","eb","documentMode","jb","pa","fb","mb","$goog_Thenable","nb","ob","pb","sb","tb","qb","ub","xb","yb","zb","Ab","Bb","rb","Cb","Window","wb","z","Db","Eb","Fb","Gb","Hb","Ib","Kb","Jb","B","Lb","Mb","Nb","Ob","Qb","Rb","Sb","Tb","Ub","Vb","Pb","D","wc","xc","Wb","Xb","Yb","Zb","ac","bc","cc","dc","ec","gc","hc","ic","jc","kc","lc","mc","nc","pc","ja","oc","qc","rc","sc","uc","vc","getElementById","htmlFor","yc","lastIndexOf","zc","$b","Ac","nodeType","w","Bc","Cc","Dc","Ec","Fc","valueOf","isFinite","Hc","Gc","Ic","Jc","Kc","ia","Lc","C","Qc","relatedTarget","screenY","screenX","clientY","clientX","metaKey","shiftKey","altKey","ctrlKey","pointerId","pointerType","changedTouches","srcElement","fromElement","toElement","pageX","pageY","Rc","defaultPrevented","Uc","capture","Tc","Vc","Wc","Xc","Yc","Zc","cd","ed","Sc","fd","gd","hd","$c","Pc","jd","bd","kd","ld","E","md","detachEvent","ad","nd","od","keyCode","returnValue","pd","handleEvent","F","G","qd","rd","sd","td","vd","wd","Ad","Dd","Cd","Bd","yd","Ed","P","Fd","Gd","H","zd","Hd","Da","Kd","Ld","Jd","Md","Id","Nd","Qd","Rd","Pd","Sd","Td","Ud","Vd","Ea","Wd","Xd","Od","Yd","Zd","$d","Uint8Array","Int32Array","ae","be","ge","vb","tc","Bj","he","ie","je","ke","le","me","oe","pe","qe","re","se","te","ne","ue","Ae","ve","Be","I","Ce","De","Ee","decodeURI","encodeURI","Fe","Ge","He","Ie","Je","Ke","Le","Me","Ne","Oe","Qe","Re","ActiveXObject","Se","Te","N","Ye","Pe","J","Ze","$e","FormData","Xe","setRequestHeader","responseType","withCredentials","af","bf","ontimeout","abort","cf","df","ef","ff","gf","We","statusText","xd","hf","kf","lf","mf","nf","of","Oc","pf","charset","qf","getElementsByTagName","tagName","rf","sf","XDomainRequest","responseXML","onprogress","tf","uf","kb","vf","wf","xf","yf","zf","Af","Bf","Cf","Df","screen","availHeight","availWidth","top","resizable","statusbar","toolbar","Ef","scrollbars","standalone","noreferrer","initMouseEvent","dispatchEvent","bb","opener","focus","Ff","closed","Hf","If","Jf","Kf","Lf","K","Mf","Of","Nf","Pf","localStorage","Qf","indexedDB","Rf","Sf","Tf","Uf","Vf","Wf","Xf","Yf","___jsl","CP","Zf","onLine","connection","$f","ag","visibilityState","bg","cg","eg","gg","hg","ig","jg","kg","lg","mg","ng","og","pg","qg","rg","sg","tg","ug","vg","wg","xg","yg","zg","Ag","Bg","Cg","Dg","Eg","Fg","continueUrl","canHandleCodeInApp","androidPackageName","androidMinimumVersion","androidInstallApp","iOSBundleId","Gg","sub","na","provider_id","sign_in_provider","Hg","iss","aud","exp","Lg","Kg","Na","Mg","Ng","Og","Pg","Qg","Rg","Sg","Tg","Ug","isNewUser","rawUserInfo","providerId","profile","login","screenName","Vg","O","Wg","idToken","oauthToken","oauthTokenSecret","Yg","id_token","access_token","secret","oauth_token_secret","postBody","requestUri","ah","isOAuthProvider","Jg","bh","ch","dh","eh","fh","gh","hh","Ig","ih","jh","mh","nh","Oa","Y","oh","temporaryProof","phoneNumber","sessionInfo","rh","th","uh","oauthAccessToken","oauthIdToken","vh","wh","xh","eventId","urlResponse","yh","zh","Ah","email","Bh","Ch","secureTokenEndpoint","secureTokenTimeout","Dh","secureTokenHeaders","Eh","firebaseEndpoint","firebaseTimeout","Fh","firebaseHeaders","Gh","Ih","Jh","Kh","Hh","Lh","gapi","client","Nh","Mh","Oh","grant_type","refresh_token","Ph","Qh","Rh","jf","Sh","Th","Q","Uh","identifier","continueUri","allProviders","Vh","Wh","authorizedDomains","Xh","Yh","sh","di","fi","gi","deleteProvider","hi","ii","needConfirmation","ji","Xg","returnIdpCredential","ki","Zg","li","$g","autoCreate","mi","ni","oobCode","T","returnSecureToken","endpoint","ga","keyInvalid","ipRefererBlocked","INVALID_CUSTOM_TOKEN","CREDENTIAL_MISMATCH","MISSING_CUSTOM_TOKEN","INVALID_IDENTIFIER","MISSING_CONTINUE_URI","INVALID_EMAIL","INVALID_PASSWORD","USER_DISABLED","MISSING_PASSWORD","EMAIL_EXISTS","PASSWORD_LOGIN_DISABLED","INVALID_IDP_RESPONSE","FEDERATED_USER_ID_ALREADY_LINKED","INVALID_MESSAGE_PAYLOAD","INVALID_RECIPIENT_EMAIL","INVALID_SENDER","EMAIL_NOT_FOUND","EXPIRED_OOB_CODE","INVALID_OOB_CODE","MISSING_OOB_CODE","CREDENTIAL_TOO_OLD_LOGIN_AGAIN","INVALID_ID_TOKEN","TOKEN_EXPIRED","USER_NOT_FOUND","CORS_UNSUPPORTED","DYNAMIC_LINK_NOT_ACTIVATED","INVALID_APP_ID","TOO_MANY_ATTEMPTS_TRY_LATER","WEAK_PASSWORD","OPERATION_NOT_ALLOWED","USER_CANCELLED","CAPTCHA_CHECK_FAILED","INVALID_APP_CREDENTIAL","INVALID_CODE","INVALID_PHONE_NUMBER","INVALID_SESSION_INFO","INVALID_TEMPORARY_PROOF","MISSING_APP_CREDENTIAL","MISSING_CODE","MISSING_PHONE_NUMBER","MISSING_SESSION_INFO","QUOTA_EXCEEDED","SESSION_EXPIRED","INVALID_CONTINUE_URI","MISSING_ANDROID_PACKAGE_NAME","MISSING_IOS_BUNDLE_ID","UNAUTHORIZED_DOMAIN","INVALID_OAUTH_CLIENT_ID","INVALID_CERT_HASH","xi","wi","ab","zi","Ai","Bi","where","messageHandlersFilter","position","dontclear","restyle","setHideOnLeave","Ci","ping","Di","Ei","register","Hi","Gi","Fi","Ii","Ji","Ki","Li","Mi","Gf","Ni","Oi","Qi","Ri","authEvent","Pi","webStorageSupport","Si","reactNative","AsyncStorage","Ti","Ui","Wi","errorCode","onupgradeneeded","createObjectStore","keyPath","onsuccess","Xi","Yi","objectStore","Zi","$i","aj","bj","cj","dj","ej","fj","gj","hj","sessionStorage","ij","Browser","jj","Node","kj","ReactNative","lj","oj","nj","pj","mj","Vi","rj","qj","sj","tj","uj","X","vj","wj","xj","yj","zj","Aj","oldValue","Cj","Ej","Dj","Fj","Gj","Hj","Ij","Jj","fe","Lj","ibi","apn","appDisplayName","Nj","Kj","Oj","Mj","handleOpenURL","Pj","Rj","Qj","Sj","Tj","Uj","Vj","Wj","unknown","signInViaRedirect","linkViaRedirect","reauthViaRedirect","signInViaPopup","linkViaPopup","reauthViaPopup","Xj","yi","Yj","Zj","ak","bk","ek","gk","fk","hk","ik","jk","kk","user","lk","dk","mk","nk","ok","pk","rk","qk","sk","tk","uk","refreshToken","vk","expiresIn","wk","expires_in","expirationTime","xk","lastSignInTime","creationTime","yk","zk","photoURL","Ak","Bk","apiKey","authDomain","Ck","Dk","Ek","U","R","Fk","V","Gk","Hk","Ik","Jk","Kk","Lk","Mk","Nk","emailVerified","isAnonymous","metadata","createdAt","lastLoginAt","providerData","Ok","Pk","Qk","Rk","Sk","Tk","Uk","Vk","Wk","Xk","ti","Yk","providerUserInfo","rawId","photoUrl","$k","Zk","additionalUserInfo","operationType","al","bl","cl","dl","Z","fl","gl","hl","stsTokenManager","redirectEventId","il","jl","kl","ll","ml","ol","pl","ql","rl","sl","tl","ul","vl","wl","xl","yl","logFramework","zl","Al","Bl","$","Cl","Dl","El","Fl","Gl","currentUser","Il","_lat","Hl","Jl","Kl","Ll","Ml","Nl","Ol","Element","Pl","Ql","App","Rl","Sl","Tl","verify","Ul","Vl","Wl","hasChildNodes","Xl","Yl","Zl","$l","am","dm","fm","grecaptcha","bm","em","cm","gm","hm","im","jm","some","$a","db","gb","hb","lb","compatMode","cellpadding","cellspacing","colspan","frameborder","maxlength","nonce","rowspan","usemap","valign","\"","\\","/","\b","\f","\n","\r","\t","\u000b","Mc","freeze","2","3","4","preventDefault","ud","timeStamp","msWriteProfilerMark","ce","de","ee","we","xe","ye","ze","Ue","Ve","getResponse","mozResponseArrayBuffer","getResponseHeader","contentType","getAllResponseHeaders","dg","fg","abcd","argument-error","app-not-authorized","app-not-installed","captcha-check-failed","code-expired","cordova-not-ready","cors-unsupported","credential-already-in-use","custom-token-mismatch","requires-recent-login","dynamic-link-not-activated","email-already-in-use","expired-action-code","cancelled-popup-request","internal-error","invalid-app-credential","invalid-app-id","invalid-user-token","invalid-auth-event","invalid-verification-code","invalid-continue-uri","invalid-cordova-configuration","invalid-custom-token","invalid-email","invalid-api-key","invalid-cert-hash","invalid-credential","invalid-persistence-type","invalid-message-payload","invalid-oauth-provider","invalid-oauth-client-id","unauthorized-domain","invalid-action-code","wrong-password","invalid-phone-number","invalid-recipient-email","invalid-sender","invalid-verification-id","missing-android-pkg-name","auth-domain-config-required","missing-app-credential","missing-verification-code","missing-continue-uri","missing-iframe-start","missing-ios-bundle-id","missing-phone-number","missing-verification-id","account-exists-with-different-credential","network-request-failed","no-auth-event","no-such-provider","operation-not-allowed","operation-not-supported-in-this-environment","popup-blocked","popup-closed-by-user","provider-already-linked","quota-exceeded","redirect-cancelled-by-user","redirect-operation-pending","user-token-expired","too-many-requests","unauthorized-continue-uri","unsupported-persistence-type","user-cancelled","user-not-found","user-disabled","user-mismatch","user-signed-out","weak-password","web-storage-unsupported","kh","lh","PROVIDER_ID","ph","qh","verificationId","verificationCode","recaptchaToken","Content-Type","setApiKey","setToken","authType","Zh","$h","ai","deleteAttribute","requestType","bi","ci","ei","oi","newPassword","pi","qi","ri","si","ui","recaptchaSiteKey","vi","getAll","openCursor","NONE","unsubscribe","ck","confirm","users","localId","passwordHash","languages","language","userLanguage","execute","Persistence","LOCAL","SESSION","Auth","_pollUtils","subscribeToPollChanges","firebaseInteractions","firebaseActivePolls","extractActivePolls","currentPoll","preparePoll","interactions","interaction","_prepareResult","getStateBasedOnProps","prepareResult","aria-live","getTextFromAlternative","getAlternativeFromId","getAlternativesFromPoll","wait","immediate","later","callNow"],"mappings":"CAAS,SAAUA,GCInB,QAAAC,GAAAC,GAGA,GAAAC,EAAAD,GACA,MAAAC,GAAAD,GAAAE,OAGA,IAAAC,GAAAF,EAAAD,IACAI,EAAAJ,EACAK,GAAA,EACAH,WAUA,OANAJ,GAAAE,GAAAM,KAAAH,EAAAD,QAAAC,IAAAD,QAAAH,GAGAI,EAAAE,GAAA,EAGAF,EAAAD,QAvBA,GAAAD,KA4BAF,GAAAQ,EAAAT,EAGAC,EAAAS,EAAAP,EAGAF,EAAAU,EAAA,SAAAP,EAAAQ,EAAAC,GACAZ,EAAAa,EAAAV,EAAAQ,IACAG,OAAAC,eAAAZ,EAAAQ,GACAK,cAAA,EACAC,YAAA,EACAC,IAAAN,KAMAZ,EAAAmB,EAAA,SAAAf,GACA,GAAAQ,GAAAR,KAAAgB,WACA,WAA2B,MAAAhB,GAAA,SAC3B,WAAiC,MAAAA,GAEjC,OADAJ,GAAAU,EAAAE,EAAA,IAAAA,GACAA,GAIAZ,EAAAa,EAAA,SAAAQ,EAAAC,GAAsD,MAAAR,QAAAS,UAAAC,eAAAjB,KAAAc,EAAAC,IAGtDtB,EAAAyB,EAAA,uDAGAzB,IAAA0B,EAAA,ODMM,SAAUtB,EAAQD,EAASH,GAEjC,YErDA,SAAS2B,GAASnB,GACd,IAAK,GAAIiB,KAAKjB,GAAQL,EAAQqB,eAAeC,KAAItB,EAAQsB,GAAKjB,EAAEiB,IAEpEX,OAAOC,eAAeZ,EAAS,cAAgByB,OAAO,IACtDD,EAAS3B,EAAQ,KACjB2B,EAAS3B,EAAQ,KACjB2B,EAAS3B,EAAQ,KACjB2B,EAAS3B,EAAQ,MACjB2B,EAAS3B,EAAQ,MACjB2B,EAAS3B,EAAQ,MACjB2B,EAAS3B,EAAQ,MACjB2B,EAAS3B,EAAQ,KACjB2B,EAAS3B,EAAQ,MACjB2B,EAAS3B,EAAQ,KACjB2B,EAAS3B,EAAQ,MACjB2B,EAAS3B,EAAQ,MACjB2B,EAAS3B,EAAQ,MACjB2B,EAAS3B,EAAQ,MACjB2B,EAAS3B,EAAQ,OF+EX,SAAUI,EAAQD,EAASH,GAEjC,YGlHA,SAAS6B,MAuCT,QAASC,GAAEC,EAAUC,GACpB,GACIC,GACAC,EACAC,EACA9B,EAJA+B,EAAWC,CAKf,KAAKhC,EAAIiC,UAAUC,OAAQlC,KAAM,GAChCmC,EAAMC,KAAKH,UAAUjC,GAMtB,KAJI2B,GAAqC,MAAvBA,EAAWI,WACvBI,EAAMD,QAAQC,EAAMC,KAAKT,EAAWI,gBAClCJ,GAAWI,UAEZI,EAAMD,QACZ,IAAKL,EAAQM,EAAME,YAAwBC,KAAdT,EAAMQ,IAClC,IAAKrC,EAAI6B,EAAMK,OAAQlC,KACtBmC,EAAMC,KAAKP,EAAM7B,QAGG,iBAAV6B,KAAqBA,EAAQ,OAEpCC,EAA6B,kBAAbJ,MACN,MAATG,EAAeA,EAAQ,GAA6B,gBAAVA,GAAoBA,EAAQU,OAAOV,GAAiC,gBAAVA,KAAoBC,GAAS,IAGlIA,GAAUF,EACbG,EAASA,EAASG,OAAS,IAAML,EACvBE,IAAaC,EACvBD,GAAYF,GAEZE,EAASK,KAAKP,GAGfD,EAAaE,CAIf,IAAIV,GAAI,GAAII,EASZ,OARAJ,GAAEM,SAAWA,EACbN,EAAEW,SAAWA,EACbX,EAAEO,WAA2B,MAAdA,MAAqBW,GAAYX,EAChDP,EAAEoB,IAAoB,MAAdb,MAAqBW,GAAYX,EAAWa,QAG9BF,KAAlBG,EAAQC,OAAqBD,EAAQC,MAAMtB,GAExCA,EAOR,QAASuB,GAAOC,EAAKC,GACnB,IAAK,GAAI7C,KAAK6C,GACZD,EAAI5C,GAAK6C,EAAM7C,EAChB,OAAO4C,GAQV,QAASE,GAAaJ,EAAOG,GAC5B,MAAOpB,GAAEiB,EAAMhB,SAAUiB,EAAOA,KAAWD,EAAMf,YAAakB,GAAQZ,UAAUC,OAAS,KAAOa,MAAM7C,KAAK+B,UAAW,GAAKS,EAAMX,UAUlI,QAASiB,GAAcC,IACjBA,EAAUC,SAAWD,EAAUC,QAAS,IAAkC,GAAzBC,EAAMf,KAAKa,KAC/DR,EAAQW,mBAAqBC,GAAOC,GAIvC,QAASA,KACR,GAAIlC,GACAmC,EAAOJ,CAEX,KADAA,KACO/B,EAAImC,EAAKlB,OACXjB,EAAE8B,QAAQM,EAAgBpC,GAShC,QAASqC,GAAeC,EAAMhB,EAAOiB,GACpC,MAAqB,gBAAVjB,IAAuC,gBAAVA,OACbJ,KAAnBoB,EAAKE,UAEiB,gBAAnBlB,GAAMhB,UACRgC,EAAKG,uBAAyBC,EAAYJ,EAAMhB,EAAMhB,UAExDiC,GAAaD,EAAKG,wBAA0BnB,EAAMhB,SAO1D,QAASoC,GAAYJ,EAAMhC,GAC1B,MAAOgC,GAAKK,qBAAuBrC,GAAYgC,EAAKhC,SAASsC,gBAAkBtC,EAASsC,cAUzF,QAASC,GAAavB,GACrB,GAAIG,GAAQF,KAAWD,EAAMf,WAC7BkB,GAAMd,SAAWW,EAAMX,QAEvB,IAAImC,GAAexB,EAAMhB,SAASwC,YAClC,QAAqB5B,KAAjB4B,EACH,IAAK,GAAIlE,KAAKkE,OACI5B,KAAbO,EAAM7C,KACT6C,EAAM7C,GAAKkE,EAAalE,GAK3B,OAAO6C,GAQR,QAASsB,GAAWzC,EAAU0C,GAC7B,GAAIV,GAAOU,EAAQC,SAASC,gBAAgB,6BAA8B5C,GAAY2C,SAASE,cAAc7C,EAE7G,OADAgC,GAAKK,mBAAqBrC,EACnBgC,EAMR,QAASc,GAAWd,GACnB,GAAIe,GAAaf,EAAKe,UAClBA,IAAYA,EAAWC,YAAYhB,GAYxC,QAASiB,GAAYjB,EAAMpD,EAAMsE,EAAKrD,EAAO6C,GAG5C,GAFa,cAAT9D,IAAsBA,EAAO,SAEpB,QAATA,OAEG,IAAa,QAATA,EACNsE,GAAKA,EAAI,MACTrD,GAAOA,EAAMmC,OACX,IAAa,UAATpD,GAAqB8D,EAEzB,GAAa,UAAT9D,GAIV,GAHKiB,GAA0B,gBAAVA,IAAqC,gBAARqD,KACjDlB,EAAKmB,MAAMC,QAAUvD,GAAS,IAE3BA,GAA0B,gBAAjB,KAAOA,EAAP,YAAAwD,EAAOxD,IAAoB,CACvC,GAAmB,gBAARqD,GACV,IAAK,GAAI5E,KAAK4E,GACP5E,IAAKuB,KAAQmC,EAAKmB,MAAM7E,GAAK,GAGrC,KAAK,GAAIA,KAAKuB,GACbmC,EAAKmB,MAAM7E,GAAyB,gBAAbuB,GAAMvB,KAAkD,IAA/BgF,EAAmBC,KAAKjF,GAAeuB,EAAMvB,GAAK,KAAOuB,EAAMvB,QAG3G,IAAa,4BAATM,EACNiB,IAAOmC,EAAKwB,UAAY3D,EAAM4D,QAAU,QACtC,IAAe,KAAX7E,EAAK,IAAwB,KAAXA,EAAK,GAAW,CAC5C,GAAI8E,GAAa9E,KAAUA,EAAOA,EAAK+E,QAAQ,WAAY,IAC3D/E,GAAOA,EAAK0D,cAAcsB,UAAU,GAChC/D,EACEqD,GAAKlB,EAAK6B,iBAAiBjF,EAAMkF,EAAYJ,GAElD1B,EAAK+B,oBAAoBnF,EAAMkF,EAAYJ,IAE3C1B,EAAKgC,aAAehC,EAAKgC,gBAAkBpF,GAAQiB,MAC9C,IAAa,SAATjB,GAA4B,SAATA,IAAoB8D,GAAS9D,IAAQoD,GAClEiC,EAAYjC,EAAMpD,EAAe,MAATiB,EAAgB,GAAKA,GAChC,MAATA,IAA2B,IAAVA,GAAiBmC,EAAKkC,gBAAgBtF,OACrD,CACN,GAAIuF,GAAKzB,GAAS9D,KAAUA,EAAOA,EAAK+E,QAAQ,YAAa,IAChD,OAAT9D,IAA2B,IAAVA,EAChBsE,EAAInC,EAAKoC,kBAAkB,+BAAgCxF,EAAK0D,eAAoBN,EAAKkC,gBAAgBtF,GAClF,kBAAViB,KACbsE,EAAInC,EAAKqC,eAAe,+BAAgCzF,EAAK0D,cAAezC,GAAYmC,EAAKsC,aAAa1F,EAAMiB,QAlCrHmC,GAAKuC,UAAY1E,GAAS,GA0C5B,QAASoE,GAAYjC,EAAMpD,EAAMiB,GAChC,IACCmC,EAAKpD,GAAQiB,EACZ,MAAO2E,KAMV,QAASV,GAAWU,GACnB,MAAOC,MAAKT,WAAWQ,EAAEE,MAAM3D,EAAQ4D,OAAS5D,EAAQ4D,MAAMH,IAAMA,GAgBrE,QAASI,KAER,IADA,GAAIlG,GACGA,EAAImG,EAAOlE,OACbI,EAAQ+D,YAAY/D,EAAQ+D,WAAWpG,GACvCA,EAAEqG,mBAAmBrG,EAAEqG,oBAU7B,QAASC,GAAKC,EAAKjE,EAAOkE,EAASC,EAAUC,EAAQC,GAE/CC,MAEJC,EAAsB,MAAVH,OAA6CxE,KAA3BwE,EAAOI,gBAGrCvD,EAAmB,MAAPgD,KAAiB,iBAAmBA,IAGjD,IAAIQ,GAAMC,EAAMT,EAAKjE,EAAOkE,EAASC,EAAUE,EAY/C,OATID,IAAUK,EAAI1C,aAAeqC,GAAQA,EAAOO,YAAYF,KAGpDH,IACPrD,GAAY,EAEPoD,GAAeT,KAGda,EAIR,QAASC,GAAMT,EAAKjE,EAAOkE,EAASC,EAAUE,GAC7C,GAAIO,GAAMX,EACNY,EAAcN,CAMlB,IAHa,MAATvE,GAAkC,iBAAVA,KAAqBA,EAAQ,IAGpC,gBAAVA,IAAuC,gBAAVA,GAmBvC,MAhBIiE,QAAyBrE,KAAlBqE,EAAI/C,WAA2B+C,EAAIlC,cAAgBkC,EAAIa,YAAcT,GAE3EJ,EAAIc,WAAa/E,IACpBiE,EAAIc,UAAY/E,IAIjB4E,EAAMjD,SAASqD,eAAehF,GAC1BiE,IACCA,EAAIlC,YAAYkC,EAAIlC,WAAWkD,aAAaL,EAAKX,GACrDiB,EAAkBjB,GAAK,KAIzBW,EAAA,eAAuB,EAEhBA,CAIR,IAAIO,GAAYnF,EAAMhB,QACtB,IAAyB,kBAAdmG,GACV,MAAOC,GAAwBnB,EAAKjE,EAAOkE,EAASC,EAQrD,IAJAI,EAA0B,QAAdY,GAA2C,kBAAdA,GAAwCZ,EAGjFY,EAAYtF,OAAOsF,KACdlB,IAAQ7C,EAAY6C,EAAKkB,MAC7BP,EAAMnD,EAAW0D,EAAWZ,GAExBN,GAAK,CAER,KAAOA,EAAIoB,YACVT,EAAID,YAAYV,EAAIoB,WAEjBpB,GAAIlC,YAAYkC,EAAIlC,WAAWkD,aAAaL,EAAKX,GAGrDiB,EAAkBjB,GAAK,GAIzB,GAAIqB,GAAKV,EAAIS,WACTlF,EAAQyE,EAAA,cACRW,EAAYvF,EAAMX,QAEtB,IAAa,MAATc,EAAe,CAClBA,EAAQyE,EAAA,gBACR,KAAK,GAAIY,GAAIZ,EAAI3F,WAAY3B,EAAIkI,EAAEhG,OAAQlC,KAC1C6C,EAAMqF,EAAElI,GAAGM,MAAQ4H,EAAElI,GAAGuB,MAqB1B,OAhBKoC,GAAasE,GAAkC,IAArBA,EAAU/F,QAAwC,gBAAjB+F,GAAU,IAAyB,MAAND,OAA+B1F,KAAjB0F,EAAGpE,WAA6C,MAAlBoE,EAAGG,YACvIH,EAAGP,WAAaQ,EAAU,KAC7BD,EAAGP,UAAYQ,EAAU,KAIlBA,GAAaA,EAAU/F,QAAgB,MAAN8F,IACxCI,EAAcd,EAAKW,EAAWrB,EAASC,EAAUlD,GAA8C,MAAjCd,EAAMwF,yBAItEC,EAAehB,EAAK5E,EAAMf,WAAYkB,GAGtCoE,EAAYM,EAELD,EAUR,QAASc,GAAczB,EAAKsB,EAAWrB,EAASC,EAAU0B,GACzD,GAQIC,GACApI,EACAqI,EACAC,EACA7G,EAZA8G,EAAmBhC,EAAIiC,WACvB7G,KACA8G,KACAC,EAAW,EACXC,EAAM,EACNC,EAAML,EAAiBzG,OACvB+G,EAAc,EACdC,EAAOjB,EAAYA,EAAU/F,OAAS,CAQ1C,IAAY,IAAR8G,EACH,IAAK,GAAIhJ,GAAI,EAAGA,EAAIgJ,EAAKhJ,IAAK,CAC7B,GAAImJ,GAASR,EAAiB3I,GAC1B6C,EAAQsG,EAAA,cACR3G,EAAM0G,GAAQrG,EAAQsG,EAAO3B,WAAa2B,EAAO3B,WAAW4B,MAAQvG,EAAML,IAAM,IACzE,OAAPA,GACHsG,IACAD,EAAMrG,GAAO2G,IACHtG,QAA+BP,KAArB6G,EAAOvF,WAA0B2E,GAAcY,EAAO1B,UAAU4B,OAAgBd,MACpGxG,EAASkH,KAAiBE,GAK7B,GAAa,IAATD,EACH,IAAK,GAAIlJ,GAAI,EAAGA,EAAIkJ,EAAMlJ,IAAK,CAC9B0I,EAAST,EAAUjI,GACnB6B,EAAQ,IAGR,IAAIW,GAAMkG,EAAOlG,GACjB,IAAW,MAAPA,EACCsG,OAA2BxG,KAAfuG,EAAMrG,KACrBX,EAAQgH,EAAMrG,GACdqG,EAAMrG,OAAOF,GACbwG,SAIG,KAAKjH,GAASkH,EAAME,EACvB,IAAKT,EAAIO,EAAKP,EAAIS,EAAaT,IAC9B,OAAoBlG,KAAhBP,EAASyG,IAAoB/E,EAAerD,EAAI2B,EAASyG,GAAIE,EAAQH,GAAc,CACtF1G,EAAQzB,EACR2B,EAASyG,OAAKlG,GACVkG,IAAMS,EAAc,GAAGA,IACvBT,IAAMO,GAAKA,GACf,OAMJlH,EAAQuF,EAAMvF,EAAO6G,EAAQ9B,EAASC,GAEtC4B,EAAIE,EAAiB3I,GACjB6B,GAASA,IAAU8E,GAAO9E,IAAU4G,IAC9B,MAALA,EACH9B,EAAIU,YAAYxF,GACNA,IAAU4G,EAAEN,YACtB3D,EAAWiE,GAEX9B,EAAI2C,aAAazH,EAAO4G,IAO5B,GAAIK,EACH,IAAK,GAAI9I,KAAK6I,OACIvG,KAAbuG,EAAM7I,IAAkB4H,EAAkBiB,EAAM7I,IAAI,EAK1D,MAAO+I,GAAOE,OAC6B3G,MAArCT,EAAQE,EAASkH,OAA+BrB,EAAkB/F,GAAO,GAQhF,QAAS+F,GAAkBlE,EAAM6F,GAChC,GAAItG,GAAYS,EAAK8D,UACjBvE,GAEHuG,EAAiBvG,IAIY,MAAzBS,EAAA,eAAiCA,EAAA,cAAsB+F,KAAK/F,EAAA,cAAsB+F,IAAI,OAEtE,IAAhBF,GAAkD,MAAzB7F,EAAA,eAC5Bc,EAAWd,GAGZgG,EAAehG,IAQjB,QAASgG,GAAehG,GAEvB,IADAA,EAAOA,EAAKiG,UACLjG,GAAM,CACZ,GAAIkG,GAAOlG,EAAKmG,eAChBjC,GAAkBlE,GAAM,GACxBA,EAAOkG,GAST,QAAStB,GAAe3B,EAAKmD,EAAOlF,GACnC,GAAItE,EAGJ,KAAKA,IAAQsE,GACNkF,GAAwB,MAAfA,EAAMxJ,IAA+B,MAAbsE,EAAItE,IAC1CqE,EAAYgC,EAAKrG,EAAMsE,EAAItE,GAAOsE,EAAItE,OAAQgC,GAAW2E,EAK3D,KAAK3G,IAAQwJ,GACC,aAATxJ,GAAgC,cAATA,GAA2BA,IAAQsE,IAAQkF,EAAMxJ,MAAoB,UAATA,GAA6B,YAATA,EAAqBqG,EAAIrG,GAAQsE,EAAItE,KAC/IqE,EAAYgC,EAAKrG,EAAMsE,EAAItE,GAAOsE,EAAItE,GAAQwJ,EAAMxJ,GAAO2G,GAY9D,QAAS8C,GAAiB9G,GACzB,GAAI3C,GAAO2C,EAAU+G,YAAY1J,MAChC2J,EAAW3J,KAAU2J,EAAW3J,QAAa8B,KAAKa,GAIpD,QAASiH,GAAgBC,EAAMtH,EAAO+D,GACrC,GACIwD,GADA7G,EAAO0G,EAAWE,EAAK7J,KAY3B,IATI6J,EAAKjJ,WAAaiJ,EAAKjJ,UAAUmJ,QACpCD,EAAO,GAAID,GAAKtH,EAAO+D,GACvB0D,EAAUpK,KAAKkK,EAAMvH,EAAO+D,KAE5BwD,EAAO,GAAIE,GAAUzH,EAAO+D,GAC5BwD,EAAKJ,YAAcG,EACnBC,EAAKC,OAASE,GAGXhH,EACH,IAAK,GAAIvD,GAAIuD,EAAKrB,OAAQlC,KACzB,GAAIuD,EAAKvD,GAAGgK,cAAgBG,EAAM,CACjCC,EAAKI,SAAWjH,EAAKvD,GAAGwK,SACxBjH,EAAKkH,OAAOzK,EAAG,EACf,OAIH,MAAOoK,GAIR,QAASG,GAAS1H,EAAO6H,EAAO9D,GAC/B,MAAOT,MAAK6D,YAAYnH,EAAO+D,GAShC,QAAS+D,GAAkB1H,EAAWJ,EAAO+H,EAAMhE,EAASC,GACvD5D,EAAU4H,WACd5H,EAAU4H,UAAW,GAEjB5H,EAAU6H,MAAQjI,EAAM4G,YAAY5G,GAAM4G,KAC1CxG,EAAUmG,MAAQvG,EAAML,YAAYK,GAAML,KAEzCS,EAAU8H,MAAQlE,EAClB5D,EAAU+H,oBAAoB/H,EAAU+H,qBAClC/H,EAAUgI,2BACpBhI,EAAUgI,0BAA0BpI,EAAO+D,GAGxCA,GAAWA,IAAY3D,EAAU2D,UAC/B3D,EAAUiI,cAAajI,EAAUiI,YAAcjI,EAAU2D,SAC9D3D,EAAU2D,QAAUA,GAGhB3D,EAAUkI,YAAWlI,EAAUkI,UAAYlI,EAAUJ,OAC1DI,EAAUJ,MAAQA,EAElBI,EAAU4H,UAAW,EAER,IAATD,IACU,IAATA,IAA+C,IAAjCnI,EAAQ2I,sBAAmCnI,EAAU8H,KAGtE/H,EAAcC,GAFdO,EAAgBP,EAAW,EAAG4D,IAM5B5D,EAAU6H,OAAO7H,EAAU6H,MAAM7H,IAStC,QAASO,GAAgBP,EAAW2H,EAAM/D,EAAUwE,GACnD,IAAIpI,EAAU4H,SAAd,CAEA,GAWIS,GACAlB,EACAmB,EAbA1I,EAAQI,EAAUJ,MAClB6H,EAAQzH,EAAUyH,MAClB9D,EAAU3D,EAAU2D,QACpB4E,EAAgBvI,EAAUkI,WAAatI,EACvC4I,EAAgBxI,EAAUyI,WAAahB,EACvCiB,EAAkB1I,EAAUiI,aAAetE,EAC3CgF,EAAW3I,EAAU8H,KACrBP,EAAWvH,EAAUuH,SACrBqB,EAAcD,GAAYpB,EAC1BsB,EAAwB7I,EAAUuE,WAClCuE,GAAO,CAuBX,IAjBIH,IACH3I,EAAUJ,MAAQ2I,EAClBvI,EAAUyH,MAAQe,EAClBxI,EAAU2D,QAAU+E,EACP,IAATf,GAAc3H,EAAU+I,wBAAoF,IAA3D/I,EAAU+I,sBAAsBnJ,EAAO6H,EAAO9D,GAClGmF,GAAO,EACG9I,EAAUgJ,qBACpBhJ,EAAUgJ,oBAAoBpJ,EAAO6H,EAAO9D,GAE7C3D,EAAUJ,MAAQA,EAClBI,EAAUyH,MAAQA,EAClBzH,EAAU2D,QAAUA,GAGrB3D,EAAUkI,UAAYlI,EAAUyI,UAAYzI,EAAUiI,YAAcjI,EAAUuH,SAAW,KACzFvH,EAAUC,QAAS,GAEd6I,EAAM,CACVT,EAAWrI,EAAUoH,OAAOxH,EAAO6H,EAAO9D,GAGtC3D,EAAUiJ,kBACbtF,EAAUjE,EAAOA,KAAWiE,GAAU3D,EAAUiJ,mBAGjD,IACIC,GACApB,EAFAqB,EAAiBd,GAAYA,EAAS5J,QAI1C,IAA8B,kBAAnB0K,GAA+B,CAGzC,GAAIC,GAAapI,EAAaqH,EAC9BlB,GAAO0B,EAEH1B,GAAQA,EAAKJ,cAAgBoC,GAAkBC,EAAW7J,KAAO4H,EAAKhB,MACzEuB,EAAkBP,EAAMiC,EAAY,EAAGzF,GAAS,IAEhDuF,EAAY/B,EAEZnH,EAAUuE,WAAa4C,EAAOF,EAAgBkC,EAAgBC,EAAYzF,GAC1EwD,EAAKI,SAAWJ,EAAKI,UAAYA,EACjCJ,EAAKkC,iBAAmBrJ,EACxB0H,EAAkBP,EAAMiC,EAAY,EAAGzF,GAAS,GAChDpD,EAAgB4G,EAAM,EAAGvD,GAAU,IAGpCkE,EAAOX,EAAKW,SAEZQ,GAAQM,EAGRM,EAAYL,EACRK,IACHZ,EAAQtI,EAAUuE,WAAa,OAG5BqE,GAAwB,IAATjB,KACdW,IAAOA,EAAM/D,WAAa,MAC9BuD,EAAOrE,EAAK6E,EAAOD,EAAU1E,EAASC,IAAa+E,EAAUC,GAAeA,EAAYpH,YAAY,GAItG,IAAIoH,GAAed,IAASc,GAAezB,IAAS0B,EAAuB,CAC1E,GAAIS,GAAaV,EAAYpH,UACzB8H,IAAcxB,IAASwB,IAC1BA,EAAW5E,aAAaoD,EAAMc,GAEzBM,IACJN,EAAYrE,WAAa,KACzBI,EAAkBiE,GAAa,KAUlC,GALIM,GACH3C,EAAiB2C,GAGlBlJ,EAAU8H,KAAOA,EACbA,IAASM,EAAS,CAGrB,IAFA,GAAImB,GAAevJ,EACfwJ,EAAIxJ,EACDwJ,EAAIA,EAAEH,mBACXE,EAAeC,GAAG1B,KAAOA,CAE3BA,GAAKvD,WAAagF,EAClBzB,EAAKlH,sBAAwB2I,EAAaxC,aAkB5C,IAdK4B,GAAY/E,EAChBN,EAAOmG,QAAQzJ,GACJ8I,IAMP9I,EAAU0J,oBACb1J,EAAU0J,mBAAmBnB,EAAeC,EAAeE,GAExDlJ,EAAQmK,aAAanK,EAAQmK,YAAY3J,IAGZ,MAA9BA,EAAU4J,iBACb,KAAO5J,EAAU4J,iBAAiB3K,QACjCe,EAAU4J,iBAAiBxK,MAAMnC,KAAK+C,EAInC+D,IAAcqE,GAAS/E,KAS7B,QAASwB,GAAwBnB,EAAKjE,EAAOkE,EAASC,GAOrD,IANA,GAAIzG,GAAIuG,GAAOA,EAAIa,WACfsF,EAAoB1M,EACpB2M,EAASpG,EACTqG,EAAgB5M,GAAKuG,EAAI9C,wBAA0BnB,EAAMhB,SACzDuL,EAAUD,EACVnK,EAAQoB,EAAavB,GAClBtC,IAAM6M,IAAY7M,EAAIA,EAAEkM,mBAC9BW,EAAU7M,EAAE4J,cAAgBtH,EAAMhB,QA2BnC,OAxBItB,IAAK6M,KAAapG,GAAYzG,EAAEoH,aACnCmD,EAAkBvK,EAAGyC,EAAO,EAAG+D,EAASC,GACxCF,EAAMvG,EAAE2K,OAEJ+B,IAAsBE,IACzBxD,EAAiBsD,GACjBnG,EAAMoG,EAAS,MAGhB3M,EAAI8J,EAAgBxH,EAAMhB,SAAUmB,EAAO+D,GACvCD,IAAQvG,EAAEoK,WACbpK,EAAEoK,SAAW7D,EAEboG,EAAS,MAEVpC,EAAkBvK,EAAGyC,EAAO,EAAG+D,EAASC,GACxCF,EAAMvG,EAAE2K,KAEJgC,GAAUpG,IAAQoG,IACrBA,EAAOvF,WAAa,KACpBI,EAAkBmF,GAAQ,KAIrBpG,EAOR,QAAS6C,GAAiBvG,GACrBR,EAAQyK,eAAezK,EAAQyK,cAAcjK,EAEjD,IAAI8H,GAAO9H,EAAU8H,IAErB9H,GAAU4H,UAAW,EAEjB5H,EAAUkK,sBAAsBlK,EAAUkK,uBAE9ClK,EAAU8H,KAAO,IAGjB,IAAIqC,GAAQnK,EAAUuE,UAClB4F,GACH5D,EAAiB4D,GACPrC,IACNA,EAAA,eAAyBA,EAAA,cAAsBtB,KAAKsB,EAAA,cAAsBtB,IAAI,MAElFxG,EAAUuH,SAAWO,EAErBvG,EAAWuG,GACXhB,EAAiB9G,GAEjByG,EAAeqB,IAGZ9H,EAAU6H,OAAO7H,EAAU6H,MAAM,MActC,QAASR,GAAUzH,EAAO+D,GACzBT,KAAKjD,QAAS,EAKdiD,KAAKS,QAAUA,EAKfT,KAAKtD,MAAQA,EAKbsD,KAAKuE,MAAQvE,KAAKuE,UA8DnB,QAASL,GAAO3H,EAAOoE,EAAQuG,GAC7B,MAAO3G,GAAK2G,EAAO3K,MAAW,EAAOoE,GAAQ,GH9zB/CrG,OAAOC,eAAeZ,EAAS,cAC9ByB,OAAO,GAGR,IAAIwD,GAA4B,kBAAXuI,SAAoD,gBAApBA,QAAOC,SAAwB,SAAU3K,GAAO,aAAcA,IAAS,SAAUA,GAAO,MAAOA,IAAyB,kBAAX0K,SAAyB1K,EAAIoH,cAAgBsD,QAAU1K,IAAQ0K,OAAOpM,UAAY,eAAkB0B,IGnHlQH,KAwBAN,KAEAH,KAqEAqB,EAA0B,kBAAXmK,SAAwBA,QAAQC,UAAUC,KAAKC,KAAKH,QAAQC,WAAaG,WAOxF5I,EAAqB,yDAIrB7B,KA4JAoD,KAGAS,EAAY,EAGZC,GAAY,EAGZtD,GAAY,EA6RZsG,IAqUJtH,GAAO2H,EAAUpJ,WAehB2M,SAAU,SAAkBnD,EAAOoD,GAClC,GAAIzM,GAAI8E,KAAKuE,KACRvE,MAAKuF,YAAWvF,KAAKuF,UAAY/I,KAAWtB,IACjDsB,EAAOtB,EAAoB,kBAAVqJ,GAAuBA,EAAMrJ,EAAG8E,KAAKtD,OAAS6H,GAC3DoD,IAAW3H,KAAK0G,iBAAmB1G,KAAK0G,sBAAwBzK,KAAK0L,GACzE9K,EAAcmD,OAQf4H,YAAa,SAAqBD,GAC7BA,IAAW3H,KAAK0G,iBAAmB1G,KAAK0G,sBAAwBzK,KAAK0L,GACzEtK,EAAgB2C,KAAM,IAWvBkE,OAAQ,cAsBT,IAAI2D,IACHvM,EAAGA,EACH8C,cAAe9C,EACfqB,aAAcA,EACdwH,UAAWA,EACXD,OAAQA,EACR/G,SAAUA,EACVb,QAASA,EH6HV3C,GG1HS2B,IH2HT3B,EG3HiByE,cAAL9C,EH4HZ3B,EG5HgCgD,eH6HhChD,EG7H8CwK,YH8H9CxK,EG9HyDuK,SH+HzDvK,EG/HiEwD,WHgIjExD,EGhI2E2C,UHiI3E3C,EAAQmO,QGhIOD,GHqIT,SAAUjO,EAAQD,EAASH,GAEjC,YAkBA,IAAIoF,GAA4B,kBAAXuI,SAAoD,gBAApBA,QAAOC,SAAwB,SAAU3K,GAAO,aAAcA,IAAS,SAAUA,GAAO,MAAOA,IAAyB,kBAAX0K,SAAyB1K,EAAIoH,cAAgBsD,QAAU1K,IAAQ0K,OAAOpM,UAAY,eAAkB0B,GI3kCtQnC,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAI2M,GAASvO,EAAQ,GACjBwO,EAASxO,EAAQ,GACjByO,EAASzO,EAAQ,GACjB0O,EAAS1O,EAAQ,GACjB2O,EAAS3O,EAAQ,GACjB4O,EAAS5O,EAAQ,GACjB6O,EAAY7O,EAAQ,IACpB8O,EAAS9O,EAAQ,EAKrBG,GAAQ4O,cAAiB,WACrB,GAAIC,GAAK,CACT,OAAO,YACH,MAAOA,SAQf7O,EAAQ8O,KAAO,SAAUC,GACrB,GAAIC,GAAYR,EAAOS,kBAAkBF,GACrCD,EAAO,GAAIP,GAAOW,IACtBJ,GAAKK,OAAOH,EACZ,IAAII,GAAYN,EAAKO,QACrB,OAAOf,GAAOgB,OAAOC,gBAAgBH,GAOzC,IAAII,GAAmB,QAAnBA,KAEA,IAAK,GADDC,MACKC,EAAK,EAAGA,EAAKvN,UAAUC,OAAQsN,IACpCD,EAASC,GAAMvN,UAAUuN,EAG7B,KAAK,GADDC,GAAU,GACLzP,EAAI,EAAGA,EAAIuP,EAASrN,OAAQlC,IAC7B0P,MAAMC,QAAQJ,EAASvP,KACtBuP,EAASvP,IACiB,WAAvB+E,EAAOwK,EAASvP,KACc,gBAAvBuP,GAASvP,GAAGkC,OACvBuN,GAAWH,EAAiBM,MAAM,KAAML,EAASvP,IAErB,WAAvB+E,EAAOwK,EAASvP,IACrByP,GAAWlB,EAAOsB,UAAUN,EAASvP,IAGrCyP,GAAWF,EAASvP,GAExByP,GAAW,GAEf,OAAOA,GAMX3P,GAAQgQ,OAAS,IAMjB,IAAIC,IAAY,CAMhBjQ,GAAQkQ,cAAgB,SAAUC,EAASC,GACvChC,EAAOiC,QAAQD,IAA2B,IAAZD,IAAgC,IAAZA,EAAoB,+CACtD,IAAZA,GACuB,mBAAZG,WACoB,kBAAhBA,SAAQC,IACfvQ,EAAQgQ,OAASM,QAAQC,IAAI1C,KAAKyC,SAEN,WAAvBrL,EAAOqL,QAAQC,OAEpBvQ,EAAQgQ,OAAS,SAAUL,GACvBW,QAAQC,IAAIZ,MAIpBS,GACA1B,EAAU8B,eAAeC,IAAI,mBAAmB,IAE5B,kBAAZN,GACZnQ,EAAQgQ,OAASG,GAGjBnQ,EAAQgQ,OAAS,KACjBtB,EAAU8B,eAAeE,OAAO,qBAOxC1Q,EAAQuQ,IAAM,WAEV,IAAK,GADDd,MACKC,EAAK,EAAGA,EAAKvN,UAAUC,OAAQsN,IACpCD,EAASC,GAAMvN,UAAUuN,EAO7B,KALkB,IAAdO,IACAA,GAAY,EACW,OAAnBjQ,EAAQgQ,SAAuE,IAApDtB,EAAU8B,eAAezP,IAAI,oBACxDf,EAAQkQ,eAAc,IAE1BlQ,EAAQgQ,OAAQ,CAChB,GAAIL,GAAUH,EAAiBM,MAAM,KAAML,EAC3CzP,GAAQgQ,OAAOL,KAOvB3P,EAAQ2Q,WAAa,SAAUC,GAC3B,MAAO,YAEH,IAAK,GADDnB,MACKC,EAAK,EAAGA,EAAKvN,UAAUC,OAAQsN,IACpCD,EAASC,GAAMvN,UAAUuN,EAE7B1P,GAAQuQ,IAAIT,UAAM,IAASc,GAAQC,OAAOpB,MAMlDzP,EAAQ8Q,MAAQ,WAEZ,IAAK,GADDrB,MACKC,EAAK,EAAGA,EAAKvN,UAAUC,OAAQsN,IACpCD,EAASC,GAAMvN,UAAUuN,EAE7B,IAAuB,mBAAZY,SAAyB,CAChC,GAAIX,GAAU,4BAA8BH,EAAiBM,UAAM,GAAQL,OAC9C,KAAlBa,QAAQQ,MACfR,QAAQQ,MAAMnB,GAGdW,QAAQC,IAAIZ,KAOxB3P,EAAQ+Q,MAAQ,WAEZ,IAAK,GADDtB,MACKC,EAAK,EAAGA,EAAKvN,UAAUC,OAAQsN,IACpCD,EAASC,GAAMvN,UAAUuN,EAE7B,IAAIC,GAAUH,EAAiBM,UAAM,GAAQL,EAC7C,MAAM,IAAIuB,OAAM,yBAA2BrB,IAK/C3P,EAAQiR,KAAO,WAEX,IAAK,GADDxB,MACKC,EAAK,EAAGA,EAAKvN,UAAUC,OAAQsN,IACpCD,EAASC,GAAMvN,UAAUuN,EAE7B,IAAuB,mBAAZY,SAAyB,CAChC,GAAIX,GAAU,qBAAuBH,EAAiBM,UAAM,GAAQL,OACxC,KAAjBa,QAAQW,KACfX,QAAQW,KAAKtB,GAGbW,QAAQC,IAAIZ,KAQxB3P,EAAQkR,mBAAqB,WAEH,mBAAXC,SACPA,OAAOC,UACPD,OAAOC,SAASC,WACgC,IAAhDF,OAAOC,SAASC,SAASC,QAAQ,WACjCtR,EAAQiR,KAAK,8FAOrBjR,EAAQuR,2BAA6B,SAAUC,GAC3CxR,EAAQiR,KAAKO,EACT,qEAQRxR,EAAQyR,oBAAsB,SAAUC,GACpC,MAAwB,gBAATA,KACVA,GAAQA,GACLA,GAAQC,OAAOC,mBACfF,GAAQC,OAAOE,oBAK3B7R,EAAQ8R,oBAAsB,SAAUC,GACpC,GAAIpD,EAAOqD,aAAuC,aAAxBzN,SAAS0N,WAC/BF,QAEC,CAGD,GAAIG,IAAW,EACXC,EAAc,QAAdA,KACA,IAAK5N,SAAS6N,KAEV,WADAtE,YAAWqE,EAAaE,KAAKC,MAAM,IAGlCJ,KACDA,GAAW,EACXH,KAGJxN,UAASkB,kBACTlB,SAASkB,iBAAiB,mBAAoB0M,GAAa,GAE3DhB,OAAO1L,iBAAiB,OAAQ0M,GAAa,IAExC5N,SAASgO,cAEdhO,SAASgO,YAAY,qBAAsB,WACX,aAAxBhO,SAAS0N,YACTE,MAGRhB,OAAOoB,YAAY,SAAUJ,MAWzCnS,EAAQwS,SAAW,aAKnBxS,EAAQyS,SAAW,aAOnBzS,EAAQ0S,YAAc,SAAUtK,EAAGuK,GAC/B,GAAIvK,IAAMuK,EACN,MAAO,EAEN,IAAIvK,IAAMpI,EAAQwS,UAAYG,IAAM3S,EAAQyS,SAC7C,OAAQ,CAEP,IAAIE,IAAM3S,EAAQwS,UAAYpK,IAAMpI,EAAQyS,SAC7C,MAAO,EAGP,IAAIG,GAAS5S,EAAQ6S,YAAYzK,GAAI0K,EAAS9S,EAAQ6S,YAAYF,EAClE,OAAe,QAAXC,EACe,OAAXE,EACOF,EAASE,GAAU,EAAI1K,EAAEhG,OAASuQ,EAAEvQ,OAASwQ,EAASE,GAGrD,EAGI,OAAXA,EACE,EAGA1K,EAAIuK,GAAK,EAAI,GAShC3S,EAAQ+S,cAAgB,SAAU3K,EAAGuK,GACjC,MAAIvK,KAAMuK,EACC,EAEFvK,EAAIuK,GACD,EAGD,GAQf3S,EAAQgT,WAAa,SAAUtQ,EAAKI,GAChC,GAAIA,GAAOJ,IAAOI,GACd,MAAOA,GAAIJ,EAGX,MAAM,IAAIsO,OAAM,yBAA2BtO,EAAM,gBAAkB+L,EAAOsB,UAAUjN,KAO5F9C,EAAQiT,kBAAoB,SAAUnQ,GAClC,GAAmB,gBAAf,KAAOA,EAAP,YAAAmC,EAAOnC,KAA4B,OAARA,EAC3B,MAAO2L,GAAOsB,UAAUjN,EAC5B,IAAIoQ,KACJ,KAAK,GAAIC,KAAKrQ,GACVoQ,EAAK5Q,KAAK6Q,EAGdD,GAAKE,MAEL,KAAK,GADD1Q,GAAM,IACDxC,EAAI,EAAGA,EAAIgT,EAAK9Q,OAAQlC,IACnB,IAANA,IACAwC,GAAO,KACXA,GAAO+L,EAAOsB,UAAUmD,EAAKhT,IAC7BwC,GAAO,IACPA,GAAO1C,EAAQiT,kBAAkBnQ,EAAIoQ,EAAKhT,IAG9C,OADAwC,IAAO,KASX1C,EAAQqT,kBAAoB,SAAUtE,EAAKuE,GACvC,GAAIpK,GAAM6F,EAAI3M,MACd,IAAI8G,GAAOoK,EACP,OAAQvE,EAGZ,KAAK,GADDwE,MACKjT,EAAI,EAAGA,EAAI4I,EAAK5I,GAAKgT,EACtBhT,EAAIgT,EAAUpK,EACdqK,EAASjR,KAAKyM,EAAIvJ,UAAUlF,EAAG4I,IAG/BqK,EAASjR,KAAKyM,EAAIvJ,UAAUlF,EAAGA,EAAIgT,GAG3C,OAAOC,IAQXvT,EAAQwT,KAAO,SAAU1Q,EAAKiP,GAC1B,GAAInC,MAAMC,QAAQ/M,GACd,IAAK,GAAI5C,GAAI,EAAGA,EAAI4C,EAAIV,SAAUlC,EAC9B6R,EAAG7R,EAAG4C,EAAI5C,QAUdmO,GAAOoF,QAAQ3Q,EAAK,SAAUJ,EAAKgR,GAAO,MAAO3B,GAAG2B,EAAKhR,MASjE1C,EAAQ2T,aAAe,SAAU3F,EAAUlH,GACvC,MAAOA,GAAUkH,EAASH,KAAK/G,GAAWkH,GAS9ChO,EAAQ4T,sBAAwB,SAAUC,GACtCzF,EAAOiC,QAAQrQ,EAAQyR,oBAAoBoC,GAAI,sBAC/C,IACmCtS,GAAG6E,EAAGuC,EAAGmL,EAAI5T,EAAG6T,EAAMhF,CAyBzD,KAtBU,IAAN8E,GACAzN,EAAI,EACJuC,EAAI,EACJpH,EAAI,EAAIsS,IAAOG,IAAW,EAAI,IAG9BzS,EAAIsS,EAAI,EACRA,EAAIxB,KAAK4B,IAAIJ,GACTA,GAAKxB,KAAK6B,IAAI,GAAG,OAEjBJ,EAAKzB,KAAKpJ,IAAIoJ,KAAKC,MAAMD,KAAK9B,IAAIsD,GAAKxB,KAAK8B,KAbzC,MAcH/N,EAAI0N,EAdD,KAeHnL,EAAI0J,KAAK+B,MAAMP,EAAIxB,KAAK6B,IAAI,EAhBZ,GAgBuBJ,GAAMzB,KAAK6B,IAAI,EAhBtC,OAoBhB9N,EAAI,EACJuC,EAAI0J,KAAK+B,MAAMP,EAAIxB,KAAK6B,IAAI,GAAG,SAIvCH,KACK7T,EA1BmB,GA0BRA,EAAGA,GAAK,EACpB6T,EAAKzR,KAAKqG,EAAI,EAAI,EAAI,GACtBA,EAAI0J,KAAKC,MAAM3J,EAAI,EAEvB,KAAKzI,EA9BO,GA8BIA,EAAGA,GAAK,EACpB6T,EAAKzR,KAAK8D,EAAI,EAAI,EAAI,GACtBA,EAAIiM,KAAKC,MAAMlM,EAAI,EAEvB2N,GAAKzR,KAAKf,EAAI,EAAI,GAClBwS,EAAKM,UACLtF,EAAMgF,EAAKO,KAAK,GAEhB,IAAIC,GAAgB,EACpB,KAAKrU,EAAI,EAAGA,EAAI,GAAIA,GAAK,EAAG,CACxB,GAAIsU,GAAUC,SAAS1F,EAAI2F,OAAOxU,EAAG,GAAI,GAAGyU,SAAS,GAC9B,KAAnBH,EAAQpS,SACRoS,EAAU,IAAMA,GACpBD,GAAgCC,EAEpC,MAAOD,GAAcrQ,eAOzBlE,EAAQ4U,+BAAiC,WACrC,QAA4B,YAAlB,mBAAOzD,QAAP,YAAAlM,EAAOkM,WACbA,OAAA,SACAA,OAAA,kBACC,UAAUhM,KAAKgM,OAAOC,SAASyD,QAMxC7U,EAAQ8U,kBAAoB,WAExB,MAA0B,YAAnB,mBAAOC,SAAP,YAAA9P,EAAO8P,WAA8C,WAAtB9P,EAAO8P,QAAQC,KAQzDhV,EAAQiV,mBAAqB,SAAUC,EAAMC,GACzC,GAAIC,GAAS,eACA,aAATF,EACAE,EACI,0FAGS,qBAARF,EACLE,EAAS,6DAEI,eAARF,IACLE,EAAS,6BAEb,IAAItE,GAAQ,GAAIE,OAAMkE,EAAO,OAASC,EAAME,KAAKV,WAAa,KAAOS,EAErE,OADAtE,GAAMoE,KAAOA,EAAKI,cACXxE,GAOX9Q,EAAQuV,gBAAkB,GAAIC,QAAO,iBAMrCxV,EAAQ6S,YAAc,SAAU9D,GAC5B,GAAI/O,EAAQuV,gBAAgBpQ,KAAK4J,GAAM,CACnC,GAAI0G,GAAS9D,OAAO5C,EACpB,IAAI0G,IAAW,YAAcA,GAAU,WACnC,MAAOA,GAGf,MAAO,OAmBXzV,EAAQ0V,eAAiB,SAAU3D,GAC/B,IACIA,IAEJ,MAAO3L,GAEH0H,WAAW,WAKP,GAAIzL,GAAQ+D,EAAE/D,OAAS,EAEvB,MADArC,GAAQiR,KAAK,yCAA0C5O,GACjD+D,GACPiM,KAAKC,MAAM,MAWtBtS,EAAQ2V,iBAAmB,SAAU3H,GAEjC,IAAK,GADDyB,MACKC,EAAK,EAAGA,EAAKvN,UAAUC,OAAQsN,IACpCD,EAASC,EAAK,GAAKvN,UAAUuN,EAET,mBAAb1B,IACPhO,EAAQ0V,eAAe,WACnB1H,EAAS8B,UAAM,GAAQL,MAOnCzP,EAAQ4V,aAAe,WASnB,OARmC,YAAlB,mBAAOzE,QAAP,YAAAlM,EAAOkM,UACpBA,OAAA,WACAA,OAAA,qBACA,IAKc0E,OAAO,6FAA+F,GAS5H7V,EAAQ8V,iBAAmB,SAAU5U,EAAQV,EAAMuV,GAC/CpV,OAAOC,eAAeM,EAAQV,GAAQO,IAAKgV,KAW/C/V,EAAQgW,sBAAwB,SAAUjE,EAAIkE,GAC1C,GAAIC,GAAUpI,WAAWiE,EAAIkE,EAI7B,OAHuB,gBAAnB,KAAOC,EAAP,YAAAjR,EAAOiR,KAAwBA,EAAA,OAC/BA,EAAA,QAEGA,IJ6iCL,SAAUjW,EAAQD,EAASH,GAEjC,YAQA,SAASsW,GAAmBC,GAAO,GAAIxG,MAAMC,QAAQuG,GAAM,CAAE,IAAK,GAAIlW,GAAI,EAAGmW,EAAOzG,MAAMwG,EAAIhU,QAASlC,EAAIkW,EAAIhU,OAAQlC,IAAOmW,EAAKnW,GAAKkW,EAAIlW,EAAM,OAAOmW,GAAe,MAAOzG,OAAM0G,KAAKF,GKxqDnL,QAASG,GAAKtL,GAAoD,OAAAuL,GAAArU,UAAAC,OAAnCqU,EAAmC7G,MAAA4G,EAAA,EAAAA,EAAA,KAAAE,EAAA,EAAAA,EAAAF,EAAAE,IAAnCD,EAAmCC,EAAA,GAAAvU,UAAAuU,EACvE,QACEzL,GADK4F,OAAAsF,EAEFM,EAAUE,OAAOC,SAASC,IAAI,SAAAC,GAC/B,MAAU7L,GAAV,KAAmB6L,MAErBxC,KAAK,KL6pDT3T,OAAOC,eAAeZ,EAAS,cAC7ByB,OAAO,IAETzB,EKtqDgBuW,OLsrDV,SAAUtW,EAAQD,EAASH,GAEjC,YM1qDAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAI2M,GAASvO,EAAQ,GACjBwO,EAASxO,EAAQ,GAMjBkX,EAAsB,WAMtB,QAASA,GAAKC,EAAcC,GACxB,OAAiB,KAAbA,EAAqB,CACrB5Q,KAAK6Q,QAAUF,EAAaG,MAAM,IAGlC,KAAK,GADDC,GAAS,EACJlX,EAAI,EAAGA,EAAImG,KAAK6Q,QAAQ9U,OAAQlC,IACjCmG,KAAK6Q,QAAQhX,GAAGkC,OAAS,IACzBiE,KAAK6Q,QAAQE,GAAU/Q,KAAK6Q,QAAQhX,GACpCkX,IAGR/Q,MAAK6Q,QAAQ9U,OAASgV,EACtB/Q,KAAKgR,UAAY,MAGjBhR,MAAK6Q,QAAUF,EACf3Q,KAAKgR,UAAYJ,EAwLzB,MArLAtW,QAAOC,eAAemW,EAAM,SAMxBhW,IAAK,WACD,MAAO,IAAIgW,GAAK,KAEpBjW,YAAY,EACZD,cAAc,IAElBkW,EAAK3V,UAAUkW,SAAW,WACtB,MAAIjR,MAAKgR,WAAahR,KAAK6Q,QAAQ9U,OACxB,KACJiE,KAAK6Q,QAAQ7Q,KAAKgR,YAK7BN,EAAK3V,UAAUmW,UAAY,WACvB,MAAOlR,MAAK6Q,QAAQ9U,OAASiE,KAAKgR,WAKtCN,EAAK3V,UAAUoW,SAAW,WACtB,GAAIP,GAAW5Q,KAAKgR,SAIpB,OAHIJ,GAAW5Q,KAAK6Q,QAAQ9U,QACxB6U,IAEG,GAAIF,GAAK1Q,KAAK6Q,QAASD,IAKlCF,EAAK3V,UAAUqW,QAAU,WACrB,MAAIpR,MAAKgR,UAAYhR,KAAK6Q,QAAQ9U,OACvBiE,KAAK6Q,QAAQ7Q,KAAK6Q,QAAQ9U,OAAS,GACvC,MAEX2U,EAAK3V,UAAUuT,SAAW,WAEtB,IAAK,GADD+C,GAAa,GACRxX,EAAImG,KAAKgR,UAAWnX,EAAImG,KAAK6Q,QAAQ9U,OAAQlC,IAC1B,KAApBmG,KAAK6Q,QAAQhX,KACbwX,GAAc,IAAMrR,KAAK6Q,QAAQhX,GAEzC,OAAOwX,IAAc,KAEzBX,EAAK3V,UAAUuW,mBAAqB,WAEhC,IAAK,GADDD,GAAa,GACRxX,EAAImG,KAAKgR,UAAWnX,EAAImG,KAAK6Q,QAAQ9U,OAAQlC,IAC1B,KAApBmG,KAAK6Q,QAAQhX,KACbwX,GAAc,IAAME,mBAAmBnV,OAAO4D,KAAK6Q,QAAQhX,KAEnE,OAAOwX,IAAc,KAQzBX,EAAK3V,UAAU6B,MAAQ,SAAU4U,GAE7B,WADc,KAAVA,IAAoBA,EAAQ,GACzBxR,KAAK6Q,QAAQjU,MAAMoD,KAAKgR,UAAYQ,IAK/Cd,EAAK3V,UAAU4F,OAAS,WACpB,GAAIX,KAAKgR,WAAahR,KAAK6Q,QAAQ9U,OAC/B,MAAO,KAEX,KAAK,GADD0V,MACK5X,EAAImG,KAAKgR,UAAWnX,EAAImG,KAAK6Q,QAAQ9U,OAAS,EAAGlC,IACtD4X,EAAOxV,KAAK+D,KAAK6Q,QAAQhX,GAC7B,OAAO,IAAI6W,GAAKe,EAAQ,IAM5Bf,EAAK3V,UAAUW,MAAQ,SAAUgW,GAE7B,IAAK,GADDD,MACK5X,EAAImG,KAAKgR,UAAWnX,EAAImG,KAAK6Q,QAAQ9U,OAAQlC,IAClD4X,EAAOxV,KAAK+D,KAAK6Q,QAAQhX,GAC7B,IAAI6X,YAAwBhB,GACxB,IAAK,GAAI7W,GAAI6X,EAAaV,UAAWnX,EAAI6X,EAAab,QAAQ9U,OAAQlC,IAClE4X,EAAOxV,KAAKyV,EAAab,QAAQhX,QAKrC,KAAK,GADD8X,GAAcD,EAAaZ,MAAM,KAC5BjX,EAAI,EAAGA,EAAI8X,EAAY5V,OAAQlC,IAChC8X,EAAY9X,GAAGkC,OAAS,GACxB0V,EAAOxV,KAAK0V,EAAY9X,GAGpC,OAAO,IAAI6W,GAAKe,EAAQ,IAK5Bf,EAAK3V,UAAU6W,QAAU,WACrB,MAAO5R,MAAKgR,WAAahR,KAAK6Q,QAAQ9U,QAO1C2U,EAAKmB,aAAe,SAAUC,EAAWC,GACrC,GAAIC,GAAQF,EAAUb,WAAYhK,EAAQ8K,EAAUd,UACpD,IAAc,OAAVe,EACA,MAAOD,EAEN,IAAIC,IAAU/K,EACf,MAAOyJ,GAAKmB,aAAaC,EAAUX,WAAYY,EAAUZ,WAGzD,MAAM,IAAIxG,OAAM,8BACZoH,EACA,8BAEAD,EACA,MAQZpB,EAAKuB,aAAe,SAAUC,EAAMC,GAGhC,IAAK,GAFDC,GAAWF,EAAKtV,QAChByV,EAAYF,EAAMvV,QACb/C,EAAI,EAAGA,EAAIuY,EAASrW,QAAUlC,EAAIwY,EAAUtW,OAAQlC,IAAK,CAC9D,GAAIyY,GAAMvK,EAAOsE,YAAY+F,EAASvY,GAAIwY,EAAUxY,GACpD,IAAY,IAARyY,EACA,MAAOA,GAEf,MAAIF,GAASrW,SAAWsW,EAAUtW,OACvB,EACJqW,EAASrW,OAASsW,EAAUtW,QAAU,EAAI,GAOrD2U,EAAK3V,UAAUwX,OAAS,SAAUC,GAC9B,GAAIxS,KAAKkR,cAAgBsB,EAAMtB,YAC3B,OAAO,CAEX,KAAK,GAAIrX,GAAImG,KAAKgR,UAAW3O,EAAImQ,EAAMxB,UAAWnX,GAAKmG,KAAK6Q,QAAQ9U,OAAQlC,IAAKwI,IAC7E,GAAIrC,KAAK6Q,QAAQhX,KAAO2Y,EAAM3B,QAAQxO,GAClC,OAAO,CAGf,QAAO,GAOXqO,EAAK3V,UAAU0X,SAAW,SAAUD,GAChC,GAAI3Y,GAAImG,KAAKgR,UACT3O,EAAImQ,EAAMxB,SACd,IAAIhR,KAAKkR,YAAcsB,EAAMtB,YACzB,OAAO,CAEX,MAAOrX,EAAImG,KAAK6Q,QAAQ9U,QAAQ,CAC5B,GAAIiE,KAAK6Q,QAAQhX,KAAO2Y,EAAM3B,QAAQxO,GAClC,OAAO,IAETxI,IACAwI,EAEN,OAAO,GAEJqO,IAEX/W,GAAQ+W,KAAOA,CAWf,IAAIgC,GAAgC,WAKhC,QAASA,GAAe1D,EAAM2D,GAC1B3S,KAAK2S,aAAeA,EAEpB3S,KAAK4S,OAAS5D,EAAKpS,QAEnBoD,KAAK6S,YAAc7G,KAAK8G,IAAI,EAAG9S,KAAK4S,OAAO7W,OAC3C,KAAK,GAAIlC,GAAI,EAAGA,EAAImG,KAAK4S,OAAO7W,OAAQlC,IACpCmG,KAAK6S,aAAe7K,EAAO+K,aAAa/S,KAAK4S,OAAO/Y,GAExDmG,MAAKgT,cAgET,MA9DA1Y,QAAOC,eAAemY,EAAgB,kBAElChY,IAAK,WACD,MAAO,KAEXD,YAAY,EACZD,cAAc,IAElBF,OAAOC,eAAemY,EAAgB,yBAElChY,IAAK,WACD,MAAO,MAEXD,YAAY,EACZD,cAAc,IAGlBkY,EAAe3X,UAAUkB,KAAO,SAAUP,GAElCsE,KAAK4S,OAAO7W,OAAS,IACrBiE,KAAK6S,aAAe,GAExB7S,KAAK4S,OAAO3W,KAAKP,GACjBsE,KAAK6S,aAAe7K,EAAO+K,aAAarX,GACxCsE,KAAKgT,eAETN,EAAe3X,UAAUmB,IAAM,WAC3B,GAAI+W,GAAOjT,KAAK4S,OAAO1W,KACvB8D,MAAK6S,aAAe7K,EAAO+K,aAAaE,GAEpCjT,KAAK4S,OAAO7W,OAAS,IACrBiE,KAAK6S,aAAe,IAG5BH,EAAe3X,UAAUiY,YAAc,WACnC,GAAIhT,KAAK6S,YAAcH,EAAeQ,sBAClC,KAAM,IAAIvI,OAAM3K,KAAK2S,aACjB,8BACAD,EAAeQ,sBACf,WACAlT,KAAK6S,YACL,KAER,IAAI7S,KAAK4S,OAAO7W,OAAS2W,EAAeS,eACpC,KAAM,IAAIxI,OAAM3K,KAAK2S,aACjB,iEACAD,EAAeS,eACf,gCACAnT,KAAKoT,kBAQjBV,EAAe3X,UAAUqY,cAAgB,WACrC,MAA0B,IAAtBpT,KAAK4S,OAAO7W,OACL,GAEJ,gBAAkBiE,KAAK4S,OAAO3E,KAAK,KAAO,KAE9CyE,IAEX/Y,GAAQ+Y,eAAiBA,GN2qDnB,SAAU9Y,EAAQD,EAASH,GAEjC,YO9+DO,SAAS6Z,GAAkBC,GAChC,MAAKA,GAGL,SAAgBA,EAFP,GP++DXhZ,OAAOC,eAAeZ,EAAS,cAC7ByB,OAAO,IAETzB,EOp/DgB0Z,oBP8/DV,SAAUzZ,EAAQD,EAASH,GAEjC,YQj+DA,SAAS+Z,GAAgBlG,GACrBmG,EAAenG,EAGnB,QAASoG,GAAWpG,GAChBqG,EAAWrG,EAtBf,GAAIsG,GAAyC,WACzC,GAAIC,GAAgBtZ,OAAOuZ,iBACpBC,uBAA2BvK,QAAS,SAAUrP,EAAGoS,GAAKpS,EAAE4Z,UAAYxH,IACvE,SAAUpS,EAAGoS,GAAK,IAAK,GAAIrR,KAAKqR,GAAOA,EAAEtR,eAAeC,KAAIf,EAAEe,GAAKqR,EAAErR,IACzE,OAAO,UAAUf,EAAGoS,GAEhB,QAASyH,KAAO/T,KAAK6D,YAAc3J,EADnC0Z,EAAc1Z,EAAGoS,GAEjBpS,EAAEa,UAAkB,OAANuR,EAAahS,OAAO0Z,OAAO1H,IAAMyH,EAAGhZ,UAAYuR,EAAEvR,UAAW,GAAIgZ,OAGvFzZ,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAIIoY,GACAE,EALAO,EAAUza,EAAQ,IAClBuO,EAASvO,EAAQ,GACjB0a,EAAS1a,EAAQ,GACjB2a,EAAa3a,EAAQ,GAMzBG,GAAQ4Z,gBAAkBA,EAI1B5Z,EAAQ8Z,WAAaA,CAMrB,IAAIW,GAA+B,SAAUC,GAEzC,QAASD,KACL,MAAkB,QAAXC,GAAmBA,EAAO5K,MAAMzJ,KAAMlE,YAAckE,KAuD/D,MAzDA2T,GAAUS,EAAeC,GAOzBD,EAAcrZ,UAAUuZ,QAAU,SAAUvS,EAAGuK,GAC3C,GAAIiI,GAAYxS,EAAExE,KAAKiX,cACnBC,EAAYnI,EAAE/O,KAAKiX,cACnBE,EAAWH,EAAUI,UAAUF,EACnC,OAAiB,KAAbC,EACO3M,EAAOsE,YAAYtK,EAAE5H,KAAMmS,EAAEnS,MAG7Bua,GAMfN,EAAcrZ,UAAU6Z,YAAc,SAAUrX,GAC5C,OAAQA,EAAKiX,cAAc5C,WAK/BwC,EAAcrZ,UAAU8Z,oBAAsB,SAAUC,EAASC,GAC7D,OAAQD,EAAQN,cAAcjC,OAAOwC,EAAQP,gBAKjDJ,EAAcrZ,UAAUia,QAAU,WAC9B,MAAOd,GAAOe,UAAUC,KAK5Bd,EAAcrZ,UAAUoa,QAAU,WAC9B,MAAO,IAAIjB,GAAOe,UAAUlN,EAAOqE,SAAU,GAAI+H,GAAWiB,SAAS,kBAAmB1B,KAO5FU,EAAcrZ,UAAUsa,SAAW,SAAUC,EAAYnb,GACrD,GAAIob,GAAe/B,EAAa8B,EAChC,OAAO,IAAIpB,GAAOe,UAAU9a,EAAM,GAAIga,GAAWiB,SAAS,kBAAmBG,KAKjFnB,EAAcrZ,UAAUuT,SAAW,WAC/B,MAAO,aAEJ8F,GACTH,EAAQuB,MACV7b,GAAQya,cAAgBA,EACxBza,EAAQ8b,eAAiB,GAAIrB,IR+gEvB,SAAUxa,EAAQD,EAASH,GAEjC,YS5mEA,IAAIma,GAAyC,WACzC,GAAIC,GAAgBtZ,OAAOuZ,iBACpBC,uBAA2BvK,QAAS,SAAUrP,EAAGoS,GAAKpS,EAAE4Z,UAAYxH,IACvE,SAAUpS,EAAGoS,GAAK,IAAK,GAAIrR,KAAKqR,GAAOA,EAAEtR,eAAeC,KAAIf,EAAEe,GAAKqR,EAAErR,IACzE,OAAO,UAAUf,EAAGoS,GAEhB,QAASyH,KAAO/T,KAAK6D,YAAc3J,EADnC0Z,EAAc1Z,EAAGoS,GAEjBpS,EAAEa,UAAkB,OAANuR,EAAahS,OAAO0Z,OAAO1H,IAAMyH,EAAGhZ,UAAYuR,EAAEvR,UAAW,GAAIgZ,OAGvFzZ,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAWIsa,GAXA3N,EAASvO,EAAQ,GACjBwO,EAASxO,EAAQ,GACjBmc,EAAcnc,EAAQ,IACtB0a,EAAS1a,EAAQ,GACjBoc,EAASpc,EAAQ,IACjBqc,EAAkBrc,EAAQ,GAC1Bsc,EAAatc,EAAQ,IACrBuc,EAAavc,EAAQ,IACrB2a,EAAa3a,EAAQ,IACrBwc,EAAgBxc,EAAQ,IAWxByc,EAA8B,WAQ9B,QAASA,GAAaC,EAAWC,EAAeC,GAC5CpW,KAAKkW,UAAYA,EACjBlW,KAAKmW,cAAgBA,EACrBnW,KAAKoW,UAAYA,EACjBpW,KAAKqW,UAAY,KAMbrW,KAAKmW,eACLP,EAAOU,qBAAqBtW,KAAKmW,eAEjCnW,KAAKkW,UAAUtE,WACf7J,EAAOiC,QAAQhK,KAAKmW,eAAiBnW,KAAKmW,cAAcvE,UAAW,wCAuX3E,MApXAtX,QAAOC,eAAe0b,EAAc,cAChCvb,IAAK,WACD,MAAQgb,KACHA,EAAa,GAAIO,GAAa,GAAIN,GAAYY,UAAUP,EAAcQ,iBAAkB,KAAMT,EAAWU,SAASC,WAE3Hjc,YAAY,EACZD,cAAc,IAGlByb,EAAalb,UAAU4b,WAAa,WAChC,OAAO,GAGXV,EAAalb,UAAUyZ,YAAc,WACjC,MAAOxU,MAAKmW,eAAiBT,GAGjCO,EAAalb,UAAU6b,eAAiB,SAAUC,GAC9C,MAAI7W,MAAKkW,UAAUtE,UAER5R,KAGA,GAAIiW,GAAajW,KAAKkW,UAAWW,EAAiB7W,KAAKoW,YAItEH,EAAalb,UAAU+b,kBAAoB,SAAUC,GAEjD,GAAkB,cAAdA,EACA,MAAO/W,MAAKwU,aAGZ,IAAI9Y,GAAQsE,KAAKkW,UAAUxb,IAAIqc,EAC/B,OAAiB,QAAVrb,EAAiBga,EAAaha,GAI7Cua,EAAalb,UAAUic,SAAW,SAAUhI,GACxC,GAAIiI,GAAQjI,EAAKiC,UACjB,OAAc,QAAVgG,EACOjX,KACJA,KAAK8W,kBAAkBG,GAAOD,SAAShI,EAAKmC,aAGvD8E,EAAalb,UAAUmc,SAAW,SAAUH,GACxC,MAAyC,QAAlC/W,KAAKkW,UAAUxb,IAAIqc,IAG9Bd,EAAalb,UAAUoc,qBAAuB,SAAUJ,EAAWK,GAE/D,GADArP,EAAOiC,OAAOoN,EAAc,8CACV,cAAdL,EACA,MAAO/W,MAAK4W,eAAeQ,EAG3B,IAAIC,GAAY,GAAInD,GAAOe,UAAU8B,EAAWK,GAC5CE,MAAc,GAAQC,MAAc,GAAQC,MAAc,EAU9D,OATIJ,GAAaxF,WACb0F,EAActX,KAAKkW,UAAU7L,OAAO0M,GACpCQ,EAAcvX,KAAKoW,UAAUqB,kBAAkBJ,EAAWrX,KAAKkW,aAG/DoB,EAActX,KAAKkW,UAAUwB,OAAOX,EAAWK,GAC/CG,EAAcvX,KAAKoW,UAAUuB,aAAaN,EAAWrX,KAAKkW,YAE9DsB,EAAcF,EAAY1F,UAAY8D,EAAa1V,KAAKmW,cACjD,GAAIF,GAAaqB,EAAaE,EAAaD,IAI1DtB,EAAalb,UAAU6c,YAAc,SAAU5I,EAAMoI,GACjD,GAAIH,GAAQjI,EAAKiC,UACjB,IAAc,OAAVgG,EACA,MAAOG,EAGPrP,GAAOiC,OAA2B,cAApBgF,EAAKiC,YAAmD,IAArBjC,EAAKkC,YAAmB,6CACzE,IAAI2G,GAAoB7X,KAAK8W,kBAAkBG,GAAOW,YAAY5I,EAAKmC,WAAYiG,EACnF,OAAOpX,MAAKmX,qBAAqBF,EAAOY,IAIhD5B,EAAalb,UAAU6W,QAAU,WAC7B,MAAO5R,MAAKkW,UAAUtE,WAG1BqE,EAAalb,UAAU+c,YAAc,WACjC,MAAO9X,MAAKkW,UAAU6B,SAG1B9B,EAAalb,UAAUsS,IAAM,SAAU2K,GACnC,GAAIhY,KAAK4R,UACL,MAAO,KACX,IAAInV,MACAwb,EAAU,EAAGC,EAAS,EAAGC,GAAiB,CAW9C,IAVAnY,KAAKoY,aAAavC,EAAgBJ,eAAgB,SAAUpZ,EAAKgc,GAC7D5b,EAAIJ,GAAOgc,EAAUhL,IAAI2K,GACzBC,IACIE,GAAkBlC,EAAa/G,gBAAgBpQ,KAAKzC,GACpD6b,EAASlM,KAAK8G,IAAIoF,EAAQ5M,OAAOjP,IAGjC8b,GAAiB,KAGpBH,GAAgBG,GAAkBD,EAAS,EAAID,EAAS,CAEzD,GAAIK,KACJ,KAAK,GAAIjc,KAAOI,GACZ6b,EAAMjc,GAAOI,EAAIJ,EACrB,OAAOic,GAMP,MAHIN,KAAiBhY,KAAKwU,cAAc5C,YACpCnV,EAAI,aAAeuD,KAAKwU,cAAcnH,OAEnC5Q,GAIfwZ,EAAalb,UAAUwd,KAAO,WAC1B,GAAuB,OAAnBvY,KAAKqW,UAAoB,CACzB,GAAImC,GAAW,EACVxY,MAAKwU,cAAc5C,YACpB4G,GACI,YACI5C,EAAO6C,iBAAiBzY,KAAKwU,cAAcnH,OAC3C,KACZrN,KAAKoY,aAAavC,EAAgBJ,eAAgB,SAAUpZ,EAAKgc,GAC7D,GAAIK,GAAYL,EAAUE,MACR,MAAdG,IACAF,GAAY,IAAMnc,EAAM,IAAMqc,KAEtC1Y,KAAKqW,UAAyB,KAAbmC,EAAkB,GAAKxQ,EAAOS,KAAK+P,GAExD,MAAOxY,MAAKqW,WAGhBJ,EAAalb,UAAU4d,wBAA0B,SAAU5B,EAAWsB,EAAWO,GAC7E,GAAIC,GAAM7Y,KAAK8Y,cAAcF,EAC7B,IAAIC,EAAK,CACL,GAAIE,GAAcF,EAAIG,kBAAkB,GAAI9E,GAAOe,UAAU8B,EAAWsB,GACxE,OAAOU,GAAcA,EAAY5e,KAAO,KAGxC,MAAO6F,MAAKkW,UAAU8C,kBAAkBjC,IAOhDd,EAAalb,UAAUke,kBAAoB,SAAUC,GACjD,GAAIL,GAAM7Y,KAAK8Y,cAAcI,EAC7B,IAAIL,EAAK,CACL,GAAIM,GAASN,EAAIM,QACjB,OAAOA,IAAUA,EAAOhf,KAGxB,MAAO6F,MAAKkW,UAAUiD,UAO9BlD,EAAalb,UAAUqe,cAAgB,SAAUF,GAC7C,GAAIC,GAASnZ,KAAKiZ,kBAAkBC,EACpC,OAAIC,GACO,GAAIjF,GAAOe,UAAUkE,EAAQnZ,KAAKkW,UAAUxb,IAAIye,IAGhD,MAQflD,EAAalb,UAAUse,iBAAmB,SAAUH,GAChD,GAAIL,GAAM7Y,KAAK8Y,cAAcI,EAC7B,IAAIL,EAAK,CACL,GAAIX,GAASW,EAAIX,QACjB,OAAOA,IAAUA,EAAO/d,KAGxB,MAAO6F,MAAKkW,UAAUgC,UAO9BjC,EAAalb,UAAUue,aAAe,SAAUJ,GAC5C,GAAIhB,GAASlY,KAAKqZ,iBAAiBH,EACnC,OAAIhB,GACO,GAAIhE,GAAOe,UAAUiD,EAAQlY,KAAKkW,UAAUxb,IAAIwd,IAGhD,MAMfjC,EAAalb,UAAUqd,aAAe,SAAUQ,EAAOW,GACnD,GAAIV,GAAM7Y,KAAK8Y,cAAcF,EAC7B,OAAIC,GACOA,EAAIW,iBAAiB,SAAUC,GAClC,MAAOF,GAAOE,EAAYtf,KAAMsf,EAAYlc,QAIzCyC,KAAKkW,UAAUsD,iBAAiBD,IAO/CtD,EAAalb,UAAU2e,YAAc,SAAUR,GAC3C,MAAOlZ,MAAK2Z,gBAAgBT,EAAgBlE,UAAWkE,IAQ3DjD,EAAalb,UAAU4e,gBAAkB,SAAUC,EAAWV,GAC1D,GAAIL,GAAM7Y,KAAK8Y,cAAcI,EAC7B,IAAIL,EACA,MAAOA,GAAIc,gBAAgBC,EAAW,SAAUvd,GAAO,MAAOA,IAK9D,KAFA,GAAI+K,GAAWpH,KAAKkW,UAAUyD,gBAAgBC,EAAUzf,KAAM+Z,EAAOe,UAAU4E,MAC3EpW,EAAO2D,EAAS0S,OACL,MAARrW,GAAgByV,EAAgB5E,QAAQ7Q,EAAMmW,GAAa,GAC9DxS,EAAS2S,UACTtW,EAAO2D,EAAS0S,MAEpB,OAAO1S,IAOf6O,EAAalb,UAAUif,mBAAqB,SAAUd,GAClD,MAAOlZ,MAAKia,uBAAuBf,EAAgB/D,UAAW+D,IAOlEjD,EAAalb,UAAUkf,uBAAyB,SAAUC,EAAShB,GAC/D,GAAIL,GAAM7Y,KAAK8Y,cAAcI,EAC7B,IAAIL,EACA,MAAOA,GAAIoB,uBAAuBC,EAAS,SAAU7d,GACjD,MAAOA,IAMX,KAFA,GAAI+K,GAAWpH,KAAKkW,UAAU+D,uBAAuBC,EAAQ/f,KAAM+Z,EAAOe,UAAU4E,MAChFpW,EAAO2D,EAAS0S,OACL,MAARrW,GAAgByV,EAAgB5E,QAAQ7Q,EAAMyW,GAAW,GAC5D9S,EAAS2S,UACTtW,EAAO2D,EAAS0S,MAEpB,OAAO1S,IAMf6O,EAAalb,UAAU4Z,UAAY,SAAUnC,GACzC,MAAIxS,MAAK4R,UACDY,EAAMZ,UACC,GAGC,EAGPY,EAAMmE,cAAgBnE,EAAMZ,UAC1B,EAEFY,IAAU7Y,EAAQ+Z,UACf,EAID,GAMfuC,EAAalb,UAAUof,UAAY,SAAUjB,GACzC,GAAIA,IAAoBpD,EAAWsE,WAC/Bpa,KAAKoW,UAAUiE,SAASnB,GACxB,MAAOlZ,KAGP,IAAIuX,GAAcvX,KAAKoW,UAAUkE,SAASpB,EAAiBlZ,KAAKkW,UAChE,OAAO,IAAID,GAAajW,KAAKkW,UAAWlW,KAAKmW,cAAeoB,IAMpEtB,EAAalb,UAAUwf,UAAY,SAAU3B,GACzC,MAAOA,KAAU9C,EAAWsE,WAAapa,KAAKoW,UAAUiE,SAASzB,IAKrE3C,EAAalb,UAAUwX,OAAS,SAAUC,GACtC,GAAIA,IAAUxS,KACV,OAAO,CAEN,IAAIwS,EAAMmE,aACX,OAAO,CAGP,IAAI6D,GAAoBhI,CACxB,IAAKxS,KAAKwU,cAAcjC,OAAOiI,EAAkBhG,eAG5C,IAAIxU,KAAKkW,UAAU6B,UAAYyC,EAAkBtE,UAAU6B,QAAS,CAKrE,IAJA,GAAI0C,GAAWza,KAAK0Z,YAAY7D,EAAgBJ,gBAC5CiF,EAAYF,EAAkBd,YAAY7D,EAAgBJ,gBAC1DkF,EAAcF,EAASV,UACvBa,EAAeF,EAAUX,UACtBY,GAAeC,GAAc,CAChC,GAAID,EAAYxgB,OAASygB,EAAazgB,OACjCwgB,EAAYpd,KAAKgV,OAAOqI,EAAard,MACtC,OAAO,CAEXod,GAAcF,EAASV,UACvBa,EAAeF,EAAUX,UAE7B,MAAuB,QAAhBY,GAAyC,OAAjBC,EAG/B,OAAO,EAlBP,OAAO,GA8BnB3E,EAAalb,UAAU+d,cAAgB,SAAUI,GAC7C,MAAIA,KAAoBpD,EAAWsE,UACxB,KAGApa,KAAKoW,UAAU1b,IAAIwe,EAAgB5K,aAOlD2H,EAAa/G,gBAAkB,iBACxB+G,IAEXtc,GAAQsc,aAAeA,CAMvB,IAAI4E,GAAyB,SAAUxG,GAEnC,QAASwG,KACL,MAAOxG,GAAOta,KAAKiG,KAAM,GAAI2V,GAAYY,UAAUP,EAAcQ,iBAAkBP,EAAaP,WAAYK,EAAWU,SAASC,UAAY1W,KAuBhJ,MAzBA2T,GAAUkH,EAASxG,GAInBwG,EAAQ9f,UAAU4Z,UAAY,SAAUnC,GACpC,MAAIA,KAAUxS,KACH,EAGA,GAGf6a,EAAQ9f,UAAUwX,OAAS,SAAUC,GAEjC,MAAOA,KAAUxS,MAErB6a,EAAQ9f,UAAUyZ,YAAc,WAC5B,MAAOxU,OAEX6a,EAAQ9f,UAAU+b,kBAAoB,SAAUC,GAC5C,MAAOd,GAAaP,YAExBmF,EAAQ9f,UAAU6W,QAAU,WACxB,OAAO,GAEJiJ,GACT5E,EACFtc,GAAQkhB,QAAUA,EAMlBlhB,EAAQ+Z,SAAW,GAAImH,GACvBvgB,OAAOwgB,iBAAiB5G,EAAOe,WAC3BC,KACI9Z,MAAO,GAAI8Y,GAAOe,UAAUjN,EAAOmE,SAAU8J,EAAaP,aAE9DqF,KACI3f,MAAO,GAAI8Y,GAAOe,UAAUjN,EAAOoE,SAAUzS,EAAQ+Z,aAM7DoC,EAAWkF,SAASC,aAAehF,EAAaP,WAChDvB,EAAWiB,SAAS8F,0BAA4BjF,EAChDL,EAAOnC,WAAW9Z,EAAQ+Z,UAC1BmC,EAAgBpC,WAAW9Z,EAAQ+Z,WT4mE7B,SAAU9Z,EAAQD,EAASH,GAEjC,YUnlFAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GAQtD,IAAI6Z,GAA2B,WAC3B,QAASA,GAAU9a,EAAMoD,GACrByC,KAAK7F,KAAOA,EACZ6F,KAAKzC,KAAOA,EAWhB,MAHA0X,GAAU4E,KAAO,SAAU1f,EAAMoD,GAC7B,MAAO,IAAI0X,GAAU9a,EAAMoD,IAExB0X,IAEXtb,GAAQsb,UAAYA,GV2mFd,SAAUrb,EAAQD,GWlpFxBC,EAAAD,SAAkBwhB,WAAA,yBAAAC,kBAAA,gCAAAC,4BAAA,wCAAAC,kBAAA,gCAAAC,4BAAA,wCAAAC,yBAAA,qCAAAC,qBAAA,iCAAAC,eAAA,6BAAAC,iBAAA,+BAAAC,iBAAA,iCXypFZ,SAAUhiB,EAAQD,EAASH,GAEjC,YY9oFA,SAASqiB,GAAsBC,GAC7B,MAAOxhB,QAAOuS,KAAKkP,GAChBhP,KAAK,SAAChL,EAAGuK,GAAJ,MAAUyP,GAAYzP,GAAKyP,EAAYha,KAC5Cia,KAAK,SAAAC,GAAA,MAAMH,GAAQC,EAAYE,KAGpC,QAASC,GAAuBC,GAC9B,OAAQA,GACN,IAAK,KACH,MAAO,aACT,KAAK,IACH,MAAO,OACT,KAAK,IACH,MAAO,OACT,KAAK,KACH,MAAO,aACT,KAAK,IACL,QACE,MAAO,UZ+nFb7hB,OAAOC,eAAeZ,EAAS,cAC7ByB,OAAO,GY1pFT,IAAM2gB,IACJK,GAAI,EACJC,EAAG,IACHC,EAAG,IACHC,EAAG,IACHC,GAAI,KZyrFN7iB,GYhqFSuiB,wBZiqFTviB,EYjqFgCkiB,wBZqqF1B,SAAUjiB,EAAQD,EAASH,GAEjC,YAkBA,IAAIoF,GAA4B,kBAAXuI,SAAoD,gBAApBA,QAAOC,SAAwB,SAAU3K,GAAO,aAAcA,IAAS,SAAUA,GAAO,MAAOA,IAAyB,kBAAX0K,SAAyB1K,EAAIoH,cAAgBsD,QAAU1K,IAAQ0K,OAAOpM,UAAY,eAAkB0B,Ga7sFtQnC,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAIqhB,GAASjjB,EAAQ,GACjBuO,EAASvO,EAAQ,GACjBwO,EAASxO,EAAQ,GACjByO,EAASzO,EAAQ,GACjB0O,EAAS1O,EAAQ,EAMrBG,GAAQ+iB,mBAAqB,iCAO7B/iB,EAAQgjB,oBAAsB,+BAM9BhjB,EAAQijB,eAAiB,SAKzBjjB,EAAQkjB,WAAa,SAAUxgB,GAC3B,MAAuB,gBAARA,IAAmC,IAAfA,EAAIN,SAAiBpC,EAAQ+iB,mBAAmB5d,KAAKzC,IAM5F1C,EAAQmjB,kBAAoB,SAAUzL,GAClC,MAA8B,gBAAfA,IACW,IAAtBA,EAAWtV,SACVpC,EAAQgjB,oBAAoB7d,KAAKuS,IAM1C1X,EAAQojB,sBAAwB,SAAU1L,GAKtC,MAJIA,KAEAA,EAAaA,EAAWnS,QAAQ,mBAAoB,MAEjDvF,EAAQmjB,kBAAkBzL,IAMrC1X,EAAQqjB,gBAAkB,SAAUC,GAChC,MAAqB,QAAbA,GACgB,gBAAbA,IACc,gBAAbA,KAA0BjV,EAAOoD,oBAAoB6R,IAC5DA,GAAgC,gBAApB,KAAOA,EAAP,YAAAre,EAAOqe,KAAyBlV,EAAO0K,SAASwK,EAAU,QAW/EtjB,EAAQujB,wBAA0B,SAAUC,EAAQC,EAAgB/R,EAAM2D,EAAMqO,GACxEA,OAAqBlhB,KAATkP,GAEhB1R,EAAQ2jB,qBAAqBrV,EAAOsV,YAAYJ,EAAQC,EAAgBC,GAAWhS,EAAM2D,IAS7FrV,EAAQ2jB,qBAAuB,SAAUC,EAAalS,EAAMmS,GACxD,GAAIxO,GAAOwO,YAAiBf,GAAO/L,KAAO,GAAI+L,GAAO/J,eAAe8K,EAAOD,GAAeC,CAC1F,QAAarhB,KAATkP,EACA,KAAM,IAAIV,OAAM4S,EAAc,sBAAwBvO,EAAKoE,gBAE/D,IAAoB,kBAAT/H,GACP,KAAM,IAAIV,OAAM4S,EACZ,uBACAvO,EAAKoE,gBACL,oBACA/H,EAAKiD,WAEb,IAAItG,EAAOoD,oBAAoBC,GAC3B,KAAM,IAAIV,OAAM4S,EAAc,YAAclS,EAAKiD,WAAa,IAAMU,EAAKoE,gBAG7E,IAAoB,gBAAT/H,IACPA,EAAKtP,OAASpC,EAAQijB,eAAiB,GACvC1U,EAAO6K,aAAa1H,GAAQ1R,EAAQijB,eACpC,KAAM,IAAIjS,OAAM4S,EACZ,kCACA5jB,EAAQijB,eACR,eACA5N,EAAKoE,gBACL,MACA/H,EAAKlM,UAAU,EAAG,IAClB,QAIR,IAAIkM,GAAwB,gBAAhB,KAAOA,EAAP,YAAAzM,EAAOyM,IAAmB,CAClC,GAAIoS,IAAgB,EAAOC,GAAmB,CAqB9C,IApBA3V,EAAOqF,QAAQ/B,EAAM,SAAUhP,EAAKjB,GAChC,GAAY,WAARiB,EACAohB,GAAgB,MAEf,IAAY,cAARphB,GAA+B,QAARA,IAC5BqhB,GAAmB,GACd/jB,EAAQkjB,WAAWxgB,IACpB,KAAM,IAAIsO,OAAM4S,EACZ,6BACAlhB,EACA,KACA2S,EAAKoE,gBACL,uFAIZpE,GAAK/S,KAAKI,GACV1C,EAAQ2jB,qBAAqBC,EAAaniB,EAAO4T,GACjDA,EAAK9S,QAELuhB,GAAiBC,EACjB,KAAM,IAAI/S,OAAM4S,EACZ,4BACAvO,EAAKoE,gBACL,sCAUhBzZ,EAAQgkB,2BAA6B,SAAUJ,EAAaK,GACxD,GAAI/jB,GAAGgkB,CACP,KAAKhkB,EAAI,EAAGA,EAAI+jB,EAAW7hB,OAAQlC,IAAK,CACpCgkB,EAAUD,EAAW/jB,EAErB,KAAK,GADDgT,GAAOgR,EAAQjhB,QACVyF,EAAI,EAAGA,EAAIwK,EAAK9Q,OAAQsG,IAC7B,GAAgB,cAAZwK,EAAKxK,IAAsBA,IAAMwK,EAAK9Q,OAAS,OAG9C,KAAKpC,EAAQkjB,WAAWhQ,EAAKxK,IAC9B,KAAM,IAAIsI,OAAM4S,EACZ,4BACA1Q,EAAKxK,GACL,aACAwb,EAAQvP,WACR,uFAQhBsP,EAAW7Q,KAAK0P,EAAO/L,KAAKuB,aAC5B,IAAI6L,GAAW,IACf,KAAKjkB,EAAI,EAAGA,EAAI+jB,EAAW7hB,OAAQlC,IAAK,CAEpC,GADAgkB,EAAUD,EAAW/jB,GACJ,OAAbikB,GAAqBA,EAASrL,SAASoL,GACvC,KAAM,IAAIlT,OAAM4S,EACZ,mBACAO,EAASxP,WACT,qCACAuP,EAAQvP,WAEhBwP,GAAWD,IAanBlkB,EAAQokB,6BAA+B,SAAUZ,EAAQC,EAAgB/R,EAAM2D,EAAMqO,GACjF,IAAIA,OAAqBlhB,KAATkP,EAAhB,CAEA,GAAIkS,GAActV,EAAOsV,YAAYJ,EAAQC,EAAgBC,EAC7D,KAAMhS,GAAwB,gBAAhB,KAAOA,EAAP,YAAAzM,EAAOyM,KAAsB9B,MAAMC,QAAQ6B,GACrD,KAAM,IAAIV,OAAM4S,EAAc,yDAElC,IAAIK,KACJ7V,GAAOqF,QAAQ/B,EAAM,SAAUhP,EAAKjB,GAChC,GAAIyiB,GAAU,GAAIpB,GAAO/L,KAAKrU,EAE9B,IADA1C,EAAQ2jB,qBAAqBC,EAAaniB,EAAO4T,EAAKtT,MAAMmiB,IAClC,cAAtBA,EAAQzM,YACHzX,EAAQqjB,gBAAgB5hB,GACzB,KAAM,IAAIuP,OAAM4S,EACZ,kCACAM,EAAQvP,WACR,+FAIZsP,GAAW3hB,KAAK4hB,KAEpBlkB,EAAQgkB,2BAA2BJ,EAAaK,KAEpDjkB,EAAQqkB,iBAAmB,SAAUb,EAAQC,EAAgBH,EAAUI,GACnE,IAAIA,OAAyBlhB,KAAb8gB,EAAhB,CAEA,GAAIjV,EAAOoD,oBAAoB6R,GAC3B,KAAM,IAAItS,OAAM1C,EAAOsV,YAAYJ,EAAQC,EAAgBC,GACvD,MACAJ,EAAS3O,WACT,4FAGR,KAAK3U,EAAQqjB,gBAAgBC,GACzB,KAAM,IAAItS,OAAM1C,EAAOsV,YAAYJ,EAAQC,EAAgBC,GACvD,yFAGZ1jB,EAAQskB,kBAAoB,SAAUd,EAAQC,EAAgBc,EAAWb,GACrE,IAAIA,OAA0BlhB,KAAd+hB,EAEhB,OAAQA,GACJ,IAAK,QACL,IAAK,cACL,IAAK,gBACL,IAAK,gBACL,IAAK,cACD,KACJ,SACI,KAAM,IAAIvT,OAAM1C,EAAOsV,YAAYJ,EAAQC,EAAgBC,GACvD,8GAIhB1jB,EAAQwkB,YAAc,SAAUhB,EAAQC,EAAgB/gB,EAAKghB,GACzD,KAAIA,OAAoBlhB,KAARE,GAEX1C,EAAQkjB,WAAWxgB,IACpB,KAAM,IAAIsO,OAAM1C,EAAOsV,YAAYJ,EAAQC,EAAgBC,GACvD,yBACAhhB,EACA,qGAGZ1C,EAAQykB,mBAAqB,SAAUjB,EAAQC,EAAgB/L,EAAYgM,GACvE,KAAIA,OAA2BlhB,KAAfkV,GAEX1X,EAAQmjB,kBAAkBzL,IAC3B,KAAM,IAAI1G,OAAM1C,EAAOsV,YAAYJ,EAAQC,EAAgBC,GACvD,0BACAhM,EACA,qFAGZ1X,EAAQ0kB,uBAAyB,SAAUlB,EAAQC,EAAgB/L,EAAYgM,GACvEhM,IAEAA,EAAaA,EAAWnS,QAAQ,mBAAoB,MAExDvF,EAAQykB,mBAAmBjB,EAAQC,EAAgB/L,EAAYgM,IAEnE1jB,EAAQ2kB,qBAAuB,SAAUnB,EAAQnO,GAC7C,GAAwB,UAApBA,EAAKiC,WACL,KAAM,IAAItG,OAAMwS,EAAS,8CAGjCxjB,EAAQ4kB,YAAc,SAAUpB,EAAQC,EAAgBoB,GAEpD,GAAInN,GAAamN,EAAUxP,KAAKV,UAChC,IAAyC,gBAA5BkQ,GAAUC,SAASC,MACO,IAAnCF,EAAUC,SAASC,KAAK3iB,SACvBpC,EAAQkjB,WAAW2B,EAAUC,SAASE,YAChB,IAAtBtN,EAAWtV,SAAiBpC,EAAQojB,sBAAsB1L,GAC3D,KAAM,IAAI1G,OAAM1C,EAAOsV,YAAYJ,EAAQC,GAAgB,GACvD,yFAIZzjB,EAAQilB,mBAAqB,SAAUzB,EAAQC,EAAgByB,EAAMxB,GACjE,KAAIA,OAAqBlhB,KAAT0iB,IAEM,gBAATA,GACT,KAAM,IAAIlU,OAAM1C,EAAOsV,YAAYJ,EAAQC,EAAgBC,GACvD,2CAEZ1jB,EAAQmlB,gBAAkB,SAAU3B,EAAQC,EAAgB2B,EAAM1B,GAC9D,KAAIA,OAAqBlhB,KAAT4iB,IAEI,iBAATA,GACP,KAAM,IAAIpU,OAAM1C,EAAOsV,YAAYJ,EAAQC,EAAgBC,GAAY,uBAE/E1jB,EAAQqlB,eAAiB,SAAU7B,EAAQC,EAAgB6B,EAAQ5B,GAC/D,KAAIA,OAAuBlhB,KAAX8iB,IAEQ,gBAAXA,GACT,KAAM,IAAItU,OAAM1C,EAAOsV,YAAYJ,EAAQC,EAAgBC,GACvD,4BAGZ1jB,EAAQulB,eAAiB,SAAU/B,EAAQC,EAAgB3gB,EAAK4gB,GAC5D,KAAIA,OAAoBlhB,KAARM,GAEVA,GAAsB,gBAAf,KAAOA,EAAP,YAAAmC,EAAOnC,KAA6B,OAARA,GACrC,KAAM,IAAIkO,OAAM1C,EAAOsV,YAAYJ,EAAQC,EAAgBC,GACvD,4BAGZ1jB,EAAQwlB,0BAA4B,SAAUhC,EAAQC,EAAgB3gB,EAAKJ,EAAKghB,EAAU+B,GAEtF,IADwB3iB,GAAsB,gBAAf,KAAOA,EAAP,YAAAmC,EAAOnC,MAAoBsL,EAAO0K,SAAShW,EAAKJ,GACvD,CACpB,GAAIghB,EACA,MAGA,MAAM,IAAI1S,OAAM1C,EAAOsV,YAAYJ,EAAQC,EAAgBC,GACvD,yBACAhhB,EACA,KAGZ,GAAI+iB,EAAU,CACV,GAAI/R,GAAMtF,EAAOsX,QAAQ5iB,EAAKJ,EAC9B,IAAkB,WAAb+iB,GAA0C,gBAAR/R,IACrB,WAAb+R,GAA0C,gBAAR/R,IACrB,YAAb+R,GAA2C,iBAAR/R,IACtB,aAAb+R,GAA4C,kBAAR/R,IACvB,WAAb+R,GAA0C,gBAAf,KAAO/R,EAAP,YAAAzO,EAAOyO,KAAqBA,EACxD,KAAIgQ,GACM,GAAI1S,OAAM1C,EAAOsV,YAAYJ,EAAQC,EAAgBC,GACvD,mCACAhhB,EACA,uBACA+iB,EACA,MAGE,GAAIzU,OAAM1C,EAAOsV,YAAYJ,EAAQC,EAAgBC,GACvD,yBACAhhB,EACA,gBACA+iB,EACA,QbonFd,SAAUxlB,EAAQD,EAASH,GAEjC,Yc59FAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAI2M,GAASvO,EAAQ,IAMrB,SAAW8lB,GACPA,EAAcA,EAAA,UAA6B,GAAK,YAChDA,EAAcA,EAAA,MAAyB,GAAK,QAC5CA,EAAcA,EAAA,eAAkC,GAAK,iBACrDA,EAAcA,EAAA,gBAAmC,GAAK,mBACvC3lB,EAAQ2lB,gBAAkB3lB,EAAQ2lB,kBAQrD,IAAIC,GAAiC,WACjC,QAASA,GAAgBC,EAAUC,EAAYC,EAASC,GACpD3f,KAAKwf,SAAWA,EAChBxf,KAAKyf,WAAaA,EAClBzf,KAAK0f,QAAUA,EACf1f,KAAK2f,OAASA,EACd5X,EAAOiC,QAAQ2V,GAAUF,EAAY,uCAyBzC,MAnBAF,GAAgBK,KAAO,GAAIL,IACb,GAAM,EAAO,MACf,GAKZA,EAAgBM,OAAS,GAAIN,IAAgB,GAC7B,EAAM,MACV,GAKZA,EAAgBO,qBAAuB,SAAUJ,GAC7C,MAAO,IAAIH,IAAgB,GACX,EAAMG,GACV,IAETH,IAEX5lB,GAAQ4lB,gBAAkBA,Gdo/FpB,SAAU3lB,EAAQD,EAASH,GAEjC,Yeh/FA,SAASumB,GAAOC,EAAUC,GACxB,GAAIC,EAAOF,GAET,MAAO,IAAIG,MAAKH,EAASI,UACpB,IAAwB,gBAAbJ,GAChB,MAAO,IAAIG,MAAKH,EAGlB,IAAI1jB,GAAU2jB,MACVI,EAAmB/jB,EAAQ+jB,gBAE7BA,GADsB,MAApBA,EACiBC,EAEAhV,OAAO+U,EAG5B,IAAIE,GAAcC,EAAgBR,GAE9BS,EAAkBC,EAAUH,EAAYI,KAAMN,GAC9CO,EAAOH,EAAgBG,KACvBC,EAAiBJ,EAAgBI,eAEjCF,EAAOG,EAAUD,EAAgBD,EAErC,IAAID,EAAM,CACR,GAEII,GAFAC,EAAYL,EAAKP,UACjBxQ,EAAO,CAeX,OAZI2Q,GAAY3Q,OACdA,EAAOqR,EAAUV,EAAY3Q,OAG3B2Q,EAAYW,SACdH,EAASI,EAAcZ,EAAYW,WAGnCH,EAAS,GAAIZ,MAAKa,EAAYpR,GAAMwR,oBACpCL,EAAS,GAAIZ,MAAKa,EAAYpR,EAAOmR,EAASM,GAAwBD,qBAGjE,GAAIjB,MAAKa,EAAYpR,EAAOmR,EAASM,GAE5C,MAAO,IAAIlB,MAAKH,GAIpB,QAASQ,GAAiBc,GACxB,GAEIC,GAFAhB,KACAjI,EAAQgJ,EAAWxQ,MAAM0Q,EAW7B,IARIC,EAAoB3iB,KAAKwZ,EAAM,KACjCiI,EAAYI,KAAO,KACnBY,EAAajJ,EAAM,KAEnBiI,EAAYI,KAAOrI,EAAM,GACzBiJ,EAAajJ,EAAM,IAGjBiJ,EAAY,CACd,GAAIG,GAAQC,EAAmBC,KAAKL,EAChCG,IACFnB,EAAY3Q,KAAO2R,EAAWriB,QAAQwiB,EAAM,GAAI,IAChDnB,EAAYW,SAAWQ,EAAM,IAE7BnB,EAAY3Q,KAAO2R,EAIvB,MAAOhB,GAGT,QAASG,GAAWY,EAAYjB,GAC9B,GAGIqB,GAHAG,EAAgBC,EAAezB,GAC/B0B,EAAkBC,EAAiB3B,EAMvC,IADAqB,EAAQO,EAAeL,KAAKN,IAAeS,EAAgBH,KAAKN,GACrD,CACT,GAAIY,GAAaR,EAAM,EACvB,QACEd,KAAMxS,SAAS8T,EAAY,IAC3BrB,eAAgBS,EAAW1kB,MAAMslB,EAAWnmB,SAMhD,GADA2lB,EAAQS,EAAaP,KAAKN,IAAeO,EAAcD,KAAKN,GACjD,CACT,GAAIc,GAAgBV,EAAM,EAC1B,QACEd,KAAoC,IAA9BxS,SAASgU,EAAe,IAC9BvB,eAAgBS,EAAW1kB,MAAMwlB,EAAcrmB,SAKnD,OACE6kB,KAAM,MAIV,QAASE,GAAWQ,EAAYV,GAE9B,GAAa,OAATA,EACF,MAAO,KAGT,IAAIc,GACAf,EACA0B,EACAC,CAGJ,IAA0B,IAAtBhB,EAAWvlB,OAGb,MAFA4kB,GAAO,GAAIR,MAAK,GAChBQ,EAAK4B,eAAe3B,GACbD,CAKT,IADAe,EAAQc,EAAaZ,KAAKN,GAKxB,MAHAX,GAAO,GAAIR,MAAK,GAChBkC,EAAQjU,SAASsT,EAAM,GAAI,IAAM,EACjCf,EAAK4B,eAAe3B,EAAMyB,GACnB1B,CAKT,IADAe,EAAQe,EAAcb,KAAKN,GAChB,CACTX,EAAO,GAAIR,MAAK,EAChB,IAAIuC,GAAYtU,SAASsT,EAAM,GAAI,GAEnC,OADAf,GAAK4B,eAAe3B,EAAM,EAAG8B,GACtB/B,EAKT,GADAe,EAAQiB,EAAef,KAAKN,GACjB,CACTX,EAAO,GAAIR,MAAK,GAChBkC,EAAQjU,SAASsT,EAAM,GAAI,IAAM,CACjC,IAAIkB,GAAMxU,SAASsT,EAAM,GAAI,GAE7B,OADAf,GAAK4B,eAAe3B,EAAMyB,EAAOO,GAC1BjC,EAKT,GADAe,EAAQmB,EAAcjB,KAAKN,GAGzB,MADAgB,GAAOlU,SAASsT,EAAM,GAAI,IAAM,EACzBoB,EAAalC,EAAM0B,EAK5B,IADAZ,EAAQqB,EAAenB,KAAKN,GACjB,CACTgB,EAAOlU,SAASsT,EAAM,GAAI,IAAM,CAEhC,OAAOoB,GAAalC,EAAM0B,EADVlU,SAASsT,EAAM,GAAI,IAAM,GAK3C,MAAO,MAGT,QAAST,GAAWM,GAClB,GAAIG,GACAsB,EACAC,CAIJ,IADAvB,EAAQwB,EAAatB,KAAKL,GAGxB,OADAyB,EAAQG,WAAWzB,EAAM,GAAGxiB,QAAQ,IAAK,OACzB,GAAMkkB,CAKxB,IADA1B,EAAQ2B,EAAezB,KAAKL,GAI1B,MAFAyB,GAAQ5U,SAASsT,EAAM,GAAI,IAC3BuB,EAAUE,WAAWzB,EAAM,GAAGxiB,QAAQ,IAAK,MACnC8jB,EAAQ,GAAMI,EACpBH,EAAU5B,CAKd,IADAK,EAAQ4B,EAAiB1B,KAAKL,GACnB,CACTyB,EAAQ5U,SAASsT,EAAM,GAAI,IAC3BuB,EAAU7U,SAASsT,EAAM,GAAI,GAC7B,IAAI6B,GAAUJ,WAAWzB,EAAM,GAAGxiB,QAAQ,IAAK,KAC/C,OAAQ8jB,GAAQ,GAAMI,EACpBH,EAAU5B,EACA,IAAVkC,EAIJ,MAAO,MAGT,QAASpC,GAAeqC,GACtB,GAAI9B,GACA+B,CAIJ,QADA/B,EAAQgC,EAAoB9B,KAAK4B,IAExB,GAIT9B,EAAQiC,EAAqB/B,KAAK4B,KAEhCC,EAA0C,GAAzBrV,SAASsT,EAAM,GAAI,IACf,MAAbA,EAAM,IAAe+B,EAAiBA,IAIhD/B,EAAQkC,EAAuBhC,KAAK4B,GAChC9B,GACF+B,EAA0C,GAAzBrV,SAASsT,EAAM,GAAI,IAAWtT,SAASsT,EAAM,GAAI,IAC7C,MAAbA,EAAM,IAAe+B,EAAiBA,GAGzC,GAGT,QAASX,GAAce,EAASvB,EAAMM,GACpCN,EAAOA,GAAQ,EACfM,EAAMA,GAAO,CACb,IAAIjC,GAAO,GAAIR,MAAK,EACpBQ,GAAK4B,eAAesB,EAAS,EAAG,EAChC,IAAIC,GAAqBnD,EAAKoD,aAAe,EACzCxjB,EAAc,EAAP+hB,EAAWM,EAAM,EAAIkB,CAEhC,OADAnD,GAAKqD,WAAWrD,EAAKsD,aAAe1jB,GAC7BogB,EA5TT,GAAIT,GAAS1mB,EAAQ,KAEjB4pB,EAAuB,KACvB/B,EAAyB,IACzBf,EAA4B,EAE5BkB,EAA8B,OAC9BC,EAAsB,IAGtBU,EAAe,YACfL,GACF,gBACA,gBACA,iBAGEG,EAAiB,WACjBD,GACF,eACA,eACA,gBAIEQ,EAAe,aACfC,EAAgB,cAChBE,EAAiB,uBACjBE,EAAgB,eAChBE,EAAiB,wBAGjBG,EAAe,sBACfG,EAAiB,+BACjBC,EAAmB,wCAGnB3B,EAAqB,aACrB+B,EAAsB,QACtBC,EAAuB,kBACvBC,EAAyB,0BAuR7BhqB,GAAOD,QAAUomB,Gf6jGX,SAAUnmB,EAAQD,EAASH,GAEjC,YAGAc,QAAOC,eAAeZ,EAAS,cAC7ByB,OAAO,IAETzB,EAAQuqB,iBAAe/nB,EgBl4GvB,IAAAgoB,GAAA3qB,EAAA,GAEA4qB,EAAA5qB,EAAA,IhBs4GI6qB,EAMJ,SAAgC5nB,GAAO,MAAOA,IAAOA,EAAI7B,WAAa6B,GAAQqL,QAASrL,IAN3C2nB,GgBr4G5CE,EAAA9qB,EAAA,GACA+qB,EAAA/qB,EAAA,EAEa0qB,gBAAe,SAACxnB,EAAY+D,GAA+B,GAC9D6S,GAAU7S,EAAV6S,KAER,QACE,EAAA6Q,EAAA7oB,GAAA,OAAKwE,WAAW,EAAAwkB,EAAApU,KAAImU,EAAAvc,QAAO0c,cAAc,EAAAD,EAAAlR,kBAAiBC,IACxDmR,MAAM,6BAA6B3I,MAAM,KAAK4I,OAAO,OACrD,EAAAP,EAAA7oB,GAAA,KAAGqpB,YAAU,YACX,EAAAR,EAAA7oB,GAAA,QAAMpB,EAAE,yLhBu5GV,SAAUN,EAAQD,EAASH,GAEjC,YiBx5GAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GAUtD,IAAIwpB,GAAwB,WACxB,QAASA,GAAO3kB,EAAM4kB,EAAc9N,EAAW+N,EAASC,GACpD/kB,KAAKC,KAAOA,EACZD,KAAK6kB,aAAeA,EACpB7kB,KAAK+W,UAAYA,EACjB/W,KAAK8kB,QAAUA,EACf9kB,KAAK+kB,SAAWA,EAqDpB,MA/CAH,GAAOI,YAAc,SAAUC,GAC3B,MAAO,IAAIL,GAAOA,EAAOM,MAAOD,IAOpCL,EAAOO,iBAAmB,SAAUC,EAAUH,GAC1C,MAAO,IAAIL,GAAOA,EAAOS,YAAaJ,EAAUG,IAOpDR,EAAOU,mBAAqB,SAAUF,EAAUH,GAC5C,MAAO,IAAIL,GAAOA,EAAOW,cAAeN,EAAUG,IAQtDR,EAAOY,mBAAqB,SAAUJ,EAAUK,EAAaC,GACzD,MAAO,IAAId,GAAOA,EAAOe,cAAeF,EAAaL,EAAUM,IAOnEd,EAAOgB,iBAAmB,SAAUR,EAAUH,GAC1C,MAAO,IAAIL,GAAOA,EAAOiB,YAAaZ,EAAUG,IAIpDR,EAAOS,YAAc,cAErBT,EAAOW,cAAgB,gBAEvBX,EAAOe,cAAgB,gBAEvBf,EAAOiB,YAAc,cAErBjB,EAAOM,MAAQ,QACRN,IAEXjrB,GAAQirB,OAASA,GjBg7GX,SAAUhrB,EAAQD,EAASH,GAEjC,YkBzgHO,SAASssB,GAAiBC,GAC/B,SAAUnpB,MAAM7C,KAAKgsB,GlB2gHvBzrB,OAAOC,eAAeZ,EAAS,cAC7ByB,OAAO,IAETzB,EkB/gHgBmsB,mBlBshHV,SAAUlsB,EAAQD,EAASH,GAEjC,YAGA,ImB3hHIwsB,GnB2hHApnB,EAA4B,kBAAXuI,SAAoD,gBAApBA,QAAOC,SAAwB,SAAU3K,GAAO,aAAcA,IAAS,SAAUA,GAAO,MAAOA,IAAyB,kBAAX0K,SAAyB1K,EAAIoH,cAAgBsD,QAAU1K,IAAQ0K,OAAOpM,UAAY,eAAkB0B,GmBxhHtQupB,GAAK,WACJ,MAAOhmB,QAGR,KAECgmB,EAAIA,GAAKC,SAAS,mBAAoB,EAAGC,MAAM,QAC9C,MAAMnmB,GAEc,YAAlB,mBAAO+K,QAAP,YAAAlM,EAAOkM,WACTkb,EAAIlb,QAONlR,EAAOD,QAAUqsB,GnBgiHX,SAAUpsB,EAAQD,EAASH,GAEjC,YAGgC,mBAAX2N,SAAgCA,OAAOC;;;CoBtjH3D,SAAUjN,EAAMgsB,GAEmBvsB,EAAOD,QAAUwsB,KAInD,EAAY,WAEZ,GAAcC,GAAVC,KACAC,EAAMpoB,SACNqoB,EAAOD,EAAIE,gBAAgBC,SAE3BC,GAAUH,EAAO,aAAe,iBAAiBznB,KAAKwnB,EAAI1a,WAU9D,OAPK8a,IACLJ,EAAIlnB,iBALmB,mBAKgBgnB,EAAW,WAGhD,IAFAE,EAAIhnB,oBANiB,mBAMqB8mB,GAC1CM,EAAS,EACFN,EAAWC,EAAIM,SAASP,MAG1B,SAAU1a,GACfgb,EAASjf,WAAWiE,EAAI,GAAK2a,EAAIpqB,KAAKyP,OpB+jHpC,SAAU9R,EAAQD,GqBxlHxBC,EAAAD,SAAkBitB,IAAA,kBAAAC,YAAA,wBAAAC,mCAAA,+CAAAC,wCAAA,oDAAAC,2BAAA,uCAAAC,UAAA,wBAAAC,yBAAA,qCAAAC,yBAAA,qCAAAC,kCAAA,8CAAAC,uCAAA,mDAAAC,0BAAA,wCrB+lHZ,SAAU1tB,EAAQD,EAASH,GAEjC,YsBvlHA,SAAS+tB,GAAcC,GACrB,MAAUC,GAAV,IAA2BD,EAGtB,QAASE,GAA0BF,GACxC,GAAMG,GAASC,EAAUJ,EACzB,OAAOG,IAAUA,EAAOE,sBAGnB,QAASD,GAAWJ,GACzB,GAAMM,GAAaP,EAAaC,GAC1BO,EAAsBC,EAAAlgB,QAAQpN,IAAIotB,EACxC,KACE,MAAOG,MAAKlI,MAAMgI,GAClB,MAAOtd,GACP,MAAO,OAIJ,QAASyd,GAAaV,EAAgBW,GAC3C,GAAML,GAAaP,EAAaC,GAC1BY,EAAcH,KAAKve,WACvB2e,UAAU,EACVR,sBAAuBM,IAEnBG,GAAkBC,QAASC,EAEjCR,GAAAlgB,QAAQsC,IAAI0d,EAAYM,EAAaE,GAGhC,QAASD,GAAUb,GACxB,GAAMG,GAASC,EAAUJ,EACzB,OAAOG,IAAUA,EAAOU,SAGnB,QAASI,KACd,MAAOC,WAAUC,ctBsjHnBruB,OAAOC,eAAeZ,EAAS,cAC7ByB,OAAO,IAETzB,EsBzlHgB+tB,2BtB0lHhB/tB,EsBrlHgBiuB,YtBslHhBjuB,EsB5kHgBuuB,ctB6kHhBvuB,EsBlkHgB0uB,WtBmkHhB1uB,EsB9jHgB8uB,gBA7ChB,IAAAG,GAAApvB,EAAA,ItB+mHIwuB,EAEJ,SAAgCvrB,GAAO,MAAOA,IAAOA,EAAI7B,WAAa6B,GAAQqL,QAASrL,IAFzCmsB,GsB7mHxCnB,EAAgB,YAChBe,EAAgB,KtB6pHhB,SAAU5uB,EAAQD,EAASH,GAEjC,YAGAc,QAAOC,eAAeZ,EAAS,cAC7ByB,OAAO,IAETzB,EAAQkvB,aAAW1sB,EuB1pHnB,IAAA2sB,GAAAtvB,EAAA,KACWqvB,cAAW,EAAAC,EAAAC,0BvB4qHtBpvB,GAAQmO,QuB3qHO+gB,GvBirHT,SAAUjvB,EAAQD,EAASH,GAEjC,YwBprHA,IAAIma,GAAyC,WACzC,GAAIC,GAAgBtZ,OAAOuZ,iBACpBC,uBAA2BvK,QAAS,SAAUrP,EAAGoS,GAAKpS,EAAE4Z,UAAYxH,IACvE,SAAUpS,EAAGoS,GAAK,IAAK,GAAIrR,KAAKqR,GAAOA,EAAEtR,eAAeC,KAAIf,EAAEe,GAAKqR,EAAErR,IACzE,OAAO,UAAUf,EAAGoS,GAEhB,QAASyH,KAAO/T,KAAK6D,YAAc3J,EADnC0Z,EAAc1Z,EAAGoS,GAEjBpS,EAAEa,UAAkB,OAANuR,EAAahS,OAAO0Z,OAAO1H,IAAMyH,EAAGhZ,UAAYuR,EAAEvR,UAAW,GAAIgZ,OAGvFzZ,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAII6f,GAJAhH,EAAUza,EAAQ,IAClB0a,EAAS1a,EAAQ,GACjBuO,EAASvO,EAAQ,GACjBwO,EAASxO,EAAQ,GAEjBwhB,EAA0B,SAAU3G,GAEpC,QAAS2G,KACL,MAAkB,QAAX3G,GAAmBA,EAAO5K,MAAMzJ,KAAMlE,YAAckE,KA8D/D,MAhEA2T,GAAUqH,EAAU3G,GAIpB/Z,OAAOC,eAAeygB,EAAU,gBAC5BtgB,IAAK,WACD,MAAOugB,IAEX7Q,IAAK,SAAUiD,GACX4N,EAAe5N,GAEnB5S,YAAY,EACZD,cAAc,IAKlBwgB,EAASjgB,UAAUuZ,QAAU,SAAUvS,EAAGuK,GACtC,MAAOvE,GAAOsE,YAAYtK,EAAE5H,KAAMmS,EAAEnS,OAKxC6gB,EAASjgB,UAAU6Z,YAAc,SAAUrX,GAGvC,KAAMyK,GAAOghB,eAAe,oDAKhChO,EAASjgB,UAAU8Z,oBAAsB,SAAUC,EAASC,GACxD,OAAO,GAKXiG,EAASjgB,UAAUia,QAAU,WACzB,MAAOd,GAAOe,UAAUC,KAK5B8F,EAASjgB,UAAUoa,QAAU,WAGzB,MAAO,IAAIjB,GAAOe,UAAUlN,EAAOqE,SAAU6O,IAOjDD,EAASjgB,UAAUsa,SAAW,SAAUC,EAAYnb,GAGhD,MAFA6N,GAAOgC,OAA6B,gBAAfsL,GAAyB,gDAEvC,GAAIpB,GAAOe,UAAUK,EAAY2F,IAK5CD,EAASjgB,UAAUuT,SAAW,WAC1B,MAAO,QAEJ0M,GACT/G,EAAQuB,MACV7b,GAAQqhB,SAAWA,EACnBrhB,EAAQygB,UAAY,GAAIY,IxBktHlB,SAAUphB,EAAQD,EAASH,GAEjC,YyBtxHA,SAASga,GAAayV,EAAMhM,GAExB,OADiB,KAAbA,IAAuBA,EAAW,MACzB,OAATgM,EACA,MAAOC,GAAejT,aAAaP,UAavC,IAXoB,gBAAhB,KAAOuT,EAAP,YAAArqB,EAAOqqB,KAAqB,aAAeA,KAC3ChM,EAAWgM,EAAK,cAEpBjhB,EAAOgC,OAAoB,OAAbiT,GACU,gBAAbA,IACa,gBAAbA,IACc,gBAApB,KAAOA,EAAP,YAAAre,EAAOqe,KAAyB,OAASA,GAAW,0CAAyCA,EAAzC,YAAAre,EAAyCqe,KAC9E,gBAAhB,KAAOgM,EAAP,YAAArqB,EAAOqqB,KAAqB,UAAYA,IAA2B,OAAnBA,EAAK,YACrDA,EAAOA,EAAK,WAGI,gBAAhB,KAAOA,EAAP,YAAArqB,EAAOqqB,KAAqB,OAASA,GAAM,CAC3C,GAAIE,GAAWF,CACf,OAAO,IAAI9U,GAAWiB,SAAS+T,EAAU3V,EAAayJ,IAE1D,GAAMgM,YAAgB1f,SAAU6f,EA2B3B,CACD,GAAIC,GAASH,EAAejT,aAAaP,WACrC4T,EAAYL,CAWhB,OAVAlhB,GAAOqF,QAAQkc,EAAW,SAAUjtB,EAAKktB,GACrC,GAAIxhB,EAAO0K,SAAS6W,EAAWjtB,IACC,MAAxBA,EAAI8C,UAAU,EAAG,GAAY,CAE7B,GAAIkZ,GAAY7E,EAAa+V,IACzBlR,EAAU1B,cAAiB0B,EAAUzG,YACrCyX,EAASA,EAAOlS,qBAAqB9a,EAAKgc,OAInDgR,EAAOzS,eAAepD,EAAayJ,IAvC1C,GAAIuM,MACAC,GAAyB,EACzBC,EAAiBT,CAYrB,IAXAlhB,EAAOqF,QAAQsc,EAAgB,SAAUrtB,EAAKX,GAC1C,GAAmB,gBAARW,IAA4C,MAAxBA,EAAI8C,UAAU,EAAG,GAAY,CAExD,GAAIkZ,GAAY7E,EAAakW,EAAertB,GACvCgc,GAAUzG,YACX6X,EACIA,IAA2BpR,EAAU7D,cAAc5C,UACvD4X,EAAWvtB,KAAK,GAAIiY,GAAOe,UAAU5Y,EAAKgc,QAI7B,GAArBmR,EAAWztB,OACX,MAAOmtB,GAAejT,aAAaP,UAEvC,IAAIiU,GAAWC,EAAWC,cAAcL,EAAYxT,EAAc8T,qBAAsB,SAAUzS,GAAa,MAAOA,GAAUld,MAAS6b,EAAcQ,gBACvJ,IAAIiT,EAAwB,CACxB,GAAIM,GAAiBH,EAAWC,cAAcL,EAAY3T,EAAgBJ,eAAeuU,aACzF,OAAO,IAAId,GAAejT,aAAa0T,EAAUnW,EAAayJ,GAAW,GAAIlH,GAAWU,UAAWwT,YAAaF,IAAoBE,YAAapU,EAAgBJ,kBAGjK,MAAO,IAAIyT,GAAejT,aAAa0T,EAAUnW,EAAayJ,GAAWlH,EAAWU,SAASC,SzB4vHzG,GAAI9X,GAA4B,kBAAXuI,SAAoD,gBAApBA,QAAOC,SAAwB,SAAU3K,GAAO,aAAcA,IAAS,SAAUA,GAAO,MAAOA,IAAyB,kBAAX0K,SAAyB1K,EAAIoH,cAAgBsD,QAAU1K,IAAQ0K,OAAOpM,UAAY,eAAkB0B,GyB1zHtQnC,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAI8tB,GAAiB1vB,EAAQ,GACzB2a,EAAa3a,EAAQ,IACrB0a,EAAS1a,EAAQ,GACjBuO,EAASvO,EAAQ,GACjBwO,EAASxO,EAAQ,GACjBowB,EAAapwB,EAAQ,IACrBwc,EAAgBxc,EAAQ,IACxBuc,EAAavc,EAAQ,IACrBqc,EAAkBrc,EAAQ,GAC1B4vB,GAAY,CAuEhBzvB,GAAQ6Z,aAAeA,EACvBqC,EAAgBtC,gBAAgBC,IzB+zH1B,SAAU5Z,EAAQD,EAASH,GAEjC,Y0B55HO,SAAS0wB,GACdC,EACAC,EACAC,GAEA,GAAMC,GAAWC,EAAaJ,EAC9BG,GAASld,QAAQ,SAAAod,GACfA,EAAGhiB,IAAK,EAAAiiB,EAAAC,QACR5f,OAAOqf,GAAsBK,EAAGhiB,KAAM,EAElC4hB,GAASA,EAAQI,KAcnBH,GAAcC,GAAYA,EAASvuB,QAAQsuB,EAAWC,GAGrD,QAASC,GAAcJ,GAC5B,OAAO,EAAAQ,EAAA7E,iBAAgB5nB,SAAS0sB,uBAAuBT,IAAuB7Z,OAC5E,SAAAka,GAAA,OAAOK,EAAcL,EAAIL,KAItB,QAASU,GAAeL,EAAiBL,GAC9C,MAAOK,GAAGhiB,IAAMsC,OAAOqf,GAAsBK,EAAGhiB,I1B63HlDlO,OAAOC,eAAeZ,EAAS,cAC7ByB,OAAO,IAETzB,E0Bl6HgBuwB,O1Bm6HhBvwB,E0Bx4HgB4wB,e1By4HhB5wB,E0Bn4HgBkxB,eAvChB,IAAAF,GAAAnxB,EAAA,IACAixB,EAAAjxB,EAAA,K1Bm9HM,SAAUI,EAAQD,EAASH,GAEjC,Y2Bv9HO,SAASkxB,KACd,UAAW1e,KAAK8e,SAASxc,SAAS,IAAID,OAAO,EAAG,G3By9HlD/T,OAAOC,eAAeZ,EAAS,cAC7ByB,OAAO,IAETzB,E2B79HgB+wB,Q3Bo+HV,SAAU9wB,EAAQD,EAASH,GAEjC,cAC4B,SAASuxB,GAErC,GAAInsB,GAA4B,kBAAXuI,SAAoD,gBAApBA,QAAOC,SAAwB,SAAU3K,GAAO,aAAcA,IAAS,SAAUA,GAAO,MAAOA,IAAyB,kBAAX0K,SAAyB1K,EAAIoH,cAAgBsD,QAAU1K,IAAQ0K,OAAOpM,UAAY,eAAkB0B,K4Bz+HtQ,SAAWuuB,GAMT,QAASC,MAGT,QAASzjB,GAAKkE,EAAIwf,GAChB,MAAO,YACLxf,EAAGjC,MAAMyhB,EAASpvB,YAItB,QAASuL,GAAQqE,GACf,GAAoB,WAAhB9M,EAAOoB,MAAmB,KAAM,IAAImrB,WAAU,uCAClD,IAAkB,kBAAPzf,GAAmB,KAAM,IAAIyf,WAAU,iBAClDnrB,MAAKorB,OAAS,EACdprB,KAAKqrB,UAAW,EAChBrrB,KAAKsrB,WAASnvB,GACd6D,KAAKurB,cAELC,EAAU9f,EAAI1L,MAGhB,QAASyrB,GAAOC,EAAMC,GACpB,KAAuB,IAAhBD,EAAKN,QACVM,EAAOA,EAAKJ,MAEd,IAAoB,IAAhBI,EAAKN,OAEP,WADAM,GAAKH,WAAWtvB,KAAK0vB,EAGvBD,GAAKL,UAAW,EAChBhkB,EAAQukB,aAAa,WACnB,GAAIC,GAAqB,IAAhBH,EAAKN,OAAeO,EAASG,YAAcH,EAASI,UAC7D,IAAW,OAAPF,EAEF,YADiB,IAAhBH,EAAKN,OAAe9jB,EAAU0kB,GAAQL,EAASM,QAASP,EAAKJ,OAGhE,IAAItqB,EACJ,KACEA,EAAM6qB,EAAGH,EAAKJ,QACd,MAAOvrB,GAEP,WADAisB,GAAOL,EAASM,QAASlsB,GAG3BuH,EAAQqkB,EAASM,QAASjrB,KAI9B,QAASsG,GAAQokB,EAAMQ,GACrB,IAEE,GAAIA,IAAaR,EAAM,KAAM,IAAIP,WAAU,4CAC3C,IAAIe,IAAiC,gBAApB,KAAOA,EAAP,YAAAttB,EAAOstB,KAA6C,kBAAbA,IAA0B,CAChF,GAAI3kB,GAAO2kB,EAAS3kB,IACpB,IAAI2kB,YAAoB7kB,GAItB,MAHAqkB,GAAKN,OAAS,EACdM,EAAKJ,OAASY,MACdC,GAAOT,EAEF,IAAoB,kBAATnkB,GAEhB,WADAikB,GAAUhkB,EAAKD,EAAM2kB,GAAWR,GAIpCA,EAAKN,OAAS,EACdM,EAAKJ,OAASY,EACdC,EAAOT,GACP,MAAO3rB,GACPisB,EAAON,EAAM3rB,IAIjB,QAASisB,GAAON,EAAMQ,GACpBR,EAAKN,OAAS,EACdM,EAAKJ,OAASY,EACdC,EAAOT,GAGT,QAASS,GAAOT,GACM,IAAhBA,EAAKN,QAA2C,IAA3BM,EAAKH,WAAWxvB,QACvCsL,EAAQukB,aAAa,WACdF,EAAKL,UACRhkB,EAAQ+kB,sBAAsBV,EAAKJ,SAKzC,KAAK,GAAIzxB,GAAI,EAAGgJ,EAAM6oB,EAAKH,WAAWxvB,OAAQlC,EAAIgJ,EAAKhJ,IACrD4xB,EAAOC,EAAMA,EAAKH,WAAW1xB,GAE/B6xB,GAAKH,WAAa,KAGpB,QAASc,GAAQP,EAAaC,EAAYE,GACxCjsB,KAAK8rB,YAAqC,kBAAhBA,GAA6BA,EAAc,KACrE9rB,KAAK+rB,WAAmC,kBAAfA,GAA4BA,EAAa,KAClE/rB,KAAKisB,QAAUA,EASjB,QAAST,GAAU9f,EAAIggB,GACrB,GAAIY,IAAO,CACX,KACE5gB,EAAG,SAAUtQ,GACPkxB,IACJA,GAAO,EACPhlB,EAAQokB,EAAMtwB,KACb,SAAU2T,GACPud,IACJA,GAAO,EACPN,EAAON,EAAM3c,MAEf,MAAOwd,GACP,GAAID,EAAM,MACVA,IAAO,EACPN,EAAON,EAAMa,IAxHjB,GAAIC,GAAiB/kB,UA4HrBJ,GAAQtM,UAAR,MAA6B,SAAUgxB,GACrC,MAAO/rB,MAAKuH,KAAK,KAAMwkB,IAGzB1kB,EAAQtM,UAAUwM,KAAO,SAAUukB,EAAaC,GAC9C,GAAIU,GAAO,GAAKzsB,MAAK6D,YAAaonB,EAGlC,OADAQ,GAAOzrB,KAAM,GAAIqsB,GAAQP,EAAaC,EAAYU,IAC3CA,GAGTplB,EAAQqlB,IAAM,SAAU3c,GACtB,GAAI4c,GAAOpjB,MAAMxO,UAAU6B,MAAM7C,KAAKgW,EAEtC,OAAO,IAAI1I,GAAQ,SAAUC,EAAS0kB,GAIpC,QAASY,GAAI/yB,EAAGwT,GACd,IACE,GAAIA,IAAuB,gBAAf,KAAOA,EAAP,YAAAzO,EAAOyO,KAAmC,kBAARA,IAAqB,CACjE,GAAI9F,GAAO8F,EAAI9F,IACf,IAAoB,kBAATA,GAIT,WAHAA,GAAKxN,KAAKsT,EAAK,SAAUA,GACvBuf,EAAI/yB,EAAGwT,IACN2e,GAIPW,EAAK9yB,GAAKwT,EACU,KAAdwf,GACJvlB,EAAQqlB,GAEV,MAAOJ,GACPP,EAAOO,IAnBX,GAAoB,IAAhBI,EAAK5wB,OAAc,MAAOuL,MAuB9B,KAAK,GAtBDulB,GAAYF,EAAK5wB,OAsBZlC,EAAI,EAAGA,EAAI8yB,EAAK5wB,OAAQlC,IAC/B+yB,EAAI/yB,EAAG8yB,EAAK9yB,OAKlBwN,EAAQC,QAAU,SAAUlM,GAC1B,MAAIA,IAA0B,gBAAjB,KAAOA,EAAP,YAAAwD,EAAOxD,KAAsBA,EAAMyI,cAAgBwD,EACvDjM,EAGF,GAAIiM,GAAQ,SAAUC,GAC3BA,EAAQlM,MAIZiM,EAAQ2kB,OAAS,SAAU5wB,GACzB,MAAO,IAAIiM,GAAQ,SAAUC,EAAS0kB,GACpCA,EAAO5wB,MAIXiM,EAAQylB,KAAO,SAAUC,GACvB,MAAO,IAAI1lB,GAAQ,SAAUC,EAAS0kB,GACpC,IAAK,GAAInyB,GAAI,EAAGgJ,EAAMkqB,EAAOhxB,OAAQlC,EAAIgJ,EAAKhJ,IAC5CkzB,EAAOlzB,GAAG0N,KAAKD,EAAS0kB,MAM9B3kB,EAAQukB,aAAwC,kBAAjBb,IAA+B,SAAUrf,GAAMqf,EAAarf,KACzF,SAAUA,GACR8gB,EAAe9gB,EAAI,IAGvBrE,EAAQ+kB,sBAAwB,SAA+BY,GACtC,mBAAZ/iB,UAA2BA,SACpCA,QAAQW,KAAK,wCAAyCoiB,IAS1D3lB,EAAQ4lB,gBAAkB,SAAyBvhB,GACjDrE,EAAQukB,aAAelgB,GAQzBrE,EAAQ6lB,yBAA2B,SAAkCxhB,GACnErE,EAAQ+kB,sBAAwB1gB,OAGZ,KAAX9R,GAA0BA,EAAOD,QAC1CC,EAAOD,QAAU0N,EACP2jB,EAAK3jB,UACf2jB,EAAK3jB,QAAUA,QArOnBlL,M5BotI6BpC,KAAKJ,EAASH,EAAoB,IAAIuxB,eAI7D,SAAUnxB,EAAQD,EAASH,GAEjC,Y6B/sIA,SAAS2zB,KACL,KAAM,IAAIxiB,OAAM,mCAEpB,QAASyiB,KACL,KAAM,IAAIziB,OAAM,qCAsBpB,QAAS0iB,GAAWC,GAChB,GAAIC,IAAqB9lB,WAErB,MAAOA,YAAW6lB,EAAK,EAG3B,KAAKC,IAAqBJ,IAAqBI,IAAqB9lB,WAEhE,MADA8lB,GAAmB9lB,WACZA,WAAW6lB,EAAK,EAE3B,KAEI,MAAOC,GAAiBD,EAAK,GAC/B,MAAMvtB,GACJ,IAEI,MAAOwtB,GAAiBxzB,KAAK,KAAMuzB,EAAK,GAC1C,MAAMvtB,GAEJ,MAAOwtB,GAAiBxzB,KAAKiG,KAAMstB,EAAK,KAMpD,QAASE,GAAgBC,GACrB,GAAIC,IAAuBC,aAEvB,MAAOA,cAAaF,EAGxB,KAAKC,IAAuBN,IAAwBM,IAAuBC,aAEvE,MADAD,GAAqBC,aACdA,aAAaF,EAExB,KAEI,MAAOC,GAAmBD,GAC5B,MAAO1tB,GACL,IAEI,MAAO2tB,GAAmB3zB,KAAK,KAAM0zB,GACvC,MAAO1tB,GAGL,MAAO2tB,GAAmB3zB,KAAKiG,KAAMytB,KAYjD,QAASG,KACAC,GAAaC,IAGlBD,GAAW,EACPC,EAAa/xB,OACbgyB,EAAQD,EAAatjB,OAAOujB,GAE5BC,GAAc,EAEdD,EAAMhyB,QACNkyB,KAIR,QAASA,KACL,IAAIJ,EAAJ,CAGA,GAAIhe,GAAUwd,EAAWO,EACzBC,IAAW,CAGX,KADA,GAAIhrB,GAAMkrB,EAAMhyB,OACV8G,GAAK,CAGP,IAFAirB,EAAeC,EACfA,OACSC,EAAanrB,GACdirB,GACAA,EAAaE,GAAYE,KAGjCF,IAAc,EACdnrB,EAAMkrB,EAAMhyB,OAEhB+xB,EAAe,KACfD,GAAW,EACXL,EAAgB3d,IAiBpB,QAASse,GAAKb,EAAKhV,GACftY,KAAKstB,IAAMA,EACXttB,KAAKsY,MAAQA,EAYjB,QAAS2S,MAhKT,GAOIsC,GACAG,EARAU,EAAUx0B,EAAOD,YAgBpB,WACG,IAEQ4zB,EADsB,kBAAf9lB,YACYA,WAEA0lB,EAEzB,MAAOptB,GACLwtB,EAAmBJ,EAEvB,IAEQO,EADwB,kBAAjBC,cACcA,aAEAP,EAE3B,MAAOrtB,GACL2tB,EAAqBN,KAuD7B,IAEIU,GAFAC,KACAF,GAAW,EAEXG,GAAc,CAyClBI,GAAQC,SAAW,SAAUf,GACzB,GAAIX,GAAO,GAAIpjB,OAAMzN,UAAUC,OAAS,EACxC,IAAID,UAAUC,OAAS,EACnB,IAAK,GAAIlC,GAAI,EAAGA,EAAIiC,UAAUC,OAAQlC,IAClC8yB,EAAK9yB,EAAI,GAAKiC,UAAUjC,EAGhCk0B,GAAM9xB,KAAK,GAAIkyB,GAAKb,EAAKX,IACJ,IAAjBoB,EAAMhyB,QAAiB8xB,GACvBR,EAAWY,IASnBE,EAAKpzB,UAAUmzB,IAAM,WACjBluB,KAAKstB,IAAI7jB,MAAM,KAAMzJ,KAAKsY,QAE9B8V,EAAQE,MAAQ,UAChBF,EAAQG,SAAU,EAClBH,EAAQI,OACRJ,EAAQK,QACRL,EAAQM,QAAU,GAClBN,EAAQO,YAIRP,EAAQQ,GAAK3D,EACbmD,EAAQS,YAAc5D,EACtBmD,EAAQU,KAAO7D,EACfmD,EAAQW,IAAM9D,EACdmD,EAAQY,eAAiB/D,EACzBmD,EAAQa,mBAAqBhE,EAC7BmD,EAAQc,KAAOjE,EACfmD,EAAQe,gBAAkBlE,EAC1BmD,EAAQgB,oBAAsBnE,EAE9BmD,EAAQiB,UAAY,SAAUl1B,GAAQ,UAEtCi0B,EAAQkB,QAAU,SAAUn1B,GACxB,KAAM,IAAIwQ,OAAM,qCAGpByjB,EAAQmB,IAAM,WAAc,MAAO,KACnCnB,EAAQoB,MAAQ,SAAUC,GACtB,KAAM,IAAI9kB,OAAM,mCAEpByjB,EAAQsB,MAAQ,WAAa,MAAO,K7BkuI9B,SAAU91B,EAAQD,EAASH,GAEjC,YAsBA,SAASm2B,GAAgBC,EAAUC,GAAe,KAAMD,YAAoBC,IAAgB,KAAM,IAAI1E,WAAU,qCAEhH,QAAS2E,GAA2BpE,EAAM3xB,GAAQ,IAAK2xB,EAAQ,KAAM,IAAIqE,gBAAe,4DAAgE,QAAOh2B,GAAyB,gBAATA,IAAqC,kBAATA,GAA8B2xB,EAAP3xB,EAElO,QAASi2B,GAAUC,EAAUC,GAAc,GAA0B,kBAAfA,IAA4C,OAAfA,EAAuB,KAAM,IAAI/E,WAAU,iEAAoE+E,GAAeD,GAASl1B,UAAYT,OAAO0Z,OAAOkc,GAAcA,EAAWn1B,WAAa8I,aAAezI,MAAO60B,EAAUx1B,YAAY,EAAO01B,UAAU,EAAM31B,cAAc,KAAe01B,IAAY51B,OAAOuZ,eAAiBvZ,OAAOuZ,eAAeoc,EAAUC,GAAcD,EAASnc,UAAYoc,GAvBje51B,OAAOC,eAAeZ,EAAS,cAC7ByB,OAAO,IAETzB,EAAQy2B,WAASj0B,EAEjB,IAAIk0B,GAAe,WAAc,QAASvV,GAAiBwV,EAAQ5zB,GAAS,IAAK,GAAI7C,GAAI,EAAGA,EAAI6C,EAAMX,OAAQlC,IAAK,CAAE,GAAI02B,GAAa7zB,EAAM7C,EAAI02B,GAAW91B,WAAa81B,EAAW91B,aAAc,EAAO81B,EAAW/1B,cAAe,EAAU,SAAW+1B,KAAYA,EAAWJ,UAAW,GAAM71B,OAAOC,eAAe+1B,EAAQC,EAAWl0B,IAAKk0B,IAAiB,MAAO,UAAUV,EAAaW,EAAYC,GAAiJ,MAA9HD,IAAY1V,EAAiB+U,EAAY90B,UAAWy1B,GAAiBC,GAAa3V,EAAiB+U,EAAaY,GAAqBZ,M8Bh6IhiB1L,EAAA3qB,EAAA,GAEAk3B,EAAAl3B,EAAA,I9Bo6IIm3B,EAMJ,SAAgCl0B,GAAO,MAAOA,IAAOA,EAAI7B,WAAa6B,GAAQqL,QAASrL,IANjDi0B,G8Bn6ItCpM,EAAA9qB,EAAA,GACA+qB,EAAA/qB,EAAA,E9Bi7IaG,G8Bz6IAy2B,O9By6IiB,SAAUQ,GAGtC,QAASR,KAGP,MAFAT,GAAgB3vB,KAAMowB,GAEfN,EAA2B9vB,MAAOowB,EAAOtc,WAAaxZ,OAAOu2B,eAAeT,IAAS3mB,MAAMzJ,KAAMlE,YAmB1G,MAxBAk0B,GAAUI,EAAQQ,GAQlBP,EAAaD,IACX/zB,IAAK,SACLjB,MAAO,W8Bn7IC,GACAkY,GAAUtT,KAAKS,QAAf6S,MAEFwd,GACJ,cACA,EAAAxM,EAAApU,KAAIygB,EAAA7oB,QAAOipB,QAAQ,EAAAxM,EAAAlR,kBAAiBC,IACpCtT,KAAKtD,MAAMoD,WAAa,IACxBmO,KAAK,IAEP,QACE,EAAAkW,EAAA7oB,GAAA,UAAQwE,UAAWgxB,EAASE,QAAShxB,KAAKtD,MAAMs0B,SAC7ChxB,KAAKtD,MAAMd,c9Bs7IXw0B,GACPjM,EAAQhgB,YAIJ,SAAUvK,EAAQD,EAASH,GAEjC,YASA,SAASsW,GAAmBC,GAAO,GAAIxG,MAAMC,QAAQuG,GAAM,CAAE,IAAK,GAAIlW,GAAI,EAAGmW,EAAOzG,MAAMwG,EAAIhU,QAASlC,EAAIkW,EAAIhU,OAAQlC,IAAOmW,EAAKnW,GAAKkW,EAAIlW,EAAM,OAAOmW,GAAe,MAAOzG,OAAM0G,KAAKF,G+Bh+I1L,QAASkhB,GAAclE,EAAoB1wB,GACzC,GAAM60B,GAAenE,EAClBvc,IAAI,SAAAhD,GACH,MAAiB,gBAAb,KAAOA,EAAP,YAAA5O,EAAO4O,KAAkBnR,GAAOmR,EAAEnR,GAC7BD,OAAOoR,EAAEnR,IAAMN,QAAU,EAEjB,gBAANyR,GAAuBA,EAAEzR,OAC7B,IAERgR,MACH,OAAOf,MAAK8G,IAALrJ,MAAAuC,KAAA8D,EAAYohB,I/Bg9IrB52B,OAAOC,eAAeZ,EAAS,cAC7ByB,OAAO,GAGT,IAAIwD,GAA4B,kBAAXuI,SAAoD,gBAApBA,QAAOC,SAAwB,SAAU3K,GAAO,aAAcA,IAAS,SAAUA,GAAO,MAAOA,IAAyB,kBAAX0K,SAAyB1K,EAAIoH,cAAgBsD,QAAU1K,IAAQ0K,OAAOpM,UAAY,eAAkB0B,GAetQ9C,G+Bh+ISs3B,gB/Bo+IH,SAAUr3B,EAAQD,EAASH,GAEjC,YAkBA,SAASm2B,GAAgBC,EAAUC,GAAe,KAAMD,YAAoBC,IAAgB,KAAM,IAAI1E,WAAU,qCAEhH,QAAS2E,GAA2BpE,EAAM3xB,GAAQ,IAAK2xB,EAAQ,KAAM,IAAIqE,gBAAe,4DAAgE,QAAOh2B,GAAyB,gBAATA,IAAqC,kBAATA,GAA8B2xB,EAAP3xB,EAElO,QAASi2B,GAAUC,EAAUC,GAAc,GAA0B,kBAAfA,IAA4C,OAAfA,EAAuB,KAAM,IAAI/E,WAAU,iEAAoE+E,GAAeD,GAASl1B,UAAYT,OAAO0Z,OAAOkc,GAAcA,EAAWn1B,WAAa8I,aAAezI,MAAO60B,EAAUx1B,YAAY,EAAO01B,UAAU,EAAM31B,cAAc,KAAe01B,IAAY51B,OAAOuZ,eAAiBvZ,OAAOuZ,eAAeoc,EAAUC,GAAcD,EAASnc,UAAYoc,GAnBje51B,OAAOC,eAAeZ,EAAS,cAC7ByB,OAAO,IAETzB,EAAQgR,UAAQxO,EAEhB,IAAIk0B,GAAe,WAAc,QAASvV,GAAiBwV,EAAQ5zB,GAAS,IAAK,GAAI7C,GAAI,EAAGA,EAAI6C,EAAMX,OAAQlC,IAAK,CAAE,GAAI02B,GAAa7zB,EAAM7C,EAAI02B,GAAW91B,WAAa81B,EAAW91B,aAAc,EAAO81B,EAAW/1B,cAAe,EAAU,SAAW+1B,KAAYA,EAAWJ,UAAW,GAAM71B,OAAOC,eAAe+1B,EAAQC,EAAWl0B,IAAKk0B,IAAiB,MAAO,UAAUV,EAAaW,EAAYC,GAAiJ,MAA9HD,IAAY1V,EAAiB+U,EAAY90B,UAAWy1B,GAAiBC,GAAa3V,EAAiB+U,EAAaY,GAAqBZ,MgCz/IhiB1L,EAAA3qB,EAAA,GAEA23B,EAAA33B,EAAA,IhC6/II43B,EAEJ,SAAgC30B,GAAO,MAAOA,IAAOA,EAAI7B,WAAa6B,GAAQqL,QAASrL,IAFlD00B,EAWzBx3B,GgCjgJCgR,MhCigJe,SAAUimB,GAGpC,QAASjmB,KAGP,MAFAglB,GAAgB3vB,KAAM2K,GAEfmlB,EAA2B9vB,MAAO2K,EAAMmJ,WAAaxZ,OAAOu2B,eAAelmB,IAAQlB,MAAMzJ,KAAMlE,YAcxG,MAnBAk0B,GAAUrlB,EAAOimB,GAQjBP,EAAa1lB,IACXtO,IAAK,SACLjB,MAAO,WgC1gJP,OACE,EAAA+oB,EAAA7oB,GAAA,OAAKwE,UAAWsxB,EAAAtpB,QAAO2C,MAAO/L,MAAOsB,KAAKtD,MAAMgC,OAC7CsB,KAAKtD,MAAMd,chCihJX+O,GACPwZ,EAAQhgB,YAIJ,SAAUvK,EAAQD,EAASH,GAEjC,YAkBA,SAASm2B,GAAgBC,EAAUC,GAAe,KAAMD,YAAoBC,IAAgB,KAAM,IAAI1E,WAAU,qCAEhH,QAAS2E,GAA2BpE,EAAM3xB,GAAQ,IAAK2xB,EAAQ,KAAM,IAAIqE,gBAAe,4DAAgE,QAAOh2B,GAAyB,gBAATA,IAAqC,kBAATA,GAA8B2xB,EAAP3xB,EAElO,QAASi2B,GAAUC,EAAUC,GAAc,GAA0B,kBAAfA,IAA4C,OAAfA,EAAuB,KAAM,IAAI/E,WAAU,iEAAoE+E,GAAeD,GAASl1B,UAAYT,OAAO0Z,OAAOkc,GAAcA,EAAWn1B,WAAa8I,aAAezI,MAAO60B,EAAUx1B,YAAY,EAAO01B,UAAU,EAAM31B,cAAc,KAAe01B,IAAY51B,OAAOuZ,eAAiBvZ,OAAOuZ,eAAeoc,EAAUC,GAAcD,EAASnc,UAAYoc,GAnBje51B,OAAOC,eAAeZ,EAAS,cAC7ByB,OAAO,IAETzB,EAAQ03B,WAASl1B,EAEjB,IAAIk0B,GAAe,WAAc,QAASvV,GAAiBwV,EAAQ5zB,GAAS,IAAK,GAAI7C,GAAI,EAAGA,EAAI6C,EAAMX,OAAQlC,IAAK,CAAE,GAAI02B,GAAa7zB,EAAM7C,EAAI02B,GAAW91B,WAAa81B,EAAW91B,aAAc,EAAO81B,EAAW/1B,cAAe,EAAU,SAAW+1B,KAAYA,EAAWJ,UAAW,GAAM71B,OAAOC,eAAe+1B,EAAQC,EAAWl0B,IAAKk0B,IAAiB,MAAO,UAAUV,EAAaW,EAAYC,GAAiJ,MAA9HD,IAAY1V,EAAiB+U,EAAY90B,UAAWy1B,GAAiBC,GAAa3V,EAAiB+U,EAAaY,GAAqBZ,MiC7iJhiB1L,EAAA3qB,EAAA,GAEA83B,EAAA93B,EAAA,IjCijJI+3B,EAEJ,SAAgC90B,GAAO,MAAOA,IAAOA,EAAI7B,WAAa6B,GAAQqL,QAASrL,IAFjD60B,EAWzB33B,GiCtjJA03B,OjCsjJiB,SAAUT,GAGtC,QAASS,KAGP,MAFA1B,GAAgB3vB,KAAMqxB,GAEfvB,EAA2B9vB,MAAOqxB,EAAOvd,WAAaxZ,OAAOu2B,eAAeQ,IAAS5nB,MAAMzJ,KAAMlE,YAc1G,MAnBAk0B,GAAUqB,EAAQT,GAQlBP,EAAagB,IACXh1B,IAAK,SACLjB,MAAO,WiC/jJP,OAAO,EAAA+oB,EAAA7oB,GAAA,OAAKwE,UAAWyxB,EAAAzpB,QAAO0pB,QAASxxB,KAAKtD,MAAMd,cjCwkJ7Cy1B,GACPlN,EAAQhgB,YAIJ,SAAUvK,EAAQD,EAASH,GAEjC,YAoBA,SAASm2B,GAAgBC,EAAUC,GAAe,KAAMD,YAAoBC,IAAgB,KAAM,IAAI1E,WAAU,qCAEhH,QAAS2E,GAA2BpE,EAAM3xB,GAAQ,IAAK2xB,EAAQ,KAAM,IAAIqE,gBAAe,4DAAgE,QAAOh2B,GAAyB,gBAATA,IAAqC,kBAATA,GAA8B2xB,EAAP3xB,EAElO,QAASi2B,GAAUC,EAAUC,GAAc,GAA0B,kBAAfA,IAA4C,OAAfA,EAAuB,KAAM,IAAI/E,WAAU,iEAAoE+E,GAAeD,GAASl1B,UAAYT,OAAO0Z,OAAOkc,GAAcA,EAAWn1B,WAAa8I,aAAezI,MAAO60B,EAAUx1B,YAAY,EAAO01B,UAAU,EAAM31B,cAAc,KAAe01B,IAAY51B,OAAOuZ,eAAiBvZ,OAAOuZ,eAAeoc,EAAUC,GAAcD,EAASnc,UAAYoc,GArBje51B,OAAOC,eAAeZ,EAAS,cAC7ByB,OAAO,IAETzB,EAAQ83B,gBAAct1B,EAEtB,IAAIk0B,GAAe,WAAc,QAASvV,GAAiBwV,EAAQ5zB,GAAS,IAAK,GAAI7C,GAAI,EAAGA,EAAI6C,EAAMX,OAAQlC,IAAK,CAAE,GAAI02B,GAAa7zB,EAAM7C,EAAI02B,GAAW91B,WAAa81B,EAAW91B,aAAc,EAAO81B,EAAW/1B,cAAe,EAAU,SAAW+1B,KAAYA,EAAWJ,UAAW,GAAM71B,OAAOC,eAAe+1B,EAAQC,EAAWl0B,IAAKk0B,IAAiB,MAAO,UAAUV,EAAaW,EAAYC,GAAiJ,MAA9HD,IAAY1V,EAAiB+U,EAAY90B,UAAWy1B,GAAiBC,GAAa3V,EAAiB+U,EAAaY,GAAqBZ,MkCjmJhiB1L,EAAA3qB,EAAA,GAEAk3B,EAAAl3B,EAAA,IAEAk4B,EAAAl4B,EAAA,IlCqmJIm4B,EAEJ,SAAgCl1B,GAAO,MAAOA,IAAOA,EAAI7B,WAAa6B,GAAQqL,QAASrL,IAF5Ci1B,EAWzB/3B,GkCzmJL83B,YlCymJ2B,SAAUb,GAGhD,QAASa,KAGP,MAFA9B,GAAgB3vB,KAAMyxB,GAEf3B,EAA2B9vB,MAAOyxB,EAAY3d,WAAaxZ,OAAOu2B,eAAeY,IAAchoB,MAAMzJ,KAAMlE,YAoBpH,MAzBAk0B,GAAUyB,EAAab,GAQvBP,EAAaoB,IACXp1B,IAAK,SACLjB,MAAO,WkClnJP,OACE,EAAA+oB,EAAA7oB,GAAAo1B,EAAAN,QAAQY,QAAShxB,KAAKtD,MAAMs0B,QAASlxB,UAAW6xB,EAAA7pB,QAAO8pB,cACrD,EAAAzN,EAAA7oB,GAAA,OAAKwgB,MAAM,KAAK4I,OAAO,KAAKmN,cAAY,SACtC,EAAA1N,EAAA7oB,GAAA,OAAKw2B,UAAU,iBACV,IACN9xB,KAAKtD,MAAMd,clC4nJX61B,GACPtN,EAAQhgB,YAIJ,SAAUvK,EAAQD,EAASH,GAEjC,YAYA,SAASm2B,GAAgBC,EAAUC,GAAe,KAAMD,YAAoBC,IAAgB,KAAM,IAAI1E,WAAU,qCAEhH,QAAS2E,GAA2BpE,EAAM3xB,GAAQ,IAAK2xB,EAAQ,KAAM,IAAIqE,gBAAe,4DAAgE,QAAOh2B,GAAyB,gBAATA,IAAqC,kBAATA,GAA8B2xB,EAAP3xB,EAElO,QAASi2B,GAAUC,EAAUC,GAAc,GAA0B,kBAAfA,IAA4C,OAAfA,EAAuB,KAAM,IAAI/E,WAAU,iEAAoE+E,GAAeD,GAASl1B,UAAYT,OAAO0Z,OAAOkc,GAAcA,EAAWn1B,WAAa8I,aAAezI,MAAO60B,EAAUx1B,YAAY,EAAO01B,UAAU,EAAM31B,cAAc,KAAe01B,IAAY51B,OAAOuZ,eAAiBvZ,OAAOuZ,eAAeoc,EAAUC,GAAcD,EAASnc,UAAYoc,GmCpqJje,QAAS6B,GAAchwB,EAAQuK,GAC7B,IAAK,GAAIjQ,KAAO0F,GAAG,GAAIA,EAAE1F,KAASiQ,EAAEjQ,GAAM,OAAO,CACjD,KAAK,GAAIA,KAAOiQ,GAAG,KAAMjQ,IAAO0F,IAAI,OAAO,CAC3C,QAAO,EnCopJTzH,OAAOC,eAAeZ,EAAS,cAC7ByB,OAAO,IAETzB,EAAQq4B,kBAAgB71B,EAExB,IAAIk0B,GAAe,WAAc,QAASvV,GAAiBwV,EAAQ5zB,GAAS,IAAK,GAAI7C,GAAI,EAAGA,EAAI6C,EAAMX,OAAQlC,IAAK,CAAE,GAAI02B,GAAa7zB,EAAM7C,EAAI02B,GAAW91B,WAAa81B,EAAW91B,aAAc,EAAO81B,EAAW/1B,cAAe,EAAU,SAAW+1B,KAAYA,EAAWJ,UAAW,GAAM71B,OAAOC,eAAe+1B,EAAQC,EAAWl0B,IAAKk0B,IAAiB,MAAO,UAAUV,EAAaW,EAAYC,GAAiJ,MAA9HD,IAAY1V,EAAiB+U,EAAY90B,UAAWy1B,GAAiBC,GAAa3V,EAAiB+U,EAAaY,GAAqBZ,MmC9pJhiB1L,EAAA3qB,EAAA,EnCgrJoBG,GmCxqJPq4B,cnCwqJ+B,SAAUpB,GAGpD,QAASoB,KAGP,MAFArC,GAAgB3vB,KAAMgyB,GAEflC,EAA2B9vB,MAAOgyB,EAAcle,WAAaxZ,OAAOu2B,eAAemB,IAAgBvoB,MAAMzJ,KAAMlE,YAUxH,MAfAk0B,GAAUgC,EAAepB,GAQzBP,EAAa2B,IACX31B,IAAK,wBACLjB,MAAO,SmClrJcsB,EAAc6H,EAAc9D,GACjD,QAASsxB,EAAar1B,EAAOsD,KAAKtD,QAAUq1B,EAAaxtB,EAAOvE,KAAKuE,QAAUwtB,EAAatxB,EAAST,KAAKS,cnCsrJrGuxB,GACP7N,EAAQhgB,YAIJ,SAAUvK,EAAQD,EAASH,GAEjC,YoCzrJAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAI62B,GAAsBz4B,EAAQ,KAC9B04B,EAAkB14B,EAAQ,KAU1B24B,EAAmB,SAAUC,GAC7B,IAGI,GAAsB,mBAAXtnB,aAC2B,KAA3BA,OAAOsnB,GAAiC,CAE/C,GAAIC,GAAavnB,OAAOsnB,EAGxB,OAFAC,GAAWC,QAAQ,oBAAqB,SACxCD,EAAWE,WAAW,qBACf,GAAIN,GAAoBO,kBAAkBH,IAGzD,MAAOtyB,IAGP,MAAO,IAAImyB,GAAgBO,cAG/B94B,GAAQ+4B,kBAAoBP,EAAiB,gBAE7Cx4B,EAAQwQ,eAAiBgoB,EAAiB,mBpC+sJpC,SAAUv4B,EAAQD,EAASH,GAEjC,YqClvJAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,IACtDzB,EAAQg5B,iBAAmB,IAC3Bh5B,EAAQi5B,cAAgB,IACxBj5B,EAAQk5B,wBAA0B,IAClCl5B,EAAQm5B,cAAgB,IACxBn5B,EAAQo5B,UAAY,IACpBp5B,EAAQq5B,aAAe,iBACvBr5B,EAAQs5B,mBAAqB,KAC7Bt5B,EAAQu5B,UAAY,YACpBv5B,EAAQw5B,aAAe,gBrC0wJjB,SAAUv5B,EAAQD,EAASH,GAEjC,YsCrxJAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAI8Y,GAAS1a,EAAQ,GACjBuO,EAASvO,EAAQ,GAKjBgc,EAAuB,WACvB,QAASA,MA6BT,MAvBAA,GAAMza,UAAUivB,WAAa,WACzB,MAAOhqB,MAAKsU,QAAQ9M,KAAKxH,OAU7BwV,EAAMza,UAAU8Z,oBAAsB,SAAUC,EAASC,GACrD,GAAIqe,GAAa,GAAIlf,GAAOe,UAAUlN,EAAOoE,SAAU2I,GACnDue,EAAa,GAAInf,GAAOe,UAAUlN,EAAOoE,SAAU4I,EACvD,OAAgD,KAAzC/U,KAAKsU,QAAQ8e,EAAYC,IAMpC7d,EAAMza,UAAUia,QAAU,WACtB,MAAOd,GAAOe,UAAUC,KAErBM,IAEX7b,GAAQ6b,MAAQA,GtC4yJV,SAAU5b,EAAQD,EAASH,GAEjC,YAkBA,IAAIoF,GAA4B,kBAAXuI,SAAoD,gBAApBA,QAAOC,SAAwB,SAAU3K,GAAO,aAAcA,IAAS,SAAUA,GAAO,MAAOA,IAAyB,kBAAX0K,SAAyB1K,EAAIoH,cAAgBsD,QAAU1K,IAAQ0K,OAAOpM,UAAY,eAAkB0B,GuCv2JtQnC,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAGI8f,GAHAnT,EAASvO,EAAQ,GACjBwO,EAASxO,EAAQ,GACjBoc,EAASpc,EAAQ,IAOjB4b,EAA0B,WAO1B,QAASA,GAASke,EAAQnd,OACA,KAAlBA,IAA4BA,EAAgBf,EAAS8F,0BAA0BxF,YACnF1V,KAAKszB,OAASA,EACdtzB,KAAKmW,cAAgBA,EACrBnW,KAAKqW,UAAY,KACjBtO,EAAOiC,WAAuB7N,KAAhB6D,KAAKszB,QAAwC,OAAhBtzB,KAAKszB,OAAiB,4DACjE1d,EAAOU,qBAAqBtW,KAAKmW,eAiOrC,MA/NA7b,QAAOC,eAAe6a,EAAU,6BAC5B1a,IAAK,WACD,MAAOwgB,IAEX9Q,IAAK,SAAUiD,GACX6N,EAA4B7N,GAEhC5S,YAAY,EACZD,cAAc,IAGlB4a,EAASra,UAAU4b,WAAa,WAC5B,OAAO,GAGXvB,EAASra,UAAUyZ,YAAc,WAC7B,MAAOxU,MAAKmW,eAGhBf,EAASra,UAAU6b,eAAiB,SAAUC,GAC1C,MAAO,IAAIzB,GAASpV,KAAKszB,OAAQzc,IAGrCzB,EAASra,UAAU+b,kBAAoB,SAAUC,GAE7C,MAAkB,cAAdA,EACO/W,KAAKmW,cAGLf,EAAS8F,0BAA0BxF,YAIlDN,EAASra,UAAUic,SAAW,SAAUhI,GACpC,MAAIA,GAAK4C,UACE5R,KAEkB,cAApBgP,EAAKiC,WACHjR,KAAKmW,cAGLf,EAAS8F,0BAA0BxF,YAMlDN,EAASra,UAAUmc,SAAW,WAC1B,OAAO,GAGX9B,EAASra,UAAU4d,wBAA0B,SAAU5B,EAAWsB,GAC9D,MAAO,OAGXjD,EAASra,UAAUoc,qBAAuB,SAAUJ,EAAWK,GAC3D,MAAkB,cAAdL,EACO/W,KAAK4W,eAAeQ,GAEtBA,EAAaxF,WAA2B,cAAdmF,EACxB/W,KAGAoV,EAAS8F,0BAA0BxF,WACrCyB,qBAAqBJ,EAAWK,GAChCR,eAAe5W,KAAKmW,gBAIjCf,EAASra,UAAU6c,YAAc,SAAU5I,EAAMoI,GAC7C,GAAIH,GAAQjI,EAAKiC,UACjB,OAAc,QAAVgG,EACOG,EAEFA,EAAaxF,WAAuB,cAAVqF,EACxBjX,MAGP+H,EAAOiC,OAAiB,cAAViN,GAA8C,IAArBjI,EAAKkC,YAAmB,8CACxDlR,KAAKmX,qBAAqBF,EAAO7B,EAAS8F,0BAA0BxF,WAAWkC,YAAY5I,EAAKmC,WAAYiG,MAI3HhC,EAASra,UAAU6W,QAAU,WACzB,OAAO,GAGXwD,EAASra,UAAU+c,YAAc,WAC7B,MAAO,IAGX1C,EAASra,UAAUqd,aAAe,SAAUQ,EAAOW,GAC/C,OAAO,GAKXnE,EAASra,UAAUsS,IAAM,SAAU2K,GAC/B,MAAIA,KAAiBhY,KAAKwU,cAAc5C,WAEhC2hB,SAAUvzB,KAAKwzB,WACfvJ,YAAajqB,KAAKwU,cAAcnH,OAG7BrN,KAAKwzB,YAGpBpe,EAASra,UAAUwd,KAAO,WACtB,GAAuB,OAAnBvY,KAAKqW,UAAoB,CACzB,GAAIod,GAAS,EACRzzB,MAAKmW,cAAcvE,YACpB6hB,GACI,YACI7d,EAAO6C,iBAAiBzY,KAAKmW,cAAc9I,OAC3C,IACZ,IAAIpN,KAAcD,KAAKszB,OACvBG,IAAUxzB,EAAO,IAEbwzB,GADS,WAATxzB,EACU+H,EAAOuF,sBAAsBvN,KAAKszB,QAGlCtzB,KAAKszB,OAEnBtzB,KAAKqW,UAAYrO,EAAOS,KAAKgrB,GAEjC,MAAOzzB,MAAKqW,WAMhBjB,EAASra,UAAUy4B,SAAW,WAC1B,MAAOxzB,MAAKszB,QAKhBle,EAASra,UAAU4Z,UAAY,SAAUnC,GACrC,MAAIA,KAAU4C,EAAS8F,0BAA0BxF,WACtC,EAEFlD,YAAiB4C,GAAS8F,2BACvB,GAGRnT,EAAOiC,OAAOwI,EAAMmE,aAAc,qBAC3B3W,KAAK0zB,mBAAmBlhB,KASvC4C,EAASra,UAAU24B,mBAAqB,SAAUC,GAC9C,GAAIC,KAAuBD,EAAUL,QACjCO,IAAsB7zB,KAAKszB,QAC3BQ,EAAa1e,EAAS2e,iBAAiB9oB,QAAQ2oB,GAC/CI,EAAY5e,EAAS2e,iBAAiB9oB,QAAQ4oB,EAGlD,OAFA9rB,GAAOiC,OAAO8pB,GAAc,EAAG,sBAAwBF,GACvD7rB,EAAOiC,OAAOgqB,GAAa,EAAG,sBAAwBH,GAClDC,IAAeE,EAEM,WAAjBH,EAEO,EAIH7zB,KAAKszB,OAASK,EAAUL,QAChB,EAEHtzB,KAAKszB,SAAWK,EAAUL,OACxB,EAGA,EAKRU,EAAYF,GAM3B1e,EAASra,UAAUof,UAAY,WAC3B,MAAOna,OAKXoV,EAASra,UAAUwf,UAAY,WAC3B,OAAO,GAKXnF,EAASra,UAAUwX,OAAS,SAAUC,GAIlC,GAAIA,IAAUxS,KACV,OAAO,CAEN,IAAIwS,EAAMmE,aAAc,CACzB,GAAIgd,GAAYnhB,CAChB,OAAQxS,MAAKszB,SAAWK,EAAUL,QAC9BtzB,KAAKmW,cAAc5D,OAAOohB,EAAUxd,eAGxC,OAAO,GASff,EAAS2e,kBAAoB,SAAU,UAAW,SAAU,UACrD3e,IAEXzb,GAAQyb,SAAWA,GvCu1Jb,SAAUxb,EAAQD,EAASH,GAEjC,YwCnlKAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GAItD,IAAI64B,GAAmC,WASnC,QAASA,GAAkB12B,EAAM22B,EAAUC,EAAYC,EAAYC,OACtC,KAArBA,IAA+BA,EAAmB,MACtDr0B,KAAKo0B,WAAaA,EAClBp0B,KAAKq0B,iBAAmBA,EAIxBr0B,KAAKs0B,aAEL,KADA,GAAIhiB,GAAM,GACF/U,EAAKqU,WAMT,GALArU,EAAOA,EACP+U,EAAM4hB,EAAWC,EAAW52B,EAAKlB,IAAK63B,GAAY,EAE9CE,IACA9hB,IAAQ,GACRA,EAAM,EAGF/U,EADAyC,KAAKo0B,WACE72B,EAAK2U,KAGL3U,EAAK4U,UAGf,IAAY,IAARG,EAAW,CAEhBtS,KAAKs0B,WAAWr4B,KAAKsB,EACrB,OAIAyC,KAAKs0B,WAAWr4B,KAAKsB,GAEjBA,EADAyC,KAAKo0B,WACE72B,EAAK4U,MAGL5U,EAAK2U,MA4C5B,MAvCA+hB,GAAkBl5B,UAAUgf,QAAU,WAClC,GAA+B,IAA3B/Z,KAAKs0B,WAAWv4B,OAChB,MAAO,KACX,IACIw4B,GADAh3B,EAAOyC,KAAKs0B,WAAWp4B,KAM3B,IAHIq4B,EADAv0B,KAAKq0B,iBACIr0B,KAAKq0B,iBAAiB92B,EAAKlB,IAAKkB,EAAKnC,QAEnCiB,IAAKkB,EAAKlB,IAAKjB,MAAOmC,EAAKnC,OACtC4E,KAAKo0B,WAEL,IADA72B,EAAOA,EAAK2U,MACJ3U,EAAKqU,WACT5R,KAAKs0B,WAAWr4B,KAAKsB,GACrBA,EAAOA,EAAK4U,UAKhB,KADA5U,EAAOA,EAAK4U,OACJ5U,EAAKqU,WACT5R,KAAKs0B,WAAWr4B,KAAKsB,GACrBA,EAAOA,EAAK2U,IAGpB,OAAOqiB,IAEXN,EAAkBl5B,UAAUy5B,QAAU,WAClC,MAAOx0B,MAAKs0B,WAAWv4B,OAAS,GAEpCk4B,EAAkBl5B,UAAU+e,KAAO,WAC/B,GAA+B,IAA3B9Z,KAAKs0B,WAAWv4B,OAChB,MAAO,KACX,IAAIwB,GAAOyC,KAAKs0B,WAAWt0B,KAAKs0B,WAAWv4B,OAAS,EACpD,OAAIiE,MAAKq0B,iBACEr0B,KAAKq0B,iBAAiB92B,EAAKlB,IAAKkB,EAAKnC,QAGnCiB,IAAKkB,EAAKlB,IAAKjB,MAAOmC,EAAKnC,QAGrC64B,IAEXt6B,GAAQs6B,kBAAoBA,CAI5B,IAAIQ,GAA0B,WAS1B,QAASA,GAASp4B,EAAKjB,EAAOs5B,EAAOxiB,EAAMC,GACvCnS,KAAK3D,IAAMA,EACX2D,KAAK5E,MAAQA,EACb4E,KAAK00B,MAAiB,MAATA,EAAgBA,EAAQD,EAASE,IAC9C30B,KAAKkS,KACO,MAARA,EAAeA,EAAOqE,EAAUb,WACpC1V,KAAKmS,MACQ,MAATA,EAAgBA,EAAQoE,EAAUb,WA+P1C,MAnPA+e,GAAS15B,UAAU65B,KAAO,SAAUv4B,EAAKjB,EAAOs5B,EAAOxiB,EAAMC,GACzD,MAAO,IAAIsiB,GAAgB,MAAPp4B,EAAcA,EAAM2D,KAAK3D,IAAc,MAATjB,EAAgBA,EAAQ4E,KAAK5E,MAAgB,MAATs5B,EAAgBA,EAAQ10B,KAAK00B,MAAe,MAARxiB,EAAeA,EAAOlS,KAAKkS,KAAe,MAATC,EAAgBA,EAAQnS,KAAKmS,QAK5LsiB,EAAS15B,UAAUgd,MAAQ,WACvB,MAAO/X,MAAKkS,KAAK6F,QAAU,EAAI/X,KAAKmS,MAAM4F,SAK9C0c,EAAS15B,UAAU6W,QAAU,WACzB,OAAO,GAWX6iB,EAAS15B,UAAUye,iBAAmB,SAAUD,GAC5C,MAAQvZ,MAAKkS,KAAKsH,iBAAiBD,IAC/BA,EAAOvZ,KAAK3D,IAAK2D,KAAK5E,QACtB4E,KAAKmS,MAAMqH,iBAAiBD,IAUpCkb,EAAS15B,UAAU85B,iBAAmB,SAAUtb,GAC5C,MAAQvZ,MAAKmS,MAAM0iB,iBAAiBtb,IAChCA,EAAOvZ,KAAK3D,IAAK2D,KAAK5E,QACtB4E,KAAKkS,KAAK2iB,iBAAiBtb,IAMnCkb,EAAS15B,UAAU+5B,KAAO,WACtB,MAAI90B,MAAKkS,KAAKN,UACH5R,KAGAA,KAAKkS,KAAK4iB,QAMzBL,EAAS15B,UAAUoe,OAAS,WACxB,MAAOnZ,MAAK80B,OAAOz4B,KAKvBo4B,EAAS15B,UAAUmd,OAAS,WACxB,MAAIlY,MAAKmS,MAAMP,UACJ5R,KAAK3D,IAGL2D,KAAKmS,MAAM+F,UAU1Buc,EAAS15B,UAAU2c,OAAS,SAAUrb,EAAKjB,EAAO+4B,GAC9C,GAAI7hB,GAAK3X,CAYT,OAXAA,GAAIqF,KACJsS,EAAM6hB,EAAW93B,EAAK1B,EAAE0B,KAEpB1B,EADA2X,EAAM,EACF3X,EAAEi6B,KAAK,KAAM,KAAM,KAAMj6B,EAAEuX,KAAKwF,OAAOrb,EAAKjB,EAAO+4B,GAAa,MAEvD,IAAR7hB,EACD3X,EAAEi6B,KAAK,KAAMx5B,EAAO,KAAM,KAAM,MAGhCT,EAAEi6B,KAAK,KAAM,KAAM,KAAM,KAAMj6B,EAAEwX,MAAMuF,OAAOrb,EAAKjB,EAAO+4B,IAE3Dx5B,EAAEo6B,UAMbN,EAAS15B,UAAUi6B,WAAa,WAC5B,GAAIh1B,KAAKkS,KAAKN,UACV,MAAO2E,GAAUb,UAErB,IAAI/a,GAAIqF,IAIR,OAHKrF,GAAEuX,KAAK+iB,UAAat6B,EAAEuX,KAAKA,KAAK+iB,WACjCt6B,EAAIA,EAAEu6B,gBACVv6B,EAAIA,EAAEi6B,KAAK,KAAM,KAAM,KAAMj6B,EAAEuX,KAAK8iB,aAAc,MAC3Cr6B,EAAEo6B,UAObN,EAAS15B,UAAUsP,OAAS,SAAUhO,EAAK83B,GACvC,GAAIx5B,GAAGw6B,CAEP,IADAx6B,EAAIqF,KACAm0B,EAAW93B,EAAK1B,EAAE0B,KAAO,EACpB1B,EAAEuX,KAAKN,WAAcjX,EAAEuX,KAAK+iB,UAAat6B,EAAEuX,KAAKA,KAAK+iB,WACtDt6B,EAAIA,EAAEu6B,gBAEVv6B,EAAIA,EAAEi6B,KAAK,KAAM,KAAM,KAAMj6B,EAAEuX,KAAK7H,OAAOhO,EAAK83B,GAAa,UAE5D,CAMD,GALIx5B,EAAEuX,KAAK+iB,WACPt6B,EAAIA,EAAEy6B,gBACLz6B,EAAEwX,MAAMP,WAAcjX,EAAEwX,MAAM8iB,UAAat6B,EAAEwX,MAAMD,KAAK+iB,WACzDt6B,EAAIA,EAAE06B,iBAEqB,IAA3BlB,EAAW93B,EAAK1B,EAAE0B,KAAY,CAC9B,GAAI1B,EAAEwX,MAAMP,UACR,MAAO2E,GAAUb,UAGjByf,GAAWx6B,EAAEwX,MAAM2iB,OACnBn6B,EAAIA,EAAEi6B,KAAKO,EAAS94B,IAAK84B,EAAS/5B,MAAO,KAAM,KAAMT,EAAEwX,MAAM6iB,cAGrEr6B,EAAIA,EAAEi6B,KAAK,KAAM,KAAM,KAAM,KAAMj6B,EAAEwX,MAAM9H,OAAOhO,EAAK83B,IAE3D,MAAOx5B,GAAEo6B,UAMbN,EAAS15B,UAAUk6B,OAAS,WACxB,MAAOj1B,MAAK00B,OAMhBD,EAAS15B,UAAUg6B,OAAS,WACxB,GAAIp6B,GAAIqF,IAOR,OANIrF,GAAEwX,MAAM8iB,WAAat6B,EAAEuX,KAAK+iB,WAC5Bt6B,EAAIA,EAAE26B,eACN36B,EAAEuX,KAAK+iB,UAAYt6B,EAAEuX,KAAKA,KAAK+iB,WAC/Bt6B,EAAIA,EAAEy6B,gBACNz6B,EAAEuX,KAAK+iB,UAAYt6B,EAAEwX,MAAM8iB,WAC3Bt6B,EAAIA,EAAE46B,cACH56B,GAMX85B,EAAS15B,UAAUm6B,aAAe,WAC9B,GAAIv6B,GAAIqF,KAAKu1B,YAMb,OALI56B,GAAEwX,MAAMD,KAAK+iB,WACbt6B,EAAIA,EAAEi6B,KAAK,KAAM,KAAM,KAAM,KAAMj6B,EAAEwX,MAAMijB,gBAC3Cz6B,EAAIA,EAAE26B,cACN36B,EAAIA,EAAE46B,cAEH56B,GAMX85B,EAAS15B,UAAUs6B,cAAgB,WAC/B,GAAI16B,GAAIqF,KAAKu1B,YAKb,OAJI56B,GAAEuX,KAAKA,KAAK+iB,WACZt6B,EAAIA,EAAEy6B,eACNz6B,EAAIA,EAAE46B,cAEH56B,GAMX85B,EAAS15B,UAAUu6B,YAAc,WAC7B,GAAIE,GAAKx1B,KAAK40B,KAAK,KAAM,KAAMH,EAASE,IAAK,KAAM30B,KAAKmS,MAAMD,KAC9D,OAAOlS,MAAKmS,MAAMyiB,KAAK,KAAM,KAAM50B,KAAK00B,MAAOc,EAAI,OAMvDf,EAAS15B,UAAUq6B,aAAe,WAC9B,GAAIK,GAAKz1B,KAAK40B,KAAK,KAAM,KAAMH,EAASE,IAAK30B,KAAKkS,KAAKC,MAAO,KAC9D,OAAOnS,MAAKkS,KAAK0iB,KAAK,KAAM,KAAM50B,KAAK00B,MAAO,KAAMe,IAMxDhB,EAAS15B,UAAUw6B,WAAa,WAC5B,GAAIrjB,GAAOlS,KAAKkS,KAAK0iB,KAAK,KAAM,MAAO50B,KAAKkS,KAAKwiB,MAAO,KAAM,MAC1DviB,EAAQnS,KAAKmS,MAAMyiB,KAAK,KAAM,MAAO50B,KAAKmS,MAAMuiB,MAAO,KAAM,KACjE,OAAO10B,MAAK40B,KAAK,KAAM,MAAO50B,KAAK00B,MAAOxiB,EAAMC,IAQpDsiB,EAAS15B,UAAU26B,eAAiB,WAChC,GAAIC,GAAa31B,KAAK41B,QACtB,OAAO5pB,MAAK6B,IAAI,EAAK8nB,IAAe31B,KAAK+X,QAAU,GAMvD0c,EAAS15B,UAAU66B,OAAS,WACxB,GAAID,EACJ,IAAI31B,KAAKi1B,UAAYj1B,KAAKkS,KAAK+iB,SAC3B,KAAM,IAAItqB,OAAM,0BAA4B3K,KAAK3D,IAAM,IAAM2D,KAAK5E,MAAQ,IAE9E,IAAI4E,KAAKmS,MAAM8iB,SACX,KAAM,IAAItqB,OAAM,mBAAqB3K,KAAK3D,IAAM,IAAM2D,KAAK5E,MAAQ,WAGvE,KADAu6B,EAAa31B,KAAKkS,KAAK0jB,YACJ51B,KAAKmS,MAAMyjB,SAC1B,KAAM,IAAIjrB,OAAM,sBAGhB,OAAOgrB,IAAc31B,KAAKi1B,SAAW,EAAI,IAGjDR,EAASE,KAAM,EACfF,EAASoB,OAAQ,EACVpB,IAEX96B,GAAQ86B,SAAWA,CAInB,IAAIqB,GAA+B,WAC/B,QAASA,MA2FT,MApFAA,GAAc/6B,UAAU65B,KAAO,SAAUv4B,EAAKjB,EAAOs5B,EAAOxiB,EAAMC,GAC9D,MAAOnS,OAUX81B,EAAc/6B,UAAU2c,OAAS,SAAUrb,EAAKjB,EAAO+4B,GACnD,MAAO,IAAIM,GAASp4B,EAAKjB,EAAO,OASpC06B,EAAc/6B,UAAUsP,OAAS,SAAUhO,EAAK83B,GAC5C,MAAOn0B,OAKX81B,EAAc/6B,UAAUgd,MAAQ,WAC5B,MAAO,IAKX+d,EAAc/6B,UAAU6W,QAAU,WAC9B,OAAO,GAUXkkB,EAAc/6B,UAAUye,iBAAmB,SAAUD,GACjD,OAAO,GAUXuc,EAAc/6B,UAAU85B,iBAAmB,SAAUtb,GACjD,OAAO,GAKXuc,EAAc/6B,UAAUoe,OAAS,WAC7B,MAAO,OAKX2c,EAAc/6B,UAAUmd,OAAS,WAC7B,MAAO,OAMX4d,EAAc/6B,UAAU66B,OAAS,WAC7B,MAAO,IAMXE,EAAc/6B,UAAUk6B,OAAS,WAC7B,OAAO,GAEJa,IAEXn8B,GAAQm8B,cAAgBA,CAKxB,IAAIvf,GAA2B,WAM3B,QAASA,GAAUwf,EAAaC,OACd,KAAVA,IAAoBA,EAAQzf,EAAUb,YAC1C1V,KAAK+1B,YAAcA,EACnB/1B,KAAKg2B,MAAQA,EAyJjB,MA/IAzf,GAAUxb,UAAU2c,OAAS,SAAUrb,EAAKjB,GACxC,MAAO,IAAImb,GAAUvW,KAAK+1B,YAAa/1B,KAAKg2B,MACvCte,OAAOrb,EAAKjB,EAAO4E,KAAK+1B,aACxBnB,KAAK,KAAM,KAAMH,EAASoB,MAAO,KAAM,QAQhDtf,EAAUxb,UAAUsP,OAAS,SAAUhO,GACnC,MAAO,IAAIka,GAAUvW,KAAK+1B,YAAa/1B,KAAKg2B,MACvC3rB,OAAOhO,EAAK2D,KAAK+1B,aACjBnB,KAAK,KAAM,KAAMH,EAASoB,MAAO,KAAM,QAShDtf,EAAUxb,UAAUL,IAAM,SAAU2B,GAGhC,IAFA,GAAIiW,GACA/U,EAAOyC,KAAKg2B,OACRz4B,EAAKqU,WAAW,CAEpB,GAAY,KADZU,EAAMtS,KAAK+1B,YAAY15B,EAAKkB,EAAKlB,MAE7B,MAAOkB,GAAKnC,KAEPkX,GAAM,EACX/U,EAAOA,EAAK2U,KAEPI,EAAM,IACX/U,EAAOA,EAAK4U,OAGpB,MAAO,OAOXoE,EAAUxb,UAAUie,kBAAoB,SAAU3c,GAE9C,IADA,GAAIiW,GAAK/U,EAAOyC,KAAKg2B,MAAOC,EAAc,MAClC14B,EAAKqU,WAAW,CAEpB,GAAY,KADZU,EAAMtS,KAAK+1B,YAAY15B,EAAKkB,EAAKlB,MAClB,CACX,GAAKkB,EAAK2U,KAAKN,UAMV,MAAIqkB,GACEA,EAAY55B,IAGZ,IARP,KADAkB,EAAOA,EAAK2U,MACJ3U,EAAK4U,MAAMP,WACfrU,EAAOA,EAAK4U,KAChB,OAAO5U,GAAKlB,IASXiW,EAAM,EACX/U,EAAOA,EAAK2U,KAEPI,EAAM,IACX2jB,EAAc14B,EACdA,EAAOA,EAAK4U,OAGpB,KAAM,IAAIxH,OAAM,0EAKpB4L,EAAUxb,UAAU6W,QAAU,WAC1B,MAAO5R,MAAKg2B,MAAMpkB,WAKtB2E,EAAUxb,UAAUgd,MAAQ,WACxB,MAAO/X,MAAKg2B,MAAMje,SAKtBxB,EAAUxb,UAAUoe,OAAS,WACzB,MAAOnZ,MAAKg2B,MAAM7c,UAKtB5C,EAAUxb,UAAUmd,OAAS,WACzB,MAAOlY,MAAKg2B,MAAM9d,UAWtB3B,EAAUxb,UAAUye,iBAAmB,SAAUD,GAC7C,MAAOvZ,MAAKg2B,MAAMxc,iBAAiBD,IAUvChD,EAAUxb,UAAU85B,iBAAmB,SAAUtb,GAC7C,MAAOvZ,MAAKg2B,MAAMnB,iBAAiBtb,IAQvChD,EAAUxb,UAAU2e,YAAc,SAAUwc,GACxC,MAAO,IAAIjC,GAAkBj0B,KAAKg2B,MAAO,KAAMh2B,KAAK+1B,aAAa,EAAOG,IAE5E3f,EAAUxb,UAAU4e,gBAAkB,SAAUtd,EAAK65B,GACjD,MAAO,IAAIjC,GAAkBj0B,KAAKg2B,MAAO35B,EAAK2D,KAAK+1B,aAAa,EAAOG,IAE3E3f,EAAUxb,UAAUkf,uBAAyB,SAAU5d,EAAK65B,GACxD,MAAO,IAAIjC,GAAkBj0B,KAAKg2B,MAAO35B,EAAK2D,KAAK+1B,aAAa,EAAMG,IAE1E3f,EAAUxb,UAAUif,mBAAqB,SAAUkc,GAC/C,MAAO,IAAIjC,GAAkBj0B,KAAKg2B,MAAO,KAAMh2B,KAAK+1B,aAAa,EAAMG,IAM3E3f,EAAUb,WAAa,GAAIogB,GACpBvf,IAEX5c,GAAQ4c,UAAYA,GxCwkKd,SAAU3c,EAAQD,EAASH,GAEjC,YAkBA,IAAIoF,GAA4B,kBAAXuI,SAAoD,gBAApBA,QAAOC,SAAwB,SAAU3K,GAAO,aAAcA,IAAS,SAAUA,GAAO,MAAOA,IAAyB,kBAAX0K,SAAyB1K,EAAIoH,cAAgBsD,QAAU1K,IAAQ0K,OAAOpM,UAAY,eAAkB0B,GyC3tLtQnC,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAI+6B,GAAiB38B,EAAQ,IACzB48B,EAAiB58B,EAAQ,IACzBijB,EAASjjB,EAAQ,GACjB68B,EAAuB78B,EAAQ,IAC/B88B,EAAa98B,EAAQ,KACrB+8B,EAAmB/8B,EAAQ,KAC3BuO,EAASvO,EAAQ,GACjBwO,EAASxO,EAAQ,GACjByO,EAASzO,EAAQ,GACjBg9B,EAAsBh9B,EAAQ,KAC9Bi9B,EAAiBj9B,EAAQ,IACzBk9B,EAAkBl9B,EAAQ,KAC1Bm9B,EAAkBn9B,EAAQ,KAC1Bo9B,EAAep9B,EAAQ,KACvBq9B,EAAyBr9B,EAAQ,KACjCs9B,EAAuBt9B,EAAQ,KAC/Bu9B,EAAav9B,EAAQ,IAKrBw9B,EAAsB,WAMtB,QAASA,GAAKC,EAAWC,EAAiBC,GACtC,GAAIC,GAAQp3B,IACZA,MAAKi3B,UAAYA,EACjBj3B,KAAKm3B,IAAMA,EACXn3B,KAAKq3B,gBAAkB,EACvBr3B,KAAKs3B,eAAiB,KACtBt3B,KAAKu3B,YAAc,GAAIX,GAAaY,WACpCx3B,KAAKy3B,aAAe,EACpBz3B,KAAK03B,6BAA+B,KAEpC13B,KAAK23B,cAAgB,GAAItB,GAAqBuB,mBAK9C53B,KAAK63B,sBAAwB,IAE7B,IAAIC,GAAoB,GAAItB,GAAoBuB,kBAAkBZ,EAElE,IADAn3B,KAAKg4B,OAASvB,EAAewB,aAAaC,cAAcjB,GACpDC,GAAmBlvB,EAAOuH,eAC1BvP,KAAKm4B,QAAU,GAAIrB,GAAqBsB,mBAAmBp4B,KAAKi3B,UAAWj3B,KAAKq4B,cAAc7wB,KAAKxH,MAAO83B,GAE1GrwB,WAAWzH,KAAKs4B,iBAAiB9wB,KAAKxH,MAAM,GAAO,OAElD,CACD,GAAIu4B,GAAepB,EAAI76B,QAAJ,4BAEnB,QAA4B,KAAjBi8B,GAAiD,OAAjBA,EAAuB,CAC9D,GAA4B,gBAAxB,KAAOA,EAAP,YAAA35B,EAAO25B,IACP,KAAM,IAAI5tB,OAAM,qEAEpB,KACI5C,EAAO2B,UAAU6uB,GAErB,MAAOx4B,GACH,KAAM,IAAI4K,OAAM,kCAAoC5K,IAG5DC,KAAK63B,sBAAwB,GAAIhB,GAAuB2B,qBAAqBx4B,KAAKi3B,UAAWj3B,KAAKq4B,cAAc7wB,KAAKxH,MAAOA,KAAKs4B,iBAAiB9wB,KAAKxH,MAAOA,KAAKy4B,oBAAoBjxB,KAAKxH,MAAO83B,EAAmBS,GACtNv4B,KAAKm4B,QAAUn4B,KAAK63B,sBAExBC,EAAkBY,uBAAuB,SAAUhX,GAC/C0V,EAAMe,QAAQQ,iBAAiBjX,KAInC1hB,KAAK44B,eAAiBnC,EAAewB,aAAaY,oBAAoB5B,EAAW,WAAc,MAAO,IAAIP,GAAgBoC,cAAc1B,EAAMY,OAAQZ,EAAMe,WAC5Jn4B,KAAK+4B,qBAEL/4B,KAAKg5B,UAAY,GAAIzC,GAAiB0C,eACtCj5B,KAAKk5B,cAAgB,GAAI5C,GAAW6C,UAChCC,eAAgB,SAAUtqB,EAAOuqB,EAAKC,EAAeC,GACjD,GAAIC,MACAj8B,EAAO65B,EAAM4B,UAAUS,QAAQ3qB,EAAME,KASzC,OANKzR,GAAKqU,YACN4nB,EAAapC,EAAM8B,cAAcQ,qBAAqB5qB,EAAME,KAAMzR,GAClEkK,WAAW,WACP8xB,EAAW,OACZ,IAEAC,GAEXG,cAAe,eAEnB35B,KAAK45B,YAAY,aAAa,GAC9B55B,KAAK65B,gBAAkB,GAAIvD,GAAW6C,UAClCC,eAAgB,SAAUtqB,EAAOuqB,EAAKC,EAAeC,GAMjD,MALAnC,GAAMe,QAAQ2B,OAAOhrB,EAAOwqB,EAAeD,EAAK,SAAUU,EAAQ1uB,GAC9D,GAAI2uB,GAAST,EAAWQ,EAAQ1uB,EAChC+rB,GAAMG,YAAY0C,0BAA0BnrB,EAAME,KAAMgrB,SAKhEL,cAAe,SAAU7qB,EAAOuqB,GAC5BjC,EAAMe,QAAQ+B,SAASprB,EAAOuqB,MAkZ1C,MA3YArC,GAAKj8B,UAAUuT,SAAW,WACtB,OAAStO,KAAKi3B,UAAUkD,OAAS,WAAa,WAAan6B,KAAKi3B,UAAUvY,MAK9EsY,EAAKj8B,UAAUZ,KAAO,WAClB,MAAO6F,MAAKi3B,UAAUtY,WAK1BqY,EAAKj8B,UAAUq/B,WAAa,WACxB,GAAIC,GAAar6B,KAAKg5B,UAAUS,QAAQ,GAAIhd,GAAO/L,KAAK,2BACpDqQ,EAASsZ,EAAWhtB,OAAS,CACjC,QAAO,GAAI8S,OAAOC,UAAYW,GAMlCiW,EAAKj8B,UAAUu/B,qBAAuB,WAClC,MAAOnE,GAAeoE,oBAClBvZ,UAAWhhB,KAAKo6B,gBAYxBpD,EAAKj8B,UAAUs9B,cAAgB,SAAUhnB,EAAYhG,EAAMmvB,EAASnB,GAEhEr5B,KAAKq3B,iBACL,IAAIroB,GAAO,GAAIyN,GAAO/L,KAAKW,EAC3BhG,GAAOrL,KAAK03B,6BACN13B,KAAK03B,6BAA6BrmB,EAAYhG,GAC9CA,CACN,IAAI2uB,KACJ,IAAIX,EACA,GAAImB,EAAS,CACT,GAAIC,GAAiBxyB,EAAOuI,IAAInF,EAAM,SAAUqvB,GAC5C,MAAOtE,GAAe5iB,aAAaknB,IAEvCV,GAASh6B,KAAK65B,gBAAgBc,sBAAsB3rB,EAAMyrB,EAAgBpB,OAEzE,CACD,GAAIuB,GAAaxE,EAAe5iB,aAAanI,EAC7C2uB,GAASh6B,KAAK65B,gBAAgBgB,0BAA0B7rB,EAAM4rB,EAAYvB,OAG7E,IAAImB,EAAS,CACd,GAAIM,GAAkB7yB,EAAOuI,IAAInF,EAAM,SAAUqvB,GAC7C,MAAOtE,GAAe5iB,aAAaknB,IAEvCV,GAASh6B,KAAK65B,gBAAgBkB,iBAAiB/rB,EAAM8rB,OAEpD,CACD,GAAIE,GAAO5E,EAAe5iB,aAAanI,EACvC2uB,GAASh6B,KAAK65B,gBAAgBH,qBAAqB1qB,EAAMgsB,GAE7D,GAAIC,GAAejsB,CACfgrB,GAAOj+B,OAAS,IAGhBk/B,EAAej7B,KAAKk7B,mBAAmBlsB,IAE3ChP,KAAKu3B,YAAY0C,0BAA0BgB,EAAcjB,IAO7DhD,EAAKj8B,UAAUogC,qBAAuB,SAAUxzB,GAC5C3H,KAAK03B,6BAA+B/vB,GAMxCqvB,EAAKj8B,UAAUu9B,iBAAmB,SAAU8C,GACxCp7B,KAAK45B,YAAY,YAAawB,IACR,IAAlBA,GACAp7B,KAAKq7B,0BAObrE,EAAKj8B,UAAU09B,oBAAsB,SAAU6C,GAC3C,GAAIlE,GAAQp3B,IACZgI,GAAOmF,KAAKmuB,EAAS,SAAUlgC,EAAOiB,GAClC+6B,EAAMwC,YAAYv9B,EAAKjB,MAS/B47B,EAAKj8B,UAAU6+B,YAAc,SAAUvoB,EAAYjW,GAC/C,GAAI4T,GAAO,GAAIyN,GAAO/L,KAAK,UAAYW,GACnC0D,EAAUqhB,EAAe5iB,aAAapY,EAC1C4E,MAAKg5B,UAAUuC,eAAevsB,EAAM+F,EACpC,IAAIilB,GAASh6B,KAAKk5B,cAAcQ,qBAAqB1qB,EAAM+F,EAC3D/U,MAAKu3B,YAAY0C,0BAA0BjrB,EAAMgrB,IAMrDhD,EAAKj8B,UAAUygC,gBAAkB,WAC7B,MAAOx7B,MAAKy3B,gBAQhBT,EAAKj8B,UAAU0gC,gBAAkB,SAAUzsB,EAAM0sB,EAAQlkB,EAAa+hB,GAClE,GAAInC,GAAQp3B,IACZA,MAAK27B,KAAK,OACN3sB,KAAMA,EAAKV,WACXlT,MAAOsgC,EACPze,SAAUzF,GAId,IAAIokB,GAAe57B,KAAKs6B,uBACpBuB,EAAoBzF,EAAe5iB,aAAakoB,EAAQlkB,GACxDzC,EAAUohB,EAAe2F,6BAA6BD,EAAmBD,GACzEG,EAAU/7B,KAAKw7B,kBACfxB,EAASh6B,KAAK65B,gBAAgBmC,mBAAmBhtB,EAAM+F,EAASgnB,GAAS,EAC7E/7B,MAAKu3B,YAAY0E,YAAYjC,GAC7Bh6B,KAAKm4B,QAAQ+D,IAAIltB,EAAKV,WAAYutB,EAAkBxuB,KAAgB,GAAO,SAAU0sB,EAAQoC,GACzF,GAAIC,GAAqB,OAAXrC,CACTqC,IACDp0B,EAAO4C,KAAK,UAAYoE,EAAO,YAAc+qB,EAEjD,IAAIsC,GAAcjF,EAAMyC,gBAAgByC,aAAaP,GAAUK,EAC/DhF,GAAMG,YAAY0C,0BAA0BjrB,EAAMqtB,GAClDjF,EAAMmF,uBAAuBhD,EAAYQ,EAAQoC,IAErD,IAAIlB,GAAej7B,KAAKw8B,mBAAmBxtB,EAC3ChP,MAAKk7B,mBAAmBD,GAExBj7B,KAAKu3B,YAAY0C,0BAA0BgB,OAO/CjE,EAAKj8B,UAAU+N,OAAS,SAAUkG,EAAMytB,EAAiBlD,GACrD,GAAInC,GAAQp3B,IACZA,MAAK27B,KAAK,UAAY3sB,KAAMA,EAAKV,WAAYlT,MAAOqhC,GAEpD,IAAIC,IAAQ,EACRd,EAAe57B,KAAKs6B,uBACpBQ,IAMJ,IALA7yB,EAAOmF,QAAQqvB,EAAiB,SAAUE,EAAYC,GAClDF,GAAQ,CACR,IAAIb,GAAoBzF,EAAe5iB,aAAaopB,EACpD9B,GAAgB6B,GAAcxG,EAAe2F,6BAA6BD,EAAmBD,KAE5Fc,EAsBD10B,EAAOkC,IAAI,wDACXlK,KAAKu8B,uBAAuBhD,EAAY,UAvBhC,CACR,GAAIsD,GAAY78B,KAAKw7B,kBACjBxB,EAASh6B,KAAK65B,gBAAgBiD,eAAe9tB,EAAM8rB,EAAiB+B,EACxE78B,MAAKu3B,YAAY0E,YAAYjC,GAC7Bh6B,KAAKm4B,QAAQjxB,MAAM8H,EAAKV,WAAYmuB,EAAiB,SAAU1C,EAAQoC,GACnE,GAAIC,GAAqB,OAAXrC,CACTqC,IACDp0B,EAAO4C,KAAK,aAAeoE,EAAO,YAAc+qB,EAEpD,IAAIsC,GAAcjF,EAAMyC,gBAAgByC,aAAaO,GAAYT,GAC7DnB,EAAeoB,EAAYtgC,OAAS,EAAIq7B,EAAM8D,mBAAmBlsB,GAAQA,CAC7EooB,GAAMG,YAAY0C,0BAA0BgB,EAAcoB,GAC1DjF,EAAMmF,uBAAuBhD,EAAYQ,EAAQoC,KAErDl0B,EAAOmF,QAAQqvB,EAAiB,SAAUM,GACtC,GAAI9B,GAAe7D,EAAMoF,mBAAmBxtB,EAAKtT,MAAMqhC,GACvD3F,GAAM8D,mBAAmBD,KAG7Bj7B,KAAKu3B,YAAY0C,0BAA0BjrB,QAWnDgoB,EAAKj8B,UAAUsgC,uBAAyB,WACpC,GAAIjE,GAAQp3B,IACZA,MAAK27B,KAAK,qBACV,IAAIC,GAAe57B,KAAKs6B,uBACpB0C,EAA2B7G,EAAe8G,yBAAyBj9B,KAAK23B,cAAeiE,GACvF5B,IACJgD,GAAyBE,YAAYzgB,EAAO/L,KAAKysB,MAAO,SAAUnuB,EAAMgsB,GACpEhB,EAASA,EAAOxvB,OAAO4sB,EAAMyC,gBAAgBH,qBAAqB1qB,EAAMgsB,GACxE,IAAIC,GAAe7D,EAAMoF,mBAAmBxtB,EAC5CooB,GAAM8D,mBAAmBD,KAE7Bj7B,KAAK23B,cAAgB,GAAItB,GAAqBuB,mBAC9C53B,KAAKu3B,YAAY0C,0BAA0Bxd,EAAO/L,KAAKysB,MAAOnD,IAMlEhD,EAAKj8B,UAAUqiC,mBAAqB,SAAUpuB,EAAMuqB,GAChD,GAAInC,GAAQp3B,IACZA,MAAKm4B,QAAQiF,mBAAmBpuB,EAAKV,WAAY,SAAUyrB,EAAQoC,GAChD,OAAXpC,GACA3C,EAAMO,cAAc0F,OAAOruB,GAE/BooB,EAAMmF,uBAAuBhD,EAAYQ,EAAQoC,MAQzDnF,EAAKj8B,UAAUuiC,gBAAkB,SAAUtuB,EAAM5T,EAAOm+B,GACpD,GAAInC,GAAQp3B,KACR+U,EAAUqhB,EAAe5iB,aAAapY,EAC1C4E,MAAKm4B,QAAQoF,gBAAgBvuB,EAAKV,WAAYyG,EAAQ1H,KAAgB,GAAO,SAAU0sB,EAAQoC,GAC5E,OAAXpC,GACA3C,EAAMO,cAAc6F,SAASxuB,EAAM+F,GAEvCqiB,EAAMmF,uBAAuBhD,EAAYQ,EAAQoC,MASzDnF,EAAKj8B,UAAU0iC,4BAA8B,SAAUzuB,EAAM5T,EAAO6hB,EAAUsc,GAC1E,GAAInC,GAAQp3B,KACR+U,EAAUqhB,EAAe5iB,aAAapY,EAAO6hB,EACjDjd,MAAKm4B,QAAQoF,gBAAgBvuB,EAAKV,WAAYyG,EAAQ1H,KAAgB,GAAO,SAAU0sB,EAAQoC,GAC5E,OAAXpC,GACA3C,EAAMO,cAAc6F,SAASxuB,EAAM+F,GAEvCqiB,EAAMmF,uBAAuBhD,EAAYQ,EAAQoC,MAQzDnF,EAAKj8B,UAAU2iC,mBAAqB,SAAU1uB,EAAMytB,EAAiBlD,GACjE,GAAInC,GAAQp3B,IACZ,IAAIiI,EAAO2J,QAAQ6qB,GAGf,MAFAz0B,GAAOkC,IAAI,2EACXlK,MAAKu8B,uBAAuBhD,EAAY,KAG5Cv5B,MAAKm4B,QAAQwF,kBAAkB3uB,EAAKV,WAAYmuB,EAAiB,SAAU1C,EAAQoC,GAChE,OAAXpC,GACA9xB,EAAOmF,QAAQqvB,EAAiB,SAAU1lB,EAAWsB,GACjD,GAAIjB,GAAegf,EAAe5iB,aAAa6E,EAC/C+e,GAAMO,cAAc6F,SAASxuB,EAAKtT,MAAMqb,GAAYK,KAG5DggB,EAAMmF,uBAAuBhD,EAAYQ,EAAQoC,MAOzDnF,EAAKj8B,UAAU6iC,yBAA2B,SAAU9uB,EAAO+uB,GACvD,GAAI7D,EAEAA,GAD0B,UAA1BlrB,EAAME,KAAKiC,WACFjR,KAAKk5B,cAAc4E,qBAAqBhvB,EAAO+uB,GAG/C79B,KAAK65B,gBAAgBiE,qBAAqBhvB,EAAO+uB,GAE9D79B,KAAKu3B,YAAYwG,kBAAkBjvB,EAAME,KAAMgrB,IAMnDhD,EAAKj8B,UAAUijC,4BAA8B,SAAUlvB,EAAO+uB,GAG1D,GAAI7D,EAEAA,GAD0B,UAA1BlrB,EAAME,KAAKiC,WACFjR,KAAKk5B,cAAc+E,wBAAwBnvB,EAAO+uB,GAGlD79B,KAAK65B,gBAAgBoE,wBAAwBnvB,EAAO+uB,GAEjE79B,KAAKu3B,YAAYwG,kBAAkBjvB,EAAME,KAAMgrB,IAEnDhD,EAAKj8B,UAAUmjC,UAAY,WACnBl+B,KAAK63B,uBACL73B,KAAK63B,sBAAsBqG,UAzZhB,mBA4ZnBlH,EAAKj8B,UAAUojC,OAAS,WAChBn+B,KAAK63B,uBACL73B,KAAK63B,sBAAsBsG,OA9ZhB,mBAianBnH,EAAKj8B,UAAUqjC,MAAQ,SAAUC,GAE7B,OADkB,KAAdA,IAAwBA,GAAY,GACjB,mBAAZp0B,SAAX,CAEA,GAAIm0B,EACAC,IACKr+B,KAAKs3B,iBACNt3B,KAAKs3B,eAAiB,GAAIX,GAAgB2H,cAAct+B,KAAKg4B,SACjEoG,EAAQp+B,KAAKs3B,eAAe58B,OAG5B0jC,EAAQp+B,KAAKg4B,OAAOt9B,KAExB,IAAI6jC,GAAcjkC,OAAOuS,KAAKuxB,GAAOI,OAAO,SAAUC,EAAeC,GACjE,MAAO1yB,MAAK8G,IAAI4rB,EAAa3iC,OAAQ0iC,IACtC,EACHx2B,GAAOmF,QAAQgxB,EAAO,SAAUO,EAAMvjC,GAElC,IAAK,GAAIvB,GAAI8kC,EAAK5iC,OAAQlC,EAAI0kC,EAAc,EAAG1kC,IAC3C8kC,GAAQ,GACZ10B,SAAQC,IAAIy0B,EAAOvjC,OAG3B47B,EAAKj8B,UAAU6jC,sBAAwB,SAAUC,GAC7C7+B,KAAKg4B,OAAO8G,iBAAiBD,GAC7B7+B,KAAK44B,eAAemG,YAAYF,IAMpC7H,EAAKj8B,UAAU4gC,KAAO,WAElB,IAAK,GADDvyB,MACKC,EAAK,EAAGA,EAAKvN,UAAUC,OAAQsN,IACpCD,EAASC,GAAMvN,UAAUuN,EAE7B,IAAIkB,GAAS,EACTvK,MAAK63B,wBACLttB,EAASvK,KAAK63B,sBAAsBrvB,GAAK,KAE7CR,EAAOkC,IAAIT,UAAM,IAASc,GAAQC,OAAOpB,KAO7C4tB,EAAKj8B,UAAUwhC,uBAAyB,SAAU50B,EAAUoyB,EAAQoC,GAC5Dx0B,GACAK,EAAOqH,eAAe,WAClB,GAAc,MAAV0qB,EACApyB,EAAS,UAER,CACD,GAAIkH,IAAQkrB,GAAU,SAAS9qB,cAC3B3F,EAAUuF,CACVstB,KACA7yB,GAAW,KAAO6yB,EACtB,IAAI1xB,GAAQ,GAAIE,OAAMrB,EACtBmB,GAAMoE,KAAOA,EACblH,EAAS8C,OAKzBnQ,OAAOC,eAAey8B,EAAKj8B,UAAW,YAClCL,IAAK,WACD,MAAOsF,MAAKg/B,aAAeh/B,KAAKg/B,WAAa,GAAIjI,GAAWkI,SAASj/B,QAEzEvF,YAAY,EACZD,cAAc,IAEXw8B,IAEXr9B,GAAQq9B,KAAOA,GzCwtLT,SAAUp9B,EAAQD,EAASH,GAEjC,Y0CvtMAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GAOtD,IAAI8jC,GAA2B,WAM3B,QAASA,GAAUC,EAAOC,EAAmBC,GACzCr/B,KAAKm/B,MAAQA,EACbn/B,KAAKo/B,kBAAoBA,EACzBp/B,KAAKq/B,UAAYA,EAwCrB,MAlCAH,GAAUnkC,UAAUukC,mBAAqB,WACrC,MAAOt/B,MAAKo/B,mBAMhBF,EAAUnkC,UAAUwkC,WAAa,WAC7B,MAAOv/B,MAAKq/B,WAMhBH,EAAUnkC,UAAUykC,kBAAoB,SAAUxwB,GAC9C,GAAIA,EAAK4C,UACL,MAAO5R,MAAKs/B,uBAAyBt/B,KAAKq/B,SAE9C,IAAIja,GAAWpW,EAAKiC,UACpB,OAAOjR,MAAKy/B,mBAAmBra,IAMnC8Z,EAAUnkC,UAAU0kC,mBAAqB,SAAUpjC,GAC/C,MAAS2D,MAAKs/B,uBAAyBt/B,KAAKq/B,WAAcr/B,KAAKm/B,MAAMjoB,SAAS7a,IAKlF6iC,EAAUnkC,UAAU0+B,QAAU,WAC1B,MAAOz5B,MAAKm/B,OAETD,IAEXvlC,GAAQulC,UAAYA,G1C8uMZ,CAEF,SAAUtlC,EAAQD,EAASH,GAEjC,cAC4B,SAASI,GAErC,GAAIgF,GAA4B,kBAAXuI,SAAoD,gBAApBA,QAAOC,SAAwB,SAAU3K,GAAO,aAAcA,IAAS,SAAUA,GAAO,MAAOA,IAAyB,kBAAX0K,SAAyB1K,EAAIoH,cAAgBsD,QAAU1K,IAAQ0K,OAAOpM,UAAY,eAAkB0B,K2CrzMpQ,SAASijC,GA4BT,QAASC,GAAKC,EAASC,EAASnU,EAAMoU,GAEpC,GAAIC,GAAiBF,GAAWA,EAAQ9kC,oBAAqBilC,GAAYH,EAAUG,EAC/EC,EAAY3lC,OAAO0Z,OAAO+rB,EAAehlC,WACzC0F,EAAU,GAAIy/B,GAAQJ,MAM1B,OAFAG,GAAUE,QAAUC,EAAiBR,EAASlU,EAAMjrB,GAE7Cw/B,EAcT,QAASI,GAAS30B,EAAIjP,EAAK6jC,GACzB,IACE,OAASrgC,KAAM,SAAUqgC,IAAK50B,EAAG3R,KAAK0C,EAAK6jC,IAC3C,MAAOtT,GACP,OAAS/sB,KAAM,QAASqgC,IAAKtT,IAiBjC,QAASgT,MACT,QAASO,MACT,QAASC,MA4BT,QAASC,GAAsB1lC,IAC5B,OAAQ,QAAS,UAAUqS,QAAQ,SAASszB,GAC3C3lC,EAAU2lC,GAAU,SAASJ,GAC3B,MAAOtgC,MAAKmgC,QAAQO,EAAQJ,MAoClC,QAASK,GAAcV,GACrB,QAASW,GAAOF,EAAQJ,EAAKh5B,EAAS0kB,GACpC,GAAI6U,GAASR,EAASJ,EAAUS,GAAST,EAAWK,EACpD,IAAoB,UAAhBO,EAAO5gC,KAEJ,CACL,GAAIs0B,GAASsM,EAAOP,IAChBllC,EAAQm5B,EAAOn5B,KACnB,OAAIA,IACiB,gBAAjB,KAAOA,EAAP,YAAAwD,EAAOxD,KACP0lC,EAAO/mC,KAAKqB,EAAO,WACdiM,QAAQC,QAAQlM,EAAM2lC,SAASx5B,KAAK,SAASnM,GAClDwlC,EAAO,OAAQxlC,EAAOkM,EAAS0kB,IAC9B,SAASgB,GACV4T,EAAO,QAAS5T,EAAK1lB,EAAS0kB,KAI3B3kB,QAAQC,QAAQlM,GAAOmM,KAAK,SAASy5B,GAgB1CzM,EAAOn5B,MAAQ4lC,EACf15B,EAAQitB,IACPvI,GAhCHA,EAAO6U,EAAOP,KAsClB,QAASW,GAAQP,EAAQJ,GACvB,QAASY,KACP,MAAO,IAAI75B,SAAQ,SAASC,EAAS0kB,GACnC4U,EAAOF,EAAQJ,EAAKh5B,EAAS0kB,KAIjC,MAAOmV,GAaLA,EAAkBA,EAAgB55B,KAChC25B,EAGAA,GACEA,IA3BR,GAAIC,EAgCJnhC,MAAKmgC,QAAUc,EAwBjB,QAASb,GAAiBR,EAASlU,EAAMjrB,GACvC,GAAI8D,GAAQ68B,CAEZ,OAAO,UAAgBV,EAAQJ,GAC7B,GAAI/7B,IAAU88B,EACZ,KAAM,IAAI12B,OAAM,+BAGlB,IAAIpG,IAAU+8B,EAAmB,CAC/B,GAAe,UAAXZ,EACF,KAAMJ,EAKR,OAAOiB,KAMT,IAHA9gC,EAAQigC,OAASA,EACjBjgC,EAAQ6/B,IAAMA,IAED,CACX,GAAIkB,GAAW/gC,EAAQ+gC,QACvB,IAAIA,EAAU,CACZ,GAAIC,GAAiBC,EAAoBF,EAAU/gC,EACnD,IAAIghC,EAAgB,CAClB,GAAIA,IAAmBE,EAAkB,QACzC,OAAOF,IAIX,GAAuB,SAAnBhhC,EAAQigC,OAGVjgC,EAAQmhC,KAAOnhC,EAAQohC,MAAQphC,EAAQ6/B,QAElC,IAAuB,UAAnB7/B,EAAQigC,OAAoB,CACrC,GAAIn8B,IAAU68B,EAEZ,KADA78B,GAAQ+8B,EACF7gC,EAAQ6/B,GAGhB7/B,GAAQqhC,kBAAkBrhC,EAAQ6/B,SAEN,WAAnB7/B,EAAQigC,QACjBjgC,EAAQshC,OAAO,SAAUthC,EAAQ6/B,IAGnC/7B,GAAQ88B,CAER,IAAIR,GAASR,EAAST,EAASlU,EAAMjrB,EACrC,IAAoB,WAAhBogC,EAAO5gC,KAAmB,CAO5B,GAJAsE,EAAQ9D,EAAQ6rB,KACZgV,EACAU,EAEAnB,EAAOP,MAAQqB,EACjB,QAGF,QACEvmC,MAAOylC,EAAOP,IACdhU,KAAM7rB,EAAQ6rB,MAGS,UAAhBuU,EAAO5gC,OAChBsE,EAAQ+8B,EAGR7gC,EAAQigC,OAAS,QACjBjgC,EAAQ6/B,IAAMO,EAAOP,OAU7B,QAASoB,GAAoBF,EAAU/gC,GACrC,GAAIigC,GAASc,EAASp6B,SAAS3G,EAAQigC,OACvC,IAAIA,IAAWvkC,EAAW,CAKxB,GAFAsE,EAAQ+gC,SAAW,KAEI,UAAnB/gC,EAAQigC,OAAoB,CAC9B,GAAIc,EAASp6B,SAAS66B,SAGpBxhC,EAAQigC,OAAS,SACjBjgC,EAAQ6/B,IAAMnkC,EACdulC,EAAoBF,EAAU/gC,GAEP,UAAnBA,EAAQigC,QAGV,MAAOiB,EAIXlhC,GAAQigC,OAAS,QACjBjgC,EAAQ6/B,IAAM,GAAInV,WAChB,kDAGJ,MAAOwW,GAGT,GAAId,GAASR,EAASK,EAAQc,EAASp6B,SAAU3G,EAAQ6/B,IAEzD,IAAoB,UAAhBO,EAAO5gC,KAIT,MAHAQ,GAAQigC,OAAS,QACjBjgC,EAAQ6/B,IAAMO,EAAOP,IACrB7/B,EAAQ+gC,SAAW,KACZG,CAGT,IAAIO,GAAOrB,EAAOP,GAElB,OAAM4B,GAOFA,EAAK5V,MAGP7rB,EAAQ+gC,EAASW,YAAcD,EAAK9mC,MAGpCqF,EAAQgD,KAAO+9B,EAASY,QAQD,WAAnB3hC,EAAQigC,SACVjgC,EAAQigC,OAAS,OACjBjgC,EAAQ6/B,IAAMnkC,GAUlBsE,EAAQ+gC,SAAW,KACZG,GANEO,GA3BPzhC,EAAQigC,OAAS,QACjBjgC,EAAQ6/B,IAAM,GAAInV,WAAU,oCAC5B1qB,EAAQ+gC,SAAW,KACZG,GAoDX,QAASU,GAAaC,GACpB,GAAIC,IAAUC,OAAQF,EAAK,GAEvB,KAAKA,KACPC,EAAME,SAAWH,EAAK,IAGpB,IAAKA,KACPC,EAAMG,WAAaJ,EAAK,GACxBC,EAAMI,SAAWL,EAAK,IAGxBtiC,KAAK4iC,WAAW3mC,KAAKsmC,GAGvB,QAASM,GAAcN,GACrB,GAAI1B,GAAS0B,EAAMO,cACnBjC,GAAO5gC,KAAO,eACP4gC,GAAOP,IACdiC,EAAMO,WAAajC,EAGrB,QAASX,GAAQJ,GAIf9/B,KAAK4iC,aAAgBJ,OAAQ,SAC7B1C,EAAY1yB,QAAQi1B,EAAcriC,MAClCA,KAAK+iC,OAAM,GA8Bb,QAAShW,GAAOiW,GACd,GAAIA,EAAU,CACZ,GAAIC,GAAiBD,EAASE,EAC9B,IAAID,EACF,MAAOA,GAAelpC,KAAKipC,EAG7B,IAA6B,kBAAlBA,GAASv/B,KAClB,MAAOu/B,EAGT,KAAKG,MAAMH,EAASjnC,QAAS,CAC3B,GAAIlC,IAAK,EAAG4J,EAAO,QAASA,KAC1B,OAAS5J,EAAImpC,EAASjnC,QACpB,GAAI+kC,EAAO/mC,KAAKipC,EAAUnpC,GAGxB,MAFA4J,GAAKrI,MAAQ4nC,EAASnpC,GACtB4J,EAAK6oB,MAAO,EACL7oB,CAOX,OAHAA,GAAKrI,MAAQe,EACbsH,EAAK6oB,MAAO,EAEL7oB,EAGT,OAAOA,GAAKA,KAAOA,GAKvB,OAASA,KAAM89B,GAIjB,QAASA,KACP,OAASnmC,MAAOe,EAAWmwB,MAAM,GA7fnC,GAEInwB,GAFAinC,EAAK9oC,OAAOS,UACZ+lC,EAASsC,EAAGpoC,eAEZqoC,EAA4B,kBAAXl8B,QAAwBA,UACzC+7B,EAAiBG,EAAQj8B,UAAY,aACrCk8B,EAAsBD,EAAQE,eAAiB,kBAC/CC,EAAoBH,EAAQI,aAAe,gBAE3CC,EAA6B,WAAlB9kC,EAAOhF,GAClB+pC,EAAUjE,EAAOkE,kBACrB,IAAID,EAQF,YAPID,IAGF9pC,EAAOD,QAAUgqC,GASrBA,GAAUjE,EAAOkE,mBAAqBF,EAAW9pC,EAAOD,WAcxDgqC,EAAQhE,KAAOA,CAoBf,IAAIyB,GAAyB,iBACzBY,EAAyB,iBACzBX,EAAoB,YACpBC,EAAoB,YAIpBK,KAYAkC,IACJA,GAAkBX,GAAkB,WAClC,MAAOljC,MAGT,IAAI8jC,GAAWxpC,OAAOu2B,eAClBkT,EAA0BD,GAAYA,EAASA,EAAS/W,OACxDgX,IACAA,IAA4BX,GAC5BtC,EAAO/mC,KAAKgqC,EAAyBb,KAGvCW,EAAoBE,EAGtB,IAAIC,GAAKxD,EAA2BzlC,UAClCilC,EAAUjlC,UAAYT,OAAO0Z,OAAO6vB,EACtCtD,GAAkBxlC,UAAYipC,EAAGngC,YAAc28B,EAC/CA,EAA2B38B,YAAc08B,EACzCC,EAA2BgD,GACzBjD,EAAkB0D,YAAc,oBAYlCN,EAAQO,oBAAsB,SAASC,GACrC,GAAIC,GAAyB,kBAAXD,IAAyBA,EAAOtgC,WAClD,SAAOugC,IACHA,IAAS7D,GAG2B,uBAAnC6D,EAAKH,aAAeG,EAAKjqC,QAIhCwpC,EAAQU,KAAO,SAASF,GAUtB,MATI7pC,QAAOuZ,eACTvZ,OAAOuZ,eAAeswB,EAAQ3D,IAE9B2D,EAAOrwB,UAAY0sB,EACbgD,IAAqBW,KACzBA,EAAOX,GAAqB,sBAGhCW,EAAOppC,UAAYT,OAAO0Z,OAAOgwB,GAC1BG,GAOTR,EAAQW,MAAQ,SAAShE,GACvB,OAASS,QAAST,IA8EpBG,EAAsBE,EAAc5lC,WACpC4lC,EAAc5lC,UAAUuoC,GAAuB,WAC7C,MAAOtjC,OAET2jC,EAAQhD,cAAgBA,EAKxBgD,EAAQY,MAAQ,SAAS3E,EAASC,EAASnU,EAAMoU,GAC/C,GAAI0E,GAAO,GAAI7D,GACbhB,EAAKC,EAASC,EAASnU,EAAMoU,GAG/B,OAAO6D,GAAQO,oBAAoBrE,GAC/B2E,EACAA,EAAK/gC,OAAO8D,KAAK,SAASgtB,GACxB,MAAOA,GAAOjI,KAAOiI,EAAOn5B,MAAQopC,EAAK/gC,UAsKjDg9B,EAAsBuD,GAEtBA,EAAGR,GAAqB,YAOxBQ,EAAGd,GAAkB,WACnB,MAAOljC,OAGTgkC,EAAG11B,SAAW,WACZ,MAAO,sBAkCTq1B,EAAQ92B,KAAO,SAAShS,GACtB,GAAIgS,KACJ,KAAK,GAAIxQ,KAAOxB,GACdgS,EAAK5Q,KAAKI,EAMZ,OAJAwQ,GAAKmB,UAIE,QAASvK,KACd,KAAOoJ,EAAK9Q,QAAQ,CAClB,GAAIM,GAAMwQ,EAAK3Q,KACf,IAAIG,IAAOxB,GAGT,MAFA4I,GAAKrI,MAAQiB,EACboH,EAAK6oB,MAAO,EACL7oB,EAQX,MADAA,GAAK6oB,MAAO,EACL7oB,IAsCXkgC,EAAQ5W,OAASA,EAMjBmT,EAAQnlC,WACN8I,YAAaq8B,EAEb6C,MAAO,SAAS0B,GAcd,GAbAzkC,KAAK0kC,KAAO,EACZ1kC,KAAKyD,KAAO,EAGZzD,KAAK4hC,KAAO5hC,KAAK6hC,MAAQ1lC,EACzB6D,KAAKssB,MAAO,EACZtsB,KAAKwhC,SAAW,KAEhBxhC,KAAK0gC,OAAS,OACd1gC,KAAKsgC,IAAMnkC,EAEX6D,KAAK4iC,WAAWx1B,QAAQy1B,IAEnB4B,EACH,IAAK,GAAItqC,KAAQ6F,MAEQ,MAAnB7F,EAAKwqC,OAAO,IACZ7D,EAAO/mC,KAAKiG,KAAM7F,KACjBgpC,OAAOhpC,EAAKyC,MAAM,MACrBoD,KAAK7F,GAAQgC,IAMrByoC,KAAM,WACJ5kC,KAAKssB,MAAO,CAEZ,IAAIuY,GAAY7kC,KAAK4iC,WAAW,GAC5BkC,EAAaD,EAAU/B,UAC3B,IAAwB,UAApBgC,EAAW7kC,KACb,KAAM6kC,GAAWxE,GAGnB,OAAOtgC,MAAK+kC,MAGdjD,kBAAmB,SAASkD,GAM1B,QAASvZ,GAAOwZ,EAAKC,GAYnB,MAXArE,GAAO5gC,KAAO,QACd4gC,EAAOP,IAAM0E,EACbvkC,EAAQgD,KAAOwhC,EAEXC,IAGFzkC,EAAQigC,OAAS,OACjBjgC,EAAQ6/B,IAAMnkC,KAGN+oC,EAjBZ,GAAIllC,KAAKssB,KACP,KAAM0Y,EAmBR,KAAK,GAhBDvkC,GAAUT,KAgBLnG,EAAImG,KAAK4iC,WAAW7mC,OAAS,EAAGlC,GAAK,IAAKA,EAAG,CACpD,GAAI0oC,GAAQviC,KAAK4iC,WAAW/oC,GACxBgnC,EAAS0B,EAAMO,UAEnB,IAAqB,SAAjBP,EAAMC,OAIR,MAAO/W,GAAO,MAGhB,IAAI8W,EAAMC,QAAUxiC,KAAK0kC,KAAM,CAC7B,GAAIS,GAAWrE,EAAO/mC,KAAKwoC,EAAO,YAC9B6C,EAAatE,EAAO/mC,KAAKwoC,EAAO,aAEpC,IAAI4C,GAAYC,EAAY,CAC1B,GAAIplC,KAAK0kC,KAAOnC,EAAME,SACpB,MAAOhX,GAAO8W,EAAME,UAAU,EACzB,IAAIziC,KAAK0kC,KAAOnC,EAAMG,WAC3B,MAAOjX,GAAO8W,EAAMG,gBAGjB,IAAIyC,GACT,GAAInlC,KAAK0kC,KAAOnC,EAAME,SACpB,MAAOhX,GAAO8W,EAAME,UAAU,OAG3B,KAAI2C,EAMT,KAAM,IAAIz6B,OAAM,yCALhB,IAAI3K,KAAK0kC,KAAOnC,EAAMG,WACpB,MAAOjX,GAAO8W,EAAMG,gBAU9BX,OAAQ,SAAS9hC,EAAMqgC,GACrB,IAAK,GAAIzmC,GAAImG,KAAK4iC,WAAW7mC,OAAS,EAAGlC,GAAK,IAAKA,EAAG,CACpD,GAAI0oC,GAAQviC,KAAK4iC,WAAW/oC,EAC5B,IAAI0oC,EAAMC,QAAUxiC,KAAK0kC,MACrB5D,EAAO/mC,KAAKwoC,EAAO,eACnBviC,KAAK0kC,KAAOnC,EAAMG,WAAY,CAChC,GAAI2C,GAAe9C,CACnB,QAIA8C,IACU,UAATplC,GACS,aAATA,IACDolC,EAAa7C,QAAUlC,GACvBA,GAAO+E,EAAa3C,aAGtB2C,EAAe,KAGjB,IAAIxE,GAASwE,EAAeA,EAAavC,aAIzC,OAHAjC,GAAO5gC,KAAOA,EACd4gC,EAAOP,IAAMA,EAET+E,GACFrlC,KAAK0gC,OAAS,OACd1gC,KAAKyD,KAAO4hC,EAAa3C,WAClBf,GAGF3hC,KAAKslC,SAASzE,IAGvByE,SAAU,SAASzE,EAAQ8B,GACzB,GAAoB,UAAhB9B,EAAO5gC,KACT,KAAM4gC,GAAOP,GAcf,OAXoB,UAAhBO,EAAO5gC,MACS,aAAhB4gC,EAAO5gC,KACTD,KAAKyD,KAAOo9B,EAAOP,IACM,WAAhBO,EAAO5gC,MAChBD,KAAK+kC,KAAO/kC,KAAKsgC,IAAMO,EAAOP,IAC9BtgC,KAAK0gC,OAAS,SACd1gC,KAAKyD,KAAO,OACa,WAAhBo9B,EAAO5gC,MAAqB0iC,IACrC3iC,KAAKyD,KAAOk/B,GAGPhB,GAGT4D,OAAQ,SAAS7C,GACf,IAAK,GAAI7oC,GAAImG,KAAK4iC,WAAW7mC,OAAS,EAAGlC,GAAK,IAAKA,EAAG,CACpD,GAAI0oC,GAAQviC,KAAK4iC,WAAW/oC,EAC5B,IAAI0oC,EAAMG,aAAeA,EAGvB,MAFA1iC,MAAKslC,SAAS/C,EAAMO,WAAYP,EAAMI,UACtCE,EAAcN,GACPZ,IAKb6D,MAAS,SAAShD,GAChB,IAAK,GAAI3oC,GAAImG,KAAK4iC,WAAW7mC,OAAS,EAAGlC,GAAK,IAAKA,EAAG,CACpD,GAAI0oC,GAAQviC,KAAK4iC,WAAW/oC,EAC5B,IAAI0oC,EAAMC,SAAWA,EAAQ,CAC3B,GAAI3B,GAAS0B,EAAMO,UACnB,IAAoB,UAAhBjC,EAAO5gC,KAAkB,CAC3B,GAAIwlC,GAAS5E,EAAOP,GACpBuC,GAAcN,GAEhB,MAAOkD,IAMX,KAAM,IAAI96B,OAAM,0BAGlB+6B,cAAe,SAAS1C,EAAUb,EAAYC,GAa5C,MAZApiC,MAAKwhC,UACHp6B,SAAU2lB,EAAOiW,GACjBb,WAAYA,EACZC,QAASA,GAGS,SAAhBpiC,KAAK0gC,SAGP1gC,KAAKsgC,IAAMnkC,GAGNwlC,KAOV,WAAa,MAAO3hC,UAAaimB,SAAS,oB3CqyMhBlsB,KAAKJ,EAASH,EAAoB,IAAII,KAI7D,SAAUA,EAAQD,EAASH,GAEjC,Y4CngOAI,GAAOD,QAAU,SAASC,GAoBzB,MAnBIA,GAAO+rC,kBACV/rC,EAAOgsC,UAAY,aACnBhsC,EAAOisC,SAEHjsC,EAAOgC,WAAUhC,EAAOgC,aAC5BtB,OAAOC,eAAeX,EAAQ,UAC7Ba,YAAY,EACZC,IAAK,WACJ,MAAOd,GAAOE,KAGhBQ,OAAOC,eAAeX,EAAQ,MAC7Ba,YAAY,EACZC,IAAK,WACJ,MAAOd,GAAOC,KAGhBD,EAAO+rC,gBAAkB,GAEnB/rC,I5C2gOF,SAAUA,EAAQD,EAASH,GAEjC,Y6ChiOK+P,OAAMxO,UAAU+qC,UACnBxrC,OAAOC,eAAegP,MAAMxO,UAAW,YACrCK,MAAO,SAAS2qC,EAAeC,GAE7B,GAAY,MAARhmC,KACF,KAAM,IAAImrB,WAAU,gCAItB,IAAI9wB,GAAIC,OAAO0F,MAGX6C,EAAMxI,EAAE0B,SAAW,CAGvB,IAAY,IAAR8G,EACF,OAAO,CAmBT,KAdA,GAAIlI,GAAgB,EAAZqrC,EAOJl5B,EAAId,KAAK8G,IAAInY,GAAK,EAAIA,EAAIkI,EAAMmJ,KAAK4B,IAAIjT,GAAI,GAO1CmS,EAAIjK,GAAK,CAGd,GARF,SAAuBojC,EAAGC,GACxB,MAAOD,KAAMC,GAAmB,gBAAND,IAA+B,gBAANC,IAAkB/C,MAAM8C,IAAM9C,MAAM+C,IAOrE7rC,EAAEyS,GAAIi5B,GACtB,OAAO,CAGTj5B,KAIF,OAAO,M7C2iOP,SAAUlT,EAAQD,EAASH,GAEjC,Y8C1lOK+P,OAAMxO,UAAUihB,MACnB1hB,OAAOC,eAAegP,MAAMxO,UAAW,QACrCK,MAAO,SAAS+qC,GAEd,GAAY,MAARnmC,KACF,KAAM,IAAImrB,WAAU,gCAGtB,IAAI9wB,GAAIC,OAAO0F,MAGX6C,EAAMxI,EAAE0B,SAAW,CAGvB,IAAyB,kBAAdoqC,GACT,KAAM,IAAIhb,WAAU,+BAUtB,KANA,GAAID,GAAUpvB,UAAU,GAGpBgR,EAAI,EAGDA,EAAIjK,GAAK,CAKd,GAAIujC,GAAS/rC,EAAEyS,EACf,IAAIq5B,EAAUpsC,KAAKmxB,EAASkb,EAAQt5B,EAAGzS,GACrC,MAAO+rC,EAGTt5B,U9C0mOF,SAAUlT,EAAQD,EAASH,GAEjC,Y+ChoOA,SAAS6sC,GAAQ79B,EAAI89B,GACnBtmC,KAAKumC,IAAM/9B,EACXxI,KAAKwmC,SAAWF,EAnBlB,GAAI78B,GAAQwc,SAASlrB,UAAU0O,KAI/B9P,GAAQ8N,WAAa,WACnB,MAAO,IAAI4+B,GAAQ58B,EAAM1P,KAAK0N,WAAYqD,OAAQhP,WAAY6xB,eAEhEh0B,EAAQ8sC,YAAc,WACpB,MAAO,IAAIJ,GAAQ58B,EAAM1P,KAAK0sC,YAAa37B,OAAQhP,WAAY4qC,gBAEjE/sC,EAAQg0B,aACRh0B,EAAQ+sC,cAAgB,SAAS72B,GAC3BA,GACFA,EAAQ82B,SAQZN,EAAQtrC,UAAU6rC,MAAQP,EAAQtrC,UAAUuI,IAAM,aAClD+iC,EAAQtrC,UAAU4rC,MAAQ,WACxB3mC,KAAKwmC,SAASzsC,KAAK+Q,OAAQ9K,KAAKumC,MAIlC5sC,EAAQktC,OAAS,SAASC,EAAMC,GAC9BpZ,aAAamZ,EAAKE,gBAClBF,EAAKG,aAAeF,GAGtBptC,EAAQutC,SAAW,SAASJ,GAC1BnZ,aAAamZ,EAAKE,gBAClBF,EAAKG,cAAgB,GAGvBttC,EAAQwtC,aAAextC,EAAQytC,OAAS,SAASN,GAC/CnZ,aAAamZ,EAAKE,eAElB,IAAID,GAAQD,EAAKG,YACbF,IAAS,IACXD,EAAKE,eAAiBv/B,WAAW,WAC3Bq/B,EAAKO,YACPP,EAAKO,cACNN,KAKPvtC,EAAQ,IACRG,EAAQoxB,aAAeA,aACvBpxB,EAAQ2tC,eAAiBA,gB/CspOnB,SAAU1tC,EAAQD,EAASH,GAEjC,cAC4B,SAASkmC,EAAQtR,IgD7sO5C,SAAUsR,EAAQvjC,GAaf,QAAS4uB,GAAapjB,GAEI,kBAAbA,KACTA,EAAW,GAAIse,UAAS,GAAKte,GAI/B,KAAK,GADDglB,GAAO,GAAIpjB,OAAMzN,UAAUC,OAAS,GAC/BlC,EAAI,EAAGA,EAAI8yB,EAAK5wB,OAAQlC,IAC7B8yB,EAAK9yB,GAAKiC,UAAUjC,EAAI,EAG5B,IAAI0tC,IAAS5/B,SAAUA,EAAUglB,KAAMA,EAGvC,OAFA6a,GAAcC,GAAcF,EAC5BG,EAAkBD,GACXA,IAGT,QAASH,GAAe7b,SACb+b,GAAc/b,GAGzB,QAASyC,GAAIqZ,GACT,GAAI5/B,GAAW4/B,EAAK5/B,SAChBglB,EAAO4a,EAAK5a,IAChB,QAAQA,EAAK5wB,QACb,IAAK,GACD4L,GACA,MACJ,KAAK,GACDA,EAASglB,EAAK,GACd,MACJ,KAAK,GACDhlB,EAASglB,EAAK,GAAIA,EAAK,GACvB,MACJ,KAAK,GACDhlB,EAASglB,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAChC,MACJ,SACIhlB,EAAS8B,MAAMtN,EAAWwwB,IAKlC,QAASgb,GAAalc,GAGlB,GAAImc,EAGAngC,WAAWkgC,EAAc,EAAGlc,OACzB,CACH,GAAI8b,GAAOC,EAAc/b,EACzB,IAAI8b,EAAM,CACNK,GAAwB,CACxB,KACI1Z,EAAIqZ,GADR,QAGID,EAAe7b,GACfmc,GAAwB,KApExC,IAAIlI,EAAO3U,aAAX,CAIA,GAII2c,GAJAD,EAAa,EACbD,KACAI,GAAwB,EACxBthB,EAAMoZ,EAAOxhC,SAoJb2pC,EAAWvtC,OAAOu2B,gBAAkBv2B,OAAOu2B,eAAe6O,EAC9DmI,GAAWA,GAAYA,EAASpgC,WAAaogC,EAAWnI,EAGf,wBAAlCpxB,SAASvU,KAAK2lC,EAAOtR,SArF5B,WACIsZ,EAAoB,SAASjc,GACzB2C,EAAQC,SAAS,WAAcsZ,EAAalc,SAIpD,WAGI,GAAIiU,EAAOoI,cAAgBpI,EAAOqI,cAAe,CAC7C,GAAIC,IAA4B,EAC5BC,EAAevI,EAAOwI,SAM1B,OALAxI,GAAOwI,UAAY,WACfF,GAA4B,GAEhCtI,EAAOoI,YAAY,GAAI,KACvBpI,EAAOwI,UAAYD,EACZD,MAIf,WAKI,GAAIG,GAAgB,gBAAkBn8B,KAAK8e,SAAW,IAClDsd,EAAkB,SAASloC,GACvBA,EAAMmoC,SAAW3I,GACK,gBAAfx/B,GAAMmL,MACyB,IAAtCnL,EAAMmL,KAAKJ,QAAQk9B,IACnBR,GAAcznC,EAAMmL,KAAKzO,MAAMurC,EAAcpsC,SAIjD2jC,GAAOtgC,iBACPsgC,EAAOtgC,iBAAiB,UAAWgpC,GAAiB,GAEpD1I,EAAOxzB,YAAY,YAAak8B,GAGpCV,EAAoB,SAASjc,GACzBiU,EAAOoI,YAAYK,EAAgB1c,EAAQ,SAmDxCiU,EAAO4I,eA/ClB,WACI,GAAIC,GAAU,GAAID,eAClBC,GAAQC,MAAMN,UAAY,SAAShoC,GAE/BynC,EADaznC,EAAMmL,OAIvBq8B,EAAoB,SAASjc,GACzB8c,EAAQE,MAAMX,YAAYrc,OA2CvBnF,GAAO,sBAAwBA,GAAIloB,cAAc,UAvC5D,WACI,GAAIsqC,GAAOpiB,EAAIE,eACfkhB,GAAoB,SAASjc,GAGzB,GAAIkd,GAASriB,EAAIloB,cAAc,SAC/BuqC,GAAOC,mBAAqB,WACxBjB,EAAalc,GACbkd,EAAOC,mBAAqB,KAC5BF,EAAKnqC,YAAYoqC,GACjBA,EAAS,MAEbD,EAAKxnC,YAAYynC,OAIzB,WACIjB,EAAoB,SAASjc,GACzBhkB,WAAWkgC,EAAc,EAAGlc,OA8BpCoc,EAAS9c,aAAeA,EACxB8c,EAASP,eAAiBA,IACZ,mBAAT5b,UAAyC,KAAXgU,MAAPvjC,GAAuCujC,EAAShU,QhD4sOnD3xB,KAAKJ,EAASH,EAAoB,IAAKA,EAAoB,MAIlF,SAAUI,EAAQD,GiDx4OxBC,EAAAD,SAAkBo3B,OAAA,qBAAA8X,sBAAA,kCAAAC,+BAAA,2CAAAC,oCAAA,gDAAAC,uBAAA,qCjD+4OZ,SAAUpvC,EAAQD,EAASH,GAEjC,YkDp4OO,SAASyvC,GAAavsC,EAAc+D,GAA4B,GAC7DyoC,GAAcxsC,EAAdwsC,SAER,QACE,EAAA/kB,EAAA7oB,GAAA,OAAKwE,WAAW,EAAAwkB,EAAApU,KAAIi5B,EAAArhC,QAAOshC,aAAa,EAAA7kB,EAAAlR,kBAAiB5S,EAAQ6S,QAAS+1B,KAAK,SAC7E,EAAAllB,EAAA7oB,GAAA,OAAKwE,UAAWqpC,EAAArhC,QAAOwhC,qBACrB,EAAAnlB,EAAA7oB,GAAA,QAAMwE,UAAU,UAAhB,mBAA0CopC,IAC1C,EAAA/kB,EAAA7oB,GAAA,aAAO,EAAAiuC,EAAAC,cAAaN,GAApB,clDg4OR5uC,OAAOC,eAAeZ,EAAS,cAC7ByB,OAAO,IAETzB,EkD14OgBsvC,aAXhB,IAAA9kB,GAAA3qB,EAAA,GAEAiwC,EAAAjwC,EAAA,IlDy5OI2vC,EAQJ,SAAgC1sC,GAAO,MAAOA,IAAOA,EAAI7B,WAAa6B,GAAQqL,QAASrL,IAR5CgtC,GkDx5O3CF,EAAA/vC,EAAA,IACA+qB,EAAA/qB,EAAA,GACA8qB,EAAA9qB,EAAA,IlD87OM,SAAUI,EAAQD,GmDr8OxBC,EAAAD,SAAkByvC,YAAA,0BAAAM,4BAAA,wCAAAJ,mBAAA,mCnD48OZ,SAAU1vC,EAAQD,EAASH,GAEjC,YoD78OO,SAASgwC,GAAcG,GAC5B,IACE,MAAOA,GAAOC,eAAe,SAAS1qC,QAAQ,KAAM,KACpD,MAAOa,GACP,IACE,MAAO4pC,GAAOC,iBAAiB1qC,QAAQ,KAAM,KAC7C,MAAOa,GACP,MAAO4pC,KpDy8ObrvC,OAAOC,eAAeZ,EAAS,cAC7ByB,OAAO,IAETzB,EoDn9OgB6vC,gBpDk+OV,SAAU5vC,EAAQD,EAASH,GAEjC,YA4BA,SAASm2B,GAAgBC,EAAUC,GAAe,KAAMD,YAAoBC,IAAgB,KAAM,IAAI1E,WAAU,qCAEhH,QAAS2E,GAA2BpE,EAAM3xB,GAAQ,IAAK2xB,EAAQ,KAAM,IAAIqE,gBAAe,4DAAgE,QAAOh2B,GAAyB,gBAATA,IAAqC,kBAATA,GAA8B2xB,EAAP3xB,EAElO,QAASi2B,GAAUC,EAAUC,GAAc,GAA0B,kBAAfA,IAA4C,OAAfA,EAAuB,KAAM,IAAI/E,WAAU,iEAAoE+E,GAAeD,GAASl1B,UAAYT,OAAO0Z,OAAOkc,GAAcA,EAAWn1B,WAAa8I,aAAezI,MAAO60B,EAAUx1B,YAAY,EAAO01B,UAAU,EAAM31B,cAAc,KAAe01B,IAAY51B,OAAOuZ,eAAiBvZ,OAAOuZ,eAAeoc,EAAUC,GAAcD,EAASnc,UAAYoc,GqDh7Oje,QAAS2Z,GAAW7sC,EAAqB+P,GACvC,MAAa,SAATA,EACK/P,EAAM+P,KAAK,SAAChL,EAAeuK,GAAhB,MAAkCA,GAAEw9B,MAAQ/nC,EAAE+nC,QAC9C,QAAT/8B,EACF/P,EAAM+P,KAAK,SAAChL,EAAeuK,GAAhB,MAAkCvK,GAAE+nC,MAAQx9B,EAAEw9B,QAG3D9sC,ErD44OT1C,OAAOC,eAAeZ,EAAS,cAC7ByB,OAAO,IAETzB,EAAQowC,WAAS5tC,EAEjB,IAAIk0B,GAAe,WAAc,QAASvV,GAAiBwV,EAAQ5zB,GAAS,IAAK,GAAI7C,GAAI,EAAGA,EAAI6C,EAAMX,OAAQlC,IAAK,CAAE,GAAI02B,GAAa7zB,EAAM7C,EAAI02B,GAAW91B,WAAa81B,EAAW91B,aAAc,EAAO81B,EAAW/1B,cAAe,EAAU,SAAW+1B,KAAYA,EAAWJ,UAAW,GAAM71B,OAAOC,eAAe+1B,EAAQC,EAAWl0B,IAAKk0B,IAAiB,MAAO,UAAUV,EAAaW,EAAYC,GAAiJ,MAA9HD,IAAY1V,EAAiB+U,EAAY90B,UAAWy1B,GAAiBC,GAAa3V,EAAiB+U,EAAaY,GAAqBZ,MqD3+OhiB1L,EAAA3qB,EAAA,GAEAwwC,EAAAxwC,EAAA,IrD++OIywC,EAYJ,SAAgCxtC,GAAO,MAAOA,IAAOA,EAAI7B,WAAa6B,GAAQqL,QAASrL,IAZjDutC,GqD7+OtCE,EAAA1wC,EAAA,IAGA23B,EAAA33B,EAAA,IACA83B,EAAA93B,EAAA,IACA4qB,EAAA5qB,EAAA,IACAk4B,EAAAl4B,EAAA,GrD4/OaG,GqDj/OAowC,OrDi/OiB,SAAUnZ,GAGtC,QAASmZ,KAGP,MAFApa,GAAgB3vB,KAAM+pC,GAEfja,EAA2B9vB,MAAO+pC,EAAOj2B,WAAaxZ,OAAOu2B,eAAekZ,IAAStgC,MAAMzJ,KAAMlE,YAgF1G,MArFAk0B,GAAU+Z,EAAQnZ,GAQlBP,EAAa0Z,IACX1tC,IAAK,yBACLjB,MAAO,WqD1/OP0P,OAAOC,SAASo/B,QAAO,MrD8/OvB9tC,IAAK,SACLjB,MAAO,WqD5/OC,GAAAgvC,GAQJpqC,KAAKtD,MANP+N,EAFM2/B,EAEN3/B,MACA8pB,EAHM6V,EAGN7V,OACAjG,EAJM8b,EAIN9b,MACA+b,EALMD,EAKNC,wBACAt9B,EANMq9B,EAMNr9B,KACAu9B,EAPMF,EAONE,UAGIC,EAAchW,GAAUA,EAAOuV,OAAU,CAC/C,IAAIr/B,IAAU8pB,EACZ,OACE,EAAApQ,EAAA7oB,GAAA61B,EAAAxmB,MAAA,MACE,EAAAwZ,EAAA7oB,GAAA,OAAKoD,OAAS8rC,aAAc,SAA5B,oEAGA,EAAArmB,EAAA7oB,GAAAo2B,EAAAD,aAAaT,QAAShxB,KAAKyqC,wBAA3B,gBAKN,KAAKlW,EACH,OACE,EAAApQ,EAAA7oB,GAAAg2B,EAAAD,OAAA,MACE,EAAAlN,EAAA7oB,GAAA8oB,EAAAF,aAAA,OACA,EAAAC,EAAA7oB,GAAA,2BAKN,IAAMovC,GAAW,WACf,MAAIpc,KAAyB,IAAfic,GAAoBA,IAE9B,EAAApmB,EAAA7oB,GAAA,OAAKwE,UAAWmqC,EAAAniC,QAAO6iC,mBACrB,EAAAxmB,EAAA7oB,GAAA,MAAIwE,UAAWmqC,EAAAniC,QAAO8iC,eAAgBtc,IAIrC,KAGT,QACE,EAAAnK,EAAA7oB,GAAA,OAAKwE,UAAWmqC,EAAAniC,QAAOysB,SACrB,EAAApQ,EAAA7oB,GAACovC,EAAD,OAEA,EAAAvmB,EAAA7oB,GAAA4uC,EAAAW,YACEP,UAAWA,EACXttC,MAAO6sC,EAAUtV,EAAOv3B,MAAO+P,GAC/Bw9B,WAAYhW,EAAOuV,OAASvV,EAAOgW,WACnCO,cAAeT,SrDghPhBN,GACP5lB,EAAQhgB,YAkBJ,SAAUvK,EAAQD,GsDjnPxBC,EAAAD,SAAkB46B,OAAA,qBAAAqW,cAAA,4BAAAD,iBAAA,+BAAAnmB,aAAA,2BAAAumB,kBAAA,kCtDwnPZ,SAAUnxC,EAAQD,EAASH,GAEjC,YA4BA,SAASm2B,GAAgBC,EAAUC,GAAe,KAAMD,YAAoBC,IAAgB,KAAM,IAAI1E,WAAU,qCAEhH,QAAS2E,GAA2BpE,EAAM3xB,GAAQ,IAAK2xB,EAAQ,KAAM,IAAIqE,gBAAe,4DAAgE,QAAOh2B,GAAyB,gBAATA,IAAqC,kBAATA,GAA8B2xB,EAAP3xB,EAElO,QAASi2B,GAAUC,EAAUC,GAAc,GAA0B,kBAAfA,IAA4C,OAAfA,EAAuB,KAAM,IAAI/E,WAAU,iEAAoE+E,GAAeD,GAASl1B,UAAYT,OAAO0Z,OAAOkc,GAAcA,EAAWn1B,WAAa8I,aAAezI,MAAO60B,EAAUx1B,YAAY,EAAO01B,UAAU,EAAM31B,cAAc,KAAe01B,IAAY51B,OAAOuZ,eAAiBvZ,OAAOuZ,eAAeoc,EAAUC,GAAcD,EAASnc,UAAYoc,GA7Bje51B,OAAOC,eAAeZ,EAAS,cAC7ByB,OAAO,IAETzB,EAAQkxC,eAAa1uC,EAErB,IAAIk0B,GAAe,WAAc,QAASvV,GAAiBwV,EAAQ5zB,GAAS,IAAK,GAAI7C,GAAI,EAAGA,EAAI6C,EAAMX,OAAQlC,IAAK,CAAE,GAAI02B,GAAa7zB,EAAM7C,EAAI02B,GAAW91B,WAAa81B,EAAW91B,aAAc,EAAO81B,EAAW/1B,cAAe,EAAU,SAAW+1B,KAAYA,EAAWJ,UAAW,GAAM71B,OAAOC,eAAe+1B,EAAQC,EAAWl0B,IAAKk0B,IAAiB,MAAO,UAAUV,EAAaW,EAAYC,GAAiJ,MAA9HD,IAAY1V,EAAiB+U,EAAY90B,UAAWy1B,GAAiBC,GAAa3V,EAAiB+U,EAAaY,GAAqBZ,MuDhoPhiB1L,EAAA3qB,EAAA,GAEA0wC,EAAA1wC,EAAA,IvDooPIwxC,EAYJ,SAAgCvuC,GAAO,MAAOA,IAAOA,EAAI7B,WAAa6B,GAAQqL,QAASrL,IAZ7CytC,GuDloP1C5lB,EAAA9qB,EAAA,GACA+qB,EAAA/qB,EAAA,GACAyxC,EAAAzxC,EAAA,IAEA0xC,EAAA1xC,EAAA,IACA2xC,EAAA3xC,EAAA,GvDkpPiBG,GuDpoPJkxC,WvDooPyB,SAAUja,GAG9C,QAASia,KACP,GAAIO,GAEAC,EAAOjU,EAAOkU,CAElB3b,GAAgB3vB,KAAM6qC,EAEtB,KAAK,GAAI16B,GAAOrU,UAAUC,OAAQ4wB,EAAOpjB,MAAM4G,GAAOE,EAAO,EAAGA,EAAOF,EAAME,IAC3Esc,EAAKtc,GAAQvU,UAAUuU,EAGzB,OAAeg7B,GAASjU,EAAQtH,EAA2B9vB,MAAOorC,EAAOP,EAAW/2B,WAAaxZ,OAAOu2B,eAAega,IAAa9wC,KAAK0P,MAAM2hC,GAAOprC,MAAMwK,OAAOmiB,KAAiByK,EuDjpPtL7yB,OACEgnC,YAAY,GvDkpPTnU,EuDhpPLoU,iBAAmB,WACjBpU,EAAK1vB,UAAW6jC,YAAanU,EAAK7yB,MAAMgnC,cvD6oPjCD,EAIJD,EAAQvb,EAA2BsH,EAAOkU,GA0C/C,MA3DAtb,GAAU6a,EAAYja,GAoBtBP,EAAawa,IACXxuC,IAAK,SACLjB,MAAO,WuDppPC,GAAAgvC,GACgDpqC,KAAKtD,MAArDM,EADAotC,EACAptC,MAAOutC,EADPH,EACOG,WAAYO,EADnBV,EACmBU,cAAeR,EADlCF,EACkCE,UAClCiB,EAAevrC,KAAKuE,MAApBgnC,WAFAE,EAG6BzrC,KAAKS,QAAlC6S,EAHAm4B,EAGAn4B,MAAO6I,EAHPsvB,EAGOtvB,kBACTuvB,GAAS,EAAAP,EAAAla,cAAaj0B,EAAO,SAAW,CAE9C,QAEE,EAAAmnB,EAAA7oB,GAAA,OACEwE,WAAW,EAAAwkB,EAAApU,KACT86B,EAAAljC,QAAO6jC,YACP,EAAApnB,EAAAlR,kBAAiBC,IACjB,EAAA23B,EAAA/uB,uBAAsBC,GACtBmuB,EAAY,YAAc,IAE5BtZ,QAAShxB,KAAKwrC,mBAEd,EAAArnB,EAAA7oB,GAAA4vC,EAAAU,kBAAkB5uC,MAAOA,EAAOutC,WAAYA,KAC5C,EAAApmB,EAAA7oB,GAAA4vC,EAAAW,SAAS7uC,MAAOA,EACdutC,WAAYA,EACZmB,OAAQA,EACRH,WAAYA,EACZT,cAAeA,KACjB,EAAA3mB,EAAA7oB,GAAA4vC,EAAAY,UAAU9uC,MAAOA,EACfutC,WAAYA,EACZmB,OAAQA,EACRH,WAAYA,EACZT,cAAeA,SvD8pPhBD,GACP1mB,EAAQhgB,YAIJ,SAAUvK,EAAQD,GwD9tPxBC,EAAAD,SAAkBgyC,WAAA,yBAAAI,qBAAA,iCAAAC,oBAAA,gCAAAC,0BAAA,sCAAAC,0BAAA,sCAAA/wB,WAAA,yBAAA8L,UAAA,wBAAAC,yBAAA,qCAAAJ,mCAAA,+CAAAC,wCAAA,oDAAAolB,wBAAA,sCxDquPZ,SAAUvyC,EAAQD,EAASH,GAEjC,YyD9mPA,SAAS4yC,GACPjxB,EACA2vB,GAEA,QAAKA,GAGE3vB,EAAW3S,KAAOsiC,EAG3B,QAASuB,GACPlxB,EACAmxB,GAEA,GAAMC,IAAyBD,GAAgB,GAAGE,QAAQ,GAAGttC,QAAQ,IAAK,IAC1E,qBACEic,EAAWsxB,KADb,aAEaF,EAFb,gBzDkmPFjyC,OAAOC,eAAeZ,EAAS,cAC7ByB,OAAO,IAETzB,EAAQ+yC,iBAAmB/yC,EAAQgzC,SAAWhzC,EAAQizC,QAAUjzC,EAAQmyC,SAAWnyC,EAAQkyC,QAAUlyC,EAAQiyC,qBAAmBzvC,EyD3uPhI,IAAAgoB,GAAA3qB,EAAA,GAEA0xC,EAAA1xC,EAAA,GzD+uPIqzC,EAUJ,SAAgCpwC,GAAO,MAAOA,IAAOA,EAAI7B,WAAa6B,GAAQqL,QAASrL,IAV7CyuC,GyD9uP1C4B,EAAAtzC,EAAA,IACAuzC,EAAAvzC,EAAA,IACAwzC,EAAAxzC,EAAA,IACAyzC,EAAAzzC,EAAA,IA+EaozC,GA9DAhB,mBAAmB,SAAClvC,GAAiC,GACxDM,GAAsBN,EAAtBM,MAAOutC,EAAe7tC,EAAf6tC,UAEf,QAAO,EAAApmB,EAAA7oB,GAAA,MAAI4xC,MAAOL,EAAA/kC,QAAA,gBACf9K,EAAMwT,IAAI,SAAA2K,GAAA,OACT,EAAAgJ,EAAA7oB,GAACoxC,GACCvxB,WAAYA,EACZmxB,cAAc,EAAAQ,EAAAK,iBAAgBhyB,EAAW2uB,MAAOS,SAc3CsB,UAAU,SAACnvC,GAAwB,GACtCM,GAAyDN,EAAzDM,MAAO0uC,EAAkDhvC,EAAlDgvC,OAAQH,EAA0C7uC,EAA1C6uC,WAAYhB,EAA8B7tC,EAA9B6tC,WAAYO,EAAkBpuC,EAAlBouC,aAC/C,QAAO,EAAA3mB,EAAA7oB,GAAA,OAAKu2B,eAAA,EAAYqb,MAAOL,EAAA/kC,QAAA,kBAC5B9K,EAAMwT,IAAI,SAAA2K,GAAA,OACT,EAAAgJ,EAAA7oB,GAACsxC,GACClB,OAAQA,EACRH,WAAYA,EACZe,cAAc,EAAAQ,EAAAK,iBAAgBhyB,EAAW2uB,MAAOS,GAChDpvB,WAAYA,EACZiyB,cAAehB,EAAgBjxB,EAAY2vB,SActCgB,WAAW,SAACpvC,GAAyB,GACxCM,GAAyDN,EAAzDM,MAAO0uC,EAAkDhvC,EAAlDgvC,OAAQH,EAA0C7uC,EAA1C6uC,WAAYhB,EAA8B7tC,EAA9B6tC,WAAYO,EAAkBpuC,EAAlBouC,aAE/C,QACE,EAAA3mB,EAAA7oB,GAAA,OAAKu2B,eAAA,EAAYqb,MAAOL,EAAA/kC,QAAA,kBACrB9K,EAAMwT,IAAI,SAAA2K,GAAA,OACT,EAAAgJ,EAAA7oB,GAACqxC,GACCjB,OAAQA,EACRH,WAAYA,EACZe,cAAc,EAAAQ,EAAAK,iBAAgBhyB,EAAW2uB,MAAOS,GAChDpvB,WAAYA,EACZiyB,cAAehB,EAAgBjxB,EAAY2vB,SAOxC8B,UAAU,SAAClwC,GAAiB,GAC/Bye,GAAoDze,EAApDye,WAAYmxB,EAAwC5vC,EAAxC4vC,aAAcc,EAA0B1wC,EAA1B0wC,cAAe1B,EAAWhvC,EAAXgvC,MACjD,QACE,EAAAvnB,EAAA7oB,GAAA,OAAKu2B,cAAY,OACf/xB,UAAW+sC,EAAA/kC,QAAA,WACXulC,qBAAoBlyB,EAAW3S,KAE/B,EAAA2b,EAAA7oB,GAAA,OAAKwE,UAAW+sC,EAAA/kC,QAAOsT,mBAAoBD,EAAWsxB,OACtD,EAAAtoB,EAAA7oB,GAAA,OAAKwE,UAAW+sC,EAAA/kC,QAAO,+BACrB,EAAAqc,EAAA7oB,GAAAyxC,EAAAO,KACExxB,MAAOwwB,EACPc,cAAeA,EACf1B,OAAQA,QAQLiB,aAAW,SAACjwC,GAAiB,GAChCye,GAAyCze,EAAzCye,WAAYmxB,EAA6B5vC,EAA7B4vC,aAAcf,EAAe7uC,EAAf6uC,UAClC,QAAO,EAAApnB,EAAA7oB,GAAA,OAAK4xC,MAAOL,EAAA/kC,QAAO,oCACxB,EAAAqc,EAAA7oB,GAAA2xC,EAAA3hC,QAAQiiC,QAAShC,EAAYnwC,MAAO+f,EAAW2uB,OAAS,KACxD,EAAA3lB,EAAA7oB,GAAA0xC,EAAAQ,SAASD,OAAQhC,EAAYe,aAAcA,MAIlCI,qBAAmB,SAAAtB,GAAwF,GAArFjwB,GAAqFiwB,EAArFjwB,WAAYmxB,EAAyElB,EAAzEkB,YAC7C,QAAO,EAAAnoB,EAAA7oB,GAAA,MAAIwE,UAAU,UAClBusC,EAAsBlxB,EAAYmxB,MzD6wPjC,SAAU1yC,EAAQD,EAASH,GAEjC,Y0Dn4PO,SAAS2zC,GAAiBrD,EAAeS,GAC9C,MAAmB,KAAfA,EACK,EAEDT,EAAQS,EAAc,I1Dk4PhCjwC,OAAOC,eAAeZ,EAAS,cAC7ByB,OAAO,IAETzB,E0Dz4PgBwzC,mB1Dm5PV,SAAUvzC,EAAQD,EAASH,GAEjC,YAsBA,SAASm2B,GAAgBC,EAAUC,GAAe,KAAMD,YAAoBC,IAAgB,KAAM,IAAI1E,WAAU,qCAEhH,QAAS2E,GAA2BpE,EAAM3xB,GAAQ,IAAK2xB,EAAQ,KAAM,IAAIqE,gBAAe,4DAAgE,QAAOh2B,GAAyB,gBAATA,IAAqC,kBAATA,GAA8B2xB,EAAP3xB,EAElO,QAASi2B,GAAUC,EAAUC,GAAc,GAA0B,kBAAfA,IAA4C,OAAfA,EAAuB,KAAM,IAAI/E,WAAU,iEAAoE+E,GAAeD,GAASl1B,UAAYT,OAAO0Z,OAAOkc,GAAcA,EAAWn1B,WAAa8I,aAAezI,MAAO60B,EAAUx1B,YAAY,EAAO01B,UAAU,EAAM31B,cAAc,KAAe01B,IAAY51B,OAAOuZ,eAAiBvZ,OAAOuZ,eAAeoc,EAAUC,GAAcD,EAASnc,UAAYoc,G2Dt3Pje,QAASud,GAAc3xB,GAAuDhgB,UAAAC,OAAA,OAAAI,KAAAL,UAAA,IAAAA,UAAA,EAExEggB,GAAQ,IAAGA,EAAQ,EACvB,IAAM4xB,mBAA2B,IAAM5xB,GAAjC,IACN,QACE6xB,gBAAiBD,EACjBE,aAAcF,EACdG,YAAaH,EACbI,WAAYJ,EACZA,YACAK,gBAAiB,Q3Dq1PrBzzC,OAAOC,eAAeZ,EAAS,cAC7ByB,OAAO,IAETzB,EAAQ2zC,QAAMnxC,EAEd,IAAIk0B,GAAe,WAAc,QAASvV,GAAiBwV,EAAQ5zB,GAAS,IAAK,GAAI7C,GAAI,EAAGA,EAAI6C,EAAMX,OAAQlC,IAAK,CAAE,GAAI02B,GAAa7zB,EAAM7C,EAAI02B,GAAW91B,WAAa81B,EAAW91B,aAAc,EAAO81B,EAAW/1B,cAAe,EAAU,SAAW+1B,KAAYA,EAAWJ,UAAW,GAAM71B,OAAOC,eAAe+1B,EAAQC,EAAWl0B,IAAKk0B,IAAiB,MAAO,UAAUV,EAAaW,EAAYC,GAAiJ,MAA9HD,IAAY1V,EAAiB+U,EAAY90B,UAAWy1B,GAAiBC,GAAa3V,EAAiB+U,EAAaY,GAAqBZ,M2D55PhiB1L,EAAA3qB,EAAA,GAEAuzC,EAAAvzC,EAAA,I3Dg6PIw0C,EAMJ,SAAgCvxC,GAAO,MAAOA,IAAOA,EAAI7B,WAAa6B,GAAQqL,QAASrL,IANpDswC,G2D/5PnCzoB,EAAA9qB,EAAA,GACA+qB,EAAA/qB,EAAA,E3D66PUG,G2Dj6PG2zC,I3Di6PW,SAAU1c,GAGhC,QAAS0c,KACP,GAAIlC,GAEAC,EAAOjU,EAAOkU,CAElB3b,GAAgB3vB,KAAMstC,EAEtB,KAAK,GAAIn9B,GAAOrU,UAAUC,OAAQ4wB,EAAOpjB,MAAM4G,GAAOE,EAAO,EAAGA,EAAOF,EAAME,IAC3Esc,EAAKtc,GAAQvU,UAAUuU,EAGzB,OAAeg7B,GAASjU,EAAQtH,EAA2B9vB,MAAOorC,EAAOkC,EAAIx5B,WAAaxZ,OAAOu2B,eAAeyc,IAAMvzC,KAAK0P,MAAM2hC,GAAOprC,MAAMwK,OAAOmiB,KAAiByK,E2D96PxK7yB,OACE0pC,WAAW,G3D66PJ3C,EAEJD,EAAQvb,EAA2BsH,EAAOkU,GA2C/C,MA1DAtb,GAAUsd,EAAK1c,GAkBfP,EAAaid,IACXjxC,IAAK,oBACLjB,MAAO,W2Dj7PY,GAAA8yC,GAAAluC,IACnByH,YAAW,WACT0mC,sBAAsB,WACpBD,EAAKxmC,UACHumC,WAAW,OAGd,O3Ds7PH5xC,IAAK,SACLjB,MAAO,W2Dp7PC,GAAAgvC,GACiCpqC,KAAKtD,MAAtCof,EADAsuB,EACAtuB,MAAOsxB,EADPhD,EACOgD,cAAe1B,EADtBtB,EACsBsB,OACtBuC,EAAcjuC,KAAKuE,MAAnB0pC,UAFAxC,EAGyBzrC,KAAKS,QAA9B6S,EAHAm4B,EAGAn4B,MAAO86B,EAHP3C,EAGO2C,cAITV,EACFD,EADcW,EACDH,EAAYnyB,EAAQ,EACpBA,EACjB,QACE,EAAAqI,EAAA7oB,GAAA,OAAKwE,WAAW,EAAAwkB,EAAApU,KAAI89B,EAAAlmC,QAAO8e,IAAK8kB,EAAS,OAAS,QAChD,EAAAvnB,EAAA7oB,GAAA,OACEwE,WAAW,EAAAwkB,EAAApU,KACT89B,EAAAlmC,QAAOmf,WACP,EAAA1C,EAAAlR,kBAAiBC,GACjB85B,EAAgB,cAAgB,IAElC1uC,MAAOgvC,S3D27PRJ,GACPnpB,EAAQhgB,YAoBJ,SAAUvK,EAAQD,EAASH,GAEjC,Y4D1/PO,SAASg0C,GAATpC,GAA2D,GAAvCkB,GAAuClB,EAAvCkB,aAAuC+B,EAAAjD,EAAzBmC,aAAyBpxC,KAAAkyC,KAE1DX,IAEN,QACE,EAAAvpB,EAAA7oB,GAAA,OAAKwE,WAAW,EAAAwkB,EAAApU,KAAI28B,EAAA/kC,QAAA,kBAA6BylC,EAAS,SAAW,IAAK7uC,MAAOgvC,IAC/E,EAAAvpB,EAAA7oB,GAAA,QAAMwE,UAAW+sC,EAAA/kC,QAAO,2BACrBwmC,EAAwBhC,KAMjC,QAASgC,GAAyBhC,GAChC,MAAUA,GAAaE,QAAQ,GAA/B,K5D++PFlyC,OAAOC,eAAeZ,EAAS,cAC7ByB,OAAO,IAETzB,E4DhgQgB6zC,SAThB,IAAArpB,GAAA3qB,EAAA,GACA0xC,EAAA1xC,EAAA,G5D8gQIqzC,EAIJ,SAAgCpwC,GAAO,MAAOA,IAAOA,EAAI7B,WAAa6B,GAAQqL,QAASrL,IAJ7CyuC,G4D7gQ1C5mB,EAAA9qB,EAAA,I5DgkQM,SAAUI,EAAQD,EAASH,GAEjC,Y6D3jQO,SAAS8R,GAAT8/B,GAAkD,GAA/BhwC,GAA+BgwC,EAA/BhwC,MAA+BizC,EAAAjD,EAAxBmC,aAAwBpxC,KAAAkyC,IACvD,QACE,EAAAlqB,EAAA7oB,GAAA,OAAKwE,WAAW,EAAAwkB,EAAApU,KAAI28B,EAAA/kC,QAAA,kBAA6BylC,EAAS,SAAW,MACnE,EAAAppB,EAAA7oB,GAAA,QAAMwE,UAAW+sC,EAAA/kC,QAAO,2BACrBymC,EAAkBnzC,K7D0jQ3Bd,OAAOC,eAAeZ,EAAS,cAC7ByB,OAAO,IAETzB,E6DjkQgB2R,QAThB,IAAA6Y,GAAA3qB,EAAA,GACA0xC,EAAA1xC,EAAA,G7D+kQIqzC,EAIJ,SAAgCpwC,GAAO,MAAOA,IAAOA,EAAI7B,WAAa6B,GAAQqL,QAASrL,IAJ7CyuC,G6D9kQ1C5mB,EAAA9qB,EAAA,GAiBM+0C,EAAoB,SAACnzC,GAAD,MAA2BA,GAAMwuC,mB7D0lQrD,SAAUhwC,EAAQD,G8D/mQxBC,EAAAD,SAAkB8Q,MAAA,sB9DsnQZ,SAAU7Q,EAAQD,G+DtnQxBC,EAAAD,SAAkB63B,OAAA,qBAAAgd,KAAA,qB/D6nQZ,SAAU50C,EAAQD,GgE7nQxBC,EAAAD,SAAkB6qB,aAAA,2BAAAiqB,4BAAA,wCAAAC,0CAAA,sDAAAC,qCAAA,iDAAAC,6BAAA,yCAAAC,QAAA,sBAAAC,gBAAA,4BAAAN,KAAA,mBAAAO,oBAAA,gCAAAC,SAAA,qBAAAC,SAAA,qBAAAC,SAAA,uBhEooQZ,SAAUt1C,EAAQD,GiEpoQxBC,EAAAD,SAAkBi4B,YAAA,0BAAAud,2BAAA,yCjE2oQZ,SAAUv1C,EAAQD,EAASH,GAEjC,YkE9oQAG,GAAQy1C,YAERz1C,EAAQyQ,IAAM,SAASjQ,EAAMiB,EAAOkB,GAElC,GAAImI,GAAOnI,MACP8yC,EAAWz1C,EAAQy1C,SAGnB7mB,EAAW9jB,EAAK8jB,SAAY6mB,EAAS7mB,QACrC8mB,EAAW5qC,EAAK4qC,QAAYD,EAASC,OACrCrgC,MAA6B7S,KAAlBsI,EAAKuK,KAAyBvK,EAAKuK,SAA8B7S,KAAlBizC,EAASpgC,KAAqBogC,EAASpgC,KAAO,IACxGmrB,MAA6Bh+B,KAAlBsI,EAAK01B,OAAyB11B,EAAK01B,OAAWiV,EAASjV,OAClEmV,MAA6BnzC,KAAlBsI,EAAK6qC,SAAyB7qC,EAAK6qC,SAAWF,EAASE,SAIlEC,EAAUhnB,EAAU,GAAIpI,MAEL,gBAAZoI,IAAuB,GAAIpI,OAAOC,UAAuB,MAAVmI,EAEtDA,GACA,EAGJrqB,UAASypB,OAASxtB,EAAK+E,QAAQ,cAAeqS,oBAC7CrS,QAAQ,IAAK,OACbA,QAAQ,IAAK,OACd,IAAM9D,EAAM8D,QAAQ,sBAAsBqS,qBACzCg+B,GAAWA,EAAQnvB,WAAa,EAAI,YAAcmvB,EAAQC,cAAgB,KAC1EH,EAAW,WAAaA,EAAS,KACjCrgC,EAAW,SAAaA,EAAS,KACjCmrB,EAAW,UAAsB,KACjCmV,EAAW,YAAsB,KAGpC31C,EAAQe,IAAM,SAASP,GAIrB,IAAI,GAHAs1C,GAAUvxC,SAASypB,OAAO7W,MAAM,KAG5BjX,EAAI,EAAGA,EAAI41C,EAAQ1zC,OAAQlC,IAAK,CACtC,GAAI8tB,GAAS8nB,EAAQ51C,GACjB61C,EAAe/nB,EAAO5rB,OAGtB4zC,EAAiBhoB,EAAO1c,QAAQ,IAGpC0kC,GAAiBA,EAAiB,EAAID,EAAeC,CAKrD,IAHkBC,mBAAmBjoB,EAAOxoB,UAAU,EAAGwwC,GAAgBzwC,QAAQ,OAAQ,OAGrE/E,EAClB,MAAOy1C,oBAAmBjoB,EAAOxoB,UAAUwwC,EAAiB,EAAGD,IAKnE,MAAO,OAGT/1C,EAAQk2C,MAAQ,SAAS11C,EAAMmC,GAC7B3C,EAAQyQ,IAAIjQ,EAAM,IAChBouB,SAAW,EACX8mB,OAAU/yC,GAAWA,EAAQ+yC,OAC7BrgC,KAAU1S,GAAWA,EAAQ0S,KAC7BmrB,OAAU,EACVmV,SAAU,KAId31C,EAAQ+yB,IAAM,WAKZ,IAAI,GAJAA,MACA+iB,EAAUvxC,SAASypB,OAAO7W,MAAM,KAG5BjX,EAAI,EAAGA,EAAI41C,EAAQ1zC,OAAQlC,IAAK,CACvC,GAAI8tB,GAAS8nB,EAAQ51C,GAChB61C,EAAe/nB,EAAO5rB,OAGvB4zC,EAAiBhoB,EAAO1c,QAAQ,IAGpC0kC,GAAiBA,EAAiB,EAAID,EAAeC,CAIrDjjB,GADkBkjB,mBAAmBjoB,EAAOxoB,UAAU,EAAGwwC,GAAgBzwC,QAAQ,OAAQ,MACtE0wC,mBAAmBjoB,EAAOxoB,UAAUwwC,EAAiB,EAAGD,IAG5E,MAAOhjB,KlEkpQH,SAAU9yB,EAAQD,EAASH,GAEjC,YAGAc,QAAOC,eAAeZ,EAAS,cAC7ByB,OAAO,IAETzB,EAAQm2C,aAAW3zC,EmEnvQnB,IAAAgoB,GAAA3qB,EAAA,GACA4qB,EAAA5qB,EAAA,IAEAu2C,EAAAv2C,EAAA,InEwvQIw2C,EAMJ,SAAgCvzC,GAAO,MAAOA,IAAOA,EAAI7B,WAAa6B,GAAQqL,QAASrL,IAN/CszC,GmEvvQxCzrB,EAAA9qB,EAAA,GACA+qB,EAAA/qB,EAAA,EAEas2C,YAAW,SAACpzC,EAAY+D,GACnC,OACE,EAAA0jB,EAAA7oB,GAAA,OAAKwE,WAAW,EAAAwkB,EAAApU,KAAI8/B,EAAAloC,QAAOmoC,UAAU,EAAA1rB,EAAAlR,kBAAiB5S,EAAQ6S,QAASue,eAAA,IACrE,EAAA1N,EAAA7oB,GAAA8oB,EAAAF,aAAA,OACA,EAAAC,EAAA7oB,GAAA,6BnEuwQA,SAAU1B,EAAQD,GoEnxQxBC,EAAAD,SAAkBs2C,SAAA,uBAAAzrB,aAAA,2BAAA0rB,wBAAA,sCpE0xQZ,SAAUt2C,EAAQD,EAASH,GAEjC,YqE7wQAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,IAItDzB,EAAQw2C,WAIJC,aAAa,EAIbC,YAAY,EAIZC,YAAa,sBrEsyQX,SAAU12C,EAAQD,EAASH,GAEjC,YsExzQA,IAAIma,GAAyC,WACzC,GAAIC,GAAgBtZ,OAAOuZ,iBACpBC,uBAA2BvK,QAAS,SAAUrP,EAAGoS,GAAKpS,EAAE4Z,UAAYxH,IACvE,SAAUpS,EAAGoS,GAAK,IAAK,GAAIrR,KAAKqR,GAAOA,EAAEtR,eAAeC,KAAIf,EAAEe,GAAKqR,EAAErR,IACzE,OAAO,UAAUf,EAAGoS,GAEhB,QAASyH,KAAO/T,KAAK6D,YAAc3J,EADnC0Z,EAAc1Z,EAAGoS,GAEjBpS,EAAEa,UAAkB,OAANuR,EAAahS,OAAO0Z,OAAO1H,IAAMyH,EAAGhZ,UAAYuR,EAAEvR,UAAW,GAAIgZ,OAGvFzZ,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAIm1C,GAAiB/2C,EAAQ,IACzBg3C,EAAsBh3C,EAAQ,KAC9BuO,EAASvO,EAAQ,GACjBi3C,EAAej3C,EAAQ,KACvBk3C,EAAUl3C,EAAQ,IAClBm3C,EAASn3C,EAAQ,IACjBijB,EAASjjB,EAAQ,GACjBo3C,EAAgBp3C,EAAQ,KACxBq3C,EAAer3C,EAAQ,IACvBwO,EAASxO,EAAQ,GACjByO,EAASzO,EAAQ,GACjBs3C,EAAct3C,EAAQ,IACtBu3C,EAA2B,SAAU18B,GAarC,QAAS08B,GAAUC,EAAMhiC,GAErB,KAAMgiC,YAAgBL,GAAO3Z,MACzB,KAAM,IAAIrsB,OAAM,4DAIpB,OADQ0J,GAAOta,KAAKiG,KAAMgxC,EAAMhiC,EAAM4hC,EAAcK,YAAYC,SAAS,IAAUlxC,KA6OvF,MA/PA2T,GAAUo9B,EAAW18B,GAsBrB08B,EAAUh2C,UAAUo2C,OAAS,WAEzB,MADAnpC,GAAOopC,iBAAiB,gBAAiB,EAAG,EAAGt1C,UAAUC,QACrDiE,KAAKgP,KAAK4C,UACH,KAEA5R,KAAKgP,KAAKoC,WAMzB2/B,EAAUh2C,UAAUW,MAAQ,SAAU2V,GAWlC,MAVArJ,GAAOopC,iBAAiB,kBAAmB,EAAG,EAAGt1C,UAAUC,QACjC,gBAAfsV,GACPA,EAAajV,OAAOiV,GAEbA,YAAsBoL,GAAO/L,OACP,OAAzB1Q,KAAKgP,KAAKiC,WACV4/B,EAAaxyB,uBAAuB,kBAAmB,EAAGhN,GAAY,GAEtEw/B,EAAazyB,mBAAmB,kBAAmB,EAAG/M,GAAY,IAEnE,GAAI0/B,GAAU/wC,KAAKgxC,KAAMhxC,KAAKgP,KAAKtT,MAAM2V,KAGpD0/B,EAAUh2C,UAAUs2C,UAAY,WAC5BrpC,EAAOopC,iBAAiB,mBAAoB,EAAG,EAAGt1C,UAAUC,OAC5D,IAAIu1C,GAAatxC,KAAKgP,KAAKrO,QAC3B,OAAsB,QAAf2wC,EAAsB,KAAO,GAAIP,GAAU/wC,KAAKgxC,KAAMM,IAGjEP,EAAUh2C,UAAUw2C,QAAU,WAC1BvpC,EAAOopC,iBAAiB,iBAAkB,EAAG,EAAGt1C,UAAUC,OAE1D,KADA,GAAIuH,GAAMtD,KACiB,OAApBsD,EAAI+tC,aACP/tC,EAAMA,EAAI+tC,WAEd,OAAO/tC,IAGXytC,EAAUh2C,UAAUy2C,aAAe,WAC/B,MAAOxxC,MAAKgxC,KAAKS,UAOrBV,EAAUh2C,UAAUqP,IAAM,SAAUsxB,EAAQnC,GACxCvxB,EAAOopC,iBAAiB,gBAAiB,EAAG,EAAGt1C,UAAUC,QACzD80C,EAAavyB,qBAAqB,gBAAiBte,KAAKgP,MACxD6hC,EAAa3zB,wBAAwB,gBAAiB,EAAGwe,EAAQ17B,KAAKgP,MAAM,GAC5EhH,EAAO0pC,iBAAiB,gBAAiB,EAAGnY,GAAY,EACxD,IAAI5N,GAAW,GAAI1jB,GAAO0pC,QAG1B,OAFA3xC,MAAKgxC,KAAKvV,gBAAgBz7B,KAAKgP,KAAM0sB,EACvB,KAAM/P,EAASimB,aAAarY,IACnC5N,EAASM,SAOpB8kB,EAAUh2C,UAAU+N,OAAS,SAAU+oC,EAAetY,GAGlD,GAFAvxB,EAAOopC,iBAAiB,mBAAoB,EAAG,EAAGt1C,UAAUC,QAC5D80C,EAAavyB,qBAAqB,mBAAoBte,KAAKgP,MACvDzF,MAAMC,QAAQqoC,GAAgB,CAE9B,IAAK,GADDC,MACKj4C,EAAI,EAAGA,EAAIg4C,EAAc91C,SAAUlC,EACxCi4C,EAAiB,GAAKj4C,GAAKg4C,EAAch4C,EAE7Cg4C,GAAgBC,EAChB/pC,EAAO6C,KAAK,wMAKhBimC,EAAa9yB,6BAA6B,mBAAoB,EAAG8zB,EAAe7xC,KAAKgP,MAAM,GAC3FhH,EAAO0pC,iBAAiB,mBAAoB,EAAGnY,GAAY,EAC3D,IAAI5N,GAAW,GAAI1jB,GAAO0pC,QAE1B,OADA3xC,MAAKgxC,KAAKloC,OAAO9I,KAAKgP,KAAM6iC,EAAelmB,EAASimB,aAAarY,IAC1D5N,EAASM,SAQpB8kB,EAAUh2C,UAAU0gC,gBAAkB,SAAUC,EAAQlkB,EAAa+hB,GAMjE,GALAvxB,EAAOopC,iBAAiB,4BAA6B,EAAG,EAAGt1C,UAAUC,QACrE80C,EAAavyB,qBAAqB,4BAA6Bte,KAAKgP,MACpE6hC,EAAa3zB,wBAAwB,4BAA6B,EAAGwe,EAAQ17B,KAAKgP,MAAM,GACxF6hC,EAAa7yB,iBAAiB,4BAA6B,EAAGxG,GAAa,GAC3ExP,EAAO0pC,iBAAiB,4BAA6B,EAAGnY,GAAY,GAC9C,YAAlBv5B,KAAKmxC,UAA4C,UAAlBnxC,KAAKmxC,SACpC,KAAM,qCACFnxC,KAAKmxC,SACL,yBACR,IAAIxlB,GAAW,GAAI1jB,GAAO0pC,QAE1B,OADA3xC,MAAKgxC,KAAKvV,gBAAgBz7B,KAAKgP,KAAM0sB,EAAQlkB,EAAamU,EAASimB,aAAarY,IACzE5N,EAASM,SAMpB8kB,EAAUh2C,UAAUsP,OAAS,SAAUkvB,GAInC,MAHAvxB,GAAOopC,iBAAiB,mBAAoB,EAAG,EAAGt1C,UAAUC,QAC5D80C,EAAavyB,qBAAqB,mBAAoBte,KAAKgP,MAC3DhH,EAAO0pC,iBAAiB,mBAAoB,EAAGnY,GAAY,GACpDv5B,KAAKoK,IAAI,KAAMmvB,IAQ1BwX,EAAUh2C,UAAUg3C,YAAc,SAAUC,EAAmBzY,EAAY0Y,GAQvE,GAPAjqC,EAAOopC,iBAAiB,wBAAyB,EAAG,EAAGt1C,UAAUC,QACjE80C,EAAavyB,qBAAqB,wBAAyBte,KAAKgP,MAChEhH,EAAO0pC,iBAAiB,wBAAyB,EAAGM,GAAmB,GACvEhqC,EAAO0pC,iBAAiB,wBAAyB,EAAGnY,GAAY,GAGhEsX,EAAa/xB,gBAAgB,wBAAyB,EAAGmzB,GAAc,GACjD,YAAlBjyC,KAAKmxC,UAA4C,UAAlBnxC,KAAKmxC,SACpC,KAAM,iCACFnxC,KAAKmxC,SACL,8BACah1C,KAAjB81C,IACAA,GAAe,EACnB,IAAItmB,GAAW,GAAI1jB,GAAO0pC,QACA,mBAAfpY,IACP5N,EAASM,QAAQuZ,MAAM,aAE3B,IAAI0M,GAAkB,SAAUznC,EAAO0nC,EAAWltB,GAC1Cxa,EACAkhB,EAASK,OAAOvhB,GAGhBkhB,EAASrkB,QAAQ,GAAIkpC,GAAoB4B,kBAAkBD,EAAWltB,IAEhD,kBAAfsU,IACPA,EAAW9uB,EAAO0nC,EAAWltB,GAIrC,OADAjlB,MAAKgxC,KAAKqB,iBAAiBryC,KAAKgP,KAAMgjC,EAAmBE,EAAiBD,GACnEtmB,EAASM,SAOpB8kB,EAAUh2C,UAAUu3C,YAAc,SAAUr1B,EAAUsc,GAClDvxB,EAAOopC,iBAAiB,wBAAyB,EAAG,EAAGt1C,UAAUC,QACjE80C,EAAavyB,qBAAqB,wBAAyBte,KAAKgP,MAChE6hC,EAAa7yB,iBAAiB,wBAAyB,EAAGf,GAAU,GACpEjV,EAAO0pC,iBAAiB,wBAAyB,EAAGnY,GAAY,EAChE,IAAI5N,GAAW,GAAI1jB,GAAO0pC,QAE1B,OADA3xC,MAAKgxC,KAAKvV,gBAAgBz7B,KAAKgP,KAAKtT,MAAM,aAAcuhB,EAAU,KAAM0O,EAASimB,aAAarY,IACvF5N,EAASM,SAOpB8kB,EAAUh2C,UAAUkB,KAAO,SAAUb,EAAOm+B,GACxCvxB,EAAOopC,iBAAiB,iBAAkB,EAAG,EAAGt1C,UAAUC,QAC1D80C,EAAavyB,qBAAqB,iBAAkBte,KAAKgP,MACzD6hC,EAAa3zB,wBAAwB,iBAAkB,EAAG9hB,EAAO4E,KAAKgP,MAAM,GAC5EhH,EAAO0pC,iBAAiB,iBAAkB,EAAGnY,GAAY,EACzD,IASItN,GATAsmB,EAAMvyC,KAAKgxC,KAAK5W,aAChBjgC,EAAOs2C,EAAa+B,WAAWD,GAM/BE,EAAmBzyC,KAAKtE,MAAMvB,GAC9Bu4C,EAAU1yC,KAAKtE,MAAMvB,EAazB,OAVI8xB,GADS,MAAT7wB,EACUq3C,EAAiBroC,IAAIhP,EAAOm+B,GAAYhyB,KAAK,WAAc,MAAOmrC,KAGlErrC,QAAQC,QAAQorC,GAE9BD,EAAiBlrC,KAAO0kB,EAAQ1kB,KAAKC,KAAKykB,GAC1CwmB,EAAiBjN,MAAQvZ,EAAQ1kB,KAAKC,KAAKykB,MAAS9vB,IAC1B,kBAAfo9B,IACPtN,EAAQuZ,MAAM,cAEXiN,GAKX1B,EAAUh2C,UAAU43C,aAAe,WAE/B,MADA9B,GAAavyB,qBAAqB,yBAA0Bte,KAAKgP,MAC1D,GAAIuhC,GAAeqC,aAAa5yC,KAAKgxC,KAAMhxC,KAAKgP,OAE3D1U,OAAOC,eAAew2C,EAAUh2C,UAAW,YACvCL,IAAK,WACD,MAAOsF,MAAKwxC,gBAEhB/2C,YAAY,EACZD,cAAc,IAElBF,OAAOC,eAAew2C,EAAUh2C,UAAW,OACvCL,IAAK,WACD,MAAOsF,MAAKmxC,UAEhB12C,YAAY,EACZD,cAAc,IAElBF,OAAOC,eAAew2C,EAAUh2C,UAAW,UACvCL,IAAK,WACD,MAAOsF,MAAKqxC,aAEhB52C,YAAY,EACZD,cAAc,IAElBF,OAAOC,eAAew2C,EAAUh2C,UAAW,QACvCL,IAAK,WACD,MAAOsF,MAAKuxC,WAEhB92C,YAAY,EACZD,cAAc,IAEXu2C,GACTL,EAAQmC,MACVl5C,GAAQo3C,UAAYA,EAOpBL,EAAQmC,MAAMC,uBAAyB/B,EACvCD,EAAYiC,UAAUD,uBAAyB/B,GtEq0QzC,SAAUn3C,EAAQD,EAASH,GAEjC,YuExmRAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAI2M,GAASvO,EAAQ,GACjBq3C,EAAer3C,EAAQ,IACvBijB,EAASjjB,EAAQ,GACjBqc,EAAkBrc,EAAQ,GAK1Bw5C,EAA8B,WAM9B,QAASA,GAAa7T,EAAO8T,EAAMC,GAC/BlzC,KAAKm/B,MAAQA,EACbn/B,KAAKizC,KAAOA,EACZjzC,KAAKkzC,OAASA,EAsIlB,MA9HAF,GAAaj4C,UAAUsS,IAAM,WAEzB,MADAtF,GAAOqpC,iBAAiB,mBAAoB,EAAG,EAAGt1C,UAAUC,QACrDiE,KAAKm/B,MAAM9xB,OAOtB2lC,EAAaj4C,UAAUo4C,UAAY,WAE/B,MADAprC,GAAOqpC,iBAAiB,yBAA0B,EAAG,EAAGt1C,UAAUC,QAC3DiE,KAAKm/B,MAAM9xB,KAAI,IAI1B2lC,EAAaj4C,UAAUq4C,OAAS,WAG5B,MADArrC,GAAOqpC,iBAAiB,sBAAuB,EAAG,EAAGt1C,UAAUC,QACxDiE,KAAKmzC,aAOhBH,EAAaj4C,UAAUs4C,OAAS,WAE5B,MADAtrC,GAAOqpC,iBAAiB,sBAAuB,EAAG,EAAGt1C,UAAUC,SACvDiE,KAAKm/B,MAAMvtB,WAQvBohC,EAAaj4C,UAAUW,MAAQ,SAAU43C,GACrCvrC,EAAOqpC,iBAAiB,qBAAsB,EAAG,EAAGt1C,UAAUC,QAE9Du3C,EAAkBl3C,OAAOk3C,GACzBzC,EAAazyB,mBAAmB,qBAAsB,EAAGk1B,GAAiB,EAC1E,IAAIC,GAAY,GAAI92B,GAAO/L,KAAK4iC,GAC5BE,EAAWxzC,KAAKizC,KAAKv3C,MAAM63C,EAC/B,OAAO,IAAIP,GAAahzC,KAAKm/B,MAAMnoB,SAASu8B,GAAYC,EAAU39B,EAAgBJ,iBAQtFu9B,EAAaj4C,UAAUmc,SAAW,SAAUo8B,GACxCvrC,EAAOqpC,iBAAiB,wBAAyB,EAAG,EAAGt1C,UAAUC,QACjE80C,EAAazyB,mBAAmB,wBAAyB,EAAGk1B,GAAiB,EAC7E,IAAIC,GAAY,GAAI92B,GAAO/L,KAAK4iC,EAChC,QAAQtzC,KAAKm/B,MAAMnoB,SAASu8B,GAAW3hC,WAO3CohC,EAAaj4C,UAAUyZ,YAAc,WAGjC,MAFAzM,GAAOqpC,iBAAiB,2BAA4B,EAAG,EAAGt1C,UAAUC,QAE7DiE,KAAKm/B,MAAM3qB,cAAcnH,OAUpC2lC,EAAaj4C,UAAUqS,QAAU,SAAUmM,GACvC,GAAI6d,GAAQp3B,IAGZ,OAFA+H,GAAOqpC,iBAAiB,uBAAwB,EAAG,EAAGt1C,UAAUC,QAChEgM,EAAO2pC,iBAAiB,uBAAwB,EAAGn4B,GAAQ,IACvDvZ,KAAKm/B,MAAMxoB,gBAEI3W,KAAKm/B,MAEF/mB,aAAapY,KAAKkzC,OAAQ,SAAU72C,EAAKkB,GAC3D,MAAOgc,GAAO,GAAIy5B,GAAaz1C,EAAM65B,EAAM6b,KAAKv3C,MAAMW,GAAMwZ,EAAgBJ,oBAOpFu9B,EAAaj4C,UAAU04C,YAAc,WAEjC,MADA1rC,GAAOqpC,iBAAiB,2BAA4B,EAAG,EAAGt1C,UAAUC,SAChEiE,KAAKm/B,MAAMxoB,eAGH3W,KAAKm/B,MAAMvtB,WAE3BtX,OAAOC,eAAey4C,EAAaj4C,UAAW,OAC1CL,IAAK,WACD,MAAOsF,MAAKizC,KAAK9B,UAErB12C,YAAY,EACZD,cAAc,IAMlBw4C,EAAaj4C,UAAU+c,YAAc,WAEjC,MADA/P,GAAOqpC,iBAAiB,2BAA4B,EAAG,EAAGt1C,UAAUC,QAC7DiE,KAAKm/B,MAAMrnB,eAKtBk7B,EAAaj4C,UAAU24C,OAAS,WAE5B,MADA3rC,GAAOqpC,iBAAiB,mBAAoB,EAAG,EAAGt1C,UAAUC,QACrDiE,KAAKizC,MAEhB34C,OAAOC,eAAey4C,EAAaj4C,UAAW,OAC1CL,IAAK,WACD,MAAOsF,MAAK0zC,UAEhBj5C,YAAY,EACZD,cAAc,IAEXw4C,IAEXr5C,GAAQq5C,aAAeA,GvE4nRjB,SAAUp5C,EAAQD,EAASH,GAEjC,YwExxRAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAIIu4C,GAJAh+B,EAAcnc,EAAQ,IACtBijB,EAASjjB,EAAQ,GACjBuO,EAASvO,EAAQ,GACjBwO,EAASxO,EAAQ,GAQjBo6C,EAAgB,WAIhB,MAHKD,KACDA,EAAyB,GAAIh+B,GAAYY,UAAUxO,EAAO2E,gBAEvDinC,GAKPE,EAA+B,WAM/B,QAASA,GAAcz4C,EAAOQ,OACT,KAAbA,IAAuBA,EAAWg4C,KACtC5zC,KAAK5E,MAAQA,EACb4E,KAAKpE,SAAWA,EAkTpB,MA3SAi4C,GAAcC,WAAa,SAAUr3C,GACjC,GAAIs3C,GAAOF,EAAc1W,KAIzB,OAHAn1B,GAAOoF,QAAQ3Q,EAAK,SAAU82C,EAAWS,GACrCD,EAAOA,EAAK3pC,IAAI,GAAIqS,GAAO/L,KAAK6iC,GAAYS,KAEzCD,GAMXF,EAAc94C,UAAU6W,QAAU,WAC9B,MAAsB,QAAf5R,KAAK5E,OAAkB4E,KAAKpE,SAASgW,WAchDiiC,EAAc94C,UAAUk5C,iCAAmC,SAAUpiC,EAAcs0B,GAC/E,GAAkB,MAAdnmC,KAAK5E,OAAiB+qC,EAAUnmC,KAAK5E,OACrC,OAAS4T,KAAMyN,EAAO/L,KAAKysB,MAAO/hC,MAAO4E,KAAK5E,MAG9C,IAAIyW,EAAaD,UACb,MAAO,KAGP,IAAIqF,GAAQpF,EAAaZ,WACrBvV,EAAQsE,KAAKpE,SAASlB,IAAIuc,EAC9B,IAAc,OAAVvb,EAAgB,CAChB,GAAIw4C,GAA4Bx4C,EAAMu4C,iCAAiCpiC,EAAaV,WAAYg1B,EAChG,IAAiC,MAA7B+N,EAAmC,CAEnC,OAASllC,KADM,GAAIyN,GAAO/L,KAAKuG,GAAOvb,MAAMw4C,EAA0BllC,MAC7C5T,MAAO84C,EAA0B94C,OAG1D,MAAO,MAIX,MAAO,OAWvBy4C,EAAc94C,UAAUo5C,yBAA2B,SAAUtiC,GACzD,MAAO7R,MAAKi0C,iCAAiCpiC,EAAc,WAAc,OAAO,KAMpFgiC,EAAc94C,UAAUq5C,QAAU,SAAUviC,GACxC,GAAIA,EAAaD,UACb,MAAO5R,KAGP,IAAIiX,GAAQpF,EAAaZ,WACrBojC,EAAYr0C,KAAKpE,SAASlB,IAAIuc,EAClC,OAAkB,QAAdo9B,EACOA,EAAUD,QAAQviC,EAAaV,YAG/B0iC,EAAc1W,OAWjC0W,EAAc94C,UAAUqP,IAAM,SAAUyH,EAAcyiC,GAClD,GAAIziC,EAAaD,UACb,MAAO,IAAIiiC,GAAcS,EAAOt0C,KAAKpE,SAGrC,IAAIqb,GAAQpF,EAAaZ,WACrBvV,EAAQsE,KAAKpE,SAASlB,IAAIuc,IAAU48B,EAAc1W,MAClDoX,EAAW74C,EAAM0O,IAAIyH,EAAaV,WAAYmjC,GAC9Ch9B,EAActX,KAAKpE,SAAS8b,OAAOT,EAAOs9B,EAC9C,OAAO,IAAIV,GAAc7zC,KAAK5E,MAAOkc,IAS7Cu8B,EAAc94C,UAAUsP,OAAS,SAAUwH,GACvC,GAAIA,EAAaD,UACb,MAAI5R,MAAKpE,SAASgW,UACPiiC,EAAc1W,MAGd,GAAI0W,GAAc,KAAM7zC,KAAKpE,SAIxC,IAAIqb,GAAQpF,EAAaZ,WACrBvV,EAAQsE,KAAKpE,SAASlB,IAAIuc,EAC9B,IAAIvb,EAAO,CACP,GAAI64C,GAAW74C,EAAM2O,OAAOwH,EAAaV,YACrCmG,MAAc,EAOlB,OALIA,GADAi9B,EAAS3iC,UACK5R,KAAKpE,SAASyO,OAAO4M,GAGrBjX,KAAKpE,SAAS8b,OAAOT,EAAOs9B,GAE3B,OAAfv0C,KAAK5E,OAAkBkc,EAAY1F,UAC5BiiC,EAAc1W,MAGd,GAAI0W,GAAc7zC,KAAK5E,MAAOkc,GAIzC,MAAOtX,OAUnB6zC,EAAc94C,UAAUL,IAAM,SAAUmX,GACpC,GAAIA,EAAaD,UACb,MAAO5R,MAAK5E,KAGZ,IAAI6b,GAAQpF,EAAaZ,WACrBvV,EAAQsE,KAAKpE,SAASlB,IAAIuc,EAC9B,OAAIvb,GACOA,EAAMhB,IAAImX,EAAaV,YAGvB,MAWnB0iC,EAAc94C,UAAUy5C,QAAU,SAAU3iC,EAAc4iC,GACtD,GAAI5iC,EAAaD,UACb,MAAO6iC,EAGP,IAAIx9B,GAAQpF,EAAaZ,WACrBvV,EAAQsE,KAAKpE,SAASlB,IAAIuc,IAAU48B,EAAc1W,MAClDoX,EAAW74C,EAAM84C,QAAQ3iC,EAAaV,WAAYsjC,GAClDn9B,MAAc,EAOlB,OALIA,GADAi9B,EAAS3iC,UACK5R,KAAKpE,SAASyO,OAAO4M,GAGrBjX,KAAKpE,SAAS8b,OAAOT,EAAOs9B,GAEvC,GAAIV,GAAc7zC,KAAK5E,MAAOkc,IAW7Cu8B,EAAc94C,UAAU25C,KAAO,SAAUhpC,GACrC,MAAO1L,MAAK20C,MAAMl4B,EAAO/L,KAAKysB,MAAOzxB,IAUzCmoC,EAAc94C,UAAU45C,MAAQ,SAAUC,EAAWlpC,GACjD,GAAImpC,KAIJ,OAHA70C,MAAKpE,SAAS4d,iBAAiB,SAAU4L,EAAUivB,GAC/CQ,EAAMzvB,GAAYivB,EAAUM,MAAMC,EAAUl5C,MAAM0pB,GAAW1Z,KAE1DA,EAAGkpC,EAAW50C,KAAK5E,MAAOy5C,IASrChB,EAAc94C,UAAU+5C,WAAa,SAAU9lC,EAAM1M,GACjD,MAAOtC,MAAK+0C,YAAY/lC,EAAMyN,EAAO/L,KAAKysB,MAAO76B,IAErDuxC,EAAc94C,UAAUg6C,YAAc,SAAUC,EAAcJ,EAAWtyC,GACrE,GAAIiyB,KAASv0B,KAAK5E,OAAQkH,EAAEsyC,EAAW50C,KAAK5E,MAC5C,IAAIm5B,EACA,MAAOA,EAGP,IAAIygB,EAAapjC,UACb,MAAO,KAGP,IAAIqF,GAAQ+9B,EAAa/jC,WACrBgkC,EAAYj1C,KAAKpE,SAASlB,IAAIuc,EAClC,OAAIg+B,GACOA,EAAUF,YAAYC,EAAa7jC,WAAYyjC,EAAUl5C,MAAMub,GAAQ3U,GAGvE,MAWvBuxC,EAAc94C,UAAUm6C,cAAgB,SAAUlmC,EAAM1M,GACpD,MAAOtC,MAAKm1C,eAAenmC,EAAMyN,EAAO/L,KAAKysB,MAAO76B,IAExDuxC,EAAc94C,UAAUo6C,eAAiB,SAAUH,EAAcI,EAAqB9yC,GAClF,GAAI0yC,EAAapjC,UACb,MAAO5R,KAGHA,MAAK5E,OACLkH,EAAE8yC,EAAqBp1C,KAAK5E,MAEhC,IAAI6b,GAAQ+9B,EAAa/jC,WACrBgkC,EAAYj1C,KAAKpE,SAASlB,IAAIuc,EAClC,OAAIg+B,GACOA,EAAUE,eAAeH,EAAa7jC,WAAYikC,EAAoB15C,MAAMub,GAAQ3U,GAGpFuxC,EAAc1W,OAWjC0W,EAAc94C,UAAUs6C,QAAU,SAAU/yC,GACxCtC,KAAKs1C,SAAS74B,EAAO/L,KAAKysB,MAAO76B,IAErCuxC,EAAc94C,UAAUu6C,SAAW,SAAUF,EAAqB9yC,GAC9DtC,KAAKpE,SAAS4d,iBAAiB,SAAUzC,EAAWs9B,GAChDA,EAAUiB,SAASF,EAAoB15C,MAAMqb,GAAYzU,KAEzDtC,KAAK5E,OACLkH,EAAE8yC,EAAqBp1C,KAAK5E,QAOpCy4C,EAAc94C,UAAUw6C,aAAe,SAAUjzC,GAC7CtC,KAAKpE,SAAS4d,iBAAiB,SAAUzC,EAAWs9B,GAC5CA,EAAUj5C,OACVkH,EAAEyU,EAAWs9B,EAAUj5C,UAInCy4C,EAAc1W,MAAQ,GAAI0W,GAAc,MACjCA,IAEXl6C,GAAQk6C,cAAgBA,GxE+xRlB,SAAUj6C,EAAQD,EAASH,GAEjC,YyEnnSAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAI2M,GAASvO,EAAQ,GACjBg8C,EAAWh8C,EAAQ,IACnB0vB,EAAiB1vB,EAAQ,GACzBqc,EAAkBrc,EAAQ,GAQ1Bi8C,EAA+B,WAC/B,QAASA,GAAcvC,GACnBlzC,KAAKkzC,OAASA,EAkGlB,MAhGAuC,GAAc16C,UAAU6c,YAAc,SAAUojB,EAAM3+B,EAAKk4C,EAAUtZ,EAAcoN,EAAQqN,GACvF3tC,EAAOiC,OAAOgxB,EAAKzgB,UAAUva,KAAKkzC,QAAS,oDAC3C,IAAIyC,GAAW3a,EAAKlkB,kBAAkBza,EAEtC,OAAIs5C,GAAS3+B,SAASikB,GAAc1oB,OAAOgiC,EAASv9B,SAASikB,KAIrD0a,EAAS/jC,WAAa2iC,EAAS3iC,UAIxBopB,GAGa,MAAxB0a,IACInB,EAAS3iC,UACLopB,EAAK9jB,SAAS7a,GACdq5C,EAAqBE,iBAAiBJ,EAAS5wB,OAAOU,mBAAmBjpB,EAAKs5C,IAG9E5tC,EAAOiC,OAAOgxB,EAAKrkB,aAAc,uEAGhCg/B,EAAS/jC,UACd8jC,EAAqBE,iBAAiBJ,EAAS5wB,OAAOO,iBAAiB9oB,EAAKk4C,IAG5EmB,EAAqBE,iBAAiBJ,EAAS5wB,OAAOY,mBAAmBnpB,EAAKk4C,EAAUoB,KAG5F3a,EAAKrkB,cAAgB49B,EAAS3iC,UACvBopB,EAIAA,EAAK7jB,qBAAqB9a,EAAKk4C,GAAUp6B,UAAUna,KAAKkzC,UAMvEuC,EAAc16C,UAAU86C,eAAiB,SAAU/wB,EAASgxB,EAASJ,GAuBjE,MAtB4B,OAAxBA,IACK5wB,EAAQnO,cACTmO,EAAQ1M,aAAavC,EAAgBJ,eAAgB,SAAUpZ,EAAKgc,GAC3Dy9B,EAAQ5+B,SAAS7a,IAClBq5C,EAAqBE,iBAAiBJ,EAAS5wB,OAAOU,mBAAmBjpB,EAAKgc,MAIrFy9B,EAAQn/B,cACTm/B,EAAQ19B,aAAavC,EAAgBJ,eAAgB,SAAUpZ,EAAKgc,GAChE,GAAIyM,EAAQ5N,SAAS7a,GAAM,CACvB,GAAIs5C,GAAW7wB,EAAQhO,kBAAkBza,EACpCs5C,GAASpjC,OAAO8F,IACjBq9B,EAAqBE,iBAAiBJ,EAAS5wB,OAAOY,mBAAmBnpB,EAAKgc,EAAWs9B,QAI7FD,GAAqBE,iBAAiBJ,EAAS5wB,OAAOO,iBAAiB9oB,EAAKgc,OAKrFy9B,EAAQ37B,UAAUna,KAAKkzC,SAKlCuC,EAAc16C,UAAU6b,eAAiB,SAAUkO,EAAStN,GACxD,MAAIsN,GAAQlT,UACDsX,EAAejT,aAAaP,WAG5BoP,EAAQlO,eAAeY,IAMtCi+B,EAAc16C,UAAUg7C,aAAe,WACnC,OAAO,GAKXN,EAAc16C,UAAUi7C,iBAAmB,WACvC,MAAOh2C,OAKXy1C,EAAc16C,UAAUk7C,SAAW,WAC/B,MAAOj2C,MAAKkzC,QAETuC,IAEX97C,GAAQ87C,cAAgBA,GzEqoSlB,SAAU77C,EAAQD,EAASH,GAEjC,Y0EzvSAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAI86C,GAAoB18C,EAAQ,KAC5By+B,EAA8B,WAC9B,QAASA,MAkBT,MAhBAA,GAAaC,cAAgB,SAAUzZ,GACnC,GAAI03B,GAAa13B,EAASnQ,UAI1B,OAHKtO,MAAKo2C,aAAaD,KACnBn2C,KAAKo2C,aAAaD,GAAc,GAAID,GAAkBG,iBAEnDr2C,KAAKo2C,aAAaD,IAE7Ble,EAAaY,oBAAsB,SAAUpa,EAAU63B,GACnD,GAAIH,GAAa13B,EAASnQ,UAI1B,OAHKtO,MAAKu2C,WAAWJ,KACjBn2C,KAAKu2C,WAAWJ,GAAcG,KAE3Bt2C,KAAKu2C,WAAWJ,IAE3Ble,EAAame,gBACbne,EAAase,cACNte,IAEXt+B,GAAQs+B,aAAeA,G1EgxSjB,SAAUr+B,EAAQD,EAASH,GAEjC,Y2EzySAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAI2M,GAASvO,EAAQ,GACjBm3C,EAASn3C,EAAQ,IACjBwO,EAASxO,EAAQ,GACjBg9C,EAAWh9C,EAAQ,IACnBq3C,EAAer3C,EAAQ,GAC3BA,GAAQ,IAER,IACIi9C,GAIAC,EAA6B,WAC7B,QAASA,KAIL12C,KAAK22C,UAKL32C,KAAK42C,gBAAiB,EAyF1B,MAvFAF,GAAYG,YAAc,WAItB,MAHKJ,KACDA,EAAkB,GAAIC,IAEnBD,GAGXC,EAAY37C,UAAUmjC,UAAY,WAC9B,IAAK,GAAI4Y,KAAW92C,MAAK22C,OACrB,IAAK,GAAII,KAAS/2C,MAAK22C,OAAOG,GAC1B92C,KAAK22C,OAAOG,GAASC,GAAO7Y,aAIxCwY,EAAY37C,UAAUojC,OAAS,WAC3B,IAAK,GAAI2Y,KAAW92C,MAAK22C,OACrB,IAAK,GAAII,KAAS/2C,MAAK22C,OAAOG,GAC1B92C,KAAK22C,OAAOG,GAASC,GAAO5Y,UAUxCuY,EAAY37C,UAAUi8C,gBAAkB,SAAU7f,EAAK8f,GACnD,GAAIF,GAAQE,GAAO9f,EAAI76B,QAAJ,gBACLH,KAAV46C,GACA/uC,EAAO0C,MAAM,sHAIjB,IAAI8T,GAAYg4B,EAASU,cAAcH,GACnCt4B,EAAWD,EAAUC,QAOzB,OANAoyB,GAAatyB,YAAY,gCAAiC,EAAGC,GACxDA,EAAUxP,KAAK4C,WAChB5J,EAAO0C,MAAM,4FAGN1K,KAAKm3C,WAAW14B,EAAU0Y,GACzBsa,UAOhBiF,EAAY37C,UAAUq8C,WAAa,SAAUpG,GACzC,GAAIqG,GAAWtvC,EAAOsX,QAAQrf,KAAK22C,OAAQ3F,EAAK7Z,IAAIh9B,KAE/Ck9C,IAAYtvC,EAAOsX,QAAQg4B,EAAUrG,EAAK/Z,UAAUqgB,iBAAmBtG,GACxEhpC,EAAO0C,MAAM,YAAcsmC,EAAK7Z,IAAIh9B,KAAO,IAAM62C,EAAK/Z,UAAY,+BAEtE+Z,EAAK9S,kBACEmZ,GAASrG,EAAK/Z,UAAUqgB,gBAUnCZ,EAAY37C,UAAUo8C,WAAa,SAAU14B,EAAU0Y,GACnD,GAAIkgB,GAAWtvC,EAAOsX,QAAQrf,KAAK22C,OAAQxf,EAAIh9B,KAC1Ck9C,KACDA,KACAr3C,KAAK22C,OAAOxf,EAAIh9B,MAAQk9C,EAE5B,IAAIrG,GAAOjpC,EAAOsX,QAAQg4B,EAAU54B,EAAS64B,cAM7C,OALItG,IACAhpC,EAAO0C,MAAM,2HAEjBsmC,EAAO,GAAIL,GAAO3Z,KAAKvY,EAAUze,KAAK42C,eAAgBzf,GACtDkgB,EAAS54B,EAAS64B,eAAiBtG,EAC5BA,GAMX0F,EAAY37C,UAAUm8B,gBAAkB,SAAUA,GAC9Cl3B,KAAK42C,eAAiB1f,GAEnBwf,IAEX/8C,GAAQ+8C,YAAcA,G3E8zShB,SAAU98C,EAAQD,EAASH,GAEjC,Y4E/7SO,SAAS+9C,M5Ek8ShBj9C,OAAOC,eAAeZ,EAAS,cAC7ByB,OAAO,IAETzB,E4Er8SgB49C,kB5E68SV,SAAU39C,EAAQD,EAASH,GAEjC,Y6E57SA,SAASg+C,GAAqBC,EAAeC,GAC3C,GAAIn3C,GAAOo3C,EAAyBF,EAAeC,GAAkB,GACrE,OAAOn3C,GAAO,EAAIyL,KAAKC,MAAM1L,GAAQyL,KAAK4rC,KAAKr3C,GAxBjD,GAAIo3C,GAA2Bn+C,EAAQ,IA2BvCI,GAAOD,QAAU69C,G7Ey9SX,SAAU59C,EAAQD,EAASH,GAEjC,Y8E9+SA,SAASq+C,GAA6BC,GACpC,GAAIC,KACJ,KAAK,GAAI17C,KAAOy7C,GACVA,EAAW98C,eAAeqB,IAC5B07C,EAAc97C,KAAKI,EAIvB,IAAI27C,GAAmBC,EACpBztC,OAAOutC,GACPhrC,OACAiB,SAKH,OAJ6B,IAAImB,QAC/B,2BAAkC6oC,EAAiB/pC,KAAK,KAAO,MAAO,KArB1E,GAAIgqC,IACF,IAAK,KAAM,IAAK,IAAK,KAAM,MAAO,OAAQ,IAC1C,IAAK,IAAK,KAAM,KAAM,OAAQ,KAAM,OACpC,IAAK,KAAM,IAAK,KAAM,IAAK,KAC3B,IAAK,KAAM,IAAK,KAAM,MACtB,IAAK,KAAM,IAAK,IAsBlBr+C,GAAOD,QAAUk+C,G9Ek/SX,SAAUj+C,EAAQD,EAASH,GAEjC,Y+E1gTO,SAAS0+C,GAAqBC,GACnC,MAAIC,KAIJA,EAAmBC,EAAAvwC,QAASwwC,cAATC,KACdJ,EAAWtvB,UACd2vB,UAAWL,EAAWK,c/EsgT1Bl+C,OAAOC,eAAeZ,EAAS,cAC7ByB,OAAO,GAGT,IAAIm9C,GAAWj+C,OAAOm+C,QAAU,SAAUnoB,GAAU,IAAK,GAAIz2B,GAAI,EAAGA,EAAIiC,UAAUC,OAAQlC,IAAK,CAAE,GAAIwuC,GAASvsC,UAAUjC,EAAI,KAAK,GAAIwC,KAAOgsC,GAAc/tC,OAAOS,UAAUC,eAAejB,KAAKsuC,EAAQhsC,KAAQi0B,EAAOj0B,GAAOgsC,EAAOhsC,IAAY,MAAOi0B,GAEvP32B,G+EnhTgBu+C,qBALhB,IAAAQ,GAAAl/C,EAAA,K/E4hTI6+C,EAMJ,SAAgC57C,GAAO,MAAOA,IAAOA,EAAI7B,WAAa6B,GAAQqL,QAASrL,IANpDi8C,E+E3hTnCl/C,GAAA,KACAA,EAAA,IAEA,IAAI4+C,W/E+iTE,SAAUx+C,EAAQD,EAASH,GAEjC,YgFriTAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAIu9C,GAAcn/C,EAAQ,GAM1BG,GAAQqQ,OAAS,SAAU4uC,EAAWtvC,GAClC,IAAKsvC,EACD,KAAMj/C,GAAQqvB,eAAe1f,IAQrC3P,EAAQqvB,eAAiB,SAAU1f,GAC/B,MAAO,IAAIqB,OAAM,sBACbguC,EAAYxI,UAAUG,YACtB,6BACAhnC,KhF2jTF,SAAU1P,EAAQD,EAASH,GAEjC,YiFllTAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAIwN,GAAoB,SAAUF,GAE9B,IAAK,GADDmwC,MAAa59C,EAAI,EACZpB,EAAI,EAAGA,EAAI6O,EAAI3M,OAAQlC,IAAK,CAEjC,IADA,GAAII,GAAIyO,EAAIowC,WAAWj/C,GAChBI,EAAI,KACP4+C,EAAO59C,KAAW,IAAJhB,EACdA,IAAM,CAEV4+C,GAAO59C,KAAOhB,EAElB,MAAO4+C,IAQPE,EAAoB,SAAUC,GAG9B,GAAIA,EAAMj9C,OAFO,KAGb,MAAOK,QAAO68C,aAAaxvC,MAAM,KAAMuvC,EAM3C,KAAK,GADDtwC,GAAM,GACD7O,EAAI,EAAGA,EAAIm/C,EAAMj9C,OAAQlC,GATjB,KASkC,CAC/C,GAAIq/C,GAAQF,EAAMp8C,MAAM/C,EAAGA,EAVd,KAWb6O,IAAOtM,OAAO68C,aAAaxvC,MAAM,KAAMyvC,GAE3C,MAAOxwC,GAGX/O,GAAQsP,QAMJkwC,eAAgB,KAMhBC,eAAgB,KAMhBC,sBAAuB,KAMvBC,sBAAuB,KAMvBC,kBAAmB,iEAKnBC,mBACI,MAAOx5C,MAAKu5C,kBAAoB,OAMpCE,2BACI,MAAOz5C,MAAKu5C,kBAAoB,OAUpCG,mBAAoC,kBAATC,MAU3BzwC,gBAAiB,SAAU0wC,EAAOC,GAC9B,IAAKtwC,MAAMC,QAAQowC,GACf,KAAMjvC,OAAM,gDAEhB3K,MAAK85C,OAKL,KAAK,GAJDC,GAAgBF,EACd75C,KAAKq5C,sBACLr5C,KAAKm5C,eACPN,KACKh/C,EAAI,EAAGA,EAAI+/C,EAAM79C,OAAQlC,GAAK,EAAG,CACtC,GAAImgD,GAAQJ,EAAM//C,GACdogD,EAAYpgD,EAAI,EAAI+/C,EAAM79C,OAC1Bm+C,EAAQD,EAAYL,EAAM//C,EAAI,GAAK,EACnCsgD,EAAYtgD,EAAI,EAAI+/C,EAAM79C,OAC1Bq+C,EAAQD,EAAYP,EAAM//C,EAAI,GAAK,EACnCwgD,EAAWL,GAAS,EACpBM,GAAqB,EAARN,IAAiB,EAAME,GAAS,EAC7CK,GAAqB,GAARL,IAAiB,EAAME,GAAS,EAC7CI,EAAmB,GAARJ,CACVD,KACDK,EAAW,GACNP,IACDM,EAAW,KAGnB1B,EAAO58C,KAAK89C,EAAcM,GAAWN,EAAcO,GAAWP,EAAcQ,GAAWR,EAAcS,IAEzG,MAAO3B,GAAO5qC,KAAK,KAUvBwsC,aAAc,SAAUb,EAAOC,GAG3B,MAAI75C,MAAK05C,qBAAuBG,EACrBa,KAAKd,GAET55C,KAAKkJ,gBAAgBN,EAAkBgxC,GAAQC,IAU1Dc,aAAc,SAAUf,EAAOC,GAG3B,MAAI75C,MAAK05C,qBAAuBG,EACrBF,KAAKC,GAETb,EAAkB/4C,KAAK46C,wBAAwBhB,EAAOC,KAiBjEe,wBAAyB,SAAUhB,EAAOC,GACtC75C,KAAK85C,OAKL,KAAK,GAJDe,GAAgBhB,EACd75C,KAAKs5C,sBACLt5C,KAAKo5C,eACPP,KACKh/C,EAAI,EAAGA,EAAI+/C,EAAM79C,QAAS,CAC/B,GAAIi+C,GAAQa,EAAcjB,EAAMjV,OAAO9qC,MACnCogD,EAAYpgD,EAAI+/C,EAAM79C,OACtBm+C,EAAQD,EAAYY,EAAcjB,EAAMjV,OAAO9qC,IAAM,IACvDA,CACF,IAAIsgD,GAAYtgD,EAAI+/C,EAAM79C,OACtBq+C,EAAQD,EAAYU,EAAcjB,EAAMjV,OAAO9qC,IAAM,KACvDA,CACF,IAAIihD,GAAYjhD,EAAI+/C,EAAM79C,OACtBg/C,EAAQD,EAAYD,EAAcjB,EAAMjV,OAAO9qC,IAAM,EAEzD,MADEA,EACW,MAATmgD,GAA0B,MAATE,GAA0B,MAATE,GAA0B,MAATW,EACnD,KAAMpwC,QAEV,IAAI0vC,GAAYL,GAAS,EAAME,GAAS,CAExC,IADArB,EAAO58C,KAAKo+C,GACC,IAATD,EAAa,CACb,GAAIE,GAAaJ,GAAS,EAAK,IAASE,GAAS,CAEjD,IADAvB,EAAO58C,KAAKq+C,GACC,IAATS,EAAa,CACb,GAAIR,GAAaH,GAAS,EAAK,IAAQW,CACvClC,GAAO58C,KAAKs+C,KAIxB,MAAO1B,IAOXiB,MAAO,WACH,IAAK95C,KAAKm5C,eAAgB,CACtBn5C,KAAKm5C,kBACLn5C,KAAKo5C,kBACLp5C,KAAKq5C,yBACLr5C,KAAKs5C,wBAEL,KAAK,GAAIz/C,GAAI,EAAGA,EAAImG,KAAKw5C,aAAaz9C,OAAQlC,IAC1CmG,KAAKm5C,eAAet/C,GAAKmG,KAAKw5C,aAAa7U,OAAO9qC,GAClDmG,KAAKo5C,eAAep5C,KAAKm5C,eAAet/C,IAAMA,EAC9CmG,KAAKq5C,sBAAsBx/C,GAAKmG,KAAKy5C,qBAAqB9U,OAAO9qC,GACjEmG,KAAKs5C,sBAAsBt5C,KAAKq5C,sBAAsBx/C,IAAMA,EAExDA,GAAKmG,KAAKu5C,kBAAkBx9C,SAC5BiE,KAAKo5C,eAAep5C,KAAKy5C,qBAAqB9U,OAAO9qC,IAAMA,EAC3DmG,KAAKs5C,sBAAsBt5C,KAAKw5C,aAAa7U,OAAO9qC,IAAMA,MAW9EF,EAAQqhD,aAAe,SAAUtyC,GAC7B,GAAIC,GAAYC,EAAkBF,EAClC,OAAO/O,GAAQsP,OAAOC,gBAAgBP,GAAW,IAWrDhP,EAAQshD,aAAe,SAAUvyC,GAC7B,IACI,MAAO/O,GAAQsP,OAAO0xC,aAAajyC,GAAK,GAE5C,MAAO3I,GACHkK,QAAQQ,MAAM,wBAAyB1K,GAE3C,MAAO,QjFumTL,SAAUnG,EAAQD,EAASH,GAEjC,YkFr2TA,SAAS0hD,GAASxyC,GACd,MAAOuf,MAAKlI,MAAMrX,GAQtB,QAASgB,GAAU2B,GACf,MAAO4c,MAAKve,UAAU2B,GAjB1B/Q,OAAOC,eAAeZ,EAAS,cAAgByB,OAAO,IAUtDzB,EAAQuhD,SAAWA,EASnBvhD,EAAQ+P,UAAYA,GlFo4Td,SAAU9P,EAAQD,EAASH,GAEjC,YAkBA,IAAIoF,GAA4B,kBAAXuI,SAAoD,gBAApBA,QAAOC,SAAwB,SAAU3K,GAAO,aAAcA,IAAS,SAAUA,GAAO,MAAOA,IAAyB,kBAAX0K,SAAyB1K,EAAIoH,cAAgBsD,QAAU1K,IAAQ0K,OAAOpM,UAAY,eAAkB0B,GmF36TtQnC,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,IAEtDzB,EAAQ8Y,SAAW,SAAUhW,EAAKJ,GAC9B,MAAO/B,QAAOS,UAAUC,eAAejB,KAAK0C,EAAKJ,IAErD1C,EAAQ0lB,QAAU,SAAU5iB,EAAKJ,GAC7B,GAAI/B,OAAOS,UAAUC,eAAejB,KAAK0C,EAAKJ,GAC1C,MAAOI,GAAIJ,IAUnB1C,EAAQyT,QAAU,SAAU3Q,EAAKiP,GAC7B,IAAK,GAAIrP,KAAOI,GACRnC,OAAOS,UAAUC,eAAejB,KAAK0C,EAAKJ,IAC1CqP,EAAGrP,EAAKI,EAAIJ,KAUxB1C,EAAQ6C,OAAS,SAAU2+C,EAAOC,GAI9B,MAHAzhD,GAAQyT,QAAQguC,EAAS,SAAU/+C,EAAKjB,GACpC+/C,EAAM9+C,GAAOjB,IAEV+/C,GAOXxhD,EAAQ0hD,MAAQ,SAAU5+C,GACtB,MAAO9C,GAAQ6C,UAAWC,IAS9B9C,EAAQ2hD,gBAAkB,SAAU7+C,GAChC,MAAsB,gBAAf,KAAOA,EAAP,YAAAmC,EAAOnC,KAA4B,OAARA,GAEtC9C,EAAQiY,QAAU,SAAUnV,GACxB,IAAK,GAAIJ,KAAOI,GACZ,OAAO,CAEX,QAAO,GAEX9C,EAAQ4hD,SAAW,SAAU9+C,GACzB,GAAI++C,GAAK,CACT,KAAK,GAAIn/C,KAAOI,GACZ++C,GAEJ,OAAOA,IAEX7hD,EAAQ6W,IAAM,SAAU/T,EAAK6F,EAAGm5C,GAC5B,GAAI7uB,KACJ,KAAK,GAAIvwB,KAAOI,GACZmwB,EAAIvwB,GAAOiG,EAAEvI,KAAK0hD,EAASh/C,EAAIJ,GAAMA,EAAKI,EAE9C,OAAOmwB,IAEXjzB,EAAQ+hD,QAAU,SAAUj/C,EAAKiP,EAAIiwC,GACjC,IAAK,GAAIt/C,KAAOI,GACZ,GAAIiP,EAAG3R,KAAK4hD,EAAUl/C,EAAIJ,GAAMA,EAAKI,GACjC,MAAOJ,IAKnB1C,EAAQiiD,UAAY,SAAUn/C,EAAKiP,EAAIiwC,GACnC,GAAIt/C,GAAM1C,EAAQ+hD,QAAQj/C,EAAKiP,EAAIiwC,EACnC,OAAOt/C,IAAOI,EAAIJ,IAEtB1C,EAAQkiD,UAAY,SAAUp/C,GAC1B,IAAK,GAAIJ,KAAOI,GACZ,MAAOJ,IAGf1C,EAAQmiD,UAAY,SAAUr/C,GAC1B,GAAImwB,MACA/yB,EAAI,CACR,KAAK,GAAIwC,KAAOI,GACZmwB,EAAI/yB,KAAO4C,EAAIJ,EAEnB,OAAOuwB,IAUXjzB,EAAQoiD,MAAQ,SAAUt/C,EAAKiP,GAC3B,IAAK,GAAIrP,KAAOI,GACZ,GAAInC,OAAOS,UAAUC,eAAejB,KAAK0C,EAAKJ,KACrCqP,EAAGrP,EAAKI,EAAIJ,IACb,OAAO,CAInB,QAAO,InFm7TL,SAAUzC,EAAQD,EAASH,GAEjC,YoFxiUAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAI2M,GAASvO,EAAQ,GACjBg9C,EAAWh9C,EAAQ,IACnBijB,EAASjjB,EAAQ,GACjBwiD,EAAcxiD,EAAQ,IACtBm3C,EAASn3C,EAAQ,IACjByiD,EAAgBziD,EAAQ,IACxBwO,EAASxO,EAAQ,GACjBq3C,EAAer3C,EAAQ,IAKvBylC,EAA0B,WAK1B,QAASA,GAASid,GACdl8C,KAAKk8C,MAAQA,EACPA,YAAiBvL,GAAO3Z,MAC1BjvB,EAAO2C,MAAM,wEAGjB1K,KAAKg2B,MAAQ,GAAIgmB,GAAYjL,UAAUmL,EAAOz/B,EAAO/L,KAAKysB,OAC1Dn9B,KAAKm8C,SAAW,GAAIC,GAAkBp8C,MAqE1C,MAnEA1F,QAAOC,eAAe0kC,EAASlkC,UAAW,OACtCL,IAAK,WACD,MAAOsF,MAAKk8C,MAAM/kB,KAEtB18B,YAAY,EACZD,cAAc,IAOlBykC,EAASlkC,UAAUuI,IAAM,SAAU+N,GAG/B,MAFArR,MAAKq8C,cAAc,OACnBr0C,EAAOopC,iBAAiB,eAAgB,EAAG,EAAGt1C,UAAUC,YAClCI,KAAfkV,EAA2BrR,KAAKg2B,MAAMt6B,MAAM2V,GAAcrR,KAAKg2B,OAS1EiJ,EAASlkC,UAAUuhD,WAAa,SAAUrF,GAEtC,GAAIsF,GAAU,qBACdv8C,MAAKq8C,cAAcE,GACnBv0C,EAAOopC,iBAAiBmL,EAAS,EAAG,EAAGzgD,UAAUC,OACjD,IAAIygD,GAAYhG,EAASU,cAAcD,EACvCpG,GAAatyB,YAAYg+B,EAAS,EAAGC,EACrC,IAAI/9B,GAAW+9B,EAAU/9B,QAUzB,OATIA,GAASC,OAAS1e,KAAKk8C,MAAMjlB,UAAUvY,MACvC3W,EAAO2C,MAAM6xC,EACT,2DAEA99B,EAASC,KACT,iBACA1e,KAAKk8C,MAAMjlB,UAAUvY,KACrB,KAED1e,KAAKsD,IAAIk5C,EAAUxtC,KAAKV,aAKnC2wB,EAASlkC,UAAUshD,cAAgB,SAAUE,GACtB,OAAfv8C,KAAKk8C,OACLn0C,EAAO2C,MAAM,eAAiB6xC,EAAU,4BAIhDtd,EAASlkC,UAAU0hD,UAAY,WAC3Bz0C,EAAOopC,iBAAiB,qBAAsB,EAAG,EAAGt1C,UAAUC,QAC9DiE,KAAKq8C,cAAc,aACnBr8C,KAAKk8C,MAAMhe,aAEfe,EAASlkC,UAAU2hD,SAAW,WAC1B10C,EAAOopC,iBAAiB,oBAAqB,EAAG,EAAGt1C,UAAUC,QAC7DiE,KAAKq8C,cAAc,YACnBr8C,KAAKk8C,MAAM/d,UAEfc,EAAS0d,aACLC,WACIC,MAAO,cAGR5d,IAEXtlC,GAAQslC,SAAWA,CACnB,IAAImd,GAAmC,WAEnC,QAASA,GAAkB3K,GACvBzxC,KAAKyxC,SAAWA,EAYpB,MATA2K,GAAkBrhD,UAAU+hD,OAAS,WAOjC,MANA98C,MAAKyxC,SAAS4K,cAAc,UAC5BJ,EAAcvF,YAAYG,cAAcO,WAAWp3C,KAAKyxC,SAASyK,OACjEl8C,KAAKyxC,SAASyK,MAAQ,KACtBl8C,KAAKyxC,SAASzb,MAAQ,KACtBh2B,KAAKyxC,SAAS0K,SAAW,KACzBn8C,KAAKyxC,SAAW,KACTpqC,QAAQC,WAEZ80C,IAEXziD,GAAQyiD,kBAAoBA,GpF0jUtB,SAAUxiD,EAAQD,EAASH,GAEjC,YqFtqUA,SAASujD,GAAW1rC,GAGhB,IAAK,GAFD2rC,GAAoB,GACpBvrC,EAASJ,EAAWP,MAAM,KACrBjX,EAAI,EAAGA,EAAI4X,EAAO1V,OAAQlC,IAC/B,GAAI4X,EAAO5X,GAAGkC,OAAS,EAAG,CACtB,GAAIkhD,GAAQxrC,EAAO5X,EACnB,KACIojD,EAAQrN,mBAAmBqN,EAAM/9C,QAAQ,MAAO,MAEpD,MAAOa,IACPi9C,GAAqB,IAAMC,EAGnC,MAAOD,GArBX1iD,OAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAIqhB,GAASjjB,EAAQ,GACjB0jD,EAAa1jD,EAAQ,IACrBuO,EAASvO,EAAQ,EAyBrBG,GAAQu9C,cAAgB,SAAUiG,GAC9B,GAAI3+B,GAAY7kB,EAAQyjD,SAASD,GAAUx+B,EAAYH,EAAU6+B,SACxC,cAArB7+B,EAAU6wB,QACVtnC,EAAO2C,MAAM8T,EAAUE,KACnB,8EAIHC,GAA0B,aAAbA,GACd5W,EAAO2C,MAAM,gFAEZ8T,EAAU2b,QACXpyB,EAAO8C,oBAEX,IAAIyyC,GAAqC,OAArB9+B,EAAU++B,QAAwC,QAArB/+B,EAAU++B,MAC3D,QACI9+B,SAAU,GAAIy+B,GAAWM,SAASh/B,EAAUE,KAAMF,EAAU2b,OAAQxb,EAAW2+B,GAC/EtuC,KAAM,GAAIyN,GAAO/L,KAAK8N,EAAUnN,cAQxC1X,EAAQyjD,SAAW,SAAUD,GAEzB,GAAIz+B,GAAO,GAAI2wB,EAAS,GAAIgO,EAAY,GAAIhsC,EAAa,GAErD8oB,GAAS,EAAMojB,EAAS,QAASE,EAAO,GAE5C,IAAuB,gBAAZN,GAAsB,CAE7B,GAAIO,GAAWP,EAAQlyC,QAAQ,KAC3ByyC,IAAY,IACZH,EAASJ,EAAQh+C,UAAU,EAAGu+C,EAAW,GACzCP,EAAUA,EAAQh+C,UAAUu+C,EAAW,GAG3C,IAAIC,GAAWR,EAAQlyC,QAAQ,MACb,IAAd0yC,IACAA,EAAWR,EAAQphD,QAEvB2iB,EAAOy+B,EAAQh+C,UAAU,EAAGw+C,GAC5BtsC,EAAa0rC,EAAWI,EAAQh+C,UAAUw+C,GAC1C,IAAIC,GAAQl/B,EAAK5N,MAAM,IACF,KAAjB8sC,EAAM7hD,QAENszC,EAASuO,EAAM,GACfP,EAAYO,EAAM,GAAG//C,eAEC,IAAjB+/C,EAAM7hD,SACXszC,EAASuO,EAAM,IAGnBF,EAAWh/B,EAAKzT,QAAQ,KACpByyC,GAAY,IACZvjB,EAAoB,UAAXojB,GAAiC,QAAXA,EAC/BE,EAAOrvC,SAASsQ,EAAKvf,UAAUu+C,EAAW,GAAI,KAGtD,OACIh/B,KAAMA,EACN++B,KAAMA,EACNpO,OAAQA,EACRgO,UAAWA,EACXljB,OAAQA,EACRojB,OAAQA,EACRlsC,WAAYA,KrF0sUd,SAAUzX,EAAQD,EAASH,GAEjC,YAkBA,IAAIoF,GAA4B,kBAAXuI,SAAoD,gBAApBA,QAAOC,SAAwB,SAAU3K,GAAO,aAAcA,IAAS,SAAUA,GAAO,MAAOA,IAAyB,kBAAX0K,SAAyB1K,EAAIoH,cAAgBsD,QAAU1K,IAAQ0K,OAAOpM,UAAY,eAAkB0B,GsF9zUtQnC,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAI2M,GAASvO,EAAQ,GACjBwO,EAASxO,EAAQ,GACjB6O,EAAY7O,EAAQ,IACpBqkD,EAAcrkD,EAAQ,IAMtBgkD,EAA0B,WAQ1B,QAASA,GAAS9+B,EAAMyb,EAAQxb,EAAW2+B,EAAeQ,OAC/B,KAAnBA,IAA6BA,EAAiB,IAClD99C,KAAKm6B,OAASA,EACdn6B,KAAK2e,UAAYA,EACjB3e,KAAKs9C,cAAgBA,EACrBt9C,KAAK89C,eAAiBA,EACtB99C,KAAK0e,KAAOA,EAAK7gB,cACjBmC,KAAKqvC,OAASrvC,KAAK0e,KAAKrQ,OAAOrO,KAAK0e,KAAKzT,QAAQ,KAAO,GACxDjL,KAAK+9C,aAAe11C,EAAUqqB,kBAAkBh4B,IAAI,QAAUgkB,IAAS1e,KAAK0e,KAgEhF,MA9DA8+B,GAASziD,UAAUijD,gBAAkB,WACjC,MAAOh+C,MAAK0e,OAAS1e,KAAK+9C,cAE9BP,EAASziD,UAAUkjD,gBAAkB,WACjC,MAA0C,OAAnCj+C,KAAK+9C,aAAa1vC,OAAO,EAAG,IAEvCmvC,EAASziD,UAAUmjD,WAAa,WAC5B,MAAuB,wBAAhBl+C,KAAKqvC,QAEhBmO,EAASziD,UAAUojD,aAAe,WAC9B,MAAwB,mBAAhBn+C,KAAKqvC,QAA+C,wBAAhBrvC,KAAKqvC,QAErDmO,EAASziD,UAAUqjD,WAAa,SAAUC,GAClCA,IAAYr+C,KAAK+9C,eACjB/9C,KAAK+9C,aAAeM,EAChBr+C,KAAKi+C,mBACL51C,EAAUqqB,kBAAkBtoB,IAAI,QAAUpK,KAAK0e,KAAM1e,KAAK+9C,gBAUtEP,EAASziD,UAAUujD,cAAgB,SAAUr+C,EAAMs+C,GAC/Cx2C,EAAOiC,OAAuB,gBAAT/J,GAAmB,8BACxC8H,EAAOiC,OAAyB,gBAAlB,KAAOu0C,EAAP,YAAA3/C,EAAO2/C,IAAqB,+BAC1C,IAAIC,EACJ,IAAIv+C,IAAS49C,EAAY3qB,UACrBsrB,GACKx+C,KAAKm6B,OAAS,SAAW,SAAWn6B,KAAK+9C,aAAe,YAE5D,IAAI99C,IAAS49C,EAAY1qB,aAK1B,KAAM,IAAIxoB,OAAM,4BAA8B1K,EAJ9Cu+C,IACKx+C,KAAKm6B,OAAS,WAAa,WAAan6B,KAAK+9C,aAAe,QAKjE/9C,KAAKg+C,oBACLO,EAAA,GAAev+C,KAAK2e,UAExB,IAAI8/B,KAIJ,OAHAz2C,GAAOoF,QAAQmxC,EAAQ,SAAUliD,EAAKjB,GAClCqjD,EAAMxiD,KAAKI,EAAM,IAAMjB,KAEpBojD,EAAUC,EAAMxwC,KAAK,MAGhCuvC,EAASziD,UAAUuT,SAAW,WAC1B,GAAI5F,GAAM1I,KAAKs3C,aAIf,OAHIt3C,MAAK89C,iBACLp1C,GAAO,IAAM1I,KAAK89C,eAAiB,KAEhCp1C,GAGX80C,EAASziD,UAAUu8C,YAAc,WAC7B,OAAQt3C,KAAKm6B,OAAS,WAAa,WAAan6B,KAAK0e,MAElD8+B,IAEX7jD,GAAQ6jD,SAAWA,GtFo0Ub,SAAU5jD,EAAQD,EAASH,GAEjC,YuFl6UAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAI2M,GAASvO,EAAQ,GACjBq3C,EAAer3C,EAAQ,IACvBwO,EAASxO,EAAQ,GACjByO,EAASzO,EAAQ,GAIjBo5C,EAA8B,WAK9B,QAASA,GAAasJ,EAAO1+B,GACzBxd,KAAKk8C,MAAQA,EACbl8C,KAAKwd,MAAQA,EA8EjB,MAxEAo1B,GAAa73C,UAAU2jD,OAAS,SAAUnlB,GACtCxxB,EAAOqpC,iBAAiB,sBAAuB,EAAG,EAAGt1C,UAAUC,QAC/DgM,EAAO2pC,iBAAiB,sBAAuB,EAAGnY,GAAY,EAC9D,IAAI5N,GAAW,GAAI1jB,GAAO0pC,QAE1B,OADA3xC,MAAKk8C,MAAM9e,mBAAmBp9B,KAAKwd,MAAOmO,EAASimB,aAAarY,IACzD5N,EAASM,SAMpB2mB,EAAa73C,UAAUsP,OAAS,SAAUkvB,GACtCxxB,EAAOqpC,iBAAiB,sBAAuB,EAAG,EAAGt1C,UAAUC,QAC/D80C,EAAavyB,qBAAqB,sBAAuBte,KAAKwd,OAC9DzV,EAAO2pC,iBAAiB,sBAAuB,EAAGnY,GAAY,EAC9D,IAAI5N,GAAW,GAAI1jB,GAAO0pC,QAE1B,OADA3xC,MAAKk8C,MAAM5e,gBAAgBt9B,KAAKwd,MAAO,KAAMmO,EAASimB,aAAarY,IAC5D5N,EAASM,SAOpB2mB,EAAa73C,UAAUqP,IAAM,SAAUhP,EAAOm+B,GAC1CxxB,EAAOqpC,iBAAiB,mBAAoB,EAAG,EAAGt1C,UAAUC,QAC5D80C,EAAavyB,qBAAqB,mBAAoBte,KAAKwd,OAC3DqzB,EAAa3zB,wBAAwB,mBAAoB,EAAG9hB,EAAO4E,KAAKwd,OAAO,GAC/EzV,EAAO2pC,iBAAiB,mBAAoB,EAAGnY,GAAY,EAC3D,IAAI5N,GAAW,GAAI1jB,GAAO0pC,QAE1B,OADA3xC,MAAKk8C,MAAM5e,gBAAgBt9B,KAAKwd,MAAOpiB,EAAOuwB,EAASimB,aAAarY,IAC7D5N,EAASM,SAQpB2mB,EAAa73C,UAAU0gC,gBAAkB,SAAUrgC,EAAO6hB,EAAUsc,GAChExxB,EAAOqpC,iBAAiB,+BAAgC,EAAG,EAAGt1C,UAAUC,QACxE80C,EAAavyB,qBAAqB,+BAAgCte,KAAKwd,OACvEqzB,EAAa3zB,wBAAwB,+BAAgC,EAAG9hB,EAAO4E,KAAKwd,OAAO,GAC3FqzB,EAAa7yB,iBAAiB,+BAAgC,EAAGf,GAAU,GAC3ElV,EAAO2pC,iBAAiB,+BAAgC,EAAGnY,GAAY,EACvE,IAAI5N,GAAW,GAAI1jB,GAAO0pC,QAE1B,OADA3xC,MAAKk8C,MAAMze,4BAA4Bz9B,KAAKwd,MAAOpiB,EAAO6hB,EAAU0O,EAASimB,aAAarY,IACnF5N,EAASM,SAOpB2mB,EAAa73C,UAAU+N,OAAS,SAAU+oC,EAAetY,GAGrD,GAFAxxB,EAAOqpC,iBAAiB,sBAAuB,EAAG,EAAGt1C,UAAUC,QAC/D80C,EAAavyB,qBAAqB,sBAAuBte,KAAKwd,OAC1DjU,MAAMC,QAAQqoC,GAAgB,CAE9B,IAAK,GADDC,MACKj4C,EAAI,EAAGA,EAAIg4C,EAAc91C,SAAUlC,EACxCi4C,EAAiB,GAAKj4C,GAAKg4C,EAAch4C,EAE7Cg4C,GAAgBC,EAChB9pC,EAAO4C,KAAK,gOAGhBimC,EAAa9yB,6BAA6B,sBAAuB,EAAG8zB,EAAe7xC,KAAKwd,OAAO,GAC/FzV,EAAO2pC,iBAAiB,sBAAuB,EAAGnY,GAAY,EAC9D,IAAI5N,GAAW,GAAI1jB,GAAO0pC,QAE1B,OADA3xC,MAAKk8C,MAAMxe,mBAAmB19B,KAAKwd,MAAOq0B,EAAelmB,EAASimB,aAAarY,IACxE5N,EAASM,SAEb2mB,IAEXj5C,GAAQi5C,aAAeA,GvFy7UjB,SAAUh5C,EAAQD,EAASH,GAEjC,YAkBA,IAAIoF,GAA4B,kBAAXuI,SAAoD,gBAApBA,QAAOC,SAAwB,SAAU3K,GAAO,aAAcA,IAAS,SAAUA,GAAO,MAAOA,IAAyB,kBAAX0K,SAAyB1K,EAAIoH,cAAgBsD,QAAU1K,IAAQ0K,OAAOpM,UAAY,eAAkB0B,GwF5iVtQnC,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAWI03C,GAXA/qC,EAASvO,EAAQ,GACjBsc,EAAatc,EAAQ,IACrBqc,EAAkBrc,EAAQ,GAC1BmlD,EAAenlD,EAAQ,IACvBolD,EAAcplD,EAAQ,IACtBwO,EAASxO,EAAQ,GACjBijB,EAASjjB,EAAQ,GACjBq3C,EAAer3C,EAAQ,IACvByO,EAASzO,EAAQ,GACjBqlD,EAAsBrlD,EAAQ,KAC9B0O,EAAS1O,EAAQ,GAQjBq5C,EAAuB,WACvB,QAASA,GAAM7B,EAAMhiC,EAAM8vC,EAAcC,GACrC/+C,KAAKgxC,KAAOA,EACZhxC,KAAKgP,KAAOA,EACZhP,KAAK8+C,aAAeA,EACpB9+C,KAAK++C,eAAiBA,EA6c1B,MA3cAzkD,QAAOC,eAAes4C,EAAO,0BACzBn4C,IAAK,WAED,MADAqN,GAAOiC,OAAO8oC,EAAwB,oCAC/BA,GAEX1oC,IAAK,SAAUiD,GACXylC,EAAyBzlC,GAE7B5S,YAAY,EACZD,cAAc,IAOlBq4C,EAAMmM,wBAA0B,SAAUT,GACtC,GAAIU,GAAY,KACZC,EAAU,IAOd,IANIX,EAAOY,aACPF,EAAYV,EAAOa,sBAEnBb,EAAOc,WACPH,EAAUX,EAAOe,oBAEjBf,EAAOtI,aAAengC,EAAWsE,UAAW,CAC5C,GAAImlC,GAAmB,mGAEnBC,EAAoB,uGAExB,IAAIjB,EAAOY,WAAY,CAEnB,GADgBZ,EAAOkB,qBACNz3C,EAAOmE,SACpB,KAAM,IAAIxB,OAAM40C,EAEf,IAAyB,gBAAdN,GACZ,KAAM,IAAIt0C,OAAM60C,GAGxB,GAAIjB,EAAOc,SAAU,CAEjB,GADcd,EAAOmB,mBACN13C,EAAOoE,SAClB,KAAM,IAAIzB,OAAM40C,EAEf,IAAuB,gBAAZL,GACZ,KAAM,IAAIv0C,OAAM60C,QAIvB,IAAIjB,EAAOtI,aAAepgC,EAAgBJ,gBAC3C,GAAkB,MAAbwpC,IAAsBpO,EAAa7zB,gBAAgBiiC,IACxC,MAAXC,IAAoBrO,EAAa7zB,gBAAgBkiC,GAClD,KAAM,IAAIv0C,OAAM,qKAOpB,IAFA5C,EAAOiC,OAAOu0C,EAAOtI,oBAAsB2I,GAAYe,WACnDpB,EAAOtI,aAAe0I,EAAaiB,YAAa,uBAClC,MAAbX,GAA0C,gBAArB,KAAOA,EAAP,YAAArgD,EAAOqgD,KACjB,MAAXC,GAAsC,gBAAnB,KAAOA,EAAP,YAAAtgD,EAAOsgD,IAC3B,KAAM,IAAIv0C,OAAM,0FAU5BkoC,EAAMgN,eAAiB,SAAUtB,GAC7B,GAAIA,EAAOY,YACPZ,EAAOc,UACPd,EAAOuB,aACNvB,EAAOwB,mBACR,KAAM,IAAIp1C,OAAM,uGAQxBkoC,EAAM93C,UAAUilD,+BAAiC,SAAU7iC,GACvD,IAA4B,IAAxBnd,KAAK++C,eACL,KAAM,IAAIp0C,OAAMwS,EAAS,gDAMjC01B,EAAM93C,UAAUklD,eAAiB,WAC7B,MAAOjgD,MAAK8+C,cAKhBjM,EAAM93C,UAAU24C,OAAS,WAKrB,MAJAzrC,GAAOmpC,iBAAiB,YAAa,EAAG,EAAGt1C,UAAUC,QAI9C,GAAI82C,GAAMC,uBAAuB9yC,KAAKgxC,KAAMhxC,KAAKgP,OAS5D6jC,EAAM93C,UAAU6zB,GAAK,SAAU1Q,EAAWvW,EAAUu4C,EAAyBz/C,GACzEwH,EAAOmpC,iBAAiB,WAAY,EAAG,EAAGt1C,UAAUC,QACpD80C,EAAa5yB,kBAAkB,WAAY,EAAGC,GAAW,GACzDjW,EAAOypC,iBAAiB,WAAY,EAAG/pC,GAAU,EACjD,IAAI3G,GAAM6xC,EAAMsN,yBAAyB,WAAYD,EAAyBz/C,EAC9E,IAAkB,UAAdyd,EACAle,KAAKogD,aAAaz4C,EAAU3G,EAAI09C,OAAQ19C,EAAIP,aAE3C,CACD,GAAI4/C,KACJA,GAAUniC,GAAavW,EACvB3H,KAAKsgD,aAAaD,EAAWr/C,EAAI09C,OAAQ19C,EAAIP,SAEjD,MAAOkH,IAQXkrC,EAAM93C,UAAUqlD,aAAe,SAAUz4C,EAAU44C,EAAgB9/C,GAC/D,GAAI+/C,GAAY,GAAI3B,GAAoB4B,uBAAuB94C,EAAU44C,GAAkB,KAAM9/C,GAAW,KAC5GT,MAAKgxC,KAAKpT,yBAAyB59B,KAAMwgD,IAQ7C3N,EAAM93C,UAAUulD,aAAe,SAAUD,EAAWE,EAAgB9/C,GAChE,GAAI+/C,GAAY,GAAI3B,GAAoB6B,uBAAuBL,EAAWE,EAAgB9/C,EAC1FT,MAAKgxC,KAAKpT,yBAAyB59B,KAAMwgD,IAO7C3N,EAAM93C,UAAUg0B,IAAM,SAAU7Q,EAAWvW,EAAUlH,GACjDwH,EAAOmpC,iBAAiB,YAAa,EAAG,EAAGt1C,UAAUC,QACrD80C,EAAa5yB,kBAAkB,YAAa,EAAGC,GAAW,GAC1DjW,EAAOypC,iBAAiB,YAAa,EAAG/pC,GAAU,GAClDM,EAAO04C,sBAAsB,YAAa,EAAGlgD,GAAS,EACtD,IAAI+/C,GAAY,KACZH,EAAY,IAChB,IAAkB,UAAdniC,EAAuB,CACvB,GAAI0iC,GAAgBj5C,GAAY,IAChC64C,GAAY,GAAI3B,GAAoB4B,uBAAuBG,EAAe,KAAMngD,GAAW,UAEtFyd,KACDvW,IACA04C,KACAA,EAAUniC,GAAavW,GAE3B64C,EAAY,GAAI3B,GAAoB6B,uBAAuBL,EAAW,KAAM5/C,GAAW,MAE3FT,MAAKgxC,KAAKhT,4BAA4Bh+B,KAAMwgD,IAUhD3N,EAAM93C,UAAU+zB,KAAO,SAAU5Q,EAAW2iC,EAAcC,EAAiBrgD,GACvE,GAAI22B,GAAQp3B,IACZiI,GAAOmpC,iBAAiB,aAAc,EAAG,EAAGt1C,UAAUC,QACtD80C,EAAa5yB,kBAAkB,aAAc,EAAGC,GAAW,GAC3DjW,EAAOypC,iBAAiB,aAAc,EAAGmP,GAAc,EACvD,IAAI7/C,GAAM6xC,EAAMsN,yBAAyB,aAAcW,EAAiBrgD,GAKpEsgD,GAAY,EACZp1B,EAAW,GAAIzjB,GAAOypC,QAE1BhmB,GAASM,QAAQuZ,MAAM,aACvB,IAAIwb,GAAe,QAAfA,GAAyB/7B,GAGrB87B,IACAA,GAAY,EACZ3pB,EAAMrI,IAAI7Q,EAAW8iC,GACjBH,GACAA,EAAar5C,KAAKxG,EAAIP,SAASwkB,GAEnC0G,EAASrkB,QAAQ2d,IAUzB,OAPAjlB,MAAK4uB,GAAG1Q,EAAW8iC,EACP,SAAUh0B,GAClBoK,EAAMrI,IAAI7Q,EAAW8iC,GACjBhgD,EAAI09C,QACJ19C,EAAI09C,OAAOl3C,KAAKxG,EAAIP,SAASusB,GACjCrB,EAASK,OAAOgB,KAEbrB,EAASM,SAOpB4mB,EAAM93C,UAAUkmD,aAAe,SAAUC,GAErC,GADAj5C,EAAOmpC,iBAAiB,qBAAsB,EAAG,EAAGt1C,UAAUC,QACzC,gBAAVmlD,IACPl1C,KAAKC,MAAMi1C,KAAWA,GACtBA,GAAS,EACT,KAAM,IAAIv2C,OAAM,iEAEpB,IAAI3K,KAAK8+C,aAAagB,WAClB,KAAM,IAAIn1C,OAAM,sGAGpB,OAAO,IAAIkoC,GAAM7yC,KAAKgxC,KAAMhxC,KAAKgP,KAAMhP,KAAK8+C,aAAamC,aAAaC,GAAQlhD,KAAK++C,iBAOvFlM,EAAM93C,UAAUomD,YAAc,SAAUD,GAEpC,GADAj5C,EAAOmpC,iBAAiB,oBAAqB,EAAG,EAAGt1C,UAAUC,QACxC,gBAAVmlD,IACPl1C,KAAKC,MAAMi1C,KAAWA,GACtBA,GAAS,EACT,KAAM,IAAIv2C,OAAM,gEAEpB,IAAI3K,KAAK8+C,aAAagB,WAClB,KAAM,IAAIn1C,OAAM,qGAGpB,OAAO,IAAIkoC,GAAM7yC,KAAKgxC,KAAMhxC,KAAKgP,KAAMhP,KAAK8+C,aAAaqC,YAAYD,GAAQlhD,KAAK++C,iBAOtFlM,EAAM93C,UAAUqmD,aAAe,SAAUpyC,GAErC,GADA/G,EAAOmpC,iBAAiB,qBAAsB,EAAG,EAAGt1C,UAAUC,QACjD,SAATiT,EACA,KAAM,IAAIrE,OAAM,0EAEf,IAAa,cAATqE,EACL,KAAM,IAAIrE,OAAM,oFAEf,IAAa,WAATqE,EACL,KAAM,IAAIrE,OAAM,8EAEpBkmC,GAAazyB,mBAAmB,qBAAsB,EAAGpP,GAAM,GAC/DhP,KAAKggD,+BAA+B,qBACpC,IAAIqB,GAAa,GAAI5kC,GAAO/L,KAAK1B,EACjC,IAAIqyC,EAAWzvC,UACX,KAAM,IAAIjH,OAAM,oFAEpB,IAAIiO,GAAQ,GAAIgmC,GAAYe,UAAU0B,GAClCC,EAAYthD,KAAK8+C,aAAayC,QAAQ3oC,EAE1C,OADAi6B,GAAMmM,wBAAwBsC,GACvB,GAAIzO,GAAM7yC,KAAKgxC,KAAMhxC,KAAKgP,KAAMsyC,GAA8B,IAMzEzO,EAAM93C,UAAUymD,WAAa,WACzBv5C,EAAOmpC,iBAAiB,mBAAoB,EAAG,EAAGt1C,UAAUC,QAC5DiE,KAAKggD,+BAA+B,mBACpC,IAAIsB,GAAYthD,KAAK8+C,aAAayC,QAAQzrC,EAAWsE,UAErD,OADAy4B,GAAMmM,wBAAwBsC,GACvB,GAAIzO,GAAM7yC,KAAKgxC,KAAMhxC,KAAKgP,KAAMsyC,GAA8B,IAMzEzO,EAAM93C,UAAU0mD,gBAAkB,WAC9Bx5C,EAAOmpC,iBAAiB,wBAAyB,EAAG,EAAGt1C,UAAUC,QACjEiE,KAAKggD,+BAA+B,wBACpC,IAAIsB,GAAYthD,KAAK8+C,aAAayC,QAAQ1rC,EAAgBJ,eAE1D,OADAo9B,GAAMmM,wBAAwBsC,GACvB,GAAIzO,GAAM7yC,KAAKgxC,KAAMhxC,KAAKgP,KAAMsyC,GAA8B,IAMzEzO,EAAM93C,UAAU2mD,aAAe,WAC3Bz5C,EAAOmpC,iBAAiB,qBAAsB,EAAG,EAAGt1C,UAAUC,QAC9DiE,KAAKggD,+BAA+B,qBACpC,IAAIsB,GAAYthD,KAAK8+C,aAAayC,QAAQ5C,EAAaiB,YAEvD,OADA/M,GAAMmM,wBAAwBsC,GACvB,GAAIzO,GAAM7yC,KAAKgxC,KAAMhxC,KAAKgP,KAAMsyC,GAA8B,IAOzEzO,EAAM93C,UAAU4mD,QAAU,SAAUvmD,EAAOjB,OACzB,KAAViB,IAAoBA,EAAQ,MAChC6M,EAAOmpC,iBAAiB,gBAAiB,EAAG,EAAGt1C,UAAUC,QACzD80C,EAAa3zB,wBAAwB,gBAAiB,EAAG9hB,EAAO4E,KAAKgP,MAAM,GAC3E6hC,EAAa1yB,YAAY,gBAAiB,EAAGhkB,GAAM,EACnD,IAAImnD,GAAYthD,KAAK8+C,aAAa6C,QAAQvmD,EAAOjB,EAGjD,IAFA04C,EAAMgN,eAAeyB,GACrBzO,EAAMmM,wBAAwBsC,GAC1BthD,KAAK8+C,aAAaK,WAClB,KAAM,IAAIx0C,OAAM,yFAQpB,YAJcxO,KAAVf,IACAA,EAAQ,KACRjB,EAAO,MAEJ,GAAI04C,GAAM7yC,KAAKgxC,KAAMhxC,KAAKgP,KAAMsyC,EAAWthD,KAAK++C,iBAO3DlM,EAAM93C,UAAU6mD,MAAQ,SAAUxmD,EAAOjB,OACvB,KAAViB,IAAoBA,EAAQ,MAChC6M,EAAOmpC,iBAAiB,cAAe,EAAG,EAAGt1C,UAAUC,QACvD80C,EAAa3zB,wBAAwB,cAAe,EAAG9hB,EAAO4E,KAAKgP,MAAM,GACzE6hC,EAAa1yB,YAAY,cAAe,EAAGhkB,GAAM,EACjD,IAAImnD,GAAYthD,KAAK8+C,aAAa8C,MAAMxmD,EAAOjB,EAG/C,IAFA04C,EAAMgN,eAAeyB,GACrBzO,EAAMmM,wBAAwBsC,GAC1BthD,KAAK8+C,aAAaO,SAClB,KAAM,IAAI10C,OAAM,mFAGpB,OAAO,IAAIkoC,GAAM7yC,KAAKgxC,KAAMhxC,KAAKgP,KAAMsyC,EAAWthD,KAAK++C,iBAS3DlM,EAAM93C,UAAU8mD,QAAU,SAAUzmD,EAAOjB,GAIvC,GAHA8N,EAAOmpC,iBAAiB,gBAAiB,EAAG,EAAGt1C,UAAUC,QACzD80C,EAAa3zB,wBAAwB,gBAAiB,EAAG9hB,EAAO4E,KAAKgP,MAAM,GAC3E6hC,EAAa1yB,YAAY,gBAAiB,EAAGhkB,GAAM,GAC/C6F,KAAK8+C,aAAaK,WAClB,KAAM,IAAIx0C,OAAM,yFAGpB,IAAI3K,KAAK8+C,aAAaO,SAClB,KAAM,IAAI10C,OAAM,qFAGpB,OAAO3K,MAAK2hD,QAAQvmD,EAAOjB,GAAMynD,MAAMxmD,EAAOjB,IAKlD04C,EAAM93C,UAAUuT,SAAW,WAEvB,MADArG,GAAOmpC,iBAAiB,iBAAkB,EAAG,EAAGt1C,UAAUC,QACnDiE,KAAKgxC,KAAK1iC,WAAatO,KAAKgP,KAAKsC,sBAI5CuhC,EAAM93C,UAAUq4C,OAAS,WAGrB,MADAnrC,GAAOmpC,iBAAiB,eAAgB,EAAG,EAAGt1C,UAAUC,QACjDiE,KAAKsO,YAMhBukC,EAAM93C,UAAU+mD,YAAc,WAC1B,MAAO9hD,MAAK8+C,aAAaiD,kBAK7BlP,EAAM93C,UAAUinD,gBAAkB,WAC9B,GAAIvlD,GAAMuD,KAAK8hD,cACXt5C,EAAKR,EAAO4E,kBAAkBnQ,EAClC,OAAc,OAAP+L,EAAc,UAAYA,GAOrCqqC,EAAM93C,UAAUknD,QAAU,SAAUzvC,GAEhC,GADAvK,EAAOmpC,iBAAiB,gBAAiB,EAAG,EAAGt1C,UAAUC,UACnDyW,YAAiBqgC,IAAQ,CAE3B,KAAM,IAAIloC,OADE,wFAGhB,GAAIu3C,GAAWliD,KAAKgxC,OAASx+B,EAAMw+B,KAC/BmR,EAAWniD,KAAKgP,KAAKuD,OAAOC,EAAMxD,MAClCozC,EAAsBpiD,KAAKgiD,oBAAsBxvC,EAAMwvC,iBAC3D,OAAOE,IAAYC,GAAYC,GAUnCvP,EAAMsN,yBAA2B,SAAUhjC,EAAQ2jC,EAAiBrgD,GAChE,GAAIO,IAAQ09C,OAAQ,KAAMj+C,QAAS,KACnC,IAAIqgD,GAAmBrgD,EACnBO,EAAI09C,OAASoC,EACb74C,EAAOypC,iBAAiBv0B,EAAQ,EAAGnc,EAAI09C,QAAQ,GAC/C19C,EAAIP,QAAUA,EACdwH,EAAO04C,sBAAsBxjC,EAAQ,EAAGnc,EAAIP,SAAS,OAEpD,IAAIqgD,EAEL,GAA+B,gBAA3B,KAAOA,EAAP,YAAAliD,EAAOkiD,KAAoD,OAApBA,EAEvC9/C,EAAIP,QAAUqgD,MAEb,IAA+B,kBAApBA,GAIZ,KAAM,IAAIn2C,OAAM1C,EAAOsV,YAAYJ,EAAQ,GAAG,GAC1C,yDAJJnc,GAAI09C,OAASoC,EAOrB,MAAO9/C,IAEX1G,OAAOC,eAAes4C,EAAM93C,UAAW,OACnCL,IAAK,WACD,MAAOsF,MAAK0zC,UAEhBj5C,YAAY,EACZD,cAAc,IAEXq4C,IAEXl5C,GAAQk5C,MAAQA,GxFuhVV,SAAUj5C,EAAQD,EAASH,GAEjC,YyF3/VA,SAASia,GAAWpG,GAChBqG,EAAWrG,EzF4gWf,GAAIzO,GAA4B,kBAAXuI,SAAoD,gBAApBA,QAAOC,SAAwB,SAAU3K,GAAO,aAAcA,IAAS,SAAUA,GAAO,MAAOA,IAAyB,kBAAX0K,SAAyB1K,EAAIoH,cAAgBsD,QAAU1K,IAAQ0K,OAAOpM,UAAY,eAAkB0B,GyFlhWtQnC,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAGIsY,GAHA3L,EAASvO,EAAQ,GACjBwO,EAASxO,EAAQ,GACjByO,EAASzO,EAAQ,EAKrBG,GAAQ8Z,WAAaA,EAKrB9Z,EAAQ8e,iBAAmB,SAAUwE,GACjC,MAAwB,gBAAbA,GACA,UAAYjV,EAAOuF,sBAAsB0P,GAEzC,UAAYA,GAO3BtjB,EAAQ2c,qBAAuB,SAAUf,GACrC,GAAIA,EAAaoB,aAAc,CAC3B,GAAItJ,GAAMkI,EAAalI,KACvBtF,GAAOiC,OAAsB,gBAARqD,IACF,gBAARA,IACS,gBAAf,KAAOA,EAAP,YAAAzO,EAAOyO,KAAoBpF,EAAOwK,SAASpF,EAAK,OAAS,4CAG9DtF,GAAOiC,OAAOuL,IAAiB7B,GAAY6B,EAAa3D,UAAW,+BAGvE7J,GAAOiC,OAAOuL,IAAiB7B,GAAY6B,EAAaf,cAAc5C,UAAW,wDzFqhW/E,SAAUhY,EAAQD,EAASH,GAEjC,Y0F1jWA,IAAIma,GAAyC,WACzC,GAAIC,GAAgBtZ,OAAOuZ,iBACpBC,uBAA2BvK,QAAS,SAAUrP,EAAGoS,GAAKpS,EAAE4Z,UAAYxH,IACvE,SAAUpS,EAAGoS,GAAK,IAAK,GAAIrR,KAAKqR,GAAOA,EAAEtR,eAAeC,KAAIf,EAAEe,GAAKqR,EAAErR,IACzE,OAAO,UAAUf,EAAGoS,GAEhB,QAASyH,KAAO/T,KAAK6D,YAAc3J,EADnC0Z,EAAc1Z,EAAGoS,GAEjBpS,EAAEa,UAAkB,OAANuR,EAAahS,OAAO0Z,OAAO1H,IAAMyH,EAAGhZ,UAAYuR,EAAEvR,UAAW,GAAIgZ,OAGvFzZ,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAI6Y,GAAUza,EAAQ,IAClB0a,EAAS1a,EAAQ,GACjBuO,EAASvO,EAAQ,GACjB48B,EAAiB58B,EAAQ,IAMzB6oD,EAA4B,SAAUhuC,GAEtC,QAASguC,KACL,MAAkB,QAAXhuC,GAAmBA,EAAO5K,MAAMzJ,KAAMlE,YAAckE,KAqD/D,MAvDA2T,GAAU0uC,EAAYhuC,GAOtBguC,EAAWtnD,UAAUuZ,QAAU,SAAUvS,EAAGuK,GACxC,GAAIoI,GAAW3S,EAAExE,KAAKoX,UAAUrI,EAAE/O,KAClC,OAAiB,KAAbmX,EACO3M,EAAOsE,YAAYtK,EAAE5H,KAAMmS,EAAEnS,MAG7Bua,GAMf2tC,EAAWtnD,UAAU6Z,YAAc,SAAUrX,GACzC,OAAO,GAKX8kD,EAAWtnD,UAAU8Z,oBAAsB,SAAUC,EAASC,GAC1D,OAAQD,EAAQvC,OAAOwC,IAK3BstC,EAAWtnD,UAAUia,QAAU,WAC3B,MAAOd,GAAOe,UAAUC,KAK5BmtC,EAAWtnD,UAAUoa,QAAU,WAC3B,MAAOjB,GAAOe,UAAU8F,KAO5BsnC,EAAWtnD,UAAUsa,SAAW,SAAUC,EAAYnb,GAClD,GAAImoD,GAAYlsB,EAAe5iB,aAAa8B,EAC5C,OAAO,IAAIpB,GAAOe,UAAU9a,EAAMmoD,IAKtCD,EAAWtnD,UAAUuT,SAAW,WAC5B,MAAO,UAEJ+zC,GACTpuC,EAAQuB,MACV7b,GAAQ0oD,WAAaA,EACrB1oD,EAAQimD,YAAc,GAAIyC,I1FulWpB,SAAUzoD,EAAQD,EAASH,GAEjC,Y2FxqWAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAMImnD,GANAx6C,EAASvO,EAAQ,GACjBowB,EAAapwB,EAAQ,IACrBwO,EAASxO,EAAQ,GACjB0a,EAAS1a,EAAQ,GACjBqc,EAAkBrc,EAAQ,GAC1Bsc,EAAatc,EAAQ,IAErBgpD,KAOA/rC,EAA0B,WAC1B,QAASA,GAASgsC,EAAUC,GACxB1iD,KAAKyiD,SAAWA,EAChBziD,KAAK0iD,UAAYA,EA8IrB,MA5IApoD,QAAOC,eAAekc,EAAU,WAM5B/b,IAAK,WAKD,MAJAqN,GAAOiC,OAAOw4C,GAAkB3sC,EAAgBJ,eAAgB,uCAChE8sC,EACIA,GACI,GAAI9rC,IAAWwT,YAAau4B,IAAoBv4B,YAAapU,EAAgBJ,kBAGzFhb,YAAY,EACZD,cAAc,IAOlBic,EAAS1b,UAAUL,IAAM,SAAUioD,GAC/B,GAAIC,GAAY56C,EAAOqX,QAAQrf,KAAKyiD,SAAUE,EAC9C,KAAKC,EACD,KAAM,IAAIj4C,OAAM,wBAA0Bg4C,EAC9C,OAAIC,KAAcJ,EAGP,KAGAI,GAOfnsC,EAAS1b,UAAUsf,SAAW,SAAUnB,GACpC,MAAOlR,GAAOyK,SAASzS,KAAK0iD,UAAWxpC,EAAgB5K,aAO3DmI,EAAS1b,UAAUuf,SAAW,SAAUpB,EAAiB2pC,GACrD96C,EAAOiC,OAAOkP,IAAoBpD,EAAWsE,UAAW,sEAKxD,KAJA,GAAI0oC,MACAC,GAAkB,EAClBve,EAAOqe,EAAiBnpC,YAAYxF,EAAOe,UAAU4E,MACrDpW,EAAO+gC,EAAKzqB,UACTtW,GACHs/C,EACIA,GAAmB7pC,EAAgBtE,YAAYnR,EAAKlG,MACxDulD,EAAU7mD,KAAKwH,GACfA,EAAO+gC,EAAKzqB,SAEhB,IAAIipC,EAEAA,GADAD,EACWn5B,EAAWC,cAAci5B,EAAW5pC,EAAgB8Q,cAGpDw4B,CAEf,IAAIS,GAAY/pC,EAAgB5K,WAC5B40C,EAAcl7C,EAAOqzC,MAAMr7C,KAAK0iD,UACpCQ,GAAYD,GAAa/pC,CACzB,IAAIiqC,GAAan7C,EAAOqzC,MAAMr7C,KAAKyiD,SAEnC,OADAU,GAAWF,GAAaD,EACjB,GAAIvsC,GAAS0sC,EAAYD,IAQpCzsC,EAAS1b,UAAU4c,aAAe,SAAUN,EAAWwrC,GACnD,GAAIzrB,GAAQp3B,IAkCZ,OAAO,IAAIyW,GAjCMzO,EAAOwI,IAAIxQ,KAAKyiD,SAAU,SAAUW,EAAiBH,GAClE,GAAIrqC,GAAQ5Q,EAAOqX,QAAQ+X,EAAMsrB,UAAWO,EAE5C,IADAl7C,EAAOiC,OAAO4O,EAAO,oCAAsCqqC,GACvDG,IAAoBZ,EAAgB,CAEpC,GAAI5pC,EAAMhE,YAAYyC,EAAU9Z,MAAO,CAKnC,IAHA,GAAIulD,MACAte,EAAOqe,EAAiBnpC,YAAYxF,EAAOe,UAAU4E,MACrDpW,EAAO+gC,EAAKzqB,UACTtW,GACCA,EAAKtJ,MAAQkd,EAAUld,MACvB2oD,EAAU7mD,KAAKwH,GAEnBA,EAAO+gC,EAAKzqB,SAGhB,OADA+oC,GAAU7mD,KAAKob,GACRuS,EAAWC,cAAci5B,EAAWlqC,EAAMoR,cAIjD,MAAOw4B,GAIX,GAAIa,GAAeR,EAAiBnoD,IAAI2c,EAAUld,MAC9Cmd,EAAc8rC,CAIlB,OAHIC,KACA/rC,EAAcA,EAAYjN,OAAO,GAAI6J,GAAOe,UAAUoC,EAAUld,KAAMkpD,KAEnE/rC,EAAYI,OAAOL,EAAWA,EAAU9Z,QAGvByC,KAAK0iD,YAQzCjsC,EAAS1b,UAAU0c,kBAAoB,SAAUJ,EAAWwrC,GAiBxD,MAAO,IAAIpsC,GAhBMzO,EAAOwI,IAAIxQ,KAAKyiD,SAAU,SAAUW,GACjD,GAAIA,IAAoBZ,EAEpB,MAAOY,EAGP,IAAIC,GAAeR,EAAiBnoD,IAAI2c,EAAUld,KAClD,OAAIkpD,GACOD,EAAgB/4C,OAAO,GAAI6J,GAAOe,UAAUoC,EAAUld,KAAMkpD,IAI5DD,IAIapjD,KAAK0iD,YAElCjsC,IAEX9c,GAAQ8c,SAAWA,G3FsrWb,SAAU7c,EAAQD,EAASH,GAEjC,Y4F11WAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAIua,GAAcnc,EAAQ,IACtB8pD,EAAc9pD,EAAQ,IACtB+pD,EAAQv3C,KAAK9B,IAAI,GAIjBs5C,EAA2B,WAI3B,QAASA,GAAUznD,GAKfiE,KAAK+X,MAJU,SAAU0rC,GACrB,MAAOr1C,UAAUpC,KAAK9B,IAAIu5C,GAAOF,EAAQ,KAGvBxnD,EAAS,GAC/BiE,KAAK0jD,SAAW1jD,KAAK+X,MAAQ,CAC7B,IAAI4rC,GAHU,SAAUj2C,GAAQ,MAAOU,UAAS7E,MAAMmE,EAAO,GAAGO,KAAK,KAAM,IAGxDjO,KAAK+X,MACxB/X,MAAK4jD,MAAS7nD,EAAS,EAAK4nD,EAWhC,MANAH,GAAUzoD,UAAU8oD,aAAe,WAE/B,GAAItvB,KAAWv0B,KAAK4jD,MAAS,GAAO5jD,KAAK0jD,SAEzC,OADA1jD,MAAK0jD,WACEnvB,GAEJivB,IAiBX7pD,GAAQkwB,cAAgB,SAAUi5B,EAAWxwC,EAAKwxC,EAAOC,GACrDjB,EAAU/1C,KAAKuF,EACf,IAAI0xC,GAAoB,QAApBA,GAA8BC,EAAKC,GACnC,GACI7sC,GACAhb,EAFAN,EAASmoD,EAAOD,CAGpB,IAAc,GAAVloD,EACA,MAAO,KAEN,IAAc,GAAVA,EAGL,MAFAsb,GAAYyrC,EAAUmB,GACtB5nD,EAAMynD,EAAQA,EAAMzsC,GAAaA,EAC1B,GAAI1B,GAAY8e,SAASp4B,EAAKgb,EAAU9Z,KAAMoY,EAAY8e,SAASoB,MAAO,KAAM,KAGvF,IAAIsuB,GAAS/1C,SAAUrS,EAAS,EAAI,IAAMkoD,EACtC/xC,EAAO8xC,EAAkBC,EAAKE,GAC9BhyC,EAAQ6xC,EAAkBG,EAAS,EAAGD,EAG1C,OAFA7sC,GAAYyrC,EAAUqB,GACtB9nD,EAAMynD,EAAQA,EAAMzsC,GAAaA,EAC1B,GAAI1B,GAAY8e,SAASp4B,EAAKgb,EAAU9Z,KAAMoY,EAAY8e,SAASoB,MAAO3jB,EAAMC,IAyC3FiyC,EAAS,GAAIZ,GAAUV,EAAU/mD,QACjCivB,EAvCmB,SAAUo5B,GAuB7B,IAAK,GAtBD7mD,GAAO,KACPytB,EAAO,KACPpS,EAAQkqC,EAAU/mD,OAClBsoD,EAAe,SAAUC,EAAW5vB,GACpC,GAAIuvB,GAAMrrC,EAAQ0rC,EACdJ,EAAOtrC,CACXA,IAAS0rC,CACT,IAAIjQ,GAAY2P,EAAkBC,EAAM,EAAGC,GACvC7sC,EAAYyrC,EAAUmB,GACtB5nD,EAAMynD,EAAQA,EAAMzsC,GAAaA,CACrCktC,GAAc,GAAI5uC,GAAY8e,SAASp4B,EAAKgb,EAAU9Z,KAAMm3B,EAAO,KAAM2f,KAEzEkQ,EAAgB,SAAUC,GACtBjnD,GACAA,EAAK2U,KAAOsyC,EACZjnD,EAAOinD,IAGPx5B,EAAOw5B,EACPjnD,EAAOinD,IAGN3qD,EAAI,EAAGA,EAAIuqD,EAAOrsC,QAASle,EAAG,CACnC,GAAI4qD,GAAQL,EAAOP,eAEfS,EAAYt4C,KAAK6B,IAAI,EAAGu2C,EAAOrsC,OAASle,EAAI,GAC5C4qD,GACAJ,EAAaC,EAAW3uC,EAAY8e,SAASoB,QAI7CwuB,EAAaC,EAAW3uC,EAAY8e,SAASoB,OAC7CwuB,EAAaC,EAAW3uC,EAAY8e,SAASE,MAGrD,MAAO3J,IAGiBo5B,EAC5B,OAAO,IAAId,GAAY/sC,UAAUwtC,GAAazxC,EAAK0Y,K5Fi3WjD,SAAUpxB,EAAQD,EAASH,GAEjC,Y6F/9WA,SAASswB,GAAqB5X,EAAMC,GAChC,MAAOpK,GAAOsE,YAAY6F,EAAK/X,KAAMgY,EAAMhY,MAG/C,QAASqc,GAAgBtE,EAAMC,GAC3B,MAAOpK,GAAOsE,YAAY6F,EAAMC,GAPpC7X,OAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAI2M,GAASvO,EAAQ,EAIrBG,GAAQmwB,qBAAuBA,EAI/BnwB,EAAQ6c,gBAAkBA,G7Fy/WpB,SAAU5c,EAAQD,EAASH,GAEjC,Y8FpgXA,IAAIma,GAAyC,WACzC,GAAIC,GAAgBtZ,OAAOuZ,iBACpBC,uBAA2BvK,QAAS,SAAUrP,EAAGoS,GAAKpS,EAAE4Z,UAAYxH,IACvE,SAAUpS,EAAGoS,GAAK,IAAK,GAAIrR,KAAKqR,GAAOA,EAAEtR,eAAeC,KAAIf,EAAEe,GAAKqR,EAAErR,IACzE,OAAO,UAAUf,EAAGoS,GAEhB,QAASyH,KAAO/T,KAAK6D,YAAc3J,EADnC0Z,EAAc1Z,EAAGoS,GAEjBpS,EAAEa,UAAkB,OAANuR,EAAahS,OAAO0Z,OAAO1H,IAAMyH,EAAGhZ,UAAYuR,EAAEvR,UAAW,GAAIgZ,OAGvFzZ,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAI2M,GAASvO,EAAQ,GACjBwO,EAASxO,EAAQ,GACjBya,EAAUza,EAAQ,IAClB0vB,EAAiB1vB,EAAQ,GACzB0a,EAAS1a,EAAQ,GACjB48B,EAAiB58B,EAAQ,IAMzBmmD,EAA2B,SAAUtrC,GAErC,QAASsrC,GAAU+E,GACf,GAAIttB,GAAQ/iB,EAAOta,KAAKiG,OAASA,IAGjC,OAFAo3B,GAAMstB,WAAaA,EACnB38C,EAAOiC,QAAQ06C,EAAW9yC,WAAuC,cAA1B8yC,EAAWzzC,WAA4B,2DACvEmmB,EAmDX,MAxDAzjB,GAAUgsC,EAAWtrC,GAYrBsrC,EAAU5kD,UAAU4pD,aAAe,SAAU3pB,GACzC,MAAOA,GAAKhkB,SAAShX,KAAK0kD,aAK9B/E,EAAU5kD,UAAU6Z,YAAc,SAAUrX,GACxC,OAAQA,EAAKyZ,SAAShX,KAAK0kD,YAAY9yC,WAK3C+tC,EAAU5kD,UAAUuZ,QAAU,SAAUvS,EAAGuK,GACvC,GAAIs4C,GAAS5kD,KAAK2kD,aAAa5iD,EAAExE,MAC7BsnD,EAAS7kD,KAAK2kD,aAAar4C,EAAE/O,MAC7BmX,EAAWkwC,EAAOjwC,UAAUkwC,EAChC,OAAiB,KAAbnwC,EACO1M,EAAOqE,YAAYtK,EAAE5H,KAAMmS,EAAEnS,MAG7Bua,GAMfirC,EAAU5kD,UAAUsa,SAAW,SAAUC,EAAYnb,GACjD,GAAImoD,GAAYlsB,EAAe5iB,aAAa8B,GACxC/X,EAAO2rB,EAAejT,aAAaP,WAAWkC,YAAY5X,KAAK0kD,WAAYpC,EAC/E,OAAO,IAAIpuC,GAAOe,UAAU9a,EAAMoD,IAKtCoiD,EAAU5kD,UAAUoa,QAAU,WAC1B,GAAI5X,GAAO2rB,EAAejT,aAAaP,WAAWkC,YAAY5X,KAAK0kD,WAAYx7B,EAAexV,SAC9F,OAAO,IAAIQ,GAAOe,UAAUjN,EAAOoE,SAAU7O,IAKjDoiD,EAAU5kD,UAAUuT,SAAW,WAC3B,MAAOtO,MAAK0kD,WAAW9nD,QAAQqR,KAAK,MAEjC0xC,GACT1rC,EAAQuB,MACV7b,GAAQgmD,UAAYA,G9FiiXd,SAAU/lD,EAAQD,EAASH,GAEjC,YAkBA,IAAIoF,GAA4B,kBAAXuI,SAAoD,gBAApBA,QAAOC,SAAwB,SAAU3K,GAAO,aAAcA,IAAS,SAAUA,GAAO,MAAOA,IAAyB,kBAAX0K,SAAyB1K,EAAIoH,cAAgBsD,QAAU1K,IAAQ0K,OAAOpM,UAAY,eAAkB0B,G+FtoXtQnC,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAI2M,GAASvO,EAAQ,GACjBijB,EAASjjB,EAAQ,GACjB68B,EAAuB78B,EAAQ,IAC/B2a,EAAa3a,EAAQ,IACrB48B,EAAiB58B,EAAQ,IACzBqc,EAAkBrc,EAAQ,EAM9BG,GAAQ4gC,mBAAqB,SAAUxN,GAGnC,MAFAA,GAASA,MACTA,EAAA,UAAsBA,EAAA,YAAuB,GAAI5M,OAAOC,UACjD2M,GASXpzB,EAAQmrD,qBAAuB,SAAU1pD,EAAOwgC,GAC5C,MAAKxgC,IAA0B,gBAAjB,KAAOA,EAAP,YAAAwD,EAAOxD,KAIjB2M,EAAOiC,OAAO,OAAS5O,GAAO,6CACvBwgC,EAAaxgC,EAAM,SAJnBA,GAcfzB,EAAQsjC,yBAA2B,SAAU8W,EAAMnY,GAC/C,GAAImpB,GAAe,GAAI1uB,GAAqBuB,kBAI5C,OAHAmc,GAAK7W,YAAY,GAAIzgB,GAAO/L,KAAK,IAAK,SAAU1B,EAAMzR,GAClDwnD,EAAavnB,SAASxuB,EAAMrV,EAAQmiC,6BAA6Bv+B,EAAMq+B,MAEpEmpB,GAUXprD,EAAQmiC,6BAA+B,SAAUv+B,EAAMq+B,GACnD,GAEI7mB,GAFAiwC,EAASznD,EAAKiX,cAAcnH,MAC5B4P,EAAWtjB,EAAQmrD,qBAAqBE,EAAQppB,EAEpD,IAAIr+B,EAAKoZ,aAAc,CACnB,GAAIsuC,GAAW1nD,EACXnC,EAAQzB,EAAQmrD,qBAAqBG,EAASzxB,WAAYoI,EAC9D,OAAIxgC,KAAU6pD,EAASzxB,YACnBvW,IAAagoC,EAASzwC,cAAcnH,MAC7B,GAAI8G,GAAWiB,SAASha,EAAOg7B,EAAe5iB,aAAayJ,IAG3D1f,EAIX,GAAI2nD,GAAe3nD,CAWnB,OAVAwX,GAAUmwC,EACNjoC,IAAaioC,EAAa1wC,cAAcnH,QACxC0H,EAAUA,EAAQ6B,eAAe,GAAIzC,GAAWiB,SAAS6H,KAE7DioC,EAAa9sC,aAAavC,EAAgBJ,eAAgB,SAAUsB,EAAWsB,GAC3E,GAAIjB,GAAezd,EAAQmiC,6BAA6BzjB,EAAWujB,EAC/DxkB,KAAiBiB,IACjBtD,EAAUA,EAAQoC,qBAAqBJ,EAAWK,MAGnDrC,I/F4oXT,SAAUnb,EAAQD,EAASH,GAEjC,YgGhuXAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAIqhB,GAASjjB,EAAQ,GACjBqc,EAAkBrc,EAAQ,GAC1B2rD,EAAe3rD,EAAQ,IAMvBo+B,EAAoC,WACpC,QAASA,KAKL53B,KAAKszB,OAAS,KAKdtzB,KAAKkW,UAAY,KAuIrB,MA/HA0hB,GAAmB78B,UAAUihB,KAAO,SAAUhN,GAC1C,GAAmB,MAAfhP,KAAKszB,OACL,MAAOtzB,MAAKszB,OAAOtc,SAAShI,EAE3B,IAAKA,EAAK4C,WAA+B,MAAlB5R,KAAKkW,UAY7B,MAAO,KAXP,IAAIkP,GAAWpW,EAAKiC,UAEpB,IADAjC,EAAOA,EAAKmC,WACRnR,KAAKkW,UAAUzD,SAAS2S,GAAW,CAEnC,MADgBplB,MAAKkW,UAAUxb,IAAI0qB,GAClBpJ,KAAKhN,GAGtB,MAAO,OAcnB4oB,EAAmB78B,UAAUyiC,SAAW,SAAUxuB,EAAM3D,GACpD,GAAI2D,EAAK4C,UACL5R,KAAKszB,OAASjoB,EACdrL,KAAKkW,UAAY,SAEhB,IAAoB,OAAhBlW,KAAKszB,OACVtzB,KAAKszB,OAAStzB,KAAKszB,OAAO1b,YAAY5I,EAAM3D,OAE3C,CACqB,MAAlBrL,KAAKkW,YACLlW,KAAKkW,UAAY,GAAIivC,GAAaC,WAEtC,IAAIhgC,GAAWpW,EAAKiC,UACfjR,MAAKkW,UAAUzD,SAAS2S,IACzBplB,KAAKkW,UAAUmvC,IAAIjgC,EAAU,GAAIwS,GAErC,IAAIl8B,GAAQsE,KAAKkW,UAAUxb,IAAI0qB,EAC/BpW,GAAOA,EAAKmC,WACZzV,EAAM8hC,SAASxuB,EAAM3D,KAS7BusB,EAAmB78B,UAAUsiC,OAAS,SAAUruB,GAC5C,GAAIA,EAAK4C,UAGL,MAFA5R,MAAKszB,OAAS,KACdtzB,KAAKkW,UAAY,MACV,CAGP,IAAoB,OAAhBlW,KAAKszB,OAAiB,CACtB,GAAItzB,KAAKszB,OAAO3c,aAEZ,OAAO,CAGP,IAAIvb,GAAQ4E,KAAKszB,MACjBtzB,MAAKszB,OAAS,IACd,IAAIgyB,GAAStlD,IAIb,OAHA5E,GAAMgd,aAAavC,EAAgBJ,eAAgB,SAAUpZ,EAAK03C,GAC9DuR,EAAO9nB,SAAS,GAAI/gB,GAAO/L,KAAKrU,GAAM03C,KAEnC/zC,KAAKq9B,OAAOruB,GAGtB,GAAuB,OAAnBhP,KAAKkW,UAAoB,CAC9B,GAAIkP,GAAWpW,EAAKiC,UAEpB,IADAjC,EAAOA,EAAKmC,WACRnR,KAAKkW,UAAUzD,SAAS2S,GAAW,CAChBplB,KAAKkW,UAAUxb,IAAI0qB,GAAUiY,OAAOruB,IAEnDhP,KAAKkW,UAAU7L,OAAO+a,GAG9B,QAAIplB,KAAKkW,UAAUtE,YACf5R,KAAKkW,UAAY,MACV,GAOX,OAAO,GAWnB0hB,EAAmB78B,UAAUmiC,YAAc,SAAUqoB,EAAYC,GACzC,OAAhBxlD,KAAKszB,OACLkyB,EAAKD,EAAYvlD,KAAKszB,QAGtBtzB,KAAKoY,aAAa,SAAU/b,EAAK03C,GAC7B,GAAI/kC,GAAO,GAAIyN,GAAO/L,KAAK60C,EAAWj3C,WAAa,IAAMjS,EACzD03C,GAAK7W,YAAYluB,EAAMw2C,MASnC5tB,EAAmB78B,UAAUqd,aAAe,SAAUotC,GAC3B,OAAnBxlD,KAAKkW,WACLlW,KAAKkW,UAAU/I,KAAK,SAAU9Q,EAAK03C,GAC/ByR,EAAKnpD,EAAK03C,MAIfnc,IAEXj+B,GAAQi+B,mBAAqBA,GhG6uXvB,SAAUh+B,EAAQD,EAASH,GAEjC,YiG54XAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAI2M,GAASvO,EAAQ,GAMjB4rD,EAA4B,WAC5B,QAASA,KACLplD,KAAKoK,OAkET,MA5DAg7C,GAAWrqD,UAAUsqD,IAAM,SAAUve,EAAMz5B,GACvCrN,KAAKoK,IAAI08B,GAAgB,OAARz5B,GAAeA,GAMpC+3C,EAAWrqD,UAAU0X,SAAW,SAAUpW,GACtC,MAAO0L,GAAO0K,SAASzS,KAAKoK,IAAK/N,IAMrC+oD,EAAWrqD,UAAUL,IAAM,SAAUosC,GACjC,MAAO9mC,MAAKyS,SAASq0B,GAAQ9mC,KAAKoK,IAAI08B,OAAQ3qC,IAKlDipD,EAAWrqD,UAAUsP,OAAS,SAAUy8B,SAC7B9mC,MAAKoK,IAAI08B,IAKpBse,EAAWrqD,UAAU0qD,MAAQ,WACzBzlD,KAAKoK,QAMTg7C,EAAWrqD,UAAU6W,QAAU,WAC3B,MAAO7J,GAAO6J,QAAQ5R,KAAKoK,MAK/Bg7C,EAAWrqD,UAAUgd,MAAQ,WACzB,MAAOhQ,GAAOwzC,SAASv7C,KAAKoK,MAMhCg7C,EAAWrqD,UAAUoS,KAAO,SAAUzB,GAClC3D,EAAOqF,QAAQpN,KAAKoK,IAAK,SAAU0C,EAAGU,GAAK,MAAO9B,GAAGoB,EAAGU,MAM5D43C,EAAWrqD,UAAU8R,KAAO,WACxB,GAAIA,KAIJ,OAHA9E,GAAOqF,QAAQpN,KAAKoK,IAAK,SAAU0C,GAC/BD,EAAK5Q,KAAK6Q,KAEPD,GAEJu4C,IAEXzrD,GAAQyrD,WAAaA,GjGs6Xf,SAAUxrD,EAAQD,EAASH,GAEjC,YkGr/XAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAIsqD,GAAclsD,EAAQ,IACtBijB,EAASjjB,EAAQ,GAQjBmsD,EAA2B,WAC3B,QAASA,GAAUtd,EAAQr5B,EAAMgsB,GAC7Bh7B,KAAKqoC,OAASA,EACdroC,KAAKgP,KAAOA,EACZhP,KAAKg7B,KAAOA,EAEZh7B,KAAKC,KAAOylD,EAAYpmC,cAAcsmC,UAU1C,MARAD,GAAU5qD,UAAU8qD,kBAAoB,SAAU9uC,GAC9C,MAAI/W,MAAKgP,KAAK4C,UACH,GAAI+zC,GAAU3lD,KAAKqoC,OAAQ5rB,EAAO/L,KAAKysB,MAAOn9B,KAAKg7B,KAAKlkB,kBAAkBC,IAG1E,GAAI4uC,GAAU3lD,KAAKqoC,OAAQroC,KAAKgP,KAAKmC,WAAYnR,KAAKg7B,OAG9D2qB,IAEXhsD,GAAQgsD,UAAYA,GlG4gYd,SAAU/rD,EAAQD,EAASH,GAEjC,YmG1iYAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAMI03C,GANAgT,EAActsD,EAAQ,IACtB0vB,EAAiB1vB,EAAQ,GACzBuO,EAASvO,EAAQ,GACjBwO,EAASxO,EAAQ,GACjBusD,EAAcvsD,EAAQ,IACtBwsD,EAASxsD,EAAQ,KAYjBu5C,EAA2B,WAC3B,QAASA,KAUL/yC,KAAKimD,UAwMT,MAtMA3rD,QAAOC,eAAew4C,EAAW,0BAC7Br4C,IAAK,WAED,MADAqN,GAAOiC,OAAO8oC,EAAwB,oCAC/BA,GAEX1oC,IAAK,SAAUiD,GACXtF,EAAOiC,QAAQ8oC,EAAwB,mDACvCA,EAAyBzlC,GAE7B5S,YAAY,EACZD,cAAc,IAKlBu4C,EAAUh4C,UAAU6W,QAAU,WAC1B,MAAO5J,GAAO4J,QAAQ5R,KAAKimD,SAS/BlT,EAAUh4C,UAAUmrD,eAAiB,SAAUC,EAAWC,EAAaC,GACnE,GAAI3mC,GAAUymC,EAAU9d,OAAO3oB,OAC/B,IAAgB,OAAZA,EAAkB,CAClB,GAAI4mC,GAAOt+C,EAAOqX,QAAQrf,KAAKimD,OAAQvmC,EAEvC,OADA3X,GAAOiC,OAAe,MAARs8C,EAAc,gDACrBA,EAAKJ,eAAeC,EAAWC,EAAaC,GAGnD,GAAIE,KAIJ,OAHAv+C,GAAOoF,QAAQpN,KAAKimD,OAAQ,SAAU5pD,EAAKiqD,GACvCC,EAAWA,EAAS/7C,OAAO87C,EAAKJ,eAAeC,EAAWC,EAAaC,MAEpEE,GAafxT,EAAUh4C,UAAU+iC,qBAAuB,SAAUhvB,EAAO+uB,EAAmBuoB,EAAaI,EAAaC,GACrG,GAAI/mC,GAAU5Q,EAAMkzC,kBAChBsE,EAAOt+C,EAAOqX,QAAQrf,KAAKimD,OAAQvmC,EACvC,KAAK4mC,EAAM,CAEP,GAAII,GAAaN,EAAYO,uBAAuBF,EAAsBD,EAAc,MACpFI,GAAqB,CACrBF,GACAE,GAAqB,EAEhBJ,YAAuBt9B,GAAejT,cAC3CywC,EAAaN,EAAYS,0BAA0BL,GACnDI,GAAqB,IAGrBF,EAAax9B,EAAejT,aAAaP,WACzCkxC,GAAqB,EAEzB,IAAIE,GAAY,GAAIf,GAAYgB,UAAU,GAAIjB,GAAY5mB,UACpCwnB,EAAaE,GAAoB,GAAQ,GAAId,GAAY5mB,UACzDsnB,EAAcC,GAAqB,GACzDH,GAAO,GAAIN,GAAOgB,KAAKl4C,EAAOg4C,GAC9B9mD,KAAKimD,OAAOvmC,GAAW4mC,EAI3B,MADAA,GAAKxoB,qBAAqBD,GACnByoB,EAAKW,iBAAiBppB,IAajCkV,EAAUh4C,UAAUkjC,wBAA0B,SAAUnvB,EAAO+uB,EAAmBqpB,GAC9E,GAAIxnC,GAAU5Q,EAAMkzC,kBAChBmF,KACAC,KACAC,EAAkBrnD,KAAKsnD,iBAC3B,IAAgB,YAAZ5nC,EAAuB,CAEvB,GAAI4lC,GAAStlD,IACbgI,GAAOoF,QAAQpN,KAAKimD,OAAQ,SAAUsB,EAAajB,GAC/Cc,EAAeA,EAAa58C,OAAO87C,EAAKroB,wBAAwBJ,EAAmBqpB,IAC/EZ,EAAK10C,kBACE0zC,GAAOW,OAAOsB,GAEhBjB,EACAkB,WACAvH,iBACAwH,gBACDN,EAAQlrD,KAAKqqD,EAAKkB,mBAK7B,CAED,GAAIlB,GAAOt+C,EAAOqX,QAAQrf,KAAKimD,OAAQvmC,EACnC4mC,KACAc,EAAeA,EAAa58C,OAAO87C,EAAKroB,wBAAwBJ,EAAmBqpB,IAC/EZ,EAAK10C,kBACE5R,MAAKimD,OAAOvmC,GAEd4mC,EACAkB,WACAvH,iBACAwH,gBACDN,EAAQlrD,KAAKqqD,EAAKkB,cASlC,MAJIH,KAAoBrnD,KAAKsnD,mBAEzBH,EAAQlrD,KAAK,GAAI82C,GAAUD,uBAAuBhkC,EAAMkiC,KAAMliC,EAAME,QAE/Dm4C,QAASA,EAASntB,OAAQotB,IAKvCrU,EAAUh4C,UAAU2sD,cAAgB,WAChC,GAAItwB,GAAQp3B,IAEZ,OADa1F,QAAOuS,KAAK7M,KAAKimD,QAAQz1C,IAAI,SAAUnU,GAAO,MAAO+6B,GAAM6uB,OAAO5pD,KACjEiU,OAAO,SAAUg2C,GAC3B,OAAQA,EACHkB,WACAvH,iBACAwH,kBAQb1U,EAAUh4C,UAAU4sD,uBAAyB,SAAU34C,GACnD,GAAIw3C,GAAc,IAIlB,OAHAx+C,GAAOoF,QAAQpN,KAAKimD,OAAQ,SAAU5pD,EAAKiqD,GACvCE,EAAcA,GAAeF,EAAKqB,uBAAuB34C,KAEtDw3C,GAMXzT,EAAUh4C,UAAU6sD,aAAe,SAAU94C,GAEzC,GADaA,EAAMmxC,iBACRwH,eACP,MAAOznD,MAAK6nD,iBAGZ,IAAInoC,GAAU5Q,EAAMkzC,iBACpB,OAAOh6C,GAAOqX,QAAQrf,KAAKimD,OAAQvmC,IAO3CqzB,EAAUh4C,UAAU+sD,mBAAqB,SAAUh5C,GAC/C,MAAmC,OAA5B9O,KAAK4nD,aAAa94C,IAK7BikC,EAAUh4C,UAAUusD,gBAAkB,WAClC,MAAiC,OAA1BtnD,KAAK6nD,mBAKhB9U,EAAUh4C,UAAU8sD,gBAAkB,WAOlC,MANmB7/C,GAAO4zC,UAAU57C,KAAKimD,OAAQ,SAAUK,GACvD,MAAOA,GACFkB,WACAvH,iBACAwH,kBAEc,MAEpB1U,IAEXp5C,GAAQo5C,UAAYA,GnGmjYd,SAAUn5C,EAAQD,EAASH,GAEjC,YoG5xYAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAI8tB,GAAiB1vB,EAAQ,GACzBssD,EAActsD,EAAQ,IAQtButD,EAA2B,WAM3B,QAASA,GAAUgB,EAAaC,GAC5BhoD,KAAK+nD,YAAcA,EACnB/nD,KAAKgoD,aAAeA,EAyDxB,MAjDAjB,GAAUhsD,UAAUktD,gBAAkB,SAAUC,EAAW5iB,EAAU6iB,GACjE,MAAO,IAAIpB,GAAU,GAAIjB,GAAY5mB,UAAUgpB,EAAW5iB,EAAU6iB,GAAWnoD,KAAKgoD,eAQxFjB,EAAUhsD,UAAUqtD,iBAAmB,SAAUC,EAAY/iB,EAAU6iB,GACnE,MAAO,IAAIpB,GAAU/mD,KAAK+nD,YAAa,GAAIjC,GAAY5mB,UAAUmpB,EAAY/iB,EAAU6iB,KAK3FpB,EAAUhsD,UAAUutD,cAAgB,WAChC,MAAOtoD,MAAK+nD,aAKhBhB,EAAUhsD,UAAUwtD,qBAAuB,WACvC,MAAOvoD,MAAK+nD,YAAYzoB,qBAClBt/B,KAAK+nD,YAAYtuB,UACjB,MAKVstB,EAAUhsD,UAAUytD,eAAiB,WACjC,MAAOxoD,MAAKgoD,cAKhBjB,EAAUhsD,UAAU0tD,sBAAwB,WACxC,MAAOzoD,MAAKgoD,aAAa1oB,qBACnBt/B,KAAKgoD,aAAavuB,UAClB,MAMVstB,EAAU5pB,MAAQ,GAAI4pB,GAAU,GAAIjB,GAAY5mB,UAAUhW,EAAejT,aAAaP,YAChE,GACR,GAAQ,GAAIowC,GAAY5mB,UAAUhW,EAAejT,aAAaP,YACtD,GACR,IACPqxC,IAEXptD,GAAQotD,UAAYA,GpGgzYd,SAAUntD,EAAQD,EAASH,GAEjC,YqG/3YAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAI2M,GAASvO,EAAQ,GAOjB8kC,EAA+B,WAC/B,QAASA,GAAcoqB,GACnB1oD,KAAK0oD,YAAcA,EACnB1oD,KAAK2oD,MAAQ,KAajB,MAXArqB,GAAcvjC,UAAUL,IAAM,WAC1B,GAAIkuD,GAAW5oD,KAAK0oD,YAAYhuD,MAC5BmuD,EAAQ9gD,EAAOszC,MAAMuN,EAOzB,OANI5oD,MAAK2oD,OACL5gD,EAAOqF,QAAQpN,KAAK2oD,MAAO,SAAUhqB,EAAMvjC,GACvCytD,EAAMlqB,GAAQkqB,EAAMlqB,GAAQvjC,IAGpC4E,KAAK2oD,MAAQC,EACNC,GAEJvqB,IAEX3kC,GAAQ2kC,cAAgBA,GrGu5YlB,SAAU1kC,EAAQD,EAASH,GAEjC,YAkBA,IAAIoF,GAA4B,kBAAXuI,SAAoD,gBAApBA,QAAOC,SAAwB,SAAU3K,GAAO,aAAcA,IAAS,SAAUA,GAAO,MAAOA,IAAyB,kBAAX0K,SAAyB1K,EAAIoH,cAAgBsD,QAAU1K,IAAQ0K,OAAOpM,UAAY,eAAkB0B,IsGr8YlQkX,EAAyC,WACzC,GAAIC,GAAgBtZ,OAAOuZ,iBACpBC,uBAA2BvK,QAAS,SAAUrP,EAAGoS,GAAKpS,EAAE4Z,UAAYxH,IACvE,SAAUpS,EAAGoS,GAAK,IAAK,GAAIrR,KAAKqR,GAAOA,EAAEtR,eAAeC,KAAIf,EAAEe,GAAKqR,EAAErR,IACzE,OAAO,UAAUf,EAAGoS,GAEhB,QAASyH,KAAO/T,KAAK6D,YAAc3J,EADnC0Z,EAAc1Z,EAAGoS,GAEjBpS,EAAEa,UAAkB,OAANuR,EAAahS,OAAO0Z,OAAO1H,IAAMyH,EAAGhZ,UAAYuR,EAAEvR,UAAW,GAAIgZ,OAGvFzZ,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAI0tD,GAAQtvD,EAAQ,IAChBuO,EAASvO,EAAQ,GACjBwO,EAASxO,EAAQ,GACjByO,EAASzO,EAAQ,GACjB0O,EAAS1O,EAAQ,GACjBijB,EAASjjB,EAAQ,GACjBuvD,EAAsBvvD,EAAQ,KAC9BwvD,EAAkBxvD,EAAQ,KAC1B2O,EAAS3O,EAAQ,GACjByvD,EAAezvD,EAAQ,KACvB4O,EAAS5O,EAAQ,GACjB8O,EAAS9O,EAAQ,GACjB0vD,EAAkB1vD,EAAQ,KAC1B2vD,EAAsB,IACtBC,EAA8B,IAa9B5wB,EAAsC,SAAUnkB,GAWhD,QAASmkB,GAAqBvB,EAAWoB,EAAeC,EAAkBG,EAAqB4wB,EAAoBC,GAC/G,GAAIlyB,GAAQ/iB,EAAOta,KAAKiG,OAASA,IAwCjC,IAvCAo3B,EAAMH,UAAYA,EAClBG,EAAMiB,cAAgBA,EACtBjB,EAAMkB,iBAAmBA,EACzBlB,EAAMqB,oBAAsBA,EAC5BrB,EAAMiyB,mBAAqBA,EAC3BjyB,EAAMkyB,cAAgBA,EAEtBlyB,EAAM5uB,GAAKgwB,EAAqB+wB,8BAChCnyB,EAAMuE,KAAOzzB,EAAOoC,WAAW,KAAO8sB,EAAM5uB,GAAK,KAEjD4uB,EAAMoyB,qBACNpyB,EAAMqyB,YACNryB,EAAMsyB,oBACNtyB,EAAMuyB,qBAAuB,EAC7BvyB,EAAMwyB,6BACNxyB,EAAMyyB,YAAa,EACnBzyB,EAAM0yB,gBAAkBX,EACxB/xB,EAAM2yB,mBAAqBX,EAC3BhyB,EAAM4yB,uBAAyB,KAC/B5yB,EAAM6yB,cAAgB,KAEtB7yB,EAAM8yB,0BAA4B,KAElC9yB,EAAM+yB,UAAW,EAEjB/yB,EAAMgzB,kBACNhzB,EAAMizB,eAAiB,EAKvBjzB,EAAMkzB,UAAY,KAElBlzB,EAAMmzB,WAAa,KACnBnzB,EAAMozB,oBAAqB,EAC3BpzB,EAAMqzB,uBAAyB,EAC/BrzB,EAAMszB,kBAAmB,EACzBtzB,EAAMuzB,2BAA6B,KACnCvzB,EAAMwzB,+BAAiC,KACnCtB,IAAkBhhD,EAAOqD,YACzB,KAAM,IAAIhB,OAAM,iFAOpB,OALAysB,GAAMyzB,iBAAiB,GACvB9B,EAAoB+B,kBAAkBjU,cAAcjoB,GAAG,UAAWwI,EAAM2zB,WAAY3zB,IACzC,IAAvCH,EAAUvY,KAAKzT,QAAQ,YACvB+9C,EAAgBgC,cAAcnU,cAAcjoB,GAAG,SAAUwI,EAAM6zB,UAAW7zB,GAEvEA,EAkrBX,MA7uBAzjB,GAAU6kB,EAAsBnkB,GAmEhCmkB,EAAqBz9B,UAAUmwD,YAAc,SAAU3xC,EAAQxN,EAAMo/C,GACjE,GAAIC,KAAcprD,KAAKqqD,eACnBgB,GAAQC,EAAGF,EAAWrpD,EAAGwX,EAAQjN,EAAGP,EACxC/L,MAAK27B,KAAK3zB,EAAO0B,UAAU2hD,IAC3BpjD,EAAO+B,OAAOhK,KAAK6pD,WAAY,0DAC/B7pD,KAAKsqD,UAAUY,YAAYG,GACvBF,IACAnrD,KAAKoqD,eAAegB,GAAaD,IAMzC3yB,EAAqBz9B,UAAU++B,OAAS,SAAUhrB,EAAOwqB,EAAeD,EAAKE,GACzE,GAAI7Z,GAAU5Q,EAAMkzC,kBAChB3wC,EAAavC,EAAME,KAAKV,UAC5BtO,MAAK27B,KAAK,qBAAuBtqB,EAAa,IAAMqO,GACpD1f,KAAKypD,SAASp4C,GAAcrR,KAAKypD,SAASp4C,OAC1CpJ,EAAO+B,OAAO8E,EAAMmxC,iBAAiBsL,cAChCz8C,EAAMmxC,iBAAiBwH,eAAgB,sDAC5Cx/C,EAAO+B,QAAQhK,KAAKypD,SAASp4C,GAAYqO,GAAU,+CACnD,IAAI8rC,IACAjyB,WAAYA,EACZkyB,OAAQnyB,EACRxqB,MAAOA,EACPuqB,IAAKA,EAETr5B,MAAKypD,SAASp4C,GAAYqO,GAAW8rC,EACjCxrD,KAAK6pD,YACL7pD,KAAK0rD,YAAYF,IAUzBhzB,EAAqBz9B,UAAU2wD,YAAc,SAAUF,GACnD,GAAIp0B,GAAQp3B,KACR8O,EAAQ08C,EAAW18C,MACnBuC,EAAavC,EAAME,KAAKV,WACxBoR,EAAU5Q,EAAMkzC,iBACpBhiD,MAAK27B,KAAK,aAAetqB,EAAa,QAAUqO,EAChD,IAAIisC,IAAiB1wD,EAAGoW,EAGpBm6C,GAAWnyB,MACXsyB,EAAA,EAAW78C,EAAMgzC,cACjB6J,EAAA,EAAWH,EAAWnyB,KAE1BsyB,EAAA,EAAWH,EAAWC,SACtBzrD,KAAKkrD,YAPQ,IAOYS,EAAK,SAAUriD,GACpC,GAAIsiD,GAAUtiD,EAAA,EACVywB,EAASzwB,EAAA,CAEbkvB,GAAqBqzB,sBAAsBD,EAAS98C,IAC5BsoB,EAAMqyB,SAASp4C,IAAe+lB,EAAMqyB,SAASp4C,GAAYqO,MAEvD8rC,IACtBp0B,EAAMuE,KAAK,kBAAmBryB,GACf,OAAXywB,GACA3C,EAAM00B,cAAcz6C,EAAYqO,GAEhC8rC,EAAWjyB,YACXiyB,EAAWjyB,WAAWQ,EAAQ6xB,OAU9CpzB,EAAqBqzB,sBAAwB,SAAUD,EAAS98C,GAC5D,GAAI88C,GAA8B,gBAAnB,KAAOA,EAAP,YAAAhtD,EAAOgtD,KAAwB7jD,EAAO0K,SAASm5C,EAAS,KAAM,CACzE,GAAIG,GAAWhkD,EAAOsX,QAAQusC,EAAS,IACvC,IAAIriD,MAAMC,QAAQuiD,KAAcA,EAAS9gD,QAAQ,YAAa,CAC1D,GAAI+gD,GAAY,gBACZl9C,EACKmxC,iBACAhK,WACA3nC,WACL,IACA29C,EAAYn9C,EAAME,KAAKV,UAC3BpG,GAAO0C,KAAK,wGACsCohD,EAAY,OACzDC,EAAY,sDAO7BzzB,EAAqBz9B,UAAU49B,iBAAmB,SAAUjX,GACxD1hB,KAAKuqD,WAAa7oC,EAClB1hB,KAAK27B,KAAK,wBACN37B,KAAKuqD,WACLvqD,KAAKksD,UAKDlsD,KAAK6pD,YACL7pD,KAAKkrD,YAAY,YAAc,cAGvClrD,KAAKmsD,uCAAuCzqC,IAMhD8W,EAAqBz9B,UAAUoxD,uCAAyC,SAAUC,IAGvDA,GAAoC,KAAtBA,EAAWrwD,QACxBoM,EAAOkkD,QAAQD,MACnCpsD,KAAK27B,KAAK,iEACV37B,KAAK+pD,mBAzMoB,MAgNjCvxB,EAAqBz9B,UAAUmxD,QAAU,WACrC,GAAI90B,GAAQp3B,IACZ,IAAIA,KAAK6pD,YAAc7pD,KAAKuqD,WAAY,CACpC,GAAI+B,GAAUtsD,KAAKuqD,WACfgC,EAAapkD,EAAOqkD,cAAcF,GAAW,OAAS,QACtDG,GAAgB5tC,KAAMytC,EACC,QAAvBtsD,KAAKspD,cACLmD,EAAA,QAAwB,EAEW,WAA9B7tD,EAAOoB,KAAKspD,iBACjBmD,EAAA,QAAyBzsD,KAAKspD,eAElCtpD,KAAKkrD,YAAYqB,EAAYE,EAAa,SAAU7/B,GAChD,GAAImN,GAASnN,EAAA,EACTvhB,EAAOuhB,EAAA,GAAY,OACnBwK,GAAMmzB,aAAe+B,IACN,OAAXvyB,EACA3C,EAAMqzB,uBAAyB,EAI/BrzB,EAAMs1B,eAAe3yB,EAAQ1uB,QASjDmtB,EAAqBz9B,UAAUm/B,SAAW,SAAUprB,EAAOuqB,GACvD,GAAIhoB,GAAavC,EAAME,KAAKV,WACxBoR,EAAU5Q,EAAMkzC,iBACpBhiD,MAAK27B,KAAK,uBAAyBtqB,EAAa,IAAMqO,GACtDzX,EAAO+B,OAAO8E,EAAMmxC,iBAAiBsL,cAChCz8C,EAAMmxC,iBAAiBwH,eAAgB,wDAC/BznD,KAAK8rD,cAAcz6C,EAAYqO,IAC9B1f,KAAK6pD,YACf7pD,KAAK2sD,cAAct7C,EAAYqO,EAAS5Q,EAAMgzC,cAAezoB,IAGrEb,EAAqBz9B,UAAU4xD,cAAgB,SAAUt7C,EAAYqO,EAASktC,EAAUvzB,GACpFr5B,KAAK27B,KAAK,eAAiBtqB,EAAa,QAAUqO,EAClD,IAAIisC,IAAiB1wD,EAAGoW,EAGpBgoB,KACAsyB,EAAA,EAAWiB,EACXjB,EAAA,EAAWtyB,GAEfr5B,KAAKkrD,YANQ,IAMYS,IAK7BnzB,EAAqBz9B,UAAUwiC,gBAAkB,SAAUlsB,EAAYhG,EAAMkuB,GACrEv5B,KAAK6pD,WACL7pD,KAAK6sD,kBAAkB,IAAKx7C,EAAYhG,EAAMkuB,GAG9Cv5B,KAAK4pD,0BAA0B3tD,MAC3BoV,WAAYA,EACZkI,OAAQ,IACRlO,KAAMA,EACNkuB,WAAYA,KAOxBf,EAAqBz9B,UAAU4iC,kBAAoB,SAAUtsB,EAAYhG,EAAMkuB,GACvEv5B,KAAK6pD,WACL7pD,KAAK6sD,kBAAkB,KAAMx7C,EAAYhG,EAAMkuB,GAG/Cv5B,KAAK4pD,0BAA0B3tD,MAC3BoV,WAAYA,EACZkI,OAAQ,KACRlO,KAAMA,EACNkuB,WAAYA,KAOxBf,EAAqBz9B,UAAUqiC,mBAAqB,SAAU/rB,EAAYkoB,GAClEv5B,KAAK6pD,WACL7pD,KAAK6sD,kBAAkB,KAAMx7C,EAAY,KAAMkoB,GAG/Cv5B,KAAK4pD,0BAA0B3tD,MAC3BoV,WAAYA,EACZkI,OAAQ,KACRlO,KAAM,KACNkuB,WAAYA,KAIxBf,EAAqBz9B,UAAU8xD,kBAAoB,SAAUtzC,EAAQlI,EAAYhG,EAAMkuB,GACnF,GAAIuzB,IAAqB7xD,EAAGoW,EAAqBnX,EAAGmR,EACpDrL,MAAK27B,KAAK,gBAAkBpiB,EAAQuzC,GACpC9sD,KAAKkrD,YAAY3xC,EAAQuzC,EAAS,SAAUC,GACpCxzB,GACA9xB,WAAW,WACP8xB,EAAWwzB,EAAA,EAAeA,EAAA,IAC3B/gD,KAAKC,MAAM,OAO1BusB,EAAqBz9B,UAAUmhC,IAAM,SAAU7qB,EAAYhG,EAAMkuB,EAAYhhB,GACzEvY,KAAKgtD,YAAY,IAAK37C,EAAYhG,EAAMkuB,EAAYhhB,IAKxDigB,EAAqBz9B,UAAUmM,MAAQ,SAAUmK,EAAYhG,EAAMkuB,EAAYhhB,GAC3EvY,KAAKgtD,YAAY,IAAK37C,EAAYhG,EAAMkuB,EAAYhhB,IAExDigB,EAAqBz9B,UAAUiyD,YAAc,SAAUzzC,EAAQlI,EAAYhG,EAAMkuB,EAAYhhB,GACzF,GAAIu0C,IACS7xD,EAAGoW,EACHnX,EAAGmR,OAEHlP,KAAToc,IACAu0C,EAAA,EAAev0C,GAEnBvY,KAAK0pD,iBAAiBztD,MAClBsd,OAAQA,EACRuzC,QAASA,EACTvzB,WAAYA,IAEhBv5B,KAAK2pD,sBACL,IAAI/wC,GAAQ5Y,KAAK0pD,iBAAiB3tD,OAAS,CACvCiE,MAAK6pD,WACL7pD,KAAKitD,SAASr0C,GAGd5Y,KAAK27B,KAAK,kBAAoBtqB,IAGtCmnB,EAAqBz9B,UAAUkyD,SAAW,SAAUr0C,GAChD,GAAIwe,GAAQp3B,KACRuZ,EAASvZ,KAAK0pD,iBAAiB9wC,GAAOW,OACtCuzC,EAAU9sD,KAAK0pD,iBAAiB9wC,GAAOk0C,QACvCvzB,EAAav5B,KAAK0pD,iBAAiB9wC,GAAO2gB,UAC9Cv5B,MAAK0pD,iBAAiB9wC,GAAOs0C,OAASltD,KAAK6pD,WAC3C7pD,KAAKkrD,YAAY3xC,EAAQuzC,EAAS,SAAUxjD,GACxC8tB,EAAMuE,KAAKpiB,EAAS,YAAajQ,SAC1B8tB,GAAMsyB,iBAAiB9wC,GAC9Bwe,EAAMuyB,uBAE6B,IAA/BvyB,EAAMuyB,uBACNvyB,EAAMsyB,qBAENnwB,GACAA,EAAWjwB,EAAA,EAAcA,EAAA,MAMrCkvB,EAAqBz9B,UAAUoyD,YAAc,SAAU/uB,GACnD,GAAIhH,GAAQp3B,IAEZ,IAAIA,KAAK6pD,WAAY,CACjB,GAAIiD,IAAyB7yD,EAAGmkC,EAChCp+B,MAAK27B,KAAK,cAAemxB,GACzB9sD,KAAKkrD,YAAsB,IAAK4B,EAAS,SAAUv4B,GAE/C,GAAe,OADFA,EAAA,EACQ,CACjB,GAAI4H,GAAc5H,EAAA,CAClB6C,GAAMuE,KAAK,cAAe,wBAA0BQ,QASpE3D,EAAqBz9B,UAAUqyD,eAAiB,SAAU9jD,GACtD,GAAI,KAAOA,GAAS,CAEhBtJ,KAAK27B,KAAK,gBAAkB3zB,EAAO0B,UAAUJ,GAC7C,IAAI+jD,GAAS/jD,EAAA,EACT6hD,EAAanrD,KAAKoqD,eAAeiD,EACjClC,WACOnrD,MAAKoqD,eAAeiD,GAC3BlC,EAAW7hD,EAAA,QAGd,IAAI,SAAWA,GAChB,KAAM,qCAAuCA,EAAA,KAExC,MAAOA,IAEZtJ,KAAKstD,YAAYhkD,EAAA,EAAcA,EAAA,KAGvCkvB,EAAqBz9B,UAAUuyD,YAAc,SAAU/zC,EAAQxN,GAC3D/L,KAAK27B,KAAK,sBAAuBpiB,EAAQxN,GAC1B,MAAXwN,EACAvZ,KAAKq4B,cAActsB,EAAA,EAAWA,EAAA,GAClB,EAAOA,EAAA,GACH,MAAXwN,EACLvZ,KAAKq4B,cAActsB,EAAA,EAAWA,EAAA,GACjB,EAAMA,EAAA,GACH,MAAXwN,EACLvZ,KAAKutD,iBAAiBxhD,EAAA,EAAWA,EAAA,GACjB,OAAXwN,EACLvZ,KAAK0sD,eAAe3gD,EAAA,EAAWA,EAAA,GACf,OAAXwN,EACLvZ,KAAKwtD,uBAAuBzhD,GAE5B7D,EAAOuC,MAAM,6CACTzC,EAAO0B,UAAU6P,GACjB,uCAEZif,EAAqBz9B,UAAU0yD,SAAW,SAAUzsC,EAAW0sC,GAC3D1tD,KAAK27B,KAAK,oBACV37B,KAAK6pD,YAAa,EAClB7pD,KAAK4qD,gCAAiC,GAAIzqC,OAAOC,UACjDpgB,KAAK2tD,iBAAiB3sC,GACtBhhB,KAAKiqD,cAAgByD,EACjB1tD,KAAK0qD,kBACL1qD,KAAK4tD,oBAET5tD,KAAK6tD,gBACL7tD,KAAK0qD,kBAAmB,EACxB1qD,KAAKs4B,kBAAiB,IAE1BE,EAAqBz9B,UAAU8vD,iBAAmB,SAAUh7C,GACxD,GAAIunB,GAAQp3B,IACZiI,GAAO+B,QAAQhK,KAAKsqD,UAAW,0DAC3BtqD,KAAKkqD,2BACLv8B,aAAa3tB,KAAKkqD,2BAItBlqD,KAAKkqD,0BAA4BziD,WAAW,WACxC2vB,EAAM8yB,0BAA4B,KAClC9yB,EAAM02B,wBACP9hD,KAAKC,MAAM4D,KAMlB2oB,EAAqBz9B,UAAUgwD,WAAa,SAAUgD,GAE9CA,IACC/tD,KAAKmqD,UACNnqD,KAAK8pD,kBAAoB9pD,KAAK+pD,qBAC9B/pD,KAAK27B,KAAK,2CACV37B,KAAK8pD,gBAAkBX,EAClBnpD,KAAKsqD,WACNtqD,KAAK6qD,iBAAiB,IAG9B7qD,KAAKmqD,SAAW4D,GAEpBv1B,EAAqBz9B,UAAUkwD,UAAY,SAAU+C,GAC7CA,GACAhuD,KAAK27B,KAAK,wBACV37B,KAAK8pD,gBAAkBX,EAClBnpD,KAAKsqD,WACNtqD,KAAK6qD,iBAAiB,KAI1B7qD,KAAK27B,KAAK,8CACN37B,KAAKsqD,WACLtqD,KAAKsqD,UAAU3jB,UAI3BnO,EAAqBz9B,UAAUkzD,sBAAwB,WAQnD,GAPAjuD,KAAK27B,KAAK,4BACV37B,KAAK6pD,YAAa,EAClB7pD,KAAKsqD,UAAY,KAEjBtqD,KAAKkuD,0BAELluD,KAAKoqD,kBACDpqD,KAAKmuD,mBAAoB,CACzB,GAAKnuD,KAAKmqD,UAKL,GAAInqD,KAAK4qD,+BAAgC,CAE1C,GAAIwD,IAAgC,GAAIjuC,OAAOC,UAAYpgB,KAAK4qD,8BAC5DwD,GAxfgB,MAyfhBpuD,KAAK8pD,gBAAkBX,GAC3BnpD,KAAK4qD,+BAAiC,UATtC5qD,MAAK27B,KAAK,8CACV37B,KAAK8pD,gBAAkB9pD,KAAK+pD,mBAC5B/pD,KAAK2qD,4BAA6B,GAAIxqC,OAAOC,SASjD,IAAIiuC,IAA8B,GAAIluC,OAAOC,UAAYpgB,KAAK2qD,2BAC1D2D,EAAiBtiD,KAAK8G,IAAI,EAAG9S,KAAK8pD,gBAAkBuE,EACxDC,GAAiBtiD,KAAK8e,SAAWwjC,EACjCtuD,KAAK27B,KAAK,0BAA4B2yB,EAAiB,MACvDtuD,KAAK6qD,iBAAiByD,GAEtBtuD,KAAK8pD,gBAAkB99C,KAAKpJ,IAAI5C,KAAK+pD,mBAngBhB,IAmgBoC/pD,KAAK8pD,iBAElE9pD,KAAKs4B,kBAAiB,IAE1BE,EAAqBz9B,UAAU+yD,qBAAuB,WAClD,GAAI9tD,KAAKmuD,mBAAoB,CACzBnuD,KAAK27B,KAAK,+BACV37B,KAAK2qD,4BAA6B,GAAIxqC,OAAOC,UAC7CpgB,KAAK4qD,+BAAiC,IACtC,IAAI2D,GAAkBvuD,KAAKotD,eAAe5lD,KAAKxH,MAC3CwuD,EAAYxuD,KAAKytD,SAASjmD,KAAKxH,MAC/BuwC,EAAiBvwC,KAAKiuD,sBAAsBzmD,KAAKxH,MACjDyuD,EAAWzuD,KAAKwI,GAAK,IAAMgwB,EAAqBk2B,oBAChDpJ,EAAStlD,KACT2uD,EAAkB3uD,KAAKiqD,cACvB2E,GAAa,EACbC,EAAe,KACfC,EAAY,WACRD,EACAA,EAAaloB,SAGbioB,GAAa,EACbre,MAGJwe,EAAgB,SAAU1D,GAC1BpjD,EAAO+B,OAAO6kD,EAAc,0DAC5BA,EAAa3D,YAAYG,GAE7BrrD,MAAKsqD,WACD3jB,MAAOmoB,EACP5D,YAAa6D,EAEjB,IAAIC,GAAehvD,KAAKwqD,kBACxBxqD,MAAKwqD,oBAAqB,EAE1BxqD,KAAKqpD,mBACA4F,SAASD,GACTznD,KAAK,SAAUgtB,GACXq6B,EAUD1mD,EAAOgC,IAAI,0CATXhC,EAAOgC,IAAI,8CACXo7C,EAAOiF,WAAah2B,GAAUA,EAAO26B,YACrCL,EAAe,GAAI5F,GAAakG,WAAWV,EAAUnJ,EAAOruB,UAAWs3B,EAAiBC,EAAWje,EACrF,SAAUxhC,GACpB7G,EAAO0C,KAAKmE,EAAS,KAAOu2C,EAAOruB,UAAU3oB,WAAa,KAC1Dg3C,EAAOpnB,UA/iBI,gBAgjBZywB,MAMNpnD,KAAK,KAAM,SAAUkD,GACtB66C,EAAO3pB,KAAK,wBAA0BlxB,GACjCmkD,IACGxmD,EAAO+nC,UAAUE,YAIjBnoC,EAAO0C,KAAKH,GAEhBqkD,SAQhBt2B,EAAqBz9B,UAAUmjC,UAAY,SAAUnvB,GACjD7G,EAAOgC,IAAI,uCAAyC6E,GACpD/O,KAAKwpD,kBAAkBz6C,IAAU,EAC7B/O,KAAKsqD,UACLtqD,KAAKsqD,UAAU3jB,SAGX3mC,KAAKkqD,4BACLv8B,aAAa3tB,KAAKkqD,2BAClBlqD,KAAKkqD,0BAA4B,MAEjClqD,KAAK6pD,YACL7pD,KAAKiuD,0BAOjBz1B,EAAqBz9B,UAAUojC,OAAS,SAAUpvB,GAC9C7G,EAAOgC,IAAI,mCAAqC6E,SACzC/O,MAAKwpD,kBAAkBz6C,GAC1BhH,EAAO6J,QAAQ5R,KAAKwpD,qBACpBxpD,KAAK8pD,gBAAkBX,EAClBnpD,KAAKsqD,WACNtqD,KAAK6qD,iBAAiB,KAIlCryB,EAAqBz9B,UAAU4yD,iBAAmB,SAAU3sC,GACxD,GAAI6nC,GAAQ7nC,GAAY,GAAIb,OAAOC,SACnCpgB,MAAKy4B,qBAAsB22B,iBAAkBvG,KAEjDrwB,EAAqBz9B,UAAUmzD,wBAA0B,WACrD,IAAK,GAAIr0D,GAAI,EAAGA,EAAImG,KAAK0pD,iBAAiB3tD,OAAQlC,IAAK,CACnD,GAAIqiC,GAAMl8B,KAAK0pD,iBAAiB7vD,EAC5BqiC,IAAgB,KAAOA,GAAI4wB,SAAW5wB,EAAIgxB,SACtChxB,EAAI3C,YACJ2C,EAAI3C,WAAW,oBACZv5B,MAAK0pD,iBAAiB7vD,GAC7BmG,KAAK2pD,wBAIqB,IAA9B3pD,KAAK2pD,uBACL3pD,KAAK0pD,sBAOblxB,EAAqBz9B,UAAUwyD,iBAAmB,SAAUl8C,EAAYvC,GAEpE,GAAI4Q,EAKAA,GAJC5Q,EAISA,EAAM0B,IAAI,SAAU6+C,GAAK,MAAOnnD,GAAO0E,kBAAkByiD,KAAOphD,KAAK,KAHrE,SAKd,IAAI6rB,GAAS95B,KAAK8rD,cAAcz6C,EAAYqO,EACxCoa,IAAUA,EAAOP,YACjBO,EAAOP,WAAW,sBAQ1Bf,EAAqBz9B,UAAU+wD,cAAgB,SAAUz6C,EAAYqO,GACjE,GACIoa,GADAw1B,EAAuB,GAAI7yC,GAAO/L,KAAKW,GAAY/C,UAavD,YAX4CnS,KAAxC6D,KAAKypD,SAAS6F,IACdx1B,EAAS95B,KAAKypD,SAAS6F,GAAsB5vC,SACtC1f,MAAKypD,SAAS6F,GAAsB5vC,GACkB,IAAzD3X,EAAOwzC,SAASv7C,KAAKypD,SAAS6F,WACvBtvD,MAAKypD,SAAS6F,IAKzBx1B,MAAS39B,GAEN29B,GAEXtB,EAAqBz9B,UAAU2xD,eAAiB,SAAU6C,EAAYC,GAClEtnD,EAAOgC,IAAI,uBAAyBqlD,EAAa,IAAMC,GACvDxvD,KAAKuqD,WAAa,KAClBvqD,KAAKwqD,oBAAqB,EAC1BxqD,KAAKsqD,UAAU3jB,QACI,kBAAf4oB,GAAiD,sBAAfA,KAIlCvvD,KAAKyqD,wBArqBkB,IAwqBnBzqD,KAAK8pD,gBA7qBgB,IAgrBrB9pD,KAAKqpD,mBAAmBoG,0BAIpCj3B,EAAqBz9B,UAAUyyD,uBAAyB,SAAUzhD,GAC1D/L,KAAKgqD,uBACLhqD,KAAKgqD,uBAAuBj+C,GAGxB,OAASA,IAA2B,mBAAZ9B,UACxBA,QAAQC,IAAI,aAAe6B,EAAA,IAAY7M,QAAQ,KAAM,kBAIjEs5B,EAAqBz9B,UAAU8yD,cAAgB,WAC3C,GAAIz2B,GAAQp3B,IAEZA,MAAKksD,UAGLnkD,EAAOqF,QAAQpN,KAAKypD,SAAU,SAAUp4C,EAAYq+C,GAChD3nD,EAAOqF,QAAQsiD,EAAS,SAAUrzD,EAAKmvD,GACnCp0B,EAAMs0B,YAAYF,MAG1B,KAAK,GAAI3xD,GAAI,EAAGA,EAAImG,KAAK0pD,iBAAiB3tD,OAAQlC,IAC1CmG,KAAK0pD,iBAAiB7vD,IACtBmG,KAAKitD,SAASpzD,EAEtB,MAAOmG,KAAK4pD,0BAA0B7tD,QAAQ,CAC1C,GAAI+wD,GAAU9sD,KAAK4pD,0BAA0BjjC,OAC7C3mB,MAAK6sD,kBAAkBC,EAAQvzC,OAAQuzC,EAAQz7C,WAAYy7C,EAAQzhD,KAAMyhD,EAAQvzB,cAOzFf,EAAqBz9B,UAAU6yD,kBAAoB,WAC/C,GAAIxvB,MACAuxB,EAAa,IACbvnD,GAAO+nC,UAAUE,WACjBsf,EAAa,aAERvnD,EAAO+nC,UAAUC,cACtBuf,EAAa,QAEjBvxB,EAAM,OAASuxB,EAAa,IAAM7G,EAAMhhD,QAAQwoC,YAAYpxC,QAAQ,MAAO,MAAQ,EAC/EoJ,EAAOsnD,kBACPxxB,EAAM,qBAAuB,EAExB91B,EAAOunD,kBACZzxB,EAAM,yBAA2B,GAErCp+B,KAAKmtD,YAAY/uB,IAMrB5F,EAAqBz9B,UAAUozD,iBAAmB,WAC9C,GAAIH,GAAShF,EAAgBgC,cAAcnU,cAAciZ,iBACzD,OAAO/nD,GAAO6J,QAAQ5R,KAAKwpD,oBAAsBwE,GAKrDx1B,EAAqB+wB,4BAA8B,EAMnD/wB,EAAqBk2B,kBAAoB,EAClCl2B,GACT0wB,EAAgB6G,cAClBp2D,GAAQ6+B,qBAAuBA,GtGg6YzB,SAAU5+B,EAAQD,EAASH,GAEjC,YuGxraAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAI2M,GAASvO,EAAQ,GAKjBw2D,EAA8B,WAI9B,QAASA,GAAaC,GAClBjwD,KAAKiwD,eAAiBA,EACtBjwD,KAAKkwD,cACLnoD,EAAOiC,OAAOT,MAAMC,QAAQymD,IAAmBA,EAAel0D,OAAS,EAAG,8BA6C9E,MAtCAi0D,GAAaj1D,UAAUo1D,QAAU,SAAUjyC,GAEvC,IAAK,GADD9U,MACKC,EAAK,EAAGA,EAAKvN,UAAUC,OAAQsN,IACpCD,EAASC,EAAK,GAAKvN,UAAUuN,EAEjC,IAAIE,MAAMC,QAAQxJ,KAAKkwD,WAAWhyC,IAG9B,IAAK,GADDmR,GAAYrvB,KAAKkwD,WAAWhyC,GAAWthB,QAClC/C,EAAI,EAAGA,EAAIw1B,EAAUtzB,OAAQlC,IAClCw1B,EAAUx1B,GAAG8N,SAAS8B,MAAM4lB,EAAUx1B,GAAG4G,QAAS2I,IAI9D4mD,EAAaj1D,UAAU6zB,GAAK,SAAU1Q,EAAWvW,EAAUlH,GACvDT,KAAKowD,mBAAmBlyC,GACxBle,KAAKkwD,WAAWhyC,GAAale,KAAKkwD,WAAWhyC,OAC7Cle,KAAKkwD,WAAWhyC,GAAWjiB,MAAO0L,SAAUA,EAAUlH,QAASA,GAC/D,IAAI4vD,GAAYrwD,KAAKswD,gBAAgBpyC,EACjCmyC,IACA1oD,EAAS8B,MAAMhJ,EAAS4vD,IAGhCL,EAAaj1D,UAAUg0B,IAAM,SAAU7Q,EAAWvW,EAAUlH,GACxDT,KAAKowD,mBAAmBlyC,EAExB,KAAK,GADDmR,GAAYrvB,KAAKkwD,WAAWhyC,OACvBrkB,EAAI,EAAGA,EAAIw1B,EAAUtzB,OAAQlC,IAClC,GAAIw1B,EAAUx1B,GAAG8N,WAAaA,KACxBlH,GAAWA,IAAY4uB,EAAUx1B,GAAG4G,SAEtC,WADA4uB,GAAU/qB,OAAOzK,EAAG,IAKhCm2D,EAAaj1D,UAAUq1D,mBAAqB,SAAUlyC,GAClDnW,EAAOiC,OAAOhK,KAAKiwD,eAAej0C,KAAK,SAAUu0C,GAC7C,MAAOA,KAAOryC,IACd,kBAAoBA,IAErB8xC,IAEXr2D,GAAQq2D,aAAeA,GvG+sajB,SAAUp2D,EAAQD,EAASH,GAEjC,YwG7waAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAI2M,GAASvO,EAAQ,GACjB6O,EAAY7O,EAAQ,IACpBqkD,EAAcrkD,EAAQ,IACtBg3D,EAAqBh3D,EAAQ,KA2B7B21D,EAA4B,WAU5B,QAASA,GAAW3mD,EAAIyuB,EAAWw5B,EAAYhD,EAAU91B,EAAe+4B,EAASzG,GAC7EjqD,KAAKwI,GAAKA,EACVxI,KAAKi3B,UAAYA,EACjBj3B,KAAKywD,WAAaA,EAClBzwD,KAAKytD,SAAWA,EAChBztD,KAAK23B,cAAgBA,EACrB33B,KAAK0wD,QAAUA,EACf1wD,KAAKiqD,cAAgBA,EACrBjqD,KAAK2wD,gBAAkB,EACvB3wD,KAAK4wD,uBACL5wD,KAAK6wD,OAAS,EACd7wD,KAAK27B,KAAO5zB,EAAOuC,WAAW,KAAOtK,KAAKwI,GAAK,KAC/CxI,KAAK8wD,kBAAoB,GAAIN,GAAmBO,iBAAiB95B,GACjEj3B,KAAK27B,KAAK,sBACV37B,KAAKgxD,SAiaT,MA3ZA7B,GAAWp0D,UAAUi2D,OAAS,WAC1B,GAAI55B,GAAQp3B,KACRixD,EAAOjxD,KAAK8wD,kBAAkBI,kBAClClxD,MAAKmxD,MAAQ,GAAIF,GAAKjxD,KAAKoxD,mBAAoBpxD,KAAKi3B,cAAW96B,GAAW6D,KAAKiqD,eAG/EjqD,KAAKqxD,0BAA4BJ,EAAA,8BAAwC,CACzE,IAAIK,GAAoBtxD,KAAKuxD,cAAcvxD,KAAKmxD,OAC5CK,EAAmBxxD,KAAKyxD,iBAAiBzxD,KAAKmxD,MAClDnxD,MAAK0xD,IAAM1xD,KAAKmxD,MAChBnxD,KAAK2xD,IAAM3xD,KAAKmxD,MAChBnxD,KAAK4xD,eAAiB,KACtB5xD,KAAK6xD,YAAa,EAOlBpqD,WAAW,WAEP2vB,EAAM+5B,OAAS/5B,EAAM+5B,MAAMW,KAAKR,EAAmBE,IACpDxlD,KAAKC,MAAM,GACd,IAAI8lD,GAAoBd,EAAA,gBAA0B,CAC9Cc,GAAoB,IACpB/xD,KAAKgyD,gBAAkBjqD,EAAO4H,sBAAsB,WAChDynB,EAAM46B,gBAAkB,KACnB56B,EAAMy6B,aACHz6B,EAAM+5B,OACN/5B,EAAM+5B,MAAMc,cA5EE,QA6Ed76B,EAAMuE,KAAK,wDACPvE,EAAM+5B,MAAMc,cACZ,wCACJ76B,EAAMy6B,YAAa,EACnBz6B,EAAM+5B,MAAMe,yBAEP96B,EAAM+5B,OACX/5B,EAAM+5B,MAAMgB,UArFF,MAsFV/6B,EAAMuE,KAAK,oDACPvE,EAAM+5B,MAAMgB,UACZ,uCAKJ/6B,EAAMuE,KAAK,+CACXvE,EAAMuP,WAGf36B,KAAKC,MAAM8lD,MAOtB5C,EAAWp0D,UAAUq2D,iBAAmB,WACpC,MAAO,KAAOpxD,KAAKwI,GAAK,IAAMxI,KAAK2wD,mBAEvCxB,EAAWp0D,UAAU02D,iBAAmB,SAAUR,GAC9C,GAAI75B,GAAQp3B,IACZ,OAAO,UAAUoyD,GACTnB,IAAS75B,EAAM+5B,MACf/5B,EAAMi7B,kBAAkBD,GAEnBnB,IAAS75B,EAAMw6B,gBACpBx6B,EAAMuE,KAAK,8BACXvE,EAAMk7B,8BAGNl7B,EAAMuE,KAAK,+BAIvBwzB,EAAWp0D,UAAUw2D,cAAgB,SAAUN,GAC3C,GAAI75B,GAAQp3B,IACZ,OAAO,UAAUsJ,GACO,GAAhB8tB,EAAMy5B,SACFI,IAAS75B,EAAMu6B,IACfv6B,EAAMm7B,0BAA0BjpD,GAE3B2nD,IAAS75B,EAAMw6B,eACpBx6B,EAAMo7B,4BAA4BlpD,GAGlC8tB,EAAMuE,KAAK,gCAS3BwzB,EAAWp0D,UAAUmwD,YAAc,SAAUuH,GAEzC,GAAIpH,IAAQ/kD,EAAG,IAAKpM,EAAGu4D,EACvBzyD,MAAK0yD,UAAUrH,IAEnB8D,EAAWp0D,UAAU43D,qBAAuB,WACpC3yD,KAAK0xD,MAAQ1xD,KAAK4xD,gBAAkB5xD,KAAK2xD,MAAQ3xD,KAAK4xD,iBACtD5xD,KAAK27B,KAAK,2CAA6C37B,KAAK4xD,eAAegB,QAC3E5yD,KAAKmxD,MAAQnxD,KAAK4xD,eAClB5xD,KAAK4xD,eAAiB,OAI9BzC,EAAWp0D,UAAU83D,oBAAsB,SAAUC,GACjD,GA1JW,KA0JSA,GAAa,CAC7B,GAAIC,GAAMD,EAAA,CArJL,OAsJDC,EACA/yD,KAAKgzD,6BA1JD,MA4JCD,GAEL/yD,KAAK27B,KAAK,wCACV37B,KAAK4xD,eAAejrB,QAEhB3mC,KAAK0xD,MAAQ1xD,KAAK4xD,gBAClB5xD,KAAK2xD,MAAQ3xD,KAAK4xD,gBAClB5xD,KAAK2mC,SAjKN,MAoKEosB,IACL/yD,KAAK27B,KAAK,0BACV37B,KAAKizD,8BACLjzD,KAAKgzD,gCAIjB7D,EAAWp0D,UAAUy3D,4BAA8B,SAAUU,GACzD,GAAIC,GAAQprD,EAAO4E,WAAW,IAAKumD,GAC/B7nD,EAAOtD,EAAO4E,WAAW,IAAKumD,EAClC,IAAa,KAATC,EACAnzD,KAAK6yD,oBAAoBxnD,OAExB,IAAa,KAAT8nD,EAKL,KAAM,IAAIxoD,OAAM,2BAA6BwoD,EAH7CnzD,MAAK4wD,oBAAoB30D,KAAKoP,KAMtC8jD,EAAWp0D,UAAUi4D,2BAA6B,WAC1ChzD,KAAKizD,6BAA+B,GACpCjzD,KAAK27B,KAAK,oCACV37B,KAAK6xD,YAAa,EAClB7xD,KAAK4xD,eAAeM,wBACpBlyD,KAAKozD,wBAILpzD,KAAK27B,KAAK,8BACV37B,KAAK4xD,eAAeyB,MAAO/sD,EAAG,IAAKpM,GAAKoM,EAhMzC,IAgMkDpM,UAGzDi1D,EAAWp0D,UAAUq4D,oBAAsB,WAEvCpzD,KAAK4xD,eAAe0B,QAEpBtzD,KAAK27B,KAAK,mCACV37B,KAAK4xD,eAAeyB,MAAO/sD,EAAG,IAAKpM,GAAKoM,EA1M/B,IA0M8CpM,QAGvD8F,KAAK27B,KAAK,kCACV37B,KAAKmxD,MAAMkC,MAAO/sD,EAAG,IAAKpM,GAAKoM,EA7MhB,IA6MqCpM,QACpD8F,KAAK0xD,IAAM1xD,KAAK4xD,eAChB5xD,KAAK2yD,wBAETxD,EAAWp0D,UAAUw3D,0BAA4B,SAAUW,GAEvD,GAAIC,GAAQprD,EAAO4E,WAAW,IAAKumD,GAC/B7nD,EAAOtD,EAAO4E,WAAW,IAAKumD,EACrB,MAATC,EACAnzD,KAAKuzD,WAAWloD,GAEF,KAAT8nD,GACLnzD,KAAKotD,eAAe/hD,IAG5B8jD,EAAWp0D,UAAUqyD,eAAiB,SAAU9jD,GAC5CtJ,KAAKwzD,qBAELxzD,KAAKywD,WAAWnnD,IAEpB6lD,EAAWp0D,UAAUy4D,mBAAqB,WACjCxzD,KAAK6xD,cACN7xD,KAAKqxD,2BACiC,IAClCrxD,KAAK27B,KAAK,kCACV37B,KAAK6xD,YAAa,EAClB7xD,KAAKmxD,MAAMe,0BAIvB/C,EAAWp0D,UAAUw4D,WAAa,SAAUT,GACxC,GAAIC,GAAMhrD,EAAO4E,WAnPN,IAmP+BmmD,EAC1C,IAnPW,KAmPSA,GAAa,CAC7B,GAAIlH,GAAUkH,EAAA,CACd,IA7OO,MA6OHC,EACA/yD,KAAKyzD,aAAa7H,OAEjB,IAlPM,MAkPFmH,EAA0B,CAC/B/yD,KAAK27B,KAAK,qCACV37B,KAAK2xD,IAAM3xD,KAAK4xD,cAChB,KAAK,GAAI/3D,GAAI,EAAGA,EAAImG,KAAK4wD,oBAAoB70D,SAAUlC,EACnDmG,KAAKotD,eAAeptD,KAAK4wD,oBAAoB/2D,GAEjDmG,MAAK4wD,uBACL5wD,KAAK2yD,2BA9PE,MAgQFI,EAGL/yD,KAAK0zD,sBAAsB9H,GAlQvB,MAoQCmH,EAEL/yD,KAAK2zD,SAAS/H,GArQV,MAuQCmH,EACLhrD,EAAO0C,MAAM,iBAAmBmhD,GAvQ7B,MAyQEmH,GACL/yD,KAAK27B,KAAK,wBACV37B,KAAKwzD,qBACLxzD,KAAK4zD,iCAGL7rD,EAAO0C,MAAM,mCAAqCsoD,KAS9D5D,EAAWp0D,UAAU04D,aAAe,SAAUI,GAC1C,GAAI7yC,GAAY6yC,EAAUC,GACtBplC,EAAUmlC,EAAUrmD,EACpBkR,EAAOm1C,EAAUv4D,CACrB0E,MAAK0tD,UAAYmG,EAAU34D,EAC3B8E,KAAKi3B,UAAUmnB,WAAW1/B,GAEP,GAAf1e,KAAK6wD,SACL7wD,KAAKmxD,MAAMmC,QACXtzD,KAAK+zD,yBAAyB/zD,KAAKmxD,MAAOnwC,GACtC68B,EAAYlrB,mBAAqBjE,GACjC3mB,EAAO6C,KAAK,sCAGhB5K,KAAKg0D,qBAGb7E,EAAWp0D,UAAUi5D,iBAAmB,WACpC,GAAI/C,GAAOjxD,KAAK8wD,kBAAkBmD,kBAC9BhD,IACAjxD,KAAKk0D,cAAcjD,IAG3B9B,EAAWp0D,UAAUm5D,cAAgB,SAAUjD,GAC3C,GAAI75B,GAAQp3B,IACZA,MAAK4xD,eAAiB,GAAIX,GAAKjxD,KAAKoxD,mBAAoBpxD,KAAKi3B,UAAWj3B,KAAK0tD,WAG7E1tD,KAAKizD,4BACDhC,EAAA,8BAAwC,CAC5C,IAAIkD,GAAYn0D,KAAKuxD,cAAcvxD,KAAK4xD,gBACpCjf,EAAe3yC,KAAKyxD,iBAAiBzxD,KAAK4xD,eAC9C5xD,MAAK4xD,eAAeE,KAAKqC,EAAWxhB,GAEpC5qC,EAAO4H,sBAAsB,WACrBynB,EAAMw6B,iBACNx6B,EAAMuE,KAAK,gCACXvE,EAAMw6B,eAAejrB,UAE1B36B,KAAKC,MA7UM,OA+UlBkjD,EAAWp0D,UAAU44D,SAAW,SAAUj1C,GACtC1e,KAAK27B,KAAK,qCAAuCjd,GACjD1e,KAAKi3B,UAAUmnB,WAAW1/B,GAGN,IAAhB1e,KAAK6wD,OACL7wD,KAAK2mC,SAIL3mC,KAAKo0D,oBACLp0D,KAAKgxD,WAGb7B,EAAWp0D,UAAUg5D,yBAA2B,SAAU9C,EAAMjwC,GAC5D,GAAIoW,GAAQp3B,IACZA,MAAK27B,KAAK,oCACV37B,KAAKmxD,MAAQF,EACbjxD,KAAK6wD,OAAS,EACV7wD,KAAKytD,WACLztD,KAAKytD,SAASzsC,EAAWhhB,KAAK0tD,WAC9B1tD,KAAKytD,SAAW,MAImB,IAAnCztD,KAAKqxD,2BACLrxD,KAAK27B,KAAK,kCACV37B,KAAK6xD,YAAa,GAGlB9pD,EAAO4H,sBAAsB,WACzBynB,EAAMw8B,iCACP5nD,KAAKC,MA5WsB,OA+WtCkjD,EAAWp0D,UAAU64D,8BAAgC,WAE5C5zD,KAAK6xD,YAA8B,IAAhB7xD,KAAK6wD,SACzB7wD,KAAK27B,KAAK,4BACV37B,KAAK0yD,WAAYpsD,EAAG,IAAKpM,GAAKoM,EArW/B,IAqWwCpM,UAG/Ci1D,EAAWp0D,UAAUu3D,2BAA6B,WAC9C,GAAIrB,GAAOjxD,KAAK4xD,cAChB5xD,MAAK4xD,eAAiB,KAClB5xD,KAAK0xD,MAAQT,GAAQjxD,KAAK2xD,MAAQV,GAElCjxD,KAAK2mC,SASbwoB,EAAWp0D,UAAUs3D,kBAAoB,SAAUD,GAC/CpyD,KAAKmxD,MAAQ,KAGRiB,GAAiC,IAAhBpyD,KAAK6wD,OASF,IAAhB7wD,KAAK6wD,QACV7wD,KAAK27B,KAAK,8BATV37B,KAAK27B,KAAK,+BAEN37B,KAAKi3B,UAAUgnB,oBACf51C,EAAUqqB,kBAAkBroB,OAAO,QAAUrK,KAAKi3B,UAAUvY,MAE5D1e,KAAKi3B,UAAU8mB,aAAe/9C,KAAKi3B,UAAUvY,OAMrD1e,KAAK2mC,SAOTwoB,EAAWp0D,UAAU24D,sBAAwB,SAAU3kD,GACnD/O,KAAK27B,KAAK,0DACN37B,KAAK0wD,UACL1wD,KAAK0wD,QAAQ3hD,GACb/O,KAAK0wD,QAAU,MAInB1wD,KAAK23B,cAAgB,KACrB33B,KAAK2mC,SAETwoB,EAAWp0D,UAAU23D,UAAY,SAAUrnD,GACvC,GAAoB,IAAhBrL,KAAK6wD,OACL,KAAM,6BAGN7wD,MAAK0xD,IAAI2B,KAAKhoD,IAMtB8jD,EAAWp0D,UAAU4rC,MAAQ,WACL,IAAhB3mC,KAAK6wD,SACL7wD,KAAK27B,KAAK,gCACV37B,KAAK6wD,OAAS,EACd7wD,KAAKo0D,oBACDp0D,KAAK23B,gBACL33B,KAAK23B,gBACL33B,KAAK23B,cAAgB,QAQjCw3B,EAAWp0D,UAAUq5D,kBAAoB,WACrCp0D,KAAK27B,KAAK,iCACN37B,KAAKmxD,QACLnxD,KAAKmxD,MAAMxqB,QACX3mC,KAAKmxD,MAAQ,MAEbnxD,KAAK4xD,iBACL5xD,KAAK4xD,eAAejrB,QACpB3mC,KAAK4xD,eAAiB,MAEtB5xD,KAAKgyD,kBACLrkC,aAAa3tB,KAAKgyD,iBAClBhyD,KAAKgyD,gBAAkB,OAGxB7C,IAEXx1D,GAAQw1D,WAAaA,GxGuwaf,SAAUv1D,EAAQD,EAASH,GAEjC,YyGnubAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAI2M,GAASvO,EAAQ,GACjB2rD,EAAe3rD,EAAQ,IACvBi9B,EAAiBj9B,EAAQ,IACzB66D,EAAmB76D,EAAQ,KAC3BqkD,EAAcrkD,EAAQ,IACtBwO,EAASxO,EAAQ,GACjByO,EAASzO,EAAQ,EAErBG,GAAQ26D,8BAAgC,QACxC36D,EAAQ46D,gCAAkC,QAC1C56D,EAAQ66D,kCAAoC,aAC5C76D,EAAQ86D,+BAAiC,UACzC96D,EAAQ+6D,2BAA6B,KACrC/6D,EAAQg7D,2BAA6B,KACrCh7D,EAAQi7D,+BAAiC,MACzCj7D,EAAQk7D,oCAAsC,KAC9Cl7D,EAAQm7D,oCAAsC,MAC9Cn7D,EAAQo7D,qCAAuC,KAC/Cp7D,EAAQq7D,6BAA+B,IACvCr7D,EAAQs7D,sCAAwC,UAChDt7D,EAAQu7D,8CAAgD,QAIxD,IAuBIC,GAAuC,WASvC,QAASA,GAAsBvC,EAAQn0C,EAAU22C,EAAoBnL,GACjEjqD,KAAK4yD,OAASA,EACd5yD,KAAKye,SAAWA,EAChBze,KAAKo1D,mBAAqBA,EAC1Bp1D,KAAKiqD,cAAgBA,EACrBjqD,KAAKmyD,UAAY,EACjBnyD,KAAKiyD,cAAgB,EACrBjyD,KAAKq1D,gBAAiB,EACtBr1D,KAAK27B,KAAO5zB,EAAOuC,WAAWsoD,GAC9B5yD,KAAKg4B,OAASvB,EAAewB,aAAaC,cAAczZ,GACxDze,KAAKs1D,MAAQ,SAAU/W,GACnB,MAAO9/B,GAAS6/B,cAAcT,EAAY1qB,aAAcorB,IAsOhE,MA9NA4W,GAAsBp6D,UAAU+2D,KAAO,SAAUqC,EAAWxhB,GACxD,GAAIvb,GAAQp3B,IACZA,MAAKu1D,cAAgB,EACrBv1D,KAAK23B,cAAgBgb,EACrB3yC,KAAKw1D,gBAAkB,GAAInB,GAAiBoB,eAAetB,GAC3Dn0D,KAAK01D,WAAY,EACjB11D,KAAK21D,qBAAuBluD,WAAW,WACnC2vB,EAAMuE,KAAK,gCAEXvE,EAAMw+B,YACNx+B,EAAMu+B,qBAAuB,MAC9B3pD,KAAKC,MA9CS,MAgDjBlE,EAAO0D,oBAAoB,WACvB,IAAI2rB,EAAMs+B,UAAV,CAGAt+B,EAAMy+B,gBAAkB,GAAIC,GAA2B,WAEnD,IAAK,GADDnpC,MACKtjB,EAAK,EAAGA,EAAKvN,UAAUC,OAAQsN,IACpCsjB,EAAKtjB,GAAMvN,UAAUuN,EAEzB,IAAI0sD,GAAUppC,EAAK,GAAIqpC,EAAOrpC,EAAK,GAAIspC,EAAOtpC,EAAK,EAAWA,GAAK,GAAWA,EAAK,EAEnF,IADAyK,EAAM8+B,wBAAwBvpC,GACzByK,EAAMy+B,gBAOX,GALIz+B,EAAMu+B,uBACNhoC,aAAayJ,EAAMu+B,sBACnBv+B,EAAMu+B,qBAAuB,MAEjCv+B,EAAMi+B,gBAAiB,EACnBU,GAAWp8D,EAAQ26D,8BACnBl9B,EAAM5uB,GAAKwtD,EACX5+B,EAAM++B,SAAWF,MAEhB,IAAIF,IAAYp8D,EAAQ46D,gCAiBzB,KAAM,IAAI5pD,OAAM,kCAAoCorD,EAfhDC,IAGA5+B,EAAMy+B,gBAAgBO,cAAe,EAGrCh/B,EAAMo+B,gBAAgBa,WAAWL,EAAM,WACnC5+B,EAAMw+B,eAIVx+B,EAAMw+B,cAMf,WAEC,IAAK,GADDjpC,MACKtjB,EAAK,EAAGA,EAAKvN,UAAUC,OAAQsN,IACpCsjB,EAAKtjB,GAAMvN,UAAUuN,EAEzB,IAAIitD,GAAK3pC,EAAK,GAAIthB,EAAOshB,EAAK,EAC9ByK,GAAM8+B,wBAAwBvpC,GAC9ByK,EAAMo+B,gBAAgBe,eAAeD,EAAIjrD,IAC1C,WACC+rB,EAAMw+B,aACPx+B,EAAMk+B,MAGT,IAAIkB,KACJA,GAAU78D,EAAQ26D,+BAAiC,IACnDkC,EAAU78D,EAAQi7D,gCAAkC5oD,KAAKC,MAAsB,IAAhBD,KAAK8e,UAChEsM,EAAMy+B,gBAAgBY,2BACtBD,EAAU78D,EAAQk7D,qCAAuCz9B,EAAMy+B,gBAAgBY,0BACnFD,EAAU3Y,EAAYjrB,eAAiBirB,EAAYlrB,iBAC/CyE,EAAMg+B,qBACNoB,EAAU3Y,EAAYhrB,yBAA2BuE,EAAMg+B,oBAEvDh+B,EAAM6yB,gBACNuM,EAAU3Y,EAAY5qB,oBAAsBmE,EAAM6yB,gBAEjDhiD,EAAO0D,aACY,mBAAbZ,WACPA,SAASyD,OAC4C,IAArDzD,SAASyD,KAAKvD,QAAQ4yC,EAAY7qB,gBAClCwjC,EAAU3Y,EAAY/qB,eAAiB+qB,EAAY9qB,UAEvD,IAAI2jC,GAAat/B,EAAMk+B,MAAMkB,EAC7Bp/B,GAAMuE,KAAK,+BAAiC+6B,GAC5Ct/B,EAAMy+B,gBAAgBc,OAAOD,EAAY,kBAQjDvB,EAAsBp6D,UAAUu4D,MAAQ,WACpCtzD,KAAK61D,gBAAgBe,cAAc52D,KAAKwI,GAAIxI,KAAKm2D,UACjDn2D,KAAK62D,uBAAuB72D,KAAKwI,GAAIxI,KAAKm2D,WAK9ChB,EAAsB2B,WAAa,WAC/B3B,EAAsB4B,aAAc,GAKxC5B,EAAsB6B,cAAgB,WAClC7B,EAAsB8B,gBAAiB,GAG3C9B,EAAsB+B,YAAc,WAGhC,MAAQ/B,GAAsB4B,cACxB5B,EAAsB8B,gBACA,mBAAb/4D,WACmB,MAA1BA,SAASE,gBACR2J,EAAOwG,mCACPxG,EAAO0G,sBACPxG,EAAO0D,aAKpBwpD,EAAsBp6D,UAAUm3D,sBAAwB,aAKxDiD,EAAsBp6D,UAAUo8D,UAAY,WACxCn3D,KAAK01D,WAAY,EACb11D,KAAK61D,kBACL71D,KAAK61D,gBAAgBlvB,QACrB3mC,KAAK61D,gBAAkB,MAGvB71D,KAAKo3D,iBACLl5D,SAAS6N,KAAKxN,YAAYyB,KAAKo3D,gBAC/Bp3D,KAAKo3D,eAAiB,MAEtBp3D,KAAK21D,uBACLhoC,aAAa3tB,KAAK21D,sBAClB31D,KAAK21D,qBAAuB,OAOpCR,EAAsBp6D,UAAU66D,UAAY,WACnC51D,KAAK01D,YACN11D,KAAK27B,KAAK,8BACV37B,KAAKm3D,YACDn3D,KAAK23B,gBACL33B,KAAK23B,cAAc33B,KAAKq1D,gBACxBr1D,KAAK23B,cAAgB,QAQjCw9B,EAAsBp6D,UAAU4rC,MAAQ,WAC/B3mC,KAAK01D,YACN11D,KAAK27B,KAAK,6BACV37B,KAAKm3D,cAQbhC,EAAsBp6D,UAAUs4D,KAAO,SAAUhoD,GAC7C,GAAIgsD,GAAUrvD,EAAO0B,UAAU2B,EAC/BrL,MAAKmyD,WAAakF,EAAQt7D,OAC1BiE,KAAKg4B,OAAO8G,iBAAiB,aAAcu4B,EAAQt7D,OAQnD,KAAK,GANDu7D,GAAatvD,EAAOgzC,aAAaqc,GAGjCnqD,EAAWnF,EAAOiF,kBAAkBsqD,EAzOzBC,MA4ON19D,EAAI,EAAGA,EAAIqT,EAASnR,OAAQlC,IACjCmG,KAAK61D,gBAAgB2B,eAAex3D,KAAKu1D,cAAeroD,EAASnR,OAAQmR,EAASrT,IAClFmG,KAAKu1D,iBAUbJ,EAAsBp6D,UAAU87D,uBAAyB,SAAUruD,EAAIivD,GACnE,IAAIxvD,EAAO0D,YAAX,CAEA3L,KAAKo3D,eAAiBl5D,SAASE,cAAc,SAC7C,IAAIo4D,KACJA,GAAU78D,EAAQu7D,+CAAiD,IACnEsB,EAAU78D,EAAQ+6D,4BAA8BlsD,EAChDguD,EAAU78D,EAAQg7D,4BAA8B8C,EAChDz3D,KAAKo3D,eAAeM,IAAM13D,KAAKs1D,MAAMkB,GACrCx2D,KAAKo3D,eAAe14D,MAAMi5D,QAAU,OACpCz5D,SAAS6N,KAAK7K,YAAYlB,KAAKo3D,kBAOnCjC,EAAsBp6D,UAAUm7D,wBAA0B,SAAUvpC,GAEhE,GAAIslC,GAAgBjqD,EAAO0B,UAAUijB,GAAM5wB,MAC3CiE,MAAKiyD,eAAiBA,EACtBjyD,KAAKg4B,OAAO8G,iBAAiB,iBAAkBmzB,IAE5CkD,IAEXx7D,GAAQw7D,sBAAwBA,CAKhC,IAAIW,GAA4C,WAO5C,QAASA,GAA2B8B,EAAWC,EAAallB,EAAc2iB,GAoBtE,GAnBAt1D,KAAK2yC,aAAeA,EACpB3yC,KAAKs1D,MAAQA,EAMbt1D,KAAK83D,oBAAsB,GAAI3S,GAAaC,WAE5CplD,KAAK+3D,eAML/3D,KAAKg4D,cAAgBhsD,KAAKC,MAAsB,IAAhBD,KAAK8e,UAGrC9qB,KAAKo2D,cAAe,EACfnuD,EAAO0D,YAkCR3L,KAAK43D,UAAYA,EACjB53D,KAAK63D,YAAcA,MAnCE,CAKrB73D,KAAKy2D,yBAA2B1uD,EAAOQ,gBACvCuC,OAAOnR,EAAQ66D,kCAAoCx0D,KAAKy2D,0BAA4BmB,EACpF9sD,OAAOnR,EAAQ86D,+BAAiCz0D,KAAKy2D,0BAA4BoB,EAEjF73D,KAAKi4D,SAAWnC,EAA2BoC,eAE3C,IAAIvvB,GAAS,EAGb,IAAI3oC,KAAKi4D,SAASP,KACwC,gBAAtD13D,KAAKi4D,SAASP,IAAIrpD,OAAO,EAAG,cAActS,QAA2B,CAErE4sC,EAAS,4BADWzqC,SAASmxC,OAC0B,eAE3D,GAAI8oB,GAAiB,eAAiBxvB,EAAS,gBAC/C,KACI3oC,KAAKi4D,SAAS3xC,IAAIwrC,OAClB9xD,KAAKi4D,SAAS3xC,IAAI8xC,MAAMD,GACxBn4D,KAAKi4D,SAAS3xC,IAAIqgB,QAEtB,MAAO5mC,GACHgI,EAAOmC,IAAI,2BACPnK,EAAE/D,OACF+L,EAAOmC,IAAInK,EAAE/D,OAEjB+L,EAAOmC,IAAInK,KAsPvB,MAxOA+1D,GAA2BoC,cAAgB,WACvC,GAAIG,GAASn6D,SAASE,cAAc,SAGpC,IAFAi6D,EAAO35D,MAAMi5D,QAAU,QAEnBz5D,SAAS6N,KAuBT,KAAM,mGAtBN7N,UAAS6N,KAAK7K,YAAYm3D,EAC1B,KAIYA,EAAOC,cAAcp6D,UAGzB6J,EAAOmC,IAAI,iCAGnB,MAAOnK,GACH,GAAIsvC,GAASnxC,SAASmxC,MACtBgpB,GAAOX,IACH,gEACIroB,EACA,2BAkBhB,MATIgpB,GAAOE,gBACPF,EAAO/xC,IAAM+xC,EAAOE,gBAEfF,EAAOC,cACZD,EAAO/xC,IAAM+xC,EAAOC,cAAcp6D,SAE7Bm6D,EAAOn6D,WACZm6D,EAAO/xC,IAAM+xC,EAAOn6D,UAEjBm6D,GAKXvC,EAA2B/6D,UAAU4rC,MAAQ,WACzC,GAAIvP,GAAQp3B,IAeZ,IAbAA,KAAKw4D,OAAQ,EACTx4D,KAAKi4D,WAILj4D,KAAKi4D,SAAS3xC,IAAIva,KAAKhN,UAAY,GACnC0I,WAAW,WACgB,OAAnB2vB,EAAM6gC,WACN/5D,SAAS6N,KAAKxN,YAAY64B,EAAM6gC,UAChC7gC,EAAM6gC,SAAW,OAEtBjsD,KAAKC,MAAM,KAEdhE,EAAO0D,aAAe3L,KAAKy4D,KAAM,CACjC,GAAIjC,KACJA,GAAU78D,EAAQs7D,uCAAyC,IAC3DuB,EAAU78D,EAAQ+6D,4BAA8B10D,KAAKy4D,KACrDjC,EAAU78D,EAAQg7D,4BAA8B30D,KAAK04D,IACrD,IAAIC,GAAS34D,KAAKs1D,MAAMkB,EACxBV,GAA2B8C,gBAAgBD,GAG/C,GAAIhmB,GAAe3yC,KAAK2yC,YACpBA,KACA3yC,KAAK2yC,aAAe,KACpBA,MAQRmjB,EAA2B/6D,UAAU67D,cAAgB,SAAUpuD,EAAIivD,GAK/D,IAJAz3D,KAAKy4D,KAAOjwD,EACZxI,KAAK04D,KAAOjB,EACZz3D,KAAKw4D,OAAQ,EAENx4D,KAAK64D,kBAShB/C,EAA2B/6D,UAAU89D,YAAc,WAI/C,GAAI74D,KAAKw4D,OACLx4D,KAAKo2D,cACLp2D,KAAK83D,oBAAoB//C,SAAW/X,KAAK+3D,YAAYh8D,OAAS,EAAI,EAAI,GAAI,CAE1EiE,KAAKg4D,eACL,IAAIxB,KACJA,GAAU78D,EAAQ+6D,4BAA8B10D,KAAKy4D,KACrDjC,EAAU78D,EAAQg7D,4BAA8B30D,KAAK04D,KACrDlC,EAAU78D,EAAQi7D,gCAAkC50D,KAAKg4D,aAKzD,KAJA,GAAIW,GAAS34D,KAAKs1D,MAAMkB,GAEpBsC,EAAgB,GAChBj/D,EAAI,EACDmG,KAAK+3D,YAAYh8D,OAAS,GAAG,CAGhC,KADciE,KAAK+3D,YAAY,GACnB79D,EAAE6B,OAhdR,GAgdmC+8D,EAAc/8D,QAjd/C,MAyeJ,KArBA,IAAIg9D,GAAS/4D,KAAK+3D,YAAYpxC,OAC9BmyC,GACIA,EACI,IACAn/D,EAAQm7D,oCACRj7D,EACA,IACAk/D,EAAOC,IACP,IACAr/D,EAAQo7D,qCACRl7D,EACA,IACAk/D,EAAOjF,GACP,IACAn6D,EAAQq7D,6BACRn7D,EACA,IACAk/D,EAAO7+D,EACfL,IAQR,MAFA8+D,IAAkBG,EAClB94D,KAAKi5D,gBAAgBN,EAAQ34D,KAAKg4D,gBAC3B,EAGP,OAAO,GASflC,EAA2B/6D,UAAUy8D,eAAiB,SAAU0B,EAAQC,EAAW9tD,GAE/ErL,KAAK+3D,YAAY97D,MAAO+8D,IAAKE,EAAQpF,GAAIqF,EAAWj/D,EAAGmR,IAGnDrL,KAAKw4D,OACLx4D,KAAK64D,eASb/C,EAA2B/6D,UAAUk+D,gBAAkB,SAAUhiB,EAAKmiB,GAClE,GAAIhiC,GAAQp3B,IAEZA,MAAK83D,oBAAoBzS,IAAI+T,EAAQ,EACrC,IAAIC,GAAe,WACfjiC,EAAM0gC,oBAAoBztD,OAAO+uD,GACjChiC,EAAMyhC,eAINS,EAAmB7xD,WAAW4xD,EAAcrtD,KAAKC,MAzgB5B,OA0gBrBstD,EAAe,WAEf5rC,aAAa2rC,GAEbD,IAEJr5D,MAAK22D,OAAO1f,EAAKsiB,IAOrBzD,EAA2B/6D,UAAU47D,OAAS,SAAU1f,EAAKuiB,GACzD,GAAIpiC,GAAQp3B,IACRiI,GAAO0D,YACP3L,KAAKy5D,eAAexiB,EAAKuiB,GAGzB/xD,WAAW,WACP,IAEI,IAAK2vB,EAAMg/B,aACP,MACJ,IAAIsD,GAActiC,EAAM6gC,SAAS3xC,IAAIloB,cAAc,SACnDs7D,GAAYz5D,KAAO,kBACnBy5D,EAAYn1B,OAAQ,EACpBm1B,EAAYhC,IAAMzgB,EAClByiB,EAAYC,OAASD,EAAY9wB,mBAAqB,WAClD,GAAIgxB,GAASF,EAAY9tD,UACpBguD,IAAqB,WAAXA,GAAkC,aAAXA,IAClCF,EAAYC,OAASD,EAAY9wB,mBAAqB,KAClD8wB,EAAYp7D,YACZo7D,EAAYp7D,WAAWC,YAAYm7D,GAEvCF,MAGRE,EAAYG,QAAU,WAClB9xD,EAAOmC,IAAI,oCAAsC+sC,GACjD7f,EAAMg/B,cAAe,EACrBh/B,EAAMuP,SAEVvP,EAAM6gC,SAAS3xC,IAAIva,KAAK7K,YAAYw4D,GAExC,MAAO35D,MAGRiM,KAAKC,MAAM,KAGf6pD,IAEXn8D,GAAQm8D,2BAA6BA,GzG8sb/B,SAAUl8D,EAAQD,EAASH,GAEjC,cAC4B,SAAS40B,G0GhycrC,QAAS0rC,GAAiBC,GACtBC,EAAgBD,EApBpBz/D,OAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAI0tD,GAAQtvD,EAAQ,IAChBuO,EAASvO,EAAQ,GACjBwO,EAASxO,EAAQ,GACjBi9B,EAAiBj9B,EAAQ,IACzBqkD,EAAcrkD,EAAQ,IACtByO,EAASzO,EAAQ,GACjB6O,EAAY7O,EAAQ,IACpB0O,EAAS1O,EAAQ,GACjB2O,EAAS3O,EAAQ,GAGjBwgE,EAAgB,IACQ,oBAAjBC,cACPD,EAAgBC,aAEU,mBAAdC,aACZF,EAAgBE,WAKpBvgE,EAAQmgE,iBAAmBA,CAM3B,IAAIK,GAAqC,WAQrC,QAASA,GAAoBvH,EAAQn0C,EAAU22C,EAAoBnL,GAC/DjqD,KAAK4yD,OAASA,EACd5yD,KAAKo6D,eAAiB,KACtBp6D,KAAKq6D,OAAS,KACdr6D,KAAKs6D,YAAc,EACnBt6D,KAAKmyD,UAAY,EACjBnyD,KAAKiyD,cAAgB,EACrBjyD,KAAK27B,KAAO3zB,EAAOsC,WAAWtK,KAAK4yD,QACnC5yD,KAAKg4B,OAASvB,EAAewB,aAAaC,cAAczZ,GACxDze,KAAKw+C,QAAU2b,EAAoBI,eAAe97C,EAAU22C,EAAoBnL,GA6RpF,MAnRAkQ,GAAoBI,eAAiB,SAAU97C,EAAU22C,EAAoBnL,GACzE,GAAIuM,KAcJ,OAbAA,GAAU3Y,EAAYjrB,eAAiBirB,EAAYlrB,kBAC9CxqB,EAAOwD,aACY,mBAAbZ,WACPA,SAASyD,OAC4C,IAArDzD,SAASyD,KAAKvD,QAAQ4yC,EAAY7qB,gBAClCwjC,EAAU3Y,EAAY/qB,eAAiB+qB,EAAY9qB,WAEnDqiC,IACAoB,EAAU3Y,EAAYhrB,yBAA2BuiC,GAEjDnL,IACAuM,EAAU3Y,EAAY5qB,oBAAsBg3B,GAEzCxrC,EAAS6/B,cAAcT,EAAY3qB,UAAWsjC,IAOzD2D,EAAoBp/D,UAAU+2D,KAAO,SAAUqC,EAAWxhB,GACtD,GAAIvb,GAAQp3B,IACZA,MAAK2yC,aAAeA,EACpB3yC,KAAKm0D,UAAYA,EACjBn0D,KAAK27B,KAAK,2BAA6B37B,KAAKw+C,SAC5Cx+C,KAAKq1D,gBAAiB,EAEtBhtD,EAAUqqB,kBAAkBtoB,IAAI,8BAA8B,EAC9D,KACI,GAAIjC,EAAOwD,YAAa,CACpB,GAAI6uD,GAASvyD,EAAOkoC,UAAUE,WAAa,YAAc,OAErD/zC,GACAm+D,SACIC,aAAc,YAAc7c,EAAYlrB,iBAAmB,IAAMm2B,EAAMhhD,QAAQwoC,YAAc,IAAMliB,EAAQusC,SAAW,IAAMH,IAIhIhsC,EAAMJ,EAAA,IACNwsC,EAA0C,GAAlC56D,KAAKw+C,QAAQvzC,QAAQ,UAC3BujB,EAAA,aAAsBA,EAAA,YACtBA,EAAA,YAAqBA,EAAA,UACvBosC,KACAt+D,EAAA,OAAqBu+D,OAAQD,IAEjC56D,KAAK86D,OAAS,GAAId,GAAch6D,KAAKw+C,WAAaliD,OAGlD0D,MAAK86D,OAAS,GAAId,GAAch6D,KAAKw+C,SAG7C,MAAOz+C,GACHC,KAAK27B,KAAK,iCACV,IAAIlxB,GAAQ1K,EAAEuJ,SAAWvJ,EAAEsL,IAK3B,OAJIZ,IACAzK,KAAK27B,KAAKlxB,OAEdzK,MAAK41D,YAGT51D,KAAK86D,OAAOC,OAAS,WACjB3jC,EAAMuE,KAAK,wBACXvE,EAAMi+B,gBAAiB,GAE3Br1D,KAAK86D,OAAOE,QAAU,WAClB5jC,EAAMuE,KAAK,0CACXvE,EAAM0jC,OAAS,KACf1jC,EAAMw+B,aAEV51D,KAAK86D,OAAO5yB,UAAY,SAAUluC,GAC9Bo9B,EAAM6jC,oBAAoBjhE,IAE9BgG,KAAK86D,OAAOjB,QAAU,SAAU95D,GAC5Bq3B,EAAMuE,KAAK,wCACX,IAAIlxB,GAAQ1K,EAAEuJ,SAAWvJ,EAAEsL,IACvBZ,IACA2sB,EAAMuE,KAAKlxB,GAEf2sB,EAAMw+B,cAMduE,EAAoBp/D,UAAUu4D,MAAQ,aACtC6G,EAAoBnD,cAAgB,WAChCmD,EAAoBlD,gBAAiB,GAEzCkD,EAAoBjD,YAAc,WAC9B,GAAIgE,IAAe,CACnB,IAAyB,mBAAdxyC,YAA6BA,UAAUyyC,UAAW,CACzD,GAAIC,GAAkB,iCAClBC,EAAkB3yC,UAAUyyC,UAAUG,MAAMF,EAC5CC,IAAmBA,EAAgBt/D,OAAS,GACxConB,WAAWk4C,EAAgB,IAAM,MACjCH,GAAe,GAI3B,OAASA,GACa,OAAlBlB,IACCG,EAAoBlD,gBAM7BkD,EAAoBoB,iBAAmB,WAGnC,MAAQlzD,GAAUqqB,kBAAkB8oC,oBACkC,IAAlEnzD,EAAUqqB,kBAAkBh4B,IAAI,+BAExCy/D,EAAoBp/D,UAAUm3D,sBAAwB,WAClD7pD,EAAUqqB,kBAAkBroB,OAAO,+BAEvC8vD,EAAoBp/D,UAAU0gE,aAAe,SAAUpwD,GAEnD,GADArL,KAAKq6D,OAAOp+D,KAAKoP,GACbrL,KAAKq6D,OAAOt+D,QAAUiE,KAAKs6D,YAAa,CACxC,GAAIoB,GAAW17D,KAAKq6D,OAAOpsD,KAAK,GAChCjO,MAAKq6D,OAAS,IACd,IAAIsB,GAAWzzD,EAAOgzC,SAASwgB,EAE/B17D,MAAKm0D,UAAUwH,KAOvBxB,EAAoBp/D,UAAU6gE,qBAAuB,SAAUC,GAC3D77D,KAAKs6D,YAAcuB,EACnB77D,KAAKq6D,WAQTF,EAAoBp/D,UAAU+gE,mBAAqB,SAAUzwD,GAIzD,GAHAtD,EAAOiC,OAAuB,OAAhBhK,KAAKq6D,OAAiB,kCAGhChvD,EAAKtP,QAAU,EAAG,CAClB,GAAI8/D,GAAavwD,OAAOD,EACxB,KAAK83B,MAAM04B,GAEP,MADA77D,MAAK47D,qBAAqBC,GACnB,KAIf,MADA77D,MAAK47D,qBAAqB,GACnBvwD,GAMX8uD,EAAoBp/D,UAAUkgE,oBAAsB,SAAUc,GAC1D,GAAoB,OAAhB/7D,KAAK86D,OAAT,CAEA,GAAIzvD,GAAO0wD,EAAA,IAIX,IAHA/7D,KAAKiyD,eAAiB5mD,EAAKtP,OAC3BiE,KAAKg4B,OAAO8G,iBAAiB,iBAAkBzzB,EAAKtP,QACpDiE,KAAKg8D,iBACe,OAAhBh8D,KAAKq6D,OAELr6D,KAAKy7D,aAAapwD,OAEjB,CAED,GAAI4wD,GAAgBj8D,KAAK87D,mBAAmBzwD,EACtB,QAAlB4wD,GACAj8D,KAAKy7D,aAAaQ,MAQ9B9B,EAAoBp/D,UAAUs4D,KAAO,SAAUhoD,GAC3CrL,KAAKg8D,gBACL,IAAI3E,GAAUnvD,EAAOwB,UAAU2B,EAC/BrL,MAAKmyD,WAAakF,EAAQt7D,OAC1BiE,KAAKg4B,OAAO8G,iBAAiB,aAAcu4B,EAAQt7D,OAGnD,IAAImR,GAAWlF,EAAOgF,kBAAkBqqD,EA3OjB,MA6OnBnqD,GAASnR,OAAS,GAClBiE,KAAKk8D,YAAY9/D,OAAO8Q,EAASnR,QAGrC,KAAK,GAAIlC,GAAI,EAAGA,EAAIqT,EAASnR,OAAQlC,IACjCmG,KAAKk8D,YAAYhvD,EAASrT,KAGlCsgE,EAAoBp/D,UAAUo8D,UAAY,WACtCn3D,KAAK01D,WAAY,EACb11D,KAAKo6D,iBACL1zB,cAAc1mC,KAAKo6D,gBACnBp6D,KAAKo6D,eAAiB,MAEtBp6D,KAAK86D,SACL96D,KAAK86D,OAAOn0B,QACZ3mC,KAAK86D,OAAS,OAGtBX,EAAoBp/D,UAAU66D,UAAY,WACjC51D,KAAK01D,YACN11D,KAAK27B,KAAK,+BACV37B,KAAKm3D,YAEDn3D,KAAK2yC,eACL3yC,KAAK2yC,aAAa3yC,KAAKq1D,gBACvBr1D,KAAK2yC,aAAe,QAQhCwnB,EAAoBp/D,UAAU4rC,MAAQ,WAC7B3mC,KAAK01D,YACN11D,KAAK27B,KAAK,6BACV37B,KAAKm3D,cAObgD,EAAoBp/D,UAAUihE,eAAiB,WAC3C,GAAI5kC,GAAQp3B,IACZ0mC,eAAc1mC,KAAKo6D,gBACnBp6D,KAAKo6D,eAAiB3zB,YAAY,WAE1BrP,EAAM0jC,QACN1jC,EAAM8kC,YAAY,KAEtB9kC,EAAM4kC,kBACPhwD,KAAKC,MAjSmB,QAyS/BkuD,EAAoBp/D,UAAUmhE,YAAc,SAAUxzD,GAIlD,IACI1I,KAAK86D,OAAOzH,KAAK3qD,GAErB,MAAO3I,GACHC,KAAK27B,KAAK,0CAA2C57B,EAAEuJ,SAAWvJ,EAAEsL,KAAM,uBAC1E5D,WAAWzH,KAAK41D,UAAUpuD,KAAKxH,MAAO,KAO9Cm6D,EAAoBgC,6BAA+B,EAKnDhC,EAAoBiC,eAAiB,IAC9BjC,IAEXxgE,GAAQwgE,oBAAsBA,I1GyzcDpgE,KAAKJ,EAASH,EAAoB,MAIzD,SAAUI,EAAQD,EAASH,GAEjC,Y2G3odAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GAOtD,IAAI20D,GAA+B,WAC/B,QAASA,MA0CT,MAlCAA,GAAch1D,UAAUmhC,IAAM,SAAU7qB,EAAYhG,EAAMkuB,EAAYhhB,KAOtEw3C,EAAch1D,UAAUmM,MAAQ,SAAUmK,EAAYhG,EAAMkuB,EAAYhhB,KAKxEw3C,EAAch1D,UAAU49B,iBAAmB,SAAUjX,KAMrDquC,EAAch1D,UAAUwiC,gBAAkB,SAAUlsB,EAAYhG,EAAMkuB,KAMtEw2B,EAAch1D,UAAU4iC,kBAAoB,SAAUtsB,EAAYhG,EAAMkuB,KAKxEw2B,EAAch1D,UAAUqiC,mBAAqB,SAAU/rB,EAAYkoB,KAInEw2B,EAAch1D,UAAUoyD,YAAc,SAAU/uB,KACzC2xB,IAEXp2D,GAAQo2D,cAAgBA,G3GkqdlB,SAAUn2D,EAAQD,EAASH,GAEjC,Y4GxtdAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAIihE,GAAkB7iE,EAAQ,IAC1Bqc,EAAkBrc,EAAQ,GAC1B0a,EAAS1a,EAAQ,GACjB0vB,EAAiB1vB,EAAQ,GAOzB8iE,EAA8B,WAI9B,QAASA,GAAa/d,GAClBv+C,KAAKu8D,eAAiB,GAAIF,GAAgB5mB,cAAc8I,EAAOtI,YAC/Dj2C,KAAKkzC,OAASqL,EAAOtI,WACrBj2C,KAAKw8D,WAAaF,EAAaG,cAAcle,GAC7Cv+C,KAAK08D,SAAWJ,EAAaK,YAAYpe,GAuG7C,MAlGA+d,GAAavhE,UAAU6hE,aAAe,WAClC,MAAO58D,MAAKw8D,YAKhBF,EAAavhE,UAAU8hE,WAAa,WAChC,MAAO78D,MAAK08D,UAMhBJ,EAAavhE,UAAU+hE,QAAU,SAAUv/D,GACvC,MAAQyC,MAAKkzC,OAAO5+B,QAAQtU,KAAK48D,eAAgBr/D,IAAS,GACtDyC,KAAKkzC,OAAO5+B,QAAQ/W,EAAMyC,KAAK68D,eAAiB,GAKxDP,EAAavhE,UAAU6c,YAAc,SAAUojB,EAAM3+B,EAAKk4C,EAAUtZ,EAAcoN,EAAQqN,GAItF,MAHK11C,MAAK88D,QAAQ,GAAI5oD,GAAOe,UAAU5Y,EAAKk4C,MACxCA,EAAWrrB,EAAejT,aAAaP,YAEpC1V,KAAKu8D,eAAe3kD,YAAYojB,EAAM3+B,EAAKk4C,EAAUtZ,EAAcoN,EAAQqN,IAKtF4mB,EAAavhE,UAAU86C,eAAiB,SAAU/wB,EAASgxB,EAASJ,GAC5DI,EAAQn/B,eAERm/B,EAAU5sB,EAAejT,aAAaP,WAE1C,IAAIyyC,GAAWrS,EAAQ37B,UAAUna,KAAKkzC,OAEtCiV,GAAWA,EAASvxC,eAAesS,EAAejT,aAAaP,WAC/D,IAAIgW,GAAO1rB,IAMX,OALA81C,GAAQ19B,aAAavC,EAAgBJ,eAAgB,SAAUpZ,EAAKgc,GAC3DqT,EAAKoxC,QAAQ,GAAI5oD,GAAOe,UAAU5Y,EAAKgc,MACxC8vC,EAAWA,EAAShxC,qBAAqB9a,EAAK6sB,EAAejT,aAAaP,eAG3E1V,KAAKu8D,eAAe1mB,eAAe/wB,EAASqjC,EAAUzS,IAKjE4mB,EAAavhE,UAAU6b,eAAiB,SAAUkO,EAAStN,GAEvD,MAAOsN,IAKXw3C,EAAavhE,UAAUg7C,aAAe,WAClC,OAAO,GAKXumB,EAAavhE,UAAUi7C,iBAAmB,WACtC,MAAOh2C,MAAKu8D,gBAKhBD,EAAavhE,UAAUk7C,SAAW,WAC9B,MAAOj2C,MAAKkzC,QAOhBopB,EAAaG,cAAgB,SAAUle,GACnC,GAAIA,EAAOY,WAAY,CACnB,GAAI4d,GAAYxe,EAAOkB,mBACvB,OAAOlB,GAAOtI,WAAW5gC,SAASkpC,EAAOa,qBAAsB2d,GAG/D,MAAOxe,GAAOtI,WAAWjhC,WAQjCsnD,EAAaK,YAAc,SAAUpe,GACjC,GAAIA,EAAOc,SAAU,CACjB,GAAI2d,GAAUze,EAAOmB,iBACrB,OAAOnB,GAAOtI,WAAW5gC,SAASkpC,EAAOe,mBAAoB0d,GAG7D,MAAOze,GAAOtI,WAAW9gC,WAG1BmnD,IAEX3iE,GAAQ2iE,aAAeA,G5G6udjB,SAAU1iE,EAAQD,EAASH,GAEjCI,EAAOD,QAAUH,EAAoB,MAK/B,SAAUI,EAAQD,EAASH,GAEjC,Y6Gt3dA,SAAS4wB,GAASI,GAChB,GAAMyyC,GAAiBh1C,KAAKlI,MAAM6vB,mBAAmBplB,EAAG0yC,QAAQD,iBACxDE,EAA2DF,EAA3DE,SAAU7pD,EAAiD2pD,EAAjD3pD,MAAO6kC,EAA0C8kB,EAA1C9kB,WAAYilB,EAA8BH,EAA9BG,WAAYC,EAAkBJ,EAAlBI,cAC3CC,GACJ,EAAAn5C,EAAA7oB,GAAAiiE,EAAAC,gBACEL,SAAUA,EACVhlB,WAAYA,EACZ7kC,MAAOA,EACP8pD,WAAYA,EACZC,cAAeA,KAGnB,EAAAl5C,EAAAjgB,QAAOo5D,EAAc9yC,EAAIA,EAAG5oB,YAtB9BpI,EAAA,IACA,IAAAikE,GAAAjkE,EAAA,I7Gs4dIkkE,EAUJ,SAAgCjhE,GAAO,MAAOA,IAAOA,EAAI7B,WAAa6B,GAAQqL,QAASrL,IAV/CghE,G6Gr4dxCt5C,EAAA3qB,EAAA,GACA+jE,EAAA/jE,EAAA,KACAmkE,EAAAnkE,EAAA,IACAokE,EAAApkE,EAAA,GAGAsR,QAD6B,oBACEA,OADF,yBAkB7B,EAAA4yD,EAAA51D,SAAS,kBAAM,EAAA61D,EAAAzzC,MAlBc,mBAkBaE,EAA3BwzC,EAAArmB,mB7Gs5dT,SAAU39C,EAAQD,EAASH,GAEjC,Y8Gl7dAA,GAAA,IACAA,EAAA,IACAA,EAAA,GACA,IAAAqkE,GAAArkE,EAAA,I9G07dIskE,EAEJ,SAAgCrhE,GAAO,MAAOA,IAAOA,EAAI7B,WAAa6B,GAAQqL,QAASrL,IAFxCohE,E8Gx7d1C/yD,QAAOzD,UACVyD,OAAOzD,QAAPy2D,EAAAh2D,U9Gk8dI,SAAUlO,EAAQD,EAASH,GAEjC,YAgDA,SAASm2B,GAAgBC,EAAUC,GAAe,KAAMD,YAAoBC,IAAgB,KAAM,IAAI1E,WAAU,qCAEhH,QAAS2E,GAA2BpE,EAAM3xB,GAAQ,IAAK2xB,EAAQ,KAAM,IAAIqE,gBAAe,4DAAgE,QAAOh2B,GAAyB,gBAATA,IAAqC,kBAATA,GAA8B2xB,EAAP3xB,EAElO,QAASi2B,GAAUC,EAAUC,GAAc,GAA0B,kBAAfA,IAA4C,OAAfA,EAAuB,KAAM,IAAI/E,WAAU,iEAAoE+E,GAAeD,GAASl1B,UAAYT,OAAO0Z,OAAOkc,GAAcA,EAAWn1B,WAAa8I,aAAezI,MAAO60B,EAAUx1B,YAAY,EAAO01B,UAAU,EAAM31B,cAAc,KAAe01B,IAAY51B,OAAOuZ,eAAiBvZ,OAAOuZ,eAAeoc,EAAUC,GAAcD,EAASnc,UAAYoc,G+Glydje,QAAS6tC,GAAmBC,GAC1B,MAAa,UAATA,EACK,mBAEA,iB/G6udX1jE,OAAOC,eAAeZ,EAAS,cAC7ByB,OAAO,IAETzB,EAAQ6jE,mBAAiBrhE,EAEzB,IAAIk0B,GAAe,WAAc,QAASvV,GAAiBwV,EAAQ5zB,GAAS,IAAK,GAAI7C,GAAI,EAAGA,EAAI6C,EAAMX,OAAQlC,IAAK,CAAE,GAAI02B,GAAa7zB,EAAM7C,EAAI02B,GAAW91B,WAAa81B,EAAW91B,aAAc,EAAO81B,EAAW/1B,cAAe,EAAU,SAAW+1B,KAAYA,EAAWJ,UAAW,GAAM71B,OAAOC,eAAe+1B,EAAQC,EAAWl0B,IAAKk0B,IAAiB,MAAO,UAAUV,EAAaW,EAAYC,GAAiJ,MAA9HD,IAAY1V,EAAiB+U,EAAY90B,UAAWy1B,GAAiBC,GAAa3V,EAAiB+U,EAAaY,GAAqBZ,M+Gh9dhiB1L,EAAA3qB,EAAA,GAEA+jE,EAAA/jE,EAAA,K/Go9dIykE,EAgCJ,SAAgCxhE,GAAO,MAAOA,IAAOA,EAAI7B,WAAa6B,GAAQqL,QAASrL,IAhCzC8gE,G+Gl9d9CW,EAAA1kE,EAAA,KACA83B,EAAA93B,EAAA,IACA23B,EAAA33B,EAAA,IACA2kE,EAAA3kE,EAAA,KACA4kE,EAAA5kE,EAAA,KAKA6kE,EAAA7kE,EAAA,KACA8qB,EAAA9qB,EAAA,GACA+qB,EAAA/qB,EAAA,GACAyxC,EAAAzxC,EAAA,IAKA4qB,EAAA5qB,EAAA,IACA8kE,EAAA9kE,EAAA,KACA+kE,EAAA/kE,EAAA,KACAk4B,EAAAl4B,EAAA,IACAglE,EAAAhlE,EAAA,KACAilE,EAAAjlE,EAAA,G/Gq+dqBG,G+Gr9dR6jE,e/Gq9diC,SAAUkB,GAGtD,QAASlB,KACP,GAAIpyB,GAEAC,EAAOjU,EAAOkU,CAElB3b,GAAgB3vB,KAAMw9D,EAEtB,KAAK,GAAIrtD,GAAOrU,UAAUC,OAAQ4wB,EAAOpjB,MAAM4G,GAAOE,EAAO,EAAGA,EAAOF,EAAME,IAC3Esc,EAAKtc,GAAQvU,UAAUuU,EAGzB,OAAeg7B,GAASjU,EAAQtH,EAA2B9vB,MAAOorC,EAAOoyB,EAAe1pD,WAAaxZ,OAAOu2B,eAAe2sC,IAAiBzjE,KAAK0P,MAAM2hC,GAAOprC,MAAMwK,OAAOmiB,KAAiByK,E+Gl+d9LunC,gBAAkB,K/Gk+d0MvnC,E+Gj+d5NwnC,OAAuB,K/Gi+d0NxnC,E+Gh+djP7yB,OACEs6D,WAAY,K/Gi+dTznC,E+Gt9dL92B,kBAAoB,WAClB82B,EAAK0nC,eACL1nC,EAAKunC,iBAAkB,EAAAH,EAAAO,UAAS3nC,EAAK0nC,aAAc,QACnDh0D,OAAO1L,iBAAiB,SAAUg4B,EAAKunC,kB/Gu9dpCvnC,E+Gp9dLpwB,qBAAuB,WACrB8D,OAAOxL,oBAAoB,SAAU83B,EAAKunC,kB/Gq9dvCvnC,E+Gl9dL0nC,aAAe,WACb,GAAK1nC,EAAKwnC,OAAV,CAIA,GAAM9iD,GAAQsb,EAAKwnC,OAAOI,WAC1B5nC,GAAK1vB,UAAWm3D,YAAY,EAAA5zB,EAAApvB,sBAAqBC,O/Gm9d9Csb,E+G97dL6nC,oBAAsB,SAAC3+B,GAAmC,GACzC4+B,GAAiC5+B,EAAxC71B,MAAsB00D,EAAkB7+B,EAAlB6+B,KAAMC,EAAY9+B,EAAZ8+B,QAC5BP,EAAeznC,EAAK7yB,MAApBs6D,WAFgDQ,EAOpDjoC,EAAK16B,MAHPygE,EAJsDkC,EAItDlC,SACA7pD,EALsD+rD,EAKtD/rD,MACA6kC,EANsDknB,EAMtDlnB,UAGF,QACE,EAAAh0B,EAAA7oB,GAAA,OACEgI,IAAK,SAAAknB,GAAA,MAAO4M,GAAKwnC,OAASp0C,GAC1B1qB,UAAci+D,EAAkBzqD,GAAhC,KAA0C,EAAAgR,EAAApU,KACxC+tD,EAAAn2D,QAAOw3D,gBACP,EAAA/6C,EAAAlR,kBAAiBC,IACjB,EAAA23B,EAAA/uB,uBAAsB2iD,KAIvBK,IACC,EAAA/6C,EAAA7oB,GAAA61B,EAAAxmB,MAAA,MACE,EAAAwZ,EAAA7oB,GAAA,OAAKoD,OAAS8rC,aAAc,SAA5B,kDAGA,EAAArmB,EAAA7oB,GAAAo2B,EAAAD,aAAaT,QAASoG,EAAKmoC,0BAA3B,yBAMHH,IACC,EAAAj7C,EAAA7oB,GAAAg2B,EAAAD,OAAA,MACE,EAAAlN,EAAA7oB,GAAA8oB,EAAAF,cAAc2qB,QAAQ,cACtB,EAAA1qB,EAAA7oB,GAAA,6BAID8jE,IAAYF,GAAiBC,IAC9B,EAAAh7C,EAAA7oB,GAAA6iE,EAAAqB,iBACErC,SAAUA,EACVgC,KAAMA,EACNhnB,WAAYA,EACZj0C,OAAQ,SAAAo8B,GAAA,MAAOlJ,GAAKqoC,sBAAsBn/B,EAAK6+B,Q/Gw8dpD/nC,E+Gj8dLqoC,sBAAwB,SAACn/B,EAAiC6+B,GAAe,GAErE92C,GAKEiY,EALFjY,SACAq3C,EAIEp/B,EAJFo/B,KACOC,EAGLr/B,EAHF71B,MACAm1D,EAEEt/B,EAFFs/B,eACAC,EACEv/B,EADFu/B,8BANqEC,EAUtD1oC,EAAK16B,MADdygE,EAT+D2C,EAS/D3C,SACNhlB,EAVqE2nB,EAUrE3nB,WAEI4nB,GACJH,iBACAv3C,WACAs3C,YACAE,gCACAH,OAGF,QAAO,EAAAv7C,EAAA7oB,GAAA+iE,EAAA2B,iBACL7C,SAAUA,EACVhlB,WAAYA,EACZgnB,KAAMA,EACNj7D,OAAQ,SAAAo8B,GAAA,MAAOlJ,GAAK6oC,sBAAsB3/B,EAAKy/B,EAAaZ,O/Go8d3D/nC,E+Gh8dL6oC,sBAAwB,SAAC3/B,EAAiC4/B,EAAgCf,GAAe,GAErG5qC,GAGE+L,EAHF/L,OACO4rC,EAEL7/B,EAFF71B,MACA21D,EACE9/B,EADF8/B,gBAJqGC,EAUnGjpC,EAAK16B,MAFP0gE,EARqGiD,EAQrGjD,WACAC,EATqGgD,EASrGhD,cAGMuC,EAIGM,EAJHN,eACNv3C,EAGS63C,EAHT73C,SACAs3C,EAESO,EAFTP,UACAE,EACSK,EADTL,8BACAH,EAASQ,EAATR,IACF,QAAO,EAAAv7C,EAAA7oB,GAAA4iE,EAAAoC,UACLnB,KAAMA,EACNS,eAAgBA,EAChBv3C,SAAUA,EACVs3C,UAAWA,EACXQ,YAAaA,EACb5rC,OAAQA,EACR6rC,gBAAiBA,EACjBhD,WAAYA,EACZC,cAAeA,IAEf,EAAAl5C,EAAA7oB,GAAAgjE,EAAAiC,UAAUtgE,KAAK,aACZ4/D,qBACkB,EAAAtB,EAAAiC,gCACfd,EAAKv3C,cACLg3C,EAAKsB,cAHR,qB/Gq0dEn1B,EA8HJD,EAAQvb,EAA2BsH,EAAOkU,GAiC/C,MA5KAtb,GAAUwtC,EAAgBkB,GA8I1BruC,EAAamtC,IACXnhE,IAAK,kBACLjB,MAAO,W+G9leP,OACEkY,MAAOtT,KAAKtD,MAAM4W,MAClB86B,eAAe,EACfjyB,kBAAmBnc,KAAKuE,MAAMs6D,e/GmmehCxiE,IAAK,2BACLjB,MAAO,W+G5keP0P,OAAOC,SAASo/B,QAAO,M/GglevB9tC,IAAK,SACLjB,MAAO,W+G9keC,GAAAgvC,GAIJpqC,KAAKtD,MAFPygE,EAFM/yB,EAEN+yB,SACAhlB,EAHM/N,EAGN+N,UAGF,QACE,EAAAh0B,EAAA7oB,GAAA8iE,EAAAsC,eACEvoB,WAAYA,EACZglB,SAAUA,EACVj5D,OAAQlE,KAAKi/D,0B/GkleZzB,GACPiB,EAAgBzsC,gBAYZ,SAAUp4B,EAAQD,GgH3rexBC,EAAAD,SAAkB2lE,eAAA,6BAAAqB,yBAAA,qCAAAC,wBAAA,oCAAAC,8BAAA,0CAAAC,+BAAA,2CAAAC,8BAAA,0CAAAC,4CAAA,0DhHkseZ,SAAUpnE,EAAQD,EAASH,GAEjC,YAgCA,SAASm2B,GAAgBC,EAAUC,GAAe,KAAMD,YAAoBC,IAAgB,KAAM,IAAI1E,WAAU,qCAEhH,QAAS2E,GAA2BpE,EAAM3xB,GAAQ,IAAK2xB,EAAQ,KAAM,IAAIqE,gBAAe,4DAAgE,QAAOh2B,GAAyB,gBAATA,IAAqC,kBAATA,GAA8B2xB,EAAP3xB,EAElO,QAASi2B,GAAUC,EAAUC,GAAc,GAA0B,kBAAfA,IAA4C,OAAfA,EAAuB,KAAM,IAAI/E,WAAU,iEAAoE+E,GAAeD,GAASl1B,UAAYT,OAAO0Z,OAAOkc,GAAcA,EAAWn1B,WAAa8I,aAAezI,MAAO60B,EAAUx1B,YAAY,EAAO01B,UAAU,EAAM31B,cAAc,KAAe01B,IAAY51B,OAAOuZ,eAAiBvZ,OAAOuZ,eAAeoc,EAAUC,GAAcD,EAASnc,UAAYoc,GAjCje51B,OAAOC,eAAeZ,EAAS,cAC7ByB,OAAO,IAETzB,EAAQ2mE,aAAWnkE,EAEnB,IAAIk0B,GAAe,WAAc,QAASvV,GAAiBwV,EAAQ5zB,GAAS,IAAK,GAAI7C,GAAI,EAAGA,EAAI6C,EAAMX,OAAQlC,IAAK,CAAE,GAAI02B,GAAa7zB,EAAM7C,EAAI02B,GAAW91B,WAAa81B,EAAW91B,aAAc,EAAO81B,EAAW/1B,cAAe,EAAU,SAAW+1B,KAAYA,EAAWJ,UAAW,GAAM71B,OAAOC,eAAe+1B,EAAQC,EAAWl0B,IAAKk0B,IAAiB,MAAO,UAAUV,EAAaW,EAAYC,GAAiJ,MAA9HD,IAAY1V,EAAiB+U,EAAY90B,UAAWy1B,GAAiBC,GAAa3V,EAAiB+U,EAAaY,GAAqBZ,MiH1sehiB1L,EAAA3qB,EAAA,GAEA0kE,EAAA1kE,EAAA,KjH8seIynE,EAgBJ,SAAgCxkE,GAAO,MAAOA,IAAOA,EAAI7B,WAAa6B,GAAQqL,QAASrL,IAhB/CyhE,GiH5sexCgD,EAAA1nE,EAAA,KAEA2nE,EAAA3nE,EAAA,KACAiwC,EAAAjwC,EAAA,IACAyxC,EAAAzxC,EAAA,IACA8qB,EAAA9qB,EAAA,GACA4nE,EAAA5nE,EAAA,KACAu2C,EAAAv2C,EAAA,GjH8teeG,GiH/seF2mE,SjH+seqB,SAAU1vC,GAG1C,QAAS0vC,KAGP,MAFA3wC,GAAgB3vB,KAAMsgE,GAEfxwC,EAA2B9vB,MAAOsgE,EAASxsD,WAAaxZ,OAAOu2B,eAAeyvC,IAAW72D,MAAMzJ,KAAMlE,YAgE9G,MArEAk0B,GAAUswC,EAAU1vC,GAQpBP,EAAaiwC,IACXjkE,IAAK,SACLjB,MAAO,WiHzteC,GAAAgvC,GAWJpqC,KAAKtD,MATPyiE,EAFM/0B,EAEN+0B,KACAS,EAHMx1B,EAGNw1B,eACAv3C,EAJM+hB,EAIN/hB,SACAs3C,EALMv1B,EAKNu1B,UACAQ,EANM/1B,EAMN+1B,YACA5rC,EAPM6V,EAON7V,OACA6rC,EARMh2B,EAQNg2B,gBACAhD,EATMhzB,EASNgzB,WACAC,EAVMjzB,EAUNizB,cAEMlhD,EAAsBnc,KAAKS,QAA3B0b,kBACFmS,EAAQ6wC,EAAOA,EAAK7wC,MAAQ,EAElC,QACE,EAAAnK,EAAA7oB,GAAA,OACEwE,WAAW,EAAAwkB,EAAApU,KACT+wD,EAAAn5D,QAAOu5D,UACP,EAAAp2B,EAAA/uB,uBAAsBC,MAGxB,EAAAgI,EAAA7oB,GAAAy0C,EAAAD,SAAA,OACA,EAAA3rB,EAAA7oB,GAAA,OAAKwE,UAAWmhE,EAAAn5D,QAAOw5D,mBACrB,EAAAn9C,EAAA7oB,GAAA,MAAIwE,UAAWmhE,EAAAn5D,QAAOy5D,iBAAkBjzC,KAG1C,EAAAnK,EAAA7oB,GAAA,OAAKwE,UAAWmhE,EAAAn5D,QAAO05D,oBACnBn5C,IACA,EAAAlE,EAAA7oB,GAAA4lE,EAAAO,iBACEC,qBAAsB9B,EACtBa,aAActB,EAAKsB,eAGtBp4C,IACC,EAAAlE,EAAA7oB,GAAA8lE,EAAAO,YACEt5C,SAAUA,EACV82C,KAAMA,EACN5qC,OAAQA,EACR4rC,YAAaA,EACb/C,WAAYA,EACZC,cAAeA,IAGlBsC,GACC,4GAGJ,EAAAx7C,EAAA7oB,GAAA,UAAQwE,UAAWmhE,EAAAn5D,QAAO85D,kBACvBrtC,IAAU,EAAApQ,EAAA7oB,GAAAmuC,EAAAR,aAAaC,UAAW3U,EAAOuV,QACzCzhB,IAAY,EAAAlE,EAAA7oB,GAAA6lE,EAAAU,iBAAiBzB,gBAAiBA,KAEhDpgE,KAAKtD,MAAMd,SACXoE,KAAKtD,MAAMd,cjH+teX0kE,GACPn8C,EAAQhgB,YAIJ,SAAUvK,EAAQD,GkHtzexBC,EAAAD,SAAkB0nE,SAAA,uBAAAC,iBAAA,+BAAAC,gBAAA,8BAAAO,mBAAA,+BAAAC,kBAAA,8BAAAC,wBAAA,oCAAAR,kBAAA,gCAAAI,iBAAA,iClH6zeZ,SAAUhoE,EAAQD,EAASH,GAEjC,YA0BA,SAASm2B,GAAgBC,EAAUC,GAAe,KAAMD,YAAoBC,IAAgB,KAAM,IAAI1E,WAAU,qCAEhH,QAAS2E,GAA2BpE,EAAM3xB,GAAQ,IAAK2xB,EAAQ,KAAM,IAAIqE,gBAAe,4DAAgE,QAAOh2B,GAAyB,gBAATA,IAAqC,kBAATA,GAA8B2xB,EAAP3xB,EAElO,QAASi2B,GAAUC,EAAUC,GAAc,GAA0B,kBAAfA,IAA4C,OAAfA,EAAuB,KAAM,IAAI/E,WAAU,iEAAoE+E,GAAeD,GAASl1B,UAAYT,OAAO0Z,OAAOkc,GAAcA,EAAWn1B,WAAa8I,aAAezI,MAAO60B,EAAUx1B,YAAY,EAAO01B,UAAU,EAAM31B,cAAc,KAAe01B,IAAY51B,OAAOuZ,eAAiBvZ,OAAOuZ,eAAeoc,EAAUC,GAAcD,EAASnc,UAAYoc,GmH3xeje,QAAS+xC,GAAYrpD,EAAe6nD,GAClC,MAAO7nD,KAAU6nD,EAAa1kE,OAAS,EnH+vezCzB,OAAOC,eAAeZ,EAAS,cAC7ByB,OAAO,IAETzB,EAAQ8nE,oBAAkBtlE,EAE1B,IAAIk0B,GAAe,WAAc,QAASvV,GAAiBwV,EAAQ5zB,GAAS,IAAK,GAAI7C,GAAI,EAAGA,EAAI6C,EAAMX,OAAQlC,IAAK,CAAE,GAAI02B,GAAa7zB,EAAM7C,EAAI02B,GAAW91B,WAAa81B,EAAW91B,aAAc,EAAO81B,EAAW/1B,cAAe,EAAU,SAAW+1B,KAAYA,EAAWJ,UAAW,GAAM71B,OAAOC,eAAe+1B,EAAQC,EAAWl0B,IAAKk0B,IAAiB,MAAO,UAAUV,EAAaW,EAAYC,GAAiJ,MAA9HD,IAAY1V,EAAiB+U,EAAY90B,UAAWy1B,GAAiBC,GAAa3V,EAAiB+U,EAAaY,GAAqBZ,MmHr0ehiB1L,EAAA3qB,EAAA,GAEA0nE,EAAA1nE,EAAA,KnHy0eI0oE,EAUJ,SAAgCzlE,GAAO,MAAOA,IAAOA,EAAI7B,WAAa6B,GAAQqL,QAASrL,IAVxCykE,GmHv0e/CiB,EAAA3oE,EAAA,KACA8qB,EAAA9qB,EAAA,GACAyxC,EAAAzxC,EAAA,IACA2xC,EAAA3xC,EAAA,GnHy1esBG,GmH/0eT8nE,gBnH+0emC,SAAU7wC,GAGxD,QAAS6wC,KAGP,MAFA9xC,GAAgB3vB,KAAMyhE,GAEf3xC,EAA2B9vB,MAAOyhE,EAAgB3tD,WAAaxZ,OAAOu2B,eAAe4wC,IAAkBh4D,MAAMzJ,KAAMlE,YA+C5H,MApDAk0B,GAAUyxC,EAAiB7wC,GAQ3BP,EAAaoxC,IACXplE,IAAK,SACLjB,MAAO,WmHz1eC,GAAAgvC,GACuCpqC,KAAKtD,MAA5C+jE,EADAr2B,EACAq2B,aAAciB,EADdt3B,EACcs3B,qBACdvlD,EAAsBnc,KAAKS,QAA3B0b,kBACFimD,EAAoB3B,EAAarjE,KACpCohC,OAAO,SAAC6jC,EAAKl6C,GACZ,GAAMm6C,GAAc7B,EAAat4C,EAGjC,OAFAm6C,GAAY95D,GAAK2f,EACjBk6C,EAAIpmE,KAAKqmE,GACFD,OAGLE,GAAuB,EAAAp3B,EAAAla,cAAamxC,EAAmB,QACvDI,EAAkBD,EAfE,GAgBpBE,EAAUhC,EAAarjE,KAAKrB,OAAS,GAAM,EAAI,MAAQ,OACvD2mE,EAAmC,IAA7BjC,EAAarjE,KAAKrB,OAAe,MAAQ,EAErD,QACE,EAAAooB,EAAA7oB,GAAA,OACEwE,WAAW,EAAAwkB,EAAApU,KACTgyD,EAAAp6D,QAAO66D,gBACPD,GAAOD,GACP,EAAAx3B,EAAA/uB,uBAAsBC,GACtBqmD,EAAkB,aAAe,OAGlCJ,EAAkB5xD,IAAI,SAAC8xD,EAAazpD,GAAd,OACrB,EAAAsL,EAAA7oB,GAAA,OACEe,IAAKimE,EAAY95D,GACjB1I,WAAW,EAAAwkB,EAAApU,KACTgyD,EAAAp6D,QAAO86D,sBACPJ,EAAkB,aAAe,QAGnC,EAAAr+C,EAAA7oB,GAAA6mE,EAAAU,aACE7xC,QAAS0wC,EACTY,YAAaA,EACbL,WAAYA,EAAWppD,EAAK4nD,GAC5BqC,uBAAwBrC,EAAa1kE,iBnH81e1C0lE,GACPt9C,EAAQhgB,YAQJ,SAAUvK,EAAQD,GoHh6exBC,EAAAD,SAAkBgpE,gBAAA,8BAAAI,8BAAA,0CAAAH,sBAAA,oCAAAI,yBAAA,qCAAAC,+BAAA,2CAAAC,oCAAA,gDAAAC,0BAAA,sCAAAC,yBAAA,qCAAAC,+BAAA,6CpHu6eZ,SAAUzpE,EAAQD,EAASH,GAEjC,YA0BA,SAASm2B,GAAgBC,EAAUC,GAAe,KAAMD,YAAoBC,IAAgB,KAAM,IAAI1E,WAAU,qCAEhH,QAAS2E,GAA2BpE,EAAM3xB,GAAQ,IAAK2xB,EAAQ,KAAM,IAAIqE,gBAAe,4DAAgE,QAAOh2B,GAAyB,gBAATA,IAAqC,kBAATA,GAA8B2xB,EAAP3xB,EAElO,QAASi2B,GAAUC,EAAUC,GAAc,GAA0B,kBAAfA,IAA4C,OAAfA,EAAuB,KAAM,IAAI/E,WAAU,iEAAoE+E,GAAeD,GAASl1B,UAAYT,OAAO0Z,OAAOkc,GAAcA,EAAWn1B,WAAa8I,aAAezI,MAAO60B,EAAUx1B,YAAY,EAAO01B,UAAU,EAAM31B,cAAc,KAAe01B,IAAY51B,OAAOuZ,eAAiBvZ,OAAOuZ,eAAeoc,EAAUC,GAAcD,EAASnc,UAAYoc,GA3Bje51B,OAAOC,eAAeZ,EAAS,cAC7ByB,OAAO,IAETzB,EAAQkpE,gBAAc1mE,EAEtB,IAAIk0B,GAAe,WAAc,QAASvV,GAAiBwV,EAAQ5zB,GAAS,IAAK,GAAI7C,GAAI,EAAGA,EAAI6C,EAAMX,OAAQlC,IAAK,CAAE,GAAI02B,GAAa7zB,EAAM7C,EAAI02B,GAAW91B,WAAa81B,EAAW91B,aAAc,EAAO81B,EAAW/1B,cAAe,EAAU,SAAW+1B,KAAYA,EAAWJ,UAAW,GAAM71B,OAAOC,eAAe+1B,EAAQC,EAAWl0B,IAAKk0B,IAAiB,MAAO,UAAUV,EAAaW,EAAYC,GAAiJ,MAA9HD,IAAY1V,EAAiB+U,EAAY90B,UAAWy1B,GAAiBC,GAAa3V,EAAiB+U,EAAaY,GAAqBZ,MqH/6ehiB1L,EAAA3qB,EAAA,GAEA2oE,EAAA3oE,EAAA,KrHm7eI8pE,EAUJ,SAAgC7mE,GAAO,MAAOA,IAAOA,EAAI7B,WAAa6B,GAAQqL,QAASrL,IAV5C0lE,GqHl7e3CzxC,EAAAl3B,EAAA,IAGA8qB,EAAA9qB,EAAA,GACA+qB,EAAA/qB,EAAA,GACAyxC,EAAAzxC,EAAA,GrHg8ekBG,GqHv7eLkpE,YrHu7e2B,SAAUjyC,GAGhD,QAASiyC,KACP,GAAIz3B,GAEAC,EAAOjU,EAAOkU,CAElB3b,GAAgB3vB,KAAM6iE,EAEtB,KAAK,GAAI1yD,GAAOrU,UAAUC,OAAQ4wB,EAAOpjB,MAAM4G,GAAOE,EAAO,EAAGA,EAAOF,EAAME,IAC3Esc,EAAKtc,GAAQvU,UAAUuU,EAGzB,OAAeg7B,GAASjU,EAAQtH,EAA2B9vB,MAAOorC,EAAOy3B,EAAY/uD,WAAaxZ,OAAOu2B,eAAegyC,IAAc9oE,KAAK0P,MAAM2hC,GAAOprC,MAAMwK,OAAOmiB,KAAiByK,EqHp8exLmsC,yBAA2B,WACzBnsC,EAAK16B,MAAMs0B,QAAQoG,EAAK16B,MAAM4lE,crHm8evBh3B,EAEJD,EAAQvb,EAA2BsH,EAAOkU,GA+B/C,MA9CAtb,GAAU6yC,EAAajyC,GAkBvBP,EAAawyC,IACXxmE,IAAK,SACLjB,MAAO,WqHv8eC,GAAAgvC,GACoDpqC,KAAKtD,MAAzD4lE,EADAl4B,EACAk4B,YAAaL,EADb73B,EACa63B,WAAYa,EADzB14B,EACyB04B,uBADzBr3B,EAE6BzrC,KAAKS,QAAlC6S,EAFAm4B,EAEAn4B,MAAO6I,EAFPsvB,EAEOtvB,iBACf,QACE,EAAAgI,EAAA7oB,GAAA,OACEwE,WAAW,EAAAwkB,EAAApU,KACTozD,EAAAx7D,QAAOw6D,YACPL,EAAa,YAAc,GAC3Ba,EAAyB,GAAM,EAAI,mBAAqB,IACxD,EAAAv+C,EAAAlR,kBAAiBC,IACjB,EAAA23B,EAAA/uB,uBAAsBC,MAGxB,EAAAgI,EAAA7oB,GAAAo1B,EAAAN,QACEtwB,UAAWwjE,EAAAx7D,QAAOipB,OAClBC,QAAShxB,KAAKujE,0BAEbjB,EAAY71B,WrHg9edo2B,GACP1+C,EAAQhgB,YAIJ,SAAUvK,EAAQD,GsH9/exBC,EAAAD,SAAkB2oE,YAAA,0BAAAkB,2BAAA,uCAAAC,gCAAA,4CAAAC,yBAAA,qCAAAC,sBAAA,kCAAAC,qBAAA,iCAAAC,2BAAA,uCAAAX,oCAAA,gDAAAnyC,OAAA,uBtHqgfZ,SAAUn3B,EAAQD,EAASH,GAEjC,YA4BA,SAASsqE,GAAuBrnE,GAAO,MAAOA,IAAOA,EAAI7B,WAAa6B,GAAQqL,QAASrL,GuHthfhF,QAASolE,GAAiBnlE,GAC/B,GAAM6D,IAAO,EAAAwjE,EAAAj8D,SAAoBqY,KAAKoyB,MAAO71C,EAAM0jE,iBAC7C4D,EAAazjE,GAAQ,EAC3B,QACE,EAAA4jB,EAAA7oB,GAAA,OAAKwE,WAAW,EAAAwkB,EAAApU,KAAI+zD,EAAAn8D,QAAOs4D,gBAAkB4D,EAA2B,GAAd,aAAmBtlE,OAAA,GAA7E,qBACqB,KAClB,EAAAwlE,EAAAp8D,SAAsB,GAAIqY,MAAQzjB,EAAM0jE,iBACvC+D,gBAAgB,EAChBC,mBACE,IALN,SvHy/eJ9pE,OAAOC,eAAeZ,EAAS,cAC7ByB,OAAO,IAETzB,EuHhgfgBkoE,iBAXhB,IAAA19C,GAAA3qB,EAAA,GACA6qE,EAAA7qE,EAAA,KvHghfI0qE,EAAsBJ,EAAuBO,GuH/gfjDC,EAAA9qE,EAAA,IvHmhfIuqE,EAA0BD,EAAuBQ,GuHlhfrDC,EAAA/qE,EAAA,KvHshfIgrE,EAAOV,EAAuBS,GuHrhflCjgD,EAAA9qB,EAAA,GACA2nE,EAAA3nE,EAAA,KvH0hfIyqE,EAAoBH,EAAuB3C,IAyBzC,SAAUvnE,EAAQD,EAASH,GAEjC,YwHh+eA,SAASirE,GAAiBC,EAAoBC,EAAW1kD,GACvD,GAAI3jB,GAAU2jB,MAEV2kD,EAAaC,EAAYH,EAAoBC,GAE7CP,EAAS9nE,EAAQ8nE,OACjBU,EAAWC,EAASN,gBAAgBK,QACpCV,IAAUA,EAAOK,iBAAmBL,EAAOK,gBAAgBK,WAC7DA,EAAWV,EAAOK,gBAAgBK,SAGpC,IAKIE,GAAUC,EALVC,GACFC,UAAW50D,QAAQjU,EAAQ6oE,WAC3BP,WAAYA,EAIVA,GAAa,GACfI,EAAWjlD,EAAM2kD,GACjBO,EAAYllD,EAAM4kD,KAElBK,EAAWjlD,EAAM4kD,GACjBM,EAAYllD,EAAM2kD,GAGpB,IAGIU,GAHA7hD,EAAUi0B,EAAoBytB,EAAWD,GACzCjkD,EAASkkD,EAAU7jD,oBAAsB4jD,EAAS5jD,oBAClD6B,EAAUjX,KAAK+B,MAAMwV,EAAU,IAAMxC,CAIzC,IAAIkC,EAAU,EACZ,MAAI3mB,GAAQ6nE,eACN5gD,EAAU,EACLuhD,EAAS,mBAAoB,EAAGI,GAC9B3hD,EAAU,GACZuhD,EAAS,mBAAoB,GAAII,GAC/B3hD,EAAU,GACZuhD,EAAS,mBAAoB,GAAII,GAC/B3hD,EAAU,GACZuhD,EAAS,cAAe,KAAMI,GAC5B3hD,EAAU,GACZuhD,EAAS,mBAAoB,EAAGI,GAEhCJ,EAAS,WAAY,EAAGI,GAGjB,IAAZjiD,EACK6hD,EAAS,mBAAoB,EAAGI,GAEhCJ,EAAS,WAAY7hD,EAASiiD,EAKpC,IAAIjiD,EAAU,GACnB,MAAO6hD,GAAS,WAAY7hD,EAASiiD,EAGhC,IAAIjiD,EAAU,GACnB,MAAO6hD,GAAS,cAAe,EAAGI,EAG7B,IAAIjiD,EAAUoiD,EAAgB,CAEnC,MAAOP,GAAS,cADJ94D,KAAK+B,MAAMkV,EAAU,IACKiiD,GAGjC,GAAIjiD,EAAUqiD,EACnB,MAAOR,GAAS,QAAS,EAAGI,EAGvB,IAAIjiD,EAAUsiD,EAAkB,CAErC,MAAOT,GAAS,QADL94D,KAAK+B,MAAMkV,EAAUoiD,GACDH,GAG1B,GAAIjiD,EAAUuiD,EAEnB,MADAJ,GAASp5D,KAAK+B,MAAMkV,EAAUsiD,GACvBT,EAAS,eAAgBM,EAAQF,EAM1C,KAHAE,EAASK,EAAmBR,EAAWD,IAG1B,GAAI,CAEf,MAAOF,GAAS,UADG94D,KAAK+B,MAAMkV,EAAUsiD,GACCL,GAIzC,GAAIQ,GAAyBN,EAAS,GAClCO,EAAQ35D,KAAKC,MAAMm5D,EAAS,GAGhC,OAAIM,GAAyB,EACpBZ,EAAS,cAAea,EAAOT,GAG7BQ,EAAyB,EAC3BZ,EAAS,aAAca,EAAOT,GAI9BJ,EAAS,eAAgBa,EAAQ,EAAGT,GArMjD,GAAIL,GAAcrrE,EAAQ,KACtBumB,EAAQvmB,EAAQ,IAChBg+C,EAAsBh+C,EAAQ,IAC9BisE,EAAqBjsE,EAAQ,KAC7BurE,EAAWvrE,EAAQ,KAEnB6rE,EAAiB,KACjBC,EAA6B,KAC7BC,EAAmB,MACnBC,EAAwB,KAiM5B5rE,GAAOD,QAAU8qE,GxHokfX,SAAU7qE,EAAQD,EAASH,GAEjC,YyH7ufA,SAASqrE,GAAaptB,EAAeC,GACnC,GAAIstB,GAAWjlD,EAAM03B,GACjBmuB,EAAWZ,EAAS5kD,UACpB6kD,EAAYllD,EAAM23B,GAClBmuB,EAAYZ,EAAU7kD,SAE1B,OAAIwlD,GAAWC,GACL,EACCD,EAAWC,EACb,EAEA,EA9CX,GAAI9lD,GAAQvmB,EAAQ,GAkDpBI,GAAOD,QAAUkrE,GzHuxfX,SAAUjrE,EAAQD,EAASH,GAEjC,Y0H5zfA,SAAS0mB,GAAQF,GACf,MAAOA,aAAoBG,MAG7BvmB,EAAOD,QAAUumB,G1Hk1fX,SAAUtmB,EAAQD,EAASH,GAEjC,Y2Hj1fA,SAASm+C,GAA0BF,EAAeC,GAChD,GAAIstB,GAAWjlD,EAAM03B,GACjBwtB,EAAYllD,EAAM23B,EACtB,OAAOstB,GAAS5kD,UAAY6kD,EAAU7kD,UAzBxC,GAAIL,GAAQvmB,EAAQ,GA4BpBI,GAAOD,QAAUg+C,G3H82fX,SAAU/9C,EAAQD,EAASH,GAEjC,Y4Hr3fA,SAASisE,GAAoBhuB,EAAeC,GAC1C,GAAIstB,GAAWjlD,EAAM03B,GACjBwtB,EAAYllD,EAAM23B,GAElBouB,EAAOC,EAAWf,EAAUC,GAC5Be,EAAah6D,KAAK4B,IAAIq4D,EAA2BjB,EAAUC,GAM/D,OALAD,GAASkB,SAASlB,EAASmB,WAAaL,EAAOE,GAKxCF,GAAQE,GADUD,EAAWf,EAAUC,MAAgBa,IAjChE,GAAI/lD,GAAQvmB,EAAQ,IAChBysE,EAA6BzsE,EAAQ,KACrCusE,EAAavsE,EAAQ,IAmCzBI,GAAOD,QAAU8rE,G5Hm5fX,SAAU7rE,EAAQD,EAASH,GAEjC,Y6Hr6fA,SAASysE,GAA4BxuB,EAAeC,GAClD,GAAIstB,GAAWjlD,EAAM03B,GACjBwtB,EAAYllD,EAAM23B,EAKtB,OAAkB,KAHHstB,EAASoB,cAAgBnB,EAAUmB,gBAClCpB,EAASmB,WAAalB,EAAUkB,YA1BlD,GAAIpmD,GAAQvmB,EAAQ,GA+BpBI,GAAOD,QAAUssE,G7Hi8fX,SAAUrsE,EAAQD,EAASH,GAEjC,Y8H/7fA,SAASusE,GAAYtuB,EAAeC,GAClC,GAAIstB,GAAWjlD,EAAM03B,GACjBmuB,EAAWZ,EAAS5kD,UACpB6kD,EAAYllD,EAAM23B,GAClBmuB,EAAYZ,EAAU7kD,SAE1B,OAAIwlD,GAAWC,GACL,EACCD,EAAWC,EACb,EAEA,EA9CX,GAAI9lD,GAAQvmB,EAAQ,GAkDpBI,GAAOD,QAAUosE,G9Hy+fX,SAAUnsE,EAAQD,EAASH,GAEjC,Y+H7hgBA,IAAI6sE,GAA6B7sE,EAAQ,KACrC8sE,EAAoB9sE,EAAQ,IAMhCI,GAAOD,SACL8qE,gBAAiB4B,IACjBE,OAAQD,M/HqigBJ,SAAU1sE,EAAQD,EAASH,GAEjC,YgIhjgBA,SAAS6sE,KAsEP,QAASvB,GAAUpjD,EAAO3J,EAAOzb,GAC/BA,EAAUA,KAEV,IAAIi4B,EASJ,OAPEA,GAD0C,gBAAjCiyC,GAAsB9kD,GACtB8kD,EAAsB9kD,GACZ,IAAV3J,EACAyuD,EAAsB9kD,GAAO+kD,IAE7BD,EAAsB9kD,GAAOlP,MAAMtT,QAAQ,YAAa6Y,GAG/Dzb,EAAQ6oE,UACN7oE,EAAQsoE,WAAa,EAChB,MAAQrwC,EAERA,EAAS,OAIbA,EAzFT,GAAIiyC,IACFE,kBACED,IAAK,qBACLj0D,MAAO,+BAGTm0D,UACEF,IAAK,WACLj0D,MAAO,qBAGTo0D,YAAa,gBAEbC,kBACEJ,IAAK,qBACLj0D,MAAO,+BAGTs0D,UACEL,IAAK,WACLj0D,MAAO,qBAGTu0D,aACEN,IAAK,eACLj0D,MAAO,yBAGTw0D,QACEP,IAAK,SACLj0D,MAAO,mBAGTy0D,OACER,IAAK,QACLj0D,MAAO,kBAGT00D,cACET,IAAK,gBACLj0D,MAAO,0BAGT20D,SACEV,IAAK,UACLj0D,MAAO,oBAGT40D,aACEX,IAAK,eACLj0D,MAAO,yBAGT60D,QACEZ,IAAK,SACLj0D,MAAO,mBAGT80D,YACEb,IAAK,cACLj0D,MAAO,wBAGT+0D,cACEd,IAAK,gBACLj0D,MAAO,0BA2BX,QACEsyD,SAAUA,GAIdlrE,EAAOD,QAAU0sE,GhIujgBX,SAAUzsE,EAAQD,EAASH,GAEjC,YiIzpgBA,SAAS8sE,KAKP,GAAIkB,IAAe,MAAO,MAAO,MAAO,MAAO,MAAO,MAAO,MAAO,MAAO,MAAO,MAAO,MAAO,OAC5FC,GAAc,UAAW,WAAY,QAAS,QAAS,MAAO,OAAQ,OAAQ,SAAU,YAAa,UAAW,WAAY,YAC5HC,GAAiB,KAAM,KAAM,KAAM,KAAM,KAAM,KAAM,MACrDC,GAAiB,MAAO,MAAO,MAAO,MAAO,MAAO,MAAO,OAC3DC,GAAgB,SAAU,SAAU,UAAW,YAAa,WAAY,SAAU,YAClFC,GAAqB,KAAM,MAC3BC,GAAqB,KAAM,MAC3BC,GAAgB,OAAQ,QAExBjwB,GAEFkwB,IAAO,SAAUrnD,GACf,MAAO6mD,GAAY7mD,EAAKwlD,aAI1B8B,KAAQ,SAAUtnD,GAChB,MAAO8mD,GAAW9mD,EAAKwlD,aAIzB+B,GAAM,SAAUvnD,GACd,MAAO+mD,GAAc/mD,EAAKwnD,WAI5BC,IAAO,SAAUznD,GACf,MAAOgnD,GAAchnD,EAAKwnD,WAI5BE,KAAQ,SAAU1nD,GAChB,MAAOinD,GAAajnD,EAAKwnD,WAI3BG,EAAK,SAAU3nD,GACb,MAAQA,GAAK4nD,WAAa,IAAO,EAAIV,EAAkB,GAAKA,EAAkB,IAIhF9lE,EAAK,SAAU4e,GACb,MAAQA,GAAK4nD,WAAa,IAAO,EAAIT,EAAkB,GAAKA,EAAkB,IAIhFU,GAAM,SAAU7nD,GACd,MAAQA,GAAK4nD,WAAa,IAAO,EAAIR,EAAa,GAAKA,EAAa,IAYxE,QAPyB,IAAK,IAAK,MAAO,IAAK,IAAK,KAClC36D,QAAQ,SAAUq7D,GAClC3wB,EAAW2wB,EAAiB,KAAO,SAAU9nD,EAAMm3B,GACjD,MAAO4wB,GAAQ5wB,EAAW2wB,GAAgB9nD,QAK5Cm3B,WAAYA,EACZ6wB,uBAAwB9wB,EAA4BC,IAIxD,QAAS4wB,GAAS/+B,GAChB,GAAIi/B,GAASj/B,EAAS,GACtB,IAAIi/B,EAAS,IAAMA,EAAS,GAC1B,OAAQA,EAAS,IACf,IAAK,GACH,MAAOj/B,GAAS,IAClB,KAAK,GACH,MAAOA,GAAS,IAClB,KAAK,GACH,MAAOA,GAAS,KAGtB,MAAOA,GAAS,KApFlB,GAAIkO,GAA8Br+C,EAAQ,GAuF1CI,GAAOD,QAAU2sE,GjIiqgBX,SAAU1sE,EAAQD,EAASH,GAEjC,YkI1vgBA,IAAI6sE,GAA6B7sE,EAAQ,KACrC8sE,EAAoB9sE,EAAQ,IAOhCI,GAAOD,SACL8qE,gBAAiB4B,IACjBE,OAAQD,MlIkwgBJ,SAAU1sE,EAAQD,EAASH,GAEjC,YmI9wgBA,SAAS6sE,KAsEP,QAASvB,GAAUpjD,EAAO3J,EAAOzb,GAC/BA,EAAUA,KAEV,IAAIi4B,EASJ,OAPEA,GAD0C,gBAAjCiyC,GAAsB9kD,GACtB8kD,EAAsB9kD,GACZ,IAAV3J,EACAyuD,EAAsB9kD,GAAO+kD,IAE7BD,EAAsB9kD,GAAOlP,MAAMtT,QAAQ,YAAa6Y,GAG/Dzb,EAAQ6oE,UACN7oE,EAAQsoE,WAAa,EAChB,MAAQrwC,EAERA,EAAS,SAIbA,EAzFT,GAAIiyC,IACFE,kBACED,IAAK,wBACLj0D,MAAO,iCAGTm0D,UACEF,IAAK,aACLj0D,MAAO,sBAGTo0D,YAAa,kBAEbC,kBACEJ,IAAK,wBACLj0D,MAAO,iCAGTs0D,UACEL,IAAK,aACLj0D,MAAO,sBAGTu0D,aACEN,IAAK,gBACLj0D,MAAO,yBAGTw0D,QACEP,IAAK,UACLj0D,MAAO,mBAGTy0D,OACER,IAAK,SACLj0D,MAAO,mBAGT00D,cACET,IAAK,iBACLj0D,MAAO,2BAGT20D,SACEV,IAAK,WACLj0D,MAAO,qBAGT40D,aACEX,IAAK,eACLj0D,MAAO,sBAGT60D,QACEZ,IAAK,SACLj0D,MAAO,gBAGT80D,YACEb,IAAK,cACLj0D,MAAO,qBAGT+0D,cACEd,IAAK,gBACLj0D,MAAO,uBA2BX,QACEsyD,SAAUA,GAIdlrE,EAAOD,QAAU0sE,GnIqxgBX,SAAUzsE,EAAQD,EAASH,GAEjC,YoIv3gBA,SAAS8sE,KACP,GAAIkB,IAAe,OAAQ,OAAQ,OAAQ,QAAS,MAAO,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,QACvGC,GAAc,SAAU,UAAW,OAAQ,QAAS,MAAO,OAAQ,OAAQ,SAAU,YAAa,UAAW,WAAY,YACzHC,GAAiB,KAAM,KAAM,KAAM,KAAM,KAAM,KAAM,MACrDC,GAAiB,MAAO,MAAO,MAAO,MAAO,MAAO,MAAO,OAC3DC,GAAgB,SAAU,SAAU,UAAW,SAAU,UAAW,SAAU,UAC9EC,GAAqB,KAAM,MAC3BC,GAAqB,KAAM,MAC3BC,GAAgB,OAAQ,QAExBjwB,GAEFkwB,IAAO,SAAUrnD,GACf,MAAO6mD,GAAY7mD,EAAKwlD,aAI1B8B,KAAQ,SAAUtnD,GAChB,MAAO8mD,GAAW9mD,EAAKwlD,aAIzB+B,GAAM,SAAUvnD,GACd,MAAO+mD,GAAc/mD,EAAKwnD,WAI5BC,IAAO,SAAUznD,GACf,MAAOgnD,GAAchnD,EAAKwnD,WAI5BE,KAAQ,SAAU1nD,GAChB,MAAOinD,GAAajnD,EAAKwnD,WAI3BG,EAAK,SAAU3nD,GACb,MAAQA,GAAK4nD,WAAa,IAAO,EAAIV,EAAkB,GAAKA,EAAkB,IAIhF9lE,EAAK,SAAU4e,GACb,MAAQA,GAAK4nD,WAAa,IAAO,EAAIT,EAAkB,GAAKA,EAAkB,IAIhFU,GAAM,SAAU7nD,GACd,MAAQA,GAAK4nD,WAAa,IAAO,EAAIR,EAAa,GAAKA,EAAa,IAYxE,QAPyB,IAAK,IAAK,MAAO,IAAK,IAAK,KAClC36D,QAAQ,SAAUq7D,GAClC3wB,EAAW2wB,EAAiB,KAAO,SAAU9nD,EAAMm3B,GACjD,MAAO4wB,GAAQ5wB,EAAW2wB,GAAgB9nD,QAK5Cm3B,WAAYA,EACZ6wB,uBAAwB9wB,EAA4BC,IAIxD,QAAS4wB,GAAS/+B,GAChB,MAAOA,GAAS,IArElB,GAAIkO,GAA8Br+C,EAAQ,GAwE1CI,GAAOD,QAAU2sE,GpI+3gBX,SAAU1sE,EAAQD,GqIt8gBxBC,EAAAD,SAAkBymE,gBAAA,8BAAAyI,6BAAA,2CrI68gBZ,SAAUjvE,EAAQD,EAASH,GAEjC,YsIv4gBA,SAASsvE,GAA4BthD,GACnC,OAAO,EAAAuhD,EAAArhD,0BAAyBF,GtIy4gBlCltB,OAAOC,eAAeZ,EAAS,cAC7ByB,OAAO,IAETzB,EAAQgoE,eAAaxlE,EsIp9gBrB,IAAAgoB,GAAA3qB,EAAA,GACAwwC,EAAAxwC,EAAA,IACAuvE,EAAAvvE,EAAA,IAEA8qB,EAAA9qB,EAAA,GACA+qB,EAAA/qB,EAAA,GAEA4nE,EAAA5nE,EAAA,KtI29gBIwvE,EAEJ,SAAgCvsE,GAAO,MAAOA,IAAOA,EAAI7B,WAAa6B,GAAQqL,QAASrL,IAF7C2kE,GsI78gBpCO,EAAa,SAACjlE,EAAD0uC,GAAsC,GAArB93B,GAAqB83B,EAArB93B,MAEhC6rD,EAKEziE,EALFyiE,KACA5qC,EAIE73B,EAJF63B,OACA4rC,EAGEzjE,EAHFyjE,YAJqD8I,EAOnDvsE,EAFF0gE,iBALqDjhE,KAAA8sE,KAAAC,EAOnDxsE,EADF2gE,oBANqDlhE,KAAA+sE,EAMrC,sBANqCA,CASvD,OAAI9L,IAEA,EAAAj5C,EAAA7oB,GAAA0uC,EAAAD,QACEM,wBAAyBy+B,EAA2B3J,EAAK32D,IACzD+rB,OAAQA,EACR9pB,MAAO01D,EACP71B,WAAA,IAKD+yB,GAKH,EAAAl5C,EAAA7oB,GAAA,OAAK4xC,OAAO,EAAA5oB,EAAApU,KAAI84D,EAAAlhE,QAAO,gBAAgB,EAAAyc,EAAAlR,kBAAiBC,MACtD,EAAA6Q,EAAA7oB,GAAA,KAAG4xC,MAAO87B,EAAAlhE,QAAO,2BACdu1D,GACD,EAAAl5C,EAAA7oB,GAAA,OACEu2B,eAAA,EACApN,MAAM,6BACN3I,MAAM,KACN4I,OAAO,KACPykD,QAAQ,YACRj8B,MAAO87B,EAAAlhE,QAAO,wBAEd,EAAAqc,EAAA7oB,GAAA,QACE8tE,KAAK,OACLC,OAAO,UACPC,iBAAe,QACfC,kBAAgB,QAChBC,eAAa,IACbtvE,EAAE,4BArBH,KtIw/gBXP,GsIv9gBSgoE,ctI29gBH,SAAU/nE,EAAQD,GuIvihBxBC,EAAAD,SAAkB8vE,cAAA,0BAAAC,yBAAA,qCAAAC,qBAAA,iCAAAC,2BAAA,uCAAAC,oCAAA,gDAAAC,4BAAA,0CvI8ihBZ,SAAUlwE,EAAQD,EAASH,GAEjC,YAoBA,SAASuwE,GAAkBr+D,GAAM,MAAO,YAAc,GAAIs+D,GAAMt+D,EAAGjC,MAAMzJ,KAAMlE,UAAY,OAAO,IAAIuL,SAAQ,SAAUC,EAAS0kB,GAAU,QAASi+C,GAAK5tE,EAAKikC,GAAO,IAAM,GAAI4B,GAAO8nC,EAAI3tE,GAAKikC,GAAUllC,EAAQ8mC,EAAK9mC,MAAS,MAAOqP,GAAwB,WAAfuhB,GAAOvhB,GAAkB,IAAIy3B,EAAK5V,KAAiC,MAAOjlB,SAAQC,QAAQlM,GAAOmM,KAAK,SAAUnM,GAAS6uE,EAAK,OAAQ7uE,IAAW,SAAU4xB,GAAOi9C,EAAK,QAASj9C,IAAtI1lB,GAAQlM,GAA4I,MAAO6uE,GAAK,WAEzb,QAASt6C,GAAgBC,EAAUC,GAAe,KAAMD,YAAoBC,IAAgB,KAAM,IAAI1E,WAAU,qCAEhH,QAAS2E,GAA2BpE,EAAM3xB,GAAQ,IAAK2xB,EAAQ,KAAM,IAAIqE,gBAAe,4DAAgE,QAAOh2B,GAAyB,gBAATA,IAAqC,kBAATA,GAA8B2xB,EAAP3xB,EAElO,QAASi2B,GAAUC,EAAUC,GAAc,GAA0B,kBAAfA,IAA4C,OAAfA,EAAuB,KAAM,IAAI/E,WAAU,iEAAoE+E,GAAeD,GAASl1B,UAAYT,OAAO0Z,OAAOkc,GAAcA,EAAWn1B,WAAa8I,aAAezI,MAAO60B,EAAUx1B,YAAY,EAAO01B,UAAU,EAAM31B,cAAc,KAAe01B,IAAY51B,OAAOuZ,eAAiBvZ,OAAOuZ,eAAeoc,EAAUC,GAAcD,EAASnc,UAAYoc,GAvBje51B,OAAOC,eAAeZ,EAAS,cAC7ByB,OAAO,IAETzB,EAAQ6lE,oBAAkBrjE,EAE1B,IAAIo8C,GAAWj+C,OAAOm+C,QAAU,SAAUnoB,GAAU,IAAK,GAAIz2B,GAAI,EAAGA,EAAIiC,UAAUC,OAAQlC,IAAK,CAAE,GAAIwuC,GAASvsC,UAAUjC,EAAI,KAAK,GAAIwC,KAAOgsC,GAAc/tC,OAAOS,UAAUC,eAAejB,KAAKsuC,EAAQhsC,KAAQi0B,EAAOj0B,GAAOgsC,EAAOhsC,IAAY,MAAOi0B,IAEnPD,EAAe,WAAc,QAASvV,GAAiBwV,EAAQ5zB,GAAS,IAAK,GAAI7C,GAAI,EAAGA,EAAI6C,EAAMX,OAAQlC,IAAK,CAAE,GAAI02B,GAAa7zB,EAAM7C,EAAI02B,GAAW91B,WAAa81B,EAAW91B,aAAc,EAAO81B,EAAW/1B,cAAe,EAAU,SAAW+1B,KAAYA,EAAWJ,UAAW,GAAM71B,OAAOC,eAAe+1B,EAAQC,EAAWl0B,IAAKk0B,IAAiB,MAAO,UAAUV,EAAaW,EAAYC,GAAiJ,MAA9HD,IAAY1V,EAAiB+U,EAAY90B,UAAWy1B,GAAiBC,GAAa3V,EAAiB+U,EAAaY,GAAqBZ,MwIzjhBhiB4uC,EAAAjlE,EAAA,IAA+DuvE,EAAAvvE,EAAA,IAC/D0wE,EAAA1wE,EAAA,KACA2wE,EAAA3wE,EAAA,KxImnhBI4wE,GA1CkBzwE,EwItjhBT6lE,gBxIsjhBmC,SAAUd,GwIrjhBxD,QAAAc,GAAa9iE,GAAcizB,EAAA3vB,KAAAw/D,EAAA,IAAApoC,GAAAtH,EAAA9vB,MAAAw/D,EAAA1rD,WAAAxZ,OAAAu2B,eAAA2uC,IAAAzlE,KAAAiG,KACnBtD,GADmB0tE,GAAArwE,KAAAq9B,EAAA,IAEjB+nC,GAASziE,EAATyiE,KACF92C,GAAW,EAAA0gD,EAAA1gD,UAAY82C,EAAK32D,GAHT,OAIzB4uB,GAAK7yB,OACH8jB,YALuB+O,ExI4lhB3B,MAtCApH,GAAUwvC,EAAiBd,GAkB3BruC,EAAamvC,IACXnjE,IAAK,4BACLjB,MAAO,SwIjkhBkBivE,GAEzB,GADkBrqE,KAAKtD,MAAMyiE,KAAK32D,KAAO6hE,EAAUlL,KAAK32D,GACzC,CACb,GAAM6f,IAAW,EAAA0gD,EAAA1gD,UAAYgiD,EAAUlL,KAAK32D,GAC5CxI,MAAK0H,UACH2gB,iBxIskhBJhsB,IAAK,SACLjB,MAAO,WwIzhhBP,MAAO4E,MAAKtD,MAAMwH,OAAXq0C,KACFv4C,KAAKuE,OACRq7D,eAAgB5/D,KAAKsqE,0BxI8hhBlB9K,GACPf,EAAgBzsC,eAEK,WACrB,GAAIkc,GAASluC,IAEbA,MwI/khBAsqE,mBxI+khB0B,WACxB,GAAIl/B,GAAO2+B,EAAgCnmC,mBAAmBS,KwIhlhB3C,QAAAkmC,GAAOjI,GAAP,GAAAl4B,GAAA+yB,EAAAgC,EAAAhnB,EAAAunB,EAAA8K,CAAA,OAAA5mC,oBAAAjE,KAAA,SAAA8L,GAAA,cAAAA,EAAA/G,KAAA+G,EAAAhoC,MAAA,aAAA2mC,GACoB8D,EAAKxxC,MAApCygE,EADW/yB,EACX+yB,SAAUgC,EADC/0B,EACD+0B,KAAMhnB,EADL/N,EACK+N,WAClBunB,GAAO,EAAAwK,EAAAO,YAAWtN,EAAUgC,EAAMmD,GACxCp0B,EAAKxmC,UACH2gB,UAAU,EACVq3C,KAAMA,EACNj1D,MAAO,OANUghC,EAAA/G,KAAA,EAAA+G,EAAAhoC,KAAA,GASX,EAAA0mE,EAAAO,cAAahL,EAAMvnB,EATR,SAajB,EAAA4wB,EAAA7gD,aAAYi3C,EAAK32D,GAAI85D,EAAY95D,IAIjC0lC,EAAKxmC,UAEDm4D,+BAA+B,GAEjC,WACEp4D,WAAW,WACTymC,EAAKxmC,UACHm4D,+BAA+B,KAEhC,OA1BUp0B,EAAAhoC,KAAA,iBAAAgoC,EAAA/G,KAAA,GAAA+G,EAAAk/B,GAAAl/B,EAAA,SA8BX++B,EAAe,0BACrBvgE,QAAQQ,MAAM+/D,GACdt8B,EAAKxmC,UACH2gB,UAAU,EACVq3C,KAAM,KACNj1D,MAAO,GAAIE,OAAM6/D,IAnCF,yBAAA/+B,GAAA7G,SAAA2lC,EAAAr8B,IAAA,UxI2ohBnB,OAAO,UAAU08B,GACf,MAAOx/B,GAAK3hC,MAAMzJ,KAAMlE,kBAOxB,SAAUlC,EAAQD,EAASH,GAEjC,YyI5rhBO,SAASixE,GAAYtN,EAAkBgC,EAAYmD,GACxD,OACEnF,WACA31C,OAAQ23C,EAAK32D,GACb2f,cAAem6C,EAAY95D,IzI2rhB/BlO,OAAOC,eAAeZ,EAAS,cAC7ByB,OAAO,IAETzB,EyIlshBgB8wE,czI6shBV,SAAU7wE,EAAQD,EAASH,GAEjC,YA0DA,SAASuwE,GAAkBr+D,GAAM,MAAO,YAAc,GAAIs+D,GAAMt+D,EAAGjC,MAAMzJ,KAAMlE,UAAY,OAAO,IAAIuL,SAAQ,SAAUC,EAAS0kB,GAAU,QAASi+C,GAAK5tE,EAAKikC,GAAO,IAAM,GAAI4B,GAAO8nC,EAAI3tE,GAAKikC,GAAUllC,EAAQ8mC,EAAK9mC,MAAS,MAAOqP,GAAwB,WAAfuhB,GAAOvhB,GAAkB,IAAIy3B,EAAK5V,KAAiC,MAAOjlB,SAAQC,QAAQlM,GAAOmM,KAAK,SAAUnM,GAAS6uE,EAAK,OAAQ7uE,IAAW,SAAU4xB,GAAOi9C,EAAK,QAASj9C,IAAtI1lB,GAAQlM,GAA4I,MAAO6uE,GAAK,WAvDzb3vE,OAAOC,eAAeZ,EAAS,cAC7ByB,OAAO,IAETzB,EAAQ+wE,iBAAevuE,EAEvB,I0IzthBA0uE,I1IythBmBlxE,EAAQ+wE,aAAe,WACxC,GAAIt/B,GAAO2+B,EAAgCnmC,mBAAmBS,K0IrthBzD,QAAAkmC,GAA6B7K,EAAYvnB,GAAzC,GAAA2yB,GAAAC,EAAAC,CAAA,OAAApnC,oBAAAjE,KAAA,SAAA8L,GAAA,cAAAA,EAAA/G,KAAA+G,EAAAhoC,MAAA,WACA,EAAAslE,EAAAtgD,kBADA,CAAAgjB,EAAAhoC,KAAA,aAEG,IAAIkH,OAAM,0BAFb,cAAA8gC,GAAAhoC,KAAA,GAKqB,EAAAonE,EAAA3yB,qBAAoBC,GAC3C8yB,OACAC,mBAPE,cAKCJ,GALDr/B,EAAA7J,KASCmpC,GAAe,EAAAF,EAAA3yB,uBAClBzG,WACAnuC,IAAI,aAXFmoC,EAAAhoC,KAAA,EAaesnE,EAAa9uE,MAC/BkvE,IAAKL,EAAYK,IACjBhjD,cAAeu3C,EAAKv3C,cACpBX,OAAQlc,OAAOo0D,EAAKl4C,QACpB4jD,UAAW9/D,OAAOo0D,EAAKvC,WAjBpB,cAaC6N,GAbDv/B,EAAA7J,KAAA6J,EAAA1J,OAAA,SAmBEipC,EAnBF,yBAAAv/B,GAAA7G,SAAA2lC,EAAAvqE,Q1I6vhBL,OAAO,UAAsB4qE,EAAIS,GAC/B,MAAOjgC,GAAK3hC,MAAMzJ,KAAMlE,e0InwhB5BtC,EAAA,KACAuvE,EAAAvvE,EAAA,K1I8whBM,SAAUI,EAAQD,EAASH,GAEjC,Y2InwhBAA,GAAQ,KACRI,EAAOD,QAAUH,EAAQ,IAAiBsO,S3I0xhBpC,SAAUlO,EAAQD,EAASH,GAEjC,Y4I9xhBAA,GAAA,KACAA,EAAA,KACAA,EAAA,M5IuyhBM,SAAUI,EAAQD,EAASH,GAEjC,cAC4B,SAASkmC,G6I5yhBrC,GAAI4rC,GAAY,WACZ,OAAsB,KAAX5rC,EACP,MAAOA,EAEX,IAAsB,mBAAX50B,QACP,MAAOA,OAEX,IAAoB,mBAAT4gB,MACP,MAAOA,KAEX,MAAM,IAAI/gB,OAAM,oCAGG,oBAAZtD,WAEPikE,EAAA,QAAsBjkE,QAAU7N,EAAQ,O7Ii0hBfO,KAAKJ,EAASH,EAAoB,MAIzD,SAAUI,EAAQD,EAASH,GAEjC,Y8Ij1hBK+P,OAAMxO,UAAUihB,MACjB1hB,OAAOC,eAAegP,MAAMxO,UAAW,QACnCK,MAAO,SAAU+qC,GAEb,GAAY,MAARnmC,KACA,KAAM,IAAImrB,WAAU,gCAExB,IAAI9wB,GAAIC,OAAO0F,MAEX6C,EAAMxI,EAAE0B,SAAW,CAEvB,IAAyB,kBAAdoqC,GACP,KAAM,IAAIhb,WAAU,+BAOxB,KAJA,GAAID,GAAUpvB,UAAU,GAEpBgR,EAAI,EAEDA,EAAIjK,GAAK,CAKZ,GAAIujC,GAAS/rC,EAAEyS,EACf,IAAIq5B,EAAUpsC,KAAKmxB,EAASkb,EAAQt5B,EAAGzS,GACnC,MAAO+rC,EAGXt5B,U9Io3hBV,SAAUlT,EAAQD,EAASH,GAEjC,Y+In5hBK+P,OAAMxO,UAAUwwE,WACjBjxE,OAAOC,eAAegP,MAAMxO,UAAW,aACnCK,MAAO,SAAU+qC,GAEb,GAAY,MAARnmC,KACA,KAAM,IAAImrB,WAAU,gCAExB,IAAI9wB,GAAIC,OAAO0F,MAEX6C,EAAMxI,EAAE0B,SAAW,CAEvB,IAAyB,kBAAdoqC,GACP,KAAM,IAAIhb,WAAU,+BAOxB,KAJA,GAAID,GAAUpvB,UAAU,GAEpBgR,EAAI,EAEDA,EAAIjK,GAAK,CAKZ,GAAIujC,GAAS/rC,EAAEyS,EACf,IAAIq5B,EAAUpsC,KAAKmxB,EAASkb,EAAQt5B,EAAGzS,GACnC,MAAOyS,EAGXA,KAGJ,OAAQ,M/Im7hBd,SAAUlT,EAAQD,EAASH,GAEjC,YgJl0hBO,SAASuvB,KA8CZ,QAASyiD,GAAUrxE,GAEfsxE,EADUC,EAAMvxE,GACE,gBACXuxE,GAAMvxE,GAKjB,QAASg9B,GAAIh9B,GAKT,MAJAA,GAAOA,GAAQwxE,EACVl5D,EAASi5D,EAAOvxE,IACjBsQ,EAAM,UAAYtQ,KAAMA,IAErBuxE,EAAMvxE,GAMjB,QAASm+C,GAAch8C,EAASnC,OACfgC,KAAThC,EACAA,EAAOwxE,EAGa,gBAATxxE,IAA8B,KAATA,GAC5BsQ,EAAM,gBAAkBtQ,KAAMA,EAAO,KAGzCsY,EAASi5D,EAAOvxE,IAChBsQ,EAAM,iBAAmBtQ,KAAMA,GAEnC,IAAIg9B,GAAM,GAAIy0C,GAAgBtvE,EAASnC,EAAMwkB,EAG7C,OAFA+sD,GAAMvxE,GAAQg9B,EACds0C,EAAat0C,EAAK,UACXA,EAKX,QAAS00C,KAEL,MAAOvxE,QAAOuS,KAAK6+D,GAAOl7D,IAAI,SAAUrW,GAAQ,MAAOuxE,GAAMvxE,KASjE,QAAS2xE,GAAgB3xE,EAAM4xE,EAAeC,EAAmBC,EAASC,GAElEC,EAAUhyE,IACVsQ,EAAM,qBAAuBtQ,KAAMA,IAGvCgyE,EAAUhyE,GAAQ4xE,EAEdE,IACAG,EAASjyE,GAAQ8xE,EAEjBJ,IAAUz+D,QAAQ,SAAU+pB,GACxB80C,EAAQ,SAAU90C,KAI1B,IAAIk1C,GAAmB,SAAUC,GAQ7B,WAPe,KAAXA,IAAqBA,EAASn1C,KACN,kBAAjBm1C,GAAOnyE,IAGdsQ,EAAM,wBAA0BtQ,KAAMA,IAGnCmyE,EAAOnyE,KAiBlB,YAd0BgC,KAAtB6vE,IACA,EAAAO,EAAAC,YAAWH,EAAkBL,GAGjCrtD,EAAUxkB,GAAQkyE,EAElBT,EAAgB7wE,UAAUZ,GAAQ,WAE9B,IAAK,GADDwyB,MACKtjB,EAAK,EAAGA,EAAKvN,UAAUC,OAAQsN,IACpCsjB,EAAKtjB,GAAMvN,UAAUuN,EAGzB,OADiBrJ,MAAKysE,YAAYjlE,KAAKxH,KAAM7F,GAC3BsP,MAAMzJ,KAAMksE,EAAyBv/C,OAEpD0/C,EAOX,QAASK,GAAgBhwE,IACrB,EAAA6vE,EAAAC,YAAW7tD,EAAWjiB,GAE1B,QAAS+uE,GAAat0C,EAAKw1C,GACvBryE,OAAOuS,KAAKs/D,GAAW/+D,QAAQ,SAAUw/D,GAErC,GAAIC,GAAcC,EAAa31C,EAAKy1C,EAChB,QAAhBC,GAGAT,EAASS,IACTT,EAASS,GAAaF,EAAWx1C,KAM7C,QAAS21C,GAAa31C,EAAKh9B,GACvB,GAAa,eAATA,EACA,MAAO,KAEX,IAAI4yE,GAAa5yE,CACHg9B,GAAI76B,OAClB,OAAOywE,GAtKX,GAAIrB,MACAS,KACAC,KAEAztD,GAGA/jB,YAAY,EACZ09C,cAAeA,EACfnhB,IAAKA,EACL61C,KAAM,KACN3lE,QAASA,QACTipC,YAAa,QACb6L,UACI2vB,gBAAiBA,EACjB/iD,wBAAyBA,EACzB2jD,gBAAiBA,EACjBO,kCACAC,4BACA1B,UAAWA,EACXW,UAAWA,EACXW,aAAcA,EACdzlE,QAASA,QACTmlE,yBAiJR,QApIA,EAAAD,EAAAY,eAAcxuD,EAAW,UAAWA,GAEpCrkB,OAAOC,eAAeokB,EAAW,QAC7BjkB,IAAKmxE,KAqBT,EAAAU,EAAAY,eAAch2C,EAAK,MAAOy0C,GA4GnBjtD,EAEX,QAASlU,GAAMoE,EAAM8d,GACjB,KAAMygD,GAAUp5D,OAAOnF,EAAM8d,GhJyphBjCryB,OAAOC,eAAeZ,EAAS,cAC3ByB,OAAO,IAEXzB,EgJx0hBgBovB,yBAxJhB,IAAAwjD,GAAA/yE,EAAA,GAEIiZ,EAAW,SAAUhW,EAAKJ,GAC1B,MAAO/B,QAAOS,UAAUC,eAAejB,KAAK0C,EAAKJ,IAEjDsvE,EAAqB,YAGrB0B,KAKAzB,EAAiC,WACjC,QAASA,GAAgBtvE,EAASnC,EAAMmzE,GACpCttE,KAAKstE,UAAYA,EACjBttE,KAAKutE,YAAa,EAClBvtE,KAAKwtE,aACLxtE,KAAKytE,MAAQtzE,EACb6F,KAAK0tE,UAAW,EAAAnB,EAAAoB,UAASrxE,GACzB0D,KAAKm8C,UACDyxB,OAAQ,WAAc,MAAO,OAC7B3e,SAAU,WAAc,MAAO5nD,SAAQC,QAAQ,OAC/CumE,qBAAsB,SAAUlmE,GAC5B0lE,EAAepxE,KAAK0L,GAEpBF,WAAW,WAAc,MAAOE,GAAS,OAAU,IAEvDmmE,wBAAyB,SAAUnmE,GAC/B0lE,EAAiBA,EAAe/8D,OAAO,SAAU8V,GAAY,MAAOA,KAAaze,MA6G7F,MAzGArN,QAAOC,eAAeqxE,EAAgB7wE,UAAW,QAC7CL,IAAK,WAED,MADAsF,MAAK+tE,kBACE/tE,KAAKytE,OAEhBhzE,YAAY,EACZD,cAAc,IAElBF,OAAOC,eAAeqxE,EAAgB7wE,UAAW,WAC7CL,IAAK,WAED,MADAsF,MAAK+tE,kBACE/tE,KAAK0tE,UAEhBjzE,YAAY,EACZD,cAAc,IAElBoxE,EAAgB7wE,UAAU+hD,OAAS,WAC/B,GAAI1lB,GAAQp3B,IACZ,OAAO,IAAIqH,SAAQ,SAAUC,GACzB8vB,EAAM22C,kBACNzmE,MAECC,KAAK,WACN6vB,EAAMk2C,UAAUnxB,SAASqvB,UAAUp0C,EAAMq2C,MACzC,IAAIO,KAMJ,OALA1zE,QAAOuS,KAAKuqB,EAAMo2C,WAAWpgE,QAAQ,SAAU6gE,GAC3C3zE,OAAOuS,KAAKuqB,EAAMo2C,UAAUS,IAAa7gE,QAAQ,SAAU8gE,GACvDF,EAAS/xE,KAAKm7B,EAAMo2C,UAAUS,GAAYC,QAG3C7mE,QAAQqlB,IAAIshD,EAASx9D,IAAI,SAAU29D,GACtC,MAAOA,GAAQhyB,SAASW,cAG3Bv1C,KAAK,WACN6vB,EAAMm2C,YAAa,EACnBn2C,EAAMo2C,gBAiBd5B,EAAgB7wE,UAAU0xE,YAAc,SAAUtyE,EAAMi0E,GAMpD,OAL2B,KAAvBA,IAAiCA,EAAqBzC,GAC1D3rE,KAAK+tE,kBACA/tE,KAAKwtE,UAAUrzE,KAChB6F,KAAKwtE,UAAUrzE,QAEd6F,KAAKwtE,UAAUrzE,GAAMi0E,GAAqB,CAK3C,GAAIC,GAAoBD,IAAuBzC,EACzCyC,MACAjyE,GACFgyE,EAAUnuE,KAAKstE,UAAUnxB,SAASgwB,UAAUhyE,GAAM6F,KAAMA,KAAKsuE,UAAU9mE,KAAKxH,MAAOquE,EACvFruE,MAAKwtE,UAAUrzE,GAAMi0E,GAAsBD,EAE/C,MAAOnuE,MAAKwtE,UAAUrzE,GAAMi0E,IAMhCxC,EAAgB7wE,UAAUuzE,UAAY,SAAU5xE,GAC5C,GAAI06B,GAAQp3B,MAEZ,EAAAusE,EAAAC,YAAWxsE,KAAMtD,GAUbA,EAAMy/C,UAAYz/C,EAAMy/C,SAAS0xB,uBACjCR,EAAejgE,QAAQ,SAAUgZ,GAC7BgR,EAAM+kB,SAAS0xB,qBAAqBznD,KAExCinD,OAORzB,EAAgB7wE,UAAUgzE,gBAAkB,WACpC/tE,KAAKutE,YACL9iE,EAAM,eAAiBtQ,KAAM6F,KAAKytE,SAGnC7B,IAIVA,GAAgB7wE,UAAUZ,MAAQyxE,EAAgB7wE,UAAUuB,SACzDsvE,EAAgB7wE,UAAU+hD,QAC1B7yC,QAAQC,IAAI,KAwLhB,IAAIqkE,IACAC,SAAU,iFAEVC,eAAgB,6BAChBC,gBAAiB,8CACjBC,cAAe,+CACfC,oBAAqB,sDACrBC,mBAAoB,0LAIpBC,uBAAwB,2EAGxB1B,EAAY,GAAAb,GAAAW,aAAiB,MAAO,WAAYqB,IhJy/hB9C,SAAU30E,EAAQD,EAASH,GAEjC,YiJ50iBA,SAASm0E,GAASvyE,GACd,MAAOoxE,OAAWrwE,GAAWf,GAejC,QAASoxE,GAAWl8C,EAAQ+X,GACxB,KAAMA,YAAkB/tC,SACpB,MAAO+tC,EAEX,QAAQA,EAAOxkC,aACX,IAAKsc,MAGD,GAAI4uD,GAAY1mC,CAChB,OAAO,IAAIloB,MAAK4uD,EAAU3uD,UAC9B,KAAK9lB,YACc6B,KAAXm0B,IACAA,KAEJ,MACJ,KAAK/mB,OAED+mB,IACA,MACJ,SAEI,MAAO+X,GAEf,IAAK,GAAI2mC,KAAQ3mC,GACRA,EAAOrtC,eAAeg0E,KAG3B1+C,EAAO0+C,GAAQxC,EAAWl8C,EAAO0+C,GAAO3mC,EAAO2mC,IAEnD,OAAO1+C,GAIX,QAAS68C,GAAc1wE,EAAKuyE,EAAM5zE,GAC9BqB,EAAIuyE,GAAQ5zE,EAtDhBd,OAAOC,eAAeZ,EAAS,cAAgByB,OAAO,IAOtDzB,EAAQg0E,SAAWA,EA4CnBh0E,EAAQ6yE,WAAaA,EAKrB7yE,EAAQwzE,cAAgBA,GjJw2iBlB,SAAUvzE,EAAQD,EAASH,GAEjC,YkJl6iBAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAIu2C,GAA0B,WAC1B,QAASA,KACL,GAAIva,GAAQp3B,IACZA,MAAKisB,QAAU,GAAI5kB,SAAQ,SAAUC,EAAS0kB,GAC1CoL,EAAM9vB,QAAUA,EAChB8vB,EAAMpL,OAASA,IAkCvB,MAxBA2lB,GAAS52C,UAAU62C,aAAe,SAAUjqC,GACxC,GAAIyvB,GAAQp3B,IACZ,OAAO,UAAUyK,EAAOrP,GAChBqP,EACA2sB,EAAMpL,OAAOvhB,GAGb2sB,EAAM9vB,QAAQlM,GAEM,kBAAbuM,KAGPyvB,EAAMnL,QAAQuZ,MAAM,cAGI,IAApB79B,EAAS5L,OACT4L,EAAS8C,GAGT9C,EAAS8C,EAAOrP,MAKzBu2C,IAEXh4C,GAAQg4C,SAAWA,GlJw7iBb,SAAU/3C,EAAQD,EAASH,GAEjC,YAkBA,IAAIoF,GAA4B,kBAAXuI,SAAoD,gBAApBA,QAAOC,SAAwB,SAAU3K,GAAO,aAAcA,IAAS,SAAUA,GAAO,MAAOA,IAAyB,kBAAX0K,SAAyB1K,EAAIoH,cAAgBsD,QAAU1K,IAAQ0K,OAAOpM,UAAY,eAAkB0B,GmJt/iBtQnC,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAIu9C,GAAcn/C,EAAQ,GAK1BG,GAAQs1E,MAAQ,WACZ,MAAyB,mBAAdvmD,YAC2B,gBAA3BA,WAAA,UACAA,UAAA,UAGA,IAWf/uB,EAAQi2D,gBAAkB,WACtB,MAA0B,mBAAX9kD,YACRA,OAAA,SAAqBA,OAAA,UAAsBA,OAAA,WAC9C,oDAAoDhM,KAAKnF,EAAQs1E,UAOzEt1E,EAAQk2D,cAAgB,WACpB,MAA6B,YAArB,mBAAOnnC,WAAP,YAAA9pB,EAAO8pB,aAAmD,gBAAzBA,UAAA,SAO7C/uB,EAAQgS,UAAY,WAChB,OAA6C,IAAtCgtC,EAAYxI,UAAUC,cAA6D,IAArCuI,EAAYxI,UAAUE,anJ2/iBzE,SAAUz2C,EAAQD,EAASH,GAEjC,YoJjjjBA,SAAS01E,GAAaC,GAClB,GAAI56C,GAAS66C,CAEb,OADAA,GAAoBD,EACb56C,EARXj6B,OAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAIi0E,GAAa,gBACbD,EAAoBzkE,MACnBykE,iBAOLz1E,GAAQu1E,aAAeA,CACvB,IAAII,GAA+B,WAC/B,QAASA,GAAczgE,EAAMvF,GACzBtJ,KAAK6O,KAAOA,EACZ7O,KAAKsJ,QAAUA,CAGf,IAAI8lE,EAEAA,EAAkBpvE,KAAMktE,EAAanyE,UAAUiZ,YAE9C,CACD,GAAIu7D,GAAQ5kE,MAAMlB,MAAMzJ,KAAMlE,UAC9BkE,MAAK7F,KAAOk1E,EAEZ/0E,OAAOC,eAAeyF,KAAM,SACxBtF,IAAK,WACD,MAAO60E,GAAMvzE,UAK7B,MAAOszE,KAEX31E,GAAQ21E,cAAgBA,EAExBA,EAAcv0E,UAAYT,OAAO0Z,OAAOrJ,MAAM5P,WAC9Cu0E,EAAcv0E,UAAU8I,YAAcyrE,EACtCA,EAAcv0E,UAAUZ,KAAOk1E,CAC/B,IAAInC,GAA8B,WAC9B,QAASA,GAAaiB,EAASvB,EAAa2B,GACxCvuE,KAAKmuE,QAAUA,EACfnuE,KAAK4sE,YAAcA,EACnB5sE,KAAKuuE,OAASA,EAEdvuE,KAAKwvE,QAAU,gBAgCnB,MA7BAtC,GAAanyE,UAAUiZ,OAAS,SAAUnF,EAAMxD,OAC/BlP,KAATkP,IACAA,KAEJ,IAEI/B,GAFAmmE,EAAWzvE,KAAKuuE,OAAO1/D,GACvB6gE,EAAW1vE,KAAKmuE,QAAU,IAAMt/D,CAGhCvF,OADanN,KAAbszE,EACU,QAGAA,EAASvwE,QAAQc,KAAKwvE,QAAS,SAAUlU,EAAOj/D,GACtD,GAAIjB,GAAQiQ,EAAKhP,EACjB,YAAiBF,KAAVf,EAAsBA,EAAMkT,WAAa,IAAMjS,EAAM,OAIpEiN,EAAUtJ,KAAK4sE,YAAc,KAAOtjE,EAAU,KAAOomE,EAAW,IAChE,IAAI1iD,GAAM,GAAIsiD,GAAcI,EAAUpmE,EAGtC,KAAK,GAAI0lE,KAAQ3jE,GACRA,EAAKrQ,eAAeg0E,IAA4B,MAAnBA,EAAKpyE,OAAO,KAG9CowB,EAAIgiD,GAAQ3jE,EAAK2jE,GAErB,OAAOhiD,IAEJkgD,IAEXvzE,GAAQuzE,aAAeA,GpJ4jjBjB,SAAUtzE,EAAQD,EAASH,GAEjC,YAkBA,IAAIoF,GAA4B,kBAAXuI,SAAoD,gBAApBA,QAAOC,SAAwB,SAAU3K,GAAO,aAAcA,IAAS,SAAUA,GAAO,MAAOA,IAAyB,kBAAX0K,SAAyB1K,EAAIoH,cAAgBsD,QAAU1K,IAAQ0K,OAAOpM,UAAY,eAAkB0B,GqJhpjBtQnC,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAIu0E,GAAUn2E,EAAQ,IAClBo2E,EAASp2E,EAAQ,GAWrBG,GAAQk2E,OAAS,SAAUnuD,GACvB,GAAIouD,MAAaC,KAAa1kE,KAAW2kE,EAAY,EACrD,KACI,GAAIpyB,GAAQl8B,EAAM5Q,MAAM,IACxBg/D,GAASF,EAAO10B,SAASy0B,EAAQ10B,aAAa2C,EAAM,KAAO,IAC3DmyB,EAASH,EAAO10B,SAASy0B,EAAQ10B,aAAa2C,EAAM,KAAO,IAC3DoyB,EAAYpyB,EAAM,GAClBvyC,EAAO0kE,EAAA,YACAA,GAAA,EAEX,MAAOhwE,IACP,OACI+vE,OAAQA,EACRC,OAAQA,EACR1kE,KAAMA,EACN2kE,UAAWA,IAcnBr2E,EAAQs2E,iBAAmB,SAAUvuD,GACjC,GAA0FwuD,GAAYC,EAAlGJ,EAASp2E,EAAQk2E,OAAOnuD,GAAOquD,OAAQx9B,EAAMvmC,KAAKC,OAAM,GAAIkU,OAAOC,UAAY,IAgBnF,OAfsB,gBAAlB,KAAO2vD,EAAP,YAAAnxE,EAAOmxE,MACHA,EAAO/0E,eAAe,OACtBk1E,EAAaH,EAAA,IAERA,EAAO/0E,eAAe,SAC3Bk1E,EAAaH,EAAA,KAGbI,EADAJ,EAAO/0E,eAAe,OACT+0E,EAAA,IAIAG,EAAa,OAG1B39B,GAAO29B,GAAcC,GAAc59B,GAAO29B,GAAc39B,GAAO49B,GAY3Ex2E,EAAQy2E,aAAe,SAAU1uD,GAC7B,GAAIquD,GAASp2E,EAAQk2E,OAAOnuD,GAAOquD,MACnC,OAAsB,gBAAlB,KAAOA,EAAP,YAAAnxE,EAAOmxE,KAAuBA,EAAO/0E,eAAe,OAC7C+0E,EAAA,IAEJ,MAaXp2E,EAAQ6yD,cAAgB,SAAU9qC,GAC9B,GAAI2uD,GAAU12E,EAAQk2E,OAAOnuD,GAAQquD,EAASM,EAAQN,MACtD,SAAUM,EAAQL,aACZD,GACgB,gBAAlB,KAAOA,EAAP,YAAAnxE,EAAOmxE,KACPA,EAAO/0E,eAAe,QAY9BrB,EAAQ0yD,QAAU,SAAU3qC,GACxB,GAAIquD,GAASp2E,EAAQk2E,OAAOnuD,GAAOquD,MACnC,OAAyB,gBAAlB,KAAOA,EAAP,YAAAnxE,EAAOmxE,MAA2C,IAApBA,EAAA,QrJ0pjBnC,SAAUn2E,EAAQD,EAASH,GAEjC,YsJxwjBAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAIk1E,GAAQ92E,EAAQ,GASpBG,GAAQ42E,YAAc,SAAUC,GAC5B,GAAIjyB,KAWJ,OAVA+xB,GAAMljE,QAAQojE,EAAmB,SAAUn0E,EAAKjB,GACxCmO,MAAMC,QAAQpO,GACdA,EAAMgS,QAAQ,SAAUqjE,GACpBlyB,EAAOtiD,KAAKsV,mBAAmBlV,GAAO,IAAMkV,mBAAmBk/D,MAInElyB,EAAOtiD,KAAKsV,mBAAmBlV,GAAO,IAAMkV,mBAAmBnW,MAGhEmjD,EAAOxiD,OAAS,IAAMwiD,EAAOtwC,KAAK,KAAO,IAQpDtU,EAAQ+2E,kBAAoB,SAAUH,GAClC,GAAI9zE,KAQJ,OAPa8zE,GAAYrxE,QAAQ,MAAO,IAAI4R,MAAM,KAC3C1D,QAAQ,SAAUsU,GACrB,GAAIA,EAAO,CACP,GAAIrlB,GAAMqlB,EAAM5Q,MAAM,IACtBrU,GAAIJ,EAAI,IAAMA,EAAI,MAGnBI,ItJgyjBL,SAAU7C,EAAQD,EAASH,GAEjC,YuJz0jBA,IAAIma,GAAyC,WACzC,GAAIC,GAAgBtZ,OAAOuZ,iBACpBC,uBAA2BvK,QAAS,SAAUrP,EAAGoS,GAAKpS,EAAE4Z,UAAYxH,IACvE,SAAUpS,EAAGoS,GAAK,IAAK,GAAIrR,KAAKqR,GAAOA,EAAEtR,eAAeC,KAAIf,EAAEe,GAAKqR,EAAErR,IACzE,OAAO,UAAUf,EAAGoS,GAEhB,QAASyH,KAAO/T,KAAK6D,YAAc3J,EADnC0Z,EAAc1Z,EAAGoS,GAEjBpS,EAAEa,UAAkB,OAANuR,EAAahS,OAAO0Z,OAAO1H,IAAMyH,EAAGhZ,UAAYuR,EAAEvR,UAAW,GAAIgZ,OAGvFzZ,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAIu1E,GAASn3E,EAAQ,KAyBjBqP,EAAsB,SAAUwL,GAEhC,QAASxL,KACL,GAAIuuB,GAAQ/iB,EAAOta,KAAKiG,OAASA,IAOjCo3B,GAAMw5C,UAMNx5C,EAAMy5C,QAONz5C,EAAM05C,MAMN15C,EAAM25C,QAIN35C,EAAM45C,OAAS,EAIf55C,EAAM65C,OAAS,EACf75C,EAAM85C,UAAY,GAClB95C,EAAM25C,KAAK,GAAK,GAChB,KAAK,GAAIl3E,GAAI,EAAGA,EAAIu9B,EAAM85C,YAAar3E,EACnCu9B,EAAM25C,KAAKl3E,GAAK,CAGpB,OADAu9B,GAAM2L,QACC3L,EAkLX,MA7NAzjB,GAAU9K,EAAMwL,GA6ChBxL,EAAK9N,UAAUgoC,MAAQ,WACnB/iC,KAAK4wE,OAAO,GAAK,WACjB5wE,KAAK4wE,OAAO,GAAK,WACjB5wE,KAAK4wE,OAAO,GAAK,WACjB5wE,KAAK4wE,OAAO,GAAK,UACjB5wE,KAAK4wE,OAAO,GAAK,WACjB5wE,KAAKgxE,OAAS,EACdhxE,KAAKixE,OAAS,GAQlBpoE,EAAK9N,UAAUo2E,UAAY,SAAUC,EAAKC,GACjCA,IACDA,EAAa,EAEjB,IAAIC,GAAItxE,KAAK8wE,EAEb,IAAmB,gBAARM,GACP,IAAK,GAAIv3E,GAAI,EAAGA,EAAI,GAAIA,IASpBy3E,EAAEz3E,GACGu3E,EAAIt4B,WAAWu4B,IAAe,GAC1BD,EAAIt4B,WAAWu4B,EAAa,IAAM,GAClCD,EAAIt4B,WAAWu4B,EAAa,IAAM,EACnCD,EAAIt4B,WAAWu4B,EAAa,GACpCA,GAAc,MAIlB,KAAK,GAAIx3E,GAAI,EAAGA,EAAI,GAAIA,IACpBy3E,EAAEz3E,GACGu3E,EAAIC,IAAe,GACfD,EAAIC,EAAa,IAAM,GACvBD,EAAIC,EAAa,IAAM,EACxBD,EAAIC,EAAa,GACzBA,GAAc,CAItB,KAAK,GAAIx3E,GAAI,GAAIA,EAAI,GAAIA,IAAK,CAC1B,GAAIyM,GAAIgrE,EAAEz3E,EAAI,GAAKy3E,EAAEz3E,EAAI,GAAKy3E,EAAEz3E,EAAI,IAAMy3E,EAAEz3E,EAAI,GAChDy3E,GAAEz3E,GAA+B,YAAxByM,GAAK,EAAMA,IAAM,IAS9B,IAAK,GAFDhE,GAAGwK,EALH/K,EAAI/B,KAAK4wE,OAAO,GAChBtkE,EAAItM,KAAK4wE,OAAO,GAChB32E,EAAI+F,KAAK4wE,OAAO,GAChB12E,EAAI8F,KAAK4wE,OAAO,GAChB7wE,EAAIC,KAAK4wE,OAAO,GAGX/2E,EAAI,EAAGA,EAAI,GAAIA,IAAK,CACrBA,EAAI,GACAA,EAAI,IACJyI,EAAIpI,EAAKoS,GAAKrS,EAAIC,GAClB4S,EAAI,aAGJxK,EAAIgK,EAAIrS,EAAIC,EACZ4S,EAAI,YAIJjT,EAAI,IACJyI,EAAKgK,EAAIrS,EAAMC,GAAKoS,EAAIrS,GACxB6S,EAAI,aAGJxK,EAAIgK,EAAIrS,EAAIC,EACZ4S,EAAI,WAGZ,IAAIxG,IAAOvE,GAAK,EAAMA,IAAM,IAAOO,EAAIvC,EAAI+M,EAAIwkE,EAAEz3E,GAAM,UACvDkG,GAAI7F,EACJA,EAAID,EACJA,EAA8B,YAAxBqS,GAAK,GAAOA,IAAM,GACxBA,EAAIvK,EACJA,EAAIuE,EAERtG,KAAK4wE,OAAO,GAAM5wE,KAAK4wE,OAAO,GAAK7uE,EAAK,WACxC/B,KAAK4wE,OAAO,GAAM5wE,KAAK4wE,OAAO,GAAKtkE,EAAK,WACxCtM,KAAK4wE,OAAO,GAAM5wE,KAAK4wE,OAAO,GAAK32E,EAAK,WACxC+F,KAAK4wE,OAAO,GAAM5wE,KAAK4wE,OAAO,GAAK12E,EAAK,WACxC8F,KAAK4wE,OAAO,GAAM5wE,KAAK4wE,OAAO,GAAK7wE,EAAK,YAE5C8I,EAAK9N,UAAU+N,OAAS,SAAUkwC,EAAOu4B,GAErC,GAAa,MAATv4B,EAAJ,KAGmB78C,KAAfo1E,IACAA,EAAav4B,EAAMj9C,OAQvB,KANA,GAAIy1E,GAAmBD,EAAavxE,KAAKkxE,UACrCv2E,EAAI,EAEJy2E,EAAMpxE,KAAK6wE,KACXY,EAAQzxE,KAAKgxE,OAEVr2E,EAAI42E,GAAY,CAKnB,GAAa,GAATE,EACA,KAAO92E,GAAK62E,GACRxxE,KAAKmxE,UAAUn4B,EAAOr+C,GACtBA,GAAKqF,KAAKkxE,SAGlB,IAAqB,gBAAVl4B,IACP,KAAOr+C,EAAI42E,GAIP,GAHAH,EAAIK,GAASz4B,EAAMF,WAAWn+C,KAC5B82E,IACA92E,EACE82E,GAASzxE,KAAKkxE,UAAW,CACzBlxE,KAAKmxE,UAAUC,GACfK,EAAQ,CAER,YAKR,MAAO92E,EAAI42E,GAIP,GAHAH,EAAIK,GAASz4B,EAAMr+C,KACjB82E,IACA92E,EACE82E,GAASzxE,KAAKkxE,UAAW,CACzBlxE,KAAKmxE,UAAUC,GACfK,EAAQ,CAER,QAKhBzxE,KAAKgxE,OAASS,EACdzxE,KAAKixE,QAAUM,IAGnB1oE,EAAK9N,UAAUiO,OAAS,WACpB,GAAIA,MACA0oE,EAA0B,EAAd1xE,KAAKixE,MAEjBjxE,MAAKgxE,OAAS,GACdhxE,KAAK8I,OAAO9I,KAAK+wE,KAAM,GAAK/wE,KAAKgxE,QAGjChxE,KAAK8I,OAAO9I,KAAK+wE,KAAM/wE,KAAKkxE,WAAalxE,KAAKgxE,OAAS,IAG3D,KAAK,GAAIn3E,GAAImG,KAAKkxE,UAAY,EAAGr3E,GAAK,GAAIA,IACtCmG,KAAK6wE,KAAKh3E,GAAiB,IAAZ63E,EACfA,GAAa,GAEjB1xE,MAAKmxE,UAAUnxE,KAAK6wE,KAEpB,KAAK,GADDl2E,GAAI,EACCd,EAAI,EAAGA,EAAI,EAAGA,IACnB,IAAK,GAAIwI,GAAI,GAAIA,GAAK,EAAGA,GAAK,EAC1B2G,EAAOrO,GAAMqF,KAAK4wE,OAAO/2E,IAAMwI,EAAK,MAClC1H,CAGV,OAAOqO,IAEJH,GACT8nE,EAAOgB,KACTh4E,GAAQkP,KAAOA,GvJy1jBT,SAAUjP,EAAQD,EAASH,GAEjC,YwJ/lkBAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GA0BtD,IAAIu2E,GAAsB,WACtB,QAASA,KAKL3xE,KAAKkxE,WAAa,EAEtB,MAAOS,KAEXh4E,GAAQg4E,KAAOA,GxJunkBT,SAAU/3E,EAAQD,EAASH,GAEjC,YyJnqkBA,SAASyzE,GAAgB2E,EAAUC,GAC/B,GAAIjX,GAAQ,GAAIkX,GAAcF,EAAUC,EACxC,OAAOjX,GAAMmX,UAAUvqE,KAAKozD,GA0KhC,QAASr2B,GAAM74B,EAAIsmE,GACf,MAAO,YAEH,IAAK,GADDrlD,MACKtjB,EAAK,EAAGA,EAAKvN,UAAUC,OAAQsN,IACpCsjB,EAAKtjB,GAAMvN,UAAUuN,EAEzBhC,SAAQC,SAAQ,GACXC,KAAK,WACNmE,EAAGjC,UAAM,GAAQkjB,KAEhB6Y,MAAM,SAAU/6B,GACbunE,GACAA,EAAQvnE,MASxB,QAASwnE,GAAqBx1E,EAAKy1E,GAC/B,GAAmB,gBAAf,KAAOz1E,EAAP,YAAAmC,EAAOnC,KAA4B,OAARA,EAC3B,OAAO,CAEX,KAAK,GAAI4M,GAAK,EAAG8oE,EAAYD,EAAS7oE,EAAK8oE,EAAUp2E,OAAQsN,IAAM,CAC/D,GAAIq3B,GAASyxC,EAAU9oE,EACvB,IAAIq3B,IAAUjkC,IAA8B,kBAAhBA,GAAIikC,GAC5B,OAAO,EAGf,OAAO,EAEX,QAASzV,MzJy9jBT,GAAIrsB,GAA4B,kBAAXuI,SAAoD,gBAApBA,QAAOC,SAAwB,SAAU3K,GAAO,aAAcA,IAAS,SAAUA,GAAO,MAAOA,IAAyB,kBAAX0K,SAAyB1K,EAAIoH,cAAgBsD,QAAU1K,IAAQ0K,OAAOpM,UAAY,eAAkB0B,GyJ/qkBtQnC,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,IAatDzB,EAAQszE,gBAAkBA,CAK1B,IAAI6E,GAA+B,WAM/B,QAASA,GAAcF,EAAUC,GAC7B,GAAIz6C,GAAQp3B,IACZA,MAAKoyE,aACLpyE,KAAKqyE,gBACLryE,KAAKsyE,cAAgB,EAErBtyE,KAAKunC,KAAOlgC,QAAQC,UACpBtH,KAAKuyE,WAAY,EACjBvyE,KAAK6xE,cAAgBA,EAIrB7xE,KAAKunC,KACAhgC,KAAK,WACNqqE,EAASx6C,KAERoO,MAAM,SAAUzlC,GACjBq3B,EAAM3sB,MAAM1K,KAyIpB,MAtIA+xE,GAAc/2E,UAAU0I,KAAO,SAAUrI,GACrC4E,KAAKwyE,gBAAgB,SAAUC,GAC3BA,EAAShvE,KAAKrI,MAGtB02E,EAAc/2E,UAAU0P,MAAQ,SAAUA,GACtCzK,KAAKwyE,gBAAgB,SAAUC,GAC3BA,EAAShoE,MAAMA,KAEnBzK,KAAK2mC,MAAMl8B,IAEfqnE,EAAc/2E,UAAUuqC,SAAW,WAC/BtlC,KAAKwyE,gBAAgB,SAAUC,GAC3BA,EAASntC,aAEbtlC,KAAK2mC,SAQTmrC,EAAc/2E,UAAUg3E,UAAY,SAAUW,EAAgBjoE,EAAO66B,GACjE,GACImtC,GADAr7C,EAAQp3B,IAEZ,QAAuB7D,KAAnBu2E,OACUv2E,KAAVsO,OACatO,KAAbmpC,EACA,KAAM,IAAI36B,OAAM,oBAIhB8nE,GADAR,EAAqBS,GAAiB,OAAQ,QAAS,aAC5CA,GAIPjvE,KAAMivE,EACNjoE,MAAOA,EACP66B,SAAUA,OAGInpC,KAAlBs2E,EAAShvE,OACTgvE,EAAShvE,KAAOwnB,OAEG9uB,KAAnBs2E,EAAShoE,QACTgoE,EAAShoE,MAAQwgB,OAEK9uB,KAAtBs2E,EAASntC,WACTmtC,EAASntC,SAAWra,EAExB,IAAI0nD,GAAQ3yE,KAAK4yE,eAAeprE,KAAKxH,KAAMA,KAAKoyE,UAAUr2E,OAqB1D,OAjBIiE,MAAKuyE,WACLvyE,KAAKunC,KAAKhgC,KAAK,WACX,IACQ6vB,EAAMy7C,WACNJ,EAAShoE,MAAM2sB,EAAMy7C,YAGrBJ,EAASntC,WAGjB,MAAOvlC,OAMfC,KAAKoyE,UAAUn2E,KAAKw2E,GACbE,GAIXb,EAAc/2E,UAAU63E,eAAiB,SAAU/4E,OACxBsC,KAAnB6D,KAAKoyE,eAAiDj2E,KAAtB6D,KAAKoyE,UAAUv4E,WAG5CmG,MAAKoyE,UAAUv4E,GACtBmG,KAAKsyE,eAAiB,EACK,IAAvBtyE,KAAKsyE,mBAA8Cn2E,KAAvB6D,KAAK6xE,eACjC7xE,KAAK6xE,cAAc7xE,QAG3B8xE,EAAc/2E,UAAUy3E,gBAAkB,SAAU9mE,GAChD,IAAI1L,KAAKuyE,UAMT,IAAK,GAAI14E,GAAI,EAAGA,EAAImG,KAAKoyE,UAAUr2E,OAAQlC,IACvCmG,KAAK8yE,QAAQj5E,EAAG6R,IAMxBomE,EAAc/2E,UAAU+3E,QAAU,SAAUj5E,EAAG6R,GAC3C,GAAI0rB,GAAQp3B,IAEZA,MAAKunC,KAAKhgC,KAAK,WACX,OAAwBpL,KAApBi7B,EAAMg7C,eAAkDj2E,KAAvBi7B,EAAMg7C,UAAUv4E,GACjD,IACI6R,EAAG0rB,EAAMg7C,UAAUv4E,IAEvB,MAAOkG,GAIoB,mBAAZkK,UAA2BA,QAAQQ,OAC1CR,QAAQQ,MAAM1K,OAMlC+xE,EAAc/2E,UAAU4rC,MAAQ,SAAU3Z,GACtC,GAAIoK,GAAQp3B,IACRA,MAAKuyE,YAGTvyE,KAAKuyE,WAAY,MACLp2E,KAAR6wB,IACAhtB,KAAK6yE,WAAa7lD,GAGtBhtB,KAAKunC,KAAKhgC,KAAK,WACX6vB,EAAMg7C,cAAYj2E,GAClBi7B,EAAMy6C,kBAAgB11E,OAGvB21E,IAoBXn4E,GAAQ4qC,MAAQA,GzJ+rkBV,SAAU3qC,EAAQD,EAASH,GAEjC,Y0Jn1kBA,SAAS+jB,GAAYJ,EAAQC,EAAgBC,GACzC,GAAI01D,GAAU,EACd,QAAQ31D,GACJ,IAAK,GACD21D,EAAU11D,EAAW,QAAU,OAC/B,MACJ,KAAK,GACD01D,EAAU11D,EAAW,SAAW,QAChC,MACJ,KAAK,GACD01D,EAAU11D,EAAW,QAAU,OAC/B,MACJ,KAAK,GACD01D,EAAU11D,EAAW,SAAW,QAChC,MACJ,SACI,KAAM,IAAI1S,OAAM,mEAExB,GAAIF,GAAQ0S,EAAS,WAErB,OADA1S,IAASsoE,EAAU,aAUvB,QAASC,GAAkB71D,EAAQC,EAAgBuB,EAAWtB,GAC1D,KAAIA,GAAasB,IAEQ,gBAAdA,GAEP,KAAM,IAAIhU,OAAM4S,EAAYJ,EAAQC,EAAgBC,GAChD,uCAIZ,QAASq0B,GAAiBv0B,EAAQC,EAAgBzV,EAAU0V,GACxD,KAAIA,GAAa1V,IAEO,kBAAbA,GACP,KAAM,IAAIgD,OAAM4S,EAAYJ,EAAQC,EAAgBC,GAChD,6BAGZ,QAASsjC,GAAsBxjC,EAAQC,EAAgB3c,EAAS4c,GAC5D,KAAIA,GAAa5c,KAEM,gBAAnB,KAAOA,EAAP,YAAA7B,EAAO6B,KAAoC,OAAZA,GAC/B,KAAM,IAAIkK,OAAM4S,EAAYJ,EAAQC,EAAgBC,GAChD,mC1JizkBZ,GAAIze,GAA4B,kBAAXuI,SAAoD,gBAApBA,QAAOC,SAAwB,SAAU3K,GAAO,aAAcA,IAAS,SAAUA,GAAO,MAAOA,IAAyB,kBAAX0K,SAAyB1K,EAAIoH,cAAgBsD,QAAU1K,IAAQ0K,OAAOpM,UAAY,eAAkB0B,G0J14kBtQnC,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,IAUtDzB,EAAQy3C,iBAAmB,SAAUj0B,EAAQ81D,EAAUC,EAAUC,GAC7D,GAAIC,EAOJ,IANID,EAAWF,EACXG,EAAW,YAAcH,EAEpBE,EAAWD,IAChBE,EAAwB,IAAbF,EAAiB,OAAS,gBAAkBA,GAEvDE,EAAU,CACV,GAAI3oE,GAAQ0S,EACR,4BACAg2D,GACc,IAAbA,EAAiB,aAAe,eACjC,YACAC,EACA,GACJ,MAAM,IAAIzoE,OAAMF,KAiCxB9Q,EAAQ4jB,YAAcA,EAgBtB5jB,EAAQq5E,kBAAoBA,EAQ5Br5E,EAAQ+3C,iBAAmBA,EAQ3B/3C,EAAQgnD,sBAAwBA,G1Jm4kB1B,SAAU/mD,EAAQD,EAASH,GAEjC,Y2Jh+kBAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAIi4E,GAAW75E,EAAQ,GAcvBG,GAAQiP,kBAAoB,SAAUF,GAElC,IAAK,GADDvH,MAAUlG,EAAI,EACTpB,EAAI,EAAGA,EAAI6O,EAAI3M,OAAQlC,IAAK,CACjC,GAAII,GAAIyO,EAAIowC,WAAWj/C,EAEvB,IAAII,GAAK,OAAUA,GAAK,MAAQ,CAC5B,GAAIiqD,GAAOjqD,EAAI,KACfJ,KACAw5E,EAASrpE,OAAOnQ,EAAI6O,EAAI3M,OAAQ,0CAEhC9B,GAAI,OAAWiqD,GAAQ,KADbx7C,EAAIowC,WAAWj/C,GAAK,OAG9BI,EAAI,IACJkH,EAAIlG,KAAOhB,EAENA,EAAI,MACTkH,EAAIlG,KAAQhB,GAAK,EAAK,IACtBkH,EAAIlG,KAAY,GAAJhB,EAAU,KAEjBA,EAAI,OACTkH,EAAIlG,KAAQhB,GAAK,GAAM,IACvBkH,EAAIlG,KAAShB,GAAK,EAAK,GAAM,IAC7BkH,EAAIlG,KAAY,GAAJhB,EAAU,MAGtBkH,EAAIlG,KAAQhB,GAAK,GAAM,IACvBkH,EAAIlG,KAAShB,GAAK,GAAM,GAAM,IAC9BkH,EAAIlG,KAAShB,GAAK,EAAK,GAAM,IAC7BkH,EAAIlG,KAAY,GAAJhB,EAAU,KAG9B,MAAOkH,IAOXxH,EAAQoZ,aAAe,SAAUrK,GAE7B,IAAK,GADDzN,GAAI,EACCpB,EAAI,EAAGA,EAAI6O,EAAI3M,OAAQlC,IAAK,CACjC,GAAII,GAAIyO,EAAIowC,WAAWj/C,EACnBI,GAAI,IACJgB,IAEKhB,EAAI,KACTgB,GAAK,EAEAhB,GAAK,OAAUA,GAAK,OAEzBgB,GAAK,EACLpB,KAGAoB,GAAK,EAGb,MAAOA,K3Jo/kBL,SAAUrB,EAAQD,EAASH,GAEjC,Y4J9jlBAI,GAAOD,QAAUH,EAAQ,M5JqllBnB,SAAUI,EAAQD,EAASH,GAEjC,Y6JvklBA,SAAS85E,GAAiB1jD,GAEtB,GAAIjR,GAAYiR,EAASusB,SAAS2vB,gBAAgB,WAAY,SAAU30C,EAAKo8C,EAAQt8B,GAAO,MAAOgF,GAAcvF,YAAYG,cAAcG,gBAAgB7f,EAAK8f,KAG5JlG,UAAWiL,EAAYjL,UACvB8B,MAAOnC,EAAQmC,MACf5T,SAAUlI,EAAWkI,SACrBp1B,cAAe9B,EAAO8B,cACtBsyC,SAAUA,EACVQ,YAAaA,EACb62B,YAAaA,GACd,MAAM,EACLxrE,GAAO2D,cACP/R,EAAOD,QAAUglB,GA9BzBrkB,OAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAI0tD,GAAQtvD,EAAQ,IAChBu9B,EAAav9B,EAAQ,GACzBG,GAAQslC,SAAWlI,EAAWkI,QAC9B,IAAIyR,GAAUl3C,EAAQ,GACtBG,GAAQk5C,MAAQnC,EAAQmC,KACxB,IAAImJ,GAAcxiD,EAAQ,GAC1BG,GAAQo3C,UAAYiL,EAAYjL,SAChC,IAAIhpC,GAASvO,EAAQ,EACrBG,GAAQkQ,cAAgB9B,EAAO8B,aAC/B,IAAIoyC,GAAgBziD,EAAQ,IACxB2iD,EAAW3iD,EAAQ,KACnBg6E,EAAch6E,EAAQ,KACtBwO,EAASxO,EAAQ,GACjBmjD,EAAc5lB,EAAWkI,SAAS0d,WACtChjD,GAAQgjD,YAAcA,EAkBtBhjD,EAAQ25E,iBAAmBA,EAC3BA,EAAiBxqB,EAAMhhD,QACvB,IAAI2rE,GAAiBj6E,EAAQ,GAC7BG,GAAQq5C,aAAeygC,EAAezgC,YACtC,IAAIzC,GAAiB/2C,EAAQ,GAC7BG,GAAQi5C,aAAerC,EAAeqC,c7JinlBhC,SAAUh5C,EAAQD,EAASH,GAEjC,Y8JzplBAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAI2M,GAASvO,EAAQ,GAWjBg5B,EAAmC,WAInC,QAASA,GAAkBkhD,GACvB1zE,KAAK0zE,YAAcA,EAEnB1zE,KAAK2zE,QAAU,YA2CnB,MArCAnhD,GAAkBz3B,UAAUqP,IAAM,SAAU/N,EAAKjB,GAChC,MAATA,EACA4E,KAAK0zE,YAAYnhD,WAAWvyB,KAAK4zE,cAAcv3E,IAG/C2D,KAAK0zE,YAAYphD,QAAQtyB,KAAK4zE,cAAcv3E,GAAM0L,EAAO2B,UAAUtO,KAO3Eo3B,EAAkBz3B,UAAUL,IAAM,SAAU2B,GACxC,GAAIw3E,GAAY7zE,KAAK0zE,YAAYI,QAAQ9zE,KAAK4zE,cAAcv3E,GAC5D,OAAiB,OAAbw3E,EACO,KAGA9rE,EAAOmzC,SAAS24B,IAM/BrhD,EAAkBz3B,UAAUsP,OAAS,SAAUhO,GAC3C2D,KAAK0zE,YAAYnhD,WAAWvyB,KAAK4zE,cAAcv3E,KAMnDm2B,EAAkBz3B,UAAU64E,cAAgB,SAAUz5E,GAClD,MAAO6F,MAAK2zE,QAAUx5E,GAE1Bq4B,EAAkBz3B,UAAUuT,SAAW,WACnC,MAAOtO,MAAK0zE,YAAYplE,YAErBkkB,IAEX74B,GAAQ64B,kBAAoBA,G9J+qlBtB,SAAU54B,EAAQD,EAASH,GAEjC,Y+JjvlBAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAI2M,GAASvO,EAAQ,GAOjBi5B,EAA+B,WAC/B,QAASA,KACLzyB,KAAK+zE,UACL/zE,KAAKw7D,mBAAoB,EAmB7B,MAjBA/oC,GAAc13B,UAAUqP,IAAM,SAAU/N,EAAKjB,GAC5B,MAATA,QACO4E,MAAK+zE,OAAO13E,GAGnB2D,KAAK+zE,OAAO13E,GAAOjB,GAG3Bq3B,EAAc13B,UAAUL,IAAM,SAAU2B,GACpC,MAAI0L,GAAO0K,SAASzS,KAAK+zE,OAAQ13E,GACtB2D,KAAK+zE,OAAO13E,GAEhB,MAEXo2B,EAAc13B,UAAUsP,OAAS,SAAUhO,SAChC2D,MAAK+zE,OAAO13E,IAEhBo2B,IAEX94B,GAAQ84B,cAAgBA,G/JwwlBlB,SAAU74B,EAAQD,EAASH,GAEjC,YgK1ylBAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAI2M,GAASvO,EAAQ,GACjB44C,EAAmC,WAQnC,QAASA,GAAkBD,EAAWltB,GAClCjlB,KAAKmyC,UAAYA,EACjBnyC,KAAKilB,SAAWA,EAQpB,MAJAmtB,GAAkBr3C,UAAUq4C,OAAS,WAEjC,MADArrC,GAAOqpC,iBAAiB,2BAA4B,EAAG,EAAGt1C,UAAUC,SAC3Do2C,UAAWnyC,KAAKmyC,UAAWltB,SAAUjlB,KAAKilB,SAASmuB,WAEzDhB,IAEXz4C,GAAQy4C,kBAAoBA,GhKk0lBtB,SAAUx4C,EAAQD,EAASH,GAEjC,YiK11lBAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAI2M,GAASvO,EAAQ,EAerBG,GAAQ64C,WAAc,WAElB,GAAIwhC,GAAa,mEAGbC,EAAe,EAKfC,IACJ,OAAO,UAAU3hC,GACb,GAAI4hC,GAAgB5hC,IAAQ0hC,CAC5BA,GAAe1hC,CACf,IAAI14C,GACAu6E,EAAiB,GAAI7qE,OAAM,EAC/B,KAAK1P,EAAI,EAAGA,GAAK,EAAGA,IAChBu6E,EAAev6E,GAAKm6E,EAAWrvC,OAAO4N,EAAM,IAG5CA,EAAMvmC,KAAKC,MAAMsmC,EAAM,GAE3BxqC,GAAOiC,OAAe,IAARuoC,EAAW,2BACzB,IAAI/pC,GAAK4rE,EAAenmE,KAAK,GAC7B,IAAKkmE,EAKA,CAGD,IAAKt6E,EAAI,GAAIA,GAAK,GAA0B,KAArBq6E,EAAcr6E,GAAWA,IAC5Cq6E,EAAcr6E,GAAK,CAEvBq6E,GAAcr6E,SAVd,KAAKA,EAAI,EAAGA,EAAI,GAAIA,IAChBq6E,EAAcr6E,GAAKmS,KAAKC,MAAsB,GAAhBD,KAAK8e,SAW3C,KAAKjxB,EAAI,EAAGA,EAAI,GAAIA,IAChB2O,GAAMwrE,EAAWrvC,OAAOuvC,EAAcr6E,GAG1C,OADAkO,GAAOiC,OAAqB,KAAdxB,EAAGzM,OAAe,oCACzByM,OjKm3lBT,SAAU5O,EAAQD,EAASH,GAEjC,YkK96lBAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAIq4E,GAAiBj6E,EAAQ,IACzB66E,EAAU76E,EAAQ,KAClBuO,EAASvO,EAAQ,GACjBwO,EAASxO,EAAQ,GAIjBinD,EAAwC,WAMxC,QAASA,GAAuB6zB,EAAWC,EAAiBC,GACxDx0E,KAAKs0E,UAAYA,EACjBt0E,KAAKu0E,gBAAkBA,EACvBv0E,KAAKw0E,SAAWA,EAmEpB,MA9DA/zB,GAAuB1lD,UAAU05E,WAAa,SAAUv2D,GACpD,MAAqB,UAAdA,GAKXuiC,EAAuB1lD,UAAU25E,YAAc,SAAUC,EAAQ7lE,GAC7D,GAAI8J,GAAQ9J,EAAMmxC,iBAAiBhK,UACnC,OAAO,IAAIo+B,GAAQO,UAAU,QAAS50E,KAAM,GAAIyzE,GAAezgC,aAAa2hC,EAAO9vD,aAAc/V,EAAM4kC,SAAU96B,KAKrH6nC,EAAuB1lD,UAAU85E,eAAiB,SAAUxkB,GACxD,GAAIykB,GAAM90E,KAAKw0E,QACf,IAAiC,WAA7BnkB,EAAU0kB,eAA6B,CACvC/sE,EAAOgC,OAAOhK,KAAKu0E,gBAAiB,+DACpC,IAAIS,GAAah1E,KAAKu0E,eACtB,OAAO,YAEHS,EAAWj7E,KAAK+6E,EAAKzkB,EAAU5lD,QAInC,GAAIwqE,GAAOj1E,KAAKs0E,SAChB,OAAO,YACHW,EAAKl7E,KAAK+6E,EAAKzkB,EAAUprC,YAOrCw7B,EAAuB1lD,UAAUm6E,kBAAoB,SAAUzqE,EAAOuE,GAClE,MAAIhP,MAAKu0E,gBACE,GAAIF,GAAQc,YAAYn1E,KAAMyK,EAAOuE,GAGrC,MAMfyxC,EAAuB1lD,UAAU+hE,QAAU,SAAUtqD,GACjD,MAAMA,aAAiBiuC,MAGbjuC,EAAM8hE,YAAct0E,KAAKs0E,WAKvB9hE,EAAM8hE,YAAct0E,KAAKs0E,WAAa9hE,EAAMgiE,WAAax0E,KAAKw0E,WAM9E/zB,EAAuB1lD,UAAUq6E,eAAiB,WAC9C,MAA0B,QAAnBp1E,KAAKs0E,WAET7zB,IAEX9mD,GAAQ8mD,uBAAyBA,CAUjC,IAAIC,GAAwC,WAMxC,QAASA,GAAuB20B,EAAYd,EAAiBC,GACzDx0E,KAAKq1E,WAAaA,EAClBr1E,KAAKu0E,gBAAkBA,EACvBv0E,KAAKw0E,SAAWA,EAyFpB,MApFA9zB,GAAuB3lD,UAAU05E,WAAa,SAAUv2D,GACpD,GAAIo3D,GAA6B,mBAAdp3D,EAAiC,cAAgBA,CAGpE,OAFAo3D,GACqB,qBAAjBA,EAAsC,gBAAkBA,EACrDvtE,EAAO0K,SAASzS,KAAKq1E,WAAYC,IAK5C50B,EAAuB3lD,UAAUm6E,kBAAoB,SAAUzqE,EAAOuE,GAClE,MAAIhP,MAAKu0E,gBACE,GAAIF,GAAQc,YAAYn1E,KAAMyK,EAAOuE,GAGrC,MAMf0xC,EAAuB3lD,UAAU25E,YAAc,SAAUC,EAAQ7lE,GAC7D9G,EAAOgC,OAA2B,MAApB2qE,EAAO59D,UAAmB,wCACxC,IAAIzT,GAAMwL,EAAM4kC,SAASh4C,MAA8Bi5E,EAAO59D,WAC1D6B,EAAQ9J,EAAMmxC,iBAAiBhK,UACnC,OAAO,IAAIo+B,GAAQO,UAAUD,EAAO10E,KAAMD,KAAM,GAAIyzE,GAAezgC,aAAa2hC,EAAO9vD,aAAcvhB,EAAKsV,GAAQ+7D,EAAO5vD,WAK7H27B,EAAuB3lD,UAAU85E,eAAiB,SAAUxkB,GACxD,GAAIykB,GAAM90E,KAAKw0E,QACf,IAAiC,WAA7BnkB,EAAU0kB,eAA6B,CACvC/sE,EAAOgC,OAAOhK,KAAKu0E,gBAAiB,+DACpC,IAAIgB,GAAav1E,KAAKu0E,eACtB,OAAO,YAEHgB,EAAWx7E,KAAK+6E,EAAKzkB,EAAU5lD,QAInC,GAAI+qE,GAAOx1E,KAAKq1E,WAAWhlB,EAAUnyC,UACrC,OAAO,YACHs3D,EAAKz7E,KAAK+6E,EAAKzkB,EAAUprC,SAAUorC,EAAUtrC,YAOzD27B,EAAuB3lD,UAAU+hE,QAAU,SAAUtqD,GACjD,GAAIA,YAAiBkuC,GAAwB,CACzC,IAAK1gD,KAAKq1E,aAAe7iE,EAAM6iE,WAC3B,OAAO,CAEN,IAAIr1E,KAAKw0E,WAAahiE,EAAMgiE,SAAU,CACvC,GAAIiB,GAAa1tE,EAAOwzC,SAAS/oC,EAAM6iE,WAEvC,IAAII,IADY1tE,EAAOwzC,SAASv7C,KAAKq1E,YACP,CAI1B,GAAmB,IAAfI,EAAkB,CAClB,GAAIC,GAAkC3tE,EAAO8zC,UAAUrpC,EAAM6iE,YACzDM,EAAiC5tE,EAAO8zC,UAAU77C,KAAKq1E,WAC3D,SAAQM,IAAYD,GACdljE,EAAM6iE,WAAWK,IACd11E,KAAKq1E,WAAWM,IACjBnjE,EAAM6iE,WAAWK,KAAc11E,KAAKq1E,WAAWM,IAIvD,MAAO5tE,GAAOg0C,MAAM/7C,KAAKq1E,WAAY,SAAUn3D,EAAW2N,GAAM,MAAOrZ,GAAM6iE,WAAWn3D,KAAe2N,MAKvH,OAAO,GAKX60B,EAAuB3lD,UAAUq6E,eAAiB,WAC9C,MAA2B,QAApBp1E,KAAKq1E,YAET30B,IAEX/mD,GAAQ+mD,uBAAyBA,GlK47lB3B,SAAU9mD,EAAQD,EAASH,GAEjC,YmKlomBAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAI2M,GAASvO,EAAQ,GAKjBo7E,EAA2B,WAO3B,QAASA,GAAU12D,EAAW2f,EAAmB5Y,EAAUF,GACvD/kB,KAAKke,UAAYA,EACjBle,KAAK69B,kBAAoBA,EACzB79B,KAAKilB,SAAWA,EAChBjlB,KAAK+kB,SAAWA,EAoCpB,MA/BA6vD,GAAU75E,UAAU66E,QAAU,WAC1B,GAAItyE,GAAMtD,KAAKilB,SAASyuB,QACxB,OAAuB,UAAnB1zC,KAAKke,UACE5a,EAAI0L,KAGJ1L,EAAI+tC,YAAYriC,MAM/B4lE,EAAU75E,UAAUg6E,aAAe,WAC/B,MAAO/0E,MAAKke,WAKhB02D,EAAU75E,UAAU85E,eAAiB,WACjC,MAAO70E,MAAK69B,kBAAkBg3C,eAAe70E,OAKjD40E,EAAU75E,UAAUuT,SAAW,WAC3B,MAAQtO,MAAK41E,UAAUtnE,WACnB,IACAtO,KAAKke,UACL,IACAnW,EAAO2B,UAAU1J,KAAKilB,SAASkuB,cAEhCyhC,IAEXj7E,GAAQi7E,UAAYA,CACpB,IAAIO,GAA6B,WAM7B,QAASA,GAAYt3C,EAAmBpzB,EAAOuE,GAC3ChP,KAAK69B,kBAAoBA,EACzB79B,KAAKyK,MAAQA,EACbzK,KAAKgP,KAAOA,EA0BhB,MArBAmmE,GAAYp6E,UAAU66E,QAAU,WAC5B,MAAO51E,MAAKgP,MAKhBmmE,EAAYp6E,UAAUg6E,aAAe,WACjC,MAAO,UAKXI,EAAYp6E,UAAU85E,eAAiB,WACnC,MAAO70E,MAAK69B,kBAAkBg3C,eAAe70E,OAKjDm1E,EAAYp6E,UAAUuT,SAAW,WAC7B,MAAOtO,MAAKgP,KAAKV,WAAa,WAE3B6mE,IAEXx7E,GAAQw7E,YAAcA,GnKqpmBhB,SAAUv7E,EAAQD,EAASH,GAEjC,YoKpvmBAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAI2M,GAASvO,EAAQ,GACjBwO,EAASxO,EAAQ,GACjBq8E,EAAiBr8E,EAAQ,KACzB0vB,EAAiB1vB,EAAQ,GACzByO,EAASzO,EAAQ,GACjBs8E,EAAkBt8E,EAAQ,IAC1Bu8E,EAAmBv8E,EAAQ,KAC3Bw8E,EAAUx8E,EAAQ,KAClBksD,EAAclsD,EAAQ,IACtBy8E,EAAcz8E,EAAQ,IACtBijB,EAASjjB,EAAQ,GACjBs3C,EAAct3C,EAAQ,IACtB08E,EAAc18E,EAAQ,KAuBtB2/B,EAA0B,WAK1B,QAASA,GAASg9C,GACdn2E,KAAKm2E,gBAAkBA,EAMvBn2E,KAAKo2E,eAAiBN,EAAgBjiC,cAAc1W,MAMpDn9B,KAAKq2E,kBAAoB,GAAIH,GAAYI,UACzCt2E,KAAKu2E,kBACLv2E,KAAKw2E,kBA0nBT,MA/mBAr9C,GAASp+B,UAAUihC,mBAAqB,SAAUhtB,EAAMynE,EAAS16C,EAASgyB,GAGtE,MADA/tD,MAAKq2E,kBAAkBK,aAAa1nE,EAAMynE,EAAS16C,EAASgyB,GACvDA,EAIM/tD,KAAK22E,4BAA4B,GAAIV,GAAYtwB,UAAUD,EAAYnmC,gBAAgBK,KAAM5Q,EAAMynE,QAWlHt9C,EAASp+B,UAAU+hC,eAAiB,SAAU9tB,EAAM8rB,EAAiBiB,GAEjE/7B,KAAKq2E,kBAAkBO,SAAS5nE,EAAM8rB,EAAiBiB,EACvD,IAAI86C,GAAaf,EAAgBjiC,cAAcC,WAAWhZ,EAC1D,OAAO96B,MAAK22E,4BAA4B,GAAIX,GAAQc,MAAMpxB,EAAYnmC,gBAAgBK,KAAM5Q,EAAM6nE,KAStG19C,EAASp+B,UAAUuhC,aAAe,SAAUP,EAASg7C,OAClC,KAAXA,IAAqBA,GAAS,EAClC,IAAI3e,GAAQp4D,KAAKq2E,kBAAkBW,SAASj7C,EAE5C,IADuB/7B,KAAKq2E,kBAAkBY,YAAYl7C,GAIrD,CACD,GAAIm7C,GAAiBpB,EAAgBjiC,cAAc1W,KAUnD,OATkB,OAAdi7B,EAAMp9B,KAENk8C,EAAiBA,EAAe9sE,IAAIqS,EAAO/L,KAAKysB,OAAO,GAGvDl1B,EAAOmF,QAAQgrD,EAAMx8D,SAAU,SAAUyV,EAAY9T,GACjD25E,EAAiBA,EAAe9sE,IAAI,GAAIqS,GAAO/L,KAAKW,GAAa9T,KAGlEyC,KAAK22E,4BAA4B,GAAId,GAAesB,aAAa/e,EAAMppD,KAAMkoE,EAAgBH,IAbpG,UAuBR59C,EAASp+B,UAAU2+B,qBAAuB,SAAU1qB,EAAMynE,GACtD,MAAOz2E,MAAK22E,4BAA4B,GAAIV,GAAYtwB,UAAUD,EAAYnmC,gBAAgBM,OAAQ7Q,EAAMynE,KAShHt9C,EAASp+B,UAAUggC,iBAAmB,SAAU/rB,EAAM8rB,GAClD,GAAI+7C,GAAaf,EAAgBjiC,cAAcC,WAAWhZ,EAC1D,OAAO96B,MAAK22E,4BAA4B,GAAIX,GAAQc,MAAMpxB,EAAYnmC,gBAAgBM,OAAQ7Q,EAAM6nE,KAQxG19C,EAASp+B,UAAUq8E,oBAAsB,SAAUpoE,GAC/C,MAAOhP,MAAK22E,4BAA4B,GAAIZ,GAAiBsB,eAAe3xB,EAAYnmC,gBAAgBM,OAAQ7Q,KAUpHmqB,EAASp+B,UAAU8/B,0BAA4B,SAAU7rB,EAAMgsB,EAAM3B,GACjE,GAAIi+C,GAAWt3E,KAAKu3E,gBAAgBl+C,EACpC,IAAgB,MAAZi+C,EAAkB,CAClB,GAAIhsB,GAAInyB,EAASq+C,eAAeF,GAC5BG,EAAYnsB,EAAEt8C,KAAM0Q,EAAU4rC,EAAE5rC,QAChC7N,EAAe4K,EAAO/L,KAAKmB,aAAa4lE,EAAWzoE,GACnD0oE,EAAK,GAAIzB,GAAYtwB,UAAUD,EAAYnmC,gBAAgBO,qBAAqBJ,GAAU7N,EAAcmpB,EAC5G,OAAOh7B,MAAK23E,sBAAsBF,EAAWC,GAI7C,UAWRv+C,EAASp+B,UAAU4/B,sBAAwB,SAAU3rB,EAAM8rB,EAAiBzB,GACxE,GAAIi+C,GAAWt3E,KAAKu3E,gBAAgBl+C,EACpC,IAAIi+C,EAAU,CACV,GAAIhsB,GAAInyB,EAASq+C,eAAeF,GAC5BG,EAAYnsB,EAAEt8C,KAAM0Q,EAAU4rC,EAAE5rC,QAChC7N,EAAe4K,EAAO/L,KAAKmB,aAAa4lE,EAAWzoE,GACnD6nE,EAAaf,EAAgBjiC,cAAcC,WAAWhZ,GACtD48C,EAAK,GAAI1B,GAAQc,MAAMpxB,EAAYnmC,gBAAgBO,qBAAqBJ,GAAU7N,EAAcglE,EACpG,OAAO72E,MAAK23E,sBAAsBF,EAAWC,GAI7C,UAURv+C,EAASp+B,UAAU68E,0BAA4B,SAAU5oE,EAAMqqB,GAC3D,GAAIi+C,GAAWt3E,KAAKu3E,gBAAgBl+C,EACpC,IAAIi+C,EAAU,CACV,GAAIhsB,GAAInyB,EAASq+C,eAAeF,GAC5BG,EAAYnsB,EAAEt8C,KAAM0Q,EAAU4rC,EAAE5rC,QAChC7N,EAAe4K,EAAO/L,KAAKmB,aAAa4lE,EAAWzoE,GACnD0oE,EAAK,GAAI3B,GAAiBsB,eAAe3xB,EAAYnmC,gBAAgBO,qBAAqBJ,GAAU7N,EACxG,OAAO7R,MAAK23E,sBAAsBF,EAAWC,GAI7C,UAURv+C,EAASp+B,UAAU+iC,qBAAuB,SAAUhvB,EAAO+uB,GACvD,GAAI7uB,GAAOF,EAAME,KACbw3C,EAAc,KACdqxB,GAA2B,CAG/B73E,MAAKo2E,eAAelhC,cAAclmC,EAAM,SAAU8oE,EAAiBC,GAC/D,GAAIlmE,GAAe4K,EAAO/L,KAAKmB,aAAaimE,EAAiB9oE,EAC7Dw3C,GAAcA,GAAeuxB,EAAGpwB,uBAAuB91C,GACvDgmE,EACIA,GAA4BE,EAAGzwB,mBAEvC,IAAI0wB,GAAYh4E,KAAKo2E,eAAe17E,IAAIsU,EACnCgpE,IAKDH,EACIA,GAA4BG,EAAU1wB,kBAC1Cd,EAAcA,GAAewxB,EAAUrwB,uBAAuBlrC,EAAO/L,KAAKysB,SAN1E66C,EAAY,GAAIlnC,GAAYiC,UAC5B/yC,KAAKo2E,eAAiBp2E,KAAKo2E,eAAehsE,IAAI4E,EAAMgpE,GAOxD,IAAIvxB,EACJ,IAAmB,MAAfD,EACAC,GAAsB,MAErB,CACDA,GAAsB,EACtBD,EAAct9B,EAAejT,aAAaP,UAC5B1V,MAAKo2E,eAAehiC,QAAQplC,GAClCumC,aAAa,SAAUx+B,EAAWkhE,GACtC,GAAIC,GAAgBD,EAAetwB,uBAAuBlrC,EAAO/L,KAAKysB,MAClE+6C,KACA1xB,EAAcA,EAAYrvC,qBAAqBJ,EAAWmhE,MAItE,GAAIC,GAAoBH,EAAUlwB,mBAAmBh5C,EACrD,KAAKqpE,IAAsBrpE,EAAMmxC,iBAAiBwH,eAAgB,CAE9D,GAAI6vB,GAAWn+C,EAASi/C,cAActpE,EACtC/G,GAAOiC,SAASstE,IAAYt3E,MAAKw2E,gBAAiB,yCAClD,IAAIn9C,GAAMF,EAASk/C,kBACnBr4E,MAAKw2E,eAAec,GAAYj+C,EAEhCr5B,KAAKu2E,eAAe,IAAMl9C,GAAOi+C,EAErC,GAAIlxB,GAAcpmD,KAAKq2E,kBAAkBiC,YAAYtpE,GACjDgrB,EAASg+C,EAAUl6C,qBAAqBhvB,EAAO+uB,EAAmBuoB,EAAaI,EAAaC,EAChG,KAAK0xB,IAAsBN,EAA0B,CACjD,GAAIvxB,GAA0B0xB,EAAUpwB,aAAa94C,EACrDkrB,GAASA,EAAOxvB,OAAOxK,KAAKu4E,eAAezpE,EAAOw3C,IAEtD,MAAOtsB,IAaXb,EAASp+B,UAAUkjC,wBAA0B,SAAUnvB,EAAO+uB,EAAmBqpB,GAC7E,GAAI9vB,GAAQp3B,KAERgP,EAAOF,EAAME,KACbwpE,EAAiBx4E,KAAKo2E,eAAe17E,IAAIsU,GACzCo4C,IAIJ,IAAIoxB,IAC6B,YAA5B1pE,EAAMkzC,mBACHw2B,EAAe1wB,mBAAmBh5C,IAAS,CAI/C,GAAI2pE,GAAmBD,EAAev6C,wBAAwBnvB,EAAO+uB,EAAmBqpB,EACpFsxB,GAAe5mE,YACf5R,KAAKo2E,eAAiBp2E,KAAKo2E,eAAe/rE,OAAO2E,GAErD,IAAIm4C,GAAUsxB,EAAiBtxB,OAC/BC,GAAeqxB,EAAiBz+C,MAOhC,IAAI0+C,IAAmB,IACnBvxB,EAAQokB,UAAU,SAAUz8D,GACxB,MAAOA,GAAMmxC,iBAAiBwH,iBAElCkxB,EAAU34E,KAAKo2E,eAAethC,WAAW9lC,EAAM,SAAU6C,EAAc+mE,GACvE,MAAOA,GAAgBtxB,mBAE3B,IAAIoxB,IAAoBC,EAAS,CAC7B,GAAIvkC,GAAUp0C,KAAKo2E,eAAehiC,QAAQplC,EAG1C,KAAKolC,EAAQxiC,UAIT,IAAK,GAFDinE,GAAW74E,KAAK84E,gCAAgC1kC,GAE3Cv6C,EAAI,EAAGA,EAAIg/E,EAAS98E,SAAUlC,EAAG,CACtC,GAAIysD,GAAOuyB,EAASh/E,GAAIk/E,EAAWzyB,EAAKkB,WACpCphC,EAAWpmB,KAAKg5E,uBAAuB1yB,EAC3CtmD,MAAKm2E,gBAAgB/8C,eAAeD,EAAS8/C,mBAAmBF,GAAW/4E,KAAKk5E,aAAaH,GAAW3yD,EAASqlC,OAAQrlC,EAASmT,aAU9I,IAAKo/C,GAAWxxB,EAAQprD,OAAS,IAAMmrD,EAGnC,GAAIwxB,EAAiB,CAGjB14E,KAAKm2E,gBAAgBx8C,cAAcR,EAAS8/C,mBAAmBnqE,GAD9C,UAIjBq4C,GAAQ/5C,QAAQ,SAAU+rE,GACtB,GAAIC,GAAchiD,EAAMo/C,eAAer9C,EAASi/C,cAAce,GAC9D/hD,GAAM++C,gBAAgBx8C,cAAcR,EAAS8/C,mBAAmBE,GAAgBC,IAK5Fp5E,MAAKq5E,YAAYlyB,GAKrB,MAAOC,IAWXjuB,EAASp+B,UAAU4rD,uBAAyB,SAAU33C,EAAMsqE,GACxD,GACIC,GAAYv5E,KAAKq2E,kBACjB7vB,EAAcxmD,KAAKo2E,eAAethC,WAAW9lC,EAAM,SAAU4lC,EAAWojC,GACxE,GAAInmE,GAAe4K,EAAO/L,KAAKmB,aAAa+iC,EAAW5lC,GACnDw3C,EAAcwxB,EAAUrwB,uBAAuB91C,EACnD,IAAI20C,EACA,MAAOA,IAGf,OAAO+yB,GAAU5yB,uBAAuB33C,EAAMw3C,EAAa8yB,GATnC,IAmB5BngD,EAASp+B,UAAU+9E,gCAAkC,SAAU1kC,GAC3D,MAAOA,GAAQM,KAAK,SAAU7iC,EAAc2nE,EAAqBC,GAC7D,GAAID,GAAuBA,EAAoBlyB,kBAAmB,CAE9D,OADmBkyB,EAAoB3xB,mBAKvC,GAAI6xB,KAOJ,OANIF,KACAE,EAAUF,EAAoB9xB,iBAElCz/C,EAAOmF,QAAQqsE,EAAU,SAAUp9E,EAAKs9E,GACpCD,EAAUA,EAAQlvE,OAAOmvE,KAEtBD,KAQnBvgD,EAASp+B,UAAUs+E,YAAc,SAAU3pB,GACvC,IAAK,GAAIrtD,GAAI,EAAGA,EAAIqtD,EAAQ3zD,SAAUsG,EAAG,CACrC,GAAIu3E,GAAelqB,EAAQrtD,EAC3B,KAAKu3E,EAAa35B,iBAAiBwH,eAAgB,CAE/C,GAAIoyB,GAAkB1gD,EAASi/C,cAAcwB,GACzCE,EAAkB95E,KAAKw2E,eAAeqD,SACnC75E,MAAKw2E,eAAeqD,SACpB75E,MAAKu2E,eAAe,IAAMuD,MAU7C3gD,EAAS8/C,mBAAqB,SAAUnqE,GACpC,MAAIA,GAAMmxC,iBAAiBwH,iBACtB34C,EAAMmxC,iBAAiBsL,YAIKz8C,EAAM4kC,SAG5B5kC,GAWfqqB,EAASp+B,UAAUw9E,eAAiB,SAAUzpE,EAAOw3C,GACjD,GAAIt3C,GAAOF,EAAME,KACbqqB,EAAMr5B,KAAKk5E,aAAapqE,GACxBsX,EAAWpmB,KAAKg5E,uBAAuB1yB,GACvCtsB,EAASh6B,KAAKm2E,gBAAgB/8C,eAAeD,EAAS8/C,mBAAmBnqE,GAAQuqB,EAAKjT,EAASqlC,OAAQrlC,EAASmT,YAChH6a,EAAUp0C,KAAKo2E,eAAehiC,QAAQplC,EAG1C,IAAIqqB,EACAtxB,EAAOiC,QAAQoqC,EAAQh5C,MAAMksD,kBAAmB,yDAsBhD,KAAK,GAlBDyyB,GAAgB3lC,EAAQM,KAAK,SAAU7iC,EAAc2nE,EAAqBC,GAC1E,IAAK5nE,EAAaD,WACd4nE,GACAA,EAAoBlyB,kBACpB,OAAQkyB,EAAoB3xB,kBAAkBL,WAI9C,IAAIwyB,KAOJ,OANIR,KACAQ,EAAYA,EAAUxvE,OAAOgvE,EAAoB9xB,gBAAgBl3C,IAAI,SAAU81C,GAAQ,MAAOA,GAAKkB,eAEvGv/C,EAAOmF,QAAQqsE,EAAU,SAAUp9E,EAAK49E,GACpCD,EAAYA,EAAUxvE,OAAOyvE,KAE1BD,IAGNngF,EAAI,EAAGA,EAAIkgF,EAAch+E,SAAUlC,EAAG,CAC3C,GAAIqgF,GAAcH,EAAclgF,EAChCmG,MAAKm2E,gBAAgBx8C,cAAcR,EAAS8/C,mBAAmBiB,GAAcl6E,KAAKk5E,aAAagB,IAGvG,MAAOlgD,IAQXb,EAASp+B,UAAUi+E,uBAAyB,SAAU1yB,GAClD,GAAIlvB,GAAQp3B,KACR8O,EAAQw3C,EAAKkB,WACbnuB,EAAMr5B,KAAKk5E,aAAapqE,EAC5B,QACI28C,OAAQ,WAEJ,OADYnF,EAAKkC,kBAAoBt/B,EAAejT,aAAaP,YACpD6C,QAEjBghB,WAAY,SAAUQ,GAClB,GAAe,OAAXA,EACA,MAAIV,GACOjC,EAAMwgD,0BAA0B9oE,EAAME,KAAMqqB,GAG5CjC,EAAMggD,oBAAoBtoE,EAAME,KAM3C,IAAIvE,GAAQzC,EAAO4G,mBAAmBmrB,EAAQjrB,EAC9C,OAAOsoB,GAAM6G,wBAAwBnvB,EACf,KAAMrE,MAW5C0uB,EAASi/C,cAAgB,SAAUtpE,GAC/B,MAAOA,GAAME,KAAKV,WAAa,IAAMQ,EAAMkzC,mBAQ/C7oB,EAASq+C,eAAiB,SAAUF,GAChC,GAAI6C,GAAa7C,EAASrsE,QAAQ,IAElC,OADAlD,GAAOiC,QAAuB,IAAhBmwE,GAAqBA,EAAa7C,EAASv7E,OAAS,EAAG,kBAEjE2jB,QAAS43D,EAASjpE,OAAO8rE,EAAa,GACtCnrE,KAAM,GAAIyN,GAAO/L,KAAK4mE,EAASjpE,OAAO,EAAG8rE,MASjDhhD,EAASp+B,UAAUw8E,gBAAkB,SAAUl+C,GAC3C,MAAOr5B,MAAKu2E,eAAe,IAAMl9C,IAQrCF,EAASp+B,UAAUm+E,aAAe,SAAUpqE,GACxC,GAAIwoE,GAAWn+C,EAASi/C,cAActpE,EACtC,OAAO7G,GAAOoX,QAAQrf,KAAKw2E,eAAgBc,IAO/Cn+C,EAASk/C,iBAAmB,WACxB,MAAOl/C,GAASihD,iBAUpBjhD,EAASp+B,UAAU48E,sBAAwB,SAAUF,EAAWtxB,GAC5D,GAAI6xB,GAAYh4E,KAAKo2E,eAAe17E,IAAI+8E,EACxC1vE,GAAOiC,OAAOguE,EAAW,uDACzB,IAAI5xB,GAAcpmD,KAAKq2E,kBAAkBiC,YAAYb,EACrD,OAAOO,GAAU9xB,eAAeC,EAAWC,EAC1B,OAmBrBjtB,EAASp+B,UAAU47E,4BAA8B,SAAUxwB,GACvD,MAAOnmD,MAAKq6E,sBAAsBl0B,EAAWnmD,KAAKo2E,eACjC,KAAMp2E,KAAKq2E,kBAAkBiC,YAAY77D,EAAO/L,KAAKysB,SAY1EhE,EAASp+B,UAAUs/E,sBAAwB,SAAUl0B,EAAWm0B,EAAe9zB,EAAaJ,GACxF,GAAID,EAAUn3C,KAAK4C,UACf,MAAO5R,MAAKu6E,iCAAiCp0B,EAAWm0B,EAAe9zB,EAAaJ,EAGpF,IAAI4xB,GAAYsC,EAAc5/E,IAAI+hB,EAAO/L,KAAKysB,MAE3B,OAAfqpB,GAAoC,MAAbwxB,IACvBxxB,EAAcwxB,EAAUrwB,uBAAuBlrC,EAAO/L,KAAKysB,OAE/D,IAAInD,MACAjjB,EAAYovC,EAAUn3C,KAAKiC,WAC3BupE,EAAiBr0B,EAAUN,kBAAkB9uC,GAC7Cs9B,EAAYimC,EAAc1+E,SAASlB,IAAIqc,EAC3C,IAAIs9B,GAAammC,EAAgB,CAC7B,GAAIC,GAAmBj0B,EACjBA,EAAY1vC,kBAAkBC,GAC9B,KACF2jE,EAAmBt0B,EAAY1qD,MAAMqb,EACzCijB,GAASA,EAAOxvB,OAAOxK,KAAKq6E,sBAAsBG,EAAgBnmC,EAAWomC,EAAkBC,IAKnG,MAHI1C,KACAh+C,EAASA,EAAOxvB,OAAOwtE,EAAU9xB,eAAeC,EAAWC,EAAaI,KAErExsB,GAafb,EAASp+B,UAAUw/E,iCAAmC,SAAUp0B,EAAWm0B,EAAe9zB,EAAaJ,GACnG,GAAIhvB,GAAQp3B,KACRg4E,EAAYsC,EAAc5/E,IAAI+hB,EAAO/L,KAAKysB,MAE3B,OAAfqpB,GAAoC,MAAbwxB,IACvBxxB,EAAcwxB,EAAUrwB,uBAAuBlrC,EAAO/L,KAAKysB,OAE/D,IAAInD,KAcJ,OAbAsgD,GAAc1+E,SAAS4d,iBAAiB,SAAUzC,EAAWs9B,GACzD,GAAIomC,GAAmBj0B,EACjBA,EAAY1vC,kBAAkBC,GAC9B,KACF2jE,EAAmBt0B,EAAY1qD,MAAMqb,GACrCyjE,EAAiBr0B,EAAUN,kBAAkB9uC,EAC7CyjE,KACAxgD,EAASA,EAAOxvB,OAAO4sB,EAAMmjD,iCAAiCC,EAAgBnmC,EAAWomC,EAAkBC,OAG/G1C,IACAh+C,EAASA,EAAOxvB,OAAOwtE,EAAU9xB,eAAeC,EAAWC,EAAaI,KAErExsB,GAOXb,EAASihD,cAAgB,EAClBjhD,IAEXx/B,GAAQw/B,SAAWA,GpKqvmBb,SAAUv/B,EAAQD,EAASH,GAEjC,YqK36nBAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAI2M,GAASvO,EAAQ,GACjBijB,EAASjjB,EAAQ,GACjBksD,EAAclsD,EAAQ,IACtB29E,EAA8B,WAO9B,QAASA,GACanoE,EACA2rE,EACA5D,GAClB/2E,KAAKgP,KAAOA,EACZhP,KAAK26E,aAAeA,EACpB36E,KAAK+2E,OAASA,EAEd/2E,KAAKC,KAAOylD,EAAYpmC,cAAcs7D,eAEtC56E,KAAKqoC,OAASqd,EAAYnmC,gBAAgBK,KAoB9C,MAfAu3D,GAAap8E,UAAU8qD,kBAAoB,SAAU9uC,GACjD,GAAK/W,KAAKgP,KAAK4C,UAIV,IAA+B,MAA3B5R,KAAK26E,aAAav/E,MAGvB,MAFA2M,GAAOiC,OAAOhK,KAAK26E,aAAa/+E,SAASgW,UAAW,4DAE7C5R,IAGP,IAAIq0C,GAAYr0C,KAAK26E,aAAavmC,QAAQ,GAAI33B,GAAO/L,KAAKqG,GAC1D,OAAO,IAAIogE,GAAa16D,EAAO/L,KAAKysB,MAAOkX,EAAWr0C,KAAK+2E,QAT3D,MADAhvE,GAAOiC,OAAOhK,KAAKgP,KAAKiC,aAAe8F,EAAW,iDAC3C,GAAIogE,GAAan3E,KAAKgP,KAAKmC,WAAYnR,KAAK26E,aAAc36E,KAAK+2E,SAYvEI,IAEXx9E,GAAQw9E,aAAeA,GrKi8nBjB,SAAUv9E,EAAQD,EAASH,GAEjC,YsK9+nBAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAIqhB,GAASjjB,EAAQ,GACjBksD,EAAclsD,EAAQ,IAOtB69E,EAAgC,WAChC,QAASA,GAAehvC,EAAQr5B,GAC5BhP,KAAKqoC,OAASA,EACdroC,KAAKgP,KAAOA,EAEZhP,KAAKC,KAAOylD,EAAYpmC,cAAcu7D,gBAU1C,MARAxD,GAAet8E,UAAU8qD,kBAAoB,SAAU9uC,GACnD,MAAI/W,MAAKgP,KAAK4C,UACH,GAAIylE,GAAer3E,KAAKqoC,OAAQ5rB,EAAO/L,KAAKysB,OAG5C,GAAIk6C,GAAer3E,KAAKqoC,OAAQroC,KAAKgP,KAAKmC,aAGlDkmE,IAEX19E,GAAQ09E,eAAiBA,GtKqgoBnB,SAAUz9E,EAAQD,EAASH,GAEjC,YuKjioBAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAIsqD,GAAclsD,EAAQ,IACtBy8E,EAAcz8E,EAAQ,IACtBijB,EAASjjB,EAAQ,GACjBuO,EAASvO,EAAQ,GAQjBs9E,EAAuB,WACvB,QAASA,GACazuC,EACAr5B,EACApT,GAClBoE,KAAKqoC,OAASA,EACdroC,KAAKgP,KAAOA,EACZhP,KAAKpE,SAAWA,EAEhBoE,KAAKC,KAAOylD,EAAYpmC,cAAcw7D,MAsC1C,MAjCAhE,GAAM/7E,UAAU8qD,kBAAoB,SAAU9uC,GAC1C,GAAI/W,KAAKgP,KAAK4C,UAAW,CACrB,GAAIyiC,GAAYr0C,KAAKpE,SAASw4C,QAAQ,GAAI33B,GAAO/L,KAAKqG,GACtD,OAAIs9B,GAAUziC,UAEH,KAEFyiC,EAAUj5C,MAER,GAAI66E,GAAYtwB,UAAU3lD,KAAKqoC,OAAQ5rB,EAAO/L,KAAKysB,MAAOkX,EAAUj5C,OAIpE,GAAI07E,GAAM92E,KAAKqoC,OAAQ5rB,EAAO/L,KAAKysB,MAAOkX,GAKrD,MADAtsC,GAAOiC,OAAOhK,KAAKgP,KAAKiC,aAAe8F,EAAW,kEAC3C,GAAI+/D,GAAM92E,KAAKqoC,OAAQroC,KAAKgP,KAAKmC,WAAYnR,KAAKpE,WAMjEk7E,EAAM/7E,UAAUuT,SAAW,WACvB,MAAQ,aACJtO,KAAKgP,KACL,KACAhP,KAAKqoC,OAAO/5B,WACZ,WACAtO,KAAKpE,SAAS0S,WACd,KAEDwoE,IAEXn9E,GAAQm9E,MAAQA,GvKgjoBV,SAAUl9E,EAAQD,EAASH,GAEjC,YwK/moBAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAIihE,GAAkB7iE,EAAQ,IAC1BuhF,EAAkBvhF,EAAQ,KAC1B0vB,EAAiB1vB,EAAQ,GACzBssD,EAActsD,EAAQ,IACtBusD,EAAcvsD,EAAQ,IACtBwhF,EAAmBxhF,EAAQ,KAC3BuO,EAASvO,EAAQ,GACjBksD,EAAclsD,EAAQ,IACtBg8C,EAAWh8C,EAAQ,IACnBqc,EAAkBrc,EAAQ,GAW1BwtD,EAAsB,WAMtB,QAASA,GAAKi0B,EAAQC,GAClBl7E,KAAKi7E,OAASA,EACdj7E,KAAKm7E,sBACL,IAAI58B,GAASv+C,KAAKi7E,OAAOh7B,iBACrBm7B,EAAc,GAAI/e,GAAgB5mB,cAAc8I,EAAOtI,YACvD3lC,EAASiuC,EAAO88B,eAKpBr7E,MAAKs7E,WAAa,GAAIP,GAAgBQ,cAAcjrE,EACpD,IAAIkrE,GAAqBN,EAAiB1yB,iBACtCizB,EAAoBP,EAAiB5yB,gBAErCD,EAAa+yB,EAAYvlC,eAAe3sB,EAAejT,aAAaP,WAAY8lE,EAAmB/hD,UAAW,MAC9GyuB,EAAY53C,EAAOulC,eAAe3sB,EAAejT,aAAaP,WAAY+lE,EAAkBhiD,UAAW,MACvGiiD,EAAiB,GAAI51B,GAAY5mB,UAAUmpB,EAAYmzB,EAAmBl8C,qBAAsB87C,EAAYrlC,gBAC5G4lC,EAAgB,GAAI71B,GAAY5mB,UAAUgpB,EAAWuzB,EAAkBn8C,qBAAsBhvB,EAAOylC,eAKxG/1C,MAAK47E,WAAa,GAAI71B,GAAYgB,UAAU40B,EAAeD,GAK3D17E,KAAK67E,gBAAkB,GAAIb,GAAiBc,eAAe97E,KAAKi7E,QAqIpE,MAhIAj0B,GAAKjsD,UAAUysD,SAAW,WACtB,MAAOxnD,MAAKi7E,QAKhBj0B,EAAKjsD,UAAUytD,eAAiB,WAC5B,MAAOxoD,MAAK47E,WAAWpzB,iBAAiB/uB,WAM5CutB,EAAKjsD,UAAU4sD,uBAAyB,SAAU34C,GAC9C,GAAI+sE,GAAQ/7E,KAAK47E,WAAWnzB,uBAC5B,OAAIszB,KAGI/7E,KAAKi7E,OAAOh7B,iBAAiBwH,iBAC3Bz4C,EAAK4C,YAAcmqE,EAAMjlE,kBAAkB9H,EAAKiC,YAAYW,WACvDmqE,EAAM/kE,SAAShI,GAGvB,MAKXg4C,EAAKjsD,UAAU6W,QAAU,WACrB,MAA2C,KAApC5R,KAAKm7E,oBAAoBp/E,QAKpCirD,EAAKjsD,UAAU+iC,qBAAuB,SAAUD,GAC5C79B,KAAKm7E,oBAAoBl/E,KAAK4hC,IAOlCmpB,EAAKjsD,UAAUkjC,wBAA0B,SAAUJ,EAAmBqpB,GAClE,GAAIE,KACJ,IAAIF,EAAa,CACbn/C,EAAOiC,OAA4B,MAArB6zB,EAA2B,kDACzC,IAAIm+C,GAASh8E,KAAKi7E,OAAOjsE,IACzBhP,MAAKm7E,oBAAoB/tE,QAAQ,SAAU6uE,GACvC/0B,EAAoCA,CACpC,IAAIg1B,GAAaD,EAAa/G,kBAAkBhuB,EAAa80B,EACzDE,IACA90B,EAAanrD,KAAKigF,KAI9B,GAAIr+C,EAAmB,CAEnB,IAAK,GADDhR,MACKhzB,EAAI,EAAGA,EAAImG,KAAKm7E,oBAAoBp/E,SAAUlC,EAAG,CACtD,GAAIsiF,GAAWn8E,KAAKm7E,oBAAoBthF,EACxC,IAAKsiF,EAASrf,QAAQj/B,IAGjB,GAAIA,EAAkBu3C,iBAAkB,CAEzCvoD,EAAYA,EAAUriB,OAAOxK,KAAKm7E,oBAAoBv+E,MAAM/C,EAAI,GAChE,YALAgzB,GAAU5wB,KAAKkgF,GAQvBn8E,KAAKm7E,oBAAsBtuD,MAG3B7sB,MAAKm7E,sBAET,OAAO/zB,IAUXJ,EAAKjsD,UAAUmrD,eAAiB,SAAUC,EAAWC,EAAag2B,GAC1Dj2B,EAAUlmD,OAASylD,EAAYpmC,cAAcw7D,OAChB,OAA7B30B,EAAU9d,OAAO3oB,UACjB3X,EAAOiC,OAAOhK,KAAK47E,WAAWnzB,wBAAyB,6DACvD1gD,EAAOiC,OAAOhK,KAAK47E,WAAWrzB,uBAAwB,2DAE1D,IAAI8zB,GAAer8E,KAAK47E,WACpBrnD,EAASv0B,KAAKs7E,WAAWp1B,eAAem2B,EAAcl2B,EAAWC,EAAag2B,EAKlF,OAJAp8E,MAAKs7E,WAAWgB,cAAc/nD,EAAOuyB,WACrC/+C,EAAOiC,OAAOuqB,EAAOuyB,UAAU0B,iBAAiBlpB,uBAC3C+8C,EAAa7zB,iBAAiBlpB,qBAAsB,2DACzDt/B,KAAK47E,WAAarnD,EAAOuyB,UAClB9mD,KAAKu8E,0BAA0BhoD,EAAOioD,QAASjoD,EAAOuyB,UAAUwB,gBAAgB7uB,UAAW,OAMtGutB,EAAKjsD,UAAUksD,iBAAmB,SAAUg1B,GACxC,GAAI/zB,GAAYloD,KAAK47E,WAAWtzB,gBAC5Bm0B,IACJ,KAAKv0B,EAAUzuB,UAAU9iB,aAAc,CACnBuxC,EAAUzuB,UAChBrhB,aAAavC,EAAgBJ,eAAgB,SAAUpZ,EAAKgc,GAClEokE,EAAexgF,KAAKu5C,EAAS5wB,OAAOO,iBAAiB9oB,EAAKgc,MAMlE,MAHI6vC,GAAU5oB,sBACVm9C,EAAexgF,KAAKu5C,EAAS5wB,OAAOI,YAAYkjC,EAAUzuB,YAEvDz5B,KAAKu8E,0BAA0BE,EAAgBv0B,EAAUzuB,UAAWwiD,IAS/Ej1B,EAAKjsD,UAAUwhF,0BAA4B,SAAUC,EAAS91B,EAAY7oB,GACtE,GAAI6+C,GAAgB7+C,GACbA,GACD79B,KAAKm7E,mBACX,OAAOn7E,MAAK67E,gBAAgBc,yBAAyBH,EAAS91B,EAAYg2B,IAEvE11B,IAEXrtD,GAAQqtD,KAAOA,GxKgooBT,SAAUptD,EAAQD,EAASH,GAEjC,YyK/zoBAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAIsqD,GAAclsD,EAAQ,IACtBuO,EAASvO,EAAQ,GACjBojF,EAA2BpjF,EAAQ,KACnCg8C,EAAWh8C,EAAQ,IACnB0vB,EAAiB1vB,EAAQ,GACzBsc,EAAatc,EAAQ,IACrBs8E,EAAkBt8E,EAAQ,IAC1BijB,EAASjjB,EAAQ,GACjBqjF,EAAwBrjF,EAAQ,KAKhCsjF,EAAiC,WAKjC,QAASA,GAAgBh2B,EAAW01B,GAChCx8E,KAAK8mD,UAAYA,EACjB9mD,KAAKw8E,QAAUA,EAEnB,MAAOM,KAEXnjF,GAAQmjF,gBAAkBA,CAI1B,IAAIvB,GAA+B,WAI/B,QAASA,GAAcwB,GACnB/8E,KAAK+8E,QAAUA,EA4hBnB,MAvhBAxB,GAAcxgF,UAAUuhF,cAAgB,SAAUx1B,GAC9C/+C,EAAOiC,OAAO88C,EACTwB,gBACA7uB,UACAlf,UAAUva,KAAK+8E,QAAQ9mC,YAAa,0BACzCluC,EAAOiC,OAAO88C,EACT0B,iBACA/uB,UACAlf,UAAUva,KAAK+8E,QAAQ9mC,YAAa,4BAS7CslC,EAAcxgF,UAAUmrD,eAAiB,SAAUm2B,EAAcl2B,EAAWC,EAAa8xB,GACrF,GACI8E,GAAcC,EADdC,EAAc,GAAIN,GAAyBO,sBAE/C,IAAIh3B,EAAUlmD,OAASylD,EAAYpmC,cAAcsmC,UAAW,CACxD,GAAIw3B,GAAYj3B,CACZi3B,GAAU/0C,OAAO7oB,SACjBw9D,EAAeh9E,KAAKq9E,oBAAoBhB,EAAce,EAAUpuE,KAAMouE,EAAUpiD,KAAMorB,EAAa8xB,EAAegF,IAGlHn1E,EAAOiC,OAAOozE,EAAU/0C,OAAO5oB,WAAY,mBAI3Cw9D,EACIG,EAAU/0C,OAAO1oB,QACZ08D,EAAa7zB,iBAAiBjpB,eAC1B69C,EAAUpuE,KAAK4C,UAC5BorE,EAAeh9E,KAAKs9E,sBAAsBjB,EAAce,EAAUpuE,KAAMouE,EAAUpiD,KAAMorB,EAAa8xB,EAAe+E,EAAkBC,QAGzI,IAAI/2B,EAAUlmD,OAASylD,EAAYpmC,cAAcw7D,MAAO,CACzD,GAAI5zE,GAAQi/C,CACRj/C,GAAMmhC,OAAO7oB,SACbw9D,EAAeh9E,KAAKu9E,gBAAgBlB,EAAcn1E,EAAM8H,KAAM9H,EAAMtL,SAAUwqD,EAAa8xB,EAAegF,IAG1Gn1E,EAAOiC,OAAO9C,EAAMmhC,OAAO5oB,WAAY,mBAEvCw9D,EACI/1E,EAAMmhC,OAAO1oB,QAAU08D,EAAa7zB,iBAAiBjpB,aACzDy9C,EAAeh9E,KAAKw9E,kBAAkBnB,EAAcn1E,EAAM8H,KAAM9H,EAAMtL,SAAUwqD,EAAa8xB,EAAe+E,EAAkBC,QAGjI,IAAI/2B,EAAUlmD,OAASylD,EAAYpmC,cAAcs7D,eAAgB,CAClE,GAAIt+C,GAAe6pB,CAKf62B,GAJC1gD,EAAay6C,OAIC/2E,KAAKy9E,iBAAiBpB,EAAc//C,EAAattB,KAAMo3C,EAAa8xB,EAAegF,GAHnFl9E,KAAK09E,cAAcrB,EAAc//C,EAAattB,KAAMstB,EAAaq+C,aAAcv0B,EAAa8xB,EAAegF,OAM7H,IAAI/2B,EAAUlmD,OAASylD,EAAYpmC,cAAcu7D,gBAIlD,KAAM9yE,GAAOihB,eAAe,2BAA6Bm9B,EAAUlmD,KAHnE+8E,GAAeh9E,KAAK29E,gBAAgBtB,EAAcl2B,EAAUn3C,KAAMo3C,EAAa82B,GAKnF,GAAIV,GAAUU,EAAYU,YAE1B,OADArC,GAAcsC,oBAAoBxB,EAAcW,EAAcR,GACvD,GAAIM,GAAgBE,EAAcR,IAQ7CjB,EAAcsC,oBAAsB,SAAUxB,EAAcW,EAAcE,GACtE,GAAIh1B,GAAY80B,EAAa10B,eAC7B,IAAIJ,EAAU5oB,qBAAsB,CAChC,GAAIw+C,GAAgB51B,EAAUzuB,UAAU9iB,cAAgBuxC,EAAUzuB,UAAU7nB,UACxEmsE,EAAkB1B,EAAa9zB,wBAC/B20B,EAAYnhF,OAAS,IACpBsgF,EAAa/zB,gBAAgBhpB,sBAC7Bw+C,IACI51B,EACIzuB,UACAlnB,OAA6BwrE,KACrC71B,EACIzuB,UACAjlB,cACAjC,OAAOwrE,EAAgBvpE,iBAC5B0oE,EAAYjhF,KAAKu5C,EAAS5wB,OAAOI,YACZg4D,EAAaz0B,2BAa9CgzB,EAAcxgF,UAAUijF,oCAAsC,SAAUl3B,EAAWm3B,EAAY73B,EAAa/d,EAAQ60C,GAChH,GAAIgB,GAAep3B,EAAUwB,eAC7B,IAA8C,MAA1ClC,EAAY+3B,eAAeF,GAE3B,MAAOn3B,EAGP,IAAI60B,OAAgB,GAAQyC,MAAa,EACzC,IAAIH,EAAWrsE,UAGX,GADA7J,EAAOiC,OAAO88C,EAAU0B,iBAAiBlpB,qBAAsB,8DAC3DwnB,EAAU0B,iBAAiBjpB,aAAc,CAIzC,GAAIinB,GAAcM,EAAU2B,wBACxB41B,EAAmB73B,YAAuBt9B,GAAejT,aACvDuwC,EACAt9B,EAAejT,aAAaP,WAC9B4oE,EAAwBl4B,EAAYS,0BAA0Bw3B,EAClE1C,GAAgB37E,KAAK+8E,QAAQlnC,eAAeiR,EAAUwB,gBAAgB7uB,UAAW6kD,EAAuBpB,OAEvG,CACD,GAAIqB,GAAen4B,EAAYO,uBAAuBG,EAAU2B,wBAChEkzB,GAAgB37E,KAAK+8E,QAAQlnC,eAAeiR,EAAUwB,gBAAgB7uB,UAAW8kD,EAAcrB,OAGlG,CACD,GAAI93D,GAAW64D,EAAWhtE,UAC1B,IAAgB,aAAZmU,EAAyB,CACzBrd,EAAOiC,OAAiC,GAA1Bi0E,EAAW/sE,YAAkB,wDAC3C,IAAIstE,GAAeN,EAAazkD,SAChC2kD,GAAat3B,EAAU0B,iBAAiB/uB,SAExC,IAAIglD,GAAkBr4B,EAAYs4B,mCAAmCT,EAAYO,EAAcJ,EAE3FzC,GADmB,MAAnB8C,EACgBz+E,KAAK+8E,QAAQnmE,eAAe4nE,EAAcC,GAI1CP,EAAazkD,cAGhC,CACD,GAAIklD,GAAkBV,EAAW9sE,WAE7BytE,MAAgB,EACpB,IAAIV,EAAaz+C,mBAAmBra,GAAW,CAC3Cg5D,EAAat3B,EAAU0B,iBAAiB/uB,SACxC,IAAIolD,GAAmBz4B,EAAYs4B,mCAAmCT,EAAYC,EAAazkD,UAAW2kD,EAEtGQ,GADoB,MAApBC,EACgBX,EACXzkD,UACA3iB,kBAAkBsO,GAClBxN,YAAY+mE,EAAiBE,GAIlBX,EACXzkD,UACA3iB,kBAAkBsO,OAI3Bw5D,GAAgBx4B,EAAY04B,kBAAkB15D,EAAU0hC,EAAU0B,iBAGlEmzB,GADiB,MAAjBiD,EACgB5+E,KAAK+8E,QAAQnlE,YAAYsmE,EAAazkD,UAAWrU,EAAUw5D,EAAeD,EAAiBt2C,EAAQ60C,GAInGgB,EAAazkD,WAIzC,MAAOqtB,GAAUmB,gBAAgB0zB,EAAeuC,EAAa5+C,sBAAwB2+C,EAAWrsE,UAAW5R,KAAK+8E,QAAQhnC,iBAchIwlC,EAAcxgF,UAAUuiF,sBAAwB,SAAUjB,EAAc4B,EAAYc,EAAa34B,EAAa8xB,EAAe+E,EAAkBC,GAC3I,GACIxB,GADAsD,EAAgB3C,EAAa7zB,iBAE7By2B,EAAehC,EACbj9E,KAAK+8E,QACL/8E,KAAK+8E,QAAQ/mC,kBACnB,IAAIioC,EAAWrsE,UACX8pE,EAAiBuD,EAAappC,eAAempC,EAAcvlD,UAAWslD,EAAa,UAElF,IAAIE,EAAalpC,iBAAmBipC,EAAcz/C,aAAc,CAEjE,GAAI2/C,GAAgBF,EACfvlD,UACA7hB,YAAYqmE,EAAYc,EAC7BrD,GAAiBuD,EAAappC,eAAempC,EAAcvlD,UAAWylD,EAAe,UAEpF,CACD,GAAI95D,GAAW64D,EAAWhtE,UAC1B,KAAK+tE,EAAcx/C,kBAAkBy+C,IACjCA,EAAW/sE,YAAc,EAEzB,MAAOmrE,EAEX,IAAIsC,GAAkBV,EAAW9sE,WAC7BkH,EAAY2mE,EAAcvlD,UAAU3iB,kBAAkBsO,GACtDhO,EAAeiB,EAAUT,YAAY+mE,EAAiBI,EAEtDrD,GADY,aAAZt2D,EACiB65D,EAAaroE,eAAeooE,EAAcvlD,UAAWriB,GAGrD6nE,EAAarnE,YAAYonE,EAAcvlD,UAAWrU,EAAUhO,EAAcunE,EAAiB9B,EAAsBsC,yBAA0B,MAGpK,GAAInC,GAAeX,EAAaj0B,iBAAiBszB,EAAgBsD,EAAc1/C,sBAAwB2+C,EAAWrsE,UAAWqtE,EAAalpC,gBACtI1N,EAAS,GAAIw0C,GAAsBuC,6BAA6Bh5B,EAAa42B,EAAc9E,EAC/F,OAAOl4E,MAAKg+E,oCAAoChB,EAAciB,EAAY73B,EAAa/d,EAAQ60C,IAYnG3B,EAAcxgF,UAAUsiF,oBAAsB,SAAUhB,EAAc4B,EAAYc,EAAa34B,EAAa8xB,EAAegF,GACvH,GACIF,GAAcrB,EADduC,EAAe7B,EAAa/zB,gBAE5BjgB,EAAS,GAAIw0C,GAAsBuC,6BAA6Bh5B,EAAai2B,EAAcnE,EAC/F,IAAI+F,EAAWrsE,UACX+pE,EAAgB37E,KAAK+8E,QAAQlnC,eAAewmC,EAAa/zB,gBAAgB7uB,UAAWslD,EAAa7B,GACjGF,EAAeX,EAAap0B,gBAAgB0zB,GAAe,EAAM37E,KAAK+8E,QAAQhnC,oBAE7E,CACD,GAAI3wB,GAAW64D,EAAWhtE,UAC1B,IAAiB,cAAbmU,EACAu2D,EAAgB37E,KAAK+8E,QAAQnmE,eAAeylE,EAAa/zB,gBAAgB7uB,UAAWslD,GACpF/B,EAAeX,EAAap0B,gBAAgB0zB,EAAeuC,EAAa5+C,qBAAsB4+C,EAAa3+C,kBAE1G,CACD,GAAIo/C,GAAkBV,EAAW9sE,WAC7BwkC,EAAWuoC,EAAazkD,UAAU3iB,kBAAkBsO,GACpDmvB,MAAW,EACf,IAAIoqC,EAAgB/sE,UAEhB2iC,EAAWwqC,MAEV,CACD,GAAI1mE,GAAYgwB,EAAOg3C,iBAAiBj6D,EAMhCmvB,GALS,MAAbl8B,EACkC,cAA9BsmE,EAAgBvtE,WAChBiH,EAAUrB,SAAS2nE,EAAgBh+E,UAAUiR,UAGlCyG,EAGAA,EAAUT,YAAY+mE,EAAiBI,GAK3C71D,EAAejT,aAAaP,WAG/C,GAAKigC,EAASpjC,OAAOgiC,GAKjByoC,EAAeX,MALa,CAC5B,GAAIiD,GAAet/E,KAAK+8E,QAAQnlE,YAAYsmE,EAAazkD,UAAWrU,EAAUmvB,EAAUoqC,EAAiBt2C,EAAQ60C,EACjHF,GAAeX,EAAap0B,gBAAgBq3B,EAAcpB,EAAa5+C,qBAAsBt/B,KAAK+8E,QAAQhnC,kBAOtH,MAAOinC,IAQXzB,EAAcgE,eAAiB,SAAUz4B,EAAW1hC,GAChD,MAAO0hC,GAAUwB,gBAAgB7oB,mBAAmBra,IAYxDm2D,EAAcxgF,UAAUwiF,gBAAkB,SAAUz2B,EAAW93C,EAAM8rB,EAAiBsrB,EAAaI,EAAa02B,GAC5G,GAAI9lD,GAAQp3B,KAORw/E,EAAe14B,CAanB,OAZAhsB,GAAgBua,QAAQ,SAAUxjC,EAAcwG,GAC5C,GAAIonE,GAAYzwE,EAAKtT,MAAMmW,EACvB0pE,GAAcgE,eAAez4B,EAAW24B,EAAUxuE,cAClDuuE,EAAepoD,EAAMimD,oBAAoBmC,EAAcC,EAAWpnE,EAAW+tC,EAAaI,EAAa02B,MAG/GpiD,EAAgBua,QAAQ,SAAUxjC,EAAcwG,GAC5C,GAAIonE,GAAYzwE,EAAKtT,MAAMmW,EACtB0pE,GAAcgE,eAAez4B,EAAW24B,EAAUxuE,cACnDuuE,EAAepoD,EAAMimD,oBAAoBmC,EAAcC,EAAWpnE,EAAW+tC,EAAaI,EAAa02B,MAGxGsC,GAQXjE,EAAcxgF,UAAU2kF,YAAc,SAAUniF,EAAM2J,GAIlD,MAHAA,GAAMmuC,QAAQ,SAAUxjC,EAAcwG,GAClC9a,EAAOA,EAAKqa,YAAY/F,EAAcwG,KAEnC9a,GAaXg+E,EAAcxgF,UAAUyiF,kBAAoB,SAAU12B,EAAW93C,EAAM8rB,EAAiBsrB,EAAaI,EAAay2B,EAAkBC,GAChI,GAAI9lD,GAAQp3B,IAGZ,IAAI8mD,EACC0B,iBACA/uB,UACA7nB,YACAk1C,EAAU0B,iBAAiBlpB,qBAC5B,MAAOwnB,EAQX,IACI64B,GADAH,EAAe14B,CAGf64B,GADA3wE,EAAK4C,UACWkpB,EAGAg7C,EAAgBjiC,cAAc1W,MAAMqX,QAAQxlC,EAAM8rB,EAEtE,IAAIsjD,GAAat3B,EAAU0B,iBAAiB/uB,SAuB5C,OAtBAkmD,GAAc/jF,SAAS4d,iBAAiB,SAAU4L,EAAUivB,GACxD,GAAI+pC,EAAWlnE,SAASkO,GAAW,CAC/B,GAAIw6D,GAAc94B,EACb0B,iBACA/uB,UACA3iB,kBAAkBsO,GACnBmvB,EAAWnd,EAAMsoD,YAAYE,EAAavrC,EAC9CmrC,GAAepoD,EAAMkmD,sBAAsBkC,EAAc,GAAI/iE,GAAO/L,KAAK0U,GAAWmvB,EAAU6R,EAAaI,EAAay2B,EAAkBC,MAGlJyC,EAAc/jF,SAAS4d,iBAAiB,SAAU4L,EAAUy6D,GACxD,GAAIC,IAAsBh5B,EAAU0B,iBAAiB/oB,mBAAmBra,IAC5C,MAAxBy6D,EAAezkF,KACnB,KAAKgjF,EAAWlnE,SAASkO,KAAc06D,EAAoB,CACvD,GAAIF,GAAc94B,EACb0B,iBACA/uB,UACA3iB,kBAAkBsO,GACnBmvB,EAAWnd,EAAMsoD,YAAYE,EAAaC,EAC9CL,GAAepoD,EAAMkmD,sBAAsBkC,EAAc,GAAI/iE,GAAO/L,KAAK0U,GAAWmvB,EAAU6R,EAAaI,EAAay2B,EAAkBC,MAG3IsC,GAYXjE,EAAcxgF,UAAU2iF,cAAgB,SAAU52B,EAAWi5B,EAASpF,EAAcv0B,EAAa8xB,EAAegF,GAC5G,GAA2C,MAAvC92B,EAAY+3B,eAAe4B,GAC3B,MAAOj5B,EAGX,IAAIm2B,GAAmBn2B,EAAU0B,iBAAiBjpB,aAG9CinB,EAAcM,EAAU0B,gBAC5B,IAA0B,MAAtBmyB,EAAav/E,MAAe,CAE5B,GAAK2kF,EAAQnuE,WAAa40C,EAAYlnB,sBAClCknB,EAAYhnB,kBAAkBugD,GAC9B,MAAO//E,MAAKs9E,sBAAsBx2B,EAAWi5B,EAASv5B,EAAY/sB,UAAUziB,SAAS+oE,GAAU35B,EAAa8xB,EAAe+E,EAAkBC,EAE5I,IAAI6C,EAAQnuE,UAAW,CAGxB,GAAIouE,GAAoBlK,EAAgBjiC,cAAc1W,KAItD,OAHAqpB,GAAY/sB,UAAUrhB,aAAatC,EAAWsE,UAAW,SAAUjgB,EAAMoD,GACrEyiF,EAAoBA,EAAkB51E,IAAI,GAAIqS,GAAO/L,KAAKvW,GAAOoD,KAE9DyC,KAAKw9E,kBAAkB12B,EAAWi5B,EAASC,EAAmB55B,EAAa8xB,EAAe+E,EAAkBC,GAGnH,MAAOp2B,GAKX,GAAIm5B,GAAoBnK,EAAgBjiC,cAAc1W,KAOtD,OANAw9C,GAAatlC,QAAQ,SAAU6qC,EAAW9kF,GACtC,GAAI+kF,GAAkBJ,EAAQrkF,MAAMwkF,EAChC15B,GAAYhnB,kBAAkB2gD,KAC9BF,EAAoBA,EAAkB71E,IAAI81E,EAAW15B,EAAY/sB,UAAUziB,SAASmpE,OAGrFngF,KAAKw9E,kBAAkB12B,EAAWi5B,EAASE,EAAmB75B,EAAa8xB,EAAe+E,EAAkBC,IAW3H3B,EAAcxgF,UAAU4iF,gBAAkB,SAAU72B,EAAW93C,EAAMo3C,EAAa82B,GAC9E,GAAIkD,GAAgBt5B,EAAU0B,iBAC1Bw0B,EAAel2B,EAAUsB,iBAAiBg4B,EAAc3mD,UAAW2mD,EAAc9gD,sBAAwBtwB,EAAK4C,UAAWwuE,EAAc7gD,aAC3I,OAAOv/B,MAAKg+E,oCAAoChB,EAAchuE,EAAMo3C,EAAay2B,EAAsBsC,yBAA0BjC,IAWrI3B,EAAcxgF,UAAU0iF,iBAAmB,SAAU32B,EAAW93C,EAAMo3C,EAAag2B,EAAqBc,GACpG,GAAI53C,EACJ,IAAwC,MAApC8gB,EAAY+3B,eAAenvE,GAC3B,MAAO83C,EAGP,IAAIze,GAAS,GAAIw0C,GAAsBuC,6BAA6Bh5B,EAAaU,EAAWs1B,GACxFiE,EAAgBv5B,EAAUwB,gBAAgB7uB,UAC1CkiD,MAAgB,EACpB,IAAI3sE,EAAK4C,WAAiC,cAApB5C,EAAKiC,WAA4B,CACnD,GAAI8D,OAAU,EACd,IAAI+xC,EAAU0B,iBAAiBlpB,qBAC3BvqB,EAAUqxC,EAAYO,uBAAuBG,EAAU2B,6BAEtD,CACD,GAAI63B,GAAiBx5B,EAAU0B,iBAAiB/uB,SAChD1xB,GAAOiC,OAAOs2E,YAA0Bp3D,GAAejT,aAAc,iDACrElB,EAAUqxC,EAAYS,0BAA0By5B,GAEpDvrE,EAAUA,EACV4mE,EAAgB37E,KAAK+8E,QAAQlnC,eAAewqC,EAAetrE,EAASmoE,OAEnE,CACD,GAAI93D,GAAWpW,EAAKiC,WAChBsjC,EAAW6R,EAAY04B,kBAAkB15D,EAAU0hC,EAAU0B,iBACjD,OAAZjU,GACAuS,EAAU0B,iBAAiB/oB,mBAAmBra,KAC9CmvB,EAAW8rC,EAAcvpE,kBAAkBsO,IAG3Cu2D,EADY,MAAZpnC,EACgBv0C,KAAK+8E,QAAQnlE,YAAYyoE,EAAej7D,EAAUmvB,EAAUvlC,EAAKmC,WAAYk3B,EAAQ60C,GAEhGp2B,EACJwB,gBACA7uB,UACAviB,SAASkO,GAEMplB,KAAK+8E,QAAQnlE,YAAYyoE,EAAej7D,EAAU8D,EAAejT,aAAaP,WAAY1G,EAAKmC,WAAYk3B,EAAQ60C,GAGnHmD,EAEhB1E,EAAc/pE,WACdk1C,EAAU0B,iBAAiBlpB,uBAE3BgG,EAAW8gB,EAAYO,uBAAuBG,EAAU2B,yBACpDnjB,EAAS3uB,eACTglE,EAAgB37E,KAAK+8E,QAAQlnC,eAAe8lC,EAAer2C,EAAU43C,KAOjF,MAHA53C,GACIwhB,EAAU0B,iBAAiBlpB,sBAC0B,MAAjD8mB,EAAY+3B,eAAe1hE,EAAO/L,KAAKysB,OACxC2pB,EAAUmB,gBAAgB0zB,EAAer2C,EAAUtlC,KAAK+8E,QAAQhnC,iBAGxEwlC,IAEX5hF,GAAQ4hF,cAAgBA,GzKowoBlB,SAAU3hF,EAAQD,EAASH,GAEjC,Y0Kt0pBAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAI2M,GAASvO,EAAQ,GACjBg8C,EAAWh8C,EAAQ,IACnBwO,EAASxO,EAAQ,GAIjB2jF,EAAwC,WACxC,QAASA,KACLn9E,KAAKugF,cAmDT,MA9CApD,GAAuBpiF,UAAU66C,iBAAmB,SAAU++B,GAC1D,GAAI10E,GAAO00E,EAAO10E,KACdmlB,EAAkCuvD,EAAO59D,SAC7C/O,GAAOgC,OAAO/J,GAAQu1C,EAAS5wB,OAAOS,aAClCplB,GAAQu1C,EAAS5wB,OAAOe,eACxB1lB,GAAQu1C,EAAS5wB,OAAOW,cAAe,6CAC3Cvd,EAAOgC,OAAoB,cAAbob,EAA0B,kDACxC,IAAIo7D,GAAYz4E,EAAOsX,QAAQrf,KAAKugF,WAAYn7D,EAChD,IAAIo7D,EAAW,CACX,GAAIC,GAAUD,EAAUvgF,IACxB,IAAIA,GAAQu1C,EAAS5wB,OAAOS,aAAeo7D,GAAWjrC,EAAS5wB,OAAOW,cAClEvlB,KAAKugF,WAAWn7D,GAAYowB,EAAS5wB,OAAOY,mBAAmBJ,EAAUuvD,EAAO9vD,aAAc27D,EAAU37D,kBAEvG,IAAI5kB,GAAQu1C,EAAS5wB,OAAOW,eAC7Bk7D,GAAWjrC,EAAS5wB,OAAOS,kBACpBrlB,MAAKugF,WAAWn7D,OAEtB,IAAInlB,GAAQu1C,EAAS5wB,OAAOW,eAC7Bk7D,GAAWjrC,EAAS5wB,OAAOe,cAC3B3lB,KAAKugF,WAAWn7D,GAAYowB,EAAS5wB,OAAOU,mBAAmBF,EAAUo7D,EAAU17D,aAElF,IAAI7kB,GAAQu1C,EAAS5wB,OAAOe,eAC7B86D,GAAWjrC,EAAS5wB,OAAOS,YAC3BrlB,KAAKugF,WAAWn7D,GAAYowB,EAAS5wB,OAAOO,iBAAiBC,EAAUuvD,EAAO9vD,kBAE7E,IAAI5kB,GAAQu1C,EAAS5wB,OAAOe,eAC7B86D,GAAWjrC,EAAS5wB,OAAOe,cAI3B,KAAM3d,GAAOghB,eAAe,mCACxB2rD,EACA,mBACA6L,EANJxgF,MAAKugF,WAAWn7D,GAAYowB,EAAS5wB,OAAOY,mBAAmBJ,EAAUuvD,EAAO9vD,aAAc27D,EAAU17D,cAU5G9kB,MAAKugF,WAAWn7D,GAAYuvD,GAMpCwI,EAAuBpiF,UAAU6iF,WAAa,WAC1C,MAAO71E,GAAO+zC,UAAU97C,KAAKugF,aAE1BpD,IAEXxjF,GAAQwjF,uBAAyBA,G1K+0pB3B,SAAUvjF,EAAQD,EAASH,GAEjC,Y2K/4pBAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAI0qD,GAActsD,EAAQ,IAQtBknF,EAAwC,WACxC,QAASA,MAcT,MATAA,GAAuB3lF,UAAUskF,iBAAmB,SAAUj6D,GAC1D,MAAO,OAKXs7D,EAAuB3lF,UAAU4lF,mBAAqB,SAAU/nE,EAAOld,EAAOsS,GAC1E,MAAO,OAEJ0yE,IAEX/mF,GAAQ+mF,uBAAyBA,EAMjC/mF,EAAQwlF,yBAA2B,GAAIuB,EAQvC,IAAItB,GAA8C,WAM9C,QAASA,GAA6BwB,EAAShF,EAAYiF,OACvB,KAA5BA,IAAsCA,EAA0B,MACpE7gF,KAAK4gF,QAAUA,EACf5gF,KAAK47E,WAAaA,EAClB57E,KAAK6gF,wBAA0BA,EAgCnC,MA3BAzB,GAA6BrkF,UAAUskF,iBAAmB,SAAUj6D,GAChE,GAAI7nB,GAAOyC,KAAK47E,WAAWtzB,eAC3B,IAAI/qD,EAAKkiC,mBAAmBra,GACxB,MAAO7nB,GAAKk8B,UAAU3iB,kBAAkBsO,EAGxC,IAAIg5D,GAA6C,MAAhCp+E,KAAK6gF,wBAChB,GAAI/6B,GAAY5mB,UAAUl/B,KAAK6gF,yBAAyB,GAAM,GAC9D7gF,KAAK47E,WAAWpzB,gBACtB,OAAOxoD,MAAK4gF,QAAQ9B,kBAAkB15D,EAAUg5D,IAMxDgB,EAA6BrkF,UAAU4lF,mBAAqB,SAAU/nE,EAAOld,EAAOsS,GAChF,GAAI8yE,GAAqD,MAAhC9gF,KAAK6gF,wBACxB7gF,KAAK6gF,wBACL7gF,KAAK47E,WAAWnzB,wBAClBs4B,EAAQ/gF,KAAK4gF,QAAQI,iBAAiBF,EAAoBplF,EAAO,EAAGsS,EAAS4K,EACjF,OAAqB,KAAjBmoE,EAAMhlF,OACC,KAGAglF,EAAM,IAGd3B,IAEXzlF,GAAQylF,6BAA+BA,G3Kk6pBjC,SAAUxlF,EAAQD,EAASH,GAEjC,Y4Kx/pBAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAI8Y,GAAS1a,EAAQ,GACjBg8C,EAAWh8C,EAAQ,IACnBuO,EAASvO,EAAQ,GAQjBsiF,EAAgC,WAKhC,QAASA,GAAeb,GACpBj7E,KAAKi7E,OAASA,EAKdj7E,KAAKkzC,OAASlzC,KAAKi7E,OAAOh7B,iBAAiBhK,WAuF/C,MAvEA6lC,GAAe/gF,UAAU4hF,yBAA2B,SAAUH,EAAS91B,EAAYu6B,GAC/E,GAAI7pD,GAAQp3B,KACRg6B,KACAknD,IAYJ,OAXA1E,GAAQpvE,QAAQ,SAAUunE,GAClBA,EAAO10E,OAASu1C,EAAS5wB,OAAOe,eAChCyR,EAAM8b,OAAOr+B,oBAAoB8/D,EAAO7vD,QAAS6vD,EAAO9vD,eACxDq8D,EAAMjlF,KAAKu5C,EAAS5wB,OAAOgB,iBAAiB+uD,EAAO59D,UAAW49D,EAAO9vD,iBAG7E7kB,KAAKmhF,uBAAuBnnD,EAAQwb,EAAS5wB,OAAOW,cAAei3D,EAASyE,EAAoBv6B,GAChG1mD,KAAKmhF,uBAAuBnnD,EAAQwb,EAAS5wB,OAAOS,YAAam3D,EAASyE,EAAoBv6B,GAC9F1mD,KAAKmhF,uBAAuBnnD,EAAQwb,EAAS5wB,OAAOiB,YAAaq7D,EAAOD,EAAoBv6B,GAC5F1mD,KAAKmhF,uBAAuBnnD,EAAQwb,EAAS5wB,OAAOe,cAAe62D,EAASyE,EAAoBv6B,GAChG1mD,KAAKmhF,uBAAuBnnD,EAAQwb,EAAS5wB,OAAOM,MAAOs3D,EAASyE,EAAoBv6B,GACjF1sB,GAYX8hD,EAAe/gF,UAAUomF,uBAAyB,SAAUnnD,EAAQ9b,EAAWs+D,EAASE,EAAeh2B,GACnG,GAAItvB,GAAQp3B,KACRohF,EAAkB5E,EAAQlsE,OAAO,SAAUqkE,GAAU,MAAOA,GAAO10E,OAASie,GAChFkjE,GAAgBr0E,KAAK/M,KAAKqhF,gBAAgB75E,KAAKxH,OAC/CohF,EAAgBh0E,QAAQ,SAAUunE,GAC9B,GAAI2M,GAAqBlqD,EAAMmqD,yBAAyB5M,EAAQjuB,EAChEg2B,GAActvE,QAAQ,SAAU6uE,GACxBA,EAAaxH,WAAWE,EAAO10E,OAC/B+5B,EAAO/9B,KAAKggF,EAAavH,YAAY4M,EAAoBlqD,EAAM6jD,cAW/Ea,EAAe/gF,UAAUwmF,yBAA2B,SAAU5M,EAAQjuB,GAClE,MAAoB,UAAhBiuB,EAAO10E,MAAoC,kBAAhB00E,EAAO10E,KAC3B00E,GAGPA,EAAO5vD,SAAW2hC,EAAW/tC,wBAE7Bg8D,EAAO59D,UAAW49D,EAAO9vD,aAAc7kB,KAAKkzC,QACrCyhC,IASfmH,EAAe/gF,UAAUsmF,gBAAkB,SAAUt/E,EAAGuK,GACpD,GAAmB,MAAfvK,EAAEgV,WAAoC,MAAfzK,EAAEyK,UACzB,KAAMhP,GAAOihB,eAAe,qCAEhC,IAAIw4D,GAAW,GAAIttE,GAAOe,UAAUlT,EAAEgV,UAAWhV,EAAE8iB,cAC/C48D,EAAW,GAAIvtE,GAAOe,UAAU3I,EAAEyK,UAAWzK,EAAEuY,aACnD,OAAO7kB,MAAKkzC,OAAO5+B,QAAQktE,EAAUC,IAElC3F,IAEXniF,GAAQmiF,eAAiBA,G5KghqBnB,SAAUliF,EAAQD,EAASH,GAEjC,Y6KjoqBAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAI2M,GAASvO,EAAQ,GACjBwO,EAASxO,EAAQ,GACjBijB,EAASjjB,EAAQ,GACjBkoF,EAAkBloF,EAAQ,KAC1Bqc,EAAkBrc,EAAQ,GAC1B0vB,EAAiB1vB,EAAQ,GAQzB88E,EAA2B,WAC3B,QAASA,KAQLt2E,KAAK2hF,eAAiBD,EAAgBE,cAAczkD,MASpDn9B,KAAK6hF,cACL7hF,KAAK8hF,cAAgB,EAudzB,MA/cAxL,GAAUv7E,UAAUu9E,YAAc,SAAUtpE,GACxC,MAAO,IAAI+yE,GAAa/yE,EAAMhP,OAUlCs2E,EAAUv7E,UAAU27E,aAAe,SAAU1nE,EAAMgsB,EAAMe,EAASgyB,GAC9D/lD,EAAOgC,OAAO+xB,EAAU/7B,KAAK8hF,aAAc,oDAC3B3lF,KAAZ4xD,IACAA,GAAU,GAEd/tD,KAAK6hF,WAAW5lF,MACZ+S,KAAMA,EACNgsB,KAAMA,EACNe,QAASA,EACTgyB,QAASA,IAETA,IACA/tD,KAAK2hF,eAAiB3hF,KAAK2hF,eAAeK,SAAShzE,EAAMgsB,IAE7Dh7B,KAAK8hF,aAAe/lD,GASxBu6C,EAAUv7E,UAAU67E,SAAW,SAAU5nE,EAAM8rB,EAAiBiB,GAC5D/zB,EAAOgC,OAAO+xB,EAAU/7B,KAAK8hF,aAAc,gDAC3C9hF,KAAK6hF,WAAW5lF,MACZ+S,KAAMA,EACNpT,SAAUk/B,EACViB,QAASA,EACTgyB,SAAS,IAEb/tD,KAAK2hF,eAAiB3hF,KAAK2hF,eAAeM,UAAUjzE,EAAM8rB,GAC1D96B,KAAK8hF,aAAe/lD,GAMxBu6C,EAAUv7E,UAAUi8E,SAAW,SAAUj7C,GACrC,IAAK,GAAIliC,GAAI,EAAGA,EAAImG,KAAK6hF,WAAW9lF,OAAQlC,IAAK,CAC7C,GAAIgnC,GAAS7gC,KAAK6hF,WAAWhoF,EAC7B,IAAIgnC,EAAO9E,UAAYA,EACnB,MAAO8E,GAGf,MAAO,OAUXy1C,EAAUv7E,UAAUk8E,YAAc,SAAUl7C,GAKxC,GAAI3E,GAAQp3B,KACR6Y,EAAM7Y,KAAK6hF,WAAWtW,UAAU,SAAUrwE,GAC1C,MAAOA,GAAE6gC,UAAYA,GAEzB/zB,GAAOgC,OAAO6O,GAAO,EAAG,+CACxB,IAAIqpE,GAAgBliF,KAAK6hF,WAAWhpE,EACpC7Y,MAAK6hF,WAAWv9E,OAAOuU,EAAK,EAI5B,KAHA,GAAIspE,GAAyBD,EAAcn0B,QACvCq0B,GAAsC,EACtCvoF,EAAImG,KAAK6hF,WAAW9lF,OAAS,EAC1BomF,GAA0BtoF,GAAK,GAAG,CACrC,GAAIwoF,GAAeriF,KAAK6hF,WAAWhoF,EAC/BwoF,GAAat0B,UACTl0D,GAAKgf,GACL7Y,KAAKsiF,oBAAoBD,EAAcH,EAAclzE,MAErDmzE,GAAyB,EAEpBD,EAAclzE,KAAKyD,SAAS4vE,EAAarzE,QAE9CozE,GAAsC,IAG9CvoF,IAEJ,GAAKsoF,EAGA,IAAIC,EAGL,MADApiF,MAAKuiF,cACE,CAIP,IAAIL,EAAclnD,KACdh7B,KAAK2hF,eAAiB3hF,KAAK2hF,eAAe1K,YAAYiL,EAAclzE,UAEnE,CACD,GAAIpT,GAAWsmF,EAActmF,QAC7BmM,GAAOqF,QAAQxR,EAAU,SAAUmb,GAC/BqgB,EAAMuqD,eAAiBvqD,EAAMuqD,eAAe1K,YAAYiL,EAAclzE,KAAKtT,MAAMqb,MAGzF,OAAO,EAlBP,OAAO,GA4Bfu/D,EAAUv7E,UAAUynF,qBAAuB,SAAUxzE,GACjD,MAAOhP,MAAK2hF,eAAec,gBAAgBzzE,IAY/CsnE,EAAUv7E,UAAU4rD,uBAAyB,SAAU+7B,EAAUtG,EAAqB9C,EAAmBqJ,GACrG,GAAKrJ,GAAsBqJ,EAqBtB,CACD,GAAIz7E,GAAQlH,KAAK2hF,eAAeiB,mBAAmBF,EACnD,KAAKC,GAAuBz7E,EAAM0K,UAC9B,MAAOwqE,EAIP,IAAKuG,GACsB,MAAvBvG,GACCl1E,EAAM27E,iBAAiBpmE,EAAO/L,KAAKysB,OAGnC,CACD,GAAI7sB,GAAS,SAAU8nD,GACnB,OAASA,EAAMrK,SAAW40B,MACpBrJ,KACIA,EAAkBruE,QAAQmtD,EAAMr8B,YACrCq8B,EAAMppD,KAAKyD,SAASiwE,IAAaA,EAASjwE,SAAS2lD,EAAMppD,QAE9D8zE,EAAcxM,EAAUyM,WAAW/iF,KAAK6hF,WAAYvxE,EAAQoyE,GAC5DM,EAAe5G,GAAuBlzD,EAAejT,aAAaP,UACtE,OAAOotE,GAAYr5E,MAAMu5E,GAXzB,MAAO,MA9Bf,GAAIC,GAAgBjjF,KAAK2hF,eAAec,gBAAgBC,EACxD,IAAqB,MAAjBO,EACA,MAAOA,EAGP,IAAIC,GAAWljF,KAAK2hF,eAAeiB,mBAAmBF,EACtD,IAAIQ,EAAStxE,UACT,MAAOwqE,EAEN,IAA2B,MAAvBA,GACJ8G,EAASL,iBAAiBpmE,EAAO/L,KAAKysB,OAItC,CACD,GAAI6lD,GAAe5G,GAAuBlzD,EAAejT,aAAaP,UACtE,OAAOwtE,GAASz5E,MAAMu5E,GAJtB,MAAO,OA0CvB1M,EAAUv7E,UAAU8rD,0BAA4B,SAAU67B,EAAUS,GAChE,GAAI9E,GAAmBn1D,EAAejT,aAAaP,WAC/C0tE,EAAcpjF,KAAK2hF,eAAec,gBAAgBC,EACtD,IAAIU,EAOA,MANKA,GAAYzsE,cAEbysE,EAAYhrE,aAAavC,EAAgBJ,eAAgB,SAAUsB,EAAWi9B,GAC1EqqC,EAAmBA,EAAiBlnE,qBAAqBJ,EAAWi9B,KAGrEqqC,CAEN,IAAI8E,EAAwB,CAG7B,GAAIE,GAAUrjF,KAAK2hF,eAAeiB,mBAAmBF,EAWrD,OAVAS,GAAuB/qE,aAAavC,EAAgBJ,eAAgB,SAAUsB,EAAWsB,GACrF,GAAI9a,GAAO8lF,EACNT,mBAAmB,GAAInmE,GAAO/L,KAAKqG,IACnCtN,MAAM4O,EACXgmE,GAAmBA,EAAiBlnE,qBAAqBJ,EAAWxZ,KAGxE8lF,EAAQC,sBAAsBl2E,QAAQ,SAAUiK,GAC5CgnE,EAAmBA,EAAiBlnE,qBAAqBE,EAAUld,KAAMkd,EAAU9Z,QAEhF8gF,EASP,MAJYr+E,MAAK2hF,eAAeiB,mBAAmBF,GAC7CY,sBAAsBl2E,QAAQ,SAAUiK,GAC1CgnE,EAAmBA,EAAiBlnE,qBAAqBE,EAAUld,KAAMkd,EAAU9Z,QAEhF8gF,GAuBf/H,EAAUv7E,UAAU2jF,mCAAqC,SAAUgE,EAAUnvC,EAAWgwC,EAAmBC,GACvGx7E,EAAOgC,OAAOu5E,GAAqBC,EAAoB,4DACvD,IAAIx0E,GAAO0zE,EAAShnF,MAAM63C,EAC1B,IAAIvzC,KAAK2hF,eAAekB,iBAAiB7zE,GAGrC,MAAO,KAIP,IAAIy0E,GAAazjF,KAAK2hF,eAAeiB,mBAAmB5zE,EACxD,OAAIy0E,GAAW7xE,UAEJ4xE,EAAmBxsE,SAASu8B,GAS5BkwC,EAAWh6E,MAAM+5E,EAAmBxsE,SAASu8B,KAahE+iC,EAAUv7E,UAAU+jF,kBAAoB,SAAU4D,EAAUt9D,EAAUo+D,GAClE,GAAIx0E,GAAO0zE,EAAShnF,MAAM0pB,GACtB69D,EAAgBjjF,KAAK2hF,eAAec,gBAAgBzzE,EACxD,IAAqB,MAAjBi0E,EACA,MAAOA,EAGP,IAAIO,EAAmB/jD,mBAAmBra,GAAW,CAEjD,MADiBplB,MAAK2hF,eAAeiB,mBAAmB5zE,GACtCvF,MAAM+5E,EAAmB/pD,UAAU3iB,kBAAkBsO,IAGvE,MAAO,OAYnBkxD,EAAUv7E,UAAUojF,eAAiB,SAAUnvE,GAC3C,MAAOhP,MAAK2hF,eAAec,gBAAgBzzE,IAc/CsnE,EAAUv7E,UAAUimF,iBAAmB,SAAU0B,EAAU5B,EAAoBlnE,EAAW7B,EAAO/J,EAAS4K,GACtG,GAAI8qE,GACAx8E,EAAQlH,KAAK2hF,eAAeiB,mBAAmBF,GAC/CO,EAAgB/7E,EAAMu7E,gBAAgBhmE,EAAO/L,KAAKysB,MACtD,IAAqB,MAAjB8lD,EACAS,EAAYT,MAEX,IAA0B,MAAtBnC,EAKL,QAJA4C,GAAYx8E,EAAMuC,MAAMq3E,GAO5B,GADA4C,EAAYA,EAAUvpE,UAAUvB,GAC3B8qE,EAAU9xE,WAAc8xE,EAAU/sE,aAgBnC,QATA,KANA,GAAIoqE,MACAzuE,EAAMsG,EAAMoR,aACZwa,EAAOx2B,EACL01E,EAAUzpE,uBAAuBL,EAAWhB,GAC5C8qE,EAAU/pE,gBAAgBC,EAAWhB,GACvCnV,EAAO+gC,EAAKzqB,UACTtW,GAAQs9E,EAAMhlF,OAASgc,GACG,IAAzBzF,EAAI7O,EAAMmW,IACVmnE,EAAM9kF,KAAKwH,GAEfA,EAAO+gC,EAAKzqB,SAEhB,OAAOgnE,IAYfzK,EAAUv7E,UAAUunF,oBAAsB,SAAUqB,EAAa30E,GAC7D,MAAI20E,GAAY3oD,KACL2oD,EAAY30E,KAAKyD,SAASzD,KAIxBjH,EAAO2zC,QAAQioC,EAAY/nF,SAAU,SAAUo4C,EAAWj9B,GAC/D,MAAO4sE,GAAY30E,KAAKtT,MAAMqb,GAAWtE,SAASzD,MAQ9DsnE,EAAUv7E,UAAUwnF,WAAa,WAC7BviF,KAAK2hF,eAAiBrL,EAAUyM,WAAW/iF,KAAK6hF,WAAYvL,EAAUsN,eAAgBnnE,EAAO/L,KAAKysB,OAC9Fn9B,KAAK6hF,WAAW9lF,OAAS,EACzBiE,KAAK8hF,aAAe9hF,KAAK6hF,WAAW7hF,KAAK6hF,WAAW9lF,OAAS,GAAGggC,QAGhE/7B,KAAK8hF,cAAgB,GAU7BxL,EAAUsN,eAAiB,SAAUxrB,GACjC,MAAOA,GAAMrK,SAYjBuoB,EAAUyM,WAAa,SAAUc,EAAQvzE,EAAQwzE,GAE7C,IAAK,GADDC,GAAgBrC,EAAgBE,cAAczkD,MACzCtjC,EAAI,EAAGA,EAAIgqF,EAAO9nF,SAAUlC,EAAG,CACpC,GAAIu+D,GAAQyrB,EAAOhqF,EAInB,IAAIyW,EAAO8nD,GAAQ,CACf,GAAIqnB,GAAYrnB,EAAMppD,KAClB6C,MAAe,EACnB,IAAIumD,EAAMp9B,KACF8oD,EAASrxE,SAASgtE,IAClB5tE,EAAe4K,EAAO/L,KAAKmB,aAAaiyE,EAAUrE,GAClDsE,EAAgBA,EAAc/B,SAASnwE,EAAcumD,EAAMp9B,OAEtDykD,EAAUhtE,SAASqxE,KACxBjyE,EAAe4K,EAAO/L,KAAKmB,aAAa4tE,EAAWqE,GACnDC,EAAgBA,EAAc/B,SAASvlE,EAAO/L,KAAKysB,MAAOi7B,EAAMp9B,KAAKhkB,SAASnF,SAMjF,KAAIumD,EAAMx8D,SAwBX,KAAMoM,GAAOghB,eAAe,6CAvB5B,IAAI86D,EAASrxE,SAASgtE,GAClB5tE,EAAe4K,EAAO/L,KAAKmB,aAAaiyE,EAAUrE,GAClDsE,EAAgBA,EAAc9B,UAAUpwE,EAAcumD,EAAMx8D,cAE3D,IAAI6jF,EAAUhtE,SAASqxE,GAExB,GADAjyE,EAAe4K,EAAO/L,KAAKmB,aAAa4tE,EAAWqE,GAC/CjyE,EAAaD,UACbmyE,EAAgBA,EAAc9B,UAAUxlE,EAAO/L,KAAKysB,MAAOi7B,EAAMx8D,cAEhE,CACD,GAAIF,GAAQqM,EAAOsX,QAAQ+4C,EAAMx8D,SAAUiW,EAAaZ,WACxD,IAAIvV,EAAO,CAEP,GAAIsoF,GAAWtoF,EAAMsb,SAASnF,EAAaV,WAC3C4yE,GAAgBA,EAAc/B,SAASvlE,EAAO/L,KAAKysB,MAAO6mD,OAalF,MAAOD,IAEJzN,IAEX38E,GAAQ28E,UAAYA,CAOpB,IAAIyL,GAA8B,WAK9B,QAASA,GAAa/yE,EAAMuqE,GACxBv5E,KAAKikF,UAAYj1E,EACjBhP,KAAKkkF,WAAa3K,EA4FtB,MAhFAwI,GAAahnF,UAAU4rD,uBAAyB,SAAUy1B,EAAqB9C,EAAmBqJ,GAC9F,MAAO3iF,MAAKkkF,WAAWv9B,uBAAuB3mD,KAAKikF,UAAW7H,EAAqB9C,EAAmBqJ,IAS1GZ,EAAahnF,UAAU8rD,0BAA4B,SAAUs8B,GACzD,MAAOnjF,MAAKkkF,WAAWr9B,0BAA0B7mD,KAAKikF,UAAWd,IAqBrEpB,EAAahnF,UAAU2jF,mCAAqC,SAAU1vE,EAAMu0E,EAAmBC,GAC3F,MAAOxjF,MAAKkkF,WAAWxF,mCAAmC1+E,KAAKikF,UAAWj1E,EAAMu0E,EAAmBC,IAUvGzB,EAAahnF,UAAUojF,eAAiB,SAAUnvE,GAC9C,MAAOhP,MAAKkkF,WAAW/F,eAAen+E,KAAKikF,UAAUvoF,MAAMsT,KAa/D+yE,EAAahnF,UAAUimF,iBAAmB,SAAUF,EAAoBlnE,EAAW7B,EAAO/J,EAAS4K,GAC/F,MAAO5Y,MAAKkkF,WAAWlD,iBAAiBhhF,KAAKikF,UAAWnD,EAAoBlnE,EAAW7B,EAAO/J,EAAS4K,IAU3GmpE,EAAahnF,UAAU+jF,kBAAoB,SAAU15D,EAAU++D,GAC3D,MAAOnkF,MAAKkkF,WAAWpF,kBAAkB9+E,KAAKikF,UAAW7+D,EAAU++D,IAQvEpC,EAAahnF,UAAUW,MAAQ,SAAUqb,GACrC,MAAO,IAAIgrE,GAAa/hF,KAAKikF,UAAUvoF,MAAMqb,GAAY/W,KAAKkkF,aAE3DnC,IAEXpoF,GAAQooF,aAAeA,G7KknqBjB,SAAUnoF,EAAQD,EAASH,GAEjC,Y8K1trBAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAI06E,GAAkBt8E,EAAQ,IAC1BijB,EAASjjB,EAAQ,GACjBuO,EAASvO,EAAQ,GACjB0a,EAAS1a,EAAQ,GACjBqc,EAAkBrc,EAAQ,GAC1BwO,EAASxO,EAAQ,GAUjBooF,EAA+B,WAC/B,QAASA,GAAcsC,GACnBlkF,KAAKkkF,WAAaA,EAkLtB,MA3KAtC,GAAc7mF,UAAUinF,SAAW,SAAUhzE,EAAMzR,GAC/C,GAAIyR,EAAK4C,UACL,MAAO,IAAIgwE,GAAc,GAAI9L,GAAgBjiC,cAAct2C,GAG3D,IAAI6mF,GAAWpkF,KAAKkkF,WAAW/vC,yBAAyBnlC,EACxD,IAAgB,MAAZo1E,EAAkB,CAClB,GAAIC,GAAeD,EAASp1E,KACxB5T,EAAQgpF,EAAShpF,MACjByW,EAAe4K,EAAO/L,KAAKmB,aAAawyE,EAAcr1E,EAE1D,OADA5T,GAAQA,EAAMwc,YAAY/F,EAActU,GACjC,GAAIqkF,GAAc5hF,KAAKkkF,WAAW95E,IAAIi6E,EAAcjpF,IAG3D,GAAIg5C,GAAU,GAAI0hC,GAAgBjiC,cAAct2C,EAEhD,OAAO,IAAIqkF,GADQ5hF,KAAKkkF,WAAW1vC,QAAQxlC,EAAMolC,KAU7DwtC,EAAc7mF,UAAUknF,UAAY,SAAUjzE,EAAMssB,GAChD,GAAIgpD,GAAWtkF,IAIf,OAHA+H,GAAOqF,QAAQkuB,EAAS,SAAUlW,EAAU7nB,GACxC+mF,EAAWA,EAAStC,SAAShzE,EAAKtT,MAAM0pB,GAAW7nB,KAEhD+mF,GASX1C,EAAc7mF,UAAUk8E,YAAc,SAAUjoE,GAC5C,MAAIA,GAAK4C,UACEgwE,EAAczkD,MAId,GAAIykD,GADQ5hF,KAAKkkF,WAAW1vC,QAAQxlC,EAAM8mE,EAAgBjiC,cAAc1W,SAWvFykD,EAAc7mF,UAAU8nF,iBAAmB,SAAU7zE,GACjD,MAAqC,OAA9BhP,KAAKyiF,gBAAgBzzE,IAShC4yE,EAAc7mF,UAAU0nF,gBAAkB,SAAUzzE,GAChD,GAAIo1E,GAAWpkF,KAAKkkF,WAAW/vC,yBAAyBnlC,EACxD,OAAgB,OAAZo1E,EACOpkF,KAAKkkF,WACPxpF,IAAI0pF,EAASp1E,MACbgI,SAASyF,EAAO/L,KAAKmB,aAAauyE,EAASp1E,KAAMA,IAG/C,MAQf4yE,EAAc7mF,UAAUuoF,oBAAsB,WAC1C,GAAI1nF,MACA2B,EAAOyC,KAAKkkF,WAAW9oF,KAgB3B,OAfY,OAARmC,EAEKA,EAAKoZ,cACNpZ,EAAK6a,aAAavC,EAAgBJ,eAAgB,SAAUsB,EAAWsB,GACnEzc,EAASK,KAAK,GAAIiY,GAAOe,UAAU8B,EAAWsB,MAKtDrY,KAAKkkF,WAAWtoF,SAAS4d,iBAAiB,SAAUzC,EAAWs9B,GACpC,MAAnBA,EAAUj5C,OACVQ,EAASK,KAAK,GAAIiY,GAAOe,UAAU8B,EAAWs9B,EAAUj5C,UAI7DQ,GAMXgmF,EAAc7mF,UAAU6nF,mBAAqB,SAAU5zE,GACnD,GAAIA,EAAK4C,UACL,MAAO5R,KAGP,IAAIijF,GAAgBjjF,KAAKyiF,gBAAgBzzE,EACzC,OACW,IAAI4yE,GADM,MAAjBqB,EACyB,GAAInN,GAAgBjiC,cAAcovC,GAGlCjjF,KAAKkkF,WAAW9vC,QAAQplC,KAQ7D4yE,EAAc7mF,UAAU6W,QAAU,WAC9B,MAAO5R,MAAKkkF,WAAWtyE,WAQ3BgwE,EAAc7mF,UAAU0O,MAAQ,SAAUlM,GACtC,MAAOqkF,GAAc2C,mBAAmB9nE,EAAO/L,KAAKysB,MAAOn9B,KAAKkkF,WAAY3mF,IAKhFqkF,EAAczkD,MAAQ,GAAIykD,GAAc,GAAI9L,GAAgBjiC,cAAc,OAQ1E+tC,EAAc2C,mBAAqB,SAAU1yE,EAAc0nE,EAAWh8E,GAClE,GAAuB,MAAnBg8E,EAAUn+E,MAEV,MAAOmC,GAAKqa,YAAY/F,EAAc0nE,EAAUn+E,MAGhD,IAAIopF,GAAkB,IAgBtB,OAfAjL,GAAU39E,SAAS4d,iBAAiB,SAAU4L,EAAUivB,GACnC,cAAbjvB,GAGApd,EAAOgC,OAA2B,OAApBqqC,EAAUj5C,MAAgB,6CACxCopF,EAAkBnwC,EAAUj5C,OAG5BmC,EAAOqkF,EAAc2C,mBAAmB1yE,EAAanW,MAAM0pB,GAAWivB,EAAW92C,KAIpFA,EAAKyZ,SAASnF,GAAcD,WAAiC,OAApB4yE,IAC1CjnF,EAAOA,EAAKqa,YAAY/F,EAAanW,MAAM,aAAc8oF,IAEtDjnF,GAGRqkF,IAEXjoF,GAAQioF,cAAgBA,G9KuurBlB,SAAUhoF,EAAQD,EAASH,GAEjC,Y+K/6rBAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAI8tB,GAAiB1vB,EAAQ,GAMzBy/B,EAAgC,WAChC,QAASA,KACLj5B,KAAKykF,UAAYv7D,EAAejT,aAAaP,WAQjD,MANAujB,GAAel+B,UAAU0+B,QAAU,SAAUzqB,GACzC,MAAOhP,MAAKykF,UAAUztE,SAAShI,IAEnCiqB,EAAel+B,UAAUwgC,eAAiB,SAAUvsB,EAAM01E,GACtD1kF,KAAKykF,UAAYzkF,KAAKykF,UAAU7sE,YAAY5I,EAAM01E,IAE/CzrD,IAEXt/B,GAAQs/B,eAAiBA,G/Ku8rBnB,SAAUr/B,EAAQD,EAASH,GAEjC,YgL59rBAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAI2M,GAASvO,EAAQ,GAIjBu+B,EAAmC,WAInC,QAASA,GAAkB4sD,GACvB3kF,KAAK2kF,KAAOA,EAsDhB,MAhDA5sD,GAAkBh9B,UAAUk0D,SAAW,SAAUD,GAC7C,MAAOhvD,MAAK2kF,KAAL,kBAAkC31B,GAAcznD,KAAK,KAE5D,SAAUkD,GAGN,MAAIA,IAAwB,+BAAfA,EAAMoE,MACf9G,EAAOmC,IAAI,kEACJ,MAGA7C,QAAQ2kB,OAAOvhB,MAIlCstB,EAAkBh9B,UAAU29B,uBAAyB,SAAUtS,GAG3DpmB,KAAK2kF,KAAL,8BAA8Cv+D,IAElD2R,EAAkBh9B,UAAU6pF,0BAA4B,SAAUx+D,GAC9DpmB,KAAK2kF,KAAL,iCAAiDv+D,IAErD2R,EAAkBh9B,UAAU00D,sBAAwB,WAChD,GAAI+a,GAAe,0DACfxqE,KAAK2kF,KAAKxqF,KACV,gFAEA,eAAgB6F,MAAK2kF,KAAKroF,QAC1BkuE,GACI,uJAIC,kBAAoBxqE,MAAK2kF,KAAKroF,QACnCkuE,GACI,2JAKJA,GACI,kKAIRziE,EAAO6C,KAAK4/D,IAETzyC,IAEXp+B,GAAQo+B,kBAAoBA,GhLq+rBtB,SAAUn+B,EAAQD,EAASH,GAEjC,YiLzisBAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAI2M,GAASvO,EAAQ,GACjBwO,EAASxO,EAAQ,GAMjB68C,EAAiC,WACjC,QAASA,KACLr2C,KAAK6kF,aAWT,MATAxuC,GAAgBt7C,UAAU+jC,iBAAmB,SAAU3kC,EAAM2qF,OAC1C,KAAXA,IAAqBA,EAAS,GAC7B98E,EAAOyK,SAASzS,KAAK6kF,UAAW1qF,KACjC6F,KAAK6kF,UAAU1qF,GAAQ,GAC3B6F,KAAK6kF,UAAU1qF,IAAS2qF,GAE5BzuC,EAAgBt7C,UAAUL,IAAM,WAC5B,MAAOqN,GAAO4lE,SAAS3tE,KAAK6kF,YAEzBxuC,IAEX18C,GAAQ08C,gBAAkBA,GjLkksBpB,SAAUz8C,EAAQD,EAASH,GAEjC,YkL3lsBAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAI2M,GAASvO,EAAQ,GACjBwO,EAASxO,EAAQ,GACjBm9B,EAAkBn9B,EAAQ,KAI1BurF,EAAuB,IACvBC,EAAuB,IAMvBlsD,EAA+B,WAK/B,QAASA,GAAcmsD,EAAY9sD,GAC/Bn4B,KAAKm4B,QAAUA,EACfn4B,KAAKklF,kBACLllF,KAAKs3B,eAAiB,GAAIX,GAAgB2H,cAAc2mD,EACxD,IAAIp1E,GAAUk1E,GACTC,EAAuBD,GAAwB/4E,KAAK8e,QACzD9iB,GAAO2H,sBAAsB3P,KAAKmlF,aAAa39E,KAAKxH,MAAOgM,KAAKC,MAAM4D,IAsB1E,MApBAipB,GAAc/9B,UAAUgkC,YAAc,SAAUJ,GAC5C3+B,KAAKklF,eAAevmD,IAAQ,GAEhC7F,EAAc/9B,UAAUoqF,aAAe,WACnC,GAAI/tD,GAAQp3B,KACRo+B,EAAQp+B,KAAKs3B,eAAe58B,MAC5B0qF,KACAC,GAAoB,CACxBt9E,GAAOqF,QAAQgxB,EAAO,SAAUO,EAAMvjC,GAC9BA,EAAQ,GAAK2M,EAAO0K,SAAS2kB,EAAM8tD,eAAgBvmD,KACnDymD,EAAczmD,GAAQvjC,EACtBiqF,GAAoB,KAGxBA,GACArlF,KAAKm4B,QAAQg1B,YAAYi4B,GAG7Bp9E,EAAO2H,sBAAsB3P,KAAKmlF,aAAa39E,KAAKxH,MAAOgM,KAAKC,MAAsB,EAAhBD,KAAK8e,SAnCvD,OAqCjBgO,IAEXn/B,GAAQm/B,cAAgBA,GlLknsBlB,SAAUl/B,EAAQD,EAASH,GAEjC,YmLrqsBAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAI2M,GAASvO,EAAQ,GAejBg+B,EAA4B,WAC5B,QAASA,KAKLx3B,KAAKslF,eAMLtlF,KAAKulF,gBAAkB,EA+E3B,MA1EA/tD,GAAWz8B,UAAUkhC,YAAc,SAAUupD,GAGzC,IAAK,GADDC,GAAW,KACN5rF,EAAI,EAAGA,EAAI2rF,EAAczpF,OAAQlC,IAAK,CAC3C,GAAIw2D,GAAYm1B,EAAc3rF,GAC1B6rF,EAAYr1B,EAAUulB,SACT,QAAb6P,GAAsBC,EAAUnzE,OAAOkzE,EAAS7P,aAChD51E,KAAKslF,YAAYrpF,KAAKwpF,GACtBA,EAAW,MAEE,OAAbA,IACAA,EAAW,GAAIE,GAAUD,IAE7BD,EAASpgC,IAAIgL,GAEbo1B,GACAzlF,KAAKslF,YAAYrpF,KAAKwpF,IAY9BjuD,EAAWz8B,UAAUgjC,kBAAoB,SAAU/uB,EAAMw2E,GACrDxlF,KAAKi8B,YAAYupD,GACjBxlF,KAAK4lF,oCAAoC,SAAUF,GAC/C,MAAOA,GAAUnzE,OAAOvD,MAYhCwoB,EAAWz8B,UAAUk/B,0BAA4B,SAAU8C,EAAayoD,GACpExlF,KAAKi8B,YAAYupD,GACjBxlF,KAAK4lF,oCAAoC,SAAUF,GAC/C,MAAOA,GAAUjzE,SAASsqB,IAAgBA,EAAYtqB,SAASizE,MAOvEluD,EAAWz8B,UAAU6qF,oCAAsC,SAAUz/C,GACjEnmC,KAAKulF,iBAEL,KAAK,GADDM,IAAU,EACLhsF,EAAI,EAAGA,EAAImG,KAAKslF,YAAYvpF,OAAQlC,IAAK,CAC9C,GAAIisF,GAAY9lF,KAAKslF,YAAYzrF,EACjC,IAAIisF,EAAW,CAEP3/C,EADY2/C,EAAUlQ,YAEtB51E,KAAKslF,YAAYzrF,GAAGksF,QACpB/lF,KAAKslF,YAAYzrF,GAAK,MAGtBgsF,GAAU,GAIlBA,IACA7lF,KAAKslF,gBAETtlF,KAAKulF,mBAEF/tD,IAEX79B,GAAQ69B,WAAaA,CAKrB,IAAImuD,GAA2B,WAC3B,QAASA,GAAUnoE,GACfxd,KAAKwd,MAAQA,EAKbxd,KAAKgmF,WA8BT,MAzBAL,GAAU5qF,UAAUsqD,IAAM,SAAUgL,GAChCrwD,KAAKgmF,QAAQ/pF,KAAKo0D,IAKtBs1B,EAAU5qF,UAAUgrF,MAAQ,WACxB,IAAK,GAAIlsF,GAAI,EAAGA,EAAImG,KAAKgmF,QAAQjqF,OAAQlC,IAAK,CAC1C,GAAIw2D,GAAYrwD,KAAKgmF,QAAQnsF,EAC7B,IAAkB,OAAdw2D,EAAoB,CACpBrwD,KAAKgmF,QAAQnsF,GAAK,IAClB,IAAIosF,GAAU51B,EAAUwkB,gBACpB9sE,GAAO4B,QACP5B,EAAOmC,IAAI,UAAYmmD,EAAU/hD,YAErCvG,EAAOsH,eAAe42E,MAOlCN,EAAU5qF,UAAU66E,QAAU,WAC1B,MAAO51E,MAAKwd,OAETmoE,IAEXhsF,GAAQgsF,UAAYA,GnL4rsBd,SAAU/rF,EAAQD,EAASH,GAEjC,YoLv1sBA,IAAIma,GAAyC,WACzC,GAAIC,GAAgBtZ,OAAOuZ,iBACpBC,uBAA2BvK,QAAS,SAAUrP,EAAGoS,GAAKpS,EAAE4Z,UAAYxH,IACvE,SAAUpS,EAAGoS,GAAK,IAAK,GAAIrR,KAAKqR,GAAOA,EAAEtR,eAAeC,KAAIf,EAAEe,GAAKqR,EAAErR,IACzE,OAAO,UAAUf,EAAGoS,GAEhB,QAASyH,KAAO/T,KAAK6D,YAAc3J,EADnC0Z,EAAc1Z,EAAGoS,GAEjBpS,EAAEa,UAAkB,OAANuR,EAAahS,OAAO0Z,OAAO1H,IAAMyH,EAAGhZ,UAAYuR,EAAEvR,UAAW,GAAIgZ,OAGvFzZ,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAI8qF,GAAiB1sF,EAAQ,KACzBuO,EAASvO,EAAQ,GAIjBsxD,EAAmC,SAAUz2C,GAE7C,QAASy2C,KACL,GACIvd,GACA44C,EAFA/uD,EAAQ/iB,EAAOta,KAAKiG,MAAO,aAAeA,IAqC9C,OAlCwB,mBAAb9B,eAC8B,KAA9BA,SAASkB,uBACkB,KAAvBlB,SAAA,QAEPioF,EAAmB,mBACnB54C,EAAS,cAE6B,KAA1BrvC,SAAA,WACZioF,EAAmB,sBACnB54C,EAAS,iBAE4B,KAAzBrvC,SAAA,UACZioF,EAAmB,qBACnB54C,EAAS,gBAEgC,KAA7BrvC,SAAA,eACZioF,EAAmB,yBACnB54C,EAAS,iBAOjBnW,EAAM+yB,UAAW,EACbg8B,GACAjoF,SAASkB,iBAAiB+mF,EAAkB,WACxC,GAAIp4B,IAAW7vD,SAASqvC,EACpBwgB,KAAY32B,EAAM+yB,WAClB/yB,EAAM+yB,SAAW4D,EACjB32B,EAAM+4B,QAAQ,UAAWpC,MAE9B,GAEA32B,EAaX,MApDAzjB,GAAUm3C,EAAmBz2C,GAyC7By2C,EAAkBjU,YAAc,WAC5B,MAAO,IAAIiU,IAMfA,EAAkB/vD,UAAUu1D,gBAAkB,SAAUpyC,GAEpD,MADAnW,GAAOiC,OAAqB,YAAdkU,EAAyB,uBAAyBA,IACxDle,KAAKmqD,WAEVW,GACTo7B,EAAel2B,aACjBr2D,GAAQmxD,kBAAoBA,GpLi3sBtB,SAAUlxD,EAAQD,EAASH,GAEjC,YqL17sBA,IAAIma,GAAyC,WACzC,GAAIC,GAAgBtZ,OAAOuZ,iBACpBC,uBAA2BvK,QAAS,SAAUrP,EAAGoS,GAAKpS,EAAE4Z,UAAYxH,IACvE,SAAUpS,EAAGoS,GAAK,IAAK,GAAIrR,KAAKqR,GAAOA,EAAEtR,eAAeC,KAAIf,EAAEe,GAAKqR,EAAErR,IACzE,OAAO,UAAUf,EAAGoS,GAEhB,QAASyH,KAAO/T,KAAK6D,YAAc3J,EADnC0Z,EAAc1Z,EAAGoS,GAEjBpS,EAAEa,UAAkB,OAANuR,EAAahS,OAAO0Z,OAAO1H,IAAMyH,EAAGhZ,UAAYuR,EAAEvR,UAAW,GAAIgZ,OAGvFzZ,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAI2M,GAASvO,EAAQ,GACjB0sF,EAAiB1sF,EAAQ,KACzBwO,EAASxO,EAAQ,GAUjBwxD,EAA+B,SAAU32C,GAEzC,QAAS22C,KACL,GAAI5zB,GAAQ/iB,EAAOta,KAAKiG,MAAO,YAAcA,IAsB7C,OArBAo3B,GAAMgvD,SAAU,EAKM,mBAAXt7E,aAC4B,KAA5BA,OAAO1L,kBACb4I,EAAO4nD,oBACR9kD,OAAO1L,iBAAiB,SAAU,WACzBg4B,EAAMgvD,UACPhvD,EAAMgvD,SAAU,EAChBhvD,EAAM+4B,QAAQ,UAAU,MAE7B,GACHrlD,OAAO1L,iBAAiB,UAAW,WAC3Bg4B,EAAMgvD,UACNhvD,EAAMgvD,SAAU,EAChBhvD,EAAM+4B,QAAQ,UAAU,MAE7B,IAEA/4B,EAmBX,MA3CAzjB,GAAUq3C,EAAe32C,GA0BzB22C,EAAcnU,YAAc,WACxB,MAAO,IAAImU,IAMfA,EAAcjwD,UAAUu1D,gBAAkB,SAAUpyC,GAEhD,MADAnW,GAAOiC,OAAqB,WAAdkU,EAAwB,uBAAyBA,IACvDle,KAAKomF,UAKjBp7B,EAAcjwD,UAAU+0D,gBAAkB,WACtC,MAAO9vD,MAAKomF,SAETp7B,GACTk7B,EAAel2B,aACjBr2D,GAAQqxD,cAAgBA,GrLs9sBlB,SAAUpxD,EAAQD,EAASH,GAEjC,YsL7htBAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAIirF,GAA0B7sF,EAAQ,KAClC8sF,EAAwB9sF,EAAQ,KAChCuO,EAASvO,EAAQ,GASjBu3D,EAAkC,WAIlC,QAASA,GAAiBtyC,GACtBze,KAAKumF,gBAAgB9nE,GA6DzB,MA3DAnkB,QAAOC,eAAew2D,EAAkB,kBAKpCr2D,IAAK,WACD,OAAQ2rF,EAAwBlxB,sBAAuBmxB,EAAsBnsB,sBAEjF1/D,YAAY,EACZD,cAAc,IAMlBu2D,EAAiBh2D,UAAUwrF,gBAAkB,SAAU9nE,GACnD,GAAI+nE,GAAwBF,EAAsBnsB,qBAAuBmsB,EAAsBnsB,oBAAtB,cACrEssB,EAAuBD,IAA0BF,EAAsBnsB,oBAAoBoB,kBAM/F,IALI98C,EAAS6+B,gBACJkpC,GACDz+E,EAAO6C,KAAK,mFAChB67E,GAAuB,GAEvBA,EACAzmF,KAAK0mF,aAAeJ,EAAsBnsB,yBAEzC,CACD,GAAIwsB,GAAgB3mF,KAAK0mF,cACzB3+E,GAAOoF,KAAK4jD,EAAiB61B,eAAgB,SAAU/sF,EAAGgtF,GAClDA,GAAaA,EAAA,eACbF,EAAa1qF,KAAK4qF,OASlC91B,EAAiBh2D,UAAUm2D,iBAAmB,WAC1C,GAAIlxD,KAAK0mF,YAAY3qF,OAAS,EAC1B,MAAOiE,MAAK0mF,YAAY,EAGxB,MAAM,IAAI/7E,OAAM,4BAOxBomD,EAAiBh2D,UAAUk5D,iBAAmB,WAC1C,MAAIj0D,MAAK0mF,YAAY3qF,OAAS,EACnBiE,KAAK0mF,YAAY,GAGjB,MAGR31B,IAEXp3D,GAAQo3D,iBAAmBA,GtLijtBrB,SAAUn3D,EAAQD,EAASH,GAEjC,YuLnotBAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAI2M,GAASvO,EAAQ,GAMjBi8D,EAAgC,WAIhC,QAASA,GAAehF,GACpBzwD,KAAKywD,WAAaA,EAClBzwD,KAAK8mF,oBACL9mF,KAAK+mF,mBAAqB,EAC1B/mF,KAAKgnF,oBAAsB,EAC3BhnF,KAAKinF,QAAU,KAiDnB,MA/CAxxB,GAAe16D,UAAUs7D,WAAa,SAAU6wB,EAAav/E,GACzD3H,KAAKgnF,mBAAqBE,EAC1BlnF,KAAKinF,QAAUt/E,EACX3H,KAAKgnF,mBAAqBhnF,KAAK+mF,qBAC/B/mF,KAAKinF,UACLjnF,KAAKinF,QAAU,OAUvBxxB,EAAe16D,UAAUw7D,eAAiB,SAAU4wB,EAAY97E,GAC5D,GAAI+rB,GAAQp3B,IACZA,MAAK8mF,iBAAiBK,GAAc97E,CAwBpC,KAvBA,GAsBI+7E,GAASpnF,KACNA,KAAK8mF,iBAAiB9mF,KAAK+mF,qBAAqB,CAEnD,GAAgB,UAzBN,WACV,GAAIM,GAAYD,EAAON,iBAAiBM,EAAOL,0BACxCK,GAAON,iBAAiBM,EAAOL,mBAQtC,KAAK,GAAIltF,GAAI,EAAGA,EAAIwtF,EAAUtrF,SAAUlC,GAP1B,SAAUA,GAChBwtF,EAAUxtF,IACVkO,EAAOsH,eAAe,WAClB+nB,EAAMq5B,WAAW42B,EAAUxtF,OAK3BA,EAEZ,IAAIutF,EAAOL,qBAAuBK,EAAOJ,mBAKrC,MAJII,GAAOH,UACPG,EAAOH,UACPG,EAAOH,QAAU,MAEd,OAEXG,GAAOL,wBAMH,QAGLtxB,IAEX97D,GAAQ87D,eAAiBA,GvL0ptBnB,SAAU77D,EAAQD,EAASH,GAEjC,YwL/ttBA,IAAIma,GAAyC,WACzC,GAAIC,GAAgBtZ,OAAOuZ,iBACpBC,uBAA2BvK,QAAS,SAAUrP,EAAGoS,GAAKpS,EAAE4Z,UAAYxH,IACvE,SAAUpS,EAAGoS,GAAK,IAAK,GAAIrR,KAAKqR,GAAOA,EAAEtR,eAAeC,KAAIf,EAAEe,GAAKqR,EAAErR,IACzE,OAAO,UAAUf,EAAGoS,GAEhB,QAASyH,KAAO/T,KAAK6D,YAAc3J,EADnC0Z,EAAc1Z,EAAGoS,GAEjBpS,EAAEa,UAAkB,OAANuR,EAAahS,OAAO0Z,OAAO1H,IAAMyH,EAAGhZ,UAAYuR,EAAEvR,UAAW,GAAIgZ,OAGvFzZ,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAI2M,GAASvO,EAAQ,GACjBwO,EAASxO,EAAQ,GACjByO,EAASzO,EAAQ,GACjB0O,EAAS1O,EAAQ,GACjB2O,EAAS3O,EAAQ,GACjB0vD,EAAkB1vD,EAAQ,KAM1B4+B,EAAoC,SAAU/jB,GAQ9C,QAAS+jB,GAAmBnB,EAAWoB,EAAegxB,GAClD,GAAIjyB,GAAQ/iB,EAAOta,KAAKiG,OAASA,IAajC,OAZAo3B,GAAMH,UAAYA,EAClBG,EAAMiB,cAAgBA,EACtBjB,EAAMiyB,mBAAqBA,EAE3BjyB,EAAMuE,KAAO3zB,EAAOsC,WAAW,WAO/B8sB,EAAMqyB,YACCryB,EA6HX,MAlJAzjB,GAAUykB,EAAoB/jB,GAuB9B+jB,EAAmBr9B,UAAUoyD,YAAc,SAAU/uB,GACjD,KAAM,IAAIzzB,OAAM,4BAQpBytB,EAAmBkvD,aAAe,SAAUx4E,EAAOuqB,GAC/C,WAAYl9B,KAARk9B,EACO,OAASA,GAGhBtxB,EAAOiC,OAAO8E,EAAMmxC,iBAAiBsL,YAAa,kDAC3Cz8C,EAAME,KAAKV,aAI1B8pB,EAAmBr9B,UAAU++B,OAAS,SAAUhrB,EAAOwqB,EAAeD,EAAKE,GACvE,GAAInC,GAAQp3B,KACRqR,EAAavC,EAAME,KAAKV,UAC5BtO,MAAK27B,KAAK,qBAAuBtqB,EAAa,IAAMvC,EAAMkzC,kBAE1D,IAAIulC,GAAWnvD,EAAmBkvD,aAAax4E,EAAOuqB,GAClDmuD,IACJxnF,MAAKypD,SAAS89B,GAAYC,CAC1B,IAAIC,GAAwB34E,EACvBmxC,iBACAynC,6BACL1nF,MAAK2nF,aAAat2E,EAAa,QAASo2E,EAAuB,SAAUh9E,EAAO8pB,GAC5E,GAAIlpB,GAAOkpB,CAQX,IAPc,MAAV9pB,IACAY,EAAO,KACPZ,EAAQ,MAEE,OAAVA,GACA2sB,EAAMiB,cAAchnB,EAAYhG,GAAmB,EAAOguB,GAE1DnxB,EAAOmX,QAAQ+X,EAAMqyB,SAAU89B,KAAcC,EAAY,CACzD,GAAII,EAKAA,GAJCn9E,EAGa,KAATA,EACM,oBAGA,cAAgBA,EANhB,KAQf8uB,EAAWquD,EAAU,UAKjCxvD,EAAmBr9B,UAAUm/B,SAAW,SAAUprB,EAAOuqB,GACrD,GAAIkuD,GAAWnvD,EAAmBkvD,aAAax4E,EAAOuqB,SAC/Cr5B,MAAKypD,SAAS89B,IAGzBnvD,EAAmBr9B,UAAU49B,iBAAmB,SAAUjX,KAY1D0W,EAAmBr9B,UAAU4sF,aAAe,SAAUt2E,EAAYw2E,EAAuBlgF,GACrF,GAAIyvB,GAAQp3B,SACkB,KAA1B6nF,IAAoCA,MACxCA,EAAA,OAAkC,SAClC7nF,KAAKqpD,mBACA4F,UAA2B,GAC3B1nD,KAAK,SAAUugF,GAChB,GAAIC,GAAYD,GAAiBA,EAAc54B,WAC3C64B,KACAF,EAAA,KAAgCE,EAEpC,IAAI9wC,IAAO7f,EAAMH,UAAUkD,OAAS,WAAa,WAC7C/C,EAAMH,UAAUvY,KAChBrN,EACA,IACAlJ,EAAOooE,YAAYsX,EACvBzwD,GAAMuE,KAAK,4BAA8Bsb,EACzC,IAAI+wC,GAAM,GAAIC,eACdD,GAAIp/C,mBAAqB,WACrB,GAAIjhC,GAA+B,IAAnBqgF,EAAIp8E,WAAkB,CAClCwrB,EAAMuE,KAAK,qBAAuBsb,EAAM,qBAAsB+wC,EAAIjuD,OAAQ,YAAaiuD,EAAIE,aAC3F,IAAIt7D,GAAM,IACV,IAAIo7D,EAAIjuD,QAAU,KAAOiuD,EAAIjuD,OAAS,IAAK,CACvC,IACInN,EAAM3kB,EAAOizC,SAAS8sC,EAAIE,cAE9B,MAAOnoF,GACHiI,EAAO4C,KAAK,qCACRqsC,EACA,KACA+wC,EAAIE,cAEZvgF,EAAS,KAAMilB,OAII,OAAfo7D,EAAIjuD,QAAiC,MAAfiuD,EAAIjuD,QAC1B/xB,EAAO4C,KAAK,sCACRqsC,EACA,YACA+wC,EAAIjuD,QAEZpyB,EAASqgF,EAAIjuD,OAEjBpyB,GAAW,OAGnBqgF,EAAIl2B,KAAK,MAAO7a,GAAuB,GACvC+wC,EAAI30B,UAGLj7B,GACT8wB,EAAgB6G,cAClBp2D,GAAQy+B,mBAAqBA,GxL4utBvB,SAAUx+B,EAAQD,EAASH,GAEjC,YyLz5tBAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAI2M,GAASvO,EAAQ,GACjBwO,EAASxO,EAAQ,GACjBsc,EAAatc,EAAQ,IACrBqc,EAAkBrc,EAAQ,GAC1BmlD,EAAenlD,EAAQ,IACvBolD,EAAcplD,EAAQ,IACtB6iE,EAAkB7iE,EAAQ,IAC1B2uF,EAAkB3uF,EAAQ,KAC1B4uF,EAAiB5uF,EAAQ,KACzByO,EAASzO,EAAQ,GAOjBy3C,EAA6B,WAC7B,QAASA,KACLjxC,KAAKqoF,WAAY,EACjBroF,KAAKsoF,WAAY,EACjBtoF,KAAKuoF,eAAgB,EACrBvoF,KAAKwoF,SAAU,EACfxoF,KAAKyoF,aAAc,EACnBzoF,KAAK0oF,OAAS,EACd1oF,KAAK2oF,UAAY,GACjB3oF,KAAK4oF,iBAAmB,KACxB5oF,KAAK6oF,gBAAkB,GACvB7oF,KAAK8oF,eAAiB,KACtB9oF,KAAK+oF,cAAgB,GACrB/oF,KAAKkzC,OAASr9B,EAAgBJ,eAmWlC,MA9VAw7B,GAAYl2C,UAAUokD,SAAW,WAC7B,MAAOn/C,MAAKsoF,WAKhBr3C,EAAYl2C,UAAUiuF,eAAiB,WACnC,MAAuB,KAAnBhpF,KAAK2oF,UAKE3oF,KAAKsoF,UAGJtoF,KAAK2oF,YAAc13C,EAAYg4C,yBAAyBC,gBAOxEj4C,EAAYl2C,UAAUqkD,mBAAqB,WAEvC,MADAr3C,GAAOiC,OAAOhK,KAAKsoF,UAAW,oCACvBtoF,KAAK4oF,kBAOhB33C,EAAYl2C,UAAU0kD,kBAAoB,WAEtC,MADA13C,GAAOiC,OAAOhK,KAAKsoF,UAAW,oCAC1BtoF,KAAKuoF,cACEvoF,KAAK6oF,gBAGL7gF,EAAOmE,UAMtB8kC,EAAYl2C,UAAUskD,OAAS,WAC3B,MAAOr/C,MAAKwoF,SAMhBv3C,EAAYl2C,UAAUukD,iBAAmB,WAErC,MADAv3C,GAAOiC,OAAOhK,KAAKwoF,QAAS,kCACrBxoF,KAAK8oF,gBAOhB73C,EAAYl2C,UAAU2kD,gBAAkB,WAEpC,MADA33C,GAAOiC,OAAOhK,KAAKwoF,QAAS,kCACxBxoF,KAAKyoF,YACEzoF,KAAK+oF,cAGL/gF,EAAOoE,UAMtB6kC,EAAYl2C,UAAU+kD,SAAW,WAC7B,MAAO9/C,MAAKqoF,WAKhBp3C,EAAYl2C,UAAUglD,iBAAmB,WACrC,MAAO//C,MAAKqoF,WAAgC,KAAnBroF,KAAK2oF,WAMlC13C,EAAYl2C,UAAUouF,SAAW,WAE7B,MADAphF,GAAOiC,OAAOhK,KAAKqoF,UAAW,oCACvBroF,KAAK0oF,QAKhBz3C,EAAYl2C,UAAUk7C,SAAW,WAC7B,MAAOj2C,MAAKkzC,QAMhBjC,EAAYl2C,UAAUquF,MAAQ,WAC1B,GAAIx0D,GAAO,GAAIqc,EAaf,OAZArc,GAAKyzD,UAAYroF,KAAKqoF,UACtBzzD,EAAK8zD,OAAS1oF,KAAK0oF,OACnB9zD,EAAK0zD,UAAYtoF,KAAKsoF,UACtB1zD,EAAKg0D,iBAAmB5oF,KAAK4oF,iBAC7Bh0D,EAAK2zD,cAAgBvoF,KAAKuoF,cAC1B3zD,EAAKi0D,gBAAkB7oF,KAAK6oF,gBAC5Bj0D,EAAK4zD,QAAUxoF,KAAKwoF,QACpB5zD,EAAKk0D,eAAiB9oF,KAAK8oF,eAC3Bl0D,EAAK6zD,YAAczoF,KAAKyoF,YACxB7zD,EAAKm0D,cAAgB/oF,KAAK+oF,cAC1Bn0D,EAAKse,OAASlzC,KAAKkzC,OACnBte,EAAK+zD,UAAY3oF,KAAK2oF,UACf/zD,GAMXqc,EAAYl2C,UAAUmmD,MAAQ,SAAUmoC,GACpC,GAAI/nC,GAAYthD,KAAKopF,OAIrB,OAHA9nC,GAAU+mC,WAAY,EACtB/mC,EAAUonC,OAASW,EACnB/nC,EAAUqnC,UAAY,GACfrnC,GAMXrQ,EAAYl2C,UAAUkmD,aAAe,SAAUooC,GAC3C,GAAI/nC,GAAYthD,KAAKopF,OAIrB,OAHA9nC,GAAU+mC,WAAY,EACtB/mC,EAAUonC,OAASW,EACnB/nC,EAAUqnC,UAAY13C,EAAYg4C,yBAAyBC,eACpD5nC,GAMXrQ,EAAYl2C,UAAUomD,YAAc,SAAUkoC,GAC1C,GAAI/nC,GAAYthD,KAAKopF,OAIrB,OAHA9nC,GAAU+mC,WAAY,EACtB/mC,EAAUonC,OAASW,EACnB/nC,EAAUqnC,UAAY13C,EAAYg4C,yBAAyBK,gBACpDhoC,GAOXrQ,EAAYl2C,UAAU4mD,QAAU,SAAUrsC,EAAYjZ,GAClD,GAAIilD,GAAYthD,KAAKopF,OAcrB,OAbA9nC,GAAUgnC,WAAY,MACDnsF,KAAfmZ,IACFA,EAAa,MAEjBgsC,EAAUsnC,iBAAmBtzE,EAClB,MAAPjZ,GACAilD,EAAUinC,eAAgB,EAC1BjnC,EAAUunC,gBAAkBxsF,IAG5BilD,EAAUinC,eAAgB,EAC1BjnC,EAAUunC,gBAAkB,IAEzBvnC,GAOXrQ,EAAYl2C,UAAU6mD,MAAQ,SAAUtsC,EAAYjZ,GAChD,GAAIilD,GAAYthD,KAAKopF,OAcrB,OAbA9nC,GAAUknC,SAAU,MACCrsF,KAAfmZ,IACFA,EAAa,MAEjBgsC,EAAUwnC,eAAiBxzE,MACfnZ,KAARE,GACAilD,EAAUmnC,aAAc,EACxBnnC,EAAUynC,cAAgB1sF,IAG1BilD,EAAUmnC,aAAc,EACxBnnC,EAAUynC,cAAgB,IAEvBznC,GAMXrQ,EAAYl2C,UAAUwmD,QAAU,SAAU3oC,GACtC,GAAI0oC,GAAYthD,KAAKopF,OAErB,OADA9nC,GAAUpO,OAASt6B,EACZ0oC,GAKXrQ,EAAYl2C,UAAUgnD,eAAiB,WACnC,GAAIwnC,GAA0Bt4C,EAAYg4C,yBACtCxsF,IAaJ,IAZIuD,KAAKsoF,YACL7rF,EAAI8sF,EAAwBC,mBAAqBxpF,KAAK4oF,iBAClD5oF,KAAKuoF,gBACL9rF,EAAI8sF,EAAwBE,kBAAoBzpF,KAAK6oF,kBAGzD7oF,KAAKwoF,UACL/rF,EAAI8sF,EAAwBG,iBAAmB1pF,KAAK8oF,eAChD9oF,KAAKyoF,cACLhsF,EAAI8sF,EAAwBI,gBAAkB3pF,KAAK+oF,gBAGvD/oF,KAAKqoF,UAAW,CAChB5rF,EAAI8sF,EAAwBK,OAAS5pF,KAAK0oF,MAC1C,IAAImB,GAAW7pF,KAAK2oF,SACH,MAAbkB,IAEIA,EADA7pF,KAAKgpF,iBACMO,EAAwBL,eAGxBK,EAAwBD,iBAG3C7sF,EAAI8sF,EAAwBO,WAAaD,EAM7C,MAHI7pF,MAAKkzC,SAAWr9B,EAAgBJ,iBAChChZ,EAAI8sF,EAAwBQ,OAAS/pF,KAAKkzC,OAAO5kC,YAE9C7R,GAKXw0C,EAAYl2C,UAAU0sD,aAAe,WACjC,QAASznD,KAAKsoF,WAAatoF,KAAKwoF,SAAWxoF,KAAKqoF,YAKpDp3C,EAAYl2C,UAAUwwD,UAAY,WAC9B,MAAOvrD,MAAKynD,gBAAkBznD,KAAKkzC,QAAUr9B,EAAgBJ,gBAKjEw7B,EAAYl2C,UAAUsgF,cAAgB,WAClC,MAAIr7E,MAAKynD,eACE,GAAI4U,GAAgB5mB,cAAcz1C,KAAKi2C,YAEzCj2C,KAAK8/C,WACH,GAAIqoC,GAAgB6B,cAAchqF,MAGlC,GAAIooF,GAAe9rB,aAAat8D,OAQ/CixC,EAAYl2C,UAAU2sF,4BAA8B,WAChD,GAAIuC,GAAiBh5C,EAAYi5C,sBAC7BC,IACJ,IAAInqF,KAAKurD,YACL,MAAO4+B,EAEX,IAAI5oC,EAmCJ,OAlCIvhD,MAAKkzC,SAAWr9B,EAAgBJ,eAChC8rC,EAAU0oC,EAAex0E,eAEpBzV,KAAKkzC,SAAWyL,EAAaiB,YAClC2B,EAAU0oC,EAAerqC,YAEpB5/C,KAAKkzC,SAAWp9B,EAAWsE,UAChCmnC,EAAU0oC,EAAe7vE,WAGzBrS,EAAOiC,OAAOhK,KAAKkzC,iBAAkB0L,GAAYe,UAAW,4BAC5D4B,EAAUvhD,KAAKkzC,OAAO5kC,YAE1B67E,EAAGF,EAAeG,UAAYniF,EAAOyB,UAAU63C,GAC3CvhD,KAAKsoF,YACL6B,EAAGF,EAAeI,UAAYpiF,EAAOyB,UAAU1J,KAAK4oF,kBAChD5oF,KAAKuoF,gBACL4B,EAAGF,EAAeI,WAAa,IAAMpiF,EAAOyB,UAAU1J,KAAK6oF,mBAG/D7oF,KAAKwoF,UACL2B,EAAGF,EAAeK,QAAUriF,EAAOyB,UAAU1J,KAAK8oF,gBAC9C9oF,KAAKyoF,cACL0B,EAAGF,EAAeK,SAAW,IAAMriF,EAAOyB,UAAU1J,KAAK+oF,iBAG7D/oF,KAAKqoF,YACDroF,KAAKgpF,iBACLmB,EAAGF,EAAeM,gBAAkBvqF,KAAK0oF,OAGzCyB,EAAGF,EAAeO,eAAiBxqF,KAAK0oF,QAGzCyB,GAQXl5C,EAAYg4C,0BACRO,kBAAmB,KACnBC,iBAAkB,KAClBC,gBAAiB,KACjBC,eAAgB,KAChBC,MAAO,IACPE,UAAW,KACXZ,eAAgB,IAChBI,gBAAiB,IACjBS,MAAO,KAQX94C,EAAYi5C,uBACRE,SAAU,UACV30E,eAAgB,YAChBmqC,YAAa,SACbxlC,UAAW,OACXiwE,SAAU,UACVC,OAAQ,QACRC,eAAgB,eAChBC,cAAe,eAOnBv5C,EAAYC,QAAU,GAAID,GACnBA,IAEXt3C,GAAQs3C,YAAcA,GzLq6tBhB,SAAUr3C,EAAQD,EAASH,GAEjC,Y0L1yuBAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAIgtF,GAAiB5uF,EAAQ,KACzB0vB,EAAiB1vB,EAAQ,GACzB0a,EAAS1a,EAAQ,GACjBuO,EAASvO,EAAQ,GACjBg8C,EAAWh8C,EAAQ,IAOnBwwF,EAA+B,WAI/B,QAASA,GAAczrC,GACnBv+C,KAAKyqF,cAAgB,GAAIrC,GAAe9rB,aAAa/d,GACrDv+C,KAAKkzC,OAASqL,EAAOtI,WACrBj2C,KAAK0oF,OAASnqC,EAAO4qC,WACrBnpF,KAAK0qF,UAAYnsC,EAAOyqC,iBA0N5B,MArNAgB,GAAcjvF,UAAU6c,YAAc,SAAUojB,EAAM3+B,EAAKk4C,EAAUtZ,EAAcoN,EAAQqN,GAIvF,MAHK11C,MAAKyqF,cAAc3tB,QAAQ,GAAI5oD,GAAOe,UAAU5Y,EAAKk4C,MACtDA,EAAWrrB,EAAejT,aAAaP,YAEvCslB,EAAKlkB,kBAAkBza,GAAKkW,OAAOgiC,GAE5BvZ,EAEFA,EAAKljB,cAAgB9X,KAAK0oF,OACxB1oF,KAAKyqF,cACPz0C,mBACAp+B,YAAYojB,EAAM3+B,EAAKk4C,EAAUtZ,EAAcoN,EAAQqN,GAGrD11C,KAAK2qF,sBAAsB3vD,EAAM3+B,EAAKk4C,EAAUlM,EAAQqN,IAMvEs0C,EAAcjvF,UAAU86C,eAAiB,SAAU/wB,EAASgxB,EAASJ,GACjE,GAAIyS,EACJ,IAAIrS,EAAQn/B,cAAgBm/B,EAAQlkC,UAEhCu2C,EAAWj/B,EAAejT,aAAaP,WAAWyE,UAAUna,KAAKkzC,YAGjE,IAAkB,EAAdlzC,KAAK0oF,OAAa5yC,EAAQh+B,eAC1Bg+B,EAAQv7B,UAAUva,KAAKkzC,QAAS,CAEhCiV,EAAWj/B,EAAejT,aAAaP,WAAWyE,UAAUna,KAAKkzC,OAEjE,IAAI9rC,OAAW,EAEXA,GADApH,KAAK0qF,SACM50C,EAAQ77B,uBAAuBja,KAAKyqF,cAAc5tB,aAAc78D,KAAKkzC,QAGrE4C,EAAQn8B,gBAAgB3Z,KAAKyqF,cAAc7tB,eAAgB58D,KAAKkzC,OAG/E,KADA,GAAIn7B,GAAQ,EACL3Q,EAASotB,WAAazc,EAAQ/X,KAAK0oF,QAAQ,CAC9C,GAAIjlF,GAAO2D,EAAS2S,UAChB6wE,MAAU,EASd,MAPIA,EADA5qF,KAAK0qF,SAED1qF,KAAKkzC,OAAO5+B,QAAQtU,KAAKyqF,cAAc7tB,eAAgBn5D,IAAS,EAIhEzD,KAAKkzC,OAAO5+B,QAAQ7Q,EAAMzD,KAAKyqF,cAAc5tB,eAAiB,GAQlE,KALA1U,GAAWA,EAAShxC,qBAAqB1T,EAAKtJ,KAAMsJ,EAAKlG,MACzDwa,SAQP,CAEDowC,EAAWrS,EAAQ37B,UAAUna,KAAKkzC,QAElCiV,EAAWA,EAASvxC,eAAesS,EAAejT,aAAaP,WAC/D,IAAIkE,OAAY,GACZM,MAAU,GACV5H,MAAM,GACNlL,MAAW,EACf,IAAIpH,KAAK0qF,SAAU,CACftjF,EAAW+gD,EAASnuC,mBAAmBha,KAAKkzC,QAC5Ct5B,EAAY5Z,KAAKyqF,cAAc5tB,aAC/B3iD,EAAUla,KAAKyqF,cAAc7tB,cAC7B,IAAIiuB,GAAiB7qF,KAAKkzC,OAAOlpB,YACjC1X,GAAM,SAAUvQ,EAAGuK,GAAK,MAAOu+E,GAAev+E,EAAGvK,QAGjDqF,GAAW+gD,EAASzuC,YAAY1Z,KAAKkzC,QACrCt5B,EAAY5Z,KAAKyqF,cAAc7tB,eAC/B1iD,EAAUla,KAAKyqF,cAAc5tB,aAC7BvqD,EAAMtS,KAAKkzC,OAAOlpB,YAItB,KAFA,GAAIjS,GAAQ,EACR+yE,GAAiB,EACd1jF,EAASotB,WAAW,CACvB,GAAI/wB,GAAO2D,EAAS2S,WACf+wE,GAAkBx4E,EAAIsH,EAAWnW,IAAS,IAE3CqnF,GAAiB,EAErB,IAAIF,GAAUE,GAAkB/yE,EAAQ/X,KAAK0oF,QAAUp2E,EAAI7O,EAAMyW,IAAY,CACzE0wE,GACA7yE,IAGAowC,EAAWA,EAAShxC,qBAAqB1T,EAAKtJ,KAAM+uB,EAAejT,aAAaP,aAKhG,MAAO1V,MAAKyqF,cACPz0C,mBACAH,eAAe/wB,EAASqjC,EAAUzS,IAK3Cs0C,EAAcjvF,UAAU6b,eAAiB,SAAUkO,EAAStN,GAExD,MAAOsN,IAKXklE,EAAcjvF,UAAUg7C,aAAe,WACnC,OAAO,GAKXi0C,EAAcjvF,UAAUi7C,iBAAmB,WACvC,MAAOh2C,MAAKyqF,cAAcz0C,oBAK9Bg0C,EAAcjvF,UAAUk7C,SAAW,WAC/B,MAAOj2C,MAAKkzC,QAWhB82C,EAAcjvF,UAAU4vF,sBAAwB,SAAU3vD,EAAM5V,EAAU4uB,EAAW3L,EAAQ0iD,GAEzF,GAAIz4E,EACJ,IAAItS,KAAK0qF,SAAU,CACf,GAAIM,GAAahrF,KAAKkzC,OAAOlpB,YAC7B1X,GAAM,SAAUvQ,EAAGuK,GAAK,MAAO0+E,GAAW1+E,EAAGvK,QAG7CuQ,GAAMtS,KAAKkzC,OAAOlpB,YAEtB,IAAIq2D,GAAgBrlD,CACpBjzB,GAAOiC,OAAOq2E,EAAcvoE,eAAiB9X,KAAK0oF,OAAQ,GAC1D,IAAIuC,GAAoB,GAAI/2E,GAAOe,UAAUmQ,EAAU4uB,GACnDk3C,EAAiBlrF,KAAK0qF,SACpBrK,EAAcjnE,cAAcpZ,KAAKkzC,QACjCmtC,EAAc/mE,aAAatZ,KAAKkzC,QAClC03C,EAAU5qF,KAAKyqF,cAAc3tB,QAAQmuB,EACzC,IAAI5K,EAAcnpE,SAASkO,GAAW,CAGlC,IAFA,GAAI+lE,GAAe9K,EAAcvpE,kBAAkBsO,GAC/C6vB,EAAY5M,EAAOs4C,mBAAmB3gF,KAAKkzC,OAAQg4C,EAAgBlrF,KAAK0qF,UACxD,MAAbz1C,IACFA,EAAU96C,MAAQirB,GAAYi7D,EAAcnpE,SAAS+9B,EAAU96C,QAIhE86C,EAAY5M,EAAOs4C,mBAAmB3gF,KAAKkzC,OAAQ+B,EAAWj1C,KAAK0qF,SAEvE,IAAIU,GAA2B,MAAbn2C,EAAoB,EAAI3iC,EAAI2iC,EAAWg2C,EAEzD,IADsBL,IAAY52C,EAAUpiC,WAAaw5E,GAAe,EAKpE,MAHyB,OAArBL,GACAA,EAAkBn1C,iBAAiBJ,EAAS5wB,OAAOY,mBAAmBJ,EAAU4uB,EAAWm3C,IAExF9K,EAAclpE,qBAAqBiO,EAAU4uB,EAG3B,OAArB+2C,GACAA,EAAkBn1C,iBAAiBJ,EAAS5wB,OAAOU,mBAAmBF,EAAU+lE,GAEpF,IAAIxP,GAAgB0E,EAAclpE,qBAAqBiO,EAAU8D,EAAejT,aAAaP,WAE7F,OADoC,OAAbu/B,GAAqBj1C,KAAKyqF,cAAc3tB,QAAQ7nB,IAE1C,MAArB81C,GACAA,EAAkBn1C,iBAAiBJ,EAAS5wB,OAAOO,iBAAiB8vB,EAAU96C,KAAM86C,EAAU13C,OAE3Fo+E,EAAcxkE,qBAAqB89B,EAAU96C,KAAM86C,EAAU13C,OAG7Do+E,EAId,MAAI3nC,GAAUpiC,UAERopB,EAEF4vD,GACDt4E,EAAI44E,EAAgBD,IAAsB,GACjB,MAArBF,IACAA,EAAkBn1C,iBAAiBJ,EAAS5wB,OAAOU,mBAAmB4lE,EAAe/wF,KAAM+wF,EAAe3tF,OAC1GwtF,EAAkBn1C,iBAAiBJ,EAAS5wB,OAAOO,iBAAiBC,EAAU4uB,KAE3EqsC,EACFlpE,qBAAqBiO,EAAU4uB,GAC/B78B,qBAAqB+zE,EAAe/wF,KAAM+uB,EAAejT,aAAaP,aAOxEslB,GAGRgvD,IAEXrwF,GAAQqwF,cAAgBA,G1L0yuBlB,SAAUpwF,EAAQD,EAASH,GAEjC,YAkBA,IAAIoF,GAA4B,kBAAXuI,SAAoD,gBAApBA,QAAOC,SAAwB,SAAU3K,GAAO,aAAcA,IAAS,SAAUA,GAAO,MAAOA,IAAyB,kBAAX0K,SAAyB1K,EAAIoH,cAAgBsD,QAAU1K,IAAQ0K,OAAOpM,UAAY,eAAkB0B,G2L9ivBtQnC,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAoBIiwF,GApBAtjF,EAASvO,EAAQ,GACjBwiD,EAAcxiD,EAAQ,IACtBi6E,EAAiBj6E,EAAQ,IACzBijB,EAASjjB,EAAQ,GACjB8xF,EAAS9xF,EAAQ,KACjBqc,EAAkBrc,EAAQ,GAC1BwO,EAASxO,EAAQ,GACjB28B,EAAiB38B,EAAQ,IACzBq3C,EAAer3C,EAAQ,IACvByO,EAASzO,EAAQ,GACjB48B,EAAiB58B,EAAQ,IACzB0vB,EAAiB1vB,EAAQ,GACzBm3C,EAASn3C,EAAQ,KASrB,SAAW6xF,GAIPA,EAAkBA,EAAA,IAA2B,GAAK,MAGlDA,EAAkBA,EAAA,KAA4B,GAAK,OAGnDA,EAAkBA,EAAA,UAAiC,GAAK,YAGxDA,EAAkBA,EAAA,iBAAwC,GAAK,mBAE/DA,EAAkBA,EAAA,YAAmC,GAAK,eAC3DA,EAAoB1xF,EAAQ0xF,oBAAsB1xF,EAAQ0xF,uBAQ7D16C,EAAO3Z,KAAKu0D,yBAA2B,GAKvC56C,EAAO3Z,KAAKj8B,UAAUg+B,mBAAqB,WAOvC/4B,KAAKwrF,sBAAwB,GAAIF,GAAOG,MAU5C96C,EAAO3Z,KAAKj8B,UAAUs3C,iBAAmB,SAAUrjC,EAAMgjC,EAAmBzY,EAAY0Y,GACpFjyC,KAAK27B,KAAK,kBAAoB3sB,EAE9B,IAAI4xC,GAAgB,aAChB8qC,EAAW,GAAI1vC,GAAYjL,UAAU/wC,KAAMgP,EAC/C08E,GAAS98D,GAAG,QAASgyB,EACrB,IAAI+qC,GAAY,WACZD,EAAS38D,IAAI,QAAS6xB,IAGtB7O,GACA/iC,KAAMA,EACNlG,OAAQkpC,EACRzY,WAAYA,EAEZQ,OAAQ,KAER6xD,MAAO5jF,EAAOO,gBAEd0pC,aAAcA,EAEd45C,WAAY,EAEZF,UAAWA,EAEXG,YAAa,KACbC,eAAgB,KAChBC,qBAAsB,KACtBC,yBAA0B,KAC1BC,8BAA+B,MAG/BC,EAAensF,KAAKosF,gBAAgBp9E,EACxC+iC,GAAYi6C,qBAAuBG,CACnC,IAAIzwD,GAASqW,EAAYjpC,OAAOqjF,EAAa9+E,MAC7C,QAAelR,KAAXu/B,GAKA,GAHAqW,EAAY45C,YACZ55C,EAAYk6C,yBAA2B,KACvCl6C,EAAYm6C,8BAAgC,KACxCn6C,EAAYxY,WAAY,CAExB,GAAItU,GAAW,GAAIwuD,GAAezgC,aAAajB,EAAYi6C,qBAAsB,GAAIhwC,GAAYjL,UAAU/wC,KAAM+xC,EAAY/iC,MAAO6G,EAAgBJ,eACpJs8B,GAAYxY,WAAW,MAAM,EAAOtU,QAGvC,CACD4rB,EAAavzB,qBAAqB,qCAAsCoe,EAAQqW,EAAY/iC,MAE5F+iC,EAAYhY,OAASsxD,EAAkBgB,GACvC,IAAIC,GAAYtsF,KAAKwrF,sBAAsBe,QAAQv9E,GAC/Cw9E,EAAYF,EAAU94D,cAC1Bg5D,GAAUvwF,KAAK81C,GACfu6C,EAAUG,SAASD,EAInB,IAAIE,OAAkB,EACtB,IAAsB,gBAAlB,KAAOhxD,EAAP,YAAA98B,EAAO88B,KACI,OAAXA,GACAzzB,EAAOwK,SAASipB,EAAQ,aACxBgxD,EAAkBzkF,EAAOoX,QAAQqc,EAAQ,aACzC3zB,EAAOiC,OAAO6mC,EAAa7zB,gBAAgB0vE,GAAkB,wHAG5D,CAGDA,GAFkB1sF,KAAK65B,gBAAgB8sB,uBAAuB33C,IAC1Dka,EAAejT,aAAaP,YACFlB,cAAcnH,MAEhDq/E,EAAoDA,CACpD,IAAI9wD,GAAe57B,KAAKs6B,uBACpBuB,EAAoBzF,EAAe5iB,aAAakoB,EAAQgxD,GACxD33E,EAAUohB,EAAe2F,6BAA6BD,EAAmBD,EAC7EmW,GAAYk6C,yBAA2BpwD,EACvCkW,EAAYm6C,8BAAgCn3E,EAC5Cg9B,EAAYg6C,eAAiB/rF,KAAKw7B,iBAClC,IAAIxB,GAASh6B,KAAK65B,gBAAgBmC,mBAAmBhtB,EAAM+F,EAASg9B,EAAYg6C,eAAgBh6C,EAAYE,aAC5GjyC,MAAKu3B,YAAY0C,0BAA0BjrB,EAAMgrB,GACjDh6B,KAAK2sF,2BASbh8C,EAAO3Z,KAAKj8B,UAAUqxF,gBAAkB,SAAUp9E,EAAM49E,GACpD,MAAQ5sF,MAAK65B,gBAAgB8sB,uBAAuB33C,EAAM49E,IACtD1jE,EAAejT,aAAaP,YAYpCi7B,EAAO3Z,KAAKj8B,UAAU4xF,uBAAyB,SAAUpvF,GACrD,GAAI65B,GAAQp3B,IAMZ,QALa,KAATzC,IAAmBA,EAAOyC,KAAKwrF,uBAE9BjuF,GACDyC,KAAK6sF,qCAAqCtvF,GAEtB,OAApBA,EAAKi2B,WAAqB,CAC1B,GAAIzF,GAAQ/tB,KAAK8sF,uBAAuBvvF,EACxCwK,GAAOiC,OAAO+jB,EAAMhyB,OAAS,EAAG,wCACnBgyB,GAAMguB,MAAM,SAAUhK,GAAe,MAAOA,GAAYhY,SAAWsxD,EAAkBgB,OAG9FrsF,KAAK+sF,sBAAsBxvF,EAAKyR,OAAQ+e,OAGvCxwB,GAAKk2C,eACVl2C,EAAK6a,aAAa,SAAUC,GACxB+e,EAAMu1D,uBAAuBt0E,MAWzCs4B,EAAO3Z,KAAKj8B,UAAUgyF,sBAAwB,SAAU/9E,EAAM+e,GAS1D,IAAK,GARDqJ,GAAQp3B,KAERgtF,EAAej/D,EAAMvd,IAAI,SAAUy8E,GACnC,MAAOA,GAAIlB,iBAEXmB,EAAcltF,KAAKosF,gBAAgBp9E,EAAMg+E,GACzCG,EAAaD,EACbE,EAAaF,EAAY30E,OACpB1e,EAAI,EAAGA,EAAIk0B,EAAMhyB,OAAQlC,IAAK,CACnC,GAAIozF,GAAMl/D,EAAMl0B,EAChBkO,GAAOiC,OAAOijF,EAAIlzD,SAAWsxD,EAAkBgB,IAAK,iEACpDY,EAAIlzD,OAASsxD,EAAkBgC,KAC/BJ,EAAIpB,YACJ,IAAIh6E,GAAe4K,EAAO/L,KAAKmB,aAAa7C,EAAMi+E,EAAIj+E,KAEtDm+E,GAAaA,EAAWv1E,YAAY/F,EAAkCo7E,EAAIhB,0BAE9E,GAAIqB,GAAaH,EAAW9/E,KAAI,GAC5BkgF,EAAav+E,CAEjBhP,MAAKm4B,QAAQ+D,IAAIqxD,EAAWj/E,WAAYg/E,EAAY,SAAUvzD,GAC1D3C,EAAMuE,KAAK,4BACP3sB,KAAMu+E,EAAWj/E,WACjByrB,OAAQA,GAEZ,IAAIC,KACJ,IAAe,OAAXD,EAAiB,CAIjB,IAAK,GADDsmB,MACKxmD,EAAI,EAAGA,EAAIk0B,EAAMhyB,OAAQlC,IAAK,CAGnC,GAFAk0B,EAAMl0B,GAAGkgC,OAASsxD,EAAkBmC,UACpCxzD,EAASA,EAAOxvB,OAAO4sB,EAAMyC,gBAAgByC,aAAavO,EAAMl0B,GAAGkyF,iBAC/Dh+D,EAAMl0B,GAAG0/B,WAAY,CAErB,GAAIh8B,GAAOwwB,EAAMl0B,GAAGqyF,8BAChB5oF,EAAM,GAAI04C,GAAYjL,UAAU3Z,EAAOrJ,EAAMl0B,GAAGmV,MAChDiW,EAAW,GAAIwuD,GAAezgC,aAAaz1C,EAAM+F,EAAKuS,EAAgBJ,eAC1E4qC,GAAUpkD,KAAK8xB,EAAMl0B,GAAG0/B,WAAW/xB,KAAK,KAAM,MAAM,EAAMyd,IAE9D8I,EAAMl0B,GAAG8xF,YAGbv0D,EAAMy1D,qCAAqCz1D,EAAMo0D,sBAAsBe,QAAQv9E,IAE/EooB,EAAMu1D,yBACNv1D,EAAMG,YAAY0C,0BAA0BjrB,EAAMgrB,EAElD,KAAK,GAAIngC,GAAI,EAAGA,EAAIwmD,EAAUtkD,OAAQlC,IAClCmO,EAAOqH,eAAegxC,EAAUxmD,QAGnC,CAED,GAAe,cAAXkgC,EACA,IAAK,GAAIlgC,GAAI,EAAGA,EAAIk0B,EAAMhyB,OAAQlC,IAC1Bk0B,EAAMl0B,GAAGkgC,SAAWsxD,EAAkBoC,iBACtC1/D,EAAMl0B,GAAGkgC,OAASsxD,EAAkBqC,YAEpC3/D,EAAMl0B,GAAGkgC,OAASsxD,EAAkBgB,QAG3C,CACDrkF,EAAO4C,KAAK,kBAAoB2iF,EAAWj/E,WAAa,YAAcyrB,EACtE,KAAK,GAAIlgC,GAAI,EAAGA,EAAIk0B,EAAMhyB,OAAQlC,IAC9Bk0B,EAAMl0B,GAAGkgC,OAASsxD,EAAkBqC,YACpC3/D,EAAMl0B,GAAGiyF,YAAc/xD,EAG/B3C,EAAM8D,mBAAmBlsB,KAE9Bo+E,IAcPz8C,EAAO3Z,KAAKj8B,UAAUmgC,mBAAqB,SAAU6B,GACjD,GAAI4wD,GAA0B3tF,KAAK4tF,4BAA4B7wD,GAC3D/tB,EAAO2+E,EAAwB3+E,OAC/B+e,EAAQ/tB,KAAK8sF,uBAAuBa,EAExC,OADA3tF,MAAK6tF,uBAAuB9/D,EAAO/e,GAC5BA,GASX2hC,EAAO3Z,KAAKj8B,UAAU8yF,uBAAyB,SAAU9/D,EAAO/e,GAC5D,GAAqB,IAAjB+e,EAAMhyB,OAAV,CAcA,IAAK,GATDskD,MACArmB,KAEA8zD,EAAc//D,EAAMzd,OAAO,SAAU++C,GACrC,MAAOA,GAAEt1B,SAAWsxD,EAAkBgB,MAEtCW,EAAec,EAAYt9E,IAAI,SAAU6+C,GACzC,MAAOA,GAAE08B,iBAEJlyF,EAAI,EAAGA,EAAIk0B,EAAMhyB,OAAQlC,IAAK,CACnC,GAAIk4C,GAAchkB,EAAMl0B,GACpBgY,EAAe4K,EAAO/L,KAAKmB,aAAa7C,EAAM+iC,EAAY/iC,MAC1D++E,GAAmB,EAAOjC,MAAc,EAE5C,IADA/jF,EAAOiC,OAAwB,OAAjB6H,EAAuB,iEACjCkgC,EAAYhY,SAAWsxD,EAAkBqC,YACzCK,GAAmB,EACnBjC,EAAc/5C,EAAY+5C,YAC1B9xD,EAASA,EAAOxvB,OAAOxK,KAAK65B,gBAAgByC,aAAayV,EAAYg6C,gBAAgB,QAEpF,IAAIh6C,EAAYhY,SAAWsxD,EAAkBgB,IAC9C,GAAIt6C,EAAY85C,YAAcl7C,EAAO3Z,KAAKu0D,yBACtCwC,GAAmB,EACnBjC,EAAc,WACd9xD,EAASA,EAAOxvB,OAAOxK,KAAK65B,gBAAgByC,aAAayV,EAAYg6C,gBAAgB,QAEpF,CAED,GAAIiC,GAAchuF,KAAKosF,gBAAgBr6C,EAAY/iC,KAAMg+E,EACzDj7C,GAAYi6C,qBAAuBgC,CACnC,IAAIvX,GAAU1oD,EAAMl0B,GAAGiP,OAAOklF,EAAY3gF,MAC1C,QAAgBlR,KAAZs6E,EAAuB,CACvB5lC,EAAavzB,qBAAqB,qCAAsCm5D,EAAS1kC,EAAY/iC,KAC7F,IAAIi/E,GAAc73D,EAAe5iB,aAAaijE,GAC1CyX,EAAyC,gBAAnB,KAAOzX,EAAP,YAAA73E,EAAO63E,KAClB,MAAXA,GACAxuE,EAAOwK,SAASgkE,EAAS,YACxByX,KAEDD,EAAcA,EAAYr3E,eAAeo3E,EAAYx5E,eAEzD,IAAI25E,GAAap8C,EAAYg6C,eACzBnwD,EAAe57B,KAAKs6B,uBACpB8zD,EAAkBj4D,EAAe2F,6BAA6BmyD,EAAaryD,EAC/EmW,GAAYk6C,yBAA2BgC,EACvCl8C,EAAYm6C,8BAAgCkC,EAC5Cr8C,EAAYg6C,eAAiB/rF,KAAKw7B,kBAElCwxD,EAAa1oF,OAAO0oF,EAAa/hF,QAAQkjF,GAAa,GACtDn0D,EAASA,EAAOxvB,OAAOxK,KAAK65B,gBAAgBmC,mBAAmB+V,EAAY/iC,KAAMo/E,EAAiBr8C,EAAYg6C,eAAgBh6C,EAAYE,eAC1IjY,EAASA,EAAOxvB,OAAOxK,KAAK65B,gBAAgByC,aAAa6xD,GAAY,QAGrEJ,IAAmB,EACnBjC,EAAc,SACd9xD,EAASA,EAAOxvB,OAAOxK,KAAK65B,gBAAgByC,aAAayV,EAAYg6C,gBAAgB,IAMjG,GAFA/rF,KAAKu3B,YAAY0C,0BAA0BjrB,EAAMgrB,GACjDA,KACI+zD,IAEAhgE,EAAMl0B,GAAGkgC,OAASsxD,EAAkBmC,UAGpC,SAAW7B,GACPlkF,WAAWkkF,EAAW3/E,KAAKC,MAAM,KAClC8hB,EAAMl0B,GAAG8xF,WACR59D,EAAMl0B,GAAG0/B,YACT,GAAoB,WAAhBuyD,EAA0B,CAC1B,GAAIxoF,GAAM,GAAI04C,GAAYjL,UAAU/wC,KAAM+tB,EAAMl0B,GAAGmV,MAE/Cq/E,EAAiCtgE,EAAMl0B,GAAGmyF,qBAC1C/mE,EAAW,GAAIwuD,GAAezgC,aAAaq7C,EAAW/qF,EAAKuS,EAAgBJ,eAC/E4qC,GAAUpkD,KAAK8xB,EAAMl0B,GAAG0/B,WAAW/xB,KAAK,KAAM,MAAM,EAAOyd,QAG3Do7B,GAAUpkD,KAAK8xB,EAAMl0B,GAAG0/B,WAAW/xB,KAAK,KAAM,GAAImD,OAAMmhF,IAAc,EAAO,OAM7F9rF,KAAK6sF,qCAAqC7sF,KAAKwrF,sBAE/C,KAAK,GAAI3xF,GAAI,EAAGA,EAAIwmD,EAAUtkD,OAAQlC,IAClCmO,EAAOqH,eAAegxC,EAAUxmD,GAGpCmG,MAAK2sF,2BAUTh8C,EAAO3Z,KAAKj8B,UAAU6yF,4BAA8B,SAAU5+E,GAI1D,IAHA,GAAIiI,GAEAq3E,EAAkBtuF,KAAKwrF,sBACU,QAA7Bv0E,EAAQjI,EAAKiC,aACc,OAA/Bq9E,EAAgB96D,YAChB86D,EAAkBA,EAAgB/B,QAAQt1E,GAC1CjI,EAAOA,EAAKmC,UAEhB,OAAOm9E,IASX39C,EAAO3Z,KAAKj8B,UAAU+xF,uBAAyB,SAAUwB,GAErD,GAAIC,KAMJ,OALAvuF,MAAKwuF,mCAAmCF,EAAiBC,GAEzDA,EAAiBxhF,KAAK,SAAUhL,EAAGuK,GAC/B,MAAOvK,GAAE6pF,MAAQt/E,EAAEs/E,QAEhB2C,GAOX59C,EAAO3Z,KAAKj8B,UAAUyzF,mCAAqC,SAAUjxF,EAAMwwB,GACvE,GAAIqJ,GAAQp3B,KACRwsF,EAAYjvF,EAAKi2B,UACrB,IAAkB,OAAdg5D,EACA,IAAK,GAAI3yF,GAAI,EAAGA,EAAI2yF,EAAUzwF,OAAQlC,IAClCk0B,EAAM9xB,KAAKuwF,EAAU3yF,GAG7B0D,GAAK6a,aAAa,SAAU1c,GACxB07B,EAAMo3D,mCAAmC9yF,EAAOqyB,MASxD4iB,EAAO3Z,KAAKj8B,UAAU8xF,qCAAuC,SAAUtvF,GACnE,GAAI65B,GAAQp3B,KACR+tB,EAAQxwB,EAAKi2B,UACjB,IAAIzF,EAAO,CAEP,IAAK,GADD0gE,GAAK,EACAx+E,EAAO,EAAGA,EAAO8d,EAAMhyB,OAAQkU,IAChC8d,EAAM9d,GAAM8pB,SAAWsxD,EAAkBmC,YACzCz/D,EAAM0gE,GAAM1gE,EAAM9d,GAClBw+E,IAGR1gE,GAAMhyB,OAAS0yF,EACflxF,EAAKkvF,SAAS1+D,EAAMhyB,OAAS,EAAIgyB,EAAQ,MAE7CxwB,EAAK6a,aAAa,SAAUC,GACxB+e,EAAMy1D,qCAAqCx0E,MAWnDs4B,EAAO3Z,KAAKj8B,UAAUyhC,mBAAqB,SAAUxtB,GACjD,GAAIooB,GAAQp3B,KACRi7B,EAAej7B,KAAK4tF,4BAA4B5+E,GAAMA,OACtDs/E,EAAkBtuF,KAAKwrF,sBAAsBe,QAAQv9E,EAQzD,OAPAs/E,GAAgBI,gBAAgB,SAAUnxF,GACtC65B,EAAMu3D,yBAAyBpxF,KAEnCyC,KAAK2uF,yBAAyBL,GAC9BA,EAAgBM,kBAAkB,SAAUrxF,GACxC65B,EAAMu3D,yBAAyBpxF,KAE5B09B,GAQX0V,EAAO3Z,KAAKj8B,UAAU4zF,yBAA2B,SAAUpxF,GACvD,GAAIwwB,GAAQxwB,EAAKi2B,UACjB,IAAc,OAAVzF,EAAgB,CAQhB,IAAK,GALDsyB,MAGArmB,KACA60D,GAAY,EACPh1F,EAAI,EAAGA,EAAIk0B,EAAMhyB,OAAQlC,IAC9B,GAAIk0B,EAAMl0B,GAAGkgC,SAAWsxD,EAAkBoC,sBAGrC,IAAI1/D,EAAMl0B,GAAGkgC,SAAWsxD,EAAkBgC,KAC3CtlF,EAAOiC,OAAO6kF,IAAah1F,EAAI,EAAG,mDAClCg1F,EAAWh1F,EAEXk0B,EAAMl0B,GAAGkgC,OAASsxD,EAAkBoC,iBACpC1/D,EAAMl0B,GAAGiyF,YAAc,UAOvB,IAJA/jF,EAAOiC,OAAO+jB,EAAMl0B,GAAGkgC,SAAWsxD,EAAkBgB,IAAK,0CAEzDt+D,EAAMl0B,GAAG8xF,YACT3xD,EAASA,EAAOxvB,OAAOxK,KAAK65B,gBAAgByC,aAAavO,EAAMl0B,GAAGkyF,gBAAgB,IAC9Eh+D,EAAMl0B,GAAG0/B,WAAY,CAErB8mB,EAAUpkD,KAAK8xB,EAAMl0B,GAAG0/B,WAAW/xB,KAAK,KAAM,GAAImD,OAAM,QAAQ,EADjD,QAKT,IAAdkkF,EAEAtxF,EAAKkvF,SAAS,MAId1+D,EAAMhyB,OAAS8yF,EAAW,EAG9B7uF,KAAKu3B,YAAY0C,0BAA0B18B,EAAKyR,OAAQgrB,EACxD,KAAK,GAAIngC,GAAI,EAAGA,EAAIwmD,EAAUtkD,OAAQlC,IAClCmO,EAAOqH,eAAegxC,EAAUxmD,O3LuivBtC,SAAUD,EAAQD,EAASH,GAEjC,Y4LxkwBAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAI2M,GAASvO,EAAQ,GACjBijB,EAASjjB,EAAQ,GACjBwO,EAASxO,EAAQ,GAIjBs1F,EAA0B,WAC1B,QAASA,KAGL9uF,KAAKpE,YACLoE,KAAK+uF,WAAa,EAClB/uF,KAAK5E,MAAQ,KAEjB,MAAO0zF,KAEXn1F,GAAQm1F,SAAWA,CAMnB,IAAIrD,GAAsB,WAOtB,QAASA,GAAKhe,EAAOuhB,EAAS7vD,OACZ,KAAVsuC,IAAoBA,EAAQ,QAChB,KAAZuhB,IAAsBA,EAAU,UACtB,KAAV7vD,IAAoBA,EAAQ,GAAI2vD,IACpC9uF,KAAKytE,MAAQA,EACbztE,KAAKgvF,QAAUA,EACfhvF,KAAKm/B,MAAQA,EA0KjB,MAlKAssD,GAAK1wF,UAAUwxF,QAAU,SAAU0C,GAI/B,IAFA,GACkBxrF,GADduL,EAAOigF,YAAmBxyE,GAAO/L,KAAOu+E,EAAU,GAAIxyE,GAAO/L,KAAKu+E,GAClEvzF,EAAQsE,KACwB,QAA5ByD,EAAOuL,EAAKiC,aAAsB,CAEtCvV,EAAQ,GAAI+vF,GAAKhoF,EAAM/H,EADPsM,EAAOqX,QAAQ3jB,EAAMyjC,MAAMvjC,SAAU6H,IAAS,GAAIqrF,IAElE9/E,EAAOA,EAAKmC,WAEhB,MAAOzV,IAOX+vF,EAAK1wF,UAAUy4B,SAAW,WACtB,MAAOxzB,MAAKm/B,MAAM/jC,OAOtBqwF,EAAK1wF,UAAU0xF,SAAW,SAAUrxF,GAChC2M,EAAOiC,WAAwB,KAAV5O,EAAuB,iCAC5C4E,KAAKm/B,MAAM/jC,MAAQA,EACnB4E,KAAKkvF,kBAKTzD,EAAK1wF,UAAU0qD,MAAQ,WACnBzlD,KAAKm/B,MAAM/jC,MAAQ,KACnB4E,KAAKm/B,MAAMvjC,YACXoE,KAAKm/B,MAAM4vD,WAAa,EACxB/uF,KAAKkvF,kBAKTzD,EAAK1wF,UAAU04C,YAAc,WACzB,MAAOzzC,MAAKm/B,MAAM4vD,WAAa,GAKnCtD,EAAK1wF,UAAU6W,QAAU,WACrB,MAA2B,QAApB5R,KAAKwzB,aAAwBxzB,KAAKyzC,eAO7Cg4C,EAAK1wF,UAAUqd,aAAe,SAAUmB,GACpC,GAAI6d,GAAQp3B,IACZgI,GAAOoF,QAAQpN,KAAKm/B,MAAMvjC,SAAU,SAAUF,EAAO24C,GACjD96B,EAAO,GAAIkyE,GAAK/vF,EAAO07B,EAAOid,OAYtCo3C,EAAK1wF,UAAU6zF,kBAAoB,SAAUr1E,EAAQ41E,EAAaC,GAC1DD,IAAgBC,GAChB71E,EAAOvZ,MACXA,KAAKoY,aAAa,SAAU1c,GACxBA,EAAMkzF,kBAAkBr1E,GAAyB,EAAM61E,KAEvDD,GAAeC,GACf71E,EAAOvZ,OAUfyrF,EAAK1wF,UAAU2zF,gBAAkB,SAAUn1E,EAAQ41E,GAE/C,IADA,GAAI5xF,GAAO4xF,EAAcnvF,KAAOA,KAAKW,SACrB,OAATpD,GAAe,CAClB,GAAIgc,EAAOhc,GACP,OAAO,CAEXA,GAAOA,EAAKoD,SAEhB,OAAO,GASX8qF,EAAK1wF,UAAUs0F,oCAAsC,SAAU91E,GAC3DvZ,KAAKoY,aAAa,SAAU1c,GACC,OAArBA,EAAM83B,WACNja,EAAO7d,GAEPA,EAAM2zF,oCAAoC91E,MAMtDkyE,EAAK1wF,UAAUiU,KAAO,WAClB,MAAO,IAAIyN,GAAO/L,KAAsB,OAAjB1Q,KAAKgvF,QACtBhvF,KAAKytE,MACLztE,KAAKgvF,QAAQhgF,OAAS,IAAMhP,KAAKytE,QAK3Cge,EAAK1wF,UAAUZ,KAAO,WAClB,MAAO6F,MAAKytE,OAKhBge,EAAK1wF,UAAU4F,OAAS,WACpB,MAAOX,MAAKgvF,SAOhBvD,EAAK1wF,UAAUm0F,eAAiB,WACP,OAAjBlvF,KAAKgvF,SACLhvF,KAAKgvF,QAAQM,aAAatvF,KAAKytE,MAAOztE,OAS9CyrF,EAAK1wF,UAAUu0F,aAAe,SAAUv4E,EAAWrb,GAC/C,GAAI6zF,GAAa7zF,EAAMkW,UACnB49E,EAAcxnF,EAAOyK,SAASzS,KAAKm/B,MAAMvjC,SAAUmb,EACnDw4E,IAAcC,SACPxvF,MAAKm/B,MAAMvjC,SAASmb,GAC3B/W,KAAKm/B,MAAM4vD,aACX/uF,KAAKkvF,kBAECK,GAAeC,IACrBxvF,KAAKm/B,MAAMvjC,SAASmb,GAAarb,EAAMyjC,MACvCn/B,KAAKm/B,MAAM4vD,aACX/uF,KAAKkvF,mBAGNzD,IAEX9xF,GAAQ8xF,KAAOA,G5L8lwBT,SAAU7xF,EAAQD,EAASH,GAEjC,Y6LhzwBAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAIkrF,GAAwB9sF,EAAQ,KAChC6sF,EAA0B7sF,EAAQ,IAQtCG,GAAQ81F,iBAAmB,WACvBnJ,EAAsBnsB,oBAAoBnD,gBAC1CqvB,EAAwBlxB,sBAAsB2B,cAElDn9D,EAAQ+1F,gBAAkB,WACtBrJ,EAAwBlxB,sBAAsB6B,iBAGlDr9D,EAAQ6sF,sBAAwB,WAC5B,MAAOF,GAAsBnsB,oBAAtB,eAEXxgE,EAAQg2F,yBAA2B,SAAUrsF,EAAKqE,GAC9CrE,EAAI0tC,KAAKnZ,sBAAsBmyB,uBAAyBriD,GAE5DhO,EAAQykC,MAAQ,SAAU96B,EAAK+6B,GAC3B/6B,EAAI0tC,KAAK5S,MAAMC,IAEnB1kC,EAAQilC,sBAAwB,SAAUt7B,EAAKu7B,GAC3Cv7B,EAAI0tC,KAAKpS,sBAAsBC,IAEnCllC,EAAQ09B,gBAAkB,SAAU/zB,GAChC,MAAOA,GAAI0tC,KAAK3Z,iBAEpB19B,EAAQi2F,oBAAsB,SAAUtsF,EAAKqE,GACzC,MAAOrE,GAAI0tC,KAAK7V,qBAAqBxzB,K7Ly0wBnC,SAAU/N,EAAQD,EAASH,GAEjC,Y8L72wBAc,QAAOC,eAAeZ,EAAS,cAAgByB,OAAO,GACtD,IAAI8hD,GAAa1jD,EAAQ,IACrBq9B,EAAyBr9B,EAAQ,KACjCyiD,EAAgBziD,EAAQ,IACxByvD,EAAezvD,EAAQ,IAC3BG,GAAQk2F,eAAiBh5D,EAAuB2B,qBAKhD3B,EAAuB2B,qBAAqBz9B,UAAU+0F,aAAe,SAAUz+E,EAAYkoB,GACvFv5B,KAAKkrD,YAAY,KAAOjwD,EAAGoW,GAAckoB,IAM7C1C,EAAuB2B,qBAAqBz9B,UAAUg1F,KAAO,SAAU1kF,EAAM2kF,GACzEhwF,KAAKkrD,YAAY,QAAUhxD,EAAGmR,GAAQ2kF,IAG1Cr2F,EAAQs2F,mBAAqBhnC,EAAakG,WAK1Cx1D,EAAQu2F,WAAa,SAAUC,GAC3B,GAAIC,GAASv5D,EAAuB2B,qBAAqBz9B,UAAUmhC,GAOnE,OANArF,GAAuB2B,qBAAqBz9B,UAAUmhC,IAAM,SAAU7qB,EAAYhG,EAAMglF,EAAgBC,OACnFn0F,KAAbm0F,IACAA,EAAWH,KAEfC,EAAOr2F,KAAKiG,KAAMqR,EAAYhG,EAAMglF,EAAgBC,IAEjD,WACHz5D,EAAuB2B,qBAAqBz9B,UAAUmhC,IAAMk0D,IAMpEz2F,EAAQ42F,iBAAmBrzC,EAAWM,SAKtC7jD,EAAQqoD,gBAAkB,SAAUlzC,GAChC,MAAOA,GAAMkzC,mBAMjBroD,EAAQ62F,QAAU,SAAUC,GACxB,MAAOA,GAAYz/C,KAAKnZ,sBAAsB4xB,UAOlD9vD,EAAQu9B,gBAAkB,SAAUA,GAChC+kB,EAAcvF,YAAYG,cAAc3f,gBAAgBA,K9Ls4wBtD,SAAUt9B,EAAQD,EAASH,GAEjC,Y+Lt8wBAA,GAAQ,M/L69wBF,SAAUI,EAAQD,EAASH,GAEjC,cAC4B,SAASkmC,GAErC,GAAI9gC,GAA4B,kBAAXuI,SAAoD,gBAApBA,QAAOC,SAAwB,SAAU3K,GAAO,aAAcA,IAAS,SAAUA,GAAO,MAAOA,IAAyB,kBAAX0K,SAAyB1K,EAAIoH,cAAgBsD,QAAU1K,IAAQ0K,OAAOpM,UAAY,eAAkB0B,KgMl/wBtQ,WAEyB,QAASzC,GAAE+H,GAAG,MAAM,gBAAiBA,GAAE,QAAS2uF,GAAG3uF,GAAG,MAAM,iBAAkBA,GAAE,QAAS4uF,MAClH,QAASC,GAAG7uF,GAAG,GAAIuK,OAAA,KAASvK,EAAT,YAAAnD,EAASmD,EAAE,IAAG,UAAUuK,EAAb,CAAe,IAAGvK,EAA4d,MAAM,MAA/d,IAAGA,YAAawH,OAAM,MAAM,OAAQ,IAAGxH,YAAazH,QAAO,MAAOgS,EAAE,IAAIrS,GAAEK,OAAOS,UAAUuT,SAASvU,KAAKgI,EAAG,IAAG,mBAAmB9H,EAAE,MAAM,QAAS,IAAG,kBAAkBA,GAAG,gBAAiB8H,GAAEhG,YAAQ,KAAoBgG,EAAEuC,YAAQ,KAAoBvC,EAAE8uF,uBAAuB9uF,EAAE8uF,qBAAqB,UAAU,MAAM,OAAQ,IAAG,qBAAqB52F,OAAG,KAAoB8H,EAAEhI,UAAM,KAAoBgI,EAAE8uF,uBAAuB9uF,EAAE8uF,qBAAqB,QAAQ,MAAM,eACvf,IAAG,YAAYvkF,OAAG,KAAoBvK,EAAEhI,KAAK,MAAM,QAAS,OAAOuS,GAAE,QAASwkF,GAAG/uF,GAAG,MAAO,QAAOA,EAAE,QAASgvF,GAAGhvF,GAAG,MAAM,SAAS6uF,EAAG7uF,GAAG,QAASivF,GAAGjvF,GAAG,GAAIuK,GAAEskF,EAAG7uF,EAAG,OAAM,SAASuK,GAAG,UAAUA,GAAG,gBAAiBvK,GAAEhG,OAAO,QAASd,GAAE8G,GAAG,MAAM,YAAY6uF,EAAG7uF,GAAG,QAASstD,GAAEttD,GAAG,GAAIuK,OAAA,KAASvK,EAAT,YAAAnD,EAASmD,EAAE,OAAM,UAAUuK,GAAG,MAAMvK,GAAG,YAAYuK,EAAqD,QAAS2kF,GAAGlvF,EAAEuK,EAAErS,GAAG,MAAO8H,GAAEhI,KAAK0P,MAAM1H,EAAEyF,KAAK1L,WAC/a,QAASo1F,GAAGnvF,EAAEuK,EAAErS,GAAG,IAAI8H,EAAE,KAAM4I,QAAQ,IAAG,EAAE7O,UAAUC,OAAO,CAAC,GAAI7B,GAAEqP,MAAMxO,UAAU6B,MAAM7C,KAAK+B,UAAU,EAAG,OAAO,YAAW,GAAI7B,GAAEsP,MAAMxO,UAAU6B,MAAM7C,KAAK+B,UAA8C,OAAnCyN,OAAMxO,UAAUwL,QAAQkD,MAAMxP,EAAEC,GAAU6H,EAAE0H,MAAM6C,EAAErS,IAAI,MAAO,YAAW,MAAO8H,GAAE0H,MAAM6C,EAAExQ,YAAY,QAASwvD,GAAEvpD,EAAEuK,EAAErS,GAAoG,MAAVqxD,GAAvFrlC,SAASlrB,UAAUyM,OAAO,GAAGye,SAASlrB,UAAUyM,KAAK8G,WAAWrD,QAAQ,eAAiBgmF,EAAKC,EAAU5lC,EAAE7hD,MAAM,KAAK3N,WACxZ,QAASq1F,GAAGpvF,EAAEuK,GAAG,GAAIrS,GAAEsP,MAAMxO,UAAU6B,MAAM7C,KAAK+B,UAAU,EAAG,OAAO,YAAW,GAAIwQ,GAAErS,EAAE2C,OAAkC,OAA1B0P,GAAErQ,KAAKwN,MAAM6C,EAAExQ,WAAkBiG,EAAE0H,MAAMzJ,KAAKsM,IAAiD,QAAShG,GAAEvE,EAAEuK,GAAG,QAASrS,MAAKA,EAAEc,UAAUuR,EAAEvR,UAAUgH,EAAEqvF,GAAG9kF,EAAEvR,UAAUgH,EAAEhH,UAAU,GAAId,GAAE8H,EAAEhH,UAAU8I,YAAY9B,EAAEA,EAAEsvF,GAAG,SAAStvF,EAAE9H,EAAEqI,GAAG,IAAI,GAAIpI,GAAEqP,MAAMzN,UAAUC,OAAO,GAAGgE,EAAE,EAAEA,EAAEjE,UAAUC,OAAOgE,IAAI7F,EAAE6F,EAAE,GAAGjE,UAAUiE,EAAG,OAAOuM,GAAEvR,UAAUd,GAAGwP,MAAM1H,EAAE7H,IAAK,QAASo3F,GAAEvvF,GAAG,GAAG4I,MAAMykE,kBAAkBzkE,MAAMykE,kBAAkBpvE,KAAKsxF,OAAO,CAAC,GAAIhlF,GAAE3B,QAAQ3O,KAAMsQ,KAAItM,KAAKhE,MAAMsQ,GAAGvK,IAAI/B,KAAKsJ,QAAQlN,OAAO2F,IAA8C,QAASwvF,GAAGxvF,EAAEuK,GAAG,IAAI,GAAIrS,GAAE8H,EAAE+O,MAAM,MAAM5W,EAAE,GAAG6F,EAAEwJ,MAAMxO,UAAU6B,MAAM7C,KAAK+B,UAAU,GAAGiE,EAAEhE,QAAQ,EAAE9B,EAAE8B,QAAQ7B,GAAGD,EAAE0sB,QAAQ5mB,EAAE4mB,OAAQ,OAAOzsB,GAAED,EAAEgU,KAAK,MAC7wB,QAASujF,GAAGzvF,GAAG,MAAI0vF,IAAG3yF,KAAKiD,KAAa,GAAGA,EAAEkJ,QAAQ,OAAOlJ,EAAEA,EAAE7C,QAAQwyF,GAAG,WAAW,GAAG3vF,EAAEkJ,QAAQ,OAAOlJ,EAAEA,EAAE7C,QAAQyyF,GAAG,UAAU,GAAG5vF,EAAEkJ,QAAQ,OAAOlJ,EAAEA,EAAE7C,QAAQ0yF,GAAG,UAAU,GAAG7vF,EAAEkJ,QAAQ,OAAOlJ,EAAEA,EAAE7C,QAAQ2yF,GAAG,YAAY,GAAG9vF,EAAEkJ,QAAQ,OAAOlJ,EAAEA,EAAE7C,QAAQ4yF,GAAG,WAAW,GAAG/vF,EAAEkJ,QAAQ,QAAUlJ,EAAEA,EAAE7C,QAAQ6yF,GAAG,SAAgBhwF,GAA9RA,EAAwW,QAASyL,GAAEzL,EAAEuK,GAAG,OAAO,GAAGvK,EAAEkJ,QAAQqB,GAAG,QAAS0lF,GAAGjwF,EAAEuK,GAAG,MAAOvK,GAAEuK,GAAG,EAAEvK,EAAEuK,EAAE,EAAE,EAAG,QAAS2lF,GAAGlwF,EAAEuK,GAAGA,EAAE/F,QAAQxE,GAAGuvF,EAAEv3F,KAAKiG,KAAKuxF,EAAG9nF,MAAM,KAAK6C,IAAIA,EAAEqa,QAAmD,QAASurE,GAAGnwF,EAAEuK,GAAG,KAAM,IAAI2lF,GAAG,WAAWlwF,EAAE,KAAKA,EAAE,IAAIwH,MAAMxO,UAAU6B,MAAM7C,KAAK+B,UAAU,IACxqB,QAASq2F,GAAGpwF,EAAEuK,GAAG,GAAIrS,GAAE8H,EAAEhG,OAAO7B,EAAEF,EAAE+H,GAAGA,EAAE+O,MAAM,IAAI/O,CAAE,OAAM9H,EAAE,GAAGA,IAAIA,EAAEA,IAAKC,IAAGoS,EAAEvS,SAAK,GAAOG,EAAED,GAAGA,EAAE8H,GACnG,QAASqwF,GAAGrwF,GAAGA,EAAE,CAAU,IAAI,GAATuK,GAAE+lF,GAAWp4F,EAAE8H,EAAEhG,OAAO7B,EAAEF,EAAE+H,GAAGA,EAAE+O,MAAM,IAAI/O,EAAEhC,EAAE,EAAEA,EAAE9F,EAAE8F,IAAI,GAAGA,IAAK7F,IAAGoS,EAAEvS,SAAK,GAAOG,EAAE6F,GAAGA,EAAEgC,GAAG,CAACuK,EAAEvM,CAAE,MAAMgC,GAAEuK,GAAG,EAAE,MAAO,GAAEA,EAAE,KAAKtS,EAAE+H,GAAGA,EAAE4iC,OAAOr4B,GAAGvK,EAAEuK,GAAG,QAASgmF,GAAGvwF,EAAEuK,GAAG,MAAO,IAAGimF,GAAGxwF,EAAEuK,GAAG,QAASkmF,GAAGzwF,EAAEuK,GAAGA,EAAEimF,GAAGxwF,EAAEuK,EAAG,IAAIrS,EAA+C,QAA5CA,EAAE,GAAGqS,IAAI/C,MAAMxO,UAAUuJ,OAAOvK,KAAKgI,EAAEuK,EAAE,GAAUrS,EAAE,QAASw4F,GAAG1wF,EAAEuK,GAAG,GAAIrS,GAAE,CAAEk4F,GAAGpwF,EAAE,SAAS7H,EAAE6F,GAAGuM,EAAEvS,SAAK,GAAOG,EAAE6F,EAAEgC,IAAI,GAAGwH,MAAMxO,UAAUuJ,OAAOvK,KAAKgI,EAAEhC,EAAE,GAAGhE,QAAQ9B,MAAM,QAASy4F,GAAG3wF,GAAG,MAAOwH,OAAMxO,UAAUyP,OAAOf,SAAS3N,WAChd,QAAS62F,GAAG5wF,GAAG,GAAIuK,GAAEvK,EAAEhG,MAAO,IAAG,EAAEuQ,EAAE,CAAC,IAAI,GAAIrS,GAAEsP,MAAM+C,GAAGpS,EAAE,EAAEA,EAAEoS,EAAEpS,IAAID,EAAEC,GAAG6H,EAAE7H,EAAG,OAAOD,GAAE,SAA8F,QAASgsC,GAAElkC,GAAG,MAAOyL,GAAEolF,GAAG7wF,GAAI,QAAS8wF,GAAG9wF,EAAEuK,GAAG,IAAI,GAAIrS,KAAK8H,GAAEuK,EAAEvS,SAAK,GAAOgI,EAAE9H,GAAGA,EAAE8H,GAAG,QAAS+wF,GAAG/wF,GAAG,GAAa7H,GAAToS,KAAKrS,EAAE,CAAI,KAAIC,IAAK6H,GAAEuK,EAAErS,KAAK8H,EAAE7H,EAAG,OAAOoS,GAAE,QAASymF,GAAGhxF,GAAG,GAAa7H,GAAToS,KAAKrS,EAAE,CAAI,KAAIC,IAAK6H,GAAEuK,EAAErS,KAAKC,CAAE,OAAOoS,GAAE,QAAS0mF,GAAGjxF,GAAG,IAAI,GAAIuK,KAAKvK,GAAE,OAAM,CAAG,QAAM,EAAG,QAASkxF,GAAGlxF,EAAEuK,GAAG,IAAI,GAAIrS,KAAK8H,GAAE,KAAK9H,IAAKqS,KAAIvK,EAAE9H,KAAKqS,EAAErS,GAAG,OAAM,CAAG,KAAIA,IAAKqS,GAAE,KAAKrS,IAAK8H,IAAG,OAAM,CAAG,QAAM,EAAG,QAASmxF,GAAGnxF,GAAG,GAAS9H,GAALqS,IAAO,KAAIrS,IAAK8H,GAAEuK,EAAErS,GAAG8H,EAAE9H,EAAG,OAAOqS,GACxlB,QAAS6mF,GAAGpxF,EAAEuK,GAAG,IAAI,GAAIrS,GAAEC,EAAE6F,EAAE,EAAEA,EAAEjE,UAAUC,OAAOgE,IAAI,CAAC7F,EAAE4B,UAAUiE,EAAG,KAAI9F,IAAKC,GAAE6H,EAAE9H,GAAGC,EAAED,EAAG,KAAI,GAAIqI,GAAE,EAAEA,EAAE8wF,GAAGr3F,OAAOuG,IAAIrI,EAAEm5F,GAAG9wF,GAAGhI,OAAOS,UAAUC,eAAejB,KAAKG,EAAED,KAAK8H,EAAE9H,GAAGC,EAAED,KAAM,QAASo5F,GAAGtxF,GAAc,MAAXsxF,GAAG,KAAKtxF,GAAUA,EAAa,QAASuxF,GAAGvxF,EAAEuK,GAAG,GAAIrS,GAAEs5F,EAAG,OAAOj5F,QAAOS,UAAUC,eAAejB,KAAKE,EAAE8H,GAAG9H,EAAE8H,GAAG9H,EAAE8H,GAAGuK,EAAEvK,GAAqN,QAASyxF,KAAK,GAAIzxF,GAAE+K,GAAE5O,QAAS,OAAO6D,GAAEA,EAAE0xF,iBAAa,GAE3kB,QAASC,GAAG3xF,GAAG,MAAOuxF,GAAGvxF,EAAE,WAAW,IAAI,GAAIuK,GAAE,EAAErS,EAAE05F,GAAGv3F,OAAOw3F,KAAK9iF,MAAM,KAAK5W,EAAEy5F,GAAGv3F,OAAO2F,IAAI+O,MAAM,KAAK/Q,EAAEiM,KAAK8G,IAAI7Y,EAAE8B,OAAO7B,EAAE6B,QAAQuG,EAAE,EAAE,GAAGgK,GAAGhK,EAAEvC,EAAEuC,IAAI,CAAC,GAAI0jB,GAAE/rB,EAAEqI,IAAI,GAAGxI,EAAEI,EAAEoI,IAAI,EAAG,GAAE,CAAqF,GAApF0jB,EAAE,iBAAiBpE,KAAKoE,KAAK,GAAG,GAAG,GAAG,IAAIlsB,EAAE,iBAAiB8nB,KAAK9nB,KAAK,GAAG,GAAG,GAAG,IAAO,GAAGksB,EAAE,GAAGjqB,QAAQ,GAAGjC,EAAE,GAAGiC,OAAO,KAAMuQ,GAAE0lF,EAAG,GAAGhsE,EAAE,GAAGjqB,OAAO,EAAEqS,SAAS4X,EAAE,GAAG,IAAI,GAAGlsB,EAAE,GAAGiC,OAAO,EAAEqS,SAAStU,EAAE,GAAG,MAAMk4F,EAAG,GAAGhsE,EAAE,GAAGjqB,OAAO,GAAGjC,EAAE,GAAGiC,SAASi2F,EAAGhsE,EAAE,GAAGlsB,EAAE,IAAIksB,EAAEA,EAAE,GAAGlsB,EAAEA,EAAE,SAAS,GAAGwS,GAAG,MAAO,IAAGA,IAC/Y,QAASunF,GAAG9xF,GAAGA,EAAEhH,UAAUwM,KAAKxF,EAAEhH,UAAUwM,KAAKxF,EAAEhH,UAAU+4F,gBAAe,EAAG,QAASC,GAAGhyF,GAAG,IAAIA,EAAE,OAAM,CAAG,KAAI,QAAQA,EAAE+xF,eAAe,MAAMxnF,GAAG,OAAM,GAAK,QAAS0nF,GAAGjyF,EAAEuK,EAAErS,GAAG+F,KAAKsC,EAAErI,EAAE+F,KAAK/F,EAAE8H,EAAE/B,KAAKgmB,EAAE1Z,EAAEtM,KAAKsM,EAAE,EAAEtM,KAAK+B,EAAE,KAAwH,QAASkyF,GAAGlyF,EAAEuK,GAAGvK,EAAEikB,EAAE1Z,GAAGvK,EAAEuK,EAAEvK,EAAEO,IAAIP,EAAEuK,IAAIA,EAAE7I,KAAK1B,EAAEA,EAAEA,EAAEA,EAAEuK,GAAwE,QAAS4nF,KAAK,GAAInyF,GAAEoyF,GAAG7nF,EAAE,IAA2D,OAAtDvK,GAAEA,IAAIuK,EAAEvK,EAAEA,EAAEA,EAAEA,EAAEA,EAAEA,EAAE0B,KAAK1B,EAAEA,IAAIA,EAAEuK,EAAE,MAAMA,EAAE7I,KAAK,MAAa6I,EAAE,QAAS8nF,KAAKp0F,KAAKyD,KAAKzD,KAAKsM,EAAEtM,KAAK+B,EAAE,KAAkI,QAASsyF,GAAGtyF,GAAG+K,GAAErF,WAAW,WAAW,KAAM1F,IAAI,GAC/0B,QAASuyF,KAAK,GAAIvyF,GAAE+K,GAAEw7B,cACqH,QADtG,KAAqBvmC,GAAG,mBAAqB+I,SAAQA,OAAOg9B,aAAah9B,OAAO1L,mBAAmB6mC,EAAE,YAAYlkC,EAAE,WAAW,GAAIA,GAAE7D,SAASE,cAAc,SAAU2D,GAAErD,MAAMi5D,QAAQ,OAAO51D,EAAE21D,IAAI,GAAGx5D,SAASsoB,gBAAgBtlB,YAAYa,EAAG,IAAIuK,GAAEvK,EAAEu2D,aAAcv2D,GAAEuK,EAAEpO,SAAS6D,EAAE+vD,OAAO/vD,EAAEq2D,MAAM,IAAIr2D,EAAE4kC,OAAQ,IAAI1sC,GAAE,gBAAgB+R,KAAK8e,SAAS5wB,EAAE,SAASoS,EAAEvB,SAASC,SAAS,IAAIsB,EAAEvB,SAASC,SAAS,KAAKsB,EAAEvB,SAAS2T,IAAK3c,GAAEupD,EAAE,SAASvpD,GAAO,KAAK7H,GAAG6H,EAAE84D,QAAQ3gE,GAAI6H,EAAEsJ,MAChfpR,GAAE+F,KAAKwoC,MAAMN,aAAaloC,MAAMsM,EAAElN,iBAAiB,UAAU2C,GAAE,GAAI/B,KAAKwoC,SAASxoC,KAAKyoC,OAAOX,YAAY,WAAWx7B,EAAEw7B,YAAY7tC,EAAEC,WAAU,KAAqB6H,IAAIkkC,EAAE,aAAaA,EAAE,QAAQ,CAAC,GAAI35B,GAAE,GAAIvK,GAAE9H,KAAKC,EAAED,CAAuF,OAArFqS,GAAEk8B,MAAMN,UAAU,WAAW,OAAG,KAASjuC,EAAEwJ,KAAK,CAACxJ,EAAEA,EAAEwJ,IAAK,IAAI1B,GAAE9H,EAAEg6F,EAAGh6F,GAAEg6F,GAAG,KAAKlyF,MAAa,SAASA,GAAG7H,EAAEuJ,MAAMwwF,GAAGlyF,GAAG7H,EAAEA,EAAEuJ,KAAK6I,EAAEm8B,MAAMX,YAAY,IAAI,MAAM,mBAAqB5pC,WAAU,sBAAuBA,UAASE,cAAc,UAAU,SAAS2D,GAAG,GAAIuK,GAAEpO,SAASE,cAAc,SACnfkO,GAAEs8B,mBAAmB,WAAWt8B,EAAEs8B,mBAAmB,KAAKt8B,EAAEhO,WAAWC,YAAY+N,GAAGA,EAAE,KAAKvK,IAAIA,EAAE,MAAM7D,SAASsoB,gBAAgBtlB,YAAYoL,IAAI,SAASvK,GAAG+K,GAAErF,WAAW1F,EAAE,IAAK,QAASwyF,GAAGxyF,EAAEuK,GAAGkoF,IAAIC,IAAKC,KAAKF,KAAKE,IAAG,EAAI,IAAIz6F,GAAEk6F,GAAGj6F,EAAEy6F,GAAGj6F,KAAMR,GAAEkQ,IAAIrI,EAAEuK,GAAGrS,EAAEqS,EAAErS,EAAEqS,EAAE7I,KAAKvJ,EAAED,EAAE8H,EAAE7H,EAAED,EAAEqS,EAAEpS,EAAS,QAASu6F,KAAK,IAAI,GAAGr4F,OAAO0Q,GAAEzF,SAAS4D,QAAQ,iBAAiB,CAAC,GAAIlJ,GAAE+K,GAAEzF,QAAQC,YAAQ,GAAQktF,IAAG,WAAWzyF,EAAEwF,KAAKqtF,QAAUJ,IAAG,WAAW,GAAIzyF,GAAE6yF,GAAI35F,EAAE6R,GAAEie,eAAeje,GAAE+nF,QAAQ/nF,GAAE+nF,OAAO95F,YAAYkrC,EAAE,SAASn5B,GAAE+nF,OAAO95F,UAAUgwB,cAAcje,GAAEie,cAAc+pE,KAAKA,GAAGR,KAAMQ,GAAG/yF,IAAI+K,GAAEie,aAAahpB,IACxkB,QAAS6yF,KAAK,IAAI,GAAI7yF,GAAEA,EAAEmyF,KAAM,CAAC,IAAInyF,EAAEA,EAAEhI,KAAKgI,EAAEuK,GAAG,MAAMA,GAAG+nF,EAAG/nF,GAAG2nF,EAAGU,GAAG5yF,GAAG2yF,IAAG,EAAI,QAASK,GAAEhzF,EAAEuK,GAAsE,GAAnEtM,KAAK+B,EAAEizF,GAAGh1F,KAAKnG,MAAE,GAAOmG,KAAKsC,EAAEtC,KAAKsM,EAAEtM,KAAK/F,EAAE,KAAK+F,KAAKgmB,EAAEhmB,KAAK1E,GAAE,EAAMyG,GAAG4uF,EAAG,IAAI,GAAI12F,GAAE+F,IAAK+B,GAAEhI,KAAKuS,EAAE,SAASvK,GAAGkzF,GAAGh7F,EAAEi7F,GAAGnzF,IAAI,SAASA,GAAG,KAAKA,YAAaozF,KAAI,IAAI,GAAGpzF,YAAa4I,OAAM,KAAM5I,EAAE,MAAM4I,OAAM,qBAAsB,MAAM5K,IAAIk1F,GAAGh7F,EAAEm7F,GAAGrzF,KAAK,MAAM7H,GAAG+6F,GAAGj1F,KAAKo1F,GAAGl7F,IAAuB,QAASm7F,MAAKr1F,KAAKyD,KAAKzD,KAAKsC,EAAEtC,KAAKsM,EAAEtM,KAAKgmB,EAAEhmB,KAAK+B,EAAE,KAAK/B,KAAK/F,GAAE,EAClY,QAASq7F,IAAGvzF,EAAEuK,EAAErS,GAAG,GAAIC,GAAEq7F,GAAG76F,KAAwB,OAAlBR,GAAE8rB,EAAEjkB,EAAE7H,EAAEoS,EAAEA,EAAEpS,EAAEoI,EAAErI,EAASC,EAAE,QAASouE,IAAEvmE,GAAG,GAAGA,YAAagzF,GAAE,MAAOhzF,EAAE,IAAIuK,GAAE,GAAIyoF,GAAEpE,EAAe,OAAXsE,IAAG3oF,EAAE4oF,GAAGnzF,GAAUuK,EAAE,QAASkpF,IAAEzzF,GAAG,MAAO,IAAIgzF,GAAE,SAASzoF,EAAErS,GAAGA,EAAE8H,KAAK,QAAS0zF,IAAG1zF,EAAEuK,EAAErS,GAAGy7F,GAAG3zF,EAAEuK,EAAErS,EAAE,OAAOs6F,EAAGpD,EAAG7kF,EAAEvK,IAAI,QAAS4zF,IAAG5zF,GAAG,MAAO,IAAIgzF,GAAE,SAASzoF,EAAErS,GAAG,GAAIC,GAAE6H,EAAEhG,OAAOgE,IAAK,IAAG7F,EAAE,IAAI,GAAmES,GAA/D2H,EAAE,SAASP,EAAE9H,GAAGC,IAAI6F,EAAEgC,GAAG9H,EAAE,GAAGC,GAAGoS,EAAEvM,IAAIimB,EAAE,SAASjkB,GAAG9H,EAAE8H,IAAIjI,EAAE,EAAIA,EAAEiI,EAAEhG,OAAOjC,IAAIa,EAAEoH,EAAEjI,GAAG27F,GAAG96F,EAAEw2F,EAAG7uF,EAAExI,GAAGksB,OAAQ1Z,GAAEvM,KACte,QAAS61F,IAAG7zF,GAAG,MAAO,IAAIgzF,GAAE,SAASzoF,GAAG,GAAIrS,GAAE8H,EAAEhG,OAAO7B,IAAK,IAAGD,EAAE,IAAI,GAAkF+rB,GAA9EjmB,EAAE,SAASgC,EAAEhC,EAAEuC,GAAGrI,IAAIC,EAAE6H,GAAGhC,GAAG81F,IAAG,EAAGz6F,MAAMkH,IAAIuzF,IAAG,EAAG9mF,OAAOzM,GAAG,GAAGrI,GAAGqS,EAAEpS,IAAIoI,EAAE,EAAIA,EAAEP,EAAEhG,OAAOuG,IAAI0jB,EAAEjkB,EAAEO,GAAGmzF,GAAGzvE,EAAEmrE,EAAGpxF,EAAEuC,GAAE,GAAI6uF,EAAGpxF,EAAEuC,GAAE,QAAUgK,GAAEpS,KAAuF,QAAS27F,IAAG9zF,EAAEuK,GAAmC,MAAhCA,GAAEgpF,GAAGhpF,EAAEA,MAAE,IAAQA,EAAErS,GAAE,EAAG67F,GAAG/zF,EAAEuK,GAAUvK,EACjW,QAASg0F,IAAGh0F,EAAEuK,GAAG,GAAGvK,EAAEA,GAAGizF,GAAG,GAAGjzF,EAAE9H,EAAE,CAAC,GAAIA,GAAE8H,EAAE9H,CAAE,IAAGA,EAAEqS,EAAE,CAAC,IAAI,GAAIpS,GAAE,EAAE6F,EAAE,KAAKuC,EAAE,KAAK0jB,EAAE/rB,EAAEqS,EAAE0Z,IAAIA,EAAE/rB,IAAIC,IAAI8rB,EAAEjkB,GAAGA,IAAIhC,EAAEimB,KAAKjmB,GAAG,EAAE7F,KAAK8rB,EAAEA,EAAEviB,KAAK1D,IAAIuC,EAAE0jB,EAAGjmB,KAAI9F,EAAE8H,GAAGizF,IAAI,GAAG96F,EAAE67F,GAAG97F,EAAEqS,IAAIhK,GAAGpI,EAAEoI,EAAEpI,EAAEuJ,MAAMxJ,EAAEqI,IAAIrI,EAAEqI,EAAEpI,GAAGA,EAAEuJ,KAAKvJ,EAAEuJ,KAAKA,MAAMuyF,GAAG/7F,GAAGg8F,GAAGh8F,EAAE8F,EAAEq1F,GAAG9oF,KAAKvK,EAAE9H,EAAE,SAAUg7F,IAAGlzF,EAAEqzF,GAAG9oF,GAAG,QAASwpF,IAAG/zF,EAAEuK,GAAGvK,EAAEuK,GAAGvK,EAAEA,GAAGmzF,IAAInzF,EAAEA,GAAGqzF,IAAIc,GAAGn0F,GAAGA,EAAEO,EAAEP,EAAEO,EAAEmB,KAAK6I,EAAEvK,EAAEuK,EAAEA,EAAEvK,EAAEO,EAAEgK,EAChV,QAAS6pF,IAAGp0F,EAAEuK,EAAErS,EAAEC,GAAG,GAAI6F,GAAEu1F,GAAG,KAAK,KAAK,KAA+M,OAAzMv1F,GAAEgC,EAAE,GAAIgzF,GAAE,SAAShzF,EAAEikB,GAAGjmB,EAAEimB,EAAE1Z,EAAE,SAASrS,GAAG,IAAI,GAAI8F,GAAEuM,EAAEvS,KAAKG,EAAED,EAAG8H,GAAEhC,GAAG,MAAMq2F,GAAGpwE,EAAEowE,KAAKr0F,EAAEhC,EAAEuM,EAAErS,EAAE,SAASqS,GAAG,IAAI,GAAIvM,GAAE9F,EAAEF,KAAKG,EAAEoS,OAAG,KAASvM,GAAGuM,YAAa6oF,IAAGnvE,EAAE1Z,GAAGvK,EAAEhC,GAAG,MAAMq2F,GAAGpwE,EAAEowE,KAAKpwE,IAAIjmB,EAAEgC,EAAE9H,EAAE8H,EAAE+zF,GAAG/zF,EAAEhC,GAAUA,EAAEgC,EAChQ,QAASkzF,IAAGlzF,EAAEuK,EAAErS,GAAG8H,EAAEA,GAAGizF,KAAKjzF,IAAI9H,IAAIqS,EAAE8oF,GAAGn7F,EAAE,GAAIkxB,WAAU,qCAAqCppB,EAAEA,EAAE,EAAE2zF,GAAGz7F,EAAE8H,EAAEs0F,GAAGt0F,EAAEu0F,GAAGv0F,KAAKA,EAAElI,EAAEI,EAAE8H,EAAEA,EAAEuK,EAAEvK,EAAE9H,EAAE,KAAKi8F,GAAGn0F,GAAGuK,GAAG8oF,IAAIn7F,YAAak7F,KAAIoB,GAAGx0F,EAAE9H,KAAK,QAASy7F,IAAG3zF,EAAEuK,EAAErS,EAAEC,GAAG,GAAG6H,YAAagzF,GAAE,MAAOe,IAAG/zF,EAAEuzF,GAAGhpF,GAAGqkF,EAAG12F,GAAG,KAAKC,KAAI,CAAG,IAAG65F,EAAGhyF,GAAG,MAAOA,GAAEwF,KAAK+E,EAAErS,EAAEC,IAAG,CAAG,IAAGm1D,EAAEttD,GAAG,IAAI,GAAIhC,GAAEgC,EAAEwF,IAAK,IAAGtM,EAAE8E,GAAG,MAAOy2F,IAAGz0F,EAAEhC,EAAEuM,EAAErS,EAAEC,IAAG,EAAG,MAAMoI,GAAG,MAAOrI,GAAEF,KAAKG,EAAEoI,IAAG,EAAG,OAAM,EAChY,QAASk0F,IAAGz0F,EAAEuK,EAAErS,EAAEC,EAAE6F,GAAG,QAASuC,GAAEP,GAAGjI,IAAIA,GAAE,EAAGI,EAAEH,KAAKgG,EAAEgC,IAAI,QAASikB,GAAEjkB,GAAGjI,IAAIA,GAAE,EAAGG,EAAEF,KAAKgG,EAAEgC,IAAI,GAAIjI,IAAE,CAAG,KAAIwS,EAAEvS,KAAKgI,EAAEikB,EAAE1jB,GAAG,MAAM3H,GAAG2H,EAAE3H,IAAI,QAASu7F,IAAGn0F,GAAGA,EAAEzG,IAAIyG,EAAEzG,GAAE,EAAGi5F,EAAGxyF,EAAE2zF,GAAG3zF,IAAI,QAASi0F,IAAGj0F,GAAG,GAAIuK,GAAE,IAAyD,OAApDvK,GAAEuK,IAAIA,EAAEvK,EAAEuK,EAAEvK,EAAEuK,EAAEA,EAAE7I,KAAK6I,EAAE7I,KAAK,MAAM1B,EAAEuK,IAAIvK,EAAEO,EAAE,MAAagK,EACtQ,QAAS2pF,IAAGl0F,EAAEuK,EAAErS,EAAEC,GAAG,GAAGD,GAAGm7F,IAAI9oF,EAAEA,IAAIA,EAAErS,EAAE,KAAK8H,GAAGA,EAAEikB,EAAEjkB,EAAEA,EAAE9H,EAAE8H,EAAEikB,GAAE,CAAG,IAAG1Z,EAAEvK,EAAEuK,EAAEvK,EAAE9H,EAAE,KAAKw8F,GAAGnqF,EAAErS,EAAEC,OAAQ,KAAIoS,EAAErS,EAAEqS,EAAE0Z,EAAEjsB,KAAKuS,EAAEhK,GAAGm0F,GAAGnqF,EAAErS,EAAEC,GAAG,MAAM6F,GAAG22F,GAAG38F,KAAK,KAAKgG,GAAGk0F,EAAGsB,GAAGjpF,GAAG,QAASmqF,IAAG10F,EAAEuK,EAAErS,GAAGqS,GAAG4oF,GAAGnzF,EAAEikB,EAAEjsB,KAAKgI,EAAEO,EAAErI,GAAG8H,EAAEuK,GAAGvK,EAAEuK,EAAEvS,KAAKgI,EAAEO,EAAErI,GAAG,QAASs8F,IAAGx0F,EAAEuK,GAAGvK,EAAEikB,GAAE,EAAGuuE,EAAG,WAAWxyF,EAAEikB,GAAG0wE,GAAG38F,KAAK,KAAKuS,KAAe,QAAS6oF,IAAGpzF,GAAGuvF,EAAEv3F,KAAKiG,KAAK+B,GAA+D,QAAS40F,MAAK32F,KAAK+B,EAAE,GAAG/B,KAAKsM,EAAEsqF,GAA4H,QAASC,IAAG90F,GAAG,MAAGA,aAAa40F,KAAI50F,EAAE8B,cAAc8yF,IAAI50F,EAAEuK,IAAIsqF,GAAU70F,EAAEA,GAAEmwF,EAAG,uCAAuCnwF,EAAE,KAAW,oBAA6B,QAAS+0F,IAAG/0F,GAAG,GAAIuK,GAAE,GAAIqqF,GAAS,OAANrqF,GAAEvK,EAAEA,EAASuK,EAAS,QAASyqF,MAAK/2F,KAAK+B,EAAE,GAAG/B,KAAKsM,EAAEzK,GAAyI,QAASm1F,IAAGj1F,GAAG,MAAGA,aAAag1F,KAAIh1F,EAAE8B,cAAckzF,IAAIh1F,EAAEuK,IAAIzK,GAAUE,EAAEA,GAAEmwF,EAAG,oDAAoDnwF,EAAE,aAAa6uF,EAAG7uF,IAAU,iCAAgC,QAASk1F,IAAGl1F,EAAEuK,GAA4B,MAAzBvK,GAAEm1F,GAAGn1F,EAAEuK,GAAGA,EAAE,GAAIyqF,IAAGzqF,EAAEvK,EAAEA,EAASuK,EACvoC,QAAS4qF,IAAGn1F,EAAEuK,GAAG,GAAIrS,GAAE48F,GAAG90F,EAAG,KAAIo1F,GAAGr4F,KAAK7E,GAAG,KAAM0Q,OAAM,sCAAsC1Q,EAAG,OAAOA,GAAEiF,QAAQk4F,GAAG,SAASr1F,EAAEhC,GAAG,IAAIzF,OAAOS,UAAUC,eAAejB,KAAKuS,EAAEvM,GAAG,KAAM4K,OAAM,kBAAkB5K,EAAE,yBAAyB9F,EAAE,gDAAgDguB,KAAKve,UAAU4C,GAAW,OAAPvK,GAAEuK,EAAEvM,GAAUgC,YAAa40F,IAAGE,GAAG90F,GAAGwP,mBAAmBnV,OAAO2F,MAAoG,QAASs1F,MAAKr3F,KAAK+B,EAAE,GAAG/B,KAAKsM,EAAEgrF,GAA8H,QAASC,IAAGx1F,GAAG,MAAGA,aAAas1F,KAAIt1F,EAAE8B,cAAcwzF,IAAIt1F,EAAEuK,IAAIgrF,GAAUv1F,EAAEA,GAAEmwF,EAAG,yCAAyCnwF,EAAE,aAAa6uF,EAAG7uF,IAAU,sBACjwB,QAASy1F,IAAGz1F,GAAG,MAAGA,aAAas1F,IAAUt1F,GAAEA,EAAEA,EAAEmvF,GAAGnvF,EAAE01F,KAAKr7F,OAAO2F,GAAG21F,GAAG54F,KAAKiD,KAAKA,EAAE,2BAAkC41F,GAAG51F,IAAa,QAAS41F,IAAG51F,GAAG,GAAIuK,GAAE,GAAI+qF,GAAS,OAAN/qF,GAAEvK,EAAEA,EAASuK,EAAoB,QAASsrF,MAAK53F,KAAK+B,EAAE,GAAG/B,KAAKsM,EAAEurF,GAA+H,QAASC,IAAG/1F,GAAG,MAAGA,aAAa61F,KAAI71F,EAAE8B,cAAc+zF,IAAI71F,EAAEuK,IAAIurF,GAAU91F,EAAEA,GAAEmwF,EAAG,0CAA0CnwF,EAAE,aAAa6uF,EAAG7uF,IAAU,uBAAgC,QAASg2F,IAAGh2F,GAAG,GAAIuK,GAAE,GAAIsrF,GAAS,OAANtrF,GAAEvK,EAAEA,EAASuK,EAA0C,QAAS+pF,IAAGt0F,GAAG,GAAIuK,GAAEpO,QAAS,OAAOlE,GAAE+H,GAAGuK,EAAE0rF,eAAej2F,GAAGA,EAAE,QAASu0F,IAAGv0F,EAAEuK,GAAGumF,EAAGvmF,EAAE,SAASA,EAAEpS,GAAGoS,GAAGA,EAAE4kF,KAAK5kF,EAAEA,EAAEmrF,MAAM,SAASv9F,EAAE6H,EAAErD,MAAMC,QAAQ2N,EAAE,SAASpS,EAAE6H,EAAEjC,UAAUwM,EAAE,OAAOpS,EAAE6H,EAAEk2F,QAAQ3rF,EAAE4rF,GAAGl9F,eAAed,GAAG6H,EAAElC,aAAaq4F,GAAGh+F,GAAGoS,GAAG,GAAGpS,EAAEi+F,YAAY,QAAQ,IAAI,GAAGj+F,EAAEi+F,YAAY,QAAQ,GAAGp2F,EAAElC,aAAa3F,EAAEoS,GAAGvK,EAAE7H,GAAGoS,IAEx6B,QAAS8rF,IAAGr2F,EAAEuK,EAAErS,GAAG,GAAIC,GAAE4B,UAAUiE,EAAE7B,SAASoE,EAAElG,OAAOlC,EAAE,IAAI8rB,EAAE9rB,EAAE,EAAG,KAAIm+F,IAAIryE,IAAIA,EAAE7rB,MAAM6rB,EAAE/lB,MAAM,CAAoD,GAAnDqC,GAAG,IAAIA,GAAG0jB,EAAE7rB,MAAMmI,EAAErG,KAAK,UAAUu1F,EAAGxrE,EAAE7rB,MAAM,KAAQ6rB,EAAE/lB,KAAK,CAACqC,EAAErG,KAAK,UAAUu1F,EAAGxrE,EAAE/lB,MAAM,IAAK,IAAInG,KAAKq5F,GAAGr5F,EAAEksB,SAAUlsB,GAAEmG,KAAK+lB,EAAElsB,EAAEwI,EAAErG,KAAK,KAAKqG,EAAEA,EAAE2L,KAAK,IAA6G,MAAzG3L,GAAEvC,EAAE3B,cAAckE,GAAG0jB,IAAIhsB,EAAEgsB,GAAG1jB,EAAExC,UAAUkmB,EAAE+qE,EAAG/qE,GAAG1jB,EAAExC,UAAUkmB,EAAE/X,KAAK,KAAKqoF,GAAGh0F,EAAE0jB,IAAI,EAAE9rB,EAAE6B,QAAQu8F,GAAGv4F,EAAEuC,EAAEpI,GAAUoI,EAC5W,QAASg2F,IAAGv2F,EAAEuK,EAAErS,GAAG,QAASC,GAAED,GAAGA,GAAGqS,EAAEpL,YAAYlH,EAAEC,GAAG8H,EAAER,eAAetH,GAAGA,GAAG,IAAI,GAAI8F,GAAE,EAAEA,EAAE9F,EAAE8B,OAAOgE,IAAI,CAAC,GAAIuC,GAAErI,EAAE8F,IAAIixF,EAAG1uF,IAAI+sD,EAAE/sD,IAAI,EAAEA,EAAEi2F,SAASr+F,EAAEoI,GAAGk2F,GAAEC,GAAGn2F,GAAGqwF,EAAGrwF,GAAGA,EAAEpI,IAAI,QAASu+F,IAAG12F,GAAG,GAAGA,GAAG,gBAAiBA,GAAEhG,OAAO,CAAC,GAAGszD,EAAEttD,GAAG,MAAM,kBAAmBA,GAAE+kC,MAAM,gBAAiB/kC,GAAE+kC,IAAK,IAAG7rC,EAAE8G,GAAG,MAAM,kBAAmBA,GAAE+kC,KAAK,OAAM,EAAI,QAAS4xD,IAAG32F,GAAG,GAAIuK,KAAoB,OAAfqsF,IAAG,GAAIC,IAAG72F,EAAEuK,GAAUA,EAAE2B,KAAK,IAAI,QAAS2qF,OAC9Y,QAASD,IAAG52F,EAAEuK,EAAErS,GAAG,GAAG,MAAMqS,EAAErS,EAAEgC,KAAK,YAAY,CAAC,GAAG,oBAAiBqQ,EAAjB,YAAA1N,EAAiB0N,IAAE,CAAC,GAAGykF,EAAGzkF,GAAG,CAAC,GAAIpS,GAAEoS,CAAEA,GAAEpS,EAAE6B,OAAO9B,EAAEgC,KAAK,IAAK,KAAI,GAAI8D,GAAE,GAAGuC,EAAE,EAAEA,EAAEgK,EAAEhK,IAAIrI,EAAEgC,KAAK8D,GAAG44F,GAAG52F,EAAE7H,EAAEoI,GAAGrI,GAAG8F,EAAE,GAAgB,YAAZ9F,GAAEgC,KAAK,KAAY,KAAGqQ,YAAalQ,SAAQkQ,YAAahB,SAAQgB,YAAaiE,UAA0B,CAACtW,EAAEgC,KAAK,KAAK8D,EAAE,EAAG,KAAI7F,IAAKoS,GAAEhS,OAAOS,UAAUC,eAAejB,KAAKuS,EAAEpS,IAAY,mBAAPoI,EAAEgK,EAAEpS,MAA0BD,EAAEgC,KAAK8D,GAAG84F,GAAG3+F,EAAED,GAAGA,EAAEgC,KAAK,KAAK08F,GAAG52F,EAAEO,EAAErI,GAAG8F,EAAE,IAAkB,YAAZ9F,GAAEgC,KAAK,KAAhLqQ,EAAEA,EAAEwsF,UAAyL,gBAAcxsF,EAAd,YAAA1N,EAAc0N,IAAG,IAAK,SAASusF,GAAGvsF,EAAErS,EAAG,MAAM,KAAK,SAASA,EAAEgC,KAAK88F,SAASzsF,KACpgB62B,MAAM72B,GAAGlQ,OAAOkQ,GAAG,OAAQ,MAAM,KAAK,UAAUrS,EAAEgC,KAAKG,OAAOkQ,GAAI,MAAM,KAAK,WAAWrS,EAAEgC,KAAK,OAAQ,MAAM,SAAQ,KAAM0O,OAAM,2BAAwB2B,EAAxB,YAAA1N,EAAwB0N,OAC1J,QAASusF,IAAG92F,EAAEuK,GAAGA,EAAErQ,KAAK,IAAI8F,EAAE7C,QAAQ85F,GAAG,SAASj3F,GAAG,GAAIuK,GAAE2sF,GAAGl3F,EAAuE,OAApEuK,KAAIA,EAAE,OAAuB,MAAhBvK,EAAE+2C,WAAW,IAAUxqC,SAAS,IAAID,OAAO,GAAG4qF,GAAGl3F,GAAGuK,GAAUA,IAAI,KAAM,QAAS4sF,MAAK,GAAGC,KAAKC,GAAGp5F,KAAKq5F,MAAMr5F,KAAKq5F,MAAM5B,KAAKz3F,MAAMA,KAAKuxF,GAAGvxF,KAAKuxF,GAAGvxF,KAAKoyF,GAAGpyF,KAAKoyF,GAAqC,QAASkH,IAAGv3F,GAAGA,EAAEwvF,KAAKxvF,EAAEwvF,IAAG,EAAGxvF,EAAE4vF,KAAK,GAAGwH,KAAKp3F,EAAEA,EAAEs3F,MAAMt3F,EAAEs3F,MAAM5B,UAAW2B,IAAGr3F,KAAkY,QAASw3F,IAAEx3F,EAAEuK,GAAGtM,KAAKC,KAAK8B,EAAE/B,KAAKsM,EAAEtM,KAAKswB,OAAOhkB,EAAEtM,KAAKy0F,IAAG,EAAwC,QAAS+E,IAAGz3F,EAAEuK,GAA6P,GAA1PitF,GAAEx/F,KAAKiG,KAAK+B,EAAEA,EAAE9B,KAAK,IAAID,KAAKy5F,cAAcz5F,KAAKsM,EAAEtM,KAAKswB,OAAO,KAAKtwB,KAAK+wB,OAAO/wB,KAAK05F,QAAQ15F,KAAK25F,QAAQ35F,KAAK45F,QAAQ55F,KAAK65F,QAAQ,EAAE75F,KAAK3D,IAAI,GAAG2D,KAAK85F,QAAQ95F,KAAK+5F,SAAS/5F,KAAKg6F,OAAOh6F,KAAKi6F,SAAQ,EAAGj6F,KAAKk6F,UAAU,EAAEl6F,KAAKm6F,YAAY,GAAGn6F,KAAK+B,EAAE,KAAQA,EAAE,CAAC,GAAI9H,GAAE+F,KAAKC,KAAK8B,EAAE9B,KAAK/F,EAAE6H,EAAEq4F,eAAer4F,EAAEq4F,eAAe,GAAG,IAAiD,IAA5Cp6F,KAAKswB,OAAOvuB,EAAEuuB,QAAQvuB,EAAEs4F,WAAWr6F,KAAKsM,EAAEA,EAAKA,EAAEvK,EAAE03F,eAAe,GAAG5tE,GAAG,CAAC9pB,EAAE,CAAC,IAAIsxF,EAAG/mF,EAAE/Q,SAAU,IAAIwE,IAAE,CAAG,MAAMgC,GAAE,MAAMO,IAAIvC,GAAE,EAAGA,IAAIuM,EAAE,WAAW,aAAarS,EAAEqS,EACrzCvK,EAAEu4F,YAAY,YAAYrgG,IAAIqS,EAAEvK,EAAEw4F,UAAWv6F,MAAKy5F,cAAcntF,EAAE,OAAOpS,GAAG8F,KAAK65F,YAAQ,KAAS93F,EAAE83F,QAAQ93F,EAAE83F,QAAQ93F,EAAEy4F,MAAMx6F,KAAK45F,YAAQ,KAAS73F,EAAE63F,QAAQ73F,EAAE63F,QAAQ73F,EAAE04F,MAAMz6F,KAAK25F,QAAQ53F,EAAE43F,SAAS,EAAE35F,KAAK05F,QAAQ33F,EAAE23F,SAAS,IAAI15F,KAAK65F,YAAQ,KAAS3/F,EAAE2/F,QAAQ3/F,EAAE2/F,QAAQ3/F,EAAEsgG,MAAMx6F,KAAK45F,YAAQ,KAAS1/F,EAAE0/F,QAAQ1/F,EAAE0/F,QAAQ1/F,EAAEugG,MAAMz6F,KAAK25F,QAAQz/F,EAAEy/F,SAAS,EAAE35F,KAAK05F,QAAQx/F,EAAEw/F,SAAS,GAAG15F,KAAK+wB,OAAOhvB,EAAEgvB,OAAO/wB,KAAK3D,IAAI0F,EAAE1F,KAAK,GAAG2D,KAAKi6F,QAAQl4F,EAAEk4F,QAAQj6F,KAAKg6F,OAAOj4F,EAAEi4F,OAAOh6F,KAAK+5F,SAASh4F,EAAEg4F,SAAS/5F,KAAK85F,QACjf/3F,EAAE+3F,QAAQ95F,KAAKk6F,UAAUn4F,EAAEm4F,WAAW,EAAEl6F,KAAKm6F,YAAYngG,EAAE+H,EAAEo4F,aAAap4F,EAAEo4F,YAAYO,GAAG34F,EAAEo4F,cAAc,GAAGn6F,KAAK+B,EAAEA,EAAEA,EAAE44F,kBAAkB36F,KAAK/F,KAA8V,QAAS2gG,IAAG74F,EAAEuK,EAAErS,EAAEC,EAAE6F,GAAGC,KAAKomB,SAASrkB,EAAE/B,KAAK+B,EAAE,KAAK/B,KAAK03D,IAAIprD,EAAEtM,KAAKC,KAAKhG,EAAE+F,KAAK66F,UAAU3gG,EAAE8F,KAAK2yF,GAAG5yF,EAAEC,KAAK3D,MAAMy+F,GAAG96F,KAAKmxF,GAAGnxF,KAAKsyF,IAAG,EAAG,QAASyI,IAAGh5F,GAAGA,EAAEovF,IAAG,EAAGpvF,EAAEqkB,SAAS,KAAKrkB,EAAEA,EAAE,KAAKA,EAAE21D,IAAI,KAAK31D,EAAE4wF,GAAG,KAAM,QAASqI,IAAGj5F,GAAG/B,KAAK03D,IAAI31D,EAAE/B,KAAK+B,KAAK/B,KAAKsM,EAAE,EAAE,QAAS2uF,IAAGl5F,EAAEuK,EAAErS,EAAEC,EAAE6F,EAAEuC,GAAG,GAAI0jB,GAAE1Z,EAAEgC,YAAWhC,EAAEvK,EAAEA,EAAEikB,MAAO1Z,EAAEvK,EAAEA,EAAEikB,MAAMjkB,EAAEuK,IAAK,IAAIxS,GAAEohG,GAAG5uF,EAAErS,EAAE8F,EAAEuC,EAA2E,QAAvE,EAAExI,GAAGiI,EAAEuK,EAAExS,GAAGI,IAAI6H,EAAEuwF,IAAG,KAAMvwF,EAAE,GAAI64F,IAAG3gG,EAAE8H,EAAE21D,IAAI1xC,IAAIjmB,EAAEuC,GAAGP,EAAEuwF,GAAGp4F,EAAEoS,EAAErQ,KAAK8F,IAAWA,EAAE,QAASo5F,IAAGp5F,EAAEuK,GAAG,GAAIrS,GAAEqS,EAAErM,IAAKhG,KAAK8H,GAAEA,GAAGywF,EAAGzwF,EAAEA,EAAE9H,GAAGqS,KAAKyuF,GAAGzuF,GAAG,GAAGvK,EAAEA,EAAE9H,GAAG8B,eAAgBgG,GAAEA,EAAE9H,GAAG8H,EAAEuK,MAAM,QAAS4uF,IAAGn5F,EAAEuK,EAAErS,EAAEC,GAAG,IAAI,GAAI6F,GAAE,EAAEA,EAAEgC,EAAEhG,SAASgE,EAAE,CAAC,GAAIuC,GAAEP,EAAEhC,EAAG,KAAIuC,EAAE6uF,IAAI7uF,EAAE8jB,UAAU9Z,GAAGhK,EAAEu4F,WAAW5gG,GAAGqI,EAAEqwF,IAAIz4F,EAAE,MAAO6F,GAAE,OAAO,EAAyD,QAASq7F,IAAGr5F,EAAEuK,EAAErS,EAAEC,EAAE6F,GAAG,GAAG7F,GAAGA,EAAE40B,KAAKo5C,GAAGnmE,EAAEuK,EAAErS,EAAEC,EAAE6F,OAAQ,IAAGgxF,EAAGzkF,GAAG,IAAI,GAAIhK,GAAE,EAAEA,EAAEgK,EAAEvQ,OAAOuG,IAAI84F,GAAGr5F,EAAEuK,EAAEhK,GAAGrI,EAAEC,EAAE6F,OAAQ9F,GAAEohG,GAAGphG,GAAG8H,GAAGA,EAAEu5F,IAAIC,GAAGx5F,EAAEuK,EAAErS,EAAEo1D,EAAEn1D,KAAKA,EAAE2gG,UAAU3gG,EAAE6F,GAAGy7F,GAAGz5F,EAAEuK,EAAErS,GAAE,EAAGC,EAAE6F,GACn2C,QAASy7F,IAAGz5F,EAAEuK,EAAErS,EAAEC,EAAE6F,EAAEuC,GAAG,IAAIgK,EAAE,KAAM3B,OAAM,qBAAsB,IAAIqb,GAAEqpC,EAAEtvD,KAAKA,EAAE86F,UAAU96F,EAAEjG,EAAE2hG,GAAG15F,EAA4C,IAAzCjI,IAAIiI,EAAE25F,IAAI5hG,EAAE,GAAIkhG,IAAGj5F,IAAI9H,EAAEghG,GAAGnhG,EAAEwS,EAAErS,EAAEC,EAAE8rB,EAAE1jB,IAAOrI,EAAE8H,EAAE,CAAmC,GAAlC7H,EAAEsO,KAAKvO,EAAE8H,EAAE7H,EAAEA,EAAEw9D,IAAI31D,EAAE7H,EAAEksB,SAASnsB,EAAK8H,EAAE3C,iBAAiBu8F,KAAK57F,EAAEimB,OAAG,KAASjmB,IAAIA,GAAE,GAAIgC,EAAE3C,iBAAiBkN,EAAEgC,WAAWpU,EAAE6F,OAAQ,KAAGgC,EAAEmK,YAAmD,KAAMvB,OAAM,oDAAnD5I,GAAEmK,YAAY0vF,GAAGtvF,EAAEgC,YAAYpU,GAAyE2hG,MAC9Y,QAASrzF,MAAK,GAAIzG,GAAE+5F,GAAGxvF,EAAE+kF,GAAG,SAASp3F,GAAG,MAAO8H,GAAEhI,KAAKuS,EAAEorD,IAAIprD,EAAE8Z,SAASnsB,IAAI,SAASA,GAAgC,KAA7BA,EAAE8H,EAAEhI,KAAKuS,EAAEorD,IAAIprD,EAAE8Z,SAASnsB,IAAS,MAAOA,GAAG,OAAOqS,GAAE,QAAS47D,IAAGnmE,EAAEuK,EAAErS,EAAEC,EAAE6F,GAAG,GAAGgxF,EAAGzkF,GAAG,IAAI,GAAIhK,GAAE,EAAEA,EAAEgK,EAAEvQ,OAAOuG,IAAI4lE,GAAGnmE,EAAEuK,EAAEhK,GAAGrI,EAAEC,EAAE6F,OAAQ9F,GAAEohG,GAAGphG,GAAG8H,GAAGA,EAAEu5F,IAAIS,GAAGh6F,EAAEuK,EAAErS,EAAEo1D,EAAEn1D,KAAKA,EAAE2gG,UAAU3gG,EAAE6F,GAAGy7F,GAAGz5F,EAAEuK,EAAErS,GAAE,EAAGC,EAAE6F,GAC9R,QAASi8F,IAAEj6F,EAAEuK,EAAErS,EAAEC,EAAE6F,GAAG,GAAGgxF,EAAGzkF,GAAG,IAAI,GAAIhK,GAAE,EAAEA,EAAEgK,EAAEvQ,OAAOuG,IAAI05F,GAAEj6F,EAAEuK,EAAEhK,GAAGrI,EAAEC,EAAE6F,OAAQ7F,GAAEm1D,EAAEn1D,KAAKA,EAAE2gG,UAAU3gG,EAAED,EAAEohG,GAAGphG,GAAG8H,GAAGA,EAAEu5F,KAAMv5F,EAAEA,EAAEuvF,GAAEhlF,EAAElQ,OAAOkQ,GAAGgC,aAAgBvM,GAAEA,IAAIO,EAAEP,EAAEA,EAAEuK,IAAkB,GAAfrS,EAAEihG,GAAG54F,EAAErI,EAAEC,EAAE6F,MAAUg7F,GAAGz4F,EAAErI,IAAIsP,MAAMxO,UAAUuJ,OAAOvK,KAAKuI,EAAErI,EAAE,GAAG,GAAGqI,EAAEvG,eAAgBgG,GAAEA,EAAEuK,GAAGvK,EAAEuK,QAAQvK,IAAIA,EAAE05F,GAAG15F,MAAMuK,EAAEvK,EAAEA,EAAEuK,EAAEgC,YAAYvM,GAAG,EAAEuK,IAAIvK,EAAEm5F,GAAG5uF,EAAErS,EAAEC,EAAE6F,KAAK9F,GAAG,EAAE8H,EAAEuK,EAAEvK,GAAG,OAAOk6F,GAAGhiG,IACnW,QAASgiG,IAAGl6F,GAAG,GAAG,gBAAiBA,IAAGA,IAAIA,EAAEovF,GAAG,CAAC,GAAI7kF,GAAEvK,EAAE21D,GAAI,IAAGprD,GAAGA,EAAEgvF,IAAIH,GAAG7uF,EAAEglF,EAAEvvF,OAAO,CAAC,GAAI9H,GAAE8H,EAAE9B,KAAK/F,EAAE6H,EAAEA,CAAEuK,GAAEhN,oBAAoBgN,EAAEhN,oBAAoBrF,EAAEC,EAAE6H,EAAE84F,SAASvuF,EAAE4vF,aAAa5vF,EAAE4vF,YAAYN,GAAG3hG,GAAGC,GAAG2hG,MAAM5hG,EAAEwhG,GAAGnvF,KAAK6uF,GAAGlhG,EAAE8H,GAAG,GAAG9H,EAAEqS,IAAIrS,EAAEy9D,IAAI,KAAKprD,EAAEovF,IAAI,OAAOX,GAAGh5F,KAAK,QAAS65F,IAAG75F,GAAG,MAAOA,KAAKo6F,IAAGA,GAAGp6F,GAAGo6F,GAAGp6F,GAAG,KAAKA,EAAE,QAASq6F,IAAGr6F,EAAEuK,EAAErS,EAAEC,GAAG,GAAI6F,IAAE,CAAG,KAAGgC,EAAE05F,GAAG15F,MAAMuK,EAAEvK,EAAEA,EAAEuK,EAAEgC,aAAY,IAAIhC,EAAEA,EAAE9B,SAASzI,EAAE,EAAEA,EAAEuK,EAAEvQ,OAAOgG,IAAI,CAAC,GAAIO,GAAEgK,EAAEvK,EAAGO,IAAGA,EAAEu4F,SAAS5gG,IAAIqI,EAAE6uF,KAAK7uF,EAAE+5F,GAAG/5F,EAAEpI,GAAG6F,EAAEA,IAAG,IAAKuC,GAAG,MAAOvC,GACpe,QAASs8F,IAAGt6F,EAAEuK,GAAG,GAAIrS,GAAE8H,EAAEqkB,SAASlsB,EAAE6H,EAAE4wF,IAAI5wF,EAAE21D,GAAgB,OAAZ31D,GAAEuwF,IAAI2J,GAAGl6F,GAAU9H,EAAEF,KAAKG,EAAEoS,GAC5E,QAASwvF,IAAG/5F,EAAEuK,GAAG,GAAGvK,EAAEovF,GAAG,OAAM,CAAG,KAAIE,GAAG,CAAC,IAAI/kF,EAAEvK,EAAE,CAACuK,GAAG,SAAS,QAAS,KAAI,GAAIrS,GAAE6S,GAAE5S,EAAE,EAAEA,EAAEoS,EAAEvQ,OAAO7B,IAAI,GAAa,OAAVD,EAAEA,EAAEqS,EAAEpS,KAAY,CAACoS,EAAE,IAAK,MAAMvK,GAAEuK,EAAErS,EAA4B,GAA1BC,EAAEoS,EAAEA,EAAE,GAAIktF,IAAGt/F,EAAE8F,MAAM/F,GAAE,IAAQ,EAAEC,EAAEoiG,aAAS,IAAQpiG,EAAEqiG,aAAa,CAACx6F,EAAE,CAAC,GAAIhC,IAAE,CAAG,IAAG,GAAG7F,EAAEoiG,QAAQ,IAAIpiG,EAAEoiG,SAAS,CAAE,MAAMv6F,GAAE,MAAMikB,GAAGjmB,GAAE,GAAMA,OAAG,IAAQ7F,EAAEqiG,eAAYriG,EAAEqiG,aAAY,GAAQ,IAALriG,KAAS6F,EAAEuM,EAAEA,EAAEvM,EAAEA,EAAEA,EAAEzB,WAAWpE,EAAE+B,KAAK8D,EAAY,KAATgC,EAAEA,EAAE9B,KAASF,EAAE7F,EAAE6B,OAAO,EAAE,GAAGgE,EAAEA,IAAI,CAACuM,EAAEA,EAAEpS,EAAE6F,EAAG,IAAIuC,GAAE85F,GAAGliG,EAAE6F,GAAGgC,GAAE,EAAGuK,EAAGrS,GAAEA,GAAGqI,EAAE,IAAIvC,EAAE,EAAEA,EAAE7F,EAAE6B,OAAOgE,IAAIuM,EAAEA,EAAEpS,EAAE6F,GAAGuC,EAAE85F,GAAGliG,EAAE6F,GAAGgC,GAAE,EAAGuK,GAAGrS,EAAEA,GAAGqI,EAAE,MAAOrI,GAAE,MAAOoiG,IAAGt6F,EACpgB,GAAIy3F,IAAGltF,EAAEtM,OAAO,QAASy7F,IAAG15F,GAAW,MAARA,GAAEA,EAAE25F,IAAW35F,YAAai5F,IAAGj5F,EAAE,KAA2D,QAASs5F,IAAGt5F,GAAG,MAAG9G,GAAE8G,GAAUA,GAAEA,EAAEy6F,MAAMz6F,EAAEy6F,IAAI,SAASlwF,GAAG,MAAOvK,GAAE06F,YAAYnwF,KAAYvK,EAAEy6F,KAAK,QAASE,MAAIxD,GAAGn/F,KAAKiG,MAAMA,KAAKsxF,EAAE,GAAI0J,IAAGh7F,MAAMA,KAAKi1F,GAAGj1F,KAAKA,KAAK+yF,GAAG,KACjS,QAAS4J,IAAE56F,EAAEuK,GAAG,GAAIrS,GAAEC,EAAE6H,EAAEgxF,EAAG,IAAG74F,EAAE,IAAID,KAAKC,EAAEA,EAAEA,EAAE64F,GAAG94F,EAAEgC,KAAK/B,EAAsB,IAAnB6H,EAAEA,EAAEkzF,GAAG/6F,EAAEoS,EAAErM,MAAMqM,EAAKtS,EAAEsS,GAAGA,EAAE,GAAIitF,IAAEjtF,EAAEvK,OAAQ,IAAGuK,YAAaitF,IAAEjtF,EAAEgkB,OAAOhkB,EAAEgkB,QAAQvuB,MAAM,CAAC,GAAIhC,GAAEuM,CAAEA,GAAE,GAAIitF,IAAEr/F,EAAE6H,GAAGoxF,EAAG7mF,EAAEvM,GAAQ,GAALA,GAAE,EAAM9F,EAAE,IAAI,GAAIqI,GAAErI,EAAE8B,OAAO,EAAE,GAAGuG,EAAEA,IAAI,CAAC,GAAI0jB,GAAE1Z,EAAEA,EAAErS,EAAEqI,EAAGvC,GAAE68F,GAAG52E,EAAE9rB,GAAE,EAAGoS,IAAIvM,EAA8C,GAA5CimB,EAAE1Z,EAAEA,EAAEvK,EAAEhC,EAAE68F,GAAG52E,EAAE9rB,GAAE,EAAGoS,IAAIvM,EAAEA,EAAE68F,GAAG52E,EAAE9rB,GAAE,EAAGoS,IAAIvM,EAAK9F,EAAE,IAAIqI,EAAE,EAAEA,EAAErI,EAAE8B,OAAOuG,IAAI0jB,EAAE1Z,EAAEA,EAAErS,EAAEqI,GAAGvC,EAAE68F,GAAG52E,EAAE9rB,GAAE,EAAGoS,IAAIvM,EACpL,QAASw7F,IAAGx5F,EAAEuK,EAAErS,EAAEC,EAAE6F,GAAGk7F,GAAGl5F,EAAEuvF,EAAEl1F,OAAOkQ,GAAGrS,GAAE,EAAGC,EAAE6F,GAAG,QAASg8F,IAAGh6F,EAAEuK,EAAErS,EAAEC,EAAE6F,GAAGk7F,GAAGl5F,EAAEuvF,EAAEl1F,OAAOkQ,GAAGrS,GAAE,EAAGC,EAAE6F,GAAG,QAAS68F,IAAG76F,EAAEuK,EAAErS,EAAEC,GAAsB,KAAnBoS,EAAEvK,EAAEuvF,EAAEvvF,EAAE3F,OAAOkQ,KAAU,OAAM,CAAGA,GAAEA,EAAE9B,QAAS,KAAI,GAAIzK,IAAE,EAAGuC,EAAE,EAAEA,EAAEgK,EAAEvQ,SAASuG,EAAE,CAAC,GAAI0jB,GAAE1Z,EAAEhK,EAAG,IAAG0jB,IAAIA,EAAEmrE,IAAInrE,EAAE60E,SAAS5gG,EAAE,CAAC,GAAIH,GAAEksB,EAAEI,SAASzrB,EAAEqrB,EAAE2sE,IAAI3sE,EAAE0xC,GAAI1xC,GAAEssE,IAAI6I,GAAGp5F,EAAEuvF,EAAEtrE,GAAGjmB,GAAE,IAAKjG,EAAEC,KAAKY,EAAET,IAAI6F,GAAG,MAAOA,IAAG,GAAG7F,EAAEu6F,GAAI,QAASoI,IAAG96F,EAAEuK,EAAErS,GAAG,GAAGgB,EAAE8G,GAAG9H,IAAI8H,EAAEupD,EAAEvpD,EAAE9H,QAAS,KAAG8H,GAAG,kBAAmBA,GAAE06F,YAAsC,KAAM9xF,OAAM,4BAAtC5I,GAAEupD,EAAEvpD,EAAE06F,YAAY16F,GAAiD,MAAO,YAAWuJ,OAAOgB,IAAI,EAAEQ,GAAErF,WAAW1F,EAAEuK,GAAG,GAAG,QAASwwF,IAAG/6F,GAAG,GAAIuK,GAAE,IAAK,OAAO,IAAIyoF,GAAE,SAAS96F,EAAEC,IAAkC,IAA/BoS,EAAEuwF,GAAG,WAAW5iG,MAAE,KAAS8H,KAAU7H,EAAEyQ,MAAM,gCAAiCzP,EAAE,SAAS6G,GAAqB,KAAlB+K,IAAE6gB,aAAarhB,GAASvK,IAAM,QAASg7F,IAAGh7F,EAAEuK,EAAErS,EAAEC,EAAE6F,GAAGC,KAAK+iC,MAAMhhC,EAAEuK,EAAErS,EAAEC,EAAE6F,GAAgI,QAASi9F,IAAGj7F,GAAG/B,KAAKsC,EAAEP,EAAE/B,KAAKsM,EAAEtM,KAAK/F,EAAE+F,KAAK+B,EAAE,KAAK,QAASk7F,IAAGl7F,EAAEuK,GAAGtM,KAAK7F,KAAK4H,EAAE/B,KAAK5E,MAAMkR,EAA+H,QAAS4wF,IAAGn7F,GAAG,MAAGA,GAAE9H,EAAS8H,EAAE9H,EAAK8H,EAAEA,EAASm7F,GAAGn7F,EAAEA,IAAGmwF,EAAG,iCAAwC,MACpmC,QAASiL,IAAGp7F,GAAGq7F,KAAKA,GAAG,GAAIJ,IAAG,IAAIK,GAAG,IAAID,GAAGA,GAAGnjG,EAAEqjG,GAAI,IAAIhxF,EAAE,MAAKA,EAAE+wF,GAAGt7F,IAAI,CAACuK,EAAE,GAAI0wF,IAAGj7F,EAAG,IAAI9H,GAAE8H,EAAEo2F,YAAY,KAAKj+F,EAAE6H,EAAEsM,OAAOpU,EAAE,EAAGA,GAAEkjG,GAAGp7F,EAAEsM,OAAO,EAAEpU,IAAIA,EAAEqS,IAAIrS,EAAEqS,MAAMrS,EAAEqS,EAAEpS,GAAGoS,EAAEA,EAAEvK,EAAE9H,EAAEojG,GAAGt7F,GAAGuK,EAAE,MAAOA,GAAG,QAASixF,IAAGx7F,EAAEuK,GAAGtM,KAAKsM,KAAKtM,KAAK+B,KAAK/B,KAAK/F,EAAE,CAAE,IAAIA,GAAE6B,UAAUC,MAAO,IAAG,EAAE9B,EAAE,CAAC,GAAGA,EAAE,EAAE,KAAM0Q,OAAM,6BAA8B,KAAI,GAAIzQ,GAAE,EAAEA,EAAED,EAAEC,GAAG,EAAE8F,KAAKoK,IAAItO,UAAU5B,GAAG4B,UAAU5B,EAAE,QAAS,IAAG6H,EAAE,CAACA,YAAaw7F,KAAItjG,EAAE8H,EAAEsa,IAAIniB,EAAE6H,EAAEy7F,MAAMvjG,EAAE84F,EAAGhxF,GAAG7H,EAAE44F,EAAG/wF,GAAI,KAAI,GAAIhC,GAAE,EAAEA,EAAE9F,EAAE8B,OAAOgE,IAAIC,KAAKoK,IAAInQ,EAAE8F,GAAG7F,EAAE6F,KACjqB,QAAS09F,IAAG17F,GAAG,GAAGA,EAAE9H,GAAG8H,EAAEA,EAAEhG,OAAO,CAAC,IAAI,GAAIuQ,GAAE,EAAErS,EAAE,EAAEqS,EAAEvK,EAAEA,EAAEhG,QAAQ,CAAC,GAAI7B,GAAE6H,EAAEA,EAAEuK,EAAGoxF,IAAG37F,EAAEuK,EAAEpS,KAAK6H,EAAEA,EAAE9H,KAAKC,GAAGoS,IAAIvK,EAAEA,EAAEhG,OAAO9B,EAAE,GAAG8H,EAAE9H,GAAG8H,EAAEA,EAAEhG,OAAO,CAAC,GAAIgE,KAAK,KAAI9F,EAAEqS,EAAE,EAAEA,EAAEvK,EAAEA,EAAEhG,QAAQ7B,EAAE6H,EAAEA,EAAEuK,GAAGoxF,GAAG39F,EAAE7F,KAAK6H,EAAEA,EAAE9H,KAAKC,EAAE6F,EAAE7F,GAAG,GAAGoS,GAAIvK,GAAEA,EAAEhG,OAAO9B,GAC1K,QAASyjG,IAAG37F,EAAEuK,GAAG,MAAOhS,QAAOS,UAAUC,eAAejB,KAAKgI,EAAEuK,GAAI,QAASqxF,IAAE57F,EAAEuK,GAAGvK,GAAGA,EAAEmI,IAAI0zF,GAAGtxF,MAAE,IAAS,QAASuxF,IAAG97F,GAAG,MAAO+7F,IAAG/7F,EAAE,SAASA,GAAoB,MAAjBA,GAAEA,EAAEuM,SAAS,IAAW,EAAEvM,EAAEhG,OAAOgG,EAAE,IAAIA,IAAIkM,KAAK,IAAyB,QAAS8vF,IAAGh8F,GAAG,GAAIuK,GAAE,EAAgD,OAA7C0xF,IAAGj8F,EAAE,SAASA,GAAGuK,GAAGlQ,OAAO68C,aAAal3C,KAAYuK,EAAE,QAAS0xF,IAAGj8F,EAAEuK,GAAG,QAASrS,GAAEqS,GAAG,KAAKpS,EAAE6H,EAAEhG,QAAQ,CAAC,GAAI9B,GAAE8H,EAAE4iC,OAAOzqC,KAAK6F,EAAEk+F,GAAGhkG,EAAG,IAAG,MAAM8F,EAAE,MAAOA,EAAE,KAAI,cAAcjB,KAAK7E,GAAG,KAAM0Q,OAAM,oCAAoC1Q,GAAI,MAAOqS,GAAE4xF,IAAK,KAAI,GAAIhkG,GAAE,IAAI,CAAC,GAAI6F,GAAE9F,GAAG,GAAGqI,EAAErI,EAAE,GAAG+rB,EAAE/rB,EAAE,IAAIH,EAAEG,EAAE,GAAI,IAAG,KAAKH,IAAI,IAAIiG,EAAE,KAAMuM,GAAEvM,GAAG,EAAEuC,GAAG,GAAG,IAAI0jB,IAAI1Z,EAAEhK,GAAG,EAAE,IAAI0jB,GAAG,GAAG,IAAIlsB,GAAGwS,EAAE0Z,GAAG,EAAE,IAAIlsB,KACttB,QAASokG,MAAK,IAAIC,GAAG,CAACA,MAAMF,KAAM,KAAI,GAAIl8F,GAAE,EAAE,GAAGA,EAAEA,IAAIo8F,GAAGp8F,GAAG,oEAAoE4iC,OAAO5iC,GAAGk8F,GAAGE,GAAGp8F,IAAIA,EAAE,IAAIA,IAAIk8F,GAAG,oEAAoEt5D,OAAO5iC,IAAIA,IAKjP,QAASq8F,IAAGr8F,EAAEuK,GAAGtM,KAAKgmB,KAAKhmB,KAAKwN,EAAEzL,EAAE/B,KAAK3F,EAAEiS,GAAG,KAAKtM,KAAKsC,EAAEtC,KAAK+B,GAAE,EAAG/B,KAAK/F,MAAE,GAAO+F,KAAKsxF,EAAEtxF,KAAKw4F,EAAEx4F,KAAKnG,GAAE,EAAGmG,KAAK1E,EAAE,EAAE0E,KAAKsM,EAAE,KAAKtM,KAAKlG,EAAE,EAAiT,QAASukG,IAAGt8F,EAAEuK,EAAErS,GAAG8H,EAAEA,GAAE,EAAGA,EAAE9H,EAAEA,EAAE8H,EAAEO,GAAGgK,EAAEgyF,GAAGv8F,GACje,QAASw8F,IAAGx8F,GAAG,GAAGA,EAAEA,EAAE,CAAC,IAAIA,EAAEuvF,EAAE,KAAM,IAAIkN,GAAGz8F,GAAEuvF,GAAE,GAAuD,QAASmN,IAAG18F,EAAEuK,GAAGoyF,GAAG38F,EAAE,KAAKuK,MAAE,IAAQ,QAASoyF,IAAG38F,EAAEuK,EAAErS,EAAEC,GAAG6H,EAAEikB,EAAE/pB,MAAMqQ,EAAErS,EAAEC,IAAI6H,EAAEA,GAAGu8F,GAAGv8F,GAAkK,QAAS48F,IAAG58F,GAAG,MAAO68F,IAAG78F,EAAEikB,EAAE,SAASjkB,GAAG,MAAO9G,GAAE8G,EAAE,MACjZ,QAASu8F,IAAGv8F,GAAG,GAAGA,EAAEzG,GAAGyG,EAAEA,GAAG48F,GAAG58F,GAAG,CAAC,GAAIuK,GAAEvK,EAAEzG,EAAErB,EAAE4kG,GAAGvyF,EAAGrS,KAAI6S,GAAE6gB,aAAa1zB,EAAE8H,SAAU88F,IAAGvyF,IAAIvK,EAAEzG,EAAE,EAAEyG,EAAEuK,IAAIvK,EAAEuK,EAAExS,UAAWiI,GAAEuK,GAAGA,EAAEvK,EAAE9H,CAAE,KAAI,GAAIC,GAAED,GAAE,EAAG8H,EAAEikB,EAAEjqB,SAASgG,EAAElI,GAAG,CAAC,GAAIkG,GAAEgC,EAAEikB,EAAEW,QAAQrkB,EAAEvC,EAAE,GAAGimB,EAAEjmB,EAAE,EAAU,IAAPA,EAAEA,EAAE,GAAMuC,EAAEP,EAAEO,EAAE0jB,EAAE1jB,EAAE,IAAI,GAAIxI,GAAEwI,EAAEvI,KAAKgG,GAAGgC,EAAE1H,EAAEiS,OAAG,KAASxS,IAAIiI,EAAEO,EAAEP,EAAEO,IAAIxI,GAAGwS,GAAGxS,YAAa6Q,QAAO5I,EAAE9H,EAAEqS,EAAExS,IAAMi6F,EAAGznF,IAAI,kBAAoBQ,IAAEzF,SAASiF,YAAaQ,IAAEzF,WAAQnN,GAAE,EAAG6H,EAAElI,GAAE,GAAG,MAAMc,GAAG2R,EAAE3R,EAAEoH,EAAEO,GAAE,EAAGq8F,GAAG58F,KAAK9H,GAAE,IAAK8H,EAAE9H,EAAEqS,EAAEpS,IAAIJ,EAAEwxD,EAAEvpD,EAAE/H,EAAE+H,GAAE,GAAI7H,EAAEoxD,EAAEvpD,EAAE/H,EAAE+H,GAAE,GAAIuK,YAAa8xF,KAAIM,GAAGpyF,EAAExS,EAAEI,GAAGoS,EAAEksF,GAAE,GAAIlsF,EAAE/E,KAAKzN,EAAEI,IAAID,IAAIqS,EACrf,GAAIwyF,IAAGxyF,GAAGuyF,GAAGvyF,EAAEvK,GAAGuK,EAAEvK,EAAEzG,EAAEgR,EAAEvK,GAAG,QAASy8F,MAAKlN,EAAEv3F,KAAKiG,MAAuG,QAAS++F,MAAKzN,EAAEv3F,KAAKiG,MAA6F,QAAS8+F,IAAG/8F,GAAG/B,KAAK+B,EAAE+K,GAAErF,WAAW6jD,EAAEtrD,KAAK/F,EAAE+F,MAAM,GAAGA,KAAKsM,EAAEvK,EAAuE,QAASi9F,MAAKh/F,KAAKsM,GAAG,EAAG,QAAS2yF,IAAGl9F,EAAEuK,GAAGtM,KAAKsM,GAAG,EAAEtM,KAAKsM,EAAE4yF,GAAGl/F,KAAKsC,EAAEwK,GAAEqyF,WAAW,GAAIA,YAAWn/F,KAAKsM,GAAG/C,MAAMvJ,KAAKsM,GAAGtM,KAAKgmB,EAAEhmB,KAAK/F,EAAE,EAAE+F,KAAK+B,KAAK/B,KAAKnG,EAAEkI,EAAE/B,KAAK1E,EAAEgR,EAAEtM,KAAKlG,EAAEgT,GAAEsyF,WAAW,GAAIA,YAAW,IAAI71F,MAAM,IAAI81F,KAAkBA,GAAbvyF,GAAEsyF,WAAc,GAAIA,YAAWE,IAAOA,IAAIt/F,KAAK+iC,QACtpB,QAASw8D,IAAGx9F,GAAG,IAAI,GAAIuK,GAAEvK,EAAEO,EAAErI,EAAE8H,EAAEjI,EAAEI,EAAE,EAAE6F,EAAE,EAAEA,EAAEuM,EAAEvQ,QAAQ9B,EAAEC,KAAKoS,EAAEvM,IAAI,GAAGuM,EAAEvM,EAAE,IAAI,GAAGuM,EAAEvM,EAAE,IAAI,EAAEuM,EAAEvM,EAAE,GAAGA,EAAE,EAAE7F,CAAE,KAAIoS,EAAE,GAAG,GAAGA,EAAEA,IAAI,CAACvM,EAAU,EAAR9F,EAAEqS,EAAE,IAAMpS,EAAS,EAAPD,EAAEqS,EAAE,EAAK,IAAIhK,IAAW,EAARrI,EAAEqS,EAAE,OAASvM,IAAI,EAAEA,GAAG,KAAKA,IAAI,GAAGA,GAAG,IAAIA,IAAI,GAAG,EAAEimB,GAAU,EAAP/rB,EAAEqS,EAAE,MAAQpS,IAAI,GAAGA,GAAG,KAAKA,IAAI,GAAGA,GAAG,IAAIA,IAAI,IAAI,CAAED,GAAEqS,GAAGhK,EAAE0jB,EAAE,EAAE9rB,EAAS,EAAP6H,EAAEA,EAAE,GAAKhC,EAAS,EAAPgC,EAAEA,EAAE,EAAK,IAAIjI,GAAS,EAAPiI,EAAEA,EAAE,GAAKpH,EAAS,EAAPoH,EAAEA,EAAE,GAAKq0F,EAAS,EAAPr0F,EAAEA,EAAE,GAAKy9F,EAAU,EAAPz9F,EAAEA,EAAE,GAAK09F,EAAU,EAAP19F,EAAEA,EAAE,EAAgB,KAAXO,EAAS,EAAPP,EAAEA,EAAE,GAASuK,EAAE,EAAE,GAAGA,EAAEA,IAAI,CAAC,GAAIozF,KAAKxlG,IAAI,EAAEA,GAAG,KAAKA,IAAI,GAAGA,GAAG,KAAKA,IAAI,GAAGA,GAAG,MAAMA,EAAE6F,EAAE7F,EAAEJ,EAAEiG,EAAEjG,GAAG,CAAEksB,GAAEowE,EAAEoJ,GAAIpJ,EAAEqJ,EAAGn9F,EAAEA,IAAI8zF,IAAI,EAAEA,GAAG,KAAKA,IAAI,GAAGA,GAAG,KAAKA,IAClf,GAAGA,GAAG,IAAI,EAAEpwE,EAAEA,GAAS,EAANq5E,GAAG/yF,IAAM,EAAE0Z,EAAE1jB,GAAG0jB,GAAQ,EAAL/rB,EAAEqS,IAAM,GAAG,EAAEhK,EAAEm9F,EAAGA,EAAGD,EAAGA,EAAGpJ,EAAEA,EAAEz7F,EAAEqrB,EAAE,EAAErrB,EAAEb,EAAEA,EAAEiG,EAAEA,EAAE7F,EAAEA,EAAE8rB,EAAE05E,EAAG,EAAE39F,EAAEA,EAAE,GAAGA,EAAEA,EAAE,GAAG7H,EAAE,EAAE6H,EAAEA,EAAE,GAAGA,EAAEA,EAAE,GAAGhC,EAAE,EAAEgC,EAAEA,EAAE,GAAGA,EAAEA,EAAE,GAAGjI,EAAE,EAAEiI,EAAEA,EAAE,GAAGA,EAAEA,EAAE,GAAGpH,EAAE,EAAEoH,EAAEA,EAAE,GAAGA,EAAEA,EAAE,GAAGq0F,EAAE,EAAEr0F,EAAEA,EAAE,GAAGA,EAAEA,EAAE,GAAGy9F,EAAG,EAAEz9F,EAAEA,EAAE,GAAGA,EAAEA,EAAE,GAAG09F,EAAG,EAAE19F,EAAEA,EAAE,GAAGA,EAAEA,EAAE,GAAGO,EAAE,EAC9O,QAASq9F,IAAG59F,EAAEuK,EAAErS,OAAG,KAASA,IAAIA,EAAEqS,EAAEvQ,OAAQ,IAAI7B,GAAE,EAAE6F,EAAEgC,EAAE9H,CAAE,IAAGD,EAAEsS,GAAG,KAAKpS,EAAED,GAAG8H,EAAEO,EAAEvC,KAAKuM,EAAEwsC,WAAW5+C,KAAK6F,GAAGgC,EAAEuK,IAAIizF,GAAGx9F,GAAGhC,EAAE,OAAQ,KAAGixF,EAAG1kF,GAA4J,KAAM3B,OAAM,kCAArK,MAAKzQ,EAAED,GAAG,CAAC,GAAIqI,GAAEgK,EAAEpS,IAAK,MAAK,gBAAiBoI,IAAG,GAAGA,GAAG,KAAKA,GAAGA,IAAM,EAAFA,IAAM,KAAMqI,OAAM,+BAAgC5I,GAAEO,EAAEvC,KAAKuC,EAAEvC,GAAGgC,EAAEuK,IAAIizF,GAAGx9F,GAAGhC,EAAE,IAAuDgC,EAAE9H,EAAE8F,EAAEgC,EAAEikB,GAAG/rB,EAE3J,QAAS2lG,MAAKX,GAAGllG,KAAKiG,KAAK,EAAE6/F,IAA6G,QAASC,IAAG/9F,GAAG,GAAGA,EAAEy7F,GAAG,kBAAmBz7F,GAAEy7F,EAAE,MAAOz7F,GAAEy7F,GAAI,IAAGxjG,EAAE+H,GAAG,MAAOA,GAAE+O,MAAM,GAAI,IAAGkgF,EAAGjvF,GAAG,CAAC,IAAI,GAAIuK,MAAKrS,EAAE8H,EAAEhG,OAAO7B,EAAE,EAAEA,EAAED,EAAEC,IAAIoS,EAAErQ,KAAK8F,EAAE7H,GAAI,OAAOoS,GAAE,MAAOwmF,GAAG/wF,GAAG,QAASg+F,IAAGh+F,GAAG,GAAGA,EAAEsa,GAAG,kBAAmBta,GAAEsa,EAAE,MAAOta,GAAEsa,GAAI,KAAIta,EAAEy7F,GAAG,kBAAmBz7F,GAAEy7F,EAAE,CAAC,GAAGxM,EAAGjvF,IAAI/H,EAAE+H,GAAG,CAAC,GAAIuK,KAAKvK,GAAEA,EAAEhG,MAAO,KAAI,GAAI9B,GAAE,EAAEA,EAAE8H,EAAE9H,IAAIqS,EAAErQ,KAAKhC,EAAG,OAAOqS,GAAE,MAAOymF,GAAGhxF,IACnqB,QAASi+F,IAAGj+F,EAAEuK,GAAG,GAAGvK,EAAEqL,SAAS,kBAAmBrL,GAAEqL,QAAQrL,EAAEqL,QAAQd,MAAE,QAAa,IAAG0kF,EAAGjvF,IAAI/H,EAAE+H,GAAGy2F,GAAEz2F,EAAEuK,MAAE,QAAa,KAAI,GAAIrS,GAAE8lG,GAAGh+F,GAAG7H,EAAE4lG,GAAG/9F,GAAGhC,EAAE7F,EAAE6B,OAAOuG,EAAE,EAAEA,EAAEvC,EAAEuC,IAAIgK,EAAEvS,SAAK,GAAOG,EAAEoI,GAAGrI,GAAGA,EAAEqI,GAAGP,GAAkI,QAASk+F,IAAGl+F,EAAEuK,GAAG,GAAGvK,EAAE,CAACA,EAAEA,EAAE+O,MAAM,IAAK,KAAI,GAAI7W,GAAE,EAAEA,EAAE8H,EAAEhG,OAAO9B,IAAI,CAAC,GAAIC,GAAE6H,EAAE9H,GAAGgR,QAAQ,KAAKlL,EAAE,IAAK,IAAG,GAAG7F,EAAE,CAAC,GAAIoI,GAAEP,EAAE9H,GAAGkF,UAAU,EAAEjF,EAAG6F,GAAEgC,EAAE9H,GAAGkF,UAAUjF,EAAE,OAAQoI,GAAEP,EAAE9H,EAAGqS,GAAEhK,EAAEvC,EAAE6vC,mBAAmB7vC,EAAEb,QAAQ,MAAM,MAAM,MAAO,QAASghG,IAAGn+F,EAAEuK,GAAkE,GAA/DtM,KAAKsM,EAAEtM,KAAKlG,EAAEkG,KAAK/F,EAAE,GAAG+F,KAAKnG,EAAE,KAAKmG,KAAK1E,EAAE0E,KAAKgmB,EAAE,GAAGhmB,KAAKsC,GAAE,EAAMP,YAAam+F,IAAG,CAAClgG,KAAKsC,MAAE,KAASgK,EAAEA,EAAEvK,EAAEO,EAAE69F,GAAGngG,KAAK+B,EAAE9H,GAAG+F,KAAKlG,EAAEiI,EAAEjI,EAAEkG,KAAKsM,EAAEvK,EAAEuK,EAAE8zF,GAAGpgG,KAAK+B,EAAElI,GAAGmG,KAAKgmB,EAAEjkB,EAAEikB,EAAE1Z,EAAEvK,EAAEA,CAAE,IAAI9H,GAAE,GAAIomG,GAAGpmG,GAAEA,EAAEqS,EAAErS,EAAEqS,EAAEvK,IAAI9H,EAAE8H,EAAE,GAAIw7F,IAAGjxF,EAAEvK,GAAG9H,EAAEqS,EAAEA,EAAEA,GAAGg0F,GAAGtgG,KAAK/F,GAAG+F,KAAK1E,EAAEyG,EAAEzG,MAAOyG,KAAI9H,EAAEmC,OAAO2F,GAAGu5D,MAAMilC,MAAMvgG,KAAKsC,IAAIgK,EAAE6zF,GAAGngG,KAAK/F,EAAE,IAAI,IAAG,GAAI+F,KAAKlG,EAAE0mG,GAAGvmG,EAAE,IAAI,IAAI+F,KAAKsM,EAAEk0F,GAAGvmG,EAAE,IAAI,IAAG,GAAImmG,GAAGpgG,KAAK/F,EAAE,IAAI+F,KAAKgmB,EAAEw6E,GAAGvmG,EAAE,IAAI,IAAG,GAAIqmG,GAAGtgG,KAAK/F,EAAE,IAAI,IAAG,GAAI+F,KAAK1E,EAAEklG,GAAGvmG,EAAE,IAAI,MAAM+F,KAAKsC,IAAIgK,EAAEtM,KAAK+B,EAAE,GAAIs+F,IAAG,KAAK,EAAErgG,KAAKsC,IAEvgC,QAAS69F,IAAGp+F,EAAEuK,EAAErS,GAAG8H,EAAE9H,EAAEA,EAAEumG,GAAGl0F,GAAE,GAAIA,EAAEvK,EAAE9H,IAAI8H,EAAE9H,EAAE8H,EAAE9H,EAAEiF,QAAQ,KAAK,KAAK,QAASkhG,IAAGr+F,EAAEuK,GAAG,GAAGA,EAAE,CAAa,GAAZA,EAAEhB,OAAOgB,GAAM62B,MAAM72B,IAAI,EAAEA,EAAE,KAAM3B,OAAM,mBAAmB2B,EAAGvK,GAAElI,EAAEyS,MAAOvK,GAAElI,EAAE,KAAK,QAASymG,IAAGv+F,EAAEuK,EAAErS,GAAGqS,YAAa+zF,KAAIt+F,EAAEA,EAAEuK,EAAEm0F,GAAG1+F,EAAEA,EAAEA,EAAEO,KAAKrI,IAAIqS,EAAEo0F,GAAGp0F,EAAEq0F,KAAK5+F,EAAEA,EAAE,GAAIs+F,IAAG/zF,EAAE,EAAEvK,EAAEO,IAAI,QAASs+F,IAAE7+F,EAAEuK,EAAErS,GAAG8H,EAAEA,EAAEqI,IAAIkC,EAAErS,GAAG,QAAS4mG,IAAG9+F,EAAEuK,GAAG,MAAOvK,GAAEA,EAAErH,IAAI4R,GAAG,QAASw0F,IAAG/+F,GAAG,MAAOA,aAAam+F,IAAG,GAAIA,IAAGn+F,GAAG,GAAIm+F,IAAGn+F,MAAE,IAAQ,QAASg/F,IAAGh/F,EAAEuK,GAAG,GAAIrS,GAAE,GAAIimG,IAAG,SAAK,GAA4C,OAApCC,IAAGlmG,EAAE,SAAS8H,IAAI9H,EAAEqS,EAAEvK,GAAGuK,IAAIrS,EAAE+rB,EAAE1Z,GAAUrS,EACpe,QAASumG,IAAGz+F,EAAEuK,GAAG,MAAOvK,GAAEuK,EAAE00F,UAAUj/F,EAAE7C,QAAQ,OAAO,UAAU0wC,mBAAmB7tC,GAAG,GAAG,QAAS2+F,IAAG3+F,EAAEuK,EAAErS,GAAG,MAAOD,GAAE+H,IAAIA,EAAEk/F,UAAUl/F,GAAG7C,QAAQoN,EAAE40F,IAAIjnG,IAAI8H,EAAEA,EAAE7C,QAAQ,uBAAuB,QAAQ6C,GAAG,KAAK,QAASm/F,IAAGn/F,GAAqB,MAAlBA,GAAEA,EAAE+2C,WAAW,GAAS,KAAK/2C,GAAG,EAAE,IAAIuM,SAAS,KAAO,GAAFvM,GAAMuM,SAAS,IAAwE,QAAS+xF,IAAGt+F,EAAEuK,EAAErS,GAAG+F,KAAKsM,EAAEtM,KAAK+B,EAAE,KAAK/B,KAAK/F,EAAE8H,GAAG,KAAK/B,KAAKsC,IAAIrI,EACta,QAASknG,IAAGp/F,GAAGA,EAAEA,IAAIA,EAAEA,EAAE,GAAIw7F,IAAGx7F,EAAEuK,EAAE,EAAEvK,EAAE9H,GAAGgmG,GAAGl+F,EAAE9H,EAAE,SAASqS,EAAErS,GAAGmnG,GAAGr/F,EAAE6tC,mBAAmBtjC,EAAEpN,QAAQ,MAAM,MAAMjF,MAAM,QAASonG,IAAGt/F,GAAG,GAAIuK,GAAEyzF,GAAGh+F,EAAG,QAAG,KAAoBuK,EAAE,KAAM3B,OAAM,qBAAsB,IAAI1Q,GAAE,GAAIomG,IAAG,KAAK,MAAE,GAAQt+F,GAAE+9F,GAAG/9F,EAAG,KAAI,GAAI7H,GAAE,EAAEA,EAAEoS,EAAEvQ,OAAO7B,IAAI,CAAC,GAAI6F,GAAEuM,EAAEpS,GAAGoI,EAAEP,EAAE7H,EAAG62F,GAAGzuF,GAAGg/F,GAAGrnG,EAAE8F,EAAEuC,GAAG8+F,GAAGnnG,EAAE8F,EAAEuC,GAAG,MAAOrI,GAAE,QAASmnG,IAAGr/F,EAAEuK,EAAErS,GAAGknG,GAAGp/F,GAAGA,EAAE9H,EAAE,KAAKqS,EAAEi1F,GAAGx/F,EAAEuK,EAAG,IAAIpS,GAAE6H,EAAEA,EAAErH,IAAI4R,EAAGpS,IAAG6H,EAAEA,EAAEqI,IAAIkC,EAAEpS,MAAMA,EAAE+B,KAAKhC,GAAG8H,EAAEuK,GAAG,EAC9Z,QAASk1F,IAAGz/F,EAAEuK,GAAG60F,GAAGp/F,GAAGuK,EAAEi1F,GAAGx/F,EAAEuK,GAAGoxF,GAAG37F,EAAEA,EAAEuK,EAAEA,KAAKvK,EAAE9H,EAAE,KAAK8H,EAAEuK,GAAGvK,EAAEA,EAAErH,IAAI4R,GAAGvQ,OAAOgG,EAAEA,EAAEA,EAAE27F,GAAG37F,EAAEuK,EAAEA,WAAYvK,GAAEuK,EAAEA,GAAGvK,EAAE9H,IAAI8H,EAAEA,EAAEhG,OAAO,EAAEgG,EAAE9H,GAAGwjG,GAAG17F,KAAoE,QAAS0/F,IAAG1/F,EAAEuK,GAAmB,MAAhB60F,IAAGp/F,GAAGuK,EAAEi1F,GAAGx/F,EAAEuK,GAAUoxF,GAAG37F,EAAEA,EAAEuK,EAAEA,GAC6G,QAASg1F,IAAGv/F,EAAEuK,EAAErS,GAAGunG,GAAGz/F,EAAEuK,GAAG,EAAErS,EAAE8B,SAASgG,EAAE9H,EAAE,KAAK8H,EAAEA,EAAEqI,IAAIm3F,GAAGx/F,EAAEuK,GAAGqmF,EAAG14F,IAAI8H,EAAEuK,GAAGrS,EAAE8B,QACrJ,QAASwlG,IAAGx/F,EAAEuK,GAAwC,MAArCA,GAAElQ,OAAOkQ,GAAGvK,EAAEO,IAAIgK,EAAEA,EAAEzO,eAAsByO,EAAE,QAASm0F,IAAG1+F,EAAEuK,GAAGA,IAAIvK,EAAEO,IAAI6+F,GAAGp/F,GAAGA,EAAE9H,EAAE,KAAK8H,EAAEA,EAAEqL,QAAQ,SAASrL,EAAEuK,GAAG,GAAIrS,GAAEqS,EAAEzO,aAAcyO,IAAGrS,IAAIunG,GAAGxhG,KAAKsM,GAAGg1F,GAAGthG,KAAK/F,EAAE8H,KAAKA,IAAIA,EAAEO,EAAEgK,EAAG,QAASo1F,OAA0B,QAASC,IAAG5/F,GAAG,MAAOA,GAAE9H,IAAI8H,EAAE9H,EAAE8H,EAAEuK,KAAa,QAASs1F,OACtkB,QAASC,IAAG9/F,GAAG,IAAIA,EAAEO,GAAG,mBAAoB2lF,iBAAgB,mBAAoB6Z,eAAc,CAAC,IAAI,GAAIx1F,IAAG,qBAAqB,qBAAqB,iBAAiB,qBAAqBrS,EAAE,EAAEA,EAAEqS,EAAEvQ,OAAO9B,IAAI,CAAC,GAAIC,GAAEoS,EAAErS,EAAG,KAAI,MAAO,IAAI6nG,eAAc5nG,GAAG6H,EAAEO,EAAEpI,EAAE,MAAM6F,KAAK,KAAM4K,OAAM,8FAA+F,MAAO5I,GAAEO,EAAY,QAASy/F,IAAGhgG,GAAG26F,GAAE3iG,KAAKiG,MAAMA,KAAKy6D,QAAQ,GAAI8iC,IAAGv9F,KAAKw4F,EAAEz2F,GAAG,KAAK/B,KAAKsM,GAAE,EAAGtM,KAAKwN,EAAExN,KAAK+B,EAAE,KAAK/B,KAAKgmB,EAAEhmB,KAAK4gG,EAAE5gG,KAAKnG,EAAE,GAAGmG,KAAK/F,EAAE+F,KAAK28F,EAAE38F,KAAK1E,EAAE0E,KAAKsoE,GAAE,EAAGtoE,KAAKsC,EAAE,EAAEtC,KAAKhG,EAAE,KAAKgG,KAAKlG,EAAEkoG,GAAGhiG,KAAK3F,EAAE2F,KAAKiiG,GAAE,EAC1kB,QAASC,IAAGngG,EAAEuK,EAAErS,EAAEC,EAAE6F,GAAG,GAAGgC,EAAEA,EAAE,KAAM4I,OAAM,0DAA0D5I,EAAElI,EAAE,YAAYyS,EAAGrS,GAAEA,EAAEA,EAAEgV,cAAc,MAAMlN,EAAElI,EAAEyS,EAAEvK,EAAEikB,EAAE,GAAGjkB,EAAE6+F,EAAE3mG,EAAE8H,EAAEumE,GAAE,EAAGvmE,EAAEuK,GAAE,EAAGvK,EAAEA,EAAEA,EAAEy2F,EAAEz2F,EAAEy2F,EAAEz2F,IAAIogG,GAAGpgG,IAAIA,EAAEyL,EAAMm0F,GAAJ5/F,EAAEy2F,EAAKz2F,EAAEy2F,EAAM2J,IAAIpgG,EAAEA,EAAE6mC,mBAAmB0iB,EAAEvpD,EAAEyyF,GAAGzyF,EAAG,KAAI47F,GAAE57F,EAAEqgG,EAAEC,GAAGtgG,EAAE,gBAAgBA,EAAE46F,GAAE,EAAG56F,EAAEA,EAAE+vD,KAAK73D,EAAEmC,OAAOkQ,IAAG,GAAIvK,EAAE46F,GAAE,EAAG,MAAM32E,GAAwD,MAArD23E,IAAE57F,EAAEqgG,EAAEC,GAAGtgG,EAAE,sBAAsBikB,EAAE1c,cAAUg5F,IAAGvgG,EAAEikB,GAAU1Z,EAAEpS,GAAG,EAAG,IAAIoI,GAAE,GAAIi7F,IAAGx7F,EAAE04D,QAAS16D,IAAGigG,GAAGjgG,EAAE,SAASgC,EAAEuK,GAAGhK,EAAE8H,IAAIkC,EAAEvK,KAAKhC,EAAEqyF,EAAG9vF,EAAE+Z,KAAKniB,EAAE4S,GAAEy1F,UAAUj2F,YACzeQ,IAAEy1F,UAAUjQ,EAAGkQ,GAAGvoG,IAAI8F,GAAG7F,GAAGoI,EAAE8H,IAAI,eAAe,mDAAmD9H,EAAE8K,QAAQ,SAASrL,EAAEuK,GAAGtM,KAAK+B,EAAE0gG,iBAAiBn2F,EAAEvK,IAAIA,GAAGA,EAAEjI,IAAIiI,EAAEA,EAAE2gG,aAAa3gG,EAAEjI,GAAG,mBAAoBiI,GAAEA,GAAGA,EAAEA,EAAE4gG,kBAAkB5gG,EAAEkgG,IAAIlgG,EAAEA,EAAE4gG,gBAAgB5gG,EAAEkgG,EAAG,KAAIW,GAAG7gG,GAAG,EAAEA,EAAEO,IAAIP,EAAE1H,EAAEwoG,GAAG9gG,EAAEA,GAAG47F,GAAE57F,EAAEqgG,EAAEC,GAAGtgG,EAAE,oBAAoBA,EAAEO,EAAE,0BAA0BP,EAAE1H,IAAI0H,EAAE1H,GAAG0H,EAAEA,EAAE8N,QAAQ9N,EAAEO,EAAEP,EAAEA,EAAE+gG,UAAUx3C,EAAEvpD,EAAE68F,GAAG78F,IAAIA,EAAE/H,EAAE6iG,GAAG96F,EAAE68F,GAAG78F,EAAEO,EAAEP,IAAI47F,GAAE57F,EAAEqgG,EAAEC,GAAGtgG,EAAE,oBAAoBA,EAAEzG,GAAE,EAAGyG,EAAEA,EAAEsxD,KAAK/mD,GAAGvK,EAAEzG,GAAE,EAAG,MAAM0qB,GAAG23E,GAAE57F,EAAEqgG,EAAEC,GAAGtgG,EACrf,eAAeikB,EAAE1c,UAAUg5F,GAAGvgG,EAAEikB,IAAI,QAAS68E,IAAG9gG,GAAG,MAAOmkC,KAAGwtD,EAAG,IAAI,gBAAiB3xF,GAAE8N,aAAS,KAAS9N,EAAE+gG,UAAU,QAASzQ,IAAGtwF,GAAG,MAAM,gBAAgBA,EAAElE,cAA0L,QAASykG,IAAGvgG,EAAEuK,GAAGvK,EAAEuK,GAAE,EAAGvK,EAAEA,IAAIA,EAAE9H,GAAE,EAAG8H,EAAEA,EAAEghG,QAAQhhG,EAAE9H,GAAE,GAAI8H,EAAEikB,EAAE1Z,EAAE02F,GAAGjhG,GAAGkhG,GAAGlhG,GAAG,QAASihG,IAAGjhG,GAAGA,EAAEumE,IAAIvmE,EAAEumE,GAAE,EAAGq0B,GAAE56F,EAAE,YAAY46F,GAAE56F,EAAE,UAEjd,QAASmhG,IAAGnhG,GAAG,GAAGA,EAAEuK,OAAG,KAAoBk8D,GAAG,GAAGzmE,EAAEyL,EAAE,IAAI,GAAG21F,GAAGphG,IAAI,GAAGqhG,GAAGrhG,GAAG47F,GAAE57F,EAAEqgG,EAAEC,GAAGtgG,EAAE,iDAAkD,IAAGA,EAAEzG,GAAG,GAAG6nG,GAAGphG,GAAG86F,GAAG96F,EAAEyyF,GAAG,EAAEzyF,OAAQ,IAAG46F,GAAE56F,EAAE,oBAAoB,GAAGohG,GAAGphG,GAAG,CAAC47F,GAAE57F,EAAEqgG,EAAEC,GAAGtgG,EAAE,qBAAqBA,EAAEuK,GAAE,CAAG,KAAI,GAAIA,GAAE82F,GAAGrhG,EAAGA,GAAE,OAAOuK,GAAG,IAAK,KAAI,IAAK,KAAI,IAAK,KAAI,IAAK,KAAI,IAAK,KAAI,IAAK,KAAI,IAAK,MAAK,GAAIrS,IAAE,CAAG,MAAM8H,EAAE,SAAQ9H,GAAE,EAAG,GAAIC,EAAE,MAAKA,EAAED,GAAG,CAAC,GAAI8F,EAAE,IAAGA,EAAE,IAAIuM,EAAE,CAAC,GAAIhK,GAAElG,OAAO2F,EAAElI,GAAGyhE,MAAMilC,IAAI,IAAI,IAAK,KAAIj+F,GAAGwK,GAAE4e,MAAM5e,GAAE4e,KAAK3gB,SAAS,CAAC,GAAIib,GAAElZ,GAAE4e,KAAK3gB,SAASC,QAChf1I,GAAE0jB,EAAE3X,OAAO,EAAE2X,EAAEjqB,OAAO,GAAGgE,GAAGsjG,GAAGvkG,KAAKwD,EAAEA,EAAEzE,cAAc,IAAI3D,EAAE6F,EAAE,GAAG7F,EAAEyiG,GAAE56F,EAAE,YAAY46F,GAAE56F,EAAE,eAAe,CAAC,IAAI,GAAIjI,GAAE,EAAEqpG,GAAGphG,GAAGA,EAAEA,EAAEuhG,WAAW,GAAG,MAAM3oG,GAAGgjG,GAAE57F,EAAEqgG,EAAE,uBAAuBznG,EAAE2O,SAASxP,EAAE,GAAGiI,EAAEikB,EAAElsB,EAAE,KAAKspG,GAAGrhG,GAAG,IAAIihG,GAAGjhG,IAD+B,QACnBkhG,GAAGlhG,KAAK,QAASkhG,IAAGlhG,EAAEuK,GAAG,GAAGvK,EAAEA,EAAE,CAAC6gG,GAAG7gG,EAAG,IAAI9H,GAAE8H,EAAEA,EAAE7H,EAAE6H,EAAEyL,EAAE,GAAGmjF,EAAG,IAAK5uF,GAAEA,EAAE,KAAKA,EAAEyL,EAAE,KAAKlB,GAAGqwF,GAAE56F,EAAE,QAAS,KAAI9H,EAAE2uC,mBAAmB1uC,EAAE,MAAM6F,IAAIgC,EAAEA,EAAEqgG,IAAIrgG,EAAEmI,IAAIq5F,GAAG,qDAAqDxjG,EAAEuJ,YAAQ,MAC9b,QAASs5F,IAAG7gG,GAAGA,EAAEA,GAAGA,EAAE1H,IAAI0H,EAAEA,EAAE+gG,UAAU,MAAM,gBAAiB/gG,GAAE/H,IAAI8S,GAAE6gB,aAAa5rB,EAAE/H,GAAG+H,EAAE/H,EAAE,MAAM,QAASmpG,IAAGphG,GAAG,MAAOA,GAAEA,EAAEA,EAAEA,EAAE6J,WAAW,EAAE,QAASw3F,IAAGrhG,GAAG,IAAI,MAAO,GAAEohG,GAAGphG,GAAGA,EAAEA,EAAEg4B,QAAQ,EAAE,MAAMztB,GAAG,OAAO,GAAG,QAASk3F,IAAGzhG,GAAG,IAAI,MAAOA,GAAEA,EAAEA,EAAEA,EAAEmmF,aAAa,GAAG,MAAM57E,GAAG,MAAOqxF,IAAE57F,EAAEqgG,EAAE,6BAA6B91F,EAAEhD,SAAS,IACyG,QAAS+4F,IAAGtgG,EAAEuK,GAAG,MAAOA,GAAE,KAAKvK,EAAE6+F,EAAE,IAAI7+F,EAAElI,EAAE,IAAIupG,GAAGrhG,GAAG,IAAsF,QAAS0hG,IAAG1hG,GAAG,GAAIuK,MAAKrS,EAAEqS,EAAEpO,UAAUA,SAAShE,EAAE88F,GAAGj1F,GAAGhC,EAAE7B,SAASE,cAAc,UAAUkE,GAAGoyF,GAAG30F,EAAE6+F,OAAG,IAAQ54E,EAAE,GAAIo4E,IAAGsF,GAAGphG,GAAGxI,EAAE,KAAKa,EAAE,MAAM2R,EAAEuD,QAAQvD,EAAEuD,QAAQ,GACplB,OADwlB,GAAElV,IAAIb,EAAEgR,OAAOrD,WAAW,WAAWk8F,GAAG5jG,GAAE,EAAI,IAAIgC,GAAE,GAAI6hG,IAAGC,GAAG,sCAAsC3pG,EAAGqkG,IAAGv4E,GAAGq4E,GAAGr4E,GAAE,EAAGjkB,IAAIpH,GAAG2H,EAAEs8F,GAAG9kG,GAAGiG,EAAE45D,OAAO55D,EAAE6oC,mBAAmB,WAAW7oC,EAAE6L,YAAY,UAAU7L,EAAE6L,YAAY,YAAY7L,EAAE6L,aAAa+3F,GAAG5jG,EAAEuM,EAAEw3F,KAAI,EAAGhqG,GAAGksB,EAAEsiD,EAAE,QAAQvoE,EAAE85D,QAAQ,WAAW8pC,GAAG5jG,GAAE,EAAGjG,EAAG,IAAIiI,GAAE,GAAI6hG,IAAGG,GAAG,8BACnhC7pG,EAAGqkG,IAAGv4E,GAAGq4E,GAAGr4E,GAAE,EAAGjkB,IAAIO,EAAEgK,EAAE9Q,eAAe23F,EAAG7wF,GAAGrC,KAAK,kBAAkB+jG,QAAQ,UAAU1N,GAAGv2F,EAAEuC,GAAGvC,EAAE23D,IAAIs/B,GAAGj1F,GAAGkiG,GAAGhqG,GAAGiH,YAAYnB,GAAUimB,EAAE,QAASi+E,IAAGliG,GAAG,GAAIuK,EAAE,QAAOA,GAAGvK,GAAG7D,UAAUgmG,qBAAqB,UAAU,GAAG53F,EAAEvQ,OAAOuQ,EAAE,GAAGvK,EAAEykB,gBAAgB,QAASk9E,MAAK,GAAG1jG,MAAMA,KAAK00F,GAAG,CAAC,GAAI3yF,GAAE/B,KAAK00F,EAAG3yF,IAAG,UAAUA,EAAEoiG,SAASR,GAAG5hG,GAAE,EAAG/B,KAAK4+F,KAC1U,QAAS+E,IAAG5hG,EAAEuK,EAAErS,GAAG,MAAMA,GAAG6S,GAAE6gB,aAAa1zB,GAAG8H,EAAE43D,OAAOg3B,EAAG5uF,EAAE83D,QAAQ82B,EAAG5uF,EAAE6mC,mBAAmB+nD,EAAGrkF,GAAGxB,OAAOrD,WAAW,WAAW1F,GAAGA,EAAEzD,YAAYyD,EAAEzD,WAAWC,YAAYwD,IAAI,GAAiB,QAAS6hG,IAAG7hG,EAAEuK,GAAG,GAAIrS,GAAE,yBAAyB8H,EAAE,GAAIuK,KAAIrS,GAAG,KAAKqS,GAAGglF,EAAEv3F,KAAKiG,KAAK/F,GAAG+F,KAAK6O,KAAK9M,EAAU,QAASqiG,OAC/S,QAASC,MAAKrkG,KAAK+B,EAAE,GAAIuiG,gBAAetkG,KAAK4L,WAAW,EAAE5L,KAAK4oC,mBAAmB,KAAK5oC,KAAKkoF,aAAa,GAAGloF,KAAK+5B,QAAQ,EAAE/5B,KAAKsjG,WAAWtjG,KAAKukG,YAAY,KAAKvkG,KAAK+B,EAAE43D,OAAOrO,EAAEtrD,KAAK+1F,GAAG/1F,MAAMA,KAAK+B,EAAE83D,QAAQvO,EAAEtrD,KAAK80F,GAAG90F,MAAMA,KAAK+B,EAAEyiG,WAAWl5C,EAAEtrD,KAAKg2F,GAAGh2F,MAAMA,KAAK+B,EAAE+gG,UAAUx3C,EAAEtrD,KAAKi2F,GAAGj2F,MAE/O,QAASykG,IAAG1iG,EAAEuK,GAAGvK,EAAE6J,WAAWU,EAAKvK,EAAE6mC,oBAAmB7mC,EAAE6mC,qBAAmG,QAAS87D,MAAK,GAAI3iG,GAAEqgG,IAAI,OAAOl8D,OAAKy+D,IAAI,IAAIA,IAAI,YAAY7lG,KAAKiD,GAAG,QAAS6iG,MAAK,MAAO93F,IAAEhC,QAAQgC,GAAEhC,OAAOC,SAASyD,MAAM,GAAG,QAASq2F,IAAG9iG,EAAEuK,GAAGA,EAAEA,GAAGQ,GAAEhC,MAAO,IAAI7Q,GAAE,aAAc8H,KAAI9H,EAAEs9F,GAAGC,GAAGz1F,KAAKuK,EAAEvB,SAASyD,KAAKvU,EAAE,QAAS6qG,IAAG/iG,EAAEuK,GAAG,GAASpS,GAALD,IAAO,KAAIC,IAAK6H,GAAE7H,IAAKoS,GAAE1N,EAAOmD,EAAE7H,KAAT0E,EAAoB0N,EAAEpS,IAAGD,EAAEgC,KAAK/B,GAAG62F,EAAGhvF,EAAE7H,IAAI+4F,EAAGlxF,EAAE7H,GAAGoS,EAAEpS,KAAKD,EAAEgC,KAAK/B,GAAG,UAAA0E,EAAiBmD,EAAE7H,KAAI,MAAM6H,EAAE7H,IAAI,MAAMoS,EAAEpS,GAAG,EAAE4qG,GAAG/iG,EAAE7H,GAAGoS,EAAEpS,IAAI6B,QAAQ9B,EAAEgC,KAAK/B,GAAG6H,EAAE7H,KAAKoS,EAAEpS,IAAID,EAAEgC,KAAK/B,GAAGD,EAAEgC,KAAK/B,EAAG,KAAIA,IAAKoS,GAAEpS,IAAK6H,IAAG9H,EAAEgC,KAAK/B,EAAG,OAAOD,GACrqB,QAAS8qG,MAAK,GAAIhjG,GAAEqgG,IAAyF,UAArFrgG,EAAEijG,GAAGjjG,IAAIkjG,GAAG,MAAMljG,EAAEA,EAAEu5D,MAAM,sBAAsB,GAAGv5D,EAAEhG,OAAOqS,SAASrM,EAAE,GAAG,IAAI,OAAe,GAAGA,MAAMmkC,KAAIy+D,IAAI,EAAEA,IAAG,QAASO,IAAGnjG,GAA4B,MAAzBA,IAAGA,GAAGqgG,MAAKvkG,iBAAqBkE,EAAEu5D,MAAM,YAAYv5D,EAAEu5D,MAAM,UAAUv5D,EAAEu5D,MAAM,qBAAqBv5D,EAAEu5D,MAAM,eAAev5D,EAAEu5D,MAAM,kBAAkBv5D,EAAEu5D,MAAM,aAAkB,QAAS6pC,IAAGpjG,GAAGA,EAAEA,GAAG+K,GAAEhC,MAAO,KAAI/I,EAAE4kC,QAAQ,MAAMr6B,KAC3X,QAAS84F,IAAGrjG,EAAEuK,EAAErS,GAAG,GAAIC,GAAE8R,KAAKC,MAAM,IAAID,KAAK8e,UAAUxc,UAAWhC,GAAEA,GAAG,IAAIrS,EAAEA,GAAG,GAAI,IAAI8F,IAAG+K,OAAOu6F,OAAOC,YAAYrrG,GAAG,EAAEqI,GAAGwI,OAAOu6F,OAAOE,WAAWj5F,GAAG,CAAEA,IAAGwP,MAAMxP,EAAEoY,OAAOzqB,EAAEurG,IAAI,EAAEzlG,EAAEA,EAAE,EAAEmS,KAAK,EAAE5P,EAAEA,EAAE,EAAEyI,UAAS,EAAG06F,WAAU,EAAGC,WAAU,EAAGC,SAAQ,GAAI1rG,EAAEmoG,KAAIvkG,cAAc3D,IAAIoS,EAAEgkB,OAAOp2B,EAAEsT,EAAEvT,EAAE,YAAYqS,EAAEgkB,OAAO,WAAW00E,GAAG5C,OAAMwD,KAAK7jG,EAAEA,GAAG,mBAAmBuK,EAAEu5F,YAAW,GAAI5rG,EAAE8H,GAAG,IAAI7H,EAAEoS,KAAKpS,MAAM6H,EAAE+I,OAAOwB,EAAErS,YAAao9F,IAAGp9F,EAAEu9F,OAAG,KAAoBv9F,EAAEuU,KAAKvU,EAAEuU,KAAKpS,OAAOnC,IAAIA,EAAEC,EAAEo2B,QAAQr2B,EAAEq2B,OAAOvwB,IAChf,KAAIimB,IAAK9rB,GAAE,OAAO8rB,GAAG,IAAK,QAAQ,IAAK,SAAS,IAAK,MAAM,IAAK,OAAOjmB,EAAE9D,KAAK+pB,EAAE,IAAI9rB,EAAE8rB,GAAI,MAAM,KAAK,SAAS,IAAK,aAAa,KAAM,SAAQjmB,EAAE9D,KAAK+pB,EAAE,KAAK9rB,EAAE8rB,GAAG,EAAE,IAAI,GAAIA,GAAEjmB,EAAEkO,KAAK,IACuN,KADjNg4B,EAAE,YAAYA,EAAE,UAAUA,EAAE,SAASA,EAAE,SAASA,EAAE,UAAUlkC,EAAE2mB,WAAW3mB,EAAE2mB,UAAUo9E,YAAY7rG,GAAG,SAASA,GAAG+rB,EAAEjkB,EAAE7D,SAASE,cAAc,KAAKkO,YAAa+qF,KAAI/qF,YAAa+qF,MAAK/qF,EAAEA,EAAE4kF,GAAG5kF,EAAEmrF,KAAKr7F,OAAOkQ,GAAGorF,GAAG54F,KAAKwN,KAAKA,EAAE,2BAA2BA,EAAEqrF,GAAGrrF,IAAI0Z,EAAExX,KAAK+oF,GAAGjrF,GAAG0Z,EAAEnmB,aAAa,SAAS5F,GAAGC,EAAE6rG,YAAY//E,EAAEnmB,aAAa,MAC7f,cAAc3F,EAAEgE,SAASw2E,YAAY,cAAcx6E,EAAE8rG,eAAe,SAAQ,GAAG,EAAGjkG,EAAE,GAAGikB,EAAEigF,cAAc/rG,GAAG8rB,MAAM9rB,EAAE6rG,YAAY//E,EAAEjkB,EAAE+vD,KAAK,GAAG73D,EAAE+rB,GAAGjkB,EAAEw1F,GAAGjrF,GAAG0Z,IAAIkgF,IAAI14F,EAAEzL,EAAE,OAAOA,EAAE,IAAIA,EAAE7C,QAAQ,KAAK,OAAO,KAAK8mB,EAAEmgF,OAAO,KAAKrP,GAAG,2CAA2C/0F,EAAE,8CAA8CyvF,EAAGzvF,GAAG,KAAKA,EAAEg2F,GAAGh2F,GAAGikB,EAAE9nB,SAASk6D,MAAM0/B,GAAG/1F,IAAIikB,EAAE9nB,SAASyoC,UAAU3gB,EAAEjkB,EAAE+vD,KAAKylC,GAAGjrF,GAAGrS,EAAE+rB,GAAMA,EAAE,IAAIA,EAAEogF,QAAQ,MAAMtsG,IAAI,MAAOksB,GAC/a,QAASqgF,IAAGtkG,GAAG,MAAO,IAAIgzF,GAAE,SAASzoF,GAAG,QAASrS,KAAI6iG,GAAG,KAAKv1F,KAAK,WAAW,GAAIxF,IAAGA,EAAEukG,OAAgB,MAAOrsG,IAAhBqS,OAAsB,MAAOrS,OAAoD,QAASssG,MAAK,GAAIxkG,GAAE,IAAK,OAAO,IAAIgzF,GAAE,SAASzoF,GAAG,YAAYQ,GAAE5O,SAAS0N,WAAWU,KAAKvK,EAAE,WAAWuK,KAAK47D,GAAGp9D,OAAO,OAAO/I,MAAO7G,EAAE,SAASoR,GAAsB,KAAnB0vF,IAAElxF,OAAO,OAAO/I,GAASuK,IACxV,QAASk6F,MAAK,MAAOC,QAAG,IAAQF,KAAKh/F,KAAK,WAAW,MAAO,IAAIwtF,GAAE,SAAShzF,EAAEuK,GAAG,GAAIrS,GAAE6S,GAAE5O,SAAShE,EAAEuN,WAAW,WAAW6E,EAAE3B,MAAM,qCAAqC,IAAK1Q,GAAEmF,iBAAiB,cAAc,WAAWuuB,aAAazzB,GAAG6H,MAAK,OAAQyzF,GAAE7qF,MAAM,uDAAuD,QAAS87F,IAAG1kG,GAAY,MAATA,GAAEA,GAAGqgG,OAAY,UAAUsE,OAAO3kG,EAAElE,cAAcy9D,MAAM,6BAA6B,QAASqrC,MAAK,GAAI5kG,GAAE+K,GAAEhC,MAAO,KAAI,SAAS/I,GAAGA,GAAGA,EAAEyjG,KAAK,MAAMl5F,GAAG,OAAM,GAC7d,QAASs6F,MAAI,MAAO/9E,IAASszB,SAASnhD,eAAe,eAAe,cAAc6tB,GAASszB,SAASnhD,eAAe,QAAQ,OAAO,UAAU,QAAS6rG,MAAK,GAAI9kG,GAAE6kG,IAAI,OAAM,gBAAgB7kG,GAAG,SAASA,EACtM,QAASijG,IAAGjjG,GAAG,GAAIuK,GAAEvK,EAAElE,aAAc,OAAG2P,GAAElB,EAAE,WAAWkB,EAAElB,EAAE,SAASkB,EAAElB,EAAE,UAAgB,QAAWkB,EAAElB,EAAE,YAAkB,WAAckB,EAAElB,EAAE,SAASkB,EAAElB,EAAE,YAAkB,KAAQkB,EAAElB,EAAE,SAAe,OAAUkB,EAAElB,EAAE,YAAmBs5F,GAAMp4F,EAAElB,EAAE,SAAe,OAAUkB,EAAElB,EAAE,cAAoB,aAAgBkB,EAAElB,EAAE,SAAe,SAAYkB,EAAElB,EAAE,YAAYkB,EAAElB,EAAE,YAAYkB,EAAElB,EAAE,WAAWkB,EAAElB,EAAE,YAAekB,EAAElB,EAAE,aAAakB,EAAElB,EAAE,WAAWkB,EAAElB,EAAE,SAAakB,EAAElB,EAAE,WAAiB,WAAcvK,EAAEA,EAAEu5D,MAAM,qCAChf,GAAGv5D,EAAEhG,OAAcgG,EAAE,GAA4C,QAA7BkjG,GAAc,SAA0E,QAAS6B,IAAG/kG,EAAEuK,GAAGA,EAAEA,KAAM,IAAcvM,GAAV9F,KAAKC,IAAO,KAAI6F,IAAKgnG,IAAG7sG,EAAE6sG,GAAGhnG,KAAI,CAAG,KAAIA,EAAE,EAAEA,EAAEuM,EAAEvQ,OAAOgE,QAAI,KAAqB7F,EAAEoS,EAAEvM,YAAa7F,GAAEoS,EAAEvM,IAAI9F,EAAEgC,KAAKqQ,EAAEvM,IAA4F,OAAvF9F,GAAE8S,OAAOT,EAAErS,EAAEqS,EAAEvQ,SAASuQ,GAAG,qBAAqBrS,EAAE2sG,KAAI1sG,EAAE,IAAiBA,EAAd,YAAYD,EAAI+qG,GAAG5C,MAAOnoG,GAAW,WAAW8H,EAAE,IAAIuK,EAAE2B,KAAK,KAAK,QAASm0F,MAAI,MAAOt1F,IAAE4b,WAAW5b,GAAE4b,UAAUyyC,WAAW,GACrc,QAAS5+C,IAAExa,EAAEuK,GAAGvK,EAAEA,EAAE+O,MAAM,KAAKxE,EAAEA,GAAGQ,EAAE,KAAI,GAAI7S,GAAE,EAAEA,EAAE8H,EAAEhG,QAAQ,oBAAiBuQ,EAAjB,YAAA1N,EAAiB0N,KAAG,MAAMA,EAAErS,IAAIqS,EAAEA,EAAEvK,EAAE9H,GAA4B,OAAxBA,IAAG8H,EAAEhG,SAASuQ,MAAE,IAAeA,EAAE,QAAS06F,MAAK,IAAI,GAAIjlG,GAAE+K,GAAEm6F,aAAa36F,EAAE46F,IAAK,IAAGnlG,EAAE,MAAOA,GAAEuwB,QAAQhmB,EAAE,KAAKvK,EAAEwwB,WAAWjmB,IAAGo4F,QAAO53F,GAAEq6F,UAAa,MAAMltG,IAAI,OAAM,EAAG,QAASmtG,MAAK,OAAOC,MAAM,sBAAsBX,MAAMD,QAAQI,MAAMG,KAAK,QAASK,MAAK,MAAM,UAAUX,MAAM,WAAWA,KAAK,QAASA,MAAK,MAAO55F,IAAE/B,UAAU+B,GAAE/B,SAASC,UAAU,KACjc,QAASs8F,IAAGvlG,GAAY,MAATA,GAAEA,GAAGqgG,MAAW8C,GAAGnjG,IAAIijG,GAAGjjG,IAAI6jG,GAAS,QAAS2B,IAAGxlG,GAAG,WAAM,KAAqBA,EAAE,KAAK22F,GAAG32F,GAAG,QAASylG,IAAGzlG,GAAG,GAAS9H,GAALqS,IAAO,KAAIrS,IAAK8H,GAAEA,EAAE/G,eAAef,IAAI,OAAO8H,EAAE9H,QAAI,KAAS8H,EAAE9H,KAAKqS,EAAErS,GAAG8H,EAAE9H,GAAI,OAAOqS,GAAE,QAASm7F,IAAG1lG,GAAG,GAAG,OAAOA,EAAE,MAAOkmB,MAAKlI,MAAMhe,GAAG,QAASmlG,IAAGnlG,GAAG,MAAOA,IAAI,GAAGiK,KAAKC,MAAM,IAAID,KAAK8e,UAAUxc,WAAW,QAASo5F,IAAG3lG,GAAY,MAATA,GAAEA,GAAGqgG,KAAU,UAAU4C,GAAGjjG,KAAIA,EAAElE,cAAcy9D,MAAM,oBACnZ,QAASqsC,MAAK,GAAI5lG,GAAE+K,GAAE86F,MAAO,IAAG7lG,GAAGA,EAAE47F,EAAE,IAAI,GAAIrxF,KAAKvK,GAAE47F,EAAE,GAAG57F,EAAE47F,EAAErxF,GAAGg/C,EAAEvpD,EAAE47F,EAAErxF,GAAGg/C,MAAMvpD,EAAE47F,EAAErxF,GAAGiQ,EAAExa,EAAE47F,EAAErxF,GAAGiQ,MAAMxa,EAAE47F,EAAErxF,GAAGg/C,EAAEvpD,EAAE47F,EAAErxF,GAAGiQ,EAAE/R,SAASzI,EAAE8lG,GAAG,IAAI,GAAI5tG,GAAE,EAAEA,EAAE8H,EAAE8lG,GAAG9rG,OAAO9B,IAAI8H,EAAE8lG,GAAG5tG,GAAG,KAAK,QAAS6tG,MAAK,GAAI/lG,GAAE+K,GAAE4b,SAAU,QAAO3mB,GAAG,iBAAmBA,GAAEgmG,SAASV,MAAM,sBAAsBX,UAAM,KAAqB3kG,EAAEimG,YAAYjmG,EAAEgmG,OAAU,QAASE,IAAGlmG,EAAEuK,EAAErS,EAAEC,GAAG,GAAG6H,EAAEuK,EAAE,KAAM3B,OAAM,8CAA+C3K,MAAK/F,EAAE8H,EAAE/B,KAAKsM,EAAEA,EAAEvK,EAAE9H,GAAGmoG,KAAIloG,EAAEA,GAAG0sG,KAAI5mG,KAAK+B,EAAEmjG,GAAGnjG,IAAI,gBAAgB7H,EAC3a,QAASguG,MAAK,GAAInmG,GAAE+K,GAAE5O,QAAS,QAAO6D,OAAG,KAAqBA,EAAEomG,iBAAgB,WAAWpmG,EAAEomG,gBAAmB,QAASC,MAAK,GAAIrmG,GAAE+K,GAAE5O,SAASoO,EAAE,IAAK,OAAO47F,QAAOnmG,EAAEumE,KAAK,GAAIysB,GAAE,SAAS96F,GAAGqS,EAAE,WAAW47F,OAAOnmG,EAAEzC,oBAAoB,mBAAmBgN,GAAE,GAAIrS,MAAM8H,EAAE3C,iBAAiB,mBAAmBkN,GAAE,KAAOpR,EAAE,SAASjB,GAAkD,KAA/C8H,GAAEzC,oBAAoB,mBAAmBgN,GAAE,GAAUrS,IACjb,QAASouG,IAAGtmG,GAAG,IAAI,GAAIuK,GAAE,GAAI6T,MAAK/R,SAASrM,EAAE,IAAK,KAAIohC,MAAM72B,EAAE8T,aAAa,SAASthB,KAAKiD,GAAG,MAAOuK,GAAEkjC,cAAc,MAAMv1C,IAAI,MAAO,MAAoN,QAASqiB,IAAEva,EAAEuK,EAAErS,GAAGquG,GAAGhuG,OAAOC,eAAewH,EAAEuK,GAAG9R,cAAa,EAAGC,YAAW,EAAGW,MAAMnB,IAAI8H,EAAEuK,GAAGrS,EAAE,QAASsuG,IAAGxmG,EAAEuK,GAAG,GAAGA,EAAE,IAAI,GAAIrS,KAAKqS,GAAEA,EAAEtR,eAAef,IAAIqiB,GAAEva,EAAE9H,EAAEqS,EAAErS,IAAI,QAASuuG,IAAGzmG,GAAG,GAAIuK,KAAa,OAARi8F,IAAGj8F,EAAEvK,GAAUuK,EAAE,QAASm8F,IAAG1mG,GAAG,GAAS9H,GAALqS,IAAO,KAAIrS,IAAK8H,GAAEA,EAAE/G,eAAef,KAAKqS,EAAErS,GAAG8H,EAAE9H,GAAI,OAAOqS,GACnnB,QAASo8F,IAAG3mG,EAAEuK,GAAG,IAAIA,IAAIA,EAAEvQ,OAAO,OAAM,CAAG,KAAIgG,EAAE,OAAM,CAAG,KAAI,GAAI9H,GAAE,EAAEA,EAAEqS,EAAEvQ,OAAO9B,IAAI,CAAC,GAAIC,GAAE6H,EAAEuK,EAAErS,GAAI,QAAG,KAASC,GAAG,OAAOA,GAAG,KAAKA,EAAE,OAAM,EAAG,OAAM,EAAG,QAASyuG,IAAG5mG,GAAG,GAAIuK,GAAEvK,CAAE,IAAG,oBAAiBA,EAAjB,YAAAnD,EAAiBmD,KAAG,MAAMA,EAAE,CAACuK,EAAE,UAAWvK,QAAQ,KAAI,GAAI9H,KAAK8H,GAAEua,GAAEhQ,EAAErS,EAAE0uG,GAAG5mG,EAAE9H,KAAK,MAAOqS,GAAG,QAASs8F,IAAG7mG,GAAG,GAAIuK,MAAKrS,EAAE8H,EAAE8mG,IAAI3uG,EAAE6H,EAAE+mG,GAAY,IAAR/mG,EAAEA,EAAEgnG,KAAQ9uG,IAAI8H,EAAE,KAAM4I,OAAM,8BAA+B2B,GAAE08F,IAAI9uG,GAAG,KAAKoS,EAAE28F,IAAIhvG,EAAEqiB,GAAEtc,KAAKkpG,GAAGnnG,GAAGua,GAAEtc,KAAKmpG,GAAGR,GAAGr8F,IAAqG,QAAS21F,IAAElgG,EAAEuK,GAAGtM,KAAK6O,KAAKu6F,GAAGrnG,EAAE/B,KAAKsJ,QAAQgD,GAAG+8F,GAAGtnG,IAAI,GAAmI,QAASunG,IAAGvnG,GAAG,GAAIuK,GAAEvK,GAAGA,EAAE8M,IAAK,OAAOvC,GAAE,GAAI21F,IAAE31F,EAAEnN,UAAUiqG,GAAGrtG,QAAQgG,EAAEuH,SAAS,KAcvT,QAASigG,IAAGxnG,GAAG,GAAIuK,GAAEvK,EAAEynG,GAAI,QAAG,KAAqBl9F,EAAE,KAAM,IAAI21F,IAAE,uBAAwB,IAAG,gBAAkB31F,IAAG,gBAAkBA,KAAIA,EAAEvQ,OAAO,KAAM,IAAIkmG,IAAE,uBAAwBjiG,MAAK1E,EAAEgR,EAAEtM,KAAK/F,EAAE+F,KAAK+B,EAAE,KAAK/B,KAAKgmB,GAAE,CAAG,IAAI/rB,GAAE8H,EAAE0nG,GAAI,IAAGxvG,GAAG,qBAAkBA,EAAlB,YAAA2E,EAAkB3E,IAAE,CAACqS,EAAErS,EAAEyvG,GAAI,IAAIxvG,GAAED,EAAE0vG,GAAY,IAAR1vG,EAAEA,EAAE2vG,IAAO,gBAAkBt9F,IAAGA,EAAEvQ,OAAO,CAAU,GAATiE,KAAK+B,EAAEuK,MAAK,KAAqBpS,GAAG,iBAAmBA,GAAE,KAAM,IAAI+nG,IAAE,iBAAiB0H,GAAG,8CAA0D,IAAX3pG,KAAKgmB,IAAI9rB,MAAK,KAAqBD,IAAI,gBAC97BA,IAAG,gBAAkBA,KAAIA,EAAE8B,QAAQ,KAAM,IAAIkmG,IAAE,iBAAiB2H,GAAG,uDAAwD5pG,MAAK/F,EAAEA,GAAG,SAAS,CAAC,OAAG,KAAqBqS,EAAE,KAAM,IAAI21F,IAAE,iBAAiByH,GAAG,uDAAwD,QAAG,KAAqBxvG,OAAG,KAAqBD,EAAE,KAAM,IAAIgoG,IAAE,iCAAmC,QAAG,KAAqBhoG,EAAE,KAAM,IAAIgoG,IAAE,iBAAiBwH,GAAG,sDAAmE,IAAZzpG,KAAKsM,EAAE,MAASA,EAAEvK,EAAE8nG,MAAM,qBAC7ev9F,EAD6e,YAAA1N,EAC7e0N,KAAE,GAAW,iBAARA,EAAEA,EAAEw9F,MAAyBx9F,EAAEvQ,OAAOiE,KAAKsM,EAAEA,MAAO,QAAG,KAAqBA,EAAE,KAAM,IAAI21F,IAAE,iBAAiB6H,GAAG,4DAA8D,QAAG,KAAqBx9F,EAAE,KAAM,IAAI21F,IAAE,iBAAiB4H,GAAG,sDAA+D,QAAG,MAAX9nG,EAAEA,EAAEgoG,MAA+B,iBAAmBhoG,GAAE,KAAM,IAAIkgG,IAAE,iBAAiB8H,GAAG,8CAA+C,KAAI/pG,KAAKsC,IAAIP,KAAK/B,KAAKsM,IAAItM,KAAK+B,EAAE,KAAM,IAAIkgG,IAAE,iBAAiB8H,GAAG,mEACtX,QAASC,IAAGjoG,GAAG,GAAIuK,KAAKA,GAAE29F,YAAYloG,EAAEzG,EAAEgR,EAAE49F,mBAAmBnoG,EAAEO,GAAKgK,EAAE69F,mBAAmBpoG,EAAEA,KAAEuK,EAAE89F,sBAAsBroG,EAAE9H,EAAEqS,EAAE+9F,kBAAkBtoG,EAAEikB,GAAE1Z,EAAEg+F,YAAYvoG,EAAEuK,CAAE,KAAI,GAAIrS,KAAKqS,GAAE,OAAOA,EAAErS,UAAWqS,GAAErS,EAAG,OAAOqS,GAAG,QAASi+F,IAAGxoG,GAAG/B,KAAKsM,EAAEvK,EAAEyoG,IAAIC,KAAKzqG,KAAK+B,EAAEA,EAAE2oG,aAAa3oG,EAAE8mB,UAAU9mB,EAAE8mB,SAAS8hF,kBAAkB,KAAK,QAASC,IAAG7oG,GAAkB,GAAfA,EAAEA,EAAE+O,MAAM,KAAQ,GAAG/O,EAAEhG,OAAO,MAAO,KAAKgG,GAAEA,EAAE,EAAG,KAAI,GAAIuK,IAAG,EAAEvK,EAAEhG,OAAO,GAAG,EAAE9B,EAAE,EAAEA,EAAEqS,EAAErS,IAAI8H,GAAG,GAAI,KAAI,GAAI7H,GAAE+tB,KAAKlI,MAAMg+E,GAAGh8F,GAAI,IAAG7H,EAAEswG,KAAKtwG,EAAE2wG,KAAK3wG,EAAE4wG,KAAK5wG,EAAE6wG,IAAI,MAAO,IAAIR,IAAGrwG,GAAG,MAAM6F,IAAI,MAAO,MAA4Z,QAASirG,IAAGjpG,GAAG,IAAI,GAAIuK,KAAK2+F,IAAG,GAAGA,GAAG3+F,GAAG4+F,IAAInpG,EAAE,MAAOkpG,IAAG3+F,EAAG,OAAO,MAAM,QAAS6+F,IAAGppG,GAAG,GAAIuK,KAAKA,GAAE,gBAAgB8+F,GAAG9+F,EAAE,cAAc++F,GAAG/+F,EAAE,cAAcg/F,GAAGh/F,EAAE,eAAei/F,EAAG,IAAItxG,GAAE8H,GAAGA,EAAEypG,GAAI,KAAI,GAAGvxG,EAAE,MAAOqS,GAAErS,GAAG,GAAIqS,GAAErS,GAAG8H,GAAG,GAAI0pG,IAAG1pG,EAAG,QAAG,KAAqBA,EAAE2pG,IAAI,MAAO,IAAIC,IAAG5pG,GAAG,MAAM7H,IAAI,MAAO,MAAsC,QAASyxG,IAAG5pG,GAAG,GAAIuK,GAAEvK,EAAEypG,GAAI,KAAIl/F,GAAGvK,EAAE2pG,IAAI,CAAC,GAAIzxG,GAAE2wG,GAAG7oG,EAAE2pG,IAAKzxG,IAAGA,EAAE8H,IAAIuK,EAAErS,EAAE8H,GAAG,IAAIuK,EAAE,KAAM3B,OAAM,gCAAiC5I,KAAIA,EAAE6pG,UAAUtvF,GAAEtc,KAAK,aAAasM,GAAGgQ,GAAEtc,KAAK,YAAY+B,GACniD,QAAS0pG,IAAG1pG,GAAG4pG,GAAG5xG,KAAKiG,KAAK+B,GAAGA,EAAE0lG,GAAG1lG,EAAE8pG,aAAa,MAAMvvF,GAAEtc,KAAK,UAAU2oG,GAAG5mG,QAAiB,QAASqpG,IAAGrpG,GAAmB,GAAhB0pG,GAAG1xG,KAAKiG,KAAK+B,GAAM,gBAAgB/B,KAAK8rG,WAAW,KAAMnhG,OAAM,wBAAkC,QAAS2gG,IAAGvpG,GAAmB,GAAhB0pG,GAAG1xG,KAAKiG,KAAK+B,GAAM,cAAc/B,KAAK8rG,WAAW,KAAMnhG,OAAM,uBAAwB2R,IAAEtc,KAAK,WAAWA,KAAK+rG,SAAS/rG,KAAK+rG,QAAQC,OAAO,MAAe,QAASX,IAAGtpG,GAAmB,GAAhB0pG,GAAG1xG,KAAKiG,KAAK+B,GAAM,cAAc/B,KAAK8rG,WAAW,KAAMnhG,OAAM,wBACjc,QAAS4gG,IAAGxpG,GAAmB,GAAhB0pG,GAAG1xG,KAAKiG,KAAK+B,GAAM,eAAe/B,KAAK8rG,WAAW,KAAMnhG,OAAM,uBAAwB2R,IAAEtc,KAAK,WAAW+B,EAAEkqG,YAAY,MAAe,QAASC,IAAGnqG,EAAEuK,GAAG,MAAOvK,GAAEwF,KAAK,SAASxF,GAAG,GAAGA,EAAEoqG,IAAG,CAAC,GAAIlyG,GAAE2wG,GAAG7oG,EAAEoqG,IAAI,KAAIlyG,GAAGqS,GAAGrS,EAAEqS,EAAE,KAAM,IAAI21F,IAAE,gBAAiB,OAAOlgG,GAAE,KAAM,IAAIkgG,IAAE,mBAAoB/mG,EAAE,SAAS6G,GAAG,KAAMA,IAAGA,EAAE8M,MAAM9M,EAAE8M,MAAMu6F,GAAG,iBAAiB,GAAInH,IAAE,iBAAiBlgG,IAC7X,QAASqqG,IAAGrqG,EAAEuK,GAAG,GAAGA,EAAE+/F,SAAS//F,EAAE4iD,YAAY5iD,EAAE+/F,SAAS/vF,GAAEtc,KAAK,UAAUsM,EAAE+/F,SAAS//F,EAAE4iD,aAAa5yC,GAAEtc,KAAK,cAAcsM,EAAE4iD,iBAAkB,KAAG5iD,EAAEggG,aAAYhgG,EAAEigG,iBAA6F,KAAM,IAAItK,IAAE,iBAAiB,mCAAzG3lF,IAAEtc,KAAK,cAAcsM,EAAEggG,YAAYhwF,GAAEtc,KAAK,SAASsM,EAAEigG,kBAAwFjwF,GAAEtc,KAAK,aAAa+B,GAC/Q,QAASyqG,IAAGzqG,GAAG,GAAIuK,KAAyJ,OAApJvK,GAAEsqG,UAAU//F,EAAEmgG,SAAS1qG,EAAEsqG,SAAStqG,EAAEmtD,cAAc5iD,EAAEogG,aAAa3qG,EAAEmtD,aAAantD,EAAE4qG,SAASrgG,EAAEsgG,mBAAmB7qG,EAAE4qG,QAAQrgG,EAAEw/F,WAAW/pG,EAAE+pG,YAAkBe,SAASxL,GAAG/0F,GAAGgC,WAAWw+F,WAAW,oBACjE,QAASC,IAAGhrG,EAAEuK,GAAGtM,KAAKu3F,GAAGjrF,MAAMi8F,GAAGvoG,MAAM8rG,WAAW/pG,EAAEirG,iBAAgB,IAAKhtG,KAAKo0F,MAAMp0F,KAAKmzF,IAAI6X,GAAGjpG,QAAQ6wF,IAAI,KAAK5yF,KAAKkzF,GAAG,KAA4D,QAASsK,IAAEz7F,GAAGgrG,GAAGhzG,KAAKiG,KAAK+B,EAAEkrG,IAAIjtG,KAAK+B,KACxG,QAASmrG,MAAK1P,GAAEzjG,KAAKiG,KAAK,gBACvW,QAASmtG,IAAGprG,GAAG,IAAIA,EAAE,KAAM,IAAIkgG,IAAE,iBAAiB,mEAAoE,IAAI31F,GAAEvK,CAA0B,OAAxBstD,GAAEttD,KAAKuK,EAAEvK,EAAEmtD,cAAoB,GAAIg+C,KAAI9gD,WAAW,KAAK9/C,GAAG,QAAS8gG,MAAK5P,GAAEzjG,KAAKiG,KAAK,cAAuD,QAASqtG,IAAGtrG,GAAG,IAAIA,EAAE,KAAM,IAAIkgG,IAAE,iBAAiB,mEAAoE,IAAI31F,GAAEvK,CAA0B,OAAxBstD,GAAEttD,KAAKuK,EAAEvK,EAAEmtD,cAAoB,GAAIk+C,KAAIhhD,WAAW,KAAK9/C,GAC9b,QAASghG,MAAK9P,GAAEzjG,KAAKiG,KAAK,cAAcA,KAAK0xF,GAAG,WAAoD,QAAS6b,IAAGxrG,EAAEuK,GAAG,GAAIrS,GAAE8H,CAAsC,OAApCstD,GAAEttD,KAAK9H,EAAE8H,EAAEsqG,QAAQ//F,EAAEvK,EAAEmtD,cAAoB,GAAIo+C,KAAIlhD,WAAWnyD,EAAEqS,GAAG,QAASkhG,MAAKT,GAAGhzG,KAAKiG,KAAK,cAAcytG,IACzO,QAASC,IAAG3rG,EAAEuK,GAAG,GAAIrS,GAAE8H,CAA8C,IAA5CstD,EAAEp1D,KAAKA,GAAGqyG,WAAWvqG,EAAEwqG,iBAAiBjgG,KAAQrS,EAAEqyG,aAAaryG,EAAEsyG,iBAAiB,KAAM,IAAItK,IAAE,iBAAiB,+EAAgF,OAAO,IAAImK,IAAG,cAAcnyG,GAAG,QAAS0zG,IAAG5rG,EAAEuK,GAAGtM,KAAK+B,EAAEA,EAAE/B,KAAKsC,EAAEgK,EAAEgQ,GAAEtc,KAAK,aAAa,YACxL,QAAS4tG,MAAKrF,GAAGvoG,MAAM8rG,WAAW,WAAWkB,iBAAgB,IAAqC,QAASa,IAAG9rG,GAAG,KAAKA,EAAE8wF,IAAI9wF,EAAE+rG,IAAI/rG,EAAE+7F,IAAI/7F,EAAEgsG,GAAG,KAAM,IAAI9L,IAAE,iBAAkBjiG,MAAK+B,EAAEA,EAAEua,GAAEtc,KAAK,aAAa,SACL,QAASguG,IAAGjsG,GAAG,MAAOA,GAAEA,EAAE+7F,IAAI/7F,EAAEA,EAAEgsG,GAAGE,eAAelsG,EAAEA,EAAE+7F,GAAGoQ,YAAYnsG,EAAEA,EAAEgsG,IAAII,YAAYpsG,EAAEA,EAAE8wF,GAAGhkF,KAAK9M,EAAEA,EAAE+rG,IACpa,QAASM,IAAGrsG,GAAG,IAAI/B,KAAK+B,EAAEA,GAAG8mB,GAASoiD,OAAO,MAAM3+D,GAAG,KAAM,IAAI21F,IAAE,iBAAiB,qNAAsNsG,GAAGvoG,MAAM8rG,WAAW,QAAQkB,iBAAgB,IAEtP,QAASqB,IAAGtsG,EAAEuK,GAAG,IAAIvK,EAAE,KAAM,IAAIkgG,IAAE,0BAA2B,KAAI31F,EAAE,KAAM,IAAI21F,IAAE,4BAA6B,OAAO,IAAI4L,KAAIhb,GAAG9wF,EAAE+rG,GAAGxhG,IACnO,QAASgiG,IAAGvsG,GAAG,GAAGA,EAAEksG,gBAAgBlsG,EAAEmsG,YAAY,MAAO,IAAIL,KAAI/P,GAAG/7F,EAAEksG,eAAeF,EAAEhsG,EAAEmsG,aAAc,IAAI5hG,GAAEvK,GAAGA,EAAE+pG,UAAW,KAAIx/F,GAAG,aAAaA,EAAE,MAAO,KAAK,IAAIrS,GAAE8H,GAAGA,EAAEwsG,iBAAiBr0G,EAAE6H,GAAGA,EAAEwqG,gBAAiBxqG,GAAEA,GAAGA,EAAEysG,YAAa,KAAI,OAAOliG,GAAG,IAAK,aAAa,MAAOihG,IAAGxrG,EAAE9H,EAAG,KAAK,eAAe,MAAOkzG,IAAGlzG,EAAG,KAAK,aAAa,MAAOozG,IAAGpzG,EAAG,KAAK,cAAc,MAAOyzG,IAAGzzG,EAAEC,EAAG,SAAQ,MAAO,IAAIsjG,IAAElxF,GAAI8/C,WAAWrqD,EAAE9H,IAAI,MAAM8F,GAAG,MAAO,OAClb,QAAS0uG,IAAG1sG,GAAG,IAAIA,EAAEirG,gBAAgB,KAAM,IAAI/K,IAAE,0BAA4B,QAASyM,IAAG3sG,EAAEuK,EAAErS,EAAEC,EAAE6F,GAAwE,GAArEC,KAAKsM,EAAEvK,EAAE/B,KAAK/F,EAAEqS,GAAG,KAAKtM,KAAKsC,EAAErI,GAAG,KAAK+F,KAAKgmB,EAAE9rB,GAAG,KAAK8F,KAAK+B,EAAEhC,GAAG,MAAQC,KAAKsC,IAAGtC,KAAK+B,EAAkH,KAAM,IAAIkgG,IAAE,qBAA3H,IAAGjiG,KAAKsC,GAAGtC,KAAK+B,EAAE,KAAM,IAAIkgG,IAAE,qBAAsB,IAAGjiG,KAAKsC,IAAItC,KAAKgmB,EAAE,KAAM,IAAIi8E,IAAE,sBAA0L,QAAS0M,IAAG5sG,GAAW,MAARA,GAAEA,MAAaA,EAAE9B,KAAK,GAAIyuG,IAAG3sG,EAAE9B,KAAK8B,EAAE6sG,QAAQ7sG,EAAE8sG,YAAY9sG,EAAE2rD,UAAU3rD,EAAE0I,OAAO6+F,GAAGvnG,EAAE0I,QAAQ,KAAM,QAASqkG,IAAG/sG,GAAG,GAAIuK,GAAE,sBAAsBrS,MAAE,GAAOC,EAAE4mG,GAAG/+F,EAAGA,GAAE7H,EAAEoS,EAAEpS,EAAEA,EAAED,EAAE,oBAAoBC,EAAED,EAAEs3F,EAAG,qMAAqMxvF,GAAG,QAAQ7H,GAAG,SAASA,EAAED,EAAEs3F,EAAG,qKAAqKxvF,GAAGuK,EAAE,8CAC5iC21F,GAAEloG,KAAKiG,KAAKsM,EAAErS,GAAW,QAAS80G,IAAGhtG,EAAEuK,EAAErS,GAAGgoG,GAAEloG,KAAKiG,KAAK+B,EAAE9H,GAAG8H,EAAEuK,MAAMvK,EAAE4yF,IAAIr4E,GAAEtc,KAAK,QAAQ+B,EAAE4yF,IAAI5yF,EAAEgsG,GAAGzxF,GAAEtc,KAAK,cAAc+B,EAAEgsG,GAAGhsG,EAAEqqD,YAAY9vC,GAAEtc,KAAK,aAAa+B,EAAEqqD,YACnK,QAAS4iD,IAAGjtG,GAAG,GAAGA,EAAE8M,KAAK,CAAC,GAAIvC,GAAEvK,EAAE8M,MAAM,EAAG,IAAGvC,EAAErB,QAAQm+F,MAAM98F,EAAEA,EAAEnN,UAAUiqG,GAAGrtG,QAAS,IAAI9B,IAAGmyD,WAAWkiD,GAAGvsG,GAAI,IAAGA,EAAEktG,MAAMh1G,EAAE06F,GAAG5yF,EAAEktG,UAAW,KAAGltG,EAAEmsG,YAAmC,MAAO,IAAIjM,IAAE31F,EAAEvK,EAAEuH,aAAS,GAAjDrP,GAAE8zG,EAAEhsG,EAAEmsG,YAAmD,MAAO,IAAIa,IAAGziG,EAAErS,EAAE8H,EAAEuH,SAAS,MAAO,MAAM,QAAS4lG,IAAGntG,GAAG/B,KAAKsC,EAAEP,EACxR,QAASotG,IAAGptG,EAAEuK,EAAErS,GAAG,GAAIC,GAAE,QAAQ0sG,IAAyF,MAArF1sG,EAAE4S,GAAEm7E,gBAAgB/tF,GAAG2uB,GAASszB,SAAS5+C,MAAMsrB,GAASszB,SAAS5+C,KAAK0qF,gBAAqB,KAAM,IAAIga,IAAE,iBAAiB,0DAA2DjiG,MAAKsM,EAAEvK,EAAEA,EAAEuK,MAAMtM,KAAKnG,EAAEkI,EAAEqtG,qBAAqB,8CAA8CpvG,KAAKlG,EAAEiI,EAAEstG,oBAAoBC,GAAGtvG,KAAK/F,EAAEi5F,EAAGnxF,EAAEwtG,oBAAoBC,IAAIxvG,KAAKgmB,EAAEjkB,EAAE0tG,kBAAkB,8DAA8DzvG,KAAK1E,EAAEyG,EAAE2tG,iBAAiBC,GAAG3vG,KAAK+B,EACpfmxF,EAAGnxF,EAAE6tG,iBAAiBC,IAAI51G,IAAI+F,KAAK+B,EAAE,oBAAoB9H,EAAE+F,KAAK/F,EAAE,oBAAoBA,GAAG+F,KAAKsC,EAAE,GAAI8hG,IAAGpkG,KAAK3F,EAAE,GAAI60G,IAAGh1G,GAA2J,QAAS41G,IAAG/tG,EAAEuK,GAAGA,EAAEvK,EAAEA,EAAE,qBAAqBuK,QAASvK,GAAEA,EAAE,qBAAqB,QAASguG,IAAGhuG,EAAEuK,GAAGA,GAAGvK,EAAEA,EAAE,oBAAoBuK,EAAEvK,EAAE9H,EAAE,oBAAoBqS,UAAWvK,GAAEA,EAAE,0BAA2BA,GAAE9H,EAAE,qBACld,QAAS+1G,IAAGjuG,EAAEuK,EAAErS,EAAEC,EAAE6F,EAAEuC,EAAE0jB,GAAG8hF,MAAM/C,KAAKhjG,EAAEupD,EAAEvpD,EAAE/H,EAAE+H,IAAIkuG,KAAKA,GAAG,GAAIlb,GAAE,SAAShzF,EAAEuK,GAAG4jG,GAAGnuG,EAAEuK,MAAMvK,EAAEupD,EAAEvpD,EAAEuvF,EAAEvvF,IAAIA,EAAEuK,EAAErS,EAAEC,EAAE6F,EAAEuC,EAAE0jB,IAAI/rB,GAAGA,EAAE,MAEH,QAASi2G,IAAGnuG,EAAEuK,GAAG,KAAKxB,OAAOqlG,UAAUC,YAAYtjD,QAAQ/qD,QAAQ,CAAC+K,GAAEujG,IAAI,aAAavlG,OAAOqlG,UAAUC,YAAYtjD,QAAQ/qD,IAAIuK,EAAE3B,MAAM,qBAA+C8zF,IAAGgF,GAAtBxM,GAAGqZ,IAAI32C,OAAO02C,MAAc,WAAW/jG,EAAE3B,MAAM,wBAE1U,QAAS4lG,IAAGxuG,EAAEuK,GAAG,MAAO,IAAIyoF,GAAE,SAAS96F,EAAEC,GAAG,iBAAiBoS,EAAEkkG,YAAYlkG,EAAEmkG,eAAe,sBAAsBnkG,EAAEkkG,YAAYlkG,EAAEuC,KAAKmhG,GAAGjuG,EAAEA,EAAElI,EAAE,QAAQ0X,mBAAmBxP,EAAEuK,GAAG,SAASvK,GAAGA,EAAEA,EAAE0I,MAAMvQ,EAAEw2G,GAAG3uG,IAAIA,EAAE2qG,cAAc3qG,EAAE0uG,cAAcx2G,EAAE8H,GAAG7H,EAAE,GAAI+nG,IAAE,mBAAmB/nG,EAAE,GAAI+nG,IAAE,4BAA4B,OAAOZ,GAAG/0F,GAAGgC,WAAWvM,EAAE9H,EAAE8H,EAAEjI,EAAEY,OAAOR,EAAE,GAAI+nG,IAAE,qBAClW,QAAS0O,IAAG5uG,EAAEuK,EAAErS,EAAEC,EAAE6F,EAAEuC,GAAG,GAAI0jB,GAAE86E,GAAG/+F,EAAEikB,EAAE1Z,EAAGs0F,IAAE56E,EAAE,MAAMjkB,EAAEuK,GAAGhK,GAAGs+F,GAAE56E,EAAE,KAAKykF,KAAKn8F,WAAY,IAAIxU,GAAE,OAAOG,CAAE,IAAGH,EAAE,IAAI,GAAIa,KAAKT,GAAEA,EAAEc,eAAeL,IAAIimG,GAAE56E,EAAErrB,EAAET,EAAES,GAAI,OAAO,IAAIo6F,GAAE,SAASzoF,EAAEhK,GAAG0tG,GAAGjuG,EAAEikB,EAAE1X,WAAW,SAASvM,GAAGA,EAAEA,EAAE0I,MAAMnI,EAAEouG,GAAG3uG,EAAEhC,QAAQuM,EAAEvK,GAAGO,EAAE,GAAI2/F,IAAE,4BAA4BhoG,EAAEH,MAAE,GAAO4+F,GAAG8O,GAAGttG,IAAI6H,EAAEA,EAAEA,EAAEzG,EAAEZ,SAAS,QAASk2G,IAAG7uG,GAAG,IAAI8uG,GAAG/xG,KAAKiD,EAAEktG,OAAO,KAAM,IAAIhN,IAAE,iBAAkB,QAAS6O,IAAG/uG,GAAG,SAAUA,IAAG6uG,GAAG7uG,GAC3Z,QAASgvG,IAAGhvG,EAAEuK,GAAG,MAAO0kG,IAAEjvG,EAAEkvG,IAAIC,WAAW5kG,EAAE6kG,YAAY9J,KAAKzC,KAAK,qBAAqBr9F,KAAK,SAASxF,GAAG,MAAOA,GAAEqvG,mBAAmB,QAASC,IAAGtvG,GAAG,MAAOivG,IAAEjvG,EAAEuvG,OAAO/pG,KAAK,SAASxF,GAAG,MAAOA,GAAEwvG,wBAAwB,QAASC,IAAGzvG,GAAG,IAAIA,EAAEoqG,IAAG,KAAM,IAAIlK,IAAE,kBAC5P,QAASwP,IAAG1vG,GAAG,GAAGA,EAAEmsG,aAAansG,EAAEksG,gBAAgB,IAAIlsG,EAAEmsG,cAAcnsG,EAAEksG,eAAe,KAAM,IAAIhM,IAAE,sBAAuB,CAAC,IAAIlgG,EAAEosG,YAAY,KAAM,IAAIlM,IAAE,0BAA2B,KAAIlgG,EAAE8M,KAAK,KAAM,IAAIozF,IAAE,8BAC0I,QAASyP,IAAG3vG,EAAEuK,GAAG,MAAO0kG,IAAEjvG,EAAE4vG,GAAGrlG,GAAyC,QAASslG,IAAG7vG,EAAEuK,EAAErS,GAAG,MAAO+2G,IAAEjvG,EAAE8vG,IAAIxF,QAAQ//F,EAAEwlG,eAAe73G,IACzd,QAAS83G,IAAGhwG,GAAG,IAAIA,EAAE+qG,aAAa/qG,EAAE2rD,YAAY3rD,EAAE8qG,SAAS,KAAM,IAAI5K,IAAE,kBAAmB,QAAS+P,IAAGjwG,GAAG,GAAIuK,GAAE,IAAkS,IAA7RvK,EAAEkwG,kBAAkBlwG,EAAE8M,KAAK,2CAA2CvC,EAAE0iG,GAAGjtG,IAAI,oCAAoCA,EAAEyoE,cAAczoE,EAAE8M,KAAK,4BAA4BvC,EAAE0iG,GAAGjtG,IAAI,gBAAgBA,EAAEyoE,cAAczoE,EAAE8M,KAAK,uBAAuBvC,EAAE0iG,GAAGjtG,IAAIA,EAAEyoE,eAAel+D,EAAE4lG,GAAGnwG,EAAEyoE,eAAkBl+D,EAAE,KAAMA,EAAE,KAAIvK,EAAEoqG,IAAG,KAAM,IAAIlK,IAAE,kBACnb,QAASkQ,IAAGpwG,EAAEuK,GAA4B,MAAzBA,GAAE8lG,qBAAoB,EAAUpB,GAAEjvG,EAAEswG,GAAG/lG,GAAG,QAASgmG,IAAGvwG,EAAEuK,GAA4B,MAAzBA,GAAE8lG,qBAAoB,EAAUpB,GAAEjvG,EAAEwwG,GAAGjmG,GAAG,QAASkmG,IAAGzwG,EAAEuK,GAA4C,MAAzCA,GAAE8lG,qBAAoB,EAAG9lG,EAAEmmG,YAAW,EAAUzB,GAAEjvG,EAAE2wG,GAAGpmG,GAAG,QAASqmG,IAAG5wG,GAAG,IAAIA,EAAE6wG,QAAQ,KAAM,IAAI3Q,IAAE,uBAM1O,QAAS+O,IAAEjvG,EAAEuK,EAAErS,GAAG,IAAIyuG,GAAGzuG,EAAEqS,EAAEwkF,IAAI,MAAO0E,IAAE,GAAIyM,IAAE,kBAAmB,IAAmBliG,GAAf7F,EAAEoS,EAAEioF,IAAI,MAAS,OAAOjsB,IAAEruE,GAAGsN,KAAK+E,EAAE8pF,GAAG7uF,KAAK,WAAyC,MAA9B+E,GAAEumG,IAAI54G,EAAE64G,mBAAkB,GAAWnC,GAAG5uG,EAAEuK,EAAEymG,SAAS74G,EAAED,EAAEqS,EAAEmpF,GAAGnpF,EAAEynF,KAAI,KAAMxsF,KAAK,SAASxF,GAAG,MAAOhC,GAAEgC,IAAIwF,KAAK+E,EAAE6/F,GAAG5kG,KAAK,WAAW,IAAI+E,EAAE0mG,GAAG,MAAOjzG,EAAE,MAAKuM,EAAE0mG,KAAMjzG,IAAG,KAAM,IAAIkiG,IAAE,iBAAkB,OAAOliG,GAAEuM,EAAE0mG,MAAM,QAASd,IAAGnwG,GAAG,MAAO2uG,KAAIjmG,OAAO8jE,SAASjlE,QAAQvH,IAAI8M,KAAK,IAAIvF,QAAQvH,KACxZ,QAAS2uG,IAAG3uG,EAAEuK,GAAG,GAAIrS,IAAG8H,EAAE0I,OAAO1I,EAAE0I,MAAM8jE,QAAQxsE,EAAE0I,MAAM8jE,OAAO,QAAQx/D,QAAQ,GAAO7U,GAAG+4G,WAAW,kBAAkBC,iBAAiB,qBAAsB,IAAGj5G,EAAEC,EAAED,GAAG,GAAIgoG,IAAE/nG,EAAED,IAAI,KAAK,MAAOA,EAAEA,GAAE8H,EAAE0I,OAAO1I,EAAE0I,MAAMnB,SAAS,GAAGpP,GAAGi5G,qBAAqB,uBAAuBC,oBAAoB,wBAAwBC,qBAAqB,iBAAiBC,mBAAmB,gBAAgBC,qBAAqB,iBAAiBC,cAAc,gBAAgBC,iBAAiB,iBAAiBC,cAAc,gBACzfC,iBAAiB,iBAAiBC,aAAa,uBAAuBC,wBAAwB,wBAAwBC,qBAAqB,qBAAqBC,iCAAiC,4BAA4BC,wBAAwB,0BAA0BC,wBAAwB,0BAA0BC,eAAe,iBAAiBC,gBAAgB,iBAAiBC,iBAAiB,sBAAsBC,iBAAiB,sBAAsBC,iBAAiB,iBAAiBC,+BAA+B,wBACjhBC,iBAAiB,qBAAqBC,cAAc,qBAAqBC,eAAe,qBAAqBC,iBAAiB,mBAAmBC,2BAA2B,6BAA6BC,eAAe,iBAAiBC,4BAA4B,oBAAoBC,cAAc,gBAAgBC,sBAAsB,wBAAwBC,eAAe,iBAAiBC,qBAAqB,uBAAuBC,uBAAuB,yBAAyBC,aAAa,4BAC9eC,qBAAqB,uBAAuBC,qBAAqB,0BAA0BC,wBAAwB,qBAAqBC,uBAAuB,yBAAyBC,aAAa,4BAA4BC,qBAAqB,uBAAuBC,qBAAqB,0BAA0BC,eAAe,iBAAiBC,gBAAgB,eAAeC,qBAAqB,uBAAuBC,6BAA6B,2BAA2BC,sBAAsB,wBACrfC,oBAAoB,4BAA4BC,wBAAwB,0BAA0BC,kBAAkB,qBAAqBhjB,EAAGj5F,EAAEoS,OAAOA,GAAGA,EAAErS,EAAEqhE,MAAM,yBAAyB,EAAEhvD,EAAEvQ,OAAOuQ,EAAE,OAAG,EAAO,KAAI,GAAIvM,KAAK7F,GAAE,GAAG,IAAID,EAAEgR,QAAQlL,GAAG,MAAO,IAAIkiG,IAAE/nG,EAAE6F,GAAGuM,EAAoB,QAAhBA,GAAGvK,IAAIuK,EAAEi7F,GAAGxlG,IAAW,GAAIkgG,IAAE,iBAAiB31F,GACzT,QAAS8pG,IAAGr0G,GAAG,IAAI,GAAIuK,KAAK+pG,IAAG,GAAGA,GAAG/pG,GAAG9D,KAAKzG,EAAE,MAAOA,GAAEs0G,GAAG/pG,IAAImjG,iBAAiB1tG,EAAEqxF,GAAGgc,oBAAoBrtG,EAAEu0G,GAAI,OAAO,MAA8C,QAASC,IAAGx0G,GAAG/B,KAAKsM,EAAEvK,EAAE/B,KAAK+B,EAAE,KAAK/B,KAAKszF,GAAGkjB,GAAGx2G,MACnN,QAASw2G,IAAGz0G,GAAG,MAAO00G,MAAKlvG,KAAK,WAAW,MAAO,IAAIwtF,GAAE,SAASzoF,EAAErS,GAAGsiB,GAAE,6BAA6Bu1C,MAAM4kD,MAAMx4G,SAAS6N,KAAKkrC,IAAIl1C,EAAEuK,EAAEqqG,sBAAsBp6F,GAAE,4CAA4C/gB,YAAYkD,OAAOk4G,SAAS,WAAWpR,IAAI,SAAS1pF,MAAM,MAAM4I,OAAO,QAAQmyF,WAAU,GAAI,SAAS38G,GAAG,QAAS6F,KAAI4tB,aAAarrB,GAAGgK,IAAIvK,EAAEA,EAAE7H,EAAE6H,EAAEA,EAAE+0G,SAASC,gBAAe,GAAK,IAAIz0G,GAAEmF,WAAW,WAAWxN,EAAE0Q,MAAM,mBAAmBqsG,GAAGt8G,MAAOR,GAAE+8G,KAAKl3G,GAAGwH,KAAKxH,EAAE,WAAW9F,EAAE0Q,MAAM,0BACje,QAASusG,IAAGn1G,EAAEuK,GAAG,MAAOvK,GAAEuxF,GAAG/rF,KAAK,WAAW,MAAO,IAAIwtF,GAAE,SAAS96F,GAAG8H,EAAEA,EAAEsxD,KAAK/mD,EAAErM,KAAKqM,EAAErS,EAAEsiB,GAAE,iDAAiD,QAAS46F,IAAGp1G,EAAEuK,GAAGvK,EAAEuxF,GAAG/rF,KAAK,WAAWxF,EAAEA,EAAEq1G,SAAS,YAAY9qG,EAAEiQ,GAAE,+CAChN,QAASk6F,MAAK,MAAOY,MAAMA,GAAI,GAAItiB,GAAE,SAAShzF,EAAEuK,GAAG,GAAGw7F,KAAK,CAAC,GAAI7tG,GAAE,WAAW0tG,KAAKprF,GAAE,aAAa,gBAAgB5U,SAAS5F,EAAE+gG,UAAU,WAAW6E,KAAKr7F,EAAE3B,MAAM,mBAAmBkF,QAAQynG,GAAG58G,QAAS,IAAG6hB,GAAE,uBAAuBxa,QAAS,IAAGwa,GAAE,aAAatiB,QAAQ,CAAC,GAAIC,GAAE,cAAc8R,KAAKC,MAAM,IAAID,KAAK8e,UAAUxc,UAAWxB,IAAE5S,GAAG,WAAWqiB,GAAE,aAAatiB,IAAIqS,EAAE3B,MAAM,mBAAmBzQ,EAAE+8F,GAAGsgB,IAAI59C,OAAOz/D,IAAIouE,GAAEm7B,GAAGvpG,IAAIgB,EAAE,WAAWoR,EAAE3B,MAAM,yBAA0B2B,GAAE3B,MAAM,oBAAqBzP,EAAE,SAAS6G,GAC/e,KADkfs1G,IACvf,KAAWt1G,KAAM,QAASy1G,IAAGz1G,EAAEuK,EAAErS,GAAG+F,KAAKnG,EAAEkI,EAAE/B,KAAKgmB,EAAE1Z,EAAEtM,KAAK1E,EAAErB,EAAE+F,KAAKsC,EAAE,KAAKtC,KAAK+B,EAAEg/F,GAAG/gG,KAAKnG,EAAE,mBAAmB+mG,GAAE5gG,KAAK+B,EAAE,SAAS/B,KAAKgmB,GAAG46E,GAAE5gG,KAAK+B,EAAE,UAAU/B,KAAK1E,GAAG0E,KAAKsM,EAAE,KAAKtM,KAAK/F,KAA8N,QAASw9G,IAAG11G,EAAEuK,EAAErS,EAAEC,EAAE6F,GAAGC,KAAKhG,EAAE+H,EAAE/B,KAAKsxF,EAAEhlF,EAAEtM,KAAK/F,EAAEA,EAAE+F,KAAKlG,EAAEI,EAAE8F,KAAKnG,EAAEmG,KAAKgmB,EAAEhmB,KAAK1E,EAAE,KAAK0E,KAAK+B,EAAEhC,EAAEC,KAAKsC,EAAE,KAE/H,QAASo1G,IAAG31G,GAAG,IAAI,MAAO8mB,IAASsO,IAAIp1B,GAAGkpE,OAAOynB,KAAK,MAAMpmF,GAAG,UACxb,QAASqrG,IAAG51G,EAAEuK,EAAErS,EAAEC,EAAE6F,GAAGC,KAAKsxF,EAAEvvF,EAAE/B,KAAKsC,EAAEgK,EAAEtM,KAAKsM,EAAErS,EAAE+F,KAAK/F,EAAEC,GAAG,KAAK8F,KAAK1E,EAAEyE,GAAG,KAAKC,KAAKhG,EAAEgG,KAAK3F,EAAE2F,KAAKwN,EAAE,KAAKxN,KAAKgmB,KAAKhmB,KAAKlG,EAAEkG,KAAK+B,EAAE,KAClI,QAAS61G,IAAG71G,GAAG,GAAIuK,GAAEs4F,IAAK,OAAOyM,IAAGtvG,GAAGwF,KAAK,SAASxF,GAAGA,EAAE,CAAC,GAAI9H,GAAE6mG,GAAGx0F,GAAGvM,EAAE9F,EAAEA,CAAEA,GAAEA,EAAEqS,CAAE,KAAI,GAAIhK,GAAE,EAAEA,EAAEP,EAAEhG,OAAOuG,IAAI,CAAC,GAAI0jB,GAAEjkB,EAAEO,GAAOxI,EAAEG,EAAMU,EAAEoF,CAAuM,IAArM,GAAGimB,EAAE/a,QAAQ,uBAAuBnR,EAAEgnG,GAAG96E,GAAG1Z,GAAGxS,GAAG,oBAAoBa,EAAE,QAAQA,GAAG,SAASA,EAAEb,GAAE,EAAG+9G,GAAG/4G,KAAKknB,GAAGlsB,EAAEA,GAAGksB,GAAGA,EAAEA,EAAElV,MAAM,KAAK7C,KAAK,OAAOnU,EAAG,GAAIqV,QAAO,UAAU6W,EAAE,IAAIA,EAAE,KAAK,KAAMlnB,KAAKhF,IAAOA,EAAE,CAACiI,GAAE,CAAG,MAAMA,IAAGA,GAAE,EAAG,IAAIA,EAAE,KAAM,IAAI+sG,IAAGlK,QAC3X,QAASkT,IAAG/1G,GAAG,MAAGA,GAAEjI,EAASiI,EAAEjI,GAAEiI,EAAEjI,EAAEysG,KAAKh/F,KAAK,WAAW,IAAIxF,EAAE1H,EAAE,CAAC,GAAIiS,GAAEvK,EAAE9H,EAAEA,EAAE8H,EAAEzG,EAAEpB,EAAEw9G,GAAG31G,EAAEuK,GAAGvM,EAAE,GAAIy3G,IAAGz1G,EAAEuvF,EAAEvvF,EAAEO,EAAEP,EAAEuK,EAAGvM,GAAEuC,EAAEgK,EAAEvM,EAAEuM,EAAErS,EAAE8F,EAAE9F,EAAE04F,EAAGz4F,OAAO6H,EAAE1H,EAAE0F,EAAEuO,WAAWvM,EAAElI,EAAE,GAAI08G,IAAGx0G,EAAE1H,GAAG09G,GAAGh2G,KAAYA,EAAEjI,GAG/L,QAASk+G,IAAGj2G,GAAmE,MAAhEA,GAAE/H,IAAI+H,EAAEyL,EAAEzL,EAAE9H,EAAE6sG,GAAG/kG,EAAE9H,EAAEy9G,GAAG31G,EAAEuK,IAAI,KAAKvK,EAAE/H,EAAE,GAAIm1G,IAAGptG,EAAEO,EAAE8zG,GAAGr0G,EAAEzG,GAAGyG,EAAEyL,IAAWzL,EAAE/H,EACxF,QAASi+G,IAAGl2G,EAAEuK,EAAErS,EAAEC,EAAE6F,EAAEuC,EAAE0jB,EAAElsB,EAAEa,EAAEy7F,GAA+D,MAA5Dr0F,GAAE,GAAI01G,IAAG11G,EAAEuK,EAAErS,EAAEC,EAAE6F,GAAGgC,EAAEzG,EAAEgH,EAAEP,EAAEikB,EAAEA,EAAEjkB,EAAElI,EAAEC,EAAEiI,EAAEuK,EAAE4mF,EAAGv4F,GAAG,MAAMoH,EAAEO,EAAE8zF,EAASr0F,EAAEuM,WAAW,QAASypG,IAAGh2G,GAAG,IAAIA,EAAElI,EAAE,KAAM8Q,OAAM,kCAAmCwsG,IAAGp1G,EAAElI,EAAE,SAASyS,GAAG,GAAIrS,KAAK,IAAGqS,GAAGA,EAAE4rG,UAAU,CAAC,GAAIh+G,IAAE,CAAqB,KAAlBoS,EAAEqiG,GAAGriG,EAAE4rG,WAAej+G,EAAE,EAAEA,EAAE8H,EAAEikB,EAAEjqB,OAAO9B,IAAIC,EAAE6H,EAAEikB,EAAE/rB,GAAGqS,IAAIpS,CAAgC,OAA9BD,MAAKA,EAAE8/B,OAAO7/B,EAAE,MAAM,QAAeouE,GAAEruE,GAAoB,MAAjBA,GAAE8/B,OAAO,QAAeuuC,GAAEruE,KAC7W,QAASk+G,IAAGp2G,GAAG,GAAIuK,IAAGrM,KAAK,oBAAqB,OAAO63G,IAAG/1G,GAAGwF,KAAK,WAAW,MAAO2vG,IAAGn1G,EAAElI,EAAEyS,KAAK/E,KAAK,SAASxF,GAAG,GAAGA,GAAGA,EAAEhG,YAAQ,KAAqBgG,EAAE,GAAGq2G,kBAAkB,MAAOr2G,GAAE,GAAGq2G,iBAAkB,MAAMztG,WAAkG,QAAS0tG,IAAGt2G,GAAuF,GAApF/B,KAAK+B,EAAEA,GAAG8mB,GAASszB,SAASm8D,aAAazvF,GAASszB,SAASm8D,YAAYC,cAAiBv4G,KAAK+B,EAAE,KAAM,IAAIkgG,IAAE,iBAAiB,yDAAsS,QAASuW,MAAKx4G,KAAK+B,KAAwL,QAAS02G,IAAG12G,EAAEuK,EAAErS,EAAEC,EAAE6F,EAAEuC,GAAG,IAAI,GAAI0jB,KAAIlZ,GAAEq6F,UAAU,MAAMrtG,GAAGksB,GAAE,EAAG,IAAIA,EAAE,KAAM,IAAIi8E,IAAE,0BAA2BjiG,MAAKsxF,EAAEvvF,EAAE/B,KAAK1E,EAAEgR,EAAEtM,KAAKgmB,EAAE/rB,EAAE+F,KAAKlG,EAAEI,EAAE8F,KAAKhG,EAAE+F,EAAEC,KAAKsC,KAAKtC,KAAK/F,KAAK+F,KAAK+B,EAAE,EAAE/B,KAAK3F,EAAEiI,GAAGwK,GAAEq6F,UAAiB,QAASuR,IAAG32G,GAAG,MAAO,IAAIgzF,GAAE,SAASzoF,EAAErS,GAAG,GAAIC,GAAE6H,EAAE1H,EAAEy3D,KAAK/vD,EAAEuvF,EAAEvvF,EAAE/H,EAAGE,GAAE2/D,QAAQ,SAAS93D,GAAG9H,EAAE0Q,MAAM5I,EAAEuuB,OAAOqoF,aAAaz+G,EAAE0+G,gBAAgB,SAAStsG,GAAGA,EAAEA,EAAEgkB,OAAOiE,MAAO,KAAIjoB,EAAEusG,kBAAkB92G,EAAEzG,GAAGw9G,QAAQ/2G,EAAEikB,IAAI,MAAM1jB,GAAGrI,EAAEqI,KAAKpI,EAAE6+G,UAAU,SAASh3G,GAAGuK,EAAEvK,EAAEuuB,OAAOiE,WACt4C,QAASykF,IAAGj3G,GAAoB,MAAjBA,GAAElI,IAAIkI,EAAElI,EAAE6+G,GAAG32G,IAAWA,EAAElI,EAAE,QAASo/G,IAAGl3G,EAAEuK,GAAG,MAAOA,GAAE4sG,YAAYn3G,EAAEzG,GAAG,QAAS69G,IAAGp3G,EAAEuK,EAAErS,GAAG,MAAOqS,GAAEylC,aAAahwC,EAAEzG,GAAGrB,EAAE,YAAY,YAAY,QAASm/G,IAAGr3G,GAAG,MAAO,IAAIgzF,GAAE,SAASzoF,EAAErS,GAAG8H,EAAEg3G,UAAU,SAASh3G,GAAGA,GAAGA,EAAEuuB,OAAOhkB,EAAEvK,EAAEuuB,OAAOiE,QAAQjoB,KAAKvK,EAAE83D,QAAQ,SAAS93D,GAAG9H,EAAE0Q,MAAM5I,EAAEuuB,OAAOqoF,eAI/L,QAASU,IAAGt3G,GAAG,QAASuK,KAA6I,MAAzIvK,GAAEuK,EAAEwwF,GAAG,KAAKv1F,KAAK+jD,EAAEvpD,EAAEg2F,GAAGh2F,IAAIwF,KAAK,SAAS+E,GAAG,EAAEA,EAAEvQ,QAAQy8F,GAAEz2F,EAAE9H,EAAE,SAAS8H,GAAGA,EAAEuK,OAAO/E,KAAK+E,GAAGpR,EAAE,SAAS6G,GAAG,cAAcA,EAAEuH,SAASgD,MAAavK,EAAEuK,EAAEvK,EAAEuK,GAAGvK,EAAEuK,EAAEoyC,OAAO,cAAcpyC,IAAK,QAASgtG,MAAK,IAAIC,KAAK,CAAC,GAAG,QAAQ3S,KAAI,KAAM,IAAI3E,IAAE,iBAAiB,wDAAyD,MAAM,IAAIA,IAAE,2BAA4BjiG,KAAK+B,EAAEy3G,MAAM3wF,GAASszB,SAAS5+C,KAAK0pG,aAAa,QAASuS,MAAK,IAAI,GAAIz3G,GAAE+K,GAAEm6F,aAAa36F,EAAE46F,IAA2C,OAAtCnlG,KAAIA,EAAEuwB,QAAQhmB,EAAE,KAAKvK,EAAEwwB,WAAWjmB,IAAWvK,EAAE,MAAM9H,GAAG,MAAO,OACloB,QAASs/G,MAAK,GAAIx3G,GAAE,QAAQ6kG,IAA2E,MAAvE7kG,EAAEy3G,MAAMz3G,GAAG8mB,GAASszB,SAAS5+C,MAAMsrB,GAASszB,SAAS5+C,KAAK0pG,cAAmB,OAAM,CAAG,KAAI,MAAOllG,GAAEuwB,QAAQ,QAAQ,KAAKvwB,EAAEwwB,WAAW,UAAS,EAAG,MAAMjmB,GAAG,OAAM,GACvF,QAASmtG,OAAkJ,QAASC,MAAK,IAAIC,KAAK,CAAC,GAAG,QAAQ/S,KAAI,KAAM,IAAI3E,IAAE,iBAAiB,0DAA2D,MAAM,IAAIA,IAAE,2BAA4BjiG,KAAK+B,EAAE63G,MAAM/wF,GAASszB,SAAS5+C,KAAKs8G,eAAe,QAASD,MAAK,IAAI,GAAI73G,GAAE+K,GAAE+sG,eAAevtG,EAAE46F,IAA2C,OAAtCnlG,KAAIA,EAAEuwB,QAAQhmB,EAAE,KAAKvK,EAAEwwB,WAAWjmB,IAAWvK,EAAE,MAAM9H,GAAG,MAAO,OAC7kB,QAAS0/G,MAAK,GAAI53G,GAAE,QAAQ6kG,IAA6E,MAAzE7kG,EAAE63G,MAAM73G,GAAG8mB,GAASszB,SAAS5+C,MAAMsrB,GAASszB,SAAS5+C,KAAKs8G,gBAAqB,OAAM,CAAG,KAAI,MAAO93G,GAAEuwB,QAAQ,QAAQ,KAAKvwB,EAAEwwB,WAAW,UAAS,EAAG,MAAMjmB,GAAG,OAAM,GAChL,QAASwtG,MAAK,GAAI/3G,KAAKA,GAAEg4G,QAAQC,GAAGj4G,EAAEk4G,KAAKC,GAAGn4G,EAAEo4G,YAAYC,GAAGp6G,KAAK+B,EAAEA,EAAE6kG,MAAyG,QAASyT,IAAGt4G,GAAG,GAAIuK,GAAE,GAAI21F,IAAE,4BAA4BhoG,EAAE,GAAIgoG,IAAE,+BAAgClgG,GAAE,CAAC,IAAI7H,IAAKogH,IAAG,GAAGA,GAAGpgH,IAAI6H,EAAE,CAAC,GAAI7H,IAAE,CAAG,MAAM6H,GAAE7H,GAAE,EAAG,IAAIA,GAAG,gBAAkB6H,GAAE,KAAMuK,EAAE,QAAOs6F,MAAK,IAAK,cAAc,GAAG,YAAY7kG,EAAE,KAAM9H,EAAE,MAAM,KAAK,OAAO,GAAG,SAAS8H,EAAE,KAAM9H,EAAE,MAAM,SAAQ,IAAI+sG,MAAM,SAASjlG,EAAE,KAAM9H,IAChgB,QAASsgH,IAAGx4G,EAAEuK,EAAErS,EAAEC,EAAE6F,GAAGC,KAAKnG,EAAEkI,EAAE/B,KAAKgmB,EAAE1Z,EAAEtM,KAAKsoE,EAAEruE,EAAE+F,KAAKsxF,EAAEp3F,EAAE8F,KAAKwN,EAAEzN,EAAEC,KAAK+B,KAAKy4G,KAAKA,GAAG,GAAIV,KAAI/3G,EAAEy4G,EAAG,KAAI,GAAG9V,KAAK,CAAC+V,KAAKA,GAAG,GAAIhC,IAAG,yBAAyB,uBAAuB,YAAY,QAAQ,GAAI,IAAIn2G,GAAEm4G,OAAQn4G,GAAE,GAAIP,GAAEA,EAAEw3F,CAAEv5F,MAAKlG,EAAEwI,EAAE,MAAM0jB,GAAGhmB,KAAKlG,EAAE,GAAI0+G,IAAGx4G,KAAKsxF,GAAE,EAAG,IAAItxF,KAAK3F,EAAE,GAAI0H,GAAEA,EAAE2xF,GAAG,MAAM1tE,GAAGhmB,KAAK3F,EAAE,GAAIm+G,IAAGx4G,KAAKw4F,EAAE,GAAIggB,IAAGx4G,KAAK1E,EAAEgwD,EAAEtrD,KAAKhG,EAAEgG,MAAMA,KAAKsM,KAAY,QAASouG,MAAoE,MAA/DC,MAAKA,GAAG,GAAIJ,IAAG,WAAW,MAAK7S,GAAGtF,QAAMuE,MAAWW,KAAKN,OAAc2T,GACjc,QAASC,IAAG74G,EAAEuK,GAAG,OAAOA,GAAG,IAAK,UAAU,MAAOvK,GAAE1H,CAAE,KAAK,OAAO,MAAO0H,GAAEy2F,CAAE,SAAQ,MAAOz2F,GAAEjI,GAAG,QAAS+gH,IAAG94G,EAAEuK,EAAErS,GAAG,MAAO8H,GAAElI,EAAEkI,EAAEikB,EAAE1Z,EAAEnS,MAAMF,EAAE8H,EAAEikB,EAAE/rB,EAAE,IAA0E,QAAS6gH,IAAG/4G,EAAEuK,EAAErS,GAA2C,MAAxCA,GAAE4gH,GAAG94G,EAAEuK,EAAErS,GAAG,SAASqS,EAAEitF,IAAIx3F,EAAEuK,EAAErS,GAAG,MAAa2gH,GAAG74G,EAAEuK,EAAEitF,GAAGwhB,EAAE9gH,GAC1S,QAAS+gH,IAAGj5G,EAAEuK,EAAErS,EAAEC,GAAGoS,EAAEuuG,GAAG94G,EAAEuK,EAAErS,GAAG8H,EAAEyL,IAAIzL,EAAEuK,EAAEA,GAAGQ,GAAEm6F,aAAanzB,QAAQxnE,IAAI0mF,EAAGjxF,EAAEA,KAAK64G,GAAG74G,EAAE,SAASs3F,GAAGt3F,EAAEzG,GAAGyG,EAAEuvF,GAAGoT,OAAO3iG,EAAEyL,GAAGytG,GAAGl5G,IAAIA,EAAEA,EAAEuK,KAAKvK,EAAEA,EAAEuK,OAAOvK,EAAEA,EAAEuK,GAAGrQ,KAAK/B,GAAG,QAASghH,IAAGn5G,EAAEuK,EAAErS,GAAGqS,EAAEuuG,GAAG94G,EAAEo5G,GAAG,SAAS7uG,GAAGvK,EAAEA,EAAEuK,KAAKmmF,EAAG1wF,EAAEA,EAAEuK,GAAG,SAASvK,GAAG,MAAOA,IAAG9H,IAAI,GAAG8H,EAAEA,EAAEuK,GAAGvQ,cAAegG,GAAEA,EAAEuK,IAAI0mF,EAAGjxF,EAAEA,IAAIq5G,GAAGr5G,GACvS,QAASk5G,IAAGl5G,GAAGs5G,GAAGt5G,GAAGA,EAAEO,EAAEmkC,YAAY,WAAW,IAAI,GAAIn6B,KAAKvK,GAAEA,EAAE,CAAC,GAAI9H,GAAE6S,GAAEm6F,aAAanzB,QAAQxnE,GAAGpS,EAAE6H,EAAEuK,EAAEA,EAAGrS,IAAGC,IAAI6H,EAAEuK,EAAEA,GAAGrS,EAAEA,EAAE,GAAIu/F,KAAIv5F,KAAK,UAAU5D,IAAIiQ,EAAEgkB,OAAOxlB,OAAOwwG,SAASphH,EAAEgyB,SAASjyB,EAAE8H,GAAE,IAAKA,EAAE/H,EAAEC,MAAM,KAAK,QAASohH,IAAGt5G,GAAGA,EAAEO,IAAIokC,cAAc3kC,EAAEO,GAAGP,EAAEO,EAAE,MAAM,QAAS84G,IAAGr5G,GAAG64G,GAAG74G,EAAE,SAAS6uF,GAAG7uF,EAAEzG,GAAG+/G,GAAGt5G,GAEoB,QAASw5G,IAAGx5G,GAAG/B,KAAK+B,EAAEA,EAAE/B,KAAKsM,EAAEouG,KAAyC,QAASc,IAAGz5G,GAAG,MAAOA,GAAEuK,EAAE5R,IAAI+gH,GAAG15G,EAAEA,GAAGwF,KAAK,SAASxF,GAAG,MAAO4sG,IAAG5sG,KAAM,QAAS25G,MAAK17G,KAAK+B,EAAE24G,KAAM,QAASiB,IAAG55G,EAAEuK,EAAErS,EAAEC,EAAE6F,EAAEuC,EAAE0jB,GAAGhmB,KAAKsxF,EAAEvvF,EAAE/B,KAAKnG,EAAEyS,EAAEtM,KAAKlG,EAAEG,EAAE+F,KAAKhG,EAAEE,GAAG,KAAK8F,KAAK3F,EAAE2rB,GAAG,KAAKhmB,KAAK1E,EAAEgR,EAAE,IAAIrS,EAAE+F,KAAKsoE,EAAE,GAAIozC,IAAG17G,KAAKgmB,EAAE,GAAIu1F,IAAGv7G,KAAK1E,GAAG0E,KAAKsC,EAAE,KAAKtC,KAAKsM,KAAKtM,KAAKwN,EAAEzN,GAAG,IAAIC,KAAKw4F,EAAEl2F,GAAG,IAAItC,KAAK+B,EAAE/B,KAAK/F,EAAE,KAAK,QAAS2hH,IAAG75G,GAAG,MAAO,IAAIkgG,IAAE,gCAAgClgG,GAElsB,QAAS85G,MAAK,IAAI,GAAI95G,GAAE,GAAGuK,KAAK,EAAEvK,GAAGuK,EAAErQ,KAAK,iEAAiE0oC,OAAO34B,KAAKC,MAAM,GAAGD,KAAK8e,YAAY/oB,GAAI,OAAOuK,GAAE2B,KAAK,IAAI,QAAS6tG,IAAG/5G,GAAG,GAAIuK,GAAE,GAAIszF,GAAGD,IAAGrzF,EAAEvK,GAAGA,IAAK,IAAI9H,GAAE,EAAEqS,EAAE0Z,CAAE,IAAG1Z,EAAErS,EAAE0lG,GAAGrzF,EAAEyvG,GAAG,GAAGzvG,EAAErS,GAAG0lG,GAAGrzF,EAAEyvG,GAAGzvG,EAAEA,GAAGA,EAAErS,EAAE,IAAK,KAAI,GAAIC,GAAE,GAAG,IAAIA,EAAEA,IAAIoS,EAAEhK,EAAEpI,GAAK,IAAFD,EAAMA,GAAG,GAAU,KAANslG,GAAGjzF,GAAOpS,EAAED,EAAE,EAAEC,EAAEoS,EAAEzS,EAAEK,IAAI,IAAI,GAAI6F,GAAE,GAAG,GAAGA,EAAEA,GAAG,EAAEgC,EAAE9H,KAAKqS,EAAEvK,EAAE7H,IAAI6F,EAAE,GAAI,OAAO89F,IAAG97F,GAIxb,QAASi6G,IAAGj6G,EAAEuK,EAAErS,EAAEC,GAAG,GAAI6F,GAAE87G,KAAKv5G,EAAE,GAAIosG,IAAGpiG,EAAEpS,EAAE,KAAK6F,EAAE,GAAIkiG,IAAE,kBAAkBj8E,EAAEzJ,GAAE,wBAAwBzP,GAAG,IAAG,gBAAkBkZ,GAAE,KAAM,IAAIi8E,IAAE,gCAAiC,IAAInoG,GAAEyiB,GAAE,wBAAwBzP,IAAGnS,IAAK,IAAGynG,KAAIvkG,cAAcy9D,MAAM,oBAAoB3gE,EAAEshH,IAAIj2F,MAAO,KAAGo8E,KAAIvkG,cAAcy9D,MAAM,WAAwB,MAAOk6B,IAAE,GAAIyM,IAAE,+CAA5BtnG,GAAEuhH,IAAIl2F,EAAsElsB,IAAIa,EAAEwhH,eAAeriH,GAAGiG,EAAE+7G,GAAG/7G,GAAGpF,EAAE+yD,UAAU3tD,CAAE,IAAIq2F,GAAE6hB,GAAGl2G,EAAEuvF,EAAEvvF,EAAElI,EAAEkI,EAAEjI,EAAEwS,EAAErS,EAAE,KAAKC,EAAE6H,EAAE/H,EAAEW,EAAEoH,EAAE1H,EAAG,OAAO0H,GAAE2uF,KAAKnpF,KAAK,WAAW,GAAI+E,GAChgBvK,EAAEzG,CAAE,OAAOyG,GAAEumE,EAAEvmE,EAAEqI,IAAIqxG,GAAGn5G,EAAEkzF,IAAIlpF,KAAK/E,KAAK,WAAW,GAAI+E,GAAEiQ,GAAE,yCAAyCzP,GAAG,IAAG,kBAAoBR,GAAE,KAAM,IAAI21F,IAAE,gCAAiC,IAAIhoG,GAAE,IAAKqS,GAAE,SAASA,GAAG,GAAGA,EAAE,CAA6C,GAAG,mBAA/CrS,EAAEsiB,GAAE,qCAAqCzP,KAA4B,KAAM,IAAIm1F,IAAE,gCAAiChoG,GAAEm8F,OAAO,CAAoC,GAAG,mBAAtCn8F,EAAEsiB,GAAE,4BAA4BzP,KAA4B,KAAM,IAAIm1F,IAAE,gCAAiC31F,GAAE81F,KAAI91F,KAAKA,EAAEgvD,MAAM,kCAAkChvD,EAAEgvD,MAAM,iCAC9ev5D,EAAEA,EAAE9H,EAAEm8F,EAAE9pF,EAAE,SAAS,UAAU,qBAAqB,QAAS8vG,IAAGr6G,EAAEuK,GAAG,IAAI,GAAIrS,GAAE,EAAEA,EAAE8H,EAAEuK,EAAEvQ,OAAO9B,IAAI,IAAI8H,EAAEuK,EAAErS,GAAGqS,GAAG,MAAMpS,KAAK,QAASmiH,IAAGt6G,GAAoH,MAAjHA,GAAEO,IAAIP,EAAEO,EAAEP,EAAE2uF,KAAKnpF,KAAK,WAAW,MAAO,IAAIwtF,GAAE,SAASzoF,GAAG,QAASrS,GAAEC,GAAgB,MAAboS,GAAEpS,GAAG6H,EAAE0wF,GAAGx4F,IAAS,EAAG8H,EAAE6vF,GAAG33F,GAAGqiH,GAAGv6G,QAAeA,EAAEO,EAAE,QAASi6G,IAAGx6G,GAAG,GAAIuK,GAAE,IAAK,OAAOkvG,IAAGz5G,EAAEikB,GAAGze,KAAK,SAAStN,GAAa,MAAVqS,GAAErS,EAAEA,EAAE8H,EAAEikB,EAAS80F,GAAG7gH,EAAEqS,EAAEmvG,GAAGxhH,EAAE8H,KAAKwF,KAAK,WAAW,MAAO+E,KACvX,QAASgwG,IAAGv6G,GAAG,QAASuK,GAAEA,GAAGvM,GAAE,EAAGuC,GAAGA,EAAEo8C,SAAS69D,GAAGx6G,GAAGwF,KAAK,SAAStN,GAAG,GAAI8F,GAAE7F,CAAE,IAAGD,GAAGqS,GAAGA,EAAE2qC,IAAI,CAACl3C,EAAE,IAAK,IAAIuC,GAAEgK,EAAE2qC,IAAQjxB,EAAE86E,GAAGx+F,GAAGxI,EAAE+mG,GAAG76E,EAAE,QAAQrrB,EAAEkmG,GAAGC,GAAGhnG,GAAG,OAAQksB,GAAE66E,GAAG76E,EAAE,gBAAgB1jB,EAAEu+F,GAAGC,GAAG96E,GAAG,SAASA,GAAGrrB,GAAGb,GAAGwI,GAAG,GAAGA,EAAE2I,QAAQ,uBAAuBlL,EAAE+gG,GAAGx+F,GAAGvC,EAAE0nG,GAAG5G,GAAG9gG,EAAE,kBAAkB,MAAMA,GAAGA,EAAE,qBAAkBA,EAAlB,YAAAnB,EAAkBmB,IAAEupG,GAAGvpG,GAAG,MAAM,GAAI2uG,IAAGz0G,EAAEqS,EAAErS,EAAEA,EAAE,KAAK,KAAK8F,GAAG,GAAI2uG,IAAGz0G,EAAEqS,EAAErS,EAAEA,EAAEqI,EAAErI,EAAE+rB,IAAIjmB,EAAEA,GAAG7F,EAAEkiH,GAAGr6G,EAAEhC,KAAK,GAAI9F,GAAEsiB,GAAE,2BAA2BzP,GAAG,IAAG,kBAAoB7S,GAAE,KAAM,IAAIgoG,IAAE,gCACzd,IAAI/nG,GAAE,GAAIw0G,IAAG,UAAU,KAAK,KAAK,KAAK,GAAIzM,IAAE,kBAAkBliG,GAAE,EAAGuC,EAAEw6F,GAAG/6F,EAAEyL,GAAGjG,KAAK,WAAW,MAAOg1G,IAAGx6G,GAAGwF,KAAK,WAAWxH,GAAGq8G,GAAGr6G,EAAE7H,OAAO8rB,EAAElZ,GAAE0vG,aAAc1vG,IAAE0vG,cAAc,SAASz6G,GAA4F,GAAzF,GAAGA,EAAElE,cAAcoN,QAAQsR,GAAE,wBAAwBzP,IAAGjP,cAAc,QAAQyO,GAAG2qC,IAAIl1C,IAAO,kBAAoBikB,GAAE,IAAIA,EAAEjkB,GAAG,MAAMpH,GAAGsP,QAAQQ,MAAM9P,KAAKV,EAAE,KAAKqS,GACrH,QAASmwG,IAAG16G,GAAG/B,KAAK+B,EAAEA,EAAE/B,KAAKsM,EAAEouG,KAAiD,QAASgC,IAAG36G,GAAG,MAAOA,GAAEuK,EAAElC,IAAIuyG,GAAG,UAAU56G,EAAEA,GAAG,QAAS66G,IAAG76G,GAAG,MAAO+4G,IAAG/4G,EAAEuK,EAAEqwG,GAAG56G,EAAEA,GAAG,QAAS86G,IAAG96G,GAAG,MAAOA,GAAEuK,EAAE5R,IAAIiiH,GAAG56G,EAAEA,GAAGwF,KAAK,SAASxF,GAAG,MAAM,WAAWA,IAAK,QAAS+6G,IAAG/6G,EAAEuK,EAAErS,GAAG+F,KAAKwN,EAAEzL,EAAE/B,KAAKlG,EAAEwS,EAAEtM,KAAKsxF,EAAEr3F,EAAE+F,KAAK1E,KAAK0E,KAAKsC,GAAE,EAAGtC,KAAKnG,EAAEyxD,EAAEtrD,KAAKhG,EAAEgG,MAAMA,KAAK/F,EAAE,GAAI8iH,IAAG/8G,KAAK3F,EAAE,GAAI2iH,IAAGh9G,KAAKgmB,EAAE,GAAIy2F,IAAGz8G,KAAKlG,EAAE,IAAIkG,KAAKsxF,GAAGtxF,KAAKsM,KAAKtM,KAAKsM,EAAE2wG,QAAQj9G,KAAK/F,EAAE+F,KAAKsM,EAAE4wG,kBAAkBl9G,KAAK/F,EAAE+F,KAAKsM,EAAE6wG,gBAAgBn9G,KAAK/F,EAAE+F,KAAKsM,EAAE8wG,kBAAkBp9G,KAAK/F,EAAE+F,KAAKsM,EAAE+wG,eAAer9G,KAAK3F,EAAE2F,KAAKsM,EAAEgxG,aAAat9G,KAAK3F,EAAE2F,KAAKsM,EAAEixG,eAAev9G,KAAK3F,EAAE2F,KAAK+B,EAAEy7G,GAAGx9G,KAAKwN,EAAExN,KAAKlG,EAAEkG,KAAKsxF,EAAEmsB,IACz1B,QAASD,IAAGz7G,EAAEuK,EAAErS,EAAEC,GAAG,GAAI6F,GAAE8oB,GAASynB,aAAa,IAAK,OAAOm2D,MAAK,GAAIkV,IAAG55G,EAAEuK,EAAErS,EAAE8F,MAAE,OAAO,GAAO7F,GAAG,GAAIy9G,IAAG51G,EAAEuK,EAAErS,EAAE8F,EAAE7F,GAA8F,QAASwjH,IAAG37G,GAAGA,EAAEO,IAAIP,EAAEO,GAAE,EAAGP,EAAEA,EAAE6vF,GAAG7vF,EAAElI,GAAI,IAAIyS,GAAEvK,EAAEA,CAAE,OAAOA,GAAEA,EAAE2uF,KAAKx1F,EAAE,SAASjB,GAAqB,KAAlB8H,GAAEA,GAAGuK,GAAGvK,EAAEghC,QAAc9oC,IAAK,QAAS0jH,IAAG57G,GAAGA,EAAEA,EAAE6yF,MAAM8oB,GAAG37G,GAAG7G,EAAE,SAASoR,GAAG,GAAIrS,GAAE,GAAIy0G,IAAG,UAAU,KAAK,KAAK,KAAK,GAAIzM,IAAE,+CAAgD2b,IAAGtxG,IAAIvK,EAAE/H,EAAEC,KAAK8H,EAAEA,EAAEuyF,MAAMupB,GAAG97G,EAAE9H,GAEtM,QAAS6jH,IAAG/7G,EAAEuK,EAAErS,EAAEC,EAAE6F,EAAEuC,GAAG,MAAOP,GAAEA,EAAEsyF,GAAG/nF,EAAErS,EAAEC,EAAE,WAAW6H,EAAEO,IAAIP,EAAEO,GAAE,EAAGP,EAAEA,EAAE6vF,GAAG7vF,EAAElI,KAAK,WAAWkI,EAAEghC,SAAShjC,EAAEuC,GAAG,QAASs7G,IAAG77G,GAAG,SAAOA,GAAG,0BAA0BA,EAAE8M,MAElc,QAASkvG,IAAGh8G,EAAEuK,EAAErS,GAAG,GAAIC,GAAEoS,EAAE,IAAIrS,CAA+B,OAA7B+jH,IAAG9jH,KAAK8jH,GAAG9jH,GAAG,GAAI4iH,IAAG/6G,EAAEuK,EAAErS,IAAW+jH,GAAG9jH,GAAG,QAAS6iH,MAAK/8G,KAAKsM,EAAE,KAAKtM,KAAKsC,KAAKtC,KAAK/F,KAAK+F,KAAK+B,EAAE,KAAK/B,KAAKgmB,GAAE,EAC4O,QAAS63F,IAAG97G,GAAGA,EAAEikB,IAAIjkB,EAAEikB,GAAE,EAAGi4F,GAAGl8G,GAAE,EAAG,KAAK,OACja,QAASm8G,IAAGn8G,EAAEuK,EAAErS,GAAGA,EAAEA,EAAE43F,GAAGvlF,EAAEA,EAAEA,EAAErS,EAAG,IAAIC,GAAEoS,EAAEhK,EAAEvC,EAAEuM,EAAE0Z,EAAE1jB,IAAIgK,EAAEA,EAAEgvD,MAAM,YAAa,OAAOrhE,GAAEC,EAAE6F,GAAGwH,KAAK,SAAS+E,GAAG2xG,GAAGl8G,EAAEO,EAAEgK,EAAE,QAAQpR,EAAE,SAASoR,GAAG2xG,GAAGl8G,EAAEO,EAAE,KAAKgK,KAAK,QAAS6xG,IAAGp8G,EAAEuK,GAA+B,GAA5BvK,EAAEuK,EAAE,WAAW,MAAOkpF,IAAElpF,IAAOvK,EAAE9H,EAAE8B,OAAO,IAAI,GAAI9B,GAAE,EAAEA,EAAE8H,EAAE9H,EAAE8B,OAAO9B,IAAI8H,EAAE9H,EAAEA,GAAGqS,GAAG,QAAS8xG,IAAGr8G,EAAEuK,GAA+B,GAA5BvK,EAAEuK,EAAE,WAAW,MAAOg8D,IAAEh8D,IAAOvK,EAAEO,EAAEvG,OAAO,IAAI,GAAI9B,GAAE,EAAEA,EAAE8H,EAAEO,EAAEvG,OAAO9B,IAAI8H,EAAEO,EAAErI,GAAGqS,GAAG,QAAS2xG,IAAGl8G,EAAEuK,EAAErS,EAAEC,GAAGoS,EAAEpS,EAAEikH,GAAGp8G,EAAE7H,GAAGkkH,GAAGr8G,EAAE9H,GAAGmkH,GAAGr8G,GAAGs8G,KAAK,OAAOt8G,EAAEO,KAAKP,EAAE9H,KAC7S,QAASqkH,IAAGv8G,GAAG,GAAIuK,GAAE,GAAI21F,IAAE,UAAWlgG,GAAEA,GAAGA,EAAEA,EAAE28C,SAAS38C,EAAEA,EAAE+6F,GAAGyhB,GAAG7jH,OAAO6M,KAAK,WAAWxF,EAAEuK,GAAG2xG,GAAGl8G,GAAE,EAAG,KAAKuK,KAAK,QAAS0wG,OACjP,QAASwB,IAAGz8G,EAAEuK,GAAG,GAAIrS,GAAE8H,EAAE9H,EAAEC,EAAE6H,EAAEuK,CAAE,OAAOA,GAAEulF,GAAG33F,EAAED,GAAG8H,EAAEO,EAAEP,EAAEikB,GAAGze,KAAK,SAASxF,GAAGuK,EAAEykF,GAAG72F,EAAE6H,EAAE,KAAK9H,KAAKiB,EAAE,SAAS6G,GAAGuK,EAAEykF,GAAG72F,EAAE,KAAK6H,EAAE9H,KAAM,QAASwkH,IAAG18G,EAAEuK,GAAGtM,KAAK+B,EAAEuK,EAAEgQ,GAAEtc,KAAK,iBAAiB+B,GAAkF,QAAS28G,IAAG38G,EAAEuK,EAAErS,EAAEC,GAAG,MAAO,IAAIk0G,IAAGrsG,GAAI+wF,GAAGxmF,EAAErS,GAAGsN,KAAK,SAASxF,GAAG,MAAO,IAAI08G,IAAG18G,EAAE7H,KAAM,QAASykH,IAAG58G,EAAEuK,EAAErS,EAAEC,EAAE6F,EAAEuC,GAAqF,GAAlFtC,KAAK1E,EAAEyG,EAAE/B,KAAKnG,EAAEyS,EAAEtM,KAAKgmB,EAAE/rB,EAAE+F,KAAK/F,EAAEC,EAAE8F,KAAKsC,EAAEvC,EAAEC,KAAKlG,IAAIwI,EAAEtC,KAAKsM,EAAE,KAAKtM,KAAK+B,EAAE/B,KAAK/F,EAAK+F,KAAKsC,EAAEtC,KAAK/F,EAAE,KAAM0Q,OAAM,2DAAqH,QAASi0G,IAAG78G,EAAEuK,GAAG,MAAGA,IAASvK,EAAEA,EAAEA,EAAE9H,EAAE8H,EAAEikB,MAAI1Z,EAAEvK,EAAEA,EAAEA,EAAEA,GAAG,EAAEA,EAAEA,EAAEA,EAAEO,IAAIP,EAAEA,EAAEA,EAAEO,GAAUgK,GAC1qB,QAASuyG,IAAG98G,EAAEuK,GAAGwyG,GAAG/8G,GAAGA,EAAEuK,EAAEwwF,GAAG8hB,GAAG78G,EAAEuK,IAAI/E,KAAK,WAAW,MAAOxF,GAAEjI,EAAEwuE,KAAI8/B,OAAO7gG,KAAK,WAAW,MAAOxF,GAAEzG,MAAMiM,KAAK,WAAWs3G,GAAG98G,GAAE,KAAM7G,EAAE,SAASoR,GAAGvK,EAAElI,EAAEyS,IAAIuyG,GAAG98G,GAAE,KAAM,QAAS+8G,IAAG/8G,GAAGA,EAAEuK,IAAIvK,EAAEuK,EAAEoyC,SAAS38C,EAAEuK,EAAE,MAAO,QAASyyG,IAAGh9G,GAAG/B,KAAKsC,EAAEP,EAAE/B,KAAKsM,EAAEtM,KAAK+B,EAAE,KAAK/B,KAAK/F,EAAE,EAAkH,QAAS+kH,IAAGj9G,EAAEuK,GAAG,GAAIrS,GAAEqS,EAAE6/F,IAAGjyG,EAAEoS,EAAE2yG,YAAa3yG,GAAE4yG,GAAG5yG,EAAE6yG,WAAWp9G,EAAEuK,EAAErS,EAAE8H,EAAE9H,EAAEqS,EAAEvK,EAAEA,EAAE7H,EAAE,QAASglH,IAAGn9G,GAAG,MAAO0oG,MAAK,IAAIr8F,SAASrM,EAAE,IACpf,QAASq9G,IAAGr9G,EAAEuK,GAAG,MAAOikG,IAAGxuG,EAAEO,EAAEgK,GAAG/E,KAAK,SAAS+E,GAA+D,MAA5DvK,GAAEuK,EAAEA,EAAEogG,aAAa3qG,EAAE9H,EAAEilH,GAAG5yG,EAAE+yG,YAAYt9G,EAAEA,EAAEuK,EAAEmkG,eAAqBvhD,YAAYntD,EAAEuK,EAAEgzG,eAAev9G,EAAE9H,EAAEglH,aAAal9G,EAAEA,KAAK7G,EAAE,SAASoR,GAAiD,KAA9C,2BAA2BA,EAAEuC,OAAO9M,EAAEA,EAAE,MAAYuK,IAA4Q,QAASizG,IAAGx9G,EAAEuK,GAAGtM,KAAK+B,EAAEA,GAAG,KAAK/B,KAAKsM,EAAEA,GAAG,KAAKi8F,GAAGvoG,MAAMw/G,eAAenX,GAAG/7F,GAAG,MAAMmzG,aAAapX,GAAGtmG,GAAG,QAAQ,QAAS29G,IAAG39G,GAAG,MAAO,IAAIw9G,IAAGx9G,EAAEA,EAAEA,EAAEuK,GAA0E,QAASqzG,IAAG59G,EAAEuK,EAAErS,EAAEC,EAAE6F,EAAEuC,GAAGimG,GAAGvoG,MAAMmrE,IAAIppE,EAAEkiC,YAAY/pC,GAAG,KAAK0lH,SAAS7/G,GAAG,KAAKkvG,MAAMh1G,GAAG,KAAKi0G,YAAY5rG,GAAG,KAAKwpG,WAAWx/F,IAAI,QAASuzG,IAAG99G,EAAEuK,GAAGitF,GAAEx/F,KAAKiG,KAAK+B,EAAG,KAAI,GAAI9H,KAAKqS,GAAEtM,KAAK/F,GAAGqS,EAAErS,GAC74B,QAAS6lH,IAAG/9G,EAAEuK,EAAErS,GAAG+F,KAAKsoE,KAAKtoE,KAAK28F,EAAE56F,EAAEg+G,OAAO//G,KAAK3F,EAAE0H,EAAE+0C,QAAQ92C,KAAKw4F,EAAEz2F,EAAEi+G,YAAY,KAAKj+G,EAAE8mB,GAASynB,YAAYw2D,GAAGj+E,GAASynB,aAAa,KAAKtwC,KAAK/F,EAAE,GAAIk1G,IAAGnvG,KAAK28F,EAAEyZ,GAAGqH,IAAI17G,GAAG/B,KAAK1E,EAAE,GAAIyjH,IAAG/+G,KAAK/F,GAAGgmH,GAAGjgH,KAAKsM,EAAE6/F,KAAI6S,GAAGh/G,KAAK1E,EAAEgR,GAAGgQ,GAAEtc,KAAK,eAAeA,KAAK1E,EAAEyG,GAAGm+G,GAAGlgH,KAAK/F,OAAOyiG,GAAE3iG,KAAKiG,MAAMA,KAAK4gG,GAAE,EAAG5gG,KAAKw4F,GAAG4O,OAAOpnG,KAAK+B,EAAEg8G,GAAG/9G,KAAKw4F,EAAEx4F,KAAK28F,EAAE38F,KAAK3F,IAAI2F,KAAKiiG,KAAKjiG,KAAKnG,EAAE,KAAKmG,KAAKlG,EAAEqmH,GAAGngH,MAAMA,KAAKogH,EAAE90D,EAAEtrD,KAAKqyF,GAAGryF,KAAM,IAAI9F,GAAE8F,IAAKA,MAAKgxF,GAAG,KAAKhxF,KAAKyxF,GAAG,SAAS1vF,GAAG7H,EAAEuwG,GAAG1oG,EAAEzG,IAAI0E,KAAKsxE,EAAE,KAAKtxE,KAAKqgH,KAAKrgH,KAAKwxF,GAAG,SAASzvF,GAAGu+G,GAAGpmH,EACpf6H,EAAEO,IAAItC,KAAKugH,EAAE,KAA2G,QAASC,IAAGz+G,EAAEuK,GAAGvK,EAAEuvE,GAAG0qB,GAAEj6F,EAAEuvE,EAAE,sBAAsBvvE,EAAE0vF,KAAK1vF,EAAEuvE,EAAEhlE,IAAI8uF,GAAG9uF,EAAE,sBAAsBvK,EAAE0vF,IAAI,QAAS6uB,IAAGv+G,EAAEuK,GAAGvK,EAAEs+G,EAAE/zG,EAAEyjG,GAAGhuG,EAAE9H,EAAE4uB,GAASynB,YAAYw2D,GAAGj+E,GAASynB,YAAYvuC,EAAEs+G,GAAG,MAAoD,QAASI,IAAG1+G,EAAEuK,GAAGvK,EAAEw+G,GAAGvkB,GAAEj6F,EAAEw+G,EAAE,mBAAmBx+G,EAAEyvF,KAAKzvF,EAAEw+G,EAAEj0G,IAAI8uF,GAAG9uF,EAAE,mBAAmBvK,EAAEyvF,IACtb,QAASkvB,IAAG3+G,GAAG,IAAI,MAAO8mB,IAASsO,IAAIp1B,EAAE1H,GAAG4wE,OAAO,MAAM3+D,GAAG,KAAM,IAAI21F,IAAE,iBAAiB,qEAAqElgG,EAAE1H,EAAE,OAAQ,QAAS8lH,IAAGp+G,GAAG,MAAO,IAAI48G,IAAG,WAAW,MAAO58G,GAAE26F,GAAE,IAAK,SAAS36F,GAAG,SAAOA,GAAG,+BAA+BA,EAAE8M,OAAY,WAAW,GAAIvC,GAAEvK,EAAEzG,EAAErB,EAAEwwG,KAAK,GAAI,OAAO,GAAEn+F,EAAEA,EAAE,GAAG,IAAI,MAAK,GAAI,QAASq0G,IAAG5+G,GAAGA,EAAE/H,GAAG+H,EAAEjI,EAAEwS,IAAIvK,EAAEjI,EAAEw5D,QAAQ0oC,GAAEj6F,EAAE,eAAeA,EAAEq+G,GAAGhlB,GAAGr5F,EAAE,eAAeA,EAAEq+G,IAAI,QAASQ,IAAG7+G,GAAGi6F,GAAEj6F,EAAE,eAAeA,EAAEq+G,GAAGtB,GAAG/8G,EAAEjI,GACxe,QAASmmH,IAAGl+G,EAAEuK,GAAGvK,EAAE4xF,GAAGrnF,EAAEgQ,GAAEva,EAAE,OAAOuK,GAAG,QAASu0G,IAAG9+G,EAAEuK,GAAGmmF,EAAG1wF,EAAEkgG,EAAE,SAASlgG,GAAG,MAAOA,IAAGuK,IAAI,QAASw0G,IAAG/+G,GAAG,IAAI,GAAIuK,MAAKrS,EAAE,EAAEA,EAAE8H,EAAEkgG,EAAElmG,OAAO9B,IAAIqS,EAAErQ,KAAK8F,EAAEkgG,EAAEhoG,GAAG8H,GAAI,OAAO6zF,IAAGtpF,GAAG/E,KAAK,WAAW,MAAOxF,KAAI,QAASg/G,IAAGh/G,GAAGA,EAAEA,IAAIA,EAAE6+F,IAAI7+F,EAAE6+F,GAAE,EAAG7+F,EAAEA,EAAEgwE,UAAUhwE,IACnP,QAASm+G,IAAGn+G,EAAEuK,GAAGi8F,GAAGxmG,GAAGopE,IAAI7+D,EAAE6+D,IAAIlnC,YAAY33B,EAAE23B,aAAa,KAAK27E,SAAStzG,EAAEszG,UAAU,KAAK3Q,MAAM3iG,EAAE2iG,OAAO,KAAK+R,cAAc10G,EAAE00G,gBAAe,EAAG9S,YAAY5hG,EAAE4hG,aAAa,KAAK+S,YAAY30G,EAAE20G,cAAa,EAAGC,SAAS,GAAI3B,IAAGjzG,EAAE60G,UAAU70G,EAAE80G,aAAaC,kBAA0D,QAASC,OAAM,QAASC,IAAGx/G,GAAG,MAAOumE,MAAI/gE,KAAK,WAAW,GAAGxF,EAAE/H,EAAE,KAAM,IAAIioG,IAAE,iBAAkB,QAASuf,IAAGz/G,GAAG,MAAO+7F,IAAG/7F,EAAEs/G,aAAa,SAASt/G,GAAG,MAAOA,GAAE+pG,aAC/c,QAAS2V,IAAG1/G,EAAEuK,GAAGA,IAAIo1G,GAAG3/G,EAAEuK,EAAEw/F,YAAY/pG,EAAEs/G,aAAaplH,KAAKqQ,IAAI,QAASo1G,IAAG3/G,EAAEuK,GAAGmmF,EAAG1wF,EAAEs/G,aAAa,SAASt/G,GAAG,MAAOA,GAAE+pG,YAAYx/F,IAAI,QAASq1G,IAAG5/G,EAAEuK,EAAErS,IAAI,OAAOqS,GAAGrS,IAAI8H,EAAE/G,eAAesR,IAAIgQ,GAAEva,EAAEuK,EAAErS,GACrM,QAAS2nH,IAAG7/G,EAAEuK,GAAGvK,GAAGuK,IAAIi8F,GAAGxmG,GAAGopE,IAAI7+D,EAAE6+D,IAAIlnC,YAAY33B,EAAE23B,YAAY27E,SAAStzG,EAAEszG,SAAS3Q,MAAM3iG,EAAE2iG,MAAM+R,cAAc10G,EAAE00G,cAAc9S,YAAY5hG,EAAE4hG,YAAY+S,YAAY30G,EAAE20G,YAAYI,kBAAkB/0G,EAAE40G,SAAS5kG,GAAEva,EAAE,WAAW29G,GAAGpzG,EAAE40G,WAAW5kG,GAAEva,EAAE,WAAW,GAAIw9G,KAAI/mB,GAAElsF,EAAE+0G,aAAa,SAAS/0G,GAAGm1G,GAAG1/G,EAAEuK,KAAKvK,EAAEzG,EAAEgR,EAAEhR,EAAEghB,GAAEva,EAAE,eAAeA,EAAEzG,EAAEyG,IAC/U,QAAS8/G,IAAG9/G,GAAG,MAAOA,GAAE26F,IAAIn1F,KAAK,SAAS+E,GAAG,GAAIrS,GAAE8H,EAAEk/G,WAAY,OAAOa,IAAG//G,EAAEuK,GAAG/E,KAAK,WAAqC,MAA1BtN,IAAG0nH,GAAG5/G,EAAE,eAAc,GAAWuK,MAEjI,QAASy1G,IAAGhgH,EAAEuK,GAAGA,EAAE6/F,KAAIpqG,EAAE4xF,IAAIrnF,EAAE6/F,MAAK6S,GAAGj9G,EAAEzG,EAAEgR,GAAGqwF,GAAE56F,EAAE,GAAI89G,IAAG,iBAAiBI,GAAGl+G,EAAEuK,EAAE6/F,KAAIwV,GAAG5/G,EAAE,eAAeA,EAAEzG,EAAEyG,IAAI,QAAS+/G,IAAG//G,EAAEuK,GAAG,MAAO0kG,IAAEjvG,EAAE9H,EAAE+nH,IAAI3V,QAAQ//F,IAAI/E,KAAK+jD,EAAEvpD,EAAEi1F,GAAGj1F,IAE3K,QAASkgH,IAAGlgH,GAAG,OAAOA,EAAEA,EAAEmgH,mBAAmBngH,EAAEhG,OAAO+hG,GAAG/7F,EAAE,SAASA,GAAG,MAAO,IAAI49G,IAAG59G,EAAEogH,MAAMpgH,EAAE+pG,WAAW/pG,EAAEktG,MAAMltG,EAAEkiC,YAAYliC,EAAEqgH,SAASrgH,EAAEmsG,kBAC7I,QAASmU,IAAGtgH,EAAEuK,GAAG,MAAOu1G,IAAG9/G,GAAGwF,KAAK,WAAW,GAAG+qF,EAAGkvB,GAAGz/G,GAAGuK,GAAG,MAAOw0G,IAAG/+G,GAAGwF,KAAK,WAAW,KAAM,IAAI06F,IAAE,+BACgH,QAASqgB,IAAGvgH,EAAEuK,EAAErS,GAAG,GAAIC,GAAEo0G,GAAGhiG,EAAW,OAARA,GAAE6+F,GAAG7+F,GAAUk8F,IAAI6V,KAAKt8G,EAAEqqD,WAAWlyD,EAAEqoH,mBAAmBj2G,EAAEk2G,cAAcvoH,IAAI,QAASwoH,IAAG1gH,EAAEuK,GAAW,MAARy1G,IAAGhgH,EAAEuK,GAAUvK,EAAEooC,SAAS5iC,KAAK,WAAW,MAAOxF,KAOrY,QAAS2gH,IAAG3gH,EAAEuK,EAAErS,EAAEC,EAAE6F,GAAG,IAAIqnG,KAAK,MAAO5R,IAAE,GAAIyM,IAAE,+CAAgD,IAAGlgG,EAAElI,IAAIkG,EAAE,MAAOy1F,IAAEzzF,EAAElI,EAAG,IAAIyI,GAAE0oG,GAAG/wG,EAAE6xG,YAAY9lF,EAAEkhF,GAAGnlG,EAAEopE,IAAI,OAAOrxE,EAAE,OAAOwtG,MAAMX,OAAO5kG,EAAEy2F,GAAGv+F,EAAE+yG,kBAAkBlzG,EAAEm+G,GAAGl2G,EAAEy2F,EAAEz2F,EAAE46F,EAAE56F,EAAE1H,EAAEiS,EAAErS,EAAE,KAAK+rB,EAAE6C,GAASynB,aAAa,MAAO,IAAI31C,GAAEyqG,GAAGtrG,EAAEwI,GAAGA,EAAE2vF,GAAG3vF,GAAGA,EAAE0vF,GACrK,OADyK93F,GAAEA,IAAIqN,KAAK,WAAiB,GAANo7G,GAAG5gH,IAAOhC,EAAE,MAAOgC,GAAE26F,IAAIn1F,KAAK,gBAAgBA,KAAK,WAAW,MAAOu2G,IAAG/7G,EAAEA,EAAEpH,EAAE2R,EAAErS,EAAE+rB,IAAIlsB,KAAKyN,KAAK,WAAW,MAAO,IAAIwtF,GAAE,SAAS96F,EAAEC,GAAG6H,EAAEgvF,GAAGzkF,EAAE,KAAK,GAAI21F,IAAE,2BAA2BlgG,EAAEikB,GAAG,MACnfjkB,EAAEO,EAAErI,EAAE8H,EAAEyL,EAAEtT,EAAE6H,EAAEikB,EAAEA,EAAEjkB,EAAEuK,EAAEvK,EAAEA,EAAEowF,GAAGpwF,EAAEuK,EAAE3R,EAAEqrB,OAAOze,KAAK,SAASxF,GAAY,MAATpH,IAAGwqG,GAAGxqG,GAAUoH,EAAEymG,GAAGzmG,GAAG,OAAO7G,EAAE,SAAS6G,GAAY,KAATpH,IAAGwqG,GAAGxqG,GAASoH,IAAYs+G,GAAEt+G,EAAE7H,EAAE6F,GACzI,QAAS6iH,IAAG7gH,EAAEuK,EAAErS,EAAEC,EAAE6F,GAAG,IAAIqnG,KAAK,MAAO5R,IAAE,GAAIyM,IAAE,+CAAgD,IAAGlgG,EAAElI,IAAIkG,EAAE,MAAOy1F,IAAEzzF,EAAElI,EAAG,IAAIyI,GAAE,KAAK0jB,EAAEkhF,GAAGnlG,EAAEopE,IAAI,MAA+S,OAAxSjxE,GAAEA,IAAIqN,KAAK,WAAiB,GAANo7G,GAAG5gH,IAAOhC,EAAE,MAAOgC,GAAE26F,IAAIn1F,KAAK,gBAAgBA,KAAK,WAAiB,MAANxF,GAAE8gH,EAAE78F,EAAS86F,GAAG/+G,KAAKwF,KAAK,SAAS+E,GAA0C,MAAvCvK,GAAE4uF,KAAKrkF,EAAEvK,EAAE4uF,GAAGrkF,EAAEA,EAAEA,EAAElC,IAAIogB,GAAGzoB,EAAEyzF,IAAIlpF,EAAEvK,IAAWuK,IAAI/E,KAAK,WAAW,MAAOxF,GAAEA,EAAEmwF,GAAG5lF,EAAErS,EAAE+rB,KAAK9qB,EAAE,SAASoR,GAAO,GAAJhK,EAAEgK,EAAKvK,EAAE4uF,GAAG,MAAOmyB,IAAG/gH,EAAE4uF,GAAI,MAAMruF,KAAKiF,KAAK,WAAW,GAAGjF,EAAE,KAAMA,KAAY+9G,GAAEt+G,EAAE7H,EAAE6F,GAC1c,QAAS4iH,IAAG5gH,GAAG,IAAIA,EAAEA,IAAIA,EAAE6+F,EAAE,CAAC,GAAG7+F,EAAEA,IAAIA,EAAE6+F,EAAE,KAAM,IAAIqB,IAAE,iBAAkB,MAAM,IAAIA,IAAE,gCAErF,QAASoe,IAAEt+G,EAAEuK,EAAErS,GAAG,GAAIC,GAAE6oH,GAAGhhH,EAAEuK,EAAErS,EAA2C,OAAxC8H,GAAEumE,EAAErsE,KAAK/B,GAAG27F,GAAG37F,EAAE,WAAWs4F,EAAGzwF,EAAEumE,EAAEpuE,KAAYA,EAAE,QAAS6oH,IAAGhhH,EAAEuK,EAAErS,GAAG,MAAO8H,GAAElI,IAAII,GAAGqS,EAAEoyC,SAAS82C,GAAEzzF,EAAElI,IAAIyS,EAAEpR,EAAE,SAASoR,GAAoH,MAAhHA,GAAG,sBAAsBA,EAAEuC,MAAM,2BAA2BvC,EAAEuC,OAAO9M,EAAElI,GAAG8iG,GAAE56F,EAAE,GAAI89G,IAAG,oBAAoB99G,EAAElI,EAAEyS,GAASA,IAEhR,QAAS02G,IAAGjhH,GAAG,IAAIA,EAAEg+G,OAAO,MAAO,KAAK,IAAIzzG,IAAGyzG,OAAOh+G,EAAEg+G,OAAOC,WAAWj+G,EAAEi+G,WAAWlpE,QAAQ/0C,EAAE+0C,SAAS78C,IAAK,MAAG8H,EAAEkhH,iBAAiBlhH,EAAEkhH,gBAAgB/zD,aAAantD,EAAEkhH,gBAAgB3D,gBAAmK,MAAO,KAA3JrlH,GAAEkyG,IAAGpqG,EAAEkhH,gBAAgB/zD,YAAYj1D,EAAEglH,aAAal9G,EAAEkhH,gBAAgBhE,cAAc,KAAKhlH,EAAEklH,WAAWp9G,EAAEkhH,gBAAgB3D,eAAe7U,MAAM,GAAqB,IAAIvwG,GAAE,GAAI4lH,IAAGxzG,EAAErS,EAAE8H,EAA4G,OAAzGA,GAAEs/G,cAAc7oB,GAAEz2F,EAAEs/G,aAAa,SAASt/G,GAAGA,GAAG0/G,GAAGvnH,EAAEsuG,GAAGzmG,MAAMA,EAAEmhH,kBAAkBhpH,EAAE2oH,EAAE9gH,EAAEmhH,iBAAwBhpH,EACze,QAASipH,IAAGphH,EAAEuK,EAAErS,EAAEC,GAAG,GAAI6F,GAAE,GAAI+/G,IAAG/9G,EAAEuK,EAA0B,OAAvBrS,KAAI8F,EAAE4wF,GAAG12F,GAAGC,GAAGomH,GAAGvgH,EAAE7F,GAAU6F,EAAEoqC,SAAS5iC,KAAK,WAAW,MAAOxH,KAAK,QAASqjH,IAAGrhH,GAAG/B,KAAK+B,EAAEA,EAAE/B,KAAKsM,EAAEouG,KAA8C,QAASoI,IAAG/gH,GAAG,MAAO+4G,IAAG/4G,EAAEuK,EAAEke,GAAGzoB,EAAEA,GAAG,QAASshH,IAAGthH,EAAEuK,GAAG,MAAOvK,GAAEuK,EAAE5R,IAAI8vB,GAAGzoB,EAAEA,GAAGwF,KAAK,SAASxF,GAA0B,MAAvBA,IAAGuK,IAAIvK,EAAEi+G,WAAW1zG,GAAU02G,GAAGjhH,SAAU,QAASuhH,IAAGvhH,EAAEuK,GAAGtM,KAAK+B,EAAEA,EAAE/B,KAAKsM,EAAEA,GAAGouG,KAAK16G,KAAK/F,EAAE,KAAK+F,KAAKsC,EAAEihH,GAAGvjH,MAAMg7G,GAAGh7G,KAAKsM,EAAE6uG,GAAG,SAASn7G,KAAK+B,EAAEupD,EAAEtrD,KAAKgmB,EAAEhmB,OAAiO,QAASwjH,IAAGzhH,EAAEuK,GAAG,GAASpS,GAALD,IAAO,KAAIC,IAAKogH,IAAGA,GAAGpgH,KAAKoS,GAAGrS,EAAEgC,KAAK6+G,GAAG/4G,EAAEuK,EAAE6uG,GAAGb,GAAGpgH,IAAI6H,EAAEA,GAA2B,OAAvB9H,GAAEgC,KAAK6+G,GAAG/4G,EAAEuK,EAAEm3G,GAAG1hH,EAAEA,IAAW4zF,GAAG17F,GAChwB,QAASspH,IAAGxhH,GAAG,GAAIuK,GAAE6uG,GAAG,SAASlhH,EAAEkhH,GAAG,WAAWjhH,EAAEihH,GAAG,OAAQ,OAAOp5G,GAAEuK,EAAE5R,IAAIT,EAAE8H,EAAEA,GAAGwF,KAAK,SAASxH,GAAG,MAAOA,GAAE9F,EAAE8H,EAAEuK,EAAE5R,IAAIR,EAAE6H,EAAEA,GAAGwF,KAAK,SAAStN,GAAG,MAAOA,GAAEC,EAAE6H,EAAEuK,EAAE5R,IAAI4R,EAAEvK,EAAEA,GAAGwF,KAAK,SAAStN,GAAG,MAAOA,GAAEqS,EAAEvK,EAAEuK,EAAE5R,IAAI+oH,GAAG1hH,EAAEA,GAAGwF,KAAK,SAASxF,GAAG,MAAOA,GAAEo5G,GAAGp5G,GAAGuK,UAAU/E,KAAK,SAAS+E,GAAS,MAANvK,GAAE9H,EAAEqS,EAASk3G,GAAGzhH,EAAEuK,EAAEitF,KAAKr+F,EAAE,WAAW6G,EAAE9H,IAAI8H,EAAE9H,EAAEqS,KAA6C,QAAS6uG,IAAGp5G,GAAG,OAAO5H,KAAK,WAAWo/F,EAAEx3F,GAC/L,QAAS2hH,IAAG3hH,GAAG,MAAOyzB,IAAGzzB,EAAE,WAAW,MAAOA,GAAEuK,EAAElC,IAAIq5G,GAAG1hH,EAAE9H,EAAEs/F,EAAEx3F,EAAEA,KAAK,QAAS4hH,IAAG5hH,EAAEuK,GAAG,MAAOkpB,IAAGzzB,EAAE,WAAW,MAAOA,GAAEuK,EAAElC,IAAIrI,EAAE9H,EAAEqS,EAAEkpF,IAAIzzF,EAAEA,KAAK,QAAS6hH,IAAG7hH,GAAG,MAAOyzB,IAAGzzB,EAAE,WAAW,MAAO+4G,IAAG/4G,EAAEuK,EAAEvK,EAAE9H,EAAE8H,EAAEA,KAC9Z,QAAS8hH,IAAG9hH,EAAEuK,GAAG,MAAOkpB,IAAGzzB,EAAE,WAAW,MAAOA,GAAEuK,EAAE5R,IAAIqH,EAAE9H,EAAE8H,EAAEA,GAAGwF,KAAK,SAASxF,GAA0B,MAAvBA,IAAGuK,IAAIvK,EAAEi+G,WAAW1zG,GAAU02G,GAAGjhH,WAAW,QAASyzB,IAAGzzB,EAAEuK,GAAqB,MAAlBvK,GAAEO,EAAEP,EAAEO,EAAEiF,KAAK+E,EAAEA,GAAUvK,EAAEO,EAAG,QAASwhH,IAAG/hH,GAA6B,GAA1B/B,KAAKlG,GAAE,EAAGwiB,GAAEtc,KAAK,MAAM+B,IAAMsa,GAAErc,MAAM1D,UAAS+f,GAAErc,MAAM1D,QAAQyjH,OAAiI,KAAM,IAAI9d,IAAE,kBAAtIlgG,GAAE8mB,GAASynB,YAAYw2D,GAAGj+E,GAASynB,aAAa,KAAKtwC,KAAK/F,EAAE,GAAIk1G,IAAG9yF,GAAErc,MAAM1D,SAAS+f,GAAErc,MAAM1D,QAAQyjH,OAAO3J,GAAGqH,IAAI17G,GAAuC/B,KAAKiiG,KAAKjiG,KAAKhG,KAAKgG,KAAK4gG,KAAK5gG,KAAKm1F,GAAGtsE,GAASszB,SAAS8wB,gBAAgB3hB,EAAEtrD,KAAKw2F,GAAGx2F,OAAOA,KAAKqgH,MAAE,GAAOrgH,KAAKo1F,GAAGvsE,GAASszB,SAAS8wB,gBAAgB3hB,EAAEtrD,KAAKy2F,GAAGz2F,OAAO+jH,GAAG/jH,KAAK,MAAMA,KAAK1E,EAAE,GAAIgoH,IAAGjnG,GAAErc,MAAM1D,QAAQyjH,OAAO,IAAI1jG,GAAErc,MAAM7F,MAAM6F,KAAK28F,EAAE,GAAIymB,IAAG/mG,GAAErc,MAAM1D,QAAQyjH,OAC9pB,IAAI1jG,GAAErc,MAAM7F,MAAM6F,KAAKogH,EAAEvN,GAAE7yG,KAAKgkH,GAAGhkH,OAAOA,KAAKnG,EAAEg5G,GAAE7yG,KAAKikH,GAAGjkH,OAAOA,KAAKsxE,GAAE,EAAGtxE,KAAKgxF,GAAG1lC,EAAEtrD,KAAK83F,GAAG93F,MAAMA,KAAKqyF,GAAG/mC,EAAEtrD,KAAKixF,GAAGjxF,MAAMA,KAAK2zF,GAAGroC,EAAEtrD,KAAKm2F,GAAGn2F,MAAMA,KAAKwxF,GAAGlmC,EAAEtrD,KAAKk2F,GAAGl2F,MAAMA,KAAKyxF,GAAGnmC,EAAEtrD,KAAKu2F,GAAGv2F,MAAMkkH,GAAGlkH,MAAMA,KAAKm8C,YAAYn8C,KAAKm8C,SAAL,OAAwBmP,EAAEtrD,KAAK88C,OAAO98C,MAAMA,KAAKm8C,SAASgoE,aAAa74D,EAAEtrD,KAAK62F,GAAG72F,MAAMA,KAAK3F,EAAE,EAAEqiG,GAAE3iG,KAAKiG,MAAMokH,GAAGpkH,MAAMA,KAAKsoE,KAAa,QAAS+7C,IAAGtiH,GAAGw3F,GAAEx/F,KAAKiG,KAAK,uBAAuBA,KAAK1E,EAAEyG,EAAU,QAASuiH,IAAGviH,GAAGw3F,GAAEx/F,KAAKiG,KAAK,oBAAoBA,KAAKsC,EAAEP,EAE/d,QAASqiH,IAAGriH,GAAGzH,OAAOC,eAAewH,EAAE,MAAMrH,IAAI,WAAW,MAAOsF,MAAKukH,KAAKn6G,IAAI,SAASrI,GAAG/B,KAAKyqG,GAAG1oG,IAAItH,YAAW,IAAKsH,EAAEw+G,EAAE,KAA4J,QAASiE,IAAGziH,GAAG,MAAOA,GAAEmzF,IAAIM,GAAE,GAAIyM,IAAE,gCAC7T,QAASiiB,IAAGniH,GAAG,GAAIuK,GAAE+P,GAAEta,GAAGzF,QAAQ0jH,WAAW/lH,EAAEoiB,GAAEta,GAAGzF,QAAQyjH,MAAOzzG,IAAG86F,OAAOrlG,EAAEmzF,GAAGnzF,EAAEq+G,EAAE74G,KAAK,WAAW,IAAIxF,EAAEjI,EAAE,CAAuD,GAAtDiI,EAAEA,EAAEg8G,GAAGzxG,EAAErS,EAAEoiB,GAAEta,GAAG5H,MAAM4H,EAAEA,EAAEgwE,UAAUhwE,GAAGq+G,GAAEr+G,IAAIg/G,GAAGX,GAAEr+G,IAAOA,EAAEy2F,EAAE,CAACuoB,GAAGh/G,EAAEy2F,EAAG,IAAIt+F,GAAE6H,EAAEy2F,CAAEt+F,GAAEuwG,GAAG1oG,EAAEwiH,KAAK/D,GAAGtmH,EAAE6H,GAAG7H,EAAE6H,EAAEy2F,EAAE8nB,GAAGpmH,EAAE6H,EAAEumE,GAAGm4C,GAAGvmH,EAAE6H,GAAGA,EAAEy2F,EAAE,KAAK,MAAOz2F,GAAEA,MAKpD,QAAS0iH,IAAG1iH,EAAEuK,GAAG,GAAIrS,KAA2F,OAAtFA,GAAE8lH,OAAO1jG,GAAEta,GAAGzF,QAAQyjH,OAAO9lH,EAAE+lH,WAAW3jG,GAAEta,GAAGzF,QAAQ0jH,WAAW/lH,EAAE68C,QAAQz6B,GAAEta,GAAG5H,KAAY4H,EAAEq+G,EAAE74G,KAAK,WAAW,MAAO47G,IAAGlpH,EAAEqS,EAAEvK,EAAE46F,EAAE56F,EAAE2wF,QAAQnrF,KAAK,SAAS+E,GAAG,MAAG8zG,IAAEr+G,IAAIuK,EAAE6+D,KAAKi1C,GAAEr+G,GAAGopE,KAAWy2C,GAAGxB,GAAEr+G,GAAGuK,GAAGvK,EAAEkvF,GAAG3kF,KAAGy3G,GAAGhiH,EAAEuK,GAAGy0G,GAAGz0G,GAAUvK,EAAEkvF,GAAG3kF,MAAK/E,KAAK,WAAWm9G,GAAG3iH,KACte,QAASgiH,IAAGhiH,EAAEuK,GAAG8zG,GAAEr+G,KAAK8+G,GAAGT,GAAEr+G,GAAGA,EAAEswF,IAAI2J,GAAEokB,GAAEr+G,GAAG,eAAeA,EAAE4xF,IAAIqI,GAAEokB,GAAEr+G,GAAG,cAAcA,EAAEyvF,IAAIwK,GAAEokB,GAAEr+G,GAAG,kBAAkBA,EAAE0vF,IAAImvB,GAAGR,GAAEr+G,KAAKuK,IAAIA,EAAE21F,EAAEhmG,KAAK8F,EAAEswF,IAAI+I,GAAG9uF,EAAE,eAAevK,EAAE4xF,IAAIyH,GAAG9uF,EAAE,cAAcvK,EAAEyvF,IAAI4J,GAAG9uF,EAAE,kBAAkBvK,EAAE0vF,IAAI,EAAE1vF,EAAE1H,GAAGsmH,GAAGr0G,IAAIgQ,GAAEva,EAAE,cAAcuK,GAAGA,IAAIA,EAAEm+F,GAAG1oG,EAAEwiH,KAAK/D,GAAGl0G,EAAEvK,GAAGu+G,GAAGh0G,EAAEvK,EAAEumE,GAAGm4C,GAAGn0G,EAAEvK,IACnT,QAAS4iH,IAAG5iH,GAAG,GAAIuK,GAAE+2G,GAAGthH,EAAE46F,EAAEtgF,GAAEta,GAAGzF,QAAQ0jH,YAAYz4G,KAAK,SAAS+E,GAAqB,OAAfvK,EAAEy2F,EAAElsF,KAAEA,EAAEqkF,GAAG5uF,EAAE46F,GAASmmB,GAAG/gH,EAAE46F,IAAK,OAAOkW,IAAE9wG,EAAEuK,GAAG,QAAS03G,IAAGjiH,GAAG,GAAIuK,GAAE+P,GAAEta,GAAGzF,QAAQ0jH,WAAW/lH,EAAE0qH,GAAG5iH,GAAGwF,KAAK,WAAW,MAAOs8G,IAAG9hH,EAAEzG,EAAEgR,KAAK/E,KAAK,SAAS+E,GAAG,MAAOA,IAAGA,EAAEqkF,GAAG5uF,EAAE46F,EAAE56F,EAAEy2F,IAAIz2F,EAAEy2F,EAAEqqB,GAAG,QAAQv2G,EAAEu2G,GAAG,MAAMv2G,EAAEA,EAAE69B,SAAS5iC,KAAK,WAAW,MAAOo8G,IAAG5hH,EAAEzG,EAAEgR,GAAG/E,KAAK,WAAW,MAAO+E,OAAMpR,EAAE,SAASjB,GAAG,MAAM,+BAA+BA,EAAE4U,KAAKvC,EAAEs3G,GAAG7hH,EAAEzG,MAAM,OAAOiM,KAAK,SAAS+E,GAAGy3G,GAAGhiH,EAAEuK,GAAG,OAAQ,OAAOumG,IAAE9wG,EAAE9H,GACxd,QAASgqH,IAAGliH,GAAG,MAAOA,GAAEq+G,EAAE74G,KAAK,WAAW,MAAOxF,GAAEymE,OAAOttE,EAAE,cAAcqM,KAAK,WAAW,IAAIxF,EAAEjI,EAAE,MAAOiI,GAAEivF,OAAO91F,EAAE,cAAcqM,KAAK,WAAW,IAAIxF,EAAEjI,EAAE,CAACiI,EAAEuvE,GAAE,CAAG,IAAIhlE,GAAEvK,EAAEzG,CAAE0/G,IAAG1uG,EAAEA,EAAE6uG,GAAG,SAAS7uG,EAAEvK,EAAEA,EAAEivF,OAErM,QAAS4zB,IAAG7iH,EAAEuK,GAAG,GAAIrS,GAAE,KAAKC,EAAE,IAAK,OAAO24G,IAAE9wG,EAAEuK,EAAE/E,KAAK,SAAS+E,GAAmB,MAAhBrS,GAAEq0G,GAAGhiG,GAAGpS,EAAEixG,GAAG7+F,GAAUm4G,GAAG1iH,EAAEuK,KAAK/E,KAAK,WAAW,MAAOihG,KAAI6V,KAAK+B,GAAEr+G,GAAGqqD,WAAWnyD,EAAEsoH,mBAAmBroH,EAAEsoH,cAAc,cAGyB,QAASnmG,IAAEta,GAAG,MAAOA,GAAEo1B,IAAI,QAASipF,IAAEr+G,GAAG,MAAOA,GAAE8iH,YAAmE,QAASC,IAAG/iH,GAAG,MAAOq+G,IAAEr+G,IAAIq+G,GAAEr+G,GAAGgjH,MAAM,KAC5W,QAASL,IAAG3iH,GAAG,GAAGA,EAAEuvE,EAAE,CAAC,IAAI,GAAIhlE,GAAE,EAAEA,EAAEvK,EAAE/H,EAAE+B,OAAOuQ,IAAOvK,EAAE/H,EAAEsS,IAAGvK,EAAE/H,EAAEsS,GAAGw4G,GAAG/iH,GAAI,IAAGA,EAAEs+G,IAAIt+G,EAAE6rE,UAAU7rE,EAAE6+F,EAAE7kG,OAAO,IAAIgG,EAAEs+G,EAAEt+G,EAAE6rE,SAASthE,EAAE,EAAEA,EAAEvK,EAAE6+F,EAAE7kG,OAAOuQ,IAAOvK,EAAE6+F,EAAEt0F,IAAGvK,EAAE6+F,EAAEt0F,GAAGw4G,GAAG/iH,KAC2B,QAASijH,IAAGjjH,EAAEuK,GAAGvK,EAAE6+F,EAAE3kG,KAAKqQ,GAAGumG,GAAE9wG,EAAEA,EAAElI,EAAE0N,KAAK,YAAYxF,EAAEjI,GAAGw4F,EAAGvwF,EAAE6+F,EAAEt0F,IAAIvK,EAAEs+G,IAAIt+G,EAAE6rE,WAAW7rE,EAAEs+G,EAAEt+G,EAAE6rE,SAASthE,EAAEw4G,GAAG/iH,QAChT,QAAS8wG,IAAE9wG,EAAEuK,GAA2C,MAAxCvK,GAAEkgG,EAAEhmG,KAAKqQ,GAAGupF,GAAGvpF,EAAE,WAAWkmF,EAAGzwF,EAAEkgG,EAAE31F,KAAYA,EACmL,QAAS24G,IAAGljH,EAAEuK,EAAErS,EAAEC,GAAG6H,EAAE,CAAC9H,EAAEsP,MAAMxO,UAAU6B,MAAM7C,KAAKE,EAAW,KAAI,GAAR8F,GAAE,EAAUuC,GAAE,EAAG0jB,EAAE,EAAEA,EAAE1Z,EAAEvQ,OAAOiqB,IAAI,GAAG1Z,EAAE0Z,GAAG3I,SAAS/a,GAAE,MAAO,CAAC,GAAGA,EAAE,KAAM,IAAI2/F,IAAE,iBAAiB,iFAAkFliG,KAAe,GAAXuC,EAAEgK,EAAEvQ,OAAU9B,EAAE8B,OAAOgE,GAAGuC,EAAErI,EAAE8B,OAAO7B,EAAE,aAAa6F,GAAGuC,EAAE,GAAGvC,EAAE,aAAaA,EAAE,aAAaA,EAAE,IAAIuC,EAAE,cAAc,YAAYrI,EAAE8B,OAAO,QAAQ,CAAC,IAAIgE,EAAE,EAAEA,EAAE9F,EAAE8B,OAAOgE,IAAI,GAAGuC,EAAEgK,EAAEvM,GAAGsd,cAAU,KAASpjB,EAAE8F,IAAIuM,EAAEvM,GAAGuc,EAAEriB,EAAE8F,MAAMuC,EAAE,CAAQ,GAAPgK,EAAEA,EAAEvM,GAAM,EAAEA,GAAGA,GAAGmlH,GAAGnpH,OAAO,KAAM,IAAIkmG,IAAE,iBACvuB,kEAAmEhoG,GAAEirH,GAAGnlH,GAAG7F,GAAGA,EAAE,GAAGD,EAAE,eAAeqS,EAAEnS,KAAK,IAAImS,EAAEnS,KAAK,KAAK,IAAI,WAAWmS,EAAEs6F,EAAE,GAAI,MAAM7kG,GAAE7H,EAAE,MAAM,GAAGA,EAAE,KAAM,IAAI+nG,IAAE,iBAAiBlgG,EAAE,YAAY7H,GAAmF,QAASqmH,IAAEx+G,EAAEuK,GAAG,OAAOnS,KAAK4H,GAAG,GAAG6kG,EAAE,iBAAiBvpF,WAAW/Q,EAAEgQ,EAAEtiB,GAAG,QAASmrH,MAAK,OAAOhrH,KAAK,mBAAmBysG,EAAE,YAAYvpF,UAAS,EAAGf,EAAEo0E,GACrb,QAASpf,IAAEvvE,EAAEuK,GAAG,OAAOnS,KAAK4H,GAAG,GAAG6kG,EAAE,iBAAiBvpF,WAAW/Q,EAAEgQ,EAAE+yC,GAAG,QAAS+1D,IAAGrjH,EAAEuK,GAAG,OAAOnS,KAAK4H,GAAG,GAAG6kG,EAAE,aAAavpF,WAAW/Q,EAAEgQ,EAAErhB,GAAG,QAASoqH,IAAGtjH,EAAEuK,GAAG,OAAOnS,KAAK4H,GAAG,GAAG6kG,EAAE,OAAOvpF,WAAW/Q,EAAEgQ,EAAEw0E,GAAI,QAASw0B,MAAK,OAAOnrH,KAAK,GAAGysG,EAAE,kBAAkBvpF,UAAS,EAAGf,EAAE,SAASva,GAAG,SAASA,GAAGA,YAAawjH,YAAW,QAASC,MAAK,OAAOrrH,KAAK,OAAOysG,EAAE,+BAA+BvpF,UAAS,EAAGf,EAAE,SAASva,GAAG,SAASA,GAAGA,YAAa+hH,OAC9a,QAAS2B,MAAK,OAAOtrH,KAAK,MAAMysG,EAAE,8BAA8BvpF,UAAS,EAAGf,EAAE,SAASva,GAAG,SAASA,GAAGA,YAAa8mB,IAASsO,IAAIuuF,OAAO,QAASC,IAAG5jH,GAAG,OAAO5H,KAAK4H,EAAEA,EAAE,aAAa,aAAa6kG,EAAE7kG,EAAE,WAAWA,EAAE,cAAc,qBAAqBsb,UAAS,EAAGf,EAAE,SAAShQ,GAAG,IAAIA,EAAE,OAAM,CAAG,IAAIrS,IAAG8H,GAAGuK,EAAEw/F,aAAa/pG,CAAE,UAASuK,EAAEwlF,KAAK73F,KACxU,QAAS2rH,MAAK,OAAOzrH,KAAK,eAAeysG,EAAE,wBAAwBvpF,UAAS,EAAGf,EAAE,SAASva,GAAG,SAASA,GAAGA,EAAE+pG,YAAY/pG,EAAE/G,gBAAgB+G,EAAE/G,eAAe,sBAAsB,QAAS6qH,MAAK,OAAO1rH,KAAK,sBAAsBysG,EAAE,yDAAyDvpF,UAAS,EAAGf,EAAE,SAASva,GAAG,SAASA,GAAG/H,EAAE+H,EAAE9B,OAAOhF,EAAE8G,EAAE+jH,WAAW,QAAS/K,IAAEh5G,EAAEuK,EAAErS,EAAEC,GAAG,OAAOC,KAAKF,GAAG,GAAG2sG,EAAE7kG,EAAE6kG,EAAE,OAAOt6F,EAAEs6F,EAAEvpF,WAAWnjB,EAAEoiB,EAAE,SAASriB,GAAG,MAAO8H,GAAEua,EAAEriB,IAAIqS,EAAEgQ,EAAEriB,KAAM,QAAS8rH,IAAGhkH,EAAEuK,EAAErS,EAAEC,EAAE6F,EAAEuC,GAAqH,GAAlHga,GAAEtc,KAAK,OAAO,aAAaA,KAAKsM,EAAEtM,KAAK/F,EAAE,KAAK+F,KAAKhG,GAAE,EAAGgG,KAAKlG,EAAEwS,EAAEtM,KAAK+B,EAAE9H,IAAIqZ,MAAM,QAAQrT,KAAK,SAASD,KAAKgmB,KAAQhmB,KAAK+B,EAAEikH,IAAI,KAAM,IAAI/jB,IAAE,iBAAiB,4GAA6I,IAAhCjiG,KAAK1E,EAAE,cAAc0E,KAAK+B,EAAEkkH,KAAQ5vB,GAAG/pF,KAAKtM,KAAK1E,GAAG+6F,GAAG/pF,GAAG45G,gBAAgB,KAAM,IAAIjkB,IAAE,iBAAiB,8EAA+EjiG,MAAKsxF,EAAE,GAAI6d,IAAGptG,EAAEO,GAAG,KAAKvC,GAAG,MAC17BC,KAAK3F,EAAEH,GAAG,WAAW,MAAO,MAAM,IAAI8rB,GAAEhmB,IAAKA,MAAKnG,IAAK,IAAIC,GAAEkG,KAAK+B,EAAEokH,GAAInmH,MAAK+B,EAAEokH,IAAI,SAASpkH,GAAW,GAARqkH,GAAGpgG,EAAEjkB,GAAM,kBAAoBjI,GAAEA,EAAEiI,OAAQ,IAAG,gBAAkBjI,GAAE,CAAC,GAAIwS,GAAEiQ,GAAEziB,EAAEgT,GAAG,mBAAoBR,IAAGA,EAAEvK,IAAK,IAAIpH,GAAEqF,KAAK+B,EAAEskH,GAAIrmH,MAAK+B,EAAEskH,IAAI,WAAsB,GAAXD,GAAGpgG,EAAE,MAAS,kBAAoBrrB,GAAEA,QAAS,IAAG,gBAAkBA,GAAE,CAAC,GAAIoH,GAAEwa,GAAE5hB,EAAEmS,GAAG,mBAAoB/K,IAAGA,MAAqE,QAASqkH,IAAGrkH,EAAEuK,GAAG,IAAI,GAAIrS,GAAE,EAAEA,EAAE8H,EAAElI,EAAEkC,OAAO9B,IAAI,IAAI8H,EAAElI,EAAEI,GAAGqS,GAAG,MAAMpS,KACpe,QAASosH,IAAGvkH,EAAEuK,GAAGmmF,EAAG1wF,EAAElI,EAAE,SAASkI,GAAG,MAAOA,IAAGuK,IAAI,QAASi6G,IAAGxkH,EAAEuK,GAA2C,MAAxCvK,GAAEikB,EAAE/pB,KAAKqQ,GAAGupF,GAAGvpF,EAAE,WAAWkmF,EAAGzwF,EAAEikB,EAAE1Z,KAAYA,EAGlH,QAASk6G,IAAGzkH,GAAG,GAAGA,EAAE/H,EAAE,KAAM,IAAIioG,IAAE,iBAAiB,kDACnD,QAASwkB,MAAKzmH,KAAKsM,EAAEQ,GAAE45G,WAAW/4G,IAAS,EAAE3N,KAAK/F,EAAE,KAAK+F,KAAK+B,EAAE,QAAQiK,KAAKC,MAAM,IAAID,KAAK8e,UAAUxc,WACtG,QAASq4G,IAAG5kH,EAAEuK,GAAG,MAAO,IAAIyoF,GAAE,SAAS96F,EAAEC,GAAG,GAAG4tG,KAAK,IAAIh7F,GAAE45G,YAAYp6G,IAAIvK,EAAE9H,IAAI8H,EAAEuK,EAAE,CAACQ,GAAE/K,EAAEA,GAAG,WAAW,GAAG+K,GAAE45G,WAAW,CAAC3kH,EAAE9H,EAAEqS,CAAE,IAAIvM,GAAE+M,GAAE45G,WAAWxiH,MAAO4I,IAAE45G,WAAWxiH,OAAO,SAASoI,EAAErS,GAAkB,MAAfqS,GAAEvM,EAAEuM,EAAErS,GAAG8H,EAAEuK,IAAWA,GAAGrS,QAASC,GAAE,GAAI+nG,IAAE,yBAA0Bn1F,IAAE/K,EAAEA,GAAI,IAAIhC,GAAEk3F,GAAG2vB,IAAIjtD,OAAO53D,EAAEA,EAAEihH,GAAG12G,GAAG,IAAKg8D,IAAEm7B,GAAG1jG,IAAI7E,EAAE,WAAWhB,EAAE,GAAI+nG,IAAE,iBAAiB,0DAA2DhoG,SAASC,GAAE,GAAI+nG,IAAE,6BACpa,QAAS4kB,MAAqB,MAAhBC,MAAKA,GAAG,GAAIL,KAAWK,GAAG,QAASC,IAAGhlH,EAAEuK,EAAErS,GAAG,IAAI+F,KAAKsC,EAAErI,GAAG4uB,GAASsO,MAAM,MAAM70B,GAAG,KAAM,IAAI2/F,IAAE,iBAAiB,0DAA2D,IAAGjiG,KAAKsC,EAAEhG,UAAS0D,KAAKsC,EAAEhG,QAAQyjH,OAAoC,KAAM,IAAI9d,IAAE,kBAAzChoG,GAAE+F,KAAKsC,EAAEhG,QAAQyjH,MAA2C,IAAI7lH,GAAE8F,KAAKD,EAAE,IAAK,KAAIA,EAAEC,KAAKsC,EAAE2oE,OAAOynB,KAAK,MAAMpwF,IAAIvC,EAAE8oB,GAASynB,YAAYw2D,GAAGj+E,GAASynB,YAAYvwC,GAAG,KAAKgmH,GAAGhsH,KAAKiG,KAAK/F,EAAE8H,EAAEuK,EAAE,WAAW,IAAI,GAAIvK,GAAE7H,EAAEoI,EAAE2oE,OAAOs5C,IAAI,MAAMv+F,GAAGjkB,EAAE,KAAK,MAAOA,IAAGhC,EAAEq2G,GAAGqH,KAAc,QAAS1P,IAAEhsG,EAAEuK,GAAG,IAAI,GAAIrS,KAAKqS,GAAE,CAAC,GAAIpS,GAAEoS,EAAErS,GAAGE,IAAK4H,GAAE7H,GAAG8sH,GAAG9sH,EAAE6H,EAAE9H,GAAGqS,EAAErS,GAAGoI,IAAI,QAASwgH,IAAE9gH,EAAEuK,EAAErS,EAAEC,GAAG6H,EAAEuK,GAAG06G,GAAG16G,EAAErS,EAAEC,GAAG,QAAS8sH,IAAGjlH,EAAEuK,EAAErS,GAAG,QAASC,KAAI,GAAI6H,GAAEwH,MAAMxO,UAAU6B,MAAM7C,KAAK+B,UAAqB,OAAVmpH,IAAGllH,EAAE9F,EAAE8H,GAAUuK,EAAE7C,MAAMzJ,KAAK+B,GAAG,IAAI9H,EAAE,MAAOqS,EAAE,IAAYhK,GAARvC,EAAEknH,GAAGllH,EAAK,KAAIO,IAAKgK,GAAEpS,EAAEoI,GAAGgK,EAAEhK,EAAG,KAAIA,IAAKgK,GAAEvR,UAAUb,EAAEa,UAAUuH,GAAGgK,EAAEvR,UAAUuH,EAAG,OAAOpI,GAAE,QAAS+sH,IAAGllH,GAAkB,MAAfA,GAAEA,EAAE+O,MAAM,KAAY/O,EAAEA,EAAEhG,OAAO,GAjRl2B,GACIT,IADAutB,GAAWrvB,EAAQ,IAAiBsO,QAClC0gE,GAAGA,OAAO17D,GAAE9M,KAE8Tq5F,GAAG,gBAAgB,IAAIrtF,KAAK8e,WAAW,GAAG2sE,GAAG,EAExOgT,GAAGtqF,KAAKoyB,KAAK,WAAW,OAAO,GAAIpyB,MAAoZ7Z,GAAEgrF,EAAE3mF,OAAO2mF,EAAEv2F,UAAUZ,KAAK,aAAyK,IAAIw5F,IAAGv3F,OAAOrB,UAAUmI,KAAK,SAASnB,GAAG,MAAOA,GAAEmB,QAAQ,SAASnB,GAAG,MAAOA,GAAE7C,QAAQ,yBAAyB,KAC1jBwyF,GAAG,KAAKC,GAAG,KAAKC,GAAG,KAAKC,GAAG,KAAKC,GAAG,KAAKC,GAAG,QAAQN,GAAG,aAAmKnrF,GAAE2rF,EAAGX,GAAGW,EAAGl3F,UAAUZ,KAAK,gBAAkH,IAGxkBy4F,IAH4kBL,GAAGhpF,MAAMxO,UAAUkQ,QAAQ,SAASlJ,EAAEuK,EAAErS,GAAG,MAAOsP,OAAMxO,UAAUkQ,QAAQlR,KAAKgI,EAAEuK,EAAErS,IAAI,SAAS8H,EAAEuK,EAAErS,GAA4C,GAAzCA,EAAE,MAAMA,EAAE,EAAE,EAAEA,EAAE+R,KAAK8G,IAAI,EAAE/Q,EAAEhG,OAAO9B,GAAGA,EAAKD,EAAE+H,GAAG,MAAO/H,GAAEsS,IAAI,GAAGA,EAAEvQ,OAAOgG,EAAEkJ,QAAQqB,EAAErS,IAAI,CAAE,MAAKA,EAAE8H,EAAEhG,OAAO9B,IAAI,GAAGA,IAAK8H,IAAGA,EAAE9H,KAAKqS,EAAE,MAAOrS,EAAE,QAAO,GAAGu+F,GAAEjvF,MAAMxO,UAAUqS,QAAQ,SAASrL,EAAEuK,EAAErS,GAAGsP,MAAMxO,UAAUqS,QAAQrT,KAAKgI,EAAEuK,EAAErS,IAAI,SAAS8H,EAAEuK,EAAErS,GAAG,IAAI,GAAIC,GAAE6H,EAAEhG,OAAOgE,EAAE/F,EAAE+H,GAAGA,EAAE+O,MAAM,IAAI/O,EAAEO,EAAE,EAAEA,EAAEpI,EAAEoI,IAAIA,IAAKvC,IAAGuM,EAAEvS,KAAKE,EAAE8F,EAAEuC,GAAGA,EAAEP,IACj/B+7F,GAAGv0F,MAAMxO,UAAUyV,IAAI,SAASzO,EAAEuK,EAAErS,GAAG,MAAOsP,OAAMxO,UAAUyV,IAAIzW,KAAKgI,EAAEuK,EAAErS,IAAI,SAAS8H,EAAEuK,EAAErS,GAAG,IAAI,GAAIC,GAAE6H,EAAEhG,OAAOgE,EAAEwJ,MAAMrP,GAAGoI,EAAEtI,EAAE+H,GAAGA,EAAE+O,MAAM,IAAI/O,EAAEikB,EAAE,EAAEA,EAAE9rB,EAAE8rB,IAAIA,IAAK1jB,KAAIvC,EAAEimB,GAAG1Z,EAAEvS,KAAKE,EAAEqI,EAAE0jB,GAAGA,EAAEjkB,GAAI,OAAOhC,IAAG6+F,GAAGr1F,MAAMxO,UAAUmsH,KAAK,SAASnlH,EAAEuK,EAAErS,GAAG,MAAOsP,OAAMxO,UAAUmsH,KAAKntH,KAAKgI,EAAEuK,EAAErS,IAAI,SAAS8H,EAAEuK,EAAErS,GAAG,IAAI,GAAIC,GAAE6H,EAAEhG,OAAOgE,EAAE/F,EAAE+H,GAAGA,EAAE+O,MAAM,IAAI/O,EAAEO,EAAE,EAAEA,EAAEpI,EAAEoI,IAAI,GAAGA,IAAKvC,IAAGuM,EAAEvS,KAAKE,EAAE8F,EAAEuC,GAAGA,EAAEP,GAAG,OAAM,CAAG,QAAM,EAE7YA,GAAE,CAAC,GAAImpG,IAAGp+F,GAAE4b,SAAU,IAAGwiF,GAAG,CAAC,GAAI4C,IAAG5C,GAAG/vC,SAAU,IAAG2yC,GAAG,CAAClb,GAAGkb,EAAG,MAAM/rG,IAAG6wF,GAAG,GAAua,GAAIQ,IAAG,gGAAgGtiF,MAAM,IAC1euiF,GAAG,KAAK1C,CAA8F,IAAmRiD,IAA/QuzB,GAAGlhF,EAAE,SAASC,GAAED,EAAE,YAAYA,EAAE,QAAQqwE,GAAGrwE,EAAE,QAAQigE,GAAGoQ,IAAIpwE,GAAEra,GAAGoa,EAAE,YAAYz4B,EAAEolF,GAAG/0F,cAAc,YAAYooC,EAAE,YAAYA,EAAE,YAAYA,EAAE,WAAWA,EAAE,QAAQmhF,GAAG55G,EAAEolF,GAAG/0F,cAAc,YAAYooC,EAAE,OAC5gBlkC,GAAE,CAAC,GAAIslH,IAAG,GAAGC,GAAG,WAAW,GAAIvlH,GAAE6wF,EAAG,OAAG/mE,IAAS,sBAAsBjK,KAAK7f,GAAMu0G,GAAS,kBAAkB10F,KAAK7f,GAAMmkC,GAAQ,mCAAmCtkB,KAAK7f,GAAMqlH,GAAS,gBAAgBxlG,KAAK7f,GAAMolH,GAAS,yBAAyBvlG,KAAK7f,OAA1C,KAAqE,IAArBulH,KAAKD,GAAGC,GAAGA,GAAG,GAAG,IAAOphF,GAAE,CAAC,GAAIkrD,IAAGoC,GAAK,IAAG,MAAMpC,IAAIA,GAAGjuE,WAAWkkG,IAAI,CAACzzB,GAAGx3F,OAAOg1F,GAAI,MAAMrvF,IAAG6xF,GAAGyzB,GAAG,GAC2H1iB,IADvHpR,MAC8Hg0B,GAAGz6G,GAAE5O,QACzeymG,IAAG4iB,IAAIrhF,GAAEstD,MAAO,cAAc+zB,GAAGC,WAAWp5G,SAASwlF,GAAG,IAAI,OAAG,GAAwOI,EAAGj5F,UAAUL,IAAI,WAAW,GAAG,EAAEsF,KAAKsM,EAAE,CAACtM,KAAKsM,GAAI,IAAIvK,GAAE/B,KAAK+B,CAAE/B,MAAK+B,EAAEA,EAAE0B,KAAK1B,EAAE0B,KAAK,SAAU1B,GAAE/B,KAAK/F,GAAI,OAAO8H,GAA8D,IAAI4yF,IAAG,GAAIX,GAAG,WAAW,MAAO,IAAII,IAAI,SAASryF,GAAGA,EAAEghC,SAAS,IAA6IqxD,GAAGr5F,UAAUqP,IAAI,SAASrI,EAAEuK,GAAGtM,KAAK+B,EAAEA,EAAE/B,KAAKsM,EAAEA,EAAEtM,KAAKyD,KAAK,MAAM2wF,EAAGr5F,UAAUgoC,MAAM,WAAW/iC,KAAKyD,KAAKzD,KAAKsM,EAAEtM,KAAK+B,EAAE,KAA0D,IAAI+yF,IAG3jBN,GAAqTE,IAAG,EAAGP,GAAG,GAAI,YAAWn0F,KAAKsM,EAAEtM,KAAK+B,EAAE,MAC/PizF,GAAG,EAAEE,GAAG,EAAEE,GAAG,CAAqEC,IAAGt6F,UAAUgoC,MAAM,WAAW/iC,KAAKsC,EAAEtC,KAAKsM,EAAEtM,KAAKgmB,EAAEhmB,KAAK+B,EAAE,KAAK/B,KAAK/F,GAAE,EAC/gB,IAAIs7F,IAAG,GAAIvB,GAAG,WAAW,MAAO,IAAIqB,KAAI,SAAStzF,GAAGA,EAAEghC,SAAS,IACwJgyD,GAAEh6F,UAAUwM,KAAK,SAASxF,EAAEuK,EAAErS,GAAG,MAAOk8F,IAAGn2F,KAAK/E,EAAE8G,GAAGA,EAAE,KAAK9G,EAAEqR,GAAGA,EAAE,KAAKrS,IAAI45F,EAAGkB,GAA6Dz5F,GAAEy5F,EAAEh6F,UAAUO,GAAEJ,EAAE,SAAS6G,EAAEuK,GAAG,MAAO6pF,IAAGn2F,KAAK,KAAK+B,EAAEuK,IAAIhR,GAAEojD,OAAO,SAAS38C,GAAG/B,KAAK+B,GAAGizF,IAAIT,EAAG,WAA2BwB,GAAG/1F,KAAb,GAAIm1F,IAAGpzF,KAAe/B,OAEtO1E,GAAE+6F,GAAG,SAASt0F,GAAG/B,KAAK+B,EAAEizF,GAAGC,GAAGj1F,KAAKk1F,GAAGnzF,IAAIzG,GAAEg7F,GAAG,SAASv0F,GAAG/B,KAAK+B,EAAEizF,GAAGC,GAAGj1F,KAAKo1F,GAAGrzF,IAE1EzG,GAAEo6F,GAAG,WAAW,IAAI,GAAI3zF,GAAEA,EAAEi0F,GAAGh2F,OAAOi2F,GAAGj2F,KAAK+B,EAAE/B,KAAK+B,EAAE/B,KAAKnG,EAAGmG,MAAK1E,GAAE,EAC9C,IAAIo7F,IAAGrC,CAAiC/tF,GAAE6uF,GAAG7D,GAAG6D,GAAGp6F,UAAUZ,KAAK,QAAS,IAAIk+F,KAAInyD,IAAG,GAAG56B,OAAOq5F,GAAsChO,IAAG57F,UAAUm2F,IAAG,EAAGyF,GAAG57F,UAAU08F,GAAG,WAAW,MAAOz3F,MAAK+B,GAAG40F,GAAG57F,UAAUuT,SAAS,WAAW,MAAM,SAAStO,KAAK+B,EAAE,IAA0J,IAAI60F,MAAiDE,IAAG,IAAsCC,GAAGh8F,UAAUm2F,IAAG,EAAG6F,GAAGh8F,UAAU08F,GAAG,WAAW,MAAOz3F,MAAK+B,GAAGg1F,GAAGh8F,UAAUuT,SAAS,WAAW,MAAM,sBAAsBtO,KAAK+B,EAAE,IAChiB,IAAIq1F,IAAG,YAAYD,GAAG,kEAAkEt1F,KAAwCw1F,IAAGt8F,UAAUm2F,IAAG,EAAGmG,GAAGt8F,UAAU08F,GAAG,WAAW,MAAOz3F,MAAK+B,GAAGs1F,GAAGt8F,UAAUuT,SAAS,WAAW,MAAM,WAAWtO,KAAK+B,EAAE,IAA6K,IAAI21F,IAAG,qDAC/pBJ,KAAiDK,IAAG,eAAiDC,GAAG78F,UAAUm2F,IAAG,EAAG0G,GAAG78F,UAAU08F,GAAG,WAAW,MAAOz3F,MAAK+B,GAAG61F,GAAG78F,UAAUuT,SAAS,WAAW,MAAM,YAAYtO,KAAK+B,EAAE,IAA+K,IAAI81F,MAAiDE,IAAG,mBAAmBA,GAAG,IAAIA,GAAG,OAC9lB,IAAIG,KAAIuvB,YAAY,cAAcC,YAAY,cAAcC,QAAQ,UAAUC,YAAY,cAAcljG,OAAO,SAASmjG,UAAU,YAAYC,MAAM,QAAQz+E,KAAK,OAAO0+E,QAAQ,UAAU9nH,KAAK,OAAO+nH,OAAO,SAASC,OAAO,SAASnsG,MAAM,SAIxEm9E,IAAIivB,IAAI,MAAMC,KAAK,OAAOC,IAAI,MAAMC,KAAK,MAAMC,KAAK,MAAMC,KAAK,MAAMC,KAAK,MAAMC,KAAK,MAAMC,KAAO,WAAW1vB,GAAG,SAASl6F,KAAK,KAAU,8BAA8B,4BACtFq6F,GAAG,EAAEC,KAAMF,IAAGn+F,UAAUw2F,IAAG,EAAqF2H,GAAGn+F,UAAU42F,GAAG,WAAW,GAAG3xF,KAAKoyF,GAAG,KAAKpyF,KAAKoyF,GAAGr2F,QAAQiE,KAAKoyF,GAAGzrE,UAAW,IAAIgiG,IAAGruH,OAAOsuH,QAAQ,SAAS7mH,GAAG,MAAOA,IAAOsvF,IAAInrD,IAAG,GAAG56B,OAAOq5F,IAAIb,GAAG59D,KAAIwtD,EAAG,KAAKiI,GAAG,WAAW,IAAI7uF,GAAE1N,mBAAmB9E,OAAOC,eAAe,OAAM,CAAG,IAAIwH,IAAE,EAAGuK,EAAEhS,OAAOC,kBAAkB,WAAWG,IAAI,WAAWqH,GAAE,IAAyE,OAAnE+K,IAAE1N,iBAAiB,OAAOuxF,EAAGrkF,GAAGQ,GAAExN,oBAAoB,OAAOqxF,EAAGrkF,GAAUvK,IAAiEw3F,IAAEx+F,UAAUd,EAAE,WAAW+F,KAAKy0F,IAAG,GAEzqBnuF,EAAEkzF,GAAGD,GAAG,IAAImB,IAAGiuB,IAAIE,EAAE,QAAQC,EAAE,MAAMC,EAAE,SAAUvvB,IAAGz+F,UAAUd,EAAE,WAAWu/F,GAAGpI,GAAGn3F,EAAEF,KAAKiG,KAAM,IAAI+B,GAAE/B,KAAK+B,CAAE,IAAGA,EAAEinH,eAAejnH,EAAEinH,qBAAsB,IAAGjnH,EAAEw6F,aAAY,EAAGuH,GAAG,KAAO/hG,EAAEk4F,SAAS,KAAKl4F,EAAEu6F,SAAS,KAAKv6F,EAAEu6F,WAAQv6F,EAAEu6F,SAAS,GAAE,MAAMhwF,MAAMktF,GAAGz+F,UAAUirB,EAAE,WAAW,MAAOhmB,MAAK+B,EAAG,IAAIu5F,IAAG,uBAAuB,IAAItvF,KAAK8e,SAAS,GAAGgwE,GAAG,EAAopBY,GAAG,eAAe,IAAI1vF,KAAK8e,SAAS,GAAGqxE,MAAMN,GAAG,EAOvmCW,GAAG,wBAAwB,IAAIxwF,KAAK8e,WAAW,EAA8KxkB,GAAEo2F,GAAExD,IAAIwD,GAAE3hG,UAAUugG,KAAI,EAAGoB,GAAE3hG,UAAUuE,oBAAoB,SAASyC,EAAEuK,EAAErS,EAAEC,GAAG8hG,GAAEh8F,KAAK+B,EAAEuK,EAAErS,EAAEC,IAEhYwiG,GAAE3hG,UAAU42F,GAAG,WAA8B,GAAnB+K,GAAEtL,GAAGO,GAAG53F,KAAKiG,MAASA,KAAKsxF,EAAE,CAAC,GAAiBr3F,GAAb8H,EAAE/B,KAAKsxF,EAAEhlF,EAAE,CAAI,KAAIrS,IAAK8H,GAAEA,EAAE,CAAC,IAAI,GAAI7H,GAAE6H,EAAEA,EAAE9H,GAAG8F,EAAE,EAAEA,EAAE7F,EAAE6B,OAAOgE,MAAMuM,EAAEyuF,GAAG7gG,EAAE6F,UAAWgC,GAAEA,EAAE9H,GAAG8H,EAAEuK,KAAKtM,KAAK+yF,GAAG,MAAsvBgK,GAAGhiG,UAAUgH,EAAE,IAAK,IAAIknH,IAAG,CAAElsB,IAAGhiG,UAAUgoC,MAAM,SAAShhC,EAAEuK,EAAErS,EAAEC,EAAE6F,GAAG,gBAAiBA,IAAGkpH,KAAK/uH,GAAGuwG,KAAKzqG,KAAKsM,EAAEA,QAAStM,MAAK+B,GAA+Fk7F,GAAGliG,UAAUuT,SAAS,WAAW,MAAOtO,MAAK7F,KAAM,IAAIopG,IAAG,GAAItG,IAAG,SAAS,KAAKK,GAAG,GAAIL,IAAG,SAAS,KAAKW,GAAG,GAAIX,IAAG,OAAO,IAC9uCD,IAAGjiG,UAAUmP,IAAI,SAASnI,EAAEuK,EAAErS,GAAG,GAAG8H,EAAE3G,OAAO8hG,GAAGl9F,MAAM5E,MAAM,IAAIH,EAAEqR,KAAKA,EAAEA,KAAKvK,EAAE,GAAIg7F,IAAGh7F,EAAE3F,OAAOkQ,GAAGtM,KAAKsC,GAAGrI,IAAI8H,EAAEA,EAAE9H,GAAGA,EAAE,OAAO8H,EAAEuK,GAAGvK,EAAE+K,GAAE7C,UAAUlI,EAAEmnH,WAAWnnH,EAAEmnH,UAAUjvH,IAAI8H,EAAE+K,GAAEq8G,sBAAsBpnH,EAAE9H,GAAGA,EAAE+F,KAAK/F,GAAGA,EAAEA,EAAE8H,EAAG,IAAIs7F,OAAMD,GAAG,IAA+e9hG,IAAEiiG,GAAGxiG,UAAUO,GAAEkiG,EAAE,WAAWC,GAAGz9F,KAAM,KAAI,GAAI+B,MAAKuK,EAAE,EAAEA,EAAEtM,KAAK+B,EAAEhG,OAAOuQ,IAAIvK,EAAE9F,KAAK+D,KAAKsM,EAAEtM,KAAK+B,EAAEuK,IAAK,OAAOvK,IAAGzG,GAAE+gB,EAAE,WAAoB,MAATohF,IAAGz9F,MAAaA,KAAK+B,EAAEyI,UACj3BlP,GAAEmqD,MAAM,WAAWzlD,KAAKsM,KAAKtM,KAAK/F,EAAE+F,KAAK+B,EAAEhG,OAAO,GAAwOT,GAAEZ,IAAI,SAASqH,EAAEuK,GAAG,MAAOoxF,IAAG19F,KAAKsM,EAAEvK,GAAG/B,KAAKsM,EAAEvK,GAAGuK,GAAGhR,GAAE8O,IAAI,SAASrI,EAAEuK,GAAGoxF,GAAG19F,KAAKsM,EAAEvK,KAAK/B,KAAK/F,IAAI+F,KAAK+B,EAAE9F,KAAK8F,IAAI/B,KAAKsM,EAAEvK,GAAGuK,GACrZhR,GAAE8R,QAAQ,SAASrL,EAAEuK,GAAG,IAAI,GAAIrS,GAAE+F,KAAKqc,IAAIniB,EAAE,EAAEA,EAAED,EAAE8B,OAAO7B,IAAI,CAAC,GAAI6F,GAAE9F,EAAEC,GAAGoI,EAAEtC,KAAKtF,IAAIqF,EAAGgC,GAAEhI,KAAKuS,EAAEhK,EAAEvC,EAAEC,OAAgN,IAAIm+F,IAAG,KAAKF,GAAG,IAM5LG,IAAGrjG,UAAU2jD,OAAO,SAAS38C,GAAG,GAAG/B,KAAK+B,EAAE/B,KAAK/F,YAAamkG,KAAIp+F,KAAK/F,EAAEykD,aAAa,CAAC,GAAG1+C,KAAKsM,EAAE,CAAC,GAAIA,GAAEtM,KAAKsM,QAAStM,MAAKsM,EAAEvK,EAAEuK,EAAEoyC,OAAO38C,GAAU,KAANuK,EAAExS,GAAYwS,EAAEoyC,SAAU1+C,KAAKwN,EAAExN,KAAKwN,EAAEzT,KAAKiG,KAAK3F,EAAE2F,MAAMA,KAAKsxF,GAAE,EAAGtxF,KAAK+B,IAAIA,EAAE,GAAIg9F,IAAGR,GAAGv+F,MAAMq+F,GAAGr+F,MAAK,EAAG+B,MAAMq8F,GAAGrjG,UAAUf,EAAE,SAAS+H,EAAEuK,GAAGtM,KAAKnG,GAAE,EAAGwkG,GAAGr+F,KAAK+B,EAAEuK,IAC/X8xF,GAAGrjG,UAAUutE,EAAE,SAASvmE,GAAGw8F,GAAGv+F,MAAMq+F,GAAGr+F,MAAK,EAAG+B,IAA2Fq8F,GAAGrjG,UAAUwM,KAAK,SAASxF,EAAEuK,EAAErS,GAAG,GAAIC,GAAE6F,EAAEuC,EAAE,GAAIyyF,GAAE,SAAShzF,EAAEuK,GAAGpS,EAAE6H,EAAEhC,EAAEuM,GAA4D,OAAxDoyF,IAAG1+F,KAAK9F,EAAE,SAAS6H,GAAGA,YAAag9F,IAAGz8F,EAAEo8C,SAAS3+C,EAAEgC,KAAYO,EAAEiF,KAAKxF,EAAEuK,EAAErS,IAAI45F,EAAGuK,IAEjS93F,EAAEk4F,GAAGlN,GAAGkN,GAAGzjG,UAAUuO,QAAQ,6BAA6Bk1F,GAAGzjG,UAAUZ,KAAK,qBAAgDmM,EAAEy4F,GAAGzN,GAAGyN,GAAGhkG,UAAUuO,QAAQ,wBAAwBy1F,GAAGhkG,UAAUZ,KAAK,gBAA8E2kG,GAAG/jG,UAAUd,EAAE,WAA6B,YAAX4kG,IAAG7+F,KAAK+B,GAAS/B,KAAKsM,EAAI,IAA8R+yF,IAA1RR,KAA6Rv4F,GAAE24F,GAAGD,GAAI,KAAI,GAAIE,IAAG,GAAGkqB,GAAGlqB,GAAG,EAAEmqB,MAAMC,GAAG,EAAEA,GAAGF,GAAGE,KAAKD,GAAGC,IAAI,CAAE,IAAIvN,IAAGrpB,EAAG,IAAI22B,GAAIpqB,IAAGlkG,UAAUgoC,MAAM,WAAW/iC,KAAKgmB,EAAEhmB,KAAK/F,EAAE,EAAE+F,KAAK+B,EAAE+K,GAAEsyF,WAAW,GAAIA,YAAWp/F,KAAK1E,GAAGq3F,EAAG3yF,KAAK1E,GAIt1B,IAAIgkG,KAAI,WAAW,WAAW,WAAW,WAAW,UAAU,WAAW,WAAW,WAAW,WAAW,UAAU,UAAU,WAAW,WAAW,WAAW,WAAW,WAAW,WAAW,WAAW,UAAU,UAAU,UAAU,WAAW,WAAW,WAAW,WAAW,WAAW,WAAW,WAAW,WAAW,WAAW,UAAU,UAAU,UAAU,UAAU,WAAW,WAAW,WAAW,WAAW,WAAW,WAAW,WAAW,WAAW,WAAW,WAAW,WAAW,WAC7e,WAAW,UAAU,UAAU,UAAU,UAAU,UAAU,UAAU,WAAW,WAAW,WAAW,WAAW,WAAW,WAAW,WAAW,WAAW,WAAW,WAAW,WAA6Ch5F,GAAEs5F,GAAGX,GAAI,IAAIY,KAAI,WAAW,WAAW,WAAW,WAAW,WAAW,WAAW,UAAU,YACtHU,GAAG,0HAC5ML,IAAGnlG,UAAUuT,SAAS,WAAW,GAAIvM,MAAKuK,EAAEtM,KAAK/F,CAAEqS,IAAGvK,EAAE9F,KAAKykG,GAAGp0F,EAAEi9G,IAAG,GAAI,IAAK,IAAItvH,GAAE+F,KAAKsM,CAAuV,QAAlVrS,GAAG,QAAQqS,KAAEvK,EAAE9F,KAAK,OAAOqQ,EAAEtM,KAAKlG,IAAIiI,EAAE9F,KAAKykG,GAAGp0F,EAAEi9G,IAAG,GAAI,KAAKxnH,EAAE9F,KAAKsV,mBAAmBnV,OAAOnC,IAAIiF,QAAQ,uBAAuB,QAAiB,OAATjF,EAAE+F,KAAKnG,IAAWkI,EAAE9F,KAAK,IAAIG,OAAOnC,MAAOA,EAAE+F,KAAKgmB,KAAEhmB,KAAKsM,GAAG,KAAKrS,EAAE0qC,OAAO,IAAI5iC,EAAE9F,KAAK,KAAK8F,EAAE9F,KAAKykG,GAAGzmG,EAAE,KAAKA,EAAE0qC,OAAO,GAAG6kF,GAAGC,IAAG,MAAMxvH,EAAE+F,KAAK+B,EAAEuM,aAAavM,EAAE9F,KAAK,IAAIhC,IAAIA,EAAE+F,KAAK1E,IAAIyG,EAAE9F,KAAK,IAAIykG,GAAGzmG,EAAEyvH,KAAY3nH,EAAEkM,KAAK,IAE1J,IAAIs7G,IAAG,YAAYE,GAAG,WAAWD,GAAG,UAAU7oB,GAAG,WAAW+oB,GAAG,IAEpNpuH,IAAE+kG,GAAGtlG,UAAUO,GAAEmqD,MAAM,WAAWzlD,KAAK+B,EAAE/B,KAAK/F,EAAE,KAAK+F,KAAKsM,EAAE,GAAuDhR,GAAE8R,QAAQ,SAASrL,EAAEuK,GAAG60F,GAAGnhG,MAAMA,KAAK+B,EAAEqL,QAAQ,SAASnT,EAAEC,GAAGs+F,GAAEv+F,EAAE,SAASA,GAAG8H,EAAEhI,KAAKuS,EAAErS,EAAEC,EAAE8F,OAAOA,OAAOA,OAAO1E,GAAE+gB,EAAE,WAAW8kF,GAAGnhG,KAAM,KAAI,GAAI+B,GAAE/B,KAAK+B,EAAEy7F,IAAIlxF,EAAEtM,KAAK+B,EAAEsa,IAAIpiB,KAAKC,EAAE,EAAEA,EAAEoS,EAAEvQ,OAAO7B,IAAI,IAAI,GAAI6F,GAAEgC,EAAE7H,GAAGoI,EAAE,EAAEA,EAAEvC,EAAEhE,OAAOuG,IAAIrI,EAAEgC,KAAKqQ,EAAEpS,GAAI,OAAOD,IAC1fqB,GAAEkiG,EAAE,SAASz7F,GAAGo/F,GAAGnhG,KAAM,IAAIsM,KAAK,IAAGtS,EAAE+H,GAAG0/F,GAAGzhG,KAAK+B,KAAKuK,EAAEomF,EAAGpmF,EAAEtM,KAAK+B,EAAErH,IAAI6mG,GAAGvhG,KAAK+B,UAAU,CAACA,EAAE/B,KAAK+B,EAAEy7F,GAAI,KAAI,GAAIvjG,GAAE,EAAEA,EAAE8H,EAAEhG,OAAO9B,IAAIqS,EAAEomF,EAAGpmF,EAAEvK,EAAE9H,IAAI,MAAOqS,IAAGhR,GAAE8O,IAAI,SAASrI,EAAEuK,GAA4G,MAAzG60F,IAAGnhG,MAAMA,KAAK/F,EAAE,KAAK8H,EAAEw/F,GAAGvhG,KAAK+B,GAAG0/F,GAAGzhG,KAAK+B,KAAK/B,KAAKsM,GAAGtM,KAAK+B,EAAErH,IAAIqH,GAAGhG,QAAQiE,KAAK+B,EAAEqI,IAAIrI,GAAGuK,IAAItM,KAAKsM,GAAG,EAAStM,MAAM1E,GAAEZ,IAAI,SAASqH,EAAEuK,GAAoB,MAAjBvK,GAAEA,EAAE/B,KAAKw9F,EAAEz7F,MAAa,EAAEA,EAAEhG,OAAOK,OAAO2F,EAAE,IAAIuK,GACzWhR,GAAEgT,SAAS,WAAW,GAAGtO,KAAK/F,EAAE,MAAO+F,MAAK/F,CAAE,KAAI+F,KAAK+B,EAAE,MAAM,EAAG,KAAI,GAAIA,MAAKuK,EAAEtM,KAAK+B,EAAEsa,IAAIpiB,EAAE,EAAEA,EAAEqS,EAAEvQ,OAAO9B,IAAI,CAAC,GAAIC,GAAEoS,EAAErS,GAAG8F,EAAEwR,mBAAmBnV,OAAOlC,GAAIA,GAAE8F,KAAKw9F,EAAEtjG,EAAG,KAAI,GAAIoI,GAAE,EAAEA,EAAEpI,EAAE6B,OAAOuG,IAAI,CAAC,GAAI0jB,GAAEjmB,CAAE,MAAK7F,EAAEoI,KAAK0jB,GAAG,IAAIzU,mBAAmBnV,OAAOlC,EAAEoI,MAAMP,EAAE9F,KAAK+pB,IAAI,MAAOhmB,MAAK/F,EAAE8H,EAAEkM,KAAK,MAA0NyzF,GAAG3mG,UAAUd,EAAE,IAA6C,IAAIkoG,GAAkB77F,GAAEs7F,GAAGF,IAAIE,GAAG7mG,UAAUgH,EAAE,WAAW,GAAIA,GAAE8/F,GAAG7hG,KAAM,OAAO+B,GAAE,GAAI+/F,eAAc//F,GAAG,GAAIkmF,iBAAgB2Z,GAAG7mG,UAAUuR,EAAE,WAAW,GAAIvK,KAAiC,OAA5B8/F,IAAG7hG,QAAQ+B,EAAE,IAAG,EAAGA,EAAE,IAAG,GAAWA,GACtXogG,GAAG,GAAIP,IAAsMt7F,EAAEy7F,GAAGrF,GAAG,IAAIsF,IAAG,GAAG2nB,GAAG5nB,GAAGhnG,UAAU6uH,GAAGzsB,GAAG,iBAAkBwsB,IAAGvnB,EAAEwnB,EAAG,IAAIvmB,IAAG,YAAYb,IAAI,OAAO,MAGngBlnG,IAAEymG,GAAGhnG,UAAUO,GAAEsjG,GAAG,eAAW,KAAoBp2B,IAAIxoE,KAAK+B,IAAI/B,KAAKgmB,EAAE,mBAAmBhmB,KAAKsC,EAAE,eAAeq7F,GAAE39F,KAAKoiG,EAAEC,GAAGriG,KAAKA,KAAKgmB,IAAI22E,GAAE38F,KAAK,WAAWA,KAAK+iG,MAAM,KACjVznG,GAAEynG,MAAM,WAAW/iG,KAAK+B,GAAG/B,KAAKsM,IAAIqxF,GAAE39F,KAAKoiG,EAAEC,GAAGriG,KAAK,aAAaA,KAAKsM,GAAE,EAAGtM,KAAK/F,GAAE,EAAG+F,KAAK+B,EAAEghG,QAAQ/iG,KAAK/F,GAAE,EAAG0iG,GAAE38F,KAAK,YAAY28F,GAAE38F,KAAK,SAASijG,GAAGjjG,QAAQ1E,GAAEq2F,GAAG,WAAW3xF,KAAK+B,IAAI/B,KAAKsM,IAAItM,KAAKsM,GAAE,EAAGtM,KAAK/F,GAAE,EAAG+F,KAAK+B,EAAEghG,QAAQ/iG,KAAK/F,GAAE,GAAIgpG,GAAGjjG,MAAK,IAAK+hG,GAAG3Q,GAAGO,GAAG53F,KAAKiG,OAAO1E,GAAEk5F,GAAG,WAAWx0F,KAAKuxF,KAAKvxF,KAAK28F,GAAG38F,KAAK1E,GAAG0E,KAAK/F,EAAEipG,GAAGljG,MAAMA,KAAK6B,OAAOvG,GAAEuG,GAAG,WAAWqhG,GAAGljG,OAIxW1E,GAAEuuH,YAAY,WAAW,IAAI,IAAI7pH,KAAK+B,EAAE,MAAO,KAAK,IAAG,YAAa/B,MAAK+B,EAAE,MAAO/B,MAAK+B,EAAEgrD,QAAS,QAAO/sD,KAAKlG,GAAG,IAAKkoG,IAAG,IAAK,OAAO,MAAOhiG,MAAK+B,EAAEmmF,YAAa,KAAK,cAAc,GAAG,0BAA2BloF,MAAK+B,EAAE,MAAO/B,MAAK+B,EAAE+nH,uBAAuB,GAAI/nH,GAAE/B,KAAKoiG,CAAkF,OAAhFrgG,IAAGA,EAAEmI,IAAIq5F,GAAG,iBAAiBvjG,KAAKlG,EAAE,wCAAoC,IAAe,KAAK,MAAMwS,GAAG,MAAOqxF,IAAE39F,KAAKoiG,EAAE,yBAAyB91F,EAAEhD,SAAS,MAAiE,IAAIunG,IAAG,0EAEvT9M,GAAG,EAAEF,GAAG,CAAkGv9F,GAAEs9F,GAAGtS,GAAkBhrF,EAAE89F,GAAG1C,IAAI0C,GAAGrpG,UAAUgH,EAAE,WAAW,GAAIA,GAAE,GAAIkmF,eAAe,IAAG,mBAAoBlmF,GAAE,MAAOA,EAAE,IAAG,mBAAoBuiG,gBAAe,MAAO,IAAID,GAAG,MAAM15F,OAAM,wBAAyBy5F,GAAGrpG,UAAUuR,EAAE,WAAW,UACrOhR,GAAE+oG,GAAGtpG,UAAUO,GAAEw2D,KAAK,SAAS/vD,EAAEuK,EAAErS,GAAG,GAAG,MAAMA,IAAIA,EAAE,KAAM0Q,OAAM,qCAAsC3K,MAAK+B,EAAE+vD,KAAK/vD,EAAEuK,IACtZhR,GAAE+3D,KAAK,SAAStxD,GAAG,GAAGA,EAAH,CAAK,GAAG,gBAAiBA,GAAsB,KAAM4I,OAAM,gCAAhC3K,MAAK+B,EAAEsxD,KAAKtxD,OAA0D/B,MAAK+B,EAAEsxD,QAAQ/3D,GAAEynG,MAAM,WAAW/iG,KAAK+B,EAAEghG,SAASznG,GAAEmnG,iBAAiB,aAAannG,GAAEyuH,kBAAkB,SAAShoH,GAAG,MAAM,gBAAgBA,EAAElE,cAAcmC,KAAK+B,EAAEioH,YAAY,IAAI1uH,GAAEy6F,GAAG,WAAW/1F,KAAK+5B,OAAO,IAAI/5B,KAAKkoF,aAAaloF,KAAK+B,EAAEmmF,aAAauc,GAAGzkG,KAAK,IAAI1E,GAAEw5F,GAAG,WAAW90F,KAAK+5B,OAAO,IAAI/5B,KAAKkoF,aAAa,GAAGuc,GAAGzkG,KAAK,IAAI1E,GAAE26F,GAAG,WAAWj2F,KAAK80F,MAC3cx5F,GAAE06F,GAAG,WAAWh2F,KAAK+5B,OAAO,IAAI0qE,GAAGzkG,KAAK,IAAmF1E,GAAE2uH,sBAAsB,WAAW,MAAM,iBAAiBjqH,KAAK+B,EAAEioH,YAK5D,IAAInS,IAAG,uCAEqEjS,GAAG,UAAUX,GAAG,SAE/I8B,IAAIrO,GAAG,mBAAmBE,GAAG,iBAI1GqP,IAAGltG,UAAUL,IAAI,WAAW,MAAOsF,MAAK+B,EAAE/B,KAAKsM,EAAEtM,KAAK/F,EACoF,IAAcquG,IAAV4hB,KAAa,KAAI,GAAIC,MAAM7vH,QAAOC,eAAe4vH,GAAG,QAAQ3vH,cAAa,EAAGC,YAAW,EAAGW,MAAM,IAAId,OAAOC,eAAe4vH,GAAG,QAAQ3vH,cAAa,EAAGC,YAAW,EAAGW,MAAM,IAAIktG,GAAG,GAAG6hB,GAAGC,KAAK,MAAMroH,GAAGumG,IAAG,EAC+E,GAAIO,IAAG,QAAQC,GAAG,WAAWC,GAAG,cAAcE,GAAG,QAAQD,GAAG,YAAYG,GAAG,OAAOD,GAAG,WAAqE5iG,GAAE27F,GAAEt3F,OAAOs3F,GAAElnG,UAAUy6F,EAAE,WAAW,OAAO3mF,KAAK7O,KAAK6O,KAAKvF,QAAQtJ,KAAKsJ,UAAU24F,GAAElnG,UAAUq4C,OAAO,WAAW,MAAOpzC,MAAKw1F,IACzrB,IAAI4T,IAAG,QAAQC,IAAIghB,iBAAiB,GAAGC,qBAAqB,6LAA6LC,oBAAoB,qJAAqJC,uBAAuB,kKACzbC,eAAe,+EAA+EC,oBAAoB,kCAAkCC,mBAAmB,iCAAiCC,4BAA4B,uEAAuEC,wBAAwB,wDAAwDC,wBAAwB,6GACnZC,6BAA6B,+FAA+FC,uBAAuB,0DAA0DC,sBAAsB,gCAAgCC,0BAA0B,mFAAmFC,iBAAiB,kCAAkCC,yBAAyB,sIAC5bC,iBAAiB,qEAAqEC,qBAAqB,yEAAyEC,qBAAqB,kCAAkCC,4BAA4B,qLAAqLC,uBAAuB,uDACndC,gCAAgC,gOAAgOC,uBAAuB,wEAAwEC,gBAAgB,wCAAwCC,kBAAkB,sEAAsEC,oBAAoB,kDACngBC,qBAAqB,4DAA4DC,2BAA2B,oFAAoFC,0BAA0B,+KAA+KC,yBAAyB,uGAClaC,0BAA0B,0FAA0FC,sBAAsB,+IAA+IC,sBAAsB,2GAA2GC,iBAAiB,gEAAgEC,uBAAuB,gPAClgBC,0BAA0B,4GAA4GC,iBAAiB,6KAA6KC,0BAA0B,2EAA2EC,2BAA2B,2FACpcC,8BAA8B,8HAA8HC,yBAAyB,gIAAgIC,4BAA4B,6EAA6EC,uBAAuB,kDAAkDC,uBAAuB,kCAC9fC,wBAAwB,oEAAoEC,uBAAuB,wEAAwEC,0BAA0B,uEAAuEx+C,cAAc,iDAAiDy+C,2CAA2C,wJACtYC,yBAAyB,8FAA8FC,gBAAgB,kCAAkCC,mBAAmB,6DAA6DC,wBAAwB,yJAAyJC,8CAA8C,kLACxdC,gBAAgB,4FAA4FC,uBAAuB,yEAAyEC,0BAA0B,kEAAkEC,iBAAiB,4DAA4DC,6BAA6B,2EAA2EC,6BAA6B,mDAC1fl+G,QAAQ,+BAA+Bm+G,qBAAqB,yEAAyEC,oBAAoB,0FAA0FC,4BAA4B,2GAA2GC,+BAA+B,2EAA2EC,iBAAiB,oEACrfC,iBAAiB,4FAA4FC,gBAAgB,0DAA0DC,gBAAgB,+EAA+EC,kBAAkB,GAAGC,gBAAgB,kDAAkDC,0BAA0B,gFAGlYjlB,GAAG,UAAUM,GAAG,kBAAkBF,GAAG,MAAML,GAAG,MAAMG,GAAG,aAAaC,GAAG,iBAAiBF,GAAG,cAAcI,GAAG,WAA2hB2D,GAAG,kHAAkH38F,MAAM,KAAKm8F,IAAI,YAAY,gBAAgB,QAAQ,eAAe,SAAShC,IAAItS,IAAI/F,GAAG,SAASX,GAAG,IAAID,GAAG,IAAIkZ,GAAG,eAAeic,GAAGla,IAAIpU,IAAIjG,GAAG,KAAKX,GAAG,IAAID,GAAG,IAAIkZ,GAAG,aAAaic,GAAGla,IAAIhU,IAAIrG,GAAG,KAAKX,GAAG,IAAID,GAAG,IAAIkZ,GAAG,aAAaic,GAAGla,IAAI0b,IAAI/1B,GAAG,OAAOX,GAAG,IAAID,GAAG,IAAIkZ,GAAG,cAAcic,GAAG1Z,KAAuT/B,GAAG,UAAUF,GAAG,YAC3wCllG,GAAEmlG,GAAGE,IAA2GrlG,EAAE8kG,GAAGK,IAAkKnlG,EAAEglG,GAAGG,IAAyGnlG,EAAE+kG,GAAGI,IACpVnlG,EAAEilG,GAAGE,IACoMW,GAAGrxG,UAAU+2F,GAAG,SAAS/vF,GAAG,MAAOowG,IAAGpwG,EAAEyqG,GAAGxsG,QAAQosG,GAAGrxG,UAAUuR,EAAE,SAASvK,EAAEuK,GAAG,GAAIrS,GAAEuyG,GAAGxsG,KAAkB,OAAZ/F,GAAEoyG,QAAQ//F,EAASgmG,GAAGvwG,EAAE9H,IAC3cmyG,GAAGrxG,UAAUd,EAAE,SAAS8H,EAAEuK,GAAkB,MAAO4/F,IAAGsG,GAAGzwG,EAAtByqG,GAAGxsG,OAAwBsM,IAC9D8/F,GAAGrxG,UAAUy6F,EAAE,WAAW,GAAIzzF,IAAG+pG,WAAW9rG,KAAK8rG,WAA8J,OAAlJ9rG,MAAKqsG,UAAUtqG,EAAEysG,aAAaxuG,KAAKqsG,SAASrsG,KAAKkvD,cAAcntD,EAAEwsG,iBAAiBvuG,KAAKkvD,aAAalvD,KAAK2sG,SAAS5qG,EAAEwqG,iBAAiBvsG,KAAK2sG,QAAe5qG,GAAkIgrG,GAAGhyG,UAAUw3F,GAAG,SAASxwF,GAAiB,MAAd/B,MAAKo0F,GAAGlB,EAAGnxF,GAAU/B,MAAiDsG,EAAEk3F,GAAEuP,IAC9bvP,GAAEziG,UAAU22F,GAAG,SAAS3vF,GAAgC,MAA7BuwF,GAAGtyF,KAAK+B,EAAEA,IAAI/B,KAAK+B,EAAE9F,KAAK8F,GAAU/B,MAAMw9F,GAAEziG,UAAUykG,GAAG,WAAW,MAAO7M,GAAG3yF,KAAK+B,IAAIy7F,GAAEziG,UAAUqxD,WAAW,SAASrqD,EAAEuK,GAAG,IAAIvK,IAAIuK,EAAE,KAAM,IAAI21F,IAAE,iBAAiB,wEAAyE,OAAO,IAAImK,IAAGpsG,KAAK8rG,YAAYO,QAAQtqG,GAAG,KAAKmtD,YAAY5iD,GAAG,QAAkDhG,EAAE4mG,GAAG1P,IAAGlhF,GAAE4wF,GAAG,cAAc,gBAClL5mG,EAAE8mG,GAAG5P,IAAGlhF,GAAE8wF,GAAG,cAAc,cAChM9mG,EAAEgnG,GAAG9P,IAAGlhF,GAAEgxF,GAAG,cAAc,cAAuJhnG,EAAEknG,GAAGT,IAAIzwF,GAAEkxF,GAAG,cAAc,eACiDG,GAAG5yG,UAAU+2F,GAAG,SAAS/vF,GAAG,MAAOivG,IAAEjvG,EAAE4sH,IAAI1f,MAAMjvG,KAAK+B,EAAEo0D,SAASn2D,KAAKsC,KAAKqrG,GAAG5yG,UAAUuR,EAAE,SAASvK,EAAEuK,GAAG,MAAO0kG,IAAEjvG,EAAE6sH,IAAIviB,QAAQ//F,EAAE2iG,MAAMjvG,KAAK+B,EAAEo0D,SAASn2D,KAAKsC,KACtdqrG,GAAG5yG,UAAUd,EAAE,SAAS8H,EAAEuK,GAAG,MAAO4/F,IAAGlsG,KAAK8xF,GAAG/vF,GAAGuK,IAAIqhG,GAAG5yG,UAAUy6F,EAAE,WAAW,OAAOyZ,MAAMjvG,KAAK+B,EAAEo0D,SAASn2D,KAAKsC,IAAsEimG,GAAGqF,IAAIihB,YAAY,aAA4HhhB,GAAG9yG,UAAU+2F,GAAG,SAAS/vF,GAAG,MAAOA,GAAE+wF,GAAGkb,GAAGhuG,QAAQ6tG,GAAG9yG,UAAUuR,EAAE,SAASvK,EAAEuK,GAAG,GAAIrS,GAAE+zG,GAAGhuG,KAAkB,OAAZ/F,GAAEoyG,QAAQ//F,EAAS0kG,GAAEjvG,EAAE+sH,GAAG70H,IAChc4zG,GAAG9yG,UAAUd,EAAE,SAAS8H,EAAEuK,GAAG,GAAIrS,GAAE+zG,GAAGhuG,KAAuC,OAAjC/F,GAAEksD,UAAU,SAASpkD,EAAEivG,GAAEjvG,EAAEgtH,GAAG90H,GAAUiyG,GAAGnqG,EAAEuK,IAAIuhG,GAAG9yG,UAAUy6F,EAAE,WAAW,GAAIzzF,IAAG+pG,WAAW,QAAsK,OAA7J9rG,MAAK+B,EAAE8wF,KAAK9wF,EAAEitH,eAAehvH,KAAK+B,EAAE8wF,IAAI7yF,KAAK+B,EAAE+rG,KAAK/rG,EAAEktH,iBAAiBjvH,KAAK+B,EAAE+rG,IAAI9tG,KAAK+B,EAAE+7F,KAAK/7F,EAAEksG,eAAejuG,KAAK+B,EAAE+7F,IAAI99F,KAAK+B,EAAEgsG,IAAIhsG,EAAEmsG,YAAYluG,KAAK+B,EAAEgsG,GAAUhsG,GAEtTqsG,GAAGrzG,UAAU+3F,GAAG,SAAS/wF,EAAEuK,GAAG,GAAIrS,GAAE+F,KAAK+B,EAAE9H,CAAE,OAAOquE,IAAEh8D,EAAEw5G,UAAUv+G,KAAK,SAASrN,GAAG,IAAIF,EAAEE,GAAG,KAAM,IAAI+nG,IAAE,iBAAiB,wIAAyI,QAAO31F,EAAErM,MAAM,IAAK,YAAY,MAAOyxG,IAAGz3G,GAAGi0G,YAAYnsG,EAAEmtH,eAAeh1H,IAAIqN,KAAK,SAASxF,GAA0C,MAAvC,kBAAoBuK,GAAEy2B,OAAOz2B,EAAEy2B,QAAehhC,GAAG,SAASA,GAA0C,KAAvC,kBAAoBuK,GAAEy2B,OAAOz2B,EAAEy2B,QAAchhC,GAAK,SAAQ,KAAM,IAAIkgG,IAAE,iBACpe,8FAAuOsG,GAAG6F,IAAIygB,YAAY,UAEoFngB,GAAG3zG,UAAUy6F,EAAE,WAAW,OAAOv1F,KAAKD,KAAKsM,EAAEsiG,QAAQ5uG,KAAK/F,EAAE40G,YAAY7uG,KAAKsC,EAAEorD,UAAU1tD,KAAKgmB,EAAEvb,MAAMzK,KAAK+B,GAAG/B,KAAK+B,EAAEyzF,MAClblvF,EAAEwoG,GAAG7M,IAAyJ37F,EAAEyoG,GAAG9M,IAAG8M,GAAGh0G,UAAUy6F,EAAE,WAAW,GAAIzzF,IAAG8M,KAAK7O,KAAK6O,KAAKvF,QAAQtJ,KAAKsJ,QAAStJ,MAAKivG,QAAQltG,EAAEktG,MAAMjvG,KAAKivG,OAAOjvG,KAAKkuG,cAAcnsG,EAAEmsG,YAAYluG,KAAKkuG,YAAa,IAAI5hG,GAAEtM,KAAKosD,YAAYpsD,KAAKosD,WAAWopC,GAAe,OAAXlpF,IAAG6mF,EAAGpxF,EAAEuK,GAAUvK,GAAGgtG,GAAGh0G,UAAUq4C,OAAO,WAAW,MAAOpzC,MAAKw1F,KAClKlvF,EAAE4oG,GAAGxN,IAAIwN,GAAGn0G,UAAUgH,EAAE,WAAW,MAAO,IAAI/B,MAAKsC,GAAG4sG,GAAGn0G,UAAUuR,EAAE,WAAW,SAElP,IAAI2jG,IAAG9D,GAAE,UAAUmD,GAAG,GAAIrH,IAAG,IAAI,KAAKuH,IAAI2f,eAAe,qCAAqCxf,GAAG,GAAI1H,IAAG,IAAI,KAAK4H,IAAIsf,eAAe,mBAE5PhgB,IAAGp0G,UAAUf,EAAE,SAAS+H,EAAEuK,EAAErS,EAAEC,EAAE6F,EAAEuC,GAAG,GAAI0jB,GAAE,QAAQ4gF,KAAI9sG,EAAE+sG,KAAK7gF,EAAE,GAAI+7E,IAAG/hG,KAAK3F,GAAG,GAAI0nG,IAAG,GAAIA,IAAG/hG,KAAKsC,EAAG,IAAGA,EAAE,CAACxI,EAAEwI,EAAE0J,KAAK8G,IAAI,EAAExQ,EAAG,IAAI3H,GAAE8M,WAAW,WAAWk1F,GAAE7iG,EAAE,YAAYwI,GAAGi5F,GAAGzhG,EAAE,WAAW,WAAWa,GAAGgzB,aAAahzB,EAAG,IAAIoH,GAAE,IAAK,KAAIA,EAAEkmB,KAAKlI,MAAMyjF,GAAGxjG,QAAQ,KAAK,MAAMw/F,GAAIz9F,EAAE,KAAKuK,GAAGA,EAAEvK,KAAKg6F,GAAGjiG,EAAE,QAAQ,WAAWa,GAAGgzB,aAAahzB,GAAG2+F,GAAGt5F,QAAQ+7F,GAAGjiG,EAAE,UAAU,WAAWa,GAAGgzB,aAAahzB,GAAG2+F,GAAGt5F,MAAMsM,GAAGA,EAAE,QAAQ41F,GAAGpoG,EAAEiI,EAAE9H,EAAEC,EAAE6F,GACra,IAAIuwG,IAAGxZ,GAAG,yDAAyDuZ,GAAG,QAAQrkG,KAAKC,MAAM,IAAID,KAAK8e,UAAUxc,UAC5G6gG,IAAGp0G,UAAUu2F,EAAE,SAASvvF,EAAEuK,EAAErS,EAAEC,EAAE6F,GAAG,GAAIuC,GAAEtC,IAAKiwG,IAAG1oG,KAAK,WAAWuD,OAAOqlG,KAAKC,OAAOgf,UAAU9sH,EAAEgK,EAAG,IAAI0Z,GAAElb,OAAOqlG,KAAKllC,KAAKhc,UAAWnkD,QAAOqlG,KAAKllC,KAAKokD,SAAS,MAAMvkH,OAAOqlG,KAAKC,OAAOtjD,SAAS99C,KAAKjN,EAAE2+B,OAAOzmC,EAAE8R,KAAK7R,EAAEugE,QAAQ16D,EAAEuvH,SAAS,OAAO3nH,SAAS,SAAS5F,GAAG+I,OAAOqlG,KAAKllC,KAAKokD,SAASrpG,GAAG1Z,GAAGA,EAAEvK,QAAQ7G,EAAE,SAAS6G,GAAGuK,GAAGA,GAAG7B,OAAOnB,QAAQvH,GAAGA,EAAEuH,SAAS,yBAIvH6lG,GAAGp0G,UAAUssH,GAAG,WAAW,MAAOrW,IAAEhxG,KAAKuvH,QAAQpgB,GAAGp0G,UAAU4pG,GAAG,SAAS5iG,EAAEuK,GAAG,MAAO0kG,IAAEhxG,KAAKwvH,IAAInjB,QAAQtqG,EAAEktG,MAAM3iG,KAAK6iG,GAAGp0G,UAAUwsH,GAAG,SAASxlH,EAAEuK,GAAG,MAAO0kG,IAAEhxG,KAAK4uH,IAAIviB,QAAQtqG,EAAEo0D,SAAS7pD,IAAK,IAAImjH,KAAIxrF,YAAY,eAAem+E,SAAS,YAAa9mH,IAAE6zG,GAAGp0G,UACveO,GAAEu4F,GAAG,SAAS9xF,EAAEuK,GAAG,GAAIrS,IAAGoyG,QAAQtqG,GAAG7H,IAA0G,OAArG24F,GAAG48B,GAAG,SAAS1tH,EAAEO,GAAG,GAAIvC,GAAEuM,EAAEhK,EAAG,QAAOvC,EAAE7F,EAAE+B,KAAK8F,GAAGO,IAAKgK,KAAIrS,EAAEqI,GAAGvC,KAAK7F,EAAE6B,SAAS9B,EAAEy1H,gBAAgBx1H,GAAU82G,GAAEhxG,KAAKwvH,GAAGv1H,IAAIqB,GAAEuwB,GAAG,SAAS9pB,EAAEuK,GAAoD,MAAjDvK,IAAG4tH,YAAY,iBAAiB1gB,MAAMltG,GAAGoxF,EAAGpxF,EAAEuK,GAAU0kG,GAAEhxG,KAAK4vH,GAAG7tH,IAAIzG,GAAE4qG,GAAG,SAASnkG,EAAEuK,GAAoD,MAAjDvK,IAAG4tH,YAAY,eAAetjB,QAAQtqG,GAAGoxF,EAAGpxF,EAAEuK,GAAU0kG,GAAEhxG,KAAK6vH,GAAG9tH,IAAsCzG,GAAEw3F,GAAG,SAAS/wF,GAAG,MAAOivG,IAAEhxG,KAAK8vH,GAAG/tH,IAExJzG,GAAE23F,GAAG,SAASlxF,EAAEuK,GAAG,MAAO0kG,IAAEhxG,KAAK+vH,IAAInd,QAAQ7wG,EAAEiuH,YAAY1jH,KAAKhR,GAAEk3F,GAAG,SAASzwF,GAAG,MAAOivG,IAAEhxG,KAAKiwH,IAAIrd,QAAQ7wG,KAAKzG,GAAE03F,GAAG,SAASjxF,GAAG,MAAOivG,IAAEhxG,KAAKkwH,IAAItd,QAAQ7wG,IAC7Z,IAW+H07G,IAX3HyS,IAAInd,SAAS,iBAAiB3c,EAAEuc,GAAGK,GAAG,SAASid,IAAIld,SAAS,gBAAgB3c,EAAEuc,GAAGxG,EAAE,SAASpqG,GAAG,IAAIA,EAAEktG,QAAQltG,EAAE4tH,YAAY,KAAM,IAAI1tB,IAAE,oBAAqBkuB,IAAIpd,SAAS,gBAAgB3c,EAAE,SAASr0F,GAAS,GAAN6uG,GAAG7uG,IAAOA,EAAEo0D,SAAS,KAAM,IAAI8rC,IAAE,kBAAmBkK,EAAEqF,GAAGqB,GAAE,GAAI5B,IAAI8B,SAAS,iBAAiBqd,IAAIrd,SAAS,gBAAgBjiB,IAAI,YAAY+gB,IAAIkB,SAAS,iBAAiBjiB,IAAI,UAAU,kBAAkBsF,EAAE,SAASr0F,GAAG,IAAIgvF,EAAGhvF,EAAE+vG,gBAAgB,KAAM,IAAI7P,IAAE,oBAAqB+f,IAAIjP,SAAS,kBACxe8c,IAAI9c,SAAS,yBAAyBjiB,IAAI,UAAU,eAAesF,EAAE,SAASr0F,GAAG,GAAG,gBAAgBA,EAAE4tH,YAAY,KAAM,IAAI1tB,IAAE,mBAAoB+Q,GAAG,SAAS4c,IAAI7c,SAAS,yBAAyBjiB,IAAI,eAAesF,EAAE,SAASr0F,GAAG,GAAG,kBAAkBA,EAAE4tH,YAAY,KAAM,IAAI1tB,IAAE,iBAAkB2O,IAAG7uG,IAAIixG,GAAG,SAAS1B,IAAIvd,IAAG,EAAGgf,SAAS,mBAAmBxe,GAAG,OAAO87B,IAAIt8B,IAAG,EAAGgf,SAAS,oBAAoBxe,GAAG,MAAM4X,EAAE,SAASpqG,GAAG,IAAIA,EAAEuuH,iBAAiB,KAAM,IAAIruB,IAAE,oBAAqB8tB,IAAIhd,SAAS,gBAC5e3c,EAAEuc,GAAGK,GAAG,SAASrB,IAAIoB,SAAS,uBAAuBjiB,IAAI,cAAc,kBAAkBkiB,GAAG,eAAewc,IAAIzc,SAAS,iBAAiBjiB,IAAI,WAAWsF,EAAE0a,GAAG+B,GAAE,GAAI+b,IAAI7b,SAAS,iBAAiBjiB,IAAI,WAAWsF,EAAE,SAASr0F,GAAS,GAAN+uG,GAAG/uG,IAAOA,EAAEo0D,SAAS,KAAM,IAAI8rC,IAAE,kBAAmBkK,EAAEqF,GAAGqB,GAAE,GAAI0c,IAAIxc,SAAS,gBAAgB5G,EAAEqF,GAAGqB,GAAE,GAAIR,IAAIU,SAAS,kBAAkB3c,EAAE2b,GAAG5F,EAAE6F,GAAGa,GAAE,GAAIH,IAAIK,SAAS,kBAAkB3c,EAAE2b,GAAG5F,EAAE,SAASpqG,GAAG,GAAGA,EAAEyoE,cAAc,kBAAkBzoE,EAAEyoE,aAAa,KAAM,IAAIy3B,IAAE,iBACte,IAAGlgG,EAAEyoE,aAAa,KAAM0nC,IAAGnwG,EAAEyoE,aAAc,KAAIzoE,EAAEoqG,IAAG,KAAM,IAAIlK,IAAE,mBAAoB4Q,GAAE,GAAIN,IAAIQ,SAAS,kBAAkB3c,EAAE,SAASr0F,GAAS,GAANgwG,GAAGhwG,IAAOA,EAAEsqG,QAAQ,KAAM,IAAIpK,IAAE,mBAAoBkK,EAAE6F,GAAGa,GAAE,GAAI0d,IAAIxd,SAAS,oBAAoB3c,EAAE,SAASr0F,GAAG,IAAIA,EAAE2f,MAAM,KAAM,IAAIugF,IAAE,yBAA0BkK,EAAEqF,GAAGqB,GAAE,GAAI8b,IAAI5b,SAAS,iBAAiB3c,EAAE,SAASr0F,GAAS,GAAN6uG,GAAG7uG,IAAOA,EAAEo0D,SAAS,KAAM,IAAI8rC,IAAE,mBAAoBkK,EAAEqF,GAAGqB,GAAE,GAAIid,IAAI/c,SAAS,oBAAoB3c,EAAEqb,GAAGtF,EAAEqF,IAAIsd,IAAI/b,SAAS,oBAAoB3c,EAAE,SAASr0F,GAAG,IAAIA,EAAEsqG,QAAQ,KAAM,IAAIpK,IAAE,iBACnhBwP,IAAG1vG,IAAIoqG,EAAE,SAASpqG,GAAG,GAAGA,EAAEksG,eAAe,KAAMlsG,GAAE8M,KAAK,4BAA4BmgG,GAAGjtG,EAAGyvG,IAAGzvG,KAAKgtH,IAAIt5B,IAAIif,eAAe,kBAAkB3B,SAAS,oBAAoB3c,EAAEqb,GAAGtF,EAAEqF,IAMoJ6E,IAAInd,IAAI9F,GAAG,8DAA8DkjB,GAAG,8CAA8C9tG,GAAG,KAAK4wF,IAAIhG,GAAG,8EAA8EkjB,GAAG,8DAA8D9tG,GAAG,KAAK8wF,IAAIlG,GAAG,kFAAkFkjB,GAAG,2DAA2D9tG,GAAG,KACznBi1G,IAAGrH,GAAG,WAAW,cAAU,EAEkG,IAAImB,IAAGzgB,GAAG,sDAAsDwgB,GAAG,GAAIrP,IAAG,IAAI,KAAK+O,GAAG,GAAI/O,IAAG,IAAI,MAAMoP,GAAG,IAE/KG,IAAGz8G,UAAUuT,SAAS,WAAyK,MAA9JtO,MAAKsC,EAAEs+F,GAAE5gG,KAAK+B,EAAE,IAAI/B,KAAKsC,GAAGk/F,GAAGxhG,KAAK+B,EAAEA,EAAE,KAAK/B,KAAKsM,EAAEs0F,GAAE5gG,KAAK+B,EAAE,MAAM/B,KAAKsM,GAAGk1F,GAAGxhG,KAAK+B,EAAEA,EAAE,OAAO/B,KAAK/F,EAAE8B,OAAO6kG,GAAE5gG,KAAK+B,EAAE,KAAK/B,KAAK/F,EAAEgU,KAAK,MAAMuzF,GAAGxhG,KAAK+B,EAAEA,EAAE,MAAa/B,KAAK+B,EAAEuM,YACvYmpG,GAAG18G,UAAUuT,SAAS,WAAW,GAAIvM,GAAEg/F,GAAG/gG,KAAKhG,EAAE,mBAAsF,IAAlE4mG,GAAE7+F,EAAE,SAAS/B,KAAKsxF,GAAGsP,GAAE7+F,EAAE,UAAU/B,KAAK/F,GAAG2mG,GAAE7+F,EAAE,WAAW/B,KAAKlG,GAAMkG,KAAK+B,EAAEirG,gBAAgB,CAAC,GAAI1gG,GAAEtM,KAAK+B,CAAE,KAAI,GAAI9H,GAAE4uB,GAASsO,IAAIn3B,KAAK/F,GAAGgxE,OAAOs5C,IAAI,MAAMzqH,GAAGG,EAAE,KAAKqS,EAAE4mF,GAAGj5F,EAAE2mG,GAAE7+F,EAAE,aAAa/B,KAAK+B,EAAE+pG,YAAYx/F,EAAEtM,KAAK+B,EAAE9H,EAAEutG,GAAGl7F,EAAE8nF,GAAI,KAAI,GAAIl6F,KAAKD,GAAEA,EAAEC,GAAGD,EAAEC,GAAGoU,UAAWpU,GAAEoS,EAAEirF,GAAGt9F,EAAEi5F,EAAGj5F,EAAG,KAAI,GAAI8F,GAAE,EAAEA,EAAE7F,EAAE6B,OAAOgE,IAAI,CAAC,GAAIuC,GAAEpI,EAAE6F,EAAGuC,KAAKrI,UAAUA,GAAEqI,GAAGgK,EAAE6mF,IAAI7mF,EAAE4mF,KAAKj5F,EAAEqS,EAAE6mF,MAAMl5F,EAAEqS,EAAE6mF,IAAI7mF,EAAE4mF,IAAIF,EAAG/4F,IAAI2mG,GAAE7+F,EAAE,mBAAmBwlG,GAAGttG,IAC/R,GADmS,kBAAoB+F,MAAK+B,EAAEy9F,KAC1flzF,EAAEtM,KAAK+B,EAAEy9F,KAAKlzF,EAAEvQ,QAAQ6kG,GAAE7+F,EAAE,SAASuK,EAAE2B,KAAK,OAAOjO,KAAK1E,EAAEslG,GAAE7+F,EAAE,cAAc/B,KAAK1E,GAAGkmG,GAAGz/F,EAAEA,EAAE,eAAe/B,KAAKgmB,EAAE46E,GAAE7+F,EAAE,UAAU/B,KAAKgmB,GAAGw7E,GAAGz/F,EAAEA,EAAE,WAAW/B,KAAKnG,EAAE+mG,GAAE7+F,EAAE,IAAI/B,KAAKnG,GAAG2nG,GAAGz/F,EAAEA,EAAE,KAAQ/B,KAAKsM,EAAE,IAAI,GAAI0Z,KAAKhmB,MAAKsM,EAAEtM,KAAKsM,EAAEtR,eAAegrB,KAAK66E,GAAG9+F,EAAEikB,IAAI46E,GAAE7+F,EAAEikB,EAAEhmB,KAAKsM,EAAE0Z,GAAwF,OAApFhmB,MAAKsC,EAAEs+F,GAAE7+F,EAAE,MAAM/B,KAAKsC,GAAGk/F,GAAGz/F,EAAEA,EAAE,OAAOikB,EAAE0xF,GAAG13G,KAAK/F,GAAG+rB,EAAEjqB,QAAQ6kG,GAAE7+F,EAAE,KAAKikB,EAAE/X,KAAK,MAAalM,EAAEuM,YAG5KhT,GAAEq8G,GAAG58G,UAAUO,GAAE62F,GAAG,SAASpwF,EAAEuK,EAAErS,GAAG,GAAIC,GAAE,GAAI+nG,IAAE,wBAAwBliG,EAAE,GAAIkiG,IAAE,2BAA2B3/F,EAAEtC,KAAKgmB,GAAE,CAAG,OAAOhmB,MAAK0wF,KAAKnpF,KAAK,WAAW4wG,GAAG71G,GAAGiF,KAAK,SAAStN,GAAGA,IAAI8H,GAAGojG,GAAGpjG,GAAGuK,EAAEvM,GAAGimB,GAAE,OAAQ9qB,EAAE,cAAcqM,KAAK,WAAW,IAAIye,EAAE,MAAOqgF,IAAGtkG,KAAKwF,KAAK,WAAW,IAAIye,EAAE,MAAO82E,IAAG7iG,GAAGsN,KAAK,WAAW+E,EAAEpS,QACtfoB,GAAEs5F,GAAG,WAAW,GAAI7yF,GAAEqgG,IAAI,QAAOkF,GAAGvlG,KAAK2lG,GAAG3lG,IAAIzG,GAAEg5F,GAAG,WAAW,OAAM,GACtEh5F,GAAE+4F,GAAG,SAAStyF,EAAEuK,EAAErS,EAAEC,EAAE6F,EAAEuC,EAAE0jB,GAAG,IAAIjkB,EAAE,MAAOyzF,IAAE,GAAIyM,IAAE,iBAAkB,IAAGj8E,IAAIshF,KAAK,MAAOtnG,MAAK0wF,KAAKx1F,EAAE,SAASoR,GAAG64F,GAAGpjG,GAAGhC,EAAEuM,KAAKpS,IAAIouE,IAAItoE,MAAK+B,IAAI/B,KAAK+B,EAAE61G,GAAGI,GAAGh4G,OAAQ,IAAIlG,GAAEkG,IAAK,OAAOA,MAAK+B,EAAEwF,KAAK,WAAW,GAAI+E,GAAExS,EAAE42F,KAAKx1F,EAAE,SAASoR,GAAc,KAAX64F,IAAGpjG,GAAGhC,EAAEuM,GAASA,GAAS,OAAJpS,KAAWoS,IAAI/E,KAAK,WAAiB,GAANknG,GAAGx0G,IAAO+rB,EAAE,CAAiD6+E,GAA1CoT,GAAGn+G,EAAEw3F,EAAEx3F,EAAEwI,EAAExI,EAAEwS,EAAEA,EAAErS,EAAE,KAAKqI,EAAExI,EAAEG,MAAE,GAAOH,EAAEwB,GAAQyG,MAAM7G,EAAE,SAAS6G,GAAqD,KAAlD,+BAA+BA,EAAE8M,OAAO/U,EAAEiI,EAAE,MAAYA,KAC/UzG,GAAE42F,GAAG,SAASnwF,EAAEuK,EAAErS,GAAG+F,KAAK+B,IAAI/B,KAAK+B,EAAE61G,GAAGI,GAAGh4G,OAAQ,IAAI9F,GAAE8F,IAAK,OAAOA,MAAK+B,EAAEwF,KAAK,WAAWknG,GAAGniG,GAAmDu4F,GAA1CoT,GAAG/9G,EAAEo3F,EAAEp3F,EAAEoI,EAAEpI,EAAEoS,EAAEvK,EAAEuK,EAAEs4F,KAAK3qG,EAAEC,EAAED,MAAE,GAAOC,EAAEoB,MAAWJ,EAAE,SAAS6G,GAAqD,KAAlD,+BAA+BA,EAAE8M,OAAO3U,EAAE6H,EAAE,MAAYA,KAAMzG,GAAEo1F,GAAG,WAAW,GAAI3uF,GAAE/B,IAAK,OAAO83G,IAAG93G,MAAMuH,KAAK,WAAW,MAAOxF,GAAElI,EAAEy5F,KAAKp4F,EAAE,WAAoB,KAAT6G,GAAEA,EAAE,KAAW,GAAIkgG,IAAE,6BAA8B3mG,GAAE05F,GAAG,WAAW,OAAM,GAErQ15F,GAAEs2F,GAAG,SAAS7vF,GAAG/B,KAAKgmB,EAAE/pB,KAAK8F,IAAIzG,GAAEm3F,GAAG,SAAS1wF,GAAG0wF,EAAGzyF,KAAKgmB,EAAE,SAAS1Z,GAAG,MAAOA,IAAGvK,KAA0MzG,GAAE+8G,GAAGt9G,UAAUO,GAAEZ,IAAI,SAASqH,GAAG,MAAOumE,IAAEtoE,KAAK+B,EAAE+xE,QAAQ/xE,IAAIwF,KAAK,SAASxF,GAAG,MAAOA,IAAG0lG,GAAG1lG,MAAMzG,GAAE8O,IAAI,SAASrI,EAAEuK,GAAG,MAAOg8D,IAAEtoE,KAAK+B,EAAEuwB,QAAQvwB,EAAEwlG,GAAGj7F,MAAMhR,GAAEy/G,EAAE,SAASh5G,GAAG,MAAOumE,IAAEtoE,KAAK+B,EAAEwwB,WAAWxwB,KAAKzG,GAAE+9F,GAAG,aAAa/9F,GAAEs1F,GAAG,aAAqCt1F,GAAEk9G,GAAGz9G,UAAUO,GAAEZ,IAAI,SAASqH,GAAG,MAAOumE,IAAEtoE,KAAK+B,EAAEA,KAAKzG,GAAE8O,IAAI,SAASrI,EAAEuK,GAAe,MAAZtM,MAAK+B,EAAEA,GAAGuK,EAASg8D,MAAKhtE,GAAEy/G,EAAE,SAASh5G,GAAoB,aAAV/B,MAAK+B,EAAEA,GAAUumE,MAAKhtE,GAAE+9F,GAAG,aAAa/9F,GAAEs1F,GAAG,YAAyN,IAAI6pB,GACr0Bn/G,IAAEm9G,GAAG19G,UAC/TO,GAAE8O,IAAI,SAASrI,EAAEuK,GAAG,GAASpS,GAALD,GAAE,EAAK8F,EAAEC,IAAK,OAAO61F,IAAGmjB,GAAGh5G,MAAMuH,KAAK,SAAS+E,GAA0B,MAAvBpS,GAAEoS,EAAEA,EAAE2sG,GAAGl5G,EAAEo5G,GAAGp5G,EAAE7F,GAAE,IAAYk/G,GAAG9sG,EAAE5R,IAAIqH,MAAMwF,KAAK,SAASjF,GAAG,GAAI0jB,GAAEizF,GAAGl5G,EAAEo5G,GAAGp5G,EAAE7F,GAAE,GAAK,OAAGoI,IAASA,EAAElH,MAAMkR,EAAE8sG,GAAGpzF,EAAEkW,IAAI55B,MAAIvC,EAAEgC,IAAI9H,GAAE,EAAGqI,KAAKA,EAAEvC,EAAEimB,GAAGjkB,EAAEO,EAAEvC,EAAEjG,GAAGwS,EAAS8sG,GAAGpzF,EAAEq/B,IAAI/iD,OAAMiF,KAAK,WAAWxH,EAAEuC,EAAEP,GAAGuK,IAAI,WAAWrS,GAAG8F,EAAEgC,OAAOzG,GAAEZ,IAAI,SAASqH,GAAG,GAAIuK,GAAEtM,IAAK,OAAOg5G,IAAGh5G,MAAMuH,KAAK,SAAStN,GAAG,MAAOm/G,IAAGH,GAAG3sG,EAAE6sG,GAAG7sG,EAAErS,GAAE,IAAKS,IAAIqH,MAAMwF,KAAK,SAASxF,GAAG,MAAOA,IAAGA,EAAE3G,SAC5aE,GAAEy/G,EAAE,SAASh5G,GAAG,GAAIuK,IAAE,EAAGrS,EAAE+F,IAAK,OAAO61F,IAAGmjB,GAAGh5G,MAAMuH,KAAK,SAASrN,GAAc,MAAXoS,IAAE,EAAGrS,EAAE8H,IAAWq3G,GAAGH,GAAGh/G,EAAEk/G,GAAGl/G,EAAEC,GAAE,IAAZ,OAA2B6H,MAAMwF,KAAK,iBAAkBtN,GAAEqI,EAAEP,KAAK,WAAWuK,GAAGrS,EAAE8H,OAC1KzG,GAAEy8F,GAAG,WAAW,GAAIh2F,GAAE/B,IAAK,OAAOg5G,IAAGh5G,MAAMuH,KAAK,SAAS+E,GAAG,GAAIrS,GAAEg/G,GAAGl3G,EAAEo3G,GAAGp3G,EAAEuK,GAAE,GAAK,OAAOrS,GAAEu2H,OAAOpX,GAAGn/G,EAAEu2H,UAAU,GAAIz7B,GAAE,SAAShzF,EAAEuK,GAAG,GAAIpS,MAAK6F,EAAE9F,EAAEw2H,YAAa1wH,GAAEg5G,UAAU,SAASzsG,IAAIA,EAAEA,EAAEgkB,OAAOiE,SAASr6B,EAAE+B,KAAKqQ,EAAElR,OAAOkR,EAAA,YAAiBvK,EAAE7H,IAAI6F,EAAE85D,QAAQ,SAAS93D,GAAGuK,EAAE3B,MAAM5I,EAAEuuB,OAAOqoF,iBAAiBpxG,KAAK,SAAS+E,GAAG,GAAIrS,MAAKC,IAAK,IAAG,GAAG6H,EAAEA,EAAE,CAAC,IAAI7H,EAAE,EAAEA,EAAEoS,EAAEvQ,OAAO7B,IAAID,EAAEqS,EAAEpS,GAAG6H,EAAEikB,IAAI1Z,EAAEpS,GAAG6H,EAAEjI,EAAGI,GAAE4qG,GAAG/iG,EAAEO,EAAErI,GAAG8H,EAAEO,EAAErI,EAAE,MAAOC,MAAKoB,GAAE+9F,GAAG,SAASt3F,GAAG,GAAG/B,KAAK/F,EAAE8B,QAAQs9G,GAAGr5G,MAAMA,KAAK/F,EAAEgC,KAAK8F,IAC1dzG,GAAEs1F,GAAG,SAAS7uF,GAAG0wF,EAAGzyF,KAAK/F,EAAE,SAASqS,GAAG,MAAOA,IAAGvK,IAAI,GAAG/B,KAAK/F,EAAE8B,QAAQiE,KAAKsM,GAAGtM,KAAKsM,EAAEoyC,OAAO,eACuGpjD,GAAEg+G,GAAGv+G,UAAUO,GAAEZ,IAAI,SAASqH,GAAG,GAAIuK,GAAEtM,IAAK,OAAOsoE,MAAI/gE,KAAK,WAAgC,MAAOkgG,IAAtBn7F,EAAEvK,EAAE+xE,QAAQ/xE,OAAmBzG,GAAE8O,IAAI,SAASrI,EAAEuK,GAAG,GAAIrS,GAAE+F,IAAK,OAAOsoE,MAAI/gE,KAAK,WAAW,GAAIrN,GAAEqtG,GAAGj7F,EAAG,QAAOpS,EAAED,EAAE8gH,EAAEh5G,GAAG9H,EAAE8H,EAAEuwB,QAAQvwB,EAAE7H,MAAMoB,GAAEy/G,EAAE,SAASh5G,GAAG,GAAIuK,GAAEtM,IAAK,OAAOsoE,MAAI/gE,KAAK,WAAW+E,EAAEvK,EAAEwwB,WAAWxwB,MAC/dzG,GAAE+9F,GAAG,SAASt3F,GAAG+K,GAAEhC,QAAQswF,GAAGtuF,GAAEhC,OAAO,UAAU/I,IAAIzG,GAAEs1F,GAAG,SAAS7uF,GAAG+K,GAAEhC,QAAQkxF,GAAElvF,GAAEhC,OAAO,UAAU/I,IAAmBzG,GAAEm+G,GAAG1+G,UAAUO,GAAEZ,IAAI,WAAW,MAAO4tE,IAAE,OAAOhtE,GAAE8O,IAAI,WAAW,MAAOk+D,OAAKhtE,GAAEy/G,EAAE,WAAW,MAAOzyC,OAAKhtE,GAAE+9F,GAAG,aAAa/9F,GAAEs1F,GAAG,aACjDt1F,GAAEo+G,GAAG3+G,UAAUO,GAAEZ,IAAI,SAASqH,GAAG,GAAIuK,GAAEtM,IAAK,OAAOsoE,MAAI/gE,KAAK,WAAgC,MAAOkgG,IAAtBn7F,EAAEvK,EAAE+xE,QAAQ/xE,OAAmBzG,GAAE8O,IAAI,SAASrI,EAAEuK,GAAG,GAAIrS,GAAE+F,IAAK,OAAOsoE,MAAI/gE,KAAK,WAAW,GAAIrN,GAAEqtG,GAAGj7F,EAAG,QAAOpS,EAAED,EAAE8gH,EAAEh5G,GAAG9H,EAAE8H,EAAEuwB,QAAQvwB,EAAE7H,MAAMoB,GAAEy/G,EAAE,SAASh5G,GAAG,GAAIuK,GAAEtM,IAAK,OAAOsoE,MAAI/gE,KAAK,WAAW+E,EAAEvK,EAAEwwB,WAAWxwB,MAAMzG,GAAE+9F,GAAG,aAC5e/9F,GAAEs1F,GAAG,YAA0F,IAAI4pB,IACuQG,GADpQX,IAAIzgB,EAAE+f,GAAG5lB,GAAGgmB,IAAIQ,IAAI3gB,EAAE+f,GAAG5lB,GAAGgmB,IAAIU,IAAI7gB,EAAE8e,GAAG3kB,GAAG+lB,IAAQa,IAAIthB,GAAG,QAAQ03B,KAAK,OAAOv3B,GAAG,UAElCohB,IAAGx/G,UAAUL,IAAI,SAASqH,EAAEuK,GAAG,MAAOsuG,IAAG56G,KAAK+B,EAAEw3F,GAAG7+F,IAAImgH,GAAG76G,KAAK+B,EAAEuK,KAAsFiuG,GAAGx/G,UAAUqP,IAAI,SAASrI,EAAEuK,EAAErS,GAAG,GAAIC,GAAE2gH,GAAG76G,KAAK+B,EAAE9H,GAAG8F,EAAEC,KAAKsC,EAAEs4G,GAAG56G,KAAK+B,EAAEw3F,EAAG,OAAOj3F,GAAE8H,IAAIlQ,EAAEoS,GAAG/E,KAAK,WAAW,MAAOjF,GAAE5H,IAAIR,KAAKqN,KAAK,SAAS+E,GAAG,SAASvK,EAAEw3F,IAAIx5F,EAAEuM,EAAEpS,GAAGoS,MAGldiuG,GAAGx/G,UAAUf,EAAE,SAAS+H,GAAG,GAAGA,GAAGA,EAAEikB,EAAE,CAAC,GAAI1Z,GAAEvK,EAAEA,EAAE1F,GAAI,IAAG,MAAMiQ,EAAE,IAAI,GAAIrS,KAAK+F,MAAK+B,EAAE,CAAC,GAAI7H,GAAE8F,KAAKsM,EAAErS,OAAG,KAAqBC,IAAIA,EAAE,KAAM,IAAI6F,GAAE+M,GAAEm6F,aAAanzB,QAAQ75E,EAAG8F,KAAI7F,IAAI8F,KAAKsM,EAAErS,GAAG8F,EAAEC,KAAK/F,EAAEA,QAAS,IAAG,GAAGqS,EAAErB,QAAQjL,KAAKnG,EAAEmG,KAAKgmB,IAAIhmB,KAAK+B,EAAEuK,GAAG,CAAiE,OAAhE,KAAqBvK,EAAEA,EAAEA,EAAE64G,GAAG56G,KAAK,SAAS4wF,GAAG5wF,KAAK1E,GAAG+/G,GAAGr7G,MAASA,KAAKsoE,EAAE,GAAGruE,EAAE6S,GAAEm6F,aAAanzB,QAAQxnE,IAAGpS,EAAE6H,EAAEA,EAAEmqB,YAAajyB,EAAE,OAAOC,EAAE4S,GAAEm6F,aAAa30E,QAAQhmB,EAAEpS,GAAG4S,GAAEm6F,aAAa10E,WAAWjmB,OAAQ,IAAGtM,KAAKsM,EAAEA,KAAKpS,OAAG,KAAqB6H,EAAEA,EAAEA,EAAE,MAAO,IAAIO,GAAEtC,IACnf/F,GAAE,eAAc,KAAqB8H,EAAEA,EAAEA,GAAGO,EAAEgK,EAAEA,KAAKQ,GAAEm6F,aAAanzB,QAAQxnE,KAAGhK,EAAEgK,EAAEA,GAAGQ,GAAEm6F,aAAanzB,QAAQxnE,GAAGhK,EAAErI,EAAEqS,KAAI45B,IAAGy+D,IAAI,IAAIA,IAAI73F,GAAEm6F,aAAanzB,QAAQxnE,KAAKvK,EAAEA,EAAEmqB,UAAUnqB,EAAEA,EAAEmqB,WAAWnqB,EAAEA,EAAEu5G,SAAS7zG,WAAWxN,EAAE,IAAIA,SAAUu+F,IAAEz2F,EAAEupD,EAAEtrD,KAAK/F,EAAE+F,QAAQu6G,GAAGx/G,UAAUd,EAAE,SAAS8H,GAAG/B,KAAK+B,EAAEA,IAAIy2F,GAAEx4F,KAAK+B,EAAEA,GAAG,SAASA,GAAGA,MAA2C,IAAI05G,KAAIthH,KAAK,YAAYo/F,EAAE,QAAsXj+F,IAAEqgH,GAAG5gH,UAC5vBO,GAAEo1F,GAAG,WAAW,MAAO1wF,MAAK+xF,GAAG/xF,KAAK+xF,GAAG/xF,KAAK+xF,GAAGyU,KAAKj/F,KAAK,WAAW,GAAG,kBAAoBgV,IAAE,2BAA2BzP,IAAG,KAAM8uG,IAAG,kDAAmD,QAAG,KAAqBr/F,GAAE,wBAAwBzP,IAAG,KAAM8uG,IAAG,4CAA6C,IAAG,kBAAoBr/F,IAAE,qCAAqCzP,IAAG,KAAM8uG,IAAG,6CAA8C,IAAG,kBAAoBr/F,IAAE,4BAA4BzP,IAAG,KAAM8uG,IAAG,iDACzd,WAAW,KAAM,IAAI3Z,IAAE,wBACzB3mG,GAAE62F,GAAG,SAASpwF,EAAEuK,GAA2D,MAAxDA,GAAE,GAAI21F,IAAE,gDAAuD35B,MAAKhtE,GAAE+4F,GAAG,WAAW,MAAOmB,IAAE,GAAIyM,IAAE,iDAAiD3mG,GAAE05F,GAAG,WAAW,OAAM,GAAI15F,GAAEs5F,GAAG,WAAW,OAAM,GAAIt5F,GAAEg5F,GAAG,WAAW,OAAM,GACjPh5F,GAAE42F,GAAG,SAASnwF,EAAEuK,EAAErS,GAAG,GAAG+F,KAAK/F,EAAE,MAAOu7F,IAAE,GAAIyM,IAAE,8BAA+B,IAAI/nG,GAAE8F,KAAKD,EAAE+M,GAAE5O,SAASoE,EAAE,KAAK0jB,EAAE,KAAKlsB,EAAE,KAAKa,EAAE,IAAK,OAAOqF,MAAK/F,EAAE47F,GAAGvtB,KAAI/gE,KAAK,WAAiB,MAANknG,IAAGniG,GAAU+vG,GAAGniH,KAAKqN,KAAK,WAAW,MAAOy0G,IAAG9hH,EAAE6H,EAAEuK,EAAErS,KAAKsN,KAAK,WAAW,MAAO,IAAIwtF,GAAE,SAAShzF,EAAEuK,GAAG0Z,EAAE,WAAW,GAAI1Z,GAAEiQ,GAAE,mCAAmCzP,GAA6F,OAA1F/K,KAAI,kBAAoBuK,IAAGA,IAAIpS,EAAE6H,GAAG,kBAAoB7H,GAAE6H,EAAE4kC,QAAQzsC,EAAE6H,EAAE4kC,QAAQzsC,EAAE6H,EAAE,OAAY,GAAI7H,EAAE03F,GAAG5rE,GAAGlsB,EAAE,WAAWwI,IAAIA,EAAEw6F,GAAG5iG,EAAEs+F,GAAGjxF,KAAK,WAAW+E,EAAE,GAAI21F,IAAE,mCACretnG,EAAE,WAAWutG,MAAMpuG,KAAKiG,EAAEX,iBAAiB,SAAStF,GAAE,GAAIsoG,KAAIvkG,cAAcy9D,MAAM,YAAYv7D,EAAEX,iBAAiB,mBAAmBzE,GAAE,KAAOO,EAAE,SAAS6G,GAAG,MAAOw6G,IAAGriH,GAAGqN,KAAK,WAAW,KAAMxF,SAAS,WAAWjI,GAAGiG,EAAET,oBAAoB,SAASxF,GAAE,GAAIa,GAAGoF,EAAET,oBAAoB,mBAAmB3E,GAAE,GAAI2H,GAAGA,EAAEo8C,SAAS14B,GAAG9rB,EAAEu4F,GAAGzsE,GAAG9rB,EAAED,EAAE,QAMzUqB,GAAEs2F,GAAG,SAAS7vF,GAAG/B,KAAKsM,EAAErQ,KAAK8F,GAAGs6G,GAAGr8G,MAAM9E,EAAE,SAASoR,GAAG,uCAAuCA,EAAEuC,OAAOvC,EAAE,GAAIoiG,IAAG,UAAU,KAAK,KAAK,KAAK,GAAIzM,IAAE,kBAAkBlgG,EAAEuK,OAAOhR,GAAEm3F,GAAG,SAAS1wF,GAAG0wF,EAAGzyF,KAAKsM,EAAE,SAASA,GAAG,MAAOA,IAAGvK,IAAyC,IAAI46G,KAAIxiH,KAAK,kBAAkBo/F,EAAE,UACjLujB,IAAG/hH,UAAUgoC,MAAM,WAAW/iC,KAAKsC,GAAE,EAAGtC,KAAK+B,EAAE0wF,GAAGzyF,KAAKnG,GAAGmG,KAAK+B,EAAEy7G,GAAGx9G,KAAKwN,EAAExN,KAAKlG,EAAEkG,KAAKsxF,IAC3MwrB,GAAG/hH,UAAUg3E,UAAU,SAAShwE,GAAgC,GAA7BuwF,EAAGtyF,KAAK1E,EAAEyG,IAAI/B,KAAK1E,EAAEW,KAAK8F,IAAO/B,KAAKsC,EAAE,CAAC,GAAIgK,GAAEtM,IAAK68G,IAAG78G,KAAKgmB,GAAGze,KAAK,SAASxF,GAAGA,EAAE66G,GAAGtwG,EAAE0Z,GAAGze,KAAK,WAAWm2G,GAAGpxG,GAAGpR,EAAE,SAAS6G,GAAG,GAAI9H,GAAE,GAAIy0G,IAAG,UAAU,KAAK,KAAK,KAAK,GAAIzM,IAAE,+CAAgD2b,IAAG77G,IAAIuK,EAAEtS,EAAEC,OAAO0jH,GAAGrxG,KAAKpR,EAAE,WAAWyiH,GAAGrxG,OAAOwwG,GAAG/hH,UAAU41H,YAAY,SAAS5uH,GAAG0wF,EAAGzyF,KAAK1E,EAAE,SAASgR,GAAG,MAAOA,IAAGvK,KACnX+6G,GAAG/hH,UAAUf,EAAE,SAAS+H,GAAG,IAAIA,EAAE,KAAM,IAAIkgG,IAAE,qBAAsB,KAAI,GAAI31F,IAAE,EAAGrS,EAAE,EAAEA,EAAE+F,KAAK1E,EAAES,OAAO9B,IAAI,CAAC,GAAIC,GAAE8F,KAAK1E,EAAErB,EAAG,IAAGC,EAAE85F,GAAGjyF,EAAEuK,EAAEvK,EAAE9H,GAAG,EAAEqS,EAAEtM,KAAKsM,EAAEvK,EAAEuK,KAAKA,EAAEhR,EAAEyG,EAAE7H,GAAGoS,GAAE,CAAG,QAAkB,MAAXuxG,IAAG79G,KAAK/F,GAAUqS,EAAG,IAAIskH,IAAG,GAAI3oB,IAAG,IAAI,KAAKsW,GAAG,GAAItW,IAAG,IAAI,IAAK6U,IAAG/hH,UAAUytE,GAAG,WAAW,MAAOxoE,MAAK/F,EAAEuuE,MACzRs0C,GAAG/hH,UAAUm3F,GAAG,SAASnwF,EAAEuK,EAAErS,GAAG,GAAW8F,GAAP7F,EAAE8F,IAAO,OAAO08G,IAAG18G,KAAKgmB,GAAGze,KAAK,WAAW,MAAOrN,GAAE6H,EAAEmwF,GAAGnwF,EAAEuK,EAAErS,GAAGiB,EAAE,SAAS6G,GAAG,GAAG67G,GAAG77G,GAAG,KAAM,IAAIkgG,IAAE,8CAAmD,OAAJliG,GAAEgC,EAAS66G,GAAG1iH,EAAE8rB,GAAGze,KAAK,WAAW,KAAMxH,OAAOwH,KAAK,WAAW,MAAOrN,GAAE6H,EAAEizF,KAAK,GAAID,GAAE,cAAc6nB,GAAG1iH,EAAE8rB,GAAGze,KAAK,WAAW,MAAOrN,GAAEsuE,OAAOjhE,KAAK,cAAcrM,EAAE,mBAAmB4hH,GAAG/hH,UAAUo3F,GAAG,SAASpwF,EAAEuK,EAAErS,EAAEC,GAAG,MAAO8F,MAAK+B,EAAEowF,GAAGl4F,EAAE,SAASA,GAAG8H,EAAEgvF,GAAGzkF,EAAE,KAAKrS,EAAEC,IAAI02H,GAAGl2H,OAAQ,IAAIsjH,MAC7TjB,IAAGhiH,UAAUgoC,MAAM,WAAW/iC,KAAKsM,EAAE,KAAKtM,KAAK+B,IAAI/B,KAAK+B,EAAE28C,SAAS1+C,KAAK+B,EAAE,OACzNg7G,GAAGhiH,UAAUO,EAAE,SAASyG,EAAEuK,GAAG,IAAIvK,EAAE,MAAOyzF,IAAE,GAAIyM,IAAE,sBAAuBjiG,MAAK+iC,QAAQ/iC,KAAKgmB,GAAE,CAAG,IAAI/rB,GAAE8H,EAAEuK,EAAEpS,EAAE6H,EAAE9H,EAAE8F,EAAEgC,EAAEA,GAAG,gCAAgCA,EAAEA,EAAE8M,KAAKvM,EAAEP,EAAEA,GAAG,oDAAoDA,EAAEA,EAAE8M,IAA+I,OAA1I,WAAW5U,GAAG8F,GAAGuC,EAAEP,EAAEA,GAAGk8G,GAAGj+G,MAAK,EAAG,KAAK+B,EAAEA,GAAGA,EAAEumE,MAAKvmE,EAAEuK,EAAEulF,GAAG53F,EAAEC,GAAGgkH,GAAGl+G,KAAK+B,EAAEuK,GAAGkpF,GAAE,GAAIyM,IAAE,wBAAwBgc,GAAGj+G,MAAK,EAAG,KAAK,MAAM+B,EAAEumE,MAAYvmE,GAErXg7G,GAAGhiH,UAAUytE,GAAG,WAAW,GAAIzmE,GAAE/B,IAAK,OAAO,IAAI+0F,GAAE,SAASzoF,EAAErS,GAAG8H,EAAEuK,EAAEvK,EAAEuK,IAAI/E,KAAK+E,EAAErS,IAAI8H,EAAEO,EAAErG,KAAKqQ,GAAGvK,EAAE9H,EAAEgC,KAAKhC,GAAGqkH,GAAGv8G,OAAsIi7G,GAAGjiH,UAAUO,EAAE,SAASyG,EAAEuK,GAAG,IAAIvK,EAAE,MAAOyzF,IAAE,GAAIyM,IAAE,sBAAuB,IAAIhoG,GAAE8H,EAAEuK,EAAEpS,EAAE6H,EAAE9H,CAAwF,OAAtF8H,GAAEA,GAAGuK,EAAEykF,GAAGhvF,EAAEuK,EAAE,KAAKvK,EAAEA,EAAEA,EAAE9H,GAAG8H,EAAEumE,MAAKvmE,EAAEuK,EAAEulF,GAAG53F,EAAEC,GAAGskH,GAAGz8G,EAAEuK,GAAGkpF,GAAE,GAAIyM,IAAE,uBAA8BlgG,GACvP08G,GAAG1jH,UAAU81H,QAAQ,SAAS9uH,GAA+B,MAA5BA,GAAEssG,GAAGruG,KAAKgvH,eAAejtH,GAAU/B,KAAK+B,EAAEA,IAA8R48G,GAAG5jH,UAAUu4D,MAAM,WAAWtzD,KAAK+B,EAAE/B,KAAK/F,EAAE4kH,GAAG7+G,MAAK,IAC1U++G,GAAGhkH,UAAUy6F,EAAE,WAAW,OAAOuqB,OAAO//G,KAAKsC,EAAEgK,EAAE2yG,aAAaj/G,KAAK+B,EAAEmtD,YAAYlvD,KAAKsM,EAAEgzG,eAAet/G,KAAK/F,IACjI8kH,GAAGhkH,UAAUk0D,SAAS,SAASltD,GAAS,MAANA,KAAIA,EAAS/B,KAAKsM,IAAItM,KAAK+B,EAAEyzF,GAAE,GAAIyM,IAAE,uBAAuBlgG,IAAI/B,KAAKsM,GAAGm+F,KAAKzqG,KAAK/F,EAAE,IAAI+F,KAAK+B,EAAEq9G,GAAGp/G,MAAMwwG,WAAW,gBAAgBC,cAAczwG,KAAK+B,IAAIumE,GAAE,MAAMA,IAAGpZ,YAAYlvD,KAAKsM,EAAEgzG,eAAet/G,KAAK/F,EAAEglH,aAAaj/G,KAAK+B,KAAyJw9G,GAAGxkH,UAAUy6F,EAAE,WAAW,OAAO4rB,YAAYphH,KAAKsM,EAAE60G,UAAUnhH,KAAK+B,IAA8LuE,EAAEu5G,GAAGtmB,IAEn4BjzF,EAAEw5G,GAAGpjB,IAAGojB,GAAG/kH,UAAU0vG,GAAG,SAAS1oG,GAAG/B,KAAKgxF,GAAGjvF,EAAE+tG,GAAG9vG,KAAK/F,EAAE8H,IAAI+9G,GAAG/kH,UAAUwpH,EAAE,WAAW,MAAOvkH,MAAKgxF,IAA4L8uB,GAAG/kH,UAAU23F,GAAG,WAAW,MAAOC,GAAG3yF,KAAKqgH,IAAgGP,GAAG/kH,UAAUs3F,GAAG,WAAWryF,KAAKlG,EAAEwS,IAAIwyG,GAAG9+G,KAAKlG,GAAGkG,KAAKlG,EAAEw5D,UAGtOh3C,GAAEwjG,GAAG/kH,UAAU,aAAa,YAE2CO,GAAEwkH,GAAG/kH,UAAUO,GAAE6uC,OAAO,WAAW,GAAIpoC,GAAE/B,IAAK,OAAOqgH,IAAErgH,KAAKuhH,GAAGvhH,MAAMuH,KAAK,WAAW,MAAOs6G,IAAG9/G,GAAGwF,KAAK,WAAW,MAAOu5G,IAAG/+G,KAAKwF,KAAK+5G,QAClVhmH,GAAEohG,EAAE,SAAS36F,GAAG,GAAIuK,GAAEtM,IAAK,OAAOqgH,IAAErgH,KAAKuhH,GAAGvhH,MAAMuH,KAAK,WAAW,MAAO+E,GAAEhR,EAAE2zD,SAASltD,KAAKwF,KAAK,SAASxF,GAAG,IAAIA,EAAE,KAAM,IAAIkgG,IAAE,iBAA6H,OAA3GlgG,GAAEmtD,aAAa5iD,EAAEqnF,KAAKssB,GAAG3zG,EAAEvK,EAAEmtD,aAAaytC,GAAErwF,EAAE,GAAIuzG,IAAG,kBAAkB8B,GAAGr1G,EAAE,eAAevK,EAAEk9G,cAAqBl9G,EAAEmtD,gBAC3Y5zD,GAAE2zD,SAAS,SAASltD,GAA0Z,MAAvZmoH,IAAG,4GAA4GA,GAAG,2GAA0G,EAAG,mBAAqBjgH,UAAS,kBAAoBA,SAAQW,MAAMX,QAAQW,KAAK,2GAAkH5K,KAAK08F,EAAE36F,IAE5bzG,GAAE07F,GAAG,SAASj1F,GAAa,KAAVA,EAAEA,EAAE+uH,SAAc/uH,EAAEhG,OAAO,KAAM,IAAIkmG,IAAE,iBAAkBlgG,GAAEA,EAAE,GAAGm+G,GAAGlgH,MAAMmrE,IAAIppE,EAAEgvH,QAAQ9sF,YAAYliC,EAAEkiC,YAAY27E,SAAS79G,EAAEqgH,SAASnT,MAAMltG,EAAEktG,MAAM+R,gBAAgBj/G,EAAEi/G,cAAc9S,YAAYnsG,EAAEmsG,YAAYkT,YAAYr/G,EAAEq/G,YAAYD,UAAUp/G,EAAEo/G,WAAY,KAAI,GAAI70G,GAAE21G,GAAGlgH,GAAG9H,EAAE,EAAEA,EAAEqS,EAAEvQ,OAAO9B,IAAIwnH,GAAGzhH,KAAKsM,EAAErS,GAAI0nH,IAAG3hH,KAAK,gBAAgBA,KAAKivG,OAAOltG,EAAEivH,cAAiBhxH,KAAKqhH,cAAcrhH,KAAKqhH,aAAatlH,UAC9PT,GAAEi4F,GAAG,SAASxxF,GAAG,GAAIuK,GAAEtM,KAAK/F,EAAE,IAAK,OAAOomH,IAAErgH,KAAK+B,EAAE9H,EAAE+F,KAAK/F,EAAE+F,KAAKmrE,KAAK5jE,KAAK,SAASxF,GAA+C,MAA5CggH,IAAGz1G,EAAEvK,GAAG9H,EAAEqoH,GAAGh2G,EAAEvK,EAAE,kBAAkBuK,EAAEzS,EAAE,KAAYyS,EAAE69B,WAAW5iC,KAAK,WAAW,MAAOtN,MAAI,IAAKqB,GAAE27F,GAAG,SAASl1F,GAAG,MAAO/B,MAAKuzF,GAAGxxF,GAAGwF,KAAK,eACxPjM,GAAE+3F,GAAG,SAAStxF,GAAG,GAAIuK,GAAEtM,KAAK/F,EAAE,IAAK,OAAOomH,IAAErgH,KAAKqiH,GAAGriH,KAAK+B,EAAE+pG,YAAYvkG,KAAK,WAAW,MAAO+E,GAAEowF,MAAMn1F,KAAK,SAAStN,GAAG,MAAO8H,GAAEuK,EAAEA,EAAErS,EAAEA,KAAKsN,KAAK,SAASxF,GAAoB,MAAjB9H,GAAEqoH,GAAGh2G,EAAEvK,EAAE,QAAe0gH,GAAGn2G,EAAEvK,KAAKwF,KAAK,WAAW,MAAOtN,OAAMqB,GAAEo7F,GAAG,SAAS30F,GAAG,MAAO/B,MAAKqzF,GAAGtxF,GAAGwF,KAAK,SAASxF,GAAG,MAAOA,GAAEs8G,QAC9Z/iH,GAAE+8F,GAAG,SAASt2F,EAAEuK,GAAG,GAAIrS,GAAE+F,IAAK,OAAOqgH,IAAErgH,KAAKqiH,GAAGriH,KAAK,SAASuH,KAAK,WAAW,MAAOm3G,IAAGgC,GAAGzmH,GAAG8H,EAAEuK,EAAEg/C,EAAErxD,EAAEo5F,GAAGp5F,QAAQqB,GAAE47F,GAAG,SAASn1F,EAAEuK,GAAG,GAAIrS,GAAE+F,IAAK,OAAOqgH,IAAErgH,KAAKsoE,KAAI/gE,KAAK,WAAW,MAAOm3G,IAAGgC,GAAGzmH,GAAG8H,EAAEuK,EAAEg/C,EAAErxD,EAAEs5F,GAAGt5F,OAAM,IACjNqB,GAAEqpG,GAAG,SAAS5iG,GAAG,GAAIuK,GAAEtM,IAAK,OAAOqgH,IAAErgH,KAAKA,KAAK08F,IAAIn1F,KAAK,SAAStN,GAAG,MAAOqS,GAAErS,EAAE0qG,GAAG1qG,EAAE8H,KAAKwF,KAAK,SAASxF,GAAW,MAARggH,IAAGz1G,EAAEvK,GAAUuK,EAAE69B,aAAa7uC,GAAE88F,GAAG,SAASr2F,GAAG,GAAIuK,GAAEtM,IAAK,OAAOqgH,IAAErgH,KAAKA,KAAK08F,IAAIn1F,KAAK,SAAStN,GAAG,MAAO8H,GAAEuK,EAAEA,EAAErS,EAAEA,KAAKsN,KAAK,SAASxF,GAAW,MAARggH,IAAGz1G,EAAEvK,GAAUuK,EAAE69B,aAAa7uC,GAAEisH,GAAG,SAASxlH,GAAG,GAAIuK,GAAEtM,IAAK,OAAOqgH,IAAErgH,KAAKA,KAAK08F,IAAIn1F,KAAK,SAAStN,GAAG,MAAOqS,GAAErS,EAAEstH,GAAGttH,EAAE8H,KAAKwF,KAAK,SAASxF,GAAW,MAARggH,IAAGz1G,EAAEvK,GAAUuK,EAAE69B,aAC1Y7uC,GAAEu4F,GAAG,SAAS9xF,GAAG,OAAG,KAASA,EAAEkiC,iBAAa,KAASliC,EAAE69G,SAAS,MAAO2B,IAAGvhH,KAAM,IAAIsM,GAAEtM,IAAK,OAAOqgH,IAAErgH,KAAKA,KAAK08F,IAAIn1F,KAAK,SAAStN,GAAG,MAAOqS,GAAErS,EAAE45F,GAAG55F,GAAGgqC,YAAYliC,EAAEkiC,YAAYm+E,SAASrgH,EAAE69G,aAAar4G,KAAK,SAASxF,GAA6M,MAA1MggH,IAAGz1G,EAAEvK,GAAG4/G,GAAGr1G,EAAE,cAAcvK,EAAEkiC,aAAa,MAAM09E,GAAGr1G,EAAE,WAAWvK,EAAEqgH,UAAU,MAAM5pB,GAAElsF,EAAE+0G,aAAa,SAASt/G,GAAG,aAAaA,EAAE+pG,aAAaxvF,GAAEva,EAAE,cAAcuK,EAAE23B,aAAa3nB,GAAEva,EAAE,WAAWuK,EAAEszG,aAAoBkB,GAAGx0G,KAAK/E,KAAK+5G,MACrbhmH,GAAE48F,GAAG,SAASn2F,GAAG,GAAIuK,GAAEtM,IAAK,OAAOqgH,IAAErgH,KAAK6hH,GAAG7hH,MAAMuH,KAAK,SAAStN,GAAG,MAAOq4F,GAAGkvB,GAAGl1G,GAAGvK,GAAG6vG,GAAGtlG,EAAErS,EAAEA,GAAG8H,IAAIwF,KAAK,SAASxF,GAAG,GAAI9H,KAA8I,OAAzIu+F,IAAEz2F,EAAEmgH,qBAAqB,SAASngH,GAAG9H,EAAE8H,EAAE+pG,aAAY,IAAKtT,GAAEgpB,GAAGl1G,GAAG,SAASvK,GAAG9H,EAAE8H,IAAI2/G,GAAGp1G,EAAEvK,KAAK9H,EAAEm0G,GAAGygB,cAAcvyG,GAAEhQ,EAAE,cAAc,MAAaw0G,GAAGx0G,KAAKw0G,GAAGx0G,GAAG/E,KAAK,WAAW,KAAM,IAAI06F,IAAE,0BACzT3mG,GAAEwhD,OAAO,WAAW,GAAI/6C,GAAE/B,IAAK,OAAOqgH,IAAErgH,KAAKA,KAAK08F,IAAIn1F,KAAK,SAAS+E,GAAG,MAAO0kG,IAAEjvG,EAAE9H,EAAEm2H,IAAI/jB,QAAQ//F,MAAM/E,KAAK,WAAWo1F,GAAE56F,EAAE,GAAI89G,IAAG,mBAAmBt4G,KAAK,WAAW,IAAI,GAAI+E,GAAE,EAAEA,EAAEvK,EAAEumE,EAAEvsE,OAAOuQ,IAAIvK,EAAEumE,EAAEh8D,GAAGoyC,OAAO,cAAe8hE,IAAGz+G,EAAE,MAAM0+G,GAAG1+G,EAAE,MAAMA,EAAEumE,KAAKvmE,EAAE/H,GAAE,EAAG4mH,GAAG7+G,GAAGua,GAAEva,EAAE,eAAe,MAAMA,EAAEA,GAAGA,EAAEA,EAAE4uH,YAAY5uH,MACtTzG,GAAE04F,GAAG,SAASjyF,EAAEuK,GAAG,SAAM,gBAAgBvK,IAAI/B,KAAKgmB,GAAG,OAAO1Z,GAAGtM,KAAKsC,GAAG,kBAAkBP,IAAI/B,KAAKgmB,GAAG,OAAO1Z,GAAGtM,KAAKsC,GAAG,mBAAmBP,IAAI/B,KAAK6iH,GAAG,OAAOv2G,GAAG,qBAAqBvK,IAAI/B,KAAK6iH,GAAG,OAAOv2G,IAAShR,GAAEy1F,GAAG,SAAShvF,EAAEuK,EAAErS,EAAEC,GAAG,gBAAgB6H,GAAG,kBAAkBA,GAAG7H,IAAI8F,KAAKgmB,GAAG,QAAQ/rB,GAAG+F,KAAKwN,EAAExN,KAAKwN,EAAEvT,GAAGqS,IAAIrS,GAAG+F,KAAKsC,GAAGtC,KAAKsC,EAAEgK,GAAGtM,KAAKsM,IAAItM,KAAKsM,EAAEoyC,SAAS1+C,KAAKsM,EAAE,YAAatM,MAAKsC,QAAStC,MAAKwN,IACjZlS,GAAEu2F,GAAG,SAAS9vF,EAAEuK,GAAG,MAAM,gBAAgBvK,GAAGuK,IAAItM,KAAKgmB,GAAG,MAAMslC,EAAEtrD,KAAKk0F,GAAGl0F,MAAM,kBAAkB+B,GAAGuK,IAAItM,KAAKgmB,GAAG,MAAMslC,EAAEtrD,KAAKm0F,GAAGn0F,MAAM,mBAAmB+B,IAAI/B,KAAK6iH,GAAG,OAAOv2G,EAAEg/C,EAAEtrD,KAAKk0F,GAAGl0F,MAAM,qBAAqB+B,IAAI/B,KAAK6iH,GAAG,OAAOv2G,EAAEg/C,EAAEtrD,KAAKm0F,GAAGn0F,MAAM,MAAM1E,GAAEq7F,GAAG,SAAS50F,GAAG,GAAIuK,GAAEtM,IAAK,OAAO0iH,IAAG1iH,KAAK,eAAe+B,EAAE,WAAW,MAAOsgH,IAAG/1G,EAAEvK,EAAE+pG,YAAYvkG,KAAK,WAAW,MAAOu5G,IAAGx0G,OAAM,IAAKhR,GAAE67F,GAAG,SAASp1F,GAAG,MAAO2gH,IAAG1iH,KAAK,iBAAiB+B,EAAE,WAAW,MAAOumE,QAAK,IAEjUhtE,GAAEs7F,GAAG,SAAS70F,GAAG,GAAIuK,GAAEtM,IAAK,OAAO4iH,IAAG5iH,KAAK,kBAAkB+B,EAAE,WAAW,MAAOsgH,IAAG/1G,EAAEvK,EAAE+pG,cAAa,IAAKxwG,GAAE87F,GAAG,SAASr1F,GAAG,MAAO6gH,IAAG5iH,KAAK,oBAAoB+B,EAAE,WAAW,MAAOumE,QAAK,IAE7MhtE,GAAE44F,GAAG,SAASnyF,EAAEuK,GAAG,GAAIrS,GAAE+F,IAAKA,MAAKsM,IAAItM,KAAKsM,EAAEoyC,SAAS1+C,KAAKsM,EAAE,KAAM,IAAIpS,GAAE,IAAqK,OAAOmmH,IAAErgH,KAAvKA,KAAK08F,IAAIn1F,KAAK,SAASrN,GAAG,MAAOo4G,IAAGr4G,EAAEA,GAAG6yG,WAAW/qG,EAAE2rD,UAAUphD,EAAE+/F,QAAQnyG,MAAMqN,KAAK,SAASxF,GAAoB,MAAjB7H,GAAEooH,GAAGroH,EAAE8H,EAAE,QAAe0gH,GAAGxoH,EAAE8H,KAAKwF,KAAK,WAAW,MAAOrN,OACjWoB,GAAE64F,GAAG,SAASpyF,EAAEuK,GAAG,GAAIrS,GAAE+F,IAAKA,MAAKsM,IAAItM,KAAKsM,EAAEoyC,SAAS1+C,KAAKsM,EAAE,KAAM,IAAIpS,GAAE,IAA6L,OAAOmmH,IAAErgH,KAA/LsoE,KAAI/gE,KAAK,WAAW,MAAO2kG,IAAGsG,GAAGv4G,EAAEA,GAAG6yG,WAAW/qG,EAAE2rD,UAAUphD,IAAIrS,EAAEkxE,OAAO5jE,KAAK,SAASxF,GAA+C,MAA5C7H,GAAEooH,GAAGroH,EAAE8H,EAAE,kBAAkBggH,GAAG9nH,EAAE8H,GAAG9H,EAAEJ,EAAE,KAAYI,EAAEkwC,WAAW5iC,KAAK,WAAW,MAAOrN,MAAoB,IAAKoB,GAAE4qG,GAAG,SAASnkG,GAAG,GAAIuK,GAAEtM,KAAK/F,EAAE,IAAK,OAAOomH,IAAErgH,KAAKA,KAAK08F,IAAIn1F,KAAK,SAAS+E,GAAO,MAAJrS,GAAEqS,MAAQ,KAAqBvK,GAAGixF,EAAGjxF,MAAMioG,GAAG,GAAIT,IAAGxnG,MAAMwF,KAAK,SAASxF,GAAG,MAAOuK,GAAErS,EAAEisG,GAAGjsG,EAAE8H,KAAKwF,KAAK,SAASxF,GAAG,GAAGuK,EAAE2iG,OAAOltG,EAAE,MAAOuK,GAAE69B,WAAW5iC,KAAK,gBAC3OjM,GAAE83C,OAAO,WAAW,MAAOpzC,MAAKw1F,KACrTl6F,GAAEk6F,EAAE,WAAW,GAAIzzF,IAAGopE,IAAInrE,KAAKmrE,IAAIlnC,YAAYjkC,KAAKikC,YAAY27E,SAAS5/G,KAAK4/G,SAAS3Q,MAAMjvG,KAAKivG,MAAM+R,cAAchhH,KAAKghH,cAAc9S,YAAYluG,KAAKkuG,YAAY+S,YAAYjhH,KAAKihH,YAAYI,gBAAgBtB,OAAO//G,KAAK28F,EAAE7lD,QAAQ92C,KAAK3F,EAAE2lH,WAAWhgH,KAAKw4F,EAAEyqB,gBAAgBjjH,KAAK1E,EAAEk6F,IAAI0tB,gBAAgBljH,KAAK6iH,GAAG,KAA0G,OAApG7iH,MAAKkhH,UAAU/tB,EAAGpxF,EAAE/B,KAAKkhH,SAAS1rB,KAAKgD,GAAEx4F,KAAKqhH,aAAa,SAAS/0G,GAAGvK,EAAEs/G,aAAaplH,KAAKwsG,GAAGn8F,MAAavK,EAEtR,IAAIyoB,KAAIrwB,KAAK,eAAeo/F,EAAE,UAAsQ+pB,IAAGvoH,UAAUirB,EAAE,WAAW,GAAIjkB,GAAE/B,KAAKsM,EAAE6uG,GAAG,QAAS3lF,IAAGx1B,KAAK,WAAW,MAAOsoE,MAAI/gE,KAAK,WAAW,MAAOxF,GAAE9H,GAAG,SAAS8H,EAAE9H,EAAEs/F,EAAEx3F,EAAEuK,EAAE5R,IAAI4R,EAAEvK,EAAEA,GAAG,OAAOwF,KAAK,SAAStN,GAAG,GAAGA,EAAE,MAAOupH,IAAGzhH,EAAE,SAASwF,KAAK,WAAWxF,EAAE9H,EAAEqS,QAC/T,IAAIm3G,KAAItpH,KAAK,cAAco/F,EAAE,UACnW+pB,IAAGvoH,UAAUy4F,GAAG,SAASzxF,GAAG,GAAIuK,GAAE,KAAKrS,EAAE+F,IAAW,OAANq6G,IAAGt4G,GAAUyzB,GAAGx1B,KAAK,WAAW,MAAO+B,IAAG9H,EAAEA,EAAEs/F,EAAEt/F,EAAEqS,EAAE5R,IAAIT,EAAEA,EAAEA,EAAE8H,GAAGwF,KAAK,SAASrN,GAAO,MAAJoS,GAAEpS,EAASspH,GAAGvpH,EAAE8H,KAAKwF,KAAK,WAAqB,GAAVtN,EAAEA,EAAEkhH,GAAGp5G,GAAMuK,EAAE,MAAOrS,GAAEqS,EAAElC,IAAInQ,EAAEA,EAAEqS,EAAErS,EAAE8H,KAAKumE,QAE8IhiE,EAAEw9G,GAAGpnB,IAA8Dp2F,EAAE+9G,GAAG9qB,IAA2DjzF,EAAEg+G,GAAG/qB,IAAGj+F,GAAEwoH,GAAG/oH,UAC9eO,GAAEk4F,GAAG,SAASzxF,GAAkB,MAAfA,GAAE/B,KAAK1E,EAAEk4F,GAAGzxF,GAAU8wG,GAAE7yG,KAAK+B,IAAIzG,GAAEmvG,GAAG,SAAS1oG,GAAG/B,KAAKugH,IAAIx+G,GAAG/B,KAAKlG,IAAIkG,KAAKugH,EAAEx+G,EAAE+tG,GAAG9vG,KAAK/F,EAAE+F,KAAKugH,GAAG5jB,GAAE38F,KAAK,GAAIqkH,IAAGrkH,KAAKukH,QAAQjpH,GAAEipH,EAAE,WAAW,MAAOvkH,MAAKugH,GAAGjlH,GAAEg9F,GAAG,WAAW,GAAIv2F,GAAE+K,GAAE4b,SAAU1oB,MAAKyqG,GAAG1oG,EAAEA,EAAEkvH,WAAWlvH,EAAEkvH,UAAU,IAAIlvH,EAAEmvH,UAAUnvH,EAAEovH,cAAc,KAAK,OAAO71H,GAAEu7F,GAAG,SAAS90F,GAAG/B,KAAKsoE,EAAErsE,KAAK8F,GAAGguG,GAAG/vG,KAAK/F,EAAE4uB,GAASynB,YAAYw2D,GAAGj+E,GAASynB,YAAYtwC,KAAKsoE,GAAG,MAAMq0B,GAAE38F,KAAK,GAAIskH,IAAGtkH,KAAKsoE,KAAKhtE,GAAEo3F,GAAG,WAAW,MAAOC,GAAG3yF,KAAKsoE,IACvThtE,GAAE83C,OAAO,WAAW,OAAO2sE,OAAO1jG,GAAErc,MAAM1D,QAAQyjH,OAAOC,WAAW3jG,GAAErc,MAAM1D,QAAQ0jH,WAAWlpE,QAAQz6B,GAAErc,MAAM7F,KAAK0qH,YAAYzE,GAAEpgH,OAAOogH,GAAEpgH,MAAMw1F,MAChBl6F,GAAE04F,GAAG,SAASjyF,EAAEuK,GAAG,OAAOvK,GAAG,IAAK,UAAU,IAAK,oBAAoB,OAAM,CAAG,KAAK,iBAAiB,MAAO/B,MAAKgmB,GAAG1Z,KAAKtM,KAAKsC,CAAE,SAAQ,OAAM,IAChZhH,GAAEy1F,GAAG,SAAShvF,EAAEuK,EAAErS,EAAEC,GAAG,kBAAkB6H,GAAG/B,KAAKgmB,GAAG9rB,IAAID,GAAG+F,KAAKwN,EAAExN,KAAKwN,EAAEvT,GAAGqS,IAAIrS,GAAG+F,KAAKsC,GAAGtC,KAAKsC,EAAEgK,GAAGtM,KAAKsM,IAAItM,KAAKsM,EAAEoyC,SAAS1+C,KAAKsM,EAAE,YAAatM,MAAKsC,QAAStC,MAAKwN,IAAIlS,GAAEu2F,GAAG,SAAS9vF,EAAEuK,GAAG,MAAM,qBAAqBvK,GAAG,kBAAkBA,GAAG/B,KAAKgmB,GAAG1Z,GAAGtM,KAAKsC,EAAEgpD,EAAEtrD,KAAK41F,GAAG51F,MAAM,MACjR1E,GAAEs6F,GAAG,SAAS7zF,EAAEuK,GAAG,GAAIrS,GAAE+F,IAAK+B,IAAG+qG,WAAW/qG,EAAE2rD,UAAUphD,GAAGtM,KAAKsM,IAAItM,KAAKsM,EAAEoyC,SAAS1+C,KAAKsM,EAAE,KAAM,IAAIpS,GAAE,KAAK6F,EAAE,KAAKuC,EAAE6vG,GAAGl4G,EAAEA,EAAE8H,GAAGwF,KAAK,SAASxF,GAAmB,MAAhB7H,GAAEo0G,GAAGvsG,GAAGhC,EAAEorG,GAAGppG,GAAUA,GAAyK,OAArKA,GAAE9H,EAAEmmH,EAAE74G,KAAK,WAAW,MAAOjF,KAAIiF,KAAK,SAASxF,GAAG,MAAO0iH,IAAGxqH,EAAE8H,KAAKwF,KAAK,WAAW,MAAOihG,KAAI6V,KAAK+B,GAAEnmH,GAAGmyD,WAAWlyD,EAAEqoH,mBAAmBxiH,EAAEyiH,cAAc,aAAoB3P,GAAE7yG,KAAK+B,IAC9VzG,GAAEu8F,GAAG,SAAS91F,GAAG,IAAIqlG,KAAK,MAAO5R,IAAE,GAAIyM,IAAE,+CAAgD,IAAI31F,GAAEtM,KAAK/F,EAAE+wG,GAAGjpG,EAAE+pG,YAAY5xG,EAAEgtG,KAAKnnG,EAAE,OAAOunG,MAAMX,OAAOtqF,GAAErc,MAAM1D,QAAQ0jH,YAAYj+G,EAAEirG,kBAAkBjtG,EAAEk4G,GAAG57F,GAAErc,MAAM1D,QAAQ0jH,WAAW3jG,GAAErc,MAAM1D,QAAQyjH,OAAO1jG,GAAErc,MAAM7F,KAAK,iBAAiB4H,EAAE,KAAK7H,EAAE2uB,GAASynB,aAAa,MAAO,IAAIhuC,GAAE8iG,GAAGrlG,EAAE9F,GAAGA,EAAEg4F,GAAGh4F,GAAGA,EAAE+3F,GACvM,OAD2M/3F,GAAEuqH,GAAGxkH,MAAMuH,KAAK,SAAS+E,GAAG,MAAOwxG,IAAGxxG,EAAEhK,EAAE,iBAAiBP,EAAE7H,IAAI6F,KAAKwH,KAAK,WAAW,MAAO,IAAIwtF,GAAE,SAAShzF,EAAE9H,GAAGqS,EAAEykF,GAAG,iBAAiB,KAAK,GAAIkR,IAAE,2BAC7e31F,EAAE0Z,GAAG1Z,EAAEhK,EAAEP,EAAEuK,EAAEkB,EAAEvT,EAAEqS,EAAE0Z,EAAE9rB,EAAEoS,EAAEA,EAAEA,EAAEvK,EAAEowF,GAAG7lF,EAAE,iBAAiBhK,EAAEpI,OAAOqN,KAAK,SAASxF,GAAY,MAATO,IAAG6iG,GAAG7iG,GAAUP,EAAEymG,GAAGzmG,GAAG,OAAO7G,EAAE,SAAS6G,GAAY,KAATO,IAAG6iG,GAAG7iG,GAASP,IAAY8wG,GAAE7yG,KAAK/F,IAAIqB,GAAEmkG,GAAG,SAAS19F,GAAG,IAAIqlG,KAAK,MAAO5R,IAAE,GAAIyM,IAAE,+CAAgD,IAAI31F,GAAEtM,IAAwG,OAAO6yG,IAAE7yG,KAA1GwkH,GAAGxkH,MAAMuH,KAAK,WAAW,MAAOm8G,IAAGp3G,EAAEhR,KAAKiM,KAAK,WAAW,MAAO+E,GAAEvK,EAAEmwF,GAAG,oBAAoBnwF,OACpWzG,GAAEktE,GAAG,WAAW,IAAI4+B,KAAK,MAAO5R,IAAE,GAAIyM,IAAE,+CAAgD,IAAIlgG,GAAE/B,IAAyF,OAAO6yG,IAAE7yG,KAA3FwkH,GAAGxkH,MAAMuH,KAAK,WAAW,MAAOxF,GAAEA,EAAEymE,OAAOjhE,KAAK,SAASxF,GAAG,MAAOA,GAAEymG,GAAGzmG,GAAG,SACuIzG,GAAEgsH,GAAG,WAAW,GAAIvlH,GAAE/B,IAAsG,OAAO6yG,IAAE7yG,KAAxGA,KAAKnG,EAAE0N,KAAK,WAAW,MAAI64G,IAAEr+G,IAAcgiH,GAAGhiH,EAAE,MAAa6hH,GAAG7hH,EAAEzG,GAAGiM,KAAK,WAAWm9G,GAAG3iH,MAAjDumE,SAG3XhtE,GAAEw8F,GAAG,WAAW,GAAI/1F,GAAE/B,IAAK,OAAO6jH,IAAG7jH,KAAK1E,EAAE+gB,GAAErc,MAAM1D,QAAQ0jH,YAAYz4G,KAAK,SAAS+E,GAAG,IAAIvK,EAAEjI,EAAE,CAAC,GAAIG,EAAE,IAAGA,EAAEmmH,GAAEr+G,IAAIuK,EAAE,CAACrS,EAAEmmH,GAAEr+G,GAAGopE,GAAI,IAAIjxE,GAAEoS,EAAE6+D,GAAIlxE,OAAE,KAASA,GAAG,OAAOA,GAAG,KAAKA,OAAG,KAASC,GAAG,OAAOA,GAAG,KAAKA,GAAKD,GAAGC,EAAE,GAAGD,EAAE,MAAO2nH,IAAGxB,GAAEr+G,GAAGuK,GAAG8zG,GAAEr+G,GAAG26F,KAAO0jB,GAAEr+G,IAAIuK,KAAEy3G,GAAGhiH,EAAEuK,GAAGA,IAAIy0G,GAAGz0G,GAAGA,EAAEqkF,GAAG5uF,EAAE46F,GAAG56F,EAAEA,GAAGA,EAAEA,EAAEgwE,UAAUhwE,GAAG2iH,GAAG3iH,QAAOzG,GAAE21F,GAAG,SAASlvF,GAAG,MAAO4hH,IAAG3jH,KAAK1E,EAAEyG,IAAIzG,GAAE66F,GAAG,WAAWuuB,GAAG1kH,MAAMA,KAAKixF,GAAGmvB,GAAEpgH,QAAQ1E,GAAE46F,GAAG,WAAWl2F,KAAKsnH,MAAMhsH,GAAEi7F,GAAG,WAAWv2F,KAAKsnH,MACrPhsH,GAAEk7F,GAAG,SAASz0F,GAAG,GAAIuK,GAAEtM,IAAKA,MAAK6tE,qBAAqB,WAAW9rE,EAAE0B,KAAK28G,GAAE9zG,OAAOhR,GAAEm7F,GAAG,SAAS10F,GAAG,GAAIuK,GAAEtM,IAAKglH,IAAGhlH,KAAK,WAAW+B,EAAE0B,KAAK28G,GAAE9zG,OAAOhR,GAAEy7F,GAAG,SAASh1F,EAAEuK,EAAErS,GAAG,GAAIC,GAAE8F,IAA+F,OAA1FA,MAAKsxE,GAAGzoD,GAASxhB,QAAQC,UAAUC,KAAK,WAAWtM,EAAE8G,GAAGA,EAAEq+G,GAAElmH,IAAIe,EAAE8G,EAAE0B,OAAO1B,EAAE0B,KAAK28G,GAAElmH,MAAa8F,KAAKm1F,GAAGpzF,EAAEuK,EAAErS,IACleqB,GAAEw7F,GAAG,SAAS/0F,EAAEuK,EAAErS,GAAG,GAAIC,GAAE8F,IAA8G,OAAzGA,MAAKsxE,GAAGzoD,GAASxhB,QAAQC,UAAUC,KAAK,WAAWrN,EAAEmmH,EAAEnmH,EAAE0zE,SAAS3yE,EAAE8G,GAAGA,EAAEq+G,GAAElmH,IAAIe,EAAE8G,EAAE0B,OAAO1B,EAAE0B,KAAK28G,GAAElmH,MAAa8F,KAAKo1F,GAAGrzF,EAAEuK,EAAErS,IAAIqB,GAAEw6F,GAAG,SAAS/zF,GAAG,GAAIuK,GAAEtM,IAAoG,OAAO6yG,IAAE7yG,KAAtGA,KAAKnG,EAAE0N,KAAK,WAAW,MAAO64G,IAAE9zG,GAAG8zG,GAAE9zG,GAAGowF,EAAE36F,GAAGwF,KAAK,SAASxF,GAAG,OAAOmtD,YAAYntD,KAAK,SAAyBzG,GAAEk8F,GAAG,SAASz1F,GAAG,GAAIuK,GAAEtM,IAAK,OAAOA,MAAKnG,EAAE0N,KAAK,WAAW,MAAOq9G,IAAGt4G,EAAE0kG,GAAE1kG,EAAErS,EAAEs2H,IAAI7uG,MAAM3f,OAAOwF,KAAK,SAASxF,GAAmC,MAAhCA,GAAEA,EAAEs8G,KAAKsD,GAAG5/G,EAAE,eAAc,GAAWuK,EAAE2kF,GAAGlvF,KAAKwF,KAAK,WAAW,MAAO64G,IAAE9zG,MACrehR,GAAEq8F,GAAG,SAAS51F,EAAEuK,GAAG,GAAIrS,GAAE+F,IAAK,OAAOA,MAAKnG,EAAE0N,KAAK,WAAW,MAAOq9G,IAAG3qH,EAAE+2G,GAAE/2G,EAAEA,EAAE00H,IAAI1f,MAAMltG,EAAEo0D,SAAS7pD,OAAO/E,KAAK,SAASxF,GAAG,MAAOA,GAAEs8G,QAAQ/iH,GAAEg6F,GAAG,SAASvzF,EAAEuK,GAAG,GAAIrS,GAAE+F,IAAK,OAAOA,MAAKnG,EAAE0N,KAAK,WAAW,MAAOq9G,IAAG3qH,EAAE+2G,GAAE/2G,EAAEA,EAAEk2H,IAAIlhB,MAAMltG,EAAEo0D,SAAS7pD,OAAO/E,KAAK,SAASxF,GAAG,MAAOA,GAAEs8G,QAAQ/iH,GAAEo8F,GAAG,SAAS31F,GAAG,MAAO/B,MAAK4zF,GAAG7xF,GAAGwF,KAAK,SAASxF,GAAG,MAAOA,GAAEs8G,QAAQ/iH,GAAEs4F,GAAG,SAAS7xF,GAAG,GAAIuK,GAAEtM,IAAK,OAAOA,MAAKnG,EAAE0N,KAAK,WAAW,MAAOq9G,IAAGt4G,EAAEvK,EAAE+vF,GAAGxlF,EAAErS,OAC1aqB,GAAE+rH,GAAG,WAAW,GAAItlH,GAAE/B,IAAK,OAAOA,MAAKnG,EAAE0N,KAAK,WAAW,GAAI+E,GAAE8zG,GAAEr+G,EAAG,OAAOuK,IAAGA,EAAE20G,YAAY30G,EAAEs4G,GAAG7iH,EAAEA,EAAE9H,EAAEotH,MAAM9/G,KAAK,SAAS+E,GAAmC,MAAhCA,GAAEA,EAAE+xG,KAAKsD,GAAGr1G,EAAE,eAAc,GAAWvK,EAAEkvF,GAAG3kF,KAAK/E,KAAK,WAAW,MAAO64G,IAAEr+G,QAAsEzG,GAAEsyE,OAAO,WAAW,MAAOwyC,IAAEpgH,OAAOogH,GAAEpgH,MAAMmrE,KAAK,MAClJ7vE,GAAE+5F,GAAG,SAAStzF,GAAG/B,KAAK6tE,qBAAqB9rE,GAAY,IAAT/B,KAAK3F,GAAc+lH,GAAEpgH,OAAO2gH,GAAGP,GAAEpgH,QAAQ1E,GAAEg8F,GAAG,SAASv1F,GAAG,GAAIuK,GAAEtM,IAAKw4F,IAAEx4F,KAAKhG,EAAE,SAASC,GAAGA,GAAG8H,GAAGuK,EAAEjS,MAAM,EAAE2F,KAAK3F,IAAI2F,KAAK3F,EAAE,GAAG,GAAG2F,KAAK3F,GAAG+lH,GAAEpgH,OAAO4gH,GAAGR,GAAEpgH,OAAOA,KAAK8tE,wBAAwB/rE,IACrZzG,GAAEuyE,qBAAqB,SAAS9rE,GAAG,GAAIuK,GAAEtM,IAAKA,MAAKhG,EAAEiC,KAAK8F,GAAG8wG,GAAE7yG,KAAKA,KAAKnG,EAAE0N,KAAK,WAAW+E,EAAExS,GAAGw4F,EAAGhmF,EAAEtS,EAAE+H,IAAIA,EAAE+iH,GAAGx4G,QAAQhR,GAAEwyE,wBAAwB,SAAS/rE,GAAG0wF,EAAGzyF,KAAKhG,EAAE,SAASsS,GAAG,MAAOA,IAAGvK,KAA0HzG,GAAEwhD,OAAO,WAAW98C,KAAKlG,GAAE,CAAG,KAAI,GAAIiI,GAAE,EAAEA,EAAE/B,KAAKiiG,EAAElmG,OAAOgG,IAAI/B,KAAKiiG,EAAElgG,GAAG28C,OAAO,cAAiG,OAAlF1+C,MAAKiiG,KAAKjiG,KAAK1E,IAAIyG,EAAE/B,KAAK1E,EAAE4/G,GAAGn5G,EAAEuK,EAAEvK,EAAEA,EAAE/B,KAAKgxF,KAAKhxF,KAAK+B,GAAG/B,KAAK+B,EAAE4uH,YAAY3wH,MAAa6oB,GAASxhB,QAAQC,WAC/bhM,GAAEq6F,GAAG,SAAS5zF,GAAG,MAAO8wG,IAAE7yG,KAAK+wG,GAAG/wG,KAAK/F,EAAE8H,KAAKzG,GAAEm9F,GAAG,SAAS12F,GAAG,MAAO/B,MAAKwyF,GAAGzwF,GAAGwF,KAAK,SAASxF,GAAG,MAAOA,GAAEsJ,KAAK4jG,SAAS3zG,GAAE23F,GAAG,SAASlxF,EAAEuK,GAAG,MAAOumG,IAAE7yG,KAAKA,KAAK/F,EAAEg5F,GAAGlxF,EAAEuK,GAAG/E,KAAK,gBAAgBjM,GAAEk3F,GAAG,SAASzwF,GAAG,MAAO8wG,IAAE7yG,KAAKA,KAAK/F,EAAEu4F,GAAGzwF,GAAGwF,KAAK,SAASxF,GAAG,MAAO,IAAI6mG,IAAG7mG,OAAOzG,GAAE03F,GAAG,SAASjxF,GAAG,MAAO8wG,IAAE7yG,KAAKA,KAAK/F,EAAE+4F,GAAGjxF,GAAGwF,KAAK,gBAClYjM,GAAEuwB,GAAG,SAAS9pB,EAAEuK,GAAG,GAAIrS,GAAE+F,IAAK,OAAO6yG,IAAE7yG,KAAKsoE,KAAI/gE,KAAK,WAAW,WAAM,KAAqB+E,GAAG0mF,EAAG1mF,MAAM09F,GAAG,GAAIT,IAAGj9F,MAAM/E,KAAK,SAAS+E,GAAG,MAAOrS,GAAEA,EAAE4xB,GAAG9pB,EAAEuK,KAAK/E,KAAK,gBAAgBjM,GAAEs8F,GAAG,SAAS71F,EAAEuK,GAAG,MAAOumG,IAAE7yG,KAAK0+G,GAAG1+G,KAAK+B,EAAEuK,EAAEg/C,EAAEtrD,KAAK4zF,GAAG5zF,QACnB,IAAIklH,IAAG,6DAA6Dp0G,MAAM,KAIuEq1G,GAAG,WAAWE,GAAG,mBAAmBL,GAAG,UAAUC,GAAG,MACvS3qH,IAAEyqH,GAAGhrH,UACzHO,GAAEy2F,GAAG,WAAW,GAAIhwF,GAAE/B,IAAK,OAAOA,MAAK/F,EAAE+F,KAAK/F,EAAE+F,KAAK/F,EAAEssH,GAAGvmH,KAAKsoE,KAAI/gE,KAAK,WAAW,GAAG8/F,KAAK,MAAOd,KAAK,MAAM,IAAItE,IAAE,8CAA8C,8EAA+E16F,KAAK,WAAW,MAAOo/G,IAAGE,KAAK9kH,EAAE1H,OAAOkN,KAAK,WAAW,MAAOypG,IAAEjvG,EAAEuvF,EAAE++B,SAAS9oH,KAAK,SAAS+E,GAAGvK,EAAEA,EAAEikH,IAAI15G,EAAEgkH,mBAAmBp1H,EAAE,SAASoR,GAAY,KAATvK,GAAE9H,EAAE,KAAWqS,MACzYhR,GAAE4I,OAAO,WAAWsiH,GAAGxmH,KAAM,IAAI+B,GAAE/B,IAAK,OAAOumH,IAAGvmH,KAAKA,KAAK+xF,KAAKxqF,KAAK,WAAW,GAAG,OAAOxF,EAAEuK,EAAE,CAAC,GAAIA,GAAEvK,EAAEjI,CAAE,KAAIiI,EAAEzG,EAAE,CAAC,GAAIrB,GAAEo8F,GAAG/pF,EAAGA,GAAE8rF,GAAG,OAAOn+F,EAAEiH,YAAYoL,GAAGvK,EAAEuK,EAAEo6G,WAAWxiH,OAAOoI,EAAEvK,EAAEA,GAAG,MAAOA,GAAEuK,MAAMhR,GAAEwqH,OAAO,WAAWU,GAAGxmH,KAAM,IAAI+B,GAAE/B,IAAK,OAAOumH,IAAGvmH,KAAKA,KAAKkE,SAASqD,KAAK,SAAS+E,GAAG,MAAO,IAAIyoF,GAAE,SAAS96F,GAAG,GAAIC,GAAEwsH,WAAWmD,YAAYv9G,EAAG,IAAGpS,EAAED,EAAEC,OAAO,CAAC,GAAI6F,GAAE,QAAFA,GAAWuM,GAAGA,IAAIg6G,GAAGvkH,EAAEhC,GAAG9F,EAAEqS,IAAKvK,GAAElI,EAAEoC,KAAK8D,GAAGgC,EAAEzG,GAAGorH,WAAW0K,QAAQrvH,EAAEuK,UAAUhR,GAAEynC,MAAM,WAAWyjF,GAAGxmH,MAAM,OAAOA,KAAKsM,GAAGo6G,WAAW3jF,MAAM/iC,KAAKsM,IACtZhR,GAAEmqD,MAAM,WAAW+gE,GAAGxmH,MAAMA,KAAKhG,GAAE,EAAG6sH,KAAKv6G,GAAI,KAAI,GAAIvK,GAAE,EAAEA,EAAE/B,KAAKgmB,EAAEjqB,OAAOgG,IAAI/B,KAAKgmB,EAAEjkB,GAAG28C,OAAO,iDAAkD,KAAI1+C,KAAK1E,EAAE,CAACyG,EAAEs0F,GAAGr2F,KAAKlG,EAAG,KAAI,GAAIwS,GAAEA,EAAEvK,EAAEH,YAAYG,EAAExD,YAAY+N,IAAK,IAAIs6G,IAAG9vB,GAAG,qFAE6HgwB,GAAG,IAC6BxgH,GAAEygH,GAAGhB,IAA8XhY,GAAE+V,GAAG/oH,WAAWi4F,IAAI74F,KAAK,kBAAkBkI,GAAGk+G,GAAE,UAAU/tB,IAAIr4F,KAAK,kBAAkBkI,GAAGk+G,GAAE,UAAUttB,IAAI94F,KAAK,uBAAuBkI,GAAGk+G,GAAE,QAAQA,GAAE,iBAAiBjrB,IAAIn7F,KAAK,iCAAiCkI,GAAGk+G,GAAE,SAASA,GAAE,cAAc5qB,IAAIx7F,KAAK,yBAAyBkI,GAAGk+G,GAAE,WAAW/3C,IAAIruE,KAAK,oBAAoBkI,MAAMy0F,IAAI38F,KAAK,qBAAqBkI,GAAG04G,GAAEzpC,KAAI8zC,KAAK,kBAAkBA,GAAG,aAAY,GAAIA,GAAG,iBAAgB,KAAMruB,IAAI58F,KAAK,mBAAmBkI,GAAG04G,GAAEzpC,KAAI8zC,KAAK,kBAAkBA,GAAG,aACl1C,GAAIA,GAAG,iBAAgB,KAAMv5F,IAAI1xB,KAAK,yBAAyBkI,GAAGk+G,GAAE,SAASxF,GAAEzpC,GAAE,0BAAyB,GAAI+zC,GAAG,MAAK,GAAI,0BAAyB,KAAM7xB,IAAIr5F,KAAK,iBAAiBkI,GAAGk+G,GAAE,iBAAiB3sB,IAAIz5F,KAAK,sCAAsCkI,GAAGsjH,OAAO0B,IAAIltH,KAAK,oBAAoBkI,MAAMq1F,IAAIv9F,KAAK,uBAAuBkI,GAAGsjH,OAAOnuB,IAAIr9F,KAAK,wBAAwBkI,GAAGk+G,GAAE,WAAW5oB,IAAIx9F,KAAK,6BAA6BkI,GAAGk+G,GAAE,SAASA,GAAE,cAAc3oB,IAAIz9F,KAAK,wBAAwBkI,GAAGk+G,GAAE,eAC1esF,OAAOhuB,IAAI19F,KAAK,kBAAkBkI,GAAGujH,OAAOnmB,IAAItlG,KAAK,qBAAqBkI,GAAGujH,OAAO0B,IAAIntH,KAAK,UAAUkI,MAAM+wC,QAAQj5C,KAAK,SAASkI,GAAGk+G,GAAE,MAAK,KAAMjoB,IAAIn+F,KAAK,oBAAoBkI,MAAMo2F,IAAIt+F,KAAK,0BAA0BkI,GAAGk+G,GAAE,YAAY,SAAUx+G,EAAEuK,GAAG,IAAI,GAAIrS,KAAKqS,GAAE,CAAC,GAAIpS,GAAEoS,EAAErS,GAAGE,IAAK,IAAGD,IAAID,EAAE,CAAC,GAAI8F,GAAEuM,EAAErS,GAAGs7F,EAAGj7F,QAAOC,eAAewH,EAAE7H,GAAGQ,IAAI,WAAW,MAAOsF,MAAK/F,IAAImQ,IAAI,SAASrI,GAAGkjH,GAAG/qH,GAAG6F,IAAIgC,IAAG,GAAI/B,KAAK/F,GAAG8H,GAAGtH,YAAW,OAASqpH,GAAG/oH,WAAWs8F,IAAIl9F,KAAK,eAAeo7F,GAAGwlB,GAAEwF,KAAI8E,KAAK,mBAC/dvB,GAAGuN,YAAY/W,GAAGwJ,GAAGuN,YAAYC,MAAM,QAAQxN,GAAGuN,YAAYE,QAAQ,UAAUzN,GAAGuN,YAAYX,KAAK,OACpG3iB,GAAE+R,GAAG/kH,WAAW+hD,QAAU3iD,KAAK,SAASkI,MAAMq6F,GAAGviG,KAAK,aAAakI,GAAG8iH,OAAOl2D,UAAU90D,KAAK,WAAWkI,GAAG8iH,OAAO9xB,IAAIl5F,KAAK,oCAAoCkI,GAAGsjH,OAAOjvB,IAAIv8F,KAAK,qBAAqBkI,GAAGsjH,OAAOttB,IAAIl+F,KAAK,sBAAsBkI,GAAGk+G,GAAE,eAAesF,OAAOlvB,IAAIx8F,KAAK,gBAAgBkI,GAAGujH,OAAOhvB,IAAIz8F,KAAK,mBAAmBkI,GAAGujH,OAAOryB,IAAIp5F,KAAK,8CAA8CkI,GAAGsjH,OAAO1uB,IAAI98F,KAAK,+BAA+BkI,GAAGsjH,OAAOzuB,IAAI/8F,KAAK,gCAAgCkI,GAAGk+G,GAAE,eACpfsF,OAAO1uB,IAAIh9F,KAAK,0BAA0BkI,GAAGujH,OAAOxuB,IAAIj9F,KAAK,6BAA6BkI,GAAGujH,OAAOz7E,QAAQhwC,KAAK,SAASkI,MAAM6jG,IAAI/rG,KAAK,wBAAwBkI,GAAG04G,GAAEzpC,GAAE,0BAAyB,GAAI+zC,GAAG,MAAK,GAAI,0BAAyB,KAAMjyE,QAAQj5C,KAAK,SAASkI,GAAGk+G,GAAE,MAAK,KAAMroB,IAAI/9F,KAAK,SAASkI,GAAGk+G,GAAE,cAAc5b,IAAIxqG,KAAK,cAAckI,GAAGk+G,GAAE,WAAWgH,IAAIptH,KAAK,iBAAiBkI,GAAGk+G,GAAE,cAAcnoB,IAAIj+F,KAAK,oBAAoBkI,GAAGsjH,GAAG,WAAW9xB,IAAI15F,KAAK,gBAAgBkI,GAAGivE,GAAE,eAC3dy8B,GAAEhZ,EAAEh6F,WAAWG,GAAGf,KAAK,SAASoN,MAAMpN,KAAK,UAAU4zG,GAAE0Q,GAAG1jH,WAAW81H,SAAS12H,KAAK,UAAUkI,GAAGk+G,GAAE,wBAAwBsC,GAAEjV,GAAG,aAAa,SAAS7rG,EAAEuK,GAAG,MAAO,IAAIqhG,IAAG5rG,EAAEuK,KAAKi0G,GAAE,SAASA,GAAE,cAAcxS,GAAEb,GAAGnyG,WAAW22F,IAAIv3F,KAAK,WAAWkI,GAAGk+G,GAAE,WAAWhuB,IAAIp4F,KAAK,sBAAsBkI,GAAGivE,GAAE,6BAA6BuxC,GAAE3V,GAAG,aAAaC,IAAI4N,GAAEwF,KAAIjvC,KAAI,WAAWy8B,GAAEX,GAAGryG,WAAW22F,IAAIv3F,KAAK,WAAWkI,GAAGk+G,GAAE,WAAWhuB,IAAIp4F,KAAK,sBAAsBkI,GAAGivE,GAAE,6BAClcuxC,GAAEzV,GAAG,aAAaC,IAAI0N,GAAEwF,KAAIjvC,KAAI,WAAWy8B,GAAET,GAAGvyG,WAAW22F,IAAIv3F,KAAK,WAAWkI,GAAGk+G,GAAE,WAAWhuB,IAAIp4F,KAAK,sBAAsBkI,GAAGivE,GAAE,6BAA6BuxC,GAAEvV,GAAG,aAAaC,IAAIwN,GAAEwF,KAAIxF,GAAEzpC,KAAI+zC,MAAM,WAAWtK,GAAEwF,KAAI8E,KAAK,eAAc,KAAMtX,GAAEP,GAAGzyG,WAAWw3F,IAAIp4F,KAAK,sBAAsBkI,GAAGivE,GAAE,6BAA6BuxC,GAAErV,GAAG,aAAaE,IAAIqN,GAAEwF,KAAIjvC,KAAI,SAASivC,GAAE,UAAS,KACvXxS,GAAEvQ,GAAEziG,WAAW22F,IAAIv3F,KAAK,WAAWkI,GAAGk+G,GAAE,WAAWn0D,YAAYjyD,KAAK,aAAakI,GAAG04G,GAAEwF,KAAI8E,KAAK,WAAU,GAAItK,GAAEwF,KAAI8E,KAAK,eAAc,KAAM9yB,IAAIp4F,KAAK,sBAAsBkI,GAAGivE,GAAE,6BAA6BuxC,GAAEzU,GAAG,aAAaC,IAAIkS,GAAE,kBAAkBA,GAAE,sBAAsBxS,GAAEK,GAAGrzG,WAAW+3F,IAAI34F,KAAK,oBAAoBkI,GAAGk+G,GAAE,eAAesF,SAAS9X,GAAE9L,GAAElnG,WAAWq4C,QAAQj5C,KAAK,SAASkI,GAAGk+G,GAAE,MAAK,OAAQxS,GAAEgB,GAAGh0G,WAAWq4C,QAAQj5C,KAAK,SAASkI,GAAGk+G,GAAE,MAAK,OAChcxS,GAAEe,GAAG/zG,WAAWq4C,QAAQj5C,KAAK,SAASkI,GAAGk+G,GAAE,MAAK,OAAQxS,GAAEgZ,GAAGhsH,WAAW0qD,OAAOtrD,KAAK,QAAQkI,MAAM6B,QAAQ/J,KAAK,SAASkI,MAAMyjH,QAAQ3rH,KAAK,SAASkI,QACpJ,WAAY,OAAG,KAAqBwmB,KAAUA,GAASszB,WAAUtzB,GAASszB,SAAS2vB,gBAC2K,KAAMnhE,OAAM,8FADtK,IAAI5I,IAAGyvH,KAAK1N,GAAGn5G,MAAMs3F,GAAG4gB,IAAE9gH,EAAE,oBAAoB6rG,OAAOiV,GAAE9gH,EAAE,uBAAuBmrG,OAAO2V,GAAE9gH,EAAE,qBAAqBqrG,OAAOyV,GAAE9gH,EAAE,qBAAqBurG,OAAOuV,GAAE9gH,EAAE,sBAAsByrG,OAAOqV,GAAE9gH,EAAE,gBAAgBy7F,IAAG+iB,GAAE,gBAAgBsC,GAAE9gH,EAAE,oBAAoBqsG,IAAIoX,OAAO3C,GAAE9gH,EAAE,oBAAoBglH,IAAIhM,GAAEwF,KAAI+E,KAAK,sBAAsBh0C,GAAE,uBAAsB,GAAIm0C,OAAO58F,GAASszB,SAAS2vB,gBAAgB,OAAO,SAAS/pE,EAC5f9H,GAAwI,MAArI8H,GAAE,GAAI+hH,IAAG/hH,GAAG9H,GAAGkiD,UAAUyxB,OAAOtiB,EAAEvpD,EAAE6rE,OAAO7rE,GAAGktD,SAAS3D,EAAEvpD,EAAE+zF,GAAG/zF,GAAG8rE,qBAAqBviB,EAAEvpD,EAAEszF,GAAGtzF,GAAG+rE,wBAAwBxiB,EAAEvpD,EAAEu1F,GAAGv1F,MAAaA,GAAGA,EAAE,SAASA,EAAE9H,GAAG,GAAG,WAAW8H,EAAE,IAAI9H,EAAEgxE,OAAO,MAAM/wE,OAAO2uB,GAASszB,SAASuwB,iBAAiB9sD,KAAKkgG,UACjP/lH,SAAuB,KAAX2lC,EAAyBA,EAAyB,mBAAThU,MAAuBA,KAAyB,mBAAX5gB,QAAyBA,ahMit3BzF/Q,KAAKJ,EAASH,EAAoB,MAIzD,SAAUI,EAAQD,EAASH,GAEjC,YAgBA,SAASm2B,GAAgBC,EAAUC,GAAe,KAAMD,YAAoBC,IAAgB,KAAM,IAAI1E,WAAU,qCAEhH,QAAS2E,GAA2BpE,EAAM3xB,GAAQ,IAAK2xB,EAAQ,KAAM,IAAIqE,gBAAe,4DAAgE,QAAOh2B,GAAyB,gBAATA,IAAqC,kBAATA,GAA8B2xB,EAAP3xB,EAElO,QAASi2B,GAAUC,EAAUC,GAAc,GAA0B,kBAAfA,IAA4C,OAAfA,EAAuB,KAAM,IAAI/E,WAAU,iEAAoE+E,GAAeD,GAASl1B,UAAYT,OAAO0Z,OAAOkc,GAAcA,EAAWn1B,WAAa8I,aAAezI,MAAO60B,EAAUx1B,YAAY,EAAO01B,UAAU,EAAM31B,cAAc,KAAe01B,IAAY51B,OAAOuZ,eAAiBvZ,OAAOuZ,eAAeoc,EAAUC,GAAcD,EAASnc,UAAYoc,GAjBje51B,OAAOC,eAAeZ,EAAS,cAC7ByB,OAAO,IAETzB,EAAQ+mE,kBAAgBvkE,EAExB,IAAIk0B,GAAe,WAAc,QAASvV,GAAiBwV,EAAQ5zB,GAAS,IAAK,GAAI7C,GAAI,EAAGA,EAAI6C,EAAMX,OAAQlC,IAAK,CAAE,GAAI02B,GAAa7zB,EAAM7C,EAAI02B,GAAW91B,WAAa81B,EAAW91B,aAAc,EAAO81B,EAAW/1B,cAAe,EAAU,SAAW+1B,KAAYA,EAAWJ,UAAW,GAAM71B,OAAOC,eAAe+1B,EAAQC,EAAWl0B,IAAKk0B,IAAiB,MAAO,UAAUV,EAAaW,EAAYC,GAAiJ,MAA9HD,IAAY1V,EAAiB+U,EAAY90B,UAAWy1B,GAAiBC,GAAa3V,EAAiB+U,EAAaY,GAAqBZ,MiM1/3BhiB4uC,EAAAjlE,EAAA,IACAqxE,EAAArxE,EAAA,IACAi4H,EAAAj4H,EAAA,IjMug4BoBG,GiMl/3BP+mE,cjMk/3B+B,SAAUhC,GAGpD,QAASgC,KACP,GAAIt1B,GAEAC,EAAOjU,EAAOkU,CAElB3b,GAAgB3vB,KAAM0gE,EAEtB,KAAK,GAAIvwD,GAAOrU,UAAUC,OAAQ4wB,EAAOpjB,MAAM4G,GAAOE,EAAO,EAAGA,EAAOF,EAAME,IAC3Esc,EAAKtc,GAAQvU,UAAUuU,EAGzB,OAAeg7B,GAASjU,EAAQtH,EAA2B9vB,MAAOorC,EAAOs1B,EAAc5sD,WAAaxZ,OAAOu2B,eAAe6vC,IAAgB3mE,KAAK0P,MAAM2hC,GAAOprC,MAAMwK,OAAOmiB,KAAiByK,EiM//3B5L7yB,OACE66D,SAAS,EACTD,SAAMhjE,GACNsO,MAAO,MjM4/3BA6gC,EAIJD,EAAQvb,EAA2BsH,EAAOkU,GAiD/C,MAlEAtb,GAAU0wC,EAAehC,GAoBzBruC,EAAaqwC,IACXrkE,IAAK,oBACLjB,MAAO,WiMlg4BP4E,KAAK0xH,uBAAuB1xH,KAAKtD,MAAMygE,ajMsg4BvC9gE,IAAK,yBACLjB,MAAO,SiMpg4Be+hE,GAAkB,GAAAjvB,GAAAluC,KAChCm4C,EAAen4C,KAAKtD,MAApBy7C,UACR,MACE,EAAA0yB,EAAA3yB,qBAAoBC,GACjB1G,WACAnuC,IAFH,aAEoB65D,EAFpB,iBAGGvuC,GAAG,QAAS,SAAA3J,GACX,GAAM0sG,GAAuB1sG,EAAS5X,UAChCukH,GAAsB,EAAAH,EAAAI,oBAAmBF,EAC/C,KAAKC,EAAoB71H,OAEvB,WADAmyC,GAAKxmC,UAAW+C,MAAO,KAAM00D,SAAMhjE,GAAWijE,SAAS,GAIzD,IAAM0yD,GAAcF,EAAoB,EACxC1jF,GAAKxmC,UACHy3D,MAAM,EAAAsyD,EAAAM,aAAYD,GAClBrnH,MAAO,KACP20D,SAAS,MAGf,MAAOpyC,GACP,GAAMw9C,6CAAyDrN,CAC/DlzD,SAAQQ,MAAM+/D,GACdxqE,KAAK0H,UAAW+C,MAAO,GAAIE,OAAM6/D,SjMwg4BnCnuE,IAAK,SACLjB,MAAO,WiMrg4BC,GAAAgwB,GACyBprB,KAAKuE,MAA9B46D,EADA/zC,EACA+zC,KAAM10D,EADN2gB,EACM3gB,MAAO20D,EADbh0C,EACag0C,OACrB,OAAOp/D,MAAKtD,MAAMwH,QAASi7D,OAAM10D,QAAO20D,gBjM6g4BnCsB,GACPjC,EAAgBzsC,gBAIZ,SAAUp4B,EAAQD,EAASH,GAEjC,YkMll4BO,SAASq4H,GAAoBG,GAClC,OAAQA,EAAa50H,UAClBohC,OAAO,SAAC6jC,EAAK76C,GAEZ,GAAMyqG,GAAcD,KAAgBxqG,EAKpC,OAJ2B,WAAvByqG,EAAYl4F,SACdk4F,EAAYzpH,GAAKgf,EACjB66C,EAAIpmE,KAAKg2H,IAEJ5vD,OAIN,QAAS0vD,GAAa5yD,GAC3B,OACE32D,GAAI22D,EAAK32D,GACT8lB,MAAO6wC,EAAK7wC,MACZmyC,aAActB,EAAKsB,clMok4BvBnmE,OAAOC,eAAeZ,EAAS,cAC7ByB,OAAO,IAETzB,EkMxl4BgBk4H,qBlMyl4BhBl4H,EkM5k4BgBo4H,elMmm4BV,SAAUn4H,EAAQD,EAASH,GAEjC,YAgBA,SAASm2B,GAAgBC,EAAUC,GAAe,KAAMD,YAAoBC,IAAgB,KAAM,IAAI1E,WAAU,qCAEhH,QAAS2E,GAA2BpE,EAAM3xB,GAAQ,IAAK2xB,EAAQ,KAAM,IAAIqE,gBAAe,4DAAgE,QAAOh2B,GAAyB,gBAATA,IAAqC,kBAATA,GAA8B2xB,EAAP3xB,EAElO,QAASi2B,GAAUC,EAAUC,GAAc,GAA0B,kBAAfA,IAA4C,OAAfA,EAAuB,KAAM,IAAI/E,WAAU,iEAAoE+E,GAAeD,GAASl1B,UAAYT,OAAO0Z,OAAOkc,GAAcA,EAAWn1B,WAAa8I,aAAezI,MAAO60B,EAAUx1B,YAAY,EAAO01B,UAAU,EAAM31B,cAAc,KAAe01B,IAAY51B,OAAOuZ,eAAiBvZ,OAAOuZ,eAAeoc,EAAUC,GAAcD,EAASnc,UAAYoc,GAjBje51B,OAAOC,eAAeZ,EAAS,cAC7ByB,OAAO,IAETzB,EAAQqmE,oBAAkB7jE,EAE1B,IAAIo8C,GAAWj+C,OAAOm+C,QAAU,SAAUnoB,GAAU,IAAK,GAAIz2B,GAAI,EAAGA,EAAIiC,UAAUC,OAAQlC,IAAK,CAAE,GAAIwuC,GAASvsC,UAAUjC,EAAI,KAAK,GAAIwC,KAAOgsC,GAAc/tC,OAAOS,UAAUC,eAAejB,KAAKsuC,EAAQhsC,KAAQi0B,EAAOj0B,GAAOgsC,EAAOhsC,IAAY,MAAOi0B,IAEnPD,EAAe,WAAc,QAASvV,GAAiBwV,EAAQ5zB,GAAS,IAAK,GAAI7C,GAAI,EAAGA,EAAI6C,EAAMX,OAAQlC,IAAK,CAAE,GAAI02B,GAAa7zB,EAAM7C,EAAI02B,GAAW91B,WAAa81B,EAAW91B,aAAc,EAAO81B,EAAW/1B,cAAe,EAAU,SAAW+1B,KAAYA,EAAWJ,UAAW,GAAM71B,OAAOC,eAAe+1B,EAAQC,EAAWl0B,IAAKk0B,IAAiB,MAAO,UAAUV,EAAaW,EAAYC,GAAiJ,MAA9HD,IAAY1V,EAAiB+U,EAAY90B,UAAWy1B,GAAiBC,GAAa3V,EAAiB+U,EAAaY,GAAqBZ,MmM9n4BhiB4uC,EAAAjlE,EAAA,IAOA04H,EAAA14H,EAAA,KnMkq4BI4wE,GA7BkBzwE,EmMhn4BTqmE,gBnMgn4BmC,SAAUtB,GmM/m4BxD,QAAAsB,GAAatjE,GAAYizB,EAAA3vB,KAAAggE,EAAA,IAAA5oC,GAAAtH,EAAA9vB,MAAAggE,EAAAlsD,WAAAxZ,OAAAu2B,eAAAmvC,IAAAjmE,KAAAiG,KACjBtD,GADiB,OAAA0tE,GAAArwE,KAAAq9B,GAEvBA,EAAK7yB,MAALg0C,KAAiBnhB,EAAK+6F,qBAAqBz1H,IAFpB06B,EnMyo4BzB,MAzBApH,GAAUgwC,EAAiBtB,GAa3BruC,EAAa2vC,IACX3jE,IAAK,4BACLjB,MAAO,SmM1n4BkBivE,GACzBrqE,KAAK0H,SAAL6wC,KACKv4C,KAAKmyH,qBAAqB9nD,QnM4n4B/BhuE,IAAK,SACLjB,MAAO,WmMrm4BP,MAAO4E,MAAKtD,MAAMwH,OAAXq0C,KAAuBv4C,KAAKuE,YnM0m4B9By7D,GACPvB,EAAgBzsC,eAEK,WACrB,GAAIkc,GAASluC,IAEbA,MmMpo4BAmyH,qBAAuB,SAACz1H,GACtB,IAAI,GACMygE,GAAmBzgE,EAAnBygE,SAAUgC,EAASziE,EAATyiE,IAGlB,OAAIhC,KAAajvB,EAAKxxC,MAAMygE,UAAYgC,EAAK32D,KAAO0lC,EAAKxxC,MAAMyiE,KAAK32D,OAKlE+rB,QAAQ,EAAA29F,EAAAE,eAAcjzD,GACtB10D,MAAO,KACP21D,gBAAiB,GAAIjgD,OAEvB,MAAO1V,GACP,OAASA,cnM6o4BT,SAAU7Q,EAAQD,EAASH,GAEjC,YoMps4BO,SAAS44H,GACdjzD,GAEA,GAAIr1B,GAAQ,EACN9sC,EAAQmiE,EAAKsB,aAAarjE,KAAKoT,IAAI,SAAAhI,GAEvC,MADAshC,IAASq1B,EAAKsB,aAAaj4D,GAAIshC,MAC/ByO,GAAS/vC,MAAO22D,EAAKsB,aAAaj4D,KAEpC,QACEi4D,aAActB,EAAKsB,aACnBzjE,QACA8sC,SpM4r4BJxvC,OAAOC,eAAeZ,EAAS,cAC7ByB,OAAO,GAGT,IAAIm9C,GAAWj+C,OAAOm+C,QAAU,SAAUnoB,GAAU,IAAK,GAAIz2B,GAAI,EAAGA,EAAIiC,UAAUC,OAAQlC,IAAK,CAAE,GAAIwuC,GAASvsC,UAAUjC,EAAI,KAAK,GAAIwC,KAAOgsC,GAAc/tC,OAAOS,UAAUC,eAAejB,KAAKsuC,EAAQhsC,KAAQi0B,EAAOj0B,GAAOgsC,EAAOhsC,IAAY,MAAOi0B,GAEvP32B,GoM7s4BgBy4H,iBpM6t4BV,SAAUx4H,EAAQD,EAASH,GAEjC,YAYA,SAASm2B,GAAgBC,EAAUC,GAAe,KAAMD,YAAoBC,IAAgB,KAAM,IAAI1E,WAAU,qCAEhH,QAAS2E,GAA2BpE,EAAM3xB,GAAQ,IAAK2xB,EAAQ,KAAM,IAAIqE,gBAAe,4DAAgE,QAAOh2B,GAAyB,gBAATA,IAAqC,kBAATA,GAA8B2xB,EAAP3xB,EAElO,QAASi2B,GAAUC,EAAUC,GAAc,GAA0B,kBAAfA,IAA4C,OAAfA,EAAuB,KAAM,IAAI/E,WAAU,iEAAoE+E,GAAeD,GAASl1B,UAAYT,OAAO0Z,OAAOkc,GAAcA,EAAWn1B,WAAa8I,aAAezI,MAAO60B,EAAUx1B,YAAY,EAAO01B,UAAU,EAAM31B,cAAc,KAAe01B,IAAY51B,OAAOuZ,eAAiBvZ,OAAOuZ,eAAeoc,EAAUC,GAAcD,EAASnc,UAAYoc,GAbje51B,OAAOC,eAAeZ,EAAS,cAC7ByB,OAAO,IAETzB,EAAQ4mE,aAAWpkE,EAEnB,IAAIk0B,GAAe,WAAc,QAASvV,GAAiBwV,EAAQ5zB,GAAS,IAAK,GAAI7C,GAAI,EAAGA,EAAI6C,EAAMX,OAAQlC,IAAK,CAAE,GAAI02B,GAAa7zB,EAAM7C,EAAI02B,GAAW91B,WAAa81B,EAAW91B,aAAc,EAAO81B,EAAW/1B,cAAe,EAAU,SAAW+1B,KAAYA,EAAWJ,UAAW,GAAM71B,OAAOC,eAAe+1B,EAAQC,EAAWl0B,IAAKk0B,IAAiB,MAAO,UAAUV,EAAaW,EAAYC,GAAiJ,MAA9HD,IAAY1V,EAAiB+U,EAAY90B,UAAWy1B,GAAiBC,GAAa3V,EAAiB+U,EAAaY,GAAqBZ,MqMxu4BhiB1L,EAAA3qB,EAAA,ErMmv4BeG,GqM5u4BF4mE,SrM4u4BqB,SAAU3vC,GAG1C,QAAS2vC,KAGP,MAFA5wC,GAAgB3vB,KAAMugE,GAEfzwC,EAA2B9vB,MAAOugE,EAASzsD,WAAaxZ,OAAOu2B,eAAe0vC,IAAW92D,MAAMzJ,KAAMlE,YAc9G,MAnBAk0B,GAAUuwC,EAAU3vC,GAQpBP,EAAakwC,IACXlkE,IAAK,SACLjB,MAAO,WqMrv4BP,OACE,EAAA+oB,EAAA7oB,GAAA,OAAKkN,GAAG,WAAW1I,UAAU,SAASuyH,YAAWryH,KAAKtD,MAAMuD,MACzDD,KAAKtD,MAAMd,crM4v4BX2kE,GACPp8C,EAAQhgB,YAIJ,SAAUvK,EAAQD,EAASH,GAEjC,YsM7w4BO,SAASgnE,GAAgCh4D,EAAYi4D,GAE1D,MAAO6xD,GADaC,EAAqB/pH,EAAIgqH,EAAwB/xD,KAIhE,QAAS8xD,GAAsB/pH,EAAYi4D,GAChD,MAAOA,GAAazkD,KAAK,SAAAsmD,GAAA,MAAeA,GAAY95D,KAAOA,IAG7D,QAAS8pH,GAAwBhwD,GAC/B,MAAKA,GAGEA,EAAY71B,KAFV,SAKJ,QAAS+lF,GAAyBrzD,GACvC,MAAOA,GAAK/hE,KAAKohC,OAAO,SAAC6jC,EAAKl6C,GAE5B,MADAk6C,GAAIpmE,KAAKkjE,EAAKh3C,IACPk6C,OtM6v4BX/nE,OAAOC,eAAeZ,EAAS,cAC7ByB,OAAO,IAETzB,EsMnx4BgB6mE,iCtMox4BhB7mE,EsM/w4BgB44H,uBtMgx4BhB54H,EsMrw4BgB64H,2BtMiy4BV,SAAU54H,EAAQD,EAASH,GAEjC,YuMvz4BA,SAASulE,GAAUvZ,EAAMitE,EAAMC,GAC7B,GAAI7iH,SAEJ,OAAO,YACL,GAAMpP,GAAUT,KACV2sB,EAAO7wB,UAET62H,EAAQ,WACV9iH,EAAU,KACL6iH,GAAWltE,EAAK/7C,MAAMhJ,EAASksB,IAElCimG,EAAUF,IAAc7iH,CAC5B8d,cAAa9d,GACbA,EAAUpI,WAAWkrH,EAAOF,GACxBG,GAASptE,EAAK/7C,MAAMhJ,EAASksB,IvM4y4BrCryB,OAAOC,eAAeZ,EAAS,cAC7ByB,OAAO,IAoBTzB,EuM7z4BSolE","file":"livepoll-c7d620350a9b1b48aff5.js","sourcesContent":["/******/ (function(modules) { // webpackBootstrap\n/******/ \t// The module cache\n/******/ \tvar installedModules = {};\n/******/\n/******/ \t// The require function\n/******/ \tfunction __webpack_require__(moduleId) {\n/******/\n/******/ \t\t// Check if module is in cache\n/******/ \t\tif(installedModules[moduleId]) {\n/******/ \t\t\treturn installedModules[moduleId].exports;\n/******/ \t\t}\n/******/ \t\t// Create a new module (and put it into the cache)\n/******/ \t\tvar module = installedModules[moduleId] = {\n/******/ \t\t\ti: moduleId,\n/******/ \t\t\tl: false,\n/******/ \t\t\texports: {}\n/******/ \t\t};\n/******/\n/******/ \t\t// Execute the module function\n/******/ \t\tmodules[moduleId].call(module.exports, module, module.exports, __webpack_require__);\n/******/\n/******/ \t\t// Flag the module as loaded\n/******/ \t\tmodule.l = true;\n/******/\n/******/ \t\t// Return the exports of the module\n/******/ \t\treturn module.exports;\n/******/ \t}\n/******/\n/******/\n/******/ \t// expose the modules object (__webpack_modules__)\n/******/ \t__webpack_require__.m = modules;\n/******/\n/******/ \t// expose the module cache\n/******/ \t__webpack_require__.c = installedModules;\n/******/\n/******/ \t// define getter function for harmony exports\n/******/ \t__webpack_require__.d = function(exports, name, getter) {\n/******/ \t\tif(!__webpack_require__.o(exports, name)) {\n/******/ \t\t\tObject.defineProperty(exports, name, {\n/******/ \t\t\t\tconfigurable: false,\n/******/ \t\t\t\tenumerable: true,\n/******/ \t\t\t\tget: getter\n/******/ \t\t\t});\n/******/ \t\t}\n/******/ \t};\n/******/\n/******/ \t// getDefaultExport function for compatibility with non-harmony modules\n/******/ \t__webpack_require__.n = function(module) {\n/******/ \t\tvar getter = module && module.__esModule ?\n/******/ \t\t\tfunction getDefault() { return module['default']; } :\n/******/ \t\t\tfunction getModuleExports() { return module; };\n/******/ \t\t__webpack_require__.d(getter, 'a', getter);\n/******/ \t\treturn getter;\n/******/ \t};\n/******/\n/******/ \t// Object.prototype.hasOwnProperty.call\n/******/ \t__webpack_require__.o = function(object, property) { return Object.prototype.hasOwnProperty.call(object, property); };\n/******/\n/******/ \t// __webpack_public_path__\n/******/ \t__webpack_require__.p = \"https://static.nrk.no/dh/dh-stemning-widgets/static/\";\n/******/\n/******/ \t// Load entry module and return exports\n/******/ \treturn __webpack_require__(__webpack_require__.s = 108);\n/******/ })\n/************************************************************************/\n/******/ ([\n/* 0 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nfunction __export(m) {\n  for (var p in m) {\n    if (!exports.hasOwnProperty(p)) exports[p] = m[p];\n  }\n}\nObject.defineProperty(exports, \"__esModule\", { value: true });\n__export(__webpack_require__(79));\n__export(__webpack_require__(80));\n__export(__webpack_require__(68));\n__export(__webpack_require__(145));\n__export(__webpack_require__(146));\n__export(__webpack_require__(147));\n__export(__webpack_require__(148));\n__export(__webpack_require__(81));\n__export(__webpack_require__(149));\n__export(__webpack_require__(82));\n__export(__webpack_require__(150));\n__export(__webpack_require__(151));\n__export(__webpack_require__(153));\n__export(__webpack_require__(154));\n__export(__webpack_require__(155));\n\n//# sourceMappingURL=index.js.map\n\n/***/ }),\n/* 1 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nObject.defineProperty(exports, \"__esModule\", {\n\tvalue: true\n});\n\nvar _typeof = typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; };\n\n/** Virtual DOM Node */\nfunction VNode() {}\n\n/** Global options\n *\t@public\n *\t@namespace options {Object}\n */\nvar options = {\n\n\t/** If `true`, `prop` changes trigger synchronous component updates.\n  *\t@name syncComponentUpdates\n  *\t@type Boolean\n  *\t@default true\n  */\n\t//syncComponentUpdates: true,\n\n\t/** Processes all created VNodes.\n  *\t@param {VNode} vnode\tA newly-created VNode to normalize/process\n  */\n\t//vnode(vnode) { }\n\n\t/** Hook invoked after a component is mounted. */\n\t// afterMount(component) { }\n\n\t/** Hook invoked after the DOM is updated with a component's latest render. */\n\t// afterUpdate(component) { }\n\n\t/** Hook invoked immediately before a component is unmounted. */\n\t// beforeUnmount(component) { }\n};\n\nvar stack = [];\n\nvar EMPTY_CHILDREN = [];\n\n/** JSX/hyperscript reviver\n*\tBenchmarks: https://esbench.com/bench/57ee8f8e330ab09900a1a1a0\n *\t@see http://jasonformat.com/wtf-is-jsx\n *\t@public\n */\nfunction h(nodeName, attributes) {\n\tvar children = EMPTY_CHILDREN,\n\t    lastSimple,\n\t    child,\n\t    simple,\n\t    i;\n\tfor (i = arguments.length; i-- > 2;) {\n\t\tstack.push(arguments[i]);\n\t}\n\tif (attributes && attributes.children != null) {\n\t\tif (!stack.length) stack.push(attributes.children);\n\t\tdelete attributes.children;\n\t}\n\twhile (stack.length) {\n\t\tif ((child = stack.pop()) && child.pop !== undefined) {\n\t\t\tfor (i = child.length; i--;) {\n\t\t\t\tstack.push(child[i]);\n\t\t\t}\n\t\t} else {\n\t\t\tif (typeof child === 'boolean') child = null;\n\n\t\t\tif (simple = typeof nodeName !== 'function') {\n\t\t\t\tif (child == null) child = '';else if (typeof child === 'number') child = String(child);else if (typeof child !== 'string') simple = false;\n\t\t\t}\n\n\t\t\tif (simple && lastSimple) {\n\t\t\t\tchildren[children.length - 1] += child;\n\t\t\t} else if (children === EMPTY_CHILDREN) {\n\t\t\t\tchildren = [child];\n\t\t\t} else {\n\t\t\t\tchildren.push(child);\n\t\t\t}\n\n\t\t\tlastSimple = simple;\n\t\t}\n\t}\n\n\tvar p = new VNode();\n\tp.nodeName = nodeName;\n\tp.children = children;\n\tp.attributes = attributes == null ? undefined : attributes;\n\tp.key = attributes == null ? undefined : attributes.key;\n\n\t// if a \"vnode hook\" is defined, pass every created VNode to it\n\tif (options.vnode !== undefined) options.vnode(p);\n\n\treturn p;\n}\n\n/** Copy own-properties from `props` onto `obj`.\n *\t@returns obj\n *\t@private\n */\nfunction extend(obj, props) {\n\tfor (var i in props) {\n\t\tobj[i] = props[i];\n\t}return obj;\n}\n\n/** Call a function asynchronously, as soon as possible.\n *\t@param {Function} callback\n */\nvar defer = typeof Promise == 'function' ? Promise.resolve().then.bind(Promise.resolve()) : setTimeout;\n\nfunction cloneElement(vnode, props) {\n\treturn h(vnode.nodeName, extend(extend({}, vnode.attributes), props), arguments.length > 2 ? [].slice.call(arguments, 2) : vnode.children);\n}\n\n// DOM properties that should NOT have \"px\" added when numeric\nvar IS_NON_DIMENSIONAL = /acit|ex(?:s|g|n|p|$)|rph|ows|mnc|ntw|ine[ch]|zoo|^ord/i;\n\n/** Managed queue of dirty components to be re-rendered */\n\nvar items = [];\n\nfunction enqueueRender(component) {\n\tif (!component._dirty && (component._dirty = true) && items.push(component) == 1) {\n\t\t(options.debounceRendering || defer)(rerender);\n\t}\n}\n\nfunction rerender() {\n\tvar p,\n\t    list = items;\n\titems = [];\n\twhile (p = list.pop()) {\n\t\tif (p._dirty) renderComponent(p);\n\t}\n}\n\n/** Check if two nodes are equivalent.\n *\t@param {Element} node\n *\t@param {VNode} vnode\n *\t@private\n */\nfunction isSameNodeType(node, vnode, hydrating) {\n\tif (typeof vnode === 'string' || typeof vnode === 'number') {\n\t\treturn node.splitText !== undefined;\n\t}\n\tif (typeof vnode.nodeName === 'string') {\n\t\treturn !node._componentConstructor && isNamedNode(node, vnode.nodeName);\n\t}\n\treturn hydrating || node._componentConstructor === vnode.nodeName;\n}\n\n/** Check if an Element has a given normalized name.\n*\t@param {Element} node\n*\t@param {String} nodeName\n */\nfunction isNamedNode(node, nodeName) {\n\treturn node.normalizedNodeName === nodeName || node.nodeName.toLowerCase() === nodeName.toLowerCase();\n}\n\n/**\n * Reconstruct Component-style `props` from a VNode.\n * Ensures default/fallback values from `defaultProps`:\n * Own-properties of `defaultProps` not present in `vnode.attributes` are added.\n * @param {VNode} vnode\n * @returns {Object} props\n */\nfunction getNodeProps(vnode) {\n\tvar props = extend({}, vnode.attributes);\n\tprops.children = vnode.children;\n\n\tvar defaultProps = vnode.nodeName.defaultProps;\n\tif (defaultProps !== undefined) {\n\t\tfor (var i in defaultProps) {\n\t\t\tif (props[i] === undefined) {\n\t\t\t\tprops[i] = defaultProps[i];\n\t\t\t}\n\t\t}\n\t}\n\n\treturn props;\n}\n\n/** Create an element with the given nodeName.\n *\t@param {String} nodeName\n *\t@param {Boolean} [isSvg=false]\tIf `true`, creates an element within the SVG namespace.\n *\t@returns {Element} node\n */\nfunction createNode(nodeName, isSvg) {\n\tvar node = isSvg ? document.createElementNS('http://www.w3.org/2000/svg', nodeName) : document.createElement(nodeName);\n\tnode.normalizedNodeName = nodeName;\n\treturn node;\n}\n\n/** Remove a child node from its parent if attached.\n *\t@param {Element} node\t\tThe node to remove\n */\nfunction removeNode(node) {\n\tvar parentNode = node.parentNode;\n\tif (parentNode) parentNode.removeChild(node);\n}\n\n/** Set a named attribute on the given Node, with special behavior for some names and event handlers.\n *\tIf `value` is `null`, the attribute/handler will be removed.\n *\t@param {Element} node\tAn element to mutate\n *\t@param {string} name\tThe name/key to set, such as an event or attribute name\n *\t@param {any} old\tThe last value that was set for this name/node pair\n *\t@param {any} value\tAn attribute value, such as a function to be used as an event handler\n *\t@param {Boolean} isSvg\tAre we currently diffing inside an svg?\n *\t@private\n */\nfunction setAccessor(node, name, old, value, isSvg) {\n\tif (name === 'className') name = 'class';\n\n\tif (name === 'key') {\n\t\t// ignore\n\t} else if (name === 'ref') {\n\t\tif (old) old(null);\n\t\tif (value) value(node);\n\t} else if (name === 'class' && !isSvg) {\n\t\tnode.className = value || '';\n\t} else if (name === 'style') {\n\t\tif (!value || typeof value === 'string' || typeof old === 'string') {\n\t\t\tnode.style.cssText = value || '';\n\t\t}\n\t\tif (value && (typeof value === 'undefined' ? 'undefined' : _typeof(value)) === 'object') {\n\t\t\tif (typeof old !== 'string') {\n\t\t\t\tfor (var i in old) {\n\t\t\t\t\tif (!(i in value)) node.style[i] = '';\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (var i in value) {\n\t\t\t\tnode.style[i] = typeof value[i] === 'number' && IS_NON_DIMENSIONAL.test(i) === false ? value[i] + 'px' : value[i];\n\t\t\t}\n\t\t}\n\t} else if (name === 'dangerouslySetInnerHTML') {\n\t\tif (value) node.innerHTML = value.__html || '';\n\t} else if (name[0] == 'o' && name[1] == 'n') {\n\t\tvar useCapture = name !== (name = name.replace(/Capture$/, ''));\n\t\tname = name.toLowerCase().substring(2);\n\t\tif (value) {\n\t\t\tif (!old) node.addEventListener(name, eventProxy, useCapture);\n\t\t} else {\n\t\t\tnode.removeEventListener(name, eventProxy, useCapture);\n\t\t}\n\t\t(node._listeners || (node._listeners = {}))[name] = value;\n\t} else if (name !== 'list' && name !== 'type' && !isSvg && name in node) {\n\t\tsetProperty(node, name, value == null ? '' : value);\n\t\tif (value == null || value === false) node.removeAttribute(name);\n\t} else {\n\t\tvar ns = isSvg && name !== (name = name.replace(/^xlink\\:?/, ''));\n\t\tif (value == null || value === false) {\n\t\t\tif (ns) node.removeAttributeNS('http://www.w3.org/1999/xlink', name.toLowerCase());else node.removeAttribute(name);\n\t\t} else if (typeof value !== 'function') {\n\t\t\tif (ns) node.setAttributeNS('http://www.w3.org/1999/xlink', name.toLowerCase(), value);else node.setAttribute(name, value);\n\t\t}\n\t}\n}\n\n/** Attempt to set a DOM property to the given value.\n *\tIE & FF throw for certain property-value combinations.\n */\nfunction setProperty(node, name, value) {\n\ttry {\n\t\tnode[name] = value;\n\t} catch (e) {}\n}\n\n/** Proxy an event to hooked event handlers\n *\t@private\n */\nfunction eventProxy(e) {\n\treturn this._listeners[e.type](options.event && options.event(e) || e);\n}\n\n/** Queue of components that have been mounted and are awaiting componentDidMount */\nvar mounts = [];\n\n/** Diff recursion count, used to track the end of the diff cycle. */\nvar diffLevel = 0;\n\n/** Global flag indicating if the diff is currently within an SVG */\nvar isSvgMode = false;\n\n/** Global flag indicating if the diff is performing hydration */\nvar hydrating = false;\n\n/** Invoke queued componentDidMount lifecycle methods */\nfunction flushMounts() {\n\tvar c;\n\twhile (c = mounts.pop()) {\n\t\tif (options.afterMount) options.afterMount(c);\n\t\tif (c.componentDidMount) c.componentDidMount();\n\t}\n}\n\n/** Apply differences in a given vnode (and it's deep children) to a real DOM Node.\n *\t@param {Element} [dom=null]\t\tA DOM node to mutate into the shape of the `vnode`\n *\t@param {VNode} vnode\t\t\tA VNode (with descendants forming a tree) representing the desired DOM structure\n *\t@returns {Element} dom\t\t\tThe created/mutated element\n *\t@private\n */\nfunction diff(dom, vnode, context, mountAll, parent, componentRoot) {\n\t// diffLevel having been 0 here indicates initial entry into the diff (not a subdiff)\n\tif (!diffLevel++) {\n\t\t// when first starting the diff, check if we're diffing an SVG or within an SVG\n\t\tisSvgMode = parent != null && parent.ownerSVGElement !== undefined;\n\n\t\t// hydration is indicated by the existing element to be diffed not having a prop cache\n\t\thydrating = dom != null && !('__preactattr_' in dom);\n\t}\n\n\tvar ret = idiff(dom, vnode, context, mountAll, componentRoot);\n\n\t// append the element if its a new parent\n\tif (parent && ret.parentNode !== parent) parent.appendChild(ret);\n\n\t// diffLevel being reduced to 0 means we're exiting the diff\n\tif (! --diffLevel) {\n\t\thydrating = false;\n\t\t// invoke queued componentDidMount lifecycle methods\n\t\tif (!componentRoot) flushMounts();\n\t}\n\n\treturn ret;\n}\n\n/** Internals of `diff()`, separated to allow bypassing diffLevel / mount flushing. */\nfunction idiff(dom, vnode, context, mountAll, componentRoot) {\n\tvar out = dom,\n\t    prevSvgMode = isSvgMode;\n\n\t// empty values (null, undefined, booleans) render as empty Text nodes\n\tif (vnode == null || typeof vnode === 'boolean') vnode = '';\n\n\t// Fast case: Strings & Numbers create/update Text nodes.\n\tif (typeof vnode === 'string' || typeof vnode === 'number') {\n\n\t\t// update if it's already a Text node:\n\t\tif (dom && dom.splitText !== undefined && dom.parentNode && (!dom._component || componentRoot)) {\n\t\t\t/* istanbul ignore if */ /* Browser quirk that can't be covered: https://github.com/developit/preact/commit/fd4f21f5c45dfd75151bd27b4c217d8003aa5eb9 */\n\t\t\tif (dom.nodeValue != vnode) {\n\t\t\t\tdom.nodeValue = vnode;\n\t\t\t}\n\t\t} else {\n\t\t\t// it wasn't a Text node: replace it with one and recycle the old Element\n\t\t\tout = document.createTextNode(vnode);\n\t\t\tif (dom) {\n\t\t\t\tif (dom.parentNode) dom.parentNode.replaceChild(out, dom);\n\t\t\t\trecollectNodeTree(dom, true);\n\t\t\t}\n\t\t}\n\n\t\tout['__preactattr_'] = true;\n\n\t\treturn out;\n\t}\n\n\t// If the VNode represents a Component, perform a component diff:\n\tvar vnodeName = vnode.nodeName;\n\tif (typeof vnodeName === 'function') {\n\t\treturn buildComponentFromVNode(dom, vnode, context, mountAll);\n\t}\n\n\t// Tracks entering and exiting SVG namespace when descending through the tree.\n\tisSvgMode = vnodeName === 'svg' ? true : vnodeName === 'foreignObject' ? false : isSvgMode;\n\n\t// If there's no existing element or it's the wrong type, create a new one:\n\tvnodeName = String(vnodeName);\n\tif (!dom || !isNamedNode(dom, vnodeName)) {\n\t\tout = createNode(vnodeName, isSvgMode);\n\n\t\tif (dom) {\n\t\t\t// move children into the replacement node\n\t\t\twhile (dom.firstChild) {\n\t\t\t\tout.appendChild(dom.firstChild);\n\t\t\t} // if the previous Element was mounted into the DOM, replace it inline\n\t\t\tif (dom.parentNode) dom.parentNode.replaceChild(out, dom);\n\n\t\t\t// recycle the old element (skips non-Element node types)\n\t\t\trecollectNodeTree(dom, true);\n\t\t}\n\t}\n\n\tvar fc = out.firstChild,\n\t    props = out['__preactattr_'],\n\t    vchildren = vnode.children;\n\n\tif (props == null) {\n\t\tprops = out['__preactattr_'] = {};\n\t\tfor (var a = out.attributes, i = a.length; i--;) {\n\t\t\tprops[a[i].name] = a[i].value;\n\t\t}\n\t}\n\n\t// Optimization: fast-path for elements containing a single TextNode:\n\tif (!hydrating && vchildren && vchildren.length === 1 && typeof vchildren[0] === 'string' && fc != null && fc.splitText !== undefined && fc.nextSibling == null) {\n\t\tif (fc.nodeValue != vchildren[0]) {\n\t\t\tfc.nodeValue = vchildren[0];\n\t\t}\n\t}\n\t// otherwise, if there are existing or new children, diff them:\n\telse if (vchildren && vchildren.length || fc != null) {\n\t\t\tinnerDiffNode(out, vchildren, context, mountAll, hydrating || props.dangerouslySetInnerHTML != null);\n\t\t}\n\n\t// Apply attributes/props from VNode to the DOM Element:\n\tdiffAttributes(out, vnode.attributes, props);\n\n\t// restore previous SVG mode: (in case we're exiting an SVG namespace)\n\tisSvgMode = prevSvgMode;\n\n\treturn out;\n}\n\n/** Apply child and attribute changes between a VNode and a DOM Node to the DOM.\n *\t@param {Element} dom\t\t\tElement whose children should be compared & mutated\n *\t@param {Array} vchildren\t\tArray of VNodes to compare to `dom.childNodes`\n *\t@param {Object} context\t\t\tImplicitly descendant context object (from most recent `getChildContext()`)\n *\t@param {Boolean} mountAll\n *\t@param {Boolean} isHydrating\tIf `true`, consumes externally created elements similar to hydration\n */\nfunction innerDiffNode(dom, vchildren, context, mountAll, isHydrating) {\n\tvar originalChildren = dom.childNodes,\n\t    children = [],\n\t    keyed = {},\n\t    keyedLen = 0,\n\t    min = 0,\n\t    len = originalChildren.length,\n\t    childrenLen = 0,\n\t    vlen = vchildren ? vchildren.length : 0,\n\t    j,\n\t    c,\n\t    f,\n\t    vchild,\n\t    child;\n\n\t// Build up a map of keyed children and an Array of unkeyed children:\n\tif (len !== 0) {\n\t\tfor (var i = 0; i < len; i++) {\n\t\t\tvar _child = originalChildren[i],\n\t\t\t    props = _child['__preactattr_'],\n\t\t\t    key = vlen && props ? _child._component ? _child._component.__key : props.key : null;\n\t\t\tif (key != null) {\n\t\t\t\tkeyedLen++;\n\t\t\t\tkeyed[key] = _child;\n\t\t\t} else if (props || (_child.splitText !== undefined ? isHydrating ? _child.nodeValue.trim() : true : isHydrating)) {\n\t\t\t\tchildren[childrenLen++] = _child;\n\t\t\t}\n\t\t}\n\t}\n\n\tif (vlen !== 0) {\n\t\tfor (var i = 0; i < vlen; i++) {\n\t\t\tvchild = vchildren[i];\n\t\t\tchild = null;\n\n\t\t\t// attempt to find a node based on key matching\n\t\t\tvar key = vchild.key;\n\t\t\tif (key != null) {\n\t\t\t\tif (keyedLen && keyed[key] !== undefined) {\n\t\t\t\t\tchild = keyed[key];\n\t\t\t\t\tkeyed[key] = undefined;\n\t\t\t\t\tkeyedLen--;\n\t\t\t\t}\n\t\t\t}\n\t\t\t// attempt to pluck a node of the same type from the existing children\n\t\t\telse if (!child && min < childrenLen) {\n\t\t\t\t\tfor (j = min; j < childrenLen; j++) {\n\t\t\t\t\t\tif (children[j] !== undefined && isSameNodeType(c = children[j], vchild, isHydrating)) {\n\t\t\t\t\t\t\tchild = c;\n\t\t\t\t\t\t\tchildren[j] = undefined;\n\t\t\t\t\t\t\tif (j === childrenLen - 1) childrenLen--;\n\t\t\t\t\t\t\tif (j === min) min++;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t// morph the matched/found/created DOM child to match vchild (deep)\n\t\t\tchild = idiff(child, vchild, context, mountAll);\n\n\t\t\tf = originalChildren[i];\n\t\t\tif (child && child !== dom && child !== f) {\n\t\t\t\tif (f == null) {\n\t\t\t\t\tdom.appendChild(child);\n\t\t\t\t} else if (child === f.nextSibling) {\n\t\t\t\t\tremoveNode(f);\n\t\t\t\t} else {\n\t\t\t\t\tdom.insertBefore(child, f);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t// remove unused keyed children:\n\tif (keyedLen) {\n\t\tfor (var i in keyed) {\n\t\t\tif (keyed[i] !== undefined) recollectNodeTree(keyed[i], false);\n\t\t}\n\t}\n\n\t// remove orphaned unkeyed children:\n\twhile (min <= childrenLen) {\n\t\tif ((child = children[childrenLen--]) !== undefined) recollectNodeTree(child, false);\n\t}\n}\n\n/** Recursively recycle (or just unmount) a node and its descendants.\n *\t@param {Node} node\t\t\t\t\t\tDOM node to start unmount/removal from\n *\t@param {Boolean} [unmountOnly=false]\tIf `true`, only triggers unmount lifecycle, skips removal\n */\nfunction recollectNodeTree(node, unmountOnly) {\n\tvar component = node._component;\n\tif (component) {\n\t\t// if node is owned by a Component, unmount that component (ends up recursing back here)\n\t\tunmountComponent(component);\n\t} else {\n\t\t// If the node's VNode had a ref function, invoke it with null here.\n\t\t// (this is part of the React spec, and smart for unsetting references)\n\t\tif (node['__preactattr_'] != null && node['__preactattr_'].ref) node['__preactattr_'].ref(null);\n\n\t\tif (unmountOnly === false || node['__preactattr_'] == null) {\n\t\t\tremoveNode(node);\n\t\t}\n\n\t\tremoveChildren(node);\n\t}\n}\n\n/** Recollect/unmount all children.\n *\t- we use .lastChild here because it causes less reflow than .firstChild\n *\t- it's also cheaper than accessing the .childNodes Live NodeList\n */\nfunction removeChildren(node) {\n\tnode = node.lastChild;\n\twhile (node) {\n\t\tvar next = node.previousSibling;\n\t\trecollectNodeTree(node, true);\n\t\tnode = next;\n\t}\n}\n\n/** Apply differences in attributes from a VNode to the given DOM Element.\n *\t@param {Element} dom\t\tElement with attributes to diff `attrs` against\n *\t@param {Object} attrs\t\tThe desired end-state key-value attribute pairs\n *\t@param {Object} old\t\t\tCurrent/previous attributes (from previous VNode or element's prop cache)\n */\nfunction diffAttributes(dom, attrs, old) {\n\tvar name;\n\n\t// remove attributes no longer present on the vnode by setting them to undefined\n\tfor (name in old) {\n\t\tif (!(attrs && attrs[name] != null) && old[name] != null) {\n\t\t\tsetAccessor(dom, name, old[name], old[name] = undefined, isSvgMode);\n\t\t}\n\t}\n\n\t// add new & update changed attributes\n\tfor (name in attrs) {\n\t\tif (name !== 'children' && name !== 'innerHTML' && (!(name in old) || attrs[name] !== (name === 'value' || name === 'checked' ? dom[name] : old[name]))) {\n\t\t\tsetAccessor(dom, name, old[name], old[name] = attrs[name], isSvgMode);\n\t\t}\n\t}\n}\n\n/** Retains a pool of Components for re-use, keyed on component name.\n *\tNote: since component names are not unique or even necessarily available, these are primarily a form of sharding.\n *\t@private\n */\nvar components = {};\n\n/** Reclaim a component for later re-use by the recycler. */\nfunction collectComponent(component) {\n\tvar name = component.constructor.name;\n\t(components[name] || (components[name] = [])).push(component);\n}\n\n/** Create a component. Normalizes differences between PFC's and classful Components. */\nfunction createComponent(Ctor, props, context) {\n\tvar list = components[Ctor.name],\n\t    inst;\n\n\tif (Ctor.prototype && Ctor.prototype.render) {\n\t\tinst = new Ctor(props, context);\n\t\tComponent.call(inst, props, context);\n\t} else {\n\t\tinst = new Component(props, context);\n\t\tinst.constructor = Ctor;\n\t\tinst.render = doRender;\n\t}\n\n\tif (list) {\n\t\tfor (var i = list.length; i--;) {\n\t\t\tif (list[i].constructor === Ctor) {\n\t\t\t\tinst.nextBase = list[i].nextBase;\n\t\t\t\tlist.splice(i, 1);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\treturn inst;\n}\n\n/** The `.render()` method for a PFC backing instance. */\nfunction doRender(props, state, context) {\n\treturn this.constructor(props, context);\n}\n\n/** Set a component's `props` (generally derived from JSX attributes).\n *\t@param {Object} props\n *\t@param {Object} [opts]\n *\t@param {boolean} [opts.renderSync=false]\tIf `true` and {@link options.syncComponentUpdates} is `true`, triggers synchronous rendering.\n *\t@param {boolean} [opts.render=true]\t\t\tIf `false`, no render will be triggered.\n */\nfunction setComponentProps(component, props, opts, context, mountAll) {\n\tif (component._disable) return;\n\tcomponent._disable = true;\n\n\tif (component.__ref = props.ref) delete props.ref;\n\tif (component.__key = props.key) delete props.key;\n\n\tif (!component.base || mountAll) {\n\t\tif (component.componentWillMount) component.componentWillMount();\n\t} else if (component.componentWillReceiveProps) {\n\t\tcomponent.componentWillReceiveProps(props, context);\n\t}\n\n\tif (context && context !== component.context) {\n\t\tif (!component.prevContext) component.prevContext = component.context;\n\t\tcomponent.context = context;\n\t}\n\n\tif (!component.prevProps) component.prevProps = component.props;\n\tcomponent.props = props;\n\n\tcomponent._disable = false;\n\n\tif (opts !== 0) {\n\t\tif (opts === 1 || options.syncComponentUpdates !== false || !component.base) {\n\t\t\trenderComponent(component, 1, mountAll);\n\t\t} else {\n\t\t\tenqueueRender(component);\n\t\t}\n\t}\n\n\tif (component.__ref) component.__ref(component);\n}\n\n/** Render a Component, triggering necessary lifecycle events and taking High-Order Components into account.\n *\t@param {Component} component\n *\t@param {Object} [opts]\n *\t@param {boolean} [opts.build=false]\t\tIf `true`, component will build and store a DOM node if not already associated with one.\n *\t@private\n */\nfunction renderComponent(component, opts, mountAll, isChild) {\n\tif (component._disable) return;\n\n\tvar props = component.props,\n\t    state = component.state,\n\t    context = component.context,\n\t    previousProps = component.prevProps || props,\n\t    previousState = component.prevState || state,\n\t    previousContext = component.prevContext || context,\n\t    isUpdate = component.base,\n\t    nextBase = component.nextBase,\n\t    initialBase = isUpdate || nextBase,\n\t    initialChildComponent = component._component,\n\t    skip = false,\n\t    rendered,\n\t    inst,\n\t    cbase;\n\n\t// if updating\n\tif (isUpdate) {\n\t\tcomponent.props = previousProps;\n\t\tcomponent.state = previousState;\n\t\tcomponent.context = previousContext;\n\t\tif (opts !== 2 && component.shouldComponentUpdate && component.shouldComponentUpdate(props, state, context) === false) {\n\t\t\tskip = true;\n\t\t} else if (component.componentWillUpdate) {\n\t\t\tcomponent.componentWillUpdate(props, state, context);\n\t\t}\n\t\tcomponent.props = props;\n\t\tcomponent.state = state;\n\t\tcomponent.context = context;\n\t}\n\n\tcomponent.prevProps = component.prevState = component.prevContext = component.nextBase = null;\n\tcomponent._dirty = false;\n\n\tif (!skip) {\n\t\trendered = component.render(props, state, context);\n\n\t\t// context to pass to the child, can be updated via (grand-)parent component\n\t\tif (component.getChildContext) {\n\t\t\tcontext = extend(extend({}, context), component.getChildContext());\n\t\t}\n\n\t\tvar childComponent = rendered && rendered.nodeName,\n\t\t    toUnmount,\n\t\t    base;\n\n\t\tif (typeof childComponent === 'function') {\n\t\t\t// set up high order component link\n\n\t\t\tvar childProps = getNodeProps(rendered);\n\t\t\tinst = initialChildComponent;\n\n\t\t\tif (inst && inst.constructor === childComponent && childProps.key == inst.__key) {\n\t\t\t\tsetComponentProps(inst, childProps, 1, context, false);\n\t\t\t} else {\n\t\t\t\ttoUnmount = inst;\n\n\t\t\t\tcomponent._component = inst = createComponent(childComponent, childProps, context);\n\t\t\t\tinst.nextBase = inst.nextBase || nextBase;\n\t\t\t\tinst._parentComponent = component;\n\t\t\t\tsetComponentProps(inst, childProps, 0, context, false);\n\t\t\t\trenderComponent(inst, 1, mountAll, true);\n\t\t\t}\n\n\t\t\tbase = inst.base;\n\t\t} else {\n\t\t\tcbase = initialBase;\n\n\t\t\t// destroy high order component link\n\t\t\ttoUnmount = initialChildComponent;\n\t\t\tif (toUnmount) {\n\t\t\t\tcbase = component._component = null;\n\t\t\t}\n\n\t\t\tif (initialBase || opts === 1) {\n\t\t\t\tif (cbase) cbase._component = null;\n\t\t\t\tbase = diff(cbase, rendered, context, mountAll || !isUpdate, initialBase && initialBase.parentNode, true);\n\t\t\t}\n\t\t}\n\n\t\tif (initialBase && base !== initialBase && inst !== initialChildComponent) {\n\t\t\tvar baseParent = initialBase.parentNode;\n\t\t\tif (baseParent && base !== baseParent) {\n\t\t\t\tbaseParent.replaceChild(base, initialBase);\n\n\t\t\t\tif (!toUnmount) {\n\t\t\t\t\tinitialBase._component = null;\n\t\t\t\t\trecollectNodeTree(initialBase, false);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif (toUnmount) {\n\t\t\tunmountComponent(toUnmount);\n\t\t}\n\n\t\tcomponent.base = base;\n\t\tif (base && !isChild) {\n\t\t\tvar componentRef = component,\n\t\t\t    t = component;\n\t\t\twhile (t = t._parentComponent) {\n\t\t\t\t(componentRef = t).base = base;\n\t\t\t}\n\t\t\tbase._component = componentRef;\n\t\t\tbase._componentConstructor = componentRef.constructor;\n\t\t}\n\t}\n\n\tif (!isUpdate || mountAll) {\n\t\tmounts.unshift(component);\n\t} else if (!skip) {\n\t\t// Ensure that pending componentDidMount() hooks of child components\n\t\t// are called before the componentDidUpdate() hook in the parent.\n\t\t// Note: disabled as it causes duplicate hooks, see https://github.com/developit/preact/issues/750\n\t\t// flushMounts();\n\n\t\tif (component.componentDidUpdate) {\n\t\t\tcomponent.componentDidUpdate(previousProps, previousState, previousContext);\n\t\t}\n\t\tif (options.afterUpdate) options.afterUpdate(component);\n\t}\n\n\tif (component._renderCallbacks != null) {\n\t\twhile (component._renderCallbacks.length) {\n\t\t\tcomponent._renderCallbacks.pop().call(component);\n\t\t}\n\t}\n\n\tif (!diffLevel && !isChild) flushMounts();\n}\n\n/** Apply the Component referenced by a VNode to the DOM.\n *\t@param {Element} dom\tThe DOM node to mutate\n *\t@param {VNode} vnode\tA Component-referencing VNode\n *\t@returns {Element} dom\tThe created/mutated element\n *\t@private\n */\nfunction buildComponentFromVNode(dom, vnode, context, mountAll) {\n\tvar c = dom && dom._component,\n\t    originalComponent = c,\n\t    oldDom = dom,\n\t    isDirectOwner = c && dom._componentConstructor === vnode.nodeName,\n\t    isOwner = isDirectOwner,\n\t    props = getNodeProps(vnode);\n\twhile (c && !isOwner && (c = c._parentComponent)) {\n\t\tisOwner = c.constructor === vnode.nodeName;\n\t}\n\n\tif (c && isOwner && (!mountAll || c._component)) {\n\t\tsetComponentProps(c, props, 3, context, mountAll);\n\t\tdom = c.base;\n\t} else {\n\t\tif (originalComponent && !isDirectOwner) {\n\t\t\tunmountComponent(originalComponent);\n\t\t\tdom = oldDom = null;\n\t\t}\n\n\t\tc = createComponent(vnode.nodeName, props, context);\n\t\tif (dom && !c.nextBase) {\n\t\t\tc.nextBase = dom;\n\t\t\t// passing dom/oldDom as nextBase will recycle it if unused, so bypass recycling on L229:\n\t\t\toldDom = null;\n\t\t}\n\t\tsetComponentProps(c, props, 1, context, mountAll);\n\t\tdom = c.base;\n\n\t\tif (oldDom && dom !== oldDom) {\n\t\t\toldDom._component = null;\n\t\t\trecollectNodeTree(oldDom, false);\n\t\t}\n\t}\n\n\treturn dom;\n}\n\n/** Remove a component from the DOM and recycle it.\n *\t@param {Component} component\tThe Component instance to unmount\n *\t@private\n */\nfunction unmountComponent(component) {\n\tif (options.beforeUnmount) options.beforeUnmount(component);\n\n\tvar base = component.base;\n\n\tcomponent._disable = true;\n\n\tif (component.componentWillUnmount) component.componentWillUnmount();\n\n\tcomponent.base = null;\n\n\t// recursively tear down & recollect high-order component children:\n\tvar inner = component._component;\n\tif (inner) {\n\t\tunmountComponent(inner);\n\t} else if (base) {\n\t\tif (base['__preactattr_'] && base['__preactattr_'].ref) base['__preactattr_'].ref(null);\n\n\t\tcomponent.nextBase = base;\n\n\t\tremoveNode(base);\n\t\tcollectComponent(component);\n\n\t\tremoveChildren(base);\n\t}\n\n\tif (component.__ref) component.__ref(null);\n}\n\n/** Base Component class.\n *\tProvides `setState()` and `forceUpdate()`, which trigger rendering.\n *\t@public\n *\n *\t@example\n *\tclass MyFoo extends Component {\n *\t\trender(props, state) {\n *\t\t\treturn <div />;\n *\t\t}\n *\t}\n */\nfunction Component(props, context) {\n\tthis._dirty = true;\n\n\t/** @public\n  *\t@type {object}\n  */\n\tthis.context = context;\n\n\t/** @public\n  *\t@type {object}\n  */\n\tthis.props = props;\n\n\t/** @public\n  *\t@type {object}\n  */\n\tthis.state = this.state || {};\n}\n\nextend(Component.prototype, {\n\n\t/** Returns a `boolean` indicating if the component should re-render when receiving the given `props` and `state`.\n  *\t@param {object} nextProps\n  *\t@param {object} nextState\n  *\t@param {object} nextContext\n  *\t@returns {Boolean} should the component re-render\n  *\t@name shouldComponentUpdate\n  *\t@function\n  */\n\n\t/** Update component state by copying properties from `state` to `this.state`.\n  *\t@param {object} state\t\tA hash of state properties to update with new values\n  *\t@param {function} callback\tA function to be called once component state is updated\n  */\n\tsetState: function setState(state, callback) {\n\t\tvar s = this.state;\n\t\tif (!this.prevState) this.prevState = extend({}, s);\n\t\textend(s, typeof state === 'function' ? state(s, this.props) : state);\n\t\tif (callback) (this._renderCallbacks = this._renderCallbacks || []).push(callback);\n\t\tenqueueRender(this);\n\t},\n\n\t/** Immediately perform a synchronous re-render of the component.\n  *\t@param {function} callback\t\tA function to be called after component is re-rendered.\n  *\t@private\n  */\n\tforceUpdate: function forceUpdate(callback) {\n\t\tif (callback) (this._renderCallbacks = this._renderCallbacks || []).push(callback);\n\t\trenderComponent(this, 2);\n\t},\n\n\t/** Accepts `props` and `state`, and returns a new Virtual DOM tree to build.\n  *\tVirtual DOM is generally constructed via [JSX](http://jasonformat.com/wtf-is-jsx).\n  *\t@param {object} props\t\tProps (eg: JSX attributes) received from parent element/component\n  *\t@param {object} state\t\tThe component's current state\n  *\t@param {object} context\t\tContext object (if a parent component has provided context)\n  *\t@returns VNode\n  */\n\trender: function render() {}\n});\n\n/** Render JSX into a `parent` Element.\n *\t@param {VNode} vnode\t\tA (JSX) VNode to render\n *\t@param {Element} parent\t\tDOM element to render into\n *\t@param {Element} [merge]\tAttempt to re-use an existing DOM tree rooted at `merge`\n *\t@public\n *\n *\t@example\n *\t// render a div into <body>:\n *\trender(<div id=\"hello\">hello!</div>, document.body);\n *\n *\t@example\n *\t// render a \"Thing\" component into #foo:\n *\tconst Thing = ({ name }) => <span>{ name }</span>;\n *\trender(<Thing name=\"one\" />, document.querySelector('#foo'));\n */\nfunction render(vnode, parent, merge) {\n\treturn diff(merge, vnode, {}, false, parent, false);\n}\n\nvar preact = {\n\th: h,\n\tcreateElement: h,\n\tcloneElement: cloneElement,\n\tComponent: Component,\n\trender: render,\n\trerender: rerender,\n\toptions: options\n};\n\nexports.h = h;\nexports.createElement = h;\nexports.cloneElement = cloneElement;\nexports.Component = Component;\nexports.render = render;\nexports.rerender = rerender;\nexports.options = options;\nexports.default = preact;\n//# sourceMappingURL=preact.esm.js.map\n\n/***/ }),\n/* 2 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nvar _typeof = typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; };\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = __webpack_require__(0);\nvar util_2 = __webpack_require__(0);\nvar util_3 = __webpack_require__(0);\nvar util_4 = __webpack_require__(0);\nvar util_5 = __webpack_require__(0);\nvar util_6 = __webpack_require__(0);\nvar storage_1 = __webpack_require__(34);\nvar util_7 = __webpack_require__(0);\n/**\n * Returns a locally-unique ID (generated by just incrementing up from 0 each time its called).\n * @type {function(): number} Generated ID.\n */\nexports.LUIDGenerator = function () {\n    var id = 1;\n    return function () {\n        return id++;\n    };\n}();\n/**\n * Sha1 hash of the input string\n * @param {!string} str The string to hash\n * @return {!string} The resulting hash\n */\nexports.sha1 = function (str) {\n    var utf8Bytes = util_5.stringToByteArray(str);\n    var sha1 = new util_4.Sha1();\n    sha1.update(utf8Bytes);\n    var sha1Bytes = sha1.digest();\n    return util_3.base64.encodeByteArray(sha1Bytes);\n};\n/**\n * @param {...*} var_args\n * @return {string}\n * @private\n */\nvar buildLogMessage_ = function buildLogMessage_() {\n    var var_args = [];\n    for (var _i = 0; _i < arguments.length; _i++) {\n        var_args[_i] = arguments[_i];\n    }\n    var message = '';\n    for (var i = 0; i < var_args.length; i++) {\n        if (Array.isArray(var_args[i]) || var_args[i] && _typeof(var_args[i]) === 'object' && typeof var_args[i].length === 'number') {\n            message += buildLogMessage_.apply(null, var_args[i]);\n        } else if (_typeof(var_args[i]) === 'object') {\n            message += util_6.stringify(var_args[i]);\n        } else {\n            message += var_args[i];\n        }\n        message += ' ';\n    }\n    return message;\n};\n/**\n * Use this for all debug messages in Firebase.\n * @type {?function(string)}\n */\nexports.logger = null;\n/**\n * Flag to check for log availability on first log message\n * @type {boolean}\n * @private\n */\nvar firstLog_ = true;\n/**\n * The implementation of Firebase.enableLogging (defined here to break dependencies)\n * @param {boolean|?function(string)} logger_ A flag to turn on logging, or a custom logger\n * @param {boolean=} persistent Whether or not to persist logging settings across refreshes\n */\nexports.enableLogging = function (logger_, persistent) {\n    util_1.assert(!persistent || logger_ === true || logger_ === false, \"Can't turn on custom loggers persistently.\");\n    if (logger_ === true) {\n        if (typeof console !== 'undefined') {\n            if (typeof console.log === 'function') {\n                exports.logger = console.log.bind(console);\n            } else if (_typeof(console.log) === 'object') {\n                // IE does this.\n                exports.logger = function (message) {\n                    console.log(message);\n                };\n            }\n        }\n        if (persistent) storage_1.SessionStorage.set('logging_enabled', true);\n    } else if (typeof logger_ === 'function') {\n        exports.logger = logger_;\n    } else {\n        exports.logger = null;\n        storage_1.SessionStorage.remove('logging_enabled');\n    }\n};\n/**\n *\n * @param {...(string|Arguments)} var_args\n */\nexports.log = function () {\n    var var_args = [];\n    for (var _i = 0; _i < arguments.length; _i++) {\n        var_args[_i] = arguments[_i];\n    }\n    if (firstLog_ === true) {\n        firstLog_ = false;\n        if (exports.logger === null && storage_1.SessionStorage.get('logging_enabled') === true) exports.enableLogging(true);\n    }\n    if (exports.logger) {\n        var message = buildLogMessage_.apply(null, var_args);\n        exports.logger(message);\n    }\n};\n/**\n * @param {!string} prefix\n * @return {function(...[*])}\n */\nexports.logWrapper = function (prefix) {\n    return function () {\n        var var_args = [];\n        for (var _i = 0; _i < arguments.length; _i++) {\n            var_args[_i] = arguments[_i];\n        }\n        exports.log.apply(void 0, [prefix].concat(var_args));\n    };\n};\n/**\n * @param {...string} var_args\n */\nexports.error = function () {\n    var var_args = [];\n    for (var _i = 0; _i < arguments.length; _i++) {\n        var_args[_i] = arguments[_i];\n    }\n    if (typeof console !== 'undefined') {\n        var message = 'FIREBASE INTERNAL ERROR: ' + buildLogMessage_.apply(void 0, var_args);\n        if (typeof console.error !== 'undefined') {\n            console.error(message);\n        } else {\n            console.log(message);\n        }\n    }\n};\n/**\n * @param {...string} var_args\n */\nexports.fatal = function () {\n    var var_args = [];\n    for (var _i = 0; _i < arguments.length; _i++) {\n        var_args[_i] = arguments[_i];\n    }\n    var message = buildLogMessage_.apply(void 0, var_args);\n    throw new Error('FIREBASE FATAL ERROR: ' + message);\n};\n/**\n * @param {...*} var_args\n */\nexports.warn = function () {\n    var var_args = [];\n    for (var _i = 0; _i < arguments.length; _i++) {\n        var_args[_i] = arguments[_i];\n    }\n    if (typeof console !== 'undefined') {\n        var message = 'FIREBASE WARNING: ' + buildLogMessage_.apply(void 0, var_args);\n        if (typeof console.warn !== 'undefined') {\n            console.warn(message);\n        } else {\n            console.log(message);\n        }\n    }\n};\n/**\n * Logs a warning if the containing page uses https. Called when a call to new Firebase\n * does not use https.\n */\nexports.warnIfPageIsSecure = function () {\n    // Be very careful accessing browser globals. Who knows what may or may not exist.\n    if (typeof window !== 'undefined' && window.location && window.location.protocol && window.location.protocol.indexOf('https:') !== -1) {\n        exports.warn('Insecure Firebase access from a secure page. ' + 'Please use https in calls to new Firebase().');\n    }\n};\n/**\n * @param {!String} methodName\n */\nexports.warnAboutUnsupportedMethod = function (methodName) {\n    exports.warn(methodName + ' is unsupported and will likely change soon.  ' + 'Please do not use.');\n};\n/**\n * Returns true if data is NaN, or +/- Infinity.\n * @param {*} data\n * @return {boolean}\n */\nexports.isInvalidJSONNumber = function (data) {\n    return typeof data === 'number' && (data != data || // NaN\n    data == Number.POSITIVE_INFINITY || data == Number.NEGATIVE_INFINITY);\n};\n/**\n * @param {function()} fn\n */\nexports.executeWhenDOMReady = function (fn) {\n    if (util_7.isNodeSdk() || document.readyState === 'complete') {\n        fn();\n    } else {\n        // Modeled after jQuery. Try DOMContentLoaded and onreadystatechange (which\n        // fire before onload), but fall back to onload.\n        var called_1 = false;\n        var wrappedFn_1 = function wrappedFn_1() {\n            if (!document.body) {\n                setTimeout(wrappedFn_1, Math.floor(10));\n                return;\n            }\n            if (!called_1) {\n                called_1 = true;\n                fn();\n            }\n        };\n        if (document.addEventListener) {\n            document.addEventListener('DOMContentLoaded', wrappedFn_1, false);\n            // fallback to onload.\n            window.addEventListener('load', wrappedFn_1, false);\n        } else if (document.attachEvent) {\n            // IE.\n            document.attachEvent('onreadystatechange', function () {\n                if (document.readyState === 'complete') wrappedFn_1();\n            });\n            // fallback to onload.\n            window.attachEvent('onload', wrappedFn_1);\n            // jQuery has an extra hack for IE that we could employ (based on\n            // http://javascript.nwbox.com/IEContentLoaded/) But it looks really old.\n            // I'm hoping we don't need it.\n        }\n    }\n};\n/**\n * Minimum key name. Invalid for actual data, used as a marker to sort before any valid names\n * @type {!string}\n */\nexports.MIN_NAME = '[MIN_NAME]';\n/**\n * Maximum key name. Invalid for actual data, used as a marker to sort above any valid names\n * @type {!string}\n */\nexports.MAX_NAME = '[MAX_NAME]';\n/**\n * Compares valid Firebase key names, plus min and max name\n * @param {!string} a\n * @param {!string} b\n * @return {!number}\n */\nexports.nameCompare = function (a, b) {\n    if (a === b) {\n        return 0;\n    } else if (a === exports.MIN_NAME || b === exports.MAX_NAME) {\n        return -1;\n    } else if (b === exports.MIN_NAME || a === exports.MAX_NAME) {\n        return 1;\n    } else {\n        var aAsInt = exports.tryParseInt(a),\n            bAsInt = exports.tryParseInt(b);\n        if (aAsInt !== null) {\n            if (bAsInt !== null) {\n                return aAsInt - bAsInt == 0 ? a.length - b.length : aAsInt - bAsInt;\n            } else {\n                return -1;\n            }\n        } else if (bAsInt !== null) {\n            return 1;\n        } else {\n            return a < b ? -1 : 1;\n        }\n    }\n};\n/**\n * @param {!string} a\n * @param {!string} b\n * @return {!number} comparison result.\n */\nexports.stringCompare = function (a, b) {\n    if (a === b) {\n        return 0;\n    } else if (a < b) {\n        return -1;\n    } else {\n        return 1;\n    }\n};\n/**\n * @param {string} key\n * @param {Object} obj\n * @return {*}\n */\nexports.requireKey = function (key, obj) {\n    if (obj && key in obj) {\n        return obj[key];\n    } else {\n        throw new Error('Missing required key (' + key + ') in object: ' + util_6.stringify(obj));\n    }\n};\n/**\n * @param {*} obj\n * @return {string}\n */\nexports.ObjectToUniqueKey = function (obj) {\n    if ((typeof obj === \"undefined\" ? \"undefined\" : _typeof(obj)) !== 'object' || obj === null) return util_6.stringify(obj);\n    var keys = [];\n    for (var k in obj) {\n        keys.push(k);\n    }\n    // Export as json, but with the keys sorted.\n    keys.sort();\n    var key = '{';\n    for (var i = 0; i < keys.length; i++) {\n        if (i !== 0) key += ',';\n        key += util_6.stringify(keys[i]);\n        key += ':';\n        key += exports.ObjectToUniqueKey(obj[keys[i]]);\n    }\n    key += '}';\n    return key;\n};\n/**\n * Splits a string into a number of smaller segments of maximum size\n * @param {!string} str The string\n * @param {!number} segsize The maximum number of chars in the string.\n * @return {Array.<string>} The string, split into appropriately-sized chunks\n */\nexports.splitStringBySize = function (str, segsize) {\n    var len = str.length;\n    if (len <= segsize) {\n        return [str];\n    }\n    var dataSegs = [];\n    for (var c = 0; c < len; c += segsize) {\n        if (c + segsize > len) {\n            dataSegs.push(str.substring(c, len));\n        } else {\n            dataSegs.push(str.substring(c, c + segsize));\n        }\n    }\n    return dataSegs;\n};\n/**\n * Apply a function to each (key, value) pair in an object or\n * apply a function to each (index, value) pair in an array\n * @param {!(Object|Array)} obj The object or array to iterate over\n * @param {function(?, ?)} fn The function to apply\n */\nexports.each = function (obj, fn) {\n    if (Array.isArray(obj)) {\n        for (var i = 0; i < obj.length; ++i) {\n            fn(i, obj[i]);\n        }\n    } else {\n        /**\n         * in the conversion of code we removed the goog.object.forEach\n         * function which did a value,key callback. We standardized on\n         * a single impl that does a key, value callback. So we invert\n         * to not have to touch the `each` code points\n         */\n        util_2.forEach(obj, function (key, val) {\n            return fn(val, key);\n        });\n    }\n};\n/**\n * Like goog.bind, but doesn't bother to create a closure if opt_context is null/undefined.\n * @param {function(*)} callback Callback function.\n * @param {?Object=} context Optional context to bind to.\n * @return {function(*)}\n */\nexports.bindCallback = function (callback, context) {\n    return context ? callback.bind(context) : callback;\n};\n/**\n * Borrowed from http://hg.secondlife.com/llsd/src/tip/js/typedarray.js (MIT License)\n * I made one modification at the end and removed the NaN / Infinity\n * handling (since it seemed broken [caused an overflow] and we don't need it).  See MJL comments.\n * @param {!number} v A double\n * @return {string}\n */\nexports.doubleToIEEE754String = function (v) {\n    util_1.assert(!exports.isInvalidJSONNumber(v), 'Invalid JSON number'); // MJL\n    var ebits = 11,\n        fbits = 52;\n    var bias = (1 << ebits - 1) - 1,\n        s,\n        e,\n        f,\n        ln,\n        i,\n        bits,\n        str;\n    // Compute sign, exponent, fraction\n    // Skip NaN / Infinity handling --MJL.\n    if (v === 0) {\n        e = 0;\n        f = 0;\n        s = 1 / v === -Infinity ? 1 : 0;\n    } else {\n        s = v < 0;\n        v = Math.abs(v);\n        if (v >= Math.pow(2, 1 - bias)) {\n            // Normalized\n            ln = Math.min(Math.floor(Math.log(v) / Math.LN2), bias);\n            e = ln + bias;\n            f = Math.round(v * Math.pow(2, fbits - ln) - Math.pow(2, fbits));\n        } else {\n            // Denormalized\n            e = 0;\n            f = Math.round(v / Math.pow(2, 1 - bias - fbits));\n        }\n    }\n    // Pack sign, exponent, fraction\n    bits = [];\n    for (i = fbits; i; i -= 1) {\n        bits.push(f % 2 ? 1 : 0);\n        f = Math.floor(f / 2);\n    }\n    for (i = ebits; i; i -= 1) {\n        bits.push(e % 2 ? 1 : 0);\n        e = Math.floor(e / 2);\n    }\n    bits.push(s ? 1 : 0);\n    bits.reverse();\n    str = bits.join('');\n    // Return the data as a hex string. --MJL\n    var hexByteString = '';\n    for (i = 0; i < 64; i += 8) {\n        var hexByte = parseInt(str.substr(i, 8), 2).toString(16);\n        if (hexByte.length === 1) hexByte = '0' + hexByte;\n        hexByteString = hexByteString + hexByte;\n    }\n    return hexByteString.toLowerCase();\n};\n/**\n * Used to detect if we're in a Chrome content script (which executes in an\n * isolated environment where long-polling doesn't work).\n * @return {boolean}\n */\nexports.isChromeExtensionContentScript = function () {\n    return !!((typeof window === \"undefined\" ? \"undefined\" : _typeof(window)) === 'object' && window['chrome'] && window['chrome']['extension'] && !/^chrome/.test(window.location.href));\n};\n/**\n * Used to detect if we're in a Windows 8 Store app.\n * @return {boolean}\n */\nexports.isWindowsStoreApp = function () {\n    // Check for the presence of a couple WinRT globals\n    return (typeof Windows === \"undefined\" ? \"undefined\" : _typeof(Windows)) === 'object' && _typeof(Windows.UI) === 'object';\n};\n/**\n * Converts a server error code to a Javascript Error\n * @param {!string} code\n * @param {!Query} query\n * @return {Error}\n */\nexports.errorForServerCode = function (code, query) {\n    var reason = 'Unknown Error';\n    if (code === 'too_big') {\n        reason = 'The data requested exceeds the maximum size ' + 'that can be accessed with a single request.';\n    } else if (code == 'permission_denied') {\n        reason = \"Client doesn't have permission to access the desired data.\";\n    } else if (code == 'unavailable') {\n        reason = 'The service is unavailable';\n    }\n    var error = new Error(code + ' at ' + query.path.toString() + ': ' + reason);\n    error.code = code.toUpperCase();\n    return error;\n};\n/**\n * Used to test for integer-looking strings\n * @type {RegExp}\n * @private\n */\nexports.INTEGER_REGEXP_ = new RegExp('^-?\\\\d{1,10}$');\n/**\n * If the string contains a 32-bit integer, return it.  Else return null.\n * @param {!string} str\n * @return {?number}\n */\nexports.tryParseInt = function (str) {\n    if (exports.INTEGER_REGEXP_.test(str)) {\n        var intVal = Number(str);\n        if (intVal >= -2147483648 && intVal <= 2147483647) {\n            return intVal;\n        }\n    }\n    return null;\n};\n/**\n * Helper to run some code but catch any exceptions and re-throw them later.\n * Useful for preventing user callbacks from breaking internal code.\n *\n * Re-throwing the exception from a setTimeout is a little evil, but it's very\n * convenient (we don't have to try to figure out when is a safe point to\n * re-throw it), and the behavior seems reasonable:\n *\n * * If you aren't pausing on exceptions, you get an error in the console with\n *   the correct stack trace.\n * * If you're pausing on all exceptions, the debugger will pause on your\n *   exception and then again when we rethrow it.\n * * If you're only pausing on uncaught exceptions, the debugger will only pause\n *   on us re-throwing it.\n *\n * @param {!function()} fn The code to guard.\n */\nexports.exceptionGuard = function (fn) {\n    try {\n        fn();\n    } catch (e) {\n        // Re-throw exception when it's safe.\n        setTimeout(function () {\n            // It used to be that \"throw e\" would result in a good console error with\n            // relevant context, but as of Chrome 39, you just get the firebase.js\n            // file/line number where we re-throw it, which is useless. So we log\n            // e.stack explicitly.\n            var stack = e.stack || '';\n            exports.warn('Exception was thrown by user callback.', stack);\n            throw e;\n        }, Math.floor(0));\n    }\n};\n/**\n * Helper function to safely call opt_callback with the specified arguments.  It:\n * 1. Turns into a no-op if opt_callback is null or undefined.\n * 2. Wraps the call inside exceptionGuard to prevent exceptions from breaking our state.\n *\n * @param {?Function=} callback Optional onComplete callback.\n * @param {...*} var_args Arbitrary args to be passed to opt_onComplete\n */\nexports.callUserCallback = function (callback) {\n    var var_args = [];\n    for (var _i = 1; _i < arguments.length; _i++) {\n        var_args[_i - 1] = arguments[_i];\n    }\n    if (typeof callback === 'function') {\n        exports.exceptionGuard(function () {\n            callback.apply(void 0, var_args);\n        });\n    }\n};\n/**\n * @return {boolean} true if we think we're currently being crawled.\n */\nexports.beingCrawled = function () {\n    var userAgent = (typeof window === \"undefined\" ? \"undefined\" : _typeof(window)) === 'object' && window['navigator'] && window['navigator']['userAgent'] || '';\n    // For now we whitelist the most popular crawlers.  We should refine this to be the set of crawlers we\n    // believe to support JavaScript/AJAX rendering.\n    // NOTE: Google Webmaster Tools doesn't really belong, but their \"This is how a visitor to your website\n    // would have seen the page\" is flaky if we don't treat it as a crawler.\n    return userAgent.search(/googlebot|google webmaster tools|bingbot|yahoo! slurp|baiduspider|yandexbot|duckduckbot/i) >= 0;\n};\n/**\n * Export a property of an object using a getter function.\n *\n * @param {!Object} object\n * @param {string} name\n * @param {!function(): *} fnGet\n */\nexports.exportPropGetter = function (object, name, fnGet) {\n    Object.defineProperty(object, name, { get: fnGet });\n};\n/**\n * Same as setTimeout() except on Node.JS it will /not/ prevent the process from exiting.\n *\n * It is removed with clearTimeout() as normal.\n *\n * @param {Function} fn Function to run.\n * @param {number} time Milliseconds to wait before running.\n * @return {number|Object} The setTimeout() return value.\n */\nexports.setTimeoutNonBlocking = function (fn, time) {\n    var timeout = setTimeout(fn, time);\n    if ((typeof timeout === \"undefined\" ? \"undefined\" : _typeof(timeout)) === 'object' && timeout['unref']) {\n        timeout['unref']();\n    }\n    return timeout;\n};\n\n//# sourceMappingURL=util.js.map\n\n/***/ }),\n/* 3 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.bem = bem;\n\nfunction _toConsumableArray(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } else { return Array.from(arr); } }\n\nfunction bem(base) {\n  for (var _len = arguments.length, modifiers = Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {\n    modifiers[_key - 1] = arguments[_key];\n  }\n\n  return [base].concat(_toConsumableArray(modifiers.filter(Boolean).map(function (modifier) {\n    return base + '--' + modifier;\n  }))).join(' ');\n}\n\n/***/ }),\n/* 4 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = __webpack_require__(2);\nvar util_2 = __webpack_require__(0);\n/**\n * An immutable object representing a parsed path.  It's immutable so that you\n * can pass them around to other functions without worrying about them changing\n * it.\n */\nvar Path = /** @class */function () {\n    /**\n     * @param {string|Array.<string>} pathOrString Path string to parse,\n     *      or another path, or the raw tokens array\n     * @param {number=} pieceNum\n     */\n    function Path(pathOrString, pieceNum) {\n        if (pieceNum === void 0) {\n            this.pieces_ = pathOrString.split('/');\n            // Remove empty pieces.\n            var copyTo = 0;\n            for (var i = 0; i < this.pieces_.length; i++) {\n                if (this.pieces_[i].length > 0) {\n                    this.pieces_[copyTo] = this.pieces_[i];\n                    copyTo++;\n                }\n            }\n            this.pieces_.length = copyTo;\n            this.pieceNum_ = 0;\n        } else {\n            this.pieces_ = pathOrString;\n            this.pieceNum_ = pieceNum;\n        }\n    }\n    Object.defineProperty(Path, \"Empty\", {\n        /**\n         * Singleton to represent an empty path\n         *\n         * @const\n         */\n        get: function get() {\n            return new Path('');\n        },\n        enumerable: true,\n        configurable: true\n    });\n    Path.prototype.getFront = function () {\n        if (this.pieceNum_ >= this.pieces_.length) return null;\n        return this.pieces_[this.pieceNum_];\n    };\n    /**\n     * @return {number} The number of segments in this path\n     */\n    Path.prototype.getLength = function () {\n        return this.pieces_.length - this.pieceNum_;\n    };\n    /**\n     * @return {!Path}\n     */\n    Path.prototype.popFront = function () {\n        var pieceNum = this.pieceNum_;\n        if (pieceNum < this.pieces_.length) {\n            pieceNum++;\n        }\n        return new Path(this.pieces_, pieceNum);\n    };\n    /**\n     * @return {?string}\n     */\n    Path.prototype.getBack = function () {\n        if (this.pieceNum_ < this.pieces_.length) return this.pieces_[this.pieces_.length - 1];\n        return null;\n    };\n    Path.prototype.toString = function () {\n        var pathString = '';\n        for (var i = this.pieceNum_; i < this.pieces_.length; i++) {\n            if (this.pieces_[i] !== '') pathString += '/' + this.pieces_[i];\n        }\n        return pathString || '/';\n    };\n    Path.prototype.toUrlEncodedString = function () {\n        var pathString = '';\n        for (var i = this.pieceNum_; i < this.pieces_.length; i++) {\n            if (this.pieces_[i] !== '') pathString += '/' + encodeURIComponent(String(this.pieces_[i]));\n        }\n        return pathString || '/';\n    };\n    /**\n     * Shallow copy of the parts of the path.\n     *\n     * @param {number=} begin\n     * @return {!Array<string>}\n     */\n    Path.prototype.slice = function (begin) {\n        if (begin === void 0) {\n            begin = 0;\n        }\n        return this.pieces_.slice(this.pieceNum_ + begin);\n    };\n    /**\n     * @return {?Path}\n     */\n    Path.prototype.parent = function () {\n        if (this.pieceNum_ >= this.pieces_.length) return null;\n        var pieces = [];\n        for (var i = this.pieceNum_; i < this.pieces_.length - 1; i++) {\n            pieces.push(this.pieces_[i]);\n        }return new Path(pieces, 0);\n    };\n    /**\n     * @param {string|!Path} childPathObj\n     * @return {!Path}\n     */\n    Path.prototype.child = function (childPathObj) {\n        var pieces = [];\n        for (var i = this.pieceNum_; i < this.pieces_.length; i++) {\n            pieces.push(this.pieces_[i]);\n        }if (childPathObj instanceof Path) {\n            for (var i = childPathObj.pieceNum_; i < childPathObj.pieces_.length; i++) {\n                pieces.push(childPathObj.pieces_[i]);\n            }\n        } else {\n            var childPieces = childPathObj.split('/');\n            for (var i = 0; i < childPieces.length; i++) {\n                if (childPieces[i].length > 0) pieces.push(childPieces[i]);\n            }\n        }\n        return new Path(pieces, 0);\n    };\n    /**\n     * @return {boolean} True if there are no segments in this path\n     */\n    Path.prototype.isEmpty = function () {\n        return this.pieceNum_ >= this.pieces_.length;\n    };\n    /**\n     * @param {!Path} outerPath\n     * @param {!Path} innerPath\n     * @return {!Path} The path from outerPath to innerPath\n     */\n    Path.relativePath = function (outerPath, innerPath) {\n        var outer = outerPath.getFront(),\n            inner = innerPath.getFront();\n        if (outer === null) {\n            return innerPath;\n        } else if (outer === inner) {\n            return Path.relativePath(outerPath.popFront(), innerPath.popFront());\n        } else {\n            throw new Error('INTERNAL ERROR: innerPath (' + innerPath + ') is not within ' + 'outerPath (' + outerPath + ')');\n        }\n    };\n    /**\n     * @param {!Path} left\n     * @param {!Path} right\n     * @return {number} -1, 0, 1 if left is less, equal, or greater than the right.\n     */\n    Path.comparePaths = function (left, right) {\n        var leftKeys = left.slice();\n        var rightKeys = right.slice();\n        for (var i = 0; i < leftKeys.length && i < rightKeys.length; i++) {\n            var cmp = util_1.nameCompare(leftKeys[i], rightKeys[i]);\n            if (cmp !== 0) return cmp;\n        }\n        if (leftKeys.length === rightKeys.length) return 0;\n        return leftKeys.length < rightKeys.length ? -1 : 1;\n    };\n    /**\n     *\n     * @param {Path} other\n     * @return {boolean} true if paths are the same.\n     */\n    Path.prototype.equals = function (other) {\n        if (this.getLength() !== other.getLength()) {\n            return false;\n        }\n        for (var i = this.pieceNum_, j = other.pieceNum_; i <= this.pieces_.length; i++, j++) {\n            if (this.pieces_[i] !== other.pieces_[j]) {\n                return false;\n            }\n        }\n        return true;\n    };\n    /**\n     *\n     * @param {!Path} other\n     * @return {boolean} True if this path is a parent (or the same as) other\n     */\n    Path.prototype.contains = function (other) {\n        var i = this.pieceNum_;\n        var j = other.pieceNum_;\n        if (this.getLength() > other.getLength()) {\n            return false;\n        }\n        while (i < this.pieces_.length) {\n            if (this.pieces_[i] !== other.pieces_[j]) {\n                return false;\n            }\n            ++i;\n            ++j;\n        }\n        return true;\n    };\n    return Path;\n}(); // end Path\nexports.Path = Path;\n/**\n * Dynamic (mutable) path used to count path lengths.\n *\n * This class is used to efficiently check paths for valid\n * length (in UTF8 bytes) and depth (used in path validation).\n *\n * Throws Error exception if path is ever invalid.\n *\n * The definition of a path always begins with '/'.\n */\nvar ValidationPath = /** @class */function () {\n    /**\n     * @param {!Path} path Initial Path.\n     * @param {string} errorPrefix_ Prefix for any error messages.\n     */\n    function ValidationPath(path, errorPrefix_) {\n        this.errorPrefix_ = errorPrefix_;\n        /** @type {!Array<string>} */\n        this.parts_ = path.slice();\n        /** @type {number} Initialize to number of '/' chars needed in path. */\n        this.byteLength_ = Math.max(1, this.parts_.length);\n        for (var i = 0; i < this.parts_.length; i++) {\n            this.byteLength_ += util_2.stringLength(this.parts_[i]);\n        }\n        this.checkValid_();\n    }\n    Object.defineProperty(ValidationPath, \"MAX_PATH_DEPTH\", {\n        /** @const {number} Maximum key depth. */\n        get: function get() {\n            return 32;\n        },\n        enumerable: true,\n        configurable: true\n    });\n    Object.defineProperty(ValidationPath, \"MAX_PATH_LENGTH_BYTES\", {\n        /** @const {number} Maximum number of (UTF8) bytes in a Firebase path. */\n        get: function get() {\n            return 768;\n        },\n        enumerable: true,\n        configurable: true\n    });\n    /** @param {string} child */\n    ValidationPath.prototype.push = function (child) {\n        // Count the needed '/'\n        if (this.parts_.length > 0) {\n            this.byteLength_ += 1;\n        }\n        this.parts_.push(child);\n        this.byteLength_ += util_2.stringLength(child);\n        this.checkValid_();\n    };\n    ValidationPath.prototype.pop = function () {\n        var last = this.parts_.pop();\n        this.byteLength_ -= util_2.stringLength(last);\n        // Un-count the previous '/'\n        if (this.parts_.length > 0) {\n            this.byteLength_ -= 1;\n        }\n    };\n    ValidationPath.prototype.checkValid_ = function () {\n        if (this.byteLength_ > ValidationPath.MAX_PATH_LENGTH_BYTES) {\n            throw new Error(this.errorPrefix_ + 'has a key path longer than ' + ValidationPath.MAX_PATH_LENGTH_BYTES + ' bytes (' + this.byteLength_ + ').');\n        }\n        if (this.parts_.length > ValidationPath.MAX_PATH_DEPTH) {\n            throw new Error(this.errorPrefix_ + 'path specified exceeds the maximum depth that can be written (' + ValidationPath.MAX_PATH_DEPTH + ') or object contains a cycle ' + this.toErrorString());\n        }\n    };\n    /**\n     * String for use in error messages - uses '.' notation for path.\n     *\n     * @return {string}\n     */\n    ValidationPath.prototype.toErrorString = function () {\n        if (this.parts_.length == 0) {\n            return '';\n        }\n        return \"in property '\" + this.parts_.join('.') + \"'\";\n    };\n    return ValidationPath;\n}();\nexports.ValidationPath = ValidationPath;\n\n//# sourceMappingURL=Path.js.map\n\n/***/ }),\n/* 5 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.themeToClassName = themeToClassName;\nfunction themeToClassName(theme) {\n  if (!theme) {\n    return '';\n  }\n  return 'theme-' + theme;\n}\n\n/***/ }),\n/* 6 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nvar __extends = undefined && undefined.__extends || function () {\n    var extendStatics = Object.setPrototypeOf || { __proto__: [] } instanceof Array && function (d, b) {\n        d.__proto__ = b;\n    } || function (d, b) {\n        for (var p in b) {\n            if (b.hasOwnProperty(p)) d[p] = b[p];\n        }\n    };\n    return function (d, b) {\n        extendStatics(d, b);\n        function __() {\n            this.constructor = d;\n        }\n        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n    };\n}();\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar Index_1 = __webpack_require__(36);\nvar util_1 = __webpack_require__(2);\nvar Node_1 = __webpack_require__(8);\nvar LeafNode_1 = __webpack_require__(37);\nvar nodeFromJSON;\nvar MAX_NODE;\nfunction setNodeFromJSON(val) {\n    nodeFromJSON = val;\n}\nexports.setNodeFromJSON = setNodeFromJSON;\nfunction setMaxNode(val) {\n    MAX_NODE = val;\n}\nexports.setMaxNode = setMaxNode;\n/**\n * @constructor\n * @extends {Index}\n * @private\n */\nvar PriorityIndex = /** @class */function (_super) {\n    __extends(PriorityIndex, _super);\n    function PriorityIndex() {\n        return _super !== null && _super.apply(this, arguments) || this;\n    }\n    /**\n     * @inheritDoc\n     */\n    PriorityIndex.prototype.compare = function (a, b) {\n        var aPriority = a.node.getPriority();\n        var bPriority = b.node.getPriority();\n        var indexCmp = aPriority.compareTo(bPriority);\n        if (indexCmp === 0) {\n            return util_1.nameCompare(a.name, b.name);\n        } else {\n            return indexCmp;\n        }\n    };\n    /**\n     * @inheritDoc\n     */\n    PriorityIndex.prototype.isDefinedOn = function (node) {\n        return !node.getPriority().isEmpty();\n    };\n    /**\n     * @inheritDoc\n     */\n    PriorityIndex.prototype.indexedValueChanged = function (oldNode, newNode) {\n        return !oldNode.getPriority().equals(newNode.getPriority());\n    };\n    /**\n     * @inheritDoc\n     */\n    PriorityIndex.prototype.minPost = function () {\n        return Node_1.NamedNode.MIN;\n    };\n    /**\n     * @inheritDoc\n     */\n    PriorityIndex.prototype.maxPost = function () {\n        return new Node_1.NamedNode(util_1.MAX_NAME, new LeafNode_1.LeafNode('[PRIORITY-POST]', MAX_NODE));\n    };\n    /**\n     * @param {*} indexValue\n     * @param {string} name\n     * @return {!NamedNode}\n     */\n    PriorityIndex.prototype.makePost = function (indexValue, name) {\n        var priorityNode = nodeFromJSON(indexValue);\n        return new Node_1.NamedNode(name, new LeafNode_1.LeafNode('[PRIORITY-POST]', priorityNode));\n    };\n    /**\n     * @return {!string} String representation for inclusion in a query spec\n     */\n    PriorityIndex.prototype.toString = function () {\n        return '.priority';\n    };\n    return PriorityIndex;\n}(Index_1.Index);\nexports.PriorityIndex = PriorityIndex;\nexports.PRIORITY_INDEX = new PriorityIndex();\n\n//# sourceMappingURL=PriorityIndex.js.map\n\n/***/ }),\n/* 7 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nvar __extends = undefined && undefined.__extends || function () {\n    var extendStatics = Object.setPrototypeOf || { __proto__: [] } instanceof Array && function (d, b) {\n        d.__proto__ = b;\n    } || function (d, b) {\n        for (var p in b) {\n            if (b.hasOwnProperty(p)) d[p] = b[p];\n        }\n    };\n    return function (d, b) {\n        extendStatics(d, b);\n        function __() {\n            this.constructor = d;\n        }\n        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n    };\n}();\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = __webpack_require__(0);\nvar util_2 = __webpack_require__(2);\nvar SortedMap_1 = __webpack_require__(38);\nvar Node_1 = __webpack_require__(8);\nvar snap_1 = __webpack_require__(88);\nvar PriorityIndex_1 = __webpack_require__(6);\nvar KeyIndex_1 = __webpack_require__(22);\nvar IndexMap_1 = __webpack_require__(90);\nvar LeafNode_1 = __webpack_require__(37);\nvar comparators_1 = __webpack_require__(92);\n// TODO: For memory savings, don't store priorityNode_ if it's empty.\nvar EMPTY_NODE;\n/**\n * ChildrenNode is a class for storing internal nodes in a DataSnapshot\n * (i.e. nodes with children).  It implements Node and stores the\n * list of children in the children property, sorted by child name.\n *\n * @constructor\n * @implements {Node}\n */\nvar ChildrenNode = /** @class */function () {\n    /**\n     *\n     * @param {!SortedMap.<string, !Node>} children_ List of children\n     * of this node..\n     * @param {?Node} priorityNode_ The priority of this node (as a snapshot node).\n     * @param {!IndexMap} indexMap_\n     */\n    function ChildrenNode(children_, priorityNode_, indexMap_) {\n        this.children_ = children_;\n        this.priorityNode_ = priorityNode_;\n        this.indexMap_ = indexMap_;\n        this.lazyHash_ = null;\n        /**\n         * Note: The only reason we allow null priority is for EMPTY_NODE, since we can't use\n         * EMPTY_NODE as the priority of EMPTY_NODE.  We might want to consider making EMPTY_NODE its own\n         * class instead of an empty ChildrenNode.\n         */\n        if (this.priorityNode_) {\n            snap_1.validatePriorityNode(this.priorityNode_);\n        }\n        if (this.children_.isEmpty()) {\n            util_1.assert(!this.priorityNode_ || this.priorityNode_.isEmpty(), 'An empty node cannot have a priority');\n        }\n    }\n    Object.defineProperty(ChildrenNode, \"EMPTY_NODE\", {\n        get: function get() {\n            return EMPTY_NODE || (EMPTY_NODE = new ChildrenNode(new SortedMap_1.SortedMap(comparators_1.NAME_COMPARATOR), null, IndexMap_1.IndexMap.Default));\n        },\n        enumerable: true,\n        configurable: true\n    });\n    /** @inheritDoc */\n    ChildrenNode.prototype.isLeafNode = function () {\n        return false;\n    };\n    /** @inheritDoc */\n    ChildrenNode.prototype.getPriority = function () {\n        return this.priorityNode_ || EMPTY_NODE;\n    };\n    /** @inheritDoc */\n    ChildrenNode.prototype.updatePriority = function (newPriorityNode) {\n        if (this.children_.isEmpty()) {\n            // Don't allow priorities on empty nodes\n            return this;\n        } else {\n            return new ChildrenNode(this.children_, newPriorityNode, this.indexMap_);\n        }\n    };\n    /** @inheritDoc */\n    ChildrenNode.prototype.getImmediateChild = function (childName) {\n        // Hack to treat priority as a regular child\n        if (childName === '.priority') {\n            return this.getPriority();\n        } else {\n            var child = this.children_.get(childName);\n            return child === null ? EMPTY_NODE : child;\n        }\n    };\n    /** @inheritDoc */\n    ChildrenNode.prototype.getChild = function (path) {\n        var front = path.getFront();\n        if (front === null) return this;\n        return this.getImmediateChild(front).getChild(path.popFront());\n    };\n    /** @inheritDoc */\n    ChildrenNode.prototype.hasChild = function (childName) {\n        return this.children_.get(childName) !== null;\n    };\n    /** @inheritDoc */\n    ChildrenNode.prototype.updateImmediateChild = function (childName, newChildNode) {\n        util_1.assert(newChildNode, 'We should always be passing snapshot nodes');\n        if (childName === '.priority') {\n            return this.updatePriority(newChildNode);\n        } else {\n            var namedNode = new Node_1.NamedNode(childName, newChildNode);\n            var newChildren = void 0,\n                newIndexMap = void 0,\n                newPriority = void 0;\n            if (newChildNode.isEmpty()) {\n                newChildren = this.children_.remove(childName);\n                newIndexMap = this.indexMap_.removeFromIndexes(namedNode, this.children_);\n            } else {\n                newChildren = this.children_.insert(childName, newChildNode);\n                newIndexMap = this.indexMap_.addToIndexes(namedNode, this.children_);\n            }\n            newPriority = newChildren.isEmpty() ? EMPTY_NODE : this.priorityNode_;\n            return new ChildrenNode(newChildren, newPriority, newIndexMap);\n        }\n    };\n    /** @inheritDoc */\n    ChildrenNode.prototype.updateChild = function (path, newChildNode) {\n        var front = path.getFront();\n        if (front === null) {\n            return newChildNode;\n        } else {\n            util_1.assert(path.getFront() !== '.priority' || path.getLength() === 1, '.priority must be the last token in a path');\n            var newImmediateChild = this.getImmediateChild(front).updateChild(path.popFront(), newChildNode);\n            return this.updateImmediateChild(front, newImmediateChild);\n        }\n    };\n    /** @inheritDoc */\n    ChildrenNode.prototype.isEmpty = function () {\n        return this.children_.isEmpty();\n    };\n    /** @inheritDoc */\n    ChildrenNode.prototype.numChildren = function () {\n        return this.children_.count();\n    };\n    /** @inheritDoc */\n    ChildrenNode.prototype.val = function (exportFormat) {\n        if (this.isEmpty()) return null;\n        var obj = {};\n        var numKeys = 0,\n            maxKey = 0,\n            allIntegerKeys = true;\n        this.forEachChild(PriorityIndex_1.PRIORITY_INDEX, function (key, childNode) {\n            obj[key] = childNode.val(exportFormat);\n            numKeys++;\n            if (allIntegerKeys && ChildrenNode.INTEGER_REGEXP_.test(key)) {\n                maxKey = Math.max(maxKey, Number(key));\n            } else {\n                allIntegerKeys = false;\n            }\n        });\n        if (!exportFormat && allIntegerKeys && maxKey < 2 * numKeys) {\n            // convert to array.\n            var array = [];\n            for (var key in obj) {\n                array[key] = obj[key];\n            }return array;\n        } else {\n            if (exportFormat && !this.getPriority().isEmpty()) {\n                obj['.priority'] = this.getPriority().val();\n            }\n            return obj;\n        }\n    };\n    /** @inheritDoc */\n    ChildrenNode.prototype.hash = function () {\n        if (this.lazyHash_ === null) {\n            var toHash_1 = '';\n            if (!this.getPriority().isEmpty()) toHash_1 += 'priority:' + snap_1.priorityHashText(this.getPriority().val()) + ':';\n            this.forEachChild(PriorityIndex_1.PRIORITY_INDEX, function (key, childNode) {\n                var childHash = childNode.hash();\n                if (childHash !== '') toHash_1 += ':' + key + ':' + childHash;\n            });\n            this.lazyHash_ = toHash_1 === '' ? '' : util_2.sha1(toHash_1);\n        }\n        return this.lazyHash_;\n    };\n    /** @inheritDoc */\n    ChildrenNode.prototype.getPredecessorChildName = function (childName, childNode, index) {\n        var idx = this.resolveIndex_(index);\n        if (idx) {\n            var predecessor = idx.getPredecessorKey(new Node_1.NamedNode(childName, childNode));\n            return predecessor ? predecessor.name : null;\n        } else {\n            return this.children_.getPredecessorKey(childName);\n        }\n    };\n    /**\n     * @param {!Index} indexDefinition\n     * @return {?string}\n     */\n    ChildrenNode.prototype.getFirstChildName = function (indexDefinition) {\n        var idx = this.resolveIndex_(indexDefinition);\n        if (idx) {\n            var minKey = idx.minKey();\n            return minKey && minKey.name;\n        } else {\n            return this.children_.minKey();\n        }\n    };\n    /**\n     * @param {!Index} indexDefinition\n     * @return {?NamedNode}\n     */\n    ChildrenNode.prototype.getFirstChild = function (indexDefinition) {\n        var minKey = this.getFirstChildName(indexDefinition);\n        if (minKey) {\n            return new Node_1.NamedNode(minKey, this.children_.get(minKey));\n        } else {\n            return null;\n        }\n    };\n    /**\n     * Given an index, return the key name of the largest value we have, according to that index\n     * @param {!Index} indexDefinition\n     * @return {?string}\n     */\n    ChildrenNode.prototype.getLastChildName = function (indexDefinition) {\n        var idx = this.resolveIndex_(indexDefinition);\n        if (idx) {\n            var maxKey = idx.maxKey();\n            return maxKey && maxKey.name;\n        } else {\n            return this.children_.maxKey();\n        }\n    };\n    /**\n     * @param {!Index} indexDefinition\n     * @return {?NamedNode}\n     */\n    ChildrenNode.prototype.getLastChild = function (indexDefinition) {\n        var maxKey = this.getLastChildName(indexDefinition);\n        if (maxKey) {\n            return new Node_1.NamedNode(maxKey, this.children_.get(maxKey));\n        } else {\n            return null;\n        }\n    };\n    /**\n     * @inheritDoc\n     */\n    ChildrenNode.prototype.forEachChild = function (index, action) {\n        var idx = this.resolveIndex_(index);\n        if (idx) {\n            return idx.inorderTraversal(function (wrappedNode) {\n                return action(wrappedNode.name, wrappedNode.node);\n            });\n        } else {\n            return this.children_.inorderTraversal(action);\n        }\n    };\n    /**\n     * @param {!Index} indexDefinition\n     * @return {SortedMapIterator}\n     */\n    ChildrenNode.prototype.getIterator = function (indexDefinition) {\n        return this.getIteratorFrom(indexDefinition.minPost(), indexDefinition);\n    };\n    /**\n     *\n     * @param {!NamedNode} startPost\n     * @param {!Index} indexDefinition\n     * @return {!SortedMapIterator}\n     */\n    ChildrenNode.prototype.getIteratorFrom = function (startPost, indexDefinition) {\n        var idx = this.resolveIndex_(indexDefinition);\n        if (idx) {\n            return idx.getIteratorFrom(startPost, function (key) {\n                return key;\n            });\n        } else {\n            var iterator = this.children_.getIteratorFrom(startPost.name, Node_1.NamedNode.Wrap);\n            var next = iterator.peek();\n            while (next != null && indexDefinition.compare(next, startPost) < 0) {\n                iterator.getNext();\n                next = iterator.peek();\n            }\n            return iterator;\n        }\n    };\n    /**\n     * @param {!Index} indexDefinition\n     * @return {!SortedMapIterator}\n     */\n    ChildrenNode.prototype.getReverseIterator = function (indexDefinition) {\n        return this.getReverseIteratorFrom(indexDefinition.maxPost(), indexDefinition);\n    };\n    /**\n     * @param {!NamedNode} endPost\n     * @param {!Index} indexDefinition\n     * @return {!SortedMapIterator}\n     */\n    ChildrenNode.prototype.getReverseIteratorFrom = function (endPost, indexDefinition) {\n        var idx = this.resolveIndex_(indexDefinition);\n        if (idx) {\n            return idx.getReverseIteratorFrom(endPost, function (key) {\n                return key;\n            });\n        } else {\n            var iterator = this.children_.getReverseIteratorFrom(endPost.name, Node_1.NamedNode.Wrap);\n            var next = iterator.peek();\n            while (next != null && indexDefinition.compare(next, endPost) > 0) {\n                iterator.getNext();\n                next = iterator.peek();\n            }\n            return iterator;\n        }\n    };\n    /**\n     * @inheritDoc\n     */\n    ChildrenNode.prototype.compareTo = function (other) {\n        if (this.isEmpty()) {\n            if (other.isEmpty()) {\n                return 0;\n            } else {\n                return -1;\n            }\n        } else if (other.isLeafNode() || other.isEmpty()) {\n            return 1;\n        } else if (other === exports.MAX_NODE) {\n            return -1;\n        } else {\n            // Must be another node with children.\n            return 0;\n        }\n    };\n    /**\n     * @inheritDoc\n     */\n    ChildrenNode.prototype.withIndex = function (indexDefinition) {\n        if (indexDefinition === KeyIndex_1.KEY_INDEX || this.indexMap_.hasIndex(indexDefinition)) {\n            return this;\n        } else {\n            var newIndexMap = this.indexMap_.addIndex(indexDefinition, this.children_);\n            return new ChildrenNode(this.children_, this.priorityNode_, newIndexMap);\n        }\n    };\n    /**\n     * @inheritDoc\n     */\n    ChildrenNode.prototype.isIndexed = function (index) {\n        return index === KeyIndex_1.KEY_INDEX || this.indexMap_.hasIndex(index);\n    };\n    /**\n     * @inheritDoc\n     */\n    ChildrenNode.prototype.equals = function (other) {\n        if (other === this) {\n            return true;\n        } else if (other.isLeafNode()) {\n            return false;\n        } else {\n            var otherChildrenNode = other;\n            if (!this.getPriority().equals(otherChildrenNode.getPriority())) {\n                return false;\n            } else if (this.children_.count() === otherChildrenNode.children_.count()) {\n                var thisIter = this.getIterator(PriorityIndex_1.PRIORITY_INDEX);\n                var otherIter = otherChildrenNode.getIterator(PriorityIndex_1.PRIORITY_INDEX);\n                var thisCurrent = thisIter.getNext();\n                var otherCurrent = otherIter.getNext();\n                while (thisCurrent && otherCurrent) {\n                    if (thisCurrent.name !== otherCurrent.name || !thisCurrent.node.equals(otherCurrent.node)) {\n                        return false;\n                    }\n                    thisCurrent = thisIter.getNext();\n                    otherCurrent = otherIter.getNext();\n                }\n                return thisCurrent === null && otherCurrent === null;\n            } else {\n                return false;\n            }\n        }\n    };\n    /**\n     * Returns a SortedMap ordered by index, or null if the default (by-key) ordering can be used\n     * instead.\n     *\n     * @private\n     * @param {!Index} indexDefinition\n     * @return {?SortedMap.<NamedNode, Node>}\n     */\n    ChildrenNode.prototype.resolveIndex_ = function (indexDefinition) {\n        if (indexDefinition === KeyIndex_1.KEY_INDEX) {\n            return null;\n        } else {\n            return this.indexMap_.get(indexDefinition.toString());\n        }\n    };\n    /**\n     * @private\n     * @type {RegExp}\n     */\n    ChildrenNode.INTEGER_REGEXP_ = /^(0|[1-9]\\d*)$/;\n    return ChildrenNode;\n}();\nexports.ChildrenNode = ChildrenNode;\n/**\n * @constructor\n * @extends {ChildrenNode}\n * @private\n */\nvar MaxNode = /** @class */function (_super) {\n    __extends(MaxNode, _super);\n    function MaxNode() {\n        return _super.call(this, new SortedMap_1.SortedMap(comparators_1.NAME_COMPARATOR), ChildrenNode.EMPTY_NODE, IndexMap_1.IndexMap.Default) || this;\n    }\n    MaxNode.prototype.compareTo = function (other) {\n        if (other === this) {\n            return 0;\n        } else {\n            return 1;\n        }\n    };\n    MaxNode.prototype.equals = function (other) {\n        // Not that we every compare it, but MAX_NODE is only ever equal to itself\n        return other === this;\n    };\n    MaxNode.prototype.getPriority = function () {\n        return this;\n    };\n    MaxNode.prototype.getImmediateChild = function (childName) {\n        return ChildrenNode.EMPTY_NODE;\n    };\n    MaxNode.prototype.isEmpty = function () {\n        return false;\n    };\n    return MaxNode;\n}(ChildrenNode);\nexports.MaxNode = MaxNode;\n/**\n * Marker that will sort higher than any other snapshot.\n * @type {!MAX_NODE}\n * @const\n */\nexports.MAX_NODE = new MaxNode();\nObject.defineProperties(Node_1.NamedNode, {\n    MIN: {\n        value: new Node_1.NamedNode(util_2.MIN_NAME, ChildrenNode.EMPTY_NODE)\n    },\n    MAX: {\n        value: new Node_1.NamedNode(util_2.MAX_NAME, exports.MAX_NODE)\n    }\n});\n/**\n * Reference Extensions\n */\nKeyIndex_1.KeyIndex.__EMPTY_NODE = ChildrenNode.EMPTY_NODE;\nLeafNode_1.LeafNode.__childrenNodeConstructor = ChildrenNode;\nsnap_1.setMaxNode(exports.MAX_NODE);\nPriorityIndex_1.setMaxNode(exports.MAX_NODE);\n\n//# sourceMappingURL=ChildrenNode.js.map\n\n/***/ }),\n/* 8 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\n/**\n *\n * @param {!string} name\n * @param {!Node} node\n * @constructor\n * @struct\n */\nvar NamedNode = /** @class */function () {\n  function NamedNode(name, node) {\n    this.name = name;\n    this.node = node;\n  }\n  /**\n   *\n   * @param {!string} name\n   * @param {!Node} node\n   * @return {NamedNode}\n   */\n  NamedNode.Wrap = function (name, node) {\n    return new NamedNode(name, node);\n  };\n  return NamedNode;\n}();\nexports.NamedNode = NamedNode;\n\n//# sourceMappingURL=Node.js.map\n\n/***/ }),\n/* 9 */\n/***/ (function(module, exports) {\n\n// removed by extract-text-webpack-plugin\nmodule.exports = {\"resultItem\":\"dh-stemning-resultItem\",\"resultItem__label\":\"dh-stemning-resultItem__label\",\"resultItem__score-wrapper\":\"dh-stemning-resultItem__score-wrapper\",\"resultItem__score\":\"dh-stemning-resultItem__score\",\"resultItem__score--hidden\":\"dh-stemning-resultItem__score--hidden\",\"resultItem__score-text\":\"dh-stemning-resultItem__score-text\",\"score-text-wrapper\":\"dh-stemning-score-text-wrapper\",\"resultList__sr\":\"dh-stemning-resultList__sr\",\"resultList__bars\":\"dh-stemning-resultList__bars\",\"resultList__text\":\"dh-stemning-resultList__text\"};\n\n/***/ }),\n/* 10 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\n\n\nvar BREAKPOINTS = {\n  XS: 0,\n  S: 400,\n  M: 600,\n  L: 750,\n  XL: 1500\n};\n\nfunction getCurrentBreakpoint(width) {\n  return Object.keys(BREAKPOINTS).sort(function (a, b) {\n    return BREAKPOINTS[b] - BREAKPOINTS[a];\n  }).find(function (bp) {\n    return width > BREAKPOINTS[bp];\n  });\n}\n\nfunction breakpointToClassName(currentBreakpoint) {\n  switch (currentBreakpoint) {\n    case 'XS':\n      return 'extra-small';\n    case 'S':\n      return 'small';\n    case 'L':\n      return 'large';\n    case 'XL':\n      return 'extra-large';\n    case 'M':\n    default:\n      return 'medium';\n  }\n}\n\nexports.breakpointToClassName = breakpointToClassName;\nexports.getCurrentBreakpoint = getCurrentBreakpoint;\n\n/***/ }),\n/* 11 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nvar _typeof = typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; };\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar Path_1 = __webpack_require__(4);\nvar util_1 = __webpack_require__(0);\nvar util_2 = __webpack_require__(2);\nvar util_3 = __webpack_require__(0);\nvar util_4 = __webpack_require__(0);\n/**\n * True for invalid Firebase keys\n * @type {RegExp}\n * @private\n */\nexports.INVALID_KEY_REGEX_ = /[\\[\\].#$\\/\\u0000-\\u001F\\u007F]/;\n/**\n * True for invalid Firebase paths.\n * Allows '/' in paths.\n * @type {RegExp}\n * @private\n */\nexports.INVALID_PATH_REGEX_ = /[\\[\\].#$\\u0000-\\u001F\\u007F]/;\n/**\n * Maximum number of characters to allow in leaf value\n * @type {number}\n * @private\n */\nexports.MAX_LEAF_SIZE_ = 10 * 1024 * 1024;\n/**\n * @param {*} key\n * @return {boolean}\n */\nexports.isValidKey = function (key) {\n    return typeof key === 'string' && key.length !== 0 && !exports.INVALID_KEY_REGEX_.test(key);\n};\n/**\n * @param {string} pathString\n * @return {boolean}\n */\nexports.isValidPathString = function (pathString) {\n    return typeof pathString === 'string' && pathString.length !== 0 && !exports.INVALID_PATH_REGEX_.test(pathString);\n};\n/**\n * @param {string} pathString\n * @return {boolean}\n */\nexports.isValidRootPathString = function (pathString) {\n    if (pathString) {\n        // Allow '/.info/' at the beginning.\n        pathString = pathString.replace(/^\\/*\\.info(\\/|$)/, '/');\n    }\n    return exports.isValidPathString(pathString);\n};\n/**\n * @param {*} priority\n * @return {boolean}\n */\nexports.isValidPriority = function (priority) {\n    return priority === null || typeof priority === 'string' || typeof priority === 'number' && !util_2.isInvalidJSONNumber(priority) || priority && (typeof priority === \"undefined\" ? \"undefined\" : _typeof(priority)) === 'object' && util_1.contains(priority, '.sv');\n};\n/**\n * Pre-validate a datum passed as an argument to Firebase function.\n *\n * @param {string} fnName\n * @param {number} argumentNumber\n * @param {*} data\n * @param {!Path} path\n * @param {boolean} optional\n */\nexports.validateFirebaseDataArg = function (fnName, argumentNumber, data, path, optional) {\n    if (optional && data === undefined) return;\n    exports.validateFirebaseData(util_3.errorPrefix(fnName, argumentNumber, optional), data, path);\n};\n/**\n * Validate a data object client-side before sending to server.\n *\n * @param {string} errorPrefix\n * @param {*} data\n * @param {!Path|!ValidationPath} path_\n */\nexports.validateFirebaseData = function (errorPrefix, data, path_) {\n    var path = path_ instanceof Path_1.Path ? new Path_1.ValidationPath(path_, errorPrefix) : path_;\n    if (data === undefined) {\n        throw new Error(errorPrefix + 'contains undefined ' + path.toErrorString());\n    }\n    if (typeof data === 'function') {\n        throw new Error(errorPrefix + 'contains a function ' + path.toErrorString() + ' with contents = ' + data.toString());\n    }\n    if (util_2.isInvalidJSONNumber(data)) {\n        throw new Error(errorPrefix + 'contains ' + data.toString() + ' ' + path.toErrorString());\n    }\n    // Check max leaf size, but try to avoid the utf8 conversion if we can.\n    if (typeof data === 'string' && data.length > exports.MAX_LEAF_SIZE_ / 3 && util_4.stringLength(data) > exports.MAX_LEAF_SIZE_) {\n        throw new Error(errorPrefix + 'contains a string greater than ' + exports.MAX_LEAF_SIZE_ + ' utf8 bytes ' + path.toErrorString() + \" ('\" + data.substring(0, 50) + \"...')\");\n    }\n    // TODO = Perf = Consider combining the recursive validation of keys into NodeFromJSON\n    // to save extra walking of large objects.\n    if (data && (typeof data === \"undefined\" ? \"undefined\" : _typeof(data)) === 'object') {\n        var hasDotValue_1 = false,\n            hasActualChild_1 = false;\n        util_1.forEach(data, function (key, value) {\n            if (key === '.value') {\n                hasDotValue_1 = true;\n            } else if (key !== '.priority' && key !== '.sv') {\n                hasActualChild_1 = true;\n                if (!exports.isValidKey(key)) {\n                    throw new Error(errorPrefix + ' contains an invalid key (' + key + ') ' + path.toErrorString() + '.  Keys must be non-empty strings ' + 'and can\\'t contain \".\", \"#\", \"$\", \"/\", \"[\", or \"]\"');\n                }\n            }\n            path.push(key);\n            exports.validateFirebaseData(errorPrefix, value, path);\n            path.pop();\n        });\n        if (hasDotValue_1 && hasActualChild_1) {\n            throw new Error(errorPrefix + ' contains \".value\" child ' + path.toErrorString() + ' in addition to actual children.');\n        }\n    }\n};\n/**\n * Pre-validate paths passed in the firebase function.\n *\n * @param {string} errorPrefix\n * @param {Array<!Path>} mergePaths\n */\nexports.validateFirebaseMergePaths = function (errorPrefix, mergePaths) {\n    var i, curPath;\n    for (i = 0; i < mergePaths.length; i++) {\n        curPath = mergePaths[i];\n        var keys = curPath.slice();\n        for (var j = 0; j < keys.length; j++) {\n            if (keys[j] === '.priority' && j === keys.length - 1) {\n                // .priority is OK\n            } else if (!exports.isValidKey(keys[j])) {\n                throw new Error(errorPrefix + 'contains an invalid key (' + keys[j] + ') in path ' + curPath.toString() + '. Keys must be non-empty strings ' + 'and can\\'t contain \".\", \"#\", \"$\", \"/\", \"[\", or \"]\"');\n            }\n        }\n    }\n    // Check that update keys are not descendants of each other.\n    // We rely on the property that sorting guarantees that ancestors come\n    // right before descendants.\n    mergePaths.sort(Path_1.Path.comparePaths);\n    var prevPath = null;\n    for (i = 0; i < mergePaths.length; i++) {\n        curPath = mergePaths[i];\n        if (prevPath !== null && prevPath.contains(curPath)) {\n            throw new Error(errorPrefix + 'contains a path ' + prevPath.toString() + ' that is ancestor of another path ' + curPath.toString());\n        }\n        prevPath = curPath;\n    }\n};\n/**\n * pre-validate an object passed as an argument to firebase function (\n * must be an object - e.g. for firebase.update()).\n *\n * @param {string} fnName\n * @param {number} argumentNumber\n * @param {*} data\n * @param {!Path} path\n * @param {boolean} optional\n */\nexports.validateFirebaseMergeDataArg = function (fnName, argumentNumber, data, path, optional) {\n    if (optional && data === undefined) return;\n    var errorPrefix = util_3.errorPrefix(fnName, argumentNumber, optional);\n    if (!(data && (typeof data === \"undefined\" ? \"undefined\" : _typeof(data)) === 'object') || Array.isArray(data)) {\n        throw new Error(errorPrefix + ' must be an object containing the children to replace.');\n    }\n    var mergePaths = [];\n    util_1.forEach(data, function (key, value) {\n        var curPath = new Path_1.Path(key);\n        exports.validateFirebaseData(errorPrefix, value, path.child(curPath));\n        if (curPath.getBack() === '.priority') {\n            if (!exports.isValidPriority(value)) {\n                throw new Error(errorPrefix + \"contains an invalid value for '\" + curPath.toString() + \"', which must be a valid \" + 'Firebase priority (a string, finite number, server value, or null).');\n            }\n        }\n        mergePaths.push(curPath);\n    });\n    exports.validateFirebaseMergePaths(errorPrefix, mergePaths);\n};\nexports.validatePriority = function (fnName, argumentNumber, priority, optional) {\n    if (optional && priority === undefined) return;\n    if (util_2.isInvalidJSONNumber(priority)) throw new Error(util_3.errorPrefix(fnName, argumentNumber, optional) + 'is ' + priority.toString() + ', but must be a valid Firebase priority (a string, finite number, ' + 'server value, or null).');\n    // Special case to allow importing data with a .sv.\n    if (!exports.isValidPriority(priority)) throw new Error(util_3.errorPrefix(fnName, argumentNumber, optional) + 'must be a valid Firebase priority ' + '(a string, finite number, server value, or null).');\n};\nexports.validateEventType = function (fnName, argumentNumber, eventType, optional) {\n    if (optional && eventType === undefined) return;\n    switch (eventType) {\n        case 'value':\n        case 'child_added':\n        case 'child_removed':\n        case 'child_changed':\n        case 'child_moved':\n            break;\n        default:\n            throw new Error(util_3.errorPrefix(fnName, argumentNumber, optional) + 'must be a valid event type = \"value\", \"child_added\", \"child_removed\", ' + '\"child_changed\", or \"child_moved\".');\n    }\n};\nexports.validateKey = function (fnName, argumentNumber, key, optional) {\n    if (optional && key === undefined) return;\n    if (!exports.isValidKey(key)) throw new Error(util_3.errorPrefix(fnName, argumentNumber, optional) + 'was an invalid key = \"' + key + '\".  Firebase keys must be non-empty strings and ' + 'can\\'t contain \".\", \"#\", \"$\", \"/\", \"[\", or \"]\").');\n};\nexports.validatePathString = function (fnName, argumentNumber, pathString, optional) {\n    if (optional && pathString === undefined) return;\n    if (!exports.isValidPathString(pathString)) throw new Error(util_3.errorPrefix(fnName, argumentNumber, optional) + 'was an invalid path = \"' + pathString + '\". Paths must be non-empty strings and ' + 'can\\'t contain \".\", \"#\", \"$\", \"[\", or \"]\"');\n};\nexports.validateRootPathString = function (fnName, argumentNumber, pathString, optional) {\n    if (pathString) {\n        // Allow '/.info/' at the beginning.\n        pathString = pathString.replace(/^\\/*\\.info(\\/|$)/, '/');\n    }\n    exports.validatePathString(fnName, argumentNumber, pathString, optional);\n};\nexports.validateWritablePath = function (fnName, path) {\n    if (path.getFront() === '.info') {\n        throw new Error(fnName + \" failed = Can't modify data under /.info/\");\n    }\n};\nexports.validateUrl = function (fnName, argumentNumber, parsedUrl) {\n    // TODO = Validate server better.\n    var pathString = parsedUrl.path.toString();\n    if (!(typeof parsedUrl.repoInfo.host === 'string') || parsedUrl.repoInfo.host.length === 0 || !exports.isValidKey(parsedUrl.repoInfo.namespace) || pathString.length !== 0 && !exports.isValidRootPathString(pathString)) {\n        throw new Error(util_3.errorPrefix(fnName, argumentNumber, false) + 'must be a valid firebase URL and ' + 'the path can\\'t contain \".\", \"#\", \"$\", \"[\", or \"]\".');\n    }\n};\nexports.validateCredential = function (fnName, argumentNumber, cred, optional) {\n    if (optional && cred === undefined) return;\n    if (!(typeof cred === 'string')) throw new Error(util_3.errorPrefix(fnName, argumentNumber, optional) + 'must be a valid credential (a string).');\n};\nexports.validateBoolean = function (fnName, argumentNumber, bool, optional) {\n    if (optional && bool === undefined) return;\n    if (typeof bool !== 'boolean') throw new Error(util_3.errorPrefix(fnName, argumentNumber, optional) + 'must be a boolean.');\n};\nexports.validateString = function (fnName, argumentNumber, string, optional) {\n    if (optional && string === undefined) return;\n    if (!(typeof string === 'string')) {\n        throw new Error(util_3.errorPrefix(fnName, argumentNumber, optional) + 'must be a valid string.');\n    }\n};\nexports.validateObject = function (fnName, argumentNumber, obj, optional) {\n    if (optional && obj === undefined) return;\n    if (!(obj && (typeof obj === \"undefined\" ? \"undefined\" : _typeof(obj)) === 'object') || obj === null) {\n        throw new Error(util_3.errorPrefix(fnName, argumentNumber, optional) + 'must be a valid object.');\n    }\n};\nexports.validateObjectContainsKey = function (fnName, argumentNumber, obj, key, optional, opt_type) {\n    var objectContainsKey = obj && (typeof obj === \"undefined\" ? \"undefined\" : _typeof(obj)) === 'object' && util_1.contains(obj, key);\n    if (!objectContainsKey) {\n        if (optional) {\n            return;\n        } else {\n            throw new Error(util_3.errorPrefix(fnName, argumentNumber, optional) + 'must contain the key \"' + key + '\"');\n        }\n    }\n    if (opt_type) {\n        var val = util_1.safeGet(obj, key);\n        if (opt_type === 'number' && !(typeof val === 'number') || opt_type === 'string' && !(typeof val === 'string') || opt_type === 'boolean' && !(typeof val === 'boolean') || opt_type === 'function' && !(typeof val === 'function') || opt_type === 'object' && !((typeof val === \"undefined\" ? \"undefined\" : _typeof(val)) === 'object') && val) {\n            if (optional) {\n                throw new Error(util_3.errorPrefix(fnName, argumentNumber, optional) + 'contains invalid value for key \"' + key + '\" (must be of type \"' + opt_type + '\")');\n            } else {\n                throw new Error(util_3.errorPrefix(fnName, argumentNumber, optional) + 'must contain the key \"' + key + '\" with type \"' + opt_type + '\"');\n            }\n        }\n    }\n};\n\n//# sourceMappingURL=validation.js.map\n\n/***/ }),\n/* 12 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = __webpack_require__(0);\n/**\n *\n * @enum\n */\nvar OperationType;\n(function (OperationType) {\n  OperationType[OperationType[\"OVERWRITE\"] = 0] = \"OVERWRITE\";\n  OperationType[OperationType[\"MERGE\"] = 1] = \"MERGE\";\n  OperationType[OperationType[\"ACK_USER_WRITE\"] = 2] = \"ACK_USER_WRITE\";\n  OperationType[OperationType[\"LISTEN_COMPLETE\"] = 3] = \"LISTEN_COMPLETE\";\n})(OperationType = exports.OperationType || (exports.OperationType = {}));\n/**\n * @param {boolean} fromUser\n * @param {boolean} fromServer\n * @param {?string} queryId\n * @param {boolean} tagged\n * @constructor\n */\nvar OperationSource = /** @class */function () {\n  function OperationSource(fromUser, fromServer, queryId, tagged) {\n    this.fromUser = fromUser;\n    this.fromServer = fromServer;\n    this.queryId = queryId;\n    this.tagged = tagged;\n    util_1.assert(!tagged || fromServer, 'Tagged queries must be from server.');\n  }\n  /**\n   * @const\n   * @type {!OperationSource}\n   */\n  OperationSource.User = new OperationSource(\n  /*fromUser=*/true, false, null,\n  /*tagged=*/false);\n  /**\n   * @const\n   * @type {!OperationSource}\n   */\n  OperationSource.Server = new OperationSource(false,\n  /*fromServer=*/true, null,\n  /*tagged=*/false);\n  /**\n   * @param {string} queryId\n   * @return {!OperationSource}\n   */\n  OperationSource.forServerTaggedQuery = function (queryId) {\n    return new OperationSource(false,\n    /*fromServer=*/true, queryId,\n    /*tagged=*/true);\n  };\n  return OperationSource;\n}();\nexports.OperationSource = OperationSource;\n\n//# sourceMappingURL=Operation.js.map\n\n/***/ }),\n/* 13 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nvar isDate = __webpack_require__(122);\n\nvar MILLISECONDS_IN_HOUR = 3600000;\nvar MILLISECONDS_IN_MINUTE = 60000;\nvar DEFAULT_ADDITIONAL_DIGITS = 2;\n\nvar parseTokenDateTimeDelimeter = /[T ]/;\nvar parseTokenPlainTime = /:/;\n\n// year tokens\nvar parseTokenYY = /^(\\d{2})$/;\nvar parseTokensYYY = [/^([+-]\\d{2})$/, // 0 additional digits\n/^([+-]\\d{3})$/, // 1 additional digit\n/^([+-]\\d{4})$/ // 2 additional digits\n];\n\nvar parseTokenYYYY = /^(\\d{4})/;\nvar parseTokensYYYYY = [/^([+-]\\d{4})/, // 0 additional digits\n/^([+-]\\d{5})/, // 1 additional digit\n/^([+-]\\d{6})/ // 2 additional digits\n];\n\n// date tokens\nvar parseTokenMM = /^-(\\d{2})$/;\nvar parseTokenDDD = /^-?(\\d{3})$/;\nvar parseTokenMMDD = /^-?(\\d{2})-?(\\d{2})$/;\nvar parseTokenWww = /^-?W(\\d{2})$/;\nvar parseTokenWwwD = /^-?W(\\d{2})-?(\\d{1})$/;\n\n// time tokens\nvar parseTokenHH = /^(\\d{2}([.,]\\d*)?)$/;\nvar parseTokenHHMM = /^(\\d{2}):?(\\d{2}([.,]\\d*)?)$/;\nvar parseTokenHHMMSS = /^(\\d{2}):?(\\d{2}):?(\\d{2}([.,]\\d*)?)$/;\n\n// timezone tokens\nvar parseTokenTimezone = /([Z+-].*)$/;\nvar parseTokenTimezoneZ = /^(Z)$/;\nvar parseTokenTimezoneHH = /^([+-])(\\d{2})$/;\nvar parseTokenTimezoneHHMM = /^([+-])(\\d{2}):?(\\d{2})$/;\n\n/**\n * @category Common Helpers\n * @summary Convert the given argument to an instance of Date.\n *\n * @description\n * Convert the given argument to an instance of Date.\n *\n * If the argument is an instance of Date, the function returns its clone.\n *\n * If the argument is a number, it is treated as a timestamp.\n *\n * If an argument is a string, the function tries to parse it.\n * Function accepts complete ISO 8601 formats as well as partial implementations.\n * ISO 8601: http://en.wikipedia.org/wiki/ISO_8601\n *\n * If all above fails, the function passes the given argument to Date constructor.\n *\n * @param {Date|String|Number} argument - the value to convert\n * @param {Object} [options] - the object with options\n * @param {0 | 1 | 2} [options.additionalDigits=2] - the additional number of digits in the extended year format\n * @returns {Date} the parsed date in the local time zone\n *\n * @example\n * // Convert string '2014-02-11T11:30:30' to date:\n * var result = parse('2014-02-11T11:30:30')\n * //=> Tue Feb 11 2014 11:30:30\n *\n * @example\n * // Parse string '+02014101',\n * // if the additional number of digits in the extended year format is 1:\n * var result = parse('+02014101', {additionalDigits: 1})\n * //=> Fri Apr 11 2014 00:00:00\n */\nfunction parse(argument, dirtyOptions) {\n  if (isDate(argument)) {\n    // Prevent the date to lose the milliseconds when passed to new Date() in IE10\n    return new Date(argument.getTime());\n  } else if (typeof argument !== 'string') {\n    return new Date(argument);\n  }\n\n  var options = dirtyOptions || {};\n  var additionalDigits = options.additionalDigits;\n  if (additionalDigits == null) {\n    additionalDigits = DEFAULT_ADDITIONAL_DIGITS;\n  } else {\n    additionalDigits = Number(additionalDigits);\n  }\n\n  var dateStrings = splitDateString(argument);\n\n  var parseYearResult = parseYear(dateStrings.date, additionalDigits);\n  var year = parseYearResult.year;\n  var restDateString = parseYearResult.restDateString;\n\n  var date = parseDate(restDateString, year);\n\n  if (date) {\n    var timestamp = date.getTime();\n    var time = 0;\n    var offset;\n\n    if (dateStrings.time) {\n      time = parseTime(dateStrings.time);\n    }\n\n    if (dateStrings.timezone) {\n      offset = parseTimezone(dateStrings.timezone);\n    } else {\n      // get offset accurate to hour in timezones that change offset\n      offset = new Date(timestamp + time).getTimezoneOffset();\n      offset = new Date(timestamp + time + offset * MILLISECONDS_IN_MINUTE).getTimezoneOffset();\n    }\n\n    return new Date(timestamp + time + offset * MILLISECONDS_IN_MINUTE);\n  } else {\n    return new Date(argument);\n  }\n}\n\nfunction splitDateString(dateString) {\n  var dateStrings = {};\n  var array = dateString.split(parseTokenDateTimeDelimeter);\n  var timeString;\n\n  if (parseTokenPlainTime.test(array[0])) {\n    dateStrings.date = null;\n    timeString = array[0];\n  } else {\n    dateStrings.date = array[0];\n    timeString = array[1];\n  }\n\n  if (timeString) {\n    var token = parseTokenTimezone.exec(timeString);\n    if (token) {\n      dateStrings.time = timeString.replace(token[1], '');\n      dateStrings.timezone = token[1];\n    } else {\n      dateStrings.time = timeString;\n    }\n  }\n\n  return dateStrings;\n}\n\nfunction parseYear(dateString, additionalDigits) {\n  var parseTokenYYY = parseTokensYYY[additionalDigits];\n  var parseTokenYYYYY = parseTokensYYYYY[additionalDigits];\n\n  var token;\n\n  // YYYY or ±YYYYY\n  token = parseTokenYYYY.exec(dateString) || parseTokenYYYYY.exec(dateString);\n  if (token) {\n    var yearString = token[1];\n    return {\n      year: parseInt(yearString, 10),\n      restDateString: dateString.slice(yearString.length)\n    };\n  }\n\n  // YY or ±YYY\n  token = parseTokenYY.exec(dateString) || parseTokenYYY.exec(dateString);\n  if (token) {\n    var centuryString = token[1];\n    return {\n      year: parseInt(centuryString, 10) * 100,\n      restDateString: dateString.slice(centuryString.length)\n    };\n  }\n\n  // Invalid ISO-formatted year\n  return {\n    year: null\n  };\n}\n\nfunction parseDate(dateString, year) {\n  // Invalid ISO-formatted year\n  if (year === null) {\n    return null;\n  }\n\n  var token;\n  var date;\n  var month;\n  var week;\n\n  // YYYY\n  if (dateString.length === 0) {\n    date = new Date(0);\n    date.setUTCFullYear(year);\n    return date;\n  }\n\n  // YYYY-MM\n  token = parseTokenMM.exec(dateString);\n  if (token) {\n    date = new Date(0);\n    month = parseInt(token[1], 10) - 1;\n    date.setUTCFullYear(year, month);\n    return date;\n  }\n\n  // YYYY-DDD or YYYYDDD\n  token = parseTokenDDD.exec(dateString);\n  if (token) {\n    date = new Date(0);\n    var dayOfYear = parseInt(token[1], 10);\n    date.setUTCFullYear(year, 0, dayOfYear);\n    return date;\n  }\n\n  // YYYY-MM-DD or YYYYMMDD\n  token = parseTokenMMDD.exec(dateString);\n  if (token) {\n    date = new Date(0);\n    month = parseInt(token[1], 10) - 1;\n    var day = parseInt(token[2], 10);\n    date.setUTCFullYear(year, month, day);\n    return date;\n  }\n\n  // YYYY-Www or YYYYWww\n  token = parseTokenWww.exec(dateString);\n  if (token) {\n    week = parseInt(token[1], 10) - 1;\n    return dayOfISOYear(year, week);\n  }\n\n  // YYYY-Www-D or YYYYWwwD\n  token = parseTokenWwwD.exec(dateString);\n  if (token) {\n    week = parseInt(token[1], 10) - 1;\n    var dayOfWeek = parseInt(token[2], 10) - 1;\n    return dayOfISOYear(year, week, dayOfWeek);\n  }\n\n  // Invalid ISO-formatted date\n  return null;\n}\n\nfunction parseTime(timeString) {\n  var token;\n  var hours;\n  var minutes;\n\n  // hh\n  token = parseTokenHH.exec(timeString);\n  if (token) {\n    hours = parseFloat(token[1].replace(',', '.'));\n    return hours % 24 * MILLISECONDS_IN_HOUR;\n  }\n\n  // hh:mm or hhmm\n  token = parseTokenHHMM.exec(timeString);\n  if (token) {\n    hours = parseInt(token[1], 10);\n    minutes = parseFloat(token[2].replace(',', '.'));\n    return hours % 24 * MILLISECONDS_IN_HOUR + minutes * MILLISECONDS_IN_MINUTE;\n  }\n\n  // hh:mm:ss or hhmmss\n  token = parseTokenHHMMSS.exec(timeString);\n  if (token) {\n    hours = parseInt(token[1], 10);\n    minutes = parseInt(token[2], 10);\n    var seconds = parseFloat(token[3].replace(',', '.'));\n    return hours % 24 * MILLISECONDS_IN_HOUR + minutes * MILLISECONDS_IN_MINUTE + seconds * 1000;\n  }\n\n  // Invalid ISO-formatted time\n  return null;\n}\n\nfunction parseTimezone(timezoneString) {\n  var token;\n  var absoluteOffset;\n\n  // Z\n  token = parseTokenTimezoneZ.exec(timezoneString);\n  if (token) {\n    return 0;\n  }\n\n  // ±hh\n  token = parseTokenTimezoneHH.exec(timezoneString);\n  if (token) {\n    absoluteOffset = parseInt(token[2], 10) * 60;\n    return token[1] === '+' ? -absoluteOffset : absoluteOffset;\n  }\n\n  // ±hh:mm or ±hhmm\n  token = parseTokenTimezoneHHMM.exec(timezoneString);\n  if (token) {\n    absoluteOffset = parseInt(token[2], 10) * 60 + parseInt(token[3], 10);\n    return token[1] === '+' ? -absoluteOffset : absoluteOffset;\n  }\n\n  return 0;\n}\n\nfunction dayOfISOYear(isoYear, week, day) {\n  week = week || 0;\n  day = day || 0;\n  var date = new Date(0);\n  date.setUTCFullYear(isoYear, 0, 4);\n  var fourthOfJanuaryDay = date.getUTCDay() || 7;\n  var diff = week * 7 + day + 1 - fourthOfJanuaryDay;\n  date.setUTCDate(date.getUTCDate() + diff);\n  return date;\n}\n\nmodule.exports = parse;\n\n/***/ }),\n/* 14 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.StemningIcon = undefined;\n\nvar _preact = __webpack_require__(1);\n\nvar _StemningIcon = __webpack_require__(63);\n\nvar _StemningIcon2 = _interopRequireDefault(_StemningIcon);\n\nvar _bem = __webpack_require__(3);\n\nvar _themeToClassName = __webpack_require__(5);\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\n//  @jsx h\n\nvar StemningIcon = exports.StemningIcon = function StemningIcon(props, context) {\n  var theme = context.theme;\n\n\n  return (0, _preact.h)(\n    'svg',\n    { className: (0, _bem.bem)(_StemningIcon2.default.stemningIcon, (0, _themeToClassName.themeToClassName)(theme)),\n      xmlns: 'http://www.w3.org/2000/svg', width: '10', height: '14' },\n    (0, _preact.h)(\n      'g',\n      { 'fill-rule': 'evenodd' },\n      (0, _preact.h)('path', { d: 'M1 14c-.6 0-1-.4-1-1V8c0-.6.5-1 1-1 .6 0 1 .4 1 1v5c0 .6-.4 1-1 1M9 14a1 1 0 0 1-1-1V5c0-.6.4-1 1-1s1 .4 1 1v8c0 .6-.4 1-1 1M5 14a1 1 0 0 1-1-1V1a1 1 0 0 1 2 0v12c0 .6-.5 1-1 1' })\n    )\n  );\n};\n\n/***/ }),\n/* 15 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\n/**\n * @constructor\n * @struct\n * @param {!string} type The event type\n * @param {!Node} snapshotNode The data\n * @param {string=} childName The name for this child, if it's a child event\n * @param {Node=} oldSnap Used for intermediate processing of child changed events\n * @param {string=} prevName The name for the previous child, if applicable\n */\nvar Change = /** @class */function () {\n  function Change(type, snapshotNode, childName, oldSnap, prevName) {\n    this.type = type;\n    this.snapshotNode = snapshotNode;\n    this.childName = childName;\n    this.oldSnap = oldSnap;\n    this.prevName = prevName;\n  }\n  /**\n   * @param {!Node} snapshot\n   * @return {!Change}\n   */\n  Change.valueChange = function (snapshot) {\n    return new Change(Change.VALUE, snapshot);\n  };\n  /**\n   * @param {string} childKey\n   * @param {!Node} snapshot\n   * @return {!Change}\n   */\n  Change.childAddedChange = function (childKey, snapshot) {\n    return new Change(Change.CHILD_ADDED, snapshot, childKey);\n  };\n  /**\n   * @param {string} childKey\n   * @param {!Node} snapshot\n   * @return {!Change}\n   */\n  Change.childRemovedChange = function (childKey, snapshot) {\n    return new Change(Change.CHILD_REMOVED, snapshot, childKey);\n  };\n  /**\n   * @param {string} childKey\n   * @param {!Node} newSnapshot\n   * @param {!Node} oldSnapshot\n   * @return {!Change}\n   */\n  Change.childChangedChange = function (childKey, newSnapshot, oldSnapshot) {\n    return new Change(Change.CHILD_CHANGED, newSnapshot, childKey, oldSnapshot);\n  };\n  /**\n   * @param {string} childKey\n   * @param {!Node} snapshot\n   * @return {!Change}\n   */\n  Change.childMovedChange = function (childKey, snapshot) {\n    return new Change(Change.CHILD_MOVED, snapshot, childKey);\n  };\n  //event types\n  /** Event type for a child added */\n  Change.CHILD_ADDED = 'child_added';\n  /** Event type for a child removed */\n  Change.CHILD_REMOVED = 'child_removed';\n  /** Event type for a child changed */\n  Change.CHILD_CHANGED = 'child_changed';\n  /** Event type for a child moved */\n  Change.CHILD_MOVED = 'child_moved';\n  /** Event type for a value change */\n  Change.VALUE = 'value';\n  return Change;\n}();\nexports.Change = Change;\n\n//# sourceMappingURL=Change.js.map\n\n/***/ }),\n/* 16 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.nodelistToArray = nodelistToArray;\nfunction nodelistToArray(nodeList) {\n  return [].slice.call(nodeList);\n}\n\n/***/ }),\n/* 17 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nvar _typeof = typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; };\n\nvar g;\n\n// This works in non-strict mode\ng = function () {\n\treturn this;\n}();\n\ntry {\n\t// This works if eval is allowed (see CSP)\n\tg = g || Function(\"return this\")() || (1, eval)(\"this\");\n} catch (e) {\n\t// This works if the window reference is available\n\tif ((typeof window === \"undefined\" ? \"undefined\" : _typeof(window)) === \"object\") g = window;\n}\n\n// g can still be undefined, but nothing to do about it...\n// We return undefined, instead of nothing here, so it's\n// easier to handle this case. if(!global) { ...}\n\nmodule.exports = g;\n\n/***/ }),\n/* 18 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nvar _typeof = typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; };\n\n/*!\n  * domready (c) Dustin Diaz 2014 - License MIT\n  */\n!function (name, definition) {\n\n  if (true) module.exports = definition();else if (typeof define == 'function' && _typeof(define.amd) == 'object') define(definition);else this[name] = definition();\n}('domready', function () {\n\n  var fns = [],\n      _listener,\n      doc = document,\n      hack = doc.documentElement.doScroll,\n      domContentLoaded = 'DOMContentLoaded',\n      loaded = (hack ? /^loaded|^c/ : /^loaded|^i|^c/).test(doc.readyState);\n\n  if (!loaded) doc.addEventListener(domContentLoaded, _listener = function listener() {\n    doc.removeEventListener(domContentLoaded, _listener);\n    loaded = 1;\n    while (_listener = fns.shift()) {\n      _listener();\n    }\n  });\n\n  return function (fn) {\n    loaded ? setTimeout(fn, 0) : fns.push(fn);\n  };\n});\n\n/***/ }),\n/* 19 */\n/***/ (function(module, exports) {\n\n// removed by extract-text-webpack-plugin\nmodule.exports = {\"bar\":\"dh-stemning-bar\",\"bar--slim\":\"dh-stemning-bar--slim\",\"resultList--theme-sport-inverted\":\"dh-stemning-resultList--theme-sport-inverted\",\"resultList--theme-sport-inverted-gray\":\"dh-stemning-resultList--theme-sport-inverted-gray\",\"resultList--theme-monsen\":\"dh-stemning-resultList--theme-monsen\",\"bar__main\":\"dh-stemning-bar__main\",\"bar__main--highlighted\":\"dh-stemning-bar__main--highlighted\",\"bar__main--theme-sport\":\"dh-stemning-bar__main--theme-sport\",\"bar__main--theme-sport-inverted\":\"dh-stemning-bar__main--theme-sport-inverted\",\"bar__main--theme-sport-inverted-gray\":\"dh-stemning-bar__main--theme-sport-inverted-gray\",\"bar__main--theme-monsen\":\"dh-stemning-bar__main--theme-monsen\"};\n\n/***/ }),\n/* 20 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.getSelectedAlternativeId = getSelectedAlternativeId;\nexports.getCookie = getCookie;\nexports.setHasVoted = setHasVoted;\nexports.hasVoted = hasVoted;\nexports.cookiesEnabled = cookiesEnabled;\n\nvar _browserCookies = __webpack_require__(65);\n\nvar _browserCookies2 = _interopRequireDefault(_browserCookies);\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nvar COOKIE_PREFIX = 'stemning_';\n\nvar COOKIE_MAXAGE = 365;\n\nfunction toCookieName(pollId) {\n  return COOKIE_PREFIX + '_' + pollId;\n}\n\nfunction getSelectedAlternativeId(pollId) {\n  var cookie = getCookie(pollId);\n  return cookie && cookie.selectedAlternativeId;\n}\n\nfunction getCookie(pollId) {\n  var cookieName = toCookieName(pollId);\n  var cookieValueAsString = _browserCookies2.default.get(cookieName);\n  try {\n    return JSON.parse(cookieValueAsString);\n  } catch (error) {\n    return null;\n  }\n}\n\nfunction setHasVoted(pollId, alternativeId) {\n  var cookieName = toCookieName(pollId);\n  var cookieValue = JSON.stringify({\n    hasVoted: true,\n    selectedAlternativeId: alternativeId\n  });\n  var cookieOptions = { expires: COOKIE_MAXAGE };\n\n  _browserCookies2.default.set(cookieName, cookieValue, cookieOptions);\n}\n\nfunction hasVoted(pollId) {\n  var cookie = getCookie(pollId);\n  return cookie && cookie.hasVoted;\n}\n\nfunction cookiesEnabled() {\n  return navigator.cookieEnabled;\n}\n\n/***/ }),\n/* 21 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.firebase = undefined;\n\nvar _firebaseApp = __webpack_require__(144);\n\nvar firebase = exports.firebase = (0, _firebaseApp.createFirebaseNamespace)(); /**\n                                                                                * Copyright 2017 Google Inc.\n                                                                                *\n                                                                                * Licensed under the Apache License, Version 2.0 (the \"License\");\n                                                                                * you may not use this file except in compliance with the License.\n                                                                                * You may obtain a copy of the License at\n                                                                                *\n                                                                                *   http://www.apache.org/licenses/LICENSE-2.0\n                                                                                *\n                                                                                * Unless required by applicable law or agreed to in writing, software\n                                                                                * distributed under the License is distributed on an \"AS IS\" BASIS,\n                                                                                * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n                                                                                * See the License for the specific language governing permissions and\n                                                                                * limitations under the License.\n                                                                                */\nexports.default = firebase;\n\n//# sourceMappingURL=index.js.map\n\n/***/ }),\n/* 22 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nvar __extends = undefined && undefined.__extends || function () {\n    var extendStatics = Object.setPrototypeOf || { __proto__: [] } instanceof Array && function (d, b) {\n        d.__proto__ = b;\n    } || function (d, b) {\n        for (var p in b) {\n            if (b.hasOwnProperty(p)) d[p] = b[p];\n        }\n    };\n    return function (d, b) {\n        extendStatics(d, b);\n        function __() {\n            this.constructor = d;\n        }\n        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n    };\n}();\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar Index_1 = __webpack_require__(36);\nvar Node_1 = __webpack_require__(8);\nvar util_1 = __webpack_require__(2);\nvar util_2 = __webpack_require__(0);\nvar __EMPTY_NODE;\nvar KeyIndex = /** @class */function (_super) {\n    __extends(KeyIndex, _super);\n    function KeyIndex() {\n        return _super !== null && _super.apply(this, arguments) || this;\n    }\n    Object.defineProperty(KeyIndex, \"__EMPTY_NODE\", {\n        get: function get() {\n            return __EMPTY_NODE;\n        },\n        set: function set(val) {\n            __EMPTY_NODE = val;\n        },\n        enumerable: true,\n        configurable: true\n    });\n    /**\n     * @inheritDoc\n     */\n    KeyIndex.prototype.compare = function (a, b) {\n        return util_1.nameCompare(a.name, b.name);\n    };\n    /**\n     * @inheritDoc\n     */\n    KeyIndex.prototype.isDefinedOn = function (node) {\n        // We could probably return true here (since every node has a key), but it's never called\n        // so just leaving unimplemented for now.\n        throw util_2.assertionError('KeyIndex.isDefinedOn not expected to be called.');\n    };\n    /**\n     * @inheritDoc\n     */\n    KeyIndex.prototype.indexedValueChanged = function (oldNode, newNode) {\n        return false; // The key for a node never changes.\n    };\n    /**\n     * @inheritDoc\n     */\n    KeyIndex.prototype.minPost = function () {\n        return Node_1.NamedNode.MIN;\n    };\n    /**\n     * @inheritDoc\n     */\n    KeyIndex.prototype.maxPost = function () {\n        // TODO: This should really be created once and cached in a static property, but\n        // NamedNode isn't defined yet, so I can't use it in a static.  Bleh.\n        return new Node_1.NamedNode(util_1.MAX_NAME, __EMPTY_NODE);\n    };\n    /**\n     * @param {*} indexValue\n     * @param {string} name\n     * @return {!NamedNode}\n     */\n    KeyIndex.prototype.makePost = function (indexValue, name) {\n        util_2.assert(typeof indexValue === 'string', 'KeyIndex indexValue must always be a string.');\n        // We just use empty node, but it'll never be compared, since our comparator only looks at name.\n        return new Node_1.NamedNode(indexValue, __EMPTY_NODE);\n    };\n    /**\n     * @return {!string} String representation for inclusion in a query spec\n     */\n    KeyIndex.prototype.toString = function () {\n        return '.key';\n    };\n    return KeyIndex;\n}(Index_1.Index);\nexports.KeyIndex = KeyIndex;\nexports.KEY_INDEX = new KeyIndex();\n\n//# sourceMappingURL=KeyIndex.js.map\n\n/***/ }),\n/* 23 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nvar _typeof = typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; };\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar ChildrenNode_1 = __webpack_require__(7);\nvar LeafNode_1 = __webpack_require__(37);\nvar Node_1 = __webpack_require__(8);\nvar util_1 = __webpack_require__(0);\nvar util_2 = __webpack_require__(0);\nvar childSet_1 = __webpack_require__(91);\nvar comparators_1 = __webpack_require__(92);\nvar IndexMap_1 = __webpack_require__(90);\nvar PriorityIndex_1 = __webpack_require__(6);\nvar USE_HINZE = true;\n/**\n * Constructs a snapshot node representing the passed JSON and returns it.\n * @param {*} json JSON to create a node for.\n * @param {?string|?number=} priority Optional priority to use.  This will be ignored if the\n * passed JSON contains a .priority property.\n * @return {!Node}\n */\nfunction nodeFromJSON(json, priority) {\n    if (priority === void 0) {\n        priority = null;\n    }\n    if (json === null) {\n        return ChildrenNode_1.ChildrenNode.EMPTY_NODE;\n    }\n    if ((typeof json === \"undefined\" ? \"undefined\" : _typeof(json)) === 'object' && '.priority' in json) {\n        priority = json['.priority'];\n    }\n    util_2.assert(priority === null || typeof priority === 'string' || typeof priority === 'number' || (typeof priority === \"undefined\" ? \"undefined\" : _typeof(priority)) === 'object' && '.sv' in priority, 'Invalid priority type found: ' + (typeof priority === \"undefined\" ? \"undefined\" : _typeof(priority)));\n    if ((typeof json === \"undefined\" ? \"undefined\" : _typeof(json)) === 'object' && '.value' in json && json['.value'] !== null) {\n        json = json['.value'];\n    }\n    // Valid leaf nodes include non-objects or server-value wrapper objects\n    if ((typeof json === \"undefined\" ? \"undefined\" : _typeof(json)) !== 'object' || '.sv' in json) {\n        var jsonLeaf = json;\n        return new LeafNode_1.LeafNode(jsonLeaf, nodeFromJSON(priority));\n    }\n    if (!(json instanceof Array) && USE_HINZE) {\n        var children_1 = [];\n        var childrenHavePriority_1 = false;\n        var hinzeJsonObj_1 = json;\n        util_1.forEach(hinzeJsonObj_1, function (key, child) {\n            if (typeof key !== 'string' || key.substring(0, 1) !== '.') {\n                // Ignore metadata nodes\n                var childNode = nodeFromJSON(hinzeJsonObj_1[key]);\n                if (!childNode.isEmpty()) {\n                    childrenHavePriority_1 = childrenHavePriority_1 || !childNode.getPriority().isEmpty();\n                    children_1.push(new Node_1.NamedNode(key, childNode));\n                }\n            }\n        });\n        if (children_1.length == 0) {\n            return ChildrenNode_1.ChildrenNode.EMPTY_NODE;\n        }\n        var childSet = childSet_1.buildChildSet(children_1, comparators_1.NAME_ONLY_COMPARATOR, function (namedNode) {\n            return namedNode.name;\n        }, comparators_1.NAME_COMPARATOR);\n        if (childrenHavePriority_1) {\n            var sortedChildSet = childSet_1.buildChildSet(children_1, PriorityIndex_1.PRIORITY_INDEX.getCompare());\n            return new ChildrenNode_1.ChildrenNode(childSet, nodeFromJSON(priority), new IndexMap_1.IndexMap({ '.priority': sortedChildSet }, { '.priority': PriorityIndex_1.PRIORITY_INDEX }));\n        } else {\n            return new ChildrenNode_1.ChildrenNode(childSet, nodeFromJSON(priority), IndexMap_1.IndexMap.Default);\n        }\n    } else {\n        var node_1 = ChildrenNode_1.ChildrenNode.EMPTY_NODE;\n        var jsonObj_1 = json;\n        util_1.forEach(jsonObj_1, function (key, childData) {\n            if (util_1.contains(jsonObj_1, key)) {\n                if (key.substring(0, 1) !== '.') {\n                    // ignore metadata nodes.\n                    var childNode = nodeFromJSON(childData);\n                    if (childNode.isLeafNode() || !childNode.isEmpty()) node_1 = node_1.updateImmediateChild(key, childNode);\n                }\n            }\n        });\n        return node_1.updatePriority(nodeFromJSON(priority));\n    }\n}\nexports.nodeFromJSON = nodeFromJSON;\nPriorityIndex_1.setNodeFromJSON(nodeFromJSON);\n\n//# sourceMappingURL=nodeFromJSON.js.map\n\n/***/ }),\n/* 24 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.init = init;\nexports.findElements = findElements;\nexports.isInitialized = isInitialized;\n\nvar _nodelistToArray = __webpack_require__(16);\n\nvar _uuid = __webpack_require__(25);\n\n// noinspection ES6ConvertVarToLetConst\nfunction init(rootElementClassName, mountFn, callbackFn) {\n  var elements = findElements(rootElementClassName);\n  elements.forEach(function (el) {\n    el.id = (0, _uuid.uuid)();\n    window[rootElementClassName][el.id] = true;\n\n    if (mountFn) mountFn(el);\n\n    if (false) {\n      // Reload CSS file\n      require('webpack/hot/emitter').on('webpackHotUpdate', function (currentHash) {\n        document.querySelectorAll('link[href][rel=stylesheet]').forEach(function (link) {\n          if (link instanceof HTMLLinkElement) {\n            var nextStyleHref = link.href.replace(/(\\?\\d+)?$/, '?' + Date.now());\n            link.href = nextStyleHref;\n          }\n        });\n      });\n    }\n  });\n  if (callbackFn && elements && elements.length) callbackFn(elements);\n}\n\nfunction findElements(rootElementClassName) {\n  return (0, _nodelistToArray.nodelistToArray)(document.getElementsByClassName(rootElementClassName)).filter(function (el) {\n    return !isInitialized(el, rootElementClassName);\n  });\n}\n\nfunction isInitialized(el, rootElementClassName) {\n  return el.id && window[rootElementClassName][el.id];\n}\n\n/***/ }),\n/* 25 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.uuid = uuid;\nfunction uuid() {\n  return \"_\" + Math.random().toString(36).substr(2, 9);\n}\n\n/***/ }),\n/* 26 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n/* WEBPACK VAR INJECTION */(function(setImmediate) {\n\nvar _typeof = typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; };\n\n(function (root) {\n\n  // Store setTimeout reference so promise-polyfill will be unaffected by\n  // other code modifying setTimeout (like sinon.useFakeTimers())\n  var setTimeoutFunc = setTimeout;\n\n  function noop() {}\n\n  // Polyfill for Function.prototype.bind\n  function bind(fn, thisArg) {\n    return function () {\n      fn.apply(thisArg, arguments);\n    };\n  }\n\n  function Promise(fn) {\n    if (_typeof(this) !== 'object') throw new TypeError('Promises must be constructed via new');\n    if (typeof fn !== 'function') throw new TypeError('not a function');\n    this._state = 0;\n    this._handled = false;\n    this._value = undefined;\n    this._deferreds = [];\n\n    doResolve(fn, this);\n  }\n\n  function handle(self, deferred) {\n    while (self._state === 3) {\n      self = self._value;\n    }\n    if (self._state === 0) {\n      self._deferreds.push(deferred);\n      return;\n    }\n    self._handled = true;\n    Promise._immediateFn(function () {\n      var cb = self._state === 1 ? deferred.onFulfilled : deferred.onRejected;\n      if (cb === null) {\n        (self._state === 1 ? resolve : reject)(deferred.promise, self._value);\n        return;\n      }\n      var ret;\n      try {\n        ret = cb(self._value);\n      } catch (e) {\n        reject(deferred.promise, e);\n        return;\n      }\n      resolve(deferred.promise, ret);\n    });\n  }\n\n  function resolve(self, newValue) {\n    try {\n      // Promise Resolution Procedure: https://github.com/promises-aplus/promises-spec#the-promise-resolution-procedure\n      if (newValue === self) throw new TypeError('A promise cannot be resolved with itself.');\n      if (newValue && ((typeof newValue === 'undefined' ? 'undefined' : _typeof(newValue)) === 'object' || typeof newValue === 'function')) {\n        var then = newValue.then;\n        if (newValue instanceof Promise) {\n          self._state = 3;\n          self._value = newValue;\n          finale(self);\n          return;\n        } else if (typeof then === 'function') {\n          doResolve(bind(then, newValue), self);\n          return;\n        }\n      }\n      self._state = 1;\n      self._value = newValue;\n      finale(self);\n    } catch (e) {\n      reject(self, e);\n    }\n  }\n\n  function reject(self, newValue) {\n    self._state = 2;\n    self._value = newValue;\n    finale(self);\n  }\n\n  function finale(self) {\n    if (self._state === 2 && self._deferreds.length === 0) {\n      Promise._immediateFn(function () {\n        if (!self._handled) {\n          Promise._unhandledRejectionFn(self._value);\n        }\n      });\n    }\n\n    for (var i = 0, len = self._deferreds.length; i < len; i++) {\n      handle(self, self._deferreds[i]);\n    }\n    self._deferreds = null;\n  }\n\n  function Handler(onFulfilled, onRejected, promise) {\n    this.onFulfilled = typeof onFulfilled === 'function' ? onFulfilled : null;\n    this.onRejected = typeof onRejected === 'function' ? onRejected : null;\n    this.promise = promise;\n  }\n\n  /**\n   * Take a potentially misbehaving resolver function and make sure\n   * onFulfilled and onRejected are only called once.\n   *\n   * Makes no guarantees about asynchrony.\n   */\n  function doResolve(fn, self) {\n    var done = false;\n    try {\n      fn(function (value) {\n        if (done) return;\n        done = true;\n        resolve(self, value);\n      }, function (reason) {\n        if (done) return;\n        done = true;\n        reject(self, reason);\n      });\n    } catch (ex) {\n      if (done) return;\n      done = true;\n      reject(self, ex);\n    }\n  }\n\n  Promise.prototype['catch'] = function (onRejected) {\n    return this.then(null, onRejected);\n  };\n\n  Promise.prototype.then = function (onFulfilled, onRejected) {\n    var prom = new this.constructor(noop);\n\n    handle(this, new Handler(onFulfilled, onRejected, prom));\n    return prom;\n  };\n\n  Promise.all = function (arr) {\n    var args = Array.prototype.slice.call(arr);\n\n    return new Promise(function (resolve, reject) {\n      if (args.length === 0) return resolve([]);\n      var remaining = args.length;\n\n      function res(i, val) {\n        try {\n          if (val && ((typeof val === 'undefined' ? 'undefined' : _typeof(val)) === 'object' || typeof val === 'function')) {\n            var then = val.then;\n            if (typeof then === 'function') {\n              then.call(val, function (val) {\n                res(i, val);\n              }, reject);\n              return;\n            }\n          }\n          args[i] = val;\n          if (--remaining === 0) {\n            resolve(args);\n          }\n        } catch (ex) {\n          reject(ex);\n        }\n      }\n\n      for (var i = 0; i < args.length; i++) {\n        res(i, args[i]);\n      }\n    });\n  };\n\n  Promise.resolve = function (value) {\n    if (value && (typeof value === 'undefined' ? 'undefined' : _typeof(value)) === 'object' && value.constructor === Promise) {\n      return value;\n    }\n\n    return new Promise(function (resolve) {\n      resolve(value);\n    });\n  };\n\n  Promise.reject = function (value) {\n    return new Promise(function (resolve, reject) {\n      reject(value);\n    });\n  };\n\n  Promise.race = function (values) {\n    return new Promise(function (resolve, reject) {\n      for (var i = 0, len = values.length; i < len; i++) {\n        values[i].then(resolve, reject);\n      }\n    });\n  };\n\n  // Use polyfill for setImmediate for performance gains\n  Promise._immediateFn = typeof setImmediate === 'function' && function (fn) {\n    setImmediate(fn);\n  } || function (fn) {\n    setTimeoutFunc(fn, 0);\n  };\n\n  Promise._unhandledRejectionFn = function _unhandledRejectionFn(err) {\n    if (typeof console !== 'undefined' && console) {\n      console.warn('Possible Unhandled Promise Rejection:', err); // eslint-disable-line no-console\n    }\n  };\n\n  /**\n   * Set the immediate function to execute callbacks\n   * @param fn {function} Function to execute\n   * @deprecated\n   */\n  Promise._setImmediateFn = function _setImmediateFn(fn) {\n    Promise._immediateFn = fn;\n  };\n\n  /**\n   * Change the function to execute on unhandled rejection\n   * @param {function} fn Function to execute on unhandled rejection\n   * @deprecated\n   */\n  Promise._setUnhandledRejectionFn = function _setUnhandledRejectionFn(fn) {\n    Promise._unhandledRejectionFn = fn;\n  };\n\n  if (typeof module !== 'undefined' && module.exports) {\n    module.exports = Promise;\n  } else if (!root.Promise) {\n    root.Promise = Promise;\n  }\n})(undefined);\n/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(46).setImmediate))\n\n/***/ }),\n/* 27 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\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}\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}\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) {\n    return [];\n};\n\nprocess.binding = function (name) {\n    throw new Error('process.binding is not supported');\n};\n\nprocess.cwd = function () {\n    return '/';\n};\nprocess.chdir = function (dir) {\n    throw new Error('process.chdir is not supported');\n};\nprocess.umask = function () {\n    return 0;\n};\n\n/***/ }),\n/* 28 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.Button = undefined;\n\nvar _createClass = function () { function 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, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }();\n\nvar _preact = __webpack_require__(1);\n\nvar _Button = __webpack_require__(48);\n\nvar _Button2 = _interopRequireDefault(_Button);\n\nvar _bem = __webpack_require__(3);\n\nvar _themeToClassName = __webpack_require__(5);\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction _possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return call && (typeof call === \"object\" || typeof call === \"function\") ? call : self; }\n\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function, not \" + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; }\n/** @jsx h */\n\nvar Button = exports.Button = function (_Component) {\n  _inherits(Button, _Component);\n\n  function Button() {\n    _classCallCheck(this, Button);\n\n    return _possibleConstructorReturn(this, (Button.__proto__ || Object.getPrototypeOf(Button)).apply(this, arguments));\n  }\n\n  _createClass(Button, [{\n    key: 'render',\n    value: function render() {\n      var theme = this.context.theme;\n\n\n      var classes = ['nrk-button', (0, _bem.bem)(_Button2.default.button, (0, _themeToClassName.themeToClassName)(theme)), this.props.className || ''].join(' ');\n\n      return (0, _preact.h)(\n        'button',\n        { className: classes, onClick: this.props.onClick },\n        this.props.children\n      );\n    }\n  }]);\n\n  return Button;\n}(_preact.Component);\n\n/***/ }),\n/* 29 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\n\nvar _typeof = typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; };\n\nfunction _toConsumableArray(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } else { return Array.from(arr); } }\n\nfunction getMaxLength(values, key) {\n  var arrOfLengths = values.map(function (v) {\n    if ((typeof v === 'undefined' ? 'undefined' : _typeof(v)) === 'object' && key && v[key]) {\n      return String(v[key]).length || 0;\n    }\n    if (typeof v === 'string') return v.length;\n    return 0;\n  }).sort();\n  return Math.max.apply(Math, _toConsumableArray(arrOfLengths));\n}\n\nexports.getMaxLength = getMaxLength;\n\n/***/ }),\n/* 30 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.Error = undefined;\n\nvar _createClass = function () { function 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, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }();\n\nvar _preact = __webpack_require__(1);\n\nvar _Error = __webpack_require__(61);\n\nvar _Error2 = _interopRequireDefault(_Error);\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction _possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return call && (typeof call === \"object\" || typeof call === \"function\") ? call : self; }\n\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function, not \" + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; }\n/** @jsx h */\n\nvar Error = exports.Error = function (_Component) {\n  _inherits(Error, _Component);\n\n  function Error() {\n    _classCallCheck(this, Error);\n\n    return _possibleConstructorReturn(this, (Error.__proto__ || Object.getPrototypeOf(Error)).apply(this, arguments));\n  }\n\n  _createClass(Error, [{\n    key: 'render',\n    value: function render() {\n      return (0, _preact.h)(\n        'div',\n        { className: _Error2.default.error, style: this.props.style },\n        this.props.children\n      );\n    }\n  }]);\n\n  return Error;\n}(_preact.Component);\n\n/***/ }),\n/* 31 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.Loader = undefined;\n\nvar _createClass = function () { function 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, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }();\n\nvar _preact = __webpack_require__(1);\n\nvar _Loader = __webpack_require__(62);\n\nvar _Loader2 = _interopRequireDefault(_Loader);\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction _possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return call && (typeof call === \"object\" || typeof call === \"function\") ? call : self; }\n\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function, not \" + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; }\n/** @jsx h */\n\nvar Loader = exports.Loader = function (_Component) {\n  _inherits(Loader, _Component);\n\n  function Loader() {\n    _classCallCheck(this, Loader);\n\n    return _possibleConstructorReturn(this, (Loader.__proto__ || Object.getPrototypeOf(Loader)).apply(this, arguments));\n  }\n\n  _createClass(Loader, [{\n    key: 'render',\n    value: function render() {\n      return (0, _preact.h)(\n        'div',\n        { className: _Loader2.default.loader },\n        this.props.children\n      );\n    }\n  }]);\n\n  return Loader;\n}(_preact.Component);\n\n/***/ }),\n/* 32 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.RetryButton = undefined;\n\nvar _createClass = function () { function 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, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }();\n\nvar _preact = __webpack_require__(1);\n\nvar _Button = __webpack_require__(28);\n\nvar _RetryButton = __webpack_require__(64);\n\nvar _RetryButton2 = _interopRequireDefault(_RetryButton);\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction _possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return call && (typeof call === \"object\" || typeof call === \"function\") ? call : self; }\n\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function, not \" + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; }\n/** @jsx h */\n\nvar RetryButton = exports.RetryButton = function (_Component) {\n  _inherits(RetryButton, _Component);\n\n  function RetryButton() {\n    _classCallCheck(this, RetryButton);\n\n    return _possibleConstructorReturn(this, (RetryButton.__proto__ || Object.getPrototypeOf(RetryButton)).apply(this, arguments));\n  }\n\n  _createClass(RetryButton, [{\n    key: 'render',\n    value: function render() {\n      return (0, _preact.h)(\n        _Button.Button,\n        { onClick: this.props.onClick, className: _RetryButton2.default.retryButton },\n        (0, _preact.h)(\n          'svg',\n          { width: '15', height: '15', 'aria-hidden': 'true' },\n          (0, _preact.h)('use', { xlinkHref: '#nrk-reload' })\n        ),\n        ' ',\n        this.props.children\n      );\n    }\n  }]);\n\n  return RetryButton;\n}(_preact.Component);\n\n/***/ }),\n/* 33 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.PureComponent = undefined;\n\nvar _createClass = function () { function 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, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }();\n\nvar _preact = __webpack_require__(1);\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction _possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return call && (typeof call === \"object\" || typeof call === \"function\") ? call : self; }\n\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function, not \" + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; }\n\nfunction shallowEqual(a, b) {\n  for (var key in a) {\n    if (a[key] !== b[key]) return false;\n  }for (var _key in b) {\n    if (!(_key in a)) return false;\n  }return true;\n}\n\nvar PureComponent = exports.PureComponent = function (_Component) {\n  _inherits(PureComponent, _Component);\n\n  function PureComponent() {\n    _classCallCheck(this, PureComponent);\n\n    return _possibleConstructorReturn(this, (PureComponent.__proto__ || Object.getPrototypeOf(PureComponent)).apply(this, arguments));\n  }\n\n  _createClass(PureComponent, [{\n    key: 'shouldComponentUpdate',\n    value: function shouldComponentUpdate(props, state, context) {\n      return !(shallowEqual(props, this.props) && shallowEqual(state, this.state) && shallowEqual(context, this.context));\n    }\n  }]);\n\n  return PureComponent;\n}(_preact.Component);\n\n/***/ }),\n/* 34 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar DOMStorageWrapper_1 = __webpack_require__(158);\nvar MemoryStorage_1 = __webpack_require__(159);\n/**\n * Helper to create a DOMStorageWrapper or else fall back to MemoryStorage.\n * TODO: Once MemoryStorage and DOMStorageWrapper have a shared interface this method annotation should change\n * to reflect this type\n *\n * @param {string} domStorageName Name of the underlying storage object\n *   (e.g. 'localStorage' or 'sessionStorage').\n * @return {?} Turning off type information until a common interface is defined.\n */\nvar createStoragefor = function createStoragefor(domStorageName) {\n    try {\n        // NOTE: just accessing \"localStorage\" or \"window['localStorage']\" may throw a security exception,\n        // so it must be inside the try/catch.\n        if (typeof window !== 'undefined' && typeof window[domStorageName] !== 'undefined') {\n            // Need to test cache. Just because it's here doesn't mean it works\n            var domStorage = window[domStorageName];\n            domStorage.setItem('firebase:sentinel', 'cache');\n            domStorage.removeItem('firebase:sentinel');\n            return new DOMStorageWrapper_1.DOMStorageWrapper(domStorage);\n        }\n    } catch (e) {}\n    // Failed to create wrapper.  Just return in-memory storage.\n    // TODO: log?\n    return new MemoryStorage_1.MemoryStorage();\n};\n/** A storage object that lasts across sessions */\nexports.PersistentStorage = createStoragefor('localStorage');\n/** A storage object that only lasts one session */\nexports.SessionStorage = createStoragefor('sessionStorage');\n\n//# sourceMappingURL=storage.js.map\n\n/***/ }),\n/* 35 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.PROTOCOL_VERSION = '5';\nexports.VERSION_PARAM = 'v';\nexports.TRANSPORT_SESSION_PARAM = 's';\nexports.REFERER_PARAM = 'r';\nexports.FORGE_REF = 'f';\nexports.FORGE_DOMAIN = 'firebaseio.com';\nexports.LAST_SESSION_PARAM = 'ls';\nexports.WEBSOCKET = 'websocket';\nexports.LONG_POLLING = 'long_polling';\n\n//# sourceMappingURL=Constants.js.map\n\n/***/ }),\n/* 36 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar Node_1 = __webpack_require__(8);\nvar util_1 = __webpack_require__(2);\n/**\n *\n * @constructor\n */\nvar Index = /** @class */function () {\n  function Index() {}\n  /**\n   * @return {function(!NamedNode, !NamedNode):number} A standalone comparison function for\n   * this index\n   */\n  Index.prototype.getCompare = function () {\n    return this.compare.bind(this);\n  };\n  /**\n   * Given a before and after value for a node, determine if the indexed value has changed. Even if they are different,\n   * it's possible that the changes are isolated to parts of the snapshot that are not indexed.\n   *\n   * @param {!Node} oldNode\n   * @param {!Node} newNode\n   * @return {boolean} True if the portion of the snapshot being indexed changed between oldNode and newNode\n   */\n  Index.prototype.indexedValueChanged = function (oldNode, newNode) {\n    var oldWrapped = new Node_1.NamedNode(util_1.MIN_NAME, oldNode);\n    var newWrapped = new Node_1.NamedNode(util_1.MIN_NAME, newNode);\n    return this.compare(oldWrapped, newWrapped) !== 0;\n  };\n  /**\n   * @return {!NamedNode} a node wrapper that will sort equal to or less than\n   * any other node wrapper, using this index\n   */\n  Index.prototype.minPost = function () {\n    return Node_1.NamedNode.MIN;\n  };\n  return Index;\n}();\nexports.Index = Index;\n\n//# sourceMappingURL=Index.js.map\n\n/***/ }),\n/* 37 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nvar _typeof = typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; };\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = __webpack_require__(0);\nvar util_2 = __webpack_require__(2);\nvar snap_1 = __webpack_require__(88);\nvar __childrenNodeConstructor;\n/**\n * LeafNode is a class for storing leaf nodes in a DataSnapshot.  It\n * implements Node and stores the value of the node (a string,\n * number, or boolean) accessible via getValue().\n */\nvar LeafNode = /** @class */function () {\n    /**\n     * @implements {Node}\n     * @param {!(string|number|boolean|Object)} value_ The value to store in this leaf node.\n     *                                         The object type is possible in the event of a deferred value\n     * @param {!Node=} priorityNode_ The priority of this node.\n     */\n    function LeafNode(value_, priorityNode_) {\n        if (priorityNode_ === void 0) {\n            priorityNode_ = LeafNode.__childrenNodeConstructor.EMPTY_NODE;\n        }\n        this.value_ = value_;\n        this.priorityNode_ = priorityNode_;\n        this.lazyHash_ = null;\n        util_1.assert(this.value_ !== undefined && this.value_ !== null, \"LeafNode shouldn't be created with null/undefined value.\");\n        snap_1.validatePriorityNode(this.priorityNode_);\n    }\n    Object.defineProperty(LeafNode, \"__childrenNodeConstructor\", {\n        get: function get() {\n            return __childrenNodeConstructor;\n        },\n        set: function set(val) {\n            __childrenNodeConstructor = val;\n        },\n        enumerable: true,\n        configurable: true\n    });\n    /** @inheritDoc */\n    LeafNode.prototype.isLeafNode = function () {\n        return true;\n    };\n    /** @inheritDoc */\n    LeafNode.prototype.getPriority = function () {\n        return this.priorityNode_;\n    };\n    /** @inheritDoc */\n    LeafNode.prototype.updatePriority = function (newPriorityNode) {\n        return new LeafNode(this.value_, newPriorityNode);\n    };\n    /** @inheritDoc */\n    LeafNode.prototype.getImmediateChild = function (childName) {\n        // Hack to treat priority as a regular child\n        if (childName === '.priority') {\n            return this.priorityNode_;\n        } else {\n            return LeafNode.__childrenNodeConstructor.EMPTY_NODE;\n        }\n    };\n    /** @inheritDoc */\n    LeafNode.prototype.getChild = function (path) {\n        if (path.isEmpty()) {\n            return this;\n        } else if (path.getFront() === '.priority') {\n            return this.priorityNode_;\n        } else {\n            return LeafNode.__childrenNodeConstructor.EMPTY_NODE;\n        }\n    };\n    /**\n     * @inheritDoc\n     */\n    LeafNode.prototype.hasChild = function () {\n        return false;\n    };\n    /** @inheritDoc */\n    LeafNode.prototype.getPredecessorChildName = function (childName, childNode) {\n        return null;\n    };\n    /** @inheritDoc */\n    LeafNode.prototype.updateImmediateChild = function (childName, newChildNode) {\n        if (childName === '.priority') {\n            return this.updatePriority(newChildNode);\n        } else if (newChildNode.isEmpty() && childName !== '.priority') {\n            return this;\n        } else {\n            return LeafNode.__childrenNodeConstructor.EMPTY_NODE.updateImmediateChild(childName, newChildNode).updatePriority(this.priorityNode_);\n        }\n    };\n    /** @inheritDoc */\n    LeafNode.prototype.updateChild = function (path, newChildNode) {\n        var front = path.getFront();\n        if (front === null) {\n            return newChildNode;\n        } else if (newChildNode.isEmpty() && front !== '.priority') {\n            return this;\n        } else {\n            util_1.assert(front !== '.priority' || path.getLength() === 1, '.priority must be the last token in a path');\n            return this.updateImmediateChild(front, LeafNode.__childrenNodeConstructor.EMPTY_NODE.updateChild(path.popFront(), newChildNode));\n        }\n    };\n    /** @inheritDoc */\n    LeafNode.prototype.isEmpty = function () {\n        return false;\n    };\n    /** @inheritDoc */\n    LeafNode.prototype.numChildren = function () {\n        return 0;\n    };\n    /** @inheritDoc */\n    LeafNode.prototype.forEachChild = function (index, action) {\n        return false;\n    };\n    /**\n     * @inheritDoc\n     */\n    LeafNode.prototype.val = function (exportFormat) {\n        if (exportFormat && !this.getPriority().isEmpty()) return {\n            '.value': this.getValue(),\n            '.priority': this.getPriority().val()\n        };else return this.getValue();\n    };\n    /** @inheritDoc */\n    LeafNode.prototype.hash = function () {\n        if (this.lazyHash_ === null) {\n            var toHash = '';\n            if (!this.priorityNode_.isEmpty()) toHash += 'priority:' + snap_1.priorityHashText(this.priorityNode_.val()) + ':';\n            var type = _typeof(this.value_);\n            toHash += type + ':';\n            if (type === 'number') {\n                toHash += util_2.doubleToIEEE754String(this.value_);\n            } else {\n                toHash += this.value_;\n            }\n            this.lazyHash_ = util_2.sha1(toHash);\n        }\n        return this.lazyHash_;\n    };\n    /**\n     * Returns the value of the leaf node.\n     * @return {Object|string|number|boolean} The value of the node.\n     */\n    LeafNode.prototype.getValue = function () {\n        return this.value_;\n    };\n    /**\n     * @inheritDoc\n     */\n    LeafNode.prototype.compareTo = function (other) {\n        if (other === LeafNode.__childrenNodeConstructor.EMPTY_NODE) {\n            return 1;\n        } else if (other instanceof LeafNode.__childrenNodeConstructor) {\n            return -1;\n        } else {\n            util_1.assert(other.isLeafNode(), 'Unknown node type');\n            return this.compareToLeafNode_(other);\n        }\n    };\n    /**\n     * Comparison specifically for two leaf nodes\n     * @param {!LeafNode} otherLeaf\n     * @return {!number}\n     * @private\n     */\n    LeafNode.prototype.compareToLeafNode_ = function (otherLeaf) {\n        var otherLeafType = _typeof(otherLeaf.value_);\n        var thisLeafType = _typeof(this.value_);\n        var otherIndex = LeafNode.VALUE_TYPE_ORDER.indexOf(otherLeafType);\n        var thisIndex = LeafNode.VALUE_TYPE_ORDER.indexOf(thisLeafType);\n        util_1.assert(otherIndex >= 0, 'Unknown leaf type: ' + otherLeafType);\n        util_1.assert(thisIndex >= 0, 'Unknown leaf type: ' + thisLeafType);\n        if (otherIndex === thisIndex) {\n            // Same type, compare values\n            if (thisLeafType === 'object') {\n                // Deferred value nodes are all equal, but we should also never get to this point...\n                return 0;\n            } else {\n                // Note that this works because true > false, all others are number or string comparisons\n                if (this.value_ < otherLeaf.value_) {\n                    return -1;\n                } else if (this.value_ === otherLeaf.value_) {\n                    return 0;\n                } else {\n                    return 1;\n                }\n            }\n        } else {\n            return thisIndex - otherIndex;\n        }\n    };\n    /**\n     * @inheritDoc\n     */\n    LeafNode.prototype.withIndex = function () {\n        return this;\n    };\n    /**\n     * @inheritDoc\n     */\n    LeafNode.prototype.isIndexed = function () {\n        return true;\n    };\n    /**\n     * @inheritDoc\n     */\n    LeafNode.prototype.equals = function (other) {\n        /**\n         * @inheritDoc\n         */\n        if (other === this) {\n            return true;\n        } else if (other.isLeafNode()) {\n            var otherLeaf = other;\n            return this.value_ === otherLeaf.value_ && this.priorityNode_.equals(otherLeaf.priorityNode_);\n        } else {\n            return false;\n        }\n    };\n    /**\n     * The sort order for comparing leaf nodes of different types. If two leaf nodes have\n     * the same type, the comparison falls back to their value\n     * @type {Array.<!string>}\n     * @const\n     */\n    LeafNode.VALUE_TYPE_ORDER = ['object', 'boolean', 'number', 'string'];\n    return LeafNode;\n}();\nexports.LeafNode = LeafNode;\n\n//# sourceMappingURL=LeafNode.js.map\n\n/***/ }),\n/* 38 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\n/**\n * An iterator over an LLRBNode.\n */\nvar SortedMapIterator = /** @class */function () {\n    /**\n     * @template K, V, T\n     * @param {LLRBNode|LLRBEmptyNode} node Node to iterate.\n     * @param {?K} startKey\n     * @param {function(K, K): number} comparator\n     * @param {boolean} isReverse_ Whether or not to iterate in reverse\n     * @param {(function(K, V):T)=} resultGenerator_\n     */\n    function SortedMapIterator(node, startKey, comparator, isReverse_, resultGenerator_) {\n        if (resultGenerator_ === void 0) {\n            resultGenerator_ = null;\n        }\n        this.isReverse_ = isReverse_;\n        this.resultGenerator_ = resultGenerator_;\n        /** @private\n         * @type {Array.<!LLRBNode>}\n         */\n        this.nodeStack_ = [];\n        var cmp = 1;\n        while (!node.isEmpty()) {\n            node = node;\n            cmp = startKey ? comparator(node.key, startKey) : 1;\n            // flip the comparison if we're going in reverse\n            if (isReverse_) cmp *= -1;\n            if (cmp < 0) {\n                // This node is less than our start key. ignore it\n                if (this.isReverse_) {\n                    node = node.left;\n                } else {\n                    node = node.right;\n                }\n            } else if (cmp === 0) {\n                // This node is exactly equal to our start key. Push it on the stack, but stop iterating;\n                this.nodeStack_.push(node);\n                break;\n            } else {\n                // This node is greater than our start key, add it to the stack and move to the next one\n                this.nodeStack_.push(node);\n                if (this.isReverse_) {\n                    node = node.right;\n                } else {\n                    node = node.left;\n                }\n            }\n        }\n    }\n    SortedMapIterator.prototype.getNext = function () {\n        if (this.nodeStack_.length === 0) return null;\n        var node = this.nodeStack_.pop();\n        var result;\n        if (this.resultGenerator_) result = this.resultGenerator_(node.key, node.value);else result = { key: node.key, value: node.value };\n        if (this.isReverse_) {\n            node = node.left;\n            while (!node.isEmpty()) {\n                this.nodeStack_.push(node);\n                node = node.right;\n            }\n        } else {\n            node = node.right;\n            while (!node.isEmpty()) {\n                this.nodeStack_.push(node);\n                node = node.left;\n            }\n        }\n        return result;\n    };\n    SortedMapIterator.prototype.hasNext = function () {\n        return this.nodeStack_.length > 0;\n    };\n    SortedMapIterator.prototype.peek = function () {\n        if (this.nodeStack_.length === 0) return null;\n        var node = this.nodeStack_[this.nodeStack_.length - 1];\n        if (this.resultGenerator_) {\n            return this.resultGenerator_(node.key, node.value);\n        } else {\n            return { key: node.key, value: node.value };\n        }\n    };\n    return SortedMapIterator;\n}();\nexports.SortedMapIterator = SortedMapIterator;\n/**\n * Represents a node in a Left-leaning Red-Black tree.\n */\nvar LLRBNode = /** @class */function () {\n    /**\n     * @template K, V\n     * @param {!K} key Key associated with this node.\n     * @param {!V} value Value associated with this node.\n     * @param {?boolean} color Whether this node is red.\n     * @param {?(LLRBNode|LLRBEmptyNode)=} left Left child.\n     * @param {?(LLRBNode|LLRBEmptyNode)=} right Right child.\n     */\n    function LLRBNode(key, value, color, left, right) {\n        this.key = key;\n        this.value = value;\n        this.color = color != null ? color : LLRBNode.RED;\n        this.left = left != null ? left : SortedMap.EMPTY_NODE;\n        this.right = right != null ? right : SortedMap.EMPTY_NODE;\n    }\n    /**\n     * Returns a copy of the current node, optionally replacing pieces of it.\n     *\n     * @param {?K} key New key for the node, or null.\n     * @param {?V} value New value for the node, or null.\n     * @param {?boolean} color New color for the node, or null.\n     * @param {?LLRBNode|LLRBEmptyNode} left New left child for the node, or null.\n     * @param {?LLRBNode|LLRBEmptyNode} right New right child for the node, or null.\n     * @return {!LLRBNode} The node copy.\n     */\n    LLRBNode.prototype.copy = function (key, value, color, left, right) {\n        return new LLRBNode(key != null ? key : this.key, value != null ? value : this.value, color != null ? color : this.color, left != null ? left : this.left, right != null ? right : this.right);\n    };\n    /**\n     * @return {number} The total number of nodes in the tree.\n     */\n    LLRBNode.prototype.count = function () {\n        return this.left.count() + 1 + this.right.count();\n    };\n    /**\n     * @return {boolean} True if the tree is empty.\n     */\n    LLRBNode.prototype.isEmpty = function () {\n        return false;\n    };\n    /**\n     * Traverses the tree in key order and calls the specified action function\n     * for each node.\n     *\n     * @param {function(!K, !V):*} action Callback function to be called for each\n     *   node.  If it returns true, traversal is aborted.\n     * @return {*} The first truthy value returned by action, or the last falsey\n     *   value returned by action\n     */\n    LLRBNode.prototype.inorderTraversal = function (action) {\n        return this.left.inorderTraversal(action) || action(this.key, this.value) || this.right.inorderTraversal(action);\n    };\n    /**\n     * Traverses the tree in reverse key order and calls the specified action function\n     * for each node.\n     *\n     * @param {function(!Object, !Object)} action Callback function to be called for each\n     * node.  If it returns true, traversal is aborted.\n     * @return {*} True if traversal was aborted.\n     */\n    LLRBNode.prototype.reverseTraversal = function (action) {\n        return this.right.reverseTraversal(action) || action(this.key, this.value) || this.left.reverseTraversal(action);\n    };\n    /**\n     * @return {!Object} The minimum node in the tree.\n     * @private\n     */\n    LLRBNode.prototype.min_ = function () {\n        if (this.left.isEmpty()) {\n            return this;\n        } else {\n            return this.left.min_();\n        }\n    };\n    /**\n     * @return {!K} The maximum key in the tree.\n     */\n    LLRBNode.prototype.minKey = function () {\n        return this.min_().key;\n    };\n    /**\n     * @return {!K} The maximum key in the tree.\n     */\n    LLRBNode.prototype.maxKey = function () {\n        if (this.right.isEmpty()) {\n            return this.key;\n        } else {\n            return this.right.maxKey();\n        }\n    };\n    /**\n     *\n     * @param {!Object} key Key to insert.\n     * @param {!Object} value Value to insert.\n     * @param {Comparator} comparator Comparator.\n     * @return {!LLRBNode} New tree, with the key/value added.\n     */\n    LLRBNode.prototype.insert = function (key, value, comparator) {\n        var cmp, n;\n        n = this;\n        cmp = comparator(key, n.key);\n        if (cmp < 0) {\n            n = n.copy(null, null, null, n.left.insert(key, value, comparator), null);\n        } else if (cmp === 0) {\n            n = n.copy(null, value, null, null, null);\n        } else {\n            n = n.copy(null, null, null, null, n.right.insert(key, value, comparator));\n        }\n        return n.fixUp_();\n    };\n    /**\n     * @private\n     * @return {!LLRBNode|LLRBEmptyNode} New tree, with the minimum key removed.\n     */\n    LLRBNode.prototype.removeMin_ = function () {\n        if (this.left.isEmpty()) {\n            return SortedMap.EMPTY_NODE;\n        }\n        var n = this;\n        if (!n.left.isRed_() && !n.left.left.isRed_()) n = n.moveRedLeft_();\n        n = n.copy(null, null, null, n.left.removeMin_(), null);\n        return n.fixUp_();\n    };\n    /**\n     * @param {!Object} key The key of the item to remove.\n     * @param {Comparator} comparator Comparator.\n     * @return {!LLRBNode|LLRBEmptyNode} New tree, with the specified item removed.\n     */\n    LLRBNode.prototype.remove = function (key, comparator) {\n        var n, smallest;\n        n = this;\n        if (comparator(key, n.key) < 0) {\n            if (!n.left.isEmpty() && !n.left.isRed_() && !n.left.left.isRed_()) {\n                n = n.moveRedLeft_();\n            }\n            n = n.copy(null, null, null, n.left.remove(key, comparator), null);\n        } else {\n            if (n.left.isRed_()) n = n.rotateRight_();\n            if (!n.right.isEmpty() && !n.right.isRed_() && !n.right.left.isRed_()) {\n                n = n.moveRedRight_();\n            }\n            if (comparator(key, n.key) === 0) {\n                if (n.right.isEmpty()) {\n                    return SortedMap.EMPTY_NODE;\n                } else {\n                    smallest = n.right.min_();\n                    n = n.copy(smallest.key, smallest.value, null, null, n.right.removeMin_());\n                }\n            }\n            n = n.copy(null, null, null, null, n.right.remove(key, comparator));\n        }\n        return n.fixUp_();\n    };\n    /**\n     * @private\n     * @return {boolean} Whether this is a RED node.\n     */\n    LLRBNode.prototype.isRed_ = function () {\n        return this.color;\n    };\n    /**\n     * @private\n     * @return {!LLRBNode} New tree after performing any needed rotations.\n     */\n    LLRBNode.prototype.fixUp_ = function () {\n        var n = this;\n        if (n.right.isRed_() && !n.left.isRed_()) n = n.rotateLeft_();\n        if (n.left.isRed_() && n.left.left.isRed_()) n = n.rotateRight_();\n        if (n.left.isRed_() && n.right.isRed_()) n = n.colorFlip_();\n        return n;\n    };\n    /**\n     * @private\n     * @return {!LLRBNode} New tree, after moveRedLeft.\n     */\n    LLRBNode.prototype.moveRedLeft_ = function () {\n        var n = this.colorFlip_();\n        if (n.right.left.isRed_()) {\n            n = n.copy(null, null, null, null, n.right.rotateRight_());\n            n = n.rotateLeft_();\n            n = n.colorFlip_();\n        }\n        return n;\n    };\n    /**\n     * @private\n     * @return {!LLRBNode} New tree, after moveRedRight.\n     */\n    LLRBNode.prototype.moveRedRight_ = function () {\n        var n = this.colorFlip_();\n        if (n.left.left.isRed_()) {\n            n = n.rotateRight_();\n            n = n.colorFlip_();\n        }\n        return n;\n    };\n    /**\n     * @private\n     * @return {!LLRBNode} New tree, after rotateLeft.\n     */\n    LLRBNode.prototype.rotateLeft_ = function () {\n        var nl = this.copy(null, null, LLRBNode.RED, null, this.right.left);\n        return this.right.copy(null, null, this.color, nl, null);\n    };\n    /**\n     * @private\n     * @return {!LLRBNode} New tree, after rotateRight.\n     */\n    LLRBNode.prototype.rotateRight_ = function () {\n        var nr = this.copy(null, null, LLRBNode.RED, this.left.right, null);\n        return this.left.copy(null, null, this.color, null, nr);\n    };\n    /**\n     * @private\n     * @return {!LLRBNode} New tree, after colorFlip.\n     */\n    LLRBNode.prototype.colorFlip_ = function () {\n        var left = this.left.copy(null, null, !this.left.color, null, null);\n        var right = this.right.copy(null, null, !this.right.color, null, null);\n        return this.copy(null, null, !this.color, left, right);\n    };\n    /**\n     * For testing.\n     *\n     * @private\n     * @return {boolean} True if all is well.\n     */\n    LLRBNode.prototype.checkMaxDepth_ = function () {\n        var blackDepth = this.check_();\n        return Math.pow(2.0, blackDepth) <= this.count() + 1;\n    };\n    /**\n     * @private\n     * @return {number} Not sure what this returns exactly. :-).\n     */\n    LLRBNode.prototype.check_ = function () {\n        var blackDepth;\n        if (this.isRed_() && this.left.isRed_()) {\n            throw new Error('Red node has red child(' + this.key + ',' + this.value + ')');\n        }\n        if (this.right.isRed_()) {\n            throw new Error('Right child of (' + this.key + ',' + this.value + ') is red');\n        }\n        blackDepth = this.left.check_();\n        if (blackDepth !== this.right.check_()) {\n            throw new Error('Black depths differ');\n        } else {\n            return blackDepth + (this.isRed_() ? 0 : 1);\n        }\n    };\n    LLRBNode.RED = true;\n    LLRBNode.BLACK = false;\n    return LLRBNode;\n}();\nexports.LLRBNode = LLRBNode;\n/**\n * Represents an empty node (a leaf node in the Red-Black Tree).\n */\nvar LLRBEmptyNode = /** @class */function () {\n    function LLRBEmptyNode() {}\n    /**\n     * Returns a copy of the current node.\n     *\n     * @return {!LLRBEmptyNode} The node copy.\n     */\n    LLRBEmptyNode.prototype.copy = function (key, value, color, left, right) {\n        return this;\n    };\n    /**\n     * Returns a copy of the tree, with the specified key/value added.\n     *\n     * @param {!K} key Key to be added.\n     * @param {!V} value Value to be added.\n     * @param {Comparator} comparator Comparator.\n     * @return {!LLRBNode} New tree, with item added.\n     */\n    LLRBEmptyNode.prototype.insert = function (key, value, comparator) {\n        return new LLRBNode(key, value, null);\n    };\n    /**\n     * Returns a copy of the tree, with the specified key removed.\n     *\n     * @param {!K} key The key to remove.\n     * @param {Comparator} comparator Comparator.\n     * @return {!LLRBEmptyNode} New tree, with item removed.\n     */\n    LLRBEmptyNode.prototype.remove = function (key, comparator) {\n        return this;\n    };\n    /**\n     * @return {number} The total number of nodes in the tree.\n     */\n    LLRBEmptyNode.prototype.count = function () {\n        return 0;\n    };\n    /**\n     * @return {boolean} True if the tree is empty.\n     */\n    LLRBEmptyNode.prototype.isEmpty = function () {\n        return true;\n    };\n    /**\n     * Traverses the tree in key order and calls the specified action function\n     * for each node.\n     *\n     * @param {function(!K, !V):*} action Callback function to be called for each\n     * node.  If it returns true, traversal is aborted.\n     * @return {boolean} True if traversal was aborted.\n     */\n    LLRBEmptyNode.prototype.inorderTraversal = function (action) {\n        return false;\n    };\n    /**\n     * Traverses the tree in reverse key order and calls the specified action function\n     * for each node.\n     *\n     * @param {function(!K, !V)} action Callback function to be called for each\n     * node.  If it returns true, traversal is aborted.\n     * @return {boolean} True if traversal was aborted.\n     */\n    LLRBEmptyNode.prototype.reverseTraversal = function (action) {\n        return false;\n    };\n    /**\n     * @return {null}\n     */\n    LLRBEmptyNode.prototype.minKey = function () {\n        return null;\n    };\n    /**\n     * @return {null}\n     */\n    LLRBEmptyNode.prototype.maxKey = function () {\n        return null;\n    };\n    /**\n     * @private\n     * @return {number} Not sure what this returns exactly. :-).\n     */\n    LLRBEmptyNode.prototype.check_ = function () {\n        return 0;\n    };\n    /**\n     * @private\n     * @return {boolean} Whether this node is red.\n     */\n    LLRBEmptyNode.prototype.isRed_ = function () {\n        return false;\n    };\n    return LLRBEmptyNode;\n}();\nexports.LLRBEmptyNode = LLRBEmptyNode;\n/**\n * An immutable sorted map implementation, based on a Left-leaning Red-Black\n * tree.\n */\nvar SortedMap = /** @class */function () {\n    /**\n     * @template K, V\n     * @param {function(K, K):number} comparator_ Key comparator.\n     * @param {LLRBNode=} root_ (Optional) Root node for the map.\n     */\n    function SortedMap(comparator_, root_) {\n        if (root_ === void 0) {\n            root_ = SortedMap.EMPTY_NODE;\n        }\n        this.comparator_ = comparator_;\n        this.root_ = root_;\n    }\n    /**\n     * Returns a copy of the map, with the specified key/value added or replaced.\n     * (TODO: We should perhaps rename this method to 'put')\n     *\n     * @param {!K} key Key to be added.\n     * @param {!V} value Value to be added.\n     * @return {!SortedMap.<K, V>} New map, with item added.\n     */\n    SortedMap.prototype.insert = function (key, value) {\n        return new SortedMap(this.comparator_, this.root_.insert(key, value, this.comparator_).copy(null, null, LLRBNode.BLACK, null, null));\n    };\n    /**\n     * Returns a copy of the map, with the specified key removed.\n     *\n     * @param {!K} key The key to remove.\n     * @return {!SortedMap.<K, V>} New map, with item removed.\n     */\n    SortedMap.prototype.remove = function (key) {\n        return new SortedMap(this.comparator_, this.root_.remove(key, this.comparator_).copy(null, null, LLRBNode.BLACK, null, null));\n    };\n    /**\n     * Returns the value of the node with the given key, or null.\n     *\n     * @param {!K} key The key to look up.\n     * @return {?V} The value of the node with the given key, or null if the\n     * key doesn't exist.\n     */\n    SortedMap.prototype.get = function (key) {\n        var cmp;\n        var node = this.root_;\n        while (!node.isEmpty()) {\n            cmp = this.comparator_(key, node.key);\n            if (cmp === 0) {\n                return node.value;\n            } else if (cmp < 0) {\n                node = node.left;\n            } else if (cmp > 0) {\n                node = node.right;\n            }\n        }\n        return null;\n    };\n    /**\n     * Returns the key of the item *before* the specified key, or null if key is the first item.\n     * @param {K} key The key to find the predecessor of\n     * @return {?K} The predecessor key.\n     */\n    SortedMap.prototype.getPredecessorKey = function (key) {\n        var cmp,\n            node = this.root_,\n            rightParent = null;\n        while (!node.isEmpty()) {\n            cmp = this.comparator_(key, node.key);\n            if (cmp === 0) {\n                if (!node.left.isEmpty()) {\n                    node = node.left;\n                    while (!node.right.isEmpty()) {\n                        node = node.right;\n                    }return node.key;\n                } else if (rightParent) {\n                    return rightParent.key;\n                } else {\n                    return null; // first item.\n                }\n            } else if (cmp < 0) {\n                node = node.left;\n            } else if (cmp > 0) {\n                rightParent = node;\n                node = node.right;\n            }\n        }\n        throw new Error('Attempted to find predecessor key for a nonexistent key.  What gives?');\n    };\n    /**\n     * @return {boolean} True if the map is empty.\n     */\n    SortedMap.prototype.isEmpty = function () {\n        return this.root_.isEmpty();\n    };\n    /**\n     * @return {number} The total number of nodes in the map.\n     */\n    SortedMap.prototype.count = function () {\n        return this.root_.count();\n    };\n    /**\n     * @return {?K} The minimum key in the map.\n     */\n    SortedMap.prototype.minKey = function () {\n        return this.root_.minKey();\n    };\n    /**\n     * @return {?K} The maximum key in the map.\n     */\n    SortedMap.prototype.maxKey = function () {\n        return this.root_.maxKey();\n    };\n    /**\n     * Traverses the map in key order and calls the specified action function\n     * for each key/value pair.\n     *\n     * @param {function(!K, !V):*} action Callback function to be called\n     * for each key/value pair.  If action returns true, traversal is aborted.\n     * @return {*} The first truthy value returned by action, or the last falsey\n     *   value returned by action\n     */\n    SortedMap.prototype.inorderTraversal = function (action) {\n        return this.root_.inorderTraversal(action);\n    };\n    /**\n     * Traverses the map in reverse key order and calls the specified action function\n     * for each key/value pair.\n     *\n     * @param {function(!Object, !Object)} action Callback function to be called\n     * for each key/value pair.  If action returns true, traversal is aborted.\n     * @return {*} True if the traversal was aborted.\n     */\n    SortedMap.prototype.reverseTraversal = function (action) {\n        return this.root_.reverseTraversal(action);\n    };\n    /**\n     * Returns an iterator over the SortedMap.\n     * @template T\n     * @param {(function(K, V):T)=} resultGenerator\n     * @return {SortedMapIterator.<K, V, T>} The iterator.\n     */\n    SortedMap.prototype.getIterator = function (resultGenerator) {\n        return new SortedMapIterator(this.root_, null, this.comparator_, false, resultGenerator);\n    };\n    SortedMap.prototype.getIteratorFrom = function (key, resultGenerator) {\n        return new SortedMapIterator(this.root_, key, this.comparator_, false, resultGenerator);\n    };\n    SortedMap.prototype.getReverseIteratorFrom = function (key, resultGenerator) {\n        return new SortedMapIterator(this.root_, key, this.comparator_, true, resultGenerator);\n    };\n    SortedMap.prototype.getReverseIterator = function (resultGenerator) {\n        return new SortedMapIterator(this.root_, null, this.comparator_, true, resultGenerator);\n    };\n    /**\n     * Always use the same empty node, to reduce memory.\n     * @const\n     */\n    SortedMap.EMPTY_NODE = new LLRBEmptyNode();\n    return SortedMap;\n}();\nexports.SortedMap = SortedMap;\n\n//# sourceMappingURL=SortedMap.js.map\n\n/***/ }),\n/* 39 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nvar _typeof = typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; };\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar ServerValues_1 = __webpack_require__(94);\nvar nodeFromJSON_1 = __webpack_require__(23);\nvar Path_1 = __webpack_require__(4);\nvar SparseSnapshotTree_1 = __webpack_require__(95);\nvar SyncTree_1 = __webpack_require__(164);\nvar SnapshotHolder_1 = __webpack_require__(175);\nvar util_1 = __webpack_require__(0);\nvar util_2 = __webpack_require__(2);\nvar util_3 = __webpack_require__(0);\nvar AuthTokenProvider_1 = __webpack_require__(176);\nvar StatsManager_1 = __webpack_require__(73);\nvar StatsReporter_1 = __webpack_require__(178);\nvar StatsListener_1 = __webpack_require__(100);\nvar EventQueue_1 = __webpack_require__(179);\nvar PersistentConnection_1 = __webpack_require__(101);\nvar ReadonlyRestClient_1 = __webpack_require__(184);\nvar Database_1 = __webpack_require__(83);\nvar INTERRUPT_REASON = 'repo_interrupt';\n/**\n * A connection to a single data repository.\n */\nvar Repo = /** @class */function () {\n    /**\n     * @param {!RepoInfo} repoInfo_\n     * @param {boolean} forceRestClient\n     * @param {!FirebaseApp} app\n     */\n    function Repo(repoInfo_, forceRestClient, app) {\n        var _this = this;\n        this.repoInfo_ = repoInfo_;\n        this.app = app;\n        this.dataUpdateCount = 0;\n        this.statsListener_ = null;\n        this.eventQueue_ = new EventQueue_1.EventQueue();\n        this.nextWriteId_ = 1;\n        this.interceptServerDataCallback_ = null;\n        // A list of data pieces and paths to be set when this client disconnects.\n        this.onDisconnect_ = new SparseSnapshotTree_1.SparseSnapshotTree();\n        /**\n         * TODO: This should be @private but it's used by test_access.js and internal.js\n         * @type {?PersistentConnection}\n         */\n        this.persistentConnection_ = null;\n        /** @type {!AuthTokenProvider} */\n        var authTokenProvider = new AuthTokenProvider_1.AuthTokenProvider(app);\n        this.stats_ = StatsManager_1.StatsManager.getCollection(repoInfo_);\n        if (forceRestClient || util_2.beingCrawled()) {\n            this.server_ = new ReadonlyRestClient_1.ReadonlyRestClient(this.repoInfo_, this.onDataUpdate_.bind(this), authTokenProvider);\n            // Minor hack: Fire onConnect immediately, since there's no actual connection.\n            setTimeout(this.onConnectStatus_.bind(this, true), 0);\n        } else {\n            var authOverride = app.options['databaseAuthVariableOverride'];\n            // Validate authOverride\n            if (typeof authOverride !== 'undefined' && authOverride !== null) {\n                if ((typeof authOverride === \"undefined\" ? \"undefined\" : _typeof(authOverride)) !== 'object') {\n                    throw new Error('Only objects are supported for option databaseAuthVariableOverride');\n                }\n                try {\n                    util_1.stringify(authOverride);\n                } catch (e) {\n                    throw new Error('Invalid authOverride provided: ' + e);\n                }\n            }\n            this.persistentConnection_ = new PersistentConnection_1.PersistentConnection(this.repoInfo_, this.onDataUpdate_.bind(this), this.onConnectStatus_.bind(this), this.onServerInfoUpdate_.bind(this), authTokenProvider, authOverride);\n            this.server_ = this.persistentConnection_;\n        }\n        authTokenProvider.addTokenChangeListener(function (token) {\n            _this.server_.refreshAuthToken(token);\n        });\n        // In the case of multiple Repos for the same repoInfo (i.e. there are multiple Firebase.Contexts being used),\n        // we only want to create one StatsReporter.  As such, we'll report stats over the first Repo created.\n        this.statsReporter_ = StatsManager_1.StatsManager.getOrCreateReporter(repoInfo_, function () {\n            return new StatsReporter_1.StatsReporter(_this.stats_, _this.server_);\n        });\n        this.transactions_init_();\n        // Used for .info.\n        this.infoData_ = new SnapshotHolder_1.SnapshotHolder();\n        this.infoSyncTree_ = new SyncTree_1.SyncTree({\n            startListening: function startListening(query, tag, currentHashFn, onComplete) {\n                var infoEvents = [];\n                var node = _this.infoData_.getNode(query.path);\n                // This is possibly a hack, but we have different semantics for .info endpoints. We don't raise null events\n                // on initial data...\n                if (!node.isEmpty()) {\n                    infoEvents = _this.infoSyncTree_.applyServerOverwrite(query.path, node);\n                    setTimeout(function () {\n                        onComplete('ok');\n                    }, 0);\n                }\n                return infoEvents;\n            },\n            stopListening: function stopListening() {}\n        });\n        this.updateInfo_('connected', false);\n        this.serverSyncTree_ = new SyncTree_1.SyncTree({\n            startListening: function startListening(query, tag, currentHashFn, onComplete) {\n                _this.server_.listen(query, currentHashFn, tag, function (status, data) {\n                    var events = onComplete(status, data);\n                    _this.eventQueue_.raiseEventsForChangedPath(query.path, events);\n                });\n                // No synchronous events for network-backed sync trees\n                return [];\n            },\n            stopListening: function stopListening(query, tag) {\n                _this.server_.unlisten(query, tag);\n            }\n        });\n    }\n    /**\n     * @return {string}  The URL corresponding to the root of this Firebase.\n     */\n    Repo.prototype.toString = function () {\n        return (this.repoInfo_.secure ? 'https://' : 'http://') + this.repoInfo_.host;\n    };\n    /**\n     * @return {!string} The namespace represented by the repo.\n     */\n    Repo.prototype.name = function () {\n        return this.repoInfo_.namespace;\n    };\n    /**\n     * @return {!number} The time in milliseconds, taking the server offset into account if we have one.\n     */\n    Repo.prototype.serverTime = function () {\n        var offsetNode = this.infoData_.getNode(new Path_1.Path('.info/serverTimeOffset'));\n        var offset = offsetNode.val() || 0;\n        return new Date().getTime() + offset;\n    };\n    /**\n     * Generate ServerValues using some variables from the repo object.\n     * @return {!Object}\n     */\n    Repo.prototype.generateServerValues = function () {\n        return ServerValues_1.generateWithValues({\n            timestamp: this.serverTime()\n        });\n    };\n    /**\n     * Called by realtime when we get new messages from the server.\n     *\n     * @private\n     * @param {string} pathString\n     * @param {*} data\n     * @param {boolean} isMerge\n     * @param {?number} tag\n     */\n    Repo.prototype.onDataUpdate_ = function (pathString, data, isMerge, tag) {\n        // For testing.\n        this.dataUpdateCount++;\n        var path = new Path_1.Path(pathString);\n        data = this.interceptServerDataCallback_ ? this.interceptServerDataCallback_(pathString, data) : data;\n        var events = [];\n        if (tag) {\n            if (isMerge) {\n                var taggedChildren = util_3.map(data, function (raw) {\n                    return nodeFromJSON_1.nodeFromJSON(raw);\n                });\n                events = this.serverSyncTree_.applyTaggedQueryMerge(path, taggedChildren, tag);\n            } else {\n                var taggedSnap = nodeFromJSON_1.nodeFromJSON(data);\n                events = this.serverSyncTree_.applyTaggedQueryOverwrite(path, taggedSnap, tag);\n            }\n        } else if (isMerge) {\n            var changedChildren = util_3.map(data, function (raw) {\n                return nodeFromJSON_1.nodeFromJSON(raw);\n            });\n            events = this.serverSyncTree_.applyServerMerge(path, changedChildren);\n        } else {\n            var snap = nodeFromJSON_1.nodeFromJSON(data);\n            events = this.serverSyncTree_.applyServerOverwrite(path, snap);\n        }\n        var affectedPath = path;\n        if (events.length > 0) {\n            // Since we have a listener outstanding for each transaction, receiving any events\n            // is a proxy for some change having occurred.\n            affectedPath = this.rerunTransactions_(path);\n        }\n        this.eventQueue_.raiseEventsForChangedPath(affectedPath, events);\n    };\n    /**\n     * TODO: This should be @private but it's used by test_access.js and internal.js\n     * @param {?function(!string, *):*} callback\n     * @private\n     */\n    Repo.prototype.interceptServerData_ = function (callback) {\n        this.interceptServerDataCallback_ = callback;\n    };\n    /**\n     * @param {!boolean} connectStatus\n     * @private\n     */\n    Repo.prototype.onConnectStatus_ = function (connectStatus) {\n        this.updateInfo_('connected', connectStatus);\n        if (connectStatus === false) {\n            this.runOnDisconnectEvents_();\n        }\n    };\n    /**\n     * @param {!Object} updates\n     * @private\n     */\n    Repo.prototype.onServerInfoUpdate_ = function (updates) {\n        var _this = this;\n        util_2.each(updates, function (value, key) {\n            _this.updateInfo_(key, value);\n        });\n    };\n    /**\n     *\n     * @param {!string} pathString\n     * @param {*} value\n     * @private\n     */\n    Repo.prototype.updateInfo_ = function (pathString, value) {\n        var path = new Path_1.Path('/.info/' + pathString);\n        var newNode = nodeFromJSON_1.nodeFromJSON(value);\n        this.infoData_.updateSnapshot(path, newNode);\n        var events = this.infoSyncTree_.applyServerOverwrite(path, newNode);\n        this.eventQueue_.raiseEventsForChangedPath(path, events);\n    };\n    /**\n     * @return {!number}\n     * @private\n     */\n    Repo.prototype.getNextWriteId_ = function () {\n        return this.nextWriteId_++;\n    };\n    /**\n     * @param {!Path} path\n     * @param {*} newVal\n     * @param {number|string|null} newPriority\n     * @param {?function(?Error, *=)} onComplete\n     */\n    Repo.prototype.setWithPriority = function (path, newVal, newPriority, onComplete) {\n        var _this = this;\n        this.log_('set', {\n            path: path.toString(),\n            value: newVal,\n            priority: newPriority\n        });\n        // TODO: Optimize this behavior to either (a) store flag to skip resolving where possible and / or\n        // (b) store unresolved paths on JSON parse\n        var serverValues = this.generateServerValues();\n        var newNodeUnresolved = nodeFromJSON_1.nodeFromJSON(newVal, newPriority);\n        var newNode = ServerValues_1.resolveDeferredValueSnapshot(newNodeUnresolved, serverValues);\n        var writeId = this.getNextWriteId_();\n        var events = this.serverSyncTree_.applyUserOverwrite(path, newNode, writeId, true);\n        this.eventQueue_.queueEvents(events);\n        this.server_.put(path.toString(), newNodeUnresolved.val( /*export=*/true), function (status, errorReason) {\n            var success = status === 'ok';\n            if (!success) {\n                util_2.warn('set at ' + path + ' failed: ' + status);\n            }\n            var clearEvents = _this.serverSyncTree_.ackUserWrite(writeId, !success);\n            _this.eventQueue_.raiseEventsForChangedPath(path, clearEvents);\n            _this.callOnCompleteCallback(onComplete, status, errorReason);\n        });\n        var affectedPath = this.abortTransactions_(path);\n        this.rerunTransactions_(affectedPath);\n        // We queued the events above, so just flush the queue here\n        this.eventQueue_.raiseEventsForChangedPath(affectedPath, []);\n    };\n    /**\n     * @param {!Path} path\n     * @param {!Object} childrenToMerge\n     * @param {?function(?Error, *=)} onComplete\n     */\n    Repo.prototype.update = function (path, childrenToMerge, onComplete) {\n        var _this = this;\n        this.log_('update', { path: path.toString(), value: childrenToMerge });\n        // Start with our existing data and merge each child into it.\n        var empty = true;\n        var serverValues = this.generateServerValues();\n        var changedChildren = {};\n        util_3.forEach(childrenToMerge, function (changedKey, changedValue) {\n            empty = false;\n            var newNodeUnresolved = nodeFromJSON_1.nodeFromJSON(changedValue);\n            changedChildren[changedKey] = ServerValues_1.resolveDeferredValueSnapshot(newNodeUnresolved, serverValues);\n        });\n        if (!empty) {\n            var writeId_1 = this.getNextWriteId_();\n            var events = this.serverSyncTree_.applyUserMerge(path, changedChildren, writeId_1);\n            this.eventQueue_.queueEvents(events);\n            this.server_.merge(path.toString(), childrenToMerge, function (status, errorReason) {\n                var success = status === 'ok';\n                if (!success) {\n                    util_2.warn('update at ' + path + ' failed: ' + status);\n                }\n                var clearEvents = _this.serverSyncTree_.ackUserWrite(writeId_1, !success);\n                var affectedPath = clearEvents.length > 0 ? _this.rerunTransactions_(path) : path;\n                _this.eventQueue_.raiseEventsForChangedPath(affectedPath, clearEvents);\n                _this.callOnCompleteCallback(onComplete, status, errorReason);\n            });\n            util_3.forEach(childrenToMerge, function (changedPath) {\n                var affectedPath = _this.abortTransactions_(path.child(changedPath));\n                _this.rerunTransactions_(affectedPath);\n            });\n            // We queued the events above, so just flush the queue here\n            this.eventQueue_.raiseEventsForChangedPath(path, []);\n        } else {\n            util_2.log(\"update() called with empty data.  Don't do anything.\");\n            this.callOnCompleteCallback(onComplete, 'ok');\n        }\n    };\n    /**\n     * Applies all of the changes stored up in the onDisconnect_ tree.\n     * @private\n     */\n    Repo.prototype.runOnDisconnectEvents_ = function () {\n        var _this = this;\n        this.log_('onDisconnectEvents');\n        var serverValues = this.generateServerValues();\n        var resolvedOnDisconnectTree = ServerValues_1.resolveDeferredValueTree(this.onDisconnect_, serverValues);\n        var events = [];\n        resolvedOnDisconnectTree.forEachTree(Path_1.Path.Empty, function (path, snap) {\n            events = events.concat(_this.serverSyncTree_.applyServerOverwrite(path, snap));\n            var affectedPath = _this.abortTransactions_(path);\n            _this.rerunTransactions_(affectedPath);\n        });\n        this.onDisconnect_ = new SparseSnapshotTree_1.SparseSnapshotTree();\n        this.eventQueue_.raiseEventsForChangedPath(Path_1.Path.Empty, events);\n    };\n    /**\n     * @param {!Path} path\n     * @param {?function(?Error, *=)} onComplete\n     */\n    Repo.prototype.onDisconnectCancel = function (path, onComplete) {\n        var _this = this;\n        this.server_.onDisconnectCancel(path.toString(), function (status, errorReason) {\n            if (status === 'ok') {\n                _this.onDisconnect_.forget(path);\n            }\n            _this.callOnCompleteCallback(onComplete, status, errorReason);\n        });\n    };\n    /**\n     * @param {!Path} path\n     * @param {*} value\n     * @param {?function(?Error, *=)} onComplete\n     */\n    Repo.prototype.onDisconnectSet = function (path, value, onComplete) {\n        var _this = this;\n        var newNode = nodeFromJSON_1.nodeFromJSON(value);\n        this.server_.onDisconnectPut(path.toString(), newNode.val( /*export=*/true), function (status, errorReason) {\n            if (status === 'ok') {\n                _this.onDisconnect_.remember(path, newNode);\n            }\n            _this.callOnCompleteCallback(onComplete, status, errorReason);\n        });\n    };\n    /**\n     * @param {!Path} path\n     * @param {*} value\n     * @param {*} priority\n     * @param {?function(?Error, *=)} onComplete\n     */\n    Repo.prototype.onDisconnectSetWithPriority = function (path, value, priority, onComplete) {\n        var _this = this;\n        var newNode = nodeFromJSON_1.nodeFromJSON(value, priority);\n        this.server_.onDisconnectPut(path.toString(), newNode.val( /*export=*/true), function (status, errorReason) {\n            if (status === 'ok') {\n                _this.onDisconnect_.remember(path, newNode);\n            }\n            _this.callOnCompleteCallback(onComplete, status, errorReason);\n        });\n    };\n    /**\n     * @param {!Path} path\n     * @param {*} childrenToMerge\n     * @param {?function(?Error, *=)} onComplete\n     */\n    Repo.prototype.onDisconnectUpdate = function (path, childrenToMerge, onComplete) {\n        var _this = this;\n        if (util_3.isEmpty(childrenToMerge)) {\n            util_2.log(\"onDisconnect().update() called with empty data.  Don't do anything.\");\n            this.callOnCompleteCallback(onComplete, 'ok');\n            return;\n        }\n        this.server_.onDisconnectMerge(path.toString(), childrenToMerge, function (status, errorReason) {\n            if (status === 'ok') {\n                util_3.forEach(childrenToMerge, function (childName, childNode) {\n                    var newChildNode = nodeFromJSON_1.nodeFromJSON(childNode);\n                    _this.onDisconnect_.remember(path.child(childName), newChildNode);\n                });\n            }\n            _this.callOnCompleteCallback(onComplete, status, errorReason);\n        });\n    };\n    /**\n     * @param {!Query} query\n     * @param {!EventRegistration} eventRegistration\n     */\n    Repo.prototype.addEventCallbackForQuery = function (query, eventRegistration) {\n        var events;\n        if (query.path.getFront() === '.info') {\n            events = this.infoSyncTree_.addEventRegistration(query, eventRegistration);\n        } else {\n            events = this.serverSyncTree_.addEventRegistration(query, eventRegistration);\n        }\n        this.eventQueue_.raiseEventsAtPath(query.path, events);\n    };\n    /**\n     * @param {!Query} query\n     * @param {?EventRegistration} eventRegistration\n     */\n    Repo.prototype.removeEventCallbackForQuery = function (query, eventRegistration) {\n        // These are guaranteed not to raise events, since we're not passing in a cancelError. However, we can future-proof\n        // a little bit by handling the return values anyways.\n        var events;\n        if (query.path.getFront() === '.info') {\n            events = this.infoSyncTree_.removeEventRegistration(query, eventRegistration);\n        } else {\n            events = this.serverSyncTree_.removeEventRegistration(query, eventRegistration);\n        }\n        this.eventQueue_.raiseEventsAtPath(query.path, events);\n    };\n    Repo.prototype.interrupt = function () {\n        if (this.persistentConnection_) {\n            this.persistentConnection_.interrupt(INTERRUPT_REASON);\n        }\n    };\n    Repo.prototype.resume = function () {\n        if (this.persistentConnection_) {\n            this.persistentConnection_.resume(INTERRUPT_REASON);\n        }\n    };\n    Repo.prototype.stats = function (showDelta) {\n        if (showDelta === void 0) {\n            showDelta = false;\n        }\n        if (typeof console === 'undefined') return;\n        var stats;\n        if (showDelta) {\n            if (!this.statsListener_) this.statsListener_ = new StatsListener_1.StatsListener(this.stats_);\n            stats = this.statsListener_.get();\n        } else {\n            stats = this.stats_.get();\n        }\n        var longestName = Object.keys(stats).reduce(function (previousValue, currentValue) {\n            return Math.max(currentValue.length, previousValue);\n        }, 0);\n        util_3.forEach(stats, function (stat, value) {\n            // pad stat names to be the same length (plus 2 extra spaces).\n            for (var i = stat.length; i < longestName + 2; i++) {\n                stat += ' ';\n            }console.log(stat + value);\n        });\n    };\n    Repo.prototype.statsIncrementCounter = function (metric) {\n        this.stats_.incrementCounter(metric);\n        this.statsReporter_.includeStat(metric);\n    };\n    /**\n     * @param {...*} var_args\n     * @private\n     */\n    Repo.prototype.log_ = function () {\n        var var_args = [];\n        for (var _i = 0; _i < arguments.length; _i++) {\n            var_args[_i] = arguments[_i];\n        }\n        var prefix = '';\n        if (this.persistentConnection_) {\n            prefix = this.persistentConnection_.id + ':';\n        }\n        util_2.log.apply(void 0, [prefix].concat(var_args));\n    };\n    /**\n     * @param {?function(?Error, *=)} callback\n     * @param {!string} status\n     * @param {?string=} errorReason\n     */\n    Repo.prototype.callOnCompleteCallback = function (callback, status, errorReason) {\n        if (callback) {\n            util_2.exceptionGuard(function () {\n                if (status == 'ok') {\n                    callback(null);\n                } else {\n                    var code = (status || 'error').toUpperCase();\n                    var message = code;\n                    if (errorReason) message += ': ' + errorReason;\n                    var error = new Error(message);\n                    error.code = code;\n                    callback(error);\n                }\n            });\n        }\n    };\n    Object.defineProperty(Repo.prototype, \"database\", {\n        get: function get() {\n            return this.__database || (this.__database = new Database_1.Database(this));\n        },\n        enumerable: true,\n        configurable: true\n    });\n    return Repo;\n}();\nexports.Repo = Repo;\n\n//# sourceMappingURL=Repo.js.map\n\n/***/ }),\n/* 40 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\n/**\n * A cache node only stores complete children. Additionally it holds a flag whether the node can be considered fully\n * initialized in the sense that we know at one point in time this represented a valid state of the world, e.g.\n * initialized with data from the server, or a complete overwrite by the client. The filtered flag also tracks\n * whether a node potentially had children removed due to a filter.\n */\nvar CacheNode = /** @class */function () {\n  /**\n   * @param {!Node} node_\n   * @param {boolean} fullyInitialized_\n   * @param {boolean} filtered_\n   */\n  function CacheNode(node_, fullyInitialized_, filtered_) {\n    this.node_ = node_;\n    this.fullyInitialized_ = fullyInitialized_;\n    this.filtered_ = filtered_;\n  }\n  /**\n   * Returns whether this node was fully initialized with either server data or a complete overwrite by the client\n   * @return {boolean}\n   */\n  CacheNode.prototype.isFullyInitialized = function () {\n    return this.fullyInitialized_;\n  };\n  /**\n   * Returns whether this node is potentially missing children due to a filter applied to the node\n   * @return {boolean}\n   */\n  CacheNode.prototype.isFiltered = function () {\n    return this.filtered_;\n  };\n  /**\n   * @param {!Path} path\n   * @return {boolean}\n   */\n  CacheNode.prototype.isCompleteForPath = function (path) {\n    if (path.isEmpty()) {\n      return this.isFullyInitialized() && !this.filtered_;\n    }\n    var childKey = path.getFront();\n    return this.isCompleteForChild(childKey);\n  };\n  /**\n   * @param {!string} key\n   * @return {boolean}\n   */\n  CacheNode.prototype.isCompleteForChild = function (key) {\n    return this.isFullyInitialized() && !this.filtered_ || this.node_.hasChild(key);\n  };\n  /**\n   * @return {!Node}\n   */\n  CacheNode.prototype.getNode = function () {\n    return this.node_;\n  };\n  return CacheNode;\n}();\nexports.CacheNode = CacheNode;\n\n//# sourceMappingURL=CacheNode.js.map\n\n/***/ }),\n/* 41 */,\n/* 42 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n/* WEBPACK VAR INJECTION */(function(module) {\n\nvar _typeof = typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; };\n\n/**\n * Copyright (c) 2014, Facebook, Inc.\n * All rights reserved.\n *\n * This source code is licensed under the BSD-style license found in the\n * https://raw.github.com/facebook/regenerator/master/LICENSE file. An\n * additional grant of patent rights can be found in the PATENTS file in\n * the same directory.\n */\n\n!function (global) {\n  \"use strict\";\n\n  var Op = Object.prototype;\n  var hasOwn = Op.hasOwnProperty;\n  var undefined; // More compressible than void 0.\n  var $Symbol = typeof Symbol === \"function\" ? Symbol : {};\n  var iteratorSymbol = $Symbol.iterator || \"@@iterator\";\n  var asyncIteratorSymbol = $Symbol.asyncIterator || \"@@asyncIterator\";\n  var toStringTagSymbol = $Symbol.toStringTag || \"@@toStringTag\";\n\n  var inModule = ( false ? \"undefined\" : _typeof(module)) === \"object\";\n  var runtime = global.regeneratorRuntime;\n  if (runtime) {\n    if (inModule) {\n      // If regeneratorRuntime is defined globally and we're in a module,\n      // make the exports object identical to regeneratorRuntime.\n      module.exports = runtime;\n    }\n    // Don't bother evaluating the rest of this file if the runtime was\n    // already defined globally.\n    return;\n  }\n\n  // Define the runtime globally (as expected by generated code) as either\n  // module.exports (if we're in a module) or a new, empty object.\n  runtime = global.regeneratorRuntime = inModule ? module.exports : {};\n\n  function wrap(innerFn, outerFn, self, tryLocsList) {\n    // If outerFn provided and outerFn.prototype is a Generator, then outerFn.prototype instanceof Generator.\n    var protoGenerator = outerFn && outerFn.prototype instanceof Generator ? outerFn : Generator;\n    var generator = Object.create(protoGenerator.prototype);\n    var context = new Context(tryLocsList || []);\n\n    // The ._invoke method unifies the implementations of the .next,\n    // .throw, and .return methods.\n    generator._invoke = makeInvokeMethod(innerFn, self, context);\n\n    return generator;\n  }\n  runtime.wrap = wrap;\n\n  // Try/catch helper to minimize deoptimizations. Returns a completion\n  // record like context.tryEntries[i].completion. This interface could\n  // have been (and was previously) designed to take a closure to be\n  // invoked without arguments, but in all the cases we care about we\n  // already have an existing method we want to call, so there's no need\n  // to create a new function object. We can even get away with assuming\n  // the method takes exactly one argument, since that happens to be true\n  // in every case, so we don't have to touch the arguments object. The\n  // only additional allocation required is the completion record, which\n  // has a stable shape and so hopefully should be cheap to allocate.\n  function tryCatch(fn, obj, arg) {\n    try {\n      return { type: \"normal\", arg: fn.call(obj, arg) };\n    } catch (err) {\n      return { type: \"throw\", arg: err };\n    }\n  }\n\n  var GenStateSuspendedStart = \"suspendedStart\";\n  var GenStateSuspendedYield = \"suspendedYield\";\n  var GenStateExecuting = \"executing\";\n  var GenStateCompleted = \"completed\";\n\n  // Returning this object from the innerFn has the same effect as\n  // breaking out of the dispatch switch statement.\n  var ContinueSentinel = {};\n\n  // Dummy constructor functions that we use as the .constructor and\n  // .constructor.prototype properties for functions that return Generator\n  // objects. For full spec compliance, you may wish to configure your\n  // minifier not to mangle the names of these two functions.\n  function Generator() {}\n  function GeneratorFunction() {}\n  function GeneratorFunctionPrototype() {}\n\n  // This is a polyfill for %IteratorPrototype% for environments that\n  // don't natively support it.\n  var IteratorPrototype = {};\n  IteratorPrototype[iteratorSymbol] = function () {\n    return this;\n  };\n\n  var getProto = Object.getPrototypeOf;\n  var NativeIteratorPrototype = getProto && getProto(getProto(values([])));\n  if (NativeIteratorPrototype && NativeIteratorPrototype !== Op && hasOwn.call(NativeIteratorPrototype, iteratorSymbol)) {\n    // This environment has a native %IteratorPrototype%; use it instead\n    // of the polyfill.\n    IteratorPrototype = NativeIteratorPrototype;\n  }\n\n  var Gp = GeneratorFunctionPrototype.prototype = Generator.prototype = Object.create(IteratorPrototype);\n  GeneratorFunction.prototype = Gp.constructor = GeneratorFunctionPrototype;\n  GeneratorFunctionPrototype.constructor = GeneratorFunction;\n  GeneratorFunctionPrototype[toStringTagSymbol] = GeneratorFunction.displayName = \"GeneratorFunction\";\n\n  // Helper for defining the .next, .throw, and .return methods of the\n  // Iterator interface in terms of a single ._invoke method.\n  function defineIteratorMethods(prototype) {\n    [\"next\", \"throw\", \"return\"].forEach(function (method) {\n      prototype[method] = function (arg) {\n        return this._invoke(method, arg);\n      };\n    });\n  }\n\n  runtime.isGeneratorFunction = function (genFun) {\n    var ctor = typeof genFun === \"function\" && genFun.constructor;\n    return ctor ? ctor === GeneratorFunction ||\n    // For the native GeneratorFunction constructor, the best we can\n    // do is to check its .name property.\n    (ctor.displayName || ctor.name) === \"GeneratorFunction\" : false;\n  };\n\n  runtime.mark = function (genFun) {\n    if (Object.setPrototypeOf) {\n      Object.setPrototypeOf(genFun, GeneratorFunctionPrototype);\n    } else {\n      genFun.__proto__ = GeneratorFunctionPrototype;\n      if (!(toStringTagSymbol in genFun)) {\n        genFun[toStringTagSymbol] = \"GeneratorFunction\";\n      }\n    }\n    genFun.prototype = Object.create(Gp);\n    return genFun;\n  };\n\n  // Within the body of any async function, `await x` is transformed to\n  // `yield regeneratorRuntime.awrap(x)`, so that the runtime can test\n  // `hasOwn.call(value, \"__await\")` to determine if the yielded value is\n  // meant to be awaited.\n  runtime.awrap = function (arg) {\n    return { __await: arg };\n  };\n\n  function AsyncIterator(generator) {\n    function invoke(method, arg, resolve, reject) {\n      var record = tryCatch(generator[method], generator, arg);\n      if (record.type === \"throw\") {\n        reject(record.arg);\n      } else {\n        var result = record.arg;\n        var value = result.value;\n        if (value && (typeof value === \"undefined\" ? \"undefined\" : _typeof(value)) === \"object\" && hasOwn.call(value, \"__await\")) {\n          return Promise.resolve(value.__await).then(function (value) {\n            invoke(\"next\", value, resolve, reject);\n          }, function (err) {\n            invoke(\"throw\", err, resolve, reject);\n          });\n        }\n\n        return Promise.resolve(value).then(function (unwrapped) {\n          // When a yielded Promise is resolved, its final value becomes\n          // the .value of the Promise<{value,done}> result for the\n          // current iteration. If the Promise is rejected, however, the\n          // result for this iteration will be rejected with the same\n          // reason. Note that rejections of yielded Promises are not\n          // thrown back into the generator function, as is the case\n          // when an awaited Promise is rejected. This difference in\n          // behavior between yield and await is important, because it\n          // allows the consumer to decide what to do with the yielded\n          // rejection (swallow it and continue, manually .throw it back\n          // into the generator, abandon iteration, whatever). With\n          // await, by contrast, there is no opportunity to examine the\n          // rejection reason outside the generator function, so the\n          // only option is to throw it from the await expression, and\n          // let the generator function handle the exception.\n          result.value = unwrapped;\n          resolve(result);\n        }, reject);\n      }\n    }\n\n    var previousPromise;\n\n    function enqueue(method, arg) {\n      function callInvokeWithMethodAndArg() {\n        return new Promise(function (resolve, reject) {\n          invoke(method, arg, resolve, reject);\n        });\n      }\n\n      return previousPromise =\n      // If enqueue has been called before, then we want to wait until\n      // all previous Promises have been resolved before calling invoke,\n      // so that results are always delivered in the correct order. If\n      // enqueue has not been called before, then it is important to\n      // call invoke immediately, without waiting on a callback to fire,\n      // so that the async generator function has the opportunity to do\n      // any necessary setup in a predictable way. This predictability\n      // is why the Promise constructor synchronously invokes its\n      // executor callback, and why async functions synchronously\n      // execute code before the first await. Since we implement simple\n      // async functions in terms of async generators, it is especially\n      // important to get this right, even though it requires care.\n      previousPromise ? previousPromise.then(callInvokeWithMethodAndArg,\n      // Avoid propagating failures to Promises returned by later\n      // invocations of the iterator.\n      callInvokeWithMethodAndArg) : callInvokeWithMethodAndArg();\n    }\n\n    // Define the unified helper method that is used to implement .next,\n    // .throw, and .return (see defineIteratorMethods).\n    this._invoke = enqueue;\n  }\n\n  defineIteratorMethods(AsyncIterator.prototype);\n  AsyncIterator.prototype[asyncIteratorSymbol] = function () {\n    return this;\n  };\n  runtime.AsyncIterator = AsyncIterator;\n\n  // Note that simple async functions are implemented on top of\n  // AsyncIterator objects; they just return a Promise for the value of\n  // the final result produced by the iterator.\n  runtime.async = function (innerFn, outerFn, self, tryLocsList) {\n    var iter = new AsyncIterator(wrap(innerFn, outerFn, self, tryLocsList));\n\n    return runtime.isGeneratorFunction(outerFn) ? iter // If outerFn is a generator, return the full iterator.\n    : iter.next().then(function (result) {\n      return result.done ? result.value : iter.next();\n    });\n  };\n\n  function makeInvokeMethod(innerFn, self, context) {\n    var state = GenStateSuspendedStart;\n\n    return function invoke(method, arg) {\n      if (state === GenStateExecuting) {\n        throw new Error(\"Generator is already running\");\n      }\n\n      if (state === GenStateCompleted) {\n        if (method === \"throw\") {\n          throw arg;\n        }\n\n        // Be forgiving, per 25.3.3.3.3 of the spec:\n        // https://people.mozilla.org/~jorendorff/es6-draft.html#sec-generatorresume\n        return doneResult();\n      }\n\n      context.method = method;\n      context.arg = arg;\n\n      while (true) {\n        var delegate = context.delegate;\n        if (delegate) {\n          var delegateResult = maybeInvokeDelegate(delegate, context);\n          if (delegateResult) {\n            if (delegateResult === ContinueSentinel) continue;\n            return delegateResult;\n          }\n        }\n\n        if (context.method === \"next\") {\n          // Setting context._sent for legacy support of Babel's\n          // function.sent implementation.\n          context.sent = context._sent = context.arg;\n        } else if (context.method === \"throw\") {\n          if (state === GenStateSuspendedStart) {\n            state = GenStateCompleted;\n            throw context.arg;\n          }\n\n          context.dispatchException(context.arg);\n        } else if (context.method === \"return\") {\n          context.abrupt(\"return\", context.arg);\n        }\n\n        state = GenStateExecuting;\n\n        var record = tryCatch(innerFn, self, context);\n        if (record.type === \"normal\") {\n          // If an exception is thrown from innerFn, we leave state ===\n          // GenStateExecuting and loop back for another invocation.\n          state = context.done ? GenStateCompleted : GenStateSuspendedYield;\n\n          if (record.arg === ContinueSentinel) {\n            continue;\n          }\n\n          return {\n            value: record.arg,\n            done: context.done\n          };\n        } else if (record.type === \"throw\") {\n          state = GenStateCompleted;\n          // Dispatch the exception by looping back around to the\n          // context.dispatchException(context.arg) call above.\n          context.method = \"throw\";\n          context.arg = record.arg;\n        }\n      }\n    };\n  }\n\n  // Call delegate.iterator[context.method](context.arg) and handle the\n  // result, either by returning a { value, done } result from the\n  // delegate iterator, or by modifying context.method and context.arg,\n  // setting context.delegate to null, and returning the ContinueSentinel.\n  function maybeInvokeDelegate(delegate, context) {\n    var method = delegate.iterator[context.method];\n    if (method === undefined) {\n      // A .throw or .return when the delegate iterator has no .throw\n      // method always terminates the yield* loop.\n      context.delegate = null;\n\n      if (context.method === \"throw\") {\n        if (delegate.iterator.return) {\n          // If the delegate iterator has a return method, give it a\n          // chance to clean up.\n          context.method = \"return\";\n          context.arg = undefined;\n          maybeInvokeDelegate(delegate, context);\n\n          if (context.method === \"throw\") {\n            // If maybeInvokeDelegate(context) changed context.method from\n            // \"return\" to \"throw\", let that override the TypeError below.\n            return ContinueSentinel;\n          }\n        }\n\n        context.method = \"throw\";\n        context.arg = new TypeError(\"The iterator does not provide a 'throw' method\");\n      }\n\n      return ContinueSentinel;\n    }\n\n    var record = tryCatch(method, delegate.iterator, context.arg);\n\n    if (record.type === \"throw\") {\n      context.method = \"throw\";\n      context.arg = record.arg;\n      context.delegate = null;\n      return ContinueSentinel;\n    }\n\n    var info = record.arg;\n\n    if (!info) {\n      context.method = \"throw\";\n      context.arg = new TypeError(\"iterator result is not an object\");\n      context.delegate = null;\n      return ContinueSentinel;\n    }\n\n    if (info.done) {\n      // Assign the result of the finished delegate to the temporary\n      // variable specified by delegate.resultName (see delegateYield).\n      context[delegate.resultName] = info.value;\n\n      // Resume execution at the desired location (see delegateYield).\n      context.next = delegate.nextLoc;\n\n      // If context.method was \"throw\" but the delegate handled the\n      // exception, let the outer generator proceed normally. If\n      // context.method was \"next\", forget context.arg since it has been\n      // \"consumed\" by the delegate iterator. If context.method was\n      // \"return\", allow the original .return call to continue in the\n      // outer generator.\n      if (context.method !== \"return\") {\n        context.method = \"next\";\n        context.arg = undefined;\n      }\n    } else {\n      // Re-yield the result returned by the delegate method.\n      return info;\n    }\n\n    // The delegate iterator is finished, so forget it and continue with\n    // the outer generator.\n    context.delegate = null;\n    return ContinueSentinel;\n  }\n\n  // Define Generator.prototype.{next,throw,return} in terms of the\n  // unified ._invoke helper method.\n  defineIteratorMethods(Gp);\n\n  Gp[toStringTagSymbol] = \"Generator\";\n\n  // A Generator should always return itself as the iterator object when the\n  // @@iterator function is called on it. Some browsers' implementations of the\n  // iterator prototype chain incorrectly implement this, causing the Generator\n  // object to not be returned from this call. This ensures that doesn't happen.\n  // See https://github.com/facebook/regenerator/issues/274 for more details.\n  Gp[iteratorSymbol] = function () {\n    return this;\n  };\n\n  Gp.toString = function () {\n    return \"[object Generator]\";\n  };\n\n  function pushTryEntry(locs) {\n    var entry = { tryLoc: locs[0] };\n\n    if (1 in locs) {\n      entry.catchLoc = locs[1];\n    }\n\n    if (2 in locs) {\n      entry.finallyLoc = locs[2];\n      entry.afterLoc = locs[3];\n    }\n\n    this.tryEntries.push(entry);\n  }\n\n  function resetTryEntry(entry) {\n    var record = entry.completion || {};\n    record.type = \"normal\";\n    delete record.arg;\n    entry.completion = record;\n  }\n\n  function Context(tryLocsList) {\n    // The root entry object (effectively a try statement without a catch\n    // or a finally block) gives us a place to store values thrown from\n    // locations where there is no enclosing try statement.\n    this.tryEntries = [{ tryLoc: \"root\" }];\n    tryLocsList.forEach(pushTryEntry, this);\n    this.reset(true);\n  }\n\n  runtime.keys = function (object) {\n    var keys = [];\n    for (var key in object) {\n      keys.push(key);\n    }\n    keys.reverse();\n\n    // Rather than returning an object with a next method, we keep\n    // things simple and return the next function itself.\n    return function next() {\n      while (keys.length) {\n        var key = keys.pop();\n        if (key in object) {\n          next.value = key;\n          next.done = false;\n          return next;\n        }\n      }\n\n      // To avoid creating an additional object, we just hang the .value\n      // and .done properties off the next function object itself. This\n      // also ensures that the minifier will not anonymize the function.\n      next.done = true;\n      return next;\n    };\n  };\n\n  function values(iterable) {\n    if (iterable) {\n      var iteratorMethod = iterable[iteratorSymbol];\n      if (iteratorMethod) {\n        return iteratorMethod.call(iterable);\n      }\n\n      if (typeof iterable.next === \"function\") {\n        return iterable;\n      }\n\n      if (!isNaN(iterable.length)) {\n        var i = -1,\n            next = function next() {\n          while (++i < iterable.length) {\n            if (hasOwn.call(iterable, i)) {\n              next.value = iterable[i];\n              next.done = false;\n              return next;\n            }\n          }\n\n          next.value = undefined;\n          next.done = true;\n\n          return next;\n        };\n\n        return next.next = next;\n      }\n    }\n\n    // Return an iterator with no values.\n    return { next: doneResult };\n  }\n  runtime.values = values;\n\n  function doneResult() {\n    return { value: undefined, done: true };\n  }\n\n  Context.prototype = {\n    constructor: Context,\n\n    reset: function reset(skipTempReset) {\n      this.prev = 0;\n      this.next = 0;\n      // Resetting context._sent for legacy support of Babel's\n      // function.sent implementation.\n      this.sent = this._sent = undefined;\n      this.done = false;\n      this.delegate = null;\n\n      this.method = \"next\";\n      this.arg = undefined;\n\n      this.tryEntries.forEach(resetTryEntry);\n\n      if (!skipTempReset) {\n        for (var name in this) {\n          // Not sure about the optimal order of these conditions:\n          if (name.charAt(0) === \"t\" && hasOwn.call(this, name) && !isNaN(+name.slice(1))) {\n            this[name] = undefined;\n          }\n        }\n      }\n    },\n\n    stop: function stop() {\n      this.done = true;\n\n      var rootEntry = this.tryEntries[0];\n      var rootRecord = rootEntry.completion;\n      if (rootRecord.type === \"throw\") {\n        throw rootRecord.arg;\n      }\n\n      return this.rval;\n    },\n\n    dispatchException: function dispatchException(exception) {\n      if (this.done) {\n        throw exception;\n      }\n\n      var context = this;\n      function handle(loc, caught) {\n        record.type = \"throw\";\n        record.arg = exception;\n        context.next = loc;\n\n        if (caught) {\n          // If the dispatched exception was caught by a catch block,\n          // then let that catch block handle the exception normally.\n          context.method = \"next\";\n          context.arg = undefined;\n        }\n\n        return !!caught;\n      }\n\n      for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n        var entry = this.tryEntries[i];\n        var record = entry.completion;\n\n        if (entry.tryLoc === \"root\") {\n          // Exception thrown outside of any try block that could handle\n          // it, so set the completion value of the entire function to\n          // throw the exception.\n          return handle(\"end\");\n        }\n\n        if (entry.tryLoc <= this.prev) {\n          var hasCatch = hasOwn.call(entry, \"catchLoc\");\n          var hasFinally = hasOwn.call(entry, \"finallyLoc\");\n\n          if (hasCatch && hasFinally) {\n            if (this.prev < entry.catchLoc) {\n              return handle(entry.catchLoc, true);\n            } else if (this.prev < entry.finallyLoc) {\n              return handle(entry.finallyLoc);\n            }\n          } else if (hasCatch) {\n            if (this.prev < entry.catchLoc) {\n              return handle(entry.catchLoc, true);\n            }\n          } else if (hasFinally) {\n            if (this.prev < entry.finallyLoc) {\n              return handle(entry.finallyLoc);\n            }\n          } else {\n            throw new Error(\"try statement without catch or finally\");\n          }\n        }\n      }\n    },\n\n    abrupt: function abrupt(type, arg) {\n      for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n        var entry = this.tryEntries[i];\n        if (entry.tryLoc <= this.prev && hasOwn.call(entry, \"finallyLoc\") && this.prev < entry.finallyLoc) {\n          var finallyEntry = entry;\n          break;\n        }\n      }\n\n      if (finallyEntry && (type === \"break\" || type === \"continue\") && finallyEntry.tryLoc <= arg && arg <= finallyEntry.finallyLoc) {\n        // Ignore the finally entry if control is not jumping to a\n        // location outside the try/catch block.\n        finallyEntry = null;\n      }\n\n      var record = finallyEntry ? finallyEntry.completion : {};\n      record.type = type;\n      record.arg = arg;\n\n      if (finallyEntry) {\n        this.method = \"next\";\n        this.next = finallyEntry.finallyLoc;\n        return ContinueSentinel;\n      }\n\n      return this.complete(record);\n    },\n\n    complete: function complete(record, afterLoc) {\n      if (record.type === \"throw\") {\n        throw record.arg;\n      }\n\n      if (record.type === \"break\" || record.type === \"continue\") {\n        this.next = record.arg;\n      } else if (record.type === \"return\") {\n        this.rval = this.arg = record.arg;\n        this.method = \"return\";\n        this.next = \"end\";\n      } else if (record.type === \"normal\" && afterLoc) {\n        this.next = afterLoc;\n      }\n\n      return ContinueSentinel;\n    },\n\n    finish: function finish(finallyLoc) {\n      for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n        var entry = this.tryEntries[i];\n        if (entry.finallyLoc === finallyLoc) {\n          this.complete(entry.completion, entry.afterLoc);\n          resetTryEntry(entry);\n          return ContinueSentinel;\n        }\n      }\n    },\n\n    \"catch\": function _catch(tryLoc) {\n      for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n        var entry = this.tryEntries[i];\n        if (entry.tryLoc === tryLoc) {\n          var record = entry.completion;\n          if (record.type === \"throw\") {\n            var thrown = record.arg;\n            resetTryEntry(entry);\n          }\n          return thrown;\n        }\n      }\n\n      // The context.catch method must only be called with a location\n      // argument that corresponds to a known catch block.\n      throw new Error(\"illegal catch attempt\");\n    },\n\n    delegateYield: function delegateYield(iterable, resultName, nextLoc) {\n      this.delegate = {\n        iterator: values(iterable),\n        resultName: resultName,\n        nextLoc: nextLoc\n      };\n\n      if (this.method === \"next\") {\n        // Deliberately forget the last sent value so that we don't\n        // accidentally pass it on to the delegate.\n        this.arg = undefined;\n      }\n\n      return ContinueSentinel;\n    }\n  };\n}(\n// In sloppy mode, unbound `this` refers to the global object, fallback to\n// Function constructor if we're in global strict mode. That is sadly a form\n// of indirect eval which violates Content Security Policy.\nfunction () {\n  return this;\n}() || Function(\"return this\")());\n/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(43)(module)))\n\n/***/ }),\n/* 43 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nmodule.exports = function (module) {\n\tif (!module.webpackPolyfill) {\n\t\tmodule.deprecate = function () {};\n\t\tmodule.paths = [];\n\t\t// module.parent = undefined by default\n\t\tif (!module.children) module.children = [];\n\t\tObject.defineProperty(module, \"loaded\", {\n\t\t\tenumerable: true,\n\t\t\tget: function get() {\n\t\t\t\treturn module.l;\n\t\t\t}\n\t\t});\n\t\tObject.defineProperty(module, \"id\", {\n\t\t\tenumerable: true,\n\t\t\tget: function get() {\n\t\t\t\treturn module.i;\n\t\t\t}\n\t\t});\n\t\tmodule.webpackPolyfill = 1;\n\t}\n\treturn module;\n};\n\n/***/ }),\n/* 44 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\n/* eslint-disable */\nif (!Array.prototype.includes) {\n  Object.defineProperty(Array.prototype, 'includes', {\n    value: function value(searchElement, fromIndex) {\n\n      if (this == null) {\n        throw new TypeError('\"this\" is null or not defined');\n      }\n\n      // 1. Let O be ? ToObject(this value).\n      var o = Object(this);\n\n      // 2. Let len be ? ToLength(? Get(O, \"length\")).\n      var len = o.length >>> 0;\n\n      // 3. If len is 0, return false.\n      if (len === 0) {\n        return false;\n      }\n\n      // 4. Let n be ? ToInteger(fromIndex).\n      //    (If fromIndex is undefined, this step produces the value 0.)\n      var n = fromIndex | 0;\n\n      // 5. If n ≥ 0, then\n      //  a. Let k be n.\n      // 6. Else n < 0,\n      //  a. Let k be len + n.\n      //  b. If k < 0, let k be 0.\n      var k = Math.max(n >= 0 ? n : len - Math.abs(n), 0);\n\n      function sameValueZero(x, y) {\n        return x === y || typeof x === 'number' && typeof y === 'number' && isNaN(x) && isNaN(y);\n      }\n\n      // 7. Repeat, while k < len\n      while (k < len) {\n        // a. Let elementK be the result of ? Get(O, ! ToString(k)).\n        // b. If SameValueZero(searchElement, elementK) is true, return true.\n        if (sameValueZero(o[k], searchElement)) {\n          return true;\n        }\n        // c. Increase k by 1.\n        k++;\n      }\n\n      // 8. Return false\n      return false;\n    }\n  });\n}\n\n/***/ }),\n/* 45 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\n/* eslint-disable */\n// https://tc39.github.io/ecma262/#sec-array.prototype.find\nif (!Array.prototype.find) {\n  Object.defineProperty(Array.prototype, 'find', {\n    value: function value(predicate) {\n      // 1. Let O be ? ToObject(this value).\n      if (this == null) {\n        throw new TypeError('\"this\" is null or not defined');\n      }\n\n      var o = Object(this);\n\n      // 2. Let len be ? ToLength(? Get(O, \"length\")).\n      var len = o.length >>> 0;\n\n      // 3. If IsCallable(predicate) is false, throw a TypeError exception.\n      if (typeof predicate !== 'function') {\n        throw new TypeError('predicate must be a function');\n      }\n\n      // 4. If thisArg was supplied, let T be thisArg; else let T be undefined.\n      var thisArg = arguments[1];\n\n      // 5. Let k be 0.\n      var k = 0;\n\n      // 6. Repeat, while k < len\n      while (k < len) {\n        // a. Let Pk be ! ToString(k).\n        // b. Let kValue be ? Get(O, Pk).\n        // c. Let testResult be ToBoolean(? Call(predicate, T, « kValue, k, O »)).\n        // d. If testResult is true, return kValue.\n        var kValue = o[k];\n        if (predicate.call(thisArg, kValue, k, o)) {\n          return kValue;\n        }\n        // e. Increase k by 1.\n        k++;\n      }\n\n      // 7. Return undefined.\n      return undefined;\n    }\n  });\n}\n\n/***/ }),\n/* 46 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nvar apply = Function.prototype.apply;\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 = exports.clearInterval = function (timeout) {\n  if (timeout) {\n    timeout.close();\n  }\n};\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) item._onTimeout();\n    }, msecs);\n  }\n};\n\n// setimmediate attaches itself to the global object\n__webpack_require__(47);\nexports.setImmediate = setImmediate;\nexports.clearImmediate = clearImmediate;\n\n/***/ }),\n/* 47 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n/* WEBPACK VAR INJECTION */(function(global, process) {\n\n(function (global, undefined) {\n    \"use strict\";\n\n    if (global.setImmediate) {\n        return;\n    }\n\n    var nextHandle = 1; // Spec says greater than zero\n    var tasksByHandle = {};\n    var currentlyRunningATask = false;\n    var doc = global.document;\n    var registerImmediate;\n\n    function setImmediate(callback) {\n        // Callback can either be a function or a string\n        if (typeof callback !== \"function\") {\n            callback = new Function(\"\" + callback);\n        }\n        // Copy function arguments\n        var args = new Array(arguments.length - 1);\n        for (var i = 0; i < args.length; i++) {\n            args[i] = arguments[i + 1];\n        }\n        // Store and register the task\n        var task = { callback: callback, args: args };\n        tasksByHandle[nextHandle] = task;\n        registerImmediate(nextHandle);\n        return nextHandle++;\n    }\n\n    function clearImmediate(handle) {\n        delete tasksByHandle[handle];\n    }\n\n    function run(task) {\n        var callback = task.callback;\n        var args = task.args;\n        switch (args.length) {\n            case 0:\n                callback();\n                break;\n            case 1:\n                callback(args[0]);\n                break;\n            case 2:\n                callback(args[0], args[1]);\n                break;\n            case 3:\n                callback(args[0], args[1], args[2]);\n                break;\n            default:\n                callback.apply(undefined, args);\n                break;\n        }\n    }\n\n    function runIfPresent(handle) {\n        // From the spec: \"Wait until any invocations of this algorithm started before this one have completed.\"\n        // So if we're currently running a task, we'll need to delay this invocation.\n        if (currentlyRunningATask) {\n            // Delay by doing a setTimeout. setImmediate was tried instead, but in Firefox 7 it generated a\n            // \"too much recursion\" error.\n            setTimeout(runIfPresent, 0, handle);\n        } else {\n            var task = tasksByHandle[handle];\n            if (task) {\n                currentlyRunningATask = true;\n                try {\n                    run(task);\n                } finally {\n                    clearImmediate(handle);\n                    currentlyRunningATask = false;\n                }\n            }\n        }\n    }\n\n    function installNextTickImplementation() {\n        registerImmediate = function registerImmediate(handle) {\n            process.nextTick(function () {\n                runIfPresent(handle);\n            });\n        };\n    }\n\n    function canUsePostMessage() {\n        // The test against `importScripts` prevents this implementation from being installed inside a web worker,\n        // where `global.postMessage` means something completely different and can't be used for this purpose.\n        if (global.postMessage && !global.importScripts) {\n            var postMessageIsAsynchronous = true;\n            var oldOnMessage = global.onmessage;\n            global.onmessage = function () {\n                postMessageIsAsynchronous = false;\n            };\n            global.postMessage(\"\", \"*\");\n            global.onmessage = oldOnMessage;\n            return postMessageIsAsynchronous;\n        }\n    }\n\n    function installPostMessageImplementation() {\n        // Installs an event handler on `global` for the `message` event: see\n        // * https://developer.mozilla.org/en/DOM/window.postMessage\n        // * http://www.whatwg.org/specs/web-apps/current-work/multipage/comms.html#crossDocumentMessages\n\n        var messagePrefix = \"setImmediate$\" + Math.random() + \"$\";\n        var onGlobalMessage = function onGlobalMessage(event) {\n            if (event.source === global && typeof event.data === \"string\" && event.data.indexOf(messagePrefix) === 0) {\n                runIfPresent(+event.data.slice(messagePrefix.length));\n            }\n        };\n\n        if (global.addEventListener) {\n            global.addEventListener(\"message\", onGlobalMessage, false);\n        } else {\n            global.attachEvent(\"onmessage\", onGlobalMessage);\n        }\n\n        registerImmediate = function registerImmediate(handle) {\n            global.postMessage(messagePrefix + handle, \"*\");\n        };\n    }\n\n    function installMessageChannelImplementation() {\n        var channel = new MessageChannel();\n        channel.port1.onmessage = function (event) {\n            var handle = event.data;\n            runIfPresent(handle);\n        };\n\n        registerImmediate = function registerImmediate(handle) {\n            channel.port2.postMessage(handle);\n        };\n    }\n\n    function installReadyStateChangeImplementation() {\n        var html = doc.documentElement;\n        registerImmediate = function registerImmediate(handle) {\n            // Create a <script> element; its readystatechange event will be fired asynchronously once it is inserted\n            // into the document. Do so, thus queuing up the task. Remember to clean up once it's been called.\n            var script = doc.createElement(\"script\");\n            script.onreadystatechange = function () {\n                runIfPresent(handle);\n                script.onreadystatechange = null;\n                html.removeChild(script);\n                script = null;\n            };\n            html.appendChild(script);\n        };\n    }\n\n    function installSetTimeoutImplementation() {\n        registerImmediate = function registerImmediate(handle) {\n            setTimeout(runIfPresent, 0, handle);\n        };\n    }\n\n    // If supported, we should attach to the prototype of global, since that is where setTimeout et al. live.\n    var attachTo = Object.getPrototypeOf && Object.getPrototypeOf(global);\n    attachTo = attachTo && attachTo.setTimeout ? attachTo : global;\n\n    // Don't get fooled by e.g. browserify environments.\n    if ({}.toString.call(global.process) === \"[object process]\") {\n        // For Node.js before 0.9\n        installNextTickImplementation();\n    } else if (canUsePostMessage()) {\n        // For non-IE10 modern browsers\n        installPostMessageImplementation();\n    } else if (global.MessageChannel) {\n        // For web workers, where supported\n        installMessageChannelImplementation();\n    } else if (doc && \"onreadystatechange\" in doc.createElement(\"script\")) {\n        // For IE 6–8\n        installReadyStateChangeImplementation();\n    } else {\n        // For older browsers\n        installSetTimeoutImplementation();\n    }\n\n    attachTo.setImmediate = setImmediate;\n    attachTo.clearImmediate = clearImmediate;\n})(typeof self === \"undefined\" ? typeof global === \"undefined\" ? undefined : global : self);\n/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(17), __webpack_require__(27)))\n\n/***/ }),\n/* 48 */\n/***/ (function(module, exports) {\n\n// removed by extract-text-webpack-plugin\nmodule.exports = {\"button\":\"dh-stemning-button\",\"button--theme-sport\":\"dh-stemning-button--theme-sport\",\"button--theme-sport-inverted\":\"dh-stemning-button--theme-sport-inverted\",\"button--theme-sport-inverted-gray\":\"dh-stemning-button--theme-sport-inverted-gray\",\"button--theme-monsen\":\"dh-stemning-button--theme-monsen\"};\n\n/***/ }),\n/* 49 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.VoteCounter = VoteCounter;\n\nvar _preact = __webpack_require__(1);\n\nvar _VoteCounter = __webpack_require__(50);\n\nvar _VoteCounter2 = _interopRequireDefault(_VoteCounter);\n\nvar _formatNumber = __webpack_require__(51);\n\nvar _themeToClassName = __webpack_require__(5);\n\nvar _bem = __webpack_require__(3);\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\n/* eslint-disable jsx-a11y/aria-role */\nfunction VoteCounter(props, context) {\n  var voteCount = props.voteCount;\n\n\n  return (0, _preact.h)(\n    'div',\n    { className: (0, _bem.bem)(_VoteCounter2.default.voteCounter, (0, _themeToClassName.themeToClassName)(context.theme)), role: 'text' },\n    (0, _preact.h)(\n      'div',\n      { className: _VoteCounter2.default.voteCounter__count },\n      (0, _preact.h)(\n        'span',\n        { className: 'nrk-sr' },\n        'Antall stemmer: ',\n        voteCount\n      ),\n      (0, _preact.h)(\n        'span',\n        null,\n        (0, _formatNumber.formatNumber)(voteCount),\n        ' stemmer'\n      )\n    )\n  );\n}\n/** @jsx h */\n\n/***/ }),\n/* 50 */\n/***/ (function(module, exports) {\n\n// removed by extract-text-webpack-plugin\nmodule.exports = {\"voteCounter\":\"dh-stemning-voteCounter\",\"voteCounter--theme-monsen\":\"dh-stemning-voteCounter--theme-monsen\",\"voteCounter__count\":\"dh-stemning-voteCounter__count\"};\n\n/***/ }),\n/* 51 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.formatNumber = formatNumber;\nfunction formatNumber(number) {\n  try {\n    return number.toLocaleString('no-NO').replace(/,/g, ' ');\n  } catch (e) {\n    try {\n      return number.toLocaleString().replace(/,/g, ' ');\n    } catch (e) {\n      return number;\n    }\n  }\n}\n\n/***/ }),\n/* 52 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.Result = undefined;\n\nvar _createClass = function () { function 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, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }();\n\nvar _preact = __webpack_require__(1);\n\nvar _Result = __webpack_require__(53);\n\nvar _Result2 = _interopRequireDefault(_Result);\n\nvar _ResultList = __webpack_require__(54);\n\nvar _Error = __webpack_require__(30);\n\nvar _Loader = __webpack_require__(31);\n\nvar _StemningIcon = __webpack_require__(14);\n\nvar _RetryButton = __webpack_require__(32);\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction _possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return call && (typeof call === \"object\" || typeof call === \"function\") ? call : self; }\n\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function, not \" + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; }\n/** @jsx h */\n\nvar Result = exports.Result = function (_Component) {\n  _inherits(Result, _Component);\n\n  function Result() {\n    _classCallCheck(this, Result);\n\n    return _possibleConstructorReturn(this, (Result.__proto__ || Object.getPrototypeOf(Result)).apply(this, arguments));\n  }\n\n  _createClass(Result, [{\n    key: 'handleRetryButtonClick',\n    value: function handleRetryButtonClick() {\n      window.location.reload(true);\n    }\n  }, {\n    key: 'render',\n    value: function render() {\n      var _props = this.props,\n          error = _props.error,\n          result = _props.result,\n          title = _props.title,\n          highlightedResultItemId = _props.highlightedResultItemId,\n          sort = _props.sort,\n          clickable = _props.clickable;\n\n\n      var totalVotes = result && result.votes || 0;\n      if (error && !result) {\n        return (0, _preact.h)(\n          _Error.Error,\n          null,\n          (0, _preact.h)(\n            'div',\n            { style: { marginBottom: '10px' } },\n            'Beklager, men vi klarte ikke \\xE5 laste inn resultater akkurat n\\xE5.'\n          ),\n          (0, _preact.h)(\n            _RetryButton.RetryButton,\n            { onClick: this.handleRetryButtonClick },\n            'Pr\\xF8v p\\xE5 nytt'\n          )\n        );\n      }\n\n      if (!result) {\n        return (0, _preact.h)(\n          _Loader.Loader,\n          null,\n          (0, _preact.h)(_StemningIcon.StemningIcon, null),\n          (0, _preact.h)(\n            'p',\n            null,\n            'Laster innhold'\n          )\n        );\n      }\n\n      var TitleBar = function TitleBar() {\n        if (title && (totalVotes === 0 || totalVotes)) {\n          return (0, _preact.h)(\n            'div',\n            { className: _Result2.default.result__titleBar },\n            (0, _preact.h)(\n              'h4',\n              { className: _Result2.default.result__title },\n              title\n            )\n          );\n        }\n        return null;\n      };\n\n      return (0, _preact.h)(\n        'div',\n        { className: _Result2.default.result },\n        (0, _preact.h)(TitleBar, null),\n        (0, _preact.h)(_ResultList.ResultList, {\n          clickable: clickable,\n          items: sortItems(result.items, sort),\n          totalVotes: result.votes || result.totalVotes,\n          highlightedId: highlightedResultItemId\n        })\n      );\n    }\n  }]);\n\n  return Result;\n}(_preact.Component);\n\nfunction sortItems(items, sort) {\n  if (sort === 'DESC') {\n    return items.sort(function (a, b) {\n      return b.votes - a.votes;\n    });\n  } else if (sort === 'ASC') {\n    return items.sort(function (a, b) {\n      return a.votes - b.votes;\n    });\n  }\n\n  return items;\n}\n\n/***/ }),\n/* 53 */\n/***/ (function(module, exports) {\n\n// removed by extract-text-webpack-plugin\nmodule.exports = {\"result\":\"dh-stemning-result\",\"result__title\":\"dh-stemning-result__title\",\"result__titleBar\":\"dh-stemning-result__titleBar\",\"stemningIcon\":\"dh-stemning-stemningIcon\",\"result__voteCount\":\"dh-stemning-result__voteCount\"};\n\n/***/ }),\n/* 54 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.ResultList = undefined;\n\nvar _createClass = function () { function 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, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }();\n\nvar _preact = __webpack_require__(1);\n\nvar _ResultList = __webpack_require__(55);\n\nvar _ResultList2 = _interopRequireDefault(_ResultList);\n\nvar _bem = __webpack_require__(3);\n\nvar _themeToClassName = __webpack_require__(5);\n\nvar _breakpointToClassName = __webpack_require__(10);\n\nvar _ResultItem = __webpack_require__(56);\n\nvar _getTextMaxLength = __webpack_require__(29);\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction _possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return call && (typeof call === \"object\" || typeof call === \"function\") ? call : self; }\n\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function, not \" + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; }\n/** @jsx h */\n\nvar ResultList = exports.ResultList = function (_Component) {\n  _inherits(ResultList, _Component);\n\n  function ResultList() {\n    var _ref;\n\n    var _temp, _this, _ret;\n\n    _classCallCheck(this, ResultList);\n\n    for (var _len = arguments.length, args = Array(_len), _key = 0; _key < _len; _key++) {\n      args[_key] = arguments[_key];\n    }\n\n    return _ret = (_temp = (_this = _possibleConstructorReturn(this, (_ref = ResultList.__proto__ || Object.getPrototypeOf(ResultList)).call.apply(_ref, [this].concat(args))), _this), _this.state = {\n      showNumber: false\n    }, _this.toggleShowNumber = function () {\n      _this.setState({ showNumber: !_this.state.showNumber });\n    }, _temp), _possibleConstructorReturn(_this, _ret);\n  }\n\n  _createClass(ResultList, [{\n    key: 'render',\n    value: function render() {\n      var _props = this.props,\n          items = _props.items,\n          totalVotes = _props.totalVotes,\n          highlightedId = _props.highlightedId,\n          clickable = _props.clickable;\n      var showNumber = this.state.showNumber;\n      var _context = this.context,\n          theme = _context.theme,\n          currentBreakpoint = _context.currentBreakpoint;\n\n      var isSlim = (0, _getTextMaxLength.getMaxLength)(items, 'votes') > 4;\n\n      return (\n        // eslint-disable-next-line\n        (0, _preact.h)(\n          'div',\n          {\n            className: (0, _bem.bem)(_ResultList2.default.resultList, (0, _themeToClassName.themeToClassName)(theme), (0, _breakpointToClassName.breakpointToClassName)(currentBreakpoint), clickable ? 'clickable' : ''),\n            onClick: this.toggleShowNumber\n          },\n          (0, _preact.h)(_ResultItem.ScreenReaderList, { items: items, totalVotes: totalVotes }),\n          (0, _preact.h)(_ResultItem.BarList, { items: items,\n            totalVotes: totalVotes,\n            isSlim: isSlim,\n            showNumber: showNumber,\n            highlightedId: highlightedId }),\n          (0, _preact.h)(_ResultItem.TextList, { items: items,\n            totalVotes: totalVotes,\n            isSlim: isSlim,\n            showNumber: showNumber,\n            highlightedId: highlightedId })\n        )\n      );\n    }\n  }]);\n\n  return ResultList;\n}(_preact.Component);\n\n/***/ }),\n/* 55 */\n/***/ (function(module, exports) {\n\n// removed by extract-text-webpack-plugin\nmodule.exports = {\"resultList\":\"dh-stemning-resultList\",\"resultList--medium\":\"dh-stemning-resultList--medium\",\"resultList--large\":\"dh-stemning-resultList--large\",\"resultList--extra-large\":\"dh-stemning-resultList--extra-large\",\"resultList--theme-sport\":\"dh-stemning-resultList--theme-sport\",\"resultItem\":\"dh-stemning-resultItem\",\"bar__main\":\"dh-stemning-bar__main\",\"bar__main--highlighted\":\"dh-stemning-bar__main--highlighted\",\"resultList--theme-sport-inverted\":\"dh-stemning-resultList--theme-sport-inverted\",\"resultList--theme-sport-inverted-gray\":\"dh-stemning-resultList--theme-sport-inverted-gray\",\"resultList--clickable\":\"dh-stemning-resultList--clickable\"};\n\n/***/ }),\n/* 56 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.ScreenReaderItem = exports.TextItem = exports.BarItem = exports.TextList = exports.BarList = exports.ScreenReaderList = undefined;\n\nvar _preact = __webpack_require__(1);\n\nvar _ResultItem = __webpack_require__(9);\n\nvar _ResultItem2 = _interopRequireDefault(_ResultItem);\n\nvar _getScorePercent = __webpack_require__(57);\n\nvar _Bar = __webpack_require__(58);\n\nvar _Percent = __webpack_require__(59);\n\nvar _Number = __webpack_require__(60);\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\n/** @jsx h */\n\nvar ScreenReaderList = exports.ScreenReaderList = function ScreenReaderList(props) {\n  var items = props.items,\n      totalVotes = props.totalVotes;\n\n\n  return (0, _preact.h)(\n    'ul',\n    { 'class': _ResultItem2.default['resultList__sr'] },\n    items.map(function (resultItem) {\n      return (0, _preact.h)(ScreenReaderItem, {\n        resultItem: resultItem,\n        scorePercent: (0, _getScorePercent.getScorePercent)(resultItem.votes, totalVotes)\n      });\n    })\n  );\n};\n\nvar BarList = exports.BarList = function BarList(props) {\n  var items = props.items,\n      isSlim = props.isSlim,\n      showNumber = props.showNumber,\n      totalVotes = props.totalVotes,\n      highlightedId = props.highlightedId;\n\n  return (0, _preact.h)(\n    'div',\n    { 'aria-hidden': true, 'class': _ResultItem2.default['resultList__bars'] },\n    items.map(function (resultItem) {\n      return (0, _preact.h)(BarItem, {\n        isSlim: isSlim,\n        showNumber: showNumber,\n        scorePercent: (0, _getScorePercent.getScorePercent)(resultItem.votes, totalVotes),\n        resultItem: resultItem,\n        isHighlighted: shouldHighlight(resultItem, highlightedId)\n      });\n    })\n  );\n};\n\nvar TextList = exports.TextList = function TextList(props) {\n  var items = props.items,\n      isSlim = props.isSlim,\n      showNumber = props.showNumber,\n      totalVotes = props.totalVotes,\n      highlightedId = props.highlightedId;\n\n\n  return (0, _preact.h)(\n    'div',\n    { 'aria-hidden': true, 'class': _ResultItem2.default['resultList__text'] },\n    items.map(function (resultItem) {\n      return (0, _preact.h)(TextItem, {\n        isSlim: isSlim,\n        showNumber: showNumber,\n        scorePercent: (0, _getScorePercent.getScorePercent)(resultItem.votes, totalVotes),\n        resultItem: resultItem,\n        isHighlighted: shouldHighlight(resultItem, highlightedId)\n      });\n    })\n  );\n};\n\nvar BarItem = exports.BarItem = function BarItem(props) {\n  var resultItem = props.resultItem,\n      scorePercent = props.scorePercent,\n      isHighlighted = props.isHighlighted,\n      isSlim = props.isSlim;\n\n  return (0, _preact.h)(\n    'div',\n    { 'aria-hidden': 'true',\n      className: _ResultItem2.default['resultItem'],\n      'data-alternativeid': resultItem.id\n    },\n    (0, _preact.h)(\n      'div',\n      { className: _ResultItem2.default.resultItem__label },\n      resultItem.text\n    ),\n    (0, _preact.h)(\n      'div',\n      { className: _ResultItem2.default['resultItem__score-wrapper'] },\n      (0, _preact.h)(_Bar.Bar, {\n        width: scorePercent,\n        isHighlighted: isHighlighted,\n        isSlim: isSlim\n      })\n    )\n  );\n};\n\nvar TextItem = exports.TextItem = function TextItem(props) {\n  var resultItem = props.resultItem,\n      scorePercent = props.scorePercent,\n      showNumber = props.showNumber;\n\n  return (0, _preact.h)(\n    'div',\n    { 'class': _ResultItem2.default['resultItem__score-text-wrapper'] },\n    (0, _preact.h)(_Number.Number, { hidden: !showNumber, value: resultItem.votes || 0 }),\n    (0, _preact.h)(_Percent.Percent, { hidden: showNumber, scorePercent: scorePercent })\n  );\n};\n\nvar ScreenReaderItem = exports.ScreenReaderItem = function ScreenReaderItem(_ref) {\n  var resultItem = _ref.resultItem,\n      scorePercent = _ref.scorePercent;\n\n  return (0, _preact.h)(\n    'li',\n    { className: 'nrk-sr' },\n    getTextRepresentation(resultItem, scorePercent)\n  );\n};\n\nfunction shouldHighlight(resultItem, highlightedId) {\n  if (!highlightedId) {\n    return false;\n  }\n  return resultItem.id === highlightedId;\n}\n\nfunction getTextRepresentation(resultItem, scorePercent) {\n  var formattedScorePercent = (scorePercent || 0).toFixed(1).replace('.', ',');\n  return 'Alternativ ' + resultItem.text + ' har f\\xE5tt ' + formattedScorePercent + '% av stemmene';\n}\n\n/***/ }),\n/* 57 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.getScorePercent = getScorePercent;\nfunction getScorePercent(votes, totalVotes) {\n  if (totalVotes === 0) {\n    return 0;\n  }\n  return votes / totalVotes * 100;\n}\n\n/***/ }),\n/* 58 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.Bar = undefined;\n\nvar _createClass = function () { function 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, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }();\n\nvar _preact = __webpack_require__(1);\n\nvar _Bar = __webpack_require__(19);\n\nvar _Bar2 = _interopRequireDefault(_Bar);\n\nvar _bem = __webpack_require__(3);\n\nvar _themeToClassName = __webpack_require__(5);\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction _possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return call && (typeof call === \"object\" || typeof call === \"function\") ? call : self; }\n\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function, not \" + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; }\n/** @jsx h */\n\nvar Bar = exports.Bar = function (_Component) {\n  _inherits(Bar, _Component);\n\n  function Bar() {\n    var _ref;\n\n    var _temp, _this, _ret;\n\n    _classCallCheck(this, Bar);\n\n    for (var _len = arguments.length, args = Array(_len), _key = 0; _key < _len; _key++) {\n      args[_key] = arguments[_key];\n    }\n\n    return _ret = (_temp = (_this = _possibleConstructorReturn(this, (_ref = Bar.__proto__ || Object.getPrototypeOf(Bar)).call.apply(_ref, [this].concat(args))), _this), _this.state = {\n      isMounted: false\n    }, _temp), _possibleConstructorReturn(_this, _ret);\n  }\n\n  _createClass(Bar, [{\n    key: 'componentDidMount',\n    value: function componentDidMount() {\n      var _this2 = this;\n\n      setTimeout(function () {\n        requestAnimationFrame(function () {\n          _this2.setState({\n            isMounted: true\n          });\n        });\n      }, 80);\n    }\n  }, {\n    key: 'render',\n    value: function render() {\n      var _props = this.props,\n          width = _props.width,\n          isHighlighted = _props.isHighlighted,\n          isSlim = _props.isSlim;\n      var isMounted = this.state.isMounted;\n      var _context = this.context,\n          theme = _context.theme,\n          isInteractive = _context.isInteractive;\n\n      // isInteractive is set through context, and is set to true if\n      // the application / component is hydrated on the client\n\n      var transform = isInteractive ? getTransform(isMounted ? width : 0) : getTransform(width);\n      return (0, _preact.h)(\n        'div',\n        { className: (0, _bem.bem)(_Bar2.default.bar, isSlim ? 'slim' : null) },\n        (0, _preact.h)('div', {\n          className: (0, _bem.bem)(_Bar2.default.bar__main, (0, _themeToClassName.themeToClassName)(theme), isHighlighted ? 'highlighted' : ''),\n          style: transform\n        })\n      );\n    }\n  }]);\n\n  return Bar;\n}(_preact.Component);\n\nfunction getTransform(width) {\n  var transitionDelayMs = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 20;\n\n  // Ensure bars get a certain width\n  if (width < 5) width = 5;\n  var transform = 'translateX(-' + (100 - width) + '%)';\n  return {\n    WebkitTransform: transform,\n    MozTransform: transform,\n    msTransform: transform,\n    OTransform: transform,\n    transform: transform,\n    transitionDelay: '20ms'\n  };\n}\n\n/***/ }),\n/* 59 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.Percent = Percent;\n\nvar _preact = __webpack_require__(1);\n\nvar _ResultItem = __webpack_require__(9);\n\nvar _ResultItem2 = _interopRequireDefault(_ResultItem);\n\nvar _bem = __webpack_require__(3);\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nfunction Percent(_ref) {\n  var scorePercent = _ref.scorePercent,\n      _ref$hidden = _ref.hidden,\n      hidden = _ref$hidden === undefined ? false : _ref$hidden;\n\n  var shouldTransform = false;\n  var transform = shouldTransform ? getTransform(scorePercent) : {};\n\n  return (0, _preact.h)(\n    'div',\n    { className: (0, _bem.bem)(_ResultItem2.default['resultItem__score'], hidden ? 'hidden' : ''), style: transform },\n    (0, _preact.h)(\n      'span',\n      { className: _ResultItem2.default['resultItem__score-text'] },\n      prettyPrintScorePercent(scorePercent)\n    )\n  );\n}\n/** @jsx h */\n\nfunction prettyPrintScorePercent(scorePercent) {\n  return scorePercent.toFixed(0) + ' %';\n}\n\nfunction getTransform(width) {\n  var transitionDelayMs = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 20;\n\n  // Ensure bars get a certain width\n  if (width < 5) {\n    width = 5;\n  }\n  var transform = 'translateX(-' + (100 - width) + '%)';\n  return {\n    left: 40,\n    WebkitTransform: transform,\n    MozTransform: transform,\n    msTransform: transform,\n    OTransform: transform,\n    transform: transform,\n    transitionDelay: '20ms'\n  };\n}\n\n/***/ }),\n/* 60 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.Number = Number;\n\nvar _preact = __webpack_require__(1);\n\nvar _ResultItem = __webpack_require__(9);\n\nvar _ResultItem2 = _interopRequireDefault(_ResultItem);\n\nvar _bem = __webpack_require__(3);\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nfunction Number(_ref) {\n  var value = _ref.value,\n      _ref$hidden = _ref.hidden,\n      hidden = _ref$hidden === undefined ? true : _ref$hidden;\n\n  return (0, _preact.h)(\n    'div',\n    { className: (0, _bem.bem)(_ResultItem2.default['resultItem__score'], hidden ? 'hidden' : '') },\n    (0, _preact.h)(\n      'span',\n      { className: _ResultItem2.default['resultItem__score-text'] },\n      prettyPrintNumber(value)\n    )\n  );\n}\n/** @jsx h */\n\nvar prettyPrintNumber = function prettyPrintNumber(value) {\n  return value.toLocaleString();\n};\n\n/***/ }),\n/* 61 */\n/***/ (function(module, exports) {\n\n// removed by extract-text-webpack-plugin\nmodule.exports = {\"error\":\"dh-stemning-error\"};\n\n/***/ }),\n/* 62 */\n/***/ (function(module, exports) {\n\n// removed by extract-text-webpack-plugin\nmodule.exports = {\"loader\":\"dh-stemning-loader\",\"anim\":\"dh-stemning-anim\"};\n\n/***/ }),\n/* 63 */\n/***/ (function(module, exports) {\n\n// removed by extract-text-webpack-plugin\nmodule.exports = {\"stemningIcon\":\"dh-stemning-stemningIcon\",\"stemningIcon--theme-sport\":\"dh-stemning-stemningIcon--theme-sport\",\"stemningIcon--theme-sport-inverted-gray\":\"dh-stemning-stemningIcon--theme-sport-inverted-gray\",\"stemningIcon--theme-sport-inverted\":\"dh-stemning-stemningIcon--theme-sport-inverted\",\"stemningIcon--theme-monsen\":\"dh-stemning-stemningIcon--theme-monsen\",\"animate\":\"dh-stemning-animate\",\"animate--once\":\"dh-stemning-animate--once\",\"anim\":\"dh-stemning-anim\",\"animate--infinite\":\"dh-stemning-animate--infinite\",\"rect-1\":\"dh-stemning-rect-1\",\"rect-2\":\"dh-stemning-rect-2\",\"rect-3\":\"dh-stemning-rect-3\"};\n\n/***/ }),\n/* 64 */\n/***/ (function(module, exports) {\n\n// removed by extract-text-webpack-plugin\nmodule.exports = {\"retryButton\":\"dh-stemning-retryButton\",\"retryButton--theme-sport\":\"dh-stemning-retryButton--theme-sport\"};\n\n/***/ }),\n/* 65 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nexports.defaults = {};\n\nexports.set = function (name, value, options) {\n  // Retrieve options and defaults\n  var opts = options || {};\n  var defaults = exports.defaults;\n\n  // Apply default value for unspecified options\n  var expires = opts.expires || defaults.expires;\n  var domain = opts.domain || defaults.domain;\n  var path = opts.path !== undefined ? opts.path : defaults.path !== undefined ? defaults.path : '/';\n  var secure = opts.secure !== undefined ? opts.secure : defaults.secure;\n  var httponly = opts.httponly !== undefined ? opts.httponly : defaults.httponly;\n\n  // Determine cookie expiration date\n  // If succesful the result will be a valid Date, otherwise it will be an invalid Date or false(ish)\n  var expDate = expires ? new Date(\n  // in case expires is an integer, it should specify the number of days till the cookie expires\n  typeof expires === 'number' ? new Date().getTime() + expires * 864e5 :\n  // else expires should be either a Date object or in a format recognized by Date.parse()\n  expires) : '';\n\n  // Set cookie\n  document.cookie = name.replace(/[^+#$&^`|]/g, encodeURIComponent) // Encode cookie name\n  .replace('(', '%28').replace(')', '%29') + '=' + value.replace(/[^+#$&/:<-\\[\\]-}]/g, encodeURIComponent) + ( // Encode cookie value (RFC6265)\n  expDate && expDate.getTime() >= 0 ? ';expires=' + expDate.toUTCString() : '') + ( // Add expiration date\n  domain ? ';domain=' + domain : '') + ( // Add domain\n  path ? ';path=' + path : '') + ( // Add path\n  secure ? ';secure' : '') + ( // Add secure option\n  httponly ? ';httponly' : ''); // Add httponly option\n};\n\nexports.get = function (name) {\n  var cookies = document.cookie.split(';');\n\n  // Iterate all cookies\n  for (var i = 0; i < cookies.length; i++) {\n    var cookie = cookies[i];\n    var cookieLength = cookie.length;\n\n    // Determine separator index (\"name=value\")\n    var separatorIndex = cookie.indexOf('=');\n\n    // IE<11 emits the equal sign when the cookie value is empty\n    separatorIndex = separatorIndex < 0 ? cookieLength : separatorIndex;\n\n    var cookie_name = decodeURIComponent(cookie.substring(0, separatorIndex).replace(/^\\s+/, ''));\n\n    // Return cookie value if the name matches\n    if (cookie_name === name) {\n      return decodeURIComponent(cookie.substring(separatorIndex + 1, cookieLength));\n    }\n  }\n\n  // Return `null` as the cookie was not found\n  return null;\n};\n\nexports.erase = function (name, options) {\n  exports.set(name, '', {\n    expires: -1,\n    domain: options && options.domain,\n    path: options && options.path,\n    secure: 0,\n    httponly: 0 });\n};\n\nexports.all = function () {\n  var all = {};\n  var cookies = document.cookie.split(';');\n\n  // Iterate all cookies\n  for (var i = 0; i < cookies.length; i++) {\n    var cookie = cookies[i];\n    var cookieLength = cookie.length;\n\n    // Determine separator index (\"name=value\")\n    var separatorIndex = cookie.indexOf('=');\n\n    // IE<11 emits the equal sign when the cookie value is empty\n    separatorIndex = separatorIndex < 0 ? cookieLength : separatorIndex;\n\n    // add the cookie name and value to the `all` object\n    var cookie_name = decodeURIComponent(cookie.substring(0, separatorIndex).replace(/^\\s+/, ''));\n    all[cookie_name] = decodeURIComponent(cookie.substring(separatorIndex + 1, cookieLength));\n  }\n\n  return all;\n};\n\n/***/ }),\n/* 66 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.Branding = undefined;\n\nvar _preact = __webpack_require__(1);\n\nvar _StemningIcon = __webpack_require__(14);\n\nvar _Branding = __webpack_require__(67);\n\nvar _Branding2 = _interopRequireDefault(_Branding);\n\nvar _bem = __webpack_require__(3);\n\nvar _themeToClassName = __webpack_require__(5);\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nvar Branding = exports.Branding = function Branding(props, context) {\n  return (0, _preact.h)(\n    'div',\n    { className: (0, _bem.bem)(_Branding2.default.branding, (0, _themeToClassName.themeToClassName)(context.theme)), 'aria-hidden': true },\n    (0, _preact.h)(_StemningIcon.StemningIcon, null),\n    (0, _preact.h)(\n      'span',\n      null,\n      'Avstemning'\n    )\n  );\n}; //  @jsx h\n\n/***/ }),\n/* 67 */\n/***/ (function(module, exports) {\n\n// removed by extract-text-webpack-plugin\nmodule.exports = {\"branding\":\"dh-stemning-branding\",\"stemningIcon\":\"dh-stemning-stemningIcon\",\"branding--theme-sport\":\"dh-stemning-branding--theme-sport\"};\n\n/***/ }),\n/* 68 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\n/**\n * @fileoverview Firebase constants.  Some of these (@defines) can be overridden at compile-time.\n */\nexports.CONSTANTS = {\n  /**\n   * @define {boolean} Whether this is the client Node.js SDK.\n   */\n  NODE_CLIENT: false,\n  /**\n   * @define {boolean} Whether this is the Admin Node.js SDK.\n   */\n  NODE_ADMIN: false,\n  /**\n   * Firebase SDK Version\n   */\n  SDK_VERSION: '${JSCORE_VERSION}'\n};\n\n//# sourceMappingURL=constants.js.map\n\n/***/ }),\n/* 69 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nvar __extends = undefined && undefined.__extends || function () {\n    var extendStatics = Object.setPrototypeOf || { __proto__: [] } instanceof Array && function (d, b) {\n        d.__proto__ = b;\n    } || function (d, b) {\n        for (var p in b) {\n            if (b.hasOwnProperty(p)) d[p] = b[p];\n        }\n    };\n    return function (d, b) {\n        extendStatics(d, b);\n        function __() {\n            this.constructor = d;\n        }\n        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n    };\n}();\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar onDisconnect_1 = __webpack_require__(86);\nvar TransactionResult_1 = __webpack_require__(160);\nvar util_1 = __webpack_require__(2);\nvar NextPushId_1 = __webpack_require__(161);\nvar Query_1 = __webpack_require__(87);\nvar Repo_1 = __webpack_require__(39);\nvar Path_1 = __webpack_require__(4);\nvar QueryParams_1 = __webpack_require__(185);\nvar validation_1 = __webpack_require__(11);\nvar util_2 = __webpack_require__(0);\nvar util_3 = __webpack_require__(0);\nvar SyncPoint_1 = __webpack_require__(98);\nvar Reference = /** @class */function (_super) {\n    __extends(Reference, _super);\n    /**\n     * Call options:\n     *   new Reference(Repo, Path) or\n     *   new Reference(url: string, string|RepoManager)\n     *\n     * Externally - this is the firebase.database.Reference type.\n     *\n     * @param {!Repo} repo\n     * @param {(!Path)} path\n     * @extends {Query}\n     */\n    function Reference(repo, path) {\n        var _this = this;\n        if (!(repo instanceof Repo_1.Repo)) {\n            throw new Error('new Reference() no longer supported - use app.database().');\n        }\n        // call Query's constructor, passing in the repo and path.\n        _this = _super.call(this, repo, path, QueryParams_1.QueryParams.DEFAULT, false) || this;\n        return _this;\n    }\n    /** @return {?string} */\n    Reference.prototype.getKey = function () {\n        util_2.validateArgCount('Reference.key', 0, 0, arguments.length);\n        if (this.path.isEmpty()) return null;else return this.path.getBack();\n    };\n    /**\n     * @param {!(string|Path)} pathString\n     * @return {!Reference}\n     */\n    Reference.prototype.child = function (pathString) {\n        util_2.validateArgCount('Reference.child', 1, 1, arguments.length);\n        if (typeof pathString === 'number') {\n            pathString = String(pathString);\n        } else if (!(pathString instanceof Path_1.Path)) {\n            if (this.path.getFront() === null) validation_1.validateRootPathString('Reference.child', 1, pathString, false);else validation_1.validatePathString('Reference.child', 1, pathString, false);\n        }\n        return new Reference(this.repo, this.path.child(pathString));\n    };\n    /** @return {?Reference} */\n    Reference.prototype.getParent = function () {\n        util_2.validateArgCount('Reference.parent', 0, 0, arguments.length);\n        var parentPath = this.path.parent();\n        return parentPath === null ? null : new Reference(this.repo, parentPath);\n    };\n    /** @return {!Reference} */\n    Reference.prototype.getRoot = function () {\n        util_2.validateArgCount('Reference.root', 0, 0, arguments.length);\n        var ref = this;\n        while (ref.getParent() !== null) {\n            ref = ref.getParent();\n        }\n        return ref;\n    };\n    /** @return {!Database} */\n    Reference.prototype.databaseProp = function () {\n        return this.repo.database;\n    };\n    /**\n     * @param {*} newVal\n     * @param {function(?Error)=} onComplete\n     * @return {!Promise}\n     */\n    Reference.prototype.set = function (newVal, onComplete) {\n        util_2.validateArgCount('Reference.set', 1, 2, arguments.length);\n        validation_1.validateWritablePath('Reference.set', this.path);\n        validation_1.validateFirebaseDataArg('Reference.set', 1, newVal, this.path, false);\n        util_2.validateCallback('Reference.set', 2, onComplete, true);\n        var deferred = new util_3.Deferred();\n        this.repo.setWithPriority(this.path, newVal,\n        /*priority=*/null, deferred.wrapCallback(onComplete));\n        return deferred.promise;\n    };\n    /**\n     * @param {!Object} objectToMerge\n     * @param {function(?Error)=} onComplete\n     * @return {!Promise}\n     */\n    Reference.prototype.update = function (objectToMerge, onComplete) {\n        util_2.validateArgCount('Reference.update', 1, 2, arguments.length);\n        validation_1.validateWritablePath('Reference.update', this.path);\n        if (Array.isArray(objectToMerge)) {\n            var newObjectToMerge = {};\n            for (var i = 0; i < objectToMerge.length; ++i) {\n                newObjectToMerge['' + i] = objectToMerge[i];\n            }\n            objectToMerge = newObjectToMerge;\n            util_1.warn('Passing an Array to Firebase.update() is deprecated. ' + 'Use set() if you want to overwrite the existing data, or ' + 'an Object with integer keys if you really do want to ' + 'only update some of the children.');\n        }\n        validation_1.validateFirebaseMergeDataArg('Reference.update', 1, objectToMerge, this.path, false);\n        util_2.validateCallback('Reference.update', 2, onComplete, true);\n        var deferred = new util_3.Deferred();\n        this.repo.update(this.path, objectToMerge, deferred.wrapCallback(onComplete));\n        return deferred.promise;\n    };\n    /**\n     * @param {*} newVal\n     * @param {string|number|null} newPriority\n     * @param {function(?Error)=} onComplete\n     * @return {!Promise}\n     */\n    Reference.prototype.setWithPriority = function (newVal, newPriority, onComplete) {\n        util_2.validateArgCount('Reference.setWithPriority', 2, 3, arguments.length);\n        validation_1.validateWritablePath('Reference.setWithPriority', this.path);\n        validation_1.validateFirebaseDataArg('Reference.setWithPriority', 1, newVal, this.path, false);\n        validation_1.validatePriority('Reference.setWithPriority', 2, newPriority, false);\n        util_2.validateCallback('Reference.setWithPriority', 3, onComplete, true);\n        if (this.getKey() === '.length' || this.getKey() === '.keys') throw 'Reference.setWithPriority failed: ' + this.getKey() + ' is a read-only object.';\n        var deferred = new util_3.Deferred();\n        this.repo.setWithPriority(this.path, newVal, newPriority, deferred.wrapCallback(onComplete));\n        return deferred.promise;\n    };\n    /**\n     * @param {function(?Error)=} onComplete\n     * @return {!Promise}\n     */\n    Reference.prototype.remove = function (onComplete) {\n        util_2.validateArgCount('Reference.remove', 0, 1, arguments.length);\n        validation_1.validateWritablePath('Reference.remove', this.path);\n        util_2.validateCallback('Reference.remove', 1, onComplete, true);\n        return this.set(null, onComplete);\n    };\n    /**\n     * @param {function(*):*} transactionUpdate\n     * @param {(function(?Error, boolean, ?DataSnapshot))=} onComplete\n     * @param {boolean=} applyLocally\n     * @return {!Promise}\n     */\n    Reference.prototype.transaction = function (transactionUpdate, onComplete, applyLocally) {\n        util_2.validateArgCount('Reference.transaction', 1, 3, arguments.length);\n        validation_1.validateWritablePath('Reference.transaction', this.path);\n        util_2.validateCallback('Reference.transaction', 1, transactionUpdate, false);\n        util_2.validateCallback('Reference.transaction', 2, onComplete, true);\n        // NOTE: applyLocally is an internal-only option for now.  We need to decide if we want to keep it and how\n        // to expose it.\n        validation_1.validateBoolean('Reference.transaction', 3, applyLocally, true);\n        if (this.getKey() === '.length' || this.getKey() === '.keys') throw 'Reference.transaction failed: ' + this.getKey() + ' is a read-only object.';\n        if (applyLocally === undefined) applyLocally = true;\n        var deferred = new util_3.Deferred();\n        if (typeof onComplete === 'function') {\n            deferred.promise.catch(function () {});\n        }\n        var promiseComplete = function promiseComplete(error, committed, snapshot) {\n            if (error) {\n                deferred.reject(error);\n            } else {\n                deferred.resolve(new TransactionResult_1.TransactionResult(committed, snapshot));\n            }\n            if (typeof onComplete === 'function') {\n                onComplete(error, committed, snapshot);\n            }\n        };\n        this.repo.startTransaction(this.path, transactionUpdate, promiseComplete, applyLocally);\n        return deferred.promise;\n    };\n    /**\n     * @param {string|number|null} priority\n     * @param {function(?Error)=} onComplete\n     * @return {!Promise}\n     */\n    Reference.prototype.setPriority = function (priority, onComplete) {\n        util_2.validateArgCount('Reference.setPriority', 1, 2, arguments.length);\n        validation_1.validateWritablePath('Reference.setPriority', this.path);\n        validation_1.validatePriority('Reference.setPriority', 1, priority, false);\n        util_2.validateCallback('Reference.setPriority', 2, onComplete, true);\n        var deferred = new util_3.Deferred();\n        this.repo.setWithPriority(this.path.child('.priority'), priority, null, deferred.wrapCallback(onComplete));\n        return deferred.promise;\n    };\n    /**\n     * @param {*=} value\n     * @param {function(?Error)=} onComplete\n     * @return {!Reference}\n     */\n    Reference.prototype.push = function (value, onComplete) {\n        util_2.validateArgCount('Reference.push', 0, 2, arguments.length);\n        validation_1.validateWritablePath('Reference.push', this.path);\n        validation_1.validateFirebaseDataArg('Reference.push', 1, value, this.path, true);\n        util_2.validateCallback('Reference.push', 2, onComplete, true);\n        var now = this.repo.serverTime();\n        var name = NextPushId_1.nextPushId(now);\n        // push() returns a ThennableReference whose promise is fulfilled with a regular Reference.\n        // We use child() to create handles to two different references. The first is turned into a\n        // ThennableReference below by adding then() and catch() methods and is used as the\n        // return value of push(). The second remains a regular Reference and is used as the fulfilled\n        // value of the first ThennableReference.\n        var thennablePushRef = this.child(name);\n        var pushRef = this.child(name);\n        var promise;\n        if (value != null) {\n            promise = thennablePushRef.set(value, onComplete).then(function () {\n                return pushRef;\n            });\n        } else {\n            promise = Promise.resolve(pushRef);\n        }\n        thennablePushRef.then = promise.then.bind(promise);\n        thennablePushRef.catch = promise.then.bind(promise, undefined);\n        if (typeof onComplete === 'function') {\n            promise.catch(function () {});\n        }\n        return thennablePushRef;\n    };\n    /**\n     * @return {!OnDisconnect}\n     */\n    Reference.prototype.onDisconnect = function () {\n        validation_1.validateWritablePath('Reference.onDisconnect', this.path);\n        return new onDisconnect_1.OnDisconnect(this.repo, this.path);\n    };\n    Object.defineProperty(Reference.prototype, \"database\", {\n        get: function get() {\n            return this.databaseProp();\n        },\n        enumerable: true,\n        configurable: true\n    });\n    Object.defineProperty(Reference.prototype, \"key\", {\n        get: function get() {\n            return this.getKey();\n        },\n        enumerable: true,\n        configurable: true\n    });\n    Object.defineProperty(Reference.prototype, \"parent\", {\n        get: function get() {\n            return this.getParent();\n        },\n        enumerable: true,\n        configurable: true\n    });\n    Object.defineProperty(Reference.prototype, \"root\", {\n        get: function get() {\n            return this.getRoot();\n        },\n        enumerable: true,\n        configurable: true\n    });\n    return Reference;\n}(Query_1.Query);\nexports.Reference = Reference;\n/**\n * Define reference constructor in various modules\n *\n * We are doing this here to avoid several circular\n * dependency issues\n */\nQuery_1.Query.__referenceConstructor = Reference;\nSyncPoint_1.SyncPoint.__referenceConstructor = Reference;\n\n//# sourceMappingURL=Reference.js.map\n\n/***/ }),\n/* 70 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = __webpack_require__(0);\nvar validation_1 = __webpack_require__(11);\nvar Path_1 = __webpack_require__(4);\nvar PriorityIndex_1 = __webpack_require__(6);\n/**\n * Class representing a firebase data snapshot.  It wraps a SnapshotNode and\n * surfaces the public methods (val, forEach, etc.) we want to expose.\n */\nvar DataSnapshot = /** @class */function () {\n    /**\n     * @param {!Node} node_ A SnapshotNode to wrap.\n     * @param {!Reference} ref_ The ref of the location this snapshot came from.\n     * @param {!Index} index_ The iteration order for this snapshot\n     */\n    function DataSnapshot(node_, ref_, index_) {\n        this.node_ = node_;\n        this.ref_ = ref_;\n        this.index_ = index_;\n    }\n    /**\n     * Retrieves the snapshot contents as JSON.  Returns null if the snapshot is\n     * empty.\n     *\n     * @return {*} JSON representation of the DataSnapshot contents, or null if empty.\n     */\n    DataSnapshot.prototype.val = function () {\n        util_1.validateArgCount('DataSnapshot.val', 0, 0, arguments.length);\n        return this.node_.val();\n    };\n    /**\n     * Returns the snapshot contents as JSON, including priorities of node.  Suitable for exporting\n     * the entire node contents.\n     * @return {*} JSON representation of the DataSnapshot contents, or null if empty.\n     */\n    DataSnapshot.prototype.exportVal = function () {\n        util_1.validateArgCount('DataSnapshot.exportVal', 0, 0, arguments.length);\n        return this.node_.val(true);\n    };\n    // Do not create public documentation. This is intended to make JSON serialization work but is otherwise unnecessary\n    // for end-users\n    DataSnapshot.prototype.toJSON = function () {\n        // Optional spacer argument is unnecessary because we're depending on recursion rather than stringifying the content\n        util_1.validateArgCount('DataSnapshot.toJSON', 0, 1, arguments.length);\n        return this.exportVal();\n    };\n    /**\n     * Returns whether the snapshot contains a non-null value.\n     *\n     * @return {boolean} Whether the snapshot contains a non-null value, or is empty.\n     */\n    DataSnapshot.prototype.exists = function () {\n        util_1.validateArgCount('DataSnapshot.exists', 0, 0, arguments.length);\n        return !this.node_.isEmpty();\n    };\n    /**\n     * Returns a DataSnapshot of the specified child node's contents.\n     *\n     * @param {!string} childPathString Path to a child.\n     * @return {!DataSnapshot} DataSnapshot for child node.\n     */\n    DataSnapshot.prototype.child = function (childPathString) {\n        util_1.validateArgCount('DataSnapshot.child', 0, 1, arguments.length);\n        // Ensure the childPath is a string (can be a number)\n        childPathString = String(childPathString);\n        validation_1.validatePathString('DataSnapshot.child', 1, childPathString, false);\n        var childPath = new Path_1.Path(childPathString);\n        var childRef = this.ref_.child(childPath);\n        return new DataSnapshot(this.node_.getChild(childPath), childRef, PriorityIndex_1.PRIORITY_INDEX);\n    };\n    /**\n     * Returns whether the snapshot contains a child at the specified path.\n     *\n     * @param {!string} childPathString Path to a child.\n     * @return {boolean} Whether the child exists.\n     */\n    DataSnapshot.prototype.hasChild = function (childPathString) {\n        util_1.validateArgCount('DataSnapshot.hasChild', 1, 1, arguments.length);\n        validation_1.validatePathString('DataSnapshot.hasChild', 1, childPathString, false);\n        var childPath = new Path_1.Path(childPathString);\n        return !this.node_.getChild(childPath).isEmpty();\n    };\n    /**\n     * Returns the priority of the object, or null if no priority was set.\n     *\n     * @return {string|number|null} The priority.\n     */\n    DataSnapshot.prototype.getPriority = function () {\n        util_1.validateArgCount('DataSnapshot.getPriority', 0, 0, arguments.length);\n        // typecast here because we never return deferred values or internal priorities (MAX_PRIORITY)\n        return this.node_.getPriority().val();\n    };\n    /**\n     * Iterates through child nodes and calls the specified action for each one.\n     *\n     * @param {function(!DataSnapshot)} action Callback function to be called\n     * for each child.\n     * @return {boolean} True if forEach was canceled by action returning true for\n     * one of the child nodes.\n     */\n    DataSnapshot.prototype.forEach = function (action) {\n        var _this = this;\n        util_1.validateArgCount('DataSnapshot.forEach', 1, 1, arguments.length);\n        util_1.validateCallback('DataSnapshot.forEach', 1, action, false);\n        if (this.node_.isLeafNode()) return false;\n        var childrenNode = this.node_;\n        // Sanitize the return value to a boolean. ChildrenNode.forEachChild has a weird return type...\n        return !!childrenNode.forEachChild(this.index_, function (key, node) {\n            return action(new DataSnapshot(node, _this.ref_.child(key), PriorityIndex_1.PRIORITY_INDEX));\n        });\n    };\n    /**\n     * Returns whether this DataSnapshot has children.\n     * @return {boolean} True if the DataSnapshot contains 1 or more child nodes.\n     */\n    DataSnapshot.prototype.hasChildren = function () {\n        util_1.validateArgCount('DataSnapshot.hasChildren', 0, 0, arguments.length);\n        if (this.node_.isLeafNode()) return false;else return !this.node_.isEmpty();\n    };\n    Object.defineProperty(DataSnapshot.prototype, \"key\", {\n        get: function get() {\n            return this.ref_.getKey();\n        },\n        enumerable: true,\n        configurable: true\n    });\n    /**\n     * Returns the number of children for this DataSnapshot.\n     * @return {number} The number of children that this DataSnapshot contains.\n     */\n    DataSnapshot.prototype.numChildren = function () {\n        util_1.validateArgCount('DataSnapshot.numChildren', 0, 0, arguments.length);\n        return this.node_.numChildren();\n    };\n    /**\n     * @return {Reference} The Firebase reference for the location this snapshot's data came from.\n     */\n    DataSnapshot.prototype.getRef = function () {\n        util_1.validateArgCount('DataSnapshot.ref', 0, 0, arguments.length);\n        return this.ref_;\n    };\n    Object.defineProperty(DataSnapshot.prototype, \"ref\", {\n        get: function get() {\n            return this.getRef();\n        },\n        enumerable: true,\n        configurable: true\n    });\n    return DataSnapshot;\n}();\nexports.DataSnapshot = DataSnapshot;\n\n//# sourceMappingURL=DataSnapshot.js.map\n\n/***/ }),\n/* 71 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar SortedMap_1 = __webpack_require__(38);\nvar Path_1 = __webpack_require__(4);\nvar util_1 = __webpack_require__(2);\nvar util_2 = __webpack_require__(0);\nvar emptyChildrenSingleton;\n/**\n * Singleton empty children collection.\n *\n * @const\n * @type {!SortedMap.<string, !ImmutableTree.<?>>}\n */\nvar EmptyChildren = function EmptyChildren() {\n    if (!emptyChildrenSingleton) {\n        emptyChildrenSingleton = new SortedMap_1.SortedMap(util_1.stringCompare);\n    }\n    return emptyChildrenSingleton;\n};\n/**\n * A tree with immutable elements.\n */\nvar ImmutableTree = /** @class */function () {\n    /**\n     * @template T\n     * @param {?T} value\n     * @param {SortedMap.<string, !ImmutableTree.<T>>=} children\n     */\n    function ImmutableTree(value, children) {\n        if (children === void 0) {\n            children = EmptyChildren();\n        }\n        this.value = value;\n        this.children = children;\n    }\n    /**\n     * @template T\n     * @param {!Object.<string, !T>} obj\n     * @return {!ImmutableTree.<!T>}\n     */\n    ImmutableTree.fromObject = function (obj) {\n        var tree = ImmutableTree.Empty;\n        util_2.forEach(obj, function (childPath, childSnap) {\n            tree = tree.set(new Path_1.Path(childPath), childSnap);\n        });\n        return tree;\n    };\n    /**\n     * True if the value is empty and there are no children\n     * @return {boolean}\n     */\n    ImmutableTree.prototype.isEmpty = function () {\n        return this.value === null && this.children.isEmpty();\n    };\n    /**\n     * Given a path and predicate, return the first node and the path to that node\n     * where the predicate returns true.\n     *\n     * TODO Do a perf test -- If we're creating a bunch of {path: value:} objects\n     * on the way back out, it may be better to pass down a pathSoFar obj.\n     *\n     * @param {!Path} relativePath The remainder of the path\n     * @param {function(T):boolean} predicate The predicate to satisfy to return a\n     *   node\n     * @return {?{path:!Path, value:!T}}\n     */\n    ImmutableTree.prototype.findRootMostMatchingPathAndValue = function (relativePath, predicate) {\n        if (this.value != null && predicate(this.value)) {\n            return { path: Path_1.Path.Empty, value: this.value };\n        } else {\n            if (relativePath.isEmpty()) {\n                return null;\n            } else {\n                var front = relativePath.getFront();\n                var child = this.children.get(front);\n                if (child !== null) {\n                    var childExistingPathAndValue = child.findRootMostMatchingPathAndValue(relativePath.popFront(), predicate);\n                    if (childExistingPathAndValue != null) {\n                        var fullPath = new Path_1.Path(front).child(childExistingPathAndValue.path);\n                        return { path: fullPath, value: childExistingPathAndValue.value };\n                    } else {\n                        return null;\n                    }\n                } else {\n                    return null;\n                }\n            }\n        }\n    };\n    /**\n     * Find, if it exists, the shortest subpath of the given path that points a defined\n     * value in the tree\n     * @param {!Path} relativePath\n     * @return {?{path: !Path, value: !T}}\n     */\n    ImmutableTree.prototype.findRootMostValueAndPath = function (relativePath) {\n        return this.findRootMostMatchingPathAndValue(relativePath, function () {\n            return true;\n        });\n    };\n    /**\n     * @param {!Path} relativePath\n     * @return {!ImmutableTree.<T>} The subtree at the given path\n     */\n    ImmutableTree.prototype.subtree = function (relativePath) {\n        if (relativePath.isEmpty()) {\n            return this;\n        } else {\n            var front = relativePath.getFront();\n            var childTree = this.children.get(front);\n            if (childTree !== null) {\n                return childTree.subtree(relativePath.popFront());\n            } else {\n                return ImmutableTree.Empty;\n            }\n        }\n    };\n    /**\n     * Sets a value at the specified path.\n     *\n     * @param {!Path} relativePath Path to set value at.\n     * @param {?T} toSet Value to set.\n     * @return {!ImmutableTree.<T>} Resulting tree.\n     */\n    ImmutableTree.prototype.set = function (relativePath, toSet) {\n        if (relativePath.isEmpty()) {\n            return new ImmutableTree(toSet, this.children);\n        } else {\n            var front = relativePath.getFront();\n            var child = this.children.get(front) || ImmutableTree.Empty;\n            var newChild = child.set(relativePath.popFront(), toSet);\n            var newChildren = this.children.insert(front, newChild);\n            return new ImmutableTree(this.value, newChildren);\n        }\n    };\n    /**\n     * Removes the value at the specified path.\n     *\n     * @param {!Path} relativePath Path to value to remove.\n     * @return {!ImmutableTree.<T>} Resulting tree.\n     */\n    ImmutableTree.prototype.remove = function (relativePath) {\n        if (relativePath.isEmpty()) {\n            if (this.children.isEmpty()) {\n                return ImmutableTree.Empty;\n            } else {\n                return new ImmutableTree(null, this.children);\n            }\n        } else {\n            var front = relativePath.getFront();\n            var child = this.children.get(front);\n            if (child) {\n                var newChild = child.remove(relativePath.popFront());\n                var newChildren = void 0;\n                if (newChild.isEmpty()) {\n                    newChildren = this.children.remove(front);\n                } else {\n                    newChildren = this.children.insert(front, newChild);\n                }\n                if (this.value === null && newChildren.isEmpty()) {\n                    return ImmutableTree.Empty;\n                } else {\n                    return new ImmutableTree(this.value, newChildren);\n                }\n            } else {\n                return this;\n            }\n        }\n    };\n    /**\n     * Gets a value from the tree.\n     *\n     * @param {!Path} relativePath Path to get value for.\n     * @return {?T} Value at path, or null.\n     */\n    ImmutableTree.prototype.get = function (relativePath) {\n        if (relativePath.isEmpty()) {\n            return this.value;\n        } else {\n            var front = relativePath.getFront();\n            var child = this.children.get(front);\n            if (child) {\n                return child.get(relativePath.popFront());\n            } else {\n                return null;\n            }\n        }\n    };\n    /**\n     * Replace the subtree at the specified path with the given new tree.\n     *\n     * @param {!Path} relativePath Path to replace subtree for.\n     * @param {!ImmutableTree} newTree New tree.\n     * @return {!ImmutableTree} Resulting tree.\n     */\n    ImmutableTree.prototype.setTree = function (relativePath, newTree) {\n        if (relativePath.isEmpty()) {\n            return newTree;\n        } else {\n            var front = relativePath.getFront();\n            var child = this.children.get(front) || ImmutableTree.Empty;\n            var newChild = child.setTree(relativePath.popFront(), newTree);\n            var newChildren = void 0;\n            if (newChild.isEmpty()) {\n                newChildren = this.children.remove(front);\n            } else {\n                newChildren = this.children.insert(front, newChild);\n            }\n            return new ImmutableTree(this.value, newChildren);\n        }\n    };\n    /**\n     * Performs a depth first fold on this tree. Transforms a tree into a single\n     * value, given a function that operates on the path to a node, an optional\n     * current value, and a map of child names to folded subtrees\n     * @template V\n     * @param {function(Path, ?T, Object.<string, V>):V} fn\n     * @return {V}\n     */\n    ImmutableTree.prototype.fold = function (fn) {\n        return this.fold_(Path_1.Path.Empty, fn);\n    };\n    /**\n     * Recursive helper for public-facing fold() method\n     * @template V\n     * @param {!Path} pathSoFar\n     * @param {function(Path, ?T, Object.<string, V>):V} fn\n     * @return {V}\n     * @private\n     */\n    ImmutableTree.prototype.fold_ = function (pathSoFar, fn) {\n        var accum = {};\n        this.children.inorderTraversal(function (childKey, childTree) {\n            accum[childKey] = childTree.fold_(pathSoFar.child(childKey), fn);\n        });\n        return fn(pathSoFar, this.value, accum);\n    };\n    /**\n     * Find the first matching value on the given path. Return the result of applying f to it.\n     * @template V\n     * @param {!Path} path\n     * @param {!function(!Path, !T):?V} f\n     * @return {?V}\n     */\n    ImmutableTree.prototype.findOnPath = function (path, f) {\n        return this.findOnPath_(path, Path_1.Path.Empty, f);\n    };\n    ImmutableTree.prototype.findOnPath_ = function (pathToFollow, pathSoFar, f) {\n        var result = this.value ? f(pathSoFar, this.value) : false;\n        if (result) {\n            return result;\n        } else {\n            if (pathToFollow.isEmpty()) {\n                return null;\n            } else {\n                var front = pathToFollow.getFront();\n                var nextChild = this.children.get(front);\n                if (nextChild) {\n                    return nextChild.findOnPath_(pathToFollow.popFront(), pathSoFar.child(front), f);\n                } else {\n                    return null;\n                }\n            }\n        }\n    };\n    /**\n     *\n     * @param {!Path} path\n     * @param {!function(!Path, !T)} f\n     * @returns {!ImmutableTree.<T>}\n     */\n    ImmutableTree.prototype.foreachOnPath = function (path, f) {\n        return this.foreachOnPath_(path, Path_1.Path.Empty, f);\n    };\n    ImmutableTree.prototype.foreachOnPath_ = function (pathToFollow, currentRelativePath, f) {\n        if (pathToFollow.isEmpty()) {\n            return this;\n        } else {\n            if (this.value) {\n                f(currentRelativePath, this.value);\n            }\n            var front = pathToFollow.getFront();\n            var nextChild = this.children.get(front);\n            if (nextChild) {\n                return nextChild.foreachOnPath_(pathToFollow.popFront(), currentRelativePath.child(front), f);\n            } else {\n                return ImmutableTree.Empty;\n            }\n        }\n    };\n    /**\n     * Calls the given function for each node in the tree that has a value.\n     *\n     * @param {function(!Path, !T)} f A function to be called with\n     *   the path from the root of the tree to a node, and the value at that node.\n     *   Called in depth-first order.\n     */\n    ImmutableTree.prototype.foreach = function (f) {\n        this.foreach_(Path_1.Path.Empty, f);\n    };\n    ImmutableTree.prototype.foreach_ = function (currentRelativePath, f) {\n        this.children.inorderTraversal(function (childName, childTree) {\n            childTree.foreach_(currentRelativePath.child(childName), f);\n        });\n        if (this.value) {\n            f(currentRelativePath, this.value);\n        }\n    };\n    /**\n     *\n     * @param {function(string, !T)} f\n     */\n    ImmutableTree.prototype.foreachChild = function (f) {\n        this.children.inorderTraversal(function (childName, childTree) {\n            if (childTree.value) {\n                f(childName, childTree.value);\n            }\n        });\n    };\n    ImmutableTree.Empty = new ImmutableTree(null);\n    return ImmutableTree;\n}();\nexports.ImmutableTree = ImmutableTree;\n\n//# sourceMappingURL=ImmutableTree.js.map\n\n/***/ }),\n/* 72 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = __webpack_require__(0);\nvar Change_1 = __webpack_require__(15);\nvar ChildrenNode_1 = __webpack_require__(7);\nvar PriorityIndex_1 = __webpack_require__(6);\n/**\n * Doesn't really filter nodes but applies an index to the node and keeps track of any changes\n *\n * @constructor\n * @implements {NodeFilter}\n * @param {!Index} index\n */\nvar IndexedFilter = /** @class */function () {\n    function IndexedFilter(index_) {\n        this.index_ = index_;\n    }\n    IndexedFilter.prototype.updateChild = function (snap, key, newChild, affectedPath, source, optChangeAccumulator) {\n        util_1.assert(snap.isIndexed(this.index_), 'A node must be indexed if only a child is updated');\n        var oldChild = snap.getImmediateChild(key);\n        // Check if anything actually changed.\n        if (oldChild.getChild(affectedPath).equals(newChild.getChild(affectedPath))) {\n            // There's an edge case where a child can enter or leave the view because affectedPath was set to null.\n            // In this case, affectedPath will appear null in both the old and new snapshots.  So we need\n            // to avoid treating these cases as \"nothing changed.\"\n            if (oldChild.isEmpty() == newChild.isEmpty()) {\n                // Nothing changed.\n                // This assert should be valid, but it's expensive (can dominate perf testing) so don't actually do it.\n                //assert(oldChild.equals(newChild), 'Old and new snapshots should be equal.');\n                return snap;\n            }\n        }\n        if (optChangeAccumulator != null) {\n            if (newChild.isEmpty()) {\n                if (snap.hasChild(key)) {\n                    optChangeAccumulator.trackChildChange(Change_1.Change.childRemovedChange(key, oldChild));\n                } else {\n                    util_1.assert(snap.isLeafNode(), 'A child remove without an old child only makes sense on a leaf node');\n                }\n            } else if (oldChild.isEmpty()) {\n                optChangeAccumulator.trackChildChange(Change_1.Change.childAddedChange(key, newChild));\n            } else {\n                optChangeAccumulator.trackChildChange(Change_1.Change.childChangedChange(key, newChild, oldChild));\n            }\n        }\n        if (snap.isLeafNode() && newChild.isEmpty()) {\n            return snap;\n        } else {\n            // Make sure the node is indexed\n            return snap.updateImmediateChild(key, newChild).withIndex(this.index_);\n        }\n    };\n    /**\n     * @inheritDoc\n     */\n    IndexedFilter.prototype.updateFullNode = function (oldSnap, newSnap, optChangeAccumulator) {\n        if (optChangeAccumulator != null) {\n            if (!oldSnap.isLeafNode()) {\n                oldSnap.forEachChild(PriorityIndex_1.PRIORITY_INDEX, function (key, childNode) {\n                    if (!newSnap.hasChild(key)) {\n                        optChangeAccumulator.trackChildChange(Change_1.Change.childRemovedChange(key, childNode));\n                    }\n                });\n            }\n            if (!newSnap.isLeafNode()) {\n                newSnap.forEachChild(PriorityIndex_1.PRIORITY_INDEX, function (key, childNode) {\n                    if (oldSnap.hasChild(key)) {\n                        var oldChild = oldSnap.getImmediateChild(key);\n                        if (!oldChild.equals(childNode)) {\n                            optChangeAccumulator.trackChildChange(Change_1.Change.childChangedChange(key, childNode, oldChild));\n                        }\n                    } else {\n                        optChangeAccumulator.trackChildChange(Change_1.Change.childAddedChange(key, childNode));\n                    }\n                });\n            }\n        }\n        return newSnap.withIndex(this.index_);\n    };\n    /**\n     * @inheritDoc\n     */\n    IndexedFilter.prototype.updatePriority = function (oldSnap, newPriority) {\n        if (oldSnap.isEmpty()) {\n            return ChildrenNode_1.ChildrenNode.EMPTY_NODE;\n        } else {\n            return oldSnap.updatePriority(newPriority);\n        }\n    };\n    /**\n     * @inheritDoc\n     */\n    IndexedFilter.prototype.filtersNodes = function () {\n        return false;\n    };\n    /**\n     * @inheritDoc\n     */\n    IndexedFilter.prototype.getIndexedFilter = function () {\n        return this;\n    };\n    /**\n     * @inheritDoc\n     */\n    IndexedFilter.prototype.getIndex = function () {\n        return this.index_;\n    };\n    return IndexedFilter;\n}();\nexports.IndexedFilter = IndexedFilter;\n\n//# sourceMappingURL=IndexedFilter.js.map\n\n/***/ }),\n/* 73 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar StatsCollection_1 = __webpack_require__(177);\nvar StatsManager = /** @class */function () {\n    function StatsManager() {}\n    StatsManager.getCollection = function (repoInfo) {\n        var hashString = repoInfo.toString();\n        if (!this.collections_[hashString]) {\n            this.collections_[hashString] = new StatsCollection_1.StatsCollection();\n        }\n        return this.collections_[hashString];\n    };\n    StatsManager.getOrCreateReporter = function (repoInfo, creatorFunction) {\n        var hashString = repoInfo.toString();\n        if (!this.reporters_[hashString]) {\n            this.reporters_[hashString] = creatorFunction();\n        }\n        return this.reporters_[hashString];\n    };\n    StatsManager.collections_ = {};\n    StatsManager.reporters_ = {};\n    return StatsManager;\n}();\nexports.StatsManager = StatsManager;\n\n//# sourceMappingURL=StatsManager.js.map\n\n/***/ }),\n/* 74 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = __webpack_require__(0);\nvar Repo_1 = __webpack_require__(39);\nvar util_2 = __webpack_require__(2);\nvar parser_1 = __webpack_require__(84);\nvar validation_1 = __webpack_require__(11);\n__webpack_require__(187);\n/** @const {string} */\nvar DATABASE_URL_OPTION = 'databaseURL';\nvar _staticInstance;\n/**\n * Creates and caches Repo instances.\n */\nvar RepoManager = /** @class */function () {\n    function RepoManager() {\n        /**\n         * @private {!Object.<string, Object<string, !fb.core.Repo>>}\n         */\n        this.repos_ = {};\n        /**\n         * If true, new Repos will be created to use ReadonlyRestClient (for testing purposes).\n         * @private {boolean}\n         */\n        this.useRestClient_ = false;\n    }\n    RepoManager.getInstance = function () {\n        if (!_staticInstance) {\n            _staticInstance = new RepoManager();\n        }\n        return _staticInstance;\n    };\n    // TODO(koss): Remove these functions unless used in tests?\n    RepoManager.prototype.interrupt = function () {\n        for (var appName in this.repos_) {\n            for (var dbUrl in this.repos_[appName]) {\n                this.repos_[appName][dbUrl].interrupt();\n            }\n        }\n    };\n    RepoManager.prototype.resume = function () {\n        for (var appName in this.repos_) {\n            for (var dbUrl in this.repos_[appName]) {\n                this.repos_[appName][dbUrl].resume();\n            }\n        }\n    };\n    /**\n     * This function should only ever be called to CREATE a new database instance.\n     *\n     * @param {!FirebaseApp} app\n     * @return {!Database}\n     */\n    RepoManager.prototype.databaseFromApp = function (app, url) {\n        var dbUrl = url || app.options[DATABASE_URL_OPTION];\n        if (dbUrl === undefined) {\n            util_2.fatal(\"Can't determine Firebase Database URL.  Be sure to include \" + DATABASE_URL_OPTION + ' option when calling firebase.intializeApp().');\n        }\n        var parsedUrl = parser_1.parseRepoInfo(dbUrl);\n        var repoInfo = parsedUrl.repoInfo;\n        validation_1.validateUrl('Invalid Firebase Database URL', 1, parsedUrl);\n        if (!parsedUrl.path.isEmpty()) {\n            util_2.fatal('Database URL must point to the root of a Firebase Database ' + '(not including a child path).');\n        }\n        var repo = this.createRepo(repoInfo, app);\n        return repo.database;\n    };\n    /**\n     * Remove the repo and make sure it is disconnected.\n     *\n     * @param {!Repo} repo\n     */\n    RepoManager.prototype.deleteRepo = function (repo) {\n        var appRepos = util_1.safeGet(this.repos_, repo.app.name);\n        // This should never happen...\n        if (!appRepos || util_1.safeGet(appRepos, repo.repoInfo_.toURLString()) !== repo) {\n            util_2.fatal(\"Database \" + repo.app.name + \"(\" + repo.repoInfo_ + \") has already been deleted.\");\n        }\n        repo.interrupt();\n        delete appRepos[repo.repoInfo_.toURLString()];\n    };\n    /**\n     * Ensures a repo doesn't already exist and then creates one using the\n     * provided app.\n     *\n     * @param {!RepoInfo} repoInfo The metadata about the Repo\n     * @param {!FirebaseApp} app\n     * @return {!Repo} The Repo object for the specified server / repoName.\n     */\n    RepoManager.prototype.createRepo = function (repoInfo, app) {\n        var appRepos = util_1.safeGet(this.repos_, app.name);\n        if (!appRepos) {\n            appRepos = {};\n            this.repos_[app.name] = appRepos;\n        }\n        var repo = util_1.safeGet(appRepos, repoInfo.toURLString());\n        if (repo) {\n            util_2.fatal('Database initialized multiple times. Please make sure the format of the database URL matches with each database() call.');\n        }\n        repo = new Repo_1.Repo(repoInfo, this.useRestClient_, app);\n        appRepos[repoInfo.toURLString()] = repo;\n        return repo;\n    };\n    /**\n     * Forces us to use ReadonlyRestClient instead of PersistentConnection for new Repos.\n     * @param {boolean} forceRestClient\n     */\n    RepoManager.prototype.forceRestClient = function (forceRestClient) {\n        this.useRestClient_ = forceRestClient;\n    };\n    return RepoManager;\n}();\nexports.RepoManager = RepoManager;\n\n//# sourceMappingURL=RepoManager.js.map\n\n/***/ }),\n/* 75 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.enableDevtools = enableDevtools;\nfunction enableDevtools() {\n  if (true) return;\n  if (false) require('preact/debug/index');\n} // noinspection ES6ConvertVarToLetConst\n\n/***/ }),\n/* 76 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nvar differenceInMilliseconds = __webpack_require__(123);\n\n/**\n * @category Second Helpers\n * @summary Get the number of seconds between the given dates.\n *\n * @description\n * Get the number of seconds between the given dates.\n *\n * @param {Date|String|Number} dateLeft - the later date\n * @param {Date|String|Number} dateRight - the earlier date\n * @returns {Number} the number of seconds\n *\n * @example\n * // How many seconds are between\n * // 2 July 2014 12:30:07.999 and 2 July 2014 12:30:20.000?\n * var result = differenceInSeconds(\n *   new Date(2014, 6, 2, 12, 30, 20, 0),\n *   new Date(2014, 6, 2, 12, 30, 7, 999)\n * )\n * //=> 12\n */\nfunction differenceInSeconds(dirtyDateLeft, dirtyDateRight) {\n  var diff = differenceInMilliseconds(dirtyDateLeft, dirtyDateRight) / 1000;\n  return diff > 0 ? Math.floor(diff) : Math.ceil(diff);\n}\n\nmodule.exports = differenceInSeconds;\n\n/***/ }),\n/* 77 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nvar commonFormatterKeys = ['M', 'MM', 'Q', 'D', 'DD', 'DDD', 'DDDD', 'd', 'E', 'W', 'WW', 'YY', 'YYYY', 'GG', 'GGGG', 'H', 'HH', 'h', 'hh', 'm', 'mm', 's', 'ss', 'S', 'SS', 'SSS', 'Z', 'ZZ', 'X', 'x'];\n\nfunction buildFormattingTokensRegExp(formatters) {\n  var formatterKeys = [];\n  for (var key in formatters) {\n    if (formatters.hasOwnProperty(key)) {\n      formatterKeys.push(key);\n    }\n  }\n\n  var formattingTokens = commonFormatterKeys.concat(formatterKeys).sort().reverse();\n  var formattingTokensRegExp = new RegExp('(\\\\[[^\\\\[]*\\\\])|(\\\\\\\\)?' + '(' + formattingTokens.join('|') + '|.)', 'g');\n\n  return formattingTokensRegExp;\n}\n\nmodule.exports = buildFormattingTokensRegExp;\n\n/***/ }),\n/* 78 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\n\nvar _extends = Object.assign || function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; };\n\nexports.getFirebaseInstance = getFirebaseInstance;\n\nvar _app = __webpack_require__(139);\n\nvar _app2 = _interopRequireDefault(_app);\n\n__webpack_require__(156);\n\n__webpack_require__(191);\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nvar firebaseInstance = void 0;\nfunction getFirebaseInstance(authConfig) {\n  if (firebaseInstance) {\n    return firebaseInstance;\n  }\n\n  firebaseInstance = _app2.default.initializeApp(_extends({}, authConfig.firebase, {\n    projectId: authConfig.projectId\n  }));\n\n  return firebaseInstance;\n}\n\n/***/ }),\n/* 79 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar constants_1 = __webpack_require__(68);\n/**\n * Throws an error if the provided assertion is falsy\n * @param {*} assertion The assertion to be tested for falsiness\n * @param {!string} message The message to display if the check fails\n */\nexports.assert = function (assertion, message) {\n  if (!assertion) {\n    throw exports.assertionError(message);\n  }\n};\n/**\n * Returns an Error object suitable for throwing.\n * @param {string} message\n * @return {!Error}\n */\nexports.assertionError = function (message) {\n  return new Error('Firebase Database (' + constants_1.CONSTANTS.SDK_VERSION + ') INTERNAL ASSERT FAILED: ' + message);\n};\n\n//# sourceMappingURL=assert.js.map\n\n/***/ }),\n/* 80 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar stringToByteArray = function stringToByteArray(str) {\n    var output = [],\n        p = 0;\n    for (var i = 0; i < str.length; i++) {\n        var c = str.charCodeAt(i);\n        while (c > 255) {\n            output[p++] = c & 255;\n            c >>= 8;\n        }\n        output[p++] = c;\n    }\n    return output;\n};\n/**\n * Turns an array of numbers into the string given by the concatenation of the\n * characters to which the numbers correspond.\n * @param {Array<number>} bytes Array of numbers representing characters.\n * @return {string} Stringification of the array.\n */\nvar byteArrayToString = function byteArrayToString(bytes) {\n    var CHUNK_SIZE = 8192;\n    // Special-case the simple case for speed's sake.\n    if (bytes.length < CHUNK_SIZE) {\n        return String.fromCharCode.apply(null, bytes);\n    }\n    // The remaining logic splits conversion by chunks since\n    // Function#apply() has a maximum parameter count.\n    // See discussion: http://goo.gl/LrWmZ9\n    var str = '';\n    for (var i = 0; i < bytes.length; i += CHUNK_SIZE) {\n        var chunk = bytes.slice(i, i + CHUNK_SIZE);\n        str += String.fromCharCode.apply(null, chunk);\n    }\n    return str;\n};\n// Static lookup maps, lazily populated by init_()\nexports.base64 = {\n    /**\n     * Maps bytes to characters.\n     * @type {Object}\n     * @private\n     */\n    byteToCharMap_: null,\n    /**\n     * Maps characters to bytes.\n     * @type {Object}\n     * @private\n     */\n    charToByteMap_: null,\n    /**\n     * Maps bytes to websafe characters.\n     * @type {Object}\n     * @private\n     */\n    byteToCharMapWebSafe_: null,\n    /**\n     * Maps websafe characters to bytes.\n     * @type {Object}\n     * @private\n     */\n    charToByteMapWebSafe_: null,\n    /**\n     * Our default alphabet, shared between\n     * ENCODED_VALS and ENCODED_VALS_WEBSAFE\n     * @type {string}\n     */\n    ENCODED_VALS_BASE: 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' + 'abcdefghijklmnopqrstuvwxyz' + '0123456789',\n    /**\n     * Our default alphabet. Value 64 (=) is special; it means \"nothing.\"\n     * @type {string}\n     */\n    get ENCODED_VALS() {\n        return this.ENCODED_VALS_BASE + '+/=';\n    },\n    /**\n     * Our websafe alphabet.\n     * @type {string}\n     */\n    get ENCODED_VALS_WEBSAFE() {\n        return this.ENCODED_VALS_BASE + '-_.';\n    },\n    /**\n     * Whether this browser supports the atob and btoa functions. This extension\n     * started at Mozilla but is now implemented by many browsers. We use the\n     * ASSUME_* variables to avoid pulling in the full useragent detection library\n     * but still allowing the standard per-browser compilations.\n     *\n     * @type {boolean}\n     */\n    HAS_NATIVE_SUPPORT: typeof atob === 'function',\n    /**\n     * Base64-encode an array of bytes.\n     *\n     * @param {Array<number>|Uint8Array} input An array of bytes (numbers with\n     *     value in [0, 255]) to encode.\n     * @param {boolean=} opt_webSafe Boolean indicating we should use the\n     *     alternative alphabet.\n     * @return {string} The base64 encoded string.\n     */\n    encodeByteArray: function encodeByteArray(input, opt_webSafe) {\n        if (!Array.isArray(input)) {\n            throw Error('encodeByteArray takes an array as a parameter');\n        }\n        this.init_();\n        var byteToCharMap = opt_webSafe ? this.byteToCharMapWebSafe_ : this.byteToCharMap_;\n        var output = [];\n        for (var i = 0; i < input.length; i += 3) {\n            var byte1 = input[i];\n            var haveByte2 = i + 1 < input.length;\n            var byte2 = haveByte2 ? input[i + 1] : 0;\n            var haveByte3 = i + 2 < input.length;\n            var byte3 = haveByte3 ? input[i + 2] : 0;\n            var outByte1 = byte1 >> 2;\n            var outByte2 = (byte1 & 0x03) << 4 | byte2 >> 4;\n            var outByte3 = (byte2 & 0x0f) << 2 | byte3 >> 6;\n            var outByte4 = byte3 & 0x3f;\n            if (!haveByte3) {\n                outByte4 = 64;\n                if (!haveByte2) {\n                    outByte3 = 64;\n                }\n            }\n            output.push(byteToCharMap[outByte1], byteToCharMap[outByte2], byteToCharMap[outByte3], byteToCharMap[outByte4]);\n        }\n        return output.join('');\n    },\n    /**\n     * Base64-encode a string.\n     *\n     * @param {string} input A string to encode.\n     * @param {boolean=} opt_webSafe If true, we should use the\n     *     alternative alphabet.\n     * @return {string} The base64 encoded string.\n     */\n    encodeString: function encodeString(input, opt_webSafe) {\n        // Shortcut for Mozilla browsers that implement\n        // a native base64 encoder in the form of \"btoa/atob\"\n        if (this.HAS_NATIVE_SUPPORT && !opt_webSafe) {\n            return btoa(input);\n        }\n        return this.encodeByteArray(stringToByteArray(input), opt_webSafe);\n    },\n    /**\n     * Base64-decode a string.\n     *\n     * @param {string} input to decode.\n     * @param {boolean=} opt_webSafe True if we should use the\n     *     alternative alphabet.\n     * @return {string} string representing the decoded value.\n     */\n    decodeString: function decodeString(input, opt_webSafe) {\n        // Shortcut for Mozilla browsers that implement\n        // a native base64 encoder in the form of \"btoa/atob\"\n        if (this.HAS_NATIVE_SUPPORT && !opt_webSafe) {\n            return atob(input);\n        }\n        return byteArrayToString(this.decodeStringToByteArray(input, opt_webSafe));\n    },\n    /**\n     * Base64-decode a string.\n     *\n     * In base-64 decoding, groups of four characters are converted into three\n     * bytes.  If the encoder did not apply padding, the input length may not\n     * be a multiple of 4.\n     *\n     * In this case, the last group will have fewer than 4 characters, and\n     * padding will be inferred.  If the group has one or two characters, it decodes\n     * to one byte.  If the group has three characters, it decodes to two bytes.\n     *\n     * @param {string} input Input to decode.\n     * @param {boolean=} opt_webSafe True if we should use the web-safe alphabet.\n     * @return {!Array<number>} bytes representing the decoded value.\n     */\n    decodeStringToByteArray: function decodeStringToByteArray(input, opt_webSafe) {\n        this.init_();\n        var charToByteMap = opt_webSafe ? this.charToByteMapWebSafe_ : this.charToByteMap_;\n        var output = [];\n        for (var i = 0; i < input.length;) {\n            var byte1 = charToByteMap[input.charAt(i++)];\n            var haveByte2 = i < input.length;\n            var byte2 = haveByte2 ? charToByteMap[input.charAt(i)] : 0;\n            ++i;\n            var haveByte3 = i < input.length;\n            var byte3 = haveByte3 ? charToByteMap[input.charAt(i)] : 64;\n            ++i;\n            var haveByte4 = i < input.length;\n            var byte4 = haveByte4 ? charToByteMap[input.charAt(i)] : 64;\n            ++i;\n            if (byte1 == null || byte2 == null || byte3 == null || byte4 == null) {\n                throw Error();\n            }\n            var outByte1 = byte1 << 2 | byte2 >> 4;\n            output.push(outByte1);\n            if (byte3 != 64) {\n                var outByte2 = byte2 << 4 & 0xf0 | byte3 >> 2;\n                output.push(outByte2);\n                if (byte4 != 64) {\n                    var outByte3 = byte3 << 6 & 0xc0 | byte4;\n                    output.push(outByte3);\n                }\n            }\n        }\n        return output;\n    },\n    /**\n     * Lazy static initialization function. Called before\n     * accessing any of the static map variables.\n     * @private\n     */\n    init_: function init_() {\n        if (!this.byteToCharMap_) {\n            this.byteToCharMap_ = {};\n            this.charToByteMap_ = {};\n            this.byteToCharMapWebSafe_ = {};\n            this.charToByteMapWebSafe_ = {};\n            // We want quick mappings back and forth, so we precompute two maps.\n            for (var i = 0; i < this.ENCODED_VALS.length; i++) {\n                this.byteToCharMap_[i] = this.ENCODED_VALS.charAt(i);\n                this.charToByteMap_[this.byteToCharMap_[i]] = i;\n                this.byteToCharMapWebSafe_[i] = this.ENCODED_VALS_WEBSAFE.charAt(i);\n                this.charToByteMapWebSafe_[this.byteToCharMapWebSafe_[i]] = i;\n                // Be forgiving when decoding and correctly decode both encodings.\n                if (i >= this.ENCODED_VALS_BASE.length) {\n                    this.charToByteMap_[this.ENCODED_VALS_WEBSAFE.charAt(i)] = i;\n                    this.charToByteMapWebSafe_[this.ENCODED_VALS.charAt(i)] = i;\n                }\n            }\n        }\n    }\n};\n/**\n * URL-safe base64 encoding\n * @param {!string} str\n * @return {!string}\n */\nexports.base64Encode = function (str) {\n    var utf8Bytes = stringToByteArray(str);\n    return exports.base64.encodeByteArray(utf8Bytes, true);\n};\n/**\n * URL-safe base64 decoding\n *\n * NOTE: DO NOT use the global atob() function - it does NOT support the\n * base64Url variant encoding.\n *\n * @param {string} str To be decoded\n * @return {?string} Decoded result, if possible\n */\nexports.base64Decode = function (str) {\n    try {\n        return exports.base64.decodeString(str, true);\n    } catch (e) {\n        console.error('base64Decode failed: ', e);\n    }\n    return null;\n};\n\n//# sourceMappingURL=crypt.js.map\n\n/***/ }),\n/* 81 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\n/**\n * Evaluates a JSON string into a javascript object.\n *\n * @param {string} str A string containing JSON.\n * @return {*} The javascript object representing the specified JSON.\n */\nfunction jsonEval(str) {\n  return JSON.parse(str);\n}\nexports.jsonEval = jsonEval;\n/**\n * Returns JSON representing a javascript object.\n * @param {*} data Javascript object to be stringified.\n * @return {string} The JSON contents of the object.\n */\nfunction stringify(data) {\n  return JSON.stringify(data);\n}\nexports.stringify = stringify;\n\n//# sourceMappingURL=json.js.map\n\n/***/ }),\n/* 82 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nvar _typeof = typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; };\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\n// See http://www.devthought.com/2012/01/18/an-object-is-not-a-hash/\nexports.contains = function (obj, key) {\n    return Object.prototype.hasOwnProperty.call(obj, key);\n};\nexports.safeGet = function (obj, key) {\n    if (Object.prototype.hasOwnProperty.call(obj, key)) return obj[key];\n    // else return undefined.\n};\n/**\n * Enumerates the keys/values in an object, excluding keys defined on the prototype.\n *\n * @param {?Object.<K,V>} obj Object to enumerate.\n * @param {!function(K, V)} fn Function to call for each key and value.\n * @template K,V\n */\nexports.forEach = function (obj, fn) {\n    for (var key in obj) {\n        if (Object.prototype.hasOwnProperty.call(obj, key)) {\n            fn(key, obj[key]);\n        }\n    }\n};\n/**\n * Copies all the (own) properties from one object to another.\n * @param {!Object} objTo\n * @param {!Object} objFrom\n * @return {!Object} objTo\n */\nexports.extend = function (objTo, objFrom) {\n    exports.forEach(objFrom, function (key, value) {\n        objTo[key] = value;\n    });\n    return objTo;\n};\n/**\n * Returns a clone of the specified object.\n * @param {!Object} obj\n * @return {!Object} cloned obj.\n */\nexports.clone = function (obj) {\n    return exports.extend({}, obj);\n};\n/**\n * Returns true if obj has typeof \"object\" and is not null.  Unlike goog.isObject(), does not return true\n * for functions.\n *\n * @param obj {*} A potential object.\n * @returns {boolean} True if it's an object.\n */\nexports.isNonNullObject = function (obj) {\n    return (typeof obj === \"undefined\" ? \"undefined\" : _typeof(obj)) === 'object' && obj !== null;\n};\nexports.isEmpty = function (obj) {\n    for (var key in obj) {\n        return false;\n    }\n    return true;\n};\nexports.getCount = function (obj) {\n    var rv = 0;\n    for (var key in obj) {\n        rv++;\n    }\n    return rv;\n};\nexports.map = function (obj, f, opt_obj) {\n    var res = {};\n    for (var key in obj) {\n        res[key] = f.call(opt_obj, obj[key], key, obj);\n    }\n    return res;\n};\nexports.findKey = function (obj, fn, opt_this) {\n    for (var key in obj) {\n        if (fn.call(opt_this, obj[key], key, obj)) {\n            return key;\n        }\n    }\n    return undefined;\n};\nexports.findValue = function (obj, fn, opt_this) {\n    var key = exports.findKey(obj, fn, opt_this);\n    return key && obj[key];\n};\nexports.getAnyKey = function (obj) {\n    for (var key in obj) {\n        return key;\n    }\n};\nexports.getValues = function (obj) {\n    var res = [];\n    var i = 0;\n    for (var key in obj) {\n        res[i++] = obj[key];\n    }\n    return res;\n};\n/**\n * Tests whether every key/value pair in an object pass the test implemented\n * by the provided function\n *\n * @param {?Object.<K,V>} obj Object to test.\n * @param {!function(K, V)} fn Function to call for each key and value.\n * @template K,V\n */\nexports.every = function (obj, fn) {\n    for (var key in obj) {\n        if (Object.prototype.hasOwnProperty.call(obj, key)) {\n            if (!fn(key, obj[key])) {\n                return false;\n            }\n        }\n    }\n    return true;\n};\n\n//# sourceMappingURL=obj.js.map\n\n/***/ }),\n/* 83 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = __webpack_require__(2);\nvar parser_1 = __webpack_require__(84);\nvar Path_1 = __webpack_require__(4);\nvar Reference_1 = __webpack_require__(69);\nvar Repo_1 = __webpack_require__(39);\nvar RepoManager_1 = __webpack_require__(74);\nvar util_2 = __webpack_require__(0);\nvar validation_1 = __webpack_require__(11);\n/**\n * Class representing a firebase database.\n * @implements {FirebaseService}\n */\nvar Database = /** @class */function () {\n    /**\n     * The constructor should not be called by users of our public API.\n     * @param {!Repo} repo_\n     */\n    function Database(repo_) {\n        this.repo_ = repo_;\n        if (!(repo_ instanceof Repo_1.Repo)) {\n            util_1.fatal(\"Don't call new Database() directly - please use firebase.database().\");\n        }\n        /** @type {Reference} */\n        this.root_ = new Reference_1.Reference(repo_, Path_1.Path.Empty);\n        this.INTERNAL = new DatabaseInternals(this);\n    }\n    Object.defineProperty(Database.prototype, \"app\", {\n        get: function get() {\n            return this.repo_.app;\n        },\n        enumerable: true,\n        configurable: true\n    });\n    /**\n     * Returns a reference to the root or the path specified in opt_pathString.\n     * @param {string=} pathString\n     * @return {!Reference} Firebase reference.\n     */\n    Database.prototype.ref = function (pathString) {\n        this.checkDeleted_('ref');\n        util_2.validateArgCount('database.ref', 0, 1, arguments.length);\n        return pathString !== undefined ? this.root_.child(pathString) : this.root_;\n    };\n    /**\n     * Returns a reference to the root or the path specified in url.\n     * We throw a exception if the url is not in the same domain as the\n     * current repo.\n     * @param {string} url\n     * @return {!Reference} Firebase reference.\n     */\n    Database.prototype.refFromURL = function (url) {\n        /** @const {string} */\n        var apiName = 'database.refFromURL';\n        this.checkDeleted_(apiName);\n        util_2.validateArgCount(apiName, 1, 1, arguments.length);\n        var parsedURL = parser_1.parseRepoInfo(url);\n        validation_1.validateUrl(apiName, 1, parsedURL);\n        var repoInfo = parsedURL.repoInfo;\n        if (repoInfo.host !== this.repo_.repoInfo_.host) {\n            util_1.fatal(apiName + ': Host name does not match the current database: ' + '(found ' + repoInfo.host + ' but expected ' + this.repo_.repoInfo_.host + ')');\n        }\n        return this.ref(parsedURL.path.toString());\n    };\n    /**\n     * @param {string} apiName\n     */\n    Database.prototype.checkDeleted_ = function (apiName) {\n        if (this.repo_ === null) {\n            util_1.fatal('Cannot call ' + apiName + ' on a deleted database.');\n        }\n    };\n    // Make individual repo go offline.\n    Database.prototype.goOffline = function () {\n        util_2.validateArgCount('database.goOffline', 0, 0, arguments.length);\n        this.checkDeleted_('goOffline');\n        this.repo_.interrupt();\n    };\n    Database.prototype.goOnline = function () {\n        util_2.validateArgCount('database.goOnline', 0, 0, arguments.length);\n        this.checkDeleted_('goOnline');\n        this.repo_.resume();\n    };\n    Database.ServerValue = {\n        TIMESTAMP: {\n            '.sv': 'timestamp'\n        }\n    };\n    return Database;\n}();\nexports.Database = Database;\nvar DatabaseInternals = /** @class */function () {\n    /** @param {!Database} database */\n    function DatabaseInternals(database) {\n        this.database = database;\n    }\n    /** @return {Promise<void>} */\n    DatabaseInternals.prototype.delete = function () {\n        this.database.checkDeleted_('delete');\n        RepoManager_1.RepoManager.getInstance().deleteRepo(this.database.repo_);\n        this.database.repo_ = null;\n        this.database.root_ = null;\n        this.database.INTERNAL = null;\n        this.database = null;\n        return Promise.resolve();\n    };\n    return DatabaseInternals;\n}();\nexports.DatabaseInternals = DatabaseInternals;\n\n//# sourceMappingURL=Database.js.map\n\n/***/ }),\n/* 84 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar Path_1 = __webpack_require__(4);\nvar RepoInfo_1 = __webpack_require__(85);\nvar util_1 = __webpack_require__(2);\n/**\n * @param {!string} pathString\n * @return {string}\n */\nfunction decodePath(pathString) {\n    var pathStringDecoded = '';\n    var pieces = pathString.split('/');\n    for (var i = 0; i < pieces.length; i++) {\n        if (pieces[i].length > 0) {\n            var piece = pieces[i];\n            try {\n                piece = decodeURIComponent(piece.replace(/\\+/g, ' '));\n            } catch (e) {}\n            pathStringDecoded += '/' + piece;\n        }\n    }\n    return pathStringDecoded;\n}\n/**\n *\n * @param {!string} dataURL\n * @return {{repoInfo: !RepoInfo, path: !Path}}\n */\nexports.parseRepoInfo = function (dataURL) {\n    var parsedUrl = exports.parseURL(dataURL),\n        namespace = parsedUrl.subdomain;\n    if (parsedUrl.domain === 'firebase') {\n        util_1.fatal(parsedUrl.host + ' is no longer supported. ' + 'Please use <YOUR FIREBASE>.firebaseio.com instead');\n    }\n    // Catch common error of uninitialized namespace value.\n    if (!namespace || namespace == 'undefined') {\n        util_1.fatal('Cannot parse Firebase url. Please use https://<YOUR FIREBASE>.firebaseio.com');\n    }\n    if (!parsedUrl.secure) {\n        util_1.warnIfPageIsSecure();\n    }\n    var webSocketOnly = parsedUrl.scheme === 'ws' || parsedUrl.scheme === 'wss';\n    return {\n        repoInfo: new RepoInfo_1.RepoInfo(parsedUrl.host, parsedUrl.secure, namespace, webSocketOnly),\n        path: new Path_1.Path(parsedUrl.pathString)\n    };\n};\n/**\n *\n * @param {!string} dataURL\n * @return {{host: string, port: number, domain: string, subdomain: string, secure: boolean, scheme: string, pathString: string}}\n */\nexports.parseURL = function (dataURL) {\n    // Default to empty strings in the event of a malformed string.\n    var host = '',\n        domain = '',\n        subdomain = '',\n        pathString = '';\n    // Always default to SSL, unless otherwise specified.\n    var secure = true,\n        scheme = 'https',\n        port = 443;\n    // Don't do any validation here. The caller is responsible for validating the result of parsing.\n    if (typeof dataURL === 'string') {\n        // Parse scheme.\n        var colonInd = dataURL.indexOf('//');\n        if (colonInd >= 0) {\n            scheme = dataURL.substring(0, colonInd - 1);\n            dataURL = dataURL.substring(colonInd + 2);\n        }\n        // Parse host and path.\n        var slashInd = dataURL.indexOf('/');\n        if (slashInd === -1) {\n            slashInd = dataURL.length;\n        }\n        host = dataURL.substring(0, slashInd);\n        pathString = decodePath(dataURL.substring(slashInd));\n        var parts = host.split('.');\n        if (parts.length === 3) {\n            // Normalize namespaces to lowercase to share storage / connection.\n            domain = parts[1];\n            subdomain = parts[0].toLowerCase();\n        } else if (parts.length === 2) {\n            domain = parts[0];\n        }\n        // If we have a port, use scheme for determining if it's secure.\n        colonInd = host.indexOf(':');\n        if (colonInd >= 0) {\n            secure = scheme === 'https' || scheme === 'wss';\n            port = parseInt(host.substring(colonInd + 1), 10);\n        }\n    }\n    return {\n        host: host,\n        port: port,\n        domain: domain,\n        subdomain: subdomain,\n        secure: secure,\n        scheme: scheme,\n        pathString: pathString\n    };\n};\n\n//# sourceMappingURL=parser.js.map\n\n/***/ }),\n/* 85 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nvar _typeof = typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; };\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = __webpack_require__(0);\nvar util_2 = __webpack_require__(0);\nvar storage_1 = __webpack_require__(34);\nvar Constants_1 = __webpack_require__(35);\n/**\n * A class that holds metadata about a Repo object\n *\n * @constructor\n */\nvar RepoInfo = /** @class */function () {\n    /**\n     * @param {string} host Hostname portion of the url for the repo\n     * @param {boolean} secure Whether or not this repo is accessed over ssl\n     * @param {string} namespace The namespace represented by the repo\n     * @param {boolean} webSocketOnly Whether to prefer websockets over all other transports (used by Nest).\n     * @param {string=} persistenceKey Override the default session persistence storage key\n     */\n    function RepoInfo(host, secure, namespace, webSocketOnly, persistenceKey) {\n        if (persistenceKey === void 0) {\n            persistenceKey = '';\n        }\n        this.secure = secure;\n        this.namespace = namespace;\n        this.webSocketOnly = webSocketOnly;\n        this.persistenceKey = persistenceKey;\n        this.host = host.toLowerCase();\n        this.domain = this.host.substr(this.host.indexOf('.') + 1);\n        this.internalHost = storage_1.PersistentStorage.get('host:' + host) || this.host;\n    }\n    RepoInfo.prototype.needsQueryParam = function () {\n        return this.host !== this.internalHost;\n    };\n    RepoInfo.prototype.isCacheableHost = function () {\n        return this.internalHost.substr(0, 2) === 's-';\n    };\n    RepoInfo.prototype.isDemoHost = function () {\n        return this.domain === 'firebaseio-demo.com';\n    };\n    RepoInfo.prototype.isCustomHost = function () {\n        return this.domain !== 'firebaseio.com' && this.domain !== 'firebaseio-demo.com';\n    };\n    RepoInfo.prototype.updateHost = function (newHost) {\n        if (newHost !== this.internalHost) {\n            this.internalHost = newHost;\n            if (this.isCacheableHost()) {\n                storage_1.PersistentStorage.set('host:' + this.host, this.internalHost);\n            }\n        }\n    };\n    /**\n     * Returns the websocket URL for this repo\n     * @param {string} type of connection\n     * @param {Object} params list\n     * @return {string} The URL for this repo\n     */\n    RepoInfo.prototype.connectionURL = function (type, params) {\n        util_1.assert(typeof type === 'string', 'typeof type must == string');\n        util_1.assert((typeof params === \"undefined\" ? \"undefined\" : _typeof(params)) === 'object', 'typeof params must == object');\n        var connURL;\n        if (type === Constants_1.WEBSOCKET) {\n            connURL = (this.secure ? 'wss://' : 'ws://') + this.internalHost + '/.ws?';\n        } else if (type === Constants_1.LONG_POLLING) {\n            connURL = (this.secure ? 'https://' : 'http://') + this.internalHost + '/.lp?';\n        } else {\n            throw new Error('Unknown connection type: ' + type);\n        }\n        if (this.needsQueryParam()) {\n            params['ns'] = this.namespace;\n        }\n        var pairs = [];\n        util_2.forEach(params, function (key, value) {\n            pairs.push(key + '=' + value);\n        });\n        return connURL + pairs.join('&');\n    };\n    /** @return {string} */\n    RepoInfo.prototype.toString = function () {\n        var str = this.toURLString();\n        if (this.persistenceKey) {\n            str += '<' + this.persistenceKey + '>';\n        }\n        return str;\n    };\n    /** @return {string} */\n    RepoInfo.prototype.toURLString = function () {\n        return (this.secure ? 'https://' : 'http://') + this.host;\n    };\n    return RepoInfo;\n}();\nexports.RepoInfo = RepoInfo;\n\n//# sourceMappingURL=RepoInfo.js.map\n\n/***/ }),\n/* 86 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = __webpack_require__(0);\nvar validation_1 = __webpack_require__(11);\nvar util_2 = __webpack_require__(2);\nvar util_3 = __webpack_require__(0);\n/**\n * @constructor\n */\nvar OnDisconnect = /** @class */function () {\n    /**\n     * @param {!Repo} repo_\n     * @param {!Path} path_\n     */\n    function OnDisconnect(repo_, path_) {\n        this.repo_ = repo_;\n        this.path_ = path_;\n    }\n    /**\n     * @param {function(?Error)=} onComplete\n     * @return {!firebase.Promise}\n     */\n    OnDisconnect.prototype.cancel = function (onComplete) {\n        util_1.validateArgCount('OnDisconnect.cancel', 0, 1, arguments.length);\n        util_1.validateCallback('OnDisconnect.cancel', 1, onComplete, true);\n        var deferred = new util_3.Deferred();\n        this.repo_.onDisconnectCancel(this.path_, deferred.wrapCallback(onComplete));\n        return deferred.promise;\n    };\n    /**\n     * @param {function(?Error)=} onComplete\n     * @return {!firebase.Promise}\n     */\n    OnDisconnect.prototype.remove = function (onComplete) {\n        util_1.validateArgCount('OnDisconnect.remove', 0, 1, arguments.length);\n        validation_1.validateWritablePath('OnDisconnect.remove', this.path_);\n        util_1.validateCallback('OnDisconnect.remove', 1, onComplete, true);\n        var deferred = new util_3.Deferred();\n        this.repo_.onDisconnectSet(this.path_, null, deferred.wrapCallback(onComplete));\n        return deferred.promise;\n    };\n    /**\n     * @param {*} value\n     * @param {function(?Error)=} onComplete\n     * @return {!firebase.Promise}\n     */\n    OnDisconnect.prototype.set = function (value, onComplete) {\n        util_1.validateArgCount('OnDisconnect.set', 1, 2, arguments.length);\n        validation_1.validateWritablePath('OnDisconnect.set', this.path_);\n        validation_1.validateFirebaseDataArg('OnDisconnect.set', 1, value, this.path_, false);\n        util_1.validateCallback('OnDisconnect.set', 2, onComplete, true);\n        var deferred = new util_3.Deferred();\n        this.repo_.onDisconnectSet(this.path_, value, deferred.wrapCallback(onComplete));\n        return deferred.promise;\n    };\n    /**\n     * @param {*} value\n     * @param {number|string|null} priority\n     * @param {function(?Error)=} onComplete\n     * @return {!firebase.Promise}\n     */\n    OnDisconnect.prototype.setWithPriority = function (value, priority, onComplete) {\n        util_1.validateArgCount('OnDisconnect.setWithPriority', 2, 3, arguments.length);\n        validation_1.validateWritablePath('OnDisconnect.setWithPriority', this.path_);\n        validation_1.validateFirebaseDataArg('OnDisconnect.setWithPriority', 1, value, this.path_, false);\n        validation_1.validatePriority('OnDisconnect.setWithPriority', 2, priority, false);\n        util_1.validateCallback('OnDisconnect.setWithPriority', 3, onComplete, true);\n        var deferred = new util_3.Deferred();\n        this.repo_.onDisconnectSetWithPriority(this.path_, value, priority, deferred.wrapCallback(onComplete));\n        return deferred.promise;\n    };\n    /**\n     * @param {!Object} objectToMerge\n     * @param {function(?Error)=} onComplete\n     * @return {!firebase.Promise}\n     */\n    OnDisconnect.prototype.update = function (objectToMerge, onComplete) {\n        util_1.validateArgCount('OnDisconnect.update', 1, 2, arguments.length);\n        validation_1.validateWritablePath('OnDisconnect.update', this.path_);\n        if (Array.isArray(objectToMerge)) {\n            var newObjectToMerge = {};\n            for (var i = 0; i < objectToMerge.length; ++i) {\n                newObjectToMerge['' + i] = objectToMerge[i];\n            }\n            objectToMerge = newObjectToMerge;\n            util_2.warn('Passing an Array to firebase.database.onDisconnect().update() is deprecated. Use set() if you want to overwrite the ' + 'existing data, or an Object with integer keys if you really do want to only update some of the children.');\n        }\n        validation_1.validateFirebaseMergeDataArg('OnDisconnect.update', 1, objectToMerge, this.path_, false);\n        util_1.validateCallback('OnDisconnect.update', 2, onComplete, true);\n        var deferred = new util_3.Deferred();\n        this.repo_.onDisconnectUpdate(this.path_, objectToMerge, deferred.wrapCallback(onComplete));\n        return deferred.promise;\n    };\n    return OnDisconnect;\n}();\nexports.OnDisconnect = OnDisconnect;\n\n//# sourceMappingURL=onDisconnect.js.map\n\n/***/ }),\n/* 87 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nvar _typeof = typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; };\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = __webpack_require__(0);\nvar KeyIndex_1 = __webpack_require__(22);\nvar PriorityIndex_1 = __webpack_require__(6);\nvar ValueIndex_1 = __webpack_require__(89);\nvar PathIndex_1 = __webpack_require__(93);\nvar util_2 = __webpack_require__(2);\nvar Path_1 = __webpack_require__(4);\nvar validation_1 = __webpack_require__(11);\nvar util_3 = __webpack_require__(0);\nvar EventRegistration_1 = __webpack_require__(162);\nvar util_4 = __webpack_require__(0);\nvar __referenceConstructor;\n/**\n * A Query represents a filter to be applied to a firebase location.  This object purely represents the\n * query expression (and exposes our public API to build the query).  The actual query logic is in ViewBase.js.\n *\n * Since every Firebase reference is a query, Firebase inherits from this object.\n */\nvar Query = /** @class */function () {\n    function Query(repo, path, queryParams_, orderByCalled_) {\n        this.repo = repo;\n        this.path = path;\n        this.queryParams_ = queryParams_;\n        this.orderByCalled_ = orderByCalled_;\n    }\n    Object.defineProperty(Query, \"__referenceConstructor\", {\n        get: function get() {\n            util_1.assert(__referenceConstructor, 'Reference.ts has not been loaded');\n            return __referenceConstructor;\n        },\n        set: function set(val) {\n            __referenceConstructor = val;\n        },\n        enumerable: true,\n        configurable: true\n    });\n    /**\n     * Validates start/end values for queries.\n     * @param {!QueryParams} params\n     * @private\n     */\n    Query.validateQueryEndpoints_ = function (params) {\n        var startNode = null;\n        var endNode = null;\n        if (params.hasStart()) {\n            startNode = params.getIndexStartValue();\n        }\n        if (params.hasEnd()) {\n            endNode = params.getIndexEndValue();\n        }\n        if (params.getIndex() === KeyIndex_1.KEY_INDEX) {\n            var tooManyArgsError = 'Query: When ordering by key, you may only pass one argument to ' + 'startAt(), endAt(), or equalTo().';\n            var wrongArgTypeError = 'Query: When ordering by key, the argument passed to startAt(), endAt(),' + 'or equalTo() must be a string.';\n            if (params.hasStart()) {\n                var startName = params.getIndexStartName();\n                if (startName != util_2.MIN_NAME) {\n                    throw new Error(tooManyArgsError);\n                } else if (typeof startNode !== 'string') {\n                    throw new Error(wrongArgTypeError);\n                }\n            }\n            if (params.hasEnd()) {\n                var endName = params.getIndexEndName();\n                if (endName != util_2.MAX_NAME) {\n                    throw new Error(tooManyArgsError);\n                } else if (typeof endNode !== 'string') {\n                    throw new Error(wrongArgTypeError);\n                }\n            }\n        } else if (params.getIndex() === PriorityIndex_1.PRIORITY_INDEX) {\n            if (startNode != null && !validation_1.isValidPriority(startNode) || endNode != null && !validation_1.isValidPriority(endNode)) {\n                throw new Error('Query: When ordering by priority, the first argument passed to startAt(), ' + 'endAt(), or equalTo() must be a valid priority value (null, a number, or a string).');\n            }\n        } else {\n            util_1.assert(params.getIndex() instanceof PathIndex_1.PathIndex || params.getIndex() === ValueIndex_1.VALUE_INDEX, 'unknown index type.');\n            if (startNode != null && (typeof startNode === \"undefined\" ? \"undefined\" : _typeof(startNode)) === 'object' || endNode != null && (typeof endNode === \"undefined\" ? \"undefined\" : _typeof(endNode)) === 'object') {\n                throw new Error('Query: First argument passed to startAt(), endAt(), or equalTo() cannot be ' + 'an object.');\n            }\n        }\n    };\n    /**\n     * Validates that limit* has been called with the correct combination of parameters\n     * @param {!QueryParams} params\n     * @private\n     */\n    Query.validateLimit_ = function (params) {\n        if (params.hasStart() && params.hasEnd() && params.hasLimit() && !params.hasAnchoredLimit()) {\n            throw new Error(\"Query: Can't combine startAt(), endAt(), and limit(). Use limitToFirst() or limitToLast() instead.\");\n        }\n    };\n    /**\n     * Validates that no other order by call has been made\n     * @param {!string} fnName\n     * @private\n     */\n    Query.prototype.validateNoPreviousOrderByCall_ = function (fnName) {\n        if (this.orderByCalled_ === true) {\n            throw new Error(fnName + \": You can't combine multiple orderBy calls.\");\n        }\n    };\n    /**\n     * @return {!QueryParams}\n     */\n    Query.prototype.getQueryParams = function () {\n        return this.queryParams_;\n    };\n    /**\n     * @return {!Reference}\n     */\n    Query.prototype.getRef = function () {\n        util_3.validateArgCount('Query.ref', 0, 0, arguments.length);\n        // This is a slight hack. We cannot goog.require('fb.api.Firebase'), since Firebase requires fb.api.Query.\n        // However, we will always export 'Firebase' to the global namespace, so it's guaranteed to exist by the time this\n        // method gets called.\n        return new Query.__referenceConstructor(this.repo, this.path);\n    };\n    /**\n     * @param {!string} eventType\n     * @param {!function(DataSnapshot, string=)} callback\n     * @param {(function(Error)|Object)=} cancelCallbackOrContext\n     * @param {Object=} context\n     * @return {!function(DataSnapshot, string=)}\n     */\n    Query.prototype.on = function (eventType, callback, cancelCallbackOrContext, context) {\n        util_3.validateArgCount('Query.on', 2, 4, arguments.length);\n        validation_1.validateEventType('Query.on', 1, eventType, false);\n        util_3.validateCallback('Query.on', 2, callback, false);\n        var ret = Query.getCancelAndContextArgs_('Query.on', cancelCallbackOrContext, context);\n        if (eventType === 'value') {\n            this.onValueEvent(callback, ret.cancel, ret.context);\n        } else {\n            var callbacks = {};\n            callbacks[eventType] = callback;\n            this.onChildEvent(callbacks, ret.cancel, ret.context);\n        }\n        return callback;\n    };\n    /**\n     * @param {!function(!DataSnapshot)} callback\n     * @param {?function(Error)} cancelCallback\n     * @param {?Object} context\n     * @protected\n     */\n    Query.prototype.onValueEvent = function (callback, cancelCallback, context) {\n        var container = new EventRegistration_1.ValueEventRegistration(callback, cancelCallback || null, context || null);\n        this.repo.addEventCallbackForQuery(this, container);\n    };\n    /**\n     * @param {!Object.<string, !function(!DataSnapshot, ?string)>} callbacks\n     * @param {?function(Error)} cancelCallback\n     * @param {?Object} context\n     * @protected\n     */\n    Query.prototype.onChildEvent = function (callbacks, cancelCallback, context) {\n        var container = new EventRegistration_1.ChildEventRegistration(callbacks, cancelCallback, context);\n        this.repo.addEventCallbackForQuery(this, container);\n    };\n    /**\n     * @param {string=} eventType\n     * @param {(function(!DataSnapshot, ?string=))=} callback\n     * @param {Object=} context\n     */\n    Query.prototype.off = function (eventType, callback, context) {\n        util_3.validateArgCount('Query.off', 0, 3, arguments.length);\n        validation_1.validateEventType('Query.off', 1, eventType, true);\n        util_3.validateCallback('Query.off', 2, callback, true);\n        util_3.validateContextObject('Query.off', 3, context, true);\n        var container = null;\n        var callbacks = null;\n        if (eventType === 'value') {\n            var valueCallback = callback || null;\n            container = new EventRegistration_1.ValueEventRegistration(valueCallback, null, context || null);\n        } else if (eventType) {\n            if (callback) {\n                callbacks = {};\n                callbacks[eventType] = callback;\n            }\n            container = new EventRegistration_1.ChildEventRegistration(callbacks, null, context || null);\n        }\n        this.repo.removeEventCallbackForQuery(this, container);\n    };\n    /**\n     * Attaches a listener, waits for the first event, and then removes the listener\n     * @param {!string} eventType\n     * @param {!function(!DataSnapshot, string=)} userCallback\n     * @param cancelOrContext\n     * @param context\n     * @return {!firebase.Promise}\n     */\n    Query.prototype.once = function (eventType, userCallback, cancelOrContext, context) {\n        var _this = this;\n        util_3.validateArgCount('Query.once', 1, 4, arguments.length);\n        validation_1.validateEventType('Query.once', 1, eventType, false);\n        util_3.validateCallback('Query.once', 2, userCallback, true);\n        var ret = Query.getCancelAndContextArgs_('Query.once', cancelOrContext, context);\n        // TODO: Implement this more efficiently (in particular, use 'get' wire protocol for 'value' event)\n        // TODO: consider actually wiring the callbacks into the promise. We cannot do this without a breaking change\n        // because the API currently expects callbacks will be called synchronously if the data is cached, but this is\n        // against the Promise specification.\n        var firstCall = true;\n        var deferred = new util_4.Deferred();\n        // A dummy error handler in case a user wasn't expecting promises\n        deferred.promise.catch(function () {});\n        var onceCallback = function onceCallback(snapshot) {\n            // NOTE: Even though we unsubscribe, we may get called multiple times if a single action (e.g. set() with JSON)\n            // triggers multiple events (e.g. child_added or child_changed).\n            if (firstCall) {\n                firstCall = false;\n                _this.off(eventType, onceCallback);\n                if (userCallback) {\n                    userCallback.bind(ret.context)(snapshot);\n                }\n                deferred.resolve(snapshot);\n            }\n        };\n        this.on(eventType, onceCallback,\n        /*cancel=*/function (err) {\n            _this.off(eventType, onceCallback);\n            if (ret.cancel) ret.cancel.bind(ret.context)(err);\n            deferred.reject(err);\n        });\n        return deferred.promise;\n    };\n    /**\n     * Set a limit and anchor it to the start of the window.\n     * @param {!number} limit\n     * @return {!Query}\n     */\n    Query.prototype.limitToFirst = function (limit) {\n        util_3.validateArgCount('Query.limitToFirst', 1, 1, arguments.length);\n        if (typeof limit !== 'number' || Math.floor(limit) !== limit || limit <= 0) {\n            throw new Error('Query.limitToFirst: First argument must be a positive integer.');\n        }\n        if (this.queryParams_.hasLimit()) {\n            throw new Error('Query.limitToFirst: Limit was already set (by another call to limit, ' + 'limitToFirst, or limitToLast).');\n        }\n        return new Query(this.repo, this.path, this.queryParams_.limitToFirst(limit), this.orderByCalled_);\n    };\n    /**\n     * Set a limit and anchor it to the end of the window.\n     * @param {!number} limit\n     * @return {!Query}\n     */\n    Query.prototype.limitToLast = function (limit) {\n        util_3.validateArgCount('Query.limitToLast', 1, 1, arguments.length);\n        if (typeof limit !== 'number' || Math.floor(limit) !== limit || limit <= 0) {\n            throw new Error('Query.limitToLast: First argument must be a positive integer.');\n        }\n        if (this.queryParams_.hasLimit()) {\n            throw new Error('Query.limitToLast: Limit was already set (by another call to limit, ' + 'limitToFirst, or limitToLast).');\n        }\n        return new Query(this.repo, this.path, this.queryParams_.limitToLast(limit), this.orderByCalled_);\n    };\n    /**\n     * Given a child path, return a new query ordered by the specified grandchild path.\n     * @param {!string} path\n     * @return {!Query}\n     */\n    Query.prototype.orderByChild = function (path) {\n        util_3.validateArgCount('Query.orderByChild', 1, 1, arguments.length);\n        if (path === '$key') {\n            throw new Error('Query.orderByChild: \"$key\" is invalid.  Use Query.orderByKey() instead.');\n        } else if (path === '$priority') {\n            throw new Error('Query.orderByChild: \"$priority\" is invalid.  Use Query.orderByPriority() instead.');\n        } else if (path === '$value') {\n            throw new Error('Query.orderByChild: \"$value\" is invalid.  Use Query.orderByValue() instead.');\n        }\n        validation_1.validatePathString('Query.orderByChild', 1, path, false);\n        this.validateNoPreviousOrderByCall_('Query.orderByChild');\n        var parsedPath = new Path_1.Path(path);\n        if (parsedPath.isEmpty()) {\n            throw new Error('Query.orderByChild: cannot pass in empty path.  Use Query.orderByValue() instead.');\n        }\n        var index = new PathIndex_1.PathIndex(parsedPath);\n        var newParams = this.queryParams_.orderBy(index);\n        Query.validateQueryEndpoints_(newParams);\n        return new Query(this.repo, this.path, newParams, /*orderByCalled=*/true);\n    };\n    /**\n     * Return a new query ordered by the KeyIndex\n     * @return {!Query}\n     */\n    Query.prototype.orderByKey = function () {\n        util_3.validateArgCount('Query.orderByKey', 0, 0, arguments.length);\n        this.validateNoPreviousOrderByCall_('Query.orderByKey');\n        var newParams = this.queryParams_.orderBy(KeyIndex_1.KEY_INDEX);\n        Query.validateQueryEndpoints_(newParams);\n        return new Query(this.repo, this.path, newParams, /*orderByCalled=*/true);\n    };\n    /**\n     * Return a new query ordered by the PriorityIndex\n     * @return {!Query}\n     */\n    Query.prototype.orderByPriority = function () {\n        util_3.validateArgCount('Query.orderByPriority', 0, 0, arguments.length);\n        this.validateNoPreviousOrderByCall_('Query.orderByPriority');\n        var newParams = this.queryParams_.orderBy(PriorityIndex_1.PRIORITY_INDEX);\n        Query.validateQueryEndpoints_(newParams);\n        return new Query(this.repo, this.path, newParams, /*orderByCalled=*/true);\n    };\n    /**\n     * Return a new query ordered by the ValueIndex\n     * @return {!Query}\n     */\n    Query.prototype.orderByValue = function () {\n        util_3.validateArgCount('Query.orderByValue', 0, 0, arguments.length);\n        this.validateNoPreviousOrderByCall_('Query.orderByValue');\n        var newParams = this.queryParams_.orderBy(ValueIndex_1.VALUE_INDEX);\n        Query.validateQueryEndpoints_(newParams);\n        return new Query(this.repo, this.path, newParams, /*orderByCalled=*/true);\n    };\n    /**\n     * @param {number|string|boolean|null} value\n     * @param {?string=} name\n     * @return {!Query}\n     */\n    Query.prototype.startAt = function (value, name) {\n        if (value === void 0) {\n            value = null;\n        }\n        util_3.validateArgCount('Query.startAt', 0, 2, arguments.length);\n        validation_1.validateFirebaseDataArg('Query.startAt', 1, value, this.path, true);\n        validation_1.validateKey('Query.startAt', 2, name, true);\n        var newParams = this.queryParams_.startAt(value, name);\n        Query.validateLimit_(newParams);\n        Query.validateQueryEndpoints_(newParams);\n        if (this.queryParams_.hasStart()) {\n            throw new Error('Query.startAt: Starting point was already set (by another call to startAt ' + 'or equalTo).');\n        }\n        // Calling with no params tells us to start at the beginning.\n        if (value === undefined) {\n            value = null;\n            name = null;\n        }\n        return new Query(this.repo, this.path, newParams, this.orderByCalled_);\n    };\n    /**\n     * @param {number|string|boolean|null} value\n     * @param {?string=} name\n     * @return {!Query}\n     */\n    Query.prototype.endAt = function (value, name) {\n        if (value === void 0) {\n            value = null;\n        }\n        util_3.validateArgCount('Query.endAt', 0, 2, arguments.length);\n        validation_1.validateFirebaseDataArg('Query.endAt', 1, value, this.path, true);\n        validation_1.validateKey('Query.endAt', 2, name, true);\n        var newParams = this.queryParams_.endAt(value, name);\n        Query.validateLimit_(newParams);\n        Query.validateQueryEndpoints_(newParams);\n        if (this.queryParams_.hasEnd()) {\n            throw new Error('Query.endAt: Ending point was already set (by another call to endAt or ' + 'equalTo).');\n        }\n        return new Query(this.repo, this.path, newParams, this.orderByCalled_);\n    };\n    /**\n     * Load the selection of children with exactly the specified value, and, optionally,\n     * the specified name.\n     * @param {number|string|boolean|null} value\n     * @param {string=} name\n     * @return {!Query}\n     */\n    Query.prototype.equalTo = function (value, name) {\n        util_3.validateArgCount('Query.equalTo', 1, 2, arguments.length);\n        validation_1.validateFirebaseDataArg('Query.equalTo', 1, value, this.path, false);\n        validation_1.validateKey('Query.equalTo', 2, name, true);\n        if (this.queryParams_.hasStart()) {\n            throw new Error('Query.equalTo: Starting point was already set (by another call to startAt or ' + 'equalTo).');\n        }\n        if (this.queryParams_.hasEnd()) {\n            throw new Error('Query.equalTo: Ending point was already set (by another call to endAt or ' + 'equalTo).');\n        }\n        return this.startAt(value, name).endAt(value, name);\n    };\n    /**\n     * @return {!string} URL for this location.\n     */\n    Query.prototype.toString = function () {\n        util_3.validateArgCount('Query.toString', 0, 0, arguments.length);\n        return this.repo.toString() + this.path.toUrlEncodedString();\n    };\n    // Do not create public documentation. This is intended to make JSON serialization work but is otherwise unnecessary\n    // for end-users.\n    Query.prototype.toJSON = function () {\n        // An optional spacer argument is unnecessary for a string.\n        util_3.validateArgCount('Query.toJSON', 0, 1, arguments.length);\n        return this.toString();\n    };\n    /**\n     * An object representation of the query parameters used by this Query.\n     * @return {!Object}\n     */\n    Query.prototype.queryObject = function () {\n        return this.queryParams_.getQueryObject();\n    };\n    /**\n     * @return {!string}\n     */\n    Query.prototype.queryIdentifier = function () {\n        var obj = this.queryObject();\n        var id = util_2.ObjectToUniqueKey(obj);\n        return id === '{}' ? 'default' : id;\n    };\n    /**\n     * Return true if this query and the provided query are equivalent; otherwise, return false.\n     * @param {Query} other\n     * @return {boolean}\n     */\n    Query.prototype.isEqual = function (other) {\n        util_3.validateArgCount('Query.isEqual', 1, 1, arguments.length);\n        if (!(other instanceof Query)) {\n            var error = 'Query.isEqual failed: First argument must be an instance of firebase.database.Query.';\n            throw new Error(error);\n        }\n        var sameRepo = this.repo === other.repo;\n        var samePath = this.path.equals(other.path);\n        var sameQueryIdentifier = this.queryIdentifier() === other.queryIdentifier();\n        return sameRepo && samePath && sameQueryIdentifier;\n    };\n    /**\n     * Helper used by .on and .once to extract the context and or cancel arguments.\n     * @param {!string} fnName The function name (on or once)\n     * @param {(function(Error)|Object)=} cancelOrContext\n     * @param {Object=} context\n     * @return {{cancel: ?function(Error), context: ?Object}}\n     * @private\n     */\n    Query.getCancelAndContextArgs_ = function (fnName, cancelOrContext, context) {\n        var ret = { cancel: null, context: null };\n        if (cancelOrContext && context) {\n            ret.cancel = cancelOrContext;\n            util_3.validateCallback(fnName, 3, ret.cancel, true);\n            ret.context = context;\n            util_3.validateContextObject(fnName, 4, ret.context, true);\n        } else if (cancelOrContext) {\n            // we have either a cancel callback or a context.\n            if ((typeof cancelOrContext === \"undefined\" ? \"undefined\" : _typeof(cancelOrContext)) === 'object' && cancelOrContext !== null) {\n                // it's a context!\n                ret.context = cancelOrContext;\n            } else if (typeof cancelOrContext === 'function') {\n                ret.cancel = cancelOrContext;\n            } else {\n                throw new Error(util_3.errorPrefix(fnName, 3, true) + ' must either be a cancel callback or a context object.');\n            }\n        }\n        return ret;\n    };\n    Object.defineProperty(Query.prototype, \"ref\", {\n        get: function get() {\n            return this.getRef();\n        },\n        enumerable: true,\n        configurable: true\n    });\n    return Query;\n}();\nexports.Query = Query;\n\n//# sourceMappingURL=Query.js.map\n\n/***/ }),\n/* 88 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nvar _typeof = typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; };\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = __webpack_require__(0);\nvar util_2 = __webpack_require__(2);\nvar util_3 = __webpack_require__(0);\nvar MAX_NODE;\nfunction setMaxNode(val) {\n    MAX_NODE = val;\n}\nexports.setMaxNode = setMaxNode;\n/**\n * @param {(!string|!number)} priority\n * @return {!string}\n */\nexports.priorityHashText = function (priority) {\n    if (typeof priority === 'number') return 'number:' + util_2.doubleToIEEE754String(priority);else return 'string:' + priority;\n};\n/**\n * Validates that a priority snapshot Node is valid.\n *\n * @param {!Node} priorityNode\n */\nexports.validatePriorityNode = function (priorityNode) {\n    if (priorityNode.isLeafNode()) {\n        var val = priorityNode.val();\n        util_1.assert(typeof val === 'string' || typeof val === 'number' || (typeof val === \"undefined\" ? \"undefined\" : _typeof(val)) === 'object' && util_3.contains(val, '.sv'), 'Priority must be a string or number.');\n    } else {\n        util_1.assert(priorityNode === MAX_NODE || priorityNode.isEmpty(), 'priority of unexpected type.');\n    }\n    // Don't call getPriority() on MAX_NODE to avoid hitting assertion.\n    util_1.assert(priorityNode === MAX_NODE || priorityNode.getPriority().isEmpty(), \"Priority nodes can't have a priority of their own.\");\n};\n\n//# sourceMappingURL=snap.js.map\n\n/***/ }),\n/* 89 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nvar __extends = undefined && undefined.__extends || function () {\n    var extendStatics = Object.setPrototypeOf || { __proto__: [] } instanceof Array && function (d, b) {\n        d.__proto__ = b;\n    } || function (d, b) {\n        for (var p in b) {\n            if (b.hasOwnProperty(p)) d[p] = b[p];\n        }\n    };\n    return function (d, b) {\n        extendStatics(d, b);\n        function __() {\n            this.constructor = d;\n        }\n        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n    };\n}();\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar Index_1 = __webpack_require__(36);\nvar Node_1 = __webpack_require__(8);\nvar util_1 = __webpack_require__(2);\nvar nodeFromJSON_1 = __webpack_require__(23);\n/**\n * @constructor\n * @extends {Index}\n * @private\n */\nvar ValueIndex = /** @class */function (_super) {\n    __extends(ValueIndex, _super);\n    function ValueIndex() {\n        return _super !== null && _super.apply(this, arguments) || this;\n    }\n    /**\n     * @inheritDoc\n     */\n    ValueIndex.prototype.compare = function (a, b) {\n        var indexCmp = a.node.compareTo(b.node);\n        if (indexCmp === 0) {\n            return util_1.nameCompare(a.name, b.name);\n        } else {\n            return indexCmp;\n        }\n    };\n    /**\n     * @inheritDoc\n     */\n    ValueIndex.prototype.isDefinedOn = function (node) {\n        return true;\n    };\n    /**\n     * @inheritDoc\n     */\n    ValueIndex.prototype.indexedValueChanged = function (oldNode, newNode) {\n        return !oldNode.equals(newNode);\n    };\n    /**\n     * @inheritDoc\n     */\n    ValueIndex.prototype.minPost = function () {\n        return Node_1.NamedNode.MIN;\n    };\n    /**\n     * @inheritDoc\n     */\n    ValueIndex.prototype.maxPost = function () {\n        return Node_1.NamedNode.MAX;\n    };\n    /**\n     * @param {*} indexValue\n     * @param {string} name\n     * @return {!NamedNode}\n     */\n    ValueIndex.prototype.makePost = function (indexValue, name) {\n        var valueNode = nodeFromJSON_1.nodeFromJSON(indexValue);\n        return new Node_1.NamedNode(name, valueNode);\n    };\n    /**\n     * @return {!string} String representation for inclusion in a query spec\n     */\n    ValueIndex.prototype.toString = function () {\n        return '.value';\n    };\n    return ValueIndex;\n}(Index_1.Index);\nexports.ValueIndex = ValueIndex;\nexports.VALUE_INDEX = new ValueIndex();\n\n//# sourceMappingURL=ValueIndex.js.map\n\n/***/ }),\n/* 90 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = __webpack_require__(0);\nvar childSet_1 = __webpack_require__(91);\nvar util_2 = __webpack_require__(0);\nvar Node_1 = __webpack_require__(8);\nvar PriorityIndex_1 = __webpack_require__(6);\nvar KeyIndex_1 = __webpack_require__(22);\nvar _defaultIndexMap;\nvar fallbackObject = {};\n/**\n *\n * @param {Object.<string, FallbackType|SortedMap.<NamedNode, Node>>} indexes\n * @param {Object.<string, Index>} indexSet\n * @constructor\n */\nvar IndexMap = /** @class */function () {\n    function IndexMap(indexes_, indexSet_) {\n        this.indexes_ = indexes_;\n        this.indexSet_ = indexSet_;\n    }\n    Object.defineProperty(IndexMap, \"Default\", {\n        /**\n         * The default IndexMap for nodes without a priority\n         * @type {!IndexMap}\n         * @const\n         */\n        get: function get() {\n            util_1.assert(fallbackObject && PriorityIndex_1.PRIORITY_INDEX, 'ChildrenNode.ts has not been loaded');\n            _defaultIndexMap = _defaultIndexMap || new IndexMap({ '.priority': fallbackObject }, { '.priority': PriorityIndex_1.PRIORITY_INDEX });\n            return _defaultIndexMap;\n        },\n        enumerable: true,\n        configurable: true\n    });\n    /**\n     *\n     * @param {!string} indexKey\n     * @return {?SortedMap.<NamedNode, Node>}\n     */\n    IndexMap.prototype.get = function (indexKey) {\n        var sortedMap = util_2.safeGet(this.indexes_, indexKey);\n        if (!sortedMap) throw new Error('No index defined for ' + indexKey);\n        if (sortedMap === fallbackObject) {\n            // The index exists, but it falls back to just name comparison. Return null so that the calling code uses the\n            // regular child map\n            return null;\n        } else {\n            return sortedMap;\n        }\n    };\n    /**\n     * @param {!Index} indexDefinition\n     * @return {boolean}\n     */\n    IndexMap.prototype.hasIndex = function (indexDefinition) {\n        return util_2.contains(this.indexSet_, indexDefinition.toString());\n    };\n    /**\n     * @param {!Index} indexDefinition\n     * @param {!SortedMap.<string, !Node>} existingChildren\n     * @return {!IndexMap}\n     */\n    IndexMap.prototype.addIndex = function (indexDefinition, existingChildren) {\n        util_1.assert(indexDefinition !== KeyIndex_1.KEY_INDEX, \"KeyIndex always exists and isn't meant to be added to the IndexMap.\");\n        var childList = [];\n        var sawIndexedValue = false;\n        var iter = existingChildren.getIterator(Node_1.NamedNode.Wrap);\n        var next = iter.getNext();\n        while (next) {\n            sawIndexedValue = sawIndexedValue || indexDefinition.isDefinedOn(next.node);\n            childList.push(next);\n            next = iter.getNext();\n        }\n        var newIndex;\n        if (sawIndexedValue) {\n            newIndex = childSet_1.buildChildSet(childList, indexDefinition.getCompare());\n        } else {\n            newIndex = fallbackObject;\n        }\n        var indexName = indexDefinition.toString();\n        var newIndexSet = util_2.clone(this.indexSet_);\n        newIndexSet[indexName] = indexDefinition;\n        var newIndexes = util_2.clone(this.indexes_);\n        newIndexes[indexName] = newIndex;\n        return new IndexMap(newIndexes, newIndexSet);\n    };\n    /**\n     * Ensure that this node is properly tracked in any indexes that we're maintaining\n     * @param {!NamedNode} namedNode\n     * @param {!SortedMap.<string, !Node>} existingChildren\n     * @return {!IndexMap}\n     */\n    IndexMap.prototype.addToIndexes = function (namedNode, existingChildren) {\n        var _this = this;\n        var newIndexes = util_2.map(this.indexes_, function (indexedChildren, indexName) {\n            var index = util_2.safeGet(_this.indexSet_, indexName);\n            util_1.assert(index, 'Missing index implementation for ' + indexName);\n            if (indexedChildren === fallbackObject) {\n                // Check to see if we need to index everything\n                if (index.isDefinedOn(namedNode.node)) {\n                    // We need to build this index\n                    var childList = [];\n                    var iter = existingChildren.getIterator(Node_1.NamedNode.Wrap);\n                    var next = iter.getNext();\n                    while (next) {\n                        if (next.name != namedNode.name) {\n                            childList.push(next);\n                        }\n                        next = iter.getNext();\n                    }\n                    childList.push(namedNode);\n                    return childSet_1.buildChildSet(childList, index.getCompare());\n                } else {\n                    // No change, this remains a fallback\n                    return fallbackObject;\n                }\n            } else {\n                var existingSnap = existingChildren.get(namedNode.name);\n                var newChildren = indexedChildren;\n                if (existingSnap) {\n                    newChildren = newChildren.remove(new Node_1.NamedNode(namedNode.name, existingSnap));\n                }\n                return newChildren.insert(namedNode, namedNode.node);\n            }\n        });\n        return new IndexMap(newIndexes, this.indexSet_);\n    };\n    /**\n     * Create a new IndexMap instance with the given value removed\n     * @param {!NamedNode} namedNode\n     * @param {!SortedMap.<string, !Node>} existingChildren\n     * @return {!IndexMap}\n     */\n    IndexMap.prototype.removeFromIndexes = function (namedNode, existingChildren) {\n        var newIndexes = util_2.map(this.indexes_, function (indexedChildren) {\n            if (indexedChildren === fallbackObject) {\n                // This is the fallback. Just return it, nothing to do in this case\n                return indexedChildren;\n            } else {\n                var existingSnap = existingChildren.get(namedNode.name);\n                if (existingSnap) {\n                    return indexedChildren.remove(new Node_1.NamedNode(namedNode.name, existingSnap));\n                } else {\n                    // No record of this child\n                    return indexedChildren;\n                }\n            }\n        });\n        return new IndexMap(newIndexes, this.indexSet_);\n    };\n    return IndexMap;\n}();\nexports.IndexMap = IndexMap;\n\n//# sourceMappingURL=IndexMap.js.map\n\n/***/ }),\n/* 91 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar SortedMap_1 = __webpack_require__(38);\nvar SortedMap_2 = __webpack_require__(38);\nvar LOG_2 = Math.log(2);\n/**\n * @constructor\n */\nvar Base12Num = /** @class */function () {\n    /**\n     * @param {number} length\n     */\n    function Base12Num(length) {\n        var logBase2 = function logBase2(num) {\n            return parseInt(Math.log(num) / LOG_2, 10);\n        };\n        var bitMask = function bitMask(bits) {\n            return parseInt(Array(bits + 1).join('1'), 2);\n        };\n        this.count = logBase2(length + 1);\n        this.current_ = this.count - 1;\n        var mask = bitMask(this.count);\n        this.bits_ = length + 1 & mask;\n    }\n    /**\n     * @return {boolean}\n     */\n    Base12Num.prototype.nextBitIsOne = function () {\n        //noinspection JSBitwiseOperatorUsage\n        var result = !(this.bits_ & 0x1 << this.current_);\n        this.current_--;\n        return result;\n    };\n    return Base12Num;\n}();\n/**\n * Takes a list of child nodes and constructs a SortedSet using the given comparison\n * function\n *\n * Uses the algorithm described in the paper linked here:\n * http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.46.1458\n *\n * @template K, V\n * @param {Array.<!NamedNode>} childList Unsorted list of children\n * @param {function(!NamedNode, !NamedNode):number} cmp The comparison method to be used\n * @param {(function(NamedNode):K)=} keyFn An optional function to extract K from a node wrapper, if K's\n *                                                        type is not NamedNode\n * @param {(function(K, K):number)=} mapSortFn An optional override for comparator used by the generated sorted map\n * @return {SortedMap.<K, V>}\n */\nexports.buildChildSet = function (childList, cmp, keyFn, mapSortFn) {\n    childList.sort(cmp);\n    var buildBalancedTree = function buildBalancedTree(low, high) {\n        var length = high - low;\n        var namedNode;\n        var key;\n        if (length == 0) {\n            return null;\n        } else if (length == 1) {\n            namedNode = childList[low];\n            key = keyFn ? keyFn(namedNode) : namedNode;\n            return new SortedMap_1.LLRBNode(key, namedNode.node, SortedMap_1.LLRBNode.BLACK, null, null);\n        } else {\n            var middle = parseInt(length / 2, 10) + low;\n            var left = buildBalancedTree(low, middle);\n            var right = buildBalancedTree(middle + 1, high);\n            namedNode = childList[middle];\n            key = keyFn ? keyFn(namedNode) : namedNode;\n            return new SortedMap_1.LLRBNode(key, namedNode.node, SortedMap_1.LLRBNode.BLACK, left, right);\n        }\n    };\n    var buildFrom12Array = function buildFrom12Array(base12) {\n        var node = null;\n        var root = null;\n        var index = childList.length;\n        var buildPennant = function buildPennant(chunkSize, color) {\n            var low = index - chunkSize;\n            var high = index;\n            index -= chunkSize;\n            var childTree = buildBalancedTree(low + 1, high);\n            var namedNode = childList[low];\n            var key = keyFn ? keyFn(namedNode) : namedNode;\n            attachPennant(new SortedMap_1.LLRBNode(key, namedNode.node, color, null, childTree));\n        };\n        var attachPennant = function attachPennant(pennant) {\n            if (node) {\n                node.left = pennant;\n                node = pennant;\n            } else {\n                root = pennant;\n                node = pennant;\n            }\n        };\n        for (var i = 0; i < base12.count; ++i) {\n            var isOne = base12.nextBitIsOne();\n            // The number of nodes taken in each slice is 2^(arr.length - (i + 1))\n            var chunkSize = Math.pow(2, base12.count - (i + 1));\n            if (isOne) {\n                buildPennant(chunkSize, SortedMap_1.LLRBNode.BLACK);\n            } else {\n                // current == 2\n                buildPennant(chunkSize, SortedMap_1.LLRBNode.BLACK);\n                buildPennant(chunkSize, SortedMap_1.LLRBNode.RED);\n            }\n        }\n        return root;\n    };\n    var base12 = new Base12Num(childList.length);\n    var root = buildFrom12Array(base12);\n    return new SortedMap_2.SortedMap(mapSortFn || cmp, root);\n};\n\n//# sourceMappingURL=childSet.js.map\n\n/***/ }),\n/* 92 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = __webpack_require__(2);\nfunction NAME_ONLY_COMPARATOR(left, right) {\n    return util_1.nameCompare(left.name, right.name);\n}\nexports.NAME_ONLY_COMPARATOR = NAME_ONLY_COMPARATOR;\nfunction NAME_COMPARATOR(left, right) {\n    return util_1.nameCompare(left, right);\n}\nexports.NAME_COMPARATOR = NAME_COMPARATOR;\n\n//# sourceMappingURL=comparators.js.map\n\n/***/ }),\n/* 93 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nvar __extends = undefined && undefined.__extends || function () {\n    var extendStatics = Object.setPrototypeOf || { __proto__: [] } instanceof Array && function (d, b) {\n        d.__proto__ = b;\n    } || function (d, b) {\n        for (var p in b) {\n            if (b.hasOwnProperty(p)) d[p] = b[p];\n        }\n    };\n    return function (d, b) {\n        extendStatics(d, b);\n        function __() {\n            this.constructor = d;\n        }\n        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n    };\n}();\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = __webpack_require__(0);\nvar util_2 = __webpack_require__(2);\nvar Index_1 = __webpack_require__(36);\nvar ChildrenNode_1 = __webpack_require__(7);\nvar Node_1 = __webpack_require__(8);\nvar nodeFromJSON_1 = __webpack_require__(23);\n/**\n * @param {!Path} indexPath\n * @constructor\n * @extends {Index}\n */\nvar PathIndex = /** @class */function (_super) {\n    __extends(PathIndex, _super);\n    function PathIndex(indexPath_) {\n        var _this = _super.call(this) || this;\n        _this.indexPath_ = indexPath_;\n        util_1.assert(!indexPath_.isEmpty() && indexPath_.getFront() !== '.priority', \"Can't create PathIndex with empty path or .priority key\");\n        return _this;\n    }\n    /**\n     * @param {!Node} snap\n     * @return {!Node}\n     * @protected\n     */\n    PathIndex.prototype.extractChild = function (snap) {\n        return snap.getChild(this.indexPath_);\n    };\n    /**\n     * @inheritDoc\n     */\n    PathIndex.prototype.isDefinedOn = function (node) {\n        return !node.getChild(this.indexPath_).isEmpty();\n    };\n    /**\n     * @inheritDoc\n     */\n    PathIndex.prototype.compare = function (a, b) {\n        var aChild = this.extractChild(a.node);\n        var bChild = this.extractChild(b.node);\n        var indexCmp = aChild.compareTo(bChild);\n        if (indexCmp === 0) {\n            return util_2.nameCompare(a.name, b.name);\n        } else {\n            return indexCmp;\n        }\n    };\n    /**\n     * @inheritDoc\n     */\n    PathIndex.prototype.makePost = function (indexValue, name) {\n        var valueNode = nodeFromJSON_1.nodeFromJSON(indexValue);\n        var node = ChildrenNode_1.ChildrenNode.EMPTY_NODE.updateChild(this.indexPath_, valueNode);\n        return new Node_1.NamedNode(name, node);\n    };\n    /**\n     * @inheritDoc\n     */\n    PathIndex.prototype.maxPost = function () {\n        var node = ChildrenNode_1.ChildrenNode.EMPTY_NODE.updateChild(this.indexPath_, ChildrenNode_1.MAX_NODE);\n        return new Node_1.NamedNode(util_2.MAX_NAME, node);\n    };\n    /**\n     * @inheritDoc\n     */\n    PathIndex.prototype.toString = function () {\n        return this.indexPath_.slice().join('/');\n    };\n    return PathIndex;\n}(Index_1.Index);\nexports.PathIndex = PathIndex;\n\n//# sourceMappingURL=PathIndex.js.map\n\n/***/ }),\n/* 94 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nvar _typeof = typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; };\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = __webpack_require__(0);\nvar Path_1 = __webpack_require__(4);\nvar SparseSnapshotTree_1 = __webpack_require__(95);\nvar LeafNode_1 = __webpack_require__(37);\nvar nodeFromJSON_1 = __webpack_require__(23);\nvar PriorityIndex_1 = __webpack_require__(6);\n/**\n * Generate placeholders for deferred values.\n * @param {?Object} values\n * @return {!Object}\n */\nexports.generateWithValues = function (values) {\n    values = values || {};\n    values['timestamp'] = values['timestamp'] || new Date().getTime();\n    return values;\n};\n/**\n * Value to use when firing local events. When writing server values, fire\n * local events with an approximate value, otherwise return value as-is.\n * @param {(Object|string|number|boolean)} value\n * @param {!Object} serverValues\n * @return {!(string|number|boolean)}\n */\nexports.resolveDeferredValue = function (value, serverValues) {\n    if (!value || (typeof value === \"undefined\" ? \"undefined\" : _typeof(value)) !== 'object') {\n        return value;\n    } else {\n        util_1.assert('.sv' in value, 'Unexpected leaf node or priority contents');\n        return serverValues[value['.sv']];\n    }\n};\n/**\n * Recursively replace all deferred values and priorities in the tree with the\n * specified generated replacement values.\n * @param {!SparseSnapshotTree} tree\n * @param {!Object} serverValues\n * @return {!SparseSnapshotTree}\n */\nexports.resolveDeferredValueTree = function (tree, serverValues) {\n    var resolvedTree = new SparseSnapshotTree_1.SparseSnapshotTree();\n    tree.forEachTree(new Path_1.Path(''), function (path, node) {\n        resolvedTree.remember(path, exports.resolveDeferredValueSnapshot(node, serverValues));\n    });\n    return resolvedTree;\n};\n/**\n * Recursively replace all deferred values and priorities in the node with the\n * specified generated replacement values.  If there are no server values in the node,\n * it'll be returned as-is.\n * @param {!Node} node\n * @param {!Object} serverValues\n * @return {!Node}\n */\nexports.resolveDeferredValueSnapshot = function (node, serverValues) {\n    var rawPri = node.getPriority().val();\n    var priority = exports.resolveDeferredValue(rawPri, serverValues);\n    var newNode;\n    if (node.isLeafNode()) {\n        var leafNode = node;\n        var value = exports.resolveDeferredValue(leafNode.getValue(), serverValues);\n        if (value !== leafNode.getValue() || priority !== leafNode.getPriority().val()) {\n            return new LeafNode_1.LeafNode(value, nodeFromJSON_1.nodeFromJSON(priority));\n        } else {\n            return node;\n        }\n    } else {\n        var childrenNode = node;\n        newNode = childrenNode;\n        if (priority !== childrenNode.getPriority().val()) {\n            newNode = newNode.updatePriority(new LeafNode_1.LeafNode(priority));\n        }\n        childrenNode.forEachChild(PriorityIndex_1.PRIORITY_INDEX, function (childName, childNode) {\n            var newChildNode = exports.resolveDeferredValueSnapshot(childNode, serverValues);\n            if (newChildNode !== childNode) {\n                newNode = newNode.updateImmediateChild(childName, newChildNode);\n            }\n        });\n        return newNode;\n    }\n};\n\n//# sourceMappingURL=ServerValues.js.map\n\n/***/ }),\n/* 95 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar Path_1 = __webpack_require__(4);\nvar PriorityIndex_1 = __webpack_require__(6);\nvar CountedSet_1 = __webpack_require__(96);\n/**\n * Helper class to store a sparse set of snapshots.\n *\n * @constructor\n */\nvar SparseSnapshotTree = /** @class */function () {\n    function SparseSnapshotTree() {\n        /**\n         * @private\n         * @type {Node}\n         */\n        this.value_ = null;\n        /**\n         * @private\n         * @type {CountedSet}\n         */\n        this.children_ = null;\n    }\n    /**\n     * Gets the node stored at the given path if one exists.\n     *\n     * @param {!Path} path Path to look up snapshot for.\n     * @return {?Node} The retrieved node, or null.\n     */\n    SparseSnapshotTree.prototype.find = function (path) {\n        if (this.value_ != null) {\n            return this.value_.getChild(path);\n        } else if (!path.isEmpty() && this.children_ != null) {\n            var childKey = path.getFront();\n            path = path.popFront();\n            if (this.children_.contains(childKey)) {\n                var childTree = this.children_.get(childKey);\n                return childTree.find(path);\n            } else {\n                return null;\n            }\n        } else {\n            return null;\n        }\n    };\n    /**\n     * Stores the given node at the specified path. If there is already a node\n     * at a shallower path, it merges the new data into that snapshot node.\n     *\n     * @param {!Path} path Path to look up snapshot for.\n     * @param {!Node} data The new data, or null.\n     */\n    SparseSnapshotTree.prototype.remember = function (path, data) {\n        if (path.isEmpty()) {\n            this.value_ = data;\n            this.children_ = null;\n        } else if (this.value_ !== null) {\n            this.value_ = this.value_.updateChild(path, data);\n        } else {\n            if (this.children_ == null) {\n                this.children_ = new CountedSet_1.CountedSet();\n            }\n            var childKey = path.getFront();\n            if (!this.children_.contains(childKey)) {\n                this.children_.add(childKey, new SparseSnapshotTree());\n            }\n            var child = this.children_.get(childKey);\n            path = path.popFront();\n            child.remember(path, data);\n        }\n    };\n    /**\n     * Purge the data at path from the cache.\n     *\n     * @param {!Path} path Path to look up snapshot for.\n     * @return {boolean} True if this node should now be removed.\n     */\n    SparseSnapshotTree.prototype.forget = function (path) {\n        if (path.isEmpty()) {\n            this.value_ = null;\n            this.children_ = null;\n            return true;\n        } else {\n            if (this.value_ !== null) {\n                if (this.value_.isLeafNode()) {\n                    // We're trying to forget a node that doesn't exist\n                    return false;\n                } else {\n                    var value = this.value_;\n                    this.value_ = null;\n                    var self_1 = this;\n                    value.forEachChild(PriorityIndex_1.PRIORITY_INDEX, function (key, tree) {\n                        self_1.remember(new Path_1.Path(key), tree);\n                    });\n                    return this.forget(path);\n                }\n            } else if (this.children_ !== null) {\n                var childKey = path.getFront();\n                path = path.popFront();\n                if (this.children_.contains(childKey)) {\n                    var safeToRemove = this.children_.get(childKey).forget(path);\n                    if (safeToRemove) {\n                        this.children_.remove(childKey);\n                    }\n                }\n                if (this.children_.isEmpty()) {\n                    this.children_ = null;\n                    return true;\n                } else {\n                    return false;\n                }\n            } else {\n                return true;\n            }\n        }\n    };\n    /**\n     * Recursively iterates through all of the stored tree and calls the\n     * callback on each one.\n     *\n     * @param {!Path} prefixPath Path to look up node for.\n     * @param {!Function} func The function to invoke for each tree.\n     */\n    SparseSnapshotTree.prototype.forEachTree = function (prefixPath, func) {\n        if (this.value_ !== null) {\n            func(prefixPath, this.value_);\n        } else {\n            this.forEachChild(function (key, tree) {\n                var path = new Path_1.Path(prefixPath.toString() + '/' + key);\n                tree.forEachTree(path, func);\n            });\n        }\n    };\n    /**\n     * Iterates through each immediate child and triggers the callback.\n     *\n     * @param {!Function} func The function to invoke for each child.\n     */\n    SparseSnapshotTree.prototype.forEachChild = function (func) {\n        if (this.children_ !== null) {\n            this.children_.each(function (key, tree) {\n                func(key, tree);\n            });\n        }\n    };\n    return SparseSnapshotTree;\n}();\nexports.SparseSnapshotTree = SparseSnapshotTree;\n\n//# sourceMappingURL=SparseSnapshotTree.js.map\n\n/***/ }),\n/* 96 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = __webpack_require__(0);\n/**\n * Implements a set with a count of elements.\n *\n * @template K, V\n */\nvar CountedSet = /** @class */function () {\n    function CountedSet() {\n        this.set = {};\n    }\n    /**\n     * @param {!K} item\n     * @param {V} val\n     */\n    CountedSet.prototype.add = function (item, val) {\n        this.set[item] = val !== null ? val : true;\n    };\n    /**\n     * @param {!K} key\n     * @return {boolean}\n     */\n    CountedSet.prototype.contains = function (key) {\n        return util_1.contains(this.set, key);\n    };\n    /**\n     * @param {!K} item\n     * @return {V}\n     */\n    CountedSet.prototype.get = function (item) {\n        return this.contains(item) ? this.set[item] : undefined;\n    };\n    /**\n     * @param {!K} item\n     */\n    CountedSet.prototype.remove = function (item) {\n        delete this.set[item];\n    };\n    /**\n     * Deletes everything in the set\n     */\n    CountedSet.prototype.clear = function () {\n        this.set = {};\n    };\n    /**\n     * True if there's nothing in the set\n     * @return {boolean}\n     */\n    CountedSet.prototype.isEmpty = function () {\n        return util_1.isEmpty(this.set);\n    };\n    /**\n     * @return {number} The number of items in the set\n     */\n    CountedSet.prototype.count = function () {\n        return util_1.getCount(this.set);\n    };\n    /**\n     * Run a function on each k,v pair in the set\n     * @param {function(K, V)} fn\n     */\n    CountedSet.prototype.each = function (fn) {\n        util_1.forEach(this.set, function (k, v) {\n            return fn(k, v);\n        });\n    };\n    /**\n     * Mostly for debugging\n     * @return {Array.<K>} The keys present in this CountedSet\n     */\n    CountedSet.prototype.keys = function () {\n        var keys = [];\n        util_1.forEach(this.set, function (k) {\n            keys.push(k);\n        });\n        return keys;\n    };\n    return CountedSet;\n}();\nexports.CountedSet = CountedSet;\n\n//# sourceMappingURL=CountedSet.js.map\n\n/***/ }),\n/* 97 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar Operation_1 = __webpack_require__(12);\nvar Path_1 = __webpack_require__(4);\n/**\n * @param {!OperationSource} source\n * @param {!Path} path\n * @param {!Node} snap\n * @constructor\n * @implements {Operation}\n */\nvar Overwrite = /** @class */function () {\n    function Overwrite(source, path, snap) {\n        this.source = source;\n        this.path = path;\n        this.snap = snap;\n        /** @inheritDoc */\n        this.type = Operation_1.OperationType.OVERWRITE;\n    }\n    Overwrite.prototype.operationForChild = function (childName) {\n        if (this.path.isEmpty()) {\n            return new Overwrite(this.source, Path_1.Path.Empty, this.snap.getImmediateChild(childName));\n        } else {\n            return new Overwrite(this.source, this.path.popFront(), this.snap);\n        }\n    };\n    return Overwrite;\n}();\nexports.Overwrite = Overwrite;\n\n//# sourceMappingURL=Overwrite.js.map\n\n/***/ }),\n/* 98 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar CacheNode_1 = __webpack_require__(40);\nvar ChildrenNode_1 = __webpack_require__(7);\nvar util_1 = __webpack_require__(0);\nvar util_2 = __webpack_require__(0);\nvar ViewCache_1 = __webpack_require__(99);\nvar View_1 = __webpack_require__(168);\nvar __referenceConstructor;\n/**\n * SyncPoint represents a single location in a SyncTree with 1 or more event registrations, meaning we need to\n * maintain 1 or more Views at this location to cache server data and raise appropriate events for server changes\n * and user writes (set, transaction, update).\n *\n * It's responsible for:\n *  - Maintaining the set of 1 or more views necessary at this location (a SyncPoint with 0 views should be removed).\n *  - Proxying user / server operations to the views as appropriate (i.e. applyServerOverwrite,\n *    applyUserOverwrite, etc.)\n */\nvar SyncPoint = /** @class */function () {\n    function SyncPoint() {\n        /**\n         * The Views being tracked at this location in the tree, stored as a map where the key is a\n         * queryId and the value is the View for that query.\n         *\n         * NOTE: This list will be quite small (usually 1, but perhaps 2 or 3; any more is an odd use case).\n         *\n         * @type {!Object.<!string, !View>}\n         * @private\n         */\n        this.views_ = {};\n    }\n    Object.defineProperty(SyncPoint, \"__referenceConstructor\", {\n        get: function get() {\n            util_1.assert(__referenceConstructor, 'Reference.ts has not been loaded');\n            return __referenceConstructor;\n        },\n        set: function set(val) {\n            util_1.assert(!__referenceConstructor, '__referenceConstructor has already been defined');\n            __referenceConstructor = val;\n        },\n        enumerable: true,\n        configurable: true\n    });\n    /**\n     * @return {boolean}\n     */\n    SyncPoint.prototype.isEmpty = function () {\n        return util_2.isEmpty(this.views_);\n    };\n    /**\n     *\n     * @param {!Operation} operation\n     * @param {!WriteTreeRef} writesCache\n     * @param {?Node} optCompleteServerCache\n     * @return {!Array.<!Event>}\n     */\n    SyncPoint.prototype.applyOperation = function (operation, writesCache, optCompleteServerCache) {\n        var queryId = operation.source.queryId;\n        if (queryId !== null) {\n            var view = util_2.safeGet(this.views_, queryId);\n            util_1.assert(view != null, 'SyncTree gave us an op for an invalid query.');\n            return view.applyOperation(operation, writesCache, optCompleteServerCache);\n        } else {\n            var events_1 = [];\n            util_2.forEach(this.views_, function (key, view) {\n                events_1 = events_1.concat(view.applyOperation(operation, writesCache, optCompleteServerCache));\n            });\n            return events_1;\n        }\n    };\n    /**\n     * Add an event callback for the specified query.\n     *\n     * @param {!Query} query\n     * @param {!EventRegistration} eventRegistration\n     * @param {!WriteTreeRef} writesCache\n     * @param {?Node} serverCache Complete server cache, if we have it.\n     * @param {boolean} serverCacheComplete\n     * @return {!Array.<!Event>} Events to raise.\n     */\n    SyncPoint.prototype.addEventRegistration = function (query, eventRegistration, writesCache, serverCache, serverCacheComplete) {\n        var queryId = query.queryIdentifier();\n        var view = util_2.safeGet(this.views_, queryId);\n        if (!view) {\n            // TODO: make writesCache take flag for complete server node\n            var eventCache = writesCache.calcCompleteEventCache(serverCacheComplete ? serverCache : null);\n            var eventCacheComplete = false;\n            if (eventCache) {\n                eventCacheComplete = true;\n            } else if (serverCache instanceof ChildrenNode_1.ChildrenNode) {\n                eventCache = writesCache.calcCompleteEventChildren(serverCache);\n                eventCacheComplete = false;\n            } else {\n                eventCache = ChildrenNode_1.ChildrenNode.EMPTY_NODE;\n                eventCacheComplete = false;\n            }\n            var viewCache = new ViewCache_1.ViewCache(new CacheNode_1.CacheNode(\n            /** @type {!Node} */eventCache, eventCacheComplete, false), new CacheNode_1.CacheNode(\n            /** @type {!Node} */serverCache, serverCacheComplete, false));\n            view = new View_1.View(query, viewCache);\n            this.views_[queryId] = view;\n        }\n        // This is guaranteed to exist now, we just created anything that was missing\n        view.addEventRegistration(eventRegistration);\n        return view.getInitialEvents(eventRegistration);\n    };\n    /**\n     * Remove event callback(s).  Return cancelEvents if a cancelError is specified.\n     *\n     * If query is the default query, we'll check all views for the specified eventRegistration.\n     * If eventRegistration is null, we'll remove all callbacks for the specified view(s).\n     *\n     * @param {!Query} query\n     * @param {?EventRegistration} eventRegistration If null, remove all callbacks.\n     * @param {Error=} cancelError If a cancelError is provided, appropriate cancel events will be returned.\n     * @return {{removed:!Array.<!Query>, events:!Array.<!Event>}} removed queries and any cancel events\n     */\n    SyncPoint.prototype.removeEventRegistration = function (query, eventRegistration, cancelError) {\n        var queryId = query.queryIdentifier();\n        var removed = [];\n        var cancelEvents = [];\n        var hadCompleteView = this.hasCompleteView();\n        if (queryId === 'default') {\n            // When you do ref.off(...), we search all views for the registration to remove.\n            var self_1 = this;\n            util_2.forEach(this.views_, function (viewQueryId, view) {\n                cancelEvents = cancelEvents.concat(view.removeEventRegistration(eventRegistration, cancelError));\n                if (view.isEmpty()) {\n                    delete self_1.views_[viewQueryId];\n                    // We'll deal with complete views later.\n                    if (!view.getQuery().getQueryParams().loadsAllData()) {\n                        removed.push(view.getQuery());\n                    }\n                }\n            });\n        } else {\n            // remove the callback from the specific view.\n            var view = util_2.safeGet(this.views_, queryId);\n            if (view) {\n                cancelEvents = cancelEvents.concat(view.removeEventRegistration(eventRegistration, cancelError));\n                if (view.isEmpty()) {\n                    delete this.views_[queryId];\n                    // We'll deal with complete views later.\n                    if (!view.getQuery().getQueryParams().loadsAllData()) {\n                        removed.push(view.getQuery());\n                    }\n                }\n            }\n        }\n        if (hadCompleteView && !this.hasCompleteView()) {\n            // We removed our last complete view.\n            removed.push(new SyncPoint.__referenceConstructor(query.repo, query.path));\n        }\n        return { removed: removed, events: cancelEvents };\n    };\n    /**\n     * @return {!Array.<!View>}\n     */\n    SyncPoint.prototype.getQueryViews = function () {\n        var _this = this;\n        var values = Object.keys(this.views_).map(function (key) {\n            return _this.views_[key];\n        });\n        return values.filter(function (view) {\n            return !view.getQuery().getQueryParams().loadsAllData();\n        });\n    };\n    /**\n     *\n     * @param {!Path} path The path to the desired complete snapshot\n     * @return {?Node} A complete cache, if it exists\n     */\n    SyncPoint.prototype.getCompleteServerCache = function (path) {\n        var serverCache = null;\n        util_2.forEach(this.views_, function (key, view) {\n            serverCache = serverCache || view.getCompleteServerCache(path);\n        });\n        return serverCache;\n    };\n    /**\n     * @param {!Query} query\n     * @return {?View}\n     */\n    SyncPoint.prototype.viewForQuery = function (query) {\n        var params = query.getQueryParams();\n        if (params.loadsAllData()) {\n            return this.getCompleteView();\n        } else {\n            var queryId = query.queryIdentifier();\n            return util_2.safeGet(this.views_, queryId);\n        }\n    };\n    /**\n     * @param {!Query} query\n     * @return {boolean}\n     */\n    SyncPoint.prototype.viewExistsForQuery = function (query) {\n        return this.viewForQuery(query) != null;\n    };\n    /**\n     * @return {boolean}\n     */\n    SyncPoint.prototype.hasCompleteView = function () {\n        return this.getCompleteView() != null;\n    };\n    /**\n     * @return {?View}\n     */\n    SyncPoint.prototype.getCompleteView = function () {\n        var completeView = util_2.findValue(this.views_, function (view) {\n            return view.getQuery().getQueryParams().loadsAllData();\n        });\n        return completeView || null;\n    };\n    return SyncPoint;\n}();\nexports.SyncPoint = SyncPoint;\n\n//# sourceMappingURL=SyncPoint.js.map\n\n/***/ }),\n/* 99 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar ChildrenNode_1 = __webpack_require__(7);\nvar CacheNode_1 = __webpack_require__(40);\n/**\n * Stores the data we have cached for a view.\n *\n * serverSnap is the cached server data, eventSnap is the cached event data (server data plus any local writes).\n *\n * @constructor\n */\nvar ViewCache = /** @class */function () {\n  /**\n   *\n   * @param {!CacheNode} eventCache_\n   * @param {!CacheNode} serverCache_\n   */\n  function ViewCache(eventCache_, serverCache_) {\n    this.eventCache_ = eventCache_;\n    this.serverCache_ = serverCache_;\n  }\n  /**\n   * @param {!Node} eventSnap\n   * @param {boolean} complete\n   * @param {boolean} filtered\n   * @return {!ViewCache}\n   */\n  ViewCache.prototype.updateEventSnap = function (eventSnap, complete, filtered) {\n    return new ViewCache(new CacheNode_1.CacheNode(eventSnap, complete, filtered), this.serverCache_);\n  };\n  /**\n   * @param {!Node} serverSnap\n   * @param {boolean} complete\n   * @param {boolean} filtered\n   * @return {!ViewCache}\n   */\n  ViewCache.prototype.updateServerSnap = function (serverSnap, complete, filtered) {\n    return new ViewCache(this.eventCache_, new CacheNode_1.CacheNode(serverSnap, complete, filtered));\n  };\n  /**\n   * @return {!CacheNode}\n   */\n  ViewCache.prototype.getEventCache = function () {\n    return this.eventCache_;\n  };\n  /**\n   * @return {?Node}\n   */\n  ViewCache.prototype.getCompleteEventSnap = function () {\n    return this.eventCache_.isFullyInitialized() ? this.eventCache_.getNode() : null;\n  };\n  /**\n   * @return {!CacheNode}\n   */\n  ViewCache.prototype.getServerCache = function () {\n    return this.serverCache_;\n  };\n  /**\n   * @return {?Node}\n   */\n  ViewCache.prototype.getCompleteServerSnap = function () {\n    return this.serverCache_.isFullyInitialized() ? this.serverCache_.getNode() : null;\n  };\n  /**\n   * @const\n   * @type {ViewCache}\n   */\n  ViewCache.Empty = new ViewCache(new CacheNode_1.CacheNode(ChildrenNode_1.ChildrenNode.EMPTY_NODE,\n  /*fullyInitialized=*/false,\n  /*filtered=*/false), new CacheNode_1.CacheNode(ChildrenNode_1.ChildrenNode.EMPTY_NODE,\n  /*fullyInitialized=*/false,\n  /*filtered=*/false));\n  return ViewCache;\n}();\nexports.ViewCache = ViewCache;\n\n//# sourceMappingURL=ViewCache.js.map\n\n/***/ }),\n/* 100 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = __webpack_require__(0);\n/**\n * Returns the delta from the previous call to get stats.\n *\n * @param collection_ The collection to \"listen\" to.\n * @constructor\n */\nvar StatsListener = /** @class */function () {\n    function StatsListener(collection_) {\n        this.collection_ = collection_;\n        this.last_ = null;\n    }\n    StatsListener.prototype.get = function () {\n        var newStats = this.collection_.get();\n        var delta = util_1.clone(newStats);\n        if (this.last_) {\n            util_1.forEach(this.last_, function (stat, value) {\n                delta[stat] = delta[stat] - value;\n            });\n        }\n        this.last_ = newStats;\n        return delta;\n    };\n    return StatsListener;\n}();\nexports.StatsListener = StatsListener;\n\n//# sourceMappingURL=StatsListener.js.map\n\n/***/ }),\n/* 101 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nvar _typeof = typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; };\n\nvar __extends = undefined && undefined.__extends || function () {\n    var extendStatics = Object.setPrototypeOf || { __proto__: [] } instanceof Array && function (d, b) {\n        d.__proto__ = b;\n    } || function (d, b) {\n        for (var p in b) {\n            if (b.hasOwnProperty(p)) d[p] = b[p];\n        }\n    };\n    return function (d, b) {\n        extendStatics(d, b);\n        function __() {\n            this.constructor = d;\n        }\n        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n    };\n}();\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar app_1 = __webpack_require__(21);\nvar util_1 = __webpack_require__(0);\nvar util_2 = __webpack_require__(0);\nvar util_3 = __webpack_require__(0);\nvar util_4 = __webpack_require__(2);\nvar Path_1 = __webpack_require__(4);\nvar VisibilityMonitor_1 = __webpack_require__(180);\nvar OnlineMonitor_1 = __webpack_require__(181);\nvar util_5 = __webpack_require__(0);\nvar Connection_1 = __webpack_require__(103);\nvar util_6 = __webpack_require__(0);\nvar util_7 = __webpack_require__(0);\nvar ServerActions_1 = __webpack_require__(106);\nvar RECONNECT_MIN_DELAY = 1000;\nvar RECONNECT_MAX_DELAY_DEFAULT = 60 * 5 * 1000; // 5 minutes in milliseconds (Case: 1858)\nvar RECONNECT_MAX_DELAY_FOR_ADMINS = 30 * 1000; // 30 seconds for admin clients (likely to be a backend server)\nvar RECONNECT_DELAY_MULTIPLIER = 1.3;\nvar RECONNECT_DELAY_RESET_TIMEOUT = 30000; // Reset delay back to MIN_DELAY after being connected for 30sec.\nvar SERVER_KILL_INTERRUPT_REASON = 'server_kill';\n// If auth fails repeatedly, we'll assume something is wrong and log a warning / back off.\nvar INVALID_AUTH_TOKEN_THRESHOLD = 3;\n/**\n * Firebase connection.  Abstracts wire protocol and handles reconnecting.\n *\n * NOTE: All JSON objects sent to the realtime connection must have property names enclosed\n * in quotes to make sure the closure compiler does not minify them.\n */\nvar PersistentConnection = /** @class */function (_super) {\n    __extends(PersistentConnection, _super);\n    /**\n     * @implements {ServerActions}\n     * @param {!RepoInfo} repoInfo_ Data about the namespace we are connecting to\n     * @param {function(string, *, boolean, ?number)} onDataUpdate_ A callback for new data from the server\n     * @param onConnectStatus_\n     * @param onServerInfoUpdate_\n     * @param authTokenProvider_\n     * @param authOverride_\n     */\n    function PersistentConnection(repoInfo_, onDataUpdate_, onConnectStatus_, onServerInfoUpdate_, authTokenProvider_, authOverride_) {\n        var _this = _super.call(this) || this;\n        _this.repoInfo_ = repoInfo_;\n        _this.onDataUpdate_ = onDataUpdate_;\n        _this.onConnectStatus_ = onConnectStatus_;\n        _this.onServerInfoUpdate_ = onServerInfoUpdate_;\n        _this.authTokenProvider_ = authTokenProvider_;\n        _this.authOverride_ = authOverride_;\n        // Used for diagnostic logging.\n        _this.id = PersistentConnection.nextPersistentConnectionId_++;\n        _this.log_ = util_4.logWrapper('p:' + _this.id + ':');\n        /** @private {Object} */\n        _this.interruptReasons_ = {};\n        _this.listens_ = {};\n        _this.outstandingPuts_ = [];\n        _this.outstandingPutCount_ = 0;\n        _this.onDisconnectRequestQueue_ = [];\n        _this.connected_ = false;\n        _this.reconnectDelay_ = RECONNECT_MIN_DELAY;\n        _this.maxReconnectDelay_ = RECONNECT_MAX_DELAY_DEFAULT;\n        _this.securityDebugCallback_ = null;\n        _this.lastSessionId = null;\n        /** @private {number|null} */\n        _this.establishConnectionTimer_ = null;\n        /** @private {boolean} */\n        _this.visible_ = false;\n        // Before we get connected, we keep a queue of pending messages to send.\n        _this.requestCBHash_ = {};\n        _this.requestNumber_ = 0;\n        /** @private {?{\n         *   sendRequest(Object),\n         *   close()\n         * }} */\n        _this.realtime_ = null;\n        /** @private {string|null} */\n        _this.authToken_ = null;\n        _this.forceTokenRefresh_ = false;\n        _this.invalidAuthTokenCount_ = 0;\n        _this.firstConnection_ = true;\n        _this.lastConnectionAttemptTime_ = null;\n        _this.lastConnectionEstablishedTime_ = null;\n        if (authOverride_ && !util_7.isNodeSdk()) {\n            throw new Error('Auth override specified in options, but not supported on non Node.js platforms');\n        }\n        _this.scheduleConnect_(0);\n        VisibilityMonitor_1.VisibilityMonitor.getInstance().on('visible', _this.onVisible_, _this);\n        if (repoInfo_.host.indexOf('fblocal') === -1) {\n            OnlineMonitor_1.OnlineMonitor.getInstance().on('online', _this.onOnline_, _this);\n        }\n        return _this;\n    }\n    /**\n     * @param {!string} action\n     * @param {*} body\n     * @param {function(*)=} onResponse\n     * @protected\n     */\n    PersistentConnection.prototype.sendRequest = function (action, body, onResponse) {\n        var curReqNum = ++this.requestNumber_;\n        var msg = { r: curReqNum, a: action, b: body };\n        this.log_(util_2.stringify(msg));\n        util_3.assert(this.connected_, \"sendRequest call when we're not connected not allowed.\");\n        this.realtime_.sendRequest(msg);\n        if (onResponse) {\n            this.requestCBHash_[curReqNum] = onResponse;\n        }\n    };\n    /**\n     * @inheritDoc\n     */\n    PersistentConnection.prototype.listen = function (query, currentHashFn, tag, onComplete) {\n        var queryId = query.queryIdentifier();\n        var pathString = query.path.toString();\n        this.log_('Listen called for ' + pathString + ' ' + queryId);\n        this.listens_[pathString] = this.listens_[pathString] || {};\n        util_3.assert(query.getQueryParams().isDefault() || !query.getQueryParams().loadsAllData(), 'listen() called for non-default but complete query');\n        util_3.assert(!this.listens_[pathString][queryId], 'listen() called twice for same path/queryId.');\n        var listenSpec = {\n            onComplete: onComplete,\n            hashFn: currentHashFn,\n            query: query,\n            tag: tag\n        };\n        this.listens_[pathString][queryId] = listenSpec;\n        if (this.connected_) {\n            this.sendListen_(listenSpec);\n        }\n    };\n    /**\n     * @param {!{onComplete(),\n     *           hashFn():!string,\n     *           query: !Query,\n     *           tag: ?number}} listenSpec\n     * @private\n     */\n    PersistentConnection.prototype.sendListen_ = function (listenSpec) {\n        var _this = this;\n        var query = listenSpec.query;\n        var pathString = query.path.toString();\n        var queryId = query.queryIdentifier();\n        this.log_('Listen on ' + pathString + ' for ' + queryId);\n        var req = { /*path*/p: pathString };\n        var action = 'q';\n        // Only bother to send query if it's non-default.\n        if (listenSpec.tag) {\n            req['q'] = query.queryObject();\n            req['t'] = listenSpec.tag;\n        }\n        req['h'] = listenSpec.hashFn();\n        this.sendRequest(action, req, function (message) {\n            var payload = message['d'];\n            var status = message['s'];\n            // print warnings in any case...\n            PersistentConnection.warnOnListenWarnings_(payload, query);\n            var currentListenSpec = _this.listens_[pathString] && _this.listens_[pathString][queryId];\n            // only trigger actions if the listen hasn't been removed and readded\n            if (currentListenSpec === listenSpec) {\n                _this.log_('listen response', message);\n                if (status !== 'ok') {\n                    _this.removeListen_(pathString, queryId);\n                }\n                if (listenSpec.onComplete) {\n                    listenSpec.onComplete(status, payload);\n                }\n            }\n        });\n    };\n    /**\n     * @param {*} payload\n     * @param {!Query} query\n     * @private\n     */\n    PersistentConnection.warnOnListenWarnings_ = function (payload, query) {\n        if (payload && (typeof payload === \"undefined\" ? \"undefined\" : _typeof(payload)) === 'object' && util_1.contains(payload, 'w')) {\n            var warnings = util_1.safeGet(payload, 'w');\n            if (Array.isArray(warnings) && ~warnings.indexOf('no_index')) {\n                var indexSpec = '\".indexOn\": \"' + query.getQueryParams().getIndex().toString() + '\"';\n                var indexPath = query.path.toString();\n                util_4.warn(\"Using an unspecified index. Your data will be downloaded and \" + (\"filtered on the client. Consider adding \" + indexSpec + \" at \") + (indexPath + \" to your security rules for better performance.\"));\n            }\n        }\n    };\n    /**\n     * @inheritDoc\n     */\n    PersistentConnection.prototype.refreshAuthToken = function (token) {\n        this.authToken_ = token;\n        this.log_('Auth token refreshed');\n        if (this.authToken_) {\n            this.tryAuth();\n        } else {\n            //If we're connected we want to let the server know to unauthenticate us. If we're not connected, simply delete\n            //the credential so we dont become authenticated next time we connect.\n            if (this.connected_) {\n                this.sendRequest('unauth', {}, function () {});\n            }\n        }\n        this.reduceReconnectDelayIfAdminCredential_(token);\n    };\n    /**\n     * @param {!string} credential\n     * @private\n     */\n    PersistentConnection.prototype.reduceReconnectDelayIfAdminCredential_ = function (credential) {\n        // NOTE: This isn't intended to be bulletproof (a malicious developer can always just modify the client).\n        // Additionally, we don't bother resetting the max delay back to the default if auth fails / expires.\n        var isFirebaseSecret = credential && credential.length === 40;\n        if (isFirebaseSecret || util_5.isAdmin(credential)) {\n            this.log_('Admin auth credential detected.  Reducing max reconnect time.');\n            this.maxReconnectDelay_ = RECONNECT_MAX_DELAY_FOR_ADMINS;\n        }\n    };\n    /**\n     * Attempts to authenticate with the given credentials. If the authentication attempt fails, it's triggered like\n     * a auth revoked (the connection is closed).\n     */\n    PersistentConnection.prototype.tryAuth = function () {\n        var _this = this;\n        if (this.connected_ && this.authToken_) {\n            var token_1 = this.authToken_;\n            var authMethod = util_5.isValidFormat(token_1) ? 'auth' : 'gauth';\n            var requestData = { cred: token_1 };\n            if (this.authOverride_ === null) {\n                requestData['noauth'] = true;\n            } else if (_typeof(this.authOverride_) === 'object') {\n                requestData['authvar'] = this.authOverride_;\n            }\n            this.sendRequest(authMethod, requestData, function (res) {\n                var status = res['s'];\n                var data = res['d'] || 'error';\n                if (_this.authToken_ === token_1) {\n                    if (status === 'ok') {\n                        _this.invalidAuthTokenCount_ = 0;\n                    } else {\n                        // Triggers reconnect and force refresh for auth token\n                        _this.onAuthRevoked_(status, data);\n                    }\n                }\n            });\n        }\n    };\n    /**\n     * @inheritDoc\n     */\n    PersistentConnection.prototype.unlisten = function (query, tag) {\n        var pathString = query.path.toString();\n        var queryId = query.queryIdentifier();\n        this.log_('Unlisten called for ' + pathString + ' ' + queryId);\n        util_3.assert(query.getQueryParams().isDefault() || !query.getQueryParams().loadsAllData(), 'unlisten() called for non-default but complete query');\n        var listen = this.removeListen_(pathString, queryId);\n        if (listen && this.connected_) {\n            this.sendUnlisten_(pathString, queryId, query.queryObject(), tag);\n        }\n    };\n    PersistentConnection.prototype.sendUnlisten_ = function (pathString, queryId, queryObj, tag) {\n        this.log_('Unlisten on ' + pathString + ' for ' + queryId);\n        var req = { /*path*/p: pathString };\n        var action = 'n';\n        // Only bother sending queryId if it's non-default.\n        if (tag) {\n            req['q'] = queryObj;\n            req['t'] = tag;\n        }\n        this.sendRequest(action, req);\n    };\n    /**\n     * @inheritDoc\n     */\n    PersistentConnection.prototype.onDisconnectPut = function (pathString, data, onComplete) {\n        if (this.connected_) {\n            this.sendOnDisconnect_('o', pathString, data, onComplete);\n        } else {\n            this.onDisconnectRequestQueue_.push({\n                pathString: pathString,\n                action: 'o',\n                data: data,\n                onComplete: onComplete\n            });\n        }\n    };\n    /**\n     * @inheritDoc\n     */\n    PersistentConnection.prototype.onDisconnectMerge = function (pathString, data, onComplete) {\n        if (this.connected_) {\n            this.sendOnDisconnect_('om', pathString, data, onComplete);\n        } else {\n            this.onDisconnectRequestQueue_.push({\n                pathString: pathString,\n                action: 'om',\n                data: data,\n                onComplete: onComplete\n            });\n        }\n    };\n    /**\n     * @inheritDoc\n     */\n    PersistentConnection.prototype.onDisconnectCancel = function (pathString, onComplete) {\n        if (this.connected_) {\n            this.sendOnDisconnect_('oc', pathString, null, onComplete);\n        } else {\n            this.onDisconnectRequestQueue_.push({\n                pathString: pathString,\n                action: 'oc',\n                data: null,\n                onComplete: onComplete\n            });\n        }\n    };\n    PersistentConnection.prototype.sendOnDisconnect_ = function (action, pathString, data, onComplete) {\n        var request = { /*path*/p: pathString, /*data*/d: data };\n        this.log_('onDisconnect ' + action, request);\n        this.sendRequest(action, request, function (response) {\n            if (onComplete) {\n                setTimeout(function () {\n                    onComplete(response['s'], response['d']);\n                }, Math.floor(0));\n            }\n        });\n    };\n    /**\n     * @inheritDoc\n     */\n    PersistentConnection.prototype.put = function (pathString, data, onComplete, hash) {\n        this.putInternal('p', pathString, data, onComplete, hash);\n    };\n    /**\n     * @inheritDoc\n     */\n    PersistentConnection.prototype.merge = function (pathString, data, onComplete, hash) {\n        this.putInternal('m', pathString, data, onComplete, hash);\n    };\n    PersistentConnection.prototype.putInternal = function (action, pathString, data, onComplete, hash) {\n        var request = {\n            /*path*/p: pathString,\n            /*data*/d: data\n        };\n        if (hash !== undefined) request['h'] = hash;\n        // TODO: Only keep track of the most recent put for a given path?\n        this.outstandingPuts_.push({\n            action: action,\n            request: request,\n            onComplete: onComplete\n        });\n        this.outstandingPutCount_++;\n        var index = this.outstandingPuts_.length - 1;\n        if (this.connected_) {\n            this.sendPut_(index);\n        } else {\n            this.log_('Buffering put: ' + pathString);\n        }\n    };\n    PersistentConnection.prototype.sendPut_ = function (index) {\n        var _this = this;\n        var action = this.outstandingPuts_[index].action;\n        var request = this.outstandingPuts_[index].request;\n        var onComplete = this.outstandingPuts_[index].onComplete;\n        this.outstandingPuts_[index].queued = this.connected_;\n        this.sendRequest(action, request, function (message) {\n            _this.log_(action + ' response', message);\n            delete _this.outstandingPuts_[index];\n            _this.outstandingPutCount_--;\n            // Clean up array occasionally.\n            if (_this.outstandingPutCount_ === 0) {\n                _this.outstandingPuts_ = [];\n            }\n            if (onComplete) onComplete(message['s'], message['d']);\n        });\n    };\n    /**\n     * @inheritDoc\n     */\n    PersistentConnection.prototype.reportStats = function (stats) {\n        var _this = this;\n        // If we're not connected, we just drop the stats.\n        if (this.connected_) {\n            var request = { /*counters*/c: stats };\n            this.log_('reportStats', request);\n            this.sendRequest( /*stats*/'s', request, function (result) {\n                var status = result['s'];\n                if (status !== 'ok') {\n                    var errorReason = result['d'];\n                    _this.log_('reportStats', 'Error sending stats: ' + errorReason);\n                }\n            });\n        }\n    };\n    /**\n     * @param {*} message\n     * @private\n     */\n    PersistentConnection.prototype.onDataMessage_ = function (message) {\n        if ('r' in message) {\n            // this is a response\n            this.log_('from server: ' + util_2.stringify(message));\n            var reqNum = message['r'];\n            var onResponse = this.requestCBHash_[reqNum];\n            if (onResponse) {\n                delete this.requestCBHash_[reqNum];\n                onResponse(message['b']);\n            }\n        } else if ('error' in message) {\n            throw 'A server-side error has occurred: ' + message['error'];\n        } else if ('a' in message) {\n            // a and b are action and body, respectively\n            this.onDataPush_(message['a'], message['b']);\n        }\n    };\n    PersistentConnection.prototype.onDataPush_ = function (action, body) {\n        this.log_('handleServerMessage', action, body);\n        if (action === 'd') this.onDataUpdate_(body['p'], body['d'],\n        /*isMerge*/false, body['t']);else if (action === 'm') this.onDataUpdate_(body['p'], body['d'],\n        /*isMerge=*/true, body['t']);else if (action === 'c') this.onListenRevoked_(body['p'], body['q']);else if (action === 'ac') this.onAuthRevoked_(body['s'], body['d']);else if (action === 'sd') this.onSecurityDebugPacket_(body);else util_4.error('Unrecognized action received from server: ' + util_2.stringify(action) + '\\nAre you using the latest client?');\n    };\n    PersistentConnection.prototype.onReady_ = function (timestamp, sessionId) {\n        this.log_('connection ready');\n        this.connected_ = true;\n        this.lastConnectionEstablishedTime_ = new Date().getTime();\n        this.handleTimestamp_(timestamp);\n        this.lastSessionId = sessionId;\n        if (this.firstConnection_) {\n            this.sendConnectStats_();\n        }\n        this.restoreState_();\n        this.firstConnection_ = false;\n        this.onConnectStatus_(true);\n    };\n    PersistentConnection.prototype.scheduleConnect_ = function (timeout) {\n        var _this = this;\n        util_3.assert(!this.realtime_, \"Scheduling a connect when we're already connected/ing?\");\n        if (this.establishConnectionTimer_) {\n            clearTimeout(this.establishConnectionTimer_);\n        }\n        // NOTE: Even when timeout is 0, it's important to do a setTimeout to work around an infuriating \"Security Error\" in\n        // Firefox when trying to write to our long-polling iframe in some scenarios (e.g. Forge or our unit tests).\n        this.establishConnectionTimer_ = setTimeout(function () {\n            _this.establishConnectionTimer_ = null;\n            _this.establishConnection_();\n        }, Math.floor(timeout));\n    };\n    /**\n     * @param {boolean} visible\n     * @private\n     */\n    PersistentConnection.prototype.onVisible_ = function (visible) {\n        // NOTE: Tabbing away and back to a window will defeat our reconnect backoff, but I think that's fine.\n        if (visible && !this.visible_ && this.reconnectDelay_ === this.maxReconnectDelay_) {\n            this.log_('Window became visible.  Reducing delay.');\n            this.reconnectDelay_ = RECONNECT_MIN_DELAY;\n            if (!this.realtime_) {\n                this.scheduleConnect_(0);\n            }\n        }\n        this.visible_ = visible;\n    };\n    PersistentConnection.prototype.onOnline_ = function (online) {\n        if (online) {\n            this.log_('Browser went online.');\n            this.reconnectDelay_ = RECONNECT_MIN_DELAY;\n            if (!this.realtime_) {\n                this.scheduleConnect_(0);\n            }\n        } else {\n            this.log_('Browser went offline.  Killing connection.');\n            if (this.realtime_) {\n                this.realtime_.close();\n            }\n        }\n    };\n    PersistentConnection.prototype.onRealtimeDisconnect_ = function () {\n        this.log_('data client disconnected');\n        this.connected_ = false;\n        this.realtime_ = null;\n        // Since we don't know if our sent transactions succeeded or not, we need to cancel them.\n        this.cancelSentTransactions_();\n        // Clear out the pending requests.\n        this.requestCBHash_ = {};\n        if (this.shouldReconnect_()) {\n            if (!this.visible_) {\n                this.log_(\"Window isn't visible.  Delaying reconnect.\");\n                this.reconnectDelay_ = this.maxReconnectDelay_;\n                this.lastConnectionAttemptTime_ = new Date().getTime();\n            } else if (this.lastConnectionEstablishedTime_) {\n                // If we've been connected long enough, reset reconnect delay to minimum.\n                var timeSinceLastConnectSucceeded = new Date().getTime() - this.lastConnectionEstablishedTime_;\n                if (timeSinceLastConnectSucceeded > RECONNECT_DELAY_RESET_TIMEOUT) this.reconnectDelay_ = RECONNECT_MIN_DELAY;\n                this.lastConnectionEstablishedTime_ = null;\n            }\n            var timeSinceLastConnectAttempt = new Date().getTime() - this.lastConnectionAttemptTime_;\n            var reconnectDelay = Math.max(0, this.reconnectDelay_ - timeSinceLastConnectAttempt);\n            reconnectDelay = Math.random() * reconnectDelay;\n            this.log_('Trying to reconnect in ' + reconnectDelay + 'ms');\n            this.scheduleConnect_(reconnectDelay);\n            // Adjust reconnect delay for next time.\n            this.reconnectDelay_ = Math.min(this.maxReconnectDelay_, this.reconnectDelay_ * RECONNECT_DELAY_MULTIPLIER);\n        }\n        this.onConnectStatus_(false);\n    };\n    PersistentConnection.prototype.establishConnection_ = function () {\n        if (this.shouldReconnect_()) {\n            this.log_('Making a connection attempt');\n            this.lastConnectionAttemptTime_ = new Date().getTime();\n            this.lastConnectionEstablishedTime_ = null;\n            var onDataMessage_1 = this.onDataMessage_.bind(this);\n            var onReady_1 = this.onReady_.bind(this);\n            var onDisconnect_1 = this.onRealtimeDisconnect_.bind(this);\n            var connId_1 = this.id + ':' + PersistentConnection.nextConnectionId_++;\n            var self_1 = this;\n            var lastSessionId_1 = this.lastSessionId;\n            var canceled_1 = false;\n            var connection_1 = null;\n            var closeFn_1 = function closeFn_1() {\n                if (connection_1) {\n                    connection_1.close();\n                } else {\n                    canceled_1 = true;\n                    onDisconnect_1();\n                }\n            };\n            var sendRequestFn = function sendRequestFn(msg) {\n                util_3.assert(connection_1, \"sendRequest call when we're not connected not allowed.\");\n                connection_1.sendRequest(msg);\n            };\n            this.realtime_ = {\n                close: closeFn_1,\n                sendRequest: sendRequestFn\n            };\n            var forceRefresh = this.forceTokenRefresh_;\n            this.forceTokenRefresh_ = false;\n            // First fetch auth token, and establish connection after fetching the token was successful\n            this.authTokenProvider_.getToken(forceRefresh).then(function (result) {\n                if (!canceled_1) {\n                    util_4.log('getToken() completed. Creating connection.');\n                    self_1.authToken_ = result && result.accessToken;\n                    connection_1 = new Connection_1.Connection(connId_1, self_1.repoInfo_, onDataMessage_1, onReady_1, onDisconnect_1,\n                    /* onKill= */function (reason) {\n                        util_4.warn(reason + ' (' + self_1.repoInfo_.toString() + ')');\n                        self_1.interrupt(SERVER_KILL_INTERRUPT_REASON);\n                    }, lastSessionId_1);\n                } else {\n                    util_4.log('getToken() completed but was canceled');\n                }\n            }).then(null, function (error) {\n                self_1.log_('Failed to get token: ' + error);\n                if (!canceled_1) {\n                    if (util_6.CONSTANTS.NODE_ADMIN) {\n                        // This may be a critical error for the Admin Node.js SDK, so log a warning.\n                        // But getToken() may also just have temporarily failed, so we still want to\n                        // continue retrying.\n                        util_4.warn(error);\n                    }\n                    closeFn_1();\n                }\n            });\n        }\n    };\n    /**\n     * @param {string} reason\n     */\n    PersistentConnection.prototype.interrupt = function (reason) {\n        util_4.log('Interrupting connection for reason: ' + reason);\n        this.interruptReasons_[reason] = true;\n        if (this.realtime_) {\n            this.realtime_.close();\n        } else {\n            if (this.establishConnectionTimer_) {\n                clearTimeout(this.establishConnectionTimer_);\n                this.establishConnectionTimer_ = null;\n            }\n            if (this.connected_) {\n                this.onRealtimeDisconnect_();\n            }\n        }\n    };\n    /**\n     * @param {string} reason\n     */\n    PersistentConnection.prototype.resume = function (reason) {\n        util_4.log('Resuming connection for reason: ' + reason);\n        delete this.interruptReasons_[reason];\n        if (util_1.isEmpty(this.interruptReasons_)) {\n            this.reconnectDelay_ = RECONNECT_MIN_DELAY;\n            if (!this.realtime_) {\n                this.scheduleConnect_(0);\n            }\n        }\n    };\n    PersistentConnection.prototype.handleTimestamp_ = function (timestamp) {\n        var delta = timestamp - new Date().getTime();\n        this.onServerInfoUpdate_({ serverTimeOffset: delta });\n    };\n    PersistentConnection.prototype.cancelSentTransactions_ = function () {\n        for (var i = 0; i < this.outstandingPuts_.length; i++) {\n            var put = this.outstandingPuts_[i];\n            if (put && /*hash*/'h' in put.request && put.queued) {\n                if (put.onComplete) put.onComplete('disconnect');\n                delete this.outstandingPuts_[i];\n                this.outstandingPutCount_--;\n            }\n        }\n        // Clean up array occasionally.\n        if (this.outstandingPutCount_ === 0) this.outstandingPuts_ = [];\n    };\n    /**\n     * @param {!string} pathString\n     * @param {Array.<*>=} query\n     * @private\n     */\n    PersistentConnection.prototype.onListenRevoked_ = function (pathString, query) {\n        // Remove the listen and manufacture a \"permission_denied\" error for the failed listen.\n        var queryId;\n        if (!query) {\n            queryId = 'default';\n        } else {\n            queryId = query.map(function (q) {\n                return util_4.ObjectToUniqueKey(q);\n            }).join('$');\n        }\n        var listen = this.removeListen_(pathString, queryId);\n        if (listen && listen.onComplete) listen.onComplete('permission_denied');\n    };\n    /**\n     * @param {!string} pathString\n     * @param {!string} queryId\n     * @return {{queries:Array.<Query>, onComplete:function(string)}}\n     * @private\n     */\n    PersistentConnection.prototype.removeListen_ = function (pathString, queryId) {\n        var normalizedPathString = new Path_1.Path(pathString).toString(); // normalize path.\n        var listen;\n        if (this.listens_[normalizedPathString] !== undefined) {\n            listen = this.listens_[normalizedPathString][queryId];\n            delete this.listens_[normalizedPathString][queryId];\n            if (util_1.getCount(this.listens_[normalizedPathString]) === 0) {\n                delete this.listens_[normalizedPathString];\n            }\n        } else {\n            // all listens for this path has already been removed\n            listen = undefined;\n        }\n        return listen;\n    };\n    PersistentConnection.prototype.onAuthRevoked_ = function (statusCode, explanation) {\n        util_4.log('Auth token revoked: ' + statusCode + '/' + explanation);\n        this.authToken_ = null;\n        this.forceTokenRefresh_ = true;\n        this.realtime_.close();\n        if (statusCode === 'invalid_token' || statusCode === 'permission_denied') {\n            // We'll wait a couple times before logging the warning / increasing the\n            // retry period since oauth tokens will report as \"invalid\" if they're\n            // just expired. Plus there may be transient issues that resolve themselves.\n            this.invalidAuthTokenCount_++;\n            if (this.invalidAuthTokenCount_ >= INVALID_AUTH_TOKEN_THRESHOLD) {\n                // Set a long reconnect delay because recovery is unlikely\n                this.reconnectDelay_ = RECONNECT_MAX_DELAY_FOR_ADMINS;\n                // Notify the auth token provider that the token is invalid, which will log\n                // a warning\n                this.authTokenProvider_.notifyForInvalidToken();\n            }\n        }\n    };\n    PersistentConnection.prototype.onSecurityDebugPacket_ = function (body) {\n        if (this.securityDebugCallback_) {\n            this.securityDebugCallback_(body);\n        } else {\n            if ('msg' in body && typeof console !== 'undefined') {\n                console.log('FIREBASE: ' + body['msg'].replace('\\n', '\\nFIREBASE: '));\n            }\n        }\n    };\n    PersistentConnection.prototype.restoreState_ = function () {\n        var _this = this;\n        //Re-authenticate ourselves if we have a credential stored.\n        this.tryAuth();\n        // Puts depend on having received the corresponding data update from the server before they complete, so we must\n        // make sure to send listens before puts.\n        util_1.forEach(this.listens_, function (pathString, queries) {\n            util_1.forEach(queries, function (key, listenSpec) {\n                _this.sendListen_(listenSpec);\n            });\n        });\n        for (var i = 0; i < this.outstandingPuts_.length; i++) {\n            if (this.outstandingPuts_[i]) this.sendPut_(i);\n        }\n        while (this.onDisconnectRequestQueue_.length) {\n            var request = this.onDisconnectRequestQueue_.shift();\n            this.sendOnDisconnect_(request.action, request.pathString, request.data, request.onComplete);\n        }\n    };\n    /**\n     * Sends client stats for first connection\n     * @private\n     */\n    PersistentConnection.prototype.sendConnectStats_ = function () {\n        var stats = {};\n        var clientName = 'js';\n        if (util_6.CONSTANTS.NODE_ADMIN) {\n            clientName = 'admin_node';\n        } else if (util_6.CONSTANTS.NODE_CLIENT) {\n            clientName = 'node';\n        }\n        stats['sdk.' + clientName + '.' + app_1.default.SDK_VERSION.replace(/\\./g, '-')] = 1;\n        if (util_7.isMobileCordova()) {\n            stats['framework.cordova'] = 1;\n        } else if (util_7.isReactNative()) {\n            stats['framework.reactnative'] = 1;\n        }\n        this.reportStats(stats);\n    };\n    /**\n     * @return {boolean}\n     * @private\n     */\n    PersistentConnection.prototype.shouldReconnect_ = function () {\n        var online = OnlineMonitor_1.OnlineMonitor.getInstance().currentlyOnline();\n        return util_1.isEmpty(this.interruptReasons_) && online;\n    };\n    /**\n     * @private\n     */\n    PersistentConnection.nextPersistentConnectionId_ = 0;\n    /**\n     * Counter for number of connections created. Mainly used for tagging in the logs\n     * @type {number}\n     * @private\n     */\n    PersistentConnection.nextConnectionId_ = 0;\n    return PersistentConnection;\n}(ServerActions_1.ServerActions);\nexports.PersistentConnection = PersistentConnection;\n\n//# sourceMappingURL=PersistentConnection.js.map\n\n/***/ }),\n/* 102 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = __webpack_require__(0);\n/**\n * Base class to be used if you want to emit events. Call the constructor with\n * the set of allowed event names.\n */\nvar EventEmitter = /** @class */function () {\n    /**\n     * @param {!Array.<string>} allowedEvents_\n     */\n    function EventEmitter(allowedEvents_) {\n        this.allowedEvents_ = allowedEvents_;\n        this.listeners_ = {};\n        util_1.assert(Array.isArray(allowedEvents_) && allowedEvents_.length > 0, 'Requires a non-empty array');\n    }\n    /**\n     * To be called by derived classes to trigger events.\n     * @param {!string} eventType\n     * @param {...*} var_args\n     */\n    EventEmitter.prototype.trigger = function (eventType) {\n        var var_args = [];\n        for (var _i = 1; _i < arguments.length; _i++) {\n            var_args[_i - 1] = arguments[_i];\n        }\n        if (Array.isArray(this.listeners_[eventType])) {\n            // Clone the list, since callbacks could add/remove listeners.\n            var listeners = this.listeners_[eventType].slice();\n            for (var i = 0; i < listeners.length; i++) {\n                listeners[i].callback.apply(listeners[i].context, var_args);\n            }\n        }\n    };\n    EventEmitter.prototype.on = function (eventType, callback, context) {\n        this.validateEventType_(eventType);\n        this.listeners_[eventType] = this.listeners_[eventType] || [];\n        this.listeners_[eventType].push({ callback: callback, context: context });\n        var eventData = this.getInitialEvent(eventType);\n        if (eventData) {\n            callback.apply(context, eventData);\n        }\n    };\n    EventEmitter.prototype.off = function (eventType, callback, context) {\n        this.validateEventType_(eventType);\n        var listeners = this.listeners_[eventType] || [];\n        for (var i = 0; i < listeners.length; i++) {\n            if (listeners[i].callback === callback && (!context || context === listeners[i].context)) {\n                listeners.splice(i, 1);\n                return;\n            }\n        }\n    };\n    EventEmitter.prototype.validateEventType_ = function (eventType) {\n        util_1.assert(this.allowedEvents_.find(function (et) {\n            return et === eventType;\n        }), 'Unknown event: ' + eventType);\n    };\n    return EventEmitter;\n}();\nexports.EventEmitter = EventEmitter;\n\n//# sourceMappingURL=EventEmitter.js.map\n\n/***/ }),\n/* 103 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = __webpack_require__(2);\nvar storage_1 = __webpack_require__(34);\nvar Constants_1 = __webpack_require__(35);\nvar TransportManager_1 = __webpack_require__(182);\n// Abort upgrade attempt if it takes longer than 60s.\nvar UPGRADE_TIMEOUT = 60000;\n// For some transports (WebSockets), we need to \"validate\" the transport by exchanging a few requests and responses.\n// If we haven't sent enough requests within 5s, we'll start sending noop ping requests.\nvar DELAY_BEFORE_SENDING_EXTRA_REQUESTS = 5000;\n// If the initial data sent triggers a lot of bandwidth (i.e. it's a large put or a listen for a large amount of data)\n// then we may not be able to exchange our ping/pong requests within the healthy timeout.  So if we reach the timeout\n// but we've sent/received enough bytes, we don't cancel the connection.\nvar BYTES_SENT_HEALTHY_OVERRIDE = 10 * 1024;\nvar BYTES_RECEIVED_HEALTHY_OVERRIDE = 100 * 1024;\nvar MESSAGE_TYPE = 't';\nvar MESSAGE_DATA = 'd';\nvar CONTROL_SHUTDOWN = 's';\nvar CONTROL_RESET = 'r';\nvar CONTROL_ERROR = 'e';\nvar CONTROL_PONG = 'o';\nvar SWITCH_ACK = 'a';\nvar END_TRANSMISSION = 'n';\nvar PING = 'p';\nvar SERVER_HELLO = 'h';\n/**\n * Creates a new real-time connection to the server using whichever method works\n * best in the current browser.\n *\n * @constructor\n */\nvar Connection = /** @class */function () {\n    /**\n     * @param {!string} id - an id for this connection\n     * @param {!RepoInfo} repoInfo_ - the info for the endpoint to connect to\n     * @param {function(Object)} onMessage_ - the callback to be triggered when a server-push message arrives\n     * @param {function(number, string)} onReady_ - the callback to be triggered when this connection is ready to send messages.\n     * @param {function()} onDisconnect_ - the callback to be triggered when a connection was lost\n     * @param {function(string)} onKill_ - the callback to be triggered when this connection has permanently shut down.\n     * @param {string=} lastSessionId - last session id in persistent connection. is used to clean up old session in real-time server\n     */\n    function Connection(id, repoInfo_, onMessage_, onReady_, onDisconnect_, onKill_, lastSessionId) {\n        this.id = id;\n        this.repoInfo_ = repoInfo_;\n        this.onMessage_ = onMessage_;\n        this.onReady_ = onReady_;\n        this.onDisconnect_ = onDisconnect_;\n        this.onKill_ = onKill_;\n        this.lastSessionId = lastSessionId;\n        this.connectionCount = 0;\n        this.pendingDataMessages = [];\n        this.state_ = 0 /* CONNECTING */;\n        this.log_ = util_1.logWrapper('c:' + this.id + ':');\n        this.transportManager_ = new TransportManager_1.TransportManager(repoInfo_);\n        this.log_('Connection created');\n        this.start_();\n    }\n    /**\n     * Starts a connection attempt\n     * @private\n     */\n    Connection.prototype.start_ = function () {\n        var _this = this;\n        var conn = this.transportManager_.initialTransport();\n        this.conn_ = new conn(this.nextTransportId_(), this.repoInfo_, undefined, this.lastSessionId);\n        // For certain transports (WebSockets), we need to send and receive several messages back and forth before we\n        // can consider the transport healthy.\n        this.primaryResponsesRequired_ = conn['responsesRequiredToBeHealthy'] || 0;\n        var onMessageReceived = this.connReceiver_(this.conn_);\n        var onConnectionLost = this.disconnReceiver_(this.conn_);\n        this.tx_ = this.conn_;\n        this.rx_ = this.conn_;\n        this.secondaryConn_ = null;\n        this.isHealthy_ = false;\n        /*\n         * Firefox doesn't like when code from one iframe tries to create another iframe by way of the parent frame.\n         * This can occur in the case of a redirect, i.e. we guessed wrong on what server to connect to and received a reset.\n         * Somehow, setTimeout seems to make this ok. That doesn't make sense from a security perspective, since you should\n         * still have the context of your originating frame.\n         */\n        setTimeout(function () {\n            // this.conn_ gets set to null in some of the tests. Check to make sure it still exists before using it\n            _this.conn_ && _this.conn_.open(onMessageReceived, onConnectionLost);\n        }, Math.floor(0));\n        var healthyTimeout_ms = conn['healthyTimeout'] || 0;\n        if (healthyTimeout_ms > 0) {\n            this.healthyTimeout_ = util_1.setTimeoutNonBlocking(function () {\n                _this.healthyTimeout_ = null;\n                if (!_this.isHealthy_) {\n                    if (_this.conn_ && _this.conn_.bytesReceived > BYTES_RECEIVED_HEALTHY_OVERRIDE) {\n                        _this.log_('Connection exceeded healthy timeout but has received ' + _this.conn_.bytesReceived + ' bytes.  Marking connection healthy.');\n                        _this.isHealthy_ = true;\n                        _this.conn_.markConnectionHealthy();\n                    } else if (_this.conn_ && _this.conn_.bytesSent > BYTES_SENT_HEALTHY_OVERRIDE) {\n                        _this.log_('Connection exceeded healthy timeout but has sent ' + _this.conn_.bytesSent + ' bytes.  Leaving connection alive.');\n                        // NOTE: We don't want to mark it healthy, since we have no guarantee that the bytes have made it to\n                        // the server.\n                    } else {\n                        _this.log_('Closing unhealthy connection after timeout.');\n                        _this.close();\n                    }\n                }\n            }, Math.floor(healthyTimeout_ms));\n        }\n    };\n    /**\n     * @return {!string}\n     * @private\n     */\n    Connection.prototype.nextTransportId_ = function () {\n        return 'c:' + this.id + ':' + this.connectionCount++;\n    };\n    Connection.prototype.disconnReceiver_ = function (conn) {\n        var _this = this;\n        return function (everConnected) {\n            if (conn === _this.conn_) {\n                _this.onConnectionLost_(everConnected);\n            } else if (conn === _this.secondaryConn_) {\n                _this.log_('Secondary connection lost.');\n                _this.onSecondaryConnectionLost_();\n            } else {\n                _this.log_('closing an old connection');\n            }\n        };\n    };\n    Connection.prototype.connReceiver_ = function (conn) {\n        var _this = this;\n        return function (message) {\n            if (_this.state_ != 2 /* DISCONNECTED */) {\n                    if (conn === _this.rx_) {\n                        _this.onPrimaryMessageReceived_(message);\n                    } else if (conn === _this.secondaryConn_) {\n                        _this.onSecondaryMessageReceived_(message);\n                    } else {\n                        _this.log_('message on old connection');\n                    }\n                }\n        };\n    };\n    /**\n     *\n     * @param {Object} dataMsg An arbitrary data message to be sent to the server\n     */\n    Connection.prototype.sendRequest = function (dataMsg) {\n        // wrap in a data message envelope and send it on\n        var msg = { t: 'd', d: dataMsg };\n        this.sendData_(msg);\n    };\n    Connection.prototype.tryCleanupConnection = function () {\n        if (this.tx_ === this.secondaryConn_ && this.rx_ === this.secondaryConn_) {\n            this.log_('cleaning up and promoting a connection: ' + this.secondaryConn_.connId);\n            this.conn_ = this.secondaryConn_;\n            this.secondaryConn_ = null;\n            // the server will shutdown the old connection\n        }\n    };\n    Connection.prototype.onSecondaryControl_ = function (controlData) {\n        if (MESSAGE_TYPE in controlData) {\n            var cmd = controlData[MESSAGE_TYPE];\n            if (cmd === SWITCH_ACK) {\n                this.upgradeIfSecondaryHealthy_();\n            } else if (cmd === CONTROL_RESET) {\n                // Most likely the session wasn't valid. Abandon the switch attempt\n                this.log_('Got a reset on secondary, closing it');\n                this.secondaryConn_.close();\n                // If we were already using this connection for something, than we need to fully close\n                if (this.tx_ === this.secondaryConn_ || this.rx_ === this.secondaryConn_) {\n                    this.close();\n                }\n            } else if (cmd === CONTROL_PONG) {\n                this.log_('got pong on secondary.');\n                this.secondaryResponsesRequired_--;\n                this.upgradeIfSecondaryHealthy_();\n            }\n        }\n    };\n    Connection.prototype.onSecondaryMessageReceived_ = function (parsedData) {\n        var layer = util_1.requireKey('t', parsedData);\n        var data = util_1.requireKey('d', parsedData);\n        if (layer == 'c') {\n            this.onSecondaryControl_(data);\n        } else if (layer == 'd') {\n            // got a data message, but we're still second connection. Need to buffer it up\n            this.pendingDataMessages.push(data);\n        } else {\n            throw new Error('Unknown protocol layer: ' + layer);\n        }\n    };\n    Connection.prototype.upgradeIfSecondaryHealthy_ = function () {\n        if (this.secondaryResponsesRequired_ <= 0) {\n            this.log_('Secondary connection is healthy.');\n            this.isHealthy_ = true;\n            this.secondaryConn_.markConnectionHealthy();\n            this.proceedWithUpgrade_();\n        } else {\n            // Send a ping to make sure the connection is healthy.\n            this.log_('sending ping on secondary.');\n            this.secondaryConn_.send({ t: 'c', d: { t: PING, d: {} } });\n        }\n    };\n    Connection.prototype.proceedWithUpgrade_ = function () {\n        // tell this connection to consider itself open\n        this.secondaryConn_.start();\n        // send ack\n        this.log_('sending client ack on secondary');\n        this.secondaryConn_.send({ t: 'c', d: { t: SWITCH_ACK, d: {} } });\n        // send end packet on primary transport, switch to sending on this one\n        // can receive on this one, buffer responses until end received on primary transport\n        this.log_('Ending transmission on primary');\n        this.conn_.send({ t: 'c', d: { t: END_TRANSMISSION, d: {} } });\n        this.tx_ = this.secondaryConn_;\n        this.tryCleanupConnection();\n    };\n    Connection.prototype.onPrimaryMessageReceived_ = function (parsedData) {\n        // Must refer to parsedData properties in quotes, so closure doesn't touch them.\n        var layer = util_1.requireKey('t', parsedData);\n        var data = util_1.requireKey('d', parsedData);\n        if (layer == 'c') {\n            this.onControl_(data);\n        } else if (layer == 'd') {\n            this.onDataMessage_(data);\n        }\n    };\n    Connection.prototype.onDataMessage_ = function (message) {\n        this.onPrimaryResponse_();\n        // We don't do anything with data messages, just kick them up a level\n        this.onMessage_(message);\n    };\n    Connection.prototype.onPrimaryResponse_ = function () {\n        if (!this.isHealthy_) {\n            this.primaryResponsesRequired_--;\n            if (this.primaryResponsesRequired_ <= 0) {\n                this.log_('Primary connection is healthy.');\n                this.isHealthy_ = true;\n                this.conn_.markConnectionHealthy();\n            }\n        }\n    };\n    Connection.prototype.onControl_ = function (controlData) {\n        var cmd = util_1.requireKey(MESSAGE_TYPE, controlData);\n        if (MESSAGE_DATA in controlData) {\n            var payload = controlData[MESSAGE_DATA];\n            if (cmd === SERVER_HELLO) {\n                this.onHandshake_(payload);\n            } else if (cmd === END_TRANSMISSION) {\n                this.log_('recvd end transmission on primary');\n                this.rx_ = this.secondaryConn_;\n                for (var i = 0; i < this.pendingDataMessages.length; ++i) {\n                    this.onDataMessage_(this.pendingDataMessages[i]);\n                }\n                this.pendingDataMessages = [];\n                this.tryCleanupConnection();\n            } else if (cmd === CONTROL_SHUTDOWN) {\n                // This was previously the 'onKill' callback passed to the lower-level connection\n                // payload in this case is the reason for the shutdown. Generally a human-readable error\n                this.onConnectionShutdown_(payload);\n            } else if (cmd === CONTROL_RESET) {\n                // payload in this case is the host we should contact\n                this.onReset_(payload);\n            } else if (cmd === CONTROL_ERROR) {\n                util_1.error('Server Error: ' + payload);\n            } else if (cmd === CONTROL_PONG) {\n                this.log_('got pong on primary.');\n                this.onPrimaryResponse_();\n                this.sendPingOnPrimaryIfNecessary_();\n            } else {\n                util_1.error('Unknown control packet command: ' + cmd);\n            }\n        }\n    };\n    /**\n     *\n     * @param {Object} handshake The handshake data returned from the server\n     * @private\n     */\n    Connection.prototype.onHandshake_ = function (handshake) {\n        var timestamp = handshake.ts;\n        var version = handshake.v;\n        var host = handshake.h;\n        this.sessionId = handshake.s;\n        this.repoInfo_.updateHost(host);\n        // if we've already closed the connection, then don't bother trying to progress further\n        if (this.state_ == 0 /* CONNECTING */) {\n                this.conn_.start();\n                this.onConnectionEstablished_(this.conn_, timestamp);\n                if (Constants_1.PROTOCOL_VERSION !== version) {\n                    util_1.warn('Protocol version mismatch detected');\n                }\n                // TODO: do we want to upgrade? when? maybe a delay?\n                this.tryStartUpgrade_();\n            }\n    };\n    Connection.prototype.tryStartUpgrade_ = function () {\n        var conn = this.transportManager_.upgradeTransport();\n        if (conn) {\n            this.startUpgrade_(conn);\n        }\n    };\n    Connection.prototype.startUpgrade_ = function (conn) {\n        var _this = this;\n        this.secondaryConn_ = new conn(this.nextTransportId_(), this.repoInfo_, this.sessionId);\n        // For certain transports (WebSockets), we need to send and receive several messages back and forth before we\n        // can consider the transport healthy.\n        this.secondaryResponsesRequired_ = conn['responsesRequiredToBeHealthy'] || 0;\n        var onMessage = this.connReceiver_(this.secondaryConn_);\n        var onDisconnect = this.disconnReceiver_(this.secondaryConn_);\n        this.secondaryConn_.open(onMessage, onDisconnect);\n        // If we haven't successfully upgraded after UPGRADE_TIMEOUT, give up and kill the secondary.\n        util_1.setTimeoutNonBlocking(function () {\n            if (_this.secondaryConn_) {\n                _this.log_('Timed out trying to upgrade.');\n                _this.secondaryConn_.close();\n            }\n        }, Math.floor(UPGRADE_TIMEOUT));\n    };\n    Connection.prototype.onReset_ = function (host) {\n        this.log_('Reset packet received.  New host: ' + host);\n        this.repoInfo_.updateHost(host);\n        // TODO: if we're already \"connected\", we need to trigger a disconnect at the next layer up.\n        // We don't currently support resets after the connection has already been established\n        if (this.state_ === 1 /* CONNECTED */) {\n                this.close();\n            } else {\n            // Close whatever connections we have open and start again.\n            this.closeConnections_();\n            this.start_();\n        }\n    };\n    Connection.prototype.onConnectionEstablished_ = function (conn, timestamp) {\n        var _this = this;\n        this.log_('Realtime connection established.');\n        this.conn_ = conn;\n        this.state_ = 1 /* CONNECTED */;\n        if (this.onReady_) {\n            this.onReady_(timestamp, this.sessionId);\n            this.onReady_ = null;\n        }\n        // If after 5 seconds we haven't sent enough requests to the server to get the connection healthy,\n        // send some pings.\n        if (this.primaryResponsesRequired_ === 0) {\n            this.log_('Primary connection is healthy.');\n            this.isHealthy_ = true;\n        } else {\n            util_1.setTimeoutNonBlocking(function () {\n                _this.sendPingOnPrimaryIfNecessary_();\n            }, Math.floor(DELAY_BEFORE_SENDING_EXTRA_REQUESTS));\n        }\n    };\n    Connection.prototype.sendPingOnPrimaryIfNecessary_ = function () {\n        // If the connection isn't considered healthy yet, we'll send a noop ping packet request.\n        if (!this.isHealthy_ && this.state_ === 1 /* CONNECTED */) {\n                this.log_('sending ping on primary.');\n                this.sendData_({ t: 'c', d: { t: PING, d: {} } });\n            }\n    };\n    Connection.prototype.onSecondaryConnectionLost_ = function () {\n        var conn = this.secondaryConn_;\n        this.secondaryConn_ = null;\n        if (this.tx_ === conn || this.rx_ === conn) {\n            // we are relying on this connection already in some capacity. Therefore, a failure is real\n            this.close();\n        }\n    };\n    /**\n     *\n     * @param {boolean} everConnected Whether or not the connection ever reached a server. Used to determine if\n     * we should flush the host cache\n     * @private\n     */\n    Connection.prototype.onConnectionLost_ = function (everConnected) {\n        this.conn_ = null;\n        // NOTE: IF you're seeing a Firefox error for this line, I think it might be because it's getting\n        // called on window close and RealtimeState.CONNECTING is no longer defined.  Just a guess.\n        if (!everConnected && this.state_ === 0 /* CONNECTING */) {\n                this.log_('Realtime connection failed.');\n                // Since we failed to connect at all, clear any cached entry for this namespace in case the machine went away\n                if (this.repoInfo_.isCacheableHost()) {\n                    storage_1.PersistentStorage.remove('host:' + this.repoInfo_.host);\n                    // reset the internal host to what we would show the user, i.e. <ns>.firebaseio.com\n                    this.repoInfo_.internalHost = this.repoInfo_.host;\n                }\n            } else if (this.state_ === 1 /* CONNECTED */) {\n                this.log_('Realtime connection lost.');\n            }\n        this.close();\n    };\n    /**\n     *\n     * @param {string} reason\n     * @private\n     */\n    Connection.prototype.onConnectionShutdown_ = function (reason) {\n        this.log_('Connection shutdown command received. Shutting down...');\n        if (this.onKill_) {\n            this.onKill_(reason);\n            this.onKill_ = null;\n        }\n        // We intentionally don't want to fire onDisconnect (kill is a different case),\n        // so clear the callback.\n        this.onDisconnect_ = null;\n        this.close();\n    };\n    Connection.prototype.sendData_ = function (data) {\n        if (this.state_ !== 1 /* CONNECTED */) {\n                throw 'Connection is not connected';\n            } else {\n            this.tx_.send(data);\n        }\n    };\n    /**\n     * Cleans up this connection, calling the appropriate callbacks\n     */\n    Connection.prototype.close = function () {\n        if (this.state_ !== 2 /* DISCONNECTED */) {\n                this.log_('Closing realtime connection.');\n                this.state_ = 2 /* DISCONNECTED */;\n                this.closeConnections_();\n                if (this.onDisconnect_) {\n                    this.onDisconnect_();\n                    this.onDisconnect_ = null;\n                }\n            }\n    };\n    /**\n     *\n     * @private\n     */\n    Connection.prototype.closeConnections_ = function () {\n        this.log_('Shutting down all connections');\n        if (this.conn_) {\n            this.conn_.close();\n            this.conn_ = null;\n        }\n        if (this.secondaryConn_) {\n            this.secondaryConn_.close();\n            this.secondaryConn_ = null;\n        }\n        if (this.healthyTimeout_) {\n            clearTimeout(this.healthyTimeout_);\n            this.healthyTimeout_ = null;\n        }\n    };\n    return Connection;\n}();\nexports.Connection = Connection;\n\n//# sourceMappingURL=Connection.js.map\n\n/***/ }),\n/* 104 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = __webpack_require__(2);\nvar CountedSet_1 = __webpack_require__(96);\nvar StatsManager_1 = __webpack_require__(73);\nvar PacketReceiver_1 = __webpack_require__(183);\nvar Constants_1 = __webpack_require__(35);\nvar util_2 = __webpack_require__(0);\nvar util_3 = __webpack_require__(0);\n// URL query parameters associated with longpolling\nexports.FIREBASE_LONGPOLL_START_PARAM = 'start';\nexports.FIREBASE_LONGPOLL_CLOSE_COMMAND = 'close';\nexports.FIREBASE_LONGPOLL_COMMAND_CB_NAME = 'pLPCommand';\nexports.FIREBASE_LONGPOLL_DATA_CB_NAME = 'pRTLPCB';\nexports.FIREBASE_LONGPOLL_ID_PARAM = 'id';\nexports.FIREBASE_LONGPOLL_PW_PARAM = 'pw';\nexports.FIREBASE_LONGPOLL_SERIAL_PARAM = 'ser';\nexports.FIREBASE_LONGPOLL_CALLBACK_ID_PARAM = 'cb';\nexports.FIREBASE_LONGPOLL_SEGMENT_NUM_PARAM = 'seg';\nexports.FIREBASE_LONGPOLL_SEGMENTS_IN_PACKET = 'ts';\nexports.FIREBASE_LONGPOLL_DATA_PARAM = 'd';\nexports.FIREBASE_LONGPOLL_DISCONN_FRAME_PARAM = 'disconn';\nexports.FIREBASE_LONGPOLL_DISCONN_FRAME_REQUEST_PARAM = 'dframe';\n//Data size constants.\n//TODO: Perf: the maximum length actually differs from browser to browser.\n// We should check what browser we're on and set accordingly.\nvar MAX_URL_DATA_SIZE = 1870;\nvar SEG_HEADER_SIZE = 30; //ie: &seg=8299234&ts=982389123&d=\nvar MAX_PAYLOAD_SIZE = MAX_URL_DATA_SIZE - SEG_HEADER_SIZE;\n/**\n * Keepalive period\n * send a fresh request at minimum every 25 seconds. Opera has a maximum request\n * length of 30 seconds that we can't exceed.\n * @const\n * @type {number}\n */\nvar KEEPALIVE_REQUEST_INTERVAL = 25000;\n/**\n * How long to wait before aborting a long-polling connection attempt.\n * @const\n * @type {number}\n */\nvar LP_CONNECT_TIMEOUT = 30000;\n/**\n * This class manages a single long-polling connection.\n *\n * @constructor\n * @implements {Transport}\n */\nvar BrowserPollConnection = /** @class */function () {\n    /**\n     * @param {string} connId An identifier for this connection, used for logging\n     * @param {RepoInfo} repoInfo The info for the endpoint to send data to.\n     * @param {string=} transportSessionId Optional transportSessionid if we are reconnecting for an existing\n     *                                         transport session\n     * @param {string=}  lastSessionId Optional lastSessionId if the PersistentConnection has already created a\n     *                                     connection previously\n     */\n    function BrowserPollConnection(connId, repoInfo, transportSessionId, lastSessionId) {\n        this.connId = connId;\n        this.repoInfo = repoInfo;\n        this.transportSessionId = transportSessionId;\n        this.lastSessionId = lastSessionId;\n        this.bytesSent = 0;\n        this.bytesReceived = 0;\n        this.everConnected_ = false;\n        this.log_ = util_1.logWrapper(connId);\n        this.stats_ = StatsManager_1.StatsManager.getCollection(repoInfo);\n        this.urlFn = function (params) {\n            return repoInfo.connectionURL(Constants_1.LONG_POLLING, params);\n        };\n    }\n    /**\n     *\n     * @param {function(Object)} onMessage Callback when messages arrive\n     * @param {function()} onDisconnect Callback with connection lost.\n     */\n    BrowserPollConnection.prototype.open = function (onMessage, onDisconnect) {\n        var _this = this;\n        this.curSegmentNum = 0;\n        this.onDisconnect_ = onDisconnect;\n        this.myPacketOrderer = new PacketReceiver_1.PacketReceiver(onMessage);\n        this.isClosed_ = false;\n        this.connectTimeoutTimer_ = setTimeout(function () {\n            _this.log_('Timed out trying to connect.');\n            // Make sure we clear the host cache\n            _this.onClosed_();\n            _this.connectTimeoutTimer_ = null;\n        }, Math.floor(LP_CONNECT_TIMEOUT));\n        // Ensure we delay the creation of the iframe until the DOM is loaded.\n        util_1.executeWhenDOMReady(function () {\n            if (_this.isClosed_) return;\n            //Set up a callback that gets triggered once a connection is set up.\n            _this.scriptTagHolder = new FirebaseIFrameScriptHolder(function () {\n                var args = [];\n                for (var _i = 0; _i < arguments.length; _i++) {\n                    args[_i] = arguments[_i];\n                }\n                var command = args[0],\n                    arg1 = args[1],\n                    arg2 = args[2],\n                    arg3 = args[3],\n                    arg4 = args[4];\n                _this.incrementIncomingBytes_(args);\n                if (!_this.scriptTagHolder) return; // we closed the connection.\n                if (_this.connectTimeoutTimer_) {\n                    clearTimeout(_this.connectTimeoutTimer_);\n                    _this.connectTimeoutTimer_ = null;\n                }\n                _this.everConnected_ = true;\n                if (command == exports.FIREBASE_LONGPOLL_START_PARAM) {\n                    _this.id = arg1;\n                    _this.password = arg2;\n                } else if (command === exports.FIREBASE_LONGPOLL_CLOSE_COMMAND) {\n                    // Don't clear the host cache. We got a response from the server, so we know it's reachable\n                    if (arg1) {\n                        // We aren't expecting any more data (other than what the server's already in the process of sending us\n                        // through our already open polls), so don't send any more.\n                        _this.scriptTagHolder.sendNewPolls = false;\n                        // arg1 in this case is the last response number sent by the server. We should try to receive\n                        // all of the responses up to this one before closing\n                        _this.myPacketOrderer.closeAfter(arg1, function () {\n                            _this.onClosed_();\n                        });\n                    } else {\n                        _this.onClosed_();\n                    }\n                } else {\n                    throw new Error('Unrecognized command received: ' + command);\n                }\n            }, function () {\n                var args = [];\n                for (var _i = 0; _i < arguments.length; _i++) {\n                    args[_i] = arguments[_i];\n                }\n                var pN = args[0],\n                    data = args[1];\n                _this.incrementIncomingBytes_(args);\n                _this.myPacketOrderer.handleResponse(pN, data);\n            }, function () {\n                _this.onClosed_();\n            }, _this.urlFn);\n            //Send the initial request to connect. The serial number is simply to keep the browser from pulling previous results\n            //from cache.\n            var urlParams = {};\n            urlParams[exports.FIREBASE_LONGPOLL_START_PARAM] = 't';\n            urlParams[exports.FIREBASE_LONGPOLL_SERIAL_PARAM] = Math.floor(Math.random() * 100000000);\n            if (_this.scriptTagHolder.uniqueCallbackIdentifier) urlParams[exports.FIREBASE_LONGPOLL_CALLBACK_ID_PARAM] = _this.scriptTagHolder.uniqueCallbackIdentifier;\n            urlParams[Constants_1.VERSION_PARAM] = Constants_1.PROTOCOL_VERSION;\n            if (_this.transportSessionId) {\n                urlParams[Constants_1.TRANSPORT_SESSION_PARAM] = _this.transportSessionId;\n            }\n            if (_this.lastSessionId) {\n                urlParams[Constants_1.LAST_SESSION_PARAM] = _this.lastSessionId;\n            }\n            if (!util_3.isNodeSdk() && typeof location !== 'undefined' && location.href && location.href.indexOf(Constants_1.FORGE_DOMAIN) !== -1) {\n                urlParams[Constants_1.REFERER_PARAM] = Constants_1.FORGE_REF;\n            }\n            var connectURL = _this.urlFn(urlParams);\n            _this.log_('Connecting via long-poll to ' + connectURL);\n            _this.scriptTagHolder.addTag(connectURL, function () {\n                /* do nothing */\n            });\n        });\n    };\n    /**\n     * Call this when a handshake has completed successfully and we want to consider the connection established\n     */\n    BrowserPollConnection.prototype.start = function () {\n        this.scriptTagHolder.startLongPoll(this.id, this.password);\n        this.addDisconnectPingFrame(this.id, this.password);\n    };\n    /**\n     * Forces long polling to be considered as a potential transport\n     */\n    BrowserPollConnection.forceAllow = function () {\n        BrowserPollConnection.forceAllow_ = true;\n    };\n    /**\n     * Forces longpolling to not be considered as a potential transport\n     */\n    BrowserPollConnection.forceDisallow = function () {\n        BrowserPollConnection.forceDisallow_ = true;\n    };\n    // Static method, use string literal so it can be accessed in a generic way\n    BrowserPollConnection.isAvailable = function () {\n        // NOTE: In React-Native there's normally no 'document', but if you debug a React-Native app in\n        // the Chrome debugger, 'document' is defined, but document.createElement is null (2015/06/08).\n        return BrowserPollConnection.forceAllow_ || !BrowserPollConnection.forceDisallow_ && typeof document !== 'undefined' && document.createElement != null && !util_1.isChromeExtensionContentScript() && !util_1.isWindowsStoreApp() && !util_3.isNodeSdk();\n    };\n    /**\n     * No-op for polling\n     */\n    BrowserPollConnection.prototype.markConnectionHealthy = function () {};\n    /**\n     * Stops polling and cleans up the iframe\n     * @private\n     */\n    BrowserPollConnection.prototype.shutdown_ = function () {\n        this.isClosed_ = true;\n        if (this.scriptTagHolder) {\n            this.scriptTagHolder.close();\n            this.scriptTagHolder = null;\n        }\n        //remove the disconnect frame, which will trigger an XHR call to the server to tell it we're leaving.\n        if (this.myDisconnFrame) {\n            document.body.removeChild(this.myDisconnFrame);\n            this.myDisconnFrame = null;\n        }\n        if (this.connectTimeoutTimer_) {\n            clearTimeout(this.connectTimeoutTimer_);\n            this.connectTimeoutTimer_ = null;\n        }\n    };\n    /**\n     * Triggered when this transport is closed\n     * @private\n     */\n    BrowserPollConnection.prototype.onClosed_ = function () {\n        if (!this.isClosed_) {\n            this.log_('Longpoll is closing itself');\n            this.shutdown_();\n            if (this.onDisconnect_) {\n                this.onDisconnect_(this.everConnected_);\n                this.onDisconnect_ = null;\n            }\n        }\n    };\n    /**\n     * External-facing close handler. RealTime has requested we shut down. Kill our connection and tell the server\n     * that we've left.\n     */\n    BrowserPollConnection.prototype.close = function () {\n        if (!this.isClosed_) {\n            this.log_('Longpoll is being closed.');\n            this.shutdown_();\n        }\n    };\n    /**\n     * Send the JSON object down to the server. It will need to be stringified, base64 encoded, and then\n     * broken into chunks (since URLs have a small maximum length).\n     * @param {!Object} data The JSON data to transmit.\n     */\n    BrowserPollConnection.prototype.send = function (data) {\n        var dataStr = util_2.stringify(data);\n        this.bytesSent += dataStr.length;\n        this.stats_.incrementCounter('bytes_sent', dataStr.length);\n        //first, lets get the base64-encoded data\n        var base64data = util_2.base64Encode(dataStr);\n        //We can only fit a certain amount in each URL, so we need to split this request\n        //up into multiple pieces if it doesn't fit in one request.\n        var dataSegs = util_1.splitStringBySize(base64data, MAX_PAYLOAD_SIZE);\n        //Enqueue each segment for transmission. We assign each chunk a sequential ID and a total number\n        //of segments so that we can reassemble the packet on the server.\n        for (var i = 0; i < dataSegs.length; i++) {\n            this.scriptTagHolder.enqueueSegment(this.curSegmentNum, dataSegs.length, dataSegs[i]);\n            this.curSegmentNum++;\n        }\n    };\n    /**\n     * This is how we notify the server that we're leaving.\n     * We aren't able to send requests with DHTML on a window close event, but we can\n     * trigger XHR requests in some browsers (everything but Opera basically).\n     * @param {!string} id\n     * @param {!string} pw\n     */\n    BrowserPollConnection.prototype.addDisconnectPingFrame = function (id, pw) {\n        if (util_3.isNodeSdk()) return;\n        this.myDisconnFrame = document.createElement('iframe');\n        var urlParams = {};\n        urlParams[exports.FIREBASE_LONGPOLL_DISCONN_FRAME_REQUEST_PARAM] = 't';\n        urlParams[exports.FIREBASE_LONGPOLL_ID_PARAM] = id;\n        urlParams[exports.FIREBASE_LONGPOLL_PW_PARAM] = pw;\n        this.myDisconnFrame.src = this.urlFn(urlParams);\n        this.myDisconnFrame.style.display = 'none';\n        document.body.appendChild(this.myDisconnFrame);\n    };\n    /**\n     * Used to track the bytes received by this client\n     * @param {*} args\n     * @private\n     */\n    BrowserPollConnection.prototype.incrementIncomingBytes_ = function (args) {\n        // TODO: This is an annoying perf hit just to track the number of incoming bytes.  Maybe it should be opt-in.\n        var bytesReceived = util_2.stringify(args).length;\n        this.bytesReceived += bytesReceived;\n        this.stats_.incrementCounter('bytes_received', bytesReceived);\n    };\n    return BrowserPollConnection;\n}();\nexports.BrowserPollConnection = BrowserPollConnection;\n/*********************************************************************************************\n * A wrapper around an iframe that is used as a long-polling script holder.\n * @constructor\n *********************************************************************************************/\nvar FirebaseIFrameScriptHolder = /** @class */function () {\n    /**\n     * @param commandCB - The callback to be called when control commands are recevied from the server.\n     * @param onMessageCB - The callback to be triggered when responses arrive from the server.\n     * @param onDisconnect - The callback to be triggered when this tag holder is closed\n     * @param urlFn - A function that provides the URL of the endpoint to send data to.\n     */\n    function FirebaseIFrameScriptHolder(commandCB, onMessageCB, onDisconnect, urlFn) {\n        this.onDisconnect = onDisconnect;\n        this.urlFn = urlFn;\n        //We maintain a count of all of the outstanding requests, because if we have too many active at once it can cause\n        //problems in some browsers.\n        /**\n         * @type {CountedSet.<number, number>}\n         */\n        this.outstandingRequests = new CountedSet_1.CountedSet();\n        //A queue of the pending segments waiting for transmission to the server.\n        this.pendingSegs = [];\n        //A serial number. We use this for two things:\n        // 1) A way to ensure the browser doesn't cache responses to polls\n        // 2) A way to make the server aware when long-polls arrive in a different order than we started them. The\n        //    server needs to release both polls in this case or it will cause problems in Opera since Opera can only execute\n        //    JSONP code in the order it was added to the iframe.\n        this.currentSerial = Math.floor(Math.random() * 100000000);\n        // This gets set to false when we're \"closing down\" the connection (e.g. we're switching transports but there's still\n        // incoming data from the server that we're waiting for).\n        this.sendNewPolls = true;\n        if (!util_3.isNodeSdk()) {\n            //Each script holder registers a couple of uniquely named callbacks with the window. These are called from the\n            //iframes where we put the long-polling script tags. We have two callbacks:\n            //   1) Command Callback - Triggered for control issues, like starting a connection.\n            //   2) Message Callback - Triggered when new data arrives.\n            this.uniqueCallbackIdentifier = util_1.LUIDGenerator();\n            window[exports.FIREBASE_LONGPOLL_COMMAND_CB_NAME + this.uniqueCallbackIdentifier] = commandCB;\n            window[exports.FIREBASE_LONGPOLL_DATA_CB_NAME + this.uniqueCallbackIdentifier] = onMessageCB;\n            //Create an iframe for us to add script tags to.\n            this.myIFrame = FirebaseIFrameScriptHolder.createIFrame_();\n            // Set the iframe's contents.\n            var script = '';\n            // if we set a javascript url, it's IE and we need to set the document domain. The javascript url is sufficient\n            // for ie9, but ie8 needs to do it again in the document itself.\n            if (this.myIFrame.src && this.myIFrame.src.substr(0, 'javascript:'.length) === 'javascript:') {\n                var currentDomain = document.domain;\n                script = '<script>document.domain=\"' + currentDomain + '\";</script>';\n            }\n            var iframeContents = '<html><body>' + script + '</body></html>';\n            try {\n                this.myIFrame.doc.open();\n                this.myIFrame.doc.write(iframeContents);\n                this.myIFrame.doc.close();\n            } catch (e) {\n                util_1.log('frame writing exception');\n                if (e.stack) {\n                    util_1.log(e.stack);\n                }\n                util_1.log(e);\n            }\n        } else {\n            this.commandCB = commandCB;\n            this.onMessageCB = onMessageCB;\n        }\n    }\n    /**\n     * Each browser has its own funny way to handle iframes. Here we mush them all together into one object that I can\n     * actually use.\n     * @private\n     * @return {Element}\n     */\n    FirebaseIFrameScriptHolder.createIFrame_ = function () {\n        var iframe = document.createElement('iframe');\n        iframe.style.display = 'none';\n        // This is necessary in order to initialize the document inside the iframe\n        if (document.body) {\n            document.body.appendChild(iframe);\n            try {\n                // If document.domain has been modified in IE, this will throw an error, and we need to set the\n                // domain of the iframe's document manually. We can do this via a javascript: url as the src attribute\n                // Also note that we must do this *after* the iframe has been appended to the page. Otherwise it doesn't work.\n                var a = iframe.contentWindow.document;\n                if (!a) {\n                    // Apologies for the log-spam, I need to do something to keep closure from optimizing out the assignment above.\n                    util_1.log('No IE domain setting required');\n                }\n            } catch (e) {\n                var domain = document.domain;\n                iframe.src = \"javascript:void((function(){document.open();document.domain='\" + domain + \"';document.close();})())\";\n            }\n        } else {\n            // LongPollConnection attempts to delay initialization until the document is ready, so hopefully this\n            // never gets hit.\n            throw 'Document body has not initialized. Wait to initialize Firebase until after the document is ready.';\n        }\n        // Get the document of the iframe in a browser-specific way.\n        if (iframe.contentDocument) {\n            iframe.doc = iframe.contentDocument; // Firefox, Opera, Safari\n        } else if (iframe.contentWindow) {\n            iframe.doc = iframe.contentWindow.document; // Internet Explorer\n        } else if (iframe.document) {\n            iframe.doc = iframe.document; //others?\n        }\n        return iframe;\n    };\n    /**\n     * Cancel all outstanding queries and remove the frame.\n     */\n    FirebaseIFrameScriptHolder.prototype.close = function () {\n        var _this = this;\n        //Mark this iframe as dead, so no new requests are sent.\n        this.alive = false;\n        if (this.myIFrame) {\n            //We have to actually remove all of the html inside this iframe before removing it from the\n            //window, or IE will continue loading and executing the script tags we've already added, which\n            //can lead to some errors being thrown. Setting innerHTML seems to be the easiest way to do this.\n            this.myIFrame.doc.body.innerHTML = '';\n            setTimeout(function () {\n                if (_this.myIFrame !== null) {\n                    document.body.removeChild(_this.myIFrame);\n                    _this.myIFrame = null;\n                }\n            }, Math.floor(0));\n        }\n        if (util_3.isNodeSdk() && this.myID) {\n            var urlParams = {};\n            urlParams[exports.FIREBASE_LONGPOLL_DISCONN_FRAME_PARAM] = 't';\n            urlParams[exports.FIREBASE_LONGPOLL_ID_PARAM] = this.myID;\n            urlParams[exports.FIREBASE_LONGPOLL_PW_PARAM] = this.myPW;\n            var theURL = this.urlFn(urlParams);\n            FirebaseIFrameScriptHolder.nodeRestRequest(theURL);\n        }\n        // Protect from being called recursively.\n        var onDisconnect = this.onDisconnect;\n        if (onDisconnect) {\n            this.onDisconnect = null;\n            onDisconnect();\n        }\n    };\n    /**\n     * Actually start the long-polling session by adding the first script tag(s) to the iframe.\n     * @param {!string} id - The ID of this connection\n     * @param {!string} pw - The password for this connection\n     */\n    FirebaseIFrameScriptHolder.prototype.startLongPoll = function (id, pw) {\n        this.myID = id;\n        this.myPW = pw;\n        this.alive = true;\n        //send the initial request. If there are requests queued, make sure that we transmit as many as we are currently able to.\n        while (this.newRequest_()) {}\n    };\n    /**\n     * This is called any time someone might want a script tag to be added. It adds a script tag when there aren't\n     * too many outstanding requests and we are still alive.\n     *\n     * If there are outstanding packet segments to send, it sends one. If there aren't, it sends a long-poll anyways if\n     * needed.\n     */\n    FirebaseIFrameScriptHolder.prototype.newRequest_ = function () {\n        // We keep one outstanding request open all the time to receive data, but if we need to send data\n        // (pendingSegs.length > 0) then we create a new request to send the data.  The server will automatically\n        // close the old request.\n        if (this.alive && this.sendNewPolls && this.outstandingRequests.count() < (this.pendingSegs.length > 0 ? 2 : 1)) {\n            //construct our url\n            this.currentSerial++;\n            var urlParams = {};\n            urlParams[exports.FIREBASE_LONGPOLL_ID_PARAM] = this.myID;\n            urlParams[exports.FIREBASE_LONGPOLL_PW_PARAM] = this.myPW;\n            urlParams[exports.FIREBASE_LONGPOLL_SERIAL_PARAM] = this.currentSerial;\n            var theURL = this.urlFn(urlParams);\n            //Now add as much data as we can.\n            var curDataString = '';\n            var i = 0;\n            while (this.pendingSegs.length > 0) {\n                //first, lets see if the next segment will fit.\n                var nextSeg = this.pendingSegs[0];\n                if (nextSeg.d.length + SEG_HEADER_SIZE + curDataString.length <= MAX_URL_DATA_SIZE) {\n                    //great, the segment will fit. Lets append it.\n                    var theSeg = this.pendingSegs.shift();\n                    curDataString = curDataString + '&' + exports.FIREBASE_LONGPOLL_SEGMENT_NUM_PARAM + i + '=' + theSeg.seg + '&' + exports.FIREBASE_LONGPOLL_SEGMENTS_IN_PACKET + i + '=' + theSeg.ts + '&' + exports.FIREBASE_LONGPOLL_DATA_PARAM + i + '=' + theSeg.d;\n                    i++;\n                } else {\n                    break;\n                }\n            }\n            theURL = theURL + curDataString;\n            this.addLongPollTag_(theURL, this.currentSerial);\n            return true;\n        } else {\n            return false;\n        }\n    };\n    /**\n     * Queue a packet for transmission to the server.\n     * @param segnum - A sequential id for this packet segment used for reassembly\n     * @param totalsegs - The total number of segments in this packet\n     * @param data - The data for this segment.\n     */\n    FirebaseIFrameScriptHolder.prototype.enqueueSegment = function (segnum, totalsegs, data) {\n        //add this to the queue of segments to send.\n        this.pendingSegs.push({ seg: segnum, ts: totalsegs, d: data });\n        //send the data immediately if there isn't already data being transmitted, unless\n        //startLongPoll hasn't been called yet.\n        if (this.alive) {\n            this.newRequest_();\n        }\n    };\n    /**\n     * Add a script tag for a regular long-poll request.\n     * @param {!string} url - The URL of the script tag.\n     * @param {!number} serial - The serial number of the request.\n     * @private\n     */\n    FirebaseIFrameScriptHolder.prototype.addLongPollTag_ = function (url, serial) {\n        var _this = this;\n        //remember that we sent this request.\n        this.outstandingRequests.add(serial, 1);\n        var doNewRequest = function doNewRequest() {\n            _this.outstandingRequests.remove(serial);\n            _this.newRequest_();\n        };\n        // If this request doesn't return on its own accord (by the server sending us some data), we'll\n        // create a new one after the KEEPALIVE interval to make sure we always keep a fresh request open.\n        var keepaliveTimeout = setTimeout(doNewRequest, Math.floor(KEEPALIVE_REQUEST_INTERVAL));\n        var readyStateCB = function readyStateCB() {\n            // Request completed.  Cancel the keepalive.\n            clearTimeout(keepaliveTimeout);\n            // Trigger a new request so we can continue receiving data.\n            doNewRequest();\n        };\n        this.addTag(url, readyStateCB);\n    };\n    /**\n     * Add an arbitrary script tag to the iframe.\n     * @param {!string} url - The URL for the script tag source.\n     * @param {!function()} loadCB - A callback to be triggered once the script has loaded.\n     */\n    FirebaseIFrameScriptHolder.prototype.addTag = function (url, loadCB) {\n        var _this = this;\n        if (util_3.isNodeSdk()) {\n            this.doNodeLongPoll(url, loadCB);\n        } else {\n            setTimeout(function () {\n                try {\n                    // if we're already closed, don't add this poll\n                    if (!_this.sendNewPolls) return;\n                    var newScript_1 = _this.myIFrame.doc.createElement('script');\n                    newScript_1.type = 'text/javascript';\n                    newScript_1.async = true;\n                    newScript_1.src = url;\n                    newScript_1.onload = newScript_1.onreadystatechange = function () {\n                        var rstate = newScript_1.readyState;\n                        if (!rstate || rstate === 'loaded' || rstate === 'complete') {\n                            newScript_1.onload = newScript_1.onreadystatechange = null;\n                            if (newScript_1.parentNode) {\n                                newScript_1.parentNode.removeChild(newScript_1);\n                            }\n                            loadCB();\n                        }\n                    };\n                    newScript_1.onerror = function () {\n                        util_1.log('Long-poll script failed to load: ' + url);\n                        _this.sendNewPolls = false;\n                        _this.close();\n                    };\n                    _this.myIFrame.doc.body.appendChild(newScript_1);\n                } catch (e) {\n                    // TODO: we should make this error visible somehow\n                }\n            }, Math.floor(1));\n        }\n    };\n    return FirebaseIFrameScriptHolder;\n}();\nexports.FirebaseIFrameScriptHolder = FirebaseIFrameScriptHolder;\n\n//# sourceMappingURL=BrowserPollConnection.js.map\n\n/***/ }),\n/* 105 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n/* WEBPACK VAR INJECTION */(function(process) {\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar app_1 = __webpack_require__(21);\nvar util_1 = __webpack_require__(0);\nvar util_2 = __webpack_require__(2);\nvar StatsManager_1 = __webpack_require__(73);\nvar Constants_1 = __webpack_require__(35);\nvar util_3 = __webpack_require__(0);\nvar storage_1 = __webpack_require__(34);\nvar util_4 = __webpack_require__(0);\nvar util_5 = __webpack_require__(0);\nvar WEBSOCKET_MAX_FRAME_SIZE = 16384;\nvar WEBSOCKET_KEEPALIVE_INTERVAL = 45000;\nvar WebSocketImpl = null;\nif (typeof MozWebSocket !== 'undefined') {\n    WebSocketImpl = MozWebSocket;\n} else if (typeof WebSocket !== 'undefined') {\n    WebSocketImpl = WebSocket;\n}\nfunction setWebSocketImpl(impl) {\n    WebSocketImpl = impl;\n}\nexports.setWebSocketImpl = setWebSocketImpl;\n/**\n * Create a new websocket connection with the given callbacks.\n * @constructor\n * @implements {Transport}\n */\nvar WebSocketConnection = /** @class */function () {\n    /**\n     * @param {string} connId identifier for this transport\n     * @param {RepoInfo} repoInfo The info for the websocket endpoint.\n     * @param {string=} transportSessionId Optional transportSessionId if this is connecting to an existing transport\n     *                                         session\n     * @param {string=} lastSessionId Optional lastSessionId if there was a previous connection\n     */\n    function WebSocketConnection(connId, repoInfo, transportSessionId, lastSessionId) {\n        this.connId = connId;\n        this.keepaliveTimer = null;\n        this.frames = null;\n        this.totalFrames = 0;\n        this.bytesSent = 0;\n        this.bytesReceived = 0;\n        this.log_ = util_2.logWrapper(this.connId);\n        this.stats_ = StatsManager_1.StatsManager.getCollection(repoInfo);\n        this.connURL = WebSocketConnection.connectionURL_(repoInfo, transportSessionId, lastSessionId);\n    }\n    /**\n     * @param {RepoInfo} repoInfo The info for the websocket endpoint.\n     * @param {string=} transportSessionId Optional transportSessionId if this is connecting to an existing transport\n     *                                         session\n     * @param {string=} lastSessionId Optional lastSessionId if there was a previous connection\n     * @return {string} connection url\n     * @private\n     */\n    WebSocketConnection.connectionURL_ = function (repoInfo, transportSessionId, lastSessionId) {\n        var urlParams = {};\n        urlParams[Constants_1.VERSION_PARAM] = Constants_1.PROTOCOL_VERSION;\n        if (!util_5.isNodeSdk() && typeof location !== 'undefined' && location.href && location.href.indexOf(Constants_1.FORGE_DOMAIN) !== -1) {\n            urlParams[Constants_1.REFERER_PARAM] = Constants_1.FORGE_REF;\n        }\n        if (transportSessionId) {\n            urlParams[Constants_1.TRANSPORT_SESSION_PARAM] = transportSessionId;\n        }\n        if (lastSessionId) {\n            urlParams[Constants_1.LAST_SESSION_PARAM] = lastSessionId;\n        }\n        return repoInfo.connectionURL(Constants_1.WEBSOCKET, urlParams);\n    };\n    /**\n     *\n     * @param onMessage Callback when messages arrive\n     * @param onDisconnect Callback with connection lost.\n     */\n    WebSocketConnection.prototype.open = function (onMessage, onDisconnect) {\n        var _this = this;\n        this.onDisconnect = onDisconnect;\n        this.onMessage = onMessage;\n        this.log_('Websocket connecting to ' + this.connURL);\n        this.everConnected_ = false;\n        // Assume failure until proven otherwise.\n        storage_1.PersistentStorage.set('previous_websocket_failure', true);\n        try {\n            if (util_5.isNodeSdk()) {\n                var device = util_3.CONSTANTS.NODE_ADMIN ? 'AdminNode' : 'Node';\n                // UA Format: Firebase/<wire_protocol>/<sdk_version>/<platform>/<device>\n                var options = {\n                    headers: {\n                        'User-Agent': \"Firebase/\" + Constants_1.PROTOCOL_VERSION + \"/\" + app_1.default.SDK_VERSION + \"/\" + process.platform + \"/\" + device\n                    }\n                };\n                // Plumb appropriate http_proxy environment variable into faye-websocket if it exists.\n                var env = process['env'];\n                var proxy = this.connURL.indexOf('wss://') == 0 ? env['HTTPS_PROXY'] || env['https_proxy'] : env['HTTP_PROXY'] || env['http_proxy'];\n                if (proxy) {\n                    options['proxy'] = { origin: proxy };\n                }\n                this.mySock = new WebSocketImpl(this.connURL, [], options);\n            } else {\n                this.mySock = new WebSocketImpl(this.connURL);\n            }\n        } catch (e) {\n            this.log_('Error instantiating WebSocket.');\n            var error = e.message || e.data;\n            if (error) {\n                this.log_(error);\n            }\n            this.onClosed_();\n            return;\n        }\n        this.mySock.onopen = function () {\n            _this.log_('Websocket connected.');\n            _this.everConnected_ = true;\n        };\n        this.mySock.onclose = function () {\n            _this.log_('Websocket connection was disconnected.');\n            _this.mySock = null;\n            _this.onClosed_();\n        };\n        this.mySock.onmessage = function (m) {\n            _this.handleIncomingFrame(m);\n        };\n        this.mySock.onerror = function (e) {\n            _this.log_('WebSocket error.  Closing connection.');\n            var error = e.message || e.data;\n            if (error) {\n                _this.log_(error);\n            }\n            _this.onClosed_();\n        };\n    };\n    /**\n     * No-op for websockets, we don't need to do anything once the connection is confirmed as open\n     */\n    WebSocketConnection.prototype.start = function () {};\n    WebSocketConnection.forceDisallow = function () {\n        WebSocketConnection.forceDisallow_ = true;\n    };\n    WebSocketConnection.isAvailable = function () {\n        var isOldAndroid = false;\n        if (typeof navigator !== 'undefined' && navigator.userAgent) {\n            var oldAndroidRegex = /Android ([0-9]{0,}\\.[0-9]{0,})/;\n            var oldAndroidMatch = navigator.userAgent.match(oldAndroidRegex);\n            if (oldAndroidMatch && oldAndroidMatch.length > 1) {\n                if (parseFloat(oldAndroidMatch[1]) < 4.4) {\n                    isOldAndroid = true;\n                }\n            }\n        }\n        return !isOldAndroid && WebSocketImpl !== null && !WebSocketConnection.forceDisallow_;\n    };\n    /**\n     * Returns true if we previously failed to connect with this transport.\n     * @return {boolean}\n     */\n    WebSocketConnection.previouslyFailed = function () {\n        // If our persistent storage is actually only in-memory storage,\n        // we default to assuming that it previously failed to be safe.\n        return storage_1.PersistentStorage.isInMemoryStorage || storage_1.PersistentStorage.get('previous_websocket_failure') === true;\n    };\n    WebSocketConnection.prototype.markConnectionHealthy = function () {\n        storage_1.PersistentStorage.remove('previous_websocket_failure');\n    };\n    WebSocketConnection.prototype.appendFrame_ = function (data) {\n        this.frames.push(data);\n        if (this.frames.length == this.totalFrames) {\n            var fullMess = this.frames.join('');\n            this.frames = null;\n            var jsonMess = util_4.jsonEval(fullMess);\n            //handle the message\n            this.onMessage(jsonMess);\n        }\n    };\n    /**\n     * @param {number} frameCount The number of frames we are expecting from the server\n     * @private\n     */\n    WebSocketConnection.prototype.handleNewFrameCount_ = function (frameCount) {\n        this.totalFrames = frameCount;\n        this.frames = [];\n    };\n    /**\n     * Attempts to parse a frame count out of some text. If it can't, assumes a value of 1\n     * @param {!String} data\n     * @return {?String} Any remaining data to be process, or null if there is none\n     * @private\n     */\n    WebSocketConnection.prototype.extractFrameCount_ = function (data) {\n        util_1.assert(this.frames === null, 'We already have a frame buffer');\n        // TODO: The server is only supposed to send up to 9999 frames (i.e. length <= 4), but that isn't being enforced\n        // currently.  So allowing larger frame counts (length <= 6).  See https://app.asana.com/0/search/8688598998380/8237608042508\n        if (data.length <= 6) {\n            var frameCount = Number(data);\n            if (!isNaN(frameCount)) {\n                this.handleNewFrameCount_(frameCount);\n                return null;\n            }\n        }\n        this.handleNewFrameCount_(1);\n        return data;\n    };\n    /**\n     * Process a websocket frame that has arrived from the server.\n     * @param mess The frame data\n     */\n    WebSocketConnection.prototype.handleIncomingFrame = function (mess) {\n        if (this.mySock === null) return; // Chrome apparently delivers incoming packets even after we .close() the connection sometimes.\n        var data = mess['data'];\n        this.bytesReceived += data.length;\n        this.stats_.incrementCounter('bytes_received', data.length);\n        this.resetKeepAlive();\n        if (this.frames !== null) {\n            // we're buffering\n            this.appendFrame_(data);\n        } else {\n            // try to parse out a frame count, otherwise, assume 1 and process it\n            var remainingData = this.extractFrameCount_(data);\n            if (remainingData !== null) {\n                this.appendFrame_(remainingData);\n            }\n        }\n    };\n    /**\n     * Send a message to the server\n     * @param {Object} data The JSON object to transmit\n     */\n    WebSocketConnection.prototype.send = function (data) {\n        this.resetKeepAlive();\n        var dataStr = util_4.stringify(data);\n        this.bytesSent += dataStr.length;\n        this.stats_.incrementCounter('bytes_sent', dataStr.length);\n        //We can only fit a certain amount in each websocket frame, so we need to split this request\n        //up into multiple pieces if it doesn't fit in one request.\n        var dataSegs = util_2.splitStringBySize(dataStr, WEBSOCKET_MAX_FRAME_SIZE);\n        //Send the length header\n        if (dataSegs.length > 1) {\n            this.sendString_(String(dataSegs.length));\n        }\n        //Send the actual data in segments.\n        for (var i = 0; i < dataSegs.length; i++) {\n            this.sendString_(dataSegs[i]);\n        }\n    };\n    WebSocketConnection.prototype.shutdown_ = function () {\n        this.isClosed_ = true;\n        if (this.keepaliveTimer) {\n            clearInterval(this.keepaliveTimer);\n            this.keepaliveTimer = null;\n        }\n        if (this.mySock) {\n            this.mySock.close();\n            this.mySock = null;\n        }\n    };\n    WebSocketConnection.prototype.onClosed_ = function () {\n        if (!this.isClosed_) {\n            this.log_('WebSocket is closing itself');\n            this.shutdown_();\n            // since this is an internal close, trigger the close listener\n            if (this.onDisconnect) {\n                this.onDisconnect(this.everConnected_);\n                this.onDisconnect = null;\n            }\n        }\n    };\n    /**\n     * External-facing close handler.\n     * Close the websocket and kill the connection.\n     */\n    WebSocketConnection.prototype.close = function () {\n        if (!this.isClosed_) {\n            this.log_('WebSocket is being closed');\n            this.shutdown_();\n        }\n    };\n    /**\n     * Kill the current keepalive timer and start a new one, to ensure that it always fires N seconds after\n     * the last activity.\n     */\n    WebSocketConnection.prototype.resetKeepAlive = function () {\n        var _this = this;\n        clearInterval(this.keepaliveTimer);\n        this.keepaliveTimer = setInterval(function () {\n            //If there has been no websocket activity for a while, send a no-op\n            if (_this.mySock) {\n                _this.sendString_('0');\n            }\n            _this.resetKeepAlive();\n        }, Math.floor(WEBSOCKET_KEEPALIVE_INTERVAL));\n    };\n    /**\n     * Send a string over the websocket.\n     *\n     * @param {string} str String to send.\n     * @private\n     */\n    WebSocketConnection.prototype.sendString_ = function (str) {\n        // Firefox seems to sometimes throw exceptions (NS_ERROR_UNEXPECTED) from websocket .send()\n        // calls for some unknown reason.  We treat these as an error and disconnect.\n        // See https://app.asana.com/0/58926111402292/68021340250410\n        try {\n            this.mySock.send(str);\n        } catch (e) {\n            this.log_('Exception thrown from WebSocket.send():', e.message || e.data, 'Closing connection.');\n            setTimeout(this.onClosed_.bind(this), 0);\n        }\n    };\n    /**\n     * Number of response before we consider the connection \"healthy.\"\n     * @type {number}\n     */\n    WebSocketConnection.responsesRequiredToBeHealthy = 2;\n    /**\n     * Time to wait for the connection te become healthy before giving up.\n     * @type {number}\n     */\n    WebSocketConnection.healthyTimeout = 30000;\n    return WebSocketConnection;\n}();\nexports.WebSocketConnection = WebSocketConnection;\n\n//# sourceMappingURL=WebSocketConnection.js.map\n/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(27)))\n\n/***/ }),\n/* 106 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\n/**\n * Interface defining the set of actions that can be performed against the Firebase server\n * (basically corresponds to our wire protocol).\n *\n * @interface\n */\nvar ServerActions = /** @class */function () {\n  function ServerActions() {}\n  /**\n   * @param {string} pathString\n   * @param {*} data\n   * @param {function(string, string)=} onComplete\n   * @param {string=} hash\n   */\n  ServerActions.prototype.put = function (pathString, data, onComplete, hash) {};\n  /**\n   * @param {string} pathString\n   * @param {*} data\n   * @param {function(string, ?string)} onComplete\n   * @param {string=} hash\n   */\n  ServerActions.prototype.merge = function (pathString, data, onComplete, hash) {};\n  /**\n   * Refreshes the auth token for the current connection.\n   * @param {string} token The authentication token\n   */\n  ServerActions.prototype.refreshAuthToken = function (token) {};\n  /**\n   * @param {string} pathString\n   * @param {*} data\n   * @param {function(string, string)=} onComplete\n   */\n  ServerActions.prototype.onDisconnectPut = function (pathString, data, onComplete) {};\n  /**\n   * @param {string} pathString\n   * @param {*} data\n   * @param {function(string, string)=} onComplete\n   */\n  ServerActions.prototype.onDisconnectMerge = function (pathString, data, onComplete) {};\n  /**\n   * @param {string} pathString\n   * @param {function(string, string)=} onComplete\n   */\n  ServerActions.prototype.onDisconnectCancel = function (pathString, onComplete) {};\n  /**\n   * @param {Object.<string, *>} stats\n   */\n  ServerActions.prototype.reportStats = function (stats) {};\n  return ServerActions;\n}();\nexports.ServerActions = ServerActions;\n\n//# sourceMappingURL=ServerActions.js.map\n\n/***/ }),\n/* 107 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar IndexedFilter_1 = __webpack_require__(72);\nvar PriorityIndex_1 = __webpack_require__(6);\nvar Node_1 = __webpack_require__(8);\nvar ChildrenNode_1 = __webpack_require__(7);\n/**\n * Filters nodes by range and uses an IndexFilter to track any changes after filtering the node\n *\n * @constructor\n * @implements {NodeFilter}\n */\nvar RangedFilter = /** @class */function () {\n    /**\n     * @param {!QueryParams} params\n     */\n    function RangedFilter(params) {\n        this.indexedFilter_ = new IndexedFilter_1.IndexedFilter(params.getIndex());\n        this.index_ = params.getIndex();\n        this.startPost_ = RangedFilter.getStartPost_(params);\n        this.endPost_ = RangedFilter.getEndPost_(params);\n    }\n    /**\n     * @return {!NamedNode}\n     */\n    RangedFilter.prototype.getStartPost = function () {\n        return this.startPost_;\n    };\n    /**\n     * @return {!NamedNode}\n     */\n    RangedFilter.prototype.getEndPost = function () {\n        return this.endPost_;\n    };\n    /**\n     * @param {!NamedNode} node\n     * @return {boolean}\n     */\n    RangedFilter.prototype.matches = function (node) {\n        return this.index_.compare(this.getStartPost(), node) <= 0 && this.index_.compare(node, this.getEndPost()) <= 0;\n    };\n    /**\n     * @inheritDoc\n     */\n    RangedFilter.prototype.updateChild = function (snap, key, newChild, affectedPath, source, optChangeAccumulator) {\n        if (!this.matches(new Node_1.NamedNode(key, newChild))) {\n            newChild = ChildrenNode_1.ChildrenNode.EMPTY_NODE;\n        }\n        return this.indexedFilter_.updateChild(snap, key, newChild, affectedPath, source, optChangeAccumulator);\n    };\n    /**\n     * @inheritDoc\n     */\n    RangedFilter.prototype.updateFullNode = function (oldSnap, newSnap, optChangeAccumulator) {\n        if (newSnap.isLeafNode()) {\n            // Make sure we have a children node with the correct index, not a leaf node;\n            newSnap = ChildrenNode_1.ChildrenNode.EMPTY_NODE;\n        }\n        var filtered = newSnap.withIndex(this.index_);\n        // Don't support priorities on queries\n        filtered = filtered.updatePriority(ChildrenNode_1.ChildrenNode.EMPTY_NODE);\n        var self = this;\n        newSnap.forEachChild(PriorityIndex_1.PRIORITY_INDEX, function (key, childNode) {\n            if (!self.matches(new Node_1.NamedNode(key, childNode))) {\n                filtered = filtered.updateImmediateChild(key, ChildrenNode_1.ChildrenNode.EMPTY_NODE);\n            }\n        });\n        return this.indexedFilter_.updateFullNode(oldSnap, filtered, optChangeAccumulator);\n    };\n    /**\n     * @inheritDoc\n     */\n    RangedFilter.prototype.updatePriority = function (oldSnap, newPriority) {\n        // Don't support priorities on queries\n        return oldSnap;\n    };\n    /**\n     * @inheritDoc\n     */\n    RangedFilter.prototype.filtersNodes = function () {\n        return true;\n    };\n    /**\n     * @inheritDoc\n     */\n    RangedFilter.prototype.getIndexedFilter = function () {\n        return this.indexedFilter_;\n    };\n    /**\n     * @inheritDoc\n     */\n    RangedFilter.prototype.getIndex = function () {\n        return this.index_;\n    };\n    /**\n     * @param {!QueryParams} params\n     * @return {!NamedNode}\n     * @private\n     */\n    RangedFilter.getStartPost_ = function (params) {\n        if (params.hasStart()) {\n            var startName = params.getIndexStartName();\n            return params.getIndex().makePost(params.getIndexStartValue(), startName);\n        } else {\n            return params.getIndex().minPost();\n        }\n    };\n    /**\n     * @param {!QueryParams} params\n     * @return {!NamedNode}\n     * @private\n     */\n    RangedFilter.getEndPost_ = function (params) {\n        if (params.hasEnd()) {\n            var endName = params.getIndexEndName();\n            return params.getIndex().makePost(params.getIndexEndValue(), endName);\n        } else {\n            return params.getIndex().maxPost();\n        }\n    };\n    return RangedFilter;\n}();\nexports.RangedFilter = RangedFilter;\n\n//# sourceMappingURL=RangedFilter.js.map\n\n/***/ }),\n/* 108 */\n/***/ (function(module, exports, __webpack_require__) {\n\nmodule.exports = __webpack_require__(109);\n\n\n/***/ }),\n/* 109 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\n__webpack_require__(110);\n\nvar _domready = __webpack_require__(18);\n\nvar _domready2 = _interopRequireDefault(_domready);\n\nvar _preact = __webpack_require__(1);\n\nvar _LivePollWidget = __webpack_require__(111);\n\nvar _init = __webpack_require__(24);\n\nvar _devtools = __webpack_require__(75);\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\n/** @jsx h */\nvar rootElementClassName = 'dh-stemning-root'; // import en css-modul her og på serveren - så slipper vi å hardkode\nwindow[rootElementClassName] = window[rootElementClassName] || {};\n\nfunction mountFn(el) {\n  var preloadedState = JSON.parse(decodeURIComponent(el.dataset.preloadedState));\n  var clientId = preloadedState.clientId,\n      theme = preloadedState.theme,\n      authConfig = preloadedState.authConfig,\n      showResult = preloadedState.showResult,\n      resultMessage = preloadedState.resultMessage;\n\n  var AppComponent = (0, _preact.h)(_LivePollWidget.LivePollWidget, {\n    clientId: clientId,\n    authConfig: authConfig,\n    theme: theme,\n    showResult: showResult,\n    resultMessage: resultMessage\n  });\n  (0, _preact.render)(AppComponent, el, el.firstChild);\n}\n\n(0, _domready2.default)(function () {\n  return (0, _init.init)(rootElementClassName, mountFn, _devtools.enableDevtools);\n});\n\n/***/ }),\n/* 110 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\n__webpack_require__(42);\n\n__webpack_require__(44);\n\n__webpack_require__(45);\n\nvar _promisePolyfill = __webpack_require__(26);\n\nvar _promisePolyfill2 = _interopRequireDefault(_promisePolyfill);\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\n/* eslint-disable */\nif (!window.Promise) {\n  window.Promise = _promisePolyfill2.default;\n}\n\n/***/ }),\n/* 111 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.LivePollWidget = undefined;\n\nvar _createClass = function () { function 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, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }();\n\nvar _preact = __webpack_require__(1);\n\nvar _LivePollWidget = __webpack_require__(112);\n\nvar _LivePollWidget2 = _interopRequireDefault(_LivePollWidget);\n\nvar _LivePoll = __webpack_require__(113);\n\nvar _Loader = __webpack_require__(31);\n\nvar _Error = __webpack_require__(30);\n\nvar _WithVotingState = __webpack_require__(136);\n\nvar _WithPollState = __webpack_require__(193);\n\nvar _WithResultState = __webpack_require__(195);\n\nvar _bem = __webpack_require__(3);\n\nvar _themeToClassName = __webpack_require__(5);\n\nvar _breakpointToClassName = __webpack_require__(10);\n\nvar _StemningIcon = __webpack_require__(14);\n\nvar _AriaLive = __webpack_require__(197);\n\nvar _alternativeUtils = __webpack_require__(198);\n\nvar _RetryButton = __webpack_require__(32);\n\nvar _debounce = __webpack_require__(199);\n\nvar _pureComponents = __webpack_require__(33);\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction _possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return call && (typeof call === \"object\" || typeof call === \"function\") ? call : self; }\n\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function, not \" + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; }\n/** @jsx h */\n\nvar LivePollWidget = exports.LivePollWidget = function (_PureComponent) {\n  _inherits(LivePollWidget, _PureComponent);\n\n  function LivePollWidget() {\n    var _ref;\n\n    var _temp, _this, _ret;\n\n    _classCallCheck(this, LivePollWidget);\n\n    for (var _len = arguments.length, args = Array(_len), _key = 0; _key < _len; _key++) {\n      args[_key] = arguments[_key];\n    }\n\n    return _ret = (_temp = (_this = _possibleConstructorReturn(this, (_ref = LivePollWidget.__proto__ || Object.getPrototypeOf(LivePollWidget)).call.apply(_ref, [this].concat(args))), _this), _this.debouncedResize = null, _this.rootEl = null, _this.state = {\n      breakpoint: 'M'\n    }, _this.componentDidMount = function () {\n      _this.handleResize();\n      _this.debouncedResize = (0, _debounce.debounce)(_this.handleResize, 16.667);\n      window.addEventListener('resize', _this.debouncedResize);\n    }, _this.componentWillUnmount = function () {\n      window.removeEventListener('resize', _this.debouncedResize);\n    }, _this.handleResize = function () {\n      if (!_this.rootEl) {\n        return;\n      }\n\n      var width = _this.rootEl.offsetWidth;\n      _this.setState({ breakpoint: (0, _breakpointToClassName.getCurrentBreakpoint)(width) });\n    }, _this.renderWithPollState = function (arg) {\n      var loadPollError = arg.error,\n          poll = arg.poll,\n          loading = arg.loading;\n      var breakpoint = _this.state.breakpoint;\n      var _this$props = _this.props,\n          clientId = _this$props.clientId,\n          theme = _this$props.theme,\n          authConfig = _this$props.authConfig;\n\n\n      return (0, _preact.h)(\n        'div',\n        {\n          ref: function ref(el) {\n            return _this.rootEl = el;\n          },\n          className: getBaseColorClass(theme) + ' ' + (0, _bem.bem)(_LivePollWidget2.default.livePollWidget, (0, _themeToClassName.themeToClassName)(theme), (0, _breakpointToClassName.breakpointToClassName)(breakpoint))\n        },\n        loadPollError && (0, _preact.h)(\n          _Error.Error,\n          null,\n          (0, _preact.h)(\n            'div',\n            { style: { marginBottom: '10px' } },\n            'Avstemningen er ikke tilgjengelig akkurat n\\xE5.'\n          ),\n          (0, _preact.h)(\n            _RetryButton.RetryButton,\n            { onClick: _this.handleRetryButtonClicked },\n            'Pr\\xF8v \\xE5 laste p\\xE5 nytt'\n          )\n        ),\n        loading && (0, _preact.h)(\n          _Loader.Loader,\n          null,\n          (0, _preact.h)(_StemningIcon.StemningIcon, { animate: 'infinite' }),\n          (0, _preact.h)(\n            'p',\n            null,\n            'Laster innhold'\n          )\n        ),\n        !loading && !loadPollError && poll && (0, _preact.h)(_WithVotingState.WithVotingState, {\n          clientId: clientId,\n          poll: poll,\n          authConfig: authConfig,\n          render: function render(arg) {\n            return _this.renderWithVotingState(arg, poll);\n          }\n        })\n      );\n    }, _this.renderWithVotingState = function (arg, poll) {\n      var hasVoted = arg.hasVoted,\n          vote = arg.vote,\n          voteError = arg.error,\n          onRegisterVote = arg.onRegisterVote,\n          isDisplayVoteConfirmedMessage = arg.isDisplayVoteConfirmedMessage;\n      var _this$props2 = _this.props,\n          clientId = _this$props2.clientId,\n          authConfig = _this$props2.authConfig;\n\n\n      var resultState = {\n        onRegisterVote: onRegisterVote,\n        hasVoted: hasVoted,\n        voteError: voteError,\n        isDisplayVoteConfirmedMessage: isDisplayVoteConfirmedMessage,\n        vote: vote\n      };\n\n      return (0, _preact.h)(_WithResultState.WithResultState, {\n        clientId: clientId,\n        authConfig: authConfig,\n        poll: poll,\n        render: function render(arg) {\n          return _this.renderWithResultState(arg, resultState, poll);\n        }\n      });\n    }, _this.renderWithResultState = function (arg, rest, poll) {\n      var result = arg.result,\n          resultError = arg.error,\n          lastUpdatedTime = arg.lastUpdatedTime;\n      var _this$props3 = _this.props,\n          showResult = _this$props3.showResult,\n          resultMessage = _this$props3.resultMessage;\n      var onRegisterVote = rest.onRegisterVote,\n          hasVoted = rest.hasVoted,\n          voteError = rest.voteError,\n          isDisplayVoteConfirmedMessage = rest.isDisplayVoteConfirmedMessage,\n          vote = rest.vote;\n\n      return (0, _preact.h)(\n        _LivePoll.LivePoll,\n        {\n          poll: poll,\n          onRegisterVote: onRegisterVote,\n          hasVoted: hasVoted,\n          voteError: voteError,\n          resultError: resultError,\n          result: result,\n          lastUpdatedTime: lastUpdatedTime,\n          showResult: showResult,\n          resultMessage: resultMessage\n        },\n        (0, _preact.h)(\n          _AriaLive.AriaLive,\n          { type: 'assertive' },\n          isDisplayVoteConfirmedMessage && 'Din stemme p\\xE5 ' + (0, _alternativeUtils.alternativeIdToAlternativeText)(vote.alternativeId, poll.alternatives) + ' ble registrert'\n        )\n      );\n    }, _temp), _possibleConstructorReturn(_this, _ret);\n  }\n\n  _createClass(LivePollWidget, [{\n    key: 'getChildContext',\n    value: function getChildContext() {\n      return {\n        theme: this.props.theme,\n        isInteractive: true,\n        currentBreakpoint: this.state.breakpoint\n      };\n    }\n  }, {\n    key: 'handleRetryButtonClicked',\n    value: function handleRetryButtonClicked() {\n      window.location.reload(true);\n    }\n  }, {\n    key: 'render',\n    value: function render() {\n      var _props = this.props,\n          clientId = _props.clientId,\n          authConfig = _props.authConfig;\n\n\n      return (0, _preact.h)(_WithPollState.WithPollState, {\n        authConfig: authConfig,\n        clientId: clientId,\n        render: this.renderWithPollState\n      });\n    }\n  }]);\n\n  return LivePollWidget;\n}(_pureComponents.PureComponent);\n\nfunction getBaseColorClass(skin) {\n  if (skin === 'sport') {\n    return 'nrk-color-invert';\n  } else {\n    return 'nrk-color-base';\n  }\n}\n\n/***/ }),\n/* 112 */\n/***/ (function(module, exports) {\n\n// removed by extract-text-webpack-plugin\nmodule.exports = {\"livePollWidget\":\"dh-stemning-livePollWidget\",\"livePollWidget--medium\":\"dh-stemning-livePollWidget--medium\",\"livePollWidget--large\":\"dh-stemning-livePollWidget--large\",\"livePollWidget--extra-large\":\"dh-stemning-livePollWidget--extra-large\",\"livePollWidget--theme-monsen\":\"dh-stemning-livePollWidget--theme-monsen\",\"livePollWidget--theme-sport\":\"dh-stemning-livePollWidget--theme-sport\",\"livePollWidget--theme-sport-inverted-gray\":\"dh-stemning-livePollWidget--theme-sport-inverted-gray\"};\n\n/***/ }),\n/* 113 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.LivePoll = undefined;\n\nvar _createClass = function () { function 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, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }();\n\nvar _preact = __webpack_require__(1);\n\nvar _LivePoll = __webpack_require__(114);\n\nvar _LivePoll2 = _interopRequireDefault(_LivePoll);\n\nvar _AlternativeList = __webpack_require__(115);\n\nvar _LastUpdatedTime = __webpack_require__(119);\n\nvar _VoteCounter = __webpack_require__(49);\n\nvar _breakpointToClassName = __webpack_require__(10);\n\nvar _bem = __webpack_require__(3);\n\nvar _LiveResult = __webpack_require__(134);\n\nvar _Branding = __webpack_require__(66);\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction _possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return call && (typeof call === \"object\" || typeof call === \"function\") ? call : self; }\n\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function, not \" + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; }\n/** @jsx h */\n\nvar LivePoll = exports.LivePoll = function (_Component) {\n  _inherits(LivePoll, _Component);\n\n  function LivePoll() {\n    _classCallCheck(this, LivePoll);\n\n    return _possibleConstructorReturn(this, (LivePoll.__proto__ || Object.getPrototypeOf(LivePoll)).apply(this, arguments));\n  }\n\n  _createClass(LivePoll, [{\n    key: 'render',\n    value: function render() {\n      var _props = this.props,\n          poll = _props.poll,\n          onRegisterVote = _props.onRegisterVote,\n          hasVoted = _props.hasVoted,\n          voteError = _props.voteError,\n          resultError = _props.resultError,\n          result = _props.result,\n          lastUpdatedTime = _props.lastUpdatedTime,\n          showResult = _props.showResult,\n          resultMessage = _props.resultMessage;\n      var currentBreakpoint = this.context.currentBreakpoint;\n\n      var title = poll ? poll.title : '';\n\n      return (0, _preact.h)(\n        'div',\n        {\n          className: (0, _bem.bem)(_LivePoll2.default.livePoll, (0, _breakpointToClassName.breakpointToClassName)(currentBreakpoint))\n        },\n        (0, _preact.h)(_Branding.Branding, null),\n        (0, _preact.h)(\n          'div',\n          { className: _LivePoll2.default.livePoll__header },\n          (0, _preact.h)(\n            'h2',\n            { className: _LivePoll2.default.livePoll__title },\n            title\n          )\n        ),\n        (0, _preact.h)(\n          'div',\n          { className: _LivePoll2.default.livePoll__content },\n          !hasVoted && (0, _preact.h)(_AlternativeList.AlternativeList, {\n            onAlternativeClicked: onRegisterVote,\n            alternatives: poll.alternatives\n          }),\n          hasVoted && (0, _preact.h)(_LiveResult.LiveResult, {\n            hasVoted: hasVoted,\n            poll: poll,\n            result: result,\n            resultError: resultError,\n            showResult: showResult,\n            resultMessage: resultMessage\n          }),\n          voteError && 'Det skjedde en feil ved registrering av stemme. Har du skrudd av informasjonskapsler i nettleseren din?'\n        ),\n        (0, _preact.h)(\n          'footer',\n          { className: _LivePoll2.default.livePoll__footer },\n          result && (0, _preact.h)(_VoteCounter.VoteCounter, { voteCount: result.votes }),\n          hasVoted && (0, _preact.h)(_LastUpdatedTime.LastUpdatedTime, { lastUpdatedTime: lastUpdatedTime })\n        ),\n        this.props.children,\n        this.props.children\n      );\n    }\n  }]);\n\n  return LivePoll;\n}(_preact.Component);\n\n/***/ }),\n/* 114 */\n/***/ (function(module, exports) {\n\n// removed by extract-text-webpack-plugin\nmodule.exports = {\"livePoll\":\"dh-stemning-livePoll\",\"livePoll__header\":\"dh-stemning-livePoll__header\",\"livePoll__title\":\"dh-stemning-livePoll__title\",\"livePoll--medium\":\"dh-stemning-livePoll--medium\",\"livePoll--large\":\"dh-stemning-livePoll--large\",\"livePoll--extra-large\":\"dh-stemning-livePoll--extra-large\",\"livePoll__content\":\"dh-stemning-livePoll__content\",\"livePoll__footer\":\"dh-stemning-livePoll__footer\"};\n\n/***/ }),\n/* 115 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.AlternativeList = undefined;\n\nvar _createClass = function () { function 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, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }();\n\nvar _preact = __webpack_require__(1);\n\nvar _AlternativeList = __webpack_require__(116);\n\nvar _AlternativeList2 = _interopRequireDefault(_AlternativeList);\n\nvar _Alternative = __webpack_require__(117);\n\nvar _bem = __webpack_require__(3);\n\nvar _breakpointToClassName = __webpack_require__(10);\n\nvar _getTextMaxLength = __webpack_require__(29);\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction _possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return call && (typeof call === \"object\" || typeof call === \"function\") ? call : self; }\n\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function, not \" + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; }\n/** @jsx h */\n\nvar MAX_SMALL_TEXT_LENGTH = 22;\n\nvar AlternativeList = exports.AlternativeList = function (_Component) {\n  _inherits(AlternativeList, _Component);\n\n  function AlternativeList() {\n    _classCallCheck(this, AlternativeList);\n\n    return _possibleConstructorReturn(this, (AlternativeList.__proto__ || Object.getPrototypeOf(AlternativeList)).apply(this, arguments));\n  }\n\n  _createClass(AlternativeList, [{\n    key: 'render',\n    value: function render() {\n      var _props = this.props,\n          alternatives = _props.alternatives,\n          onAlternativeClicked = _props.onAlternativeClicked;\n      var currentBreakpoint = this.context.currentBreakpoint;\n\n      var alternativesItems = alternatives.list.reduce(function (acc, alternativeId) {\n        var alternative = alternatives[alternativeId];\n        alternative.id = alternativeId;\n        acc.push(alternative);\n        return acc;\n      }, []);\n\n      var currentMaxTextLength = (0, _getTextMaxLength.getMaxLength)(alternativesItems, 'text');\n      var fullWidthMobile = currentMaxTextLength > MAX_SMALL_TEXT_LENGTH;\n      var oddEven = alternatives.list.length % 2 !== 0 ? 'odd' : 'even';\n      var two = alternatives.list.length === 2 ? 'two' : '';\n\n      return (0, _preact.h)(\n        'div',\n        {\n          className: (0, _bem.bem)(_AlternativeList2.default.alternativeList, two || oddEven, (0, _breakpointToClassName.breakpointToClassName)(currentBreakpoint), fullWidthMobile ? 'full-width' : null)\n        },\n        alternativesItems.map(function (alternative, idx) {\n          return (0, _preact.h)(\n            'div',\n            {\n              key: alternative.id,\n              className: (0, _bem.bem)(_AlternativeList2.default.alternativeList__item, fullWidthMobile ? 'full-width' : null)\n            },\n            (0, _preact.h)(_Alternative.Alternative, {\n              onClick: onAlternativeClicked,\n              alternative: alternative,\n              isLastItem: isLastItem(idx, alternatives),\n              totalAlternativesCount: alternatives.length\n            })\n          );\n        })\n      );\n    }\n  }]);\n\n  return AlternativeList;\n}(_preact.Component);\n\nfunction isLastItem(index, alternatives) {\n  return index === alternatives.length - 1;\n}\n\n/***/ }),\n/* 116 */\n/***/ (function(module, exports) {\n\n// removed by extract-text-webpack-plugin\nmodule.exports = {\"alternativeList\":\"dh-stemning-alternativeList\",\"alternativeList--full-width\":\"dh-stemning-alternativeList--full-width\",\"alternativeList__item\":\"dh-stemning-alternativeList__item\",\"alternativeList--small\":\"dh-stemning-alternativeList--small\",\"alternativeList--extra-small\":\"dh-stemning-alternativeList--extra-small\",\"alternativeList__item--full-width\":\"dh-stemning-alternativeList__item--full-width\",\"alternativeList--medium\":\"dh-stemning-alternativeList--medium\",\"alternativeList--large\":\"dh-stemning-alternativeList--large\",\"alternativeList--extra-large\":\"dh-stemning-alternativeList--extra-large\"};\n\n/***/ }),\n/* 117 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.Alternative = undefined;\n\nvar _createClass = function () { function 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, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }();\n\nvar _preact = __webpack_require__(1);\n\nvar _Alternative = __webpack_require__(118);\n\nvar _Alternative2 = _interopRequireDefault(_Alternative);\n\nvar _Button = __webpack_require__(28);\n\nvar _bem = __webpack_require__(3);\n\nvar _themeToClassName = __webpack_require__(5);\n\nvar _breakpointToClassName = __webpack_require__(10);\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction _possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return call && (typeof call === \"object\" || typeof call === \"function\") ? call : self; }\n\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function, not \" + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; }\n/** @jsx h */\n\nvar Alternative = exports.Alternative = function (_Component) {\n  _inherits(Alternative, _Component);\n\n  function Alternative() {\n    var _ref;\n\n    var _temp, _this, _ret;\n\n    _classCallCheck(this, Alternative);\n\n    for (var _len = arguments.length, args = Array(_len), _key = 0; _key < _len; _key++) {\n      args[_key] = arguments[_key];\n    }\n\n    return _ret = (_temp = (_this = _possibleConstructorReturn(this, (_ref = Alternative.__proto__ || Object.getPrototypeOf(Alternative)).call.apply(_ref, [this].concat(args))), _this), _this.handleAlternativeClicked = function () {\n      _this.props.onClick(_this.props.alternative);\n    }, _temp), _possibleConstructorReturn(_this, _ret);\n  }\n\n  _createClass(Alternative, [{\n    key: 'render',\n    value: function render() {\n      var _props = this.props,\n          alternative = _props.alternative,\n          isLastItem = _props.isLastItem,\n          totalAlternativesCount = _props.totalAlternativesCount;\n      var _context = this.context,\n          theme = _context.theme,\n          currentBreakpoint = _context.currentBreakpoint;\n\n      return (0, _preact.h)(\n        'div',\n        {\n          className: (0, _bem.bem)(_Alternative2.default.alternative, isLastItem ? 'last-item' : '', totalAlternativesCount % 2 !== 0 ? 'part-of-odd-list' : '', (0, _themeToClassName.themeToClassName)(theme), (0, _breakpointToClassName.breakpointToClassName)(currentBreakpoint))\n        },\n        (0, _preact.h)(\n          _Button.Button,\n          {\n            className: _Alternative2.default.button,\n            onClick: this.handleAlternativeClicked\n          },\n          alternative.text\n        )\n      );\n    }\n  }]);\n\n  return Alternative;\n}(_preact.Component);\n\n/***/ }),\n/* 118 */\n/***/ (function(module, exports) {\n\n// removed by extract-text-webpack-plugin\nmodule.exports = {\"alternative\":\"dh-stemning-alternative\",\"alternative--extra-small\":\"dh-stemning-alternative--extra-small\",\"alternative--part-of-odd-list\":\"dh-stemning-alternative--part-of-odd-list\",\"alternative--last-item\":\"dh-stemning-alternative--last-item\",\"alternative--medium\":\"dh-stemning-alternative--medium\",\"alternative--large\":\"dh-stemning-alternative--large\",\"alternative--extra-large\":\"dh-stemning-alternative--extra-large\",\"alternativeList__item--full-width\":\"dh-stemning-alternativeList__item--full-width\",\"button\":\"dh-stemning-button\"};\n\n/***/ }),\n/* 119 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.LastUpdatedTime = LastUpdatedTime;\n\nvar _preact = __webpack_require__(1);\n\nvar _distance_in_words = __webpack_require__(120);\n\nvar _distance_in_words2 = _interopRequireDefault(_distance_in_words);\n\nvar _difference_in_seconds = __webpack_require__(76);\n\nvar _difference_in_seconds2 = _interopRequireDefault(_difference_in_seconds);\n\nvar _nb = __webpack_require__(130);\n\nvar _nb2 = _interopRequireDefault(_nb);\n\nvar _bem = __webpack_require__(3);\n\nvar _LastUpdatedTime = __webpack_require__(133);\n\nvar _LastUpdatedTime2 = _interopRequireDefault(_LastUpdatedTime);\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\n/** @jsx h */\n\nfunction LastUpdatedTime(props) {\n  var diff = (0, _difference_in_seconds2.default)(Date.now(), props.lastUpdatedTime);\n  var shouldShow = diff >= 60;\n  return (0, _preact.h)(\n    'div',\n    { className: (0, _bem.bem)(_LastUpdatedTime2.default.lastUpdatedTime, !shouldShow ? 'invisible' : ''), style: true },\n    'Sist oppdatert for',\n    ' ',\n    (0, _distance_in_words2.default)(new Date(), props.lastUpdatedTime, {\n      includeSeconds: true,\n      locale: _nb2.default\n    }),\n    ' ',\n    'siden'\n  );\n}\n\n/***/ }),\n/* 120 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nvar compareDesc = __webpack_require__(121);\nvar parse = __webpack_require__(13);\nvar differenceInSeconds = __webpack_require__(76);\nvar differenceInMonths = __webpack_require__(124);\nvar enLocale = __webpack_require__(127);\n\nvar MINUTES_IN_DAY = 1440;\nvar MINUTES_IN_ALMOST_TWO_DAYS = 2520;\nvar MINUTES_IN_MONTH = 43200;\nvar MINUTES_IN_TWO_MONTHS = 86400;\n\n/**\n * @category Common Helpers\n * @summary Return the distance between the given dates in words.\n *\n * @description\n * Return the distance between the given dates in words.\n *\n * | Distance between dates                                            | Result              |\n * |-------------------------------------------------------------------|---------------------|\n * | 0 ... 30 secs                                                     | less than a minute  |\n * | 30 secs ... 1 min 30 secs                                         | 1 minute            |\n * | 1 min 30 secs ... 44 mins 30 secs                                 | [2..44] minutes     |\n * | 44 mins ... 30 secs ... 89 mins 30 secs                           | about 1 hour        |\n * | 89 mins 30 secs ... 23 hrs 59 mins 30 secs                        | about [2..24] hours |\n * | 23 hrs 59 mins 30 secs ... 41 hrs 59 mins 30 secs                 | 1 day               |\n * | 41 hrs 59 mins 30 secs ... 29 days 23 hrs 59 mins 30 secs         | [2..30] days        |\n * | 29 days 23 hrs 59 mins 30 secs ... 44 days 23 hrs 59 mins 30 secs | about 1 month       |\n * | 44 days 23 hrs 59 mins 30 secs ... 59 days 23 hrs 59 mins 30 secs | about 2 months      |\n * | 59 days 23 hrs 59 mins 30 secs ... 1 yr                           | [2..12] months      |\n * | 1 yr ... 1 yr 3 months                                            | about 1 year        |\n * | 1 yr 3 months ... 1 yr 9 month s                                  | over 1 year         |\n * | 1 yr 9 months ... 2 yrs                                           | almost 2 years      |\n * | N yrs ... N yrs 3 months                                          | about N years       |\n * | N yrs 3 months ... N yrs 9 months                                 | over N years        |\n * | N yrs 9 months ... N+1 yrs                                        | almost N+1 years    |\n *\n * With `options.includeSeconds == true`:\n * | Distance between dates | Result               |\n * |------------------------|----------------------|\n * | 0 secs ... 5 secs      | less than 5 seconds  |\n * | 5 secs ... 10 secs     | less than 10 seconds |\n * | 10 secs ... 20 secs    | less than 20 seconds |\n * | 20 secs ... 40 secs    | half a minute        |\n * | 40 secs ... 60 secs    | less than a minute   |\n * | 60 secs ... 90 secs    | 1 minute             |\n *\n * @param {Date|String|Number} dateToCompare - the date to compare with\n * @param {Date|String|Number} date - the other date\n * @param {Object} [options] - the object with options\n * @param {Boolean} [options.includeSeconds=false] - distances less than a minute are more detailed\n * @param {Boolean} [options.addSuffix=false] - result indicates if the second date is earlier or later than the first\n * @param {Object} [options.locale=enLocale] - the locale object\n * @returns {String} the distance in words\n *\n * @example\n * // What is the distance between 2 July 2014 and 1 January 2015?\n * var result = distanceInWords(\n *   new Date(2014, 6, 2),\n *   new Date(2015, 0, 1)\n * )\n * //=> '6 months'\n *\n * @example\n * // What is the distance between 1 January 2015 00:00:15\n * // and 1 January 2015 00:00:00, including seconds?\n * var result = distanceInWords(\n *   new Date(2015, 0, 1, 0, 0, 15),\n *   new Date(2015, 0, 1, 0, 0, 0),\n *   {includeSeconds: true}\n * )\n * //=> 'less than 20 seconds'\n *\n * @example\n * // What is the distance from 1 January 2016\n * // to 1 January 2015, with a suffix?\n * var result = distanceInWords(\n *   new Date(2016, 0, 1),\n *   new Date(2015, 0, 1),\n *   {addSuffix: true}\n * )\n * //=> 'about 1 year ago'\n *\n * @example\n * // What is the distance between 1 August 2016 and 1 January 2015 in Esperanto?\n * var eoLocale = require('date-fns/locale/eo')\n * var result = distanceInWords(\n *   new Date(2016, 7, 1),\n *   new Date(2015, 0, 1),\n *   {locale: eoLocale}\n * )\n * //=> 'pli ol 1 jaro'\n */\nfunction distanceInWords(dirtyDateToCompare, dirtyDate, dirtyOptions) {\n  var options = dirtyOptions || {};\n\n  var comparison = compareDesc(dirtyDateToCompare, dirtyDate);\n\n  var locale = options.locale;\n  var localize = enLocale.distanceInWords.localize;\n  if (locale && locale.distanceInWords && locale.distanceInWords.localize) {\n    localize = locale.distanceInWords.localize;\n  }\n\n  var localizeOptions = {\n    addSuffix: Boolean(options.addSuffix),\n    comparison: comparison\n  };\n\n  var dateLeft, dateRight;\n  if (comparison > 0) {\n    dateLeft = parse(dirtyDateToCompare);\n    dateRight = parse(dirtyDate);\n  } else {\n    dateLeft = parse(dirtyDate);\n    dateRight = parse(dirtyDateToCompare);\n  }\n\n  var seconds = differenceInSeconds(dateRight, dateLeft);\n  var offset = dateRight.getTimezoneOffset() - dateLeft.getTimezoneOffset();\n  var minutes = Math.round(seconds / 60) - offset;\n  var months;\n\n  // 0 up to 2 mins\n  if (minutes < 2) {\n    if (options.includeSeconds) {\n      if (seconds < 5) {\n        return localize('lessThanXSeconds', 5, localizeOptions);\n      } else if (seconds < 10) {\n        return localize('lessThanXSeconds', 10, localizeOptions);\n      } else if (seconds < 20) {\n        return localize('lessThanXSeconds', 20, localizeOptions);\n      } else if (seconds < 40) {\n        return localize('halfAMinute', null, localizeOptions);\n      } else if (seconds < 60) {\n        return localize('lessThanXMinutes', 1, localizeOptions);\n      } else {\n        return localize('xMinutes', 1, localizeOptions);\n      }\n    } else {\n      if (minutes === 0) {\n        return localize('lessThanXMinutes', 1, localizeOptions);\n      } else {\n        return localize('xMinutes', minutes, localizeOptions);\n      }\n    }\n\n    // 2 mins up to 0.75 hrs\n  } else if (minutes < 45) {\n    return localize('xMinutes', minutes, localizeOptions);\n\n    // 0.75 hrs up to 1.5 hrs\n  } else if (minutes < 90) {\n    return localize('aboutXHours', 1, localizeOptions);\n\n    // 1.5 hrs up to 24 hrs\n  } else if (minutes < MINUTES_IN_DAY) {\n    var hours = Math.round(minutes / 60);\n    return localize('aboutXHours', hours, localizeOptions);\n\n    // 1 day up to 1.75 days\n  } else if (minutes < MINUTES_IN_ALMOST_TWO_DAYS) {\n    return localize('xDays', 1, localizeOptions);\n\n    // 1.75 days up to 30 days\n  } else if (minutes < MINUTES_IN_MONTH) {\n    var days = Math.round(minutes / MINUTES_IN_DAY);\n    return localize('xDays', days, localizeOptions);\n\n    // 1 month up to 2 months\n  } else if (minutes < MINUTES_IN_TWO_MONTHS) {\n    months = Math.round(minutes / MINUTES_IN_MONTH);\n    return localize('aboutXMonths', months, localizeOptions);\n  }\n\n  months = differenceInMonths(dateRight, dateLeft);\n\n  // 2 months up to 12 months\n  if (months < 12) {\n    var nearestMonth = Math.round(minutes / MINUTES_IN_MONTH);\n    return localize('xMonths', nearestMonth, localizeOptions);\n\n    // 1 year up to max Date\n  } else {\n    var monthsSinceStartOfYear = months % 12;\n    var years = Math.floor(months / 12);\n\n    // N years up to 1 years 3 months\n    if (monthsSinceStartOfYear < 3) {\n      return localize('aboutXYears', years, localizeOptions);\n\n      // N years 3 months up to N years 9 months\n    } else if (monthsSinceStartOfYear < 9) {\n      return localize('overXYears', years, localizeOptions);\n\n      // N years 9 months up to N year 12 months\n    } else {\n      return localize('almostXYears', years + 1, localizeOptions);\n    }\n  }\n}\n\nmodule.exports = distanceInWords;\n\n/***/ }),\n/* 121 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nvar parse = __webpack_require__(13);\n\n/**\n * @category Common Helpers\n * @summary Compare the two dates reverse chronologically and return -1, 0 or 1.\n *\n * @description\n * Compare the two dates and return -1 if the first date is after the second,\n * 1 if the first date is before the second or 0 if dates are equal.\n *\n * @param {Date|String|Number} dateLeft - the first date to compare\n * @param {Date|String|Number} dateRight - the second date to compare\n * @returns {Number} the result of the comparison\n *\n * @example\n * // Compare 11 February 1987 and 10 July 1989 reverse chronologically:\n * var result = compareDesc(\n *   new Date(1987, 1, 11),\n *   new Date(1989, 6, 10)\n * )\n * //=> 1\n *\n * @example\n * // Sort the array of dates in reverse chronological order:\n * var result = [\n *   new Date(1995, 6, 2),\n *   new Date(1987, 1, 11),\n *   new Date(1989, 6, 10)\n * ].sort(compareDesc)\n * //=> [\n * //   Sun Jul 02 1995 00:00:00,\n * //   Mon Jul 10 1989 00:00:00,\n * //   Wed Feb 11 1987 00:00:00\n * // ]\n */\nfunction compareDesc(dirtyDateLeft, dirtyDateRight) {\n  var dateLeft = parse(dirtyDateLeft);\n  var timeLeft = dateLeft.getTime();\n  var dateRight = parse(dirtyDateRight);\n  var timeRight = dateRight.getTime();\n\n  if (timeLeft > timeRight) {\n    return -1;\n  } else if (timeLeft < timeRight) {\n    return 1;\n  } else {\n    return 0;\n  }\n}\n\nmodule.exports = compareDesc;\n\n/***/ }),\n/* 122 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\n/**\n * @category Common Helpers\n * @summary Is the given argument an instance of Date?\n *\n * @description\n * Is the given argument an instance of Date?\n *\n * @param {*} argument - the argument to check\n * @returns {Boolean} the given argument is an instance of Date\n *\n * @example\n * // Is 'mayonnaise' a Date?\n * var result = isDate('mayonnaise')\n * //=> false\n */\nfunction isDate(argument) {\n  return argument instanceof Date;\n}\n\nmodule.exports = isDate;\n\n/***/ }),\n/* 123 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nvar parse = __webpack_require__(13);\n\n/**\n * @category Millisecond Helpers\n * @summary Get the number of milliseconds between the given dates.\n *\n * @description\n * Get the number of milliseconds between the given dates.\n *\n * @param {Date|String|Number} dateLeft - the later date\n * @param {Date|String|Number} dateRight - the earlier date\n * @returns {Number} the number of milliseconds\n *\n * @example\n * // How many milliseconds are between\n * // 2 July 2014 12:30:20.600 and 2 July 2014 12:30:21.700?\n * var result = differenceInMilliseconds(\n *   new Date(2014, 6, 2, 12, 30, 21, 700),\n *   new Date(2014, 6, 2, 12, 30, 20, 600)\n * )\n * //=> 1100\n */\nfunction differenceInMilliseconds(dirtyDateLeft, dirtyDateRight) {\n  var dateLeft = parse(dirtyDateLeft);\n  var dateRight = parse(dirtyDateRight);\n  return dateLeft.getTime() - dateRight.getTime();\n}\n\nmodule.exports = differenceInMilliseconds;\n\n/***/ }),\n/* 124 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nvar parse = __webpack_require__(13);\nvar differenceInCalendarMonths = __webpack_require__(125);\nvar compareAsc = __webpack_require__(126);\n\n/**\n * @category Month Helpers\n * @summary Get the number of full months between the given dates.\n *\n * @description\n * Get the number of full months between the given dates.\n *\n * @param {Date|String|Number} dateLeft - the later date\n * @param {Date|String|Number} dateRight - the earlier date\n * @returns {Number} the number of full months\n *\n * @example\n * // How many full months are between 31 January 2014 and 1 September 2014?\n * var result = differenceInMonths(\n *   new Date(2014, 8, 1),\n *   new Date(2014, 0, 31)\n * )\n * //=> 7\n */\nfunction differenceInMonths(dirtyDateLeft, dirtyDateRight) {\n  var dateLeft = parse(dirtyDateLeft);\n  var dateRight = parse(dirtyDateRight);\n\n  var sign = compareAsc(dateLeft, dateRight);\n  var difference = Math.abs(differenceInCalendarMonths(dateLeft, dateRight));\n  dateLeft.setMonth(dateLeft.getMonth() - sign * difference);\n\n  // Math.abs(diff in full months - diff in calendar months) === 1 if last calendar month is not full\n  // If so, result must be decreased by 1 in absolute value\n  var isLastMonthNotFull = compareAsc(dateLeft, dateRight) === -sign;\n  return sign * (difference - isLastMonthNotFull);\n}\n\nmodule.exports = differenceInMonths;\n\n/***/ }),\n/* 125 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nvar parse = __webpack_require__(13);\n\n/**\n * @category Month Helpers\n * @summary Get the number of calendar months between the given dates.\n *\n * @description\n * Get the number of calendar months between the given dates.\n *\n * @param {Date|String|Number} dateLeft - the later date\n * @param {Date|String|Number} dateRight - the earlier date\n * @returns {Number} the number of calendar months\n *\n * @example\n * // How many calendar months are between 31 January 2014 and 1 September 2014?\n * var result = differenceInCalendarMonths(\n *   new Date(2014, 8, 1),\n *   new Date(2014, 0, 31)\n * )\n * //=> 8\n */\nfunction differenceInCalendarMonths(dirtyDateLeft, dirtyDateRight) {\n  var dateLeft = parse(dirtyDateLeft);\n  var dateRight = parse(dirtyDateRight);\n\n  var yearDiff = dateLeft.getFullYear() - dateRight.getFullYear();\n  var monthDiff = dateLeft.getMonth() - dateRight.getMonth();\n\n  return yearDiff * 12 + monthDiff;\n}\n\nmodule.exports = differenceInCalendarMonths;\n\n/***/ }),\n/* 126 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nvar parse = __webpack_require__(13);\n\n/**\n * @category Common Helpers\n * @summary Compare the two dates and return -1, 0 or 1.\n *\n * @description\n * Compare the two dates and return 1 if the first date is after the second,\n * -1 if the first date is before the second or 0 if dates are equal.\n *\n * @param {Date|String|Number} dateLeft - the first date to compare\n * @param {Date|String|Number} dateRight - the second date to compare\n * @returns {Number} the result of the comparison\n *\n * @example\n * // Compare 11 February 1987 and 10 July 1989:\n * var result = compareAsc(\n *   new Date(1987, 1, 11),\n *   new Date(1989, 6, 10)\n * )\n * //=> -1\n *\n * @example\n * // Sort the array of dates:\n * var result = [\n *   new Date(1995, 6, 2),\n *   new Date(1987, 1, 11),\n *   new Date(1989, 6, 10)\n * ].sort(compareAsc)\n * //=> [\n * //   Wed Feb 11 1987 00:00:00,\n * //   Mon Jul 10 1989 00:00:00,\n * //   Sun Jul 02 1995 00:00:00\n * // ]\n */\nfunction compareAsc(dirtyDateLeft, dirtyDateRight) {\n  var dateLeft = parse(dirtyDateLeft);\n  var timeLeft = dateLeft.getTime();\n  var dateRight = parse(dirtyDateRight);\n  var timeRight = dateRight.getTime();\n\n  if (timeLeft < timeRight) {\n    return -1;\n  } else if (timeLeft > timeRight) {\n    return 1;\n  } else {\n    return 0;\n  }\n}\n\nmodule.exports = compareAsc;\n\n/***/ }),\n/* 127 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nvar buildDistanceInWordsLocale = __webpack_require__(128);\nvar buildFormatLocale = __webpack_require__(129);\n\n/**\n * @category Locales\n * @summary English locale.\n */\nmodule.exports = {\n  distanceInWords: buildDistanceInWordsLocale(),\n  format: buildFormatLocale()\n};\n\n/***/ }),\n/* 128 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nfunction buildDistanceInWordsLocale() {\n  var distanceInWordsLocale = {\n    lessThanXSeconds: {\n      one: 'less than a second',\n      other: 'less than {{count}} seconds'\n    },\n\n    xSeconds: {\n      one: '1 second',\n      other: '{{count}} seconds'\n    },\n\n    halfAMinute: 'half a minute',\n\n    lessThanXMinutes: {\n      one: 'less than a minute',\n      other: 'less than {{count}} minutes'\n    },\n\n    xMinutes: {\n      one: '1 minute',\n      other: '{{count}} minutes'\n    },\n\n    aboutXHours: {\n      one: 'about 1 hour',\n      other: 'about {{count}} hours'\n    },\n\n    xHours: {\n      one: '1 hour',\n      other: '{{count}} hours'\n    },\n\n    xDays: {\n      one: '1 day',\n      other: '{{count}} days'\n    },\n\n    aboutXMonths: {\n      one: 'about 1 month',\n      other: 'about {{count}} months'\n    },\n\n    xMonths: {\n      one: '1 month',\n      other: '{{count}} months'\n    },\n\n    aboutXYears: {\n      one: 'about 1 year',\n      other: 'about {{count}} years'\n    },\n\n    xYears: {\n      one: '1 year',\n      other: '{{count}} years'\n    },\n\n    overXYears: {\n      one: 'over 1 year',\n      other: 'over {{count}} years'\n    },\n\n    almostXYears: {\n      one: 'almost 1 year',\n      other: 'almost {{count}} years'\n    }\n  };\n\n  function localize(token, count, options) {\n    options = options || {};\n\n    var result;\n    if (typeof distanceInWordsLocale[token] === 'string') {\n      result = distanceInWordsLocale[token];\n    } else if (count === 1) {\n      result = distanceInWordsLocale[token].one;\n    } else {\n      result = distanceInWordsLocale[token].other.replace('{{count}}', count);\n    }\n\n    if (options.addSuffix) {\n      if (options.comparison > 0) {\n        return 'in ' + result;\n      } else {\n        return result + ' ago';\n      }\n    }\n\n    return result;\n  }\n\n  return {\n    localize: localize\n  };\n}\n\nmodule.exports = buildDistanceInWordsLocale;\n\n/***/ }),\n/* 129 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nvar buildFormattingTokensRegExp = __webpack_require__(77);\n\nfunction buildFormatLocale() {\n  // Note: in English, the names of days of the week and months are capitalized.\n  // If you are making a new locale based on this one, check if the same is true for the language you're working on.\n  // Generally, formatted dates should look like they are in the middle of a sentence,\n  // e.g. in Spanish language the weekdays and months should be in the lowercase.\n  var months3char = ['Jan', 'Feb', 'Mar', 'Apr', 'May', 'Jun', 'Jul', 'Aug', 'Sep', 'Oct', 'Nov', 'Dec'];\n  var monthsFull = ['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December'];\n  var weekdays2char = ['Su', 'Mo', 'Tu', 'We', 'Th', 'Fr', 'Sa'];\n  var weekdays3char = ['Sun', 'Mon', 'Tue', 'Wed', 'Thu', 'Fri', 'Sat'];\n  var weekdaysFull = ['Sunday', 'Monday', 'Tuesday', 'Wednesday', 'Thursday', 'Friday', 'Saturday'];\n  var meridiemUppercase = ['AM', 'PM'];\n  var meridiemLowercase = ['am', 'pm'];\n  var meridiemFull = ['a.m.', 'p.m.'];\n\n  var formatters = {\n    // Month: Jan, Feb, ..., Dec\n    'MMM': function MMM(date) {\n      return months3char[date.getMonth()];\n    },\n\n    // Month: January, February, ..., December\n    'MMMM': function MMMM(date) {\n      return monthsFull[date.getMonth()];\n    },\n\n    // Day of week: Su, Mo, ..., Sa\n    'dd': function dd(date) {\n      return weekdays2char[date.getDay()];\n    },\n\n    // Day of week: Sun, Mon, ..., Sat\n    'ddd': function ddd(date) {\n      return weekdays3char[date.getDay()];\n    },\n\n    // Day of week: Sunday, Monday, ..., Saturday\n    'dddd': function dddd(date) {\n      return weekdaysFull[date.getDay()];\n    },\n\n    // AM, PM\n    'A': function A(date) {\n      return date.getHours() / 12 >= 1 ? meridiemUppercase[1] : meridiemUppercase[0];\n    },\n\n    // am, pm\n    'a': function a(date) {\n      return date.getHours() / 12 >= 1 ? meridiemLowercase[1] : meridiemLowercase[0];\n    },\n\n    // a.m., p.m.\n    'aa': function aa(date) {\n      return date.getHours() / 12 >= 1 ? meridiemFull[1] : meridiemFull[0];\n    }\n\n    // Generate ordinal version of formatters: M -> Mo, D -> Do, etc.\n  };var ordinalFormatters = ['M', 'D', 'DDD', 'd', 'Q', 'W'];\n  ordinalFormatters.forEach(function (formatterToken) {\n    formatters[formatterToken + 'o'] = function (date, formatters) {\n      return ordinal(formatters[formatterToken](date));\n    };\n  });\n\n  return {\n    formatters: formatters,\n    formattingTokensRegExp: buildFormattingTokensRegExp(formatters)\n  };\n}\n\nfunction ordinal(number) {\n  var rem100 = number % 100;\n  if (rem100 > 20 || rem100 < 10) {\n    switch (rem100 % 10) {\n      case 1:\n        return number + 'st';\n      case 2:\n        return number + 'nd';\n      case 3:\n        return number + 'rd';\n    }\n  }\n  return number + 'th';\n}\n\nmodule.exports = buildFormatLocale;\n\n/***/ }),\n/* 130 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nvar buildDistanceInWordsLocale = __webpack_require__(131);\nvar buildFormatLocale = __webpack_require__(132);\n\n/**\n * @category Locales\n * @summary Norwegian Bokmål locale.\n * @author Hans-Kristian Koren [@Hanse]{@link https://github.com/Hanse}\n */\nmodule.exports = {\n  distanceInWords: buildDistanceInWordsLocale(),\n  format: buildFormatLocale()\n};\n\n/***/ }),\n/* 131 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nfunction buildDistanceInWordsLocale() {\n  var distanceInWordsLocale = {\n    lessThanXSeconds: {\n      one: 'mindre enn ett sekund',\n      other: 'mindre enn {{count}} sekunder'\n    },\n\n    xSeconds: {\n      one: 'ett sekund',\n      other: '{{count}} sekunder'\n    },\n\n    halfAMinute: 'et halvt minutt',\n\n    lessThanXMinutes: {\n      one: 'mindre enn ett minutt',\n      other: 'mindre enn {{count}} minutter'\n    },\n\n    xMinutes: {\n      one: 'ett minutt',\n      other: '{{count}} minutter'\n    },\n\n    aboutXHours: {\n      one: 'rundt en time',\n      other: 'rundt {{count}} timer'\n    },\n\n    xHours: {\n      one: 'en time',\n      other: '{{count}} timer'\n    },\n\n    xDays: {\n      one: 'en dag',\n      other: '{{count}} dager'\n    },\n\n    aboutXMonths: {\n      one: 'rundt en måned',\n      other: 'rundt {{count}} måneder'\n    },\n\n    xMonths: {\n      one: 'en måned',\n      other: '{{count}} måneder'\n    },\n\n    aboutXYears: {\n      one: 'rundt ett år',\n      other: 'rundt {{count}} år'\n    },\n\n    xYears: {\n      one: 'ett år',\n      other: '{{count}} år'\n    },\n\n    overXYears: {\n      one: 'over ett år',\n      other: 'over {{count}} år'\n    },\n\n    almostXYears: {\n      one: 'nesten ett år',\n      other: 'nesten {{count}} år'\n    }\n  };\n\n  function localize(token, count, options) {\n    options = options || {};\n\n    var result;\n    if (typeof distanceInWordsLocale[token] === 'string') {\n      result = distanceInWordsLocale[token];\n    } else if (count === 1) {\n      result = distanceInWordsLocale[token].one;\n    } else {\n      result = distanceInWordsLocale[token].other.replace('{{count}}', count);\n    }\n\n    if (options.addSuffix) {\n      if (options.comparison > 0) {\n        return 'om ' + result;\n      } else {\n        return result + ' siden';\n      }\n    }\n\n    return result;\n  }\n\n  return {\n    localize: localize\n  };\n}\n\nmodule.exports = buildDistanceInWordsLocale;\n\n/***/ }),\n/* 132 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nvar buildFormattingTokensRegExp = __webpack_require__(77);\n\nfunction buildFormatLocale() {\n  var months3char = ['jan.', 'feb.', 'mars', 'april', 'mai', 'juni', 'juli', 'aug.', 'sep.', 'okt.', 'nov.', 'des.'];\n  var monthsFull = ['januar', 'februar', 'mars', 'april', 'mai', 'juni', 'juli', 'august', 'september', 'oktober', 'november', 'desember'];\n  var weekdays2char = ['sø', 'ma', 'ti', 'on', 'to', 'fr', 'lø'];\n  var weekdays3char = ['sø.', 'ma.', 'ti.', 'on.', 'to.', 'fr.', 'lø.'];\n  var weekdaysFull = ['søndag', 'mandag', 'tirsdag', 'onsdag', 'torsdag', 'fredag', 'lørdag'];\n  var meridiemUppercase = ['AM', 'PM'];\n  var meridiemLowercase = ['am', 'pm'];\n  var meridiemFull = ['a.m.', 'p.m.'];\n\n  var formatters = {\n    // Month: Jan, Feb, ..., Dec\n    'MMM': function MMM(date) {\n      return months3char[date.getMonth()];\n    },\n\n    // Month: January, February, ..., December\n    'MMMM': function MMMM(date) {\n      return monthsFull[date.getMonth()];\n    },\n\n    // Day of week: Su, Mo, ..., Sa\n    'dd': function dd(date) {\n      return weekdays2char[date.getDay()];\n    },\n\n    // Day of week: Sun, Mon, ..., Sat\n    'ddd': function ddd(date) {\n      return weekdays3char[date.getDay()];\n    },\n\n    // Day of week: Sunday, Monday, ..., Saturday\n    'dddd': function dddd(date) {\n      return weekdaysFull[date.getDay()];\n    },\n\n    // AM, PM\n    'A': function A(date) {\n      return date.getHours() / 12 >= 1 ? meridiemUppercase[1] : meridiemUppercase[0];\n    },\n\n    // am, pm\n    'a': function a(date) {\n      return date.getHours() / 12 >= 1 ? meridiemLowercase[1] : meridiemLowercase[0];\n    },\n\n    // a.m., p.m.\n    'aa': function aa(date) {\n      return date.getHours() / 12 >= 1 ? meridiemFull[1] : meridiemFull[0];\n    }\n\n    // Generate ordinal version of formatters: M -> Mo, D -> Do, etc.\n  };var ordinalFormatters = ['M', 'D', 'DDD', 'd', 'Q', 'W'];\n  ordinalFormatters.forEach(function (formatterToken) {\n    formatters[formatterToken + 'o'] = function (date, formatters) {\n      return ordinal(formatters[formatterToken](date));\n    };\n  });\n\n  return {\n    formatters: formatters,\n    formattingTokensRegExp: buildFormattingTokensRegExp(formatters)\n  };\n}\n\nfunction ordinal(number) {\n  return number + '.';\n}\n\nmodule.exports = buildFormatLocale;\n\n/***/ }),\n/* 133 */\n/***/ (function(module, exports) {\n\n// removed by extract-text-webpack-plugin\nmodule.exports = {\"lastUpdatedTime\":\"dh-stemning-lastUpdatedTime\",\"lastUpdatedTime--invisible\":\"dh-stemning-lastUpdatedTime--invisible\"};\n\n/***/ }),\n/* 134 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.LiveResult = undefined;\n\nvar _preact = __webpack_require__(1);\n\nvar _Result = __webpack_require__(52);\n\nvar _cookieUtils = __webpack_require__(20);\n\nvar _bem = __webpack_require__(3);\n\nvar _themeToClassName = __webpack_require__(5);\n\nvar _LiveResult = __webpack_require__(135);\n\nvar _LiveResult2 = _interopRequireDefault(_LiveResult);\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\n//  @jsx h\n\nvar LiveResult = function LiveResult(props, _ref) {\n  var theme = _ref.theme;\n  var poll = props.poll,\n      result = props.result,\n      resultError = props.resultError,\n      _props$showResult = props.showResult,\n      showResult = _props$showResult === undefined ? true : _props$showResult,\n      _props$resultMessage = props.resultMessage,\n      resultMessage = _props$resultMessage === undefined ? 'Takk for din stemme' : _props$resultMessage;\n\n\n  if (showResult) {\n    return (0, _preact.h)(_Result.Result, {\n      highlightedResultItemId: getHighlightedResultItemId(poll.id),\n      result: result,\n      error: resultError,\n      clickable: true\n    });\n  }\n\n  if (!resultMessage) {\n    return null;\n  }\n\n  return (0, _preact.h)(\n    'div',\n    { 'class': (0, _bem.bem)(_LiveResult2.default['live-result'], (0, _themeToClassName.themeToClassName)(theme)) },\n    (0, _preact.h)(\n      'p',\n      { 'class': _LiveResult2.default['live-result__paragraph'] },\n      resultMessage,\n      (0, _preact.h)(\n        'svg',\n        {\n          'aria-hidden': true,\n          xmlns: 'http://www.w3.org/2000/svg',\n          width: '14',\n          height: '14',\n          viewBox: '0 0 14 14',\n          'class': _LiveResult2.default['live-result__check']\n        },\n        (0, _preact.h)('path', {\n          fill: 'none',\n          stroke: '#00B2F7',\n          'stroke-linecap': 'round',\n          'stroke-linejoin': 'round',\n          'stroke-width': '2',\n          d: 'M1 6.63L4.77 11 13 1'\n        })\n      )\n    )\n  );\n};\n\nfunction getHighlightedResultItemId(pollId) {\n  return (0, _cookieUtils.getSelectedAlternativeId)(pollId);\n}\n\nexports.LiveResult = LiveResult;\n\n/***/ }),\n/* 135 */\n/***/ (function(module, exports) {\n\n// removed by extract-text-webpack-plugin\nmodule.exports = {\"live-result\":\"dh-stemning-live-result\",\"live-result__paragraph\":\"dh-stemning-live-result__paragraph\",\"live-result__check\":\"dh-stemning-live-result__check\",\"live-result--theme-sport\":\"dh-stemning-live-result--theme-sport\",\"live-result--theme-sport-inverted\":\"dh-stemning-live-result--theme-sport-inverted\",\"live-result--theme-monsen\":\"dh-stemning-live-result--theme-monsen\"};\n\n/***/ }),\n/* 136 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.WithVotingState = undefined;\n\nvar _extends = Object.assign || function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; };\n\nvar _createClass = function () { function 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, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }();\n\nvar _pureComponents = __webpack_require__(33);\n\nvar _cookieUtils = __webpack_require__(20);\n\nvar _createVote = __webpack_require__(137);\n\nvar _registerVote = __webpack_require__(138);\n\nfunction _asyncToGenerator(fn) { return function () { var gen = fn.apply(this, arguments); return new Promise(function (resolve, reject) { function step(key, arg) { try { var info = gen[key](arg); var value = info.value; } catch (error) { reject(error); return; } if (info.done) { resolve(value); } else { return Promise.resolve(value).then(function (value) { step(\"next\", value); }, function (err) { step(\"throw\", err); }); } } return step(\"next\"); }); }; }\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction _possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return call && (typeof call === \"object\" || typeof call === \"function\") ? call : self; }\n\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function, not \" + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; }\n\nvar WithVotingState = exports.WithVotingState = function (_PureComponent) {\n  _inherits(WithVotingState, _PureComponent);\n\n  function WithVotingState(props) {\n    _classCallCheck(this, WithVotingState);\n\n    var _this = _possibleConstructorReturn(this, (WithVotingState.__proto__ || Object.getPrototypeOf(WithVotingState)).call(this, props));\n\n    _initialiseProps.call(_this);\n\n    var poll = props.poll;\n\n    var hasVoted = (0, _cookieUtils.hasVoted)(poll.id);\n    _this.state = {\n      hasVoted: hasVoted\n    };\n    return _this;\n  }\n\n  _createClass(WithVotingState, [{\n    key: 'componentWillReceiveProps',\n    value: function componentWillReceiveProps(nextProps) {\n      var isNewPoll = this.props.poll.id !== nextProps.poll.id;\n      if (isNewPoll) {\n        var _hasVoted = (0, _cookieUtils.hasVoted)(nextProps.poll.id);\n        this.setState({\n          hasVoted: _hasVoted\n        });\n      }\n    }\n  }, {\n    key: 'render',\n    value: function render() {\n      return this.props.render(_extends({}, this.state, {\n        onRegisterVote: this.handleRegisterVote\n      }));\n    }\n  }]);\n\n  return WithVotingState;\n}(_pureComponents.PureComponent);\n\nvar _initialiseProps = function _initialiseProps() {\n  var _this2 = this;\n\n  this.handleRegisterVote = function () {\n    var _ref = _asyncToGenerator( /*#__PURE__*/regeneratorRuntime.mark(function _callee(alternative) {\n      var _props, clientId, poll, authConfig, vote, errorMessage;\n\n      return regeneratorRuntime.wrap(function _callee$(_context) {\n        while (1) {\n          switch (_context.prev = _context.next) {\n            case 0:\n              _props = _this2.props, clientId = _props.clientId, poll = _props.poll, authConfig = _props.authConfig;\n              vote = (0, _createVote.createVote)(clientId, poll, alternative);\n\n              _this2.setState({\n                hasVoted: true,\n                vote: vote,\n                error: null\n              });\n              _context.prev = 3;\n              _context.next = 6;\n              return (0, _registerVote.registerVote)(vote, authConfig);\n\n            case 6:\n\n              // when vote has been registered, it is safe to set a cookie that\n              // tells the browser that the user has registered a vote for this poll\n              (0, _cookieUtils.setHasVoted)(poll.id, alternative.id);\n\n              // Facilitate the display of a 'vote confirmed' message to screen readers when vote has\n              // been registered. Remove / disable it after it has been picked up by the screen reader\n              _this2.setState({\n                isDisplayVoteConfirmedMessage: true\n              }, function () {\n                setTimeout(function () {\n                  _this2.setState({\n                    isDisplayVoteConfirmedMessage: false\n                  });\n                }, 2000);\n              });\n              _context.next = 15;\n              break;\n\n            case 10:\n              _context.prev = 10;\n              _context.t0 = _context['catch'](3);\n              errorMessage = 'Unable to register vote';\n\n              console.error(errorMessage);\n              _this2.setState({\n                hasVoted: false,\n                vote: null,\n                error: new Error(errorMessage)\n              });\n\n            case 15:\n            case 'end':\n              return _context.stop();\n          }\n        }\n      }, _callee, _this2, [[3, 10]]);\n    }));\n\n    return function (_x) {\n      return _ref.apply(this, arguments);\n    };\n  }();\n};\n\n/***/ }),\n/* 137 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.createVote = createVote;\nfunction createVote(clientId, poll, alternative) {\n  return {\n    clientId: clientId,\n    pollId: poll.id,\n    alternativeId: alternative.id\n  };\n}\n\n/***/ }),\n/* 138 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.registerVote = undefined;\n\nvar registerVote = exports.registerVote = function () {\n  var _ref = _asyncToGenerator( /*#__PURE__*/regeneratorRuntime.mark(function _callee(vote, authConfig) {\n    var credentials, pollVotesRef, voted;\n    return regeneratorRuntime.wrap(function _callee$(_context) {\n      while (1) {\n        switch (_context.prev = _context.next) {\n          case 0:\n            if ((0, _cookieUtils.cookiesEnabled)()) {\n              _context.next = 2;\n              break;\n            }\n\n            throw new Error('Cookies are not enabled');\n\n          case 2:\n            _context.next = 4;\n            return (0, _firebase.getFirebaseInstance)(authConfig).auth().signInAnonymously();\n\n          case 4:\n            credentials = _context.sent;\n            pollVotesRef = (0, _firebase.getFirebaseInstance)().database().ref('pollVotes');\n            _context.next = 8;\n            return pollVotesRef.push({\n              uid: credentials.uid,\n              alternativeId: vote.alternativeId,\n              pollId: Number(vote.pollId),\n              channelId: Number(vote.clientId)\n            });\n\n          case 8:\n            voted = _context.sent;\n            return _context.abrupt('return', voted);\n\n          case 10:\n          case 'end':\n            return _context.stop();\n        }\n      }\n    }, _callee, this);\n  }));\n\n  return function registerVote(_x, _x2) {\n    return _ref.apply(this, arguments);\n  };\n}();\n\nvar _firebase = __webpack_require__(78);\n\nvar _cookieUtils = __webpack_require__(20);\n\nfunction _asyncToGenerator(fn) { return function () { var gen = fn.apply(this, arguments); return new Promise(function (resolve, reject) { function step(key, arg) { try { var info = gen[key](arg); var value = info.value; } catch (error) { reject(error); return; } if (info.done) { resolve(value); } else { return Promise.resolve(value).then(function (value) { step(\"next\", value); }, function (err) { step(\"throw\", err); }); } } return step(\"next\"); }); }; }\n\n/***/ }),\n/* 139 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n__webpack_require__(140);\nmodule.exports = __webpack_require__(21).default;\n\n/***/ }),\n/* 140 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\n__webpack_require__(141);\n\n__webpack_require__(142);\n\n__webpack_require__(143);\n\n/***/ }),\n/* 141 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n/* WEBPACK VAR INJECTION */(function(global) {\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nvar __global = function () {\n    if (typeof global !== 'undefined') {\n        return global;\n    }\n    if (typeof window !== 'undefined') {\n        return window;\n    }\n    if (typeof self !== 'undefined') {\n        return self;\n    }\n    throw new Error('unable to locate global object');\n}();\n// Polyfill Promise\nif (typeof Promise === 'undefined') {\n    // HACK: TS throws an error if I attempt to use 'dot-notation'\n    __global['Promise'] = Promise = __webpack_require__(26);\n}\n\n//# sourceMappingURL=promise.js.map\n/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(17)))\n\n/***/ }),\n/* 142 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * This is the Array.prototype.find polyfill from MDN\n * https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/find\n * https://tc39.github.io/ecma262/#sec-array.prototype.find\n */\nif (!Array.prototype.find) {\n    Object.defineProperty(Array.prototype, 'find', {\n        value: function value(predicate) {\n            // 1. Let O be ? ToObject(this value).\n            if (this == null) {\n                throw new TypeError('\"this\" is null or not defined');\n            }\n            var o = Object(this);\n            // 2. Let len be ? ToLength(? Get(O, \"length\")).\n            var len = o.length >>> 0;\n            // 3. If IsCallable(predicate) is false, throw a TypeError exception.\n            if (typeof predicate !== 'function') {\n                throw new TypeError('predicate must be a function');\n            }\n            // 4. If thisArg was supplied, let T be thisArg; else let T be undefined.\n            var thisArg = arguments[1];\n            // 5. Let k be 0.\n            var k = 0;\n            // 6. Repeat, while k < len\n            while (k < len) {\n                // a. Let Pk be ! ToString(k).\n                // b. Let kValue be ? Get(O, Pk).\n                // c. Let testResult be ToBoolean(? Call(predicate, T, « kValue, k, O »)).\n                // d. If testResult is true, return kValue.\n                var kValue = o[k];\n                if (predicate.call(thisArg, kValue, k, o)) {\n                    return kValue;\n                }\n                // e. Increase k by 1.\n                k++;\n            }\n            // 7. Return undefined.\n            return undefined;\n        }\n    });\n}\n\n//# sourceMappingURL=find.js.map\n\n/***/ }),\n/* 143 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * This is the Array.prototype.findIndex polyfill from MDN\n * https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/findIndex\n * https://tc39.github.io/ecma262/#sec-array.prototype.findIndex\n */\nif (!Array.prototype.findIndex) {\n    Object.defineProperty(Array.prototype, 'findIndex', {\n        value: function value(predicate) {\n            // 1. Let O be ? ToObject(this value).\n            if (this == null) {\n                throw new TypeError('\"this\" is null or not defined');\n            }\n            var o = Object(this);\n            // 2. Let len be ? ToLength(? Get(O, \"length\")).\n            var len = o.length >>> 0;\n            // 3. If IsCallable(predicate) is false, throw a TypeError exception.\n            if (typeof predicate !== 'function') {\n                throw new TypeError('predicate must be a function');\n            }\n            // 4. If thisArg was supplied, let T be thisArg; else let T be undefined.\n            var thisArg = arguments[1];\n            // 5. Let k be 0.\n            var k = 0;\n            // 6. Repeat, while k < len\n            while (k < len) {\n                // a. Let Pk be ! ToString(k).\n                // b. Let kValue be ? Get(O, Pk).\n                // c. Let testResult be ToBoolean(? Call(predicate, T, « kValue, k, O »)).\n                // d. If testResult is true, return k.\n                var kValue = o[k];\n                if (predicate.call(thisArg, kValue, k, o)) {\n                    return k;\n                }\n                // e. Increase k by 1.\n                k++;\n            }\n            // 7. Return -1.\n            return -1;\n        }\n    });\n}\n\n//# sourceMappingURL=findIndex.js.map\n\n/***/ }),\n/* 144 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nObject.defineProperty(exports, \"__esModule\", {\n    value: true\n});\nexports.createFirebaseNamespace = createFirebaseNamespace;\n\nvar _util = __webpack_require__(0);\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nvar contains = function contains(obj, key) {\n    return Object.prototype.hasOwnProperty.call(obj, key);\n};\nvar DEFAULT_ENTRY_NAME = '[DEFAULT]';\n// An array to capture listeners before the true auth functions\n// exist\nvar tokenListeners = [];\n/**\n * Global context object for a collection of services using\n * a shared authentication state.\n */\nvar FirebaseAppImpl = /** @class */function () {\n    function FirebaseAppImpl(options, name, firebase_) {\n        this.firebase_ = firebase_;\n        this.isDeleted_ = false;\n        this.services_ = {};\n        this.name_ = name;\n        this.options_ = (0, _util.deepCopy)(options);\n        this.INTERNAL = {\n            getUid: function getUid() {\n                return null;\n            },\n            getToken: function getToken() {\n                return Promise.resolve(null);\n            },\n            addAuthTokenListener: function addAuthTokenListener(callback) {\n                tokenListeners.push(callback);\n                // Make sure callback is called, asynchronously, in the absence of the auth module\n                setTimeout(function () {\n                    return callback(null);\n                }, 0);\n            },\n            removeAuthTokenListener: function removeAuthTokenListener(callback) {\n                tokenListeners = tokenListeners.filter(function (listener) {\n                    return listener !== callback;\n                });\n            }\n        };\n    }\n    Object.defineProperty(FirebaseAppImpl.prototype, \"name\", {\n        get: function get() {\n            this.checkDestroyed_();\n            return this.name_;\n        },\n        enumerable: true,\n        configurable: true\n    });\n    Object.defineProperty(FirebaseAppImpl.prototype, \"options\", {\n        get: function get() {\n            this.checkDestroyed_();\n            return this.options_;\n        },\n        enumerable: true,\n        configurable: true\n    });\n    FirebaseAppImpl.prototype.delete = function () {\n        var _this = this;\n        return new Promise(function (resolve) {\n            _this.checkDestroyed_();\n            resolve();\n        }).then(function () {\n            _this.firebase_.INTERNAL.removeApp(_this.name_);\n            var services = [];\n            Object.keys(_this.services_).forEach(function (serviceKey) {\n                Object.keys(_this.services_[serviceKey]).forEach(function (instanceKey) {\n                    services.push(_this.services_[serviceKey][instanceKey]);\n                });\n            });\n            return Promise.all(services.map(function (service) {\n                return service.INTERNAL.delete();\n            }));\n        }).then(function () {\n            _this.isDeleted_ = true;\n            _this.services_ = {};\n        });\n    };\n    /**\n     * Return a service instance associated with this app (creating it\n     * on demand), identified by the passed instanceIdentifier.\n     *\n     * NOTE: Currently storage is the only one that is leveraging this\n     * functionality. They invoke it by calling:\n     *\n     * ```javascript\n     * firebase.app().storage('STORAGE BUCKET ID')\n     * ```\n     *\n     * The service name is passed to this already\n     * @internal\n     */\n    FirebaseAppImpl.prototype._getService = function (name, instanceIdentifier) {\n        if (instanceIdentifier === void 0) {\n            instanceIdentifier = DEFAULT_ENTRY_NAME;\n        }\n        this.checkDestroyed_();\n        if (!this.services_[name]) {\n            this.services_[name] = {};\n        }\n        if (!this.services_[name][instanceIdentifier]) {\n            /**\n             * If a custom instance has been defined (i.e. not '[DEFAULT]')\n             * then we will pass that instance on, otherwise we pass `null`\n             */\n            var instanceSpecifier = instanceIdentifier !== DEFAULT_ENTRY_NAME ? instanceIdentifier : undefined;\n            var service = this.firebase_.INTERNAL.factories[name](this, this.extendApp.bind(this), instanceSpecifier);\n            this.services_[name][instanceIdentifier] = service;\n        }\n        return this.services_[name][instanceIdentifier];\n    };\n    /**\n     * Callback function used to extend an App instance at the time\n     * of service instance creation.\n     */\n    FirebaseAppImpl.prototype.extendApp = function (props) {\n        var _this = this;\n        // Copy the object onto the FirebaseAppImpl prototype\n        (0, _util.deepExtend)(this, props);\n        /**\n         * If the app has overwritten the addAuthTokenListener stub, forward\n         * the active token listeners on to the true fxn.\n         *\n         * TODO: This function is required due to our current module\n         * structure. Once we are able to rely strictly upon a single module\n         * implementation, this code should be refactored and Auth should\n         * provide these stubs and the upgrade logic\n         */\n        if (props.INTERNAL && props.INTERNAL.addAuthTokenListener) {\n            tokenListeners.forEach(function (listener) {\n                _this.INTERNAL.addAuthTokenListener(listener);\n            });\n            tokenListeners = [];\n        }\n    };\n    /**\n     * This function will throw an Error if the App has already been deleted -\n     * use before performing API actions on the App.\n     */\n    FirebaseAppImpl.prototype.checkDestroyed_ = function () {\n        if (this.isDeleted_) {\n            error('app-deleted', { name: this.name_ });\n        }\n    };\n    return FirebaseAppImpl;\n}();\n// Prevent dead-code elimination of these methods w/o invalid property\n// copying.\nFirebaseAppImpl.prototype.name && FirebaseAppImpl.prototype.options || FirebaseAppImpl.prototype.delete || console.log('dc');\n/**\n * Return a firebase namespace object.\n *\n * In production, this will be called exactly once and the result\n * assigned to the 'firebase' global.  It may be called multiple times\n * in unit tests.\n */\nfunction createFirebaseNamespace() {\n    var apps_ = {};\n    var factories = {};\n    var appHooks = {};\n    // A namespace is a plain JavaScript Object.\n    var namespace = {\n        // Hack to prevent Babel from modifying the object returned\n        // as the firebase namespace.\n        __esModule: true,\n        initializeApp: initializeApp,\n        app: app,\n        apps: null,\n        Promise: Promise,\n        SDK_VERSION: '4.6.1',\n        INTERNAL: {\n            registerService: registerService,\n            createFirebaseNamespace: createFirebaseNamespace,\n            extendNamespace: extendNamespace,\n            createSubscribe: _util.createSubscribe,\n            ErrorFactory: _util.ErrorFactory,\n            removeApp: removeApp,\n            factories: factories,\n            useAsService: useAsService,\n            Promise: Promise,\n            deepExtend: _util.deepExtend\n        }\n    };\n    // Inject a circular default export to allow Babel users who were previously\n    // using:\n    //\n    //   import firebase from 'firebase';\n    //   which becomes: var firebase = require('firebase').default;\n    //\n    // instead of\n    //\n    //   import * as firebase from 'firebase';\n    //   which becomes: var firebase = require('firebase');\n    (0, _util.patchProperty)(namespace, 'default', namespace);\n    // firebase.apps is a read-only getter.\n    Object.defineProperty(namespace, 'apps', {\n        get: getApps\n    });\n    /**\n     * Called by App.delete() - but before any services associated with the App\n     * are deleted.\n     */\n    function removeApp(name) {\n        var app = apps_[name];\n        callAppHooks(app, 'delete');\n        delete apps_[name];\n    }\n    /**\n     * Get the App object for a given name (or DEFAULT).\n     */\n    function app(name) {\n        name = name || DEFAULT_ENTRY_NAME;\n        if (!contains(apps_, name)) {\n            error('no-app', { name: name });\n        }\n        return apps_[name];\n    }\n    (0, _util.patchProperty)(app, 'App', FirebaseAppImpl);\n    /**\n     * Create a new App instance (name must be unique).\n     */\n    function initializeApp(options, name) {\n        if (name === undefined) {\n            name = DEFAULT_ENTRY_NAME;\n        } else {\n            if (typeof name !== 'string' || name === '') {\n                error('bad-app-name', { name: name + '' });\n            }\n        }\n        if (contains(apps_, name)) {\n            error('duplicate-app', { name: name });\n        }\n        var app = new FirebaseAppImpl(options, name, namespace);\n        apps_[name] = app;\n        callAppHooks(app, 'create');\n        return app;\n    }\n    /*\n     * Return an array of all the non-deleted FirebaseApps.\n     */\n    function getApps() {\n        // Make a copy so caller cannot mutate the apps list.\n        return Object.keys(apps_).map(function (name) {\n            return apps_[name];\n        });\n    }\n    /*\n     * Register a Firebase Service.\n     *\n     * firebase.INTERNAL.registerService()\n     *\n     * TODO: Implement serviceProperties.\n     */\n    function registerService(name, createService, serviceProperties, appHook, allowMultipleInstances) {\n        // Cannot re-register a service that already exists\n        if (factories[name]) {\n            error('duplicate-service', { name: name });\n        }\n        // Capture the service factory for later service instantiation\n        factories[name] = createService;\n        // Capture the appHook, if passed\n        if (appHook) {\n            appHooks[name] = appHook;\n            // Run the **new** app hook on all existing apps\n            getApps().forEach(function (app) {\n                appHook('create', app);\n            });\n        }\n        // The Service namespace is an accessor function ...\n        var serviceNamespace = function serviceNamespace(appArg) {\n            if (appArg === void 0) {\n                appArg = app();\n            }\n            if (typeof appArg[name] !== 'function') {\n                // Invalid argument.\n                // This happens in the following case: firebase.storage('gs:/')\n                error('invalid-app-argument', { name: name });\n            }\n            // Forward service instance lookup to the FirebaseApp.\n            return appArg[name]();\n        };\n        // ... and a container for service-level properties.\n        if (serviceProperties !== undefined) {\n            (0, _util.deepExtend)(serviceNamespace, serviceProperties);\n        }\n        // Monkey-patch the serviceNamespace onto the firebase namespace\n        namespace[name] = serviceNamespace;\n        // Patch the FirebaseAppImpl prototype\n        FirebaseAppImpl.prototype[name] = function () {\n            var args = [];\n            for (var _i = 0; _i < arguments.length; _i++) {\n                args[_i] = arguments[_i];\n            }\n            var serviceFxn = this._getService.bind(this, name);\n            return serviceFxn.apply(this, allowMultipleInstances ? args : []);\n        };\n        return serviceNamespace;\n    }\n    /**\n     * Patch the top-level firebase namespace with additional properties.\n     *\n     * firebase.INTERNAL.extendNamespace()\n     */\n    function extendNamespace(props) {\n        (0, _util.deepExtend)(namespace, props);\n    }\n    function callAppHooks(app, eventName) {\n        Object.keys(factories).forEach(function (serviceName) {\n            // Ignore virtual services\n            var factoryName = useAsService(app, serviceName);\n            if (factoryName === null) {\n                return;\n            }\n            if (appHooks[factoryName]) {\n                appHooks[factoryName](eventName, app);\n            }\n        });\n    }\n    // Map the requested service to a registered service name\n    // (used to map auth to serverAuth service when needed).\n    function useAsService(app, name) {\n        if (name === 'serverAuth') {\n            return null;\n        }\n        var useService = name;\n        var options = app.options;\n        return useService;\n    }\n    return namespace;\n}\nfunction error(code, args) {\n    throw appErrors.create(code, args);\n}\n// TypeScript does not support non-string indexes!\n// let errors: {[code: AppError: string} = {\nvar errors = {\n    'no-app': \"No Firebase App '{$name}' has been created - \" + 'call Firebase App.initializeApp()',\n    'bad-app-name': \"Illegal App name: '{$name}\",\n    'duplicate-app': \"Firebase App named '{$name}' already exists\",\n    'app-deleted': \"Firebase App named '{$name}' already deleted\",\n    'duplicate-service': \"Firebase service named '{$name}' already registered\",\n    'sa-not-supported': 'Initializing the Firebase SDK with a service ' + 'account is only allowed in a Node.js environment. On client ' + 'devices, you should instead initialize the SDK with an api key and ' + 'auth domain',\n    'invalid-app-argument': 'firebase.{$name}() takes either no argument or a ' + 'Firebase App instance.'\n};\nvar appErrors = new _util.ErrorFactory('app', 'Firebase', errors);\n\n//# sourceMappingURL=firebaseApp.js.map\n\n/***/ }),\n/* 145 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\n/**\n * Do a deep-copy of basic JavaScript Objects or Arrays.\n */\nfunction deepCopy(value) {\n    return deepExtend(undefined, value);\n}\nexports.deepCopy = deepCopy;\n/**\n * Copy properties from source to target (recursively allows extension\n * of Objects and Arrays).  Scalar values in the target are over-written.\n * If target is undefined, an object of the appropriate type will be created\n * (and returned).\n *\n * We recursively copy all child properties of plain Objects in the source- so\n * that namespace- like dictionaries are merged.\n *\n * Note that the target can be a function, in which case the properties in\n * the source Object are copied onto it as static properties of the Function.\n */\nfunction deepExtend(target, source) {\n    if (!(source instanceof Object)) {\n        return source;\n    }\n    switch (source.constructor) {\n        case Date:\n            // Treat Dates like scalars; if the target date object had any child\n            // properties - they will be lost!\n            var dateValue = source;\n            return new Date(dateValue.getTime());\n        case Object:\n            if (target === undefined) {\n                target = {};\n            }\n            break;\n        case Array:\n            // Always copy the array source and overwrite the target.\n            target = [];\n            break;\n        default:\n            // Not a plain Object - treat it as a scalar.\n            return source;\n    }\n    for (var prop in source) {\n        if (!source.hasOwnProperty(prop)) {\n            continue;\n        }\n        target[prop] = deepExtend(target[prop], source[prop]);\n    }\n    return target;\n}\nexports.deepExtend = deepExtend;\n// TODO: Really needed (for JSCompiler type checking)?\nfunction patchProperty(obj, prop, value) {\n    obj[prop] = value;\n}\nexports.patchProperty = patchProperty;\n\n//# sourceMappingURL=deepCopy.js.map\n\n/***/ }),\n/* 146 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar Deferred = /** @class */function () {\n    function Deferred() {\n        var _this = this;\n        this.promise = new Promise(function (resolve, reject) {\n            _this.resolve = resolve;\n            _this.reject = reject;\n        });\n    }\n    /**\n    * Our API internals are not promiseified and cannot because our callback APIs have subtle expectations around\n    * invoking promises inline, which Promises are forbidden to do. This method accepts an optional node-style callback\n    * and returns a node-style callback which will resolve or reject the Deferred's promise.\n    * @param {((?function(?(Error)): (?|undefined))| (?function(?(Error),?=): (?|undefined)))=} callback\n    * @return {!function(?(Error), ?=)}\n    */\n    Deferred.prototype.wrapCallback = function (callback) {\n        var _this = this;\n        return function (error, value) {\n            if (error) {\n                _this.reject(error);\n            } else {\n                _this.resolve(value);\n            }\n            if (typeof callback === 'function') {\n                // Attaching noop handler just in case developer wasn't expecting\n                // promises\n                _this.promise.catch(function () {});\n                // Some of our callbacks don't expect a value and our own tests\n                // assert that the parameter length is 1\n                if (callback.length === 1) {\n                    callback(error);\n                } else {\n                    callback(error, value);\n                }\n            }\n        };\n    };\n    return Deferred;\n}();\nexports.Deferred = Deferred;\n\n//# sourceMappingURL=deferred.js.map\n\n/***/ }),\n/* 147 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nvar _typeof = typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; };\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar constants_1 = __webpack_require__(68);\n/**\n * Returns navigator.userAgent string or '' if it's not defined.\n * @return {string} user agent string\n */\nexports.getUA = function () {\n    if (typeof navigator !== 'undefined' && typeof navigator['userAgent'] === 'string') {\n        return navigator['userAgent'];\n    } else {\n        return '';\n    }\n};\n/**\n * Detect Cordova / PhoneGap / Ionic frameworks on a mobile device.\n *\n * Deliberately does not rely on checking `file://` URLs (as this fails PhoneGap in the Ripple emulator) nor\n * Cordova `onDeviceReady`, which would normally wait for a callback.\n *\n * @return {boolean} isMobileCordova\n */\nexports.isMobileCordova = function () {\n    return typeof window !== 'undefined' && !!(window['cordova'] || window['phonegap'] || window['PhoneGap']) && /ios|iphone|ipod|ipad|android|blackberry|iemobile/i.test(exports.getUA());\n};\n/**\n * Detect React Native.\n *\n * @return {boolean} True if ReactNative environment is detected.\n */\nexports.isReactNative = function () {\n    return (typeof navigator === \"undefined\" ? \"undefined\" : _typeof(navigator)) === 'object' && navigator['product'] === 'ReactNative';\n};\n/**\n * Detect Node.js.\n *\n * @return {boolean} True if Node.js environment is detected.\n */\nexports.isNodeSdk = function () {\n    return constants_1.CONSTANTS.NODE_CLIENT === true || constants_1.CONSTANTS.NODE_ADMIN === true;\n};\n\n//# sourceMappingURL=environment.js.map\n\n/***/ }),\n/* 148 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar ERROR_NAME = 'FirebaseError';\nvar captureStackTrace = Error.captureStackTrace;\n// Export for faking in tests\nfunction patchCapture(captureFake) {\n    var result = captureStackTrace;\n    captureStackTrace = captureFake;\n    return result;\n}\nexports.patchCapture = patchCapture;\nvar FirebaseError = /** @class */function () {\n    function FirebaseError(code, message) {\n        this.code = code;\n        this.message = message;\n        var stack;\n        // We want the stack value, if implemented by Error\n        if (captureStackTrace) {\n            // Patches this.stack, omitted calls above ErrorFactory#create\n            captureStackTrace(this, ErrorFactory.prototype.create);\n        } else {\n            var err_1 = Error.apply(this, arguments);\n            this.name = ERROR_NAME;\n            // Make non-enumerable getter for the property.\n            Object.defineProperty(this, 'stack', {\n                get: function get() {\n                    return err_1.stack;\n                }\n            });\n        }\n    }\n    return FirebaseError;\n}();\nexports.FirebaseError = FirebaseError;\n// Back-door inheritance\nFirebaseError.prototype = Object.create(Error.prototype);\nFirebaseError.prototype.constructor = FirebaseError;\nFirebaseError.prototype.name = ERROR_NAME;\nvar ErrorFactory = /** @class */function () {\n    function ErrorFactory(service, serviceName, errors) {\n        this.service = service;\n        this.serviceName = serviceName;\n        this.errors = errors;\n        // Matches {$name}, by default.\n        this.pattern = /\\{\\$([^}]+)}/g;\n        // empty\n    }\n    ErrorFactory.prototype.create = function (code, data) {\n        if (data === undefined) {\n            data = {};\n        }\n        var template = this.errors[code];\n        var fullCode = this.service + '/' + code;\n        var message;\n        if (template === undefined) {\n            message = 'Error';\n        } else {\n            message = template.replace(this.pattern, function (match, key) {\n                var value = data[key];\n                return value !== undefined ? value.toString() : '<' + key + '?>';\n            });\n        }\n        // Service: Error message (service/code).\n        message = this.serviceName + ': ' + message + ' (' + fullCode + ').';\n        var err = new FirebaseError(fullCode, message);\n        // Populate the Error object with message parts for programmatic\n        // accesses (e.g., e.file).\n        for (var prop in data) {\n            if (!data.hasOwnProperty(prop) || prop.slice(-1) === '_') {\n                continue;\n            }\n            err[prop] = data[prop];\n        }\n        return err;\n    };\n    return ErrorFactory;\n}();\nexports.ErrorFactory = ErrorFactory;\n\n//# sourceMappingURL=errors.js.map\n\n/***/ }),\n/* 149 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nvar _typeof = typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; };\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar crypt_1 = __webpack_require__(80);\nvar json_1 = __webpack_require__(81);\n/**\n * Decodes a Firebase auth. token into constituent parts.\n *\n * Notes:\n * - May return with invalid / incomplete claims if there's no native base64 decoding support.\n * - Doesn't check if the token is actually valid.\n *\n * @param {?string} token\n * @return {{header: *, claims: *, data: *, signature: string}}\n */\nexports.decode = function (token) {\n    var header = {},\n        claims = {},\n        data = {},\n        signature = '';\n    try {\n        var parts = token.split('.');\n        header = json_1.jsonEval(crypt_1.base64Decode(parts[0]) || '');\n        claims = json_1.jsonEval(crypt_1.base64Decode(parts[1]) || '');\n        signature = parts[2];\n        data = claims['d'] || {};\n        delete claims['d'];\n    } catch (e) {}\n    return {\n        header: header,\n        claims: claims,\n        data: data,\n        signature: signature\n    };\n};\n/**\n * Decodes a Firebase auth. token and checks the validity of its time-based claims. Will return true if the\n * token is within the time window authorized by the 'nbf' (not-before) and 'iat' (issued-at) claims.\n *\n * Notes:\n * - May return a false negative if there's no native base64 decoding support.\n * - Doesn't check if the token is actually valid.\n *\n * @param {?string} token\n * @return {boolean}\n */\nexports.isValidTimestamp = function (token) {\n    var claims = exports.decode(token).claims,\n        now = Math.floor(new Date().getTime() / 1000),\n        validSince,\n        validUntil;\n    if ((typeof claims === \"undefined\" ? \"undefined\" : _typeof(claims)) === 'object') {\n        if (claims.hasOwnProperty('nbf')) {\n            validSince = claims['nbf'];\n        } else if (claims.hasOwnProperty('iat')) {\n            validSince = claims['iat'];\n        }\n        if (claims.hasOwnProperty('exp')) {\n            validUntil = claims['exp'];\n        } else {\n            // token will expire after 24h by default\n            validUntil = validSince + 86400;\n        }\n    }\n    return now && validSince && validUntil && now >= validSince && now <= validUntil;\n};\n/**\n * Decodes a Firebase auth. token and returns its issued at time if valid, null otherwise.\n *\n * Notes:\n * - May return null if there's no native base64 decoding support.\n * - Doesn't check if the token is actually valid.\n *\n * @param {?string} token\n * @return {?number}\n */\nexports.issuedAtTime = function (token) {\n    var claims = exports.decode(token).claims;\n    if ((typeof claims === \"undefined\" ? \"undefined\" : _typeof(claims)) === 'object' && claims.hasOwnProperty('iat')) {\n        return claims['iat'];\n    }\n    return null;\n};\n/**\n * Decodes a Firebase auth. token and checks the validity of its format. Expects a valid issued-at time and non-empty\n * signature.\n *\n * Notes:\n * - May return a false negative if there's no native base64 decoding support.\n * - Doesn't check if the token is actually valid.\n *\n * @param {?string} token\n * @return {boolean}\n */\nexports.isValidFormat = function (token) {\n    var decoded = exports.decode(token),\n        claims = decoded.claims;\n    return !!decoded.signature && !!claims && (typeof claims === \"undefined\" ? \"undefined\" : _typeof(claims)) === 'object' && claims.hasOwnProperty('iat');\n};\n/**\n * Attempts to peer into an auth token and determine if it's an admin auth token by looking at the claims portion.\n *\n * Notes:\n * - May return a false negative if there's no native base64 decoding support.\n * - Doesn't check if the token is actually valid.\n *\n * @param {?string} token\n * @return {boolean}\n */\nexports.isAdmin = function (token) {\n    var claims = exports.decode(token).claims;\n    return (typeof claims === \"undefined\" ? \"undefined\" : _typeof(claims)) === 'object' && claims['admin'] === true;\n};\n\n//# sourceMappingURL=jwt.js.map\n\n/***/ }),\n/* 150 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar obj_1 = __webpack_require__(82);\n/**\n * Returns a querystring-formatted string (e.g. &arg=val&arg2=val2) from a params\n * object (e.g. {arg: 'val', arg2: 'val2'})\n * Note: You must prepend it with ? when adding it to a URL.\n *\n * @param {!Object} querystringParams\n * @return {string}\n */\nexports.querystring = function (querystringParams) {\n    var params = [];\n    obj_1.forEach(querystringParams, function (key, value) {\n        if (Array.isArray(value)) {\n            value.forEach(function (arrayVal) {\n                params.push(encodeURIComponent(key) + '=' + encodeURIComponent(arrayVal));\n            });\n        } else {\n            params.push(encodeURIComponent(key) + '=' + encodeURIComponent(value));\n        }\n    });\n    return params.length ? '&' + params.join('&') : '';\n};\n/**\n * Decodes a querystring (e.g. ?arg=val&arg2=val2) into a params object (e.g. {arg: 'val', arg2: 'val2'})\n *\n * @param {string} querystring\n * @return {!Object}\n */\nexports.querystringDecode = function (querystring) {\n    var obj = {};\n    var tokens = querystring.replace(/^\\?/, '').split('&');\n    tokens.forEach(function (token) {\n        if (token) {\n            var key = token.split('=');\n            obj[key[0]] = key[1];\n        }\n    });\n    return obj;\n};\n\n//# sourceMappingURL=query.js.map\n\n/***/ }),\n/* 151 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nvar __extends = undefined && undefined.__extends || function () {\n    var extendStatics = Object.setPrototypeOf || { __proto__: [] } instanceof Array && function (d, b) {\n        d.__proto__ = b;\n    } || function (d, b) {\n        for (var p in b) {\n            if (b.hasOwnProperty(p)) d[p] = b[p];\n        }\n    };\n    return function (d, b) {\n        extendStatics(d, b);\n        function __() {\n            this.constructor = d;\n        }\n        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n    };\n}();\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar hash_1 = __webpack_require__(152);\n/**\n * @fileoverview SHA-1 cryptographic hash.\n * Variable names follow the notation in FIPS PUB 180-3:\n * http://csrc.nist.gov/publications/fips/fips180-3/fips180-3_final.pdf.\n *\n * Usage:\n *   var sha1 = new sha1();\n *   sha1.update(bytes);\n *   var hash = sha1.digest();\n *\n * Performance:\n *   Chrome 23:   ~400 Mbit/s\n *   Firefox 16:  ~250 Mbit/s\n *\n */\n/**\n * SHA-1 cryptographic hash constructor.\n *\n * The properties declared here are discussed in the above algorithm document.\n * @constructor\n * @extends {Hash}\n * @final\n * @struct\n */\nvar Sha1 = /** @class */function (_super) {\n    __extends(Sha1, _super);\n    function Sha1() {\n        var _this = _super.call(this) || this;\n        /**\n         * Holds the previous values of accumulated variables a-e in the compress_\n         * function.\n         * @type {!Array<number>}\n         * @private\n         */\n        _this.chain_ = [];\n        /**\n         * A buffer holding the partially computed hash result.\n         * @type {!Array<number>}\n         * @private\n         */\n        _this.buf_ = [];\n        /**\n         * An array of 80 bytes, each a part of the message to be hashed.  Referred to\n         * as the message schedule in the docs.\n         * @type {!Array<number>}\n         * @private\n         */\n        _this.W_ = [];\n        /**\n         * Contains data needed to pad messages less than 64 bytes.\n         * @type {!Array<number>}\n         * @private\n         */\n        _this.pad_ = [];\n        /**\n         * @private {number}\n         */\n        _this.inbuf_ = 0;\n        /**\n         * @private {number}\n         */\n        _this.total_ = 0;\n        _this.blockSize = 512 / 8;\n        _this.pad_[0] = 128;\n        for (var i = 1; i < _this.blockSize; ++i) {\n            _this.pad_[i] = 0;\n        }\n        _this.reset();\n        return _this;\n    }\n    Sha1.prototype.reset = function () {\n        this.chain_[0] = 0x67452301;\n        this.chain_[1] = 0xefcdab89;\n        this.chain_[2] = 0x98badcfe;\n        this.chain_[3] = 0x10325476;\n        this.chain_[4] = 0xc3d2e1f0;\n        this.inbuf_ = 0;\n        this.total_ = 0;\n    };\n    /**\n     * Internal compress helper function.\n     * @param {!Array<number>|!Uint8Array|string} buf Block to compress.\n     * @param {number=} opt_offset Offset of the block in the buffer.\n     * @private\n     */\n    Sha1.prototype.compress_ = function (buf, opt_offset) {\n        if (!opt_offset) {\n            opt_offset = 0;\n        }\n        var W = this.W_;\n        // get 16 big endian words\n        if (typeof buf === 'string') {\n            for (var i = 0; i < 16; i++) {\n                // TODO(user): [bug 8140122] Recent versions of Safari for Mac OS and iOS\n                // have a bug that turns the post-increment ++ operator into pre-increment\n                // during JIT compilation.  We have code that depends heavily on SHA-1 for\n                // correctness and which is affected by this bug, so I've removed all uses\n                // of post-increment ++ in which the result value is used.  We can revert\n                // this change once the Safari bug\n                // (https://bugs.webkit.org/show_bug.cgi?id=109036) has been fixed and\n                // most clients have been updated.\n                W[i] = buf.charCodeAt(opt_offset) << 24 | buf.charCodeAt(opt_offset + 1) << 16 | buf.charCodeAt(opt_offset + 2) << 8 | buf.charCodeAt(opt_offset + 3);\n                opt_offset += 4;\n            }\n        } else {\n            for (var i = 0; i < 16; i++) {\n                W[i] = buf[opt_offset] << 24 | buf[opt_offset + 1] << 16 | buf[opt_offset + 2] << 8 | buf[opt_offset + 3];\n                opt_offset += 4;\n            }\n        }\n        // expand to 80 words\n        for (var i = 16; i < 80; i++) {\n            var t = W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16];\n            W[i] = (t << 1 | t >>> 31) & 0xffffffff;\n        }\n        var a = this.chain_[0];\n        var b = this.chain_[1];\n        var c = this.chain_[2];\n        var d = this.chain_[3];\n        var e = this.chain_[4];\n        var f, k;\n        // TODO(user): Try to unroll this loop to speed up the computation.\n        for (var i = 0; i < 80; i++) {\n            if (i < 40) {\n                if (i < 20) {\n                    f = d ^ b & (c ^ d);\n                    k = 0x5a827999;\n                } else {\n                    f = b ^ c ^ d;\n                    k = 0x6ed9eba1;\n                }\n            } else {\n                if (i < 60) {\n                    f = b & c | d & (b | c);\n                    k = 0x8f1bbcdc;\n                } else {\n                    f = b ^ c ^ d;\n                    k = 0xca62c1d6;\n                }\n            }\n            var t = (a << 5 | a >>> 27) + f + e + k + W[i] & 0xffffffff;\n            e = d;\n            d = c;\n            c = (b << 30 | b >>> 2) & 0xffffffff;\n            b = a;\n            a = t;\n        }\n        this.chain_[0] = this.chain_[0] + a & 0xffffffff;\n        this.chain_[1] = this.chain_[1] + b & 0xffffffff;\n        this.chain_[2] = this.chain_[2] + c & 0xffffffff;\n        this.chain_[3] = this.chain_[3] + d & 0xffffffff;\n        this.chain_[4] = this.chain_[4] + e & 0xffffffff;\n    };\n    Sha1.prototype.update = function (bytes, opt_length) {\n        // TODO(johnlenz): tighten the function signature and remove this check\n        if (bytes == null) {\n            return;\n        }\n        if (opt_length === undefined) {\n            opt_length = bytes.length;\n        }\n        var lengthMinusBlock = opt_length - this.blockSize;\n        var n = 0;\n        // Using local instead of member variables gives ~5% speedup on Firefox 16.\n        var buf = this.buf_;\n        var inbuf = this.inbuf_;\n        // The outer while loop should execute at most twice.\n        while (n < opt_length) {\n            // When we have no data in the block to top up, we can directly process the\n            // input buffer (assuming it contains sufficient data). This gives ~25%\n            // speedup on Chrome 23 and ~15% speedup on Firefox 16, but requires that\n            // the data is provided in large chunks (or in multiples of 64 bytes).\n            if (inbuf == 0) {\n                while (n <= lengthMinusBlock) {\n                    this.compress_(bytes, n);\n                    n += this.blockSize;\n                }\n            }\n            if (typeof bytes === 'string') {\n                while (n < opt_length) {\n                    buf[inbuf] = bytes.charCodeAt(n);\n                    ++inbuf;\n                    ++n;\n                    if (inbuf == this.blockSize) {\n                        this.compress_(buf);\n                        inbuf = 0;\n                        // Jump to the outer loop so we use the full-block optimization.\n                        break;\n                    }\n                }\n            } else {\n                while (n < opt_length) {\n                    buf[inbuf] = bytes[n];\n                    ++inbuf;\n                    ++n;\n                    if (inbuf == this.blockSize) {\n                        this.compress_(buf);\n                        inbuf = 0;\n                        // Jump to the outer loop so we use the full-block optimization.\n                        break;\n                    }\n                }\n            }\n        }\n        this.inbuf_ = inbuf;\n        this.total_ += opt_length;\n    };\n    /** @override */\n    Sha1.prototype.digest = function () {\n        var digest = [];\n        var totalBits = this.total_ * 8;\n        // Add pad 0x80 0x00*.\n        if (this.inbuf_ < 56) {\n            this.update(this.pad_, 56 - this.inbuf_);\n        } else {\n            this.update(this.pad_, this.blockSize - (this.inbuf_ - 56));\n        }\n        // Add # bits.\n        for (var i = this.blockSize - 1; i >= 56; i--) {\n            this.buf_[i] = totalBits & 255;\n            totalBits /= 256; // Don't use bit-shifting here!\n        }\n        this.compress_(this.buf_);\n        var n = 0;\n        for (var i = 0; i < 5; i++) {\n            for (var j = 24; j >= 0; j -= 8) {\n                digest[n] = this.chain_[i] >> j & 255;\n                ++n;\n            }\n        }\n        return digest;\n    };\n    return Sha1;\n}(hash_1.Hash);\nexports.Sha1 = Sha1;\n\n//# sourceMappingURL=sha1.js.map\n\n/***/ }),\n/* 152 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\n// Copyright 2011 The Closure Library Authors. All Rights Reserved.\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n//      http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS-IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n/**\n * @fileoverview Abstract cryptographic hash interface.\n *\n * See Sha1 and Md5 for sample implementations.\n *\n */\n/**\n * Create a cryptographic hash instance.\n *\n * @constructor\n * @struct\n */\nvar Hash = /** @class */function () {\n  function Hash() {\n    /**\n     * The block size for the hasher.\n     * @type {number}\n     */\n    this.blockSize = -1;\n  }\n  return Hash;\n}();\nexports.Hash = Hash;\n\n//# sourceMappingURL=hash.js.map\n\n/***/ }),\n/* 153 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nvar _typeof = typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; };\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\n/**\n * Helper to make a Subscribe function (just like Promise helps make a\n * Thenable).\n *\n * @param executor Function which can make calls to a single Observer\n *     as a proxy.\n * @param onNoObservers Callback when count of Observers goes to zero.\n */\nfunction createSubscribe(executor, onNoObservers) {\n    var proxy = new ObserverProxy(executor, onNoObservers);\n    return proxy.subscribe.bind(proxy);\n}\nexports.createSubscribe = createSubscribe;\n/**\n * Implement fan-out for any number of Observers attached via a subscribe\n * function.\n */\nvar ObserverProxy = /** @class */function () {\n    /**\n     * @param executor Function which can make calls to a single Observer\n     *     as a proxy.\n     * @param onNoObservers Callback when count of Observers goes to zero.\n     */\n    function ObserverProxy(executor, onNoObservers) {\n        var _this = this;\n        this.observers = [];\n        this.unsubscribes = [];\n        this.observerCount = 0;\n        // Micro-task scheduling by calling task.then().\n        this.task = Promise.resolve();\n        this.finalized = false;\n        this.onNoObservers = onNoObservers;\n        // Call the executor asynchronously so subscribers that are called\n        // synchronously after the creation of the subscribe function\n        // can still receive the very first value generated in the executor.\n        this.task.then(function () {\n            executor(_this);\n        }).catch(function (e) {\n            _this.error(e);\n        });\n    }\n    ObserverProxy.prototype.next = function (value) {\n        this.forEachObserver(function (observer) {\n            observer.next(value);\n        });\n    };\n    ObserverProxy.prototype.error = function (error) {\n        this.forEachObserver(function (observer) {\n            observer.error(error);\n        });\n        this.close(error);\n    };\n    ObserverProxy.prototype.complete = function () {\n        this.forEachObserver(function (observer) {\n            observer.complete();\n        });\n        this.close();\n    };\n    /**\n     * Subscribe function that can be used to add an Observer to the fan-out list.\n     *\n     * - We require that no event is sent to a subscriber sychronously to their\n     *   call to subscribe().\n     */\n    ObserverProxy.prototype.subscribe = function (nextOrObserver, error, complete) {\n        var _this = this;\n        var observer;\n        if (nextOrObserver === undefined && error === undefined && complete === undefined) {\n            throw new Error('Missing Observer.');\n        }\n        // Assemble an Observer object when passed as callback functions.\n        if (implementsAnyMethods(nextOrObserver, ['next', 'error', 'complete'])) {\n            observer = nextOrObserver;\n        } else {\n            observer = {\n                next: nextOrObserver,\n                error: error,\n                complete: complete\n            };\n        }\n        if (observer.next === undefined) {\n            observer.next = noop;\n        }\n        if (observer.error === undefined) {\n            observer.error = noop;\n        }\n        if (observer.complete === undefined) {\n            observer.complete = noop;\n        }\n        var unsub = this.unsubscribeOne.bind(this, this.observers.length);\n        // Attempt to subscribe to a terminated Observable - we\n        // just respond to the Observer with the final error or complete\n        // event.\n        if (this.finalized) {\n            this.task.then(function () {\n                try {\n                    if (_this.finalError) {\n                        observer.error(_this.finalError);\n                    } else {\n                        observer.complete();\n                    }\n                } catch (e) {\n                    // nothing\n                }\n                return;\n            });\n        }\n        this.observers.push(observer);\n        return unsub;\n    };\n    // Unsubscribe is synchronous - we guarantee that no events are sent to\n    // any unsubscribed Observer.\n    ObserverProxy.prototype.unsubscribeOne = function (i) {\n        if (this.observers === undefined || this.observers[i] === undefined) {\n            return;\n        }\n        delete this.observers[i];\n        this.observerCount -= 1;\n        if (this.observerCount === 0 && this.onNoObservers !== undefined) {\n            this.onNoObservers(this);\n        }\n    };\n    ObserverProxy.prototype.forEachObserver = function (fn) {\n        if (this.finalized) {\n            // Already closed by previous event....just eat the additional values.\n            return;\n        }\n        // Since sendOne calls asynchronously - there is no chance that\n        // this.observers will become undefined.\n        for (var i = 0; i < this.observers.length; i++) {\n            this.sendOne(i, fn);\n        }\n    };\n    // Call the Observer via one of it's callback function. We are careful to\n    // confirm that the observe has not been unsubscribed since this asynchronous\n    // function had been queued.\n    ObserverProxy.prototype.sendOne = function (i, fn) {\n        var _this = this;\n        // Execute the callback asynchronously\n        this.task.then(function () {\n            if (_this.observers !== undefined && _this.observers[i] !== undefined) {\n                try {\n                    fn(_this.observers[i]);\n                } catch (e) {\n                    // Ignore exceptions raised in Observers or missing methods of an\n                    // Observer.\n                    // Log error to console. b/31404806\n                    if (typeof console !== 'undefined' && console.error) {\n                        console.error(e);\n                    }\n                }\n            }\n        });\n    };\n    ObserverProxy.prototype.close = function (err) {\n        var _this = this;\n        if (this.finalized) {\n            return;\n        }\n        this.finalized = true;\n        if (err !== undefined) {\n            this.finalError = err;\n        }\n        // Proxy is no longer needed - garbage collect references\n        this.task.then(function () {\n            _this.observers = undefined;\n            _this.onNoObservers = undefined;\n        });\n    };\n    return ObserverProxy;\n}();\n/** Turn synchronous function into one called asynchronously. */\nfunction async(fn, onError) {\n    return function () {\n        var args = [];\n        for (var _i = 0; _i < arguments.length; _i++) {\n            args[_i] = arguments[_i];\n        }\n        Promise.resolve(true).then(function () {\n            fn.apply(void 0, args);\n        }).catch(function (error) {\n            if (onError) {\n                onError(error);\n            }\n        });\n    };\n}\nexports.async = async;\n/**\n * Return true if the object passed in implements any of the named methods.\n */\nfunction implementsAnyMethods(obj, methods) {\n    if ((typeof obj === \"undefined\" ? \"undefined\" : _typeof(obj)) !== 'object' || obj === null) {\n        return false;\n    }\n    for (var _i = 0, methods_1 = methods; _i < methods_1.length; _i++) {\n        var method = methods_1[_i];\n        if (method in obj && typeof obj[method] === 'function') {\n            return true;\n        }\n    }\n    return false;\n}\nfunction noop() {}\n// do nothing\n\n\n//# sourceMappingURL=subscribe.js.map\n\n/***/ }),\n/* 154 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nvar _typeof = typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; };\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\n/**\n * Check to make sure the appropriate number of arguments are provided for a public function.\n * Throws an error if it fails.\n *\n * @param {!string} fnName The function name\n * @param {!number} minCount The minimum number of arguments to allow for the function call\n * @param {!number} maxCount The maximum number of argument to allow for the function call\n * @param {!number} argCount The actual number of arguments provided.\n */\nexports.validateArgCount = function (fnName, minCount, maxCount, argCount) {\n    var argError;\n    if (argCount < minCount) {\n        argError = 'at least ' + minCount;\n    } else if (argCount > maxCount) {\n        argError = maxCount === 0 ? 'none' : 'no more than ' + maxCount;\n    }\n    if (argError) {\n        var error = fnName + ' failed: Was called with ' + argCount + (argCount === 1 ? ' argument.' : ' arguments.') + ' Expects ' + argError + '.';\n        throw new Error(error);\n    }\n};\n/**\n * Generates a string to prefix an error message about failed argument validation\n *\n * @param {!string} fnName The function name\n * @param {!number} argumentNumber The index of the argument\n * @param {boolean} optional Whether or not the argument is optional\n * @return {!string} The prefix to add to the error thrown for validation.\n */\nfunction errorPrefix(fnName, argumentNumber, optional) {\n    var argName = '';\n    switch (argumentNumber) {\n        case 1:\n            argName = optional ? 'first' : 'First';\n            break;\n        case 2:\n            argName = optional ? 'second' : 'Second';\n            break;\n        case 3:\n            argName = optional ? 'third' : 'Third';\n            break;\n        case 4:\n            argName = optional ? 'fourth' : 'Fourth';\n            break;\n        default:\n            throw new Error('errorPrefix called with argumentNumber > 4.  Need to update it?');\n    }\n    var error = fnName + ' failed: ';\n    error += argName + ' argument ';\n    return error;\n}\nexports.errorPrefix = errorPrefix;\n/**\n * @param {!string} fnName\n * @param {!number} argumentNumber\n * @param {!string} namespace\n * @param {boolean} optional\n */\nfunction validateNamespace(fnName, argumentNumber, namespace, optional) {\n    if (optional && !namespace) return;\n    if (typeof namespace !== 'string') {\n        //TODO: I should do more validation here. We only allow certain chars in namespaces.\n        throw new Error(errorPrefix(fnName, argumentNumber, optional) + 'must be a valid firebase namespace.');\n    }\n}\nexports.validateNamespace = validateNamespace;\nfunction validateCallback(fnName, argumentNumber, callback, optional) {\n    if (optional && !callback) return;\n    if (typeof callback !== 'function') throw new Error(errorPrefix(fnName, argumentNumber, optional) + 'must be a valid function.');\n}\nexports.validateCallback = validateCallback;\nfunction validateContextObject(fnName, argumentNumber, context, optional) {\n    if (optional && !context) return;\n    if ((typeof context === \"undefined\" ? \"undefined\" : _typeof(context)) !== 'object' || context === null) throw new Error(errorPrefix(fnName, argumentNumber, optional) + 'must be a valid context object.');\n}\nexports.validateContextObject = validateContextObject;\n\n//# sourceMappingURL=validation.js.map\n\n/***/ }),\n/* 155 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar assert_1 = __webpack_require__(79);\n// Code originally came from goog.crypt.stringToUtf8ByteArray, but for some reason they\n// automatically replaced '\\r\\n' with '\\n', and they didn't handle surrogate pairs,\n// so it's been modified.\n// Note that not all Unicode characters appear as single characters in JavaScript strings.\n// fromCharCode returns the UTF-16 encoding of a character - so some Unicode characters\n// use 2 characters in Javascript.  All 4-byte UTF-8 characters begin with a first\n// character in the range 0xD800 - 0xDBFF (the first character of a so-called surrogate\n// pair).\n// See http://www.ecma-international.org/ecma-262/5.1/#sec-15.1.3\n/**\n * @param {string} str\n * @return {Array}\n */\nexports.stringToByteArray = function (str) {\n    var out = [],\n        p = 0;\n    for (var i = 0; i < str.length; i++) {\n        var c = str.charCodeAt(i);\n        // Is this the lead surrogate in a surrogate pair?\n        if (c >= 0xd800 && c <= 0xdbff) {\n            var high = c - 0xd800; // the high 10 bits.\n            i++;\n            assert_1.assert(i < str.length, 'Surrogate pair missing trail surrogate.');\n            var low = str.charCodeAt(i) - 0xdc00; // the low 10 bits.\n            c = 0x10000 + (high << 10) + low;\n        }\n        if (c < 128) {\n            out[p++] = c;\n        } else if (c < 2048) {\n            out[p++] = c >> 6 | 192;\n            out[p++] = c & 63 | 128;\n        } else if (c < 65536) {\n            out[p++] = c >> 12 | 224;\n            out[p++] = c >> 6 & 63 | 128;\n            out[p++] = c & 63 | 128;\n        } else {\n            out[p++] = c >> 18 | 240;\n            out[p++] = c >> 12 & 63 | 128;\n            out[p++] = c >> 6 & 63 | 128;\n            out[p++] = c & 63 | 128;\n        }\n    }\n    return out;\n};\n/**\n * Calculate length without actually converting; useful for doing cheaper validation.\n * @param {string} str\n * @return {number}\n */\nexports.stringLength = function (str) {\n    var p = 0;\n    for (var i = 0; i < str.length; i++) {\n        var c = str.charCodeAt(i);\n        if (c < 128) {\n            p++;\n        } else if (c < 2048) {\n            p += 2;\n        } else if (c >= 0xd800 && c <= 0xdbff) {\n            // Lead surrogate of a surrogate pair.  The pair together will take 4 bytes to represent.\n            p += 4;\n            i++; // skip trail surrogate.\n        } else {\n            p += 3;\n        }\n    }\n    return p;\n};\n\n//# sourceMappingURL=utf8.js.map\n\n/***/ }),\n/* 156 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nmodule.exports = __webpack_require__(157);\n\n/***/ }),\n/* 157 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar app_1 = __webpack_require__(21);\nvar Database_1 = __webpack_require__(83);\nexports.Database = Database_1.Database;\nvar Query_1 = __webpack_require__(87);\nexports.Query = Query_1.Query;\nvar Reference_1 = __webpack_require__(69);\nexports.Reference = Reference_1.Reference;\nvar util_1 = __webpack_require__(2);\nexports.enableLogging = util_1.enableLogging;\nvar RepoManager_1 = __webpack_require__(74);\nvar INTERNAL = __webpack_require__(189);\nvar TEST_ACCESS = __webpack_require__(190);\nvar util_2 = __webpack_require__(0);\nvar ServerValue = Database_1.Database.ServerValue;\nexports.ServerValue = ServerValue;\nfunction registerDatabase(instance) {\n    // Register the Database Service with the 'firebase' namespace.\n    var namespace = instance.INTERNAL.registerService('database', function (app, unused, url) {\n        return RepoManager_1.RepoManager.getInstance().databaseFromApp(app, url);\n    },\n    // firebase.database namespace properties\n    {\n        Reference: Reference_1.Reference,\n        Query: Query_1.Query,\n        Database: Database_1.Database,\n        enableLogging: util_1.enableLogging,\n        INTERNAL: INTERNAL,\n        ServerValue: ServerValue,\n        TEST_ACCESS: TEST_ACCESS\n    }, null, true);\n    if (util_2.isNodeSdk()) {\n        module.exports = namespace;\n    }\n}\nexports.registerDatabase = registerDatabase;\nregisterDatabase(app_1.default);\nvar DataSnapshot_1 = __webpack_require__(70);\nexports.DataSnapshot = DataSnapshot_1.DataSnapshot;\nvar onDisconnect_1 = __webpack_require__(86);\nexports.OnDisconnect = onDisconnect_1.OnDisconnect;\n\n//# sourceMappingURL=index.js.map\n\n/***/ }),\n/* 158 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = __webpack_require__(0);\n/**\n * Wraps a DOM Storage object and:\n * - automatically encode objects as JSON strings before storing them to allow us to store arbitrary types.\n * - prefixes names with \"firebase:\" to avoid collisions with app data.\n *\n * We automatically (see storage.js) create two such wrappers, one for sessionStorage,\n * and one for localStorage.\n *\n * @constructor\n */\nvar DOMStorageWrapper = /** @class */function () {\n    /**\n     * @param {Storage} domStorage_ The underlying storage object (e.g. localStorage or sessionStorage)\n     */\n    function DOMStorageWrapper(domStorage_) {\n        this.domStorage_ = domStorage_;\n        // Use a prefix to avoid collisions with other stuff saved by the app.\n        this.prefix_ = 'firebase:';\n    }\n    /**\n     * @param {string} key The key to save the value under\n     * @param {?Object} value The value being stored, or null to remove the key.\n     */\n    DOMStorageWrapper.prototype.set = function (key, value) {\n        if (value == null) {\n            this.domStorage_.removeItem(this.prefixedName_(key));\n        } else {\n            this.domStorage_.setItem(this.prefixedName_(key), util_1.stringify(value));\n        }\n    };\n    /**\n     * @param {string} key\n     * @return {*} The value that was stored under this key, or null\n     */\n    DOMStorageWrapper.prototype.get = function (key) {\n        var storedVal = this.domStorage_.getItem(this.prefixedName_(key));\n        if (storedVal == null) {\n            return null;\n        } else {\n            return util_1.jsonEval(storedVal);\n        }\n    };\n    /**\n     * @param {string} key\n     */\n    DOMStorageWrapper.prototype.remove = function (key) {\n        this.domStorage_.removeItem(this.prefixedName_(key));\n    };\n    /**\n     * @param {string} name\n     * @return {string}\n     */\n    DOMStorageWrapper.prototype.prefixedName_ = function (name) {\n        return this.prefix_ + name;\n    };\n    DOMStorageWrapper.prototype.toString = function () {\n        return this.domStorage_.toString();\n    };\n    return DOMStorageWrapper;\n}();\nexports.DOMStorageWrapper = DOMStorageWrapper;\n\n//# sourceMappingURL=DOMStorageWrapper.js.map\n\n/***/ }),\n/* 159 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = __webpack_require__(0);\n/**\n * An in-memory storage implementation that matches the API of DOMStorageWrapper\n * (TODO: create interface for both to implement).\n *\n * @constructor\n */\nvar MemoryStorage = /** @class */function () {\n    function MemoryStorage() {\n        this.cache_ = {};\n        this.isInMemoryStorage = true;\n    }\n    MemoryStorage.prototype.set = function (key, value) {\n        if (value == null) {\n            delete this.cache_[key];\n        } else {\n            this.cache_[key] = value;\n        }\n    };\n    MemoryStorage.prototype.get = function (key) {\n        if (util_1.contains(this.cache_, key)) {\n            return this.cache_[key];\n        }\n        return null;\n    };\n    MemoryStorage.prototype.remove = function (key) {\n        delete this.cache_[key];\n    };\n    return MemoryStorage;\n}();\nexports.MemoryStorage = MemoryStorage;\n\n//# sourceMappingURL=MemoryStorage.js.map\n\n/***/ }),\n/* 160 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = __webpack_require__(0);\nvar TransactionResult = /** @class */function () {\n    /**\n     * A type for the resolve value of Firebase.transaction.\n     * @constructor\n     * @dict\n     * @param {boolean} committed\n     * @param {DataSnapshot} snapshot\n     */\n    function TransactionResult(committed, snapshot) {\n        this.committed = committed;\n        this.snapshot = snapshot;\n    }\n    // Do not create public documentation. This is intended to make JSON serialization work but is otherwise unnecessary\n    // for end-users\n    TransactionResult.prototype.toJSON = function () {\n        util_1.validateArgCount('TransactionResult.toJSON', 0, 1, arguments.length);\n        return { committed: this.committed, snapshot: this.snapshot.toJSON() };\n    };\n    return TransactionResult;\n}();\nexports.TransactionResult = TransactionResult;\n\n//# sourceMappingURL=TransactionResult.js.map\n\n/***/ }),\n/* 161 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = __webpack_require__(0);\n/**\n * Fancy ID generator that creates 20-character string identifiers with the\n * following properties:\n *\n * 1. They're based on timestamp so that they sort *after* any existing ids.\n * 2. They contain 72-bits of random data after the timestamp so that IDs won't\n *    collide with other clients' IDs.\n * 3. They sort *lexicographically* (so the timestamp is converted to characters\n *    that will sort properly).\n * 4. They're monotonically increasing. Even if you generate more than one in\n *    the same timestamp, the latter ones will sort after the former ones. We do\n *    this by using the previous random bits but \"incrementing\" them by 1 (only\n *    in the case of a timestamp collision).\n */\nexports.nextPushId = function () {\n    // Modeled after base64 web-safe chars, but ordered by ASCII.\n    var PUSH_CHARS = '-0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz';\n    // Timestamp of last push, used to prevent local collisions if you push twice\n    // in one ms.\n    var lastPushTime = 0;\n    // We generate 72-bits of randomness which get turned into 12 characters and\n    // appended to the timestamp to prevent collisions with other clients. We\n    // store the last characters we generated because in the event of a collision,\n    // we'll use those same characters except \"incremented\" by one.\n    var lastRandChars = [];\n    return function (now) {\n        var duplicateTime = now === lastPushTime;\n        lastPushTime = now;\n        var i;\n        var timeStampChars = new Array(8);\n        for (i = 7; i >= 0; i--) {\n            timeStampChars[i] = PUSH_CHARS.charAt(now % 64);\n            // NOTE: Can't use << here because javascript will convert to int and lose\n            // the upper bits.\n            now = Math.floor(now / 64);\n        }\n        util_1.assert(now === 0, 'Cannot push at time == 0');\n        var id = timeStampChars.join('');\n        if (!duplicateTime) {\n            for (i = 0; i < 12; i++) {\n                lastRandChars[i] = Math.floor(Math.random() * 64);\n            }\n        } else {\n            // If the timestamp hasn't changed since last push, use the same random\n            // number, except incremented by 1.\n            for (i = 11; i >= 0 && lastRandChars[i] === 63; i--) {\n                lastRandChars[i] = 0;\n            }\n            lastRandChars[i]++;\n        }\n        for (i = 0; i < 12; i++) {\n            id += PUSH_CHARS.charAt(lastRandChars[i]);\n        }\n        util_1.assert(id.length === 20, 'nextPushId: Length should be 20.');\n        return id;\n    };\n}();\n\n//# sourceMappingURL=NextPushId.js.map\n\n/***/ }),\n/* 162 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar DataSnapshot_1 = __webpack_require__(70);\nvar Event_1 = __webpack_require__(163);\nvar util_1 = __webpack_require__(0);\nvar util_2 = __webpack_require__(0);\n/**\n * Represents registration for 'value' events.\n */\nvar ValueEventRegistration = /** @class */function () {\n    /**\n     * @param {?function(!DataSnapshot)} callback_\n     * @param {?function(Error)} cancelCallback_\n     * @param {?Object} context_\n     */\n    function ValueEventRegistration(callback_, cancelCallback_, context_) {\n        this.callback_ = callback_;\n        this.cancelCallback_ = cancelCallback_;\n        this.context_ = context_;\n    }\n    /**\n     * @inheritDoc\n     */\n    ValueEventRegistration.prototype.respondsTo = function (eventType) {\n        return eventType === 'value';\n    };\n    /**\n     * @inheritDoc\n     */\n    ValueEventRegistration.prototype.createEvent = function (change, query) {\n        var index = query.getQueryParams().getIndex();\n        return new Event_1.DataEvent('value', this, new DataSnapshot_1.DataSnapshot(change.snapshotNode, query.getRef(), index));\n    };\n    /**\n     * @inheritDoc\n     */\n    ValueEventRegistration.prototype.getEventRunner = function (eventData) {\n        var ctx = this.context_;\n        if (eventData.getEventType() === 'cancel') {\n            util_2.assert(this.cancelCallback_, 'Raising a cancel event on a listener with no cancel callback');\n            var cancelCB_1 = this.cancelCallback_;\n            return function () {\n                // We know that error exists, we checked above that this is a cancel event\n                cancelCB_1.call(ctx, eventData.error);\n            };\n        } else {\n            var cb_1 = this.callback_;\n            return function () {\n                cb_1.call(ctx, eventData.snapshot);\n            };\n        }\n    };\n    /**\n     * @inheritDoc\n     */\n    ValueEventRegistration.prototype.createCancelEvent = function (error, path) {\n        if (this.cancelCallback_) {\n            return new Event_1.CancelEvent(this, error, path);\n        } else {\n            return null;\n        }\n    };\n    /**\n     * @inheritDoc\n     */\n    ValueEventRegistration.prototype.matches = function (other) {\n        if (!(other instanceof ValueEventRegistration)) {\n            return false;\n        } else if (!other.callback_ || !this.callback_) {\n            // If no callback specified, we consider it to match any callback.\n            return true;\n        } else {\n            return other.callback_ === this.callback_ && other.context_ === this.context_;\n        }\n    };\n    /**\n     * @inheritDoc\n     */\n    ValueEventRegistration.prototype.hasAnyCallback = function () {\n        return this.callback_ !== null;\n    };\n    return ValueEventRegistration;\n}();\nexports.ValueEventRegistration = ValueEventRegistration;\n/**\n * Represents the registration of 1 or more child_xxx events.\n *\n * Currently, it is always exactly 1 child_xxx event, but the idea is we might let you\n * register a group of callbacks together in the future.\n *\n * @constructor\n * @implements {EventRegistration}\n */\nvar ChildEventRegistration = /** @class */function () {\n    /**\n     * @param {?Object.<string, function(!DataSnapshot, ?string=)>} callbacks_\n     * @param {?function(Error)} cancelCallback_\n     * @param {Object=} context_\n     */\n    function ChildEventRegistration(callbacks_, cancelCallback_, context_) {\n        this.callbacks_ = callbacks_;\n        this.cancelCallback_ = cancelCallback_;\n        this.context_ = context_;\n    }\n    /**\n     * @inheritDoc\n     */\n    ChildEventRegistration.prototype.respondsTo = function (eventType) {\n        var eventToCheck = eventType === 'children_added' ? 'child_added' : eventType;\n        eventToCheck = eventToCheck === 'children_removed' ? 'child_removed' : eventToCheck;\n        return util_1.contains(this.callbacks_, eventToCheck);\n    };\n    /**\n     * @inheritDoc\n     */\n    ChildEventRegistration.prototype.createCancelEvent = function (error, path) {\n        if (this.cancelCallback_) {\n            return new Event_1.CancelEvent(this, error, path);\n        } else {\n            return null;\n        }\n    };\n    /**\n     * @inheritDoc\n     */\n    ChildEventRegistration.prototype.createEvent = function (change, query) {\n        util_2.assert(change.childName != null, 'Child events should have a childName.');\n        var ref = query.getRef().child( /** @type {!string} */change.childName);\n        var index = query.getQueryParams().getIndex();\n        return new Event_1.DataEvent(change.type, this, new DataSnapshot_1.DataSnapshot(change.snapshotNode, ref, index), change.prevName);\n    };\n    /**\n     * @inheritDoc\n     */\n    ChildEventRegistration.prototype.getEventRunner = function (eventData) {\n        var ctx = this.context_;\n        if (eventData.getEventType() === 'cancel') {\n            util_2.assert(this.cancelCallback_, 'Raising a cancel event on a listener with no cancel callback');\n            var cancelCB_2 = this.cancelCallback_;\n            return function () {\n                // We know that error exists, we checked above that this is a cancel event\n                cancelCB_2.call(ctx, eventData.error);\n            };\n        } else {\n            var cb_2 = this.callbacks_[eventData.eventType];\n            return function () {\n                cb_2.call(ctx, eventData.snapshot, eventData.prevName);\n            };\n        }\n    };\n    /**\n     * @inheritDoc\n     */\n    ChildEventRegistration.prototype.matches = function (other) {\n        if (other instanceof ChildEventRegistration) {\n            if (!this.callbacks_ || !other.callbacks_) {\n                return true;\n            } else if (this.context_ === other.context_) {\n                var otherCount = util_1.getCount(other.callbacks_);\n                var thisCount = util_1.getCount(this.callbacks_);\n                if (otherCount === thisCount) {\n                    // If count is 1, do an exact match on eventType, if either is defined but null, it's a match.\n                    //  If event types don't match, not a match\n                    // If count is not 1, exact match across all\n                    if (otherCount === 1) {\n                        var otherKey /** @type {!string} */ = util_1.getAnyKey(other.callbacks_);\n                        var thisKey /** @type {!string} */ = util_1.getAnyKey(this.callbacks_);\n                        return thisKey === otherKey && (!other.callbacks_[otherKey] || !this.callbacks_[thisKey] || other.callbacks_[otherKey] === this.callbacks_[thisKey]);\n                    } else {\n                        // Exact match on each key.\n                        return util_1.every(this.callbacks_, function (eventType, cb) {\n                            return other.callbacks_[eventType] === cb;\n                        });\n                    }\n                }\n            }\n        }\n        return false;\n    };\n    /**\n     * @inheritDoc\n     */\n    ChildEventRegistration.prototype.hasAnyCallback = function () {\n        return this.callbacks_ !== null;\n    };\n    return ChildEventRegistration;\n}();\nexports.ChildEventRegistration = ChildEventRegistration;\n\n//# sourceMappingURL=EventRegistration.js.map\n\n/***/ }),\n/* 163 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = __webpack_require__(0);\n/**\n * Encapsulates the data needed to raise an event\n * @implements {Event}\n */\nvar DataEvent = /** @class */function () {\n    /**\n     * @param {!string} eventType One of: value, child_added, child_changed, child_moved, child_removed\n     * @param {!EventRegistration} eventRegistration The function to call to with the event data. User provided\n     * @param {!DataSnapshot} snapshot The data backing the event\n     * @param {?string=} prevName Optional, the name of the previous child for child_* events.\n     */\n    function DataEvent(eventType, eventRegistration, snapshot, prevName) {\n        this.eventType = eventType;\n        this.eventRegistration = eventRegistration;\n        this.snapshot = snapshot;\n        this.prevName = prevName;\n    }\n    /**\n     * @inheritDoc\n     */\n    DataEvent.prototype.getPath = function () {\n        var ref = this.snapshot.getRef();\n        if (this.eventType === 'value') {\n            return ref.path;\n        } else {\n            return ref.getParent().path;\n        }\n    };\n    /**\n     * @inheritDoc\n     */\n    DataEvent.prototype.getEventType = function () {\n        return this.eventType;\n    };\n    /**\n     * @inheritDoc\n     */\n    DataEvent.prototype.getEventRunner = function () {\n        return this.eventRegistration.getEventRunner(this);\n    };\n    /**\n     * @inheritDoc\n     */\n    DataEvent.prototype.toString = function () {\n        return this.getPath().toString() + ':' + this.eventType + ':' + util_1.stringify(this.snapshot.exportVal());\n    };\n    return DataEvent;\n}();\nexports.DataEvent = DataEvent;\nvar CancelEvent = /** @class */function () {\n    /**\n     * @param {EventRegistration} eventRegistration\n     * @param {Error} error\n     * @param {!Path} path\n     */\n    function CancelEvent(eventRegistration, error, path) {\n        this.eventRegistration = eventRegistration;\n        this.error = error;\n        this.path = path;\n    }\n    /**\n     * @inheritDoc\n     */\n    CancelEvent.prototype.getPath = function () {\n        return this.path;\n    };\n    /**\n     * @inheritDoc\n     */\n    CancelEvent.prototype.getEventType = function () {\n        return 'cancel';\n    };\n    /**\n     * @inheritDoc\n     */\n    CancelEvent.prototype.getEventRunner = function () {\n        return this.eventRegistration.getEventRunner(this);\n    };\n    /**\n     * @inheritDoc\n     */\n    CancelEvent.prototype.toString = function () {\n        return this.path.toString() + ':cancel';\n    };\n    return CancelEvent;\n}();\nexports.CancelEvent = CancelEvent;\n\n//# sourceMappingURL=Event.js.map\n\n/***/ }),\n/* 164 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = __webpack_require__(0);\nvar util_2 = __webpack_require__(2);\nvar AckUserWrite_1 = __webpack_require__(165);\nvar ChildrenNode_1 = __webpack_require__(7);\nvar util_3 = __webpack_require__(0);\nvar ImmutableTree_1 = __webpack_require__(71);\nvar ListenComplete_1 = __webpack_require__(166);\nvar Merge_1 = __webpack_require__(167);\nvar Operation_1 = __webpack_require__(12);\nvar Overwrite_1 = __webpack_require__(97);\nvar Path_1 = __webpack_require__(4);\nvar SyncPoint_1 = __webpack_require__(98);\nvar WriteTree_1 = __webpack_require__(173);\n/**\n * SyncTree is the central class for managing event callback registration, data caching, views\n * (query processing), and event generation.  There are typically two SyncTree instances for\n * each Repo, one for the normal Firebase data, and one for the .info data.\n *\n * It has a number of responsibilities, including:\n *  - Tracking all user event callbacks (registered via addEventRegistration() and removeEventRegistration()).\n *  - Applying and caching data changes for user set(), transaction(), and update() calls\n *    (applyUserOverwrite(), applyUserMerge()).\n *  - Applying and caching data changes for server data changes (applyServerOverwrite(),\n *    applyServerMerge()).\n *  - Generating user-facing events for server and user changes (all of the apply* methods\n *    return the set of events that need to be raised as a result).\n *  - Maintaining the appropriate set of server listens to ensure we are always subscribed\n *    to the correct set of paths and queries to satisfy the current set of user event\n *    callbacks (listens are started/stopped using the provided listenProvider).\n *\n * NOTE: Although SyncTree tracks event callbacks and calculates events to raise, the actual\n * events are returned to the caller rather than raised synchronously.\n *\n * @constructor\n */\nvar SyncTree = /** @class */function () {\n    /**\n     * @param {!ListenProvider} listenProvider_ Used by SyncTree to start / stop listening\n     *   to server data.\n     */\n    function SyncTree(listenProvider_) {\n        this.listenProvider_ = listenProvider_;\n        /**\n         * Tree of SyncPoints.  There's a SyncPoint at any location that has 1 or more views.\n         * @type {!ImmutableTree.<!SyncPoint>}\n         * @private\n         */\n        this.syncPointTree_ = ImmutableTree_1.ImmutableTree.Empty;\n        /**\n         * A tree of all pending user writes (user-initiated set()'s, transaction()'s, update()'s, etc.).\n         * @type {!WriteTree}\n         * @private\n         */\n        this.pendingWriteTree_ = new WriteTree_1.WriteTree();\n        this.tagToQueryMap_ = {};\n        this.queryToTagMap_ = {};\n    }\n    /**\n     * Apply the data changes for a user-generated set() or transaction() call.\n     *\n     * @param {!Path} path\n     * @param {!Node} newData\n     * @param {number} writeId\n     * @param {boolean=} visible\n     * @return {!Array.<!Event>} Events to raise.\n     */\n    SyncTree.prototype.applyUserOverwrite = function (path, newData, writeId, visible) {\n        // Record pending write.\n        this.pendingWriteTree_.addOverwrite(path, newData, writeId, visible);\n        if (!visible) {\n            return [];\n        } else {\n            return this.applyOperationToSyncPoints_(new Overwrite_1.Overwrite(Operation_1.OperationSource.User, path, newData));\n        }\n    };\n    /**\n     * Apply the data from a user-generated update() call\n     *\n     * @param {!Path} path\n     * @param {!Object.<string, !Node>} changedChildren\n     * @param {!number} writeId\n     * @return {!Array.<!Event>} Events to raise.\n     */\n    SyncTree.prototype.applyUserMerge = function (path, changedChildren, writeId) {\n        // Record pending merge.\n        this.pendingWriteTree_.addMerge(path, changedChildren, writeId);\n        var changeTree = ImmutableTree_1.ImmutableTree.fromObject(changedChildren);\n        return this.applyOperationToSyncPoints_(new Merge_1.Merge(Operation_1.OperationSource.User, path, changeTree));\n    };\n    /**\n     * Acknowledge a pending user write that was previously registered with applyUserOverwrite() or applyUserMerge().\n     *\n     * @param {!number} writeId\n     * @param {boolean=} revert True if the given write failed and needs to be reverted\n     * @return {!Array.<!Event>} Events to raise.\n     */\n    SyncTree.prototype.ackUserWrite = function (writeId, revert) {\n        if (revert === void 0) {\n            revert = false;\n        }\n        var write = this.pendingWriteTree_.getWrite(writeId);\n        var needToReevaluate = this.pendingWriteTree_.removeWrite(writeId);\n        if (!needToReevaluate) {\n            return [];\n        } else {\n            var affectedTree_1 = ImmutableTree_1.ImmutableTree.Empty;\n            if (write.snap != null) {\n                // overwrite\n                affectedTree_1 = affectedTree_1.set(Path_1.Path.Empty, true);\n            } else {\n                util_3.forEach(write.children, function (pathString, node) {\n                    affectedTree_1 = affectedTree_1.set(new Path_1.Path(pathString), node);\n                });\n            }\n            return this.applyOperationToSyncPoints_(new AckUserWrite_1.AckUserWrite(write.path, affectedTree_1, revert));\n        }\n    };\n    /**\n     * Apply new server data for the specified path..\n     *\n     * @param {!Path} path\n     * @param {!Node} newData\n     * @return {!Array.<!Event>} Events to raise.\n     */\n    SyncTree.prototype.applyServerOverwrite = function (path, newData) {\n        return this.applyOperationToSyncPoints_(new Overwrite_1.Overwrite(Operation_1.OperationSource.Server, path, newData));\n    };\n    /**\n     * Apply new server data to be merged in at the specified path.\n     *\n     * @param {!Path} path\n     * @param {!Object.<string, !Node>} changedChildren\n     * @return {!Array.<!Event>} Events to raise.\n     */\n    SyncTree.prototype.applyServerMerge = function (path, changedChildren) {\n        var changeTree = ImmutableTree_1.ImmutableTree.fromObject(changedChildren);\n        return this.applyOperationToSyncPoints_(new Merge_1.Merge(Operation_1.OperationSource.Server, path, changeTree));\n    };\n    /**\n     * Apply a listen complete for a query\n     *\n     * @param {!Path} path\n     * @return {!Array.<!Event>} Events to raise.\n     */\n    SyncTree.prototype.applyListenComplete = function (path) {\n        return this.applyOperationToSyncPoints_(new ListenComplete_1.ListenComplete(Operation_1.OperationSource.Server, path));\n    };\n    /**\n     * Apply new server data for the specified tagged query.\n     *\n     * @param {!Path} path\n     * @param {!Node} snap\n     * @param {!number} tag\n     * @return {!Array.<!Event>} Events to raise.\n     */\n    SyncTree.prototype.applyTaggedQueryOverwrite = function (path, snap, tag) {\n        var queryKey = this.queryKeyForTag_(tag);\n        if (queryKey != null) {\n            var r = SyncTree.parseQueryKey_(queryKey);\n            var queryPath = r.path,\n                queryId = r.queryId;\n            var relativePath = Path_1.Path.relativePath(queryPath, path);\n            var op = new Overwrite_1.Overwrite(Operation_1.OperationSource.forServerTaggedQuery(queryId), relativePath, snap);\n            return this.applyTaggedOperation_(queryPath, op);\n        } else {\n            // Query must have been removed already\n            return [];\n        }\n    };\n    /**\n     * Apply server data to be merged in for the specified tagged query.\n     *\n     * @param {!Path} path\n     * @param {!Object.<string, !Node>} changedChildren\n     * @param {!number} tag\n     * @return {!Array.<!Event>} Events to raise.\n     */\n    SyncTree.prototype.applyTaggedQueryMerge = function (path, changedChildren, tag) {\n        var queryKey = this.queryKeyForTag_(tag);\n        if (queryKey) {\n            var r = SyncTree.parseQueryKey_(queryKey);\n            var queryPath = r.path,\n                queryId = r.queryId;\n            var relativePath = Path_1.Path.relativePath(queryPath, path);\n            var changeTree = ImmutableTree_1.ImmutableTree.fromObject(changedChildren);\n            var op = new Merge_1.Merge(Operation_1.OperationSource.forServerTaggedQuery(queryId), relativePath, changeTree);\n            return this.applyTaggedOperation_(queryPath, op);\n        } else {\n            // We've already removed the query. No big deal, ignore the update\n            return [];\n        }\n    };\n    /**\n     * Apply a listen complete for a tagged query\n     *\n     * @param {!Path} path\n     * @param {!number} tag\n     * @return {!Array.<!Event>} Events to raise.\n     */\n    SyncTree.prototype.applyTaggedListenComplete = function (path, tag) {\n        var queryKey = this.queryKeyForTag_(tag);\n        if (queryKey) {\n            var r = SyncTree.parseQueryKey_(queryKey);\n            var queryPath = r.path,\n                queryId = r.queryId;\n            var relativePath = Path_1.Path.relativePath(queryPath, path);\n            var op = new ListenComplete_1.ListenComplete(Operation_1.OperationSource.forServerTaggedQuery(queryId), relativePath);\n            return this.applyTaggedOperation_(queryPath, op);\n        } else {\n            // We've already removed the query. No big deal, ignore the update\n            return [];\n        }\n    };\n    /**\n     * Add an event callback for the specified query.\n     *\n     * @param {!Query} query\n     * @param {!EventRegistration} eventRegistration\n     * @return {!Array.<!Event>} Events to raise.\n     */\n    SyncTree.prototype.addEventRegistration = function (query, eventRegistration) {\n        var path = query.path;\n        var serverCache = null;\n        var foundAncestorDefaultView = false;\n        // Any covering writes will necessarily be at the root, so really all we need to find is the server cache.\n        // Consider optimizing this once there's a better understanding of what actual behavior will be.\n        this.syncPointTree_.foreachOnPath(path, function (pathToSyncPoint, sp) {\n            var relativePath = Path_1.Path.relativePath(pathToSyncPoint, path);\n            serverCache = serverCache || sp.getCompleteServerCache(relativePath);\n            foundAncestorDefaultView = foundAncestorDefaultView || sp.hasCompleteView();\n        });\n        var syncPoint = this.syncPointTree_.get(path);\n        if (!syncPoint) {\n            syncPoint = new SyncPoint_1.SyncPoint();\n            this.syncPointTree_ = this.syncPointTree_.set(path, syncPoint);\n        } else {\n            foundAncestorDefaultView = foundAncestorDefaultView || syncPoint.hasCompleteView();\n            serverCache = serverCache || syncPoint.getCompleteServerCache(Path_1.Path.Empty);\n        }\n        var serverCacheComplete;\n        if (serverCache != null) {\n            serverCacheComplete = true;\n        } else {\n            serverCacheComplete = false;\n            serverCache = ChildrenNode_1.ChildrenNode.EMPTY_NODE;\n            var subtree = this.syncPointTree_.subtree(path);\n            subtree.foreachChild(function (childName, childSyncPoint) {\n                var completeCache = childSyncPoint.getCompleteServerCache(Path_1.Path.Empty);\n                if (completeCache) {\n                    serverCache = serverCache.updateImmediateChild(childName, completeCache);\n                }\n            });\n        }\n        var viewAlreadyExists = syncPoint.viewExistsForQuery(query);\n        if (!viewAlreadyExists && !query.getQueryParams().loadsAllData()) {\n            // We need to track a tag for this query\n            var queryKey = SyncTree.makeQueryKey_(query);\n            util_1.assert(!(queryKey in this.queryToTagMap_), 'View does not exist, but we have a tag');\n            var tag = SyncTree.getNextQueryTag_();\n            this.queryToTagMap_[queryKey] = tag;\n            // Coerce to string to avoid sparse arrays.\n            this.tagToQueryMap_['_' + tag] = queryKey;\n        }\n        var writesCache = this.pendingWriteTree_.childWrites(path);\n        var events = syncPoint.addEventRegistration(query, eventRegistration, writesCache, serverCache, serverCacheComplete);\n        if (!viewAlreadyExists && !foundAncestorDefaultView) {\n            var view /** @type !View */ = syncPoint.viewForQuery(query);\n            events = events.concat(this.setupListener_(query, view));\n        }\n        return events;\n    };\n    /**\n     * Remove event callback(s).\n     *\n     * If query is the default query, we'll check all queries for the specified eventRegistration.\n     * If eventRegistration is null, we'll remove all callbacks for the specified query/queries.\n     *\n     * @param {!Query} query\n     * @param {?EventRegistration} eventRegistration If null, all callbacks are removed.\n     * @param {Error=} cancelError If a cancelError is provided, appropriate cancel events will be returned.\n     * @return {!Array.<!Event>} Cancel events, if cancelError was provided.\n     */\n    SyncTree.prototype.removeEventRegistration = function (query, eventRegistration, cancelError) {\n        var _this = this;\n        // Find the syncPoint first. Then deal with whether or not it has matching listeners\n        var path = query.path;\n        var maybeSyncPoint = this.syncPointTree_.get(path);\n        var cancelEvents = [];\n        // A removal on a default query affects all queries at that location. A removal on an indexed query, even one without\n        // other query constraints, does *not* affect all queries at that location. So this check must be for 'default', and\n        // not loadsAllData().\n        if (maybeSyncPoint && (query.queryIdentifier() === 'default' || maybeSyncPoint.viewExistsForQuery(query))) {\n            /**\n             * @type {{removed: !Array.<!Query>, events: !Array.<!Event>}}\n             */\n            var removedAndEvents = maybeSyncPoint.removeEventRegistration(query, eventRegistration, cancelError);\n            if (maybeSyncPoint.isEmpty()) {\n                this.syncPointTree_ = this.syncPointTree_.remove(path);\n            }\n            var removed = removedAndEvents.removed;\n            cancelEvents = removedAndEvents.events;\n            // We may have just removed one of many listeners and can short-circuit this whole process\n            // We may also not have removed a default listener, in which case all of the descendant listeners should already be\n            // properly set up.\n            //\n            // Since indexed queries can shadow if they don't have other query constraints, check for loadsAllData(), instead of\n            // queryId === 'default'\n            var removingDefault = -1 !== removed.findIndex(function (query) {\n                return query.getQueryParams().loadsAllData();\n            });\n            var covered = this.syncPointTree_.findOnPath(path, function (relativePath, parentSyncPoint) {\n                return parentSyncPoint.hasCompleteView();\n            });\n            if (removingDefault && !covered) {\n                var subtree = this.syncPointTree_.subtree(path);\n                // There are potentially child listeners. Determine what if any listens we need to send before executing the\n                // removal\n                if (!subtree.isEmpty()) {\n                    // We need to fold over our subtree and collect the listeners to send\n                    var newViews = this.collectDistinctViewsForSubTree_(subtree);\n                    // Ok, we've collected all the listens we need. Set them up.\n                    for (var i = 0; i < newViews.length; ++i) {\n                        var view = newViews[i],\n                            newQuery = view.getQuery();\n                        var listener = this.createListenerForView_(view);\n                        this.listenProvider_.startListening(SyncTree.queryForListening_(newQuery), this.tagForQuery_(newQuery), listener.hashFn, listener.onComplete);\n                    }\n                } else {\n                    // There's nothing below us, so nothing we need to start listening on\n                }\n            }\n            // If we removed anything and we're not covered by a higher up listen, we need to stop listening on this query\n            // The above block has us covered in terms of making sure we're set up on listens lower in the tree.\n            // Also, note that if we have a cancelError, it's already been removed at the provider level.\n            if (!covered && removed.length > 0 && !cancelError) {\n                // If we removed a default, then we weren't listening on any of the other queries here. Just cancel the one\n                // default. Otherwise, we need to iterate through and cancel each individual query\n                if (removingDefault) {\n                    // We don't tag default listeners\n                    var defaultTag = null;\n                    this.listenProvider_.stopListening(SyncTree.queryForListening_(query), defaultTag);\n                } else {\n                    removed.forEach(function (queryToRemove) {\n                        var tagToRemove = _this.queryToTagMap_[SyncTree.makeQueryKey_(queryToRemove)];\n                        _this.listenProvider_.stopListening(SyncTree.queryForListening_(queryToRemove), tagToRemove);\n                    });\n                }\n            }\n            // Now, clear all of the tags we're tracking for the removed listens\n            this.removeTags_(removed);\n        } else {\n            // No-op, this listener must've been already removed\n        }\n        return cancelEvents;\n    };\n    /**\n     * Returns a complete cache, if we have one, of the data at a particular path. The location must have a listener above\n     * it, but as this is only used by transaction code, that should always be the case anyways.\n     *\n     * Note: this method will *include* hidden writes from transaction with applyLocally set to false.\n     * @param {!Path} path The path to the data we want\n     * @param {Array.<number>=} writeIdsToExclude A specific set to be excluded\n     * @return {?Node}\n     */\n    SyncTree.prototype.calcCompleteEventCache = function (path, writeIdsToExclude) {\n        var includeHiddenSets = true;\n        var writeTree = this.pendingWriteTree_;\n        var serverCache = this.syncPointTree_.findOnPath(path, function (pathSoFar, syncPoint) {\n            var relativePath = Path_1.Path.relativePath(pathSoFar, path);\n            var serverCache = syncPoint.getCompleteServerCache(relativePath);\n            if (serverCache) {\n                return serverCache;\n            }\n        });\n        return writeTree.calcCompleteEventCache(path, serverCache, writeIdsToExclude, includeHiddenSets);\n    };\n    /**\n     * This collapses multiple unfiltered views into a single view, since we only need a single\n     * listener for them.\n     *\n     * @param {!ImmutableTree.<!SyncPoint>} subtree\n     * @return {!Array.<!View>}\n     * @private\n     */\n    SyncTree.prototype.collectDistinctViewsForSubTree_ = function (subtree) {\n        return subtree.fold(function (relativePath, maybeChildSyncPoint, childMap) {\n            if (maybeChildSyncPoint && maybeChildSyncPoint.hasCompleteView()) {\n                var completeView = maybeChildSyncPoint.getCompleteView();\n                return [completeView];\n            } else {\n                // No complete view here, flatten any deeper listens into an array\n                var views_1 = [];\n                if (maybeChildSyncPoint) {\n                    views_1 = maybeChildSyncPoint.getQueryViews();\n                }\n                util_3.forEach(childMap, function (key, childViews) {\n                    views_1 = views_1.concat(childViews);\n                });\n                return views_1;\n            }\n        });\n    };\n    /**\n     * @param {!Array.<!Query>} queries\n     * @private\n     */\n    SyncTree.prototype.removeTags_ = function (queries) {\n        for (var j = 0; j < queries.length; ++j) {\n            var removedQuery = queries[j];\n            if (!removedQuery.getQueryParams().loadsAllData()) {\n                // We should have a tag for this\n                var removedQueryKey = SyncTree.makeQueryKey_(removedQuery);\n                var removedQueryTag = this.queryToTagMap_[removedQueryKey];\n                delete this.queryToTagMap_[removedQueryKey];\n                delete this.tagToQueryMap_['_' + removedQueryTag];\n            }\n        }\n    };\n    /**\n     * Normalizes a query to a query we send the server for listening\n     * @param {!Query} query\n     * @return {!Query} The normalized query\n     * @private\n     */\n    SyncTree.queryForListening_ = function (query) {\n        if (query.getQueryParams().loadsAllData() && !query.getQueryParams().isDefault()) {\n            // We treat queries that load all data as default queries\n            // Cast is necessary because ref() technically returns Firebase which is actually fb.api.Firebase which inherits\n            // from Query\n            return (/** @type {!Query} */query.getRef()\n            );\n        } else {\n            return query;\n        }\n    };\n    /**\n     * For a given new listen, manage the de-duplication of outstanding subscriptions.\n     *\n     * @param {!Query} query\n     * @param {!View} view\n     * @return {!Array.<!Event>} This method can return events to support synchronous data sources\n     * @private\n     */\n    SyncTree.prototype.setupListener_ = function (query, view) {\n        var path = query.path;\n        var tag = this.tagForQuery_(query);\n        var listener = this.createListenerForView_(view);\n        var events = this.listenProvider_.startListening(SyncTree.queryForListening_(query), tag, listener.hashFn, listener.onComplete);\n        var subtree = this.syncPointTree_.subtree(path);\n        // The root of this subtree has our query. We're here because we definitely need to send a listen for that, but we\n        // may need to shadow other listens as well.\n        if (tag) {\n            util_1.assert(!subtree.value.hasCompleteView(), \"If we're adding a query, it shouldn't be shadowed\");\n        } else {\n            // Shadow everything at or below this location, this is a default listener.\n            var queriesToStop = subtree.fold(function (relativePath, maybeChildSyncPoint, childMap) {\n                if (!relativePath.isEmpty() && maybeChildSyncPoint && maybeChildSyncPoint.hasCompleteView()) {\n                    return [maybeChildSyncPoint.getCompleteView().getQuery()];\n                } else {\n                    // No default listener here, flatten any deeper queries into an array\n                    var queries_1 = [];\n                    if (maybeChildSyncPoint) {\n                        queries_1 = queries_1.concat(maybeChildSyncPoint.getQueryViews().map(function (view) {\n                            return view.getQuery();\n                        }));\n                    }\n                    util_3.forEach(childMap, function (key, childQueries) {\n                        queries_1 = queries_1.concat(childQueries);\n                    });\n                    return queries_1;\n                }\n            });\n            for (var i = 0; i < queriesToStop.length; ++i) {\n                var queryToStop = queriesToStop[i];\n                this.listenProvider_.stopListening(SyncTree.queryForListening_(queryToStop), this.tagForQuery_(queryToStop));\n            }\n        }\n        return events;\n    };\n    /**\n     *\n     * @param {!View} view\n     * @return {{hashFn: function(), onComplete: function(!string, *)}}\n     * @private\n     */\n    SyncTree.prototype.createListenerForView_ = function (view) {\n        var _this = this;\n        var query = view.getQuery();\n        var tag = this.tagForQuery_(query);\n        return {\n            hashFn: function hashFn() {\n                var cache = view.getServerCache() || ChildrenNode_1.ChildrenNode.EMPTY_NODE;\n                return cache.hash();\n            },\n            onComplete: function onComplete(status) {\n                if (status === 'ok') {\n                    if (tag) {\n                        return _this.applyTaggedListenComplete(query.path, tag);\n                    } else {\n                        return _this.applyListenComplete(query.path);\n                    }\n                } else {\n                    // If a listen failed, kill all of the listeners here, not just the one that triggered the error.\n                    // Note that this may need to be scoped to just this listener if we change permissions on filtered children\n                    var error = util_2.errorForServerCode(status, query);\n                    return _this.removeEventRegistration(query,\n                    /*eventRegistration*/null, error);\n                }\n            }\n        };\n    };\n    /**\n     * Given a query, computes a \"queryKey\" suitable for use in our queryToTagMap_.\n     * @private\n     * @param {!Query} query\n     * @return {string}\n     */\n    SyncTree.makeQueryKey_ = function (query) {\n        return query.path.toString() + '$' + query.queryIdentifier();\n    };\n    /**\n     * Given a queryKey (created by makeQueryKey), parse it back into a path and queryId.\n     * @private\n     * @param {!string} queryKey\n     * @return {{queryId: !string, path: !Path}}\n     */\n    SyncTree.parseQueryKey_ = function (queryKey) {\n        var splitIndex = queryKey.indexOf('$');\n        util_1.assert(splitIndex !== -1 && splitIndex < queryKey.length - 1, 'Bad queryKey.');\n        return {\n            queryId: queryKey.substr(splitIndex + 1),\n            path: new Path_1.Path(queryKey.substr(0, splitIndex))\n        };\n    };\n    /**\n     * Return the query associated with the given tag, if we have one\n     * @param {!number} tag\n     * @return {?string}\n     * @private\n     */\n    SyncTree.prototype.queryKeyForTag_ = function (tag) {\n        return this.tagToQueryMap_['_' + tag];\n    };\n    /**\n     * Return the tag associated with the given query.\n     * @param {!Query} query\n     * @return {?number}\n     * @private\n     */\n    SyncTree.prototype.tagForQuery_ = function (query) {\n        var queryKey = SyncTree.makeQueryKey_(query);\n        return util_3.safeGet(this.queryToTagMap_, queryKey);\n    };\n    /**\n     * Static accessor for query tags.\n     * @return {number}\n     * @private\n     */\n    SyncTree.getNextQueryTag_ = function () {\n        return SyncTree.nextQueryTag_++;\n    };\n    /**\n     * A helper method to apply tagged operations\n     *\n     * @param {!Path} queryPath\n     * @param {!Operation} operation\n     * @return {!Array.<!Event>}\n     * @private\n     */\n    SyncTree.prototype.applyTaggedOperation_ = function (queryPath, operation) {\n        var syncPoint = this.syncPointTree_.get(queryPath);\n        util_1.assert(syncPoint, \"Missing sync point for query tag that we're tracking\");\n        var writesCache = this.pendingWriteTree_.childWrites(queryPath);\n        return syncPoint.applyOperation(operation, writesCache,\n        /*serverCache=*/null);\n    };\n    /**\n     * A helper method that visits all descendant and ancestor SyncPoints, applying the operation.\n     *\n     * NOTES:\n     * - Descendant SyncPoints will be visited first (since we raise events depth-first).\n        * - We call applyOperation() on each SyncPoint passing three things:\n     *   1. A version of the Operation that has been made relative to the SyncPoint location.\n     *   2. A WriteTreeRef of any writes we have cached at the SyncPoint location.\n     *   3. A snapshot Node with cached server data, if we have it.\n        * - We concatenate all of the events returned by each SyncPoint and return the result.\n     *\n     * @param {!Operation} operation\n     * @return {!Array.<!Event>}\n     * @private\n     */\n    SyncTree.prototype.applyOperationToSyncPoints_ = function (operation) {\n        return this.applyOperationHelper_(operation, this.syncPointTree_,\n        /*serverCache=*/null, this.pendingWriteTree_.childWrites(Path_1.Path.Empty));\n    };\n    /**\n     * Recursive helper for applyOperationToSyncPoints_\n     *\n     * @private\n     * @param {!Operation} operation\n     * @param {ImmutableTree.<!SyncPoint>} syncPointTree\n     * @param {?Node} serverCache\n     * @param {!WriteTreeRef} writesCache\n     * @return {!Array.<!Event>}\n     */\n    SyncTree.prototype.applyOperationHelper_ = function (operation, syncPointTree, serverCache, writesCache) {\n        if (operation.path.isEmpty()) {\n            return this.applyOperationDescendantsHelper_(operation, syncPointTree, serverCache, writesCache);\n        } else {\n            var syncPoint = syncPointTree.get(Path_1.Path.Empty);\n            // If we don't have cached server data, see if we can get it from this SyncPoint.\n            if (serverCache == null && syncPoint != null) {\n                serverCache = syncPoint.getCompleteServerCache(Path_1.Path.Empty);\n            }\n            var events = [];\n            var childName = operation.path.getFront();\n            var childOperation = operation.operationForChild(childName);\n            var childTree = syncPointTree.children.get(childName);\n            if (childTree && childOperation) {\n                var childServerCache = serverCache ? serverCache.getImmediateChild(childName) : null;\n                var childWritesCache = writesCache.child(childName);\n                events = events.concat(this.applyOperationHelper_(childOperation, childTree, childServerCache, childWritesCache));\n            }\n            if (syncPoint) {\n                events = events.concat(syncPoint.applyOperation(operation, writesCache, serverCache));\n            }\n            return events;\n        }\n    };\n    /**\n     * Recursive helper for applyOperationToSyncPoints_\n     *\n     * @private\n     * @param {!Operation} operation\n     * @param {ImmutableTree.<!SyncPoint>} syncPointTree\n     * @param {?Node} serverCache\n     * @param {!WriteTreeRef} writesCache\n     * @return {!Array.<!Event>}\n     */\n    SyncTree.prototype.applyOperationDescendantsHelper_ = function (operation, syncPointTree, serverCache, writesCache) {\n        var _this = this;\n        var syncPoint = syncPointTree.get(Path_1.Path.Empty);\n        // If we don't have cached server data, see if we can get it from this SyncPoint.\n        if (serverCache == null && syncPoint != null) {\n            serverCache = syncPoint.getCompleteServerCache(Path_1.Path.Empty);\n        }\n        var events = [];\n        syncPointTree.children.inorderTraversal(function (childName, childTree) {\n            var childServerCache = serverCache ? serverCache.getImmediateChild(childName) : null;\n            var childWritesCache = writesCache.child(childName);\n            var childOperation = operation.operationForChild(childName);\n            if (childOperation) {\n                events = events.concat(_this.applyOperationDescendantsHelper_(childOperation, childTree, childServerCache, childWritesCache));\n            }\n        });\n        if (syncPoint) {\n            events = events.concat(syncPoint.applyOperation(operation, writesCache, serverCache));\n        }\n        return events;\n    };\n    /**\n     * Static tracker for next query tag.\n     * @type {number}\n     * @private\n     */\n    SyncTree.nextQueryTag_ = 1;\n    return SyncTree;\n}();\nexports.SyncTree = SyncTree;\n\n//# sourceMappingURL=SyncTree.js.map\n\n/***/ }),\n/* 165 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = __webpack_require__(0);\nvar Path_1 = __webpack_require__(4);\nvar Operation_1 = __webpack_require__(12);\nvar AckUserWrite = /** @class */function () {\n    /**\n     *\n     * @param {!Path} path\n     * @param {!ImmutableTree<!boolean>} affectedTree A tree containing true for each affected path. Affected paths can't overlap.\n     * @param {!boolean} revert\n     */\n    function AckUserWrite(\n    /**@inheritDoc */path,\n    /**@inheritDoc */affectedTree,\n    /**@inheritDoc */revert) {\n        this.path = path;\n        this.affectedTree = affectedTree;\n        this.revert = revert;\n        /** @inheritDoc */\n        this.type = Operation_1.OperationType.ACK_USER_WRITE;\n        /** @inheritDoc */\n        this.source = Operation_1.OperationSource.User;\n    }\n    /**\n     * @inheritDoc\n     */\n    AckUserWrite.prototype.operationForChild = function (childName) {\n        if (!this.path.isEmpty()) {\n            util_1.assert(this.path.getFront() === childName, 'operationForChild called for unrelated child.');\n            return new AckUserWrite(this.path.popFront(), this.affectedTree, this.revert);\n        } else if (this.affectedTree.value != null) {\n            util_1.assert(this.affectedTree.children.isEmpty(), 'affectedTree should not have overlapping affected paths.');\n            // All child locations are affected as well; just return same operation.\n            return this;\n        } else {\n            var childTree = this.affectedTree.subtree(new Path_1.Path(childName));\n            return new AckUserWrite(Path_1.Path.Empty, childTree, this.revert);\n        }\n    };\n    return AckUserWrite;\n}();\nexports.AckUserWrite = AckUserWrite;\n\n//# sourceMappingURL=AckUserWrite.js.map\n\n/***/ }),\n/* 166 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar Path_1 = __webpack_require__(4);\nvar Operation_1 = __webpack_require__(12);\n/**\n * @param {!OperationSource} source\n * @param {!Path} path\n * @constructor\n * @implements {Operation}\n */\nvar ListenComplete = /** @class */function () {\n    function ListenComplete(source, path) {\n        this.source = source;\n        this.path = path;\n        /** @inheritDoc */\n        this.type = Operation_1.OperationType.LISTEN_COMPLETE;\n    }\n    ListenComplete.prototype.operationForChild = function (childName) {\n        if (this.path.isEmpty()) {\n            return new ListenComplete(this.source, Path_1.Path.Empty);\n        } else {\n            return new ListenComplete(this.source, this.path.popFront());\n        }\n    };\n    return ListenComplete;\n}();\nexports.ListenComplete = ListenComplete;\n\n//# sourceMappingURL=ListenComplete.js.map\n\n/***/ }),\n/* 167 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar Operation_1 = __webpack_require__(12);\nvar Overwrite_1 = __webpack_require__(97);\nvar Path_1 = __webpack_require__(4);\nvar util_1 = __webpack_require__(0);\n/**\n * @param {!OperationSource} source\n * @param {!Path} path\n * @param {!ImmutableTree.<!Node>} children\n * @constructor\n * @implements {Operation}\n */\nvar Merge = /** @class */function () {\n    function Merge(\n    /**@inheritDoc */source,\n    /**@inheritDoc */path,\n    /**@inheritDoc */children) {\n        this.source = source;\n        this.path = path;\n        this.children = children;\n        /** @inheritDoc */\n        this.type = Operation_1.OperationType.MERGE;\n    }\n    /**\n     * @inheritDoc\n     */\n    Merge.prototype.operationForChild = function (childName) {\n        if (this.path.isEmpty()) {\n            var childTree = this.children.subtree(new Path_1.Path(childName));\n            if (childTree.isEmpty()) {\n                // This child is unaffected\n                return null;\n            } else if (childTree.value) {\n                // We have a snapshot for the child in question.  This becomes an overwrite of the child.\n                return new Overwrite_1.Overwrite(this.source, Path_1.Path.Empty, childTree.value);\n            } else {\n                // This is a merge at a deeper level\n                return new Merge(this.source, Path_1.Path.Empty, childTree);\n            }\n        } else {\n            util_1.assert(this.path.getFront() === childName, \"Can't get a merge for a child not on the path of the operation\");\n            return new Merge(this.source, this.path.popFront(), this.children);\n        }\n    };\n    /**\n     * @inheritDoc\n     */\n    Merge.prototype.toString = function () {\n        return 'Operation(' + this.path + ': ' + this.source.toString() + ' merge: ' + this.children.toString() + ')';\n    };\n    return Merge;\n}();\nexports.Merge = Merge;\n\n//# sourceMappingURL=Merge.js.map\n\n/***/ }),\n/* 168 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar IndexedFilter_1 = __webpack_require__(72);\nvar ViewProcessor_1 = __webpack_require__(169);\nvar ChildrenNode_1 = __webpack_require__(7);\nvar CacheNode_1 = __webpack_require__(40);\nvar ViewCache_1 = __webpack_require__(99);\nvar EventGenerator_1 = __webpack_require__(172);\nvar util_1 = __webpack_require__(0);\nvar Operation_1 = __webpack_require__(12);\nvar Change_1 = __webpack_require__(15);\nvar PriorityIndex_1 = __webpack_require__(6);\n/**\n * A view represents a specific location and query that has 1 or more event registrations.\n *\n * It does several things:\n *  - Maintains the list of event registrations for this location/query.\n *  - Maintains a cache of the data visible for this location/query.\n *  - Applies new operations (via applyOperation), updates the cache, and based on the event\n *    registrations returns the set of events to be raised.\n * @constructor\n */\nvar View = /** @class */function () {\n    /**\n     *\n     * @param {!Query} query_\n     * @param {!ViewCache} initialViewCache\n     */\n    function View(query_, initialViewCache) {\n        this.query_ = query_;\n        this.eventRegistrations_ = [];\n        var params = this.query_.getQueryParams();\n        var indexFilter = new IndexedFilter_1.IndexedFilter(params.getIndex());\n        var filter = params.getNodeFilter();\n        /**\n         * @type {ViewProcessor}\n         * @private\n         */\n        this.processor_ = new ViewProcessor_1.ViewProcessor(filter);\n        var initialServerCache = initialViewCache.getServerCache();\n        var initialEventCache = initialViewCache.getEventCache();\n        // Don't filter server node with other filter than index, wait for tagged listen\n        var serverSnap = indexFilter.updateFullNode(ChildrenNode_1.ChildrenNode.EMPTY_NODE, initialServerCache.getNode(), null);\n        var eventSnap = filter.updateFullNode(ChildrenNode_1.ChildrenNode.EMPTY_NODE, initialEventCache.getNode(), null);\n        var newServerCache = new CacheNode_1.CacheNode(serverSnap, initialServerCache.isFullyInitialized(), indexFilter.filtersNodes());\n        var newEventCache = new CacheNode_1.CacheNode(eventSnap, initialEventCache.isFullyInitialized(), filter.filtersNodes());\n        /**\n         * @type {!ViewCache}\n         * @private\n         */\n        this.viewCache_ = new ViewCache_1.ViewCache(newEventCache, newServerCache);\n        /**\n         * @type {!EventGenerator}\n         * @private\n         */\n        this.eventGenerator_ = new EventGenerator_1.EventGenerator(this.query_);\n    }\n    /**\n     * @return {!Query}\n     */\n    View.prototype.getQuery = function () {\n        return this.query_;\n    };\n    /**\n     * @return {?Node}\n     */\n    View.prototype.getServerCache = function () {\n        return this.viewCache_.getServerCache().getNode();\n    };\n    /**\n     * @param {!Path} path\n     * @return {?Node}\n     */\n    View.prototype.getCompleteServerCache = function (path) {\n        var cache = this.viewCache_.getCompleteServerSnap();\n        if (cache) {\n            // If this isn't a \"loadsAllData\" view, then cache isn't actually a complete cache and\n            // we need to see if it contains the child we're interested in.\n            if (this.query_.getQueryParams().loadsAllData() || !path.isEmpty() && !cache.getImmediateChild(path.getFront()).isEmpty()) {\n                return cache.getChild(path);\n            }\n        }\n        return null;\n    };\n    /**\n     * @return {boolean}\n     */\n    View.prototype.isEmpty = function () {\n        return this.eventRegistrations_.length === 0;\n    };\n    /**\n     * @param {!EventRegistration} eventRegistration\n     */\n    View.prototype.addEventRegistration = function (eventRegistration) {\n        this.eventRegistrations_.push(eventRegistration);\n    };\n    /**\n     * @param {?EventRegistration} eventRegistration If null, remove all callbacks.\n     * @param {Error=} cancelError If a cancelError is provided, appropriate cancel events will be returned.\n     * @return {!Array.<!Event>} Cancel events, if cancelError was provided.\n     */\n    View.prototype.removeEventRegistration = function (eventRegistration, cancelError) {\n        var cancelEvents = [];\n        if (cancelError) {\n            util_1.assert(eventRegistration == null, 'A cancel should cancel all event registrations.');\n            var path_1 = this.query_.path;\n            this.eventRegistrations_.forEach(function (registration) {\n                cancelError /** @type {!Error} */ = cancelError;\n                var maybeEvent = registration.createCancelEvent(cancelError, path_1);\n                if (maybeEvent) {\n                    cancelEvents.push(maybeEvent);\n                }\n            });\n        }\n        if (eventRegistration) {\n            var remaining = [];\n            for (var i = 0; i < this.eventRegistrations_.length; ++i) {\n                var existing = this.eventRegistrations_[i];\n                if (!existing.matches(eventRegistration)) {\n                    remaining.push(existing);\n                } else if (eventRegistration.hasAnyCallback()) {\n                    // We're removing just this one\n                    remaining = remaining.concat(this.eventRegistrations_.slice(i + 1));\n                    break;\n                }\n            }\n            this.eventRegistrations_ = remaining;\n        } else {\n            this.eventRegistrations_ = [];\n        }\n        return cancelEvents;\n    };\n    /**\n     * Applies the given Operation, updates our cache, and returns the appropriate events.\n     *\n     * @param {!Operation} operation\n     * @param {!WriteTreeRef} writesCache\n     * @param {?Node} completeServerCache\n     * @return {!Array.<!Event>}\n     */\n    View.prototype.applyOperation = function (operation, writesCache, completeServerCache) {\n        if (operation.type === Operation_1.OperationType.MERGE && operation.source.queryId !== null) {\n            util_1.assert(this.viewCache_.getCompleteServerSnap(), 'We should always have a full cache before handling merges');\n            util_1.assert(this.viewCache_.getCompleteEventSnap(), 'Missing event cache, even though we have a server cache');\n        }\n        var oldViewCache = this.viewCache_;\n        var result = this.processor_.applyOperation(oldViewCache, operation, writesCache, completeServerCache);\n        this.processor_.assertIndexed(result.viewCache);\n        util_1.assert(result.viewCache.getServerCache().isFullyInitialized() || !oldViewCache.getServerCache().isFullyInitialized(), 'Once a server snap is complete, it should never go back');\n        this.viewCache_ = result.viewCache;\n        return this.generateEventsForChanges_(result.changes, result.viewCache.getEventCache().getNode(), null);\n    };\n    /**\n     * @param {!EventRegistration} registration\n     * @return {!Array.<!Event>}\n     */\n    View.prototype.getInitialEvents = function (registration) {\n        var eventSnap = this.viewCache_.getEventCache();\n        var initialChanges = [];\n        if (!eventSnap.getNode().isLeafNode()) {\n            var eventNode = eventSnap.getNode();\n            eventNode.forEachChild(PriorityIndex_1.PRIORITY_INDEX, function (key, childNode) {\n                initialChanges.push(Change_1.Change.childAddedChange(key, childNode));\n            });\n        }\n        if (eventSnap.isFullyInitialized()) {\n            initialChanges.push(Change_1.Change.valueChange(eventSnap.getNode()));\n        }\n        return this.generateEventsForChanges_(initialChanges, eventSnap.getNode(), registration);\n    };\n    /**\n     * @private\n     * @param {!Array.<!Change>} changes\n     * @param {!Node} eventCache\n     * @param {EventRegistration=} eventRegistration\n     * @return {!Array.<!Event>}\n     */\n    View.prototype.generateEventsForChanges_ = function (changes, eventCache, eventRegistration) {\n        var registrations = eventRegistration ? [eventRegistration] : this.eventRegistrations_;\n        return this.eventGenerator_.generateEventsForChanges(changes, eventCache, registrations);\n    };\n    return View;\n}();\nexports.View = View;\n\n//# sourceMappingURL=View.js.map\n\n/***/ }),\n/* 169 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar Operation_1 = __webpack_require__(12);\nvar util_1 = __webpack_require__(0);\nvar ChildChangeAccumulator_1 = __webpack_require__(170);\nvar Change_1 = __webpack_require__(15);\nvar ChildrenNode_1 = __webpack_require__(7);\nvar KeyIndex_1 = __webpack_require__(22);\nvar ImmutableTree_1 = __webpack_require__(71);\nvar Path_1 = __webpack_require__(4);\nvar CompleteChildSource_1 = __webpack_require__(171);\n/**\n * @constructor\n * @struct\n */\nvar ProcessorResult = /** @class */function () {\n    /**\n     * @param {!ViewCache} viewCache\n     * @param {!Array.<!Change>} changes\n     */\n    function ProcessorResult(viewCache, changes) {\n        this.viewCache = viewCache;\n        this.changes = changes;\n    }\n    return ProcessorResult;\n}();\nexports.ProcessorResult = ProcessorResult;\n/**\n * @constructor\n */\nvar ViewProcessor = /** @class */function () {\n    /**\n     * @param {!NodeFilter} filter_\n     */\n    function ViewProcessor(filter_) {\n        this.filter_ = filter_;\n    }\n    /**\n     * @param {!ViewCache} viewCache\n     */\n    ViewProcessor.prototype.assertIndexed = function (viewCache) {\n        util_1.assert(viewCache.getEventCache().getNode().isIndexed(this.filter_.getIndex()), 'Event snap not indexed');\n        util_1.assert(viewCache.getServerCache().getNode().isIndexed(this.filter_.getIndex()), 'Server snap not indexed');\n    };\n    /**\n     * @param {!ViewCache} oldViewCache\n     * @param {!Operation} operation\n     * @param {!WriteTreeRef} writesCache\n     * @param {?Node} completeCache\n     * @return {!ProcessorResult}\n     */\n    ViewProcessor.prototype.applyOperation = function (oldViewCache, operation, writesCache, completeCache) {\n        var accumulator = new ChildChangeAccumulator_1.ChildChangeAccumulator();\n        var newViewCache, filterServerNode;\n        if (operation.type === Operation_1.OperationType.OVERWRITE) {\n            var overwrite = operation;\n            if (overwrite.source.fromUser) {\n                newViewCache = this.applyUserOverwrite_(oldViewCache, overwrite.path, overwrite.snap, writesCache, completeCache, accumulator);\n            } else {\n                util_1.assert(overwrite.source.fromServer, 'Unknown source.');\n                // We filter the node if it's a tagged update or the node has been previously filtered  and the\n                // update is not at the root in which case it is ok (and necessary) to mark the node unfiltered\n                // again\n                filterServerNode = overwrite.source.tagged || oldViewCache.getServerCache().isFiltered() && !overwrite.path.isEmpty();\n                newViewCache = this.applyServerOverwrite_(oldViewCache, overwrite.path, overwrite.snap, writesCache, completeCache, filterServerNode, accumulator);\n            }\n        } else if (operation.type === Operation_1.OperationType.MERGE) {\n            var merge = operation;\n            if (merge.source.fromUser) {\n                newViewCache = this.applyUserMerge_(oldViewCache, merge.path, merge.children, writesCache, completeCache, accumulator);\n            } else {\n                util_1.assert(merge.source.fromServer, 'Unknown source.');\n                // We filter the node if it's a tagged update or the node has been previously filtered\n                filterServerNode = merge.source.tagged || oldViewCache.getServerCache().isFiltered();\n                newViewCache = this.applyServerMerge_(oldViewCache, merge.path, merge.children, writesCache, completeCache, filterServerNode, accumulator);\n            }\n        } else if (operation.type === Operation_1.OperationType.ACK_USER_WRITE) {\n            var ackUserWrite = operation;\n            if (!ackUserWrite.revert) {\n                newViewCache = this.ackUserWrite_(oldViewCache, ackUserWrite.path, ackUserWrite.affectedTree, writesCache, completeCache, accumulator);\n            } else {\n                newViewCache = this.revertUserWrite_(oldViewCache, ackUserWrite.path, writesCache, completeCache, accumulator);\n            }\n        } else if (operation.type === Operation_1.OperationType.LISTEN_COMPLETE) {\n            newViewCache = this.listenComplete_(oldViewCache, operation.path, writesCache, accumulator);\n        } else {\n            throw util_1.assertionError('Unknown operation type: ' + operation.type);\n        }\n        var changes = accumulator.getChanges();\n        ViewProcessor.maybeAddValueEvent_(oldViewCache, newViewCache, changes);\n        return new ProcessorResult(newViewCache, changes);\n    };\n    /**\n     * @param {!ViewCache} oldViewCache\n     * @param {!ViewCache} newViewCache\n     * @param {!Array.<!Change>} accumulator\n     * @private\n     */\n    ViewProcessor.maybeAddValueEvent_ = function (oldViewCache, newViewCache, accumulator) {\n        var eventSnap = newViewCache.getEventCache();\n        if (eventSnap.isFullyInitialized()) {\n            var isLeafOrEmpty = eventSnap.getNode().isLeafNode() || eventSnap.getNode().isEmpty();\n            var oldCompleteSnap = oldViewCache.getCompleteEventSnap();\n            if (accumulator.length > 0 || !oldViewCache.getEventCache().isFullyInitialized() || isLeafOrEmpty && !eventSnap.getNode().equals( /** @type {!Node} */oldCompleteSnap) || !eventSnap.getNode().getPriority().equals(oldCompleteSnap.getPriority())) {\n                accumulator.push(Change_1.Change.valueChange(\n                /** @type {!Node} */newViewCache.getCompleteEventSnap()));\n            }\n        }\n    };\n    /**\n     * @param {!ViewCache} viewCache\n     * @param {!Path} changePath\n     * @param {!WriteTreeRef} writesCache\n     * @param {!CompleteChildSource} source\n     * @param {!ChildChangeAccumulator} accumulator\n     * @return {!ViewCache}\n     * @private\n     */\n    ViewProcessor.prototype.generateEventCacheAfterServerEvent_ = function (viewCache, changePath, writesCache, source, accumulator) {\n        var oldEventSnap = viewCache.getEventCache();\n        if (writesCache.shadowingWrite(changePath) != null) {\n            // we have a shadowing write, ignore changes\n            return viewCache;\n        } else {\n            var newEventCache = void 0,\n                serverNode = void 0;\n            if (changePath.isEmpty()) {\n                // TODO: figure out how this plays with \"sliding ack windows\"\n                util_1.assert(viewCache.getServerCache().isFullyInitialized(), 'If change path is empty, we must have complete server data');\n                if (viewCache.getServerCache().isFiltered()) {\n                    // We need to special case this, because we need to only apply writes to complete children, or\n                    // we might end up raising events for incomplete children. If the server data is filtered deep\n                    // writes cannot be guaranteed to be complete\n                    var serverCache = viewCache.getCompleteServerSnap();\n                    var completeChildren = serverCache instanceof ChildrenNode_1.ChildrenNode ? serverCache : ChildrenNode_1.ChildrenNode.EMPTY_NODE;\n                    var completeEventChildren = writesCache.calcCompleteEventChildren(completeChildren);\n                    newEventCache = this.filter_.updateFullNode(viewCache.getEventCache().getNode(), completeEventChildren, accumulator);\n                } else {\n                    var completeNode = writesCache.calcCompleteEventCache(viewCache.getCompleteServerSnap());\n                    newEventCache = this.filter_.updateFullNode(viewCache.getEventCache().getNode(), completeNode, accumulator);\n                }\n            } else {\n                var childKey = changePath.getFront();\n                if (childKey == '.priority') {\n                    util_1.assert(changePath.getLength() == 1, \"Can't have a priority with additional path components\");\n                    var oldEventNode = oldEventSnap.getNode();\n                    serverNode = viewCache.getServerCache().getNode();\n                    // we might have overwrites for this priority\n                    var updatedPriority = writesCache.calcEventCacheAfterServerOverwrite(changePath, oldEventNode, serverNode);\n                    if (updatedPriority != null) {\n                        newEventCache = this.filter_.updatePriority(oldEventNode, updatedPriority);\n                    } else {\n                        // priority didn't change, keep old node\n                        newEventCache = oldEventSnap.getNode();\n                    }\n                } else {\n                    var childChangePath = changePath.popFront();\n                    // update child\n                    var newEventChild = void 0;\n                    if (oldEventSnap.isCompleteForChild(childKey)) {\n                        serverNode = viewCache.getServerCache().getNode();\n                        var eventChildUpdate = writesCache.calcEventCacheAfterServerOverwrite(changePath, oldEventSnap.getNode(), serverNode);\n                        if (eventChildUpdate != null) {\n                            newEventChild = oldEventSnap.getNode().getImmediateChild(childKey).updateChild(childChangePath, eventChildUpdate);\n                        } else {\n                            // Nothing changed, just keep the old child\n                            newEventChild = oldEventSnap.getNode().getImmediateChild(childKey);\n                        }\n                    } else {\n                        newEventChild = writesCache.calcCompleteChild(childKey, viewCache.getServerCache());\n                    }\n                    if (newEventChild != null) {\n                        newEventCache = this.filter_.updateChild(oldEventSnap.getNode(), childKey, newEventChild, childChangePath, source, accumulator);\n                    } else {\n                        // no complete child available or no change\n                        newEventCache = oldEventSnap.getNode();\n                    }\n                }\n            }\n            return viewCache.updateEventSnap(newEventCache, oldEventSnap.isFullyInitialized() || changePath.isEmpty(), this.filter_.filtersNodes());\n        }\n    };\n    /**\n     * @param {!ViewCache} oldViewCache\n     * @param {!Path} changePath\n     * @param {!Node} changedSnap\n     * @param {!WriteTreeRef} writesCache\n     * @param {?Node} completeCache\n     * @param {boolean} filterServerNode\n     * @param {!ChildChangeAccumulator} accumulator\n     * @return {!ViewCache}\n     * @private\n     */\n    ViewProcessor.prototype.applyServerOverwrite_ = function (oldViewCache, changePath, changedSnap, writesCache, completeCache, filterServerNode, accumulator) {\n        var oldServerSnap = oldViewCache.getServerCache();\n        var newServerCache;\n        var serverFilter = filterServerNode ? this.filter_ : this.filter_.getIndexedFilter();\n        if (changePath.isEmpty()) {\n            newServerCache = serverFilter.updateFullNode(oldServerSnap.getNode(), changedSnap, null);\n        } else if (serverFilter.filtersNodes() && !oldServerSnap.isFiltered()) {\n            // we want to filter the server node, but we didn't filter the server node yet, so simulate a full update\n            var newServerNode = oldServerSnap.getNode().updateChild(changePath, changedSnap);\n            newServerCache = serverFilter.updateFullNode(oldServerSnap.getNode(), newServerNode, null);\n        } else {\n            var childKey = changePath.getFront();\n            if (!oldServerSnap.isCompleteForPath(changePath) && changePath.getLength() > 1) {\n                // We don't update incomplete nodes with updates intended for other listeners\n                return oldViewCache;\n            }\n            var childChangePath = changePath.popFront();\n            var childNode = oldServerSnap.getNode().getImmediateChild(childKey);\n            var newChildNode = childNode.updateChild(childChangePath, changedSnap);\n            if (childKey == '.priority') {\n                newServerCache = serverFilter.updatePriority(oldServerSnap.getNode(), newChildNode);\n            } else {\n                newServerCache = serverFilter.updateChild(oldServerSnap.getNode(), childKey, newChildNode, childChangePath, CompleteChildSource_1.NO_COMPLETE_CHILD_SOURCE, null);\n            }\n        }\n        var newViewCache = oldViewCache.updateServerSnap(newServerCache, oldServerSnap.isFullyInitialized() || changePath.isEmpty(), serverFilter.filtersNodes());\n        var source = new CompleteChildSource_1.WriteTreeCompleteChildSource(writesCache, newViewCache, completeCache);\n        return this.generateEventCacheAfterServerEvent_(newViewCache, changePath, writesCache, source, accumulator);\n    };\n    /**\n     * @param {!ViewCache} oldViewCache\n     * @param {!Path} changePath\n     * @param {!Node} changedSnap\n     * @param {!WriteTreeRef} writesCache\n     * @param {?Node} completeCache\n     * @param {!ChildChangeAccumulator} accumulator\n     * @return {!ViewCache}\n     * @private\n     */\n    ViewProcessor.prototype.applyUserOverwrite_ = function (oldViewCache, changePath, changedSnap, writesCache, completeCache, accumulator) {\n        var oldEventSnap = oldViewCache.getEventCache();\n        var newViewCache, newEventCache;\n        var source = new CompleteChildSource_1.WriteTreeCompleteChildSource(writesCache, oldViewCache, completeCache);\n        if (changePath.isEmpty()) {\n            newEventCache = this.filter_.updateFullNode(oldViewCache.getEventCache().getNode(), changedSnap, accumulator);\n            newViewCache = oldViewCache.updateEventSnap(newEventCache, true, this.filter_.filtersNodes());\n        } else {\n            var childKey = changePath.getFront();\n            if (childKey === '.priority') {\n                newEventCache = this.filter_.updatePriority(oldViewCache.getEventCache().getNode(), changedSnap);\n                newViewCache = oldViewCache.updateEventSnap(newEventCache, oldEventSnap.isFullyInitialized(), oldEventSnap.isFiltered());\n            } else {\n                var childChangePath = changePath.popFront();\n                var oldChild = oldEventSnap.getNode().getImmediateChild(childKey);\n                var newChild = void 0;\n                if (childChangePath.isEmpty()) {\n                    // Child overwrite, we can replace the child\n                    newChild = changedSnap;\n                } else {\n                    var childNode = source.getCompleteChild(childKey);\n                    if (childNode != null) {\n                        if (childChangePath.getBack() === '.priority' && childNode.getChild(childChangePath.parent()).isEmpty()) {\n                            // This is a priority update on an empty node. If this node exists on the server, the\n                            // server will send down the priority in the update, so ignore for now\n                            newChild = childNode;\n                        } else {\n                            newChild = childNode.updateChild(childChangePath, changedSnap);\n                        }\n                    } else {\n                        // There is no complete child node available\n                        newChild = ChildrenNode_1.ChildrenNode.EMPTY_NODE;\n                    }\n                }\n                if (!oldChild.equals(newChild)) {\n                    var newEventSnap = this.filter_.updateChild(oldEventSnap.getNode(), childKey, newChild, childChangePath, source, accumulator);\n                    newViewCache = oldViewCache.updateEventSnap(newEventSnap, oldEventSnap.isFullyInitialized(), this.filter_.filtersNodes());\n                } else {\n                    newViewCache = oldViewCache;\n                }\n            }\n        }\n        return newViewCache;\n    };\n    /**\n     * @param {!ViewCache} viewCache\n     * @param {string} childKey\n     * @return {boolean}\n     * @private\n     */\n    ViewProcessor.cacheHasChild_ = function (viewCache, childKey) {\n        return viewCache.getEventCache().isCompleteForChild(childKey);\n    };\n    /**\n     * @param {!ViewCache} viewCache\n     * @param {!Path} path\n     * @param {ImmutableTree.<!Node>} changedChildren\n     * @param {!WriteTreeRef} writesCache\n     * @param {?Node} serverCache\n     * @param {!ChildChangeAccumulator} accumulator\n     * @return {!ViewCache}\n     * @private\n     */\n    ViewProcessor.prototype.applyUserMerge_ = function (viewCache, path, changedChildren, writesCache, serverCache, accumulator) {\n        var _this = this;\n        // HACK: In the case of a limit query, there may be some changes that bump things out of the\n        // window leaving room for new items.  It's important we process these changes first, so we\n        // iterate the changes twice, first processing any that affect items currently in view.\n        // TODO: I consider an item \"in view\" if cacheHasChild is true, which checks both the server\n        // and event snap.  I'm not sure if this will result in edge cases when a child is in one but\n        // not the other.\n        var curViewCache = viewCache;\n        changedChildren.foreach(function (relativePath, childNode) {\n            var writePath = path.child(relativePath);\n            if (ViewProcessor.cacheHasChild_(viewCache, writePath.getFront())) {\n                curViewCache = _this.applyUserOverwrite_(curViewCache, writePath, childNode, writesCache, serverCache, accumulator);\n            }\n        });\n        changedChildren.foreach(function (relativePath, childNode) {\n            var writePath = path.child(relativePath);\n            if (!ViewProcessor.cacheHasChild_(viewCache, writePath.getFront())) {\n                curViewCache = _this.applyUserOverwrite_(curViewCache, writePath, childNode, writesCache, serverCache, accumulator);\n            }\n        });\n        return curViewCache;\n    };\n    /**\n     * @param {!Node} node\n     * @param {ImmutableTree.<!Node>} merge\n     * @return {!Node}\n     * @private\n     */\n    ViewProcessor.prototype.applyMerge_ = function (node, merge) {\n        merge.foreach(function (relativePath, childNode) {\n            node = node.updateChild(relativePath, childNode);\n        });\n        return node;\n    };\n    /**\n     * @param {!ViewCache} viewCache\n     * @param {!Path} path\n     * @param {!ImmutableTree.<!Node>} changedChildren\n     * @param {!WriteTreeRef} writesCache\n     * @param {?Node} serverCache\n     * @param {boolean} filterServerNode\n     * @param {!ChildChangeAccumulator} accumulator\n     * @return {!ViewCache}\n     * @private\n     */\n    ViewProcessor.prototype.applyServerMerge_ = function (viewCache, path, changedChildren, writesCache, serverCache, filterServerNode, accumulator) {\n        var _this = this;\n        // If we don't have a cache yet, this merge was intended for a previously listen in the same location. Ignore it and\n        // wait for the complete data update coming soon.\n        if (viewCache.getServerCache().getNode().isEmpty() && !viewCache.getServerCache().isFullyInitialized()) {\n            return viewCache;\n        }\n        // HACK: In the case of a limit query, there may be some changes that bump things out of the\n        // window leaving room for new items.  It's important we process these changes first, so we\n        // iterate the changes twice, first processing any that affect items currently in view.\n        // TODO: I consider an item \"in view\" if cacheHasChild is true, which checks both the server\n        // and event snap.  I'm not sure if this will result in edge cases when a child is in one but\n        // not the other.\n        var curViewCache = viewCache;\n        var viewMergeTree;\n        if (path.isEmpty()) {\n            viewMergeTree = changedChildren;\n        } else {\n            viewMergeTree = ImmutableTree_1.ImmutableTree.Empty.setTree(path, changedChildren);\n        }\n        var serverNode = viewCache.getServerCache().getNode();\n        viewMergeTree.children.inorderTraversal(function (childKey, childTree) {\n            if (serverNode.hasChild(childKey)) {\n                var serverChild = viewCache.getServerCache().getNode().getImmediateChild(childKey);\n                var newChild = _this.applyMerge_(serverChild, childTree);\n                curViewCache = _this.applyServerOverwrite_(curViewCache, new Path_1.Path(childKey), newChild, writesCache, serverCache, filterServerNode, accumulator);\n            }\n        });\n        viewMergeTree.children.inorderTraversal(function (childKey, childMergeTree) {\n            var isUnknownDeepMerge = !viewCache.getServerCache().isCompleteForChild(childKey) && childMergeTree.value == null;\n            if (!serverNode.hasChild(childKey) && !isUnknownDeepMerge) {\n                var serverChild = viewCache.getServerCache().getNode().getImmediateChild(childKey);\n                var newChild = _this.applyMerge_(serverChild, childMergeTree);\n                curViewCache = _this.applyServerOverwrite_(curViewCache, new Path_1.Path(childKey), newChild, writesCache, serverCache, filterServerNode, accumulator);\n            }\n        });\n        return curViewCache;\n    };\n    /**\n     * @param {!ViewCache} viewCache\n     * @param {!Path} ackPath\n     * @param {!ImmutableTree<!boolean>} affectedTree\n     * @param {!WriteTreeRef} writesCache\n     * @param {?Node} completeCache\n     * @param {!ChildChangeAccumulator} accumulator\n     * @return {!ViewCache}\n     * @private\n     */\n    ViewProcessor.prototype.ackUserWrite_ = function (viewCache, ackPath, affectedTree, writesCache, completeCache, accumulator) {\n        if (writesCache.shadowingWrite(ackPath) != null) {\n            return viewCache;\n        }\n        // Only filter server node if it is currently filtered\n        var filterServerNode = viewCache.getServerCache().isFiltered();\n        // Essentially we'll just get our existing server cache for the affected paths and re-apply it as a server update\n        // now that it won't be shadowed.\n        var serverCache = viewCache.getServerCache();\n        if (affectedTree.value != null) {\n            // This is an overwrite.\n            if (ackPath.isEmpty() && serverCache.isFullyInitialized() || serverCache.isCompleteForPath(ackPath)) {\n                return this.applyServerOverwrite_(viewCache, ackPath, serverCache.getNode().getChild(ackPath), writesCache, completeCache, filterServerNode, accumulator);\n            } else if (ackPath.isEmpty()) {\n                // This is a goofy edge case where we are acking data at this location but don't have full data.  We\n                // should just re-apply whatever we have in our cache as a merge.\n                var changedChildren_1 = ImmutableTree_1.ImmutableTree.Empty;\n                serverCache.getNode().forEachChild(KeyIndex_1.KEY_INDEX, function (name, node) {\n                    changedChildren_1 = changedChildren_1.set(new Path_1.Path(name), node);\n                });\n                return this.applyServerMerge_(viewCache, ackPath, changedChildren_1, writesCache, completeCache, filterServerNode, accumulator);\n            } else {\n                return viewCache;\n            }\n        } else {\n            // This is a merge.\n            var changedChildren_2 = ImmutableTree_1.ImmutableTree.Empty;\n            affectedTree.foreach(function (mergePath, value) {\n                var serverCachePath = ackPath.child(mergePath);\n                if (serverCache.isCompleteForPath(serverCachePath)) {\n                    changedChildren_2 = changedChildren_2.set(mergePath, serverCache.getNode().getChild(serverCachePath));\n                }\n            });\n            return this.applyServerMerge_(viewCache, ackPath, changedChildren_2, writesCache, completeCache, filterServerNode, accumulator);\n        }\n    };\n    /**\n     * @param {!ViewCache} viewCache\n     * @param {!Path} path\n     * @param {!WriteTreeRef} writesCache\n     * @param {!ChildChangeAccumulator} accumulator\n     * @return {!ViewCache}\n     * @private\n     */\n    ViewProcessor.prototype.listenComplete_ = function (viewCache, path, writesCache, accumulator) {\n        var oldServerNode = viewCache.getServerCache();\n        var newViewCache = viewCache.updateServerSnap(oldServerNode.getNode(), oldServerNode.isFullyInitialized() || path.isEmpty(), oldServerNode.isFiltered());\n        return this.generateEventCacheAfterServerEvent_(newViewCache, path, writesCache, CompleteChildSource_1.NO_COMPLETE_CHILD_SOURCE, accumulator);\n    };\n    /**\n     * @param {!ViewCache} viewCache\n     * @param {!Path} path\n     * @param {!WriteTreeRef} writesCache\n     * @param {?Node} completeServerCache\n     * @param {!ChildChangeAccumulator} accumulator\n     * @return {!ViewCache}\n     * @private\n     */\n    ViewProcessor.prototype.revertUserWrite_ = function (viewCache, path, writesCache, completeServerCache, accumulator) {\n        var complete;\n        if (writesCache.shadowingWrite(path) != null) {\n            return viewCache;\n        } else {\n            var source = new CompleteChildSource_1.WriteTreeCompleteChildSource(writesCache, viewCache, completeServerCache);\n            var oldEventCache = viewCache.getEventCache().getNode();\n            var newEventCache = void 0;\n            if (path.isEmpty() || path.getFront() === '.priority') {\n                var newNode = void 0;\n                if (viewCache.getServerCache().isFullyInitialized()) {\n                    newNode = writesCache.calcCompleteEventCache(viewCache.getCompleteServerSnap());\n                } else {\n                    var serverChildren = viewCache.getServerCache().getNode();\n                    util_1.assert(serverChildren instanceof ChildrenNode_1.ChildrenNode, 'serverChildren would be complete if leaf node');\n                    newNode = writesCache.calcCompleteEventChildren(serverChildren);\n                }\n                newNode = newNode;\n                newEventCache = this.filter_.updateFullNode(oldEventCache, newNode, accumulator);\n            } else {\n                var childKey = path.getFront();\n                var newChild = writesCache.calcCompleteChild(childKey, viewCache.getServerCache());\n                if (newChild == null && viewCache.getServerCache().isCompleteForChild(childKey)) {\n                    newChild = oldEventCache.getImmediateChild(childKey);\n                }\n                if (newChild != null) {\n                    newEventCache = this.filter_.updateChild(oldEventCache, childKey, newChild, path.popFront(), source, accumulator);\n                } else if (viewCache.getEventCache().getNode().hasChild(childKey)) {\n                    // No complete child available, delete the existing one, if any\n                    newEventCache = this.filter_.updateChild(oldEventCache, childKey, ChildrenNode_1.ChildrenNode.EMPTY_NODE, path.popFront(), source, accumulator);\n                } else {\n                    newEventCache = oldEventCache;\n                }\n                if (newEventCache.isEmpty() && viewCache.getServerCache().isFullyInitialized()) {\n                    // We might have reverted all child writes. Maybe the old event was a leaf node\n                    complete = writesCache.calcCompleteEventCache(viewCache.getCompleteServerSnap());\n                    if (complete.isLeafNode()) {\n                        newEventCache = this.filter_.updateFullNode(newEventCache, complete, accumulator);\n                    }\n                }\n            }\n            complete = viewCache.getServerCache().isFullyInitialized() || writesCache.shadowingWrite(Path_1.Path.Empty) != null;\n            return viewCache.updateEventSnap(newEventCache, complete, this.filter_.filtersNodes());\n        }\n    };\n    return ViewProcessor;\n}();\nexports.ViewProcessor = ViewProcessor;\n\n//# sourceMappingURL=ViewProcessor.js.map\n\n/***/ }),\n/* 170 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = __webpack_require__(0);\nvar Change_1 = __webpack_require__(15);\nvar util_2 = __webpack_require__(0);\n/**\n * @constructor\n */\nvar ChildChangeAccumulator = /** @class */function () {\n    function ChildChangeAccumulator() {\n        this.changeMap_ = {};\n    }\n    /**\n     * @param {!Change} change\n     */\n    ChildChangeAccumulator.prototype.trackChildChange = function (change) {\n        var type = change.type;\n        var childKey /** @type {!string} */ = change.childName;\n        util_2.assert(type == Change_1.Change.CHILD_ADDED || type == Change_1.Change.CHILD_CHANGED || type == Change_1.Change.CHILD_REMOVED, 'Only child changes supported for tracking');\n        util_2.assert(childKey !== '.priority', 'Only non-priority child changes can be tracked.');\n        var oldChange = util_1.safeGet(this.changeMap_, childKey);\n        if (oldChange) {\n            var oldType = oldChange.type;\n            if (type == Change_1.Change.CHILD_ADDED && oldType == Change_1.Change.CHILD_REMOVED) {\n                this.changeMap_[childKey] = Change_1.Change.childChangedChange(childKey, change.snapshotNode, oldChange.snapshotNode);\n            } else if (type == Change_1.Change.CHILD_REMOVED && oldType == Change_1.Change.CHILD_ADDED) {\n                delete this.changeMap_[childKey];\n            } else if (type == Change_1.Change.CHILD_REMOVED && oldType == Change_1.Change.CHILD_CHANGED) {\n                this.changeMap_[childKey] = Change_1.Change.childRemovedChange(childKey, oldChange.oldSnap);\n            } else if (type == Change_1.Change.CHILD_CHANGED && oldType == Change_1.Change.CHILD_ADDED) {\n                this.changeMap_[childKey] = Change_1.Change.childAddedChange(childKey, change.snapshotNode);\n            } else if (type == Change_1.Change.CHILD_CHANGED && oldType == Change_1.Change.CHILD_CHANGED) {\n                this.changeMap_[childKey] = Change_1.Change.childChangedChange(childKey, change.snapshotNode, oldChange.oldSnap);\n            } else {\n                throw util_2.assertionError('Illegal combination of changes: ' + change + ' occurred after ' + oldChange);\n            }\n        } else {\n            this.changeMap_[childKey] = change;\n        }\n    };\n    /**\n     * @return {!Array.<!Change>}\n     */\n    ChildChangeAccumulator.prototype.getChanges = function () {\n        return util_1.getValues(this.changeMap_);\n    };\n    return ChildChangeAccumulator;\n}();\nexports.ChildChangeAccumulator = ChildChangeAccumulator;\n\n//# sourceMappingURL=ChildChangeAccumulator.js.map\n\n/***/ }),\n/* 171 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar CacheNode_1 = __webpack_require__(40);\n/**\n * An implementation of CompleteChildSource that never returns any additional children\n *\n * @private\n * @constructor\n * @implements CompleteChildSource\n */\nvar NoCompleteChildSource_ = /** @class */function () {\n    function NoCompleteChildSource_() {}\n    /**\n     * @inheritDoc\n     */\n    NoCompleteChildSource_.prototype.getCompleteChild = function (childKey) {\n        return null;\n    };\n    /**\n     * @inheritDoc\n     */\n    NoCompleteChildSource_.prototype.getChildAfterChild = function (index, child, reverse) {\n        return null;\n    };\n    return NoCompleteChildSource_;\n}();\nexports.NoCompleteChildSource_ = NoCompleteChildSource_;\n/**\n * Singleton instance.\n * @const\n * @type {!CompleteChildSource}\n */\nexports.NO_COMPLETE_CHILD_SOURCE = new NoCompleteChildSource_();\n/**\n * An implementation of CompleteChildSource that uses a WriteTree in addition to any other server data or\n * old event caches available to calculate complete children.\n *\n *\n * @implements CompleteChildSource\n */\nvar WriteTreeCompleteChildSource = /** @class */function () {\n    /**\n     * @param {!WriteTreeRef} writes_\n     * @param {!ViewCache} viewCache_\n     * @param {?Node} optCompleteServerCache_\n     */\n    function WriteTreeCompleteChildSource(writes_, viewCache_, optCompleteServerCache_) {\n        if (optCompleteServerCache_ === void 0) {\n            optCompleteServerCache_ = null;\n        }\n        this.writes_ = writes_;\n        this.viewCache_ = viewCache_;\n        this.optCompleteServerCache_ = optCompleteServerCache_;\n    }\n    /**\n     * @inheritDoc\n     */\n    WriteTreeCompleteChildSource.prototype.getCompleteChild = function (childKey) {\n        var node = this.viewCache_.getEventCache();\n        if (node.isCompleteForChild(childKey)) {\n            return node.getNode().getImmediateChild(childKey);\n        } else {\n            var serverNode = this.optCompleteServerCache_ != null ? new CacheNode_1.CacheNode(this.optCompleteServerCache_, true, false) : this.viewCache_.getServerCache();\n            return this.writes_.calcCompleteChild(childKey, serverNode);\n        }\n    };\n    /**\n     * @inheritDoc\n     */\n    WriteTreeCompleteChildSource.prototype.getChildAfterChild = function (index, child, reverse) {\n        var completeServerData = this.optCompleteServerCache_ != null ? this.optCompleteServerCache_ : this.viewCache_.getCompleteServerSnap();\n        var nodes = this.writes_.calcIndexedSlice(completeServerData, child, 1, reverse, index);\n        if (nodes.length === 0) {\n            return null;\n        } else {\n            return nodes[0];\n        }\n    };\n    return WriteTreeCompleteChildSource;\n}();\nexports.WriteTreeCompleteChildSource = WriteTreeCompleteChildSource;\n\n//# sourceMappingURL=CompleteChildSource.js.map\n\n/***/ }),\n/* 172 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar Node_1 = __webpack_require__(8);\nvar Change_1 = __webpack_require__(15);\nvar util_1 = __webpack_require__(0);\n/**\n * An EventGenerator is used to convert \"raw\" changes (Change) as computed by the\n * CacheDiffer into actual events (Event) that can be raised.  See generateEventsForChanges()\n * for details.\n *\n * @constructor\n */\nvar EventGenerator = /** @class */function () {\n    /**\n     *\n     * @param {!Query} query_\n     */\n    function EventGenerator(query_) {\n        this.query_ = query_;\n        /**\n         * @private\n         * @type {!Index}\n         */\n        this.index_ = this.query_.getQueryParams().getIndex();\n    }\n    /**\n     * Given a set of raw changes (no moved events and prevName not specified yet), and a set of\n     * EventRegistrations that should be notified of these changes, generate the actual events to be raised.\n     *\n     * Notes:\n     *  - child_moved events will be synthesized at this time for any child_changed events that affect\n     *    our index.\n     *  - prevName will be calculated based on the index ordering.\n     *\n     * @param {!Array.<!Change>} changes\n     * @param {!Node} eventCache\n     * @param {!Array.<!EventRegistration>} eventRegistrations\n     * @return {!Array.<!Event>}\n     */\n    EventGenerator.prototype.generateEventsForChanges = function (changes, eventCache, eventRegistrations) {\n        var _this = this;\n        var events = [];\n        var moves = [];\n        changes.forEach(function (change) {\n            if (change.type === Change_1.Change.CHILD_CHANGED && _this.index_.indexedValueChanged(change.oldSnap, change.snapshotNode)) {\n                moves.push(Change_1.Change.childMovedChange(change.childName, change.snapshotNode));\n            }\n        });\n        this.generateEventsForType_(events, Change_1.Change.CHILD_REMOVED, changes, eventRegistrations, eventCache);\n        this.generateEventsForType_(events, Change_1.Change.CHILD_ADDED, changes, eventRegistrations, eventCache);\n        this.generateEventsForType_(events, Change_1.Change.CHILD_MOVED, moves, eventRegistrations, eventCache);\n        this.generateEventsForType_(events, Change_1.Change.CHILD_CHANGED, changes, eventRegistrations, eventCache);\n        this.generateEventsForType_(events, Change_1.Change.VALUE, changes, eventRegistrations, eventCache);\n        return events;\n    };\n    /**\n     * Given changes of a single change type, generate the corresponding events.\n     *\n     * @param {!Array.<!Event>} events\n     * @param {!string} eventType\n     * @param {!Array.<!Change>} changes\n     * @param {!Array.<!EventRegistration>} registrations\n     * @param {!Node} eventCache\n     * @private\n     */\n    EventGenerator.prototype.generateEventsForType_ = function (events, eventType, changes, registrations, eventCache) {\n        var _this = this;\n        var filteredChanges = changes.filter(function (change) {\n            return change.type === eventType;\n        });\n        filteredChanges.sort(this.compareChanges_.bind(this));\n        filteredChanges.forEach(function (change) {\n            var materializedChange = _this.materializeSingleChange_(change, eventCache);\n            registrations.forEach(function (registration) {\n                if (registration.respondsTo(change.type)) {\n                    events.push(registration.createEvent(materializedChange, _this.query_));\n                }\n            });\n        });\n    };\n    /**\n     * @param {!Change} change\n     * @param {!Node} eventCache\n     * @return {!Change}\n     * @private\n     */\n    EventGenerator.prototype.materializeSingleChange_ = function (change, eventCache) {\n        if (change.type === 'value' || change.type === 'child_removed') {\n            return change;\n        } else {\n            change.prevName = eventCache.getPredecessorChildName(\n            /** @type {!string} */\n            change.childName, change.snapshotNode, this.index_);\n            return change;\n        }\n    };\n    /**\n     * @param {!Change} a\n     * @param {!Change} b\n     * @return {number}\n     * @private\n     */\n    EventGenerator.prototype.compareChanges_ = function (a, b) {\n        if (a.childName == null || b.childName == null) {\n            throw util_1.assertionError('Should only compare child_ events.');\n        }\n        var aWrapped = new Node_1.NamedNode(a.childName, a.snapshotNode);\n        var bWrapped = new Node_1.NamedNode(b.childName, b.snapshotNode);\n        return this.index_.compare(aWrapped, bWrapped);\n    };\n    return EventGenerator;\n}();\nexports.EventGenerator = EventGenerator;\n\n//# sourceMappingURL=EventGenerator.js.map\n\n/***/ }),\n/* 173 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = __webpack_require__(0);\nvar util_2 = __webpack_require__(0);\nvar Path_1 = __webpack_require__(4);\nvar CompoundWrite_1 = __webpack_require__(174);\nvar PriorityIndex_1 = __webpack_require__(6);\nvar ChildrenNode_1 = __webpack_require__(7);\n/**\n * WriteTree tracks all pending user-initiated writes and has methods to calculate the result of merging them\n * with underlying server data (to create \"event cache\" data).  Pending writes are added with addOverwrite()\n * and addMerge(), and removed with removeWrite().\n *\n * @constructor\n */\nvar WriteTree = /** @class */function () {\n    function WriteTree() {\n        /**\n         * A tree tracking the result of applying all visible writes.  This does not include transactions with\n         * applyLocally=false or writes that are completely shadowed by other writes.\n         *\n         * @type {!CompoundWrite}\n         * @private\n         */\n        this.visibleWrites_ = CompoundWrite_1.CompoundWrite.Empty;\n        /**\n         * A list of all pending writes, regardless of visibility and shadowed-ness.  Used to calculate arbitrary\n         * sets of the changed data, such as hidden writes (from transactions) or changes with certain writes excluded (also\n         * used by transactions).\n         *\n         * @type {!Array.<!WriteRecord>}\n         * @private\n         */\n        this.allWrites_ = [];\n        this.lastWriteId_ = -1;\n    }\n    /**\n     * Create a new WriteTreeRef for the given path. For use with a new sync point at the given path.\n     *\n     * @param {!Path} path\n     * @return {!WriteTreeRef}\n     */\n    WriteTree.prototype.childWrites = function (path) {\n        return new WriteTreeRef(path, this);\n    };\n    /**\n     * Record a new overwrite from user code.\n     *\n     * @param {!Path} path\n     * @param {!Node} snap\n     * @param {!number} writeId\n     * @param {boolean=} visible This is set to false by some transactions. It should be excluded from event caches\n     */\n    WriteTree.prototype.addOverwrite = function (path, snap, writeId, visible) {\n        util_2.assert(writeId > this.lastWriteId_, 'Stacking an older write on top of newer ones');\n        if (visible === undefined) {\n            visible = true;\n        }\n        this.allWrites_.push({\n            path: path,\n            snap: snap,\n            writeId: writeId,\n            visible: visible\n        });\n        if (visible) {\n            this.visibleWrites_ = this.visibleWrites_.addWrite(path, snap);\n        }\n        this.lastWriteId_ = writeId;\n    };\n    /**\n     * Record a new merge from user code.\n     *\n     * @param {!Path} path\n     * @param {!Object.<string, !Node>} changedChildren\n     * @param {!number} writeId\n     */\n    WriteTree.prototype.addMerge = function (path, changedChildren, writeId) {\n        util_2.assert(writeId > this.lastWriteId_, 'Stacking an older merge on top of newer ones');\n        this.allWrites_.push({\n            path: path,\n            children: changedChildren,\n            writeId: writeId,\n            visible: true\n        });\n        this.visibleWrites_ = this.visibleWrites_.addWrites(path, changedChildren);\n        this.lastWriteId_ = writeId;\n    };\n    /**\n     * @param {!number} writeId\n     * @return {?WriteRecord}\n     */\n    WriteTree.prototype.getWrite = function (writeId) {\n        for (var i = 0; i < this.allWrites_.length; i++) {\n            var record = this.allWrites_[i];\n            if (record.writeId === writeId) {\n                return record;\n            }\n        }\n        return null;\n    };\n    /**\n     * Remove a write (either an overwrite or merge) that has been successfully acknowledge by the server. Recalculates\n     * the tree if necessary.  We return true if it may have been visible, meaning views need to reevaluate.\n     *\n     * @param {!number} writeId\n     * @return {boolean} true if the write may have been visible (meaning we'll need to reevaluate / raise\n     * events as a result).\n     */\n    WriteTree.prototype.removeWrite = function (writeId) {\n        // Note: disabling this check. It could be a transaction that preempted another transaction, and thus was applied\n        // out of order.\n        //const validClear = revert || this.allWrites_.length === 0 || writeId <= this.allWrites_[0].writeId;\n        //assert(validClear, \"Either we don't have this write, or it's the first one in the queue\");\n        var _this = this;\n        var idx = this.allWrites_.findIndex(function (s) {\n            return s.writeId === writeId;\n        });\n        util_2.assert(idx >= 0, 'removeWrite called with nonexistent writeId.');\n        var writeToRemove = this.allWrites_[idx];\n        this.allWrites_.splice(idx, 1);\n        var removedWriteWasVisible = writeToRemove.visible;\n        var removedWriteOverlapsWithOtherWrites = false;\n        var i = this.allWrites_.length - 1;\n        while (removedWriteWasVisible && i >= 0) {\n            var currentWrite = this.allWrites_[i];\n            if (currentWrite.visible) {\n                if (i >= idx && this.recordContainsPath_(currentWrite, writeToRemove.path)) {\n                    // The removed write was completely shadowed by a subsequent write.\n                    removedWriteWasVisible = false;\n                } else if (writeToRemove.path.contains(currentWrite.path)) {\n                    // Either we're covering some writes or they're covering part of us (depending on which came first).\n                    removedWriteOverlapsWithOtherWrites = true;\n                }\n            }\n            i--;\n        }\n        if (!removedWriteWasVisible) {\n            return false;\n        } else if (removedWriteOverlapsWithOtherWrites) {\n            // There's some shadowing going on. Just rebuild the visible writes from scratch.\n            this.resetTree_();\n            return true;\n        } else {\n            // There's no shadowing.  We can safely just remove the write(s) from visibleWrites.\n            if (writeToRemove.snap) {\n                this.visibleWrites_ = this.visibleWrites_.removeWrite(writeToRemove.path);\n            } else {\n                var children = writeToRemove.children;\n                util_1.forEach(children, function (childName) {\n                    _this.visibleWrites_ = _this.visibleWrites_.removeWrite(writeToRemove.path.child(childName));\n                });\n            }\n            return true;\n        }\n    };\n    /**\n     * Return a complete snapshot for the given path if there's visible write data at that path, else null.\n     * No server data is considered.\n     *\n     * @param {!Path} path\n     * @return {?Node}\n     */\n    WriteTree.prototype.getCompleteWriteData = function (path) {\n        return this.visibleWrites_.getCompleteNode(path);\n    };\n    /**\n     * Given optional, underlying server data, and an optional set of constraints (exclude some sets, include hidden\n     * writes), attempt to calculate a complete snapshot for the given path\n     *\n     * @param {!Path} treePath\n     * @param {?Node} completeServerCache\n     * @param {Array.<number>=} writeIdsToExclude An optional set to be excluded\n     * @param {boolean=} includeHiddenWrites Defaults to false, whether or not to layer on writes with visible set to false\n     * @return {?Node}\n     */\n    WriteTree.prototype.calcCompleteEventCache = function (treePath, completeServerCache, writeIdsToExclude, includeHiddenWrites) {\n        if (!writeIdsToExclude && !includeHiddenWrites) {\n            var shadowingNode = this.visibleWrites_.getCompleteNode(treePath);\n            if (shadowingNode != null) {\n                return shadowingNode;\n            } else {\n                var subMerge = this.visibleWrites_.childCompoundWrite(treePath);\n                if (subMerge.isEmpty()) {\n                    return completeServerCache;\n                } else if (completeServerCache == null && !subMerge.hasCompleteWrite(Path_1.Path.Empty)) {\n                    // We wouldn't have a complete snapshot, since there's no underlying data and no complete shadow\n                    return null;\n                } else {\n                    var layeredCache = completeServerCache || ChildrenNode_1.ChildrenNode.EMPTY_NODE;\n                    return subMerge.apply(layeredCache);\n                }\n            }\n        } else {\n            var merge = this.visibleWrites_.childCompoundWrite(treePath);\n            if (!includeHiddenWrites && merge.isEmpty()) {\n                return completeServerCache;\n            } else {\n                // If the server cache is null, and we don't have a complete cache, we need to return null\n                if (!includeHiddenWrites && completeServerCache == null && !merge.hasCompleteWrite(Path_1.Path.Empty)) {\n                    return null;\n                } else {\n                    var filter = function filter(write) {\n                        return (write.visible || includeHiddenWrites) && (!writeIdsToExclude || !~writeIdsToExclude.indexOf(write.writeId)) && (write.path.contains(treePath) || treePath.contains(write.path));\n                    };\n                    var mergeAtPath = WriteTree.layerTree_(this.allWrites_, filter, treePath);\n                    var layeredCache = completeServerCache || ChildrenNode_1.ChildrenNode.EMPTY_NODE;\n                    return mergeAtPath.apply(layeredCache);\n                }\n            }\n        }\n    };\n    /**\n     * With optional, underlying server data, attempt to return a children node of children that we have complete data for.\n     * Used when creating new views, to pre-fill their complete event children snapshot.\n     *\n     * @param {!Path} treePath\n     * @param {?ChildrenNode} completeServerChildren\n     * @return {!ChildrenNode}\n     */\n    WriteTree.prototype.calcCompleteEventChildren = function (treePath, completeServerChildren) {\n        var completeChildren = ChildrenNode_1.ChildrenNode.EMPTY_NODE;\n        var topLevelSet = this.visibleWrites_.getCompleteNode(treePath);\n        if (topLevelSet) {\n            if (!topLevelSet.isLeafNode()) {\n                // we're shadowing everything. Return the children.\n                topLevelSet.forEachChild(PriorityIndex_1.PRIORITY_INDEX, function (childName, childSnap) {\n                    completeChildren = completeChildren.updateImmediateChild(childName, childSnap);\n                });\n            }\n            return completeChildren;\n        } else if (completeServerChildren) {\n            // Layer any children we have on top of this\n            // We know we don't have a top-level set, so just enumerate existing children\n            var merge_1 = this.visibleWrites_.childCompoundWrite(treePath);\n            completeServerChildren.forEachChild(PriorityIndex_1.PRIORITY_INDEX, function (childName, childNode) {\n                var node = merge_1.childCompoundWrite(new Path_1.Path(childName)).apply(childNode);\n                completeChildren = completeChildren.updateImmediateChild(childName, node);\n            });\n            // Add any complete children we have from the set\n            merge_1.getCompleteChildren().forEach(function (namedNode) {\n                completeChildren = completeChildren.updateImmediateChild(namedNode.name, namedNode.node);\n            });\n            return completeChildren;\n        } else {\n            // We don't have anything to layer on top of. Layer on any children we have\n            // Note that we can return an empty snap if we have a defined delete\n            var merge = this.visibleWrites_.childCompoundWrite(treePath);\n            merge.getCompleteChildren().forEach(function (namedNode) {\n                completeChildren = completeChildren.updateImmediateChild(namedNode.name, namedNode.node);\n            });\n            return completeChildren;\n        }\n    };\n    /**\n     * Given that the underlying server data has updated, determine what, if anything, needs to be\n     * applied to the event cache.\n     *\n     * Possibilities:\n     *\n     * 1. No writes are shadowing. Events should be raised, the snap to be applied comes from the server data\n     *\n     * 2. Some write is completely shadowing. No events to be raised\n     *\n     * 3. Is partially shadowed. Events\n     *\n     * Either existingEventSnap or existingServerSnap must exist\n     *\n     * @param {!Path} treePath\n     * @param {!Path} childPath\n     * @param {?Node} existingEventSnap\n     * @param {?Node} existingServerSnap\n     * @return {?Node}\n     */\n    WriteTree.prototype.calcEventCacheAfterServerOverwrite = function (treePath, childPath, existingEventSnap, existingServerSnap) {\n        util_2.assert(existingEventSnap || existingServerSnap, 'Either existingEventSnap or existingServerSnap must exist');\n        var path = treePath.child(childPath);\n        if (this.visibleWrites_.hasCompleteWrite(path)) {\n            // At this point we can probably guarantee that we're in case 2, meaning no events\n            // May need to check visibility while doing the findRootMostValueAndPath call\n            return null;\n        } else {\n            // No complete shadowing. We're either partially shadowing or not shadowing at all.\n            var childMerge = this.visibleWrites_.childCompoundWrite(path);\n            if (childMerge.isEmpty()) {\n                // We're not shadowing at all. Case 1\n                return existingServerSnap.getChild(childPath);\n            } else {\n                // This could be more efficient if the serverNode + updates doesn't change the eventSnap\n                // However this is tricky to find out, since user updates don't necessary change the server\n                // snap, e.g. priority updates on empty nodes, or deep deletes. Another special case is if the server\n                // adds nodes, but doesn't change any existing writes. It is therefore not enough to\n                // only check if the updates change the serverNode.\n                // Maybe check if the merge tree contains these special cases and only do a full overwrite in that case?\n                return childMerge.apply(existingServerSnap.getChild(childPath));\n            }\n        }\n    };\n    /**\n     * Returns a complete child for a given server snap after applying all user writes or null if there is no\n     * complete child for this ChildKey.\n     *\n     * @param {!Path} treePath\n     * @param {!string} childKey\n     * @param {!CacheNode} existingServerSnap\n     * @return {?Node}\n     */\n    WriteTree.prototype.calcCompleteChild = function (treePath, childKey, existingServerSnap) {\n        var path = treePath.child(childKey);\n        var shadowingNode = this.visibleWrites_.getCompleteNode(path);\n        if (shadowingNode != null) {\n            return shadowingNode;\n        } else {\n            if (existingServerSnap.isCompleteForChild(childKey)) {\n                var childMerge = this.visibleWrites_.childCompoundWrite(path);\n                return childMerge.apply(existingServerSnap.getNode().getImmediateChild(childKey));\n            } else {\n                return null;\n            }\n        }\n    };\n    /**\n     * Returns a node if there is a complete overwrite for this path. More specifically, if there is a write at\n     * a higher path, this will return the child of that write relative to the write and this path.\n     * Returns null if there is no write at this path.\n     *\n     * @param {!Path} path\n     * @return {?Node}\n     */\n    WriteTree.prototype.shadowingWrite = function (path) {\n        return this.visibleWrites_.getCompleteNode(path);\n    };\n    /**\n     * This method is used when processing child remove events on a query. If we can, we pull in children that were outside\n     * the window, but may now be in the window.\n     *\n     * @param {!Path} treePath\n     * @param {?Node} completeServerData\n     * @param {!NamedNode} startPost\n     * @param {!number} count\n     * @param {boolean} reverse\n     * @param {!Index} index\n     * @return {!Array.<!NamedNode>}\n     */\n    WriteTree.prototype.calcIndexedSlice = function (treePath, completeServerData, startPost, count, reverse, index) {\n        var toIterate;\n        var merge = this.visibleWrites_.childCompoundWrite(treePath);\n        var shadowingNode = merge.getCompleteNode(Path_1.Path.Empty);\n        if (shadowingNode != null) {\n            toIterate = shadowingNode;\n        } else if (completeServerData != null) {\n            toIterate = merge.apply(completeServerData);\n        } else {\n            // no children to iterate on\n            return [];\n        }\n        toIterate = toIterate.withIndex(index);\n        if (!toIterate.isEmpty() && !toIterate.isLeafNode()) {\n            var nodes = [];\n            var cmp = index.getCompare();\n            var iter = reverse ? toIterate.getReverseIteratorFrom(startPost, index) : toIterate.getIteratorFrom(startPost, index);\n            var next = iter.getNext();\n            while (next && nodes.length < count) {\n                if (cmp(next, startPost) !== 0) {\n                    nodes.push(next);\n                }\n                next = iter.getNext();\n            }\n            return nodes;\n        } else {\n            return [];\n        }\n    };\n    /**\n     * @param {!WriteRecord} writeRecord\n     * @param {!Path} path\n     * @return {boolean}\n     * @private\n     */\n    WriteTree.prototype.recordContainsPath_ = function (writeRecord, path) {\n        if (writeRecord.snap) {\n            return writeRecord.path.contains(path);\n        } else {\n            // findKey can return undefined, so use !! to coerce to boolean\n            return !!util_1.findKey(writeRecord.children, function (childSnap, childName) {\n                return writeRecord.path.child(childName).contains(path);\n            });\n        }\n    };\n    /**\n     * Re-layer the writes and merges into a tree so we can efficiently calculate event snapshots\n     * @private\n     */\n    WriteTree.prototype.resetTree_ = function () {\n        this.visibleWrites_ = WriteTree.layerTree_(this.allWrites_, WriteTree.DefaultFilter_, Path_1.Path.Empty);\n        if (this.allWrites_.length > 0) {\n            this.lastWriteId_ = this.allWrites_[this.allWrites_.length - 1].writeId;\n        } else {\n            this.lastWriteId_ = -1;\n        }\n    };\n    /**\n     * The default filter used when constructing the tree. Keep everything that's visible.\n     *\n     * @param {!WriteRecord} write\n     * @return {boolean}\n     * @private\n     */\n    WriteTree.DefaultFilter_ = function (write) {\n        return write.visible;\n    };\n    /**\n     * Static method. Given an array of WriteRecords, a filter for which ones to include, and a path, construct the tree of\n     * event data at that path.\n     *\n     * @param {!Array.<!WriteRecord>} writes\n     * @param {!function(!WriteRecord):boolean} filter\n     * @param {!Path} treeRoot\n     * @return {!CompoundWrite}\n     * @private\n     */\n    WriteTree.layerTree_ = function (writes, filter, treeRoot) {\n        var compoundWrite = CompoundWrite_1.CompoundWrite.Empty;\n        for (var i = 0; i < writes.length; ++i) {\n            var write = writes[i];\n            // Theory, a later set will either:\n            // a) abort a relevant transaction, so no need to worry about excluding it from calculating that transaction\n            // b) not be relevant to a transaction (separate branch), so again will not affect the data for that transaction\n            if (filter(write)) {\n                var writePath = write.path;\n                var relativePath = void 0;\n                if (write.snap) {\n                    if (treeRoot.contains(writePath)) {\n                        relativePath = Path_1.Path.relativePath(treeRoot, writePath);\n                        compoundWrite = compoundWrite.addWrite(relativePath, write.snap);\n                    } else if (writePath.contains(treeRoot)) {\n                        relativePath = Path_1.Path.relativePath(writePath, treeRoot);\n                        compoundWrite = compoundWrite.addWrite(Path_1.Path.Empty, write.snap.getChild(relativePath));\n                    } else {\n                        // There is no overlap between root path and write path, ignore write\n                    }\n                } else if (write.children) {\n                    if (treeRoot.contains(writePath)) {\n                        relativePath = Path_1.Path.relativePath(treeRoot, writePath);\n                        compoundWrite = compoundWrite.addWrites(relativePath, write.children);\n                    } else if (writePath.contains(treeRoot)) {\n                        relativePath = Path_1.Path.relativePath(writePath, treeRoot);\n                        if (relativePath.isEmpty()) {\n                            compoundWrite = compoundWrite.addWrites(Path_1.Path.Empty, write.children);\n                        } else {\n                            var child = util_1.safeGet(write.children, relativePath.getFront());\n                            if (child) {\n                                // There exists a child in this node that matches the root path\n                                var deepNode = child.getChild(relativePath.popFront());\n                                compoundWrite = compoundWrite.addWrite(Path_1.Path.Empty, deepNode);\n                            }\n                        }\n                    } else {\n                        // There is no overlap between root path and write path, ignore write\n                    }\n                } else {\n                    throw util_2.assertionError('WriteRecord should have .snap or .children');\n                }\n            }\n        }\n        return compoundWrite;\n    };\n    return WriteTree;\n}();\nexports.WriteTree = WriteTree;\n/**\n * A WriteTreeRef wraps a WriteTree and a path, for convenient access to a particular subtree.  All of the methods\n * just proxy to the underlying WriteTree.\n *\n * @constructor\n */\nvar WriteTreeRef = /** @class */function () {\n    /**\n     * @param {!Path} path\n     * @param {!WriteTree} writeTree\n     */\n    function WriteTreeRef(path, writeTree) {\n        this.treePath_ = path;\n        this.writeTree_ = writeTree;\n    }\n    /**\n     * If possible, returns a complete event cache, using the underlying server data if possible. In addition, can be used\n     * to get a cache that includes hidden writes, and excludes arbitrary writes. Note that customizing the returned node\n     * can lead to a more expensive calculation.\n     *\n     * @param {?Node} completeServerCache\n     * @param {Array.<number>=} writeIdsToExclude Optional writes to exclude.\n     * @param {boolean=} includeHiddenWrites Defaults to false, whether or not to layer on writes with visible set to false\n     * @return {?Node}\n     */\n    WriteTreeRef.prototype.calcCompleteEventCache = function (completeServerCache, writeIdsToExclude, includeHiddenWrites) {\n        return this.writeTree_.calcCompleteEventCache(this.treePath_, completeServerCache, writeIdsToExclude, includeHiddenWrites);\n    };\n    /**\n     * If possible, returns a children node containing all of the complete children we have data for. The returned data is a\n     * mix of the given server data and write data.\n     *\n     * @param {?ChildrenNode} completeServerChildren\n     * @return {!ChildrenNode}\n     */\n    WriteTreeRef.prototype.calcCompleteEventChildren = function (completeServerChildren) {\n        return this.writeTree_.calcCompleteEventChildren(this.treePath_, completeServerChildren);\n    };\n    /**\n     * Given that either the underlying server data has updated or the outstanding writes have updated, determine what,\n     * if anything, needs to be applied to the event cache.\n     *\n     * Possibilities:\n     *\n     * 1. No writes are shadowing. Events should be raised, the snap to be applied comes from the server data\n     *\n     * 2. Some write is completely shadowing. No events to be raised\n     *\n     * 3. Is partially shadowed. Events should be raised\n     *\n     * Either existingEventSnap or existingServerSnap must exist, this is validated via an assert\n     *\n     * @param {!Path} path\n     * @param {?Node} existingEventSnap\n     * @param {?Node} existingServerSnap\n     * @return {?Node}\n     */\n    WriteTreeRef.prototype.calcEventCacheAfterServerOverwrite = function (path, existingEventSnap, existingServerSnap) {\n        return this.writeTree_.calcEventCacheAfterServerOverwrite(this.treePath_, path, existingEventSnap, existingServerSnap);\n    };\n    /**\n     * Returns a node if there is a complete overwrite for this path. More specifically, if there is a write at\n     * a higher path, this will return the child of that write relative to the write and this path.\n     * Returns null if there is no write at this path.\n     *\n     * @param {!Path} path\n     * @return {?Node}\n     */\n    WriteTreeRef.prototype.shadowingWrite = function (path) {\n        return this.writeTree_.shadowingWrite(this.treePath_.child(path));\n    };\n    /**\n     * This method is used when processing child remove events on a query. If we can, we pull in children that were outside\n     * the window, but may now be in the window\n     *\n     * @param {?Node} completeServerData\n     * @param {!NamedNode} startPost\n     * @param {!number} count\n     * @param {boolean} reverse\n     * @param {!Index} index\n     * @return {!Array.<!NamedNode>}\n     */\n    WriteTreeRef.prototype.calcIndexedSlice = function (completeServerData, startPost, count, reverse, index) {\n        return this.writeTree_.calcIndexedSlice(this.treePath_, completeServerData, startPost, count, reverse, index);\n    };\n    /**\n     * Returns a complete child for a given server snap after applying all user writes or null if there is no\n     * complete child for this ChildKey.\n     *\n     * @param {!string} childKey\n     * @param {!CacheNode} existingServerCache\n     * @return {?Node}\n     */\n    WriteTreeRef.prototype.calcCompleteChild = function (childKey, existingServerCache) {\n        return this.writeTree_.calcCompleteChild(this.treePath_, childKey, existingServerCache);\n    };\n    /**\n     * Return a WriteTreeRef for a child.\n     *\n     * @param {string} childName\n     * @return {!WriteTreeRef}\n     */\n    WriteTreeRef.prototype.child = function (childName) {\n        return new WriteTreeRef(this.treePath_.child(childName), this.writeTree_);\n    };\n    return WriteTreeRef;\n}();\nexports.WriteTreeRef = WriteTreeRef;\n\n//# sourceMappingURL=WriteTree.js.map\n\n/***/ }),\n/* 174 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar ImmutableTree_1 = __webpack_require__(71);\nvar Path_1 = __webpack_require__(4);\nvar util_1 = __webpack_require__(0);\nvar Node_1 = __webpack_require__(8);\nvar PriorityIndex_1 = __webpack_require__(6);\nvar util_2 = __webpack_require__(0);\n/**\n * This class holds a collection of writes that can be applied to nodes in unison. It abstracts away the logic with\n * dealing with priority writes and multiple nested writes. At any given path there is only allowed to be one write\n * modifying that path. Any write to an existing path or shadowing an existing path will modify that existing write\n * to reflect the write added.\n *\n * @constructor\n * @param {!ImmutableTree.<!Node>} writeTree\n */\nvar CompoundWrite = /** @class */function () {\n    function CompoundWrite(writeTree_) {\n        this.writeTree_ = writeTree_;\n    }\n    /**\n     * @param {!Path} path\n     * @param {!Node} node\n     * @return {!CompoundWrite}\n     */\n    CompoundWrite.prototype.addWrite = function (path, node) {\n        if (path.isEmpty()) {\n            return new CompoundWrite(new ImmutableTree_1.ImmutableTree(node));\n        } else {\n            var rootmost = this.writeTree_.findRootMostValueAndPath(path);\n            if (rootmost != null) {\n                var rootMostPath = rootmost.path;\n                var value = rootmost.value;\n                var relativePath = Path_1.Path.relativePath(rootMostPath, path);\n                value = value.updateChild(relativePath, node);\n                return new CompoundWrite(this.writeTree_.set(rootMostPath, value));\n            } else {\n                var subtree = new ImmutableTree_1.ImmutableTree(node);\n                var newWriteTree = this.writeTree_.setTree(path, subtree);\n                return new CompoundWrite(newWriteTree);\n            }\n        }\n    };\n    /**\n     * @param {!Path} path\n     * @param {!Object.<string, !Node>} updates\n     * @return {!CompoundWrite}\n     */\n    CompoundWrite.prototype.addWrites = function (path, updates) {\n        var newWrite = this;\n        util_1.forEach(updates, function (childKey, node) {\n            newWrite = newWrite.addWrite(path.child(childKey), node);\n        });\n        return newWrite;\n    };\n    /**\n     * Will remove a write at the given path and deeper paths. This will <em>not</em> modify a write at a higher\n     * location, which must be removed by calling this method with that path.\n     *\n     * @param {!Path} path The path at which a write and all deeper writes should be removed\n     * @return {!CompoundWrite} The new CompoundWrite with the removed path\n     */\n    CompoundWrite.prototype.removeWrite = function (path) {\n        if (path.isEmpty()) {\n            return CompoundWrite.Empty;\n        } else {\n            var newWriteTree = this.writeTree_.setTree(path, ImmutableTree_1.ImmutableTree.Empty);\n            return new CompoundWrite(newWriteTree);\n        }\n    };\n    /**\n     * Returns whether this CompoundWrite will fully overwrite a node at a given location and can therefore be\n     * considered \"complete\".\n     *\n     * @param {!Path} path The path to check for\n     * @return {boolean} Whether there is a complete write at that path\n     */\n    CompoundWrite.prototype.hasCompleteWrite = function (path) {\n        return this.getCompleteNode(path) != null;\n    };\n    /**\n     * Returns a node for a path if and only if the node is a \"complete\" overwrite at that path. This will not aggregate\n     * writes from deeper paths, but will return child nodes from a more shallow path.\n     *\n     * @param {!Path} path The path to get a complete write\n     * @return {?Node} The node if complete at that path, or null otherwise.\n     */\n    CompoundWrite.prototype.getCompleteNode = function (path) {\n        var rootmost = this.writeTree_.findRootMostValueAndPath(path);\n        if (rootmost != null) {\n            return this.writeTree_.get(rootmost.path).getChild(Path_1.Path.relativePath(rootmost.path, path));\n        } else {\n            return null;\n        }\n    };\n    /**\n     * Returns all children that are guaranteed to be a complete overwrite.\n     *\n     * @return {!Array.<NamedNode>} A list of all complete children.\n     */\n    CompoundWrite.prototype.getCompleteChildren = function () {\n        var children = [];\n        var node = this.writeTree_.value;\n        if (node != null) {\n            // If it's a leaf node, it has no children; so nothing to do.\n            if (!node.isLeafNode()) {\n                node.forEachChild(PriorityIndex_1.PRIORITY_INDEX, function (childName, childNode) {\n                    children.push(new Node_1.NamedNode(childName, childNode));\n                });\n            }\n        } else {\n            this.writeTree_.children.inorderTraversal(function (childName, childTree) {\n                if (childTree.value != null) {\n                    children.push(new Node_1.NamedNode(childName, childTree.value));\n                }\n            });\n        }\n        return children;\n    };\n    /**\n     * @param {!Path} path\n     * @return {!CompoundWrite}\n     */\n    CompoundWrite.prototype.childCompoundWrite = function (path) {\n        if (path.isEmpty()) {\n            return this;\n        } else {\n            var shadowingNode = this.getCompleteNode(path);\n            if (shadowingNode != null) {\n                return new CompoundWrite(new ImmutableTree_1.ImmutableTree(shadowingNode));\n            } else {\n                return new CompoundWrite(this.writeTree_.subtree(path));\n            }\n        }\n    };\n    /**\n     * Returns true if this CompoundWrite is empty and therefore does not modify any nodes.\n     * @return {boolean} Whether this CompoundWrite is empty\n     */\n    CompoundWrite.prototype.isEmpty = function () {\n        return this.writeTree_.isEmpty();\n    };\n    /**\n     * Applies this CompoundWrite to a node. The node is returned with all writes from this CompoundWrite applied to the\n     * node\n     * @param {!Node} node The node to apply this CompoundWrite to\n     * @return {!Node} The node with all writes applied\n     */\n    CompoundWrite.prototype.apply = function (node) {\n        return CompoundWrite.applySubtreeWrite_(Path_1.Path.Empty, this.writeTree_, node);\n    };\n    /**\n     * @type {!CompoundWrite}\n     */\n    CompoundWrite.Empty = new CompoundWrite(new ImmutableTree_1.ImmutableTree(null));\n    /**\n     * @param {!Path} relativePath\n     * @param {!ImmutableTree.<!Node>} writeTree\n     * @param {!Node} node\n     * @return {!Node}\n     * @private\n     */\n    CompoundWrite.applySubtreeWrite_ = function (relativePath, writeTree, node) {\n        if (writeTree.value != null) {\n            // Since there a write is always a leaf, we're done here\n            return node.updateChild(relativePath, writeTree.value);\n        } else {\n            var priorityWrite_1 = null;\n            writeTree.children.inorderTraversal(function (childKey, childTree) {\n                if (childKey === '.priority') {\n                    // Apply priorities at the end so we don't update priorities for either empty nodes or forget\n                    // to apply priorities to empty nodes that are later filled\n                    util_2.assert(childTree.value !== null, 'Priority writes must always be leaf nodes');\n                    priorityWrite_1 = childTree.value;\n                } else {\n                    node = CompoundWrite.applySubtreeWrite_(relativePath.child(childKey), childTree, node);\n                }\n            });\n            // If there was a priority write, we only apply it if the node is not empty\n            if (!node.getChild(relativePath).isEmpty() && priorityWrite_1 !== null) {\n                node = node.updateChild(relativePath.child('.priority'), priorityWrite_1);\n            }\n            return node;\n        }\n    };\n    return CompoundWrite;\n}();\nexports.CompoundWrite = CompoundWrite;\n\n//# sourceMappingURL=CompoundWrite.js.map\n\n/***/ }),\n/* 175 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar ChildrenNode_1 = __webpack_require__(7);\n/**\n * Mutable object which basically just stores a reference to the \"latest\" immutable snapshot.\n *\n * @constructor\n */\nvar SnapshotHolder = /** @class */function () {\n    function SnapshotHolder() {\n        this.rootNode_ = ChildrenNode_1.ChildrenNode.EMPTY_NODE;\n    }\n    SnapshotHolder.prototype.getNode = function (path) {\n        return this.rootNode_.getChild(path);\n    };\n    SnapshotHolder.prototype.updateSnapshot = function (path, newSnapshotNode) {\n        this.rootNode_ = this.rootNode_.updateChild(path, newSnapshotNode);\n    };\n    return SnapshotHolder;\n}();\nexports.SnapshotHolder = SnapshotHolder;\n\n//# sourceMappingURL=SnapshotHolder.js.map\n\n/***/ }),\n/* 176 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = __webpack_require__(2);\n/**\n * Abstraction around FirebaseApp's token fetching capabilities.\n */\nvar AuthTokenProvider = /** @class */function () {\n    /**\n     * @param {!FirebaseApp} app_\n     */\n    function AuthTokenProvider(app_) {\n        this.app_ = app_;\n    }\n    /**\n     * @param {boolean} forceRefresh\n     * @return {!Promise<FirebaseAuthTokenData>}\n     */\n    AuthTokenProvider.prototype.getToken = function (forceRefresh) {\n        return this.app_['INTERNAL']['getToken'](forceRefresh).then(null,\n        // .catch\n        function (error) {\n            // TODO: Need to figure out all the cases this is raised and whether\n            // this makes sense.\n            if (error && error.code === 'auth/token-not-initialized') {\n                util_1.log('Got auth/token-not-initialized error.  Treating as null token.');\n                return null;\n            } else {\n                return Promise.reject(error);\n            }\n        });\n    };\n    AuthTokenProvider.prototype.addTokenChangeListener = function (listener) {\n        // TODO: We might want to wrap the listener and call it with no args to\n        // avoid a leaky abstraction, but that makes removing the listener harder.\n        this.app_['INTERNAL']['addAuthTokenListener'](listener);\n    };\n    AuthTokenProvider.prototype.removeTokenChangeListener = function (listener) {\n        this.app_['INTERNAL']['removeAuthTokenListener'](listener);\n    };\n    AuthTokenProvider.prototype.notifyForInvalidToken = function () {\n        var errorMessage = 'Provided authentication credentials for the app named \"' + this.app_.name + '\" are invalid. This usually indicates your app was not ' + 'initialized correctly. ';\n        if ('credential' in this.app_.options) {\n            errorMessage += 'Make sure the \"credential\" property provided to initializeApp() ' + 'is authorized to access the specified \"databaseURL\" and is from the correct ' + 'project.';\n        } else if ('serviceAccount' in this.app_.options) {\n            errorMessage += 'Make sure the \"serviceAccount\" property provided to initializeApp() ' + 'is authorized to access the specified \"databaseURL\" and is from the correct ' + 'project.';\n        } else {\n            errorMessage += 'Make sure the \"apiKey\" and \"databaseURL\" properties provided to ' + 'initializeApp() match the values provided for your app at ' + 'https://console.firebase.google.com/.';\n        }\n        util_1.warn(errorMessage);\n    };\n    return AuthTokenProvider;\n}();\nexports.AuthTokenProvider = AuthTokenProvider;\n\n//# sourceMappingURL=AuthTokenProvider.js.map\n\n/***/ }),\n/* 177 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = __webpack_require__(0);\nvar util_2 = __webpack_require__(0);\n/**\n * Tracks a collection of stats.\n *\n * @constructor\n */\nvar StatsCollection = /** @class */function () {\n    function StatsCollection() {\n        this.counters_ = {};\n    }\n    StatsCollection.prototype.incrementCounter = function (name, amount) {\n        if (amount === void 0) {\n            amount = 1;\n        }\n        if (!util_2.contains(this.counters_, name)) this.counters_[name] = 0;\n        this.counters_[name] += amount;\n    };\n    StatsCollection.prototype.get = function () {\n        return util_1.deepCopy(this.counters_);\n    };\n    return StatsCollection;\n}();\nexports.StatsCollection = StatsCollection;\n\n//# sourceMappingURL=StatsCollection.js.map\n\n/***/ }),\n/* 178 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = __webpack_require__(0);\nvar util_2 = __webpack_require__(2);\nvar StatsListener_1 = __webpack_require__(100);\n// Assuming some apps may have a short amount of time on page, and a bulk of firebase operations probably\n// happen on page load, we try to report our first set of stats pretty quickly, but we wait at least 10\n// seconds to try to ensure the Firebase connection is established / settled.\nvar FIRST_STATS_MIN_TIME = 10 * 1000;\nvar FIRST_STATS_MAX_TIME = 30 * 1000;\n// We'll continue to report stats on average every 5 minutes.\nvar REPORT_STATS_INTERVAL = 5 * 60 * 1000;\n/**\n * @constructor\n */\nvar StatsReporter = /** @class */function () {\n    /**\n     * @param collection\n     * @param server_\n     */\n    function StatsReporter(collection, server_) {\n        this.server_ = server_;\n        this.statsToReport_ = {};\n        this.statsListener_ = new StatsListener_1.StatsListener(collection);\n        var timeout = FIRST_STATS_MIN_TIME + (FIRST_STATS_MAX_TIME - FIRST_STATS_MIN_TIME) * Math.random();\n        util_2.setTimeoutNonBlocking(this.reportStats_.bind(this), Math.floor(timeout));\n    }\n    StatsReporter.prototype.includeStat = function (stat) {\n        this.statsToReport_[stat] = true;\n    };\n    StatsReporter.prototype.reportStats_ = function () {\n        var _this = this;\n        var stats = this.statsListener_.get();\n        var reportedStats = {};\n        var haveStatsToReport = false;\n        util_1.forEach(stats, function (stat, value) {\n            if (value > 0 && util_1.contains(_this.statsToReport_, stat)) {\n                reportedStats[stat] = value;\n                haveStatsToReport = true;\n            }\n        });\n        if (haveStatsToReport) {\n            this.server_.reportStats(reportedStats);\n        }\n        // queue our next run.\n        util_2.setTimeoutNonBlocking(this.reportStats_.bind(this), Math.floor(Math.random() * 2 * REPORT_STATS_INTERVAL));\n    };\n    return StatsReporter;\n}();\nexports.StatsReporter = StatsReporter;\n\n//# sourceMappingURL=StatsReporter.js.map\n\n/***/ }),\n/* 179 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = __webpack_require__(2);\n/**\n * The event queue serves a few purposes:\n * 1. It ensures we maintain event order in the face of event callbacks doing operations that result in more\n *    events being queued.\n * 2. raiseQueuedEvents() handles being called reentrantly nicely.  That is, if in the course of raising events,\n *    raiseQueuedEvents() is called again, the \"inner\" call will pick up raising events where the \"outer\" call\n *    left off, ensuring that the events are still raised synchronously and in order.\n * 3. You can use raiseEventsAtPath and raiseEventsForChangedPath to ensure only relevant previously-queued\n *    events are raised synchronously.\n *\n * NOTE: This can all go away if/when we move to async events.\n *\n * @constructor\n */\nvar EventQueue = /** @class */function () {\n    function EventQueue() {\n        /**\n         * @private\n         * @type {!Array.<EventList>}\n         */\n        this.eventLists_ = [];\n        /**\n         * Tracks recursion depth of raiseQueuedEvents_, for debugging purposes.\n         * @private\n         * @type {!number}\n         */\n        this.recursionDepth_ = 0;\n    }\n    /**\n     * @param {!Array.<Event>} eventDataList The new events to queue.\n     */\n    EventQueue.prototype.queueEvents = function (eventDataList) {\n        // We group events by path, storing them in a single EventList, to make it easier to skip over them quickly.\n        var currList = null;\n        for (var i = 0; i < eventDataList.length; i++) {\n            var eventData = eventDataList[i];\n            var eventPath = eventData.getPath();\n            if (currList !== null && !eventPath.equals(currList.getPath())) {\n                this.eventLists_.push(currList);\n                currList = null;\n            }\n            if (currList === null) {\n                currList = new EventList(eventPath);\n            }\n            currList.add(eventData);\n        }\n        if (currList) {\n            this.eventLists_.push(currList);\n        }\n    };\n    /**\n     * Queues the specified events and synchronously raises all events (including previously queued ones)\n     * for the specified path.\n     *\n     * It is assumed that the new events are all for the specified path.\n     *\n     * @param {!Path} path The path to raise events for.\n     * @param {!Array.<Event>} eventDataList The new events to raise.\n     */\n    EventQueue.prototype.raiseEventsAtPath = function (path, eventDataList) {\n        this.queueEvents(eventDataList);\n        this.raiseQueuedEventsMatchingPredicate_(function (eventPath) {\n            return eventPath.equals(path);\n        });\n    };\n    /**\n     * Queues the specified events and synchronously raises all events (including previously queued ones) for\n     * locations related to the specified change path (i.e. all ancestors and descendants).\n     *\n     * It is assumed that the new events are all related (ancestor or descendant) to the specified path.\n     *\n     * @param {!Path} changedPath The path to raise events for.\n     * @param {!Array.<!Event>} eventDataList The events to raise\n     */\n    EventQueue.prototype.raiseEventsForChangedPath = function (changedPath, eventDataList) {\n        this.queueEvents(eventDataList);\n        this.raiseQueuedEventsMatchingPredicate_(function (eventPath) {\n            return eventPath.contains(changedPath) || changedPath.contains(eventPath);\n        });\n    };\n    /**\n     * @param {!function(!Path):boolean} predicate\n     * @private\n     */\n    EventQueue.prototype.raiseQueuedEventsMatchingPredicate_ = function (predicate) {\n        this.recursionDepth_++;\n        var sentAll = true;\n        for (var i = 0; i < this.eventLists_.length; i++) {\n            var eventList = this.eventLists_[i];\n            if (eventList) {\n                var eventPath = eventList.getPath();\n                if (predicate(eventPath)) {\n                    this.eventLists_[i].raise();\n                    this.eventLists_[i] = null;\n                } else {\n                    sentAll = false;\n                }\n            }\n        }\n        if (sentAll) {\n            this.eventLists_ = [];\n        }\n        this.recursionDepth_--;\n    };\n    return EventQueue;\n}();\nexports.EventQueue = EventQueue;\n/**\n * @param {!Path} path\n * @constructor\n */\nvar EventList = /** @class */function () {\n    function EventList(path_) {\n        this.path_ = path_;\n        /**\n         * @type {!Array.<Event>}\n         * @private\n         */\n        this.events_ = [];\n    }\n    /**\n     * @param {!Event} eventData\n     */\n    EventList.prototype.add = function (eventData) {\n        this.events_.push(eventData);\n    };\n    /**\n     * Iterates through the list and raises each event\n     */\n    EventList.prototype.raise = function () {\n        for (var i = 0; i < this.events_.length; i++) {\n            var eventData = this.events_[i];\n            if (eventData !== null) {\n                this.events_[i] = null;\n                var eventFn = eventData.getEventRunner();\n                if (util_1.logger) {\n                    util_1.log('event: ' + eventData.toString());\n                }\n                util_1.exceptionGuard(eventFn);\n            }\n        }\n    };\n    /**\n     * @return {!Path}\n     */\n    EventList.prototype.getPath = function () {\n        return this.path_;\n    };\n    return EventList;\n}();\nexports.EventList = EventList;\n\n//# sourceMappingURL=EventQueue.js.map\n\n/***/ }),\n/* 180 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nvar __extends = undefined && undefined.__extends || function () {\n    var extendStatics = Object.setPrototypeOf || { __proto__: [] } instanceof Array && function (d, b) {\n        d.__proto__ = b;\n    } || function (d, b) {\n        for (var p in b) {\n            if (b.hasOwnProperty(p)) d[p] = b[p];\n        }\n    };\n    return function (d, b) {\n        extendStatics(d, b);\n        function __() {\n            this.constructor = d;\n        }\n        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n    };\n}();\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar EventEmitter_1 = __webpack_require__(102);\nvar util_1 = __webpack_require__(0);\n/**\n * @extends {EventEmitter}\n */\nvar VisibilityMonitor = /** @class */function (_super) {\n    __extends(VisibilityMonitor, _super);\n    function VisibilityMonitor() {\n        var _this = _super.call(this, ['visible']) || this;\n        var hidden;\n        var visibilityChange;\n        if (typeof document !== 'undefined' && typeof document.addEventListener !== 'undefined') {\n            if (typeof document['hidden'] !== 'undefined') {\n                // Opera 12.10 and Firefox 18 and later support\n                visibilityChange = 'visibilitychange';\n                hidden = 'hidden';\n            } else if (typeof document['mozHidden'] !== 'undefined') {\n                visibilityChange = 'mozvisibilitychange';\n                hidden = 'mozHidden';\n            } else if (typeof document['msHidden'] !== 'undefined') {\n                visibilityChange = 'msvisibilitychange';\n                hidden = 'msHidden';\n            } else if (typeof document['webkitHidden'] !== 'undefined') {\n                visibilityChange = 'webkitvisibilitychange';\n                hidden = 'webkitHidden';\n            }\n        }\n        // Initially, we always assume we are visible. This ensures that in browsers\n        // without page visibility support or in cases where we are never visible\n        // (e.g. chrome extension), we act as if we are visible, i.e. don't delay\n        // reconnects\n        _this.visible_ = true;\n        if (visibilityChange) {\n            document.addEventListener(visibilityChange, function () {\n                var visible = !document[hidden];\n                if (visible !== _this.visible_) {\n                    _this.visible_ = visible;\n                    _this.trigger('visible', visible);\n                }\n            }, false);\n        }\n        return _this;\n    }\n    VisibilityMonitor.getInstance = function () {\n        return new VisibilityMonitor();\n    };\n    /**\n     * @param {!string} eventType\n     * @return {Array.<boolean>}\n     */\n    VisibilityMonitor.prototype.getInitialEvent = function (eventType) {\n        util_1.assert(eventType === 'visible', 'Unknown event type: ' + eventType);\n        return [this.visible_];\n    };\n    return VisibilityMonitor;\n}(EventEmitter_1.EventEmitter);\nexports.VisibilityMonitor = VisibilityMonitor;\n\n//# sourceMappingURL=VisibilityMonitor.js.map\n\n/***/ }),\n/* 181 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nvar __extends = undefined && undefined.__extends || function () {\n    var extendStatics = Object.setPrototypeOf || { __proto__: [] } instanceof Array && function (d, b) {\n        d.__proto__ = b;\n    } || function (d, b) {\n        for (var p in b) {\n            if (b.hasOwnProperty(p)) d[p] = b[p];\n        }\n    };\n    return function (d, b) {\n        extendStatics(d, b);\n        function __() {\n            this.constructor = d;\n        }\n        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n    };\n}();\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = __webpack_require__(0);\nvar EventEmitter_1 = __webpack_require__(102);\nvar util_2 = __webpack_require__(0);\n/**\n * Monitors online state (as reported by window.online/offline events).\n *\n * The expectation is that this could have many false positives (thinks we are online\n * when we're not), but no false negatives.  So we can safely use it to determine when\n * we definitely cannot reach the internet.\n *\n * @extends {EventEmitter}\n */\nvar OnlineMonitor = /** @class */function (_super) {\n    __extends(OnlineMonitor, _super);\n    function OnlineMonitor() {\n        var _this = _super.call(this, ['online']) || this;\n        _this.online_ = true;\n        // We've had repeated complaints that Cordova apps can get stuck \"offline\", e.g.\n        // https://forum.ionicframework.com/t/firebase-connection-is-lost-and-never-come-back/43810\n        // It would seem that the 'online' event does not always fire consistently. So we disable it\n        // for Cordova.\n        if (typeof window !== 'undefined' && typeof window.addEventListener !== 'undefined' && !util_2.isMobileCordova()) {\n            window.addEventListener('online', function () {\n                if (!_this.online_) {\n                    _this.online_ = true;\n                    _this.trigger('online', true);\n                }\n            }, false);\n            window.addEventListener('offline', function () {\n                if (_this.online_) {\n                    _this.online_ = false;\n                    _this.trigger('online', false);\n                }\n            }, false);\n        }\n        return _this;\n    }\n    OnlineMonitor.getInstance = function () {\n        return new OnlineMonitor();\n    };\n    /**\n     * @param {!string} eventType\n     * @return {Array.<boolean>}\n     */\n    OnlineMonitor.prototype.getInitialEvent = function (eventType) {\n        util_1.assert(eventType === 'online', 'Unknown event type: ' + eventType);\n        return [this.online_];\n    };\n    /**\n     * @return {boolean}\n     */\n    OnlineMonitor.prototype.currentlyOnline = function () {\n        return this.online_;\n    };\n    return OnlineMonitor;\n}(EventEmitter_1.EventEmitter);\nexports.OnlineMonitor = OnlineMonitor;\n\n//# sourceMappingURL=OnlineMonitor.js.map\n\n/***/ }),\n/* 182 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar BrowserPollConnection_1 = __webpack_require__(104);\nvar WebSocketConnection_1 = __webpack_require__(105);\nvar util_1 = __webpack_require__(2);\n/**\n * Currently simplistic, this class manages what transport a Connection should use at various stages of its\n * lifecycle.\n *\n * It starts with longpolling in a browser, and httppolling on node. It then upgrades to websockets if\n * they are available.\n * @constructor\n */\nvar TransportManager = /** @class */function () {\n    /**\n     * @param {!RepoInfo} repoInfo Metadata around the namespace we're connecting to\n     */\n    function TransportManager(repoInfo) {\n        this.initTransports_(repoInfo);\n    }\n    Object.defineProperty(TransportManager, \"ALL_TRANSPORTS\", {\n        /**\n         * @const\n         * @type {!Array.<function(new:Transport, string, RepoInfo, string=)>}\n         */\n        get: function get() {\n            return [BrowserPollConnection_1.BrowserPollConnection, WebSocketConnection_1.WebSocketConnection];\n        },\n        enumerable: true,\n        configurable: true\n    });\n    /**\n     * @param {!RepoInfo} repoInfo\n     * @private\n     */\n    TransportManager.prototype.initTransports_ = function (repoInfo) {\n        var isWebSocketsAvailable = WebSocketConnection_1.WebSocketConnection && WebSocketConnection_1.WebSocketConnection['isAvailable']();\n        var isSkipPollConnection = isWebSocketsAvailable && !WebSocketConnection_1.WebSocketConnection.previouslyFailed();\n        if (repoInfo.webSocketOnly) {\n            if (!isWebSocketsAvailable) util_1.warn(\"wss:// URL used, but browser isn't known to support websockets.  Trying anyway.\");\n            isSkipPollConnection = true;\n        }\n        if (isSkipPollConnection) {\n            this.transports_ = [WebSocketConnection_1.WebSocketConnection];\n        } else {\n            var transports_1 = this.transports_ = [];\n            util_1.each(TransportManager.ALL_TRANSPORTS, function (i, transport) {\n                if (transport && transport['isAvailable']()) {\n                    transports_1.push(transport);\n                }\n            });\n        }\n    };\n    /**\n     * @return {function(new:Transport, !string, !RepoInfo, string=, string=)} The constructor for the\n     * initial transport to use\n     */\n    TransportManager.prototype.initialTransport = function () {\n        if (this.transports_.length > 0) {\n            return this.transports_[0];\n        } else {\n            throw new Error('No transports available');\n        }\n    };\n    /**\n     * @return {?function(new:Transport, function(),function(), string=)} The constructor for the next\n     * transport, or null\n     */\n    TransportManager.prototype.upgradeTransport = function () {\n        if (this.transports_.length > 1) {\n            return this.transports_[1];\n        } else {\n            return null;\n        }\n    };\n    return TransportManager;\n}();\nexports.TransportManager = TransportManager;\n\n//# sourceMappingURL=TransportManager.js.map\n\n/***/ }),\n/* 183 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = __webpack_require__(2);\n/**\n * This class ensures the packets from the server arrive in order\n * This class takes data from the server and ensures it gets passed into the callbacks in order.\n * @constructor\n */\nvar PacketReceiver = /** @class */function () {\n    /**\n     * @param onMessage_\n     */\n    function PacketReceiver(onMessage_) {\n        this.onMessage_ = onMessage_;\n        this.pendingResponses = [];\n        this.currentResponseNum = 0;\n        this.closeAfterResponse = -1;\n        this.onClose = null;\n    }\n    PacketReceiver.prototype.closeAfter = function (responseNum, callback) {\n        this.closeAfterResponse = responseNum;\n        this.onClose = callback;\n        if (this.closeAfterResponse < this.currentResponseNum) {\n            this.onClose();\n            this.onClose = null;\n        }\n    };\n    /**\n     * Each message from the server comes with a response number, and an array of data. The responseNumber\n     * allows us to ensure that we process them in the right order, since we can't be guaranteed that all\n     * browsers will respond in the same order as the requests we sent\n     * @param {number} requestNum\n     * @param {Array} data\n     */\n    PacketReceiver.prototype.handleResponse = function (requestNum, data) {\n        var _this = this;\n        this.pendingResponses[requestNum] = data;\n        var _loop_1 = function _loop_1() {\n            var toProcess = this_1.pendingResponses[this_1.currentResponseNum];\n            delete this_1.pendingResponses[this_1.currentResponseNum];\n            var _loop_2 = function _loop_2(i) {\n                if (toProcess[i]) {\n                    util_1.exceptionGuard(function () {\n                        _this.onMessage_(toProcess[i]);\n                    });\n                }\n            };\n            for (var i = 0; i < toProcess.length; ++i) {\n                _loop_2(i);\n            }\n            if (this_1.currentResponseNum === this_1.closeAfterResponse) {\n                if (this_1.onClose) {\n                    this_1.onClose();\n                    this_1.onClose = null;\n                }\n                return \"break\";\n            }\n            this_1.currentResponseNum++;\n        };\n        var this_1 = this;\n        while (this.pendingResponses[this.currentResponseNum]) {\n            var state_1 = _loop_1();\n            if (state_1 === \"break\") break;\n        }\n    };\n    return PacketReceiver;\n}();\nexports.PacketReceiver = PacketReceiver;\n\n//# sourceMappingURL=PacketReceiver.js.map\n\n/***/ }),\n/* 184 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nvar __extends = undefined && undefined.__extends || function () {\n    var extendStatics = Object.setPrototypeOf || { __proto__: [] } instanceof Array && function (d, b) {\n        d.__proto__ = b;\n    } || function (d, b) {\n        for (var p in b) {\n            if (b.hasOwnProperty(p)) d[p] = b[p];\n        }\n    };\n    return function (d, b) {\n        extendStatics(d, b);\n        function __() {\n            this.constructor = d;\n        }\n        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n    };\n}();\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = __webpack_require__(0);\nvar util_2 = __webpack_require__(2);\nvar util_3 = __webpack_require__(0);\nvar util_4 = __webpack_require__(0);\nvar util_5 = __webpack_require__(0);\nvar ServerActions_1 = __webpack_require__(106);\n/**\n * An implementation of ServerActions that communicates with the server via REST requests.\n * This is mostly useful for compatibility with crawlers, where we don't want to spin up a full\n * persistent connection (using WebSockets or long-polling)\n */\nvar ReadonlyRestClient = /** @class */function (_super) {\n    __extends(ReadonlyRestClient, _super);\n    /**\n     * @param {!RepoInfo} repoInfo_ Data about the namespace we are connecting to\n     * @param {function(string, *, boolean, ?number)} onDataUpdate_ A callback for new data from the server\n     * @param {AuthTokenProvider} authTokenProvider_\n     * @implements {ServerActions}\n     */\n    function ReadonlyRestClient(repoInfo_, onDataUpdate_, authTokenProvider_) {\n        var _this = _super.call(this) || this;\n        _this.repoInfo_ = repoInfo_;\n        _this.onDataUpdate_ = onDataUpdate_;\n        _this.authTokenProvider_ = authTokenProvider_;\n        /** @private {function(...[*])} */\n        _this.log_ = util_2.logWrapper('p:rest:');\n        /**\n         * We don't actually need to track listens, except to prevent us calling an onComplete for a listen\n         * that's been removed. :-/\n         *\n         * @private {!Object.<string, !Object>}\n         */\n        _this.listens_ = {};\n        return _this;\n    }\n    ReadonlyRestClient.prototype.reportStats = function (stats) {\n        throw new Error('Method not implemented.');\n    };\n    /**\n     * @param {!Query} query\n     * @param {?number=} tag\n     * @return {string}\n     * @private\n     */\n    ReadonlyRestClient.getListenId_ = function (query, tag) {\n        if (tag !== undefined) {\n            return 'tag$' + tag;\n        } else {\n            util_1.assert(query.getQueryParams().isDefault(), \"should have a tag if it's not a default query.\");\n            return query.path.toString();\n        }\n    };\n    /** @inheritDoc */\n    ReadonlyRestClient.prototype.listen = function (query, currentHashFn, tag, onComplete) {\n        var _this = this;\n        var pathString = query.path.toString();\n        this.log_('Listen called for ' + pathString + ' ' + query.queryIdentifier());\n        // Mark this listener so we can tell if it's removed.\n        var listenId = ReadonlyRestClient.getListenId_(query, tag);\n        var thisListen = {};\n        this.listens_[listenId] = thisListen;\n        var queryStringParamaters = query.getQueryParams().toRestQueryStringParameters();\n        this.restRequest_(pathString + '.json', queryStringParamaters, function (error, result) {\n            var data = result;\n            if (error === 404) {\n                data = null;\n                error = null;\n            }\n            if (error === null) {\n                _this.onDataUpdate_(pathString, data, /*isMerge=*/false, tag);\n            }\n            if (util_4.safeGet(_this.listens_, listenId) === thisListen) {\n                var status_1;\n                if (!error) {\n                    status_1 = 'ok';\n                } else if (error == 401) {\n                    status_1 = 'permission_denied';\n                } else {\n                    status_1 = 'rest_error:' + error;\n                }\n                onComplete(status_1, null);\n            }\n        });\n    };\n    /** @inheritDoc */\n    ReadonlyRestClient.prototype.unlisten = function (query, tag) {\n        var listenId = ReadonlyRestClient.getListenId_(query, tag);\n        delete this.listens_[listenId];\n    };\n    /** @inheritDoc */\n    ReadonlyRestClient.prototype.refreshAuthToken = function (token) {\n        // no-op since we just always call getToken.\n    };\n    /**\n     * Performs a REST request to the given path, with the provided query string parameters,\n     * and any auth credentials we have.\n     *\n     * @param {!string} pathString\n     * @param {!Object.<string, *>} queryStringParameters\n     * @param {?function(?number, *=)} callback\n     * @private\n     */\n    ReadonlyRestClient.prototype.restRequest_ = function (pathString, queryStringParameters, callback) {\n        var _this = this;\n        if (queryStringParameters === void 0) {\n            queryStringParameters = {};\n        }\n        queryStringParameters['format'] = 'export';\n        this.authTokenProvider_.getToken( /*forceRefresh=*/false).then(function (authTokenData) {\n            var authToken = authTokenData && authTokenData.accessToken;\n            if (authToken) {\n                queryStringParameters['auth'] = authToken;\n            }\n            var url = (_this.repoInfo_.secure ? 'https://' : 'http://') + _this.repoInfo_.host + pathString + '?' + util_5.querystring(queryStringParameters);\n            _this.log_('Sending REST request for ' + url);\n            var xhr = new XMLHttpRequest();\n            xhr.onreadystatechange = function () {\n                if (callback && xhr.readyState === 4) {\n                    _this.log_('REST Response for ' + url + ' received. status:', xhr.status, 'response:', xhr.responseText);\n                    var res = null;\n                    if (xhr.status >= 200 && xhr.status < 300) {\n                        try {\n                            res = util_3.jsonEval(xhr.responseText);\n                        } catch (e) {\n                            util_2.warn('Failed to parse JSON response for ' + url + ': ' + xhr.responseText);\n                        }\n                        callback(null, res);\n                    } else {\n                        // 401 and 404 are expected.\n                        if (xhr.status !== 401 && xhr.status !== 404) {\n                            util_2.warn('Got unsuccessful REST response for ' + url + ' Status: ' + xhr.status);\n                        }\n                        callback(xhr.status);\n                    }\n                    callback = null;\n                }\n            };\n            xhr.open('GET', url, /*asynchronous=*/true);\n            xhr.send();\n        });\n    };\n    return ReadonlyRestClient;\n}(ServerActions_1.ServerActions);\nexports.ReadonlyRestClient = ReadonlyRestClient;\n\n//# sourceMappingURL=ReadonlyRestClient.js.map\n\n/***/ }),\n/* 185 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = __webpack_require__(0);\nvar util_2 = __webpack_require__(2);\nvar KeyIndex_1 = __webpack_require__(22);\nvar PriorityIndex_1 = __webpack_require__(6);\nvar ValueIndex_1 = __webpack_require__(89);\nvar PathIndex_1 = __webpack_require__(93);\nvar IndexedFilter_1 = __webpack_require__(72);\nvar LimitedFilter_1 = __webpack_require__(186);\nvar RangedFilter_1 = __webpack_require__(107);\nvar util_3 = __webpack_require__(0);\n/**\n * This class is an immutable-from-the-public-api struct containing a set of query parameters defining a\n * range to be returned for a particular location. It is assumed that validation of parameters is done at the\n * user-facing API level, so it is not done here.\n * @constructor\n */\nvar QueryParams = /** @class */function () {\n    function QueryParams() {\n        this.limitSet_ = false;\n        this.startSet_ = false;\n        this.startNameSet_ = false;\n        this.endSet_ = false;\n        this.endNameSet_ = false;\n        this.limit_ = 0;\n        this.viewFrom_ = '';\n        this.indexStartValue_ = null;\n        this.indexStartName_ = '';\n        this.indexEndValue_ = null;\n        this.indexEndName_ = '';\n        this.index_ = PriorityIndex_1.PRIORITY_INDEX;\n    }\n    /**\n     * @return {boolean}\n     */\n    QueryParams.prototype.hasStart = function () {\n        return this.startSet_;\n    };\n    /**\n     * @return {boolean} True if it would return from left.\n     */\n    QueryParams.prototype.isViewFromLeft = function () {\n        if (this.viewFrom_ === '') {\n            // limit(), rather than limitToFirst or limitToLast was called.\n            // This means that only one of startSet_ and endSet_ is true. Use them\n            // to calculate which side of the view to anchor to. If neither is set,\n            // anchor to the end.\n            return this.startSet_;\n        } else {\n            return this.viewFrom_ === QueryParams.WIRE_PROTOCOL_CONSTANTS_.VIEW_FROM_LEFT;\n        }\n    };\n    /**\n     * Only valid to call if hasStart() returns true\n     * @return {*}\n     */\n    QueryParams.prototype.getIndexStartValue = function () {\n        util_1.assert(this.startSet_, 'Only valid if start has been set');\n        return this.indexStartValue_;\n    };\n    /**\n     * Only valid to call if hasStart() returns true.\n     * Returns the starting key name for the range defined by these query parameters\n     * @return {!string}\n     */\n    QueryParams.prototype.getIndexStartName = function () {\n        util_1.assert(this.startSet_, 'Only valid if start has been set');\n        if (this.startNameSet_) {\n            return this.indexStartName_;\n        } else {\n            return util_2.MIN_NAME;\n        }\n    };\n    /**\n     * @return {boolean}\n     */\n    QueryParams.prototype.hasEnd = function () {\n        return this.endSet_;\n    };\n    /**\n     * Only valid to call if hasEnd() returns true.\n     * @return {*}\n     */\n    QueryParams.prototype.getIndexEndValue = function () {\n        util_1.assert(this.endSet_, 'Only valid if end has been set');\n        return this.indexEndValue_;\n    };\n    /**\n     * Only valid to call if hasEnd() returns true.\n     * Returns the end key name for the range defined by these query parameters\n     * @return {!string}\n     */\n    QueryParams.prototype.getIndexEndName = function () {\n        util_1.assert(this.endSet_, 'Only valid if end has been set');\n        if (this.endNameSet_) {\n            return this.indexEndName_;\n        } else {\n            return util_2.MAX_NAME;\n        }\n    };\n    /**\n     * @return {boolean}\n     */\n    QueryParams.prototype.hasLimit = function () {\n        return this.limitSet_;\n    };\n    /**\n     * @return {boolean} True if a limit has been set and it has been explicitly anchored\n     */\n    QueryParams.prototype.hasAnchoredLimit = function () {\n        return this.limitSet_ && this.viewFrom_ !== '';\n    };\n    /**\n     * Only valid to call if hasLimit() returns true\n     * @return {!number}\n     */\n    QueryParams.prototype.getLimit = function () {\n        util_1.assert(this.limitSet_, 'Only valid if limit has been set');\n        return this.limit_;\n    };\n    /**\n     * @return {!Index}\n     */\n    QueryParams.prototype.getIndex = function () {\n        return this.index_;\n    };\n    /**\n     * @return {!QueryParams}\n     * @private\n     */\n    QueryParams.prototype.copy_ = function () {\n        var copy = new QueryParams();\n        copy.limitSet_ = this.limitSet_;\n        copy.limit_ = this.limit_;\n        copy.startSet_ = this.startSet_;\n        copy.indexStartValue_ = this.indexStartValue_;\n        copy.startNameSet_ = this.startNameSet_;\n        copy.indexStartName_ = this.indexStartName_;\n        copy.endSet_ = this.endSet_;\n        copy.indexEndValue_ = this.indexEndValue_;\n        copy.endNameSet_ = this.endNameSet_;\n        copy.indexEndName_ = this.indexEndName_;\n        copy.index_ = this.index_;\n        copy.viewFrom_ = this.viewFrom_;\n        return copy;\n    };\n    /**\n     * @param {!number} newLimit\n     * @return {!QueryParams}\n     */\n    QueryParams.prototype.limit = function (newLimit) {\n        var newParams = this.copy_();\n        newParams.limitSet_ = true;\n        newParams.limit_ = newLimit;\n        newParams.viewFrom_ = '';\n        return newParams;\n    };\n    /**\n     * @param {!number} newLimit\n     * @return {!QueryParams}\n     */\n    QueryParams.prototype.limitToFirst = function (newLimit) {\n        var newParams = this.copy_();\n        newParams.limitSet_ = true;\n        newParams.limit_ = newLimit;\n        newParams.viewFrom_ = QueryParams.WIRE_PROTOCOL_CONSTANTS_.VIEW_FROM_LEFT;\n        return newParams;\n    };\n    /**\n     * @param {!number} newLimit\n     * @return {!QueryParams}\n     */\n    QueryParams.prototype.limitToLast = function (newLimit) {\n        var newParams = this.copy_();\n        newParams.limitSet_ = true;\n        newParams.limit_ = newLimit;\n        newParams.viewFrom_ = QueryParams.WIRE_PROTOCOL_CONSTANTS_.VIEW_FROM_RIGHT;\n        return newParams;\n    };\n    /**\n     * @param {*} indexValue\n     * @param {?string=} key\n     * @return {!QueryParams}\n     */\n    QueryParams.prototype.startAt = function (indexValue, key) {\n        var newParams = this.copy_();\n        newParams.startSet_ = true;\n        if (!(indexValue !== undefined)) {\n            indexValue = null;\n        }\n        newParams.indexStartValue_ = indexValue;\n        if (key != null) {\n            newParams.startNameSet_ = true;\n            newParams.indexStartName_ = key;\n        } else {\n            newParams.startNameSet_ = false;\n            newParams.indexStartName_ = '';\n        }\n        return newParams;\n    };\n    /**\n     * @param {*} indexValue\n     * @param {?string=} key\n     * @return {!QueryParams}\n     */\n    QueryParams.prototype.endAt = function (indexValue, key) {\n        var newParams = this.copy_();\n        newParams.endSet_ = true;\n        if (!(indexValue !== undefined)) {\n            indexValue = null;\n        }\n        newParams.indexEndValue_ = indexValue;\n        if (key !== undefined) {\n            newParams.endNameSet_ = true;\n            newParams.indexEndName_ = key;\n        } else {\n            newParams.endNameSet_ = false;\n            newParams.indexEndName_ = '';\n        }\n        return newParams;\n    };\n    /**\n     * @param {!Index} index\n     * @return {!QueryParams}\n     */\n    QueryParams.prototype.orderBy = function (index) {\n        var newParams = this.copy_();\n        newParams.index_ = index;\n        return newParams;\n    };\n    /**\n     * @return {!Object}\n     */\n    QueryParams.prototype.getQueryObject = function () {\n        var WIRE_PROTOCOL_CONSTANTS = QueryParams.WIRE_PROTOCOL_CONSTANTS_;\n        var obj = {};\n        if (this.startSet_) {\n            obj[WIRE_PROTOCOL_CONSTANTS.INDEX_START_VALUE] = this.indexStartValue_;\n            if (this.startNameSet_) {\n                obj[WIRE_PROTOCOL_CONSTANTS.INDEX_START_NAME] = this.indexStartName_;\n            }\n        }\n        if (this.endSet_) {\n            obj[WIRE_PROTOCOL_CONSTANTS.INDEX_END_VALUE] = this.indexEndValue_;\n            if (this.endNameSet_) {\n                obj[WIRE_PROTOCOL_CONSTANTS.INDEX_END_NAME] = this.indexEndName_;\n            }\n        }\n        if (this.limitSet_) {\n            obj[WIRE_PROTOCOL_CONSTANTS.LIMIT] = this.limit_;\n            var viewFrom = this.viewFrom_;\n            if (viewFrom === '') {\n                if (this.isViewFromLeft()) {\n                    viewFrom = WIRE_PROTOCOL_CONSTANTS.VIEW_FROM_LEFT;\n                } else {\n                    viewFrom = WIRE_PROTOCOL_CONSTANTS.VIEW_FROM_RIGHT;\n                }\n            }\n            obj[WIRE_PROTOCOL_CONSTANTS.VIEW_FROM] = viewFrom;\n        }\n        // For now, priority index is the default, so we only specify if it's some other index\n        if (this.index_ !== PriorityIndex_1.PRIORITY_INDEX) {\n            obj[WIRE_PROTOCOL_CONSTANTS.INDEX] = this.index_.toString();\n        }\n        return obj;\n    };\n    /**\n     * @return {boolean}\n     */\n    QueryParams.prototype.loadsAllData = function () {\n        return !(this.startSet_ || this.endSet_ || this.limitSet_);\n    };\n    /**\n     * @return {boolean}\n     */\n    QueryParams.prototype.isDefault = function () {\n        return this.loadsAllData() && this.index_ == PriorityIndex_1.PRIORITY_INDEX;\n    };\n    /**\n     * @return {!NodeFilter}\n     */\n    QueryParams.prototype.getNodeFilter = function () {\n        if (this.loadsAllData()) {\n            return new IndexedFilter_1.IndexedFilter(this.getIndex());\n        } else if (this.hasLimit()) {\n            return new LimitedFilter_1.LimitedFilter(this);\n        } else {\n            return new RangedFilter_1.RangedFilter(this);\n        }\n    };\n    /**\n     * Returns a set of REST query string parameters representing this query.\n     *\n     * @return {!Object.<string,*>} query string parameters\n     */\n    QueryParams.prototype.toRestQueryStringParameters = function () {\n        var REST_CONSTANTS = QueryParams.REST_QUERY_CONSTANTS_;\n        var qs = {};\n        if (this.isDefault()) {\n            return qs;\n        }\n        var orderBy;\n        if (this.index_ === PriorityIndex_1.PRIORITY_INDEX) {\n            orderBy = REST_CONSTANTS.PRIORITY_INDEX;\n        } else if (this.index_ === ValueIndex_1.VALUE_INDEX) {\n            orderBy = REST_CONSTANTS.VALUE_INDEX;\n        } else if (this.index_ === KeyIndex_1.KEY_INDEX) {\n            orderBy = REST_CONSTANTS.KEY_INDEX;\n        } else {\n            util_1.assert(this.index_ instanceof PathIndex_1.PathIndex, 'Unrecognized index type!');\n            orderBy = this.index_.toString();\n        }\n        qs[REST_CONSTANTS.ORDER_BY] = util_3.stringify(orderBy);\n        if (this.startSet_) {\n            qs[REST_CONSTANTS.START_AT] = util_3.stringify(this.indexStartValue_);\n            if (this.startNameSet_) {\n                qs[REST_CONSTANTS.START_AT] += ',' + util_3.stringify(this.indexStartName_);\n            }\n        }\n        if (this.endSet_) {\n            qs[REST_CONSTANTS.END_AT] = util_3.stringify(this.indexEndValue_);\n            if (this.endNameSet_) {\n                qs[REST_CONSTANTS.END_AT] += ',' + util_3.stringify(this.indexEndName_);\n            }\n        }\n        if (this.limitSet_) {\n            if (this.isViewFromLeft()) {\n                qs[REST_CONSTANTS.LIMIT_TO_FIRST] = this.limit_;\n            } else {\n                qs[REST_CONSTANTS.LIMIT_TO_LAST] = this.limit_;\n            }\n        }\n        return qs;\n    };\n    /**\n     * Wire Protocol Constants\n     * @const\n     * @enum {string}\n     * @private\n     */\n    QueryParams.WIRE_PROTOCOL_CONSTANTS_ = {\n        INDEX_START_VALUE: 'sp',\n        INDEX_START_NAME: 'sn',\n        INDEX_END_VALUE: 'ep',\n        INDEX_END_NAME: 'en',\n        LIMIT: 'l',\n        VIEW_FROM: 'vf',\n        VIEW_FROM_LEFT: 'l',\n        VIEW_FROM_RIGHT: 'r',\n        INDEX: 'i'\n    };\n    /**\n     * REST Query Constants\n     * @const\n     * @enum {string}\n     * @private\n     */\n    QueryParams.REST_QUERY_CONSTANTS_ = {\n        ORDER_BY: 'orderBy',\n        PRIORITY_INDEX: '$priority',\n        VALUE_INDEX: '$value',\n        KEY_INDEX: '$key',\n        START_AT: 'startAt',\n        END_AT: 'endAt',\n        LIMIT_TO_FIRST: 'limitToFirst',\n        LIMIT_TO_LAST: 'limitToLast'\n    };\n    /**\n     * Default, empty query parameters\n     * @type {!QueryParams}\n     * @const\n     */\n    QueryParams.DEFAULT = new QueryParams();\n    return QueryParams;\n}();\nexports.QueryParams = QueryParams;\n\n//# sourceMappingURL=QueryParams.js.map\n\n/***/ }),\n/* 186 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar RangedFilter_1 = __webpack_require__(107);\nvar ChildrenNode_1 = __webpack_require__(7);\nvar Node_1 = __webpack_require__(8);\nvar util_1 = __webpack_require__(0);\nvar Change_1 = __webpack_require__(15);\n/**\n * Applies a limit and a range to a node and uses RangedFilter to do the heavy lifting where possible\n *\n * @constructor\n * @implements {NodeFilter}\n */\nvar LimitedFilter = /** @class */function () {\n    /**\n     * @param {!QueryParams} params\n     */\n    function LimitedFilter(params) {\n        this.rangedFilter_ = new RangedFilter_1.RangedFilter(params);\n        this.index_ = params.getIndex();\n        this.limit_ = params.getLimit();\n        this.reverse_ = !params.isViewFromLeft();\n    }\n    /**\n     * @inheritDoc\n     */\n    LimitedFilter.prototype.updateChild = function (snap, key, newChild, affectedPath, source, optChangeAccumulator) {\n        if (!this.rangedFilter_.matches(new Node_1.NamedNode(key, newChild))) {\n            newChild = ChildrenNode_1.ChildrenNode.EMPTY_NODE;\n        }\n        if (snap.getImmediateChild(key).equals(newChild)) {\n            // No change\n            return snap;\n        } else if (snap.numChildren() < this.limit_) {\n            return this.rangedFilter_.getIndexedFilter().updateChild(snap, key, newChild, affectedPath, source, optChangeAccumulator);\n        } else {\n            return this.fullLimitUpdateChild_(snap, key, newChild, source, optChangeAccumulator);\n        }\n    };\n    /**\n     * @inheritDoc\n     */\n    LimitedFilter.prototype.updateFullNode = function (oldSnap, newSnap, optChangeAccumulator) {\n        var filtered;\n        if (newSnap.isLeafNode() || newSnap.isEmpty()) {\n            // Make sure we have a children node with the correct index, not a leaf node;\n            filtered = ChildrenNode_1.ChildrenNode.EMPTY_NODE.withIndex(this.index_);\n        } else {\n            if (this.limit_ * 2 < newSnap.numChildren() && newSnap.isIndexed(this.index_)) {\n                // Easier to build up a snapshot, since what we're given has more than twice the elements we want\n                filtered = ChildrenNode_1.ChildrenNode.EMPTY_NODE.withIndex(this.index_);\n                // anchor to the startPost, endPost, or last element as appropriate\n                var iterator = void 0;\n                if (this.reverse_) {\n                    iterator = newSnap.getReverseIteratorFrom(this.rangedFilter_.getEndPost(), this.index_);\n                } else {\n                    iterator = newSnap.getIteratorFrom(this.rangedFilter_.getStartPost(), this.index_);\n                }\n                var count = 0;\n                while (iterator.hasNext() && count < this.limit_) {\n                    var next = iterator.getNext();\n                    var inRange = void 0;\n                    if (this.reverse_) {\n                        inRange = this.index_.compare(this.rangedFilter_.getStartPost(), next) <= 0;\n                    } else {\n                        inRange = this.index_.compare(next, this.rangedFilter_.getEndPost()) <= 0;\n                    }\n                    if (inRange) {\n                        filtered = filtered.updateImmediateChild(next.name, next.node);\n                        count++;\n                    } else {\n                        // if we have reached the end post, we cannot keep adding elemments\n                        break;\n                    }\n                }\n            } else {\n                // The snap contains less than twice the limit. Faster to delete from the snap than build up a new one\n                filtered = newSnap.withIndex(this.index_);\n                // Don't support priorities on queries\n                filtered = filtered.updatePriority(ChildrenNode_1.ChildrenNode.EMPTY_NODE);\n                var startPost = void 0;\n                var endPost = void 0;\n                var cmp = void 0;\n                var iterator = void 0;\n                if (this.reverse_) {\n                    iterator = filtered.getReverseIterator(this.index_);\n                    startPost = this.rangedFilter_.getEndPost();\n                    endPost = this.rangedFilter_.getStartPost();\n                    var indexCompare_1 = this.index_.getCompare();\n                    cmp = function cmp(a, b) {\n                        return indexCompare_1(b, a);\n                    };\n                } else {\n                    iterator = filtered.getIterator(this.index_);\n                    startPost = this.rangedFilter_.getStartPost();\n                    endPost = this.rangedFilter_.getEndPost();\n                    cmp = this.index_.getCompare();\n                }\n                var count = 0;\n                var foundStartPost = false;\n                while (iterator.hasNext()) {\n                    var next = iterator.getNext();\n                    if (!foundStartPost && cmp(startPost, next) <= 0) {\n                        // start adding\n                        foundStartPost = true;\n                    }\n                    var inRange = foundStartPost && count < this.limit_ && cmp(next, endPost) <= 0;\n                    if (inRange) {\n                        count++;\n                    } else {\n                        filtered = filtered.updateImmediateChild(next.name, ChildrenNode_1.ChildrenNode.EMPTY_NODE);\n                    }\n                }\n            }\n        }\n        return this.rangedFilter_.getIndexedFilter().updateFullNode(oldSnap, filtered, optChangeAccumulator);\n    };\n    /**\n     * @inheritDoc\n     */\n    LimitedFilter.prototype.updatePriority = function (oldSnap, newPriority) {\n        // Don't support priorities on queries\n        return oldSnap;\n    };\n    /**\n     * @inheritDoc\n     */\n    LimitedFilter.prototype.filtersNodes = function () {\n        return true;\n    };\n    /**\n     * @inheritDoc\n     */\n    LimitedFilter.prototype.getIndexedFilter = function () {\n        return this.rangedFilter_.getIndexedFilter();\n    };\n    /**\n     * @inheritDoc\n     */\n    LimitedFilter.prototype.getIndex = function () {\n        return this.index_;\n    };\n    /**\n     * @param {!Node} snap\n     * @param {string} childKey\n     * @param {!Node} childSnap\n     * @param {!CompleteChildSource} source\n     * @param {?ChildChangeAccumulator} changeAccumulator\n     * @return {!Node}\n     * @private\n     */\n    LimitedFilter.prototype.fullLimitUpdateChild_ = function (snap, childKey, childSnap, source, changeAccumulator) {\n        // TODO: rename all cache stuff etc to general snap terminology\n        var cmp;\n        if (this.reverse_) {\n            var indexCmp_1 = this.index_.getCompare();\n            cmp = function cmp(a, b) {\n                return indexCmp_1(b, a);\n            };\n        } else {\n            cmp = this.index_.getCompare();\n        }\n        var oldEventCache = snap;\n        util_1.assert(oldEventCache.numChildren() == this.limit_, '');\n        var newChildNamedNode = new Node_1.NamedNode(childKey, childSnap);\n        var windowBoundary = this.reverse_ ? oldEventCache.getFirstChild(this.index_) : oldEventCache.getLastChild(this.index_);\n        var inRange = this.rangedFilter_.matches(newChildNamedNode);\n        if (oldEventCache.hasChild(childKey)) {\n            var oldChildSnap = oldEventCache.getImmediateChild(childKey);\n            var nextChild = source.getChildAfterChild(this.index_, windowBoundary, this.reverse_);\n            while (nextChild != null && (nextChild.name == childKey || oldEventCache.hasChild(nextChild.name))) {\n                // There is a weird edge case where a node is updated as part of a merge in the write tree, but hasn't\n                // been applied to the limited filter yet. Ignore this next child which will be updated later in\n                // the limited filter...\n                nextChild = source.getChildAfterChild(this.index_, nextChild, this.reverse_);\n            }\n            var compareNext = nextChild == null ? 1 : cmp(nextChild, newChildNamedNode);\n            var remainsInWindow = inRange && !childSnap.isEmpty() && compareNext >= 0;\n            if (remainsInWindow) {\n                if (changeAccumulator != null) {\n                    changeAccumulator.trackChildChange(Change_1.Change.childChangedChange(childKey, childSnap, oldChildSnap));\n                }\n                return oldEventCache.updateImmediateChild(childKey, childSnap);\n            } else {\n                if (changeAccumulator != null) {\n                    changeAccumulator.trackChildChange(Change_1.Change.childRemovedChange(childKey, oldChildSnap));\n                }\n                var newEventCache = oldEventCache.updateImmediateChild(childKey, ChildrenNode_1.ChildrenNode.EMPTY_NODE);\n                var nextChildInRange = nextChild != null && this.rangedFilter_.matches(nextChild);\n                if (nextChildInRange) {\n                    if (changeAccumulator != null) {\n                        changeAccumulator.trackChildChange(Change_1.Change.childAddedChange(nextChild.name, nextChild.node));\n                    }\n                    return newEventCache.updateImmediateChild(nextChild.name, nextChild.node);\n                } else {\n                    return newEventCache;\n                }\n            }\n        } else if (childSnap.isEmpty()) {\n            // we're deleting a node, but it was not in the window, so ignore it\n            return snap;\n        } else if (inRange) {\n            if (cmp(windowBoundary, newChildNamedNode) >= 0) {\n                if (changeAccumulator != null) {\n                    changeAccumulator.trackChildChange(Change_1.Change.childRemovedChange(windowBoundary.name, windowBoundary.node));\n                    changeAccumulator.trackChildChange(Change_1.Change.childAddedChange(childKey, childSnap));\n                }\n                return oldEventCache.updateImmediateChild(childKey, childSnap).updateImmediateChild(windowBoundary.name, ChildrenNode_1.ChildrenNode.EMPTY_NODE);\n            } else {\n                return snap;\n            }\n        } else {\n            return snap;\n        }\n    };\n    return LimitedFilter;\n}();\nexports.LimitedFilter = LimitedFilter;\n\n//# sourceMappingURL=LimitedFilter.js.map\n\n/***/ }),\n/* 187 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nvar _typeof = typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; };\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = __webpack_require__(0);\nvar Reference_1 = __webpack_require__(69);\nvar DataSnapshot_1 = __webpack_require__(70);\nvar Path_1 = __webpack_require__(4);\nvar Tree_1 = __webpack_require__(188);\nvar PriorityIndex_1 = __webpack_require__(6);\nvar util_2 = __webpack_require__(2);\nvar ServerValues_1 = __webpack_require__(94);\nvar validation_1 = __webpack_require__(11);\nvar util_3 = __webpack_require__(0);\nvar nodeFromJSON_1 = __webpack_require__(23);\nvar ChildrenNode_1 = __webpack_require__(7);\nvar Repo_1 = __webpack_require__(39);\n// TODO: This is pretty messy.  Ideally, a lot of this would move into FirebaseData, or a transaction-specific\n// component used by FirebaseData, but it has ties to user callbacks (transaction update and onComplete) as well\n// as the realtime connection (to send transactions to the server).  So that all needs to be decoupled first.\n// For now it's part of Repo, but in its own file.\n/**\n * @enum {number}\n */\nvar TransactionStatus;\n(function (TransactionStatus) {\n    // We've run the transaction and updated transactionResultData_ with the result, but it isn't currently sent to the\n    // server. A transaction will go from RUN -> SENT -> RUN if it comes back from the server as rejected due to\n    // mismatched hash.\n    TransactionStatus[TransactionStatus[\"RUN\"] = 0] = \"RUN\";\n    // We've run the transaction and sent it to the server and it's currently outstanding (hasn't come back as accepted\n    // or rejected yet).\n    TransactionStatus[TransactionStatus[\"SENT\"] = 1] = \"SENT\";\n    // Temporary state used to mark completed transactions (whether successful or aborted).  The transaction will be\n    // removed when we get a chance to prune completed ones.\n    TransactionStatus[TransactionStatus[\"COMPLETED\"] = 2] = \"COMPLETED\";\n    // Used when an already-sent transaction needs to be aborted (e.g. due to a conflicting set() call that was made).\n    // If it comes back as unsuccessful, we'll abort it.\n    TransactionStatus[TransactionStatus[\"SENT_NEEDS_ABORT\"] = 3] = \"SENT_NEEDS_ABORT\";\n    // Temporary state used to mark transactions that need to be aborted.\n    TransactionStatus[TransactionStatus[\"NEEDS_ABORT\"] = 4] = \"NEEDS_ABORT\";\n})(TransactionStatus = exports.TransactionStatus || (exports.TransactionStatus = {}));\n/**\n * If a transaction does not succeed after 25 retries, we abort it.  Among other things this ensure that if there's\n * ever a bug causing a mismatch between client / server hashes for some data, we won't retry indefinitely.\n * @type {number}\n * @const\n * @private\n */\nRepo_1.Repo.MAX_TRANSACTION_RETRIES_ = 25;\n/**\n * Setup the transaction data structures\n * @private\n */\nRepo_1.Repo.prototype.transactions_init_ = function () {\n    /**\n     * Stores queues of outstanding transactions for Firebase locations.\n     *\n     * @type {!Tree.<Array.<!Transaction>>}\n     * @private\n     */\n    this.transactionQueueTree_ = new Tree_1.Tree();\n};\n/**\n * Creates a new transaction, adds it to the transactions we're tracking, and sends it to the server if possible.\n *\n * @param {!Path} path Path at which to do transaction.\n * @param {function(*):*} transactionUpdate Update callback.\n * @param {?function(?Error, boolean, ?DataSnapshot)} onComplete Completion callback.\n * @param {boolean} applyLocally Whether or not to make intermediate results visible\n */\nRepo_1.Repo.prototype.startTransaction = function (path, transactionUpdate, onComplete, applyLocally) {\n    this.log_('transaction on ' + path);\n    // Add a watch to make sure we get server updates.\n    var valueCallback = function valueCallback() {};\n    var watchRef = new Reference_1.Reference(this, path);\n    watchRef.on('value', valueCallback);\n    var unwatcher = function unwatcher() {\n        watchRef.off('value', valueCallback);\n    };\n    // Initialize transaction.\n    var transaction = {\n        path: path,\n        update: transactionUpdate,\n        onComplete: onComplete,\n        // One of TransactionStatus enums.\n        status: null,\n        // Used when combining transactions at different locations to figure out which one goes first.\n        order: util_2.LUIDGenerator(),\n        // Whether to raise local events for this transaction.\n        applyLocally: applyLocally,\n        // Count of how many times we've retried the transaction.\n        retryCount: 0,\n        // Function to call to clean up our .on() listener.\n        unwatcher: unwatcher,\n        // Stores why a transaction was aborted.\n        abortReason: null,\n        currentWriteId: null,\n        currentInputSnapshot: null,\n        currentOutputSnapshotRaw: null,\n        currentOutputSnapshotResolved: null\n    };\n    // Run transaction initially.\n    var currentState = this.getLatestState_(path);\n    transaction.currentInputSnapshot = currentState;\n    var newVal = transaction.update(currentState.val());\n    if (newVal === undefined) {\n        // Abort transaction.\n        transaction.unwatcher();\n        transaction.currentOutputSnapshotRaw = null;\n        transaction.currentOutputSnapshotResolved = null;\n        if (transaction.onComplete) {\n            // We just set the input snapshot, so this cast should be safe\n            var snapshot = new DataSnapshot_1.DataSnapshot(transaction.currentInputSnapshot, new Reference_1.Reference(this, transaction.path), PriorityIndex_1.PRIORITY_INDEX);\n            transaction.onComplete(null, false, snapshot);\n        }\n    } else {\n        validation_1.validateFirebaseData('transaction failed: Data returned ', newVal, transaction.path);\n        // Mark as run and add to our queue.\n        transaction.status = TransactionStatus.RUN;\n        var queueNode = this.transactionQueueTree_.subTree(path);\n        var nodeQueue = queueNode.getValue() || [];\n        nodeQueue.push(transaction);\n        queueNode.setValue(nodeQueue);\n        // Update visibleData and raise events\n        // Note: We intentionally raise events after updating all of our transaction state, since the user could\n        // start new transactions from the event callbacks.\n        var priorityForNode = void 0;\n        if ((typeof newVal === \"undefined\" ? \"undefined\" : _typeof(newVal)) === 'object' && newVal !== null && util_3.contains(newVal, '.priority')) {\n            priorityForNode = util_3.safeGet(newVal, '.priority');\n            util_1.assert(validation_1.isValidPriority(priorityForNode), 'Invalid priority returned by transaction. ' + 'Priority must be a valid string, finite number, server value, or null.');\n        } else {\n            var currentNode = this.serverSyncTree_.calcCompleteEventCache(path) || ChildrenNode_1.ChildrenNode.EMPTY_NODE;\n            priorityForNode = currentNode.getPriority().val();\n        }\n        priorityForNode /** @type {null|number|string} */ = priorityForNode;\n        var serverValues = this.generateServerValues();\n        var newNodeUnresolved = nodeFromJSON_1.nodeFromJSON(newVal, priorityForNode);\n        var newNode = ServerValues_1.resolveDeferredValueSnapshot(newNodeUnresolved, serverValues);\n        transaction.currentOutputSnapshotRaw = newNodeUnresolved;\n        transaction.currentOutputSnapshotResolved = newNode;\n        transaction.currentWriteId = this.getNextWriteId_();\n        var events = this.serverSyncTree_.applyUserOverwrite(path, newNode, transaction.currentWriteId, transaction.applyLocally);\n        this.eventQueue_.raiseEventsForChangedPath(path, events);\n        this.sendReadyTransactions_();\n    }\n};\n/**\n * @param {!Path} path\n * @param {Array.<number>=} excludeSets A specific set to exclude\n * @return {Node}\n * @private\n */\nRepo_1.Repo.prototype.getLatestState_ = function (path, excludeSets) {\n    return this.serverSyncTree_.calcCompleteEventCache(path, excludeSets) || ChildrenNode_1.ChildrenNode.EMPTY_NODE;\n};\n/**\n * Sends any already-run transactions that aren't waiting for outstanding transactions to\n * complete.\n *\n * Externally it's called with no arguments, but it calls itself recursively with a particular\n * transactionQueueTree node to recurse through the tree.\n *\n * @param {Tree.<Array.<Transaction>>=} node  transactionQueueTree node to start at.\n * @private\n */\nRepo_1.Repo.prototype.sendReadyTransactions_ = function (node) {\n    var _this = this;\n    if (node === void 0) {\n        node = this.transactionQueueTree_;\n    }\n    // Before recursing, make sure any completed transactions are removed.\n    if (!node) {\n        this.pruneCompletedTransactionsBelowNode_(node);\n    }\n    if (node.getValue() !== null) {\n        var queue = this.buildTransactionQueue_(node);\n        util_1.assert(queue.length > 0, 'Sending zero length transaction queue');\n        var allRun = queue.every(function (transaction) {\n            return transaction.status === TransactionStatus.RUN;\n        });\n        // If they're all run (and not sent), we can send them.  Else, we must wait.\n        if (allRun) {\n            this.sendTransactionQueue_(node.path(), queue);\n        }\n    } else if (node.hasChildren()) {\n        node.forEachChild(function (childNode) {\n            _this.sendReadyTransactions_(childNode);\n        });\n    }\n};\n/**\n * Given a list of run transactions, send them to the server and then handle the result (success or failure).\n *\n * @param {!Path} path The location of the queue.\n * @param {!Array.<Transaction>} queue Queue of transactions under the specified location.\n * @private\n */\nRepo_1.Repo.prototype.sendTransactionQueue_ = function (path, queue) {\n    var _this = this;\n    // Mark transactions as sent and increment retry count!\n    var setsToIgnore = queue.map(function (txn) {\n        return txn.currentWriteId;\n    });\n    var latestState = this.getLatestState_(path, setsToIgnore);\n    var snapToSend = latestState;\n    var latestHash = latestState.hash();\n    for (var i = 0; i < queue.length; i++) {\n        var txn = queue[i];\n        util_1.assert(txn.status === TransactionStatus.RUN, 'tryToSendTransactionQueue_: items in queue should all be run.');\n        txn.status = TransactionStatus.SENT;\n        txn.retryCount++;\n        var relativePath = Path_1.Path.relativePath(path, txn.path);\n        // If we've gotten to this point, the output snapshot must be defined.\n        snapToSend = snapToSend.updateChild(relativePath /**@type {!Node} */, txn.currentOutputSnapshotRaw);\n    }\n    var dataToSend = snapToSend.val(true);\n    var pathToSend = path;\n    // Send the put.\n    this.server_.put(pathToSend.toString(), dataToSend, function (status) {\n        _this.log_('transaction put response', {\n            path: pathToSend.toString(),\n            status: status\n        });\n        var events = [];\n        if (status === 'ok') {\n            // Queue up the callbacks and fire them after cleaning up all of our transaction state, since\n            // the callback could trigger more transactions or sets.\n            var callbacks = [];\n            for (var i = 0; i < queue.length; i++) {\n                queue[i].status = TransactionStatus.COMPLETED;\n                events = events.concat(_this.serverSyncTree_.ackUserWrite(queue[i].currentWriteId));\n                if (queue[i].onComplete) {\n                    // We never unset the output snapshot, and given that this transaction is complete, it should be set\n                    var node = queue[i].currentOutputSnapshotResolved;\n                    var ref = new Reference_1.Reference(_this, queue[i].path);\n                    var snapshot = new DataSnapshot_1.DataSnapshot(node, ref, PriorityIndex_1.PRIORITY_INDEX);\n                    callbacks.push(queue[i].onComplete.bind(null, null, true, snapshot));\n                }\n                queue[i].unwatcher();\n            }\n            // Now remove the completed transactions.\n            _this.pruneCompletedTransactionsBelowNode_(_this.transactionQueueTree_.subTree(path));\n            // There may be pending transactions that we can now send.\n            _this.sendReadyTransactions_();\n            _this.eventQueue_.raiseEventsForChangedPath(path, events);\n            // Finally, trigger onComplete callbacks.\n            for (var i = 0; i < callbacks.length; i++) {\n                util_2.exceptionGuard(callbacks[i]);\n            }\n        } else {\n            // transactions are no longer sent.  Update their status appropriately.\n            if (status === 'datastale') {\n                for (var i = 0; i < queue.length; i++) {\n                    if (queue[i].status === TransactionStatus.SENT_NEEDS_ABORT) queue[i].status = TransactionStatus.NEEDS_ABORT;else queue[i].status = TransactionStatus.RUN;\n                }\n            } else {\n                util_2.warn('transaction at ' + pathToSend.toString() + ' failed: ' + status);\n                for (var i = 0; i < queue.length; i++) {\n                    queue[i].status = TransactionStatus.NEEDS_ABORT;\n                    queue[i].abortReason = status;\n                }\n            }\n            _this.rerunTransactions_(path);\n        }\n    }, latestHash);\n};\n/**\n * Finds all transactions dependent on the data at changedPath and reruns them.\n *\n * Should be called any time cached data changes.\n *\n * Return the highest path that was affected by rerunning transactions.  This is the path at which events need to\n * be raised for.\n *\n * @param {!Path} changedPath The path in mergedData that changed.\n * @return {!Path} The rootmost path that was affected by rerunning transactions.\n * @private\n */\nRepo_1.Repo.prototype.rerunTransactions_ = function (changedPath) {\n    var rootMostTransactionNode = this.getAncestorTransactionNode_(changedPath);\n    var path = rootMostTransactionNode.path();\n    var queue = this.buildTransactionQueue_(rootMostTransactionNode);\n    this.rerunTransactionQueue_(queue, path);\n    return path;\n};\n/**\n * Does all the work of rerunning transactions (as well as cleans up aborted transactions and whatnot).\n *\n * @param {Array.<Transaction>} queue The queue of transactions to run.\n * @param {!Path} path The path the queue is for.\n * @private\n */\nRepo_1.Repo.prototype.rerunTransactionQueue_ = function (queue, path) {\n    if (queue.length === 0) {\n        return; // Nothing to do!\n    }\n    // Queue up the callbacks and fire them after cleaning up all of our transaction state, since\n    // the callback could trigger more transactions or sets.\n    var callbacks = [];\n    var events = [];\n    // Ignore all of the sets we're going to re-run.\n    var txnsToRerun = queue.filter(function (q) {\n        return q.status === TransactionStatus.RUN;\n    });\n    var setsToIgnore = txnsToRerun.map(function (q) {\n        return q.currentWriteId;\n    });\n    for (var i = 0; i < queue.length; i++) {\n        var transaction = queue[i];\n        var relativePath = Path_1.Path.relativePath(path, transaction.path);\n        var abortTransaction = false,\n            abortReason = void 0;\n        util_1.assert(relativePath !== null, 'rerunTransactionsUnderNode_: relativePath should not be null.');\n        if (transaction.status === TransactionStatus.NEEDS_ABORT) {\n            abortTransaction = true;\n            abortReason = transaction.abortReason;\n            events = events.concat(this.serverSyncTree_.ackUserWrite(transaction.currentWriteId, true));\n        } else if (transaction.status === TransactionStatus.RUN) {\n            if (transaction.retryCount >= Repo_1.Repo.MAX_TRANSACTION_RETRIES_) {\n                abortTransaction = true;\n                abortReason = 'maxretry';\n                events = events.concat(this.serverSyncTree_.ackUserWrite(transaction.currentWriteId, true));\n            } else {\n                // This code reruns a transaction\n                var currentNode = this.getLatestState_(transaction.path, setsToIgnore);\n                transaction.currentInputSnapshot = currentNode;\n                var newData = queue[i].update(currentNode.val());\n                if (newData !== undefined) {\n                    validation_1.validateFirebaseData('transaction failed: Data returned ', newData, transaction.path);\n                    var newDataNode = nodeFromJSON_1.nodeFromJSON(newData);\n                    var hasExplicitPriority = (typeof newData === \"undefined\" ? \"undefined\" : _typeof(newData)) === 'object' && newData != null && util_3.contains(newData, '.priority');\n                    if (!hasExplicitPriority) {\n                        // Keep the old priority if there wasn't a priority explicitly specified.\n                        newDataNode = newDataNode.updatePriority(currentNode.getPriority());\n                    }\n                    var oldWriteId = transaction.currentWriteId;\n                    var serverValues = this.generateServerValues();\n                    var newNodeResolved = ServerValues_1.resolveDeferredValueSnapshot(newDataNode, serverValues);\n                    transaction.currentOutputSnapshotRaw = newDataNode;\n                    transaction.currentOutputSnapshotResolved = newNodeResolved;\n                    transaction.currentWriteId = this.getNextWriteId_();\n                    // Mutates setsToIgnore in place\n                    setsToIgnore.splice(setsToIgnore.indexOf(oldWriteId), 1);\n                    events = events.concat(this.serverSyncTree_.applyUserOverwrite(transaction.path, newNodeResolved, transaction.currentWriteId, transaction.applyLocally));\n                    events = events.concat(this.serverSyncTree_.ackUserWrite(oldWriteId, true));\n                } else {\n                    abortTransaction = true;\n                    abortReason = 'nodata';\n                    events = events.concat(this.serverSyncTree_.ackUserWrite(transaction.currentWriteId, true));\n                }\n            }\n        }\n        this.eventQueue_.raiseEventsForChangedPath(path, events);\n        events = [];\n        if (abortTransaction) {\n            // Abort.\n            queue[i].status = TransactionStatus.COMPLETED;\n            // Removing a listener can trigger pruning which can muck with mergedData/visibleData (as it prunes data).\n            // So defer the unwatcher until we're done.\n            (function (unwatcher) {\n                setTimeout(unwatcher, Math.floor(0));\n            })(queue[i].unwatcher);\n            if (queue[i].onComplete) {\n                if (abortReason === 'nodata') {\n                    var ref = new Reference_1.Reference(this, queue[i].path);\n                    // We set this field immediately, so it's safe to cast to an actual snapshot\n                    var lastInput /** @type {!Node} */ = queue[i].currentInputSnapshot;\n                    var snapshot = new DataSnapshot_1.DataSnapshot(lastInput, ref, PriorityIndex_1.PRIORITY_INDEX);\n                    callbacks.push(queue[i].onComplete.bind(null, null, false, snapshot));\n                } else {\n                    callbacks.push(queue[i].onComplete.bind(null, new Error(abortReason), false, null));\n                }\n            }\n        }\n    }\n    // Clean up completed transactions.\n    this.pruneCompletedTransactionsBelowNode_(this.transactionQueueTree_);\n    // Now fire callbacks, now that we're in a good, known state.\n    for (var i = 0; i < callbacks.length; i++) {\n        util_2.exceptionGuard(callbacks[i]);\n    }\n    // Try to send the transaction result to the server.\n    this.sendReadyTransactions_();\n};\n/**\n * Returns the rootmost ancestor node of the specified path that has a pending transaction on it, or just returns\n * the node for the given path if there are no pending transactions on any ancestor.\n *\n * @param {!Path} path The location to start at.\n * @return {!Tree.<Array.<!Transaction>>} The rootmost node with a transaction.\n * @private\n */\nRepo_1.Repo.prototype.getAncestorTransactionNode_ = function (path) {\n    var front;\n    // Start at the root and walk deeper into the tree towards path until we find a node with pending transactions.\n    var transactionNode = this.transactionQueueTree_;\n    while ((front = path.getFront()) !== null && transactionNode.getValue() === null) {\n        transactionNode = transactionNode.subTree(front);\n        path = path.popFront();\n    }\n    return transactionNode;\n};\n/**\n * Builds the queue of all transactions at or below the specified transactionNode.\n *\n * @param {!Tree.<Array.<Transaction>>} transactionNode\n * @return {Array.<Transaction>} The generated queue.\n * @private\n */\nRepo_1.Repo.prototype.buildTransactionQueue_ = function (transactionNode) {\n    // Walk any child transaction queues and aggregate them into a single queue.\n    var transactionQueue = [];\n    this.aggregateTransactionQueuesForNode_(transactionNode, transactionQueue);\n    // Sort them by the order the transactions were created.\n    transactionQueue.sort(function (a, b) {\n        return a.order - b.order;\n    });\n    return transactionQueue;\n};\n/**\n * @param {!Tree.<Array.<Transaction>>} node\n * @param {Array.<Transaction>} queue\n * @private\n */\nRepo_1.Repo.prototype.aggregateTransactionQueuesForNode_ = function (node, queue) {\n    var _this = this;\n    var nodeQueue = node.getValue();\n    if (nodeQueue !== null) {\n        for (var i = 0; i < nodeQueue.length; i++) {\n            queue.push(nodeQueue[i]);\n        }\n    }\n    node.forEachChild(function (child) {\n        _this.aggregateTransactionQueuesForNode_(child, queue);\n    });\n};\n/**\n * Remove COMPLETED transactions at or below this node in the transactionQueueTree_.\n *\n * @param {!Tree.<Array.<!Transaction>>} node\n * @private\n */\nRepo_1.Repo.prototype.pruneCompletedTransactionsBelowNode_ = function (node) {\n    var _this = this;\n    var queue = node.getValue();\n    if (queue) {\n        var to = 0;\n        for (var from = 0; from < queue.length; from++) {\n            if (queue[from].status !== TransactionStatus.COMPLETED) {\n                queue[to] = queue[from];\n                to++;\n            }\n        }\n        queue.length = to;\n        node.setValue(queue.length > 0 ? queue : null);\n    }\n    node.forEachChild(function (childNode) {\n        _this.pruneCompletedTransactionsBelowNode_(childNode);\n    });\n};\n/**\n * Aborts all transactions on ancestors or descendants of the specified path.  Called when doing a set() or update()\n * since we consider them incompatible with transactions.\n *\n * @param {!Path} path Path for which we want to abort related transactions.\n * @return {!Path}\n * @private\n */\nRepo_1.Repo.prototype.abortTransactions_ = function (path) {\n    var _this = this;\n    var affectedPath = this.getAncestorTransactionNode_(path).path();\n    var transactionNode = this.transactionQueueTree_.subTree(path);\n    transactionNode.forEachAncestor(function (node) {\n        _this.abortTransactionsOnNode_(node);\n    });\n    this.abortTransactionsOnNode_(transactionNode);\n    transactionNode.forEachDescendant(function (node) {\n        _this.abortTransactionsOnNode_(node);\n    });\n    return affectedPath;\n};\n/**\n * Abort transactions stored in this transaction queue node.\n *\n * @param {!Tree.<Array.<Transaction>>} node Node to abort transactions for.\n * @private\n */\nRepo_1.Repo.prototype.abortTransactionsOnNode_ = function (node) {\n    var queue = node.getValue();\n    if (queue !== null) {\n        // Queue up the callbacks and fire them after cleaning up all of our transaction state, since\n        // the callback could trigger more transactions or sets.\n        var callbacks = [];\n        // Go through queue.  Any already-sent transactions must be marked for abort, while the unsent ones\n        // can be immediately aborted and removed.\n        var events = [];\n        var lastSent = -1;\n        for (var i = 0; i < queue.length; i++) {\n            if (queue[i].status === TransactionStatus.SENT_NEEDS_ABORT) {\n                // Already marked.  No action needed.\n            } else if (queue[i].status === TransactionStatus.SENT) {\n                util_1.assert(lastSent === i - 1, 'All SENT items should be at beginning of queue.');\n                lastSent = i;\n                // Mark transaction for abort when it comes back.\n                queue[i].status = TransactionStatus.SENT_NEEDS_ABORT;\n                queue[i].abortReason = 'set';\n            } else {\n                util_1.assert(queue[i].status === TransactionStatus.RUN, 'Unexpected transaction status in abort');\n                // We can abort it immediately.\n                queue[i].unwatcher();\n                events = events.concat(this.serverSyncTree_.ackUserWrite(queue[i].currentWriteId, true));\n                if (queue[i].onComplete) {\n                    var snapshot = null;\n                    callbacks.push(queue[i].onComplete.bind(null, new Error('set'), false, snapshot));\n                }\n            }\n        }\n        if (lastSent === -1) {\n            // We're not waiting for any sent transactions.  We can clear the queue.\n            node.setValue(null);\n        } else {\n            // Remove the transactions we aborted.\n            queue.length = lastSent + 1;\n        }\n        // Now fire the callbacks.\n        this.eventQueue_.raiseEventsForChangedPath(node.path(), events);\n        for (var i = 0; i < callbacks.length; i++) {\n            util_2.exceptionGuard(callbacks[i]);\n        }\n    }\n};\n\n//# sourceMappingURL=Repo_transaction.js.map\n\n/***/ }),\n/* 188 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = __webpack_require__(0);\nvar Path_1 = __webpack_require__(4);\nvar util_2 = __webpack_require__(0);\n/**\n * Node in a Tree.\n */\nvar TreeNode = /** @class */function () {\n    function TreeNode() {\n        // TODO: Consider making accessors that create children and value lazily or\n        // separate Internal / Leaf 'types'.\n        this.children = {};\n        this.childCount = 0;\n        this.value = null;\n    }\n    return TreeNode;\n}();\nexports.TreeNode = TreeNode;\n/**\n * A light-weight tree, traversable by path.  Nodes can have both values and children.\n * Nodes are not enumerated (by forEachChild) unless they have a value or non-empty\n * children.\n */\nvar Tree = /** @class */function () {\n    /**\n     * @template T\n     * @param {string=} name_ Optional name of the node.\n     * @param {Tree=} parent_ Optional parent node.\n     * @param {TreeNode=} node_ Optional node to wrap.\n     */\n    function Tree(name_, parent_, node_) {\n        if (name_ === void 0) {\n            name_ = '';\n        }\n        if (parent_ === void 0) {\n            parent_ = null;\n        }\n        if (node_ === void 0) {\n            node_ = new TreeNode();\n        }\n        this.name_ = name_;\n        this.parent_ = parent_;\n        this.node_ = node_;\n    }\n    /**\n     * Returns a sub-Tree for the given path.\n     *\n     * @param {!(string|Path)} pathObj Path to look up.\n     * @return {!Tree.<T>} Tree for path.\n     */\n    Tree.prototype.subTree = function (pathObj) {\n        // TODO: Require pathObj to be Path?\n        var path = pathObj instanceof Path_1.Path ? pathObj : new Path_1.Path(pathObj);\n        var child = this,\n            next;\n        while ((next = path.getFront()) !== null) {\n            var childNode = util_2.safeGet(child.node_.children, next) || new TreeNode();\n            child = new Tree(next, child, childNode);\n            path = path.popFront();\n        }\n        return child;\n    };\n    /**\n     * Returns the data associated with this tree node.\n     *\n     * @return {?T} The data or null if no data exists.\n     */\n    Tree.prototype.getValue = function () {\n        return this.node_.value;\n    };\n    /**\n     * Sets data to this tree node.\n     *\n     * @param {!T} value Value to set.\n     */\n    Tree.prototype.setValue = function (value) {\n        util_1.assert(typeof value !== 'undefined', 'Cannot set value to undefined');\n        this.node_.value = value;\n        this.updateParents_();\n    };\n    /**\n     * Clears the contents of the tree node (its value and all children).\n     */\n    Tree.prototype.clear = function () {\n        this.node_.value = null;\n        this.node_.children = {};\n        this.node_.childCount = 0;\n        this.updateParents_();\n    };\n    /**\n     * @return {boolean} Whether the tree has any children.\n     */\n    Tree.prototype.hasChildren = function () {\n        return this.node_.childCount > 0;\n    };\n    /**\n     * @return {boolean} Whether the tree is empty (no value or children).\n     */\n    Tree.prototype.isEmpty = function () {\n        return this.getValue() === null && !this.hasChildren();\n    };\n    /**\n     * Calls action for each child of this tree node.\n     *\n     * @param {function(!Tree.<T>)} action Action to be called for each child.\n     */\n    Tree.prototype.forEachChild = function (action) {\n        var _this = this;\n        util_2.forEach(this.node_.children, function (child, childTree) {\n            action(new Tree(child, _this, childTree));\n        });\n    };\n    /**\n     * Does a depth-first traversal of this node's descendants, calling action for each one.\n     *\n     * @param {function(!Tree.<T>)} action Action to be called for each child.\n     * @param {boolean=} includeSelf Whether to call action on this node as well. Defaults to\n     *   false.\n     * @param {boolean=} childrenFirst Whether to call action on children before calling it on\n     *   parent.\n     */\n    Tree.prototype.forEachDescendant = function (action, includeSelf, childrenFirst) {\n        if (includeSelf && !childrenFirst) action(this);\n        this.forEachChild(function (child) {\n            child.forEachDescendant(action, /*includeSelf=*/true, childrenFirst);\n        });\n        if (includeSelf && childrenFirst) action(this);\n    };\n    /**\n     * Calls action on each ancestor node.\n     *\n     * @param {function(!Tree.<T>)} action Action to be called on each parent; return\n     *   true to abort.\n     * @param {boolean=} includeSelf Whether to call action on this node as well.\n     * @return {boolean} true if the action callback returned true.\n     */\n    Tree.prototype.forEachAncestor = function (action, includeSelf) {\n        var node = includeSelf ? this : this.parent();\n        while (node !== null) {\n            if (action(node)) {\n                return true;\n            }\n            node = node.parent();\n        }\n        return false;\n    };\n    /**\n     * Does a depth-first traversal of this node's descendants.  When a descendant with a value\n     * is found, action is called on it and traversal does not continue inside the node.\n     * Action is *not* called on this node.\n     *\n     * @param {function(!Tree.<T>)} action Action to be called for each child.\n     */\n    Tree.prototype.forEachImmediateDescendantWithValue = function (action) {\n        this.forEachChild(function (child) {\n            if (child.getValue() !== null) action(child);else child.forEachImmediateDescendantWithValue(action);\n        });\n    };\n    /**\n     * @return {!Path} The path of this tree node, as a Path.\n     */\n    Tree.prototype.path = function () {\n        return new Path_1.Path(this.parent_ === null ? this.name_ : this.parent_.path() + '/' + this.name_);\n    };\n    /**\n     * @return {string} The name of the tree node.\n     */\n    Tree.prototype.name = function () {\n        return this.name_;\n    };\n    /**\n     * @return {?Tree} The parent tree node, or null if this is the root of the tree.\n     */\n    Tree.prototype.parent = function () {\n        return this.parent_;\n    };\n    /**\n     * Adds or removes this child from its parent based on whether it's empty or not.\n     *\n     * @private\n     */\n    Tree.prototype.updateParents_ = function () {\n        if (this.parent_ !== null) this.parent_.updateChild_(this.name_, this);\n    };\n    /**\n     * Adds or removes the passed child to this tree node, depending on whether it's empty.\n     *\n     * @param {string} childName The name of the child to update.\n     * @param {!Tree.<T>} child The child to update.\n     * @private\n     */\n    Tree.prototype.updateChild_ = function (childName, child) {\n        var childEmpty = child.isEmpty();\n        var childExists = util_2.contains(this.node_.children, childName);\n        if (childEmpty && childExists) {\n            delete this.node_.children[childName];\n            this.node_.childCount--;\n            this.updateParents_();\n        } else if (!childEmpty && !childExists) {\n            this.node_.children[childName] = child.node_;\n            this.node_.childCount++;\n            this.updateParents_();\n        }\n    };\n    return Tree;\n}();\nexports.Tree = Tree;\n\n//# sourceMappingURL=Tree.js.map\n\n/***/ }),\n/* 189 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar WebSocketConnection_1 = __webpack_require__(105);\nvar BrowserPollConnection_1 = __webpack_require__(104);\n/**\n * INTERNAL methods for internal-use only (tests, etc.).\n *\n * Customers shouldn't use these or else should be aware that they could break at any time.\n *\n * @const\n */\nexports.forceLongPolling = function () {\n    WebSocketConnection_1.WebSocketConnection.forceDisallow();\n    BrowserPollConnection_1.BrowserPollConnection.forceAllow();\n};\nexports.forceWebSockets = function () {\n    BrowserPollConnection_1.BrowserPollConnection.forceDisallow();\n};\n/* Used by App Manager */\nexports.isWebSocketsAvailable = function () {\n    return WebSocketConnection_1.WebSocketConnection['isAvailable']();\n};\nexports.setSecurityDebugCallback = function (ref, callback) {\n    ref.repo.persistentConnection_.securityDebugCallback_ = callback;\n};\nexports.stats = function (ref, showDelta) {\n    ref.repo.stats(showDelta);\n};\nexports.statsIncrementCounter = function (ref, metric) {\n    ref.repo.statsIncrementCounter(metric);\n};\nexports.dataUpdateCount = function (ref) {\n    return ref.repo.dataUpdateCount;\n};\nexports.interceptServerData = function (ref, callback) {\n    return ref.repo.interceptServerData_(callback);\n};\n\n//# sourceMappingURL=internal.js.map\n\n/***/ }),\n/* 190 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar RepoInfo_1 = __webpack_require__(85);\nvar PersistentConnection_1 = __webpack_require__(101);\nvar RepoManager_1 = __webpack_require__(74);\nvar Connection_1 = __webpack_require__(103);\nexports.DataConnection = PersistentConnection_1.PersistentConnection;\n/**\n * @param {!string} pathString\n * @param {function(*)} onComplete\n */\nPersistentConnection_1.PersistentConnection.prototype.simpleListen = function (pathString, onComplete) {\n    this.sendRequest('q', { p: pathString }, onComplete);\n};\n/**\n * @param {*} data\n * @param {function(*)} onEcho\n */\nPersistentConnection_1.PersistentConnection.prototype.echo = function (data, onEcho) {\n    this.sendRequest('echo', { d: data }, onEcho);\n};\n// RealTimeConnection properties that we use in tests.\nexports.RealTimeConnection = Connection_1.Connection;\n/**\n * @param {function(): string} newHash\n * @return {function()}\n */\nexports.hijackHash = function (newHash) {\n    var oldPut = PersistentConnection_1.PersistentConnection.prototype.put;\n    PersistentConnection_1.PersistentConnection.prototype.put = function (pathString, data, opt_onComplete, opt_hash) {\n        if (opt_hash !== undefined) {\n            opt_hash = newHash();\n        }\n        oldPut.call(this, pathString, data, opt_onComplete, opt_hash);\n    };\n    return function () {\n        PersistentConnection_1.PersistentConnection.prototype.put = oldPut;\n    };\n};\n/**\n * @type {function(new:RepoInfo, !string, boolean, !string, boolean): undefined}\n */\nexports.ConnectionTarget = RepoInfo_1.RepoInfo;\n/**\n * @param {!Query} query\n * @return {!string}\n */\nexports.queryIdentifier = function (query) {\n    return query.queryIdentifier();\n};\n/**\n * @param {!Query} firebaseRef\n * @return {!Object}\n */\nexports.listens = function (firebaseRef) {\n    return firebaseRef.repo.persistentConnection_.listens_;\n};\n/**\n * Forces the RepoManager to create Repos that use ReadonlyRestClient instead of PersistentConnection.\n *\n * @param {boolean} forceRestClient\n */\nexports.forceRestClient = function (forceRestClient) {\n    RepoManager_1.RepoManager.getInstance().forceRestClient(forceRestClient);\n};\n\n//# sourceMappingURL=test_access.js.map\n\n/***/ }),\n/* 191 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n__webpack_require__(192);\n\n/***/ }),\n/* 192 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n/* WEBPACK VAR INJECTION */(function(global) {\n\nvar _typeof = typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; };\n\n(function () {\n  var firebase = __webpack_require__(21).default;\n  var h,\n      aa = aa || {},\n      k = this;function m(a) {\n    return \"string\" == typeof a;\n  }function ba(a) {\n    return \"boolean\" == typeof a;\n  }function ca() {}\n  function da(a) {\n    var b = typeof a === \"undefined\" ? \"undefined\" : _typeof(a);if (\"object\" == b) {\n      if (a) {\n        if (a instanceof Array) return \"array\";if (a instanceof Object) return b;var c = Object.prototype.toString.call(a);if (\"[object Window]\" == c) return \"object\";if (\"[object Array]\" == c || \"number\" == typeof a.length && \"undefined\" != typeof a.splice && \"undefined\" != typeof a.propertyIsEnumerable && !a.propertyIsEnumerable(\"splice\")) return \"array\";if (\"[object Function]\" == c || \"undefined\" != typeof a.call && \"undefined\" != typeof a.propertyIsEnumerable && !a.propertyIsEnumerable(\"call\")) return \"function\";\n      } else return \"null\";\n    } else if (\"function\" == b && \"undefined\" == typeof a.call) return \"object\";return b;\n  }function ea(a) {\n    return null === a;\n  }function fa(a) {\n    return \"array\" == da(a);\n  }function ha(a) {\n    var b = da(a);return \"array\" == b || \"object\" == b && \"number\" == typeof a.length;\n  }function p(a) {\n    return \"function\" == da(a);\n  }function q(a) {\n    var b = typeof a === \"undefined\" ? \"undefined\" : _typeof(a);return \"object\" == b && null != a || \"function\" == b;\n  }var ia = \"closure_uid_\" + (1E9 * Math.random() >>> 0),\n      ja = 0;function ka(a, b, c) {\n    return a.call.apply(a.bind, arguments);\n  }\n  function la(a, b, c) {\n    if (!a) throw Error();if (2 < arguments.length) {\n      var d = Array.prototype.slice.call(arguments, 2);return function () {\n        var c = Array.prototype.slice.call(arguments);Array.prototype.unshift.apply(c, d);return a.apply(b, c);\n      };\n    }return function () {\n      return a.apply(b, arguments);\n    };\n  }function r(a, b, c) {\n    Function.prototype.bind && -1 != Function.prototype.bind.toString().indexOf(\"native code\") ? r = ka : r = la;return r.apply(null, arguments);\n  }\n  function ma(a, b) {\n    var c = Array.prototype.slice.call(arguments, 1);return function () {\n      var b = c.slice();b.push.apply(b, arguments);return a.apply(this, b);\n    };\n  }var na = Date.now || function () {\n    return +new Date();\n  };function t(a, b) {\n    function c() {}c.prototype = b.prototype;a.ib = b.prototype;a.prototype = new c();a.prototype.constructor = a;a.Nc = function (a, c, f) {\n      for (var d = Array(arguments.length - 2), e = 2; e < arguments.length; e++) {\n        d[e - 2] = arguments[e];\n      }return b.prototype[c].apply(a, d);\n    };\n  };function u(a) {\n    if (Error.captureStackTrace) Error.captureStackTrace(this, u);else {\n      var b = Error().stack;b && (this.stack = b);\n    }a && (this.message = String(a));\n  }t(u, Error);u.prototype.name = \"CustomError\";function oa(a, b) {\n    for (var c = a.split(\"%s\"), d = \"\", e = Array.prototype.slice.call(arguments, 1); e.length && 1 < c.length;) {\n      d += c.shift() + e.shift();\n    }return d + c.join(\"%s\");\n  }var pa = String.prototype.trim ? function (a) {\n    return a.trim();\n  } : function (a) {\n    return a.replace(/^[\\s\\xa0]+|[\\s\\xa0]+$/g, \"\");\n  };\n  function qa(a) {\n    if (!ra.test(a)) return a;-1 != a.indexOf(\"&\") && (a = a.replace(sa, \"&amp;\"));-1 != a.indexOf(\"<\") && (a = a.replace(ta, \"&lt;\"));-1 != a.indexOf(\">\") && (a = a.replace(ua, \"&gt;\"));-1 != a.indexOf('\"') && (a = a.replace(va, \"&quot;\"));-1 != a.indexOf(\"'\") && (a = a.replace(wa, \"&#39;\"));-1 != a.indexOf(\"\\x00\") && (a = a.replace(xa, \"&#0;\"));return a;\n  }var sa = /&/g,\n      ta = /</g,\n      ua = />/g,\n      va = /\"/g,\n      wa = /'/g,\n      xa = /\\x00/g,\n      ra = /[\\x00&<>\"']/;function v(a, b) {\n    return -1 != a.indexOf(b);\n  }function ya(a, b) {\n    return a < b ? -1 : a > b ? 1 : 0;\n  };function za(a, b) {\n    b.unshift(a);u.call(this, oa.apply(null, b));b.shift();\n  }t(za, u);za.prototype.name = \"AssertionError\";function Aa(a, b) {\n    throw new za(\"Failure\" + (a ? \": \" + a : \"\"), Array.prototype.slice.call(arguments, 1));\n  };var Ba = Array.prototype.indexOf ? function (a, b, c) {\n    return Array.prototype.indexOf.call(a, b, c);\n  } : function (a, b, c) {\n    c = null == c ? 0 : 0 > c ? Math.max(0, a.length + c) : c;if (m(a)) return m(b) && 1 == b.length ? a.indexOf(b, c) : -1;for (; c < a.length; c++) {\n      if (c in a && a[c] === b) return c;\n    }return -1;\n  },\n      w = Array.prototype.forEach ? function (a, b, c) {\n    Array.prototype.forEach.call(a, b, c);\n  } : function (a, b, c) {\n    for (var d = a.length, e = m(a) ? a.split(\"\") : a, f = 0; f < d; f++) {\n      f in e && b.call(c, e[f], f, a);\n    }\n  };\n  function Ca(a, b) {\n    var c = a.length,\n        d = m(a) ? a.split(\"\") : a;for (--c; 0 <= c; --c) {\n      c in d && b.call(void 0, d[c], c, a);\n    }\n  }var Da = Array.prototype.map ? function (a, b, c) {\n    return Array.prototype.map.call(a, b, c);\n  } : function (a, b, c) {\n    for (var d = a.length, e = Array(d), f = m(a) ? a.split(\"\") : a, g = 0; g < d; g++) {\n      g in f && (e[g] = b.call(c, f[g], g, a));\n    }return e;\n  },\n      Ea = Array.prototype.some ? function (a, b, c) {\n    return Array.prototype.some.call(a, b, c);\n  } : function (a, b, c) {\n    for (var d = a.length, e = m(a) ? a.split(\"\") : a, f = 0; f < d; f++) {\n      if (f in e && b.call(c, e[f], f, a)) return !0;\n    }return !1;\n  };\n  function Fa(a) {\n    a: {\n      var b = Ga;for (var c = a.length, d = m(a) ? a.split(\"\") : a, e = 0; e < c; e++) {\n        if (e in d && b.call(void 0, d[e], e, a)) {\n          b = e;break a;\n        }\n      }b = -1;\n    }return 0 > b ? null : m(a) ? a.charAt(b) : a[b];\n  }function Ha(a, b) {\n    return 0 <= Ba(a, b);\n  }function Ia(a, b) {\n    b = Ba(a, b);var c;(c = 0 <= b) && Array.prototype.splice.call(a, b, 1);return c;\n  }function Ja(a, b) {\n    var c = 0;Ca(a, function (d, e) {\n      b.call(void 0, d, e, a) && 1 == Array.prototype.splice.call(a, e, 1).length && c++;\n    });\n  }function Ka(a) {\n    return Array.prototype.concat.apply([], arguments);\n  }\n  function La(a) {\n    var b = a.length;if (0 < b) {\n      for (var c = Array(b), d = 0; d < b; d++) {\n        c[d] = a[d];\n      }return c;\n    }return [];\n  };var Ma;a: {\n    var Na = k.navigator;if (Na) {\n      var Oa = Na.userAgent;if (Oa) {\n        Ma = Oa;break a;\n      }\n    }Ma = \"\";\n  }function x(a) {\n    return v(Ma, a);\n  };function Pa(a, b) {\n    for (var c in a) {\n      b.call(void 0, a[c], c, a);\n    }\n  }function Qa(a) {\n    var b = [],\n        c = 0,\n        d;for (d in a) {\n      b[c++] = a[d];\n    }return b;\n  }function Ra(a) {\n    var b = [],\n        c = 0,\n        d;for (d in a) {\n      b[c++] = d;\n    }return b;\n  }function Sa(a) {\n    for (var b in a) {\n      return !1;\n    }return !0;\n  }function Ta(a, b) {\n    for (var c in a) {\n      if (!(c in b) || a[c] !== b[c]) return !1;\n    }for (c in b) {\n      if (!(c in a)) return !1;\n    }return !0;\n  }function Ua(a) {\n    var b = {},\n        c;for (c in a) {\n      b[c] = a[c];\n    }return b;\n  }var Va = \"constructor hasOwnProperty isPrototypeOf propertyIsEnumerable toLocaleString toString valueOf\".split(\" \");\n  function Wa(a, b) {\n    for (var c, d, e = 1; e < arguments.length; e++) {\n      d = arguments[e];for (c in d) {\n        a[c] = d[c];\n      }for (var f = 0; f < Va.length; f++) {\n        c = Va[f], Object.prototype.hasOwnProperty.call(d, c) && (a[c] = d[c]);\n      }\n    }\n  };function Xa(a) {\n    Xa[\" \"](a);return a;\n  }Xa[\" \"] = ca;function Ya(a, b) {\n    var c = Za;return Object.prototype.hasOwnProperty.call(c, a) ? c[a] : c[a] = b(a);\n  };var $a = x(\"Opera\"),\n      y = x(\"Trident\") || x(\"MSIE\"),\n      ab = x(\"Edge\"),\n      bb = ab || y,\n      cb = x(\"Gecko\") && !(v(Ma.toLowerCase(), \"webkit\") && !x(\"Edge\")) && !(x(\"Trident\") || x(\"MSIE\")) && !x(\"Edge\"),\n      db = v(Ma.toLowerCase(), \"webkit\") && !x(\"Edge\");function eb() {\n    var a = k.document;return a ? a.documentMode : void 0;\n  }var fb;\n  a: {\n    var gb = \"\",\n        hb = function () {\n      var a = Ma;if (cb) return (/rv\\:([^\\);]+)(\\)|;)/.exec(a)\n      );if (ab) return (/Edge\\/([\\d\\.]+)/.exec(a)\n      );if (y) return (/\\b(?:MSIE|rv)[: ]([^\\);]+)(\\)|;)/.exec(a)\n      );if (db) return (/WebKit\\/(\\S+)/.exec(a)\n      );if ($a) return (/(?:Version)[ \\/]?(\\S+)/.exec(a)\n      );\n    }();hb && (gb = hb ? hb[1] : \"\");if (y) {\n      var ib = eb();if (null != ib && ib > parseFloat(gb)) {\n        fb = String(ib);break a;\n      }\n    }fb = gb;\n  }var Za = {};\n  function jb(a) {\n    return Ya(a, function () {\n      for (var b = 0, c = pa(String(fb)).split(\".\"), d = pa(String(a)).split(\".\"), e = Math.max(c.length, d.length), f = 0; 0 == b && f < e; f++) {\n        var g = c[f] || \"\",\n            l = d[f] || \"\";do {\n          g = /(\\d*)(\\D*)(.*)/.exec(g) || [\"\", \"\", \"\", \"\"];l = /(\\d*)(\\D*)(.*)/.exec(l) || [\"\", \"\", \"\", \"\"];if (0 == g[0].length && 0 == l[0].length) break;b = ya(0 == g[1].length ? 0 : parseInt(g[1], 10), 0 == l[1].length ? 0 : parseInt(l[1], 10)) || ya(0 == g[2].length, 0 == l[2].length) || ya(g[2], l[2]);g = g[3];l = l[3];\n        } while (0 == b);\n      }return 0 <= b;\n    });\n  }var kb;var lb = k.document;\n  kb = lb && y ? eb() || (\"CSS1Compat\" == lb.compatMode ? parseInt(fb, 10) : 5) : void 0;function mb(a) {\n    a.prototype.then = a.prototype.then;a.prototype.$goog_Thenable = !0;\n  }function nb(a) {\n    if (!a) return !1;try {\n      return !!a.$goog_Thenable;\n    } catch (b) {\n      return !1;\n    }\n  };function ob(a, b, c) {\n    this.f = c;this.c = a;this.g = b;this.b = 0;this.a = null;\n  }ob.prototype.get = function () {\n    if (0 < this.b) {\n      this.b--;var a = this.a;this.a = a.next;a.next = null;\n    } else a = this.c();return a;\n  };function pb(a, b) {\n    a.g(b);a.b < a.f && (a.b++, b.next = a.a, a.a = b);\n  };var rb = new ob(function () {\n    return new qb();\n  }, function (a) {\n    a.reset();\n  }, 100);function sb() {\n    var a = tb,\n        b = null;a.a && (b = a.a, a.a = a.a.next, a.a || (a.b = null), b.next = null);return b;\n  }function qb() {\n    this.next = this.b = this.a = null;\n  }qb.prototype.set = function (a, b) {\n    this.a = a;this.b = b;this.next = null;\n  };qb.prototype.reset = function () {\n    this.next = this.b = this.a = null;\n  };function ub(a) {\n    k.setTimeout(function () {\n      throw a;\n    }, 0);\n  }var wb;\n  function xb() {\n    var a = k.MessageChannel;\"undefined\" === typeof a && \"undefined\" !== typeof window && window.postMessage && window.addEventListener && !x(\"Presto\") && (a = function a() {\n      var a = document.createElement(\"IFRAME\");a.style.display = \"none\";a.src = \"\";document.documentElement.appendChild(a);var b = a.contentWindow;a = b.document;a.open();a.write(\"\");a.close();var c = \"callImmediate\" + Math.random(),\n          d = \"file:\" == b.location.protocol ? \"*\" : b.location.protocol + \"//\" + b.location.host;a = r(function (a) {\n        if ((\"*\" == d || a.origin == d) && a.data == c) this.port1.onmessage();\n      }, this);b.addEventListener(\"message\", a, !1);this.port1 = {};this.port2 = { postMessage: function postMessage() {\n          b.postMessage(c, d);\n        } };\n    });if (\"undefined\" !== typeof a && !x(\"Trident\") && !x(\"MSIE\")) {\n      var b = new a(),\n          c = {},\n          d = c;b.port1.onmessage = function () {\n        if (void 0 !== c.next) {\n          c = c.next;var a = c.pb;c.pb = null;a();\n        }\n      };return function (a) {\n        d.next = { pb: a };d = d.next;b.port2.postMessage(0);\n      };\n    }return \"undefined\" !== typeof document && \"onreadystatechange\" in document.createElement(\"SCRIPT\") ? function (a) {\n      var b = document.createElement(\"SCRIPT\");\n      b.onreadystatechange = function () {\n        b.onreadystatechange = null;b.parentNode.removeChild(b);b = null;a();a = null;\n      };document.documentElement.appendChild(b);\n    } : function (a) {\n      k.setTimeout(a, 0);\n    };\n  };function yb(a, b) {\n    zb || Ab();Bb || (zb(), Bb = !0);var c = tb,\n        d = rb.get();d.set(a, b);c.b ? c.b.next = d : c.a = d;c.b = d;\n  }var zb;function Ab() {\n    if (-1 != String(k.Promise).indexOf(\"[native code]\")) {\n      var a = k.Promise.resolve(void 0);zb = function zb() {\n        a.then(Cb);\n      };\n    } else zb = function zb() {\n      var a = Cb;!p(k.setImmediate) || k.Window && k.Window.prototype && !x(\"Edge\") && k.Window.prototype.setImmediate == k.setImmediate ? (wb || (wb = xb()), wb(a)) : k.setImmediate(a);\n    };\n  }var Bb = !1,\n      tb = new function () {\n    this.b = this.a = null;\n  }();\n  function Cb() {\n    for (var a; a = sb();) {\n      try {\n        a.a.call(a.b);\n      } catch (b) {\n        ub(b);\n      }pb(rb, a);\n    }Bb = !1;\n  };function z(a, b) {\n    this.a = Db;this.i = void 0;this.f = this.b = this.c = null;this.g = this.h = !1;if (a != ca) try {\n      var c = this;a.call(b, function (a) {\n        Eb(c, Fb, a);\n      }, function (a) {\n        if (!(a instanceof Gb)) try {\n          if (a instanceof Error) throw a;throw Error(\"Promise rejected.\");\n        } catch (e) {}Eb(c, Hb, a);\n      });\n    } catch (d) {\n      Eb(this, Hb, d);\n    }\n  }var Db = 0,\n      Fb = 2,\n      Hb = 3;function Ib() {\n    this.next = this.f = this.b = this.g = this.a = null;this.c = !1;\n  }Ib.prototype.reset = function () {\n    this.f = this.b = this.g = this.a = null;this.c = !1;\n  };\n  var Jb = new ob(function () {\n    return new Ib();\n  }, function (a) {\n    a.reset();\n  }, 100);function Kb(a, b, c) {\n    var d = Jb.get();d.g = a;d.b = b;d.f = c;return d;\n  }function A(a) {\n    if (a instanceof z) return a;var b = new z(ca);Eb(b, Fb, a);return b;\n  }function B(a) {\n    return new z(function (b, c) {\n      c(a);\n    });\n  }function Lb(a, b, c) {\n    Mb(a, b, c, null) || yb(ma(b, a));\n  }function Nb(a) {\n    return new z(function (b, c) {\n      var d = a.length,\n          e = [];if (d) for (var f = function f(a, c) {\n        d--;e[a] = c;0 == d && b(e);\n      }, g = function g(a) {\n        c(a);\n      }, l = 0, n; l < a.length; l++) {\n        n = a[l], Lb(n, ma(f, l), g);\n      } else b(e);\n    });\n  }\n  function Ob(a) {\n    return new z(function (b) {\n      var c = a.length,\n          d = [];if (c) for (var e = function e(a, _e, f) {\n        c--;d[a] = _e ? { Qb: !0, value: f } : { Qb: !1, reason: f };0 == c && b(d);\n      }, f = 0, g; f < a.length; f++) {\n        g = a[f], Lb(g, ma(e, f, !0), ma(e, f, !1));\n      } else b(d);\n    });\n  }z.prototype.then = function (a, b, c) {\n    return Pb(this, p(a) ? a : null, p(b) ? b : null, c);\n  };mb(z);function Qb(a, b) {\n    b = Kb(b, b, void 0);b.c = !0;Rb(a, b);return a;\n  }h = z.prototype;h.s = function (a, b) {\n    return Pb(this, null, a, b);\n  };h.cancel = function (a) {\n    this.a == Db && yb(function () {\n      var b = new Gb(a);Sb(this, b);\n    }, this);\n  };\n  function Sb(a, b) {\n    if (a.a == Db) if (a.c) {\n      var c = a.c;if (c.b) {\n        for (var d = 0, e = null, f = null, g = c.b; g && (g.c || (d++, g.a == a && (e = g), !(e && 1 < d))); g = g.next) {\n          e || (f = g);\n        }e && (c.a == Db && 1 == d ? Sb(c, b) : (f ? (d = f, d.next == c.f && (c.f = d), d.next = d.next.next) : Tb(c), Ub(c, e, Hb, b)));\n      }a.c = null;\n    } else Eb(a, Hb, b);\n  }function Rb(a, b) {\n    a.b || a.a != Fb && a.a != Hb || Vb(a);a.f ? a.f.next = b : a.b = b;a.f = b;\n  }\n  function Pb(a, b, c, d) {\n    var e = Kb(null, null, null);e.a = new z(function (a, g) {\n      e.g = b ? function (c) {\n        try {\n          var e = b.call(d, c);a(e);\n        } catch (D) {\n          g(D);\n        }\n      } : a;e.b = c ? function (b) {\n        try {\n          var e = c.call(d, b);void 0 === e && b instanceof Gb ? g(b) : a(e);\n        } catch (D) {\n          g(D);\n        }\n      } : g;\n    });e.a.c = a;Rb(a, e);return e.a;\n  }h.wc = function (a) {\n    this.a = Db;Eb(this, Fb, a);\n  };h.xc = function (a) {\n    this.a = Db;Eb(this, Hb, a);\n  };\n  function Eb(a, b, c) {\n    a.a == Db && (a === c && (b = Hb, c = new TypeError(\"Promise cannot resolve to itself\")), a.a = 1, Mb(c, a.wc, a.xc, a) || (a.i = c, a.a = b, a.c = null, Vb(a), b != Hb || c instanceof Gb || Wb(a, c)));\n  }function Mb(a, b, c, d) {\n    if (a instanceof z) return Rb(a, Kb(b || ca, c || null, d)), !0;if (nb(a)) return a.then(b, c, d), !0;if (q(a)) try {\n      var e = a.then;if (p(e)) return Xb(a, e, b, c, d), !0;\n    } catch (f) {\n      return c.call(d, f), !0;\n    }return !1;\n  }\n  function Xb(a, b, c, d, e) {\n    function f(a) {\n      l || (l = !0, d.call(e, a));\n    }function g(a) {\n      l || (l = !0, c.call(e, a));\n    }var l = !1;try {\n      b.call(a, g, f);\n    } catch (n) {\n      f(n);\n    }\n  }function Vb(a) {\n    a.h || (a.h = !0, yb(a.Mb, a));\n  }function Tb(a) {\n    var b = null;a.b && (b = a.b, a.b = b.next, b.next = null);a.b || (a.f = null);return b;\n  }h.Mb = function () {\n    for (var a; a = Tb(this);) {\n      Ub(this, a, this.a, this.i);\n    }this.h = !1;\n  };\n  function Ub(a, b, c, d) {\n    if (c == Hb && b.b && !b.c) for (; a && a.g; a = a.c) {\n      a.g = !1;\n    }if (b.a) b.a.c = null, Yb(b, c, d);else try {\n      b.c ? b.g.call(b.f) : Yb(b, c, d);\n    } catch (e) {\n      Zb.call(null, e);\n    }pb(Jb, b);\n  }function Yb(a, b, c) {\n    b == Fb ? a.g.call(a.f, c) : a.b && a.b.call(a.f, c);\n  }function Wb(a, b) {\n    a.g = !0;yb(function () {\n      a.g && Zb.call(null, b);\n    });\n  }var Zb = ub;function Gb(a) {\n    u.call(this, a);\n  }t(Gb, u);Gb.prototype.name = \"cancel\";var $b = !y || 9 <= Number(kb);function ac() {\n    this.a = \"\";this.b = bc;\n  }ac.prototype.la = !0;ac.prototype.ja = function () {\n    return this.a;\n  };ac.prototype.toString = function () {\n    return \"Const{\" + this.a + \"}\";\n  };function cc(a) {\n    if (a instanceof ac && a.constructor === ac && a.b === bc) return a.a;Aa(\"expected object of type Const, got '\" + a + \"'\");return \"type_error:Const\";\n  }var bc = {};function dc(a) {\n    var b = new ac();b.a = a;return b;\n  }dc(\"\");function ec() {\n    this.a = \"\";this.b = fc;\n  }ec.prototype.la = !0;ec.prototype.ja = function () {\n    return this.a;\n  };ec.prototype.toString = function () {\n    return \"TrustedResourceUrl{\" + this.a + \"}\";\n  };function gc(a) {\n    if (a instanceof ec && a.constructor === ec && a.b === fc) return a.a;Aa(\"expected object of type TrustedResourceUrl, got '\" + a + \"' of type \" + da(a));return \"type_error:TrustedResourceUrl\";\n  }function hc(a, b) {\n    a = ic(a, b);b = new ec();b.a = a;return b;\n  }\n  function ic(a, b) {\n    var c = cc(a);if (!jc.test(c)) throw Error(\"Invalid TrustedResourceUrl format: \" + c);return c.replace(kc, function (a, e) {\n      if (!Object.prototype.hasOwnProperty.call(b, e)) throw Error('Found marker, \"' + e + '\", in format string, \"' + c + '\", but no valid label mapping found in args: ' + JSON.stringify(b));a = b[e];return a instanceof ac ? cc(a) : encodeURIComponent(String(a));\n    });\n  }var kc = /%{(\\w+)}/g,\n      jc = /^(?:https:)?\\/\\/[0-9a-z.:[\\]-]+\\/|^\\/[^\\/\\\\]|^about:blank(#|$)/i,\n      fc = {};function lc() {\n    this.a = \"\";this.b = mc;\n  }lc.prototype.la = !0;lc.prototype.ja = function () {\n    return this.a;\n  };lc.prototype.toString = function () {\n    return \"SafeUrl{\" + this.a + \"}\";\n  };function nc(a) {\n    if (a instanceof lc && a.constructor === lc && a.b === mc) return a.a;Aa(\"expected object of type SafeUrl, got '\" + a + \"' of type \" + da(a));return \"type_error:SafeUrl\";\n  }var oc = /^(?:(?:https?|mailto|ftp):|[^:/?#]*(?:[/?#]|$))/i;\n  function pc(a) {\n    if (a instanceof lc) return a;a = a.la ? a.ja() : String(a);oc.test(a) || (a = \"about:invalid#zClosurez\");return qc(a);\n  }var mc = {};function qc(a) {\n    var b = new lc();b.a = a;return b;\n  }qc(\"about:blank\");function rc() {\n    this.a = \"\";this.b = sc;\n  }rc.prototype.la = !0;rc.prototype.ja = function () {\n    return this.a;\n  };rc.prototype.toString = function () {\n    return \"SafeHtml{\" + this.a + \"}\";\n  };function uc(a) {\n    if (a instanceof rc && a.constructor === rc && a.b === sc) return a.a;Aa(\"expected object of type SafeHtml, got '\" + a + \"' of type \" + da(a));return \"type_error:SafeHtml\";\n  }var sc = {};function vc(a) {\n    var b = new rc();b.a = a;return b;\n  }vc(\"<!DOCTYPE html>\");vc(\"\");vc(\"<br>\");function wc(a) {\n    var b = document;return m(a) ? b.getElementById(a) : a;\n  }function xc(a, b) {\n    Pa(b, function (b, d) {\n      b && b.la && (b = b.ja());\"style\" == d ? a.style.cssText = b : \"class\" == d ? a.className = b : \"for\" == d ? a.htmlFor = b : yc.hasOwnProperty(d) ? a.setAttribute(yc[d], b) : 0 == d.lastIndexOf(\"aria-\", 0) || 0 == d.lastIndexOf(\"data-\", 0) ? a.setAttribute(d, b) : a[d] = b;\n    });\n  }\n  var yc = { cellpadding: \"cellPadding\", cellspacing: \"cellSpacing\", colspan: \"colSpan\", frameborder: \"frameBorder\", height: \"height\", maxlength: \"maxLength\", nonce: \"nonce\", role: \"role\", rowspan: \"rowSpan\", type: \"type\", usemap: \"useMap\", valign: \"vAlign\", width: \"width\" };\n  function zc(a, b, c) {\n    var d = arguments,\n        e = document,\n        f = String(d[0]),\n        g = d[1];if (!$b && g && (g.name || g.type)) {\n      f = [\"<\", f];g.name && f.push(' name=\"', qa(g.name), '\"');if (g.type) {\n        f.push(' type=\"', qa(g.type), '\"');var l = {};Wa(l, g);delete l.type;g = l;\n      }f.push(\">\");f = f.join(\"\");\n    }f = e.createElement(f);g && (m(g) ? f.className = g : fa(g) ? f.className = g.join(\" \") : xc(f, g));2 < d.length && Ac(e, f, d);return f;\n  }\n  function Ac(a, b, c) {\n    function d(c) {\n      c && b.appendChild(m(c) ? a.createTextNode(c) : c);\n    }for (var e = 2; e < c.length; e++) {\n      var f = c[e];!ha(f) || q(f) && 0 < f.nodeType ? d(f) : w(Bc(f) ? La(f) : f, d);\n    }\n  }function Bc(a) {\n    if (a && \"number\" == typeof a.length) {\n      if (q(a)) return \"function\" == typeof a.item || \"string\" == typeof a.item;if (p(a)) return \"function\" == typeof a.item;\n    }return !1;\n  };function Cc(a) {\n    var b = [];Dc(new Ec(), a, b);return b.join(\"\");\n  }function Ec() {}\n  function Dc(a, b, c) {\n    if (null == b) c.push(\"null\");else {\n      if (\"object\" == (typeof b === \"undefined\" ? \"undefined\" : _typeof(b))) {\n        if (fa(b)) {\n          var d = b;b = d.length;c.push(\"[\");for (var e = \"\", f = 0; f < b; f++) {\n            c.push(e), Dc(a, d[f], c), e = \",\";\n          }c.push(\"]\");return;\n        }if (b instanceof String || b instanceof Number || b instanceof Boolean) b = b.valueOf();else {\n          c.push(\"{\");e = \"\";for (d in b) {\n            Object.prototype.hasOwnProperty.call(b, d) && (f = b[d], \"function\" != typeof f && (c.push(e), Fc(d, c), c.push(\":\"), Dc(a, f, c), e = \",\"));\n          }c.push(\"}\");return;\n        }\n      }switch (typeof b === \"undefined\" ? \"undefined\" : _typeof(b)) {case \"string\":\n          Fc(b, c);break;case \"number\":\n          c.push(isFinite(b) && !isNaN(b) ? String(b) : \"null\");break;case \"boolean\":\n          c.push(String(b));break;case \"function\":\n          c.push(\"null\");break;default:\n          throw Error(\"Unknown type: \" + (typeof b === \"undefined\" ? \"undefined\" : _typeof(b)));}\n    }\n  }var Gc = { '\"': '\\\\\"', \"\\\\\": \"\\\\\\\\\", \"/\": \"\\\\/\", \"\\b\": \"\\\\b\", \"\\f\": \"\\\\f\", \"\\n\": \"\\\\n\", \"\\r\": \"\\\\r\", \"\\t\": \"\\\\t\", \"\\x0B\": \"\\\\u000b\" },\n      Hc = /\\uffff/.test(\"\\uFFFF\") ? /[\\\\\\\"\\x00-\\x1f\\x7f-\\uffff]/g : /[\\\\\\\"\\x00-\\x1f\\x7f-\\xff]/g;\n  function Fc(a, b) {\n    b.push('\"', a.replace(Hc, function (a) {\n      var b = Gc[a];b || (b = \"\\\\u\" + (a.charCodeAt(0) | 65536).toString(16).substr(1), Gc[a] = b);return b;\n    }), '\"');\n  };function Ic() {\n    0 != Jc && (Kc[this[ia] || (this[ia] = ++ja)] = this);this.oa = this.oa;this.Fa = this.Fa;\n  }var Jc = 0,\n      Kc = {};Ic.prototype.oa = !1;function Lc(a) {\n    a.oa || (a.oa = !0, a.ta(), 0 != Jc && (a = a[ia] || (a[ia] = ++ja), delete Kc[a]));\n  }Ic.prototype.ta = function () {\n    if (this.Fa) for (; this.Fa.length;) {\n      this.Fa.shift()();\n    }\n  };var Mc = Object.freeze || function (a) {\n    return a;\n  };var Nc = !y || 9 <= Number(kb),\n      Oc = y && !jb(\"9\"),\n      Pc = function () {\n    if (!k.addEventListener || !Object.defineProperty) return !1;var a = !1,\n        b = Object.defineProperty({}, \"passive\", { get: function get() {\n        a = !0;\n      } });k.addEventListener(\"test\", ca, b);k.removeEventListener(\"test\", ca, b);return a;\n  }();function C(a, b) {\n    this.type = a;this.b = this.target = b;this.Ab = !0;\n  }C.prototype.c = function () {\n    this.Ab = !1;\n  };function Qc(a, b) {\n    C.call(this, a ? a.type : \"\");this.relatedTarget = this.b = this.target = null;this.button = this.screenY = this.screenX = this.clientY = this.clientX = 0;this.key = \"\";this.metaKey = this.shiftKey = this.altKey = this.ctrlKey = !1;this.pointerId = 0;this.pointerType = \"\";this.a = null;if (a) {\n      var c = this.type = a.type,\n          d = a.changedTouches ? a.changedTouches[0] : null;this.target = a.target || a.srcElement;this.b = b;if (b = a.relatedTarget) {\n        if (cb) {\n          a: {\n            try {\n              Xa(b.nodeName);var e = !0;break a;\n            } catch (f) {}e = !1;\n          }e || (b = null);\n        }\n      } else \"mouseover\" == c ? b = a.fromElement : \"mouseout\" == c && (b = a.toElement);this.relatedTarget = b;null === d ? (this.clientX = void 0 !== a.clientX ? a.clientX : a.pageX, this.clientY = void 0 !== a.clientY ? a.clientY : a.pageY, this.screenX = a.screenX || 0, this.screenY = a.screenY || 0) : (this.clientX = void 0 !== d.clientX ? d.clientX : d.pageX, this.clientY = void 0 !== d.clientY ? d.clientY : d.pageY, this.screenX = d.screenX || 0, this.screenY = d.screenY || 0);this.button = a.button;this.key = a.key || \"\";this.ctrlKey = a.ctrlKey;this.altKey = a.altKey;this.shiftKey = a.shiftKey;this.metaKey = a.metaKey;this.pointerId = a.pointerId || 0;this.pointerType = m(a.pointerType) ? a.pointerType : Rc[a.pointerType] || \"\";this.a = a;a.defaultPrevented && this.c();\n    }\n  }t(Qc, C);var Rc = Mc({ 2: \"touch\", 3: \"pen\", 4: \"mouse\" });Qc.prototype.c = function () {\n    Qc.ib.c.call(this);var a = this.a;if (a.preventDefault) a.preventDefault();else if (a.returnValue = !1, Oc) try {\n      if (a.ctrlKey || 112 <= a.keyCode && 123 >= a.keyCode) a.keyCode = -1;\n    } catch (b) {}\n  };Qc.prototype.g = function () {\n    return this.a;\n  };var Sc = \"closure_listenable_\" + (1E6 * Math.random() | 0),\n      Tc = 0;function Uc(a, b, c, d, e) {\n    this.listener = a;this.a = null;this.src = b;this.type = c;this.capture = !!d;this.La = e;this.key = ++Tc;this.ma = this.Ha = !1;\n  }function Vc(a) {\n    a.ma = !0;a.listener = null;a.a = null;a.src = null;a.La = null;\n  };function Wc(a) {\n    this.src = a;this.a = {};this.b = 0;\n  }function Xc(a, b, c, d, e, f) {\n    var g = b.toString();b = a.a[g];b || (b = a.a[g] = [], a.b++);var l = Yc(b, c, e, f);-1 < l ? (a = b[l], d || (a.Ha = !1)) : (a = new Uc(c, a.src, g, !!e, f), a.Ha = d, b.push(a));return a;\n  }function Zc(a, b) {\n    var c = b.type;c in a.a && Ia(a.a[c], b) && (Vc(b), 0 == a.a[c].length && (delete a.a[c], a.b--));\n  }function Yc(a, b, c, d) {\n    for (var e = 0; e < a.length; ++e) {\n      var f = a[e];if (!f.ma && f.listener == b && f.capture == !!c && f.La == d) return e;\n    }return -1;\n  };var $c = \"closure_lm_\" + (1E6 * Math.random() | 0),\n      ad = {},\n      bd = 0;function cd(a, b, c, d, e) {\n    if (d && d.once) dd(a, b, c, d, e);else if (fa(b)) for (var f = 0; f < b.length; f++) {\n      cd(a, b[f], c, d, e);\n    } else c = ed(c), a && a[Sc] ? fd(a, b, c, q(d) ? !!d.capture : !!d, e) : gd(a, b, c, !1, d, e);\n  }\n  function gd(a, b, c, d, e, f) {\n    if (!b) throw Error(\"Invalid event type\");var g = q(e) ? !!e.capture : !!e,\n        l = hd(a);l || (a[$c] = l = new Wc(a));c = Xc(l, b, c, d, g, f);if (!c.a) {\n      d = id();c.a = d;d.src = a;d.listener = c;if (a.addEventListener) Pc || (e = g), void 0 === e && (e = !1), a.addEventListener(b.toString(), d, e);else if (a.attachEvent) a.attachEvent(jd(b.toString()), d);else throw Error(\"addEventListener and attachEvent are unavailable.\");bd++;\n    }\n  }\n  function id() {\n    var a = kd,\n        b = Nc ? function (c) {\n      return a.call(b.src, b.listener, c);\n    } : function (c) {\n      c = a.call(b.src, b.listener, c);if (!c) return c;\n    };return b;\n  }function dd(a, b, c, d, e) {\n    if (fa(b)) for (var f = 0; f < b.length; f++) {\n      dd(a, b[f], c, d, e);\n    } else c = ed(c), a && a[Sc] ? ld(a, b, c, q(d) ? !!d.capture : !!d, e) : gd(a, b, c, !0, d, e);\n  }\n  function E(a, b, c, d, e) {\n    if (fa(b)) for (var f = 0; f < b.length; f++) {\n      E(a, b[f], c, d, e);\n    } else (d = q(d) ? !!d.capture : !!d, c = ed(c), a && a[Sc]) ? (a = a.u, b = String(b).toString(), b in a.a && (f = a.a[b], c = Yc(f, c, d, e), -1 < c && (Vc(f[c]), Array.prototype.splice.call(f, c, 1), 0 == f.length && (delete a.a[b], a.b--)))) : a && (a = hd(a)) && (b = a.a[b.toString()], a = -1, b && (a = Yc(b, c, d, e)), (c = -1 < a ? b[a] : null) && md(c));\n  }\n  function md(a) {\n    if (\"number\" != typeof a && a && !a.ma) {\n      var b = a.src;if (b && b[Sc]) Zc(b.u, a);else {\n        var c = a.type,\n            d = a.a;b.removeEventListener ? b.removeEventListener(c, d, a.capture) : b.detachEvent && b.detachEvent(jd(c), d);bd--;(c = hd(b)) ? (Zc(c, a), 0 == c.b && (c.src = null, b[$c] = null)) : Vc(a);\n      }\n    }\n  }function jd(a) {\n    return a in ad ? ad[a] : ad[a] = \"on\" + a;\n  }function nd(a, b, c, d) {\n    var e = !0;if (a = hd(a)) if (b = a.a[b.toString()]) for (b = b.concat(), a = 0; a < b.length; a++) {\n      var f = b[a];f && f.capture == c && !f.ma && (f = od(f, d), e = e && !1 !== f);\n    }return e;\n  }\n  function od(a, b) {\n    var c = a.listener,\n        d = a.La || a.src;a.Ha && md(a);return c.call(d, b);\n  }\n  function kd(a, b) {\n    if (a.ma) return !0;if (!Nc) {\n      if (!b) a: {\n        b = [\"window\", \"event\"];for (var c = k, d = 0; d < b.length; d++) {\n          if (c = c[b[d]], null == c) {\n            b = null;break a;\n          }\n        }b = c;\n      }d = b;b = new Qc(d, this);c = !0;if (!(0 > d.keyCode || void 0 != d.returnValue)) {\n        a: {\n          var e = !1;if (0 == d.keyCode) try {\n            d.keyCode = -1;break a;\n          } catch (g) {\n            e = !0;\n          }if (e || void 0 == d.returnValue) d.returnValue = !0;\n        }d = [];for (e = b.b; e; e = e.parentNode) {\n          d.push(e);\n        }a = a.type;for (e = d.length - 1; 0 <= e; e--) {\n          b.b = d[e];var f = nd(d[e], a, !0, b);c = c && f;\n        }for (e = 0; e < d.length; e++) {\n          b.b = d[e], f = nd(d[e], a, !1, b), c = c && f;\n        }\n      }return c;\n    }return od(a, new Qc(b, this));\n  }function hd(a) {\n    a = a[$c];return a instanceof Wc ? a : null;\n  }var pd = \"__closure_events_fn_\" + (1E9 * Math.random() >>> 0);function ed(a) {\n    if (p(a)) return a;a[pd] || (a[pd] = function (b) {\n      return a.handleEvent(b);\n    });return a[pd];\n  };function F() {\n    Ic.call(this);this.u = new Wc(this);this.Eb = this;this.Ra = null;\n  }t(F, Ic);F.prototype[Sc] = !0;F.prototype.removeEventListener = function (a, b, c, d) {\n    E(this, a, b, c, d);\n  };\n  function G(a, b) {\n    var c,\n        d = a.Ra;if (d) for (c = []; d; d = d.Ra) {\n      c.push(d);\n    }a = a.Eb;d = b.type || b;if (m(b)) b = new C(b, a);else if (b instanceof C) b.target = b.target || a;else {\n      var e = b;b = new C(d, a);Wa(b, e);\n    }e = !0;if (c) for (var f = c.length - 1; 0 <= f; f--) {\n      var g = b.b = c[f];e = qd(g, d, !0, b) && e;\n    }g = b.b = a;e = qd(g, d, !0, b) && e;e = qd(g, d, !1, b) && e;if (c) for (f = 0; f < c.length; f++) {\n      g = b.b = c[f], e = qd(g, d, !1, b) && e;\n    }\n  }\n  F.prototype.ta = function () {\n    F.ib.ta.call(this);if (this.u) {\n      var a = this.u,\n          b = 0,\n          c;for (c in a.a) {\n        for (var d = a.a[c], e = 0; e < d.length; e++) {\n          ++b, Vc(d[e]);\n        }delete a.a[c];a.b--;\n      }\n    }this.Ra = null;\n  };function fd(a, b, c, d, e) {\n    Xc(a.u, String(b), c, !1, d, e);\n  }function ld(a, b, c, d, e) {\n    Xc(a.u, String(b), c, !0, d, e);\n  }function qd(a, b, c, d) {\n    b = a.u.a[String(b)];if (!b) return !0;b = b.concat();for (var e = !0, f = 0; f < b.length; ++f) {\n      var g = b[f];if (g && !g.ma && g.capture == c) {\n        var l = g.listener,\n            n = g.La || g.src;g.Ha && Zc(a.u, g);e = !1 !== l.call(n, d) && e;\n      }\n    }return e && 0 != d.Ab;\n  };function rd(a, b, c) {\n    if (p(a)) c && (a = r(a, c));else if (a && \"function\" == typeof a.handleEvent) a = r(a.handleEvent, a);else throw Error(\"Invalid listener argument\");return 2147483647 < Number(b) ? -1 : k.setTimeout(a, b || 0);\n  }function sd(a) {\n    var b = null;return new z(function (c, d) {\n      b = rd(function () {\n        c(void 0);\n      }, a);-1 == b && d(Error(\"Failed to schedule timer.\"));\n    }).s(function (a) {\n      k.clearTimeout(b);throw a;\n    });\n  };function td(a, b, c, d, e) {\n    this.reset(a, b, c, d, e);\n  }td.prototype.a = null;var ud = 0;td.prototype.reset = function (a, b, c, d, e) {\n    \"number\" == typeof e || ud++;d || na();this.b = b;delete this.a;\n  };function vd(a) {\n    this.f = a;this.b = this.c = this.a = null;\n  }function wd(a, b) {\n    this.name = a;this.value = b;\n  }wd.prototype.toString = function () {\n    return this.name;\n  };var xd = new wd(\"SEVERE\", 1E3),\n      yd = new wd(\"CONFIG\", 700),\n      zd = new wd(\"FINE\", 500);function Ad(a) {\n    if (a.c) return a.c;if (a.a) return Ad(a.a);Aa(\"Root logger has no level set.\");return null;\n  }\n  vd.prototype.log = function (a, b, c) {\n    if (a.value >= Ad(this).value) for (p(b) && (b = b()), a = new td(a, String(b), this.f), c && (a.a = c), c = \"log:\" + a.b, (a = k.console) && a.timeStamp && a.timeStamp(c), (a = k.msWriteProfilerMark) && a(c), c = this; c;) {\n      c = c.a;\n    }\n  };var Bd = {},\n      Cd = null;function Dd(a) {\n    Cd || (Cd = new vd(\"\"), Bd[\"\"] = Cd, Cd.c = yd);var b;if (!(b = Bd[a])) {\n      b = new vd(a);var c = a.lastIndexOf(\".\"),\n          d = a.substr(c + 1);c = Dd(a.substr(0, c));c.b || (c.b = {});c.b[d] = b;b.a = c;Bd[a] = b;\n    }return b;\n  };function Ed(a, b) {\n    this.b = {};this.a = [];this.c = 0;var c = arguments.length;if (1 < c) {\n      if (c % 2) throw Error(\"Uneven number of arguments\");for (var d = 0; d < c; d += 2) {\n        this.set(arguments[d], arguments[d + 1]);\n      }\n    } else if (a) {\n      a instanceof Ed ? (c = a.S(), d = a.P()) : (c = Ra(a), d = Qa(a));for (var e = 0; e < c.length; e++) {\n        this.set(c[e], d[e]);\n      }\n    }\n  }h = Ed.prototype;h.P = function () {\n    Fd(this);for (var a = [], b = 0; b < this.a.length; b++) {\n      a.push(this.b[this.a[b]]);\n    }return a;\n  };h.S = function () {\n    Fd(this);return this.a.concat();\n  };\n  h.clear = function () {\n    this.b = {};this.c = this.a.length = 0;\n  };function Fd(a) {\n    if (a.c != a.a.length) {\n      for (var b = 0, c = 0; b < a.a.length;) {\n        var d = a.a[b];Gd(a.b, d) && (a.a[c++] = d);b++;\n      }a.a.length = c;\n    }if (a.c != a.a.length) {\n      var e = {};for (c = b = 0; b < a.a.length;) {\n        d = a.a[b], Gd(e, d) || (a.a[c++] = d, e[d] = 1), b++;\n      }a.a.length = c;\n    }\n  }h.get = function (a, b) {\n    return Gd(this.b, a) ? this.b[a] : b;\n  };h.set = function (a, b) {\n    Gd(this.b, a) || (this.c++, this.a.push(a));this.b[a] = b;\n  };\n  h.forEach = function (a, b) {\n    for (var c = this.S(), d = 0; d < c.length; d++) {\n      var e = c[d],\n          f = this.get(e);a.call(b, f, e, this);\n    }\n  };function Gd(a, b) {\n    return Object.prototype.hasOwnProperty.call(a, b);\n  };function H(a, b) {\n    a && a.log(zd, b, void 0);\n  };function Hd(a) {\n    return Da(a, function (a) {\n      a = a.toString(16);return 1 < a.length ? a : \"0\" + a;\n    }).join(\"\");\n  };var Id = null,\n      Jd = null;function Kd(a) {\n    var b = \"\";Ld(a, function (a) {\n      b += String.fromCharCode(a);\n    });return b;\n  }function Ld(a, b) {\n    function c(b) {\n      for (; d < a.length;) {\n        var c = a.charAt(d++),\n            e = Jd[c];if (null != e) return e;if (!/^[\\s\\xa0]*$/.test(c)) throw Error(\"Unknown base64 encoding at char: \" + c);\n      }return b;\n    }Md();for (var d = 0;;) {\n      var e = c(-1),\n          f = c(0),\n          g = c(64),\n          l = c(64);if (64 === l && -1 === e) break;b(e << 2 | f >> 4);64 != g && (b(f << 4 & 240 | g >> 2), 64 != l && b(g << 6 & 192 | l));\n    }\n  }\n  function Md() {\n    if (!Id) {\n      Id = {};Jd = {};for (var a = 0; 65 > a; a++) {\n        Id[a] = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=\".charAt(a), Jd[Id[a]] = a, 62 <= a && (Jd[\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_.\".charAt(a)] = a);\n      }\n    }\n  }; /*\n     Portions of this code are from MochiKit, received by\n     The Closure Authors under the MIT license. All other code is Copyright\n     2005-2009 The Closure Authors. All Rights Reserved.\n     */\n  function Nd(a, b) {\n    this.g = [];this.v = a;this.o = b || null;this.f = this.a = !1;this.c = void 0;this.u = this.w = this.i = !1;this.h = 0;this.b = null;this.l = 0;\n  }Nd.prototype.cancel = function (a) {\n    if (this.a) this.c instanceof Nd && this.c.cancel();else {\n      if (this.b) {\n        var b = this.b;delete this.b;a ? b.cancel(a) : (b.l--, 0 >= b.l && b.cancel());\n      }this.v ? this.v.call(this.o, this) : this.u = !0;this.a || (a = new Od(), Pd(this), Qd(this, !1, a));\n    }\n  };Nd.prototype.m = function (a, b) {\n    this.i = !1;Qd(this, a, b);\n  };function Qd(a, b, c) {\n    a.a = !0;a.c = c;a.f = !b;Rd(a);\n  }\n  function Pd(a) {\n    if (a.a) {\n      if (!a.u) throw new Sd();a.u = !1;\n    }\n  }Nd.prototype.A = function (a) {\n    Pd(this);Qd(this, !0, a);\n  };function Td(a, b) {\n    Ud(a, null, b, void 0);\n  }function Ud(a, b, c, d) {\n    a.g.push([b, c, d]);a.a && Rd(a);\n  }Nd.prototype.then = function (a, b, c) {\n    var d,\n        e,\n        f = new z(function (a, b) {\n      d = a;e = b;\n    });Ud(this, d, function (a) {\n      a instanceof Od ? f.cancel() : e(a);\n    });return f.then(a, b, c);\n  };mb(Nd);function Vd(a) {\n    return Ea(a.g, function (a) {\n      return p(a[1]);\n    });\n  }\n  function Rd(a) {\n    if (a.h && a.a && Vd(a)) {\n      var b = a.h,\n          c = Wd[b];c && (k.clearTimeout(c.a), delete Wd[b]);a.h = 0;\n    }a.b && (a.b.l--, delete a.b);b = a.c;for (var d = c = !1; a.g.length && !a.i;) {\n      var e = a.g.shift(),\n          f = e[0],\n          g = e[1];e = e[2];if (f = a.f ? g : f) try {\n        var l = f.call(e || a.o, b);void 0 !== l && (a.f = a.f && (l == b || l instanceof Error), a.c = b = l);if (nb(b) || \"function\" === typeof k.Promise && b instanceof k.Promise) d = !0, a.i = !0;\n      } catch (n) {\n        b = n, a.f = !0, Vd(a) || (c = !0);\n      }\n    }a.c = b;d && (l = r(a.m, a, !0), d = r(a.m, a, !1), b instanceof Nd ? (Ud(b, l, d), b.w = !0) : b.then(l, d));c && (b = new Xd(b), Wd[b.a] = b, a.h = b.a);\n  }function Sd() {\n    u.call(this);\n  }t(Sd, u);Sd.prototype.message = \"Deferred has already fired\";Sd.prototype.name = \"AlreadyCalledError\";function Od() {\n    u.call(this);\n  }t(Od, u);Od.prototype.message = \"Deferred was canceled\";Od.prototype.name = \"CanceledError\";function Xd(a) {\n    this.a = k.setTimeout(r(this.c, this), 0);this.b = a;\n  }Xd.prototype.c = function () {\n    delete Wd[this.a];throw this.b;\n  };var Wd = {};function Yd() {\n    this.b = -1;\n  };function Zd(a, b) {\n    this.b = -1;this.b = $d;this.f = k.Uint8Array ? new Uint8Array(this.b) : Array(this.b);this.g = this.c = 0;this.a = [];this.i = a;this.h = b;this.l = k.Int32Array ? new Int32Array(64) : Array(64);ae || (k.Int32Array ? ae = new Int32Array(be) : ae = be);this.reset();\n  }var ae;t(Zd, Yd);for (var $d = 64, ce = $d - 1, de = [], ee = 0; ee < ce; ee++) {\n    de[ee] = 0;\n  }var fe = Ka(128, de);Zd.prototype.reset = function () {\n    this.g = this.c = 0;this.a = k.Int32Array ? new Int32Array(this.h) : La(this.h);\n  };\n  function ge(a) {\n    for (var b = a.f, c = a.l, d = 0, e = 0; e < b.length;) {\n      c[d++] = b[e] << 24 | b[e + 1] << 16 | b[e + 2] << 8 | b[e + 3], e = 4 * d;\n    }for (b = 16; 64 > b; b++) {\n      e = c[b - 15] | 0;d = c[b - 2] | 0;var f = (c[b - 16] | 0) + ((e >>> 7 | e << 25) ^ (e >>> 18 | e << 14) ^ e >>> 3) | 0,\n          g = (c[b - 7] | 0) + ((d >>> 17 | d << 15) ^ (d >>> 19 | d << 13) ^ d >>> 10) | 0;c[b] = f + g | 0;\n    }d = a.a[0] | 0;e = a.a[1] | 0;var l = a.a[2] | 0,\n        n = a.a[3] | 0,\n        D = a.a[4] | 0,\n        vb = a.a[5] | 0,\n        tc = a.a[6] | 0;f = a.a[7] | 0;for (b = 0; 64 > b; b++) {\n      var Bj = ((d >>> 2 | d << 30) ^ (d >>> 13 | d << 19) ^ (d >>> 22 | d << 10)) + (d & e ^ d & l ^ e & l) | 0;g = D & vb ^ ~D & tc;f = f + ((D >>> 6 | D << 26) ^ (D >>> 11 | D << 21) ^ (D >>> 25 | D << 7)) | 0;g = g + (ae[b] | 0) | 0;g = f + (g + (c[b] | 0) | 0) | 0;f = tc;tc = vb;vb = D;D = n + g | 0;n = l;l = e;e = d;d = g + Bj | 0;\n    }a.a[0] = a.a[0] + d | 0;a.a[1] = a.a[1] + e | 0;a.a[2] = a.a[2] + l | 0;a.a[3] = a.a[3] + n | 0;a.a[4] = a.a[4] + D | 0;a.a[5] = a.a[5] + vb | 0;a.a[6] = a.a[6] + tc | 0;a.a[7] = a.a[7] + f | 0;\n  }\n  function he(a, b, c) {\n    void 0 === c && (c = b.length);var d = 0,\n        e = a.c;if (m(b)) for (; d < c;) {\n      a.f[e++] = b.charCodeAt(d++), e == a.b && (ge(a), e = 0);\n    } else if (ha(b)) for (; d < c;) {\n      var f = b[d++];if (!(\"number\" == typeof f && 0 <= f && 255 >= f && f == (f | 0))) throw Error(\"message must be a byte array\");a.f[e++] = f;e == a.b && (ge(a), e = 0);\n    } else throw Error(\"message must be string or array\");a.c = e;a.g += c;\n  }\n  var be = [1116352408, 1899447441, 3049323471, 3921009573, 961987163, 1508970993, 2453635748, 2870763221, 3624381080, 310598401, 607225278, 1426881987, 1925078388, 2162078206, 2614888103, 3248222580, 3835390401, 4022224774, 264347078, 604807628, 770255983, 1249150122, 1555081692, 1996064986, 2554220882, 2821834349, 2952996808, 3210313671, 3336571891, 3584528711, 113926993, 338241895, 666307205, 773529912, 1294757372, 1396182291, 1695183700, 1986661051, 2177026350, 2456956037, 2730485921, 2820302411, 3259730800, 3345764771, 3516065817, 3600352804, 4094571909, 275423344, 430227734, 506948616, 659060556, 883997877, 958139571, 1322822218, 1537002063, 1747873779, 1955562222, 2024104815, 2227730452, 2361852424, 2428436474, 2756734187, 3204031479, 3329325298];function ie() {\n    Zd.call(this, 8, je);\n  }t(ie, Zd);var je = [1779033703, 3144134277, 1013904242, 2773480762, 1359893119, 2600822924, 528734635, 1541459225];function ke(a) {\n    if (a.P && \"function\" == typeof a.P) return a.P();if (m(a)) return a.split(\"\");if (ha(a)) {\n      for (var b = [], c = a.length, d = 0; d < c; d++) {\n        b.push(a[d]);\n      }return b;\n    }return Qa(a);\n  }function le(a) {\n    if (a.S && \"function\" == typeof a.S) return a.S();if (!a.P || \"function\" != typeof a.P) {\n      if (ha(a) || m(a)) {\n        var b = [];a = a.length;for (var c = 0; c < a; c++) {\n          b.push(c);\n        }return b;\n      }return Ra(a);\n    }\n  }\n  function me(a, b) {\n    if (a.forEach && \"function\" == typeof a.forEach) a.forEach(b, void 0);else if (ha(a) || m(a)) w(a, b, void 0);else for (var c = le(a), d = ke(a), e = d.length, f = 0; f < e; f++) {\n      b.call(void 0, d[f], c && c[f], a);\n    }\n  };var ne = /^(?:([^:/?#.]+):)?(?:\\/\\/(?:([^/?#]*)@)?([^/#?]*?)(?::([0-9]+))?(?=[/#?]|$))?([^?#]+)?(?:\\?([^#]*))?(?:#([\\s\\S]*))?$/;function oe(a, b) {\n    if (a) {\n      a = a.split(\"&\");for (var c = 0; c < a.length; c++) {\n        var d = a[c].indexOf(\"=\"),\n            e = null;if (0 <= d) {\n          var f = a[c].substring(0, d);e = a[c].substring(d + 1);\n        } else f = a[c];b(f, e ? decodeURIComponent(e.replace(/\\+/g, \" \")) : \"\");\n      }\n    }\n  };function pe(a, b) {\n    this.b = this.l = this.c = \"\";this.i = null;this.h = this.g = \"\";this.f = !1;if (a instanceof pe) {\n      this.f = void 0 !== b ? b : a.f;qe(this, a.c);this.l = a.l;this.b = a.b;re(this, a.i);this.g = a.g;b = a.a;var c = new se();c.c = b.c;b.a && (c.a = new Ed(b.a), c.b = b.b);te(this, c);this.h = a.h;\n    } else a && (c = String(a).match(ne)) ? (this.f = !!b, qe(this, c[1] || \"\", !0), this.l = ue(c[2] || \"\"), this.b = ue(c[3] || \"\", !0), re(this, c[4]), this.g = ue(c[5] || \"\", !0), te(this, c[6] || \"\", !0), this.h = ue(c[7] || \"\")) : (this.f = !!b, this.a = new se(null, 0, this.f));\n  }\n  pe.prototype.toString = function () {\n    var a = [],\n        b = this.c;b && a.push(ve(b, we, !0), \":\");var c = this.b;if (c || \"file\" == b) a.push(\"//\"), (b = this.l) && a.push(ve(b, we, !0), \"@\"), a.push(encodeURIComponent(String(c)).replace(/%25([0-9a-fA-F]{2})/g, \"%$1\")), c = this.i, null != c && a.push(\":\", String(c));if (c = this.g) this.b && \"/\" != c.charAt(0) && a.push(\"/\"), a.push(ve(c, \"/\" == c.charAt(0) ? xe : ye, !0));(c = this.a.toString()) && a.push(\"?\", c);(c = this.h) && a.push(\"#\", ve(c, ze));return a.join(\"\");\n  };\n  function qe(a, b, c) {\n    a.c = c ? ue(b, !0) : b;a.c && (a.c = a.c.replace(/:$/, \"\"));\n  }function re(a, b) {\n    if (b) {\n      b = Number(b);if (isNaN(b) || 0 > b) throw Error(\"Bad port number \" + b);a.i = b;\n    } else a.i = null;\n  }function te(a, b, c) {\n    b instanceof se ? (a.a = b, Ae(a.a, a.f)) : (c || (b = ve(b, Be)), a.a = new se(b, 0, a.f));\n  }function I(a, b, c) {\n    a.a.set(b, c);\n  }function Ce(a, b) {\n    return a.a.get(b);\n  }function De(a) {\n    return a instanceof pe ? new pe(a) : new pe(a, void 0);\n  }function Ee(a, b) {\n    var c = new pe(null, void 0);qe(c, \"https\");a && (c.b = a);b && (c.g = b);return c;\n  }\n  function ue(a, b) {\n    return a ? b ? decodeURI(a.replace(/%25/g, \"%2525\")) : decodeURIComponent(a) : \"\";\n  }function ve(a, b, c) {\n    return m(a) ? (a = encodeURI(a).replace(b, Fe), c && (a = a.replace(/%25([0-9a-fA-F]{2})/g, \"%$1\")), a) : null;\n  }function Fe(a) {\n    a = a.charCodeAt(0);return \"%\" + (a >> 4 & 15).toString(16) + (a & 15).toString(16);\n  }var we = /[#\\/\\?@]/g,\n      ye = /[\\#\\?:]/g,\n      xe = /[\\#\\?]/g,\n      Be = /[\\#\\?@]/g,\n      ze = /#/g;function se(a, b, c) {\n    this.b = this.a = null;this.c = a || null;this.f = !!c;\n  }\n  function Ge(a) {\n    a.a || (a.a = new Ed(), a.b = 0, a.c && oe(a.c, function (b, c) {\n      He(a, decodeURIComponent(b.replace(/\\+/g, \" \")), c);\n    }));\n  }function Ie(a) {\n    var b = le(a);if (\"undefined\" == typeof b) throw Error(\"Keys are undefined\");var c = new se(null, 0, void 0);a = ke(a);for (var d = 0; d < b.length; d++) {\n      var e = b[d],\n          f = a[d];fa(f) ? Je(c, e, f) : He(c, e, f);\n    }return c;\n  }function He(a, b, c) {\n    Ge(a);a.c = null;b = Ke(a, b);var d = a.a.get(b);d || a.a.set(b, d = []);d.push(c);a.b += 1;\n  }\n  function Le(a, b) {\n    Ge(a);b = Ke(a, b);Gd(a.a.b, b) && (a.c = null, a.b -= a.a.get(b).length, a = a.a, Gd(a.b, b) && (delete a.b[b], a.c--, a.a.length > 2 * a.c && Fd(a)));\n  }h = se.prototype;h.clear = function () {\n    this.a = this.c = null;this.b = 0;\n  };function Me(a, b) {\n    Ge(a);b = Ke(a, b);return Gd(a.a.b, b);\n  }h.forEach = function (a, b) {\n    Ge(this);this.a.forEach(function (c, d) {\n      w(c, function (c) {\n        a.call(b, c, d, this);\n      }, this);\n    }, this);\n  };h.S = function () {\n    Ge(this);for (var a = this.a.P(), b = this.a.S(), c = [], d = 0; d < b.length; d++) {\n      for (var e = a[d], f = 0; f < e.length; f++) {\n        c.push(b[d]);\n      }\n    }return c;\n  };\n  h.P = function (a) {\n    Ge(this);var b = [];if (m(a)) Me(this, a) && (b = Ka(b, this.a.get(Ke(this, a))));else {\n      a = this.a.P();for (var c = 0; c < a.length; c++) {\n        b = Ka(b, a[c]);\n      }\n    }return b;\n  };h.set = function (a, b) {\n    Ge(this);this.c = null;a = Ke(this, a);Me(this, a) && (this.b -= this.a.get(a).length);this.a.set(a, [b]);this.b += 1;return this;\n  };h.get = function (a, b) {\n    a = a ? this.P(a) : [];return 0 < a.length ? String(a[0]) : b;\n  };function Je(a, b, c) {\n    Le(a, b);0 < c.length && (a.c = null, a.a.set(Ke(a, b), La(c)), a.b += c.length);\n  }\n  h.toString = function () {\n    if (this.c) return this.c;if (!this.a) return \"\";for (var a = [], b = this.a.S(), c = 0; c < b.length; c++) {\n      var d = b[c],\n          e = encodeURIComponent(String(d));d = this.P(d);for (var f = 0; f < d.length; f++) {\n        var g = e;\"\" !== d[f] && (g += \"=\" + encodeURIComponent(String(d[f])));a.push(g);\n      }\n    }return this.c = a.join(\"&\");\n  };function Ke(a, b) {\n    b = String(b);a.f && (b = b.toLowerCase());return b;\n  }function Ae(a, b) {\n    b && !a.f && (Ge(a), a.c = null, a.a.forEach(function (a, b) {\n      var c = b.toLowerCase();b != c && (Le(this, b), Je(this, c, a));\n    }, a));a.f = b;\n  };function Ne() {}Ne.prototype.c = null;function Oe(a) {\n    return a.c || (a.c = a.b());\n  };var Pe;function Qe() {}t(Qe, Ne);Qe.prototype.a = function () {\n    var a = Re(this);return a ? new ActiveXObject(a) : new XMLHttpRequest();\n  };Qe.prototype.b = function () {\n    var a = {};Re(this) && (a[0] = !0, a[1] = !0);return a;\n  };\n  function Re(a) {\n    if (!a.f && \"undefined\" == typeof XMLHttpRequest && \"undefined\" != typeof ActiveXObject) {\n      for (var b = [\"MSXML2.XMLHTTP.6.0\", \"MSXML2.XMLHTTP.3.0\", \"MSXML2.XMLHTTP\", \"Microsoft.XMLHTTP\"], c = 0; c < b.length; c++) {\n        var d = b[c];try {\n          return new ActiveXObject(d), a.f = d;\n        } catch (e) {}\n      }throw Error(\"Could not create ActiveXObject. ActiveX might be disabled, or MSXML might not be installed\");\n    }return a.f;\n  }Pe = new Qe();function Se(a) {\n    F.call(this);this.headers = new Ed();this.w = a || null;this.b = !1;this.v = this.a = null;this.g = this.I = this.i = \"\";this.c = this.G = this.h = this.A = !1;this.f = 0;this.m = null;this.l = Te;this.o = this.N = !1;\n  }t(Se, F);var Te = \"\",\n      Ue = Se.prototype,\n      Ve = Dd(\"goog.net.XhrIo\");Ue.J = Ve;var We = /^https?$/i,\n      Xe = [\"POST\", \"PUT\"];\n  function Ye(a, b, c, d, e) {\n    if (a.a) throw Error(\"[goog.net.XhrIo] Object is active with another request=\" + a.i + \"; newUri=\" + b);c = c ? c.toUpperCase() : \"GET\";a.i = b;a.g = \"\";a.I = c;a.A = !1;a.b = !0;a.a = a.w ? a.w.a() : Pe.a();a.v = a.w ? Oe(a.w) : Oe(Pe);a.a.onreadystatechange = r(a.zb, a);try {\n      H(a.J, Ze(a, \"Opening Xhr\")), a.G = !0, a.a.open(c, String(b), !0), a.G = !1;\n    } catch (g) {\n      H(a.J, Ze(a, \"Error opening Xhr: \" + g.message));$e(a, g);return;\n    }b = d || \"\";var f = new Ed(a.headers);e && me(e, function (a, b) {\n      f.set(b, a);\n    });e = Fa(f.S());d = k.FormData && b instanceof k.FormData;!Ha(Xe, c) || e || d || f.set(\"Content-Type\", \"application/x-www-form-urlencoded;charset=utf-8\");f.forEach(function (a, b) {\n      this.a.setRequestHeader(b, a);\n    }, a);a.l && (a.a.responseType = a.l);\"withCredentials\" in a.a && a.a.withCredentials !== a.N && (a.a.withCredentials = a.N);try {\n      af(a), 0 < a.f && (a.o = bf(a.a), H(a.J, Ze(a, \"Will abort after \" + a.f + \"ms if incomplete, xhr2 \" + a.o)), a.o ? (a.a.timeout = a.f, a.a.ontimeout = r(a.Ea, a)) : a.m = rd(a.Ea, a.f, a)), H(a.J, Ze(a, \"Sending request\")), a.h = !0, a.a.send(b), a.h = !1;\n    } catch (g) {\n      H(a.J, Ze(a, \"Send error: \" + g.message)), $e(a, g);\n    }\n  }function bf(a) {\n    return y && jb(9) && \"number\" == typeof a.timeout && void 0 !== a.ontimeout;\n  }function Ga(a) {\n    return \"content-type\" == a.toLowerCase();\n  }h = Se.prototype;h.Ea = function () {\n    \"undefined\" != typeof aa && this.a && (this.g = \"Timed out after \" + this.f + \"ms, aborting\", H(this.J, Ze(this, this.g)), G(this, \"timeout\"), this.abort(8));\n  };function $e(a, b) {\n    a.b = !1;a.a && (a.c = !0, a.a.abort(), a.c = !1);a.g = b;cf(a);df(a);\n  }function cf(a) {\n    a.A || (a.A = !0, G(a, \"complete\"), G(a, \"error\"));\n  }\n  h.abort = function () {\n    this.a && this.b && (H(this.J, Ze(this, \"Aborting\")), this.b = !1, this.c = !0, this.a.abort(), this.c = !1, G(this, \"complete\"), G(this, \"abort\"), df(this));\n  };h.ta = function () {\n    this.a && (this.b && (this.b = !1, this.c = !0, this.a.abort(), this.c = !1), df(this, !0));Se.ib.ta.call(this);\n  };h.zb = function () {\n    this.oa || (this.G || this.h || this.c ? ef(this) : this.fc());\n  };h.fc = function () {\n    ef(this);\n  };\n  function ef(a) {\n    if (a.b && \"undefined\" != typeof aa) if (a.v[1] && 4 == ff(a) && 2 == gf(a)) H(a.J, Ze(a, \"Local request error detected and ignored\"));else if (a.h && 4 == ff(a)) rd(a.zb, 0, a);else if (G(a, \"readystatechange\"), 4 == ff(a)) {\n      H(a.J, Ze(a, \"Request complete\"));a.b = !1;try {\n        var b = gf(a);a: switch (b) {case 200:case 201:case 202:case 204:case 206:case 304:case 1223:\n            var c = !0;break a;default:\n            c = !1;}var d;if (!(d = c)) {\n          var e;if (e = 0 === b) {\n            var f = String(a.i).match(ne)[1] || null;if (!f && k.self && k.self.location) {\n              var g = k.self.location.protocol;\n              f = g.substr(0, g.length - 1);\n            }e = !We.test(f ? f.toLowerCase() : \"\");\n          }d = e;\n        }if (d) G(a, \"complete\"), G(a, \"success\");else {\n          try {\n            var l = 2 < ff(a) ? a.a.statusText : \"\";\n          } catch (n) {\n            H(a.J, \"Can not get status: \" + n.message), l = \"\";\n          }a.g = l + \" [\" + gf(a) + \"]\";cf(a);\n        }\n      } finally {\n        df(a);\n      }\n    }\n  }function df(a, b) {\n    if (a.a) {\n      af(a);var c = a.a,\n          d = a.v[0] ? ca : null;a.a = null;a.v = null;b || G(a, \"ready\");try {\n        c.onreadystatechange = d;\n      } catch (e) {\n        (a = a.J) && a.log(xd, \"Problem encountered resetting onreadystatechange: \" + e.message, void 0);\n      }\n    }\n  }\n  function af(a) {\n    a.a && a.o && (a.a.ontimeout = null);\"number\" == typeof a.m && (k.clearTimeout(a.m), a.m = null);\n  }function ff(a) {\n    return a.a ? a.a.readyState : 0;\n  }function gf(a) {\n    try {\n      return 2 < ff(a) ? a.a.status : -1;\n    } catch (b) {\n      return -1;\n    }\n  }function hf(a) {\n    try {\n      return a.a ? a.a.responseText : \"\";\n    } catch (b) {\n      return H(a.J, \"Can not get responseText: \" + b.message), \"\";\n    }\n  }\n  h.getResponse = function () {\n    try {\n      if (!this.a) return null;if (\"response\" in this.a) return this.a.response;switch (this.l) {case Te:case \"text\":\n          return this.a.responseText;case \"arraybuffer\":\n          if (\"mozResponseArrayBuffer\" in this.a) return this.a.mozResponseArrayBuffer;}var a = this.J;a && a.log(xd, \"Response type \" + this.l + \" is not supported on this browser\", void 0);return null;\n    } catch (b) {\n      return H(this.J, \"Can not get response: \" + b.message), null;\n    }\n  };function Ze(a, b) {\n    return b + \" [\" + a.I + \" \" + a.i + \" \" + gf(a) + \"]\";\n  };var jf = /^[+a-zA-Z0-9_.!#$%&'*\\/=?^`{|}~-]+@([a-zA-Z0-9-]+\\.)+[a-zA-Z0-9]{2,63}$/;function kf(a) {\n    var b = {},\n        c = b.document || document,\n        d = gc(a),\n        e = document.createElement(\"SCRIPT\"),\n        f = { Bb: e, Ea: void 0 },\n        g = new Nd(lf, f),\n        l = null,\n        n = null != b.timeout ? b.timeout : 5E3;0 < n && (l = window.setTimeout(function () {\n      mf(e, !0);var a = new nf(of, \"Timeout reached for loading script \" + d);Pd(g);Qd(g, !1, a);\n    }, n), f.Ea = l);e.onload = e.onreadystatechange = function () {\n      e.readyState && \"loaded\" != e.readyState && \"complete\" != e.readyState || (mf(e, b.Oc || !1, l), g.A(null));\n    };e.onerror = function () {\n      mf(e, !0, l);var a = new nf(pf, \"Error while loading script \" + d);Pd(g);Qd(g, !1, a);\n    };f = b.attributes || {};Wa(f, { type: \"text/javascript\", charset: \"UTF-8\" });xc(e, f);e.src = gc(a);qf(c).appendChild(e);return g;\n  }function qf(a) {\n    var b;return (b = (a || document).getElementsByTagName(\"HEAD\")) && 0 != b.length ? b[0] : a.documentElement;\n  }function lf() {\n    if (this && this.Bb) {\n      var a = this.Bb;a && \"SCRIPT\" == a.tagName && mf(a, !0, this.Ea);\n    }\n  }\n  function mf(a, b, c) {\n    null != c && k.clearTimeout(c);a.onload = ca;a.onerror = ca;a.onreadystatechange = ca;b && window.setTimeout(function () {\n      a && a.parentNode && a.parentNode.removeChild(a);\n    }, 0);\n  }var pf = 0,\n      of = 1;function nf(a, b) {\n    var c = \"Jsloader error (code #\" + a + \")\";b && (c += \": \" + b);u.call(this, c);this.code = a;\n  }t(nf, u);function rf() {}t(rf, Ne);rf.prototype.a = function () {\n    var a = new XMLHttpRequest();if (\"withCredentials\" in a) return a;if (\"undefined\" != typeof XDomainRequest) return new sf();throw Error(\"Unsupported browser\");\n  };rf.prototype.b = function () {\n    return {};\n  };\n  function sf() {\n    this.a = new XDomainRequest();this.readyState = 0;this.onreadystatechange = null;this.responseText = \"\";this.status = -1;this.statusText = this.responseXML = null;this.a.onload = r(this.Sb, this);this.a.onerror = r(this.wb, this);this.a.onprogress = r(this.Tb, this);this.a.ontimeout = r(this.Ub, this);\n  }h = sf.prototype;h.open = function (a, b, c) {\n    if (null != c && !c) throw Error(\"Only async requests are supported.\");this.a.open(a, b);\n  };\n  h.send = function (a) {\n    if (a) {\n      if (\"string\" == typeof a) this.a.send(a);else throw Error(\"Only string data is supported\");\n    } else this.a.send();\n  };h.abort = function () {\n    this.a.abort();\n  };h.setRequestHeader = function () {};h.getResponseHeader = function (a) {\n    return \"content-type\" == a.toLowerCase() ? this.a.contentType : \"\";\n  };h.Sb = function () {\n    this.status = 200;this.responseText = this.a.responseText;tf(this, 4);\n  };h.wb = function () {\n    this.status = 500;this.responseText = \"\";tf(this, 4);\n  };h.Ub = function () {\n    this.wb();\n  };\n  h.Tb = function () {\n    this.status = 200;tf(this, 1);\n  };function tf(a, b) {\n    a.readyState = b;if (a.onreadystatechange) a.onreadystatechange();\n  }h.getAllResponseHeaders = function () {\n    return \"content-type: \" + this.a.contentType;\n  };function uf() {\n    var a = J();return y && !!kb && 11 == kb || /Edge\\/\\d+/.test(a);\n  }function vf() {\n    return k.window && k.window.location.href || \"\";\n  }function wf(a, b) {\n    b = b || k.window;var c = \"about:blank\";a && (c = nc(pc(a)));b.location.href = c;\n  }function xf(a, b) {\n    var c = [],\n        d;for (d in a) {\n      d in b ? _typeof(a[d]) != _typeof(b[d]) ? c.push(d) : fa(a[d]) ? Ta(a[d], b[d]) || c.push(d) : \"object\" == _typeof(a[d]) && null != a[d] && null != b[d] ? 0 < xf(a[d], b[d]).length && c.push(d) : a[d] !== b[d] && c.push(d) : c.push(d);\n    }for (d in b) {\n      d in a || c.push(d);\n    }return c;\n  }\n  function yf() {\n    var a = J();a = zf(a) != Af ? null : (a = a.match(/\\sChrome\\/(\\d+)/i)) && 2 == a.length ? parseInt(a[1], 10) : null;return a && 30 > a ? !1 : !y || !kb || 9 < kb;\n  }function Bf(a) {\n    a = (a || J()).toLowerCase();return a.match(/android/) || a.match(/webos/) || a.match(/iphone|ipad|ipod/) || a.match(/blackberry/) || a.match(/windows phone/) || a.match(/iemobile/) ? !0 : !1;\n  }function Cf(a) {\n    a = a || k.window;try {\n      a.close();\n    } catch (b) {}\n  }\n  function Df(a, b, c) {\n    var d = Math.floor(1E9 * Math.random()).toString();b = b || 500;c = c || 600;var e = (window.screen.availHeight - c) / 2,\n        f = (window.screen.availWidth - b) / 2;b = { width: b, height: c, top: 0 < e ? e : 0, left: 0 < f ? f : 0, location: !0, resizable: !0, statusbar: !0, toolbar: !1 };c = J().toLowerCase();d && (b.target = d, v(c, \"crios/\") && (b.target = \"_blank\"));zf(J()) == Ef && (a = a || \"http://localhost\", b.scrollbars = !0);c = a || \"\";(d = b) || (d = {});a = window;b = c instanceof lc ? c : pc(\"undefined\" != typeof c.href ? c.href : String(c));c = d.target || c.target;e = [];\n    for (g in d) {\n      switch (g) {case \"width\":case \"height\":case \"top\":case \"left\":\n          e.push(g + \"=\" + d[g]);break;case \"target\":case \"noreferrer\":\n          break;default:\n          e.push(g + \"=\" + (d[g] ? 1 : 0));}\n    }var g = e.join(\",\");(x(\"iPhone\") && !x(\"iPod\") && !x(\"iPad\") || x(\"iPad\") || x(\"iPod\")) && a.navigator && a.navigator.standalone && c && \"_self\" != c ? (g = a.document.createElement(\"A\"), b instanceof lc || b instanceof lc || (b = b.la ? b.ja() : String(b), oc.test(b) || (b = \"about:invalid#zClosurez\"), b = qc(b)), g.href = nc(b), g.setAttribute(\"target\", c), d.noreferrer && g.setAttribute(\"rel\", \"noreferrer\"), d = document.createEvent(\"MouseEvent\"), d.initMouseEvent(\"click\", !0, !0, a, 1), g.dispatchEvent(d), g = {}) : d.noreferrer ? (g = a.open(\"\", c, g), a = nc(b), g && (bb && v(a, \";\") && (a = \"'\" + a.replace(/'/g, \"%27\") + \"'\"), g.opener = null, dc(\"b/12014412, meta tag with sanitized URL\"), a = '<META HTTP-EQUIV=\"refresh\" content=\"0; url=' + qa(a) + '\">', a = vc(a), g.document.write(uc(a)), g.document.close())) : g = a.open(nc(b), c, g);if (g) try {\n      g.focus();\n    } catch (l) {}return g;\n  }\n  function Ff(a) {\n    return new z(function (b) {\n      function c() {\n        sd(2E3).then(function () {\n          if (!a || a.closed) b();else return c();\n        });\n      }return c();\n    });\n  }var Gf = /^\\d{1,3}\\.\\d{1,3}\\.\\d{1,3}\\.\\d{1,3}$/;function Hf() {\n    var a = null;return new z(function (b) {\n      \"complete\" == k.document.readyState ? b() : (a = function a() {\n        b();\n      }, dd(window, \"load\", a));\n    }).s(function (b) {\n      E(window, \"load\", a);throw b;\n    });\n  }\n  function If() {\n    return Jf(void 0) ? Hf().then(function () {\n      return new z(function (a, b) {\n        var c = k.document,\n            d = setTimeout(function () {\n          b(Error(\"Cordova framework is not ready.\"));\n        }, 1E3);c.addEventListener(\"deviceready\", function () {\n          clearTimeout(d);a();\n        }, !1);\n      });\n    }) : B(Error(\"Cordova must run in an Android or iOS file scheme.\"));\n  }function Jf(a) {\n    a = a || J();return !(\"file:\" !== Kf() || !a.toLowerCase().match(/iphone|ipad|ipod|android/));\n  }function Lf() {\n    var a = k.window;try {\n      return !(!a || a == a.top);\n    } catch (b) {\n      return !1;\n    }\n  }\n  function K() {\n    return firebase.INTERNAL.hasOwnProperty(\"reactNative\") ? \"ReactNative\" : firebase.INTERNAL.hasOwnProperty(\"node\") ? \"Node\" : \"Browser\";\n  }function Mf() {\n    var a = K();return \"ReactNative\" === a || \"Node\" === a;\n  }var Ef = \"Firefox\",\n      Af = \"Chrome\";\n  function zf(a) {\n    var b = a.toLowerCase();if (v(b, \"opera/\") || v(b, \"opr/\") || v(b, \"opios/\")) return \"Opera\";if (v(b, \"iemobile\")) return \"IEMobile\";if (v(b, \"msie\") || v(b, \"trident/\")) return \"IE\";if (v(b, \"edge/\")) return \"Edge\";if (v(b, \"firefox/\")) return Ef;if (v(b, \"silk/\")) return \"Silk\";if (v(b, \"blackberry\")) return \"Blackberry\";if (v(b, \"webos\")) return \"Webos\";if (!v(b, \"safari/\") || v(b, \"chrome/\") || v(b, \"crios/\") || v(b, \"android\")) {\n      if (!v(b, \"chrome/\") && !v(b, \"crios/\") || v(b, \"edge/\")) {\n        if (v(b, \"android\")) return \"Android\";if ((a = a.match(/([a-zA-Z\\d\\.]+)\\/[a-zA-Z\\d\\.]*$/)) && 2 == a.length) return a[1];\n      } else return Af;\n    } else return \"Safari\";return \"Other\";\n  }var Nf = { Cc: \"FirebaseCore-web\", Ec: \"FirebaseUI-web\" };function Of(a, b) {\n    b = b || [];var c = [],\n        d = {},\n        e;for (e in Nf) {\n      d[Nf[e]] = !0;\n    }for (e = 0; e < b.length; e++) {\n      \"undefined\" !== typeof d[b[e]] && (delete d[b[e]], c.push(b[e]));\n    }c.sort();b = c;b.length || (b = [\"FirebaseCore-web\"]);c = K();d = \"\";\"Browser\" === c ? d = zf(J()) : d = c;return d + \"/JsCore/\" + a + \"/\" + b.join(\",\");\n  }function J() {\n    return k.navigator && k.navigator.userAgent || \"\";\n  }\n  function L(a, b) {\n    a = a.split(\".\");b = b || k;for (var c = 0; c < a.length && \"object\" == (typeof b === \"undefined\" ? \"undefined\" : _typeof(b)) && null != b; c++) {\n      b = b[a[c]];\n    }c != a.length && (b = void 0);return b;\n  }function Pf() {\n    try {\n      var a = k.localStorage,\n          b = Qf();if (a) return a.setItem(b, \"1\"), a.removeItem(b), uf() ? !!k.indexedDB : !0;\n    } catch (c) {}return !1;\n  }function Rf() {\n    return (Sf() || \"chrome-extension:\" === Kf() || Jf()) && !Mf() && Pf();\n  }function Sf() {\n    return \"http:\" === Kf() || \"https:\" === Kf();\n  }function Kf() {\n    return k.location && k.location.protocol || null;\n  }\n  function Tf(a) {\n    a = a || J();return Bf(a) || zf(a) == Ef ? !1 : !0;\n  }function Uf(a) {\n    return \"undefined\" === typeof a ? null : Cc(a);\n  }function Vf(a) {\n    var b = {},\n        c;for (c in a) {\n      a.hasOwnProperty(c) && null !== a[c] && void 0 !== a[c] && (b[c] = a[c]);\n    }return b;\n  }function Wf(a) {\n    if (null !== a) return JSON.parse(a);\n  }function Qf(a) {\n    return a ? a : \"\" + Math.floor(1E9 * Math.random()).toString();\n  }function Xf(a) {\n    a = a || J();return \"Safari\" == zf(a) || a.toLowerCase().match(/iphone|ipad|ipod/) ? !1 : !0;\n  }\n  function Yf() {\n    var a = k.___jsl;if (a && a.H) for (var b in a.H) {\n      if (a.H[b].r = a.H[b].r || [], a.H[b].L = a.H[b].L || [], a.H[b].r = a.H[b].L.concat(), a.CP) for (var c = 0; c < a.CP.length; c++) {\n        a.CP[c] = null;\n      }\n    }\n  }function Zf() {\n    var a = k.navigator;return a && \"boolean\" === typeof a.onLine && (Sf() || \"chrome-extension:\" === Kf() || \"undefined\" !== typeof a.connection) ? a.onLine : !0;\n  }function $f(a, b, c, d) {\n    if (a > b) throw Error(\"Short delay should be less than long delay!\");this.c = a;this.b = b;a = c || J();d = d || K();this.a = Bf(a) || \"ReactNative\" === d;\n  }\n  $f.prototype.get = function () {\n    return this.a ? this.b : this.c;\n  };function ag() {\n    var a = k.document;return a && \"undefined\" !== typeof a.visibilityState ? \"visible\" == a.visibilityState : !0;\n  }function bg() {\n    var a = k.document,\n        _b = null;return ag() || !a ? A() : new z(function (c) {\n      _b = function b() {\n        ag() && (a.removeEventListener(\"visibilitychange\", _b, !1), c());\n      };a.addEventListener(\"visibilitychange\", _b, !1);\n    }).s(function (c) {\n      a.removeEventListener(\"visibilitychange\", _b, !1);throw c;\n    });\n  }\n  function cg(a) {\n    try {\n      var b = new Date(parseInt(a, 10));if (!isNaN(b.getTime()) && !/[^0-9]/.test(a)) return b.toUTCString();\n    } catch (c) {}return null;\n  };var dg = {};var eg;try {\n    var fg = {};Object.defineProperty(fg, \"abcd\", { configurable: !0, enumerable: !0, value: 1 });Object.defineProperty(fg, \"abcd\", { configurable: !0, enumerable: !0, value: 2 });eg = 2 == fg.abcd;\n  } catch (a) {\n    eg = !1;\n  }function M(a, b, c) {\n    eg ? Object.defineProperty(a, b, { configurable: !0, enumerable: !0, value: c }) : a[b] = c;\n  }function gg(a, b) {\n    if (b) for (var c in b) {\n      b.hasOwnProperty(c) && M(a, c, b[c]);\n    }\n  }function hg(a) {\n    var b = {};gg(b, a);return b;\n  }function ig(a) {\n    var b = {},\n        c;for (c in a) {\n      a.hasOwnProperty(c) && (b[c] = a[c]);\n    }return b;\n  }\n  function jg(a, b) {\n    if (!b || !b.length) return !0;if (!a) return !1;for (var c = 0; c < b.length; c++) {\n      var d = a[b[c]];if (void 0 === d || null === d || \"\" === d) return !1;\n    }return !0;\n  }function kg(a) {\n    var b = a;if (\"object\" == (typeof a === \"undefined\" ? \"undefined\" : _typeof(a)) && null != a) {\n      b = \"length\" in a ? [] : {};for (var c in a) {\n        M(b, c, kg(a[c]));\n      }\n    }return b;\n  };function lg(a) {\n    var b = {},\n        c = a[mg],\n        d = a[ng];a = a[og];if (!c || !a) throw Error(\"Invalid provider user info!\");b[pg] = d || null;b[qg] = c;M(this, rg, a);M(this, sg, kg(b));\n  }var mg = \"email\",\n      ng = \"newEmail\",\n      og = \"requestType\",\n      qg = \"email\",\n      pg = \"fromEmail\",\n      sg = \"data\",\n      rg = \"operation\";function N(a, b) {\n    this.code = tg + a;this.message = b || ug[a] || \"\";\n  }t(N, Error);N.prototype.B = function () {\n    return { code: this.code, message: this.message };\n  };N.prototype.toJSON = function () {\n    return this.B();\n  };function vg(a) {\n    var b = a && a.code;return b ? new N(b.substring(tg.length), a.message) : null;\n  }\n  var tg = \"auth/\",\n      ug = { \"argument-error\": \"\", \"app-not-authorized\": \"This app, identified by the domain where it's hosted, is not authorized to use Firebase Authentication with the provided API key. Review your key configuration in the Google API console.\", \"app-not-installed\": \"The requested mobile application corresponding to the identifier (Android package name or iOS bundle ID) provided is not installed on this device.\", \"captcha-check-failed\": \"The reCAPTCHA response token provided is either invalid, expired, already used or the domain associated with it does not match the list of whitelisted domains.\",\n    \"code-expired\": \"The SMS code has expired. Please re-send the verification code to try again.\", \"cordova-not-ready\": \"Cordova framework is not ready.\", \"cors-unsupported\": \"This browser is not supported.\", \"credential-already-in-use\": \"This credential is already associated with a different user account.\", \"custom-token-mismatch\": \"The custom token corresponds to a different audience.\", \"requires-recent-login\": \"This operation is sensitive and requires recent authentication. Log in again before retrying this request.\",\n    \"dynamic-link-not-activated\": \"Please activate Dynamic Links in the Firebase Console and agree to the terms and conditions.\", \"email-already-in-use\": \"The email address is already in use by another account.\", \"expired-action-code\": \"The action code has expired. \", \"cancelled-popup-request\": \"This operation has been cancelled due to another conflicting popup being opened.\", \"internal-error\": \"An internal error has occurred.\", \"invalid-app-credential\": \"The phone verification request contains an invalid application verifier. The reCAPTCHA token response is either invalid or expired.\",\n    \"invalid-app-id\": \"The mobile app identifier is not registed for the current project.\", \"invalid-user-token\": \"The user's credential is no longer valid. The user must sign in again.\", \"invalid-auth-event\": \"An internal error has occurred.\", \"invalid-verification-code\": \"The SMS verification code used to create the phone auth credential is invalid. Please resend the verification code sms and be sure use the verification code provided by the user.\", \"invalid-continue-uri\": \"The continue URL provided in the request is invalid.\",\n    \"invalid-cordova-configuration\": \"The following Cordova plugins must be installed to enable OAuth sign-in: cordova-plugin-buildinfo, cordova-universal-links-plugin, cordova-plugin-browsertab, cordova-plugin-inappbrowser and cordova-plugin-customurlscheme.\", \"invalid-custom-token\": \"The custom token format is incorrect. Please check the documentation.\", \"invalid-email\": \"The email address is badly formatted.\", \"invalid-api-key\": \"Your API key is invalid, please check you have copied it correctly.\", \"invalid-cert-hash\": \"The SHA-1 certificate hash provided is invalid.\",\n    \"invalid-credential\": \"The supplied auth credential is malformed or has expired.\", \"invalid-persistence-type\": \"The specified persistence type is invalid. It can only be local, session or none.\", \"invalid-message-payload\": \"The email template corresponding to this action contains invalid characters in its message. Please fix by going to the Auth email templates section in the Firebase Console.\", \"invalid-oauth-provider\": \"EmailAuthProvider is not supported for this operation. This operation only supports OAuth providers.\",\n    \"invalid-oauth-client-id\": \"The OAuth client ID provided is either invalid or does not match the specified API key.\", \"unauthorized-domain\": \"This domain is not authorized for OAuth operations for your Firebase project. Edit the list of authorized domains from the Firebase console.\", \"invalid-action-code\": \"The action code is invalid. This can happen if the code is malformed, expired, or has already been used.\", \"wrong-password\": \"The password is invalid or the user does not have a password.\", \"invalid-phone-number\": \"The format of the phone number provided is incorrect. Please enter the phone number in a format that can be parsed into E.164 format. E.164 phone numbers are written in the format [+][country code][subscriber number including area code].\",\n    \"invalid-recipient-email\": \"The email corresponding to this action failed to send as the provided recipient email address is invalid.\", \"invalid-sender\": \"The email template corresponding to this action contains an invalid sender email or name. Please fix by going to the Auth email templates section in the Firebase Console.\", \"invalid-verification-id\": \"The verification ID used to create the phone auth credential is invalid.\", \"missing-android-pkg-name\": \"An Android Package Name must be provided if the Android App is required to be installed.\",\n    \"auth-domain-config-required\": \"Be sure to include authDomain when calling firebase.initializeApp(), by following the instructions in the Firebase console.\", \"missing-app-credential\": \"The phone verification request is missing an application verifier assertion. A reCAPTCHA response token needs to be provided.\", \"missing-verification-code\": \"The phone auth credential was created with an empty SMS verification code.\", \"missing-continue-uri\": \"A continue URL must be provided in the request.\", \"missing-iframe-start\": \"An internal error has occurred.\",\n    \"missing-ios-bundle-id\": \"An iOS Bundle ID must be provided if an App Store ID is provided.\", \"missing-phone-number\": \"To send verification codes, provide a phone number for the recipient.\", \"missing-verification-id\": \"The phone auth credential was created with an empty verification ID.\", \"app-deleted\": \"This instance of FirebaseApp has been deleted.\", \"account-exists-with-different-credential\": \"An account already exists with the same email address but different sign-in credentials. Sign in using a provider associated with this email address.\",\n    \"network-request-failed\": \"A network error (such as timeout, interrupted connection or unreachable host) has occurred.\", \"no-auth-event\": \"An internal error has occurred.\", \"no-such-provider\": \"User was not linked to an account with the given provider.\", \"operation-not-allowed\": \"The given sign-in provider is disabled for this Firebase project. Enable it in the Firebase console, under the sign-in method tab of the Auth section.\", \"operation-not-supported-in-this-environment\": 'This operation is not supported in the environment this application is running on. \"location.protocol\" must be http, https or chrome-extension and web storage must be enabled.',\n    \"popup-blocked\": \"Unable to establish a connection with the popup. It may have been blocked by the browser.\", \"popup-closed-by-user\": \"The popup has been closed by the user before finalizing the operation.\", \"provider-already-linked\": \"User can only be linked to one identity for the given provider.\", \"quota-exceeded\": \"The project's quota for this operation has been exceeded.\", \"redirect-cancelled-by-user\": \"The redirect operation has been cancelled by the user before finalizing.\", \"redirect-operation-pending\": \"A redirect sign-in operation is already pending.\",\n    timeout: \"The operation has timed out.\", \"user-token-expired\": \"The user's credential is no longer valid. The user must sign in again.\", \"too-many-requests\": \"We have blocked all requests from this device due to unusual activity. Try again later.\", \"unauthorized-continue-uri\": \"The domain of the continue URL is not whitelisted.  Please whitelist the domain in the Firebase console.\", \"unsupported-persistence-type\": \"The current environment does not support the specified persistence type.\", \"user-cancelled\": \"User did not grant your application the permissions it requested.\",\n    \"user-not-found\": \"There is no user record corresponding to this identifier. The user may have been deleted.\", \"user-disabled\": \"The user account has been disabled by an administrator.\", \"user-mismatch\": \"The supplied credentials do not correspond to the previously signed in user.\", \"user-signed-out\": \"\", \"weak-password\": \"The password must be 6 characters long or more.\", \"web-storage-unsupported\": \"This browser is not supported or 3rd party cookies and data may be disabled.\" };function wg(a) {\n    var b = a[xg];if (\"undefined\" === typeof b) throw new N(\"missing-continue-uri\");if (\"string\" !== typeof b || \"string\" === typeof b && !b.length) throw new N(\"invalid-continue-uri\");this.h = b;this.c = this.a = null;this.g = !1;var c = a[yg];if (c && \"object\" === (typeof c === \"undefined\" ? \"undefined\" : _typeof(c))) {\n      b = c[zg];var d = c[Ag];c = c[Bg];if (\"string\" === typeof b && b.length) {\n        this.a = b;if (\"undefined\" !== typeof d && \"boolean\" !== typeof d) throw new N(\"argument-error\", Ag + \" property must be a boolean when specified.\");this.g = !!d;if (\"undefined\" !== typeof c && (\"string\" !== typeof c || \"string\" === typeof c && !c.length)) throw new N(\"argument-error\", Bg + \" property must be a non empty string when specified.\");this.c = c || null;\n      } else {\n        if (\"undefined\" !== typeof b) throw new N(\"argument-error\", zg + \" property must be a non empty string when specified.\");if (\"undefined\" !== typeof d || \"undefined\" !== typeof c) throw new N(\"missing-android-pkg-name\");\n      }\n    } else if (\"undefined\" !== typeof c) throw new N(\"argument-error\", yg + \" property must be a non null object when specified.\");this.b = null;if ((b = a[Cg]) && \"object\" === (typeof b === \"undefined\" ? \"undefined\" : _typeof(b))) {\n      if (b = b[Dg], \"string\" === typeof b && b.length) this.b = b;else {\n        if (\"undefined\" !== typeof b) throw new N(\"argument-error\", Dg + \" property must be a non empty string when specified.\");\n      }\n    } else if (\"undefined\" !== typeof b) throw new N(\"argument-error\", Cg + \" property must be a non null object when specified.\");a = a[Eg];if (\"undefined\" !== typeof a && \"boolean\" !== typeof a) throw new N(\"argument-error\", Eg + \" property must be a boolean when specified.\");if ((this.f = !!a) && !this.b && !this.a) throw new N(\"argument-error\", Eg + \" property can't be true when no mobile application is provided.\");\n  }var yg = \"android\",\n      Eg = \"handleCodeInApp\",\n      Cg = \"iOS\",\n      xg = \"url\",\n      Ag = \"installApp\",\n      Bg = \"minimumVersion\",\n      zg = \"packageName\",\n      Dg = \"bundleId\";function Fg(a) {\n    var b = {};b.continueUrl = a.h;b.canHandleCodeInApp = a.f;if (b.androidPackageName = a.a) b.androidMinimumVersion = a.c, b.androidInstallApp = a.g;b.iOSBundleId = a.b;for (var c in b) {\n      null === b[c] && delete b[c];\n    }return b;\n  };function Gg(a) {\n    this.b = a.sub;na();this.a = a.provider_id || a.firebase && a.firebase.sign_in_provider || null;\n  }function Hg(a) {\n    a = a.split(\".\");if (3 != a.length) return null;a = a[1];for (var b = (4 - a.length % 4) % 4, c = 0; c < b; c++) {\n      a += \".\";\n    }try {\n      var d = JSON.parse(Kd(a));if (d.sub && d.iss && d.aud && d.exp) return new Gg(d);\n    } catch (e) {}return null;\n  };var Ig = \"oauth_consumer_key oauth_nonce oauth_signature oauth_signature_method oauth_timestamp oauth_token oauth_version\".split(\" \"),\n      Jg = [\"client_id\", \"response_type\", \"scope\", \"redirect_uri\", \"state\"],\n      Kg = { Dc: { Ma: \"locale\", za: 500, ya: 600, Na: \"facebook.com\", $a: Jg }, Fc: { Ma: null, za: 500, ya: 620, Na: \"github.com\", $a: Jg }, Gc: { Ma: \"hl\", za: 515, ya: 680, Na: \"google.com\", $a: Jg }, Mc: { Ma: \"lang\", za: 485, ya: 705, Na: \"twitter.com\", $a: Ig } };function Lg(a) {\n    for (var b in Kg) {\n      if (Kg[b].Na == a) return Kg[b];\n    }return null;\n  };function Mg(a) {\n    var b = {};b[\"facebook.com\"] = Ng;b[\"google.com\"] = Og;b[\"github.com\"] = Pg;b[\"twitter.com\"] = Qg;var c = a && a[Rg];try {\n      if (c) return b[c] ? new b[c](a) : new Sg(a);if (\"undefined\" !== typeof a[Tg]) return new Ug(a);\n    } catch (d) {}return null;\n  }var Tg = \"idToken\",\n      Rg = \"providerId\";function Ug(a) {\n    var b = a[Rg];if (!b && a[Tg]) {\n      var c = Hg(a[Tg]);c && c.a && (b = c.a);\n    }if (!b) throw Error(\"Invalid additional user info!\");a = !!a.isNewUser;M(this, \"providerId\", b);M(this, \"isNewUser\", a);\n  }\n  function Sg(a) {\n    Ug.call(this, a);a = Wf(a.rawUserInfo || \"{}\");M(this, \"profile\", kg(a || {}));\n  }t(Sg, Ug);function Ng(a) {\n    Sg.call(this, a);if (\"facebook.com\" != this.providerId) throw Error(\"Invalid provider ID!\");\n  }t(Ng, Sg);function Pg(a) {\n    Sg.call(this, a);if (\"github.com\" != this.providerId) throw Error(\"Invalid provider ID!\");M(this, \"username\", this.profile && this.profile.login || null);\n  }t(Pg, Sg);function Og(a) {\n    Sg.call(this, a);if (\"google.com\" != this.providerId) throw Error(\"Invalid provider ID!\");\n  }t(Og, Sg);\n  function Qg(a) {\n    Sg.call(this, a);if (\"twitter.com\" != this.providerId) throw Error(\"Invalid provider ID!\");M(this, \"username\", a.screenName || null);\n  }t(Qg, Sg);function Vg(a, b) {\n    return a.then(function (a) {\n      if (a[_O]) {\n        var c = Hg(a[_O]);if (!c || b != c.b) throw new N(\"user-mismatch\");return a;\n      }throw new N(\"user-mismatch\");\n    }).s(function (a) {\n      throw a && a.code && a.code == tg + \"user-not-found\" ? new N(\"user-mismatch\") : a;\n    });\n  }\n  function Wg(a, b) {\n    if (b.idToken || b.accessToken) b.idToken && M(this, \"idToken\", b.idToken), b.accessToken && M(this, \"accessToken\", b.accessToken);else if (b.oauthToken && b.oauthTokenSecret) M(this, \"accessToken\", b.oauthToken), M(this, \"secret\", b.oauthTokenSecret);else throw new N(\"internal-error\", \"failed to construct a credential\");M(this, \"providerId\", a);\n  }Wg.prototype.wa = function (a) {\n    return Xg(a, Yg(this));\n  };Wg.prototype.b = function (a, b) {\n    var c = Yg(this);c.idToken = b;return Zg(a, c);\n  };\n  Wg.prototype.c = function (a, b) {\n    var c = Yg(this);return Vg($g(a, c), b);\n  };function Yg(a) {\n    var b = {};a.idToken && (b.id_token = a.idToken);a.accessToken && (b.access_token = a.accessToken);a.secret && (b.oauth_token_secret = a.secret);b.providerId = a.providerId;return { postBody: Ie(b).toString(), requestUri: \"http://localhost\" };\n  }\n  Wg.prototype.B = function () {\n    var a = { providerId: this.providerId };this.idToken && (a.oauthIdToken = this.idToken);this.accessToken && (a.oauthAccessToken = this.accessToken);this.secret && (a.oauthTokenSecret = this.secret);return a;\n  };function ah(a, b) {\n    this.nc = b || [];gg(this, { providerId: a, isOAuthProvider: !0 });this.qb = {};this.Wa = (Lg(a) || {}).Ma || null;this.Ua = null;\n  }ah.prototype.Ba = function (a) {\n    this.qb = Ua(a);return this;\n  };function P(a) {\n    ah.call(this, a, Jg);this.a = [];\n  }t(P, ah);\n  P.prototype.sa = function (a) {\n    Ha(this.a, a) || this.a.push(a);return this;\n  };P.prototype.vb = function () {\n    return La(this.a);\n  };P.prototype.credential = function (a, b) {\n    if (!a && !b) throw new N(\"argument-error\", \"credential failed: must provide the ID token and/or the access token.\");return new Wg(this.providerId, { idToken: a || null, accessToken: b || null });\n  };function bh() {\n    P.call(this, \"facebook.com\");\n  }t(bh, P);M(bh, \"PROVIDER_ID\", \"facebook.com\");\n  function ch(a) {\n    if (!a) throw new N(\"argument-error\", \"credential failed: expected 1 argument (the OAuth access token).\");var b = a;q(a) && (b = a.accessToken);return new bh().credential(null, b);\n  }function dh() {\n    P.call(this, \"github.com\");\n  }t(dh, P);M(dh, \"PROVIDER_ID\", \"github.com\");function eh(a) {\n    if (!a) throw new N(\"argument-error\", \"credential failed: expected 1 argument (the OAuth access token).\");var b = a;q(a) && (b = a.accessToken);return new dh().credential(null, b);\n  }\n  function fh() {\n    P.call(this, \"google.com\");this.sa(\"profile\");\n  }t(fh, P);M(fh, \"PROVIDER_ID\", \"google.com\");function gh(a, b) {\n    var c = a;q(a) && (c = a.idToken, b = a.accessToken);return new fh().credential(c, b);\n  }function hh() {\n    ah.call(this, \"twitter.com\", Ig);\n  }t(hh, ah);M(hh, \"PROVIDER_ID\", \"twitter.com\");\n  function ih(a, b) {\n    var c = a;q(c) || (c = { oauthToken: a, oauthTokenSecret: b });if (!c.oauthToken || !c.oauthTokenSecret) throw new N(\"argument-error\", \"credential failed: expected 2 arguments (the OAuth access token and secret).\");return new Wg(\"twitter.com\", c);\n  }function jh(a, b) {\n    this.a = a;this.f = b;M(this, \"providerId\", \"password\");\n  }jh.prototype.wa = function (a) {\n    return Q(a, kh, { email: this.a, password: this.f });\n  };jh.prototype.b = function (a, b) {\n    return Q(a, lh, { idToken: b, email: this.a, password: this.f });\n  };\n  jh.prototype.c = function (a, b) {\n    return Vg(this.wa(a), b);\n  };jh.prototype.B = function () {\n    return { email: this.a, password: this.f };\n  };function mh() {\n    gg(this, { providerId: \"password\", isOAuthProvider: !1 });\n  }gg(mh, { PROVIDER_ID: \"password\" });function nh(a) {\n    if (!(a.Pa && a.Oa || a.Da && a.Y)) throw new N(\"internal-error\");this.a = a;M(this, \"providerId\", \"phone\");\n  }nh.prototype.wa = function (a) {\n    return a.Qa(oh(this));\n  };nh.prototype.b = function (a, b) {\n    var c = oh(this);c.idToken = b;return Q(a, ph, c);\n  };\n  nh.prototype.c = function (a, b) {\n    var c = oh(this);c.operation = \"REAUTH\";a = Q(a, qh, c);return Vg(a, b);\n  };nh.prototype.B = function () {\n    var a = { providerId: \"phone\" };this.a.Pa && (a.verificationId = this.a.Pa);this.a.Oa && (a.verificationCode = this.a.Oa);this.a.Da && (a.temporaryProof = this.a.Da);this.a.Y && (a.phoneNumber = this.a.Y);return a;\n  };function oh(a) {\n    return a.a.Da && a.a.Y ? { temporaryProof: a.a.Da, phoneNumber: a.a.Y } : { sessionInfo: a.a.Pa, code: a.a.Oa };\n  }\n  function rh(a) {\n    try {\n      this.a = a || firebase.auth();\n    } catch (b) {\n      throw new N(\"argument-error\", \"Either an instance of firebase.auth.Auth must be passed as an argument to the firebase.auth.PhoneAuthProvider constructor, or the default firebase App instance must be initialized via firebase.initializeApp().\");\n    }gg(this, { providerId: \"phone\", isOAuthProvider: !1 });\n  }\n  rh.prototype.Qa = function (a, b) {\n    var c = this.a.c;return A(b.verify()).then(function (d) {\n      if (!m(d)) throw new N(\"argument-error\", \"An implementation of firebase.auth.ApplicationVerifier.prototype.verify() must return a firebase.Promise that resolves with a string.\");switch (b.type) {case \"recaptcha\":\n          return sh(c, { phoneNumber: a, recaptchaToken: d }).then(function (a) {\n            \"function\" === typeof b.reset && b.reset();return a;\n          }, function (a) {\n            \"function\" === typeof b.reset && b.reset();throw a;\n          });default:\n          throw new N(\"argument-error\", 'Only firebase.auth.ApplicationVerifiers with type=\"recaptcha\" are currently supported.');}\n    });\n  };function th(a, b) {\n    if (!a) throw new N(\"missing-verification-id\");if (!b) throw new N(\"missing-verification-code\");return new nh({ Pa: a, Oa: b });\n  }gg(rh, { PROVIDER_ID: \"phone\" });\n  function uh(a) {\n    if (a.temporaryProof && a.phoneNumber) return new nh({ Da: a.temporaryProof, Y: a.phoneNumber });var b = a && a.providerId;if (!b || \"password\" === b) return null;var c = a && a.oauthAccessToken,\n        d = a && a.oauthTokenSecret;a = a && a.oauthIdToken;try {\n      switch (b) {case \"google.com\":\n          return gh(a, c);case \"facebook.com\":\n          return ch(c);case \"github.com\":\n          return eh(c);case \"twitter.com\":\n          return ih(c, d);default:\n          return new P(b).credential(a, c);}\n    } catch (e) {\n      return null;\n    }\n  }\n  function vh(a) {\n    if (!a.isOAuthProvider) throw new N(\"invalid-oauth-provider\");\n  };function wh(a, b, c, d, e) {\n    this.b = a;this.c = b || null;this.f = c || null;this.g = d || null;this.a = e || null;if (this.f || this.a) {\n      if (this.f && this.a) throw new N(\"invalid-auth-event\");if (this.f && !this.g) throw new N(\"invalid-auth-event\");\n    } else throw new N(\"invalid-auth-event\");\n  }wh.prototype.B = function () {\n    return { type: this.b, eventId: this.c, urlResponse: this.f, sessionId: this.g, error: this.a && this.a.B() };\n  };function xh(a) {\n    a = a || {};return a.type ? new wh(a.type, a.eventId, a.urlResponse, a.sessionId, a.error && vg(a.error)) : null;\n  };function yh(a) {\n    var b = \"unauthorized-domain\",\n        c = void 0,\n        d = De(a);a = d.b;d = d.c;\"chrome-extension\" == d ? c = oa(\"This chrome extension ID (chrome-extension://%s) is not authorized to run this operation. Add it to the OAuth redirect domains list in the Firebase console -> Auth section -> Sign in method tab.\", a) : \"http\" == d || \"https\" == d ? c = oa(\"This domain (%s) is not authorized to run this operation. Add it to the OAuth redirect domains list in the Firebase console -> Auth section -> Sign in method tab.\", a) : b = \"operation-not-supported-in-this-environment\";\n    N.call(this, b, c);\n  }t(yh, N);function zh(a, b, c) {\n    N.call(this, a, c);a = b || {};a.rb && M(this, \"email\", a.rb);a.Y && M(this, \"phoneNumber\", a.Y);a.credential && M(this, \"credential\", a.credential);\n  }t(zh, N);zh.prototype.B = function () {\n    var a = { code: this.code, message: this.message };this.email && (a.email = this.email);this.phoneNumber && (a.phoneNumber = this.phoneNumber);var b = this.credential && this.credential.B();b && Wa(a, b);return a;\n  };zh.prototype.toJSON = function () {\n    return this.B();\n  };\n  function Ah(a) {\n    if (a.code) {\n      var b = a.code || \"\";0 == b.indexOf(tg) && (b = b.substring(tg.length));var c = { credential: uh(a) };if (a.email) c.rb = a.email;else if (a.phoneNumber) c.Y = a.phoneNumber;else return new N(b, a.message || void 0);return new zh(b, c, a.message);\n    }return null;\n  };function Bh(a) {\n    this.f = a;\n  }t(Bh, Ne);Bh.prototype.a = function () {\n    return new this.f();\n  };Bh.prototype.b = function () {\n    return {};\n  };\n  function Ch(a, b, c) {\n    var d = \"Node\" == K();d = k.XMLHttpRequest || d && firebase.INTERNAL.node && firebase.INTERNAL.node.XMLHttpRequest;if (!d) throw new N(\"internal-error\", \"The XMLHttpRequest compatibility library was not found.\");this.b = a;a = b || {};this.i = a.secureTokenEndpoint || \"https://securetoken.googleapis.com/v1/token\";this.l = a.secureTokenTimeout || Dh;this.c = Ua(a.secureTokenHeaders || Eh);this.g = a.firebaseEndpoint || \"https://www.googleapis.com/identitytoolkit/v3/relyingparty/\";this.h = a.firebaseTimeout || Fh;this.a = Ua(a.firebaseHeaders || Gh);c && (this.a[\"X-Client-Version\"] = c, this.c[\"X-Client-Version\"] = c);this.f = new rf();this.o = new Bh(d);\n  }var Hh,\n      _O = \"idToken\",\n      Dh = new $f(3E4, 6E4),\n      Eh = { \"Content-Type\": \"application/x-www-form-urlencoded\" },\n      Fh = new $f(3E4, 6E4),\n      Gh = { \"Content-Type\": \"application/json\" };function Ih(a, b) {\n    b ? a.a[\"X-Firebase-Locale\"] = b : delete a.a[\"X-Firebase-Locale\"];\n  }function Jh(a, b) {\n    b ? (a.a[\"X-Client-Version\"] = b, a.c[\"X-Client-Version\"] = b) : (delete a.a[\"X-Client-Version\"], delete a.c[\"X-Client-Version\"]);\n  }\n  function Kh(a, b, c, d, e, f, g) {\n    Zf() ? (yf() ? a = r(a.m, a) : (Hh || (Hh = new z(function (a, b) {\n      Lh(a, b);\n    })), a = r(a.u, a)), a(b, c, d, e, f, g)) : c && c(null);\n  }\n  Ch.prototype.m = function (a, b, c, d, e, f) {\n    var g = \"Node\" == K(),\n        l = Mf() ? g ? new Se(this.o) : new Se() : new Se(this.f);if (f) {\n      l.f = Math.max(0, f);var n = setTimeout(function () {\n        G(l, \"timeout\");\n      }, f);\n    }fd(l, \"complete\", function () {\n      n && clearTimeout(n);var a = null;try {\n        a = JSON.parse(hf(this)) || null;\n      } catch (vb) {\n        a = null;\n      }b && b(a);\n    });ld(l, \"ready\", function () {\n      n && clearTimeout(n);Lc(this);\n    });ld(l, \"timeout\", function () {\n      n && clearTimeout(n);Lc(this);b && b(null);\n    });Ye(l, a, c, d, e);\n  };\n  var Mh = dc(\"https://apis.google.com/js/client.js?onload=%{onload}\"),\n      Nh = \"__fcb\" + Math.floor(1E6 * Math.random()).toString();function Lh(a, b) {\n    if (((window.gapi || {}).client || {}).request) a();else {\n      k[Nh] = function () {\n        ((window.gapi || {}).client || {}).request ? a() : b(Error(\"CORS_UNSUPPORTED\"));\n      };var c = hc(Mh, { onload: Nh });Td(kf(c), function () {\n        b(Error(\"CORS_UNSUPPORTED\"));\n      });\n    }\n  }\n  Ch.prototype.u = function (a, b, c, d, e) {\n    var f = this;Hh.then(function () {\n      window.gapi.client.setApiKey(f.b);var g = window.gapi.auth.getToken();window.gapi.auth.setToken(null);window.gapi.client.request({ path: a, method: c, body: d, headers: e, authType: \"none\", callback: function callback(a) {\n          window.gapi.auth.setToken(g);b && b(a);\n        } });\n    }).s(function (a) {\n      b && b({ error: { message: a && a.message || \"CORS_UNSUPPORTED\" } });\n    });\n  };\n  function Oh(a, b) {\n    return new z(function (c, d) {\n      \"refresh_token\" == b.grant_type && b.refresh_token || \"authorization_code\" == b.grant_type && b.code ? Kh(a, a.i + \"?key=\" + encodeURIComponent(a.b), function (a) {\n        a ? a.error ? d(Ph(a)) : a.access_token && a.refresh_token ? c(a) : d(new N(\"internal-error\")) : d(new N(\"network-request-failed\"));\n      }, \"POST\", Ie(b).toString(), a.c, a.l.get()) : d(new N(\"internal-error\"));\n    });\n  }\n  function Qh(a, b, c, d, e, f) {\n    var g = De(a.g + b);I(g, \"key\", a.b);f && I(g, \"cb\", na().toString());var l = \"GET\" == c;if (l) for (var n in d) {\n      d.hasOwnProperty(n) && I(g, n, d[n]);\n    }return new z(function (b, f) {\n      Kh(a, g.toString(), function (a) {\n        a ? a.error ? f(Ph(a, e || {})) : b(a) : f(new N(\"network-request-failed\"));\n      }, c, l ? void 0 : Cc(Vf(d)), a.a, a.h.get());\n    });\n  }function Rh(a) {\n    if (!jf.test(a.email)) throw new N(\"invalid-email\");\n  }function Sh(a) {\n    \"email\" in a && Rh(a);\n  }\n  function Th(a, b) {\n    return Q(a, Uh, { identifier: b, continueUri: Sf() ? vf() : \"http://localhost\" }).then(function (a) {\n      return a.allProviders || [];\n    });\n  }function Vh(a) {\n    return Q(a, Wh, {}).then(function (a) {\n      return a.authorizedDomains || [];\n    });\n  }function Xh(a) {\n    if (!a[_O]) throw new N(\"internal-error\");\n  }\n  function Yh(a) {\n    if (a.phoneNumber || a.temporaryProof) {\n      if (!a.phoneNumber || !a.temporaryProof) throw new N(\"internal-error\");\n    } else {\n      if (!a.sessionInfo) throw new N(\"missing-verification-id\");if (!a.code) throw new N(\"missing-verification-code\");\n    }\n  }Ch.prototype.gb = function () {\n    return Q(this, Zh, {});\n  };Ch.prototype.kb = function (a, b) {\n    return Q(this, $h, { idToken: a, email: b });\n  };Ch.prototype.lb = function (a, b) {\n    return Q(this, lh, { idToken: a, password: b });\n  };var ai = { displayName: \"DISPLAY_NAME\", photoUrl: \"PHOTO_URL\" };h = Ch.prototype;\n  h.mb = function (a, b) {\n    var c = { idToken: a },\n        d = [];Pa(ai, function (a, f) {\n      var e = b[f];null === e ? d.push(a) : f in b && (c[f] = e);\n    });d.length && (c.deleteAttribute = d);return Q(this, $h, c);\n  };h.cb = function (a, b) {\n    a = { requestType: \"PASSWORD_RESET\", email: a };Wa(a, b);return Q(this, bi, a);\n  };h.bb = function (a, b) {\n    a = { requestType: \"VERIFY_EMAIL\", idToken: a };Wa(a, b);return Q(this, ci, a);\n  };function sh(a, b) {\n    return Q(a, di, b);\n  }h.Qa = function (a) {\n    return Q(this, ei, a);\n  };function fi(a, b, c) {\n    return Q(a, gi, { idToken: b, deleteProvider: c });\n  }\n  function hi(a) {\n    if (!a.requestUri || !a.sessionId && !a.postBody) throw new N(\"internal-error\");\n  }function ii(a) {\n    var b = null;a.needConfirmation ? (a.code = \"account-exists-with-different-credential\", b = Ah(a)) : \"FEDERATED_USER_ID_ALREADY_LINKED\" == a.errorMessage ? (a.code = \"credential-already-in-use\", b = Ah(a)) : \"EMAIL_EXISTS\" == a.errorMessage ? (a.code = \"email-already-in-use\", b = Ah(a)) : a.errorMessage && (b = ji(a.errorMessage));if (b) throw b;if (!a[_O]) throw new N(\"internal-error\");\n  }\n  function Xg(a, b) {\n    b.returnIdpCredential = !0;return Q(a, ki, b);\n  }function Zg(a, b) {\n    b.returnIdpCredential = !0;return Q(a, li, b);\n  }function $g(a, b) {\n    b.returnIdpCredential = !0;b.autoCreate = !1;return Q(a, mi, b);\n  }function ni(a) {\n    if (!a.oobCode) throw new N(\"invalid-action-code\");\n  }h.Ta = function (a, b) {\n    return Q(this, oi, { oobCode: a, newPassword: b });\n  };h.Ia = function (a) {\n    return Q(this, pi, { oobCode: a });\n  };h.Sa = function (a) {\n    return Q(this, qi, { oobCode: a });\n  };\n  var qi = { endpoint: \"setAccountInfo\", D: ni, ga: \"email\" },\n      pi = { endpoint: \"resetPassword\", D: ni, O: function O(a) {\n      if (!a.email || !a.requestType) throw new N(\"internal-error\");\n    } },\n      ri = { endpoint: \"signupNewUser\", D: function D(a) {\n      Rh(a);if (!a.password) throw new N(\"weak-password\");\n    }, O: Xh, T: !0 },\n      Uh = { endpoint: \"createAuthUri\" },\n      si = { endpoint: \"deleteAccount\", ea: [\"idToken\"] },\n      gi = { endpoint: \"setAccountInfo\", ea: [\"idToken\", \"deleteProvider\"], D: function D(a) {\n      if (!fa(a.deleteProvider)) throw new N(\"internal-error\");\n    } },\n      ti = { endpoint: \"getAccountInfo\" },\n      ci = { endpoint: \"getOobConfirmationCode\", ea: [\"idToken\", \"requestType\"], D: function D(a) {\n      if (\"VERIFY_EMAIL\" != a.requestType) throw new N(\"internal-error\");\n    }, ga: \"email\" },\n      bi = { endpoint: \"getOobConfirmationCode\", ea: [\"requestType\"], D: function D(a) {\n      if (\"PASSWORD_RESET\" != a.requestType) throw new N(\"internal-error\");Rh(a);\n    }, ga: \"email\" },\n      Wh = { nb: !0, endpoint: \"getProjectConfig\", yb: \"GET\" },\n      ui = { nb: !0, endpoint: \"getRecaptchaParam\", yb: \"GET\", O: function O(a) {\n      if (!a.recaptchaSiteKey) throw new N(\"internal-error\");\n    } },\n      oi = { endpoint: \"resetPassword\",\n    D: ni, ga: \"email\" },\n      di = { endpoint: \"sendVerificationCode\", ea: [\"phoneNumber\", \"recaptchaToken\"], ga: \"sessionInfo\" },\n      $h = { endpoint: \"setAccountInfo\", ea: [\"idToken\"], D: Sh, T: !0 },\n      lh = { endpoint: \"setAccountInfo\", ea: [\"idToken\"], D: function D(a) {\n      Sh(a);if (!a.password) throw new N(\"weak-password\");\n    }, O: Xh, T: !0 },\n      Zh = { endpoint: \"signupNewUser\", O: Xh, T: !0 },\n      ki = { endpoint: \"verifyAssertion\", D: hi, O: ii, T: !0 },\n      mi = { endpoint: \"verifyAssertion\", D: hi, O: function O(a) {\n      if (a.errorMessage && \"USER_NOT_FOUND\" == a.errorMessage) throw new N(\"user-not-found\");\n      if (a.errorMessage) throw ji(a.errorMessage);if (!a[_O]) throw new N(\"internal-error\");\n    }, T: !0 },\n      li = { endpoint: \"verifyAssertion\", D: function D(a) {\n      hi(a);if (!a.idToken) throw new N(\"internal-error\");\n    }, O: ii, T: !0 },\n      vi = { endpoint: \"verifyCustomToken\", D: function D(a) {\n      if (!a.token) throw new N(\"invalid-custom-token\");\n    }, O: Xh, T: !0 },\n      kh = { endpoint: \"verifyPassword\", D: function D(a) {\n      Rh(a);if (!a.password) throw new N(\"wrong-password\");\n    }, O: Xh, T: !0 },\n      ei = { endpoint: \"verifyPhoneNumber\", D: Yh, O: Xh },\n      ph = { endpoint: \"verifyPhoneNumber\", D: function D(a) {\n      if (!a.idToken) throw new N(\"internal-error\");\n      Yh(a);\n    }, O: function O(a) {\n      if (a.temporaryProof) throw a.code = \"credential-already-in-use\", Ah(a);Xh(a);\n    } },\n      qh = { Lb: { USER_NOT_FOUND: \"user-not-found\" }, endpoint: \"verifyPhoneNumber\", D: Yh, O: Xh };\n  function Q(a, b, c) {\n    if (!jg(c, b.ea)) return B(new N(\"internal-error\"));var d = b.yb || \"POST\",\n        e;return A(c).then(b.D).then(function () {\n      b.T && (c.returnSecureToken = !0);return Qh(a, b.endpoint, d, c, b.Lb, b.nb || !1);\n    }).then(function (a) {\n      return e = a;\n    }).then(b.O).then(function () {\n      if (!b.ga) return e;if (!(b.ga in e)) throw new N(\"internal-error\");return e[b.ga];\n    });\n  }function ji(a) {\n    return Ph({ error: { errors: [{ message: a }], code: 400, message: a } });\n  }\n  function Ph(a, b) {\n    var c = (a.error && a.error.errors && a.error.errors[0] || {}).reason || \"\";var d = { keyInvalid: \"invalid-api-key\", ipRefererBlocked: \"app-not-authorized\" };if (c = d[c] ? new N(d[c]) : null) return c;c = a.error && a.error.message || \"\";d = { INVALID_CUSTOM_TOKEN: \"invalid-custom-token\", CREDENTIAL_MISMATCH: \"custom-token-mismatch\", MISSING_CUSTOM_TOKEN: \"internal-error\", INVALID_IDENTIFIER: \"invalid-email\", MISSING_CONTINUE_URI: \"internal-error\", INVALID_EMAIL: \"invalid-email\", INVALID_PASSWORD: \"wrong-password\", USER_DISABLED: \"user-disabled\",\n      MISSING_PASSWORD: \"internal-error\", EMAIL_EXISTS: \"email-already-in-use\", PASSWORD_LOGIN_DISABLED: \"operation-not-allowed\", INVALID_IDP_RESPONSE: \"invalid-credential\", FEDERATED_USER_ID_ALREADY_LINKED: \"credential-already-in-use\", INVALID_MESSAGE_PAYLOAD: \"invalid-message-payload\", INVALID_RECIPIENT_EMAIL: \"invalid-recipient-email\", INVALID_SENDER: \"invalid-sender\", EMAIL_NOT_FOUND: \"user-not-found\", EXPIRED_OOB_CODE: \"expired-action-code\", INVALID_OOB_CODE: \"invalid-action-code\", MISSING_OOB_CODE: \"internal-error\", CREDENTIAL_TOO_OLD_LOGIN_AGAIN: \"requires-recent-login\",\n      INVALID_ID_TOKEN: \"invalid-user-token\", TOKEN_EXPIRED: \"user-token-expired\", USER_NOT_FOUND: \"user-token-expired\", CORS_UNSUPPORTED: \"cors-unsupported\", DYNAMIC_LINK_NOT_ACTIVATED: \"dynamic-link-not-activated\", INVALID_APP_ID: \"invalid-app-id\", TOO_MANY_ATTEMPTS_TRY_LATER: \"too-many-requests\", WEAK_PASSWORD: \"weak-password\", OPERATION_NOT_ALLOWED: \"operation-not-allowed\", USER_CANCELLED: \"user-cancelled\", CAPTCHA_CHECK_FAILED: \"captcha-check-failed\", INVALID_APP_CREDENTIAL: \"invalid-app-credential\", INVALID_CODE: \"invalid-verification-code\",\n      INVALID_PHONE_NUMBER: \"invalid-phone-number\", INVALID_SESSION_INFO: \"invalid-verification-id\", INVALID_TEMPORARY_PROOF: \"invalid-credential\", MISSING_APP_CREDENTIAL: \"missing-app-credential\", MISSING_CODE: \"missing-verification-code\", MISSING_PHONE_NUMBER: \"missing-phone-number\", MISSING_SESSION_INFO: \"missing-verification-id\", QUOTA_EXCEEDED: \"quota-exceeded\", SESSION_EXPIRED: \"code-expired\", INVALID_CONTINUE_URI: \"invalid-continue-uri\", MISSING_ANDROID_PACKAGE_NAME: \"missing-android-pkg-name\", MISSING_IOS_BUNDLE_ID: \"missing-ios-bundle-id\",\n      UNAUTHORIZED_DOMAIN: \"unauthorized-continue-uri\", INVALID_OAUTH_CLIENT_ID: \"invalid-oauth-client-id\", INVALID_CERT_HASH: \"invalid-cert-hash\" };Wa(d, b || {});b = (b = c.match(/^[^\\s]+\\s*:\\s*(.*)$/)) && 1 < b.length ? b[1] : void 0;for (var e in d) {\n      if (0 === c.indexOf(e)) return new N(d[e], b);\n    }!b && a && (b = Uf(a));return new N(\"internal-error\", b);\n  };var wi = { Ic: { Va: \"https://www.googleapis.com/identitytoolkit/v3/relyingparty/\", ab: \"https://securetoken.googleapis.com/v1/token\", id: \"p\" }, Kc: { Va: \"https://staging-www.sandbox.googleapis.com/identitytoolkit/v3/relyingparty/\", ab: \"https://staging-securetoken.sandbox.googleapis.com/v1/token\", id: \"s\" }, Lc: { Va: \"https://www-googleapis-test.sandbox.google.com/identitytoolkit/v3/relyingparty/\", ab: \"https://test-securetoken.sandbox.googleapis.com/v1/token\", id: \"t\" } };\n  function xi(a) {\n    for (var b in wi) {\n      if (wi[b].id === a) return a = wi[b], { firebaseEndpoint: a.Va, secureTokenEndpoint: a.ab };\n    }return null;\n  }var yi;yi = xi(\"__EID__\") ? \"__EID__\" : void 0;function zi(a) {\n    this.b = a;this.a = null;this.Ya = Ai(this);\n  }\n  function Ai(a) {\n    return Bi().then(function () {\n      return new z(function (b, c) {\n        L(\"gapi.iframes.getContext\")().open({ where: document.body, url: a.b, messageHandlersFilter: L(\"gapi.iframes.CROSS_ORIGIN_IFRAMES_FILTER\"), attributes: { style: { position: \"absolute\", top: \"-100px\", width: \"1px\", height: \"1px\" } }, dontclear: !0 }, function (d) {\n          function e() {\n            clearTimeout(f);b();\n          }a.a = d;a.a.restyle({ setHideOnLeave: !1 });var f = setTimeout(function () {\n            c(Error(\"Network Error\"));\n          }, Ci.get());d.ping(e).then(e, function () {\n            c(Error(\"Network Error\"));\n          });\n        });\n      });\n    });\n  }\n  function Di(a, b) {\n    return a.Ya.then(function () {\n      return new z(function (c) {\n        a.a.send(b.type, b, c, L(\"gapi.iframes.CROSS_ORIGIN_IFRAMES_FILTER\"));\n      });\n    });\n  }function Ei(a, b) {\n    a.Ya.then(function () {\n      a.a.register(\"authEvent\", b, L(\"gapi.iframes.CROSS_ORIGIN_IFRAMES_FILTER\"));\n    });\n  }var Fi = dc(\"https://apis.google.com/js/api.js?onload=%{onload}\"),\n      Gi = new $f(3E4, 6E4),\n      Ci = new $f(5E3, 15E3),\n      Hi = null;\n  function Bi() {\n    return Hi ? Hi : Hi = new z(function (a, b) {\n      if (Zf()) {\n        var c = function c() {\n          Yf();L(\"gapi.load\")(\"gapi.iframes\", { callback: a, ontimeout: function ontimeout() {\n              Yf();b(Error(\"Network Error\"));\n            }, timeout: Gi.get() });\n        };if (L(\"gapi.iframes.Iframe\")) a();else if (L(\"gapi.load\")) c();else {\n          var d = \"__iframefcb\" + Math.floor(1E6 * Math.random()).toString();k[d] = function () {\n            L(\"gapi.load\") ? c() : b(Error(\"Network Error\"));\n          };d = hc(Fi, { onload: d });A(kf(d)).s(function () {\n            b(Error(\"Network Error\"));\n          });\n        }\n      } else b(Error(\"Network Error\"));\n    }).s(function (a) {\n      Hi = null;throw a;\n    });\n  };function Ii(a, b, c) {\n    this.i = a;this.g = b;this.h = c;this.f = null;this.a = Ee(this.i, \"/__/auth/iframe\");I(this.a, \"apiKey\", this.g);I(this.a, \"appName\", this.h);this.b = null;this.c = [];\n  }Ii.prototype.toString = function () {\n    this.f ? I(this.a, \"v\", this.f) : Le(this.a.a, \"v\");this.b ? I(this.a, \"eid\", this.b) : Le(this.a.a, \"eid\");this.c.length ? I(this.a, \"fw\", this.c.join(\",\")) : Le(this.a.a, \"fw\");return this.a.toString();\n  };function Ji(a, b, c, d, e) {\n    this.m = a;this.u = b;this.c = c;this.l = d;this.i = this.g = this.h = null;this.a = e;this.f = null;\n  }\n  Ji.prototype.toString = function () {\n    var a = Ee(this.m, \"/__/auth/handler\");I(a, \"apiKey\", this.u);I(a, \"appName\", this.c);I(a, \"authType\", this.l);if (this.a.isOAuthProvider) {\n      var b = this.a;try {\n        var c = firebase.app(this.c).auth().$();\n      } catch (l) {\n        c = null;\n      }b.Ua = c;I(a, \"providerId\", this.a.providerId);b = this.a;c = Vf(b.qb);for (var d in c) {\n        c[d] = c[d].toString();\n      }d = b.nc;c = Ua(c);for (var e = 0; e < d.length; e++) {\n        var f = d[e];f in c && delete c[f];\n      }b.Wa && b.Ua && !c[b.Wa] && (c[b.Wa] = b.Ua);Sa(c) || I(a, \"customParameters\", Uf(c));\n    }\"function\" === typeof this.a.vb && (b = this.a.vb(), b.length && I(a, \"scopes\", b.join(\",\")));this.h ? I(a, \"redirectUrl\", this.h) : Le(a.a, \"redirectUrl\");this.g ? I(a, \"eventId\", this.g) : Le(a.a, \"eventId\");this.i ? I(a, \"v\", this.i) : Le(a.a, \"v\");if (this.b) for (var g in this.b) {\n      this.b.hasOwnProperty(g) && !Ce(a, g) && I(a, g, this.b[g]);\n    }this.f ? I(a, \"eid\", this.f) : Le(a.a, \"eid\");g = Ki(this.c);g.length && I(a, \"fw\", g.join(\",\"));return a.toString();\n  };function Ki(a) {\n    try {\n      return firebase.app(a).auth().Ka();\n    } catch (b) {\n      return [];\n    }\n  }\n  function Li(a, b, c, d, e) {\n    this.u = a;this.f = b;this.b = c;this.c = d || null;this.h = e || null;this.m = this.o = this.v = null;this.g = [];this.l = this.a = null;\n  }\n  function Mi(a) {\n    var b = vf();return Vh(a).then(function (a) {\n      a: {\n        var c = De(b),\n            e = c.c;c = c.b;for (var f = 0; f < a.length; f++) {\n          var g = a[f];var l = c;var n = e;0 == g.indexOf(\"chrome-extension://\") ? l = De(g).b == l && \"chrome-extension\" == n : \"http\" != n && \"https\" != n ? l = !1 : Gf.test(g) ? l = l == g : (g = g.split(\".\").join(\"\\\\.\"), l = new RegExp(\"^(.+\\\\.\" + g + \"|\" + g + \")$\", \"i\").test(l));if (l) {\n            a = !0;break a;\n          }\n        }a = !1;\n      }if (!a) throw new yh(vf());\n    });\n  }\n  function Ni(a) {\n    if (a.l) return a.l;a.l = Hf().then(function () {\n      if (!a.o) {\n        var b = a.c,\n            c = a.h,\n            d = Ki(a.b),\n            e = new Ii(a.u, a.f, a.b);e.f = b;e.b = c;e.c = La(d || []);a.o = e.toString();\n      }a.i = new zi(a.o);Oi(a);\n    });return a.l;\n  }h = Li.prototype;h.Ca = function (a, b, c) {\n    var d = new N(\"popup-closed-by-user\"),\n        e = new N(\"web-storage-unsupported\"),\n        f = this,\n        g = !1;return this.ba().then(function () {\n      Pi(f).then(function (c) {\n        c || (a && Cf(a), b(e), g = !0);\n      });\n    }).s(function () {}).then(function () {\n      if (!g) return Ff(a);\n    }).then(function () {\n      if (!g) return sd(c).then(function () {\n        b(d);\n      });\n    });\n  };\n  h.Cb = function () {\n    var a = J();return !Tf(a) && !Xf(a);\n  };h.xb = function () {\n    return !1;\n  };\n  h.ub = function (a, b, c, d, e, f, g) {\n    if (!a) return B(new N(\"popup-blocked\"));if (g && !Tf()) return this.ba().s(function (b) {\n      Cf(a);e(b);\n    }), d(), A();this.a || (this.a = Mi(Qi(this)));var l = this;return this.a.then(function () {\n      var b = l.ba().s(function (b) {\n        Cf(a);e(b);throw b;\n      });d();return b;\n    }).then(function () {\n      vh(c);if (!g) {\n        var d = Ri(l.u, l.f, l.b, b, c, null, f, l.c, void 0, l.h);wf(d, a);\n      }\n    }).s(function (a) {\n      \"auth/network-request-failed\" == a.code && (l.a = null);throw a;\n    });\n  };\n  function Qi(a) {\n    a.m || (a.v = a.c ? Of(a.c, Ki(a.b)) : null, a.m = new Ch(a.f, xi(a.h), a.v));return a.m;\n  }h.Aa = function (a, b, c) {\n    this.a || (this.a = Mi(Qi(this)));var d = this;return this.a.then(function () {\n      vh(b);var e = Ri(d.u, d.f, d.b, a, b, vf(), c, d.c, void 0, d.h);wf(e);\n    }).s(function (a) {\n      \"auth/network-request-failed\" == a.code && (d.a = null);throw a;\n    });\n  };h.ba = function () {\n    var a = this;return Ni(this).then(function () {\n      return a.i.Ya;\n    }).s(function () {\n      a.a = null;throw new N(\"network-request-failed\");\n    });\n  };h.Db = function () {\n    return !0;\n  };\n  function Ri(a, b, c, d, e, f, g, l, n, D) {\n    a = new Ji(a, b, c, d, e);a.h = f;a.g = g;a.i = l;a.b = Ua(n || null);a.f = D;return a.toString();\n  }function Oi(a) {\n    if (!a.i) throw Error(\"IfcHandler must be initialized!\");Ei(a.i, function (b) {\n      var c = {};if (b && b.authEvent) {\n        var d = !1;b = xh(b.authEvent);for (c = 0; c < a.g.length; c++) {\n          d = a.g[c](b) || d;\n        }c = {};c.status = d ? \"ACK\" : \"ERROR\";return A(c);\n      }c.status = \"ERROR\";return A(c);\n    });\n  }\n  function Pi(a) {\n    var b = { type: \"webStorageSupport\" };return Ni(a).then(function () {\n      return Di(a.i, b);\n    }).then(function (a) {\n      if (a && a.length && \"undefined\" !== typeof a[0].webStorageSupport) return a[0].webStorageSupport;throw Error();\n    });\n  }h.ua = function (a) {\n    this.g.push(a);\n  };h.Ja = function (a) {\n    Ja(this.g, function (b) {\n      return b == a;\n    });\n  };function Si(a) {\n    this.a = a || firebase.INTERNAL.reactNative && firebase.INTERNAL.reactNative.AsyncStorage;if (!this.a) throw new N(\"internal-error\", \"The React Native compatibility library was not found.\");\n  }h = Si.prototype;h.get = function (a) {\n    return A(this.a.getItem(a)).then(function (a) {\n      return a && Wf(a);\n    });\n  };h.set = function (a, b) {\n    return A(this.a.setItem(a, Uf(b)));\n  };h.X = function (a) {\n    return A(this.a.removeItem(a));\n  };h.ia = function () {};h.da = function () {};function Ti() {\n    this.a = {};\n  }h = Ti.prototype;h.get = function (a) {\n    return A(this.a[a]);\n  };h.set = function (a, b) {\n    this.a[a] = b;return A();\n  };h.X = function (a) {\n    delete this.a[a];return A();\n  };h.ia = function () {};h.da = function () {};function Ui(a, b, c, d, e, f) {\n    try {\n      var g = !!k.indexedDB;\n    } catch (l) {\n      g = !1;\n    }if (!g) throw new N(\"web-storage-unsupported\");this.u = a;this.h = b;this.g = c;this.l = d;this.m = e;this.f = {};this.c = [];this.a = 0;this.o = f || k.indexedDB;\n  }var Vi;function Wi(a) {\n    return new z(function (b, c) {\n      var d = a.o.open(a.u, a.m);d.onerror = function (a) {\n        c(Error(a.target.errorCode));\n      };d.onupgradeneeded = function (b) {\n        b = b.target.result;try {\n          b.createObjectStore(a.h, { keyPath: a.g });\n        } catch (f) {\n          c(f);\n        }\n      };d.onsuccess = function (a) {\n        b(a.target.result);\n      };\n    });\n  }\n  function Xi(a) {\n    a.i || (a.i = Wi(a));return a.i;\n  }function Yi(a, b) {\n    return b.objectStore(a.h);\n  }function Zi(a, b, c) {\n    return b.transaction([a.h], c ? \"readwrite\" : \"readonly\");\n  }function $i(a) {\n    return new z(function (b, c) {\n      a.onsuccess = function (a) {\n        a && a.target ? b(a.target.result) : b();\n      };a.onerror = function (a) {\n        c(Error(a.target.errorCode));\n      };\n    });\n  }h = Ui.prototype;\n  h.set = function (a, b) {\n    var c = !1,\n        d,\n        e = this;return Qb(Xi(this).then(function (b) {\n      d = b;b = Yi(e, Zi(e, d, !0));return $i(b.get(a));\n    }).then(function (f) {\n      var g = Yi(e, Zi(e, d, !0));if (f) return f.value = b, $i(g.put(f));e.a++;c = !0;f = {};f[e.g] = a;f[e.l] = b;return $i(g.add(f));\n    }).then(function () {\n      e.f[a] = b;\n    }), function () {\n      c && e.a--;\n    });\n  };h.get = function (a) {\n    var b = this;return Xi(this).then(function (c) {\n      return $i(Yi(b, Zi(b, c, !1)).get(a));\n    }).then(function (a) {\n      return a && a.value;\n    });\n  };\n  h.X = function (a) {\n    var b = !1,\n        c = this;return Qb(Xi(this).then(function (d) {\n      b = !0;c.a++;return $i(Yi(c, Zi(c, d, !0))[\"delete\"](a));\n    }).then(function () {\n      delete c.f[a];\n    }), function () {\n      b && c.a--;\n    });\n  };\n  h.vc = function () {\n    var a = this;return Xi(this).then(function (b) {\n      var c = Yi(a, Zi(a, b, !1));return c.getAll ? $i(c.getAll()) : new z(function (a, b) {\n        var d = [],\n            e = c.openCursor();e.onsuccess = function (b) {\n          (b = b.target.result) ? (d.push(b.value), b[\"continue\"]()) : a(d);\n        };e.onerror = function (a) {\n          b(Error(a.target.errorCode));\n        };\n      });\n    }).then(function (b) {\n      var c = {},\n          d = [];if (0 == a.a) {\n        for (d = 0; d < b.length; d++) {\n          c[b[d][a.g]] = b[d][a.l];\n        }d = xf(a.f, c);a.f = c;\n      }return d;\n    });\n  };h.ia = function (a) {\n    0 == this.c.length && aj(this);this.c.push(a);\n  };\n  h.da = function (a) {\n    Ja(this.c, function (b) {\n      return b == a;\n    });0 == this.c.length && this.b && this.b.cancel(\"STOP_EVENT\");\n  };function aj(a) {\n    function b() {\n      a.b = sd(800).then(r(a.vc, a)).then(function (b) {\n        0 < b.length && w(a.c, function (a) {\n          a(b);\n        });\n      }).then(b).s(function (a) {\n        \"STOP_EVENT\" != a.message && b();\n      });return a.b;\n    }a.b && a.b.cancel(\"STOP_EVENT\");b();\n  };function bj() {\n    if (!cj()) {\n      if (\"Node\" == K()) throw new N(\"internal-error\", \"The LocalStorage compatibility library was not found.\");throw new N(\"web-storage-unsupported\");\n    }this.a = dj() || firebase.INTERNAL.node.localStorage;\n  }function dj() {\n    try {\n      var a = k.localStorage,\n          b = Qf();a && (a.setItem(b, \"1\"), a.removeItem(b));return a;\n    } catch (c) {\n      return null;\n    }\n  }\n  function cj() {\n    var a = \"Node\" == K();a = dj() || a && firebase.INTERNAL.node && firebase.INTERNAL.node.localStorage;if (!a) return !1;try {\n      return a.setItem(\"__sak\", \"1\"), a.removeItem(\"__sak\"), !0;\n    } catch (b) {\n      return !1;\n    }\n  }h = bj.prototype;h.get = function (a) {\n    var b = this;return A().then(function () {\n      var c = b.a.getItem(a);return Wf(c);\n    });\n  };h.set = function (a, b) {\n    var c = this;return A().then(function () {\n      var d = Uf(b);null === d ? c.X(a) : c.a.setItem(a, d);\n    });\n  };h.X = function (a) {\n    var b = this;return A().then(function () {\n      b.a.removeItem(a);\n    });\n  };\n  h.ia = function (a) {\n    k.window && cd(k.window, \"storage\", a);\n  };h.da = function (a) {\n    k.window && E(k.window, \"storage\", a);\n  };function ej() {}h = ej.prototype;h.get = function () {\n    return A(null);\n  };h.set = function () {\n    return A();\n  };h.X = function () {\n    return A();\n  };h.ia = function () {};h.da = function () {};function fj() {\n    if (!gj()) {\n      if (\"Node\" == K()) throw new N(\"internal-error\", \"The SessionStorage compatibility library was not found.\");throw new N(\"web-storage-unsupported\");\n    }this.a = hj() || firebase.INTERNAL.node.sessionStorage;\n  }function hj() {\n    try {\n      var a = k.sessionStorage,\n          b = Qf();a && (a.setItem(b, \"1\"), a.removeItem(b));return a;\n    } catch (c) {\n      return null;\n    }\n  }\n  function gj() {\n    var a = \"Node\" == K();a = hj() || a && firebase.INTERNAL.node && firebase.INTERNAL.node.sessionStorage;if (!a) return !1;try {\n      return a.setItem(\"__sak\", \"1\"), a.removeItem(\"__sak\"), !0;\n    } catch (b) {\n      return !1;\n    }\n  }h = fj.prototype;h.get = function (a) {\n    var b = this;return A().then(function () {\n      var c = b.a.getItem(a);return Wf(c);\n    });\n  };h.set = function (a, b) {\n    var c = this;return A().then(function () {\n      var d = Uf(b);null === d ? c.X(a) : c.a.setItem(a, d);\n    });\n  };h.X = function (a) {\n    var b = this;return A().then(function () {\n      b.a.removeItem(a);\n    });\n  };h.ia = function () {};\n  h.da = function () {};function ij() {\n    var a = {};a.Browser = jj;a.Node = kj;a.ReactNative = lj;this.a = a[K()];\n  }var mj,\n      jj = { C: bj, jb: fj },\n      kj = { C: bj, jb: fj },\n      lj = { C: Si, jb: ej };var nj = { Hc: \"local\", NONE: \"none\", Jc: \"session\" };function oj(a) {\n    var b = new N(\"invalid-persistence-type\"),\n        c = new N(\"unsupported-persistence-type\");a: {\n      for (d in nj) {\n        if (nj[d] == a) {\n          var d = !0;break a;\n        }\n      }d = !1;\n    }if (!d || \"string\" !== typeof a) throw b;switch (K()) {case \"ReactNative\":\n        if (\"session\" === a) throw c;break;case \"Node\":\n        if (\"none\" !== a) throw c;break;default:\n        if (!Pf() && \"none\" !== a) throw c;}\n  }\n  function pj(a, b, c, d, e) {\n    this.i = a;this.g = b;this.A = c;this.u = d;this.v = e;this.a = {};mj || (mj = new ij());a = mj;try {\n      if (uf()) {\n        Vi || (Vi = new Ui(\"firebaseLocalStorageDb\", \"firebaseLocalStorage\", \"fbase_key\", \"value\", 1));var f = Vi;\n      } else f = new a.a.C();this.l = f;\n    } catch (g) {\n      this.l = new Ti(), this.u = !0;\n    }try {\n      this.o = new a.a.jb();\n    } catch (g) {\n      this.o = new Ti();\n    }this.w = new Ti();this.h = r(this.m, this);this.b = {};\n  }var qj;function rj() {\n    qj || (qj = new pj(\"firebase\", \":\", !Xf(J()) && Lf() ? !0 : !1, Tf(), Pf()));return qj;\n  }\n  function sj(a, b) {\n    switch (b) {case \"session\":\n        return a.o;case \"none\":\n        return a.w;default:\n        return a.l;}\n  }function tj(a, b, c) {\n    return a.i + a.g + b.name + (c ? a.g + c : \"\");\n  }pj.prototype.get = function (a, b) {\n    return sj(this, a.C).get(tj(this, a, b));\n  };function uj(a, b, c) {\n    c = tj(a, b, c);\"local\" == b.C && (a.b[c] = null);return sj(a, b.C).X(c);\n  }pj.prototype.set = function (a, b, c) {\n    var d = tj(this, a, c),\n        e = this,\n        f = sj(this, a.C);return f.set(d, b).then(function () {\n      return f.get(d);\n    }).then(function (b) {\n      \"local\" == a.C && (e.b[d] = b);\n    });\n  };\n  function vj(a, b, c, d) {\n    b = tj(a, b, c);a.v && (a.b[b] = k.localStorage.getItem(b));Sa(a.a) && (sj(a, \"local\").ia(a.h), a.u || uf() || !a.v || wj(a));a.a[b] || (a.a[b] = []);a.a[b].push(d);\n  }function xj(a, b, c) {\n    b = tj(a, yj(\"local\"), b);a.a[b] && (Ja(a.a[b], function (a) {\n      return a == c;\n    }), 0 == a.a[b].length && delete a.a[b]);Sa(a.a) && zj(a);\n  }\n  function wj(a) {\n    Aj(a);a.f = setInterval(function () {\n      for (var b in a.a) {\n        var c = k.localStorage.getItem(b),\n            d = a.b[b];c != d && (a.b[b] = c, c = new Qc({ type: \"storage\", key: b, target: window, oldValue: d, newValue: c, a: !0 }), a.m(c));\n      }\n    }, 1E3);\n  }function Aj(a) {\n    a.f && (clearInterval(a.f), a.f = null);\n  }function zj(a) {\n    sj(a, \"local\").da(a.h);Aj(a);\n  }\n  pj.prototype.m = function (a) {\n    if (a && a.g) {\n      var b = a.a.key;if (null == b) for (var c in this.a) {\n        var d = this.b[c];\"undefined\" === typeof d && (d = null);var e = k.localStorage.getItem(c);e !== d && (this.b[c] = e, this.c(c));\n      } else if (0 == b.indexOf(this.i + this.g) && this.a[b]) {\n        \"undefined\" !== typeof a.a.a ? sj(this, \"local\").da(this.h) : Aj(this);if (this.A) if (c = k.localStorage.getItem(b), d = a.a.newValue, d !== c) null !== d ? k.localStorage.setItem(b, d) : k.localStorage.removeItem(b);else if (this.b[b] === d && \"undefined\" === typeof a.a.a) return;var f = this;\n        c = function c() {\n          if (\"undefined\" !== typeof a.a.a || f.b[b] !== k.localStorage.getItem(b)) f.b[b] = k.localStorage.getItem(b), f.c(b);\n        };y && kb && 10 == kb && k.localStorage.getItem(b) !== a.a.newValue && a.a.newValue !== a.a.oldValue ? setTimeout(c, 10) : c();\n      }\n    } else w(a, r(this.c, this));\n  };pj.prototype.c = function (a) {\n    this.a[a] && w(this.a[a], function (a) {\n      a();\n    });\n  };function Cj(a) {\n    this.a = a;this.b = rj();\n  }var Dj = { name: \"authEvent\", C: \"local\" };function Ej(a) {\n    return a.b.get(Dj, a.a).then(function (a) {\n      return xh(a);\n    });\n  };function Fj() {\n    this.a = rj();\n  };function Gj(a, b, c, d, e, f, g) {\n    this.u = a;this.i = b;this.l = c;this.m = d || null;this.o = g || null;this.h = b + \":\" + c;this.A = new Fj();this.g = new Cj(this.h);this.f = null;this.b = [];this.v = e || 500;this.w = f || 2E3;this.a = this.c = null;\n  }function Hj(a) {\n    return new N(\"invalid-cordova-configuration\", a);\n  }h = Gj.prototype;\n  h.ba = function () {\n    return this.xa ? this.xa : this.xa = If().then(function () {\n      if (\"function\" !== typeof L(\"universalLinks.subscribe\", k)) throw Hj(\"cordova-universal-links-plugin is not installed\");if (\"undefined\" === typeof L(\"BuildInfo.packageName\", k)) throw Hj(\"cordova-plugin-buildinfo is not installed\");if (\"function\" !== typeof L(\"cordova.plugins.browsertab.openUrl\", k)) throw Hj(\"cordova-plugin-browsertab is not installed\");if (\"function\" !== typeof L(\"cordova.InAppBrowser.open\", k)) throw Hj(\"cordova-plugin-inappbrowser is not installed\");\n    }, function () {\n      throw new N(\"cordova-not-ready\");\n    });\n  };function Ij() {\n    for (var a = 20, b = []; 0 < a;) {\n      b.push(\"1234567890abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ\".charAt(Math.floor(62 * Math.random()))), a--;\n    }return b.join(\"\");\n  }function Jj(a) {\n    var b = new ie();he(b, a);a = [];var c = 8 * b.g;56 > b.c ? he(b, fe, 56 - b.c) : he(b, fe, b.b - (b.c - 56));for (var d = 63; 56 <= d; d--) {\n      b.f[d] = c & 255, c /= 256;\n    }ge(b);for (d = c = 0; d < b.i; d++) {\n      for (var e = 24; 0 <= e; e -= 8) {\n        a[c++] = b.a[d] >> e & 255;\n      }\n    }return Hd(a);\n  }\n  h.Ca = function (a, b) {\n    b(new N(\"operation-not-supported-in-this-environment\"));return A();\n  };h.ub = function () {\n    return B(new N(\"operation-not-supported-in-this-environment\"));\n  };h.Db = function () {\n    return !1;\n  };h.Cb = function () {\n    return !0;\n  };h.xb = function () {\n    return !0;\n  };\n  h.Aa = function (a, b, c) {\n    if (this.c) return B(new N(\"redirect-operation-pending\"));var d = this,\n        e = k.document,\n        f = null,\n        g = null,\n        l = null,\n        n = null;return this.c = Qb(A().then(function () {\n      vh(b);return Kj(d);\n    }).then(function () {\n      return Lj(d, a, b, c);\n    }).then(function () {\n      return new z(function (a, b) {\n        g = function g() {\n          var b = L(\"cordova.plugins.browsertab.close\", k);a();\"function\" === typeof b && b();d.a && \"function\" === typeof d.a.close && (d.a.close(), d.a = null);return !1;\n        };d.ua(g);l = function l() {\n          f || (f = sd(d.w).then(function () {\n            b(new N(\"redirect-cancelled-by-user\"));\n          }));\n        };\n        n = function n() {\n          ag() && l();\n        };e.addEventListener(\"resume\", l, !1);J().toLowerCase().match(/android/) || e.addEventListener(\"visibilitychange\", n, !1);\n      }).s(function (a) {\n        return Mj(d).then(function () {\n          throw a;\n        });\n      });\n    }), function () {\n      l && e.removeEventListener(\"resume\", l, !1);n && e.removeEventListener(\"visibilitychange\", n, !1);f && f.cancel();g && d.Ja(g);d.c = null;\n    });\n  };\n  function Lj(a, b, c, d) {\n    var e = Ij(),\n        f = new wh(b, d, null, e, new N(\"no-auth-event\")),\n        g = L(\"BuildInfo.packageName\", k);if (\"string\" !== typeof g) throw new N(\"invalid-cordova-configuration\");var l = L(\"BuildInfo.displayName\", k),\n        n = {};if (J().toLowerCase().match(/iphone|ipad|ipod/)) n.ibi = g;else if (J().toLowerCase().match(/android/)) n.apn = g;else return B(new N(\"operation-not-supported-in-this-environment\"));l && (n.appDisplayName = l);e = Jj(e);n.sessionId = e;var D = Ri(a.u, a.i, a.l, b, c, null, d, a.m, n, a.o);return a.ba().then(function () {\n      var b = a.h;return a.A.a.set(Dj, f.B(), b);\n    }).then(function () {\n      var b = L(\"cordova.plugins.browsertab.isAvailable\", k);if (\"function\" !== typeof b) throw new N(\"invalid-cordova-configuration\");var c = null;b(function (b) {\n        if (b) {\n          c = L(\"cordova.plugins.browsertab.openUrl\", k);if (\"function\" !== typeof c) throw new N(\"invalid-cordova-configuration\");c(D);\n        } else {\n          c = L(\"cordova.InAppBrowser.open\", k);if (\"function\" !== typeof c) throw new N(\"invalid-cordova-configuration\");b = J();b = !(!b.match(/(iPad|iPhone|iPod).*OS 7_\\d/i) && !b.match(/(iPad|iPhone|iPod).*OS 8_\\d/i));\n          a.a = c(D, b ? \"_blank\" : \"_system\", \"location=yes\");\n        }\n      });\n    });\n  }function Nj(a, b) {\n    for (var c = 0; c < a.b.length; c++) {\n      try {\n        a.b[c](b);\n      } catch (d) {}\n    }\n  }function Kj(a) {\n    a.f || (a.f = a.ba().then(function () {\n      return new z(function (b) {\n        function c(d) {\n          b(d);a.Ja(c);return !1;\n        }a.ua(c);Oj(a);\n      });\n    }));return a.f;\n  }function Mj(a) {\n    var b = null;return Ej(a.g).then(function (c) {\n      b = c;c = a.g;return uj(c.b, Dj, c.a);\n    }).then(function () {\n      return b;\n    });\n  }\n  function Oj(a) {\n    function b(b) {\n      e = !0;f && f.cancel();Mj(a).then(function (c) {\n        var e = d;if (c && b && b.url) {\n          e = null;var f = b.url;var g = De(f),\n              l = Ce(g, \"link\"),\n              n = Ce(De(l), \"link\");g = Ce(g, \"deep_link_id\");f = Ce(De(g), \"link\") || g || n || l || f;-1 != f.indexOf(\"/__/auth/callback\") && (e = De(f), e = Wf(Ce(e, \"firebaseError\") || null), e = (e = \"object\" === (typeof e === \"undefined\" ? \"undefined\" : _typeof(e)) ? vg(e) : null) ? new wh(c.b, c.c, null, null, e) : new wh(c.b, c.c, f, c.g));e = e || d;\n        }Nj(a, e);\n      });\n    }var c = L(\"universalLinks.subscribe\", k);if (\"function\" !== typeof c) throw new N(\"invalid-cordova-configuration\");\n    var d = new wh(\"unknown\", null, null, null, new N(\"no-auth-event\")),\n        e = !1,\n        f = sd(a.v).then(function () {\n      return Mj(a).then(function () {\n        e || Nj(a, d);\n      });\n    }),\n        g = k.handleOpenURL;k.handleOpenURL = function (a) {\n      0 == a.toLowerCase().indexOf(L(\"BuildInfo.packageName\", k).toLowerCase() + \"://\") && b({ url: a });if (\"function\" === typeof g) try {\n        g(a);\n      } catch (n) {\n        console.error(n);\n      }\n    };c(null, b);\n  }\n  h.ua = function (a) {\n    this.b.push(a);Kj(this).s(function (b) {\n      \"auth/invalid-cordova-configuration\" === b.code && (b = new wh(\"unknown\", null, null, null, new N(\"no-auth-event\")), a(b));\n    });\n  };h.Ja = function (a) {\n    Ja(this.b, function (b) {\n      return b == a;\n    });\n  };function Pj(a) {\n    this.a = a;this.b = rj();\n  }var Qj = { name: \"pendingRedirect\", C: \"session\" };function Rj(a) {\n    return a.b.set(Qj, \"pending\", a.a);\n  }function Sj(a) {\n    return uj(a.b, Qj, a.a);\n  }function Tj(a) {\n    return a.b.get(Qj, a.a).then(function (a) {\n      return \"pending\" == a;\n    });\n  };function Uj(a, b, c) {\n    this.v = a;this.l = b;this.u = c;this.h = [];this.f = !1;this.i = r(this.m, this);this.c = new Vj();this.o = new Wj();this.g = new Pj(this.l + \":\" + this.u);this.b = {};this.b.unknown = this.c;this.b.signInViaRedirect = this.c;this.b.linkViaRedirect = this.c;this.b.reauthViaRedirect = this.c;this.b.signInViaPopup = this.o;this.b.linkViaPopup = this.o;this.b.reauthViaPopup = this.o;this.a = Xj(this.v, this.l, this.u, yi);\n  }\n  function Xj(a, b, c, d) {\n    var e = firebase.SDK_VERSION || null;return Jf() ? new Gj(a, b, c, e, void 0, void 0, d) : new Li(a, b, c, e, d);\n  }Uj.prototype.reset = function () {\n    this.f = !1;this.a.Ja(this.i);this.a = Xj(this.v, this.l, this.u);\n  };function Yj(a) {\n    a.f || (a.f = !0, a.a.ua(a.i));var b = a.a;return a.a.ba().s(function (c) {\n      a.a == b && a.reset();throw c;\n    });\n  }function Zj(a) {\n    a.a.Cb() && Yj(a).s(function (b) {\n      var c = new wh(\"unknown\", null, null, null, new N(\"operation-not-supported-in-this-environment\"));ak(b) && a.m(c);\n    });a.a.xb() || bk(a.c);\n  }\n  Uj.prototype.subscribe = function (a) {\n    Ha(this.h, a) || this.h.push(a);if (!this.f) {\n      var b = this;Tj(this.g).then(function (a) {\n        a ? Sj(b.g).then(function () {\n          Yj(b).s(function (a) {\n            var c = new wh(\"unknown\", null, null, null, new N(\"operation-not-supported-in-this-environment\"));ak(a) && b.m(c);\n          });\n        }) : Zj(b);\n      }).s(function () {\n        Zj(b);\n      });\n    }\n  };Uj.prototype.unsubscribe = function (a) {\n    Ja(this.h, function (b) {\n      return b == a;\n    });\n  };\n  Uj.prototype.m = function (a) {\n    if (!a) throw new N(\"invalid-auth-event\");for (var b = !1, c = 0; c < this.h.length; c++) {\n      var d = this.h[c];if (d.ob(a.b, a.c)) {\n        (b = this.b[a.b]) && b.h(a, d);b = !0;break;\n      }\n    }bk(this.c);return b;\n  };var ck = new $f(2E3, 1E4),\n      dk = new $f(3E4, 6E4);Uj.prototype.aa = function () {\n    return this.c.aa();\n  };function ek(a, b, c, d, e, f) {\n    return a.a.ub(b, c, d, function () {\n      a.f || (a.f = !0, a.a.ua(a.i));\n    }, function () {\n      a.reset();\n    }, e, f);\n  }function ak(a) {\n    return a && \"auth/cordova-not-ready\" == a.code ? !0 : !1;\n  }\n  Uj.prototype.Aa = function (a, b, c) {\n    var d = this,\n        e;return Rj(this.g).then(function () {\n      return d.a.Aa(a, b, c).s(function (a) {\n        if (ak(a)) throw new N(\"operation-not-supported-in-this-environment\");e = a;return Sj(d.g).then(function () {\n          throw e;\n        });\n      }).then(function () {\n        return d.a.Db() ? new z(function () {}) : Sj(d.g).then(function () {\n          return d.aa();\n        }).then(function () {}).s(function () {});\n      });\n    });\n  };Uj.prototype.Ca = function (a, b, c, d) {\n    return this.a.Ca(c, function (c) {\n      a.fa(b, null, c, d);\n    }, ck.get());\n  };var fk = {};\n  function gk(a, b, c) {\n    var d = b + \":\" + c;fk[d] || (fk[d] = new Uj(a, b, c));return fk[d];\n  }function Vj() {\n    this.b = null;this.f = [];this.c = [];this.a = null;this.g = !1;\n  }Vj.prototype.reset = function () {\n    this.b = null;this.a && (this.a.cancel(), this.a = null);\n  };\n  Vj.prototype.h = function (a, b) {\n    if (!a) return B(new N(\"invalid-auth-event\"));this.reset();this.g = !0;var c = a.b,\n        d = a.c,\n        e = a.a && \"auth/web-storage-unsupported\" == a.a.code,\n        f = a.a && \"auth/operation-not-supported-in-this-environment\" == a.a.code;\"unknown\" != c || e || f ? a.a ? (hk(this, !0, null, a.a), a = A()) : a = b.va(c, d) ? ik(this, a, b) : B(new N(\"invalid-auth-event\")) : (hk(this, !1, null, null), a = A());return a;\n  };function bk(a) {\n    a.g || (a.g = !0, hk(a, !1, null, null));\n  }\n  function ik(a, b, c) {\n    c = c.va(b.b, b.c);var d = b.f,\n        e = b.g,\n        f = !!b.b.match(/Redirect$/);return c(d, e).then(function (b) {\n      hk(a, f, b, null);\n    }).s(function (b) {\n      hk(a, f, null, b);\n    });\n  }function jk(a, b) {\n    a.b = function () {\n      return B(b);\n    };if (a.c.length) for (var c = 0; c < a.c.length; c++) {\n      a.c[c](b);\n    }\n  }function kk(a, b) {\n    a.b = function () {\n      return A(b);\n    };if (a.f.length) for (var c = 0; c < a.f.length; c++) {\n      a.f[c](b);\n    }\n  }function hk(a, b, c, d) {\n    b ? d ? jk(a, d) : kk(a, c) : kk(a, { user: null });a.f = [];a.c = [];\n  }\n  Vj.prototype.aa = function () {\n    var a = this;return new z(function (b, c) {\n      a.b ? a.b().then(b, c) : (a.f.push(b), a.c.push(c), lk(a));\n    });\n  };function lk(a) {\n    var b = new N(\"timeout\");a.a && a.a.cancel();a.a = sd(dk.get()).then(function () {\n      a.b || hk(a, !0, null, b);\n    });\n  }function Wj() {}Wj.prototype.h = function (a, b) {\n    if (!a) return B(new N(\"invalid-auth-event\"));var c = a.b,\n        d = a.c;a.a ? (b.fa(a.b, null, a.a, a.c), a = A()) : a = b.va(c, d) ? mk(a, b) : B(new N(\"invalid-auth-event\"));return a;\n  };\n  function mk(a, b) {\n    var c = a.c,\n        d = a.b;return b.va(d, c)(a.f, a.g).then(function (a) {\n      b.fa(d, a, null, c);\n    }).s(function (a) {\n      b.fa(d, null, a, c);\n    });\n  };function nk(a, b) {\n    this.a = b;M(this, \"verificationId\", a);\n  }nk.prototype.confirm = function (a) {\n    a = th(this.verificationId, a);return this.a(a);\n  };function ok(a, b, c, d) {\n    return new rh(a).Qa(b, c).then(function (a) {\n      return new nk(a, d);\n    });\n  };function pk(a, b, c, d, e, f) {\n    this.h = a;this.i = b;this.g = c;this.c = d;this.f = e;this.l = !!f;this.b = null;this.a = this.c;if (this.f < this.c) throw Error(\"Proactive refresh lower bound greater than upper bound!\");\n  }pk.prototype.start = function () {\n    this.a = this.c;qk(this, !0);\n  };function rk(a, b) {\n    if (b) return a.a = a.c, a.g();b = a.a;a.a *= 2;a.a > a.f && (a.a = a.f);return b;\n  }\n  function qk(a, b) {\n    sk(a);a.b = sd(rk(a, b)).then(function () {\n      return a.l ? A() : bg();\n    }).then(function () {\n      return a.h();\n    }).then(function () {\n      qk(a, !0);\n    }).s(function (b) {\n      a.i(b) && qk(a, !1);\n    });\n  }function sk(a) {\n    a.b && (a.b.cancel(), a.b = null);\n  };function tk(a) {\n    this.f = a;this.b = this.a = null;this.c = 0;\n  }tk.prototype.B = function () {\n    return { apiKey: this.f.b, refreshToken: this.a, accessToken: this.b, expirationTime: this.c };\n  };function uk(a, b) {\n    var c = b[_O],\n        d = b.refreshToken;b = vk(b.expiresIn);a.b = c;a.c = b;a.a = d;\n  }function vk(a) {\n    return na() + 1E3 * parseInt(a, 10);\n  }\n  function wk(a, b) {\n    return Oh(a.f, b).then(function (b) {\n      a.b = b.access_token;a.c = vk(b.expires_in);a.a = b.refresh_token;return { accessToken: a.b, expirationTime: a.c, refreshToken: a.a };\n    }).s(function (b) {\n      \"auth/user-token-expired\" == b.code && (a.a = null);throw b;\n    });\n  }tk.prototype.getToken = function (a) {\n    a = !!a;return this.b && !this.a ? B(new N(\"user-token-expired\")) : a || !this.b || na() > this.c - 3E4 ? this.a ? wk(this, { grant_type: \"refresh_token\", refresh_token: this.a }) : A(null) : A({ accessToken: this.b, expirationTime: this.c, refreshToken: this.a });\n  };function xk(a, b) {\n    this.a = a || null;this.b = b || null;gg(this, { lastSignInTime: cg(b || null), creationTime: cg(a || null) });\n  }function yk(a) {\n    return new xk(a.a, a.b);\n  }xk.prototype.B = function () {\n    return { lastLoginAt: this.b, createdAt: this.a };\n  };function zk(a, b, c, d, e, f) {\n    gg(this, { uid: a, displayName: d || null, photoURL: e || null, email: c || null, phoneNumber: f || null, providerId: b });\n  }function Ak(a, b) {\n    C.call(this, a);for (var c in b) {\n      this[c] = b[c];\n    }\n  }t(Ak, C);\n  function Bk(a, b, c) {\n    this.A = [];this.G = a.apiKey;this.o = a.appName;this.w = a.authDomain || null;a = firebase.SDK_VERSION ? Of(firebase.SDK_VERSION) : null;this.c = new Ch(this.G, xi(yi), a);this.h = new tk(this.c);Ck(this, b[_O]);uk(this.h, b);M(this, \"refreshToken\", this.h.a);Dk(this, c || {});F.call(this);this.I = !1;this.w && Rf() && (this.a = gk(this.w, this.G, this.o));this.N = [];this.i = null;this.l = Ek(this);this.U = r(this.Ga, this);var d = this;this.ha = null;this.ra = function (a) {\n      d.na(a.h);\n    };this.W = null;this.R = [];this.qa = function (a) {\n      Fk(d, a.f);\n    };this.V = null;\n  }t(Bk, F);Bk.prototype.na = function (a) {\n    this.ha = a;Ih(this.c, a);\n  };Bk.prototype.$ = function () {\n    return this.ha;\n  };function Gk(a, b) {\n    a.W && E(a.W, \"languageCodeChanged\", a.ra);(a.W = b) && cd(b, \"languageCodeChanged\", a.ra);\n  }function Fk(a, b) {\n    a.R = b;Jh(a.c, firebase.SDK_VERSION ? Of(firebase.SDK_VERSION, a.R) : null);\n  }Bk.prototype.Ka = function () {\n    return La(this.R);\n  };function Hk(a, b) {\n    a.V && E(a.V, \"frameworkChanged\", a.qa);(a.V = b) && cd(b, \"frameworkChanged\", a.qa);\n  }Bk.prototype.Ga = function () {\n    this.l.b && (sk(this.l), this.l.start());\n  };\n  function Ik(a) {\n    try {\n      return firebase.app(a.o).auth();\n    } catch (b) {\n      throw new N(\"internal-error\", \"No firebase.auth.Auth instance is available for the Firebase App '\" + a.o + \"'!\");\n    }\n  }function Ek(a) {\n    return new pk(function () {\n      return a.F(!0);\n    }, function (a) {\n      return a && \"auth/network-request-failed\" == a.code ? !0 : !1;\n    }, function () {\n      var b = a.h.c - na() - 3E5;return 0 < b ? b : 0;\n    }, 3E4, 96E4, !1);\n  }function Jk(a) {\n    a.m || a.l.b || (a.l.start(), E(a, \"tokenChanged\", a.U), cd(a, \"tokenChanged\", a.U));\n  }function Kk(a) {\n    E(a, \"tokenChanged\", a.U);sk(a.l);\n  }\n  function Ck(a, b) {\n    a.pa = b;M(a, \"_lat\", b);\n  }function Lk(a, b) {\n    Ja(a.N, function (a) {\n      return a == b;\n    });\n  }function Mk(a) {\n    for (var b = [], c = 0; c < a.N.length; c++) {\n      b.push(a.N[c](a));\n    }return Ob(b).then(function () {\n      return a;\n    });\n  }function Nk(a) {\n    a.a && !a.I && (a.I = !0, a.a.subscribe(a));\n  }\n  function Dk(a, b) {\n    gg(a, { uid: b.uid, displayName: b.displayName || null, photoURL: b.photoURL || null, email: b.email || null, emailVerified: b.emailVerified || !1, phoneNumber: b.phoneNumber || null, isAnonymous: b.isAnonymous || !1, metadata: new xk(b.createdAt, b.lastLoginAt), providerData: [] });\n  }M(Bk.prototype, \"providerId\", \"firebase\");function Ok() {}function Pk(a) {\n    return A().then(function () {\n      if (a.m) throw new N(\"app-deleted\");\n    });\n  }function Qk(a) {\n    return Da(a.providerData, function (a) {\n      return a.providerId;\n    });\n  }\n  function Rk(a, b) {\n    b && (Sk(a, b.providerId), a.providerData.push(b));\n  }function Sk(a, b) {\n    Ja(a.providerData, function (a) {\n      return a.providerId == b;\n    });\n  }function Tk(a, b, c) {\n    (\"uid\" != b || c) && a.hasOwnProperty(b) && M(a, b, c);\n  }\n  function Uk(a, b) {\n    a != b && (gg(a, { uid: b.uid, displayName: b.displayName, photoURL: b.photoURL, email: b.email, emailVerified: b.emailVerified, phoneNumber: b.phoneNumber, isAnonymous: b.isAnonymous, providerData: [] }), b.metadata ? M(a, \"metadata\", yk(b.metadata)) : M(a, \"metadata\", new xk()), w(b.providerData, function (b) {\n      Rk(a, b);\n    }), a.h = b.h, M(a, \"refreshToken\", a.h.a));\n  }h = Bk.prototype;h.reload = function () {\n    var a = this;return R(this, Pk(this).then(function () {\n      return Vk(a).then(function () {\n        return Mk(a);\n      }).then(Ok);\n    }));\n  };\n  function Vk(a) {\n    return a.F().then(function (b) {\n      var c = a.isAnonymous;return Wk(a, b).then(function () {\n        c || Tk(a, \"isAnonymous\", !1);return b;\n      });\n    });\n  }h.F = function (a) {\n    var b = this;return R(this, Pk(this).then(function () {\n      return b.h.getToken(a);\n    }).then(function (a) {\n      if (!a) throw new N(\"internal-error\");a.accessToken != b.pa && (Ck(b, a.accessToken), G(b, new Ak(\"tokenChanged\")));Tk(b, \"refreshToken\", a.refreshToken);return a.accessToken;\n    }));\n  };\n  h.getToken = function (a) {\n    dg[\"firebase.User.prototype.getToken is deprecated. Please use firebase.User.prototype.getIdToken instead.\"] || (dg[\"firebase.User.prototype.getToken is deprecated. Please use firebase.User.prototype.getIdToken instead.\"] = !0, \"undefined\" !== typeof console && \"function\" === typeof console.warn && console.warn(\"firebase.User.prototype.getToken is deprecated. Please use firebase.User.prototype.getIdToken instead.\"));return this.F(a);\n  };\n  function Xk(a, b) {\n    b[_O] && a.pa != b[_O] && (uk(a.h, b), G(a, new Ak(\"tokenChanged\")), Ck(a, b[_O]), Tk(a, \"refreshToken\", a.h.a));\n  }function Wk(a, b) {\n    return Q(a.c, ti, { idToken: b }).then(r(a.gc, a));\n  }\n  h.gc = function (a) {\n    a = a.users;if (!a || !a.length) throw new N(\"internal-error\");a = a[0];Dk(this, { uid: a.localId, displayName: a.displayName, photoURL: a.photoUrl, email: a.email, emailVerified: !!a.emailVerified, phoneNumber: a.phoneNumber, lastLoginAt: a.lastLoginAt, createdAt: a.createdAt });for (var b = Yk(a), c = 0; c < b.length; c++) {\n      Rk(this, b[c]);\n    }Tk(this, \"isAnonymous\", !(this.email && a.passwordHash) && !(this.providerData && this.providerData.length));\n  };\n  function Yk(a) {\n    return (a = a.providerUserInfo) && a.length ? Da(a, function (a) {\n      return new zk(a.rawId, a.providerId, a.email, a.displayName, a.photoUrl, a.phoneNumber);\n    }) : [];\n  }h.Za = function (a) {\n    var b = this,\n        c = null;return R(this, a.c(this.c, this.uid).then(function (a) {\n      Xk(b, a);c = Zk(b, a, \"reauthenticate\");b.i = null;return b.reload();\n    }).then(function () {\n      return c;\n    }), !0);\n  };h.hc = function (a) {\n    return this.Za(a).then(function () {});\n  };\n  function $k(a, b) {\n    return Vk(a).then(function () {\n      if (Ha(Qk(a), b)) return Mk(a).then(function () {\n        throw new N(\"provider-already-linked\");\n      });\n    });\n  }h.Xa = function (a) {\n    var b = this,\n        c = null;return R(this, $k(this, a.providerId).then(function () {\n      return b.F();\n    }).then(function (c) {\n      return a.b(b.c, c);\n    }).then(function (a) {\n      c = Zk(b, a, \"link\");return al(b, a);\n    }).then(function () {\n      return c;\n    }));\n  };h.Zb = function (a) {\n    return this.Xa(a).then(function (a) {\n      return a.user;\n    });\n  };\n  h.$b = function (a, b) {\n    var c = this;return R(this, $k(this, \"phone\").then(function () {\n      return ok(Ik(c), a, b, r(c.Xa, c));\n    }));\n  };h.ic = function (a, b) {\n    var c = this;return R(this, A().then(function () {\n      return ok(Ik(c), a, b, r(c.Za, c));\n    }), !0);\n  };function Zk(a, b, c) {\n    var d = uh(b);b = Mg(b);return hg({ user: a, credential: d, additionalUserInfo: b, operationType: c });\n  }function al(a, b) {\n    Xk(a, b);return a.reload().then(function () {\n      return a;\n    });\n  }\n  h.kb = function (a) {\n    var b = this;return R(this, this.F().then(function (c) {\n      return b.c.kb(c, a);\n    }).then(function (a) {\n      Xk(b, a);return b.reload();\n    }));\n  };h.zc = function (a) {\n    var b = this;return R(this, this.F().then(function (c) {\n      return a.b(b.c, c);\n    }).then(function (a) {\n      Xk(b, a);return b.reload();\n    }));\n  };h.lb = function (a) {\n    var b = this;return R(this, this.F().then(function (c) {\n      return b.c.lb(c, a);\n    }).then(function (a) {\n      Xk(b, a);return b.reload();\n    }));\n  };\n  h.mb = function (a) {\n    if (void 0 === a.displayName && void 0 === a.photoURL) return Pk(this);var b = this;return R(this, this.F().then(function (c) {\n      return b.c.mb(c, { displayName: a.displayName, photoUrl: a.photoURL });\n    }).then(function (a) {\n      Xk(b, a);Tk(b, \"displayName\", a.displayName || null);Tk(b, \"photoURL\", a.photoUrl || null);w(b.providerData, function (a) {\n        \"password\" === a.providerId && (M(a, \"displayName\", b.displayName), M(a, \"photoURL\", b.photoURL));\n      });return Mk(b);\n    }).then(Ok));\n  };\n  h.yc = function (a) {\n    var b = this;return R(this, Vk(this).then(function (c) {\n      return Ha(Qk(b), a) ? fi(b.c, c, [a]).then(function (a) {\n        var c = {};w(a.providerUserInfo || [], function (a) {\n          c[a.providerId] = !0;\n        });w(Qk(b), function (a) {\n          c[a] || Sk(b, a);\n        });c[rh.PROVIDER_ID] || M(b, \"phoneNumber\", null);return Mk(b);\n      }) : Mk(b).then(function () {\n        throw new N(\"no-such-provider\");\n      });\n    }));\n  };\n  h.delete = function () {\n    var a = this;return R(this, this.F().then(function (b) {\n      return Q(a.c, si, { idToken: b });\n    }).then(function () {\n      G(a, new Ak(\"userDeleted\"));\n    })).then(function () {\n      for (var b = 0; b < a.A.length; b++) {\n        a.A[b].cancel(\"app-deleted\");\n      }Gk(a, null);Hk(a, null);a.A = [];a.m = !0;Kk(a);M(a, \"refreshToken\", null);a.a && a.a.unsubscribe(a);\n    });\n  };\n  h.ob = function (a, b) {\n    return \"linkViaPopup\" == a && (this.g || null) == b && this.f || \"reauthViaPopup\" == a && (this.g || null) == b && this.f || \"linkViaRedirect\" == a && (this.Z || null) == b || \"reauthViaRedirect\" == a && (this.Z || null) == b ? !0 : !1;\n  };h.fa = function (a, b, c, d) {\n    \"linkViaPopup\" != a && \"reauthViaPopup\" != a || d != (this.g || null) || (c && this.v ? this.v(c) : b && !c && this.f && this.f(b), this.b && (this.b.cancel(), this.b = null), delete this.f, delete this.v);\n  };\n  h.va = function (a, b) {\n    return \"linkViaPopup\" == a && b == (this.g || null) ? r(this.sb, this) : \"reauthViaPopup\" == a && b == (this.g || null) ? r(this.tb, this) : \"linkViaRedirect\" == a && (this.Z || null) == b ? r(this.sb, this) : \"reauthViaRedirect\" == a && (this.Z || null) == b ? r(this.tb, this) : null;\n  };h.ac = function (a) {\n    var b = this;return bl(this, \"linkViaPopup\", a, function () {\n      return $k(b, a.providerId).then(function () {\n        return Mk(b);\n      });\n    }, !1);\n  };h.jc = function (a) {\n    return bl(this, \"reauthViaPopup\", a, function () {\n      return A();\n    }, !0);\n  };\n  function bl(a, b, c, d, e) {\n    if (!Rf()) return B(new N(\"operation-not-supported-in-this-environment\"));if (a.i && !e) return B(a.i);var f = Lg(c.providerId),\n        g = Qf(a.uid + \":::\"),\n        l = null;(!Tf() || Lf()) && a.w && c.isOAuthProvider && (l = Ri(a.w, a.G, a.o, b, c, null, g, firebase.SDK_VERSION || null));var n = Df(l, f && f.za, f && f.ya);d = d().then(function () {\n      cl(a);if (!e) return a.F().then(function () {});\n    }).then(function () {\n      return ek(a.a, n, b, c, g, !!l);\n    }).then(function () {\n      return new z(function (c, d) {\n        a.fa(b, null, new N(\"cancelled-popup-request\"), a.g || null);\n        a.f = c;a.v = d;a.g = g;a.b = a.a.Ca(a, b, n, g);\n      });\n    }).then(function (a) {\n      n && Cf(n);return a ? hg(a) : null;\n    }).s(function (a) {\n      n && Cf(n);throw a;\n    });return R(a, d, e);\n  }h.bc = function (a) {\n    var b = this;return dl(this, \"linkViaRedirect\", a, function () {\n      return $k(b, a.providerId);\n    }, !1);\n  };h.kc = function (a) {\n    return dl(this, \"reauthViaRedirect\", a, function () {\n      return A();\n    }, !0);\n  };\n  function dl(a, b, c, d, e) {\n    if (!Rf()) return B(new N(\"operation-not-supported-in-this-environment\"));if (a.i && !e) return B(a.i);var f = null,\n        g = Qf(a.uid + \":::\");d = d().then(function () {\n      cl(a);if (!e) return a.F().then(function () {});\n    }).then(function () {\n      a.Z = g;return Mk(a);\n    }).then(function (b) {\n      a.ca && (b = a.ca, b = b.b.set(el, a.B(), b.a));return b;\n    }).then(function () {\n      return a.a.Aa(b, c, g);\n    }).s(function (b) {\n      f = b;if (a.ca) return fl(a.ca);throw f;\n    }).then(function () {\n      if (f) throw f;\n    });return R(a, d, e);\n  }\n  function cl(a) {\n    if (!a.a || !a.I) {\n      if (a.a && !a.I) throw new N(\"internal-error\");throw new N(\"auth-domain-config-required\");\n    }\n  }h.sb = function (a, b) {\n    var c = this;this.b && (this.b.cancel(), this.b = null);var d = null,\n        e = this.F().then(function (d) {\n      return Zg(c.c, { requestUri: a, sessionId: b, idToken: d });\n    }).then(function (a) {\n      d = Zk(c, a, \"link\");return al(c, a);\n    }).then(function () {\n      return d;\n    });return R(this, e);\n  };\n  h.tb = function (a, b) {\n    var c = this;this.b && (this.b.cancel(), this.b = null);var d = null,\n        e = A().then(function () {\n      return Vg($g(c.c, { requestUri: a, sessionId: b }), c.uid);\n    }).then(function (a) {\n      d = Zk(c, a, \"reauthenticate\");Xk(c, a);c.i = null;return c.reload();\n    }).then(function () {\n      return d;\n    });return R(this, e, !0);\n  };h.bb = function (a) {\n    var b = this,\n        c = null;return R(this, this.F().then(function (b) {\n      c = b;return \"undefined\" === typeof a || Sa(a) ? {} : Fg(new wg(a));\n    }).then(function (a) {\n      return b.c.bb(c, a);\n    }).then(function (a) {\n      if (b.email != a) return b.reload();\n    }).then(function () {}));\n  };\n  function R(a, b, c) {\n    var d = gl(a, b, c);a.A.push(d);Qb(d, function () {\n      Ia(a.A, d);\n    });return d;\n  }function gl(a, b, c) {\n    return a.i && !c ? (b.cancel(), B(a.i)) : b.s(function (b) {\n      !b || \"auth/user-disabled\" != b.code && \"auth/user-token-expired\" != b.code || (a.i || G(a, new Ak(\"userInvalidated\")), a.i = b);throw b;\n    });\n  }h.toJSON = function () {\n    return this.B();\n  };\n  h.B = function () {\n    var a = { uid: this.uid, displayName: this.displayName, photoURL: this.photoURL, email: this.email, emailVerified: this.emailVerified, phoneNumber: this.phoneNumber, isAnonymous: this.isAnonymous, providerData: [], apiKey: this.G, appName: this.o, authDomain: this.w, stsTokenManager: this.h.B(), redirectEventId: this.Z || null };this.metadata && Wa(a, this.metadata.B());w(this.providerData, function (b) {\n      a.providerData.push(ig(b));\n    });return a;\n  };\n  function hl(a) {\n    if (!a.apiKey) return null;var b = { apiKey: a.apiKey, authDomain: a.authDomain, appName: a.appName },\n        c = {};if (a.stsTokenManager && a.stsTokenManager.accessToken && a.stsTokenManager.expirationTime) c[_O] = a.stsTokenManager.accessToken, c.refreshToken = a.stsTokenManager.refreshToken || null, c.expiresIn = (a.stsTokenManager.expirationTime - na()) / 1E3;else return null;var d = new Bk(b, c, a);a.providerData && w(a.providerData, function (a) {\n      a && Rk(d, hg(a));\n    });a.redirectEventId && (d.Z = a.redirectEventId);return d;\n  }\n  function il(a, b, c, d) {\n    var e = new Bk(a, b);c && (e.ca = c);d && Fk(e, d);return e.reload().then(function () {\n      return e;\n    });\n  };function jl(a) {\n    this.a = a;this.b = rj();\n  }var el = { name: \"redirectUser\", C: \"session\" };function fl(a) {\n    return uj(a.b, el, a.a);\n  }function kl(a, b) {\n    return a.b.get(el, a.a).then(function (a) {\n      a && b && (a.authDomain = b);return hl(a || {});\n    });\n  };function ll(a, b) {\n    this.a = a;this.b = b || rj();this.c = null;this.f = ml(this);vj(this.b, yj(\"local\"), this.a, r(this.g, this));\n  }ll.prototype.g = function () {\n    var a = this,\n        b = yj(\"local\");nl(this, function () {\n      return A().then(function () {\n        return a.c && \"local\" != a.c.C ? a.b.get(b, a.a) : null;\n      }).then(function (c) {\n        if (c) return ol(a, \"local\").then(function () {\n          a.c = b;\n        });\n      });\n    });\n  };function ol(a, b) {\n    var c = [],\n        d;for (d in nj) {\n      nj[d] !== b && c.push(uj(a.b, yj(nj[d]), a.a));\n    }c.push(uj(a.b, pl, a.a));return Nb(c);\n  }\n  function ml(a) {\n    var b = yj(\"local\"),\n        c = yj(\"session\"),\n        d = yj(\"none\");return a.b.get(c, a.a).then(function (e) {\n      return e ? c : a.b.get(d, a.a).then(function (c) {\n        return c ? d : a.b.get(b, a.a).then(function (c) {\n          return c ? b : a.b.get(pl, a.a).then(function (a) {\n            return a ? yj(a) : b;\n          });\n        });\n      });\n    }).then(function (b) {\n      a.c = b;return ol(a, b.C);\n    }).s(function () {\n      a.c || (a.c = b);\n    });\n  }var pl = { name: \"persistence\", C: \"session\" };function yj(a) {\n    return { name: \"authUser\", C: a };\n  }\n  ll.prototype.eb = function (a) {\n    var b = null,\n        c = this;oj(a);return nl(this, function () {\n      return a != c.c.C ? c.b.get(c.c, c.a).then(function (d) {\n        b = d;return ol(c, a);\n      }).then(function () {\n        c.c = yj(a);if (b) return c.b.set(c.c, b, c.a);\n      }) : A();\n    });\n  };function ql(a) {\n    return nl(a, function () {\n      return a.b.set(pl, a.c.C, a.a);\n    });\n  }function rl(a, b) {\n    return nl(a, function () {\n      return a.b.set(a.c, b.B(), a.a);\n    });\n  }function sl(a) {\n    return nl(a, function () {\n      return uj(a.b, a.c, a.a);\n    });\n  }\n  function tl(a, b) {\n    return nl(a, function () {\n      return a.b.get(a.c, a.a).then(function (a) {\n        a && b && (a.authDomain = b);return hl(a || {});\n      });\n    });\n  }function nl(a, b) {\n    a.f = a.f.then(b, b);return a.f;\n  };function ul(a) {\n    this.l = !1;M(this, \"app\", a);if (S(this).options && S(this).options.apiKey) a = firebase.SDK_VERSION ? Of(firebase.SDK_VERSION) : null, this.c = new Ch(S(this).options && S(this).options.apiKey, xi(yi), a);else throw new N(\"invalid-api-key\");this.N = [];this.m = [];this.I = [];this.Gb = firebase.INTERNAL.createSubscribe(r(this.Xb, this));this.R = void 0;this.Hb = firebase.INTERNAL.createSubscribe(r(this.Yb, this));vl(this, null);this.h = new ll(S(this).options.apiKey + \":\" + S(this).name);this.G = new jl(S(this).options.apiKey + \":\" + S(this).name);this.U = T(this, wl(this));this.i = T(this, xl(this));this.W = !1;this.ha = r(this.uc, this);this.Ga = r(this.ka, this);this.pa = r(this.Pb, this);this.qa = r(this.Vb, this);this.ra = r(this.Wb, this);yl(this);this.INTERNAL = {};this.INTERNAL[\"delete\"] = r(this.delete, this);this.INTERNAL.logFramework = r(this.cc, this);this.o = 0;F.call(this);zl(this);this.A = [];\n  }t(ul, F);function Al(a) {\n    C.call(this, \"languageCodeChanged\");this.h = a;\n  }t(Al, C);function Bl(a) {\n    C.call(this, \"frameworkChanged\");this.f = a;\n  }t(Bl, C);h = ul.prototype;\n  h.eb = function (a) {\n    a = this.h.eb(a);return T(this, a);\n  };h.na = function (a) {\n    this.V === a || this.l || (this.V = a, Ih(this.c, this.V), G(this, new Al(this.$())));\n  };h.$ = function () {\n    return this.V;\n  };h.Ac = function () {\n    var a = k.navigator;this.na(a ? a.languages && a.languages[0] || a.language || a.userLanguage || null : null);\n  };h.cc = function (a) {\n    this.A.push(a);Jh(this.c, firebase.SDK_VERSION ? Of(firebase.SDK_VERSION, this.A) : null);G(this, new Bl(this.A));\n  };h.Ka = function () {\n    return La(this.A);\n  };\n  function zl(a) {\n    Object.defineProperty(a, \"lc\", { get: function get() {\n        return this.$();\n      }, set: function set(a) {\n        this.na(a);\n      }, enumerable: !1 });a.V = null;\n  }h.toJSON = function () {\n    return { apiKey: S(this).options.apiKey, authDomain: S(this).options.authDomain, appName: S(this).name, currentUser: U(this) && U(this).B() };\n  };function Cl(a) {\n    return a.Fb || B(new N(\"auth-domain-config-required\"));\n  }\n  function yl(a) {\n    var b = S(a).options.authDomain,\n        c = S(a).options.apiKey;b && Rf() && (a.Fb = a.U.then(function () {\n      if (!a.l) {\n        a.a = gk(b, c, S(a).name);a.a.subscribe(a);U(a) && Nk(U(a));if (a.w) {\n          Nk(a.w);var d = a.w;d.na(a.$());Gk(d, a);d = a.w;Fk(d, a.A);Hk(d, a);a.w = null;\n        }return a.a;\n      }\n    }));\n  }h.ob = function (a, b) {\n    switch (a) {case \"unknown\":case \"signInViaRedirect\":\n        return !0;case \"signInViaPopup\":\n        return this.g == b && !!this.f;default:\n        return !1;}\n  };\n  h.fa = function (a, b, c, d) {\n    \"signInViaPopup\" == a && this.g == d && (c && this.v ? this.v(c) : b && !c && this.f && this.f(b), this.b && (this.b.cancel(), this.b = null), delete this.f, delete this.v);\n  };h.va = function (a, b) {\n    return \"signInViaRedirect\" == a || \"signInViaPopup\" == a && this.g == b && this.f ? r(this.Ob, this) : null;\n  };\n  h.Ob = function (a, b) {\n    var c = this;a = { requestUri: a, sessionId: b };this.b && (this.b.cancel(), this.b = null);var d = null,\n        e = null,\n        f = Xg(c.c, a).then(function (a) {\n      d = uh(a);e = Mg(a);return a;\n    });a = c.U.then(function () {\n      return f;\n    }).then(function (a) {\n      return Dl(c, a);\n    }).then(function () {\n      return hg({ user: U(c), credential: d, additionalUserInfo: e, operationType: \"signIn\" });\n    });return T(this, a);\n  };\n  h.sc = function (a) {\n    if (!Rf()) return B(new N(\"operation-not-supported-in-this-environment\"));var b = this,\n        c = Lg(a.providerId),\n        d = Qf(),\n        e = null;(!Tf() || Lf()) && S(this).options.authDomain && a.isOAuthProvider && (e = Ri(S(this).options.authDomain, S(this).options.apiKey, S(this).name, \"signInViaPopup\", a, null, d, firebase.SDK_VERSION || null));var f = Df(e, c && c.za, c && c.ya);c = Cl(this).then(function (b) {\n      return ek(b, f, \"signInViaPopup\", a, d, !!e);\n    }).then(function () {\n      return new z(function (a, c) {\n        b.fa(\"signInViaPopup\", null, new N(\"cancelled-popup-request\"), b.g);b.f = a;b.v = c;b.g = d;b.b = b.a.Ca(b, \"signInViaPopup\", f, d);\n      });\n    }).then(function (a) {\n      f && Cf(f);return a ? hg(a) : null;\n    }).s(function (a) {\n      f && Cf(f);throw a;\n    });return T(this, c);\n  };h.tc = function (a) {\n    if (!Rf()) return B(new N(\"operation-not-supported-in-this-environment\"));var b = this,\n        c = Cl(this).then(function () {\n      return ql(b.h);\n    }).then(function () {\n      return b.a.Aa(\"signInViaRedirect\", a);\n    });return T(this, c);\n  };\n  h.aa = function () {\n    if (!Rf()) return B(new N(\"operation-not-supported-in-this-environment\"));var a = this,\n        b = Cl(this).then(function () {\n      return a.a.aa();\n    }).then(function (a) {\n      return a ? hg(a) : null;\n    });return T(this, b);\n  };function Dl(a, b) {\n    var c = {};c.apiKey = S(a).options.apiKey;c.authDomain = S(a).options.authDomain;c.appName = S(a).name;return a.U.then(function () {\n      return il(c, b, a.G, a.Ka());\n    }).then(function (b) {\n      if (U(a) && b.uid == U(a).uid) return Uk(U(a), b), a.ka(b);vl(a, b);Nk(b);return a.ka(b);\n    }).then(function () {\n      El(a);\n    });\n  }\n  function vl(a, b) {\n    U(a) && (Lk(U(a), a.Ga), E(U(a), \"tokenChanged\", a.pa), E(U(a), \"userDeleted\", a.qa), E(U(a), \"userInvalidated\", a.ra), Kk(U(a)));b && (b.N.push(a.Ga), cd(b, \"tokenChanged\", a.pa), cd(b, \"userDeleted\", a.qa), cd(b, \"userInvalidated\", a.ra), 0 < a.o && Jk(b));M(a, \"currentUser\", b);b && (b.na(a.$()), Gk(b, a), Fk(b, a.A), Hk(b, a));\n  }h.hb = function () {\n    var a = this,\n        b = this.i.then(function () {\n      if (!U(a)) return A();vl(a, null);return sl(a.h).then(function () {\n        El(a);\n      });\n    });return T(this, b);\n  };\n  function Fl(a) {\n    var b = kl(a.G, S(a).options.authDomain).then(function (b) {\n      if (a.w = b) b.ca = a.G;return fl(a.G);\n    });return T(a, b);\n  }function wl(a) {\n    var b = S(a).options.authDomain,\n        c = Fl(a).then(function () {\n      return tl(a.h, b);\n    }).then(function (b) {\n      return b ? (b.ca = a.G, a.w && (a.w.Z || null) == (b.Z || null) ? b : b.reload().then(function () {\n        return rl(a.h, b).then(function () {\n          return b;\n        });\n      }).s(function (c) {\n        return \"auth/network-request-failed\" == c.code ? b : sl(a.h);\n      })) : null;\n    }).then(function (b) {\n      vl(a, b || null);\n    });return T(a, c);\n  }\n  function xl(a) {\n    return a.U.then(function () {\n      return a.aa();\n    }).s(function () {}).then(function () {\n      if (!a.l) return a.ha();\n    }).s(function () {}).then(function () {\n      if (!a.l) {\n        a.W = !0;var b = a.h;vj(b.b, yj(\"local\"), b.a, a.ha);\n      }\n    });\n  }\n  h.uc = function () {\n    var a = this;return tl(this.h, S(this).options.authDomain).then(function (b) {\n      if (!a.l) {\n        var c;if (c = U(a) && b) {\n          c = U(a).uid;var d = b.uid;c = void 0 === c || null === c || \"\" === c || void 0 === d || null === d || \"\" === d ? !1 : c == d;\n        }if (c) return Uk(U(a), b), U(a).F();if (U(a) || b) vl(a, b), b && (Nk(b), b.ca = a.G), a.a && a.a.subscribe(a), El(a);\n      }\n    });\n  };h.ka = function (a) {\n    return rl(this.h, a);\n  };h.Pb = function () {\n    El(this);this.ka(U(this));\n  };h.Vb = function () {\n    this.hb();\n  };h.Wb = function () {\n    this.hb();\n  };\n  function Gl(a, b) {\n    var c = null,\n        d = null;return T(a, b.then(function (b) {\n      c = uh(b);d = Mg(b);return Dl(a, b);\n    }).then(function () {\n      return hg({ user: U(a), credential: c, additionalUserInfo: d, operationType: \"signIn\" });\n    }));\n  }h.Xb = function (a) {\n    var b = this;this.addAuthTokenListener(function () {\n      a.next(U(b));\n    });\n  };h.Yb = function (a) {\n    var b = this;Hl(this, function () {\n      a.next(U(b));\n    });\n  };h.ec = function (a, b, c) {\n    var d = this;this.W && firebase.Promise.resolve().then(function () {\n      p(a) ? a(U(d)) : p(a.next) && a.next(U(d));\n    });return this.Gb(a, b, c);\n  };\n  h.dc = function (a, b, c) {\n    var d = this;this.W && firebase.Promise.resolve().then(function () {\n      d.R = d.getUid();p(a) ? a(U(d)) : p(a.next) && a.next(U(d));\n    });return this.Hb(a, b, c);\n  };h.Rb = function (a) {\n    var b = this,\n        c = this.i.then(function () {\n      return U(b) ? U(b).F(a).then(function (a) {\n        return { accessToken: a };\n      }) : null;\n    });return T(this, c);\n  };h.pc = function (a) {\n    var b = this;return this.i.then(function () {\n      return Gl(b, Q(b.c, vi, { token: a }));\n    }).then(function (a) {\n      a = a.user;Tk(a, \"isAnonymous\", !1);return b.ka(a);\n    }).then(function () {\n      return U(b);\n    });\n  };\n  h.qc = function (a, b) {\n    var c = this;return this.i.then(function () {\n      return Gl(c, Q(c.c, kh, { email: a, password: b }));\n    }).then(function (a) {\n      return a.user;\n    });\n  };h.Kb = function (a, b) {\n    var c = this;return this.i.then(function () {\n      return Gl(c, Q(c.c, ri, { email: a, password: b }));\n    }).then(function (a) {\n      return a.user;\n    });\n  };h.oc = function (a) {\n    return this.fb(a).then(function (a) {\n      return a.user;\n    });\n  };h.fb = function (a) {\n    var b = this;return this.i.then(function () {\n      return Gl(b, a.wa(b.c));\n    });\n  };\n  h.gb = function () {\n    var a = this;return this.i.then(function () {\n      var b = U(a);return b && b.isAnonymous ? b : Gl(a, a.c.gb()).then(function (b) {\n        b = b.user;Tk(b, \"isAnonymous\", !0);return a.ka(b);\n      }).then(function () {\n        return U(a);\n      });\n    });\n  };function S(a) {\n    return a.app;\n  }function U(a) {\n    return a.currentUser;\n  }h.getUid = function () {\n    return U(this) && U(this).uid || null;\n  };function Il(a) {\n    return U(a) && U(a)._lat || null;\n  }\n  function El(a) {\n    if (a.W) {\n      for (var b = 0; b < a.m.length; b++) {\n        if (a.m[b]) a.m[b](Il(a));\n      }if (a.R !== a.getUid() && a.I.length) for (a.R = a.getUid(), b = 0; b < a.I.length; b++) {\n        if (a.I[b]) a.I[b](Il(a));\n      }\n    }\n  }h.Ib = function (a) {\n    this.addAuthTokenListener(a);this.o++;0 < this.o && U(this) && Jk(U(this));\n  };h.mc = function (a) {\n    var b = this;w(this.m, function (c) {\n      c == a && b.o--;\n    });0 > this.o && (this.o = 0);0 == this.o && U(this) && Kk(U(this));this.removeAuthTokenListener(a);\n  };\n  h.addAuthTokenListener = function (a) {\n    var b = this;this.m.push(a);T(this, this.i.then(function () {\n      b.l || Ha(b.m, a) && a(Il(b));\n    }));\n  };h.removeAuthTokenListener = function (a) {\n    Ja(this.m, function (b) {\n      return b == a;\n    });\n  };function Hl(a, b) {\n    a.I.push(b);T(a, a.i.then(function () {\n      !a.l && Ha(a.I, b) && a.R !== a.getUid() && (a.R = a.getUid(), b(Il(a)));\n    }));\n  }h.delete = function () {\n    this.l = !0;for (var a = 0; a < this.N.length; a++) {\n      this.N[a].cancel(\"app-deleted\");\n    }this.N = [];this.h && (a = this.h, xj(a.b, a.a, this.ha));this.a && this.a.unsubscribe(this);return firebase.Promise.resolve();\n  };\n  function T(a, b) {\n    a.N.push(b);Qb(b, function () {\n      Ia(a.N, b);\n    });return b;\n  }h.Nb = function (a) {\n    return T(this, Th(this.c, a));\n  };h.Bc = function (a) {\n    return this.Ia(a).then(function (a) {\n      return a.data.email;\n    });\n  };h.Ta = function (a, b) {\n    return T(this, this.c.Ta(a, b).then(function () {}));\n  };h.Ia = function (a) {\n    return T(this, this.c.Ia(a).then(function (a) {\n      return new lg(a);\n    }));\n  };h.Sa = function (a) {\n    return T(this, this.c.Sa(a).then(function () {}));\n  };\n  h.cb = function (a, b) {\n    var c = this;return T(this, A().then(function () {\n      return \"undefined\" === typeof b || Sa(b) ? {} : Fg(new wg(b));\n    }).then(function (b) {\n      return c.c.cb(a, b);\n    }).then(function () {}));\n  };h.rc = function (a, b) {\n    return T(this, ok(this, a, b, r(this.fb, this)));\n  };function Jl(a, b, c, d) {\n    a: {\n      c = Array.prototype.slice.call(c);var e = 0;for (var f = !1, g = 0; g < b.length; g++) {\n        if (b[g].optional) f = !0;else {\n          if (f) throw new N(\"internal-error\", \"Argument validator encountered a required argument after an optional argument.\");e++;\n        }\n      }f = b.length;if (c.length < e || f < c.length) d = \"Expected \" + (e == f ? 1 == e ? \"1 argument\" : e + \" arguments\" : e + \"-\" + f + \" arguments\") + \" but got \" + c.length + \".\";else {\n        for (e = 0; e < c.length; e++) {\n          if (f = b[e].optional && void 0 === c[e], !b[e].M(c[e]) && !f) {\n            b = b[e];if (0 > e || e >= Kl.length) throw new N(\"internal-error\", \"Argument validator received an unsupported number of arguments.\");c = Kl[e];d = (d ? \"\" : c + \" argument \") + (b.name ? '\"' + b.name + '\" ' : \"\") + \"must be \" + b.K + \".\";break a;\n          }\n        }d = null;\n      }\n    }if (d) throw new N(\"argument-error\", a + \" failed: \" + d);\n  }var Kl = \"First Second Third Fourth Fifth Sixth Seventh Eighth Ninth\".split(\" \");function V(a, b) {\n    return { name: a || \"\", K: \"a valid string\", optional: !!b, M: m };\n  }function Ll() {\n    return { name: \"opt_forceRefresh\", K: \"a boolean\", optional: !0, M: ba };\n  }\n  function W(a, b) {\n    return { name: a || \"\", K: \"a valid object\", optional: !!b, M: q };\n  }function Ml(a, b) {\n    return { name: a || \"\", K: \"a function\", optional: !!b, M: p };\n  }function Nl(a, b) {\n    return { name: a || \"\", K: \"null\", optional: !!b, M: ea };\n  }function Ol() {\n    return { name: \"\", K: \"an HTML element\", optional: !1, M: function M(a) {\n        return !!(a && a instanceof Element);\n      } };\n  }function Pl() {\n    return { name: \"auth\", K: \"an instance of Firebase Auth\", optional: !0, M: function M(a) {\n        return !!(a && a instanceof ul);\n      } };\n  }\n  function Ql() {\n    return { name: \"app\", K: \"an instance of Firebase App\", optional: !0, M: function M(a) {\n        return !!(a && a instanceof firebase.app.App);\n      } };\n  }function Rl(a) {\n    return { name: a ? a + \"Credential\" : \"credential\", K: a ? \"a valid \" + a + \" credential\" : \"a valid credential\", optional: !1, M: function M(b) {\n        if (!b) return !1;var c = !a || b.providerId === a;return !(!b.wa || !c);\n      } };\n  }\n  function Sl() {\n    return { name: \"authProvider\", K: \"a valid Auth provider\", optional: !1, M: function M(a) {\n        return !!(a && a.providerId && a.hasOwnProperty && a.hasOwnProperty(\"isOAuthProvider\"));\n      } };\n  }function Tl() {\n    return { name: \"applicationVerifier\", K: \"an implementation of firebase.auth.ApplicationVerifier\", optional: !1, M: function M(a) {\n        return !!(a && m(a.type) && p(a.verify));\n      } };\n  }function X(a, b, c, d) {\n    return { name: c || \"\", K: a.K + \" or \" + b.K, optional: !!d, M: function M(c) {\n        return a.M(c) || b.M(c);\n      } };\n  };function Ul(a, b, c, d, e, f) {\n    M(this, \"type\", \"recaptcha\");this.b = this.c = null;this.m = !1;this.l = b;this.a = c || { theme: \"light\", type: \"image\" };this.g = [];if (this.a[Vl]) throw new N(\"argument-error\", \"sitekey should not be provided for reCAPTCHA as one is automatically provisioned for the current project.\");this.h = \"invisible\" === this.a[Wl];if (!wc(b) || !this.h && wc(b).hasChildNodes()) throw new N(\"argument-error\", \"reCAPTCHA container is either not found or already contains inner elements!\");this.u = new Ch(a, f || null, e || null);\n    this.o = d || function () {\n      return null;\n    };var g = this;this.i = [];var l = this.a[Xl];this.a[Xl] = function (a) {\n      Yl(g, a);if (\"function\" === typeof l) l(a);else if (\"string\" === typeof l) {\n        var b = L(l, k);\"function\" === typeof b && b(a);\n      }\n    };var n = this.a[Zl];this.a[Zl] = function () {\n      Yl(g, null);if (\"function\" === typeof n) n();else if (\"string\" === typeof n) {\n        var a = L(n, k);\"function\" === typeof a && a();\n      }\n    };\n  }var Xl = \"callback\",\n      Zl = \"expired-callback\",\n      Vl = \"sitekey\",\n      Wl = \"size\";function Yl(a, b) {\n    for (var c = 0; c < a.i.length; c++) {\n      try {\n        a.i[c](b);\n      } catch (d) {}\n    }\n  }\n  function $l(a, b) {\n    Ja(a.i, function (a) {\n      return a == b;\n    });\n  }function am(a, b) {\n    a.g.push(b);Qb(b, function () {\n      Ia(a.g, b);\n    });return b;\n  }h = Ul.prototype;\n  h.xa = function () {\n    var a = this;return this.c ? this.c : this.c = am(this, A().then(function () {\n      if (Sf()) return Hf();throw new N(\"operation-not-supported-in-this-environment\", \"RecaptchaVerifier is only supported in a browser HTTP/HTTPS environment.\");\n    }).then(function () {\n      return bm(cm(), a.o());\n    }).then(function () {\n      return Q(a.u, ui, {});\n    }).then(function (b) {\n      a.a[Vl] = b.recaptchaSiteKey;\n    }).s(function (b) {\n      a.c = null;throw b;\n    }));\n  };\n  h.render = function () {\n    dm(this);var a = this;return am(this, this.xa().then(function () {\n      if (null === a.b) {\n        var b = a.l;if (!a.h) {\n          var c = wc(b);b = zc(\"DIV\");c.appendChild(b);\n        }a.b = grecaptcha.render(b, a.a);\n      }return a.b;\n    }));\n  };h.verify = function () {\n    dm(this);var a = this;return am(this, this.render().then(function (b) {\n      return new z(function (c) {\n        var d = grecaptcha.getResponse(b);if (d) c(d);else {\n          var e = function e(b) {\n            b && ($l(a, e), c(b));\n          };a.i.push(e);a.h && grecaptcha.execute(a.b);\n        }\n      });\n    }));\n  };h.reset = function () {\n    dm(this);null !== this.b && grecaptcha.reset(this.b);\n  };\n  function dm(a) {\n    if (a.m) throw new N(\"internal-error\", \"RecaptchaVerifier instance has been destroyed.\");\n  }h.clear = function () {\n    dm(this);this.m = !0;cm().b--;for (var a = 0; a < this.g.length; a++) {\n      this.g[a].cancel(\"RecaptchaVerifier instance has been destroyed.\");\n    }if (!this.h) {\n      a = wc(this.l);for (var b; b = a.firstChild;) {\n        a.removeChild(b);\n      }\n    }\n  };var em = dc(\"https://www.google.com/recaptcha/api.js?onload=%{onload}&render=explicit&hl=%{hl}\");\n  function fm() {\n    this.b = k.grecaptcha ? Infinity : 0;this.c = null;this.a = \"__rcb\" + Math.floor(1E6 * Math.random()).toString();\n  }\n  function bm(a, b) {\n    return new z(function (c, d) {\n      if (Zf()) {\n        if (!k.grecaptcha || b !== a.c && !a.b) {\n          k[a.a] = function () {\n            if (k.grecaptcha) {\n              a.c = b;var e = k.grecaptcha.render;k.grecaptcha.render = function (b, c) {\n                b = e(b, c);a.b++;return b;\n              };c();\n            } else d(new N(\"internal-error\"));delete k[a.a];\n          };var e = hc(em, { onload: a.a, hl: b || \"\" });A(kf(e)).s(function () {\n            d(new N(\"internal-error\", \"Unable to load external reCAPTCHA dependencies!\"));\n          });\n        } else c();\n      } else d(new N(\"network-request-failed\"));\n    });\n  }var gm = null;\n  function cm() {\n    gm || (gm = new fm());return gm;\n  }function hm(a, b, c) {\n    try {\n      this.f = c || firebase.app();\n    } catch (f) {\n      throw new N(\"argument-error\", \"No firebase.app.App instance is currently initialized.\");\n    }if (this.f.options && this.f.options.apiKey) c = this.f.options.apiKey;else throw new N(\"invalid-api-key\");var d = this,\n        e = null;try {\n      e = this.f.auth().Ka();\n    } catch (f) {}e = firebase.SDK_VERSION ? Of(firebase.SDK_VERSION, e) : null;Ul.call(this, c, a, b, function () {\n      try {\n        var a = d.f.auth().$();\n      } catch (g) {\n        a = null;\n      }return a;\n    }, e, xi(yi));\n  }t(hm, Ul);function Y(a, b) {\n    for (var c in b) {\n      var d = b[c].name;a[d] = im(d, a[c], b[c].j);\n    }\n  }function Z(a, b, c, d) {\n    a[b] = im(b, c, d);\n  }function im(a, b, c) {\n    function d() {\n      var a = Array.prototype.slice.call(arguments);Jl(e, c, a);return b.apply(this, a);\n    }if (!c) return b;var e = jm(a),\n        f;for (f in b) {\n      d[f] = b[f];\n    }for (f in b.prototype) {\n      d.prototype[f] = b.prototype[f];\n    }return d;\n  }function jm(a) {\n    a = a.split(\".\");return a[a.length - 1];\n  };Y(ul.prototype, { Sa: { name: \"applyActionCode\", j: [V(\"code\")] }, Ia: { name: \"checkActionCode\", j: [V(\"code\")] }, Ta: { name: \"confirmPasswordReset\", j: [V(\"code\"), V(\"newPassword\")] }, Kb: { name: \"createUserWithEmailAndPassword\", j: [V(\"email\"), V(\"password\")] }, Nb: { name: \"fetchProvidersForEmail\", j: [V(\"email\")] }, aa: { name: \"getRedirectResult\", j: [] }, dc: { name: \"onAuthStateChanged\", j: [X(W(), Ml(), \"nextOrObserver\"), Ml(\"opt_error\", !0), Ml(\"opt_completed\", !0)] }, ec: { name: \"onIdTokenChanged\", j: [X(W(), Ml(), \"nextOrObserver\"), Ml(\"opt_error\", !0), Ml(\"opt_completed\", !0)] }, cb: { name: \"sendPasswordResetEmail\", j: [V(\"email\"), X(W(\"opt_actionCodeSettings\", !0), Nl(null, !0), \"opt_actionCodeSettings\", !0)] }, eb: { name: \"setPersistence\", j: [V(\"persistence\")] }, fb: { name: \"signInAndRetrieveDataWithCredential\", j: [Rl()] }, gb: { name: \"signInAnonymously\", j: [] }, oc: { name: \"signInWithCredential\", j: [Rl()] }, pc: { name: \"signInWithCustomToken\", j: [V(\"token\")] }, qc: { name: \"signInWithEmailAndPassword\", j: [V(\"email\"), V(\"password\")] }, rc: { name: \"signInWithPhoneNumber\", j: [V(\"phoneNumber\"), Tl()] }, sc: { name: \"signInWithPopup\", j: [Sl()] }, tc: { name: \"signInWithRedirect\", j: [Sl()] }, hb: { name: \"signOut\", j: [] }, toJSON: { name: \"toJSON\", j: [V(null, !0)] }, Ac: { name: \"useDeviceLanguage\", j: [] }, Bc: { name: \"verifyPasswordResetCode\", j: [V(\"code\")] } });(function (a, b) {\n    for (var c in b) {\n      var d = b[c].name;if (d !== c) {\n        var e = b[c].Jb;Object.defineProperty(a, d, { get: function get() {\n            return this[c];\n          }, set: function set(a) {\n            Jl(d, [e], [a], !0);this[c] = a;\n          }, enumerable: !0 });\n      }\n    }\n  })(ul.prototype, { lc: { name: \"languageCode\", Jb: X(V(), Nl(), \"languageCode\") } });\n  ul.Persistence = nj;ul.Persistence.LOCAL = \"local\";ul.Persistence.SESSION = \"session\";ul.Persistence.NONE = \"none\";\n  Y(Bk.prototype, { \"delete\": { name: \"delete\", j: [] }, F: { name: \"getIdToken\", j: [Ll()] }, getToken: { name: \"getToken\", j: [Ll()] }, Xa: { name: \"linkAndRetrieveDataWithCredential\", j: [Rl()] }, Zb: { name: \"linkWithCredential\", j: [Rl()] }, $b: { name: \"linkWithPhoneNumber\", j: [V(\"phoneNumber\"), Tl()] }, ac: { name: \"linkWithPopup\", j: [Sl()] }, bc: { name: \"linkWithRedirect\", j: [Sl()] }, Za: { name: \"reauthenticateAndRetrieveDataWithCredential\", j: [Rl()] }, hc: { name: \"reauthenticateWithCredential\", j: [Rl()] }, ic: { name: \"reauthenticateWithPhoneNumber\", j: [V(\"phoneNumber\"), Tl()] }, jc: { name: \"reauthenticateWithPopup\", j: [Sl()] }, kc: { name: \"reauthenticateWithRedirect\", j: [Sl()] }, reload: { name: \"reload\", j: [] }, bb: { name: \"sendEmailVerification\", j: [X(W(\"opt_actionCodeSettings\", !0), Nl(null, !0), \"opt_actionCodeSettings\", !0)] }, toJSON: { name: \"toJSON\", j: [V(null, !0)] }, yc: { name: \"unlink\", j: [V(\"provider\")] }, kb: { name: \"updateEmail\", j: [V(\"email\")] }, lb: { name: \"updatePassword\", j: [V(\"password\")] }, zc: { name: \"updatePhoneNumber\", j: [Rl(\"phone\")] }, mb: { name: \"updateProfile\", j: [W(\"profile\")] } });\n  Y(z.prototype, { s: { name: \"catch\" }, then: { name: \"then\" } });Y(nk.prototype, { confirm: { name: \"confirm\", j: [V(\"verificationCode\")] } });Z(mh, \"credential\", function (a, b) {\n    return new jh(a, b);\n  }, [V(\"email\"), V(\"password\")]);Y(bh.prototype, { sa: { name: \"addScope\", j: [V(\"scope\")] }, Ba: { name: \"setCustomParameters\", j: [W(\"customOAuthParameters\")] } });Z(bh, \"credential\", ch, [X(V(), W(), \"token\")]);Y(dh.prototype, { sa: { name: \"addScope\", j: [V(\"scope\")] }, Ba: { name: \"setCustomParameters\", j: [W(\"customOAuthParameters\")] } });\n  Z(dh, \"credential\", eh, [X(V(), W(), \"token\")]);Y(fh.prototype, { sa: { name: \"addScope\", j: [V(\"scope\")] }, Ba: { name: \"setCustomParameters\", j: [W(\"customOAuthParameters\")] } });Z(fh, \"credential\", gh, [X(V(), X(W(), Nl()), \"idToken\"), X(V(), Nl(), \"accessToken\", !0)]);Y(hh.prototype, { Ba: { name: \"setCustomParameters\", j: [W(\"customOAuthParameters\")] } });Z(hh, \"credential\", ih, [X(V(), W(), \"token\"), V(\"secret\", !0)]);\n  Y(P.prototype, { sa: { name: \"addScope\", j: [V(\"scope\")] }, credential: { name: \"credential\", j: [X(V(), Nl(), \"idToken\", !0), X(V(), Nl(), \"accessToken\", !0)] }, Ba: { name: \"setCustomParameters\", j: [W(\"customOAuthParameters\")] } });Z(rh, \"credential\", th, [V(\"verificationId\"), V(\"verificationCode\")]);Y(rh.prototype, { Qa: { name: \"verifyPhoneNumber\", j: [V(\"phoneNumber\"), Tl()] } });Y(N.prototype, { toJSON: { name: \"toJSON\", j: [V(null, !0)] } });Y(zh.prototype, { toJSON: { name: \"toJSON\", j: [V(null, !0)] } });\n  Y(yh.prototype, { toJSON: { name: \"toJSON\", j: [V(null, !0)] } });Y(hm.prototype, { clear: { name: \"clear\", j: [] }, render: { name: \"render\", j: [] }, verify: { name: \"verify\", j: [] } });\n  (function () {\n    if (\"undefined\" !== typeof firebase && firebase.INTERNAL && firebase.INTERNAL.registerService) {\n      var a = { Auth: ul, Error: N };Z(a, \"EmailAuthProvider\", mh, []);Z(a, \"FacebookAuthProvider\", bh, []);Z(a, \"GithubAuthProvider\", dh, []);Z(a, \"GoogleAuthProvider\", fh, []);Z(a, \"TwitterAuthProvider\", hh, []);Z(a, \"OAuthProvider\", P, [V(\"providerId\")]);Z(a, \"PhoneAuthProvider\", rh, [Pl()]);Z(a, \"RecaptchaVerifier\", hm, [X(V(), Ol(), \"recaptchaContainer\"), W(\"recaptchaParameters\", !0), Ql()]);firebase.INTERNAL.registerService(\"auth\", function (a, c) {\n        a = new ul(a);c({ INTERNAL: { getUid: r(a.getUid, a), getToken: r(a.Rb, a), addAuthTokenListener: r(a.Ib, a), removeAuthTokenListener: r(a.mc, a) } });return a;\n      }, a, function (a, c) {\n        if (\"create\" === a) try {\n          c.auth();\n        } catch (d) {}\n      });firebase.INTERNAL.extendNamespace({ User: Bk });\n    } else throw Error(\"Cannot find the firebase namespace; be sure to include firebase-app.js before this library.\");\n  })();\n}).call(typeof global !== 'undefined' ? global : typeof self !== 'undefined' ? self : typeof window !== 'undefined' ? window : {});\n/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(17)))\n\n/***/ }),\n/* 193 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.WithPollState = undefined;\n\nvar _createClass = function () { function 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, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }();\n\nvar _pureComponents = __webpack_require__(33);\n\nvar _firebase = __webpack_require__(78);\n\nvar _pollUtils = __webpack_require__(194);\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction _possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return call && (typeof call === \"object\" || typeof call === \"function\") ? call : self; }\n\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function, not \" + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; }\n/** @jsx h */\n\nvar WithPollState = exports.WithPollState = function (_PureComponent) {\n  _inherits(WithPollState, _PureComponent);\n\n  function WithPollState() {\n    var _ref;\n\n    var _temp, _this, _ret;\n\n    _classCallCheck(this, WithPollState);\n\n    for (var _len = arguments.length, args = Array(_len), _key = 0; _key < _len; _key++) {\n      args[_key] = arguments[_key];\n    }\n\n    return _ret = (_temp = (_this = _possibleConstructorReturn(this, (_ref = WithPollState.__proto__ || Object.getPrototypeOf(WithPollState)).call.apply(_ref, [this].concat(args))), _this), _this.state = {\n      loading: false,\n      poll: undefined,\n      error: null\n    }, _temp), _possibleConstructorReturn(_this, _ret);\n  }\n\n  _createClass(WithPollState, [{\n    key: 'componentDidMount',\n    value: function componentDidMount() {\n      this.subscribeToPollChanges(this.props.clientId);\n    }\n  }, {\n    key: 'subscribeToPollChanges',\n    value: function subscribeToPollChanges(clientId) {\n      var _this2 = this;\n\n      var authConfig = this.props.authConfig;\n\n      try {\n        (0, _firebase.getFirebaseInstance)(authConfig).database().ref('/channels/' + clientId + '/interactions').on('value', function (snapshot) {\n          var firebaseInteractions = snapshot.val() || [];\n          var firebaseActivePolls = (0, _pollUtils.extractActivePolls)(firebaseInteractions);\n          if (!firebaseActivePolls.length) {\n            _this2.setState({ error: null, poll: undefined, loading: false });\n            return;\n          }\n          // If there are more than one active poll, pick the first one\n          var currentPoll = firebaseActivePolls[0];\n          _this2.setState({\n            poll: (0, _pollUtils.preparePoll)(currentPoll),\n            error: null,\n            loading: false\n          });\n        });\n      } catch (err) {\n        var errorMessage = 'Unable to find active polls for client ' + clientId;\n        console.error(errorMessage);\n        this.setState({ error: new Error(errorMessage) });\n      }\n    }\n  }, {\n    key: 'render',\n    value: function render() {\n      var _state = this.state,\n          poll = _state.poll,\n          error = _state.error,\n          loading = _state.loading;\n\n      return this.props.render({ poll: poll, error: error, loading: loading });\n    }\n  }]);\n\n  return WithPollState;\n}(_pureComponents.PureComponent);\n\n/***/ }),\n/* 194 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.extractActivePolls = extractActivePolls;\nexports.preparePoll = preparePoll;\nfunction extractActivePolls(interactions) {\n  return (interactions.list || []).reduce(function (acc, pollId) {\n    // Need to this because flow complains that it does not support \"non-string\" literals as keys\n    var interaction = interactions['' + pollId];\n    if (interaction.status === 'ACTIVE') {\n      interaction.id = pollId;\n      acc.push(interaction);\n    }\n    return acc;\n  }, []);\n}\n\nfunction preparePoll(poll) {\n  return {\n    id: poll.id,\n    title: poll.title,\n    alternatives: poll.alternatives\n  };\n}\n\n/***/ }),\n/* 195 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.WithResultState = undefined;\n\nvar _extends = Object.assign || function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; };\n\nvar _createClass = function () { function 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, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }();\n\nvar _pureComponents = __webpack_require__(33);\n\nvar _prepareResult = __webpack_require__(196);\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction _possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return call && (typeof call === \"object\" || typeof call === \"function\") ? call : self; }\n\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function, not \" + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; }\n/** @jsx h */\n\n\nvar WithResultState = exports.WithResultState = function (_PureComponent) {\n  _inherits(WithResultState, _PureComponent);\n\n  function WithResultState(props) {\n    _classCallCheck(this, WithResultState);\n\n    var _this = _possibleConstructorReturn(this, (WithResultState.__proto__ || Object.getPrototypeOf(WithResultState)).call(this, props));\n\n    _initialiseProps.call(_this);\n\n    _this.state = _extends({}, _this.getStateBasedOnProps(props));\n    return _this;\n  }\n\n  _createClass(WithResultState, [{\n    key: 'componentWillReceiveProps',\n    value: function componentWillReceiveProps(nextProps) {\n      this.setState(_extends({}, this.getStateBasedOnProps(nextProps)));\n    }\n  }, {\n    key: 'render',\n    value: function render() {\n      return this.props.render(_extends({}, this.state));\n    }\n  }]);\n\n  return WithResultState;\n}(_pureComponents.PureComponent);\n\nvar _initialiseProps = function _initialiseProps() {\n  var _this2 = this;\n\n  this.getStateBasedOnProps = function (props) {\n    try {\n      var _clientId = props.clientId,\n          _poll = props.poll;\n\n      // Prevent race conditions / setting result for previous poll\n\n      if (_clientId !== _this2.props.clientId || _poll.id !== _this2.props.poll.id) {\n        return {};\n      }\n\n      return {\n        result: (0, _prepareResult.prepareResult)(_poll),\n        error: null,\n        lastUpdatedTime: new Date()\n      };\n    } catch (error) {\n      return { error: error };\n    }\n  };\n};\n\n/***/ }),\n/* 196 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\n\nvar _extends = Object.assign || function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; };\n\nexports.prepareResult = prepareResult;\nfunction prepareResult(poll) {\n  var votes = 0;\n  var items = poll.alternatives.list.map(function (id) {\n    votes += poll.alternatives[id].votes;\n    return _extends({ id: id }, poll.alternatives[id]);\n  });\n  return {\n    alternatives: poll.alternatives,\n    items: items,\n    votes: votes\n  };\n}\n\n/***/ }),\n/* 197 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.AriaLive = undefined;\n\nvar _createClass = function () { function 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, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }();\n\nvar _preact = __webpack_require__(1);\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction _possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return call && (typeof call === \"object\" || typeof call === \"function\") ? call : self; }\n\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function, not \" + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; }\n/** @jsx h */\n\nvar AriaLive = exports.AriaLive = function (_Component) {\n  _inherits(AriaLive, _Component);\n\n  function AriaLive() {\n    _classCallCheck(this, AriaLive);\n\n    return _possibleConstructorReturn(this, (AriaLive.__proto__ || Object.getPrototypeOf(AriaLive)).apply(this, arguments));\n  }\n\n  _createClass(AriaLive, [{\n    key: 'render',\n    value: function render() {\n      return (0, _preact.h)(\n        'div',\n        { id: 'ariaLive', className: 'nrk-sr', 'aria-live': this.props.type },\n        this.props.children\n      );\n    }\n  }]);\n\n  return AriaLive;\n}(_preact.Component);\n\n/***/ }),\n/* 198 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nexports.alternativeIdToAlternativeText = alternativeIdToAlternativeText;\nexports.getAlternativeFromId = getAlternativeFromId;\nexports.getAlternativesFromPoll = getAlternativesFromPoll;\nfunction alternativeIdToAlternativeText(id, alternatives) {\n  var alternative = getAlternativeFromId(id, getAlternativesFromPoll(alternatives));\n  return getTextFromAlternative(alternative);\n}\n\nfunction getAlternativeFromId(id, alternatives) {\n  return alternatives.find(function (alternative) {\n    return alternative.id === id;\n  });\n}\n\nfunction getTextFromAlternative(alternative) {\n  if (!alternative) {\n    return 'ukjent';\n  }\n  return alternative.text;\n}\n\nfunction getAlternativesFromPoll(poll) {\n  return poll.list.reduce(function (acc, alternativeId) {\n    acc.push(poll[alternativeId]);\n    return acc;\n  }, []);\n}\n\n/***/ }),\n/* 199 */\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\nfunction debounce(func, wait, immediate) {\n  var timeout = void 0;\n\n  return function () {\n    var context = this;\n    var args = arguments;\n\n    var later = function later() {\n      timeout = null;\n      if (!immediate) func.apply(context, args);\n    };\n    var callNow = immediate && !timeout;\n    clearTimeout(timeout);\n    timeout = setTimeout(later, wait);\n    if (callNow) func.apply(context, args);\n  };\n}\n\nexports.debounce = debounce;\n\n/***/ })\n/******/ ]);\n\n\n// WEBPACK FOOTER //\n// livepoll-c7d620350a9b1b48aff5.js"," \t// The module cache\n \tvar installedModules = {};\n\n \t// The require function\n \tfunction __webpack_require__(moduleId) {\n\n \t\t// Check if module is in cache\n \t\tif(installedModules[moduleId]) {\n \t\t\treturn installedModules[moduleId].exports;\n \t\t}\n \t\t// Create a new module (and put it into the cache)\n \t\tvar module = installedModules[moduleId] = {\n \t\t\ti: moduleId,\n \t\t\tl: false,\n \t\t\texports: {}\n \t\t};\n\n \t\t// Execute the module function\n \t\tmodules[moduleId].call(module.exports, module, module.exports, __webpack_require__);\n\n \t\t// Flag the module as loaded\n \t\tmodule.l = true;\n\n \t\t// Return the exports of the module\n \t\treturn module.exports;\n \t}\n\n\n \t// expose the modules object (__webpack_modules__)\n \t__webpack_require__.m = modules;\n\n \t// expose the module cache\n \t__webpack_require__.c = installedModules;\n\n \t// define getter function for harmony exports\n \t__webpack_require__.d = function(exports, name, getter) {\n \t\tif(!__webpack_require__.o(exports, name)) {\n \t\t\tObject.defineProperty(exports, name, {\n \t\t\t\tconfigurable: false,\n \t\t\t\tenumerable: true,\n \t\t\t\tget: getter\n \t\t\t});\n \t\t}\n \t};\n\n \t// getDefaultExport function for compatibility with non-harmony modules\n \t__webpack_require__.n = function(module) {\n \t\tvar getter = module && module.__esModule ?\n \t\t\tfunction getDefault() { return module['default']; } :\n \t\t\tfunction getModuleExports() { return module; };\n \t\t__webpack_require__.d(getter, 'a', getter);\n \t\treturn getter;\n \t};\n\n \t// Object.prototype.hasOwnProperty.call\n \t__webpack_require__.o = function(object, property) { return Object.prototype.hasOwnProperty.call(object, property); };\n\n \t// __webpack_public_path__\n \t__webpack_require__.p = \"https://static.nrk.no/dh/dh-stemning-widgets/static/\";\n\n \t// Load entry module and return exports\n \treturn __webpack_require__(__webpack_require__.s = 108);\n\n\n\n// WEBPACK FOOTER //\n// webpack/bootstrap 5cf8666b8fbd1b7d86c1","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nfunction __export(m) {\n    for (var p in m) if (!exports.hasOwnProperty(p)) exports[p] = m[p];\n}\nObject.defineProperty(exports, \"__esModule\", { value: true });\n__export(require(\"./src/assert\"));\n__export(require(\"./src/crypt\"));\n__export(require(\"./src/constants\"));\n__export(require(\"./src/deepCopy\"));\n__export(require(\"./src/deferred\"));\n__export(require(\"./src/environment\"));\n__export(require(\"./src/errors\"));\n__export(require(\"./src/json\"));\n__export(require(\"./src/jwt\"));\n__export(require(\"./src/obj\"));\n__export(require(\"./src/query\"));\n__export(require(\"./src/sha1\"));\n__export(require(\"./src/subscribe\"));\n__export(require(\"./src/validation\"));\n__export(require(\"./src/utf8\"));\n\n//# sourceMappingURL=index.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/util/dist/cjs/index.js","/** Virtual DOM Node */\nfunction VNode() {}\n\n/** Global options\n *\t@public\n *\t@namespace options {Object}\n */\nvar options = {\n\n\t/** If `true`, `prop` changes trigger synchronous component updates.\n  *\t@name syncComponentUpdates\n  *\t@type Boolean\n  *\t@default true\n  */\n\t//syncComponentUpdates: true,\n\n\t/** Processes all created VNodes.\n  *\t@param {VNode} vnode\tA newly-created VNode to normalize/process\n  */\n\t//vnode(vnode) { }\n\n\t/** Hook invoked after a component is mounted. */\n\t// afterMount(component) { }\n\n\t/** Hook invoked after the DOM is updated with a component's latest render. */\n\t// afterUpdate(component) { }\n\n\t/** Hook invoked immediately before a component is unmounted. */\n\t// beforeUnmount(component) { }\n};\n\nvar stack = [];\n\nvar EMPTY_CHILDREN = [];\n\n/** JSX/hyperscript reviver\n*\tBenchmarks: https://esbench.com/bench/57ee8f8e330ab09900a1a1a0\n *\t@see http://jasonformat.com/wtf-is-jsx\n *\t@public\n */\nfunction h(nodeName, attributes) {\n\tvar children = EMPTY_CHILDREN,\n\t    lastSimple,\n\t    child,\n\t    simple,\n\t    i;\n\tfor (i = arguments.length; i-- > 2;) {\n\t\tstack.push(arguments[i]);\n\t}\n\tif (attributes && attributes.children != null) {\n\t\tif (!stack.length) stack.push(attributes.children);\n\t\tdelete attributes.children;\n\t}\n\twhile (stack.length) {\n\t\tif ((child = stack.pop()) && child.pop !== undefined) {\n\t\t\tfor (i = child.length; i--;) {\n\t\t\t\tstack.push(child[i]);\n\t\t\t}\n\t\t} else {\n\t\t\tif (typeof child === 'boolean') child = null;\n\n\t\t\tif (simple = typeof nodeName !== 'function') {\n\t\t\t\tif (child == null) child = '';else if (typeof child === 'number') child = String(child);else if (typeof child !== 'string') simple = false;\n\t\t\t}\n\n\t\t\tif (simple && lastSimple) {\n\t\t\t\tchildren[children.length - 1] += child;\n\t\t\t} else if (children === EMPTY_CHILDREN) {\n\t\t\t\tchildren = [child];\n\t\t\t} else {\n\t\t\t\tchildren.push(child);\n\t\t\t}\n\n\t\t\tlastSimple = simple;\n\t\t}\n\t}\n\n\tvar p = new VNode();\n\tp.nodeName = nodeName;\n\tp.children = children;\n\tp.attributes = attributes == null ? undefined : attributes;\n\tp.key = attributes == null ? undefined : attributes.key;\n\n\t// if a \"vnode hook\" is defined, pass every created VNode to it\n\tif (options.vnode !== undefined) options.vnode(p);\n\n\treturn p;\n}\n\n/** Copy own-properties from `props` onto `obj`.\n *\t@returns obj\n *\t@private\n */\nfunction extend(obj, props) {\n  for (var i in props) {\n    obj[i] = props[i];\n  }return obj;\n}\n\n/** Call a function asynchronously, as soon as possible.\n *\t@param {Function} callback\n */\nvar defer = typeof Promise == 'function' ? Promise.resolve().then.bind(Promise.resolve()) : setTimeout;\n\nfunction cloneElement(vnode, props) {\n\treturn h(vnode.nodeName, extend(extend({}, vnode.attributes), props), arguments.length > 2 ? [].slice.call(arguments, 2) : vnode.children);\n}\n\n// DOM properties that should NOT have \"px\" added when numeric\nvar IS_NON_DIMENSIONAL = /acit|ex(?:s|g|n|p|$)|rph|ows|mnc|ntw|ine[ch]|zoo|^ord/i;\n\n/** Managed queue of dirty components to be re-rendered */\n\nvar items = [];\n\nfunction enqueueRender(component) {\n\tif (!component._dirty && (component._dirty = true) && items.push(component) == 1) {\n\t\t(options.debounceRendering || defer)(rerender);\n\t}\n}\n\nfunction rerender() {\n\tvar p,\n\t    list = items;\n\titems = [];\n\twhile (p = list.pop()) {\n\t\tif (p._dirty) renderComponent(p);\n\t}\n}\n\n/** Check if two nodes are equivalent.\n *\t@param {Element} node\n *\t@param {VNode} vnode\n *\t@private\n */\nfunction isSameNodeType(node, vnode, hydrating) {\n\tif (typeof vnode === 'string' || typeof vnode === 'number') {\n\t\treturn node.splitText !== undefined;\n\t}\n\tif (typeof vnode.nodeName === 'string') {\n\t\treturn !node._componentConstructor && isNamedNode(node, vnode.nodeName);\n\t}\n\treturn hydrating || node._componentConstructor === vnode.nodeName;\n}\n\n/** Check if an Element has a given normalized name.\n*\t@param {Element} node\n*\t@param {String} nodeName\n */\nfunction isNamedNode(node, nodeName) {\n\treturn node.normalizedNodeName === nodeName || node.nodeName.toLowerCase() === nodeName.toLowerCase();\n}\n\n/**\n * Reconstruct Component-style `props` from a VNode.\n * Ensures default/fallback values from `defaultProps`:\n * Own-properties of `defaultProps` not present in `vnode.attributes` are added.\n * @param {VNode} vnode\n * @returns {Object} props\n */\nfunction getNodeProps(vnode) {\n\tvar props = extend({}, vnode.attributes);\n\tprops.children = vnode.children;\n\n\tvar defaultProps = vnode.nodeName.defaultProps;\n\tif (defaultProps !== undefined) {\n\t\tfor (var i in defaultProps) {\n\t\t\tif (props[i] === undefined) {\n\t\t\t\tprops[i] = defaultProps[i];\n\t\t\t}\n\t\t}\n\t}\n\n\treturn props;\n}\n\n/** Create an element with the given nodeName.\n *\t@param {String} nodeName\n *\t@param {Boolean} [isSvg=false]\tIf `true`, creates an element within the SVG namespace.\n *\t@returns {Element} node\n */\nfunction createNode(nodeName, isSvg) {\n\tvar node = isSvg ? document.createElementNS('http://www.w3.org/2000/svg', nodeName) : document.createElement(nodeName);\n\tnode.normalizedNodeName = nodeName;\n\treturn node;\n}\n\n/** Remove a child node from its parent if attached.\n *\t@param {Element} node\t\tThe node to remove\n */\nfunction removeNode(node) {\n\tvar parentNode = node.parentNode;\n\tif (parentNode) parentNode.removeChild(node);\n}\n\n/** Set a named attribute on the given Node, with special behavior for some names and event handlers.\n *\tIf `value` is `null`, the attribute/handler will be removed.\n *\t@param {Element} node\tAn element to mutate\n *\t@param {string} name\tThe name/key to set, such as an event or attribute name\n *\t@param {any} old\tThe last value that was set for this name/node pair\n *\t@param {any} value\tAn attribute value, such as a function to be used as an event handler\n *\t@param {Boolean} isSvg\tAre we currently diffing inside an svg?\n *\t@private\n */\nfunction setAccessor(node, name, old, value, isSvg) {\n\tif (name === 'className') name = 'class';\n\n\tif (name === 'key') {\n\t\t// ignore\n\t} else if (name === 'ref') {\n\t\tif (old) old(null);\n\t\tif (value) value(node);\n\t} else if (name === 'class' && !isSvg) {\n\t\tnode.className = value || '';\n\t} else if (name === 'style') {\n\t\tif (!value || typeof value === 'string' || typeof old === 'string') {\n\t\t\tnode.style.cssText = value || '';\n\t\t}\n\t\tif (value && typeof value === 'object') {\n\t\t\tif (typeof old !== 'string') {\n\t\t\t\tfor (var i in old) {\n\t\t\t\t\tif (!(i in value)) node.style[i] = '';\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (var i in value) {\n\t\t\t\tnode.style[i] = typeof value[i] === 'number' && IS_NON_DIMENSIONAL.test(i) === false ? value[i] + 'px' : value[i];\n\t\t\t}\n\t\t}\n\t} else if (name === 'dangerouslySetInnerHTML') {\n\t\tif (value) node.innerHTML = value.__html || '';\n\t} else if (name[0] == 'o' && name[1] == 'n') {\n\t\tvar useCapture = name !== (name = name.replace(/Capture$/, ''));\n\t\tname = name.toLowerCase().substring(2);\n\t\tif (value) {\n\t\t\tif (!old) node.addEventListener(name, eventProxy, useCapture);\n\t\t} else {\n\t\t\tnode.removeEventListener(name, eventProxy, useCapture);\n\t\t}\n\t\t(node._listeners || (node._listeners = {}))[name] = value;\n\t} else if (name !== 'list' && name !== 'type' && !isSvg && name in node) {\n\t\tsetProperty(node, name, value == null ? '' : value);\n\t\tif (value == null || value === false) node.removeAttribute(name);\n\t} else {\n\t\tvar ns = isSvg && name !== (name = name.replace(/^xlink\\:?/, ''));\n\t\tif (value == null || value === false) {\n\t\t\tif (ns) node.removeAttributeNS('http://www.w3.org/1999/xlink', name.toLowerCase());else node.removeAttribute(name);\n\t\t} else if (typeof value !== 'function') {\n\t\t\tif (ns) node.setAttributeNS('http://www.w3.org/1999/xlink', name.toLowerCase(), value);else node.setAttribute(name, value);\n\t\t}\n\t}\n}\n\n/** Attempt to set a DOM property to the given value.\n *\tIE & FF throw for certain property-value combinations.\n */\nfunction setProperty(node, name, value) {\n\ttry {\n\t\tnode[name] = value;\n\t} catch (e) {}\n}\n\n/** Proxy an event to hooked event handlers\n *\t@private\n */\nfunction eventProxy(e) {\n\treturn this._listeners[e.type](options.event && options.event(e) || e);\n}\n\n/** Queue of components that have been mounted and are awaiting componentDidMount */\nvar mounts = [];\n\n/** Diff recursion count, used to track the end of the diff cycle. */\nvar diffLevel = 0;\n\n/** Global flag indicating if the diff is currently within an SVG */\nvar isSvgMode = false;\n\n/** Global flag indicating if the diff is performing hydration */\nvar hydrating = false;\n\n/** Invoke queued componentDidMount lifecycle methods */\nfunction flushMounts() {\n\tvar c;\n\twhile (c = mounts.pop()) {\n\t\tif (options.afterMount) options.afterMount(c);\n\t\tif (c.componentDidMount) c.componentDidMount();\n\t}\n}\n\n/** Apply differences in a given vnode (and it's deep children) to a real DOM Node.\n *\t@param {Element} [dom=null]\t\tA DOM node to mutate into the shape of the `vnode`\n *\t@param {VNode} vnode\t\t\tA VNode (with descendants forming a tree) representing the desired DOM structure\n *\t@returns {Element} dom\t\t\tThe created/mutated element\n *\t@private\n */\nfunction diff(dom, vnode, context, mountAll, parent, componentRoot) {\n\t// diffLevel having been 0 here indicates initial entry into the diff (not a subdiff)\n\tif (!diffLevel++) {\n\t\t// when first starting the diff, check if we're diffing an SVG or within an SVG\n\t\tisSvgMode = parent != null && parent.ownerSVGElement !== undefined;\n\n\t\t// hydration is indicated by the existing element to be diffed not having a prop cache\n\t\thydrating = dom != null && !('__preactattr_' in dom);\n\t}\n\n\tvar ret = idiff(dom, vnode, context, mountAll, componentRoot);\n\n\t// append the element if its a new parent\n\tif (parent && ret.parentNode !== parent) parent.appendChild(ret);\n\n\t// diffLevel being reduced to 0 means we're exiting the diff\n\tif (! --diffLevel) {\n\t\thydrating = false;\n\t\t// invoke queued componentDidMount lifecycle methods\n\t\tif (!componentRoot) flushMounts();\n\t}\n\n\treturn ret;\n}\n\n/** Internals of `diff()`, separated to allow bypassing diffLevel / mount flushing. */\nfunction idiff(dom, vnode, context, mountAll, componentRoot) {\n\tvar out = dom,\n\t    prevSvgMode = isSvgMode;\n\n\t// empty values (null, undefined, booleans) render as empty Text nodes\n\tif (vnode == null || typeof vnode === 'boolean') vnode = '';\n\n\t// Fast case: Strings & Numbers create/update Text nodes.\n\tif (typeof vnode === 'string' || typeof vnode === 'number') {\n\n\t\t// update if it's already a Text node:\n\t\tif (dom && dom.splitText !== undefined && dom.parentNode && (!dom._component || componentRoot)) {\n\t\t\t/* istanbul ignore if */ /* Browser quirk that can't be covered: https://github.com/developit/preact/commit/fd4f21f5c45dfd75151bd27b4c217d8003aa5eb9 */\n\t\t\tif (dom.nodeValue != vnode) {\n\t\t\t\tdom.nodeValue = vnode;\n\t\t\t}\n\t\t} else {\n\t\t\t// it wasn't a Text node: replace it with one and recycle the old Element\n\t\t\tout = document.createTextNode(vnode);\n\t\t\tif (dom) {\n\t\t\t\tif (dom.parentNode) dom.parentNode.replaceChild(out, dom);\n\t\t\t\trecollectNodeTree(dom, true);\n\t\t\t}\n\t\t}\n\n\t\tout['__preactattr_'] = true;\n\n\t\treturn out;\n\t}\n\n\t// If the VNode represents a Component, perform a component diff:\n\tvar vnodeName = vnode.nodeName;\n\tif (typeof vnodeName === 'function') {\n\t\treturn buildComponentFromVNode(dom, vnode, context, mountAll);\n\t}\n\n\t// Tracks entering and exiting SVG namespace when descending through the tree.\n\tisSvgMode = vnodeName === 'svg' ? true : vnodeName === 'foreignObject' ? false : isSvgMode;\n\n\t// If there's no existing element or it's the wrong type, create a new one:\n\tvnodeName = String(vnodeName);\n\tif (!dom || !isNamedNode(dom, vnodeName)) {\n\t\tout = createNode(vnodeName, isSvgMode);\n\n\t\tif (dom) {\n\t\t\t// move children into the replacement node\n\t\t\twhile (dom.firstChild) {\n\t\t\t\tout.appendChild(dom.firstChild);\n\t\t\t} // if the previous Element was mounted into the DOM, replace it inline\n\t\t\tif (dom.parentNode) dom.parentNode.replaceChild(out, dom);\n\n\t\t\t// recycle the old element (skips non-Element node types)\n\t\t\trecollectNodeTree(dom, true);\n\t\t}\n\t}\n\n\tvar fc = out.firstChild,\n\t    props = out['__preactattr_'],\n\t    vchildren = vnode.children;\n\n\tif (props == null) {\n\t\tprops = out['__preactattr_'] = {};\n\t\tfor (var a = out.attributes, i = a.length; i--;) {\n\t\t\tprops[a[i].name] = a[i].value;\n\t\t}\n\t}\n\n\t// Optimization: fast-path for elements containing a single TextNode:\n\tif (!hydrating && vchildren && vchildren.length === 1 && typeof vchildren[0] === 'string' && fc != null && fc.splitText !== undefined && fc.nextSibling == null) {\n\t\tif (fc.nodeValue != vchildren[0]) {\n\t\t\tfc.nodeValue = vchildren[0];\n\t\t}\n\t}\n\t// otherwise, if there are existing or new children, diff them:\n\telse if (vchildren && vchildren.length || fc != null) {\n\t\t\tinnerDiffNode(out, vchildren, context, mountAll, hydrating || props.dangerouslySetInnerHTML != null);\n\t\t}\n\n\t// Apply attributes/props from VNode to the DOM Element:\n\tdiffAttributes(out, vnode.attributes, props);\n\n\t// restore previous SVG mode: (in case we're exiting an SVG namespace)\n\tisSvgMode = prevSvgMode;\n\n\treturn out;\n}\n\n/** Apply child and attribute changes between a VNode and a DOM Node to the DOM.\n *\t@param {Element} dom\t\t\tElement whose children should be compared & mutated\n *\t@param {Array} vchildren\t\tArray of VNodes to compare to `dom.childNodes`\n *\t@param {Object} context\t\t\tImplicitly descendant context object (from most recent `getChildContext()`)\n *\t@param {Boolean} mountAll\n *\t@param {Boolean} isHydrating\tIf `true`, consumes externally created elements similar to hydration\n */\nfunction innerDiffNode(dom, vchildren, context, mountAll, isHydrating) {\n\tvar originalChildren = dom.childNodes,\n\t    children = [],\n\t    keyed = {},\n\t    keyedLen = 0,\n\t    min = 0,\n\t    len = originalChildren.length,\n\t    childrenLen = 0,\n\t    vlen = vchildren ? vchildren.length : 0,\n\t    j,\n\t    c,\n\t    f,\n\t    vchild,\n\t    child;\n\n\t// Build up a map of keyed children and an Array of unkeyed children:\n\tif (len !== 0) {\n\t\tfor (var i = 0; i < len; i++) {\n\t\t\tvar _child = originalChildren[i],\n\t\t\t    props = _child['__preactattr_'],\n\t\t\t    key = vlen && props ? _child._component ? _child._component.__key : props.key : null;\n\t\t\tif (key != null) {\n\t\t\t\tkeyedLen++;\n\t\t\t\tkeyed[key] = _child;\n\t\t\t} else if (props || (_child.splitText !== undefined ? isHydrating ? _child.nodeValue.trim() : true : isHydrating)) {\n\t\t\t\tchildren[childrenLen++] = _child;\n\t\t\t}\n\t\t}\n\t}\n\n\tif (vlen !== 0) {\n\t\tfor (var i = 0; i < vlen; i++) {\n\t\t\tvchild = vchildren[i];\n\t\t\tchild = null;\n\n\t\t\t// attempt to find a node based on key matching\n\t\t\tvar key = vchild.key;\n\t\t\tif (key != null) {\n\t\t\t\tif (keyedLen && keyed[key] !== undefined) {\n\t\t\t\t\tchild = keyed[key];\n\t\t\t\t\tkeyed[key] = undefined;\n\t\t\t\t\tkeyedLen--;\n\t\t\t\t}\n\t\t\t}\n\t\t\t// attempt to pluck a node of the same type from the existing children\n\t\t\telse if (!child && min < childrenLen) {\n\t\t\t\t\tfor (j = min; j < childrenLen; j++) {\n\t\t\t\t\t\tif (children[j] !== undefined && isSameNodeType(c = children[j], vchild, isHydrating)) {\n\t\t\t\t\t\t\tchild = c;\n\t\t\t\t\t\t\tchildren[j] = undefined;\n\t\t\t\t\t\t\tif (j === childrenLen - 1) childrenLen--;\n\t\t\t\t\t\t\tif (j === min) min++;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t// morph the matched/found/created DOM child to match vchild (deep)\n\t\t\tchild = idiff(child, vchild, context, mountAll);\n\n\t\t\tf = originalChildren[i];\n\t\t\tif (child && child !== dom && child !== f) {\n\t\t\t\tif (f == null) {\n\t\t\t\t\tdom.appendChild(child);\n\t\t\t\t} else if (child === f.nextSibling) {\n\t\t\t\t\tremoveNode(f);\n\t\t\t\t} else {\n\t\t\t\t\tdom.insertBefore(child, f);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t// remove unused keyed children:\n\tif (keyedLen) {\n\t\tfor (var i in keyed) {\n\t\t\tif (keyed[i] !== undefined) recollectNodeTree(keyed[i], false);\n\t\t}\n\t}\n\n\t// remove orphaned unkeyed children:\n\twhile (min <= childrenLen) {\n\t\tif ((child = children[childrenLen--]) !== undefined) recollectNodeTree(child, false);\n\t}\n}\n\n/** Recursively recycle (or just unmount) a node and its descendants.\n *\t@param {Node} node\t\t\t\t\t\tDOM node to start unmount/removal from\n *\t@param {Boolean} [unmountOnly=false]\tIf `true`, only triggers unmount lifecycle, skips removal\n */\nfunction recollectNodeTree(node, unmountOnly) {\n\tvar component = node._component;\n\tif (component) {\n\t\t// if node is owned by a Component, unmount that component (ends up recursing back here)\n\t\tunmountComponent(component);\n\t} else {\n\t\t// If the node's VNode had a ref function, invoke it with null here.\n\t\t// (this is part of the React spec, and smart for unsetting references)\n\t\tif (node['__preactattr_'] != null && node['__preactattr_'].ref) node['__preactattr_'].ref(null);\n\n\t\tif (unmountOnly === false || node['__preactattr_'] == null) {\n\t\t\tremoveNode(node);\n\t\t}\n\n\t\tremoveChildren(node);\n\t}\n}\n\n/** Recollect/unmount all children.\n *\t- we use .lastChild here because it causes less reflow than .firstChild\n *\t- it's also cheaper than accessing the .childNodes Live NodeList\n */\nfunction removeChildren(node) {\n\tnode = node.lastChild;\n\twhile (node) {\n\t\tvar next = node.previousSibling;\n\t\trecollectNodeTree(node, true);\n\t\tnode = next;\n\t}\n}\n\n/** Apply differences in attributes from a VNode to the given DOM Element.\n *\t@param {Element} dom\t\tElement with attributes to diff `attrs` against\n *\t@param {Object} attrs\t\tThe desired end-state key-value attribute pairs\n *\t@param {Object} old\t\t\tCurrent/previous attributes (from previous VNode or element's prop cache)\n */\nfunction diffAttributes(dom, attrs, old) {\n\tvar name;\n\n\t// remove attributes no longer present on the vnode by setting them to undefined\n\tfor (name in old) {\n\t\tif (!(attrs && attrs[name] != null) && old[name] != null) {\n\t\t\tsetAccessor(dom, name, old[name], old[name] = undefined, isSvgMode);\n\t\t}\n\t}\n\n\t// add new & update changed attributes\n\tfor (name in attrs) {\n\t\tif (name !== 'children' && name !== 'innerHTML' && (!(name in old) || attrs[name] !== (name === 'value' || name === 'checked' ? dom[name] : old[name]))) {\n\t\t\tsetAccessor(dom, name, old[name], old[name] = attrs[name], isSvgMode);\n\t\t}\n\t}\n}\n\n/** Retains a pool of Components for re-use, keyed on component name.\n *\tNote: since component names are not unique or even necessarily available, these are primarily a form of sharding.\n *\t@private\n */\nvar components = {};\n\n/** Reclaim a component for later re-use by the recycler. */\nfunction collectComponent(component) {\n\tvar name = component.constructor.name;\n\t(components[name] || (components[name] = [])).push(component);\n}\n\n/** Create a component. Normalizes differences between PFC's and classful Components. */\nfunction createComponent(Ctor, props, context) {\n\tvar list = components[Ctor.name],\n\t    inst;\n\n\tif (Ctor.prototype && Ctor.prototype.render) {\n\t\tinst = new Ctor(props, context);\n\t\tComponent.call(inst, props, context);\n\t} else {\n\t\tinst = new Component(props, context);\n\t\tinst.constructor = Ctor;\n\t\tinst.render = doRender;\n\t}\n\n\tif (list) {\n\t\tfor (var i = list.length; i--;) {\n\t\t\tif (list[i].constructor === Ctor) {\n\t\t\t\tinst.nextBase = list[i].nextBase;\n\t\t\t\tlist.splice(i, 1);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\treturn inst;\n}\n\n/** The `.render()` method for a PFC backing instance. */\nfunction doRender(props, state, context) {\n\treturn this.constructor(props, context);\n}\n\n/** Set a component's `props` (generally derived from JSX attributes).\n *\t@param {Object} props\n *\t@param {Object} [opts]\n *\t@param {boolean} [opts.renderSync=false]\tIf `true` and {@link options.syncComponentUpdates} is `true`, triggers synchronous rendering.\n *\t@param {boolean} [opts.render=true]\t\t\tIf `false`, no render will be triggered.\n */\nfunction setComponentProps(component, props, opts, context, mountAll) {\n\tif (component._disable) return;\n\tcomponent._disable = true;\n\n\tif (component.__ref = props.ref) delete props.ref;\n\tif (component.__key = props.key) delete props.key;\n\n\tif (!component.base || mountAll) {\n\t\tif (component.componentWillMount) component.componentWillMount();\n\t} else if (component.componentWillReceiveProps) {\n\t\tcomponent.componentWillReceiveProps(props, context);\n\t}\n\n\tif (context && context !== component.context) {\n\t\tif (!component.prevContext) component.prevContext = component.context;\n\t\tcomponent.context = context;\n\t}\n\n\tif (!component.prevProps) component.prevProps = component.props;\n\tcomponent.props = props;\n\n\tcomponent._disable = false;\n\n\tif (opts !== 0) {\n\t\tif (opts === 1 || options.syncComponentUpdates !== false || !component.base) {\n\t\t\trenderComponent(component, 1, mountAll);\n\t\t} else {\n\t\t\tenqueueRender(component);\n\t\t}\n\t}\n\n\tif (component.__ref) component.__ref(component);\n}\n\n/** Render a Component, triggering necessary lifecycle events and taking High-Order Components into account.\n *\t@param {Component} component\n *\t@param {Object} [opts]\n *\t@param {boolean} [opts.build=false]\t\tIf `true`, component will build and store a DOM node if not already associated with one.\n *\t@private\n */\nfunction renderComponent(component, opts, mountAll, isChild) {\n\tif (component._disable) return;\n\n\tvar props = component.props,\n\t    state = component.state,\n\t    context = component.context,\n\t    previousProps = component.prevProps || props,\n\t    previousState = component.prevState || state,\n\t    previousContext = component.prevContext || context,\n\t    isUpdate = component.base,\n\t    nextBase = component.nextBase,\n\t    initialBase = isUpdate || nextBase,\n\t    initialChildComponent = component._component,\n\t    skip = false,\n\t    rendered,\n\t    inst,\n\t    cbase;\n\n\t// if updating\n\tif (isUpdate) {\n\t\tcomponent.props = previousProps;\n\t\tcomponent.state = previousState;\n\t\tcomponent.context = previousContext;\n\t\tif (opts !== 2 && component.shouldComponentUpdate && component.shouldComponentUpdate(props, state, context) === false) {\n\t\t\tskip = true;\n\t\t} else if (component.componentWillUpdate) {\n\t\t\tcomponent.componentWillUpdate(props, state, context);\n\t\t}\n\t\tcomponent.props = props;\n\t\tcomponent.state = state;\n\t\tcomponent.context = context;\n\t}\n\n\tcomponent.prevProps = component.prevState = component.prevContext = component.nextBase = null;\n\tcomponent._dirty = false;\n\n\tif (!skip) {\n\t\trendered = component.render(props, state, context);\n\n\t\t// context to pass to the child, can be updated via (grand-)parent component\n\t\tif (component.getChildContext) {\n\t\t\tcontext = extend(extend({}, context), component.getChildContext());\n\t\t}\n\n\t\tvar childComponent = rendered && rendered.nodeName,\n\t\t    toUnmount,\n\t\t    base;\n\n\t\tif (typeof childComponent === 'function') {\n\t\t\t// set up high order component link\n\n\t\t\tvar childProps = getNodeProps(rendered);\n\t\t\tinst = initialChildComponent;\n\n\t\t\tif (inst && inst.constructor === childComponent && childProps.key == inst.__key) {\n\t\t\t\tsetComponentProps(inst, childProps, 1, context, false);\n\t\t\t} else {\n\t\t\t\ttoUnmount = inst;\n\n\t\t\t\tcomponent._component = inst = createComponent(childComponent, childProps, context);\n\t\t\t\tinst.nextBase = inst.nextBase || nextBase;\n\t\t\t\tinst._parentComponent = component;\n\t\t\t\tsetComponentProps(inst, childProps, 0, context, false);\n\t\t\t\trenderComponent(inst, 1, mountAll, true);\n\t\t\t}\n\n\t\t\tbase = inst.base;\n\t\t} else {\n\t\t\tcbase = initialBase;\n\n\t\t\t// destroy high order component link\n\t\t\ttoUnmount = initialChildComponent;\n\t\t\tif (toUnmount) {\n\t\t\t\tcbase = component._component = null;\n\t\t\t}\n\n\t\t\tif (initialBase || opts === 1) {\n\t\t\t\tif (cbase) cbase._component = null;\n\t\t\t\tbase = diff(cbase, rendered, context, mountAll || !isUpdate, initialBase && initialBase.parentNode, true);\n\t\t\t}\n\t\t}\n\n\t\tif (initialBase && base !== initialBase && inst !== initialChildComponent) {\n\t\t\tvar baseParent = initialBase.parentNode;\n\t\t\tif (baseParent && base !== baseParent) {\n\t\t\t\tbaseParent.replaceChild(base, initialBase);\n\n\t\t\t\tif (!toUnmount) {\n\t\t\t\t\tinitialBase._component = null;\n\t\t\t\t\trecollectNodeTree(initialBase, false);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif (toUnmount) {\n\t\t\tunmountComponent(toUnmount);\n\t\t}\n\n\t\tcomponent.base = base;\n\t\tif (base && !isChild) {\n\t\t\tvar componentRef = component,\n\t\t\t    t = component;\n\t\t\twhile (t = t._parentComponent) {\n\t\t\t\t(componentRef = t).base = base;\n\t\t\t}\n\t\t\tbase._component = componentRef;\n\t\t\tbase._componentConstructor = componentRef.constructor;\n\t\t}\n\t}\n\n\tif (!isUpdate || mountAll) {\n\t\tmounts.unshift(component);\n\t} else if (!skip) {\n\t\t// Ensure that pending componentDidMount() hooks of child components\n\t\t// are called before the componentDidUpdate() hook in the parent.\n\t\t// Note: disabled as it causes duplicate hooks, see https://github.com/developit/preact/issues/750\n\t\t// flushMounts();\n\n\t\tif (component.componentDidUpdate) {\n\t\t\tcomponent.componentDidUpdate(previousProps, previousState, previousContext);\n\t\t}\n\t\tif (options.afterUpdate) options.afterUpdate(component);\n\t}\n\n\tif (component._renderCallbacks != null) {\n\t\twhile (component._renderCallbacks.length) {\n\t\t\tcomponent._renderCallbacks.pop().call(component);\n\t\t}\n\t}\n\n\tif (!diffLevel && !isChild) flushMounts();\n}\n\n/** Apply the Component referenced by a VNode to the DOM.\n *\t@param {Element} dom\tThe DOM node to mutate\n *\t@param {VNode} vnode\tA Component-referencing VNode\n *\t@returns {Element} dom\tThe created/mutated element\n *\t@private\n */\nfunction buildComponentFromVNode(dom, vnode, context, mountAll) {\n\tvar c = dom && dom._component,\n\t    originalComponent = c,\n\t    oldDom = dom,\n\t    isDirectOwner = c && dom._componentConstructor === vnode.nodeName,\n\t    isOwner = isDirectOwner,\n\t    props = getNodeProps(vnode);\n\twhile (c && !isOwner && (c = c._parentComponent)) {\n\t\tisOwner = c.constructor === vnode.nodeName;\n\t}\n\n\tif (c && isOwner && (!mountAll || c._component)) {\n\t\tsetComponentProps(c, props, 3, context, mountAll);\n\t\tdom = c.base;\n\t} else {\n\t\tif (originalComponent && !isDirectOwner) {\n\t\t\tunmountComponent(originalComponent);\n\t\t\tdom = oldDom = null;\n\t\t}\n\n\t\tc = createComponent(vnode.nodeName, props, context);\n\t\tif (dom && !c.nextBase) {\n\t\t\tc.nextBase = dom;\n\t\t\t// passing dom/oldDom as nextBase will recycle it if unused, so bypass recycling on L229:\n\t\t\toldDom = null;\n\t\t}\n\t\tsetComponentProps(c, props, 1, context, mountAll);\n\t\tdom = c.base;\n\n\t\tif (oldDom && dom !== oldDom) {\n\t\t\toldDom._component = null;\n\t\t\trecollectNodeTree(oldDom, false);\n\t\t}\n\t}\n\n\treturn dom;\n}\n\n/** Remove a component from the DOM and recycle it.\n *\t@param {Component} component\tThe Component instance to unmount\n *\t@private\n */\nfunction unmountComponent(component) {\n\tif (options.beforeUnmount) options.beforeUnmount(component);\n\n\tvar base = component.base;\n\n\tcomponent._disable = true;\n\n\tif (component.componentWillUnmount) component.componentWillUnmount();\n\n\tcomponent.base = null;\n\n\t// recursively tear down & recollect high-order component children:\n\tvar inner = component._component;\n\tif (inner) {\n\t\tunmountComponent(inner);\n\t} else if (base) {\n\t\tif (base['__preactattr_'] && base['__preactattr_'].ref) base['__preactattr_'].ref(null);\n\n\t\tcomponent.nextBase = base;\n\n\t\tremoveNode(base);\n\t\tcollectComponent(component);\n\n\t\tremoveChildren(base);\n\t}\n\n\tif (component.__ref) component.__ref(null);\n}\n\n/** Base Component class.\n *\tProvides `setState()` and `forceUpdate()`, which trigger rendering.\n *\t@public\n *\n *\t@example\n *\tclass MyFoo extends Component {\n *\t\trender(props, state) {\n *\t\t\treturn <div />;\n *\t\t}\n *\t}\n */\nfunction Component(props, context) {\n\tthis._dirty = true;\n\n\t/** @public\n  *\t@type {object}\n  */\n\tthis.context = context;\n\n\t/** @public\n  *\t@type {object}\n  */\n\tthis.props = props;\n\n\t/** @public\n  *\t@type {object}\n  */\n\tthis.state = this.state || {};\n}\n\nextend(Component.prototype, {\n\n\t/** Returns a `boolean` indicating if the component should re-render when receiving the given `props` and `state`.\n  *\t@param {object} nextProps\n  *\t@param {object} nextState\n  *\t@param {object} nextContext\n  *\t@returns {Boolean} should the component re-render\n  *\t@name shouldComponentUpdate\n  *\t@function\n  */\n\n\t/** Update component state by copying properties from `state` to `this.state`.\n  *\t@param {object} state\t\tA hash of state properties to update with new values\n  *\t@param {function} callback\tA function to be called once component state is updated\n  */\n\tsetState: function setState(state, callback) {\n\t\tvar s = this.state;\n\t\tif (!this.prevState) this.prevState = extend({}, s);\n\t\textend(s, typeof state === 'function' ? state(s, this.props) : state);\n\t\tif (callback) (this._renderCallbacks = this._renderCallbacks || []).push(callback);\n\t\tenqueueRender(this);\n\t},\n\n\n\t/** Immediately perform a synchronous re-render of the component.\n  *\t@param {function} callback\t\tA function to be called after component is re-rendered.\n  *\t@private\n  */\n\tforceUpdate: function forceUpdate(callback) {\n\t\tif (callback) (this._renderCallbacks = this._renderCallbacks || []).push(callback);\n\t\trenderComponent(this, 2);\n\t},\n\n\n\t/** Accepts `props` and `state`, and returns a new Virtual DOM tree to build.\n  *\tVirtual DOM is generally constructed via [JSX](http://jasonformat.com/wtf-is-jsx).\n  *\t@param {object} props\t\tProps (eg: JSX attributes) received from parent element/component\n  *\t@param {object} state\t\tThe component's current state\n  *\t@param {object} context\t\tContext object (if a parent component has provided context)\n  *\t@returns VNode\n  */\n\trender: function render() {}\n});\n\n/** Render JSX into a `parent` Element.\n *\t@param {VNode} vnode\t\tA (JSX) VNode to render\n *\t@param {Element} parent\t\tDOM element to render into\n *\t@param {Element} [merge]\tAttempt to re-use an existing DOM tree rooted at `merge`\n *\t@public\n *\n *\t@example\n *\t// render a div into <body>:\n *\trender(<div id=\"hello\">hello!</div>, document.body);\n *\n *\t@example\n *\t// render a \"Thing\" component into #foo:\n *\tconst Thing = ({ name }) => <span>{ name }</span>;\n *\trender(<Thing name=\"one\" />, document.querySelector('#foo'));\n */\nfunction render(vnode, parent, merge) {\n  return diff(merge, vnode, {}, false, parent, false);\n}\n\nvar preact = {\n\th: h,\n\tcreateElement: h,\n\tcloneElement: cloneElement,\n\tComponent: Component,\n\trender: render,\n\trerender: rerender,\n\toptions: options\n};\n\nexport { h, h as createElement, cloneElement, Component, render, rerender, options };\nexport default preact;\n//# sourceMappingURL=preact.esm.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/preact/dist/preact.esm.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = require(\"@firebase/util\");\nvar util_2 = require(\"@firebase/util\");\nvar util_3 = require(\"@firebase/util\");\nvar util_4 = require(\"@firebase/util\");\nvar util_5 = require(\"@firebase/util\");\nvar util_6 = require(\"@firebase/util\");\nvar storage_1 = require(\"../storage/storage\");\nvar util_7 = require(\"@firebase/util\");\n/**\n * Returns a locally-unique ID (generated by just incrementing up from 0 each time its called).\n * @type {function(): number} Generated ID.\n */\nexports.LUIDGenerator = (function () {\n    var id = 1;\n    return function () {\n        return id++;\n    };\n})();\n/**\n * Sha1 hash of the input string\n * @param {!string} str The string to hash\n * @return {!string} The resulting hash\n */\nexports.sha1 = function (str) {\n    var utf8Bytes = util_5.stringToByteArray(str);\n    var sha1 = new util_4.Sha1();\n    sha1.update(utf8Bytes);\n    var sha1Bytes = sha1.digest();\n    return util_3.base64.encodeByteArray(sha1Bytes);\n};\n/**\n * @param {...*} var_args\n * @return {string}\n * @private\n */\nvar buildLogMessage_ = function () {\n    var var_args = [];\n    for (var _i = 0; _i < arguments.length; _i++) {\n        var_args[_i] = arguments[_i];\n    }\n    var message = '';\n    for (var i = 0; i < var_args.length; i++) {\n        if (Array.isArray(var_args[i]) ||\n            (var_args[i] &&\n                typeof var_args[i] === 'object' &&\n                typeof var_args[i].length === 'number')) {\n            message += buildLogMessage_.apply(null, var_args[i]);\n        }\n        else if (typeof var_args[i] === 'object') {\n            message += util_6.stringify(var_args[i]);\n        }\n        else {\n            message += var_args[i];\n        }\n        message += ' ';\n    }\n    return message;\n};\n/**\n * Use this for all debug messages in Firebase.\n * @type {?function(string)}\n */\nexports.logger = null;\n/**\n * Flag to check for log availability on first log message\n * @type {boolean}\n * @private\n */\nvar firstLog_ = true;\n/**\n * The implementation of Firebase.enableLogging (defined here to break dependencies)\n * @param {boolean|?function(string)} logger_ A flag to turn on logging, or a custom logger\n * @param {boolean=} persistent Whether or not to persist logging settings across refreshes\n */\nexports.enableLogging = function (logger_, persistent) {\n    util_1.assert(!persistent || (logger_ === true || logger_ === false), \"Can't turn on custom loggers persistently.\");\n    if (logger_ === true) {\n        if (typeof console !== 'undefined') {\n            if (typeof console.log === 'function') {\n                exports.logger = console.log.bind(console);\n            }\n            else if (typeof console.log === 'object') {\n                // IE does this.\n                exports.logger = function (message) {\n                    console.log(message);\n                };\n            }\n        }\n        if (persistent)\n            storage_1.SessionStorage.set('logging_enabled', true);\n    }\n    else if (typeof logger_ === 'function') {\n        exports.logger = logger_;\n    }\n    else {\n        exports.logger = null;\n        storage_1.SessionStorage.remove('logging_enabled');\n    }\n};\n/**\n *\n * @param {...(string|Arguments)} var_args\n */\nexports.log = function () {\n    var var_args = [];\n    for (var _i = 0; _i < arguments.length; _i++) {\n        var_args[_i] = arguments[_i];\n    }\n    if (firstLog_ === true) {\n        firstLog_ = false;\n        if (exports.logger === null && storage_1.SessionStorage.get('logging_enabled') === true)\n            exports.enableLogging(true);\n    }\n    if (exports.logger) {\n        var message = buildLogMessage_.apply(null, var_args);\n        exports.logger(message);\n    }\n};\n/**\n * @param {!string} prefix\n * @return {function(...[*])}\n */\nexports.logWrapper = function (prefix) {\n    return function () {\n        var var_args = [];\n        for (var _i = 0; _i < arguments.length; _i++) {\n            var_args[_i] = arguments[_i];\n        }\n        exports.log.apply(void 0, [prefix].concat(var_args));\n    };\n};\n/**\n * @param {...string} var_args\n */\nexports.error = function () {\n    var var_args = [];\n    for (var _i = 0; _i < arguments.length; _i++) {\n        var_args[_i] = arguments[_i];\n    }\n    if (typeof console !== 'undefined') {\n        var message = 'FIREBASE INTERNAL ERROR: ' + buildLogMessage_.apply(void 0, var_args);\n        if (typeof console.error !== 'undefined') {\n            console.error(message);\n        }\n        else {\n            console.log(message);\n        }\n    }\n};\n/**\n * @param {...string} var_args\n */\nexports.fatal = function () {\n    var var_args = [];\n    for (var _i = 0; _i < arguments.length; _i++) {\n        var_args[_i] = arguments[_i];\n    }\n    var message = buildLogMessage_.apply(void 0, var_args);\n    throw new Error('FIREBASE FATAL ERROR: ' + message);\n};\n/**\n * @param {...*} var_args\n */\nexports.warn = function () {\n    var var_args = [];\n    for (var _i = 0; _i < arguments.length; _i++) {\n        var_args[_i] = arguments[_i];\n    }\n    if (typeof console !== 'undefined') {\n        var message = 'FIREBASE WARNING: ' + buildLogMessage_.apply(void 0, var_args);\n        if (typeof console.warn !== 'undefined') {\n            console.warn(message);\n        }\n        else {\n            console.log(message);\n        }\n    }\n};\n/**\n * Logs a warning if the containing page uses https. Called when a call to new Firebase\n * does not use https.\n */\nexports.warnIfPageIsSecure = function () {\n    // Be very careful accessing browser globals. Who knows what may or may not exist.\n    if (typeof window !== 'undefined' &&\n        window.location &&\n        window.location.protocol &&\n        window.location.protocol.indexOf('https:') !== -1) {\n        exports.warn('Insecure Firebase access from a secure page. ' +\n            'Please use https in calls to new Firebase().');\n    }\n};\n/**\n * @param {!String} methodName\n */\nexports.warnAboutUnsupportedMethod = function (methodName) {\n    exports.warn(methodName +\n        ' is unsupported and will likely change soon.  ' +\n        'Please do not use.');\n};\n/**\n * Returns true if data is NaN, or +/- Infinity.\n * @param {*} data\n * @return {boolean}\n */\nexports.isInvalidJSONNumber = function (data) {\n    return (typeof data === 'number' &&\n        (data != data || // NaN\n            data == Number.POSITIVE_INFINITY ||\n            data == Number.NEGATIVE_INFINITY));\n};\n/**\n * @param {function()} fn\n */\nexports.executeWhenDOMReady = function (fn) {\n    if (util_7.isNodeSdk() || document.readyState === 'complete') {\n        fn();\n    }\n    else {\n        // Modeled after jQuery. Try DOMContentLoaded and onreadystatechange (which\n        // fire before onload), but fall back to onload.\n        var called_1 = false;\n        var wrappedFn_1 = function () {\n            if (!document.body) {\n                setTimeout(wrappedFn_1, Math.floor(10));\n                return;\n            }\n            if (!called_1) {\n                called_1 = true;\n                fn();\n            }\n        };\n        if (document.addEventListener) {\n            document.addEventListener('DOMContentLoaded', wrappedFn_1, false);\n            // fallback to onload.\n            window.addEventListener('load', wrappedFn_1, false);\n        }\n        else if (document.attachEvent) {\n            // IE.\n            document.attachEvent('onreadystatechange', function () {\n                if (document.readyState === 'complete')\n                    wrappedFn_1();\n            });\n            // fallback to onload.\n            window.attachEvent('onload', wrappedFn_1);\n            // jQuery has an extra hack for IE that we could employ (based on\n            // http://javascript.nwbox.com/IEContentLoaded/) But it looks really old.\n            // I'm hoping we don't need it.\n        }\n    }\n};\n/**\n * Minimum key name. Invalid for actual data, used as a marker to sort before any valid names\n * @type {!string}\n */\nexports.MIN_NAME = '[MIN_NAME]';\n/**\n * Maximum key name. Invalid for actual data, used as a marker to sort above any valid names\n * @type {!string}\n */\nexports.MAX_NAME = '[MAX_NAME]';\n/**\n * Compares valid Firebase key names, plus min and max name\n * @param {!string} a\n * @param {!string} b\n * @return {!number}\n */\nexports.nameCompare = function (a, b) {\n    if (a === b) {\n        return 0;\n    }\n    else if (a === exports.MIN_NAME || b === exports.MAX_NAME) {\n        return -1;\n    }\n    else if (b === exports.MIN_NAME || a === exports.MAX_NAME) {\n        return 1;\n    }\n    else {\n        var aAsInt = exports.tryParseInt(a), bAsInt = exports.tryParseInt(b);\n        if (aAsInt !== null) {\n            if (bAsInt !== null) {\n                return aAsInt - bAsInt == 0 ? a.length - b.length : aAsInt - bAsInt;\n            }\n            else {\n                return -1;\n            }\n        }\n        else if (bAsInt !== null) {\n            return 1;\n        }\n        else {\n            return a < b ? -1 : 1;\n        }\n    }\n};\n/**\n * @param {!string} a\n * @param {!string} b\n * @return {!number} comparison result.\n */\nexports.stringCompare = function (a, b) {\n    if (a === b) {\n        return 0;\n    }\n    else if (a < b) {\n        return -1;\n    }\n    else {\n        return 1;\n    }\n};\n/**\n * @param {string} key\n * @param {Object} obj\n * @return {*}\n */\nexports.requireKey = function (key, obj) {\n    if (obj && key in obj) {\n        return obj[key];\n    }\n    else {\n        throw new Error('Missing required key (' + key + ') in object: ' + util_6.stringify(obj));\n    }\n};\n/**\n * @param {*} obj\n * @return {string}\n */\nexports.ObjectToUniqueKey = function (obj) {\n    if (typeof obj !== 'object' || obj === null)\n        return util_6.stringify(obj);\n    var keys = [];\n    for (var k in obj) {\n        keys.push(k);\n    }\n    // Export as json, but with the keys sorted.\n    keys.sort();\n    var key = '{';\n    for (var i = 0; i < keys.length; i++) {\n        if (i !== 0)\n            key += ',';\n        key += util_6.stringify(keys[i]);\n        key += ':';\n        key += exports.ObjectToUniqueKey(obj[keys[i]]);\n    }\n    key += '}';\n    return key;\n};\n/**\n * Splits a string into a number of smaller segments of maximum size\n * @param {!string} str The string\n * @param {!number} segsize The maximum number of chars in the string.\n * @return {Array.<string>} The string, split into appropriately-sized chunks\n */\nexports.splitStringBySize = function (str, segsize) {\n    var len = str.length;\n    if (len <= segsize) {\n        return [str];\n    }\n    var dataSegs = [];\n    for (var c = 0; c < len; c += segsize) {\n        if (c + segsize > len) {\n            dataSegs.push(str.substring(c, len));\n        }\n        else {\n            dataSegs.push(str.substring(c, c + segsize));\n        }\n    }\n    return dataSegs;\n};\n/**\n * Apply a function to each (key, value) pair in an object or\n * apply a function to each (index, value) pair in an array\n * @param {!(Object|Array)} obj The object or array to iterate over\n * @param {function(?, ?)} fn The function to apply\n */\nexports.each = function (obj, fn) {\n    if (Array.isArray(obj)) {\n        for (var i = 0; i < obj.length; ++i) {\n            fn(i, obj[i]);\n        }\n    }\n    else {\n        /**\n         * in the conversion of code we removed the goog.object.forEach\n         * function which did a value,key callback. We standardized on\n         * a single impl that does a key, value callback. So we invert\n         * to not have to touch the `each` code points\n         */\n        util_2.forEach(obj, function (key, val) { return fn(val, key); });\n    }\n};\n/**\n * Like goog.bind, but doesn't bother to create a closure if opt_context is null/undefined.\n * @param {function(*)} callback Callback function.\n * @param {?Object=} context Optional context to bind to.\n * @return {function(*)}\n */\nexports.bindCallback = function (callback, context) {\n    return context ? callback.bind(context) : callback;\n};\n/**\n * Borrowed from http://hg.secondlife.com/llsd/src/tip/js/typedarray.js (MIT License)\n * I made one modification at the end and removed the NaN / Infinity\n * handling (since it seemed broken [caused an overflow] and we don't need it).  See MJL comments.\n * @param {!number} v A double\n * @return {string}\n */\nexports.doubleToIEEE754String = function (v) {\n    util_1.assert(!exports.isInvalidJSONNumber(v), 'Invalid JSON number'); // MJL\n    var ebits = 11, fbits = 52;\n    var bias = (1 << (ebits - 1)) - 1, s, e, f, ln, i, bits, str;\n    // Compute sign, exponent, fraction\n    // Skip NaN / Infinity handling --MJL.\n    if (v === 0) {\n        e = 0;\n        f = 0;\n        s = 1 / v === -Infinity ? 1 : 0;\n    }\n    else {\n        s = v < 0;\n        v = Math.abs(v);\n        if (v >= Math.pow(2, 1 - bias)) {\n            // Normalized\n            ln = Math.min(Math.floor(Math.log(v) / Math.LN2), bias);\n            e = ln + bias;\n            f = Math.round(v * Math.pow(2, fbits - ln) - Math.pow(2, fbits));\n        }\n        else {\n            // Denormalized\n            e = 0;\n            f = Math.round(v / Math.pow(2, 1 - bias - fbits));\n        }\n    }\n    // Pack sign, exponent, fraction\n    bits = [];\n    for (i = fbits; i; i -= 1) {\n        bits.push(f % 2 ? 1 : 0);\n        f = Math.floor(f / 2);\n    }\n    for (i = ebits; i; i -= 1) {\n        bits.push(e % 2 ? 1 : 0);\n        e = Math.floor(e / 2);\n    }\n    bits.push(s ? 1 : 0);\n    bits.reverse();\n    str = bits.join('');\n    // Return the data as a hex string. --MJL\n    var hexByteString = '';\n    for (i = 0; i < 64; i += 8) {\n        var hexByte = parseInt(str.substr(i, 8), 2).toString(16);\n        if (hexByte.length === 1)\n            hexByte = '0' + hexByte;\n        hexByteString = hexByteString + hexByte;\n    }\n    return hexByteString.toLowerCase();\n};\n/**\n * Used to detect if we're in a Chrome content script (which executes in an\n * isolated environment where long-polling doesn't work).\n * @return {boolean}\n */\nexports.isChromeExtensionContentScript = function () {\n    return !!(typeof window === 'object' &&\n        window['chrome'] &&\n        window['chrome']['extension'] &&\n        !/^chrome/.test(window.location.href));\n};\n/**\n * Used to detect if we're in a Windows 8 Store app.\n * @return {boolean}\n */\nexports.isWindowsStoreApp = function () {\n    // Check for the presence of a couple WinRT globals\n    return typeof Windows === 'object' && typeof Windows.UI === 'object';\n};\n/**\n * Converts a server error code to a Javascript Error\n * @param {!string} code\n * @param {!Query} query\n * @return {Error}\n */\nexports.errorForServerCode = function (code, query) {\n    var reason = 'Unknown Error';\n    if (code === 'too_big') {\n        reason =\n            'The data requested exceeds the maximum size ' +\n                'that can be accessed with a single request.';\n    }\n    else if (code == 'permission_denied') {\n        reason = \"Client doesn't have permission to access the desired data.\";\n    }\n    else if (code == 'unavailable') {\n        reason = 'The service is unavailable';\n    }\n    var error = new Error(code + ' at ' + query.path.toString() + ': ' + reason);\n    error.code = code.toUpperCase();\n    return error;\n};\n/**\n * Used to test for integer-looking strings\n * @type {RegExp}\n * @private\n */\nexports.INTEGER_REGEXP_ = new RegExp('^-?\\\\d{1,10}$');\n/**\n * If the string contains a 32-bit integer, return it.  Else return null.\n * @param {!string} str\n * @return {?number}\n */\nexports.tryParseInt = function (str) {\n    if (exports.INTEGER_REGEXP_.test(str)) {\n        var intVal = Number(str);\n        if (intVal >= -2147483648 && intVal <= 2147483647) {\n            return intVal;\n        }\n    }\n    return null;\n};\n/**\n * Helper to run some code but catch any exceptions and re-throw them later.\n * Useful for preventing user callbacks from breaking internal code.\n *\n * Re-throwing the exception from a setTimeout is a little evil, but it's very\n * convenient (we don't have to try to figure out when is a safe point to\n * re-throw it), and the behavior seems reasonable:\n *\n * * If you aren't pausing on exceptions, you get an error in the console with\n *   the correct stack trace.\n * * If you're pausing on all exceptions, the debugger will pause on your\n *   exception and then again when we rethrow it.\n * * If you're only pausing on uncaught exceptions, the debugger will only pause\n *   on us re-throwing it.\n *\n * @param {!function()} fn The code to guard.\n */\nexports.exceptionGuard = function (fn) {\n    try {\n        fn();\n    }\n    catch (e) {\n        // Re-throw exception when it's safe.\n        setTimeout(function () {\n            // It used to be that \"throw e\" would result in a good console error with\n            // relevant context, but as of Chrome 39, you just get the firebase.js\n            // file/line number where we re-throw it, which is useless. So we log\n            // e.stack explicitly.\n            var stack = e.stack || '';\n            exports.warn('Exception was thrown by user callback.', stack);\n            throw e;\n        }, Math.floor(0));\n    }\n};\n/**\n * Helper function to safely call opt_callback with the specified arguments.  It:\n * 1. Turns into a no-op if opt_callback is null or undefined.\n * 2. Wraps the call inside exceptionGuard to prevent exceptions from breaking our state.\n *\n * @param {?Function=} callback Optional onComplete callback.\n * @param {...*} var_args Arbitrary args to be passed to opt_onComplete\n */\nexports.callUserCallback = function (callback) {\n    var var_args = [];\n    for (var _i = 1; _i < arguments.length; _i++) {\n        var_args[_i - 1] = arguments[_i];\n    }\n    if (typeof callback === 'function') {\n        exports.exceptionGuard(function () {\n            callback.apply(void 0, var_args);\n        });\n    }\n};\n/**\n * @return {boolean} true if we think we're currently being crawled.\n */\nexports.beingCrawled = function () {\n    var userAgent = (typeof window === 'object' &&\n        window['navigator'] &&\n        window['navigator']['userAgent']) ||\n        '';\n    // For now we whitelist the most popular crawlers.  We should refine this to be the set of crawlers we\n    // believe to support JavaScript/AJAX rendering.\n    // NOTE: Google Webmaster Tools doesn't really belong, but their \"This is how a visitor to your website\n    // would have seen the page\" is flaky if we don't treat it as a crawler.\n    return (userAgent.search(/googlebot|google webmaster tools|bingbot|yahoo! slurp|baiduspider|yandexbot|duckduckbot/i) >= 0);\n};\n/**\n * Export a property of an object using a getter function.\n *\n * @param {!Object} object\n * @param {string} name\n * @param {!function(): *} fnGet\n */\nexports.exportPropGetter = function (object, name, fnGet) {\n    Object.defineProperty(object, name, { get: fnGet });\n};\n/**\n * Same as setTimeout() except on Node.JS it will /not/ prevent the process from exiting.\n *\n * It is removed with clearTimeout() as normal.\n *\n * @param {Function} fn Function to run.\n * @param {number} time Milliseconds to wait before running.\n * @return {number|Object} The setTimeout() return value.\n */\nexports.setTimeoutNonBlocking = function (fn, time) {\n    var timeout = setTimeout(fn, time);\n    if (typeof timeout === 'object' && timeout['unref']) {\n        timeout['unref']();\n    }\n    return timeout;\n};\n\n//# sourceMappingURL=util.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/util/util.js","// @flow\n\nexport function bem (base: string, ...modifiers: Array<?string>): string {\n  return [\n    base,\n    ...modifiers.filter(Boolean).map(modifier => {\n      return `${base}--${modifier}`\n    })\n  ].join(' ')\n}\n\n\n\n// WEBPACK FOOTER //\n// ./src/shared/helpers/bem.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = require(\"./util\");\nvar util_2 = require(\"@firebase/util\");\n/**\n * An immutable object representing a parsed path.  It's immutable so that you\n * can pass them around to other functions without worrying about them changing\n * it.\n */\nvar Path = /** @class */ (function () {\n    /**\n     * @param {string|Array.<string>} pathOrString Path string to parse,\n     *      or another path, or the raw tokens array\n     * @param {number=} pieceNum\n     */\n    function Path(pathOrString, pieceNum) {\n        if (pieceNum === void 0) {\n            this.pieces_ = pathOrString.split('/');\n            // Remove empty pieces.\n            var copyTo = 0;\n            for (var i = 0; i < this.pieces_.length; i++) {\n                if (this.pieces_[i].length > 0) {\n                    this.pieces_[copyTo] = this.pieces_[i];\n                    copyTo++;\n                }\n            }\n            this.pieces_.length = copyTo;\n            this.pieceNum_ = 0;\n        }\n        else {\n            this.pieces_ = pathOrString;\n            this.pieceNum_ = pieceNum;\n        }\n    }\n    Object.defineProperty(Path, \"Empty\", {\n        /**\n         * Singleton to represent an empty path\n         *\n         * @const\n         */\n        get: function () {\n            return new Path('');\n        },\n        enumerable: true,\n        configurable: true\n    });\n    Path.prototype.getFront = function () {\n        if (this.pieceNum_ >= this.pieces_.length)\n            return null;\n        return this.pieces_[this.pieceNum_];\n    };\n    /**\n     * @return {number} The number of segments in this path\n     */\n    Path.prototype.getLength = function () {\n        return this.pieces_.length - this.pieceNum_;\n    };\n    /**\n     * @return {!Path}\n     */\n    Path.prototype.popFront = function () {\n        var pieceNum = this.pieceNum_;\n        if (pieceNum < this.pieces_.length) {\n            pieceNum++;\n        }\n        return new Path(this.pieces_, pieceNum);\n    };\n    /**\n     * @return {?string}\n     */\n    Path.prototype.getBack = function () {\n        if (this.pieceNum_ < this.pieces_.length)\n            return this.pieces_[this.pieces_.length - 1];\n        return null;\n    };\n    Path.prototype.toString = function () {\n        var pathString = '';\n        for (var i = this.pieceNum_; i < this.pieces_.length; i++) {\n            if (this.pieces_[i] !== '')\n                pathString += '/' + this.pieces_[i];\n        }\n        return pathString || '/';\n    };\n    Path.prototype.toUrlEncodedString = function () {\n        var pathString = '';\n        for (var i = this.pieceNum_; i < this.pieces_.length; i++) {\n            if (this.pieces_[i] !== '')\n                pathString += '/' + encodeURIComponent(String(this.pieces_[i]));\n        }\n        return pathString || '/';\n    };\n    /**\n     * Shallow copy of the parts of the path.\n     *\n     * @param {number=} begin\n     * @return {!Array<string>}\n     */\n    Path.prototype.slice = function (begin) {\n        if (begin === void 0) { begin = 0; }\n        return this.pieces_.slice(this.pieceNum_ + begin);\n    };\n    /**\n     * @return {?Path}\n     */\n    Path.prototype.parent = function () {\n        if (this.pieceNum_ >= this.pieces_.length)\n            return null;\n        var pieces = [];\n        for (var i = this.pieceNum_; i < this.pieces_.length - 1; i++)\n            pieces.push(this.pieces_[i]);\n        return new Path(pieces, 0);\n    };\n    /**\n     * @param {string|!Path} childPathObj\n     * @return {!Path}\n     */\n    Path.prototype.child = function (childPathObj) {\n        var pieces = [];\n        for (var i = this.pieceNum_; i < this.pieces_.length; i++)\n            pieces.push(this.pieces_[i]);\n        if (childPathObj instanceof Path) {\n            for (var i = childPathObj.pieceNum_; i < childPathObj.pieces_.length; i++) {\n                pieces.push(childPathObj.pieces_[i]);\n            }\n        }\n        else {\n            var childPieces = childPathObj.split('/');\n            for (var i = 0; i < childPieces.length; i++) {\n                if (childPieces[i].length > 0)\n                    pieces.push(childPieces[i]);\n            }\n        }\n        return new Path(pieces, 0);\n    };\n    /**\n     * @return {boolean} True if there are no segments in this path\n     */\n    Path.prototype.isEmpty = function () {\n        return this.pieceNum_ >= this.pieces_.length;\n    };\n    /**\n     * @param {!Path} outerPath\n     * @param {!Path} innerPath\n     * @return {!Path} The path from outerPath to innerPath\n     */\n    Path.relativePath = function (outerPath, innerPath) {\n        var outer = outerPath.getFront(), inner = innerPath.getFront();\n        if (outer === null) {\n            return innerPath;\n        }\n        else if (outer === inner) {\n            return Path.relativePath(outerPath.popFront(), innerPath.popFront());\n        }\n        else {\n            throw new Error('INTERNAL ERROR: innerPath (' +\n                innerPath +\n                ') is not within ' +\n                'outerPath (' +\n                outerPath +\n                ')');\n        }\n    };\n    /**\n     * @param {!Path} left\n     * @param {!Path} right\n     * @return {number} -1, 0, 1 if left is less, equal, or greater than the right.\n     */\n    Path.comparePaths = function (left, right) {\n        var leftKeys = left.slice();\n        var rightKeys = right.slice();\n        for (var i = 0; i < leftKeys.length && i < rightKeys.length; i++) {\n            var cmp = util_1.nameCompare(leftKeys[i], rightKeys[i]);\n            if (cmp !== 0)\n                return cmp;\n        }\n        if (leftKeys.length === rightKeys.length)\n            return 0;\n        return leftKeys.length < rightKeys.length ? -1 : 1;\n    };\n    /**\n     *\n     * @param {Path} other\n     * @return {boolean} true if paths are the same.\n     */\n    Path.prototype.equals = function (other) {\n        if (this.getLength() !== other.getLength()) {\n            return false;\n        }\n        for (var i = this.pieceNum_, j = other.pieceNum_; i <= this.pieces_.length; i++, j++) {\n            if (this.pieces_[i] !== other.pieces_[j]) {\n                return false;\n            }\n        }\n        return true;\n    };\n    /**\n     *\n     * @param {!Path} other\n     * @return {boolean} True if this path is a parent (or the same as) other\n     */\n    Path.prototype.contains = function (other) {\n        var i = this.pieceNum_;\n        var j = other.pieceNum_;\n        if (this.getLength() > other.getLength()) {\n            return false;\n        }\n        while (i < this.pieces_.length) {\n            if (this.pieces_[i] !== other.pieces_[j]) {\n                return false;\n            }\n            ++i;\n            ++j;\n        }\n        return true;\n    };\n    return Path;\n}()); // end Path\nexports.Path = Path;\n/**\n * Dynamic (mutable) path used to count path lengths.\n *\n * This class is used to efficiently check paths for valid\n * length (in UTF8 bytes) and depth (used in path validation).\n *\n * Throws Error exception if path is ever invalid.\n *\n * The definition of a path always begins with '/'.\n */\nvar ValidationPath = /** @class */ (function () {\n    /**\n     * @param {!Path} path Initial Path.\n     * @param {string} errorPrefix_ Prefix for any error messages.\n     */\n    function ValidationPath(path, errorPrefix_) {\n        this.errorPrefix_ = errorPrefix_;\n        /** @type {!Array<string>} */\n        this.parts_ = path.slice();\n        /** @type {number} Initialize to number of '/' chars needed in path. */\n        this.byteLength_ = Math.max(1, this.parts_.length);\n        for (var i = 0; i < this.parts_.length; i++) {\n            this.byteLength_ += util_2.stringLength(this.parts_[i]);\n        }\n        this.checkValid_();\n    }\n    Object.defineProperty(ValidationPath, \"MAX_PATH_DEPTH\", {\n        /** @const {number} Maximum key depth. */\n        get: function () {\n            return 32;\n        },\n        enumerable: true,\n        configurable: true\n    });\n    Object.defineProperty(ValidationPath, \"MAX_PATH_LENGTH_BYTES\", {\n        /** @const {number} Maximum number of (UTF8) bytes in a Firebase path. */\n        get: function () {\n            return 768;\n        },\n        enumerable: true,\n        configurable: true\n    });\n    /** @param {string} child */\n    ValidationPath.prototype.push = function (child) {\n        // Count the needed '/'\n        if (this.parts_.length > 0) {\n            this.byteLength_ += 1;\n        }\n        this.parts_.push(child);\n        this.byteLength_ += util_2.stringLength(child);\n        this.checkValid_();\n    };\n    ValidationPath.prototype.pop = function () {\n        var last = this.parts_.pop();\n        this.byteLength_ -= util_2.stringLength(last);\n        // Un-count the previous '/'\n        if (this.parts_.length > 0) {\n            this.byteLength_ -= 1;\n        }\n    };\n    ValidationPath.prototype.checkValid_ = function () {\n        if (this.byteLength_ > ValidationPath.MAX_PATH_LENGTH_BYTES) {\n            throw new Error(this.errorPrefix_ +\n                'has a key path longer than ' +\n                ValidationPath.MAX_PATH_LENGTH_BYTES +\n                ' bytes (' +\n                this.byteLength_ +\n                ').');\n        }\n        if (this.parts_.length > ValidationPath.MAX_PATH_DEPTH) {\n            throw new Error(this.errorPrefix_ +\n                'path specified exceeds the maximum depth that can be written (' +\n                ValidationPath.MAX_PATH_DEPTH +\n                ') or object contains a cycle ' +\n                this.toErrorString());\n        }\n    };\n    /**\n     * String for use in error messages - uses '.' notation for path.\n     *\n     * @return {string}\n     */\n    ValidationPath.prototype.toErrorString = function () {\n        if (this.parts_.length == 0) {\n            return '';\n        }\n        return \"in property '\" + this.parts_.join('.') + \"'\";\n    };\n    return ValidationPath;\n}());\nexports.ValidationPath = ValidationPath;\n\n//# sourceMappingURL=Path.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/util/Path.js","// @flow\n\nexport function themeToClassName (theme: ?string): string {\n  if (!theme) {\n    return ''\n  }\n  return `theme-${theme}`\n}\n\n\n\n// WEBPACK FOOTER //\n// ./src/shared/helpers/themeToClassName.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nvar __extends = (this && this.__extends) || (function () {\n    var extendStatics = Object.setPrototypeOf ||\n        ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n        function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };\n    return function (d, b) {\n        extendStatics(d, b);\n        function __() { this.constructor = d; }\n        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n    };\n})();\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar Index_1 = require(\"./Index\");\nvar util_1 = require(\"../../util/util\");\nvar Node_1 = require(\"../Node\");\nvar LeafNode_1 = require(\"../LeafNode\");\nvar nodeFromJSON;\nvar MAX_NODE;\nfunction setNodeFromJSON(val) {\n    nodeFromJSON = val;\n}\nexports.setNodeFromJSON = setNodeFromJSON;\nfunction setMaxNode(val) {\n    MAX_NODE = val;\n}\nexports.setMaxNode = setMaxNode;\n/**\n * @constructor\n * @extends {Index}\n * @private\n */\nvar PriorityIndex = /** @class */ (function (_super) {\n    __extends(PriorityIndex, _super);\n    function PriorityIndex() {\n        return _super !== null && _super.apply(this, arguments) || this;\n    }\n    /**\n     * @inheritDoc\n     */\n    PriorityIndex.prototype.compare = function (a, b) {\n        var aPriority = a.node.getPriority();\n        var bPriority = b.node.getPriority();\n        var indexCmp = aPriority.compareTo(bPriority);\n        if (indexCmp === 0) {\n            return util_1.nameCompare(a.name, b.name);\n        }\n        else {\n            return indexCmp;\n        }\n    };\n    /**\n     * @inheritDoc\n     */\n    PriorityIndex.prototype.isDefinedOn = function (node) {\n        return !node.getPriority().isEmpty();\n    };\n    /**\n     * @inheritDoc\n     */\n    PriorityIndex.prototype.indexedValueChanged = function (oldNode, newNode) {\n        return !oldNode.getPriority().equals(newNode.getPriority());\n    };\n    /**\n     * @inheritDoc\n     */\n    PriorityIndex.prototype.minPost = function () {\n        return Node_1.NamedNode.MIN;\n    };\n    /**\n     * @inheritDoc\n     */\n    PriorityIndex.prototype.maxPost = function () {\n        return new Node_1.NamedNode(util_1.MAX_NAME, new LeafNode_1.LeafNode('[PRIORITY-POST]', MAX_NODE));\n    };\n    /**\n     * @param {*} indexValue\n     * @param {string} name\n     * @return {!NamedNode}\n     */\n    PriorityIndex.prototype.makePost = function (indexValue, name) {\n        var priorityNode = nodeFromJSON(indexValue);\n        return new Node_1.NamedNode(name, new LeafNode_1.LeafNode('[PRIORITY-POST]', priorityNode));\n    };\n    /**\n     * @return {!string} String representation for inclusion in a query spec\n     */\n    PriorityIndex.prototype.toString = function () {\n        return '.priority';\n    };\n    return PriorityIndex;\n}(Index_1.Index));\nexports.PriorityIndex = PriorityIndex;\nexports.PRIORITY_INDEX = new PriorityIndex();\n\n//# sourceMappingURL=PriorityIndex.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/snap/indexes/PriorityIndex.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nvar __extends = (this && this.__extends) || (function () {\n    var extendStatics = Object.setPrototypeOf ||\n        ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n        function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };\n    return function (d, b) {\n        extendStatics(d, b);\n        function __() { this.constructor = d; }\n        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n    };\n})();\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = require(\"@firebase/util\");\nvar util_2 = require(\"../util/util\");\nvar SortedMap_1 = require(\"../util/SortedMap\");\nvar Node_1 = require(\"./Node\");\nvar snap_1 = require(\"./snap\");\nvar PriorityIndex_1 = require(\"./indexes/PriorityIndex\");\nvar KeyIndex_1 = require(\"./indexes/KeyIndex\");\nvar IndexMap_1 = require(\"./IndexMap\");\nvar LeafNode_1 = require(\"./LeafNode\");\nvar comparators_1 = require(\"./comparators\");\n// TODO: For memory savings, don't store priorityNode_ if it's empty.\nvar EMPTY_NODE;\n/**\n * ChildrenNode is a class for storing internal nodes in a DataSnapshot\n * (i.e. nodes with children).  It implements Node and stores the\n * list of children in the children property, sorted by child name.\n *\n * @constructor\n * @implements {Node}\n */\nvar ChildrenNode = /** @class */ (function () {\n    /**\n     *\n     * @param {!SortedMap.<string, !Node>} children_ List of children\n     * of this node..\n     * @param {?Node} priorityNode_ The priority of this node (as a snapshot node).\n     * @param {!IndexMap} indexMap_\n     */\n    function ChildrenNode(children_, priorityNode_, indexMap_) {\n        this.children_ = children_;\n        this.priorityNode_ = priorityNode_;\n        this.indexMap_ = indexMap_;\n        this.lazyHash_ = null;\n        /**\n         * Note: The only reason we allow null priority is for EMPTY_NODE, since we can't use\n         * EMPTY_NODE as the priority of EMPTY_NODE.  We might want to consider making EMPTY_NODE its own\n         * class instead of an empty ChildrenNode.\n         */\n        if (this.priorityNode_) {\n            snap_1.validatePriorityNode(this.priorityNode_);\n        }\n        if (this.children_.isEmpty()) {\n            util_1.assert(!this.priorityNode_ || this.priorityNode_.isEmpty(), 'An empty node cannot have a priority');\n        }\n    }\n    Object.defineProperty(ChildrenNode, \"EMPTY_NODE\", {\n        get: function () {\n            return (EMPTY_NODE ||\n                (EMPTY_NODE = new ChildrenNode(new SortedMap_1.SortedMap(comparators_1.NAME_COMPARATOR), null, IndexMap_1.IndexMap.Default)));\n        },\n        enumerable: true,\n        configurable: true\n    });\n    /** @inheritDoc */\n    ChildrenNode.prototype.isLeafNode = function () {\n        return false;\n    };\n    /** @inheritDoc */\n    ChildrenNode.prototype.getPriority = function () {\n        return this.priorityNode_ || EMPTY_NODE;\n    };\n    /** @inheritDoc */\n    ChildrenNode.prototype.updatePriority = function (newPriorityNode) {\n        if (this.children_.isEmpty()) {\n            // Don't allow priorities on empty nodes\n            return this;\n        }\n        else {\n            return new ChildrenNode(this.children_, newPriorityNode, this.indexMap_);\n        }\n    };\n    /** @inheritDoc */\n    ChildrenNode.prototype.getImmediateChild = function (childName) {\n        // Hack to treat priority as a regular child\n        if (childName === '.priority') {\n            return this.getPriority();\n        }\n        else {\n            var child = this.children_.get(childName);\n            return child === null ? EMPTY_NODE : child;\n        }\n    };\n    /** @inheritDoc */\n    ChildrenNode.prototype.getChild = function (path) {\n        var front = path.getFront();\n        if (front === null)\n            return this;\n        return this.getImmediateChild(front).getChild(path.popFront());\n    };\n    /** @inheritDoc */\n    ChildrenNode.prototype.hasChild = function (childName) {\n        return this.children_.get(childName) !== null;\n    };\n    /** @inheritDoc */\n    ChildrenNode.prototype.updateImmediateChild = function (childName, newChildNode) {\n        util_1.assert(newChildNode, 'We should always be passing snapshot nodes');\n        if (childName === '.priority') {\n            return this.updatePriority(newChildNode);\n        }\n        else {\n            var namedNode = new Node_1.NamedNode(childName, newChildNode);\n            var newChildren = void 0, newIndexMap = void 0, newPriority = void 0;\n            if (newChildNode.isEmpty()) {\n                newChildren = this.children_.remove(childName);\n                newIndexMap = this.indexMap_.removeFromIndexes(namedNode, this.children_);\n            }\n            else {\n                newChildren = this.children_.insert(childName, newChildNode);\n                newIndexMap = this.indexMap_.addToIndexes(namedNode, this.children_);\n            }\n            newPriority = newChildren.isEmpty() ? EMPTY_NODE : this.priorityNode_;\n            return new ChildrenNode(newChildren, newPriority, newIndexMap);\n        }\n    };\n    /** @inheritDoc */\n    ChildrenNode.prototype.updateChild = function (path, newChildNode) {\n        var front = path.getFront();\n        if (front === null) {\n            return newChildNode;\n        }\n        else {\n            util_1.assert(path.getFront() !== '.priority' || path.getLength() === 1, '.priority must be the last token in a path');\n            var newImmediateChild = this.getImmediateChild(front).updateChild(path.popFront(), newChildNode);\n            return this.updateImmediateChild(front, newImmediateChild);\n        }\n    };\n    /** @inheritDoc */\n    ChildrenNode.prototype.isEmpty = function () {\n        return this.children_.isEmpty();\n    };\n    /** @inheritDoc */\n    ChildrenNode.prototype.numChildren = function () {\n        return this.children_.count();\n    };\n    /** @inheritDoc */\n    ChildrenNode.prototype.val = function (exportFormat) {\n        if (this.isEmpty())\n            return null;\n        var obj = {};\n        var numKeys = 0, maxKey = 0, allIntegerKeys = true;\n        this.forEachChild(PriorityIndex_1.PRIORITY_INDEX, function (key, childNode) {\n            obj[key] = childNode.val(exportFormat);\n            numKeys++;\n            if (allIntegerKeys && ChildrenNode.INTEGER_REGEXP_.test(key)) {\n                maxKey = Math.max(maxKey, Number(key));\n            }\n            else {\n                allIntegerKeys = false;\n            }\n        });\n        if (!exportFormat && allIntegerKeys && maxKey < 2 * numKeys) {\n            // convert to array.\n            var array = [];\n            for (var key in obj)\n                array[key] = obj[key];\n            return array;\n        }\n        else {\n            if (exportFormat && !this.getPriority().isEmpty()) {\n                obj['.priority'] = this.getPriority().val();\n            }\n            return obj;\n        }\n    };\n    /** @inheritDoc */\n    ChildrenNode.prototype.hash = function () {\n        if (this.lazyHash_ === null) {\n            var toHash_1 = '';\n            if (!this.getPriority().isEmpty())\n                toHash_1 +=\n                    'priority:' +\n                        snap_1.priorityHashText(this.getPriority().val()) +\n                        ':';\n            this.forEachChild(PriorityIndex_1.PRIORITY_INDEX, function (key, childNode) {\n                var childHash = childNode.hash();\n                if (childHash !== '')\n                    toHash_1 += ':' + key + ':' + childHash;\n            });\n            this.lazyHash_ = toHash_1 === '' ? '' : util_2.sha1(toHash_1);\n        }\n        return this.lazyHash_;\n    };\n    /** @inheritDoc */\n    ChildrenNode.prototype.getPredecessorChildName = function (childName, childNode, index) {\n        var idx = this.resolveIndex_(index);\n        if (idx) {\n            var predecessor = idx.getPredecessorKey(new Node_1.NamedNode(childName, childNode));\n            return predecessor ? predecessor.name : null;\n        }\n        else {\n            return this.children_.getPredecessorKey(childName);\n        }\n    };\n    /**\n     * @param {!Index} indexDefinition\n     * @return {?string}\n     */\n    ChildrenNode.prototype.getFirstChildName = function (indexDefinition) {\n        var idx = this.resolveIndex_(indexDefinition);\n        if (idx) {\n            var minKey = idx.minKey();\n            return minKey && minKey.name;\n        }\n        else {\n            return this.children_.minKey();\n        }\n    };\n    /**\n     * @param {!Index} indexDefinition\n     * @return {?NamedNode}\n     */\n    ChildrenNode.prototype.getFirstChild = function (indexDefinition) {\n        var minKey = this.getFirstChildName(indexDefinition);\n        if (minKey) {\n            return new Node_1.NamedNode(minKey, this.children_.get(minKey));\n        }\n        else {\n            return null;\n        }\n    };\n    /**\n     * Given an index, return the key name of the largest value we have, according to that index\n     * @param {!Index} indexDefinition\n     * @return {?string}\n     */\n    ChildrenNode.prototype.getLastChildName = function (indexDefinition) {\n        var idx = this.resolveIndex_(indexDefinition);\n        if (idx) {\n            var maxKey = idx.maxKey();\n            return maxKey && maxKey.name;\n        }\n        else {\n            return this.children_.maxKey();\n        }\n    };\n    /**\n     * @param {!Index} indexDefinition\n     * @return {?NamedNode}\n     */\n    ChildrenNode.prototype.getLastChild = function (indexDefinition) {\n        var maxKey = this.getLastChildName(indexDefinition);\n        if (maxKey) {\n            return new Node_1.NamedNode(maxKey, this.children_.get(maxKey));\n        }\n        else {\n            return null;\n        }\n    };\n    /**\n     * @inheritDoc\n     */\n    ChildrenNode.prototype.forEachChild = function (index, action) {\n        var idx = this.resolveIndex_(index);\n        if (idx) {\n            return idx.inorderTraversal(function (wrappedNode) {\n                return action(wrappedNode.name, wrappedNode.node);\n            });\n        }\n        else {\n            return this.children_.inorderTraversal(action);\n        }\n    };\n    /**\n     * @param {!Index} indexDefinition\n     * @return {SortedMapIterator}\n     */\n    ChildrenNode.prototype.getIterator = function (indexDefinition) {\n        return this.getIteratorFrom(indexDefinition.minPost(), indexDefinition);\n    };\n    /**\n     *\n     * @param {!NamedNode} startPost\n     * @param {!Index} indexDefinition\n     * @return {!SortedMapIterator}\n     */\n    ChildrenNode.prototype.getIteratorFrom = function (startPost, indexDefinition) {\n        var idx = this.resolveIndex_(indexDefinition);\n        if (idx) {\n            return idx.getIteratorFrom(startPost, function (key) { return key; });\n        }\n        else {\n            var iterator = this.children_.getIteratorFrom(startPost.name, Node_1.NamedNode.Wrap);\n            var next = iterator.peek();\n            while (next != null && indexDefinition.compare(next, startPost) < 0) {\n                iterator.getNext();\n                next = iterator.peek();\n            }\n            return iterator;\n        }\n    };\n    /**\n     * @param {!Index} indexDefinition\n     * @return {!SortedMapIterator}\n     */\n    ChildrenNode.prototype.getReverseIterator = function (indexDefinition) {\n        return this.getReverseIteratorFrom(indexDefinition.maxPost(), indexDefinition);\n    };\n    /**\n     * @param {!NamedNode} endPost\n     * @param {!Index} indexDefinition\n     * @return {!SortedMapIterator}\n     */\n    ChildrenNode.prototype.getReverseIteratorFrom = function (endPost, indexDefinition) {\n        var idx = this.resolveIndex_(indexDefinition);\n        if (idx) {\n            return idx.getReverseIteratorFrom(endPost, function (key) {\n                return key;\n            });\n        }\n        else {\n            var iterator = this.children_.getReverseIteratorFrom(endPost.name, Node_1.NamedNode.Wrap);\n            var next = iterator.peek();\n            while (next != null && indexDefinition.compare(next, endPost) > 0) {\n                iterator.getNext();\n                next = iterator.peek();\n            }\n            return iterator;\n        }\n    };\n    /**\n     * @inheritDoc\n     */\n    ChildrenNode.prototype.compareTo = function (other) {\n        if (this.isEmpty()) {\n            if (other.isEmpty()) {\n                return 0;\n            }\n            else {\n                return -1;\n            }\n        }\n        else if (other.isLeafNode() || other.isEmpty()) {\n            return 1;\n        }\n        else if (other === exports.MAX_NODE) {\n            return -1;\n        }\n        else {\n            // Must be another node with children.\n            return 0;\n        }\n    };\n    /**\n     * @inheritDoc\n     */\n    ChildrenNode.prototype.withIndex = function (indexDefinition) {\n        if (indexDefinition === KeyIndex_1.KEY_INDEX ||\n            this.indexMap_.hasIndex(indexDefinition)) {\n            return this;\n        }\n        else {\n            var newIndexMap = this.indexMap_.addIndex(indexDefinition, this.children_);\n            return new ChildrenNode(this.children_, this.priorityNode_, newIndexMap);\n        }\n    };\n    /**\n     * @inheritDoc\n     */\n    ChildrenNode.prototype.isIndexed = function (index) {\n        return index === KeyIndex_1.KEY_INDEX || this.indexMap_.hasIndex(index);\n    };\n    /**\n     * @inheritDoc\n     */\n    ChildrenNode.prototype.equals = function (other) {\n        if (other === this) {\n            return true;\n        }\n        else if (other.isLeafNode()) {\n            return false;\n        }\n        else {\n            var otherChildrenNode = other;\n            if (!this.getPriority().equals(otherChildrenNode.getPriority())) {\n                return false;\n            }\n            else if (this.children_.count() === otherChildrenNode.children_.count()) {\n                var thisIter = this.getIterator(PriorityIndex_1.PRIORITY_INDEX);\n                var otherIter = otherChildrenNode.getIterator(PriorityIndex_1.PRIORITY_INDEX);\n                var thisCurrent = thisIter.getNext();\n                var otherCurrent = otherIter.getNext();\n                while (thisCurrent && otherCurrent) {\n                    if (thisCurrent.name !== otherCurrent.name ||\n                        !thisCurrent.node.equals(otherCurrent.node)) {\n                        return false;\n                    }\n                    thisCurrent = thisIter.getNext();\n                    otherCurrent = otherIter.getNext();\n                }\n                return thisCurrent === null && otherCurrent === null;\n            }\n            else {\n                return false;\n            }\n        }\n    };\n    /**\n     * Returns a SortedMap ordered by index, or null if the default (by-key) ordering can be used\n     * instead.\n     *\n     * @private\n     * @param {!Index} indexDefinition\n     * @return {?SortedMap.<NamedNode, Node>}\n     */\n    ChildrenNode.prototype.resolveIndex_ = function (indexDefinition) {\n        if (indexDefinition === KeyIndex_1.KEY_INDEX) {\n            return null;\n        }\n        else {\n            return this.indexMap_.get(indexDefinition.toString());\n        }\n    };\n    /**\n     * @private\n     * @type {RegExp}\n     */\n    ChildrenNode.INTEGER_REGEXP_ = /^(0|[1-9]\\d*)$/;\n    return ChildrenNode;\n}());\nexports.ChildrenNode = ChildrenNode;\n/**\n * @constructor\n * @extends {ChildrenNode}\n * @private\n */\nvar MaxNode = /** @class */ (function (_super) {\n    __extends(MaxNode, _super);\n    function MaxNode() {\n        return _super.call(this, new SortedMap_1.SortedMap(comparators_1.NAME_COMPARATOR), ChildrenNode.EMPTY_NODE, IndexMap_1.IndexMap.Default) || this;\n    }\n    MaxNode.prototype.compareTo = function (other) {\n        if (other === this) {\n            return 0;\n        }\n        else {\n            return 1;\n        }\n    };\n    MaxNode.prototype.equals = function (other) {\n        // Not that we every compare it, but MAX_NODE is only ever equal to itself\n        return other === this;\n    };\n    MaxNode.prototype.getPriority = function () {\n        return this;\n    };\n    MaxNode.prototype.getImmediateChild = function (childName) {\n        return ChildrenNode.EMPTY_NODE;\n    };\n    MaxNode.prototype.isEmpty = function () {\n        return false;\n    };\n    return MaxNode;\n}(ChildrenNode));\nexports.MaxNode = MaxNode;\n/**\n * Marker that will sort higher than any other snapshot.\n * @type {!MAX_NODE}\n * @const\n */\nexports.MAX_NODE = new MaxNode();\nObject.defineProperties(Node_1.NamedNode, {\n    MIN: {\n        value: new Node_1.NamedNode(util_2.MIN_NAME, ChildrenNode.EMPTY_NODE)\n    },\n    MAX: {\n        value: new Node_1.NamedNode(util_2.MAX_NAME, exports.MAX_NODE)\n    }\n});\n/**\n * Reference Extensions\n */\nKeyIndex_1.KeyIndex.__EMPTY_NODE = ChildrenNode.EMPTY_NODE;\nLeafNode_1.LeafNode.__childrenNodeConstructor = ChildrenNode;\nsnap_1.setMaxNode(exports.MAX_NODE);\nPriorityIndex_1.setMaxNode(exports.MAX_NODE);\n\n//# sourceMappingURL=ChildrenNode.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/snap/ChildrenNode.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\n/**\n *\n * @param {!string} name\n * @param {!Node} node\n * @constructor\n * @struct\n */\nvar NamedNode = /** @class */ (function () {\n    function NamedNode(name, node) {\n        this.name = name;\n        this.node = node;\n    }\n    /**\n     *\n     * @param {!string} name\n     * @param {!Node} node\n     * @return {NamedNode}\n     */\n    NamedNode.Wrap = function (name, node) {\n        return new NamedNode(name, node);\n    };\n    return NamedNode;\n}());\nexports.NamedNode = NamedNode;\n\n//# sourceMappingURL=Node.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/snap/Node.js","// removed by extract-text-webpack-plugin\nmodule.exports = {\"resultItem\":\"dh-stemning-resultItem\",\"resultItem__label\":\"dh-stemning-resultItem__label\",\"resultItem__score-wrapper\":\"dh-stemning-resultItem__score-wrapper\",\"resultItem__score\":\"dh-stemning-resultItem__score\",\"resultItem__score--hidden\":\"dh-stemning-resultItem__score--hidden\",\"resultItem__score-text\":\"dh-stemning-resultItem__score-text\",\"score-text-wrapper\":\"dh-stemning-score-text-wrapper\",\"resultList__sr\":\"dh-stemning-resultList__sr\",\"resultList__bars\":\"dh-stemning-resultList__bars\",\"resultList__text\":\"dh-stemning-resultList__text\"};\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./src/shared/components/Result/components/ResultList/components/ResultItem/ResultItem.css\n// module id = 9\n// module chunks = 0 1 2","import type { Breakpoint } from '../types'\n\ntype BreakpointObj = {\n  [key: Breakpoint]: number\n}\n\nconst BREAKPOINTS: BreakpointObj = {\n  XS: 0,\n  S: 400,\n  M: 600,\n  L: 750,\n  XL: 1500\n}\n\nfunction getCurrentBreakpoint (width: number) {\n  return Object.keys(BREAKPOINTS)\n    .sort((a, b) => BREAKPOINTS[b] - BREAKPOINTS[a])\n    .find(bp => width > BREAKPOINTS[bp])\n}\n\nfunction breakpointToClassName (currentBreakpoint: Breakpoint): string {\n  switch (currentBreakpoint) {\n    case 'XS':\n      return 'extra-small'\n    case 'S':\n      return 'small'\n    case 'L':\n      return 'large'\n    case 'XL':\n      return 'extra-large'\n    case 'M':\n    default:\n      return 'medium'\n  }\n}\n\nexport { breakpointToClassName, getCurrentBreakpoint }\n\n\n\n// WEBPACK FOOTER //\n// ./src/shared/helpers/breakpointToClassName.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar Path_1 = require(\"./Path\");\nvar util_1 = require(\"@firebase/util\");\nvar util_2 = require(\"./util\");\nvar util_3 = require(\"@firebase/util\");\nvar util_4 = require(\"@firebase/util\");\n/**\n * True for invalid Firebase keys\n * @type {RegExp}\n * @private\n */\nexports.INVALID_KEY_REGEX_ = /[\\[\\].#$\\/\\u0000-\\u001F\\u007F]/;\n/**\n * True for invalid Firebase paths.\n * Allows '/' in paths.\n * @type {RegExp}\n * @private\n */\nexports.INVALID_PATH_REGEX_ = /[\\[\\].#$\\u0000-\\u001F\\u007F]/;\n/**\n * Maximum number of characters to allow in leaf value\n * @type {number}\n * @private\n */\nexports.MAX_LEAF_SIZE_ = 10 * 1024 * 1024;\n/**\n * @param {*} key\n * @return {boolean}\n */\nexports.isValidKey = function (key) {\n    return (typeof key === 'string' && key.length !== 0 && !exports.INVALID_KEY_REGEX_.test(key));\n};\n/**\n * @param {string} pathString\n * @return {boolean}\n */\nexports.isValidPathString = function (pathString) {\n    return (typeof pathString === 'string' &&\n        pathString.length !== 0 &&\n        !exports.INVALID_PATH_REGEX_.test(pathString));\n};\n/**\n * @param {string} pathString\n * @return {boolean}\n */\nexports.isValidRootPathString = function (pathString) {\n    if (pathString) {\n        // Allow '/.info/' at the beginning.\n        pathString = pathString.replace(/^\\/*\\.info(\\/|$)/, '/');\n    }\n    return exports.isValidPathString(pathString);\n};\n/**\n * @param {*} priority\n * @return {boolean}\n */\nexports.isValidPriority = function (priority) {\n    return (priority === null ||\n        typeof priority === 'string' ||\n        (typeof priority === 'number' && !util_2.isInvalidJSONNumber(priority)) ||\n        (priority && typeof priority === 'object' && util_1.contains(priority, '.sv')));\n};\n/**\n * Pre-validate a datum passed as an argument to Firebase function.\n *\n * @param {string} fnName\n * @param {number} argumentNumber\n * @param {*} data\n * @param {!Path} path\n * @param {boolean} optional\n */\nexports.validateFirebaseDataArg = function (fnName, argumentNumber, data, path, optional) {\n    if (optional && data === undefined)\n        return;\n    exports.validateFirebaseData(util_3.errorPrefix(fnName, argumentNumber, optional), data, path);\n};\n/**\n * Validate a data object client-side before sending to server.\n *\n * @param {string} errorPrefix\n * @param {*} data\n * @param {!Path|!ValidationPath} path_\n */\nexports.validateFirebaseData = function (errorPrefix, data, path_) {\n    var path = path_ instanceof Path_1.Path ? new Path_1.ValidationPath(path_, errorPrefix) : path_;\n    if (data === undefined) {\n        throw new Error(errorPrefix + 'contains undefined ' + path.toErrorString());\n    }\n    if (typeof data === 'function') {\n        throw new Error(errorPrefix +\n            'contains a function ' +\n            path.toErrorString() +\n            ' with contents = ' +\n            data.toString());\n    }\n    if (util_2.isInvalidJSONNumber(data)) {\n        throw new Error(errorPrefix + 'contains ' + data.toString() + ' ' + path.toErrorString());\n    }\n    // Check max leaf size, but try to avoid the utf8 conversion if we can.\n    if (typeof data === 'string' &&\n        data.length > exports.MAX_LEAF_SIZE_ / 3 &&\n        util_4.stringLength(data) > exports.MAX_LEAF_SIZE_) {\n        throw new Error(errorPrefix +\n            'contains a string greater than ' +\n            exports.MAX_LEAF_SIZE_ +\n            ' utf8 bytes ' +\n            path.toErrorString() +\n            \" ('\" +\n            data.substring(0, 50) +\n            \"...')\");\n    }\n    // TODO = Perf = Consider combining the recursive validation of keys into NodeFromJSON\n    // to save extra walking of large objects.\n    if (data && typeof data === 'object') {\n        var hasDotValue_1 = false, hasActualChild_1 = false;\n        util_1.forEach(data, function (key, value) {\n            if (key === '.value') {\n                hasDotValue_1 = true;\n            }\n            else if (key !== '.priority' && key !== '.sv') {\n                hasActualChild_1 = true;\n                if (!exports.isValidKey(key)) {\n                    throw new Error(errorPrefix +\n                        ' contains an invalid key (' +\n                        key +\n                        ') ' +\n                        path.toErrorString() +\n                        '.  Keys must be non-empty strings ' +\n                        'and can\\'t contain \".\", \"#\", \"$\", \"/\", \"[\", or \"]\"');\n                }\n            }\n            path.push(key);\n            exports.validateFirebaseData(errorPrefix, value, path);\n            path.pop();\n        });\n        if (hasDotValue_1 && hasActualChild_1) {\n            throw new Error(errorPrefix +\n                ' contains \".value\" child ' +\n                path.toErrorString() +\n                ' in addition to actual children.');\n        }\n    }\n};\n/**\n * Pre-validate paths passed in the firebase function.\n *\n * @param {string} errorPrefix\n * @param {Array<!Path>} mergePaths\n */\nexports.validateFirebaseMergePaths = function (errorPrefix, mergePaths) {\n    var i, curPath;\n    for (i = 0; i < mergePaths.length; i++) {\n        curPath = mergePaths[i];\n        var keys = curPath.slice();\n        for (var j = 0; j < keys.length; j++) {\n            if (keys[j] === '.priority' && j === keys.length - 1) {\n                // .priority is OK\n            }\n            else if (!exports.isValidKey(keys[j])) {\n                throw new Error(errorPrefix +\n                    'contains an invalid key (' +\n                    keys[j] +\n                    ') in path ' +\n                    curPath.toString() +\n                    '. Keys must be non-empty strings ' +\n                    'and can\\'t contain \".\", \"#\", \"$\", \"/\", \"[\", or \"]\"');\n            }\n        }\n    }\n    // Check that update keys are not descendants of each other.\n    // We rely on the property that sorting guarantees that ancestors come\n    // right before descendants.\n    mergePaths.sort(Path_1.Path.comparePaths);\n    var prevPath = null;\n    for (i = 0; i < mergePaths.length; i++) {\n        curPath = mergePaths[i];\n        if (prevPath !== null && prevPath.contains(curPath)) {\n            throw new Error(errorPrefix +\n                'contains a path ' +\n                prevPath.toString() +\n                ' that is ancestor of another path ' +\n                curPath.toString());\n        }\n        prevPath = curPath;\n    }\n};\n/**\n * pre-validate an object passed as an argument to firebase function (\n * must be an object - e.g. for firebase.update()).\n *\n * @param {string} fnName\n * @param {number} argumentNumber\n * @param {*} data\n * @param {!Path} path\n * @param {boolean} optional\n */\nexports.validateFirebaseMergeDataArg = function (fnName, argumentNumber, data, path, optional) {\n    if (optional && data === undefined)\n        return;\n    var errorPrefix = util_3.errorPrefix(fnName, argumentNumber, optional);\n    if (!(data && typeof data === 'object') || Array.isArray(data)) {\n        throw new Error(errorPrefix + ' must be an object containing the children to replace.');\n    }\n    var mergePaths = [];\n    util_1.forEach(data, function (key, value) {\n        var curPath = new Path_1.Path(key);\n        exports.validateFirebaseData(errorPrefix, value, path.child(curPath));\n        if (curPath.getBack() === '.priority') {\n            if (!exports.isValidPriority(value)) {\n                throw new Error(errorPrefix +\n                    \"contains an invalid value for '\" +\n                    curPath.toString() +\n                    \"', which must be a valid \" +\n                    'Firebase priority (a string, finite number, server value, or null).');\n            }\n        }\n        mergePaths.push(curPath);\n    });\n    exports.validateFirebaseMergePaths(errorPrefix, mergePaths);\n};\nexports.validatePriority = function (fnName, argumentNumber, priority, optional) {\n    if (optional && priority === undefined)\n        return;\n    if (util_2.isInvalidJSONNumber(priority))\n        throw new Error(util_3.errorPrefix(fnName, argumentNumber, optional) +\n            'is ' +\n            priority.toString() +\n            ', but must be a valid Firebase priority (a string, finite number, ' +\n            'server value, or null).');\n    // Special case to allow importing data with a .sv.\n    if (!exports.isValidPriority(priority))\n        throw new Error(util_3.errorPrefix(fnName, argumentNumber, optional) +\n            'must be a valid Firebase priority ' +\n            '(a string, finite number, server value, or null).');\n};\nexports.validateEventType = function (fnName, argumentNumber, eventType, optional) {\n    if (optional && eventType === undefined)\n        return;\n    switch (eventType) {\n        case 'value':\n        case 'child_added':\n        case 'child_removed':\n        case 'child_changed':\n        case 'child_moved':\n            break;\n        default:\n            throw new Error(util_3.errorPrefix(fnName, argumentNumber, optional) +\n                'must be a valid event type = \"value\", \"child_added\", \"child_removed\", ' +\n                '\"child_changed\", or \"child_moved\".');\n    }\n};\nexports.validateKey = function (fnName, argumentNumber, key, optional) {\n    if (optional && key === undefined)\n        return;\n    if (!exports.isValidKey(key))\n        throw new Error(util_3.errorPrefix(fnName, argumentNumber, optional) +\n            'was an invalid key = \"' +\n            key +\n            '\".  Firebase keys must be non-empty strings and ' +\n            'can\\'t contain \".\", \"#\", \"$\", \"/\", \"[\", or \"]\").');\n};\nexports.validatePathString = function (fnName, argumentNumber, pathString, optional) {\n    if (optional && pathString === undefined)\n        return;\n    if (!exports.isValidPathString(pathString))\n        throw new Error(util_3.errorPrefix(fnName, argumentNumber, optional) +\n            'was an invalid path = \"' +\n            pathString +\n            '\". Paths must be non-empty strings and ' +\n            'can\\'t contain \".\", \"#\", \"$\", \"[\", or \"]\"');\n};\nexports.validateRootPathString = function (fnName, argumentNumber, pathString, optional) {\n    if (pathString) {\n        // Allow '/.info/' at the beginning.\n        pathString = pathString.replace(/^\\/*\\.info(\\/|$)/, '/');\n    }\n    exports.validatePathString(fnName, argumentNumber, pathString, optional);\n};\nexports.validateWritablePath = function (fnName, path) {\n    if (path.getFront() === '.info') {\n        throw new Error(fnName + \" failed = Can't modify data under /.info/\");\n    }\n};\nexports.validateUrl = function (fnName, argumentNumber, parsedUrl) {\n    // TODO = Validate server better.\n    var pathString = parsedUrl.path.toString();\n    if (!(typeof parsedUrl.repoInfo.host === 'string') ||\n        parsedUrl.repoInfo.host.length === 0 ||\n        !exports.isValidKey(parsedUrl.repoInfo.namespace) ||\n        (pathString.length !== 0 && !exports.isValidRootPathString(pathString))) {\n        throw new Error(util_3.errorPrefix(fnName, argumentNumber, false) +\n            'must be a valid firebase URL and ' +\n            'the path can\\'t contain \".\", \"#\", \"$\", \"[\", or \"]\".');\n    }\n};\nexports.validateCredential = function (fnName, argumentNumber, cred, optional) {\n    if (optional && cred === undefined)\n        return;\n    if (!(typeof cred === 'string'))\n        throw new Error(util_3.errorPrefix(fnName, argumentNumber, optional) +\n            'must be a valid credential (a string).');\n};\nexports.validateBoolean = function (fnName, argumentNumber, bool, optional) {\n    if (optional && bool === undefined)\n        return;\n    if (typeof bool !== 'boolean')\n        throw new Error(util_3.errorPrefix(fnName, argumentNumber, optional) + 'must be a boolean.');\n};\nexports.validateString = function (fnName, argumentNumber, string, optional) {\n    if (optional && string === undefined)\n        return;\n    if (!(typeof string === 'string')) {\n        throw new Error(util_3.errorPrefix(fnName, argumentNumber, optional) +\n            'must be a valid string.');\n    }\n};\nexports.validateObject = function (fnName, argumentNumber, obj, optional) {\n    if (optional && obj === undefined)\n        return;\n    if (!(obj && typeof obj === 'object') || obj === null) {\n        throw new Error(util_3.errorPrefix(fnName, argumentNumber, optional) +\n            'must be a valid object.');\n    }\n};\nexports.validateObjectContainsKey = function (fnName, argumentNumber, obj, key, optional, opt_type) {\n    var objectContainsKey = obj && typeof obj === 'object' && util_1.contains(obj, key);\n    if (!objectContainsKey) {\n        if (optional) {\n            return;\n        }\n        else {\n            throw new Error(util_3.errorPrefix(fnName, argumentNumber, optional) +\n                'must contain the key \"' +\n                key +\n                '\"');\n        }\n    }\n    if (opt_type) {\n        var val = util_1.safeGet(obj, key);\n        if ((opt_type === 'number' && !(typeof val === 'number')) ||\n            (opt_type === 'string' && !(typeof val === 'string')) ||\n            (opt_type === 'boolean' && !(typeof val === 'boolean')) ||\n            (opt_type === 'function' && !(typeof val === 'function')) ||\n            (opt_type === 'object' && !(typeof val === 'object') && val)) {\n            if (optional) {\n                throw new Error(util_3.errorPrefix(fnName, argumentNumber, optional) +\n                    'contains invalid value for key \"' +\n                    key +\n                    '\" (must be of type \"' +\n                    opt_type +\n                    '\")');\n            }\n            else {\n                throw new Error(util_3.errorPrefix(fnName, argumentNumber, optional) +\n                    'must contain the key \"' +\n                    key +\n                    '\" with type \"' +\n                    opt_type +\n                    '\"');\n            }\n        }\n    }\n};\n\n//# sourceMappingURL=validation.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/util/validation.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = require(\"@firebase/util\");\n/**\n *\n * @enum\n */\nvar OperationType;\n(function (OperationType) {\n    OperationType[OperationType[\"OVERWRITE\"] = 0] = \"OVERWRITE\";\n    OperationType[OperationType[\"MERGE\"] = 1] = \"MERGE\";\n    OperationType[OperationType[\"ACK_USER_WRITE\"] = 2] = \"ACK_USER_WRITE\";\n    OperationType[OperationType[\"LISTEN_COMPLETE\"] = 3] = \"LISTEN_COMPLETE\";\n})(OperationType = exports.OperationType || (exports.OperationType = {}));\n/**\n * @param {boolean} fromUser\n * @param {boolean} fromServer\n * @param {?string} queryId\n * @param {boolean} tagged\n * @constructor\n */\nvar OperationSource = /** @class */ (function () {\n    function OperationSource(fromUser, fromServer, queryId, tagged) {\n        this.fromUser = fromUser;\n        this.fromServer = fromServer;\n        this.queryId = queryId;\n        this.tagged = tagged;\n        util_1.assert(!tagged || fromServer, 'Tagged queries must be from server.');\n    }\n    /**\n     * @const\n     * @type {!OperationSource}\n     */\n    OperationSource.User = new OperationSource(\n    /*fromUser=*/ true, false, null, \n    /*tagged=*/ false);\n    /**\n     * @const\n     * @type {!OperationSource}\n     */\n    OperationSource.Server = new OperationSource(false, \n    /*fromServer=*/ true, null, \n    /*tagged=*/ false);\n    /**\n     * @param {string} queryId\n     * @return {!OperationSource}\n     */\n    OperationSource.forServerTaggedQuery = function (queryId) {\n        return new OperationSource(false, \n        /*fromServer=*/ true, queryId, \n        /*tagged=*/ true);\n    };\n    return OperationSource;\n}());\nexports.OperationSource = OperationSource;\n\n//# sourceMappingURL=Operation.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/operation/Operation.js","var isDate = require('../is_date/index.js')\n\nvar MILLISECONDS_IN_HOUR = 3600000\nvar MILLISECONDS_IN_MINUTE = 60000\nvar DEFAULT_ADDITIONAL_DIGITS = 2\n\nvar parseTokenDateTimeDelimeter = /[T ]/\nvar parseTokenPlainTime = /:/\n\n// year tokens\nvar parseTokenYY = /^(\\d{2})$/\nvar parseTokensYYY = [\n  /^([+-]\\d{2})$/, // 0 additional digits\n  /^([+-]\\d{3})$/, // 1 additional digit\n  /^([+-]\\d{4})$/ // 2 additional digits\n]\n\nvar parseTokenYYYY = /^(\\d{4})/\nvar parseTokensYYYYY = [\n  /^([+-]\\d{4})/, // 0 additional digits\n  /^([+-]\\d{5})/, // 1 additional digit\n  /^([+-]\\d{6})/ // 2 additional digits\n]\n\n// date tokens\nvar parseTokenMM = /^-(\\d{2})$/\nvar parseTokenDDD = /^-?(\\d{3})$/\nvar parseTokenMMDD = /^-?(\\d{2})-?(\\d{2})$/\nvar parseTokenWww = /^-?W(\\d{2})$/\nvar parseTokenWwwD = /^-?W(\\d{2})-?(\\d{1})$/\n\n// time tokens\nvar parseTokenHH = /^(\\d{2}([.,]\\d*)?)$/\nvar parseTokenHHMM = /^(\\d{2}):?(\\d{2}([.,]\\d*)?)$/\nvar parseTokenHHMMSS = /^(\\d{2}):?(\\d{2}):?(\\d{2}([.,]\\d*)?)$/\n\n// timezone tokens\nvar parseTokenTimezone = /([Z+-].*)$/\nvar parseTokenTimezoneZ = /^(Z)$/\nvar parseTokenTimezoneHH = /^([+-])(\\d{2})$/\nvar parseTokenTimezoneHHMM = /^([+-])(\\d{2}):?(\\d{2})$/\n\n/**\n * @category Common Helpers\n * @summary Convert the given argument to an instance of Date.\n *\n * @description\n * Convert the given argument to an instance of Date.\n *\n * If the argument is an instance of Date, the function returns its clone.\n *\n * If the argument is a number, it is treated as a timestamp.\n *\n * If an argument is a string, the function tries to parse it.\n * Function accepts complete ISO 8601 formats as well as partial implementations.\n * ISO 8601: http://en.wikipedia.org/wiki/ISO_8601\n *\n * If all above fails, the function passes the given argument to Date constructor.\n *\n * @param {Date|String|Number} argument - the value to convert\n * @param {Object} [options] - the object with options\n * @param {0 | 1 | 2} [options.additionalDigits=2] - the additional number of digits in the extended year format\n * @returns {Date} the parsed date in the local time zone\n *\n * @example\n * // Convert string '2014-02-11T11:30:30' to date:\n * var result = parse('2014-02-11T11:30:30')\n * //=> Tue Feb 11 2014 11:30:30\n *\n * @example\n * // Parse string '+02014101',\n * // if the additional number of digits in the extended year format is 1:\n * var result = parse('+02014101', {additionalDigits: 1})\n * //=> Fri Apr 11 2014 00:00:00\n */\nfunction parse (argument, dirtyOptions) {\n  if (isDate(argument)) {\n    // Prevent the date to lose the milliseconds when passed to new Date() in IE10\n    return new Date(argument.getTime())\n  } else if (typeof argument !== 'string') {\n    return new Date(argument)\n  }\n\n  var options = dirtyOptions || {}\n  var additionalDigits = options.additionalDigits\n  if (additionalDigits == null) {\n    additionalDigits = DEFAULT_ADDITIONAL_DIGITS\n  } else {\n    additionalDigits = Number(additionalDigits)\n  }\n\n  var dateStrings = splitDateString(argument)\n\n  var parseYearResult = parseYear(dateStrings.date, additionalDigits)\n  var year = parseYearResult.year\n  var restDateString = parseYearResult.restDateString\n\n  var date = parseDate(restDateString, year)\n\n  if (date) {\n    var timestamp = date.getTime()\n    var time = 0\n    var offset\n\n    if (dateStrings.time) {\n      time = parseTime(dateStrings.time)\n    }\n\n    if (dateStrings.timezone) {\n      offset = parseTimezone(dateStrings.timezone)\n    } else {\n      // get offset accurate to hour in timezones that change offset\n      offset = new Date(timestamp + time).getTimezoneOffset()\n      offset = new Date(timestamp + time + offset * MILLISECONDS_IN_MINUTE).getTimezoneOffset()\n    }\n\n    return new Date(timestamp + time + offset * MILLISECONDS_IN_MINUTE)\n  } else {\n    return new Date(argument)\n  }\n}\n\nfunction splitDateString (dateString) {\n  var dateStrings = {}\n  var array = dateString.split(parseTokenDateTimeDelimeter)\n  var timeString\n\n  if (parseTokenPlainTime.test(array[0])) {\n    dateStrings.date = null\n    timeString = array[0]\n  } else {\n    dateStrings.date = array[0]\n    timeString = array[1]\n  }\n\n  if (timeString) {\n    var token = parseTokenTimezone.exec(timeString)\n    if (token) {\n      dateStrings.time = timeString.replace(token[1], '')\n      dateStrings.timezone = token[1]\n    } else {\n      dateStrings.time = timeString\n    }\n  }\n\n  return dateStrings\n}\n\nfunction parseYear (dateString, additionalDigits) {\n  var parseTokenYYY = parseTokensYYY[additionalDigits]\n  var parseTokenYYYYY = parseTokensYYYYY[additionalDigits]\n\n  var token\n\n  // YYYY or ±YYYYY\n  token = parseTokenYYYY.exec(dateString) || parseTokenYYYYY.exec(dateString)\n  if (token) {\n    var yearString = token[1]\n    return {\n      year: parseInt(yearString, 10),\n      restDateString: dateString.slice(yearString.length)\n    }\n  }\n\n  // YY or ±YYY\n  token = parseTokenYY.exec(dateString) || parseTokenYYY.exec(dateString)\n  if (token) {\n    var centuryString = token[1]\n    return {\n      year: parseInt(centuryString, 10) * 100,\n      restDateString: dateString.slice(centuryString.length)\n    }\n  }\n\n  // Invalid ISO-formatted year\n  return {\n    year: null\n  }\n}\n\nfunction parseDate (dateString, year) {\n  // Invalid ISO-formatted year\n  if (year === null) {\n    return null\n  }\n\n  var token\n  var date\n  var month\n  var week\n\n  // YYYY\n  if (dateString.length === 0) {\n    date = new Date(0)\n    date.setUTCFullYear(year)\n    return date\n  }\n\n  // YYYY-MM\n  token = parseTokenMM.exec(dateString)\n  if (token) {\n    date = new Date(0)\n    month = parseInt(token[1], 10) - 1\n    date.setUTCFullYear(year, month)\n    return date\n  }\n\n  // YYYY-DDD or YYYYDDD\n  token = parseTokenDDD.exec(dateString)\n  if (token) {\n    date = new Date(0)\n    var dayOfYear = parseInt(token[1], 10)\n    date.setUTCFullYear(year, 0, dayOfYear)\n    return date\n  }\n\n  // YYYY-MM-DD or YYYYMMDD\n  token = parseTokenMMDD.exec(dateString)\n  if (token) {\n    date = new Date(0)\n    month = parseInt(token[1], 10) - 1\n    var day = parseInt(token[2], 10)\n    date.setUTCFullYear(year, month, day)\n    return date\n  }\n\n  // YYYY-Www or YYYYWww\n  token = parseTokenWww.exec(dateString)\n  if (token) {\n    week = parseInt(token[1], 10) - 1\n    return dayOfISOYear(year, week)\n  }\n\n  // YYYY-Www-D or YYYYWwwD\n  token = parseTokenWwwD.exec(dateString)\n  if (token) {\n    week = parseInt(token[1], 10) - 1\n    var dayOfWeek = parseInt(token[2], 10) - 1\n    return dayOfISOYear(year, week, dayOfWeek)\n  }\n\n  // Invalid ISO-formatted date\n  return null\n}\n\nfunction parseTime (timeString) {\n  var token\n  var hours\n  var minutes\n\n  // hh\n  token = parseTokenHH.exec(timeString)\n  if (token) {\n    hours = parseFloat(token[1].replace(',', '.'))\n    return (hours % 24) * MILLISECONDS_IN_HOUR\n  }\n\n  // hh:mm or hhmm\n  token = parseTokenHHMM.exec(timeString)\n  if (token) {\n    hours = parseInt(token[1], 10)\n    minutes = parseFloat(token[2].replace(',', '.'))\n    return (hours % 24) * MILLISECONDS_IN_HOUR +\n      minutes * MILLISECONDS_IN_MINUTE\n  }\n\n  // hh:mm:ss or hhmmss\n  token = parseTokenHHMMSS.exec(timeString)\n  if (token) {\n    hours = parseInt(token[1], 10)\n    minutes = parseInt(token[2], 10)\n    var seconds = parseFloat(token[3].replace(',', '.'))\n    return (hours % 24) * MILLISECONDS_IN_HOUR +\n      minutes * MILLISECONDS_IN_MINUTE +\n      seconds * 1000\n  }\n\n  // Invalid ISO-formatted time\n  return null\n}\n\nfunction parseTimezone (timezoneString) {\n  var token\n  var absoluteOffset\n\n  // Z\n  token = parseTokenTimezoneZ.exec(timezoneString)\n  if (token) {\n    return 0\n  }\n\n  // ±hh\n  token = parseTokenTimezoneHH.exec(timezoneString)\n  if (token) {\n    absoluteOffset = parseInt(token[2], 10) * 60\n    return (token[1] === '+') ? -absoluteOffset : absoluteOffset\n  }\n\n  // ±hh:mm or ±hhmm\n  token = parseTokenTimezoneHHMM.exec(timezoneString)\n  if (token) {\n    absoluteOffset = parseInt(token[2], 10) * 60 + parseInt(token[3], 10)\n    return (token[1] === '+') ? -absoluteOffset : absoluteOffset\n  }\n\n  return 0\n}\n\nfunction dayOfISOYear (isoYear, week, day) {\n  week = week || 0\n  day = day || 0\n  var date = new Date(0)\n  date.setUTCFullYear(isoYear, 0, 4)\n  var fourthOfJanuaryDay = date.getUTCDay() || 7\n  var diff = week * 7 + day + 1 - fourthOfJanuaryDay\n  date.setUTCDate(date.getUTCDate() + diff)\n  return date\n}\n\nmodule.exports = parse\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/date-fns/parse/index.js","// @flow @jsx h\n\nimport { h } from 'preact'\n\nimport styles from './StemningIcon.css'\nimport { bem } from '../../helpers/bem'\nimport { themeToClassName } from '../../helpers/themeToClassName'\n\nexport const StemningIcon = (props: any, context: { theme: string }) => {\n  const { theme } = context\n\n  return (\n    <svg className={bem(styles.stemningIcon, themeToClassName(theme))}\n      xmlns='http://www.w3.org/2000/svg' width='10' height='14'>\n      <g fill-rule='evenodd'>\n        <path d='M1 14c-.6 0-1-.4-1-1V8c0-.6.5-1 1-1 .6 0 1 .4 1 1v5c0 .6-.4 1-1 1M9 14a1 1 0 0 1-1-1V5c0-.6.4-1 1-1s1 .4 1 1v8c0 .6-.4 1-1 1M5 14a1 1 0 0 1-1-1V1a1 1 0 0 1 2 0v12c0 .6-.5 1-1 1' />\n      </g>\n    </svg>\n  )\n}\n\n\n\n// WEBPACK FOOTER //\n// ./src/shared/components/StemningIcon/StemningIcon.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\n/**\n * @constructor\n * @struct\n * @param {!string} type The event type\n * @param {!Node} snapshotNode The data\n * @param {string=} childName The name for this child, if it's a child event\n * @param {Node=} oldSnap Used for intermediate processing of child changed events\n * @param {string=} prevName The name for the previous child, if applicable\n */\nvar Change = /** @class */ (function () {\n    function Change(type, snapshotNode, childName, oldSnap, prevName) {\n        this.type = type;\n        this.snapshotNode = snapshotNode;\n        this.childName = childName;\n        this.oldSnap = oldSnap;\n        this.prevName = prevName;\n    }\n    /**\n     * @param {!Node} snapshot\n     * @return {!Change}\n     */\n    Change.valueChange = function (snapshot) {\n        return new Change(Change.VALUE, snapshot);\n    };\n    /**\n     * @param {string} childKey\n     * @param {!Node} snapshot\n     * @return {!Change}\n     */\n    Change.childAddedChange = function (childKey, snapshot) {\n        return new Change(Change.CHILD_ADDED, snapshot, childKey);\n    };\n    /**\n     * @param {string} childKey\n     * @param {!Node} snapshot\n     * @return {!Change}\n     */\n    Change.childRemovedChange = function (childKey, snapshot) {\n        return new Change(Change.CHILD_REMOVED, snapshot, childKey);\n    };\n    /**\n     * @param {string} childKey\n     * @param {!Node} newSnapshot\n     * @param {!Node} oldSnapshot\n     * @return {!Change}\n     */\n    Change.childChangedChange = function (childKey, newSnapshot, oldSnapshot) {\n        return new Change(Change.CHILD_CHANGED, newSnapshot, childKey, oldSnapshot);\n    };\n    /**\n     * @param {string} childKey\n     * @param {!Node} snapshot\n     * @return {!Change}\n     */\n    Change.childMovedChange = function (childKey, snapshot) {\n        return new Change(Change.CHILD_MOVED, snapshot, childKey);\n    };\n    //event types\n    /** Event type for a child added */\n    Change.CHILD_ADDED = 'child_added';\n    /** Event type for a child removed */\n    Change.CHILD_REMOVED = 'child_removed';\n    /** Event type for a child changed */\n    Change.CHILD_CHANGED = 'child_changed';\n    /** Event type for a child moved */\n    Change.CHILD_MOVED = 'child_moved';\n    /** Event type for a value change */\n    Change.VALUE = 'value';\n    return Change;\n}());\nexports.Change = Change;\n\n//# sourceMappingURL=Change.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/view/Change.js","export function nodelistToArray (nodeList) {\n  return [].slice.call(nodeList)\n}\n\n\n\n// WEBPACK FOOTER //\n// ./src/client/helpers/nodelistToArray.js","var g;\n\n// This works in non-strict mode\ng = (function() {\n\treturn this;\n})();\n\ntry {\n\t// This works if eval is allowed (see CSP)\n\tg = g || Function(\"return this\")() || (1,eval)(\"this\");\n} catch(e) {\n\t// This works if the window reference is available\n\tif(typeof window === \"object\")\n\t\tg = window;\n}\n\n// g can still be undefined, but nothing to do about it...\n// We return undefined, instead of nothing here, so it's\n// easier to handle this case. if(!global) { ...}\n\nmodule.exports = g;\n\n\n\n// WEBPACK FOOTER //\n// (webpack)/buildin/global.js","/*!\n  * domready (c) Dustin Diaz 2014 - License MIT\n  */\n!function (name, definition) {\n\n  if (typeof module != 'undefined') module.exports = definition()\n  else if (typeof define == 'function' && typeof define.amd == 'object') define(definition)\n  else this[name] = definition()\n\n}('domready', function () {\n\n  var fns = [], listener\n    , doc = document\n    , hack = doc.documentElement.doScroll\n    , domContentLoaded = 'DOMContentLoaded'\n    , loaded = (hack ? /^loaded|^c/ : /^loaded|^i|^c/).test(doc.readyState)\n\n\n  if (!loaded)\n  doc.addEventListener(domContentLoaded, listener = function () {\n    doc.removeEventListener(domContentLoaded, listener)\n    loaded = 1\n    while (listener = fns.shift()) listener()\n  })\n\n  return function (fn) {\n    loaded ? setTimeout(fn, 0) : fns.push(fn)\n  }\n\n});\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/domready/ready.js","// removed by extract-text-webpack-plugin\nmodule.exports = {\"bar\":\"dh-stemning-bar\",\"bar--slim\":\"dh-stemning-bar--slim\",\"resultList--theme-sport-inverted\":\"dh-stemning-resultList--theme-sport-inverted\",\"resultList--theme-sport-inverted-gray\":\"dh-stemning-resultList--theme-sport-inverted-gray\",\"resultList--theme-monsen\":\"dh-stemning-resultList--theme-monsen\",\"bar__main\":\"dh-stemning-bar__main\",\"bar__main--highlighted\":\"dh-stemning-bar__main--highlighted\",\"bar__main--theme-sport\":\"dh-stemning-bar__main--theme-sport\",\"bar__main--theme-sport-inverted\":\"dh-stemning-bar__main--theme-sport-inverted\",\"bar__main--theme-sport-inverted-gray\":\"dh-stemning-bar__main--theme-sport-inverted-gray\",\"bar__main--theme-monsen\":\"dh-stemning-bar__main--theme-monsen\"};\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./src/shared/components/Result/components/ResultList/components/ResultItem/components/Bar/Bar.css\n// module id = 19\n// module chunks = 0 1 2","// @flow\nimport cookies from 'browser-cookies'\n\nconst COOKIE_PREFIX = 'stemning_'\nconst COOKIE_MAXAGE = 365\n\ntype CookieValue = {\n  hasVoted: boolean,\n  selectedAlternativeId: number\n}\n\nfunction toCookieName (pollId: number) {\n  return `${COOKIE_PREFIX}_${pollId}`\n}\n\nexport function getSelectedAlternativeId (pollId: number): ?number {\n  const cookie = getCookie(pollId)\n  return cookie && cookie.selectedAlternativeId\n}\n\nexport function getCookie (pollId: number): ?CookieValue {\n  const cookieName = toCookieName(pollId)\n  const cookieValueAsString = cookies.get(cookieName)\n  try {\n    return JSON.parse(cookieValueAsString)\n  } catch (error) {\n    return null\n  }\n}\n\nexport function setHasVoted (pollId: number, alternativeId: number) {\n  const cookieName = toCookieName(pollId)\n  const cookieValue = JSON.stringify({\n    hasVoted: true,\n    selectedAlternativeId: alternativeId\n  })\n  const cookieOptions = { expires: COOKIE_MAXAGE }\n\n  cookies.set(cookieName, cookieValue, cookieOptions)\n}\n\nexport function hasVoted (pollId: number) {\n  const cookie = getCookie(pollId)\n  return cookie && cookie.hasVoted\n}\n\nexport function cookiesEnabled () {\n  return navigator.cookieEnabled\n}\n\n\n\n// WEBPACK FOOTER //\n// ./src/shared/widgets/LivePoll/helpers/cookieUtils.js","/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nimport { createFirebaseNamespace } from './src/firebaseApp';\nexport var firebase = createFirebaseNamespace();\nexport default firebase;\n\n\n//# sourceMappingURL=index.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/app/dist/esm/index.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nvar __extends = (this && this.__extends) || (function () {\n    var extendStatics = Object.setPrototypeOf ||\n        ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n        function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };\n    return function (d, b) {\n        extendStatics(d, b);\n        function __() { this.constructor = d; }\n        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n    };\n})();\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar Index_1 = require(\"./Index\");\nvar Node_1 = require(\"../Node\");\nvar util_1 = require(\"../../util/util\");\nvar util_2 = require(\"@firebase/util\");\nvar __EMPTY_NODE;\nvar KeyIndex = /** @class */ (function (_super) {\n    __extends(KeyIndex, _super);\n    function KeyIndex() {\n        return _super !== null && _super.apply(this, arguments) || this;\n    }\n    Object.defineProperty(KeyIndex, \"__EMPTY_NODE\", {\n        get: function () {\n            return __EMPTY_NODE;\n        },\n        set: function (val) {\n            __EMPTY_NODE = val;\n        },\n        enumerable: true,\n        configurable: true\n    });\n    /**\n     * @inheritDoc\n     */\n    KeyIndex.prototype.compare = function (a, b) {\n        return util_1.nameCompare(a.name, b.name);\n    };\n    /**\n     * @inheritDoc\n     */\n    KeyIndex.prototype.isDefinedOn = function (node) {\n        // We could probably return true here (since every node has a key), but it's never called\n        // so just leaving unimplemented for now.\n        throw util_2.assertionError('KeyIndex.isDefinedOn not expected to be called.');\n    };\n    /**\n     * @inheritDoc\n     */\n    KeyIndex.prototype.indexedValueChanged = function (oldNode, newNode) {\n        return false; // The key for a node never changes.\n    };\n    /**\n     * @inheritDoc\n     */\n    KeyIndex.prototype.minPost = function () {\n        return Node_1.NamedNode.MIN;\n    };\n    /**\n     * @inheritDoc\n     */\n    KeyIndex.prototype.maxPost = function () {\n        // TODO: This should really be created once and cached in a static property, but\n        // NamedNode isn't defined yet, so I can't use it in a static.  Bleh.\n        return new Node_1.NamedNode(util_1.MAX_NAME, __EMPTY_NODE);\n    };\n    /**\n     * @param {*} indexValue\n     * @param {string} name\n     * @return {!NamedNode}\n     */\n    KeyIndex.prototype.makePost = function (indexValue, name) {\n        util_2.assert(typeof indexValue === 'string', 'KeyIndex indexValue must always be a string.');\n        // We just use empty node, but it'll never be compared, since our comparator only looks at name.\n        return new Node_1.NamedNode(indexValue, __EMPTY_NODE);\n    };\n    /**\n     * @return {!string} String representation for inclusion in a query spec\n     */\n    KeyIndex.prototype.toString = function () {\n        return '.key';\n    };\n    return KeyIndex;\n}(Index_1.Index));\nexports.KeyIndex = KeyIndex;\nexports.KEY_INDEX = new KeyIndex();\n\n//# sourceMappingURL=KeyIndex.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/snap/indexes/KeyIndex.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar ChildrenNode_1 = require(\"./ChildrenNode\");\nvar LeafNode_1 = require(\"./LeafNode\");\nvar Node_1 = require(\"./Node\");\nvar util_1 = require(\"@firebase/util\");\nvar util_2 = require(\"@firebase/util\");\nvar childSet_1 = require(\"./childSet\");\nvar comparators_1 = require(\"./comparators\");\nvar IndexMap_1 = require(\"./IndexMap\");\nvar PriorityIndex_1 = require(\"./indexes/PriorityIndex\");\nvar USE_HINZE = true;\n/**\n * Constructs a snapshot node representing the passed JSON and returns it.\n * @param {*} json JSON to create a node for.\n * @param {?string|?number=} priority Optional priority to use.  This will be ignored if the\n * passed JSON contains a .priority property.\n * @return {!Node}\n */\nfunction nodeFromJSON(json, priority) {\n    if (priority === void 0) { priority = null; }\n    if (json === null) {\n        return ChildrenNode_1.ChildrenNode.EMPTY_NODE;\n    }\n    if (typeof json === 'object' && '.priority' in json) {\n        priority = json['.priority'];\n    }\n    util_2.assert(priority === null ||\n        typeof priority === 'string' ||\n        typeof priority === 'number' ||\n        (typeof priority === 'object' && '.sv' in priority), 'Invalid priority type found: ' + typeof priority);\n    if (typeof json === 'object' && '.value' in json && json['.value'] !== null) {\n        json = json['.value'];\n    }\n    // Valid leaf nodes include non-objects or server-value wrapper objects\n    if (typeof json !== 'object' || '.sv' in json) {\n        var jsonLeaf = json;\n        return new LeafNode_1.LeafNode(jsonLeaf, nodeFromJSON(priority));\n    }\n    if (!(json instanceof Array) && USE_HINZE) {\n        var children_1 = [];\n        var childrenHavePriority_1 = false;\n        var hinzeJsonObj_1 = json;\n        util_1.forEach(hinzeJsonObj_1, function (key, child) {\n            if (typeof key !== 'string' || key.substring(0, 1) !== '.') {\n                // Ignore metadata nodes\n                var childNode = nodeFromJSON(hinzeJsonObj_1[key]);\n                if (!childNode.isEmpty()) {\n                    childrenHavePriority_1 =\n                        childrenHavePriority_1 || !childNode.getPriority().isEmpty();\n                    children_1.push(new Node_1.NamedNode(key, childNode));\n                }\n            }\n        });\n        if (children_1.length == 0) {\n            return ChildrenNode_1.ChildrenNode.EMPTY_NODE;\n        }\n        var childSet = childSet_1.buildChildSet(children_1, comparators_1.NAME_ONLY_COMPARATOR, function (namedNode) { return namedNode.name; }, comparators_1.NAME_COMPARATOR);\n        if (childrenHavePriority_1) {\n            var sortedChildSet = childSet_1.buildChildSet(children_1, PriorityIndex_1.PRIORITY_INDEX.getCompare());\n            return new ChildrenNode_1.ChildrenNode(childSet, nodeFromJSON(priority), new IndexMap_1.IndexMap({ '.priority': sortedChildSet }, { '.priority': PriorityIndex_1.PRIORITY_INDEX }));\n        }\n        else {\n            return new ChildrenNode_1.ChildrenNode(childSet, nodeFromJSON(priority), IndexMap_1.IndexMap.Default);\n        }\n    }\n    else {\n        var node_1 = ChildrenNode_1.ChildrenNode.EMPTY_NODE;\n        var jsonObj_1 = json;\n        util_1.forEach(jsonObj_1, function (key, childData) {\n            if (util_1.contains(jsonObj_1, key)) {\n                if (key.substring(0, 1) !== '.') {\n                    // ignore metadata nodes.\n                    var childNode = nodeFromJSON(childData);\n                    if (childNode.isLeafNode() || !childNode.isEmpty())\n                        node_1 = node_1.updateImmediateChild(key, childNode);\n                }\n            }\n        });\n        return node_1.updatePriority(nodeFromJSON(priority));\n    }\n}\nexports.nodeFromJSON = nodeFromJSON;\nPriorityIndex_1.setNodeFromJSON(nodeFromJSON);\n\n//# sourceMappingURL=nodeFromJSON.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/snap/nodeFromJSON.js","// @flow\nimport { nodelistToArray } from './helpers/nodelistToArray'\nimport { uuid } from './helpers/uuid'\n\n// noinspection ES6ConvertVarToLetConst\ndeclare var __HOT__: boolean\n\nexport function init (\n  rootElementClassName: string,\n  mountFn?: Function,\n  callbackFn?: Function\n) {\n  const elements = findElements(rootElementClassName)\n  elements.forEach(el => {\n    el.id = uuid()\n    window[rootElementClassName][el.id] = true\n\n    if (mountFn) mountFn(el)\n\n    if (__HOT__) {\n      // Reload CSS file\n      require('webpack/hot/emitter').on('webpackHotUpdate', currentHash => {\n        document.querySelectorAll('link[href][rel=stylesheet]').forEach(link => {\n          if (link instanceof HTMLLinkElement) {\n            const nextStyleHref = link.href.replace(/(\\?\\d+)?$/, `?${Date.now()}`)\n            link.href = nextStyleHref\n          }\n        })\n      })\n    }\n  })\n  if (callbackFn && elements && elements.length) callbackFn(elements)\n}\n\nexport function findElements (rootElementClassName: string) {\n  return nodelistToArray(document.getElementsByClassName(rootElementClassName)).filter(\n    el => !isInitialized(el, rootElementClassName)\n  )\n}\n\nexport function isInitialized (el: HTMLElement, rootElementClassName: string) {\n  return el.id && window[rootElementClassName][el.id]\n}\n\n\n\n// WEBPACK FOOTER //\n// ./src/client/init.js","export function uuid () {\n  return `_${Math.random().toString(36).substr(2, 9)}`\n}\n\n\n\n// WEBPACK FOOTER //\n// ./src/client/helpers/uuid.js","(function (root) {\n\n  // Store setTimeout reference so promise-polyfill will be unaffected by\n  // other code modifying setTimeout (like sinon.useFakeTimers())\n  var setTimeoutFunc = setTimeout;\n\n  function noop() {}\n  \n  // Polyfill for Function.prototype.bind\n  function bind(fn, thisArg) {\n    return function () {\n      fn.apply(thisArg, arguments);\n    };\n  }\n\n  function Promise(fn) {\n    if (typeof this !== 'object') throw new TypeError('Promises must be constructed via new');\n    if (typeof fn !== 'function') throw new TypeError('not a function');\n    this._state = 0;\n    this._handled = false;\n    this._value = undefined;\n    this._deferreds = [];\n\n    doResolve(fn, this);\n  }\n\n  function handle(self, deferred) {\n    while (self._state === 3) {\n      self = self._value;\n    }\n    if (self._state === 0) {\n      self._deferreds.push(deferred);\n      return;\n    }\n    self._handled = true;\n    Promise._immediateFn(function () {\n      var cb = self._state === 1 ? deferred.onFulfilled : deferred.onRejected;\n      if (cb === null) {\n        (self._state === 1 ? resolve : reject)(deferred.promise, self._value);\n        return;\n      }\n      var ret;\n      try {\n        ret = cb(self._value);\n      } catch (e) {\n        reject(deferred.promise, e);\n        return;\n      }\n      resolve(deferred.promise, ret);\n    });\n  }\n\n  function resolve(self, newValue) {\n    try {\n      // Promise Resolution Procedure: https://github.com/promises-aplus/promises-spec#the-promise-resolution-procedure\n      if (newValue === self) throw new TypeError('A promise cannot be resolved with itself.');\n      if (newValue && (typeof newValue === 'object' || typeof newValue === 'function')) {\n        var then = newValue.then;\n        if (newValue instanceof Promise) {\n          self._state = 3;\n          self._value = newValue;\n          finale(self);\n          return;\n        } else if (typeof then === 'function') {\n          doResolve(bind(then, newValue), self);\n          return;\n        }\n      }\n      self._state = 1;\n      self._value = newValue;\n      finale(self);\n    } catch (e) {\n      reject(self, e);\n    }\n  }\n\n  function reject(self, newValue) {\n    self._state = 2;\n    self._value = newValue;\n    finale(self);\n  }\n\n  function finale(self) {\n    if (self._state === 2 && self._deferreds.length === 0) {\n      Promise._immediateFn(function() {\n        if (!self._handled) {\n          Promise._unhandledRejectionFn(self._value);\n        }\n      });\n    }\n\n    for (var i = 0, len = self._deferreds.length; i < len; i++) {\n      handle(self, self._deferreds[i]);\n    }\n    self._deferreds = null;\n  }\n\n  function Handler(onFulfilled, onRejected, promise) {\n    this.onFulfilled = typeof onFulfilled === 'function' ? onFulfilled : null;\n    this.onRejected = typeof onRejected === 'function' ? onRejected : null;\n    this.promise = promise;\n  }\n\n  /**\n   * Take a potentially misbehaving resolver function and make sure\n   * onFulfilled and onRejected are only called once.\n   *\n   * Makes no guarantees about asynchrony.\n   */\n  function doResolve(fn, self) {\n    var done = false;\n    try {\n      fn(function (value) {\n        if (done) return;\n        done = true;\n        resolve(self, value);\n      }, function (reason) {\n        if (done) return;\n        done = true;\n        reject(self, reason);\n      });\n    } catch (ex) {\n      if (done) return;\n      done = true;\n      reject(self, ex);\n    }\n  }\n\n  Promise.prototype['catch'] = function (onRejected) {\n    return this.then(null, onRejected);\n  };\n\n  Promise.prototype.then = function (onFulfilled, onRejected) {\n    var prom = new (this.constructor)(noop);\n\n    handle(this, new Handler(onFulfilled, onRejected, prom));\n    return prom;\n  };\n\n  Promise.all = function (arr) {\n    var args = Array.prototype.slice.call(arr);\n\n    return new Promise(function (resolve, reject) {\n      if (args.length === 0) return resolve([]);\n      var remaining = args.length;\n\n      function res(i, val) {\n        try {\n          if (val && (typeof val === 'object' || typeof val === 'function')) {\n            var then = val.then;\n            if (typeof then === 'function') {\n              then.call(val, function (val) {\n                res(i, val);\n              }, reject);\n              return;\n            }\n          }\n          args[i] = val;\n          if (--remaining === 0) {\n            resolve(args);\n          }\n        } catch (ex) {\n          reject(ex);\n        }\n      }\n\n      for (var i = 0; i < args.length; i++) {\n        res(i, args[i]);\n      }\n    });\n  };\n\n  Promise.resolve = function (value) {\n    if (value && typeof value === 'object' && value.constructor === Promise) {\n      return value;\n    }\n\n    return new Promise(function (resolve) {\n      resolve(value);\n    });\n  };\n\n  Promise.reject = function (value) {\n    return new Promise(function (resolve, reject) {\n      reject(value);\n    });\n  };\n\n  Promise.race = function (values) {\n    return new Promise(function (resolve, reject) {\n      for (var i = 0, len = values.length; i < len; i++) {\n        values[i].then(resolve, reject);\n      }\n    });\n  };\n\n  // Use polyfill for setImmediate for performance gains\n  Promise._immediateFn = (typeof setImmediate === 'function' && function (fn) { setImmediate(fn); }) ||\n    function (fn) {\n      setTimeoutFunc(fn, 0);\n    };\n\n  Promise._unhandledRejectionFn = function _unhandledRejectionFn(err) {\n    if (typeof console !== 'undefined' && console) {\n      console.warn('Possible Unhandled Promise Rejection:', err); // eslint-disable-line no-console\n    }\n  };\n\n  /**\n   * Set the immediate function to execute callbacks\n   * @param fn {function} Function to execute\n   * @deprecated\n   */\n  Promise._setImmediateFn = function _setImmediateFn(fn) {\n    Promise._immediateFn = fn;\n  };\n\n  /**\n   * Change the function to execute on unhandled rejection\n   * @param {function} fn Function to execute on unhandled rejection\n   * @deprecated\n   */\n  Promise._setUnhandledRejectionFn = function _setUnhandledRejectionFn(fn) {\n    Promise._unhandledRejectionFn = fn;\n  };\n  \n  if (typeof module !== 'undefined' && module.exports) {\n    module.exports = Promise;\n  } else if (!root.Promise) {\n    root.Promise = Promise;\n  }\n\n})(this);\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/promise-polyfill/promise.js","// 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\n\n// WEBPACK FOOTER //\n// ./node_modules/process/browser.js","// @flow\n/** @jsx h */\n\nimport { h, Component } from 'preact'\n\nimport styles from './Button.css'\nimport { bem } from '../../helpers/bem'\nimport { themeToClassName } from '../../helpers/themeToClassName'\n\ntype Props = {\n  className?: string,\n  onClick: () => void,\n  children?: ?any\n}\n\nexport class Button extends Component<Props> {\n  render () {\n    const { theme } = this.context\n\n    const classes = [\n      'nrk-button',\n      bem(styles.button, themeToClassName(theme)),\n      this.props.className || ''\n    ].join(' ')\n\n    return (\n      <button className={classes} onClick={this.props.onClick}>\n        {this.props.children}\n      </button>\n    )\n  }\n}\n\n\n\n// WEBPACK FOOTER //\n// ./src/shared/components/Button/Button.js","// @flow\nfunction getMaxLength (values: Array<any>, key?: string): number {\n  const arrOfLengths = values\n    .map(v => {\n      if (typeof v === 'object' && key && v[key]) {\n        return String(v[key]).length || 0\n      }\n      if (typeof v === 'string') return v.length\n      return 0\n    })\n    .sort()\n  return Math.max(...arrOfLengths)\n}\n\nexport { getMaxLength }\n\n\n\n// WEBPACK FOOTER //\n// ./src/shared/helpers/get-text-max-length.js","// @flow\n/** @jsx h */\n\nimport { h, Component } from 'preact'\n\nimport styles from './Error.css'\n\ntype Props = {\n  style?: Object,\n  children?: ?any\n}\n\nexport class Error extends Component<Props> {\n  render () {\n    return (\n      <div className={styles.error} style={this.props.style}>\n        {this.props.children}\n      </div>\n    )\n  }\n}\n\n\n\n// WEBPACK FOOTER //\n// ./src/shared/components/Error/Error.js","// @flow\n/** @jsx h */\n\nimport { h, Component } from 'preact'\n\nimport styles from './Loader.css'\n\ntype Props = {\n  children?: ?any\n}\n\nexport class Loader extends Component<Props> {\n  render () {\n    return <div className={styles.loader}>{this.props.children}</div>\n  }\n}\n\n\n\n// WEBPACK FOOTER //\n// ./src/shared/components/Loader/Loader.js","// @flow\n/** @jsx h */\n\nimport { h, Component } from 'preact'\n\nimport { Button } from '../../../../../components/Button/Button'\n\nimport styles from './RetryButton.css'\n\ntype Props = {\n  onClick: () => void,\n  children?: ?any\n}\n\nexport class RetryButton extends Component<Props> {\n  render () {\n    return (\n      <Button onClick={this.props.onClick} className={styles.retryButton}>\n        <svg width='15' height='15' aria-hidden='true'>\n          <use xlinkHref='#nrk-reload' />\n        </svg>{' '}\n        {this.props.children}\n      </Button>\n    )\n  }\n}\n\n\n\n// WEBPACK FOOTER //\n// ./src/shared/widgets/LivePoll/components/LivePoll/RetryButton/RetryButton.js","// @flow\n\nimport { Component } from 'preact'\n\nfunction shallowEqual (a: any, b: any) {\n  for (let key in a) if (a[key] !== b[key]) return false\n  for (let key in b) if (!(key in a)) return false\n  return true\n}\n\nexport class PureComponent<Props, State> extends Component<Props, State> {\n  shouldComponentUpdate (props: Props, state: State, context: any) {\n    return !(shallowEqual(props, this.props) && shallowEqual(state, this.state) && shallowEqual(context, this.context))\n  }\n}\n\n\n\n// WEBPACK FOOTER //\n// ./src/shared/helpers/pure-components.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar DOMStorageWrapper_1 = require(\"./DOMStorageWrapper\");\nvar MemoryStorage_1 = require(\"./MemoryStorage\");\n/**\n * Helper to create a DOMStorageWrapper or else fall back to MemoryStorage.\n * TODO: Once MemoryStorage and DOMStorageWrapper have a shared interface this method annotation should change\n * to reflect this type\n *\n * @param {string} domStorageName Name of the underlying storage object\n *   (e.g. 'localStorage' or 'sessionStorage').\n * @return {?} Turning off type information until a common interface is defined.\n */\nvar createStoragefor = function (domStorageName) {\n    try {\n        // NOTE: just accessing \"localStorage\" or \"window['localStorage']\" may throw a security exception,\n        // so it must be inside the try/catch.\n        if (typeof window !== 'undefined' &&\n            typeof window[domStorageName] !== 'undefined') {\n            // Need to test cache. Just because it's here doesn't mean it works\n            var domStorage = window[domStorageName];\n            domStorage.setItem('firebase:sentinel', 'cache');\n            domStorage.removeItem('firebase:sentinel');\n            return new DOMStorageWrapper_1.DOMStorageWrapper(domStorage);\n        }\n    }\n    catch (e) { }\n    // Failed to create wrapper.  Just return in-memory storage.\n    // TODO: log?\n    return new MemoryStorage_1.MemoryStorage();\n};\n/** A storage object that lasts across sessions */\nexports.PersistentStorage = createStoragefor('localStorage');\n/** A storage object that only lasts one session */\nexports.SessionStorage = createStoragefor('sessionStorage');\n\n//# sourceMappingURL=storage.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/storage/storage.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.PROTOCOL_VERSION = '5';\nexports.VERSION_PARAM = 'v';\nexports.TRANSPORT_SESSION_PARAM = 's';\nexports.REFERER_PARAM = 'r';\nexports.FORGE_REF = 'f';\nexports.FORGE_DOMAIN = 'firebaseio.com';\nexports.LAST_SESSION_PARAM = 'ls';\nexports.WEBSOCKET = 'websocket';\nexports.LONG_POLLING = 'long_polling';\n\n//# sourceMappingURL=Constants.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/realtime/Constants.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar Node_1 = require(\"../Node\");\nvar util_1 = require(\"../../util/util\");\n/**\n *\n * @constructor\n */\nvar Index = /** @class */ (function () {\n    function Index() {\n    }\n    /**\n     * @return {function(!NamedNode, !NamedNode):number} A standalone comparison function for\n     * this index\n     */\n    Index.prototype.getCompare = function () {\n        return this.compare.bind(this);\n    };\n    /**\n     * Given a before and after value for a node, determine if the indexed value has changed. Even if they are different,\n     * it's possible that the changes are isolated to parts of the snapshot that are not indexed.\n     *\n     * @param {!Node} oldNode\n     * @param {!Node} newNode\n     * @return {boolean} True if the portion of the snapshot being indexed changed between oldNode and newNode\n     */\n    Index.prototype.indexedValueChanged = function (oldNode, newNode) {\n        var oldWrapped = new Node_1.NamedNode(util_1.MIN_NAME, oldNode);\n        var newWrapped = new Node_1.NamedNode(util_1.MIN_NAME, newNode);\n        return this.compare(oldWrapped, newWrapped) !== 0;\n    };\n    /**\n     * @return {!NamedNode} a node wrapper that will sort equal to or less than\n     * any other node wrapper, using this index\n     */\n    Index.prototype.minPost = function () {\n        return Node_1.NamedNode.MIN;\n    };\n    return Index;\n}());\nexports.Index = Index;\n\n//# sourceMappingURL=Index.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/snap/indexes/Index.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = require(\"@firebase/util\");\nvar util_2 = require(\"../util/util\");\nvar snap_1 = require(\"./snap\");\nvar __childrenNodeConstructor;\n/**\n * LeafNode is a class for storing leaf nodes in a DataSnapshot.  It\n * implements Node and stores the value of the node (a string,\n * number, or boolean) accessible via getValue().\n */\nvar LeafNode = /** @class */ (function () {\n    /**\n     * @implements {Node}\n     * @param {!(string|number|boolean|Object)} value_ The value to store in this leaf node.\n     *                                         The object type is possible in the event of a deferred value\n     * @param {!Node=} priorityNode_ The priority of this node.\n     */\n    function LeafNode(value_, priorityNode_) {\n        if (priorityNode_ === void 0) { priorityNode_ = LeafNode.__childrenNodeConstructor.EMPTY_NODE; }\n        this.value_ = value_;\n        this.priorityNode_ = priorityNode_;\n        this.lazyHash_ = null;\n        util_1.assert(this.value_ !== undefined && this.value_ !== null, \"LeafNode shouldn't be created with null/undefined value.\");\n        snap_1.validatePriorityNode(this.priorityNode_);\n    }\n    Object.defineProperty(LeafNode, \"__childrenNodeConstructor\", {\n        get: function () {\n            return __childrenNodeConstructor;\n        },\n        set: function (val) {\n            __childrenNodeConstructor = val;\n        },\n        enumerable: true,\n        configurable: true\n    });\n    /** @inheritDoc */\n    LeafNode.prototype.isLeafNode = function () {\n        return true;\n    };\n    /** @inheritDoc */\n    LeafNode.prototype.getPriority = function () {\n        return this.priorityNode_;\n    };\n    /** @inheritDoc */\n    LeafNode.prototype.updatePriority = function (newPriorityNode) {\n        return new LeafNode(this.value_, newPriorityNode);\n    };\n    /** @inheritDoc */\n    LeafNode.prototype.getImmediateChild = function (childName) {\n        // Hack to treat priority as a regular child\n        if (childName === '.priority') {\n            return this.priorityNode_;\n        }\n        else {\n            return LeafNode.__childrenNodeConstructor.EMPTY_NODE;\n        }\n    };\n    /** @inheritDoc */\n    LeafNode.prototype.getChild = function (path) {\n        if (path.isEmpty()) {\n            return this;\n        }\n        else if (path.getFront() === '.priority') {\n            return this.priorityNode_;\n        }\n        else {\n            return LeafNode.__childrenNodeConstructor.EMPTY_NODE;\n        }\n    };\n    /**\n     * @inheritDoc\n     */\n    LeafNode.prototype.hasChild = function () {\n        return false;\n    };\n    /** @inheritDoc */\n    LeafNode.prototype.getPredecessorChildName = function (childName, childNode) {\n        return null;\n    };\n    /** @inheritDoc */\n    LeafNode.prototype.updateImmediateChild = function (childName, newChildNode) {\n        if (childName === '.priority') {\n            return this.updatePriority(newChildNode);\n        }\n        else if (newChildNode.isEmpty() && childName !== '.priority') {\n            return this;\n        }\n        else {\n            return LeafNode.__childrenNodeConstructor.EMPTY_NODE\n                .updateImmediateChild(childName, newChildNode)\n                .updatePriority(this.priorityNode_);\n        }\n    };\n    /** @inheritDoc */\n    LeafNode.prototype.updateChild = function (path, newChildNode) {\n        var front = path.getFront();\n        if (front === null) {\n            return newChildNode;\n        }\n        else if (newChildNode.isEmpty() && front !== '.priority') {\n            return this;\n        }\n        else {\n            util_1.assert(front !== '.priority' || path.getLength() === 1, '.priority must be the last token in a path');\n            return this.updateImmediateChild(front, LeafNode.__childrenNodeConstructor.EMPTY_NODE.updateChild(path.popFront(), newChildNode));\n        }\n    };\n    /** @inheritDoc */\n    LeafNode.prototype.isEmpty = function () {\n        return false;\n    };\n    /** @inheritDoc */\n    LeafNode.prototype.numChildren = function () {\n        return 0;\n    };\n    /** @inheritDoc */\n    LeafNode.prototype.forEachChild = function (index, action) {\n        return false;\n    };\n    /**\n     * @inheritDoc\n     */\n    LeafNode.prototype.val = function (exportFormat) {\n        if (exportFormat && !this.getPriority().isEmpty())\n            return {\n                '.value': this.getValue(),\n                '.priority': this.getPriority().val()\n            };\n        else\n            return this.getValue();\n    };\n    /** @inheritDoc */\n    LeafNode.prototype.hash = function () {\n        if (this.lazyHash_ === null) {\n            var toHash = '';\n            if (!this.priorityNode_.isEmpty())\n                toHash +=\n                    'priority:' +\n                        snap_1.priorityHashText(this.priorityNode_.val()) +\n                        ':';\n            var type = typeof this.value_;\n            toHash += type + ':';\n            if (type === 'number') {\n                toHash += util_2.doubleToIEEE754String(this.value_);\n            }\n            else {\n                toHash += this.value_;\n            }\n            this.lazyHash_ = util_2.sha1(toHash);\n        }\n        return this.lazyHash_;\n    };\n    /**\n     * Returns the value of the leaf node.\n     * @return {Object|string|number|boolean} The value of the node.\n     */\n    LeafNode.prototype.getValue = function () {\n        return this.value_;\n    };\n    /**\n     * @inheritDoc\n     */\n    LeafNode.prototype.compareTo = function (other) {\n        if (other === LeafNode.__childrenNodeConstructor.EMPTY_NODE) {\n            return 1;\n        }\n        else if (other instanceof LeafNode.__childrenNodeConstructor) {\n            return -1;\n        }\n        else {\n            util_1.assert(other.isLeafNode(), 'Unknown node type');\n            return this.compareToLeafNode_(other);\n        }\n    };\n    /**\n     * Comparison specifically for two leaf nodes\n     * @param {!LeafNode} otherLeaf\n     * @return {!number}\n     * @private\n     */\n    LeafNode.prototype.compareToLeafNode_ = function (otherLeaf) {\n        var otherLeafType = typeof otherLeaf.value_;\n        var thisLeafType = typeof this.value_;\n        var otherIndex = LeafNode.VALUE_TYPE_ORDER.indexOf(otherLeafType);\n        var thisIndex = LeafNode.VALUE_TYPE_ORDER.indexOf(thisLeafType);\n        util_1.assert(otherIndex >= 0, 'Unknown leaf type: ' + otherLeafType);\n        util_1.assert(thisIndex >= 0, 'Unknown leaf type: ' + thisLeafType);\n        if (otherIndex === thisIndex) {\n            // Same type, compare values\n            if (thisLeafType === 'object') {\n                // Deferred value nodes are all equal, but we should also never get to this point...\n                return 0;\n            }\n            else {\n                // Note that this works because true > false, all others are number or string comparisons\n                if (this.value_ < otherLeaf.value_) {\n                    return -1;\n                }\n                else if (this.value_ === otherLeaf.value_) {\n                    return 0;\n                }\n                else {\n                    return 1;\n                }\n            }\n        }\n        else {\n            return thisIndex - otherIndex;\n        }\n    };\n    /**\n     * @inheritDoc\n     */\n    LeafNode.prototype.withIndex = function () {\n        return this;\n    };\n    /**\n     * @inheritDoc\n     */\n    LeafNode.prototype.isIndexed = function () {\n        return true;\n    };\n    /**\n     * @inheritDoc\n     */\n    LeafNode.prototype.equals = function (other) {\n        /**\n         * @inheritDoc\n         */\n        if (other === this) {\n            return true;\n        }\n        else if (other.isLeafNode()) {\n            var otherLeaf = other;\n            return (this.value_ === otherLeaf.value_ &&\n                this.priorityNode_.equals(otherLeaf.priorityNode_));\n        }\n        else {\n            return false;\n        }\n    };\n    /**\n     * The sort order for comparing leaf nodes of different types. If two leaf nodes have\n     * the same type, the comparison falls back to their value\n     * @type {Array.<!string>}\n     * @const\n     */\n    LeafNode.VALUE_TYPE_ORDER = ['object', 'boolean', 'number', 'string'];\n    return LeafNode;\n}());\nexports.LeafNode = LeafNode;\n\n//# sourceMappingURL=LeafNode.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/snap/LeafNode.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\n/**\n * An iterator over an LLRBNode.\n */\nvar SortedMapIterator = /** @class */ (function () {\n    /**\n     * @template K, V, T\n     * @param {LLRBNode|LLRBEmptyNode} node Node to iterate.\n     * @param {?K} startKey\n     * @param {function(K, K): number} comparator\n     * @param {boolean} isReverse_ Whether or not to iterate in reverse\n     * @param {(function(K, V):T)=} resultGenerator_\n     */\n    function SortedMapIterator(node, startKey, comparator, isReverse_, resultGenerator_) {\n        if (resultGenerator_ === void 0) { resultGenerator_ = null; }\n        this.isReverse_ = isReverse_;\n        this.resultGenerator_ = resultGenerator_;\n        /** @private\n         * @type {Array.<!LLRBNode>}\n         */\n        this.nodeStack_ = [];\n        var cmp = 1;\n        while (!node.isEmpty()) {\n            node = node;\n            cmp = startKey ? comparator(node.key, startKey) : 1;\n            // flip the comparison if we're going in reverse\n            if (isReverse_)\n                cmp *= -1;\n            if (cmp < 0) {\n                // This node is less than our start key. ignore it\n                if (this.isReverse_) {\n                    node = node.left;\n                }\n                else {\n                    node = node.right;\n                }\n            }\n            else if (cmp === 0) {\n                // This node is exactly equal to our start key. Push it on the stack, but stop iterating;\n                this.nodeStack_.push(node);\n                break;\n            }\n            else {\n                // This node is greater than our start key, add it to the stack and move to the next one\n                this.nodeStack_.push(node);\n                if (this.isReverse_) {\n                    node = node.right;\n                }\n                else {\n                    node = node.left;\n                }\n            }\n        }\n    }\n    SortedMapIterator.prototype.getNext = function () {\n        if (this.nodeStack_.length === 0)\n            return null;\n        var node = this.nodeStack_.pop();\n        var result;\n        if (this.resultGenerator_)\n            result = this.resultGenerator_(node.key, node.value);\n        else\n            result = { key: node.key, value: node.value };\n        if (this.isReverse_) {\n            node = node.left;\n            while (!node.isEmpty()) {\n                this.nodeStack_.push(node);\n                node = node.right;\n            }\n        }\n        else {\n            node = node.right;\n            while (!node.isEmpty()) {\n                this.nodeStack_.push(node);\n                node = node.left;\n            }\n        }\n        return result;\n    };\n    SortedMapIterator.prototype.hasNext = function () {\n        return this.nodeStack_.length > 0;\n    };\n    SortedMapIterator.prototype.peek = function () {\n        if (this.nodeStack_.length === 0)\n            return null;\n        var node = this.nodeStack_[this.nodeStack_.length - 1];\n        if (this.resultGenerator_) {\n            return this.resultGenerator_(node.key, node.value);\n        }\n        else {\n            return { key: node.key, value: node.value };\n        }\n    };\n    return SortedMapIterator;\n}());\nexports.SortedMapIterator = SortedMapIterator;\n/**\n * Represents a node in a Left-leaning Red-Black tree.\n */\nvar LLRBNode = /** @class */ (function () {\n    /**\n     * @template K, V\n     * @param {!K} key Key associated with this node.\n     * @param {!V} value Value associated with this node.\n     * @param {?boolean} color Whether this node is red.\n     * @param {?(LLRBNode|LLRBEmptyNode)=} left Left child.\n     * @param {?(LLRBNode|LLRBEmptyNode)=} right Right child.\n     */\n    function LLRBNode(key, value, color, left, right) {\n        this.key = key;\n        this.value = value;\n        this.color = color != null ? color : LLRBNode.RED;\n        this.left =\n            left != null ? left : SortedMap.EMPTY_NODE;\n        this.right =\n            right != null ? right : SortedMap.EMPTY_NODE;\n    }\n    /**\n     * Returns a copy of the current node, optionally replacing pieces of it.\n     *\n     * @param {?K} key New key for the node, or null.\n     * @param {?V} value New value for the node, or null.\n     * @param {?boolean} color New color for the node, or null.\n     * @param {?LLRBNode|LLRBEmptyNode} left New left child for the node, or null.\n     * @param {?LLRBNode|LLRBEmptyNode} right New right child for the node, or null.\n     * @return {!LLRBNode} The node copy.\n     */\n    LLRBNode.prototype.copy = function (key, value, color, left, right) {\n        return new LLRBNode(key != null ? key : this.key, value != null ? value : this.value, color != null ? color : this.color, left != null ? left : this.left, right != null ? right : this.right);\n    };\n    /**\n     * @return {number} The total number of nodes in the tree.\n     */\n    LLRBNode.prototype.count = function () {\n        return this.left.count() + 1 + this.right.count();\n    };\n    /**\n     * @return {boolean} True if the tree is empty.\n     */\n    LLRBNode.prototype.isEmpty = function () {\n        return false;\n    };\n    /**\n     * Traverses the tree in key order and calls the specified action function\n     * for each node.\n     *\n     * @param {function(!K, !V):*} action Callback function to be called for each\n     *   node.  If it returns true, traversal is aborted.\n     * @return {*} The first truthy value returned by action, or the last falsey\n     *   value returned by action\n     */\n    LLRBNode.prototype.inorderTraversal = function (action) {\n        return (this.left.inorderTraversal(action) ||\n            action(this.key, this.value) ||\n            this.right.inorderTraversal(action));\n    };\n    /**\n     * Traverses the tree in reverse key order and calls the specified action function\n     * for each node.\n     *\n     * @param {function(!Object, !Object)} action Callback function to be called for each\n     * node.  If it returns true, traversal is aborted.\n     * @return {*} True if traversal was aborted.\n     */\n    LLRBNode.prototype.reverseTraversal = function (action) {\n        return (this.right.reverseTraversal(action) ||\n            action(this.key, this.value) ||\n            this.left.reverseTraversal(action));\n    };\n    /**\n     * @return {!Object} The minimum node in the tree.\n     * @private\n     */\n    LLRBNode.prototype.min_ = function () {\n        if (this.left.isEmpty()) {\n            return this;\n        }\n        else {\n            return this.left.min_();\n        }\n    };\n    /**\n     * @return {!K} The maximum key in the tree.\n     */\n    LLRBNode.prototype.minKey = function () {\n        return this.min_().key;\n    };\n    /**\n     * @return {!K} The maximum key in the tree.\n     */\n    LLRBNode.prototype.maxKey = function () {\n        if (this.right.isEmpty()) {\n            return this.key;\n        }\n        else {\n            return this.right.maxKey();\n        }\n    };\n    /**\n     *\n     * @param {!Object} key Key to insert.\n     * @param {!Object} value Value to insert.\n     * @param {Comparator} comparator Comparator.\n     * @return {!LLRBNode} New tree, with the key/value added.\n     */\n    LLRBNode.prototype.insert = function (key, value, comparator) {\n        var cmp, n;\n        n = this;\n        cmp = comparator(key, n.key);\n        if (cmp < 0) {\n            n = n.copy(null, null, null, n.left.insert(key, value, comparator), null);\n        }\n        else if (cmp === 0) {\n            n = n.copy(null, value, null, null, null);\n        }\n        else {\n            n = n.copy(null, null, null, null, n.right.insert(key, value, comparator));\n        }\n        return n.fixUp_();\n    };\n    /**\n     * @private\n     * @return {!LLRBNode|LLRBEmptyNode} New tree, with the minimum key removed.\n     */\n    LLRBNode.prototype.removeMin_ = function () {\n        if (this.left.isEmpty()) {\n            return SortedMap.EMPTY_NODE;\n        }\n        var n = this;\n        if (!n.left.isRed_() && !n.left.left.isRed_())\n            n = n.moveRedLeft_();\n        n = n.copy(null, null, null, n.left.removeMin_(), null);\n        return n.fixUp_();\n    };\n    /**\n     * @param {!Object} key The key of the item to remove.\n     * @param {Comparator} comparator Comparator.\n     * @return {!LLRBNode|LLRBEmptyNode} New tree, with the specified item removed.\n     */\n    LLRBNode.prototype.remove = function (key, comparator) {\n        var n, smallest;\n        n = this;\n        if (comparator(key, n.key) < 0) {\n            if (!n.left.isEmpty() && !n.left.isRed_() && !n.left.left.isRed_()) {\n                n = n.moveRedLeft_();\n            }\n            n = n.copy(null, null, null, n.left.remove(key, comparator), null);\n        }\n        else {\n            if (n.left.isRed_())\n                n = n.rotateRight_();\n            if (!n.right.isEmpty() && !n.right.isRed_() && !n.right.left.isRed_()) {\n                n = n.moveRedRight_();\n            }\n            if (comparator(key, n.key) === 0) {\n                if (n.right.isEmpty()) {\n                    return SortedMap.EMPTY_NODE;\n                }\n                else {\n                    smallest = n.right.min_();\n                    n = n.copy(smallest.key, smallest.value, null, null, n.right.removeMin_());\n                }\n            }\n            n = n.copy(null, null, null, null, n.right.remove(key, comparator));\n        }\n        return n.fixUp_();\n    };\n    /**\n     * @private\n     * @return {boolean} Whether this is a RED node.\n     */\n    LLRBNode.prototype.isRed_ = function () {\n        return this.color;\n    };\n    /**\n     * @private\n     * @return {!LLRBNode} New tree after performing any needed rotations.\n     */\n    LLRBNode.prototype.fixUp_ = function () {\n        var n = this;\n        if (n.right.isRed_() && !n.left.isRed_())\n            n = n.rotateLeft_();\n        if (n.left.isRed_() && n.left.left.isRed_())\n            n = n.rotateRight_();\n        if (n.left.isRed_() && n.right.isRed_())\n            n = n.colorFlip_();\n        return n;\n    };\n    /**\n     * @private\n     * @return {!LLRBNode} New tree, after moveRedLeft.\n     */\n    LLRBNode.prototype.moveRedLeft_ = function () {\n        var n = this.colorFlip_();\n        if (n.right.left.isRed_()) {\n            n = n.copy(null, null, null, null, n.right.rotateRight_());\n            n = n.rotateLeft_();\n            n = n.colorFlip_();\n        }\n        return n;\n    };\n    /**\n     * @private\n     * @return {!LLRBNode} New tree, after moveRedRight.\n     */\n    LLRBNode.prototype.moveRedRight_ = function () {\n        var n = this.colorFlip_();\n        if (n.left.left.isRed_()) {\n            n = n.rotateRight_();\n            n = n.colorFlip_();\n        }\n        return n;\n    };\n    /**\n     * @private\n     * @return {!LLRBNode} New tree, after rotateLeft.\n     */\n    LLRBNode.prototype.rotateLeft_ = function () {\n        var nl = this.copy(null, null, LLRBNode.RED, null, this.right.left);\n        return this.right.copy(null, null, this.color, nl, null);\n    };\n    /**\n     * @private\n     * @return {!LLRBNode} New tree, after rotateRight.\n     */\n    LLRBNode.prototype.rotateRight_ = function () {\n        var nr = this.copy(null, null, LLRBNode.RED, this.left.right, null);\n        return this.left.copy(null, null, this.color, null, nr);\n    };\n    /**\n     * @private\n     * @return {!LLRBNode} New tree, after colorFlip.\n     */\n    LLRBNode.prototype.colorFlip_ = function () {\n        var left = this.left.copy(null, null, !this.left.color, null, null);\n        var right = this.right.copy(null, null, !this.right.color, null, null);\n        return this.copy(null, null, !this.color, left, right);\n    };\n    /**\n     * For testing.\n     *\n     * @private\n     * @return {boolean} True if all is well.\n     */\n    LLRBNode.prototype.checkMaxDepth_ = function () {\n        var blackDepth = this.check_();\n        return Math.pow(2.0, blackDepth) <= this.count() + 1;\n    };\n    /**\n     * @private\n     * @return {number} Not sure what this returns exactly. :-).\n     */\n    LLRBNode.prototype.check_ = function () {\n        var blackDepth;\n        if (this.isRed_() && this.left.isRed_()) {\n            throw new Error('Red node has red child(' + this.key + ',' + this.value + ')');\n        }\n        if (this.right.isRed_()) {\n            throw new Error('Right child of (' + this.key + ',' + this.value + ') is red');\n        }\n        blackDepth = this.left.check_();\n        if (blackDepth !== this.right.check_()) {\n            throw new Error('Black depths differ');\n        }\n        else {\n            return blackDepth + (this.isRed_() ? 0 : 1);\n        }\n    };\n    LLRBNode.RED = true;\n    LLRBNode.BLACK = false;\n    return LLRBNode;\n}());\nexports.LLRBNode = LLRBNode;\n/**\n * Represents an empty node (a leaf node in the Red-Black Tree).\n */\nvar LLRBEmptyNode = /** @class */ (function () {\n    function LLRBEmptyNode() {\n    }\n    /**\n     * Returns a copy of the current node.\n     *\n     * @return {!LLRBEmptyNode} The node copy.\n     */\n    LLRBEmptyNode.prototype.copy = function (key, value, color, left, right) {\n        return this;\n    };\n    /**\n     * Returns a copy of the tree, with the specified key/value added.\n     *\n     * @param {!K} key Key to be added.\n     * @param {!V} value Value to be added.\n     * @param {Comparator} comparator Comparator.\n     * @return {!LLRBNode} New tree, with item added.\n     */\n    LLRBEmptyNode.prototype.insert = function (key, value, comparator) {\n        return new LLRBNode(key, value, null);\n    };\n    /**\n     * Returns a copy of the tree, with the specified key removed.\n     *\n     * @param {!K} key The key to remove.\n     * @param {Comparator} comparator Comparator.\n     * @return {!LLRBEmptyNode} New tree, with item removed.\n     */\n    LLRBEmptyNode.prototype.remove = function (key, comparator) {\n        return this;\n    };\n    /**\n     * @return {number} The total number of nodes in the tree.\n     */\n    LLRBEmptyNode.prototype.count = function () {\n        return 0;\n    };\n    /**\n     * @return {boolean} True if the tree is empty.\n     */\n    LLRBEmptyNode.prototype.isEmpty = function () {\n        return true;\n    };\n    /**\n     * Traverses the tree in key order and calls the specified action function\n     * for each node.\n     *\n     * @param {function(!K, !V):*} action Callback function to be called for each\n     * node.  If it returns true, traversal is aborted.\n     * @return {boolean} True if traversal was aborted.\n     */\n    LLRBEmptyNode.prototype.inorderTraversal = function (action) {\n        return false;\n    };\n    /**\n     * Traverses the tree in reverse key order and calls the specified action function\n     * for each node.\n     *\n     * @param {function(!K, !V)} action Callback function to be called for each\n     * node.  If it returns true, traversal is aborted.\n     * @return {boolean} True if traversal was aborted.\n     */\n    LLRBEmptyNode.prototype.reverseTraversal = function (action) {\n        return false;\n    };\n    /**\n     * @return {null}\n     */\n    LLRBEmptyNode.prototype.minKey = function () {\n        return null;\n    };\n    /**\n     * @return {null}\n     */\n    LLRBEmptyNode.prototype.maxKey = function () {\n        return null;\n    };\n    /**\n     * @private\n     * @return {number} Not sure what this returns exactly. :-).\n     */\n    LLRBEmptyNode.prototype.check_ = function () {\n        return 0;\n    };\n    /**\n     * @private\n     * @return {boolean} Whether this node is red.\n     */\n    LLRBEmptyNode.prototype.isRed_ = function () {\n        return false;\n    };\n    return LLRBEmptyNode;\n}());\nexports.LLRBEmptyNode = LLRBEmptyNode;\n/**\n * An immutable sorted map implementation, based on a Left-leaning Red-Black\n * tree.\n */\nvar SortedMap = /** @class */ (function () {\n    /**\n     * @template K, V\n     * @param {function(K, K):number} comparator_ Key comparator.\n     * @param {LLRBNode=} root_ (Optional) Root node for the map.\n     */\n    function SortedMap(comparator_, root_) {\n        if (root_ === void 0) { root_ = SortedMap.EMPTY_NODE; }\n        this.comparator_ = comparator_;\n        this.root_ = root_;\n    }\n    /**\n     * Returns a copy of the map, with the specified key/value added or replaced.\n     * (TODO: We should perhaps rename this method to 'put')\n     *\n     * @param {!K} key Key to be added.\n     * @param {!V} value Value to be added.\n     * @return {!SortedMap.<K, V>} New map, with item added.\n     */\n    SortedMap.prototype.insert = function (key, value) {\n        return new SortedMap(this.comparator_, this.root_\n            .insert(key, value, this.comparator_)\n            .copy(null, null, LLRBNode.BLACK, null, null));\n    };\n    /**\n     * Returns a copy of the map, with the specified key removed.\n     *\n     * @param {!K} key The key to remove.\n     * @return {!SortedMap.<K, V>} New map, with item removed.\n     */\n    SortedMap.prototype.remove = function (key) {\n        return new SortedMap(this.comparator_, this.root_\n            .remove(key, this.comparator_)\n            .copy(null, null, LLRBNode.BLACK, null, null));\n    };\n    /**\n     * Returns the value of the node with the given key, or null.\n     *\n     * @param {!K} key The key to look up.\n     * @return {?V} The value of the node with the given key, or null if the\n     * key doesn't exist.\n     */\n    SortedMap.prototype.get = function (key) {\n        var cmp;\n        var node = this.root_;\n        while (!node.isEmpty()) {\n            cmp = this.comparator_(key, node.key);\n            if (cmp === 0) {\n                return node.value;\n            }\n            else if (cmp < 0) {\n                node = node.left;\n            }\n            else if (cmp > 0) {\n                node = node.right;\n            }\n        }\n        return null;\n    };\n    /**\n     * Returns the key of the item *before* the specified key, or null if key is the first item.\n     * @param {K} key The key to find the predecessor of\n     * @return {?K} The predecessor key.\n     */\n    SortedMap.prototype.getPredecessorKey = function (key) {\n        var cmp, node = this.root_, rightParent = null;\n        while (!node.isEmpty()) {\n            cmp = this.comparator_(key, node.key);\n            if (cmp === 0) {\n                if (!node.left.isEmpty()) {\n                    node = node.left;\n                    while (!node.right.isEmpty())\n                        node = node.right;\n                    return node.key;\n                }\n                else if (rightParent) {\n                    return rightParent.key;\n                }\n                else {\n                    return null; // first item.\n                }\n            }\n            else if (cmp < 0) {\n                node = node.left;\n            }\n            else if (cmp > 0) {\n                rightParent = node;\n                node = node.right;\n            }\n        }\n        throw new Error('Attempted to find predecessor key for a nonexistent key.  What gives?');\n    };\n    /**\n     * @return {boolean} True if the map is empty.\n     */\n    SortedMap.prototype.isEmpty = function () {\n        return this.root_.isEmpty();\n    };\n    /**\n     * @return {number} The total number of nodes in the map.\n     */\n    SortedMap.prototype.count = function () {\n        return this.root_.count();\n    };\n    /**\n     * @return {?K} The minimum key in the map.\n     */\n    SortedMap.prototype.minKey = function () {\n        return this.root_.minKey();\n    };\n    /**\n     * @return {?K} The maximum key in the map.\n     */\n    SortedMap.prototype.maxKey = function () {\n        return this.root_.maxKey();\n    };\n    /**\n     * Traverses the map in key order and calls the specified action function\n     * for each key/value pair.\n     *\n     * @param {function(!K, !V):*} action Callback function to be called\n     * for each key/value pair.  If action returns true, traversal is aborted.\n     * @return {*} The first truthy value returned by action, or the last falsey\n     *   value returned by action\n     */\n    SortedMap.prototype.inorderTraversal = function (action) {\n        return this.root_.inorderTraversal(action);\n    };\n    /**\n     * Traverses the map in reverse key order and calls the specified action function\n     * for each key/value pair.\n     *\n     * @param {function(!Object, !Object)} action Callback function to be called\n     * for each key/value pair.  If action returns true, traversal is aborted.\n     * @return {*} True if the traversal was aborted.\n     */\n    SortedMap.prototype.reverseTraversal = function (action) {\n        return this.root_.reverseTraversal(action);\n    };\n    /**\n     * Returns an iterator over the SortedMap.\n     * @template T\n     * @param {(function(K, V):T)=} resultGenerator\n     * @return {SortedMapIterator.<K, V, T>} The iterator.\n     */\n    SortedMap.prototype.getIterator = function (resultGenerator) {\n        return new SortedMapIterator(this.root_, null, this.comparator_, false, resultGenerator);\n    };\n    SortedMap.prototype.getIteratorFrom = function (key, resultGenerator) {\n        return new SortedMapIterator(this.root_, key, this.comparator_, false, resultGenerator);\n    };\n    SortedMap.prototype.getReverseIteratorFrom = function (key, resultGenerator) {\n        return new SortedMapIterator(this.root_, key, this.comparator_, true, resultGenerator);\n    };\n    SortedMap.prototype.getReverseIterator = function (resultGenerator) {\n        return new SortedMapIterator(this.root_, null, this.comparator_, true, resultGenerator);\n    };\n    /**\n     * Always use the same empty node, to reduce memory.\n     * @const\n     */\n    SortedMap.EMPTY_NODE = new LLRBEmptyNode();\n    return SortedMap;\n}());\nexports.SortedMap = SortedMap;\n\n//# sourceMappingURL=SortedMap.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/util/SortedMap.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar ServerValues_1 = require(\"./util/ServerValues\");\nvar nodeFromJSON_1 = require(\"./snap/nodeFromJSON\");\nvar Path_1 = require(\"./util/Path\");\nvar SparseSnapshotTree_1 = require(\"./SparseSnapshotTree\");\nvar SyncTree_1 = require(\"./SyncTree\");\nvar SnapshotHolder_1 = require(\"./SnapshotHolder\");\nvar util_1 = require(\"@firebase/util\");\nvar util_2 = require(\"./util/util\");\nvar util_3 = require(\"@firebase/util\");\nvar AuthTokenProvider_1 = require(\"./AuthTokenProvider\");\nvar StatsManager_1 = require(\"./stats/StatsManager\");\nvar StatsReporter_1 = require(\"./stats/StatsReporter\");\nvar StatsListener_1 = require(\"./stats/StatsListener\");\nvar EventQueue_1 = require(\"./view/EventQueue\");\nvar PersistentConnection_1 = require(\"./PersistentConnection\");\nvar ReadonlyRestClient_1 = require(\"./ReadonlyRestClient\");\nvar Database_1 = require(\"../api/Database\");\nvar INTERRUPT_REASON = 'repo_interrupt';\n/**\n * A connection to a single data repository.\n */\nvar Repo = /** @class */ (function () {\n    /**\n     * @param {!RepoInfo} repoInfo_\n     * @param {boolean} forceRestClient\n     * @param {!FirebaseApp} app\n     */\n    function Repo(repoInfo_, forceRestClient, app) {\n        var _this = this;\n        this.repoInfo_ = repoInfo_;\n        this.app = app;\n        this.dataUpdateCount = 0;\n        this.statsListener_ = null;\n        this.eventQueue_ = new EventQueue_1.EventQueue();\n        this.nextWriteId_ = 1;\n        this.interceptServerDataCallback_ = null;\n        // A list of data pieces and paths to be set when this client disconnects.\n        this.onDisconnect_ = new SparseSnapshotTree_1.SparseSnapshotTree();\n        /**\n         * TODO: This should be @private but it's used by test_access.js and internal.js\n         * @type {?PersistentConnection}\n         */\n        this.persistentConnection_ = null;\n        /** @type {!AuthTokenProvider} */\n        var authTokenProvider = new AuthTokenProvider_1.AuthTokenProvider(app);\n        this.stats_ = StatsManager_1.StatsManager.getCollection(repoInfo_);\n        if (forceRestClient || util_2.beingCrawled()) {\n            this.server_ = new ReadonlyRestClient_1.ReadonlyRestClient(this.repoInfo_, this.onDataUpdate_.bind(this), authTokenProvider);\n            // Minor hack: Fire onConnect immediately, since there's no actual connection.\n            setTimeout(this.onConnectStatus_.bind(this, true), 0);\n        }\n        else {\n            var authOverride = app.options['databaseAuthVariableOverride'];\n            // Validate authOverride\n            if (typeof authOverride !== 'undefined' && authOverride !== null) {\n                if (typeof authOverride !== 'object') {\n                    throw new Error('Only objects are supported for option databaseAuthVariableOverride');\n                }\n                try {\n                    util_1.stringify(authOverride);\n                }\n                catch (e) {\n                    throw new Error('Invalid authOverride provided: ' + e);\n                }\n            }\n            this.persistentConnection_ = new PersistentConnection_1.PersistentConnection(this.repoInfo_, this.onDataUpdate_.bind(this), this.onConnectStatus_.bind(this), this.onServerInfoUpdate_.bind(this), authTokenProvider, authOverride);\n            this.server_ = this.persistentConnection_;\n        }\n        authTokenProvider.addTokenChangeListener(function (token) {\n            _this.server_.refreshAuthToken(token);\n        });\n        // In the case of multiple Repos for the same repoInfo (i.e. there are multiple Firebase.Contexts being used),\n        // we only want to create one StatsReporter.  As such, we'll report stats over the first Repo created.\n        this.statsReporter_ = StatsManager_1.StatsManager.getOrCreateReporter(repoInfo_, function () { return new StatsReporter_1.StatsReporter(_this.stats_, _this.server_); });\n        this.transactions_init_();\n        // Used for .info.\n        this.infoData_ = new SnapshotHolder_1.SnapshotHolder();\n        this.infoSyncTree_ = new SyncTree_1.SyncTree({\n            startListening: function (query, tag, currentHashFn, onComplete) {\n                var infoEvents = [];\n                var node = _this.infoData_.getNode(query.path);\n                // This is possibly a hack, but we have different semantics for .info endpoints. We don't raise null events\n                // on initial data...\n                if (!node.isEmpty()) {\n                    infoEvents = _this.infoSyncTree_.applyServerOverwrite(query.path, node);\n                    setTimeout(function () {\n                        onComplete('ok');\n                    }, 0);\n                }\n                return infoEvents;\n            },\n            stopListening: function () { }\n        });\n        this.updateInfo_('connected', false);\n        this.serverSyncTree_ = new SyncTree_1.SyncTree({\n            startListening: function (query, tag, currentHashFn, onComplete) {\n                _this.server_.listen(query, currentHashFn, tag, function (status, data) {\n                    var events = onComplete(status, data);\n                    _this.eventQueue_.raiseEventsForChangedPath(query.path, events);\n                });\n                // No synchronous events for network-backed sync trees\n                return [];\n            },\n            stopListening: function (query, tag) {\n                _this.server_.unlisten(query, tag);\n            }\n        });\n    }\n    /**\n     * @return {string}  The URL corresponding to the root of this Firebase.\n     */\n    Repo.prototype.toString = function () {\n        return ((this.repoInfo_.secure ? 'https://' : 'http://') + this.repoInfo_.host);\n    };\n    /**\n     * @return {!string} The namespace represented by the repo.\n     */\n    Repo.prototype.name = function () {\n        return this.repoInfo_.namespace;\n    };\n    /**\n     * @return {!number} The time in milliseconds, taking the server offset into account if we have one.\n     */\n    Repo.prototype.serverTime = function () {\n        var offsetNode = this.infoData_.getNode(new Path_1.Path('.info/serverTimeOffset'));\n        var offset = offsetNode.val() || 0;\n        return new Date().getTime() + offset;\n    };\n    /**\n     * Generate ServerValues using some variables from the repo object.\n     * @return {!Object}\n     */\n    Repo.prototype.generateServerValues = function () {\n        return ServerValues_1.generateWithValues({\n            timestamp: this.serverTime()\n        });\n    };\n    /**\n     * Called by realtime when we get new messages from the server.\n     *\n     * @private\n     * @param {string} pathString\n     * @param {*} data\n     * @param {boolean} isMerge\n     * @param {?number} tag\n     */\n    Repo.prototype.onDataUpdate_ = function (pathString, data, isMerge, tag) {\n        // For testing.\n        this.dataUpdateCount++;\n        var path = new Path_1.Path(pathString);\n        data = this.interceptServerDataCallback_\n            ? this.interceptServerDataCallback_(pathString, data)\n            : data;\n        var events = [];\n        if (tag) {\n            if (isMerge) {\n                var taggedChildren = util_3.map(data, function (raw) {\n                    return nodeFromJSON_1.nodeFromJSON(raw);\n                });\n                events = this.serverSyncTree_.applyTaggedQueryMerge(path, taggedChildren, tag);\n            }\n            else {\n                var taggedSnap = nodeFromJSON_1.nodeFromJSON(data);\n                events = this.serverSyncTree_.applyTaggedQueryOverwrite(path, taggedSnap, tag);\n            }\n        }\n        else if (isMerge) {\n            var changedChildren = util_3.map(data, function (raw) {\n                return nodeFromJSON_1.nodeFromJSON(raw);\n            });\n            events = this.serverSyncTree_.applyServerMerge(path, changedChildren);\n        }\n        else {\n            var snap = nodeFromJSON_1.nodeFromJSON(data);\n            events = this.serverSyncTree_.applyServerOverwrite(path, snap);\n        }\n        var affectedPath = path;\n        if (events.length > 0) {\n            // Since we have a listener outstanding for each transaction, receiving any events\n            // is a proxy for some change having occurred.\n            affectedPath = this.rerunTransactions_(path);\n        }\n        this.eventQueue_.raiseEventsForChangedPath(affectedPath, events);\n    };\n    /**\n     * TODO: This should be @private but it's used by test_access.js and internal.js\n     * @param {?function(!string, *):*} callback\n     * @private\n     */\n    Repo.prototype.interceptServerData_ = function (callback) {\n        this.interceptServerDataCallback_ = callback;\n    };\n    /**\n     * @param {!boolean} connectStatus\n     * @private\n     */\n    Repo.prototype.onConnectStatus_ = function (connectStatus) {\n        this.updateInfo_('connected', connectStatus);\n        if (connectStatus === false) {\n            this.runOnDisconnectEvents_();\n        }\n    };\n    /**\n     * @param {!Object} updates\n     * @private\n     */\n    Repo.prototype.onServerInfoUpdate_ = function (updates) {\n        var _this = this;\n        util_2.each(updates, function (value, key) {\n            _this.updateInfo_(key, value);\n        });\n    };\n    /**\n     *\n     * @param {!string} pathString\n     * @param {*} value\n     * @private\n     */\n    Repo.prototype.updateInfo_ = function (pathString, value) {\n        var path = new Path_1.Path('/.info/' + pathString);\n        var newNode = nodeFromJSON_1.nodeFromJSON(value);\n        this.infoData_.updateSnapshot(path, newNode);\n        var events = this.infoSyncTree_.applyServerOverwrite(path, newNode);\n        this.eventQueue_.raiseEventsForChangedPath(path, events);\n    };\n    /**\n     * @return {!number}\n     * @private\n     */\n    Repo.prototype.getNextWriteId_ = function () {\n        return this.nextWriteId_++;\n    };\n    /**\n     * @param {!Path} path\n     * @param {*} newVal\n     * @param {number|string|null} newPriority\n     * @param {?function(?Error, *=)} onComplete\n     */\n    Repo.prototype.setWithPriority = function (path, newVal, newPriority, onComplete) {\n        var _this = this;\n        this.log_('set', {\n            path: path.toString(),\n            value: newVal,\n            priority: newPriority\n        });\n        // TODO: Optimize this behavior to either (a) store flag to skip resolving where possible and / or\n        // (b) store unresolved paths on JSON parse\n        var serverValues = this.generateServerValues();\n        var newNodeUnresolved = nodeFromJSON_1.nodeFromJSON(newVal, newPriority);\n        var newNode = ServerValues_1.resolveDeferredValueSnapshot(newNodeUnresolved, serverValues);\n        var writeId = this.getNextWriteId_();\n        var events = this.serverSyncTree_.applyUserOverwrite(path, newNode, writeId, true);\n        this.eventQueue_.queueEvents(events);\n        this.server_.put(path.toString(), newNodeUnresolved.val(/*export=*/ true), function (status, errorReason) {\n            var success = status === 'ok';\n            if (!success) {\n                util_2.warn('set at ' + path + ' failed: ' + status);\n            }\n            var clearEvents = _this.serverSyncTree_.ackUserWrite(writeId, !success);\n            _this.eventQueue_.raiseEventsForChangedPath(path, clearEvents);\n            _this.callOnCompleteCallback(onComplete, status, errorReason);\n        });\n        var affectedPath = this.abortTransactions_(path);\n        this.rerunTransactions_(affectedPath);\n        // We queued the events above, so just flush the queue here\n        this.eventQueue_.raiseEventsForChangedPath(affectedPath, []);\n    };\n    /**\n     * @param {!Path} path\n     * @param {!Object} childrenToMerge\n     * @param {?function(?Error, *=)} onComplete\n     */\n    Repo.prototype.update = function (path, childrenToMerge, onComplete) {\n        var _this = this;\n        this.log_('update', { path: path.toString(), value: childrenToMerge });\n        // Start with our existing data and merge each child into it.\n        var empty = true;\n        var serverValues = this.generateServerValues();\n        var changedChildren = {};\n        util_3.forEach(childrenToMerge, function (changedKey, changedValue) {\n            empty = false;\n            var newNodeUnresolved = nodeFromJSON_1.nodeFromJSON(changedValue);\n            changedChildren[changedKey] = ServerValues_1.resolveDeferredValueSnapshot(newNodeUnresolved, serverValues);\n        });\n        if (!empty) {\n            var writeId_1 = this.getNextWriteId_();\n            var events = this.serverSyncTree_.applyUserMerge(path, changedChildren, writeId_1);\n            this.eventQueue_.queueEvents(events);\n            this.server_.merge(path.toString(), childrenToMerge, function (status, errorReason) {\n                var success = status === 'ok';\n                if (!success) {\n                    util_2.warn('update at ' + path + ' failed: ' + status);\n                }\n                var clearEvents = _this.serverSyncTree_.ackUserWrite(writeId_1, !success);\n                var affectedPath = clearEvents.length > 0 ? _this.rerunTransactions_(path) : path;\n                _this.eventQueue_.raiseEventsForChangedPath(affectedPath, clearEvents);\n                _this.callOnCompleteCallback(onComplete, status, errorReason);\n            });\n            util_3.forEach(childrenToMerge, function (changedPath) {\n                var affectedPath = _this.abortTransactions_(path.child(changedPath));\n                _this.rerunTransactions_(affectedPath);\n            });\n            // We queued the events above, so just flush the queue here\n            this.eventQueue_.raiseEventsForChangedPath(path, []);\n        }\n        else {\n            util_2.log(\"update() called with empty data.  Don't do anything.\");\n            this.callOnCompleteCallback(onComplete, 'ok');\n        }\n    };\n    /**\n     * Applies all of the changes stored up in the onDisconnect_ tree.\n     * @private\n     */\n    Repo.prototype.runOnDisconnectEvents_ = function () {\n        var _this = this;\n        this.log_('onDisconnectEvents');\n        var serverValues = this.generateServerValues();\n        var resolvedOnDisconnectTree = ServerValues_1.resolveDeferredValueTree(this.onDisconnect_, serverValues);\n        var events = [];\n        resolvedOnDisconnectTree.forEachTree(Path_1.Path.Empty, function (path, snap) {\n            events = events.concat(_this.serverSyncTree_.applyServerOverwrite(path, snap));\n            var affectedPath = _this.abortTransactions_(path);\n            _this.rerunTransactions_(affectedPath);\n        });\n        this.onDisconnect_ = new SparseSnapshotTree_1.SparseSnapshotTree();\n        this.eventQueue_.raiseEventsForChangedPath(Path_1.Path.Empty, events);\n    };\n    /**\n     * @param {!Path} path\n     * @param {?function(?Error, *=)} onComplete\n     */\n    Repo.prototype.onDisconnectCancel = function (path, onComplete) {\n        var _this = this;\n        this.server_.onDisconnectCancel(path.toString(), function (status, errorReason) {\n            if (status === 'ok') {\n                _this.onDisconnect_.forget(path);\n            }\n            _this.callOnCompleteCallback(onComplete, status, errorReason);\n        });\n    };\n    /**\n     * @param {!Path} path\n     * @param {*} value\n     * @param {?function(?Error, *=)} onComplete\n     */\n    Repo.prototype.onDisconnectSet = function (path, value, onComplete) {\n        var _this = this;\n        var newNode = nodeFromJSON_1.nodeFromJSON(value);\n        this.server_.onDisconnectPut(path.toString(), newNode.val(/*export=*/ true), function (status, errorReason) {\n            if (status === 'ok') {\n                _this.onDisconnect_.remember(path, newNode);\n            }\n            _this.callOnCompleteCallback(onComplete, status, errorReason);\n        });\n    };\n    /**\n     * @param {!Path} path\n     * @param {*} value\n     * @param {*} priority\n     * @param {?function(?Error, *=)} onComplete\n     */\n    Repo.prototype.onDisconnectSetWithPriority = function (path, value, priority, onComplete) {\n        var _this = this;\n        var newNode = nodeFromJSON_1.nodeFromJSON(value, priority);\n        this.server_.onDisconnectPut(path.toString(), newNode.val(/*export=*/ true), function (status, errorReason) {\n            if (status === 'ok') {\n                _this.onDisconnect_.remember(path, newNode);\n            }\n            _this.callOnCompleteCallback(onComplete, status, errorReason);\n        });\n    };\n    /**\n     * @param {!Path} path\n     * @param {*} childrenToMerge\n     * @param {?function(?Error, *=)} onComplete\n     */\n    Repo.prototype.onDisconnectUpdate = function (path, childrenToMerge, onComplete) {\n        var _this = this;\n        if (util_3.isEmpty(childrenToMerge)) {\n            util_2.log(\"onDisconnect().update() called with empty data.  Don't do anything.\");\n            this.callOnCompleteCallback(onComplete, 'ok');\n            return;\n        }\n        this.server_.onDisconnectMerge(path.toString(), childrenToMerge, function (status, errorReason) {\n            if (status === 'ok') {\n                util_3.forEach(childrenToMerge, function (childName, childNode) {\n                    var newChildNode = nodeFromJSON_1.nodeFromJSON(childNode);\n                    _this.onDisconnect_.remember(path.child(childName), newChildNode);\n                });\n            }\n            _this.callOnCompleteCallback(onComplete, status, errorReason);\n        });\n    };\n    /**\n     * @param {!Query} query\n     * @param {!EventRegistration} eventRegistration\n     */\n    Repo.prototype.addEventCallbackForQuery = function (query, eventRegistration) {\n        var events;\n        if (query.path.getFront() === '.info') {\n            events = this.infoSyncTree_.addEventRegistration(query, eventRegistration);\n        }\n        else {\n            events = this.serverSyncTree_.addEventRegistration(query, eventRegistration);\n        }\n        this.eventQueue_.raiseEventsAtPath(query.path, events);\n    };\n    /**\n     * @param {!Query} query\n     * @param {?EventRegistration} eventRegistration\n     */\n    Repo.prototype.removeEventCallbackForQuery = function (query, eventRegistration) {\n        // These are guaranteed not to raise events, since we're not passing in a cancelError. However, we can future-proof\n        // a little bit by handling the return values anyways.\n        var events;\n        if (query.path.getFront() === '.info') {\n            events = this.infoSyncTree_.removeEventRegistration(query, eventRegistration);\n        }\n        else {\n            events = this.serverSyncTree_.removeEventRegistration(query, eventRegistration);\n        }\n        this.eventQueue_.raiseEventsAtPath(query.path, events);\n    };\n    Repo.prototype.interrupt = function () {\n        if (this.persistentConnection_) {\n            this.persistentConnection_.interrupt(INTERRUPT_REASON);\n        }\n    };\n    Repo.prototype.resume = function () {\n        if (this.persistentConnection_) {\n            this.persistentConnection_.resume(INTERRUPT_REASON);\n        }\n    };\n    Repo.prototype.stats = function (showDelta) {\n        if (showDelta === void 0) { showDelta = false; }\n        if (typeof console === 'undefined')\n            return;\n        var stats;\n        if (showDelta) {\n            if (!this.statsListener_)\n                this.statsListener_ = new StatsListener_1.StatsListener(this.stats_);\n            stats = this.statsListener_.get();\n        }\n        else {\n            stats = this.stats_.get();\n        }\n        var longestName = Object.keys(stats).reduce(function (previousValue, currentValue) {\n            return Math.max(currentValue.length, previousValue);\n        }, 0);\n        util_3.forEach(stats, function (stat, value) {\n            // pad stat names to be the same length (plus 2 extra spaces).\n            for (var i = stat.length; i < longestName + 2; i++)\n                stat += ' ';\n            console.log(stat + value);\n        });\n    };\n    Repo.prototype.statsIncrementCounter = function (metric) {\n        this.stats_.incrementCounter(metric);\n        this.statsReporter_.includeStat(metric);\n    };\n    /**\n     * @param {...*} var_args\n     * @private\n     */\n    Repo.prototype.log_ = function () {\n        var var_args = [];\n        for (var _i = 0; _i < arguments.length; _i++) {\n            var_args[_i] = arguments[_i];\n        }\n        var prefix = '';\n        if (this.persistentConnection_) {\n            prefix = this.persistentConnection_.id + ':';\n        }\n        util_2.log.apply(void 0, [prefix].concat(var_args));\n    };\n    /**\n     * @param {?function(?Error, *=)} callback\n     * @param {!string} status\n     * @param {?string=} errorReason\n     */\n    Repo.prototype.callOnCompleteCallback = function (callback, status, errorReason) {\n        if (callback) {\n            util_2.exceptionGuard(function () {\n                if (status == 'ok') {\n                    callback(null);\n                }\n                else {\n                    var code = (status || 'error').toUpperCase();\n                    var message = code;\n                    if (errorReason)\n                        message += ': ' + errorReason;\n                    var error = new Error(message);\n                    error.code = code;\n                    callback(error);\n                }\n            });\n        }\n    };\n    Object.defineProperty(Repo.prototype, \"database\", {\n        get: function () {\n            return this.__database || (this.__database = new Database_1.Database(this));\n        },\n        enumerable: true,\n        configurable: true\n    });\n    return Repo;\n}());\nexports.Repo = Repo;\n\n//# sourceMappingURL=Repo.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/Repo.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\n/**\n * A cache node only stores complete children. Additionally it holds a flag whether the node can be considered fully\n * initialized in the sense that we know at one point in time this represented a valid state of the world, e.g.\n * initialized with data from the server, or a complete overwrite by the client. The filtered flag also tracks\n * whether a node potentially had children removed due to a filter.\n */\nvar CacheNode = /** @class */ (function () {\n    /**\n     * @param {!Node} node_\n     * @param {boolean} fullyInitialized_\n     * @param {boolean} filtered_\n     */\n    function CacheNode(node_, fullyInitialized_, filtered_) {\n        this.node_ = node_;\n        this.fullyInitialized_ = fullyInitialized_;\n        this.filtered_ = filtered_;\n    }\n    /**\n     * Returns whether this node was fully initialized with either server data or a complete overwrite by the client\n     * @return {boolean}\n     */\n    CacheNode.prototype.isFullyInitialized = function () {\n        return this.fullyInitialized_;\n    };\n    /**\n     * Returns whether this node is potentially missing children due to a filter applied to the node\n     * @return {boolean}\n     */\n    CacheNode.prototype.isFiltered = function () {\n        return this.filtered_;\n    };\n    /**\n     * @param {!Path} path\n     * @return {boolean}\n     */\n    CacheNode.prototype.isCompleteForPath = function (path) {\n        if (path.isEmpty()) {\n            return this.isFullyInitialized() && !this.filtered_;\n        }\n        var childKey = path.getFront();\n        return this.isCompleteForChild(childKey);\n    };\n    /**\n     * @param {!string} key\n     * @return {boolean}\n     */\n    CacheNode.prototype.isCompleteForChild = function (key) {\n        return ((this.isFullyInitialized() && !this.filtered_) || this.node_.hasChild(key));\n    };\n    /**\n     * @return {!Node}\n     */\n    CacheNode.prototype.getNode = function () {\n        return this.node_;\n    };\n    return CacheNode;\n}());\nexports.CacheNode = CacheNode;\n\n//# sourceMappingURL=CacheNode.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/view/CacheNode.js","/**\n * Copyright (c) 2014, Facebook, Inc.\n * All rights reserved.\n *\n * This source code is licensed under the BSD-style license found in the\n * https://raw.github.com/facebook/regenerator/master/LICENSE file. An\n * additional grant of patent rights can be found in the PATENTS file in\n * the same directory.\n */\n\n!(function(global) {\n  \"use strict\";\n\n  var Op = Object.prototype;\n  var hasOwn = Op.hasOwnProperty;\n  var undefined; // More compressible than void 0.\n  var $Symbol = typeof Symbol === \"function\" ? Symbol : {};\n  var iteratorSymbol = $Symbol.iterator || \"@@iterator\";\n  var asyncIteratorSymbol = $Symbol.asyncIterator || \"@@asyncIterator\";\n  var toStringTagSymbol = $Symbol.toStringTag || \"@@toStringTag\";\n\n  var inModule = typeof module === \"object\";\n  var runtime = global.regeneratorRuntime;\n  if (runtime) {\n    if (inModule) {\n      // If regeneratorRuntime is defined globally and we're in a module,\n      // make the exports object identical to regeneratorRuntime.\n      module.exports = runtime;\n    }\n    // Don't bother evaluating the rest of this file if the runtime was\n    // already defined globally.\n    return;\n  }\n\n  // Define the runtime globally (as expected by generated code) as either\n  // module.exports (if we're in a module) or a new, empty object.\n  runtime = global.regeneratorRuntime = inModule ? module.exports : {};\n\n  function wrap(innerFn, outerFn, self, tryLocsList) {\n    // If outerFn provided and outerFn.prototype is a Generator, then outerFn.prototype instanceof Generator.\n    var protoGenerator = outerFn && outerFn.prototype instanceof Generator ? outerFn : Generator;\n    var generator = Object.create(protoGenerator.prototype);\n    var context = new Context(tryLocsList || []);\n\n    // The ._invoke method unifies the implementations of the .next,\n    // .throw, and .return methods.\n    generator._invoke = makeInvokeMethod(innerFn, self, context);\n\n    return generator;\n  }\n  runtime.wrap = wrap;\n\n  // Try/catch helper to minimize deoptimizations. Returns a completion\n  // record like context.tryEntries[i].completion. This interface could\n  // have been (and was previously) designed to take a closure to be\n  // invoked without arguments, but in all the cases we care about we\n  // already have an existing method we want to call, so there's no need\n  // to create a new function object. We can even get away with assuming\n  // the method takes exactly one argument, since that happens to be true\n  // in every case, so we don't have to touch the arguments object. The\n  // only additional allocation required is the completion record, which\n  // has a stable shape and so hopefully should be cheap to allocate.\n  function tryCatch(fn, obj, arg) {\n    try {\n      return { type: \"normal\", arg: fn.call(obj, arg) };\n    } catch (err) {\n      return { type: \"throw\", arg: err };\n    }\n  }\n\n  var GenStateSuspendedStart = \"suspendedStart\";\n  var GenStateSuspendedYield = \"suspendedYield\";\n  var GenStateExecuting = \"executing\";\n  var GenStateCompleted = \"completed\";\n\n  // Returning this object from the innerFn has the same effect as\n  // breaking out of the dispatch switch statement.\n  var ContinueSentinel = {};\n\n  // Dummy constructor functions that we use as the .constructor and\n  // .constructor.prototype properties for functions that return Generator\n  // objects. For full spec compliance, you may wish to configure your\n  // minifier not to mangle the names of these two functions.\n  function Generator() {}\n  function GeneratorFunction() {}\n  function GeneratorFunctionPrototype() {}\n\n  // This is a polyfill for %IteratorPrototype% for environments that\n  // don't natively support it.\n  var IteratorPrototype = {};\n  IteratorPrototype[iteratorSymbol] = function () {\n    return this;\n  };\n\n  var getProto = Object.getPrototypeOf;\n  var NativeIteratorPrototype = getProto && getProto(getProto(values([])));\n  if (NativeIteratorPrototype &&\n      NativeIteratorPrototype !== Op &&\n      hasOwn.call(NativeIteratorPrototype, iteratorSymbol)) {\n    // This environment has a native %IteratorPrototype%; use it instead\n    // of the polyfill.\n    IteratorPrototype = NativeIteratorPrototype;\n  }\n\n  var Gp = GeneratorFunctionPrototype.prototype =\n    Generator.prototype = Object.create(IteratorPrototype);\n  GeneratorFunction.prototype = Gp.constructor = GeneratorFunctionPrototype;\n  GeneratorFunctionPrototype.constructor = GeneratorFunction;\n  GeneratorFunctionPrototype[toStringTagSymbol] =\n    GeneratorFunction.displayName = \"GeneratorFunction\";\n\n  // Helper for defining the .next, .throw, and .return methods of the\n  // Iterator interface in terms of a single ._invoke method.\n  function defineIteratorMethods(prototype) {\n    [\"next\", \"throw\", \"return\"].forEach(function(method) {\n      prototype[method] = function(arg) {\n        return this._invoke(method, arg);\n      };\n    });\n  }\n\n  runtime.isGeneratorFunction = function(genFun) {\n    var ctor = typeof genFun === \"function\" && genFun.constructor;\n    return ctor\n      ? ctor === GeneratorFunction ||\n        // For the native GeneratorFunction constructor, the best we can\n        // do is to check its .name property.\n        (ctor.displayName || ctor.name) === \"GeneratorFunction\"\n      : false;\n  };\n\n  runtime.mark = function(genFun) {\n    if (Object.setPrototypeOf) {\n      Object.setPrototypeOf(genFun, GeneratorFunctionPrototype);\n    } else {\n      genFun.__proto__ = GeneratorFunctionPrototype;\n      if (!(toStringTagSymbol in genFun)) {\n        genFun[toStringTagSymbol] = \"GeneratorFunction\";\n      }\n    }\n    genFun.prototype = Object.create(Gp);\n    return genFun;\n  };\n\n  // Within the body of any async function, `await x` is transformed to\n  // `yield regeneratorRuntime.awrap(x)`, so that the runtime can test\n  // `hasOwn.call(value, \"__await\")` to determine if the yielded value is\n  // meant to be awaited.\n  runtime.awrap = function(arg) {\n    return { __await: arg };\n  };\n\n  function AsyncIterator(generator) {\n    function invoke(method, arg, resolve, reject) {\n      var record = tryCatch(generator[method], generator, arg);\n      if (record.type === \"throw\") {\n        reject(record.arg);\n      } else {\n        var result = record.arg;\n        var value = result.value;\n        if (value &&\n            typeof value === \"object\" &&\n            hasOwn.call(value, \"__await\")) {\n          return Promise.resolve(value.__await).then(function(value) {\n            invoke(\"next\", value, resolve, reject);\n          }, function(err) {\n            invoke(\"throw\", err, resolve, reject);\n          });\n        }\n\n        return Promise.resolve(value).then(function(unwrapped) {\n          // When a yielded Promise is resolved, its final value becomes\n          // the .value of the Promise<{value,done}> result for the\n          // current iteration. If the Promise is rejected, however, the\n          // result for this iteration will be rejected with the same\n          // reason. Note that rejections of yielded Promises are not\n          // thrown back into the generator function, as is the case\n          // when an awaited Promise is rejected. This difference in\n          // behavior between yield and await is important, because it\n          // allows the consumer to decide what to do with the yielded\n          // rejection (swallow it and continue, manually .throw it back\n          // into the generator, abandon iteration, whatever). With\n          // await, by contrast, there is no opportunity to examine the\n          // rejection reason outside the generator function, so the\n          // only option is to throw it from the await expression, and\n          // let the generator function handle the exception.\n          result.value = unwrapped;\n          resolve(result);\n        }, reject);\n      }\n    }\n\n    var previousPromise;\n\n    function enqueue(method, arg) {\n      function callInvokeWithMethodAndArg() {\n        return new Promise(function(resolve, reject) {\n          invoke(method, arg, resolve, reject);\n        });\n      }\n\n      return previousPromise =\n        // If enqueue has been called before, then we want to wait until\n        // all previous Promises have been resolved before calling invoke,\n        // so that results are always delivered in the correct order. If\n        // enqueue has not been called before, then it is important to\n        // call invoke immediately, without waiting on a callback to fire,\n        // so that the async generator function has the opportunity to do\n        // any necessary setup in a predictable way. This predictability\n        // is why the Promise constructor synchronously invokes its\n        // executor callback, and why async functions synchronously\n        // execute code before the first await. Since we implement simple\n        // async functions in terms of async generators, it is especially\n        // important to get this right, even though it requires care.\n        previousPromise ? previousPromise.then(\n          callInvokeWithMethodAndArg,\n          // Avoid propagating failures to Promises returned by later\n          // invocations of the iterator.\n          callInvokeWithMethodAndArg\n        ) : callInvokeWithMethodAndArg();\n    }\n\n    // Define the unified helper method that is used to implement .next,\n    // .throw, and .return (see defineIteratorMethods).\n    this._invoke = enqueue;\n  }\n\n  defineIteratorMethods(AsyncIterator.prototype);\n  AsyncIterator.prototype[asyncIteratorSymbol] = function () {\n    return this;\n  };\n  runtime.AsyncIterator = AsyncIterator;\n\n  // Note that simple async functions are implemented on top of\n  // AsyncIterator objects; they just return a Promise for the value of\n  // the final result produced by the iterator.\n  runtime.async = function(innerFn, outerFn, self, tryLocsList) {\n    var iter = new AsyncIterator(\n      wrap(innerFn, outerFn, self, tryLocsList)\n    );\n\n    return runtime.isGeneratorFunction(outerFn)\n      ? iter // If outerFn is a generator, return the full iterator.\n      : iter.next().then(function(result) {\n          return result.done ? result.value : iter.next();\n        });\n  };\n\n  function makeInvokeMethod(innerFn, self, context) {\n    var state = GenStateSuspendedStart;\n\n    return function invoke(method, arg) {\n      if (state === GenStateExecuting) {\n        throw new Error(\"Generator is already running\");\n      }\n\n      if (state === GenStateCompleted) {\n        if (method === \"throw\") {\n          throw arg;\n        }\n\n        // Be forgiving, per 25.3.3.3.3 of the spec:\n        // https://people.mozilla.org/~jorendorff/es6-draft.html#sec-generatorresume\n        return doneResult();\n      }\n\n      context.method = method;\n      context.arg = arg;\n\n      while (true) {\n        var delegate = context.delegate;\n        if (delegate) {\n          var delegateResult = maybeInvokeDelegate(delegate, context);\n          if (delegateResult) {\n            if (delegateResult === ContinueSentinel) continue;\n            return delegateResult;\n          }\n        }\n\n        if (context.method === \"next\") {\n          // Setting context._sent for legacy support of Babel's\n          // function.sent implementation.\n          context.sent = context._sent = context.arg;\n\n        } else if (context.method === \"throw\") {\n          if (state === GenStateSuspendedStart) {\n            state = GenStateCompleted;\n            throw context.arg;\n          }\n\n          context.dispatchException(context.arg);\n\n        } else if (context.method === \"return\") {\n          context.abrupt(\"return\", context.arg);\n        }\n\n        state = GenStateExecuting;\n\n        var record = tryCatch(innerFn, self, context);\n        if (record.type === \"normal\") {\n          // If an exception is thrown from innerFn, we leave state ===\n          // GenStateExecuting and loop back for another invocation.\n          state = context.done\n            ? GenStateCompleted\n            : GenStateSuspendedYield;\n\n          if (record.arg === ContinueSentinel) {\n            continue;\n          }\n\n          return {\n            value: record.arg,\n            done: context.done\n          };\n\n        } else if (record.type === \"throw\") {\n          state = GenStateCompleted;\n          // Dispatch the exception by looping back around to the\n          // context.dispatchException(context.arg) call above.\n          context.method = \"throw\";\n          context.arg = record.arg;\n        }\n      }\n    };\n  }\n\n  // Call delegate.iterator[context.method](context.arg) and handle the\n  // result, either by returning a { value, done } result from the\n  // delegate iterator, or by modifying context.method and context.arg,\n  // setting context.delegate to null, and returning the ContinueSentinel.\n  function maybeInvokeDelegate(delegate, context) {\n    var method = delegate.iterator[context.method];\n    if (method === undefined) {\n      // A .throw or .return when the delegate iterator has no .throw\n      // method always terminates the yield* loop.\n      context.delegate = null;\n\n      if (context.method === \"throw\") {\n        if (delegate.iterator.return) {\n          // If the delegate iterator has a return method, give it a\n          // chance to clean up.\n          context.method = \"return\";\n          context.arg = undefined;\n          maybeInvokeDelegate(delegate, context);\n\n          if (context.method === \"throw\") {\n            // If maybeInvokeDelegate(context) changed context.method from\n            // \"return\" to \"throw\", let that override the TypeError below.\n            return ContinueSentinel;\n          }\n        }\n\n        context.method = \"throw\";\n        context.arg = new TypeError(\n          \"The iterator does not provide a 'throw' method\");\n      }\n\n      return ContinueSentinel;\n    }\n\n    var record = tryCatch(method, delegate.iterator, context.arg);\n\n    if (record.type === \"throw\") {\n      context.method = \"throw\";\n      context.arg = record.arg;\n      context.delegate = null;\n      return ContinueSentinel;\n    }\n\n    var info = record.arg;\n\n    if (! info) {\n      context.method = \"throw\";\n      context.arg = new TypeError(\"iterator result is not an object\");\n      context.delegate = null;\n      return ContinueSentinel;\n    }\n\n    if (info.done) {\n      // Assign the result of the finished delegate to the temporary\n      // variable specified by delegate.resultName (see delegateYield).\n      context[delegate.resultName] = info.value;\n\n      // Resume execution at the desired location (see delegateYield).\n      context.next = delegate.nextLoc;\n\n      // If context.method was \"throw\" but the delegate handled the\n      // exception, let the outer generator proceed normally. If\n      // context.method was \"next\", forget context.arg since it has been\n      // \"consumed\" by the delegate iterator. If context.method was\n      // \"return\", allow the original .return call to continue in the\n      // outer generator.\n      if (context.method !== \"return\") {\n        context.method = \"next\";\n        context.arg = undefined;\n      }\n\n    } else {\n      // Re-yield the result returned by the delegate method.\n      return info;\n    }\n\n    // The delegate iterator is finished, so forget it and continue with\n    // the outer generator.\n    context.delegate = null;\n    return ContinueSentinel;\n  }\n\n  // Define Generator.prototype.{next,throw,return} in terms of the\n  // unified ._invoke helper method.\n  defineIteratorMethods(Gp);\n\n  Gp[toStringTagSymbol] = \"Generator\";\n\n  // A Generator should always return itself as the iterator object when the\n  // @@iterator function is called on it. Some browsers' implementations of the\n  // iterator prototype chain incorrectly implement this, causing the Generator\n  // object to not be returned from this call. This ensures that doesn't happen.\n  // See https://github.com/facebook/regenerator/issues/274 for more details.\n  Gp[iteratorSymbol] = function() {\n    return this;\n  };\n\n  Gp.toString = function() {\n    return \"[object Generator]\";\n  };\n\n  function pushTryEntry(locs) {\n    var entry = { tryLoc: locs[0] };\n\n    if (1 in locs) {\n      entry.catchLoc = locs[1];\n    }\n\n    if (2 in locs) {\n      entry.finallyLoc = locs[2];\n      entry.afterLoc = locs[3];\n    }\n\n    this.tryEntries.push(entry);\n  }\n\n  function resetTryEntry(entry) {\n    var record = entry.completion || {};\n    record.type = \"normal\";\n    delete record.arg;\n    entry.completion = record;\n  }\n\n  function Context(tryLocsList) {\n    // The root entry object (effectively a try statement without a catch\n    // or a finally block) gives us a place to store values thrown from\n    // locations where there is no enclosing try statement.\n    this.tryEntries = [{ tryLoc: \"root\" }];\n    tryLocsList.forEach(pushTryEntry, this);\n    this.reset(true);\n  }\n\n  runtime.keys = function(object) {\n    var keys = [];\n    for (var key in object) {\n      keys.push(key);\n    }\n    keys.reverse();\n\n    // Rather than returning an object with a next method, we keep\n    // things simple and return the next function itself.\n    return function next() {\n      while (keys.length) {\n        var key = keys.pop();\n        if (key in object) {\n          next.value = key;\n          next.done = false;\n          return next;\n        }\n      }\n\n      // To avoid creating an additional object, we just hang the .value\n      // and .done properties off the next function object itself. This\n      // also ensures that the minifier will not anonymize the function.\n      next.done = true;\n      return next;\n    };\n  };\n\n  function values(iterable) {\n    if (iterable) {\n      var iteratorMethod = iterable[iteratorSymbol];\n      if (iteratorMethod) {\n        return iteratorMethod.call(iterable);\n      }\n\n      if (typeof iterable.next === \"function\") {\n        return iterable;\n      }\n\n      if (!isNaN(iterable.length)) {\n        var i = -1, next = function next() {\n          while (++i < iterable.length) {\n            if (hasOwn.call(iterable, i)) {\n              next.value = iterable[i];\n              next.done = false;\n              return next;\n            }\n          }\n\n          next.value = undefined;\n          next.done = true;\n\n          return next;\n        };\n\n        return next.next = next;\n      }\n    }\n\n    // Return an iterator with no values.\n    return { next: doneResult };\n  }\n  runtime.values = values;\n\n  function doneResult() {\n    return { value: undefined, done: true };\n  }\n\n  Context.prototype = {\n    constructor: Context,\n\n    reset: function(skipTempReset) {\n      this.prev = 0;\n      this.next = 0;\n      // Resetting context._sent for legacy support of Babel's\n      // function.sent implementation.\n      this.sent = this._sent = undefined;\n      this.done = false;\n      this.delegate = null;\n\n      this.method = \"next\";\n      this.arg = undefined;\n\n      this.tryEntries.forEach(resetTryEntry);\n\n      if (!skipTempReset) {\n        for (var name in this) {\n          // Not sure about the optimal order of these conditions:\n          if (name.charAt(0) === \"t\" &&\n              hasOwn.call(this, name) &&\n              !isNaN(+name.slice(1))) {\n            this[name] = undefined;\n          }\n        }\n      }\n    },\n\n    stop: function() {\n      this.done = true;\n\n      var rootEntry = this.tryEntries[0];\n      var rootRecord = rootEntry.completion;\n      if (rootRecord.type === \"throw\") {\n        throw rootRecord.arg;\n      }\n\n      return this.rval;\n    },\n\n    dispatchException: function(exception) {\n      if (this.done) {\n        throw exception;\n      }\n\n      var context = this;\n      function handle(loc, caught) {\n        record.type = \"throw\";\n        record.arg = exception;\n        context.next = loc;\n\n        if (caught) {\n          // If the dispatched exception was caught by a catch block,\n          // then let that catch block handle the exception normally.\n          context.method = \"next\";\n          context.arg = undefined;\n        }\n\n        return !! caught;\n      }\n\n      for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n        var entry = this.tryEntries[i];\n        var record = entry.completion;\n\n        if (entry.tryLoc === \"root\") {\n          // Exception thrown outside of any try block that could handle\n          // it, so set the completion value of the entire function to\n          // throw the exception.\n          return handle(\"end\");\n        }\n\n        if (entry.tryLoc <= this.prev) {\n          var hasCatch = hasOwn.call(entry, \"catchLoc\");\n          var hasFinally = hasOwn.call(entry, \"finallyLoc\");\n\n          if (hasCatch && hasFinally) {\n            if (this.prev < entry.catchLoc) {\n              return handle(entry.catchLoc, true);\n            } else if (this.prev < entry.finallyLoc) {\n              return handle(entry.finallyLoc);\n            }\n\n          } else if (hasCatch) {\n            if (this.prev < entry.catchLoc) {\n              return handle(entry.catchLoc, true);\n            }\n\n          } else if (hasFinally) {\n            if (this.prev < entry.finallyLoc) {\n              return handle(entry.finallyLoc);\n            }\n\n          } else {\n            throw new Error(\"try statement without catch or finally\");\n          }\n        }\n      }\n    },\n\n    abrupt: function(type, arg) {\n      for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n        var entry = this.tryEntries[i];\n        if (entry.tryLoc <= this.prev &&\n            hasOwn.call(entry, \"finallyLoc\") &&\n            this.prev < entry.finallyLoc) {\n          var finallyEntry = entry;\n          break;\n        }\n      }\n\n      if (finallyEntry &&\n          (type === \"break\" ||\n           type === \"continue\") &&\n          finallyEntry.tryLoc <= arg &&\n          arg <= finallyEntry.finallyLoc) {\n        // Ignore the finally entry if control is not jumping to a\n        // location outside the try/catch block.\n        finallyEntry = null;\n      }\n\n      var record = finallyEntry ? finallyEntry.completion : {};\n      record.type = type;\n      record.arg = arg;\n\n      if (finallyEntry) {\n        this.method = \"next\";\n        this.next = finallyEntry.finallyLoc;\n        return ContinueSentinel;\n      }\n\n      return this.complete(record);\n    },\n\n    complete: function(record, afterLoc) {\n      if (record.type === \"throw\") {\n        throw record.arg;\n      }\n\n      if (record.type === \"break\" ||\n          record.type === \"continue\") {\n        this.next = record.arg;\n      } else if (record.type === \"return\") {\n        this.rval = this.arg = record.arg;\n        this.method = \"return\";\n        this.next = \"end\";\n      } else if (record.type === \"normal\" && afterLoc) {\n        this.next = afterLoc;\n      }\n\n      return ContinueSentinel;\n    },\n\n    finish: function(finallyLoc) {\n      for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n        var entry = this.tryEntries[i];\n        if (entry.finallyLoc === finallyLoc) {\n          this.complete(entry.completion, entry.afterLoc);\n          resetTryEntry(entry);\n          return ContinueSentinel;\n        }\n      }\n    },\n\n    \"catch\": function(tryLoc) {\n      for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n        var entry = this.tryEntries[i];\n        if (entry.tryLoc === tryLoc) {\n          var record = entry.completion;\n          if (record.type === \"throw\") {\n            var thrown = record.arg;\n            resetTryEntry(entry);\n          }\n          return thrown;\n        }\n      }\n\n      // The context.catch method must only be called with a location\n      // argument that corresponds to a known catch block.\n      throw new Error(\"illegal catch attempt\");\n    },\n\n    delegateYield: function(iterable, resultName, nextLoc) {\n      this.delegate = {\n        iterator: values(iterable),\n        resultName: resultName,\n        nextLoc: nextLoc\n      };\n\n      if (this.method === \"next\") {\n        // Deliberately forget the last sent value so that we don't\n        // accidentally pass it on to the delegate.\n        this.arg = undefined;\n      }\n\n      return ContinueSentinel;\n    }\n  };\n})(\n  // In sloppy mode, unbound `this` refers to the global object, fallback to\n  // Function constructor if we're in global strict mode. That is sadly a form\n  // of indirect eval which violates Content Security Policy.\n  (function() { return this })() || Function(\"return this\")()\n);\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/regenerator-runtime/runtime.js","module.exports = function(module) {\n\tif(!module.webpackPolyfill) {\n\t\tmodule.deprecate = function() {};\n\t\tmodule.paths = [];\n\t\t// module.parent = undefined by default\n\t\tif(!module.children) module.children = [];\n\t\tObject.defineProperty(module, \"loaded\", {\n\t\t\tenumerable: true,\n\t\t\tget: function() {\n\t\t\t\treturn module.l;\n\t\t\t}\n\t\t});\n\t\tObject.defineProperty(module, \"id\", {\n\t\t\tenumerable: true,\n\t\t\tget: function() {\n\t\t\t\treturn module.i;\n\t\t\t}\n\t\t});\n\t\tmodule.webpackPolyfill = 1;\n\t}\n\treturn module;\n};\n\n\n\n// WEBPACK FOOTER //\n// (webpack)/buildin/module.js","/* eslint-disable */\nif (!Array.prototype.includes) {\n  Object.defineProperty(Array.prototype, 'includes', {\n    value: function(searchElement, fromIndex) {\n\n      if (this == null) {\n        throw new TypeError('\"this\" is null or not defined');\n      }\n\n      // 1. Let O be ? ToObject(this value).\n      var o = Object(this);\n\n      // 2. Let len be ? ToLength(? Get(O, \"length\")).\n      var len = o.length >>> 0;\n\n      // 3. If len is 0, return false.\n      if (len === 0) {\n        return false;\n      }\n\n      // 4. Let n be ? ToInteger(fromIndex).\n      //    (If fromIndex is undefined, this step produces the value 0.)\n      var n = fromIndex | 0;\n\n      // 5. If n ≥ 0, then\n      //  a. Let k be n.\n      // 6. Else n < 0,\n      //  a. Let k be len + n.\n      //  b. If k < 0, let k be 0.\n      var k = Math.max(n >= 0 ? n : len - Math.abs(n), 0);\n\n      function sameValueZero(x, y) {\n        return x === y || (typeof x === 'number' && typeof y === 'number' && isNaN(x) && isNaN(y));\n      }\n\n      // 7. Repeat, while k < len\n      while (k < len) {\n        // a. Let elementK be the result of ? Get(O, ! ToString(k)).\n        // b. If SameValueZero(searchElement, elementK) is true, return true.\n        if (sameValueZero(o[k], searchElement)) {\n          return true;\n        }\n        // c. Increase k by 1.\n        k++;\n      }\n\n      // 8. Return false\n      return false;\n    }\n  });\n}\n\n\n\n// WEBPACK FOOTER //\n// ./src/client/polyfills/array.prototype.includes.js","/* eslint-disable */\n// https://tc39.github.io/ecma262/#sec-array.prototype.find\nif (!Array.prototype.find) {\n  Object.defineProperty(Array.prototype, 'find', {\n    value: function(predicate) {\n      // 1. Let O be ? ToObject(this value).\n      if (this == null) {\n        throw new TypeError('\"this\" is null or not defined');\n      }\n\n      var o = Object(this);\n\n      // 2. Let len be ? ToLength(? Get(O, \"length\")).\n      var len = o.length >>> 0;\n\n      // 3. If IsCallable(predicate) is false, throw a TypeError exception.\n      if (typeof predicate !== 'function') {\n        throw new TypeError('predicate must be a function');\n      }\n\n      // 4. If thisArg was supplied, let T be thisArg; else let T be undefined.\n      var thisArg = arguments[1];\n\n      // 5. Let k be 0.\n      var k = 0;\n\n      // 6. Repeat, while k < len\n      while (k < len) {\n        // a. Let Pk be ! ToString(k).\n        // b. Let kValue be ? Get(O, Pk).\n        // c. Let testResult be ToBoolean(? Call(predicate, T, « kValue, k, O »)).\n        // d. If testResult is true, return kValue.\n        var kValue = o[k];\n        if (predicate.call(thisArg, kValue, k, o)) {\n          return kValue;\n        }\n        // e. Increase k by 1.\n        k++;\n      }\n\n      // 7. Return undefined.\n      return undefined;\n    }\n  });\n}\n\n\n\n// WEBPACK FOOTER //\n// ./src/client/polyfills/array.prototype.find.js","var apply = Function.prototype.apply;\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) {\n  if (timeout) {\n    timeout.close();\n  }\n};\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// setimmediate attaches itself to the global object\nrequire(\"setimmediate\");\nexports.setImmediate = setImmediate;\nexports.clearImmediate = clearImmediate;\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/timers-browserify/main.js","(function (global, undefined) {\n    \"use strict\";\n\n    if (global.setImmediate) {\n        return;\n    }\n\n    var nextHandle = 1; // Spec says greater than zero\n    var tasksByHandle = {};\n    var currentlyRunningATask = false;\n    var doc = global.document;\n    var registerImmediate;\n\n    function setImmediate(callback) {\n      // Callback can either be a function or a string\n      if (typeof callback !== \"function\") {\n        callback = new Function(\"\" + callback);\n      }\n      // Copy function arguments\n      var args = new Array(arguments.length - 1);\n      for (var i = 0; i < args.length; i++) {\n          args[i] = arguments[i + 1];\n      }\n      // Store and register the task\n      var task = { callback: callback, args: args };\n      tasksByHandle[nextHandle] = task;\n      registerImmediate(nextHandle);\n      return nextHandle++;\n    }\n\n    function clearImmediate(handle) {\n        delete tasksByHandle[handle];\n    }\n\n    function run(task) {\n        var callback = task.callback;\n        var args = task.args;\n        switch (args.length) {\n        case 0:\n            callback();\n            break;\n        case 1:\n            callback(args[0]);\n            break;\n        case 2:\n            callback(args[0], args[1]);\n            break;\n        case 3:\n            callback(args[0], args[1], args[2]);\n            break;\n        default:\n            callback.apply(undefined, args);\n            break;\n        }\n    }\n\n    function runIfPresent(handle) {\n        // From the spec: \"Wait until any invocations of this algorithm started before this one have completed.\"\n        // So if we're currently running a task, we'll need to delay this invocation.\n        if (currentlyRunningATask) {\n            // Delay by doing a setTimeout. setImmediate was tried instead, but in Firefox 7 it generated a\n            // \"too much recursion\" error.\n            setTimeout(runIfPresent, 0, handle);\n        } else {\n            var task = tasksByHandle[handle];\n            if (task) {\n                currentlyRunningATask = true;\n                try {\n                    run(task);\n                } finally {\n                    clearImmediate(handle);\n                    currentlyRunningATask = false;\n                }\n            }\n        }\n    }\n\n    function installNextTickImplementation() {\n        registerImmediate = function(handle) {\n            process.nextTick(function () { runIfPresent(handle); });\n        };\n    }\n\n    function canUsePostMessage() {\n        // The test against `importScripts` prevents this implementation from being installed inside a web worker,\n        // where `global.postMessage` means something completely different and can't be used for this purpose.\n        if (global.postMessage && !global.importScripts) {\n            var postMessageIsAsynchronous = true;\n            var oldOnMessage = global.onmessage;\n            global.onmessage = function() {\n                postMessageIsAsynchronous = false;\n            };\n            global.postMessage(\"\", \"*\");\n            global.onmessage = oldOnMessage;\n            return postMessageIsAsynchronous;\n        }\n    }\n\n    function installPostMessageImplementation() {\n        // Installs an event handler on `global` for the `message` event: see\n        // * https://developer.mozilla.org/en/DOM/window.postMessage\n        // * http://www.whatwg.org/specs/web-apps/current-work/multipage/comms.html#crossDocumentMessages\n\n        var messagePrefix = \"setImmediate$\" + Math.random() + \"$\";\n        var onGlobalMessage = function(event) {\n            if (event.source === global &&\n                typeof event.data === \"string\" &&\n                event.data.indexOf(messagePrefix) === 0) {\n                runIfPresent(+event.data.slice(messagePrefix.length));\n            }\n        };\n\n        if (global.addEventListener) {\n            global.addEventListener(\"message\", onGlobalMessage, false);\n        } else {\n            global.attachEvent(\"onmessage\", onGlobalMessage);\n        }\n\n        registerImmediate = function(handle) {\n            global.postMessage(messagePrefix + handle, \"*\");\n        };\n    }\n\n    function installMessageChannelImplementation() {\n        var channel = new MessageChannel();\n        channel.port1.onmessage = function(event) {\n            var handle = event.data;\n            runIfPresent(handle);\n        };\n\n        registerImmediate = function(handle) {\n            channel.port2.postMessage(handle);\n        };\n    }\n\n    function installReadyStateChangeImplementation() {\n        var html = doc.documentElement;\n        registerImmediate = function(handle) {\n            // Create a <script> element; its readystatechange event will be fired asynchronously once it is inserted\n            // into the document. Do so, thus queuing up the task. Remember to clean up once it's been called.\n            var script = doc.createElement(\"script\");\n            script.onreadystatechange = function () {\n                runIfPresent(handle);\n                script.onreadystatechange = null;\n                html.removeChild(script);\n                script = null;\n            };\n            html.appendChild(script);\n        };\n    }\n\n    function installSetTimeoutImplementation() {\n        registerImmediate = function(handle) {\n            setTimeout(runIfPresent, 0, handle);\n        };\n    }\n\n    // If supported, we should attach to the prototype of global, since that is where setTimeout et al. live.\n    var attachTo = Object.getPrototypeOf && Object.getPrototypeOf(global);\n    attachTo = attachTo && attachTo.setTimeout ? attachTo : global;\n\n    // Don't get fooled by e.g. browserify environments.\n    if ({}.toString.call(global.process) === \"[object process]\") {\n        // For Node.js before 0.9\n        installNextTickImplementation();\n\n    } else if (canUsePostMessage()) {\n        // For non-IE10 modern browsers\n        installPostMessageImplementation();\n\n    } else if (global.MessageChannel) {\n        // For web workers, where supported\n        installMessageChannelImplementation();\n\n    } else if (doc && \"onreadystatechange\" in doc.createElement(\"script\")) {\n        // For IE 6–8\n        installReadyStateChangeImplementation();\n\n    } else {\n        // For older browsers\n        installSetTimeoutImplementation();\n    }\n\n    attachTo.setImmediate = setImmediate;\n    attachTo.clearImmediate = clearImmediate;\n}(typeof self === \"undefined\" ? typeof global === \"undefined\" ? this : global : self));\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/setimmediate/setImmediate.js","// removed by extract-text-webpack-plugin\nmodule.exports = {\"button\":\"dh-stemning-button\",\"button--theme-sport\":\"dh-stemning-button--theme-sport\",\"button--theme-sport-inverted\":\"dh-stemning-button--theme-sport-inverted\",\"button--theme-sport-inverted-gray\":\"dh-stemning-button--theme-sport-inverted-gray\",\"button--theme-monsen\":\"dh-stemning-button--theme-monsen\"};\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./src/shared/components/Button/Button.css\n// module id = 48\n// module chunks = 0 1","// @flow\n/** @jsx h */\n\nimport { h } from 'preact'\n\nimport styles from './VoteCounter.css'\nimport { formatNumber } from '../../../../../helpers/formatNumber'\nimport { themeToClassName } from '../../../../../helpers/themeToClassName'\nimport { bem } from '../../../../../helpers/bem'\ntype Props = {\n  voteCount: number\n}\n\n/* eslint-disable jsx-a11y/aria-role */\nexport function VoteCounter (props: Props, context: { theme: string }) {\n  const { voteCount } = props\n\n  return (\n    <div className={bem(styles.voteCounter, themeToClassName(context.theme))} role='text'>\n      <div className={styles.voteCounter__count}>\n        <span className='nrk-sr'>Antall stemmer: {voteCount}</span>\n        <span>{formatNumber(voteCount)} stemmer</span>\n      </div>\n    </div>\n  )\n}\n\n\n\n// WEBPACK FOOTER //\n// ./src/shared/widgets/LivePoll/components/LivePoll/VoteCounter/VoteCounter.js","// removed by extract-text-webpack-plugin\nmodule.exports = {\"voteCounter\":\"dh-stemning-voteCounter\",\"voteCounter--theme-monsen\":\"dh-stemning-voteCounter--theme-monsen\",\"voteCounter__count\":\"dh-stemning-voteCounter__count\"};\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./src/shared/widgets/LivePoll/components/LivePoll/VoteCounter/VoteCounter.css\n// module id = 50\n// module chunks = 0 1","// @flow\n\nexport function formatNumber (number: number) {\n  try {\n    return number.toLocaleString('no-NO').replace(/,/g, ' ')\n  } catch (e) {\n    try {\n      return number.toLocaleString().replace(/,/g, ' ')\n    } catch (e) {\n      return number\n    }\n  }\n}\n\n\n\n// WEBPACK FOOTER //\n// ./src/shared/helpers/formatNumber.js","// @flow\n/** @jsx h */\n\nimport { h, Component } from 'preact'\n\nimport styles from './Result.css'\n\nimport { ResultList } from './components/ResultList/ResultList'\n\nimport type { Result as ResultType, ResultItem } from '../../types'\nimport { Error } from '../Error/Error'\nimport { Loader } from '../Loader/Loader'\nimport { StemningIcon } from '../StemningIcon/StemningIcon'\nimport { RetryButton } from '../../widgets/LivePoll/components/LivePoll/RetryButton/RetryButton'\n\ntype Props = {\n  sort?: 'ASC' | 'DESC',\n  result: ?ResultType,\n  error?: ?Error,\n  title?: string,\n  highlightedResultItemId?: ?number,\n  clickable?: boolean\n}\n\nexport class Result extends Component<Props> {\n  handleRetryButtonClick () {\n    window.location.reload(true)\n  }\n\n  render () {\n    const {\n      error,\n      result,\n      title,\n      highlightedResultItemId,\n      sort,\n      clickable\n    } = this.props\n\n    const totalVotes = (result && result.votes) || 0\n    if (error && !result) {\n      return (\n        <Error>\n          <div style={{ marginBottom: '10px' }}>\n            Beklager, men vi klarte ikke å laste inn resultater akkurat nå.\n          </div>\n          <RetryButton onClick={this.handleRetryButtonClick}>Prøv på nytt</RetryButton>\n        </Error>\n      )\n    }\n\n    if (!result) {\n      return (\n        <Loader>\n          <StemningIcon />\n          <p>Laster innhold</p>\n        </Loader>\n      )\n    }\n\n    const TitleBar = () => {\n      if (title && (totalVotes === 0 || totalVotes)) {\n        return (\n          <div className={styles.result__titleBar}>\n            <h4 className={styles.result__title}>{title}</h4>\n          </div>\n        )\n      }\n      return null\n    }\n\n    return (\n      <div className={styles.result}>\n        <TitleBar />\n\n        <ResultList\n          clickable={clickable}\n          items={sortItems(result.items, sort)}\n          totalVotes={result.votes || result.totalVotes}\n          highlightedId={highlightedResultItemId}\n        />\n      </div>\n    )\n  }\n}\n\nfunction sortItems (items: ResultItem[], sort?: 'ASC' | 'DESC') {\n  if (sort === 'DESC') {\n    return items.sort((a: ResultItem, b: ResultItem) => b.votes - a.votes)\n  } else if (sort === 'ASC') {\n    return items.sort((a: ResultItem, b: ResultItem) => a.votes - b.votes)\n  }\n\n  return items\n}\n\n\n\n// WEBPACK FOOTER //\n// ./src/shared/components/Result/Result.js","// removed by extract-text-webpack-plugin\nmodule.exports = {\"result\":\"dh-stemning-result\",\"result__title\":\"dh-stemning-result__title\",\"result__titleBar\":\"dh-stemning-result__titleBar\",\"stemningIcon\":\"dh-stemning-stemningIcon\",\"result__voteCount\":\"dh-stemning-result__voteCount\"};\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./src/shared/components/Result/Result.css\n// module id = 53\n// module chunks = 0 1","// @flow\n/** @jsx h */\n\nimport { h, Component } from 'preact'\n\nimport styles from './ResultList.css'\n\nimport { bem } from '../../../../helpers/bem'\nimport { themeToClassName } from '../../../../helpers/themeToClassName'\nimport { breakpointToClassName } from '../../../../helpers/breakpointToClassName'\n\nimport { ScreenReaderList, BarList, TextList } from './components/ResultItem/ResultItem'\nimport { getMaxLength } from '../../../../helpers/get-text-max-length'\nimport type { ResultItem as ResultItemType } from '../../../../types'\n\ntype State = {\n  showNumber: boolean\n}\n\ntype Props = {\n  items: Array<ResultItemType>,\n  totalVotes: number,\n  highlightedId?: ?number,\n  clickable?: boolean\n}\n\nexport class ResultList extends Component<Props, State> {\n  state = {\n    showNumber: false\n  }\n  toggleShowNumber = () => {\n    this.setState({ showNumber: !this.state.showNumber })\n  }\n  render () {\n    const { items, totalVotes, highlightedId, clickable } = this.props\n    const { showNumber } = this.state\n    const { theme, currentBreakpoint } = this.context\n    const isSlim = getMaxLength(items, 'votes') > 4\n\n    return (\n      // eslint-disable-next-line\n      <div\n        className={bem(\n          styles.resultList,\n          themeToClassName(theme),\n          breakpointToClassName(currentBreakpoint),\n          clickable ? 'clickable' : ''\n        )}\n        onClick={this.toggleShowNumber}\n      >\n        <ScreenReaderList items={items} totalVotes={totalVotes} />\n        <BarList items={items}\n          totalVotes={totalVotes}\n          isSlim={isSlim}\n          showNumber={showNumber}\n          highlightedId={highlightedId} />\n        <TextList items={items}\n          totalVotes={totalVotes}\n          isSlim={isSlim}\n          showNumber={showNumber}\n          highlightedId={highlightedId} />\n      </div>\n    )\n  }\n}\n\n\n\n// WEBPACK FOOTER //\n// ./src/shared/components/Result/components/ResultList/ResultList.js","// removed by extract-text-webpack-plugin\nmodule.exports = {\"resultList\":\"dh-stemning-resultList\",\"resultList--medium\":\"dh-stemning-resultList--medium\",\"resultList--large\":\"dh-stemning-resultList--large\",\"resultList--extra-large\":\"dh-stemning-resultList--extra-large\",\"resultList--theme-sport\":\"dh-stemning-resultList--theme-sport\",\"resultItem\":\"dh-stemning-resultItem\",\"bar__main\":\"dh-stemning-bar__main\",\"bar__main--highlighted\":\"dh-stemning-bar__main--highlighted\",\"resultList--theme-sport-inverted\":\"dh-stemning-resultList--theme-sport-inverted\",\"resultList--theme-sport-inverted-gray\":\"dh-stemning-resultList--theme-sport-inverted-gray\",\"resultList--clickable\":\"dh-stemning-resultList--clickable\"};\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./src/shared/components/Result/components/ResultList/ResultList.css\n// module id = 55\n// module chunks = 0 1","// @flow\n/** @jsx h */\n\nimport { h } from 'preact'\n\nimport styles from './ResultItem.css'\nimport { getScorePercent } from '../../helpers/getScorePercent'\nimport { Bar } from './components/Bar/Bar'\nimport { Percent } from './components/Percent/Percent'\nimport { Number } from './components/Number/Number'\nimport type { ResultItem as ResultItemType } from '../../../../../../types'\n\ntype Props = {\n  isSlim: boolean,\n  resultItem: ResultItemType,\n  showNumber: boolean,\n  scorePercent: number,\n  relativeScorePercent: number,\n  isHighlighted?: boolean\n}\n\ntype ScreenReaderListProps = {\n  items: ResultItemType[],\n  totalVotes: number\n}\n\nexport const ScreenReaderList = (props: ScreenReaderListProps) => {\n  const { items, totalVotes } = props\n\n  return <ul class={styles['resultList__sr']}>\n    {items.map(resultItem => (\n      <ScreenReaderItem\n        resultItem={resultItem}\n        scorePercent={getScorePercent(resultItem.votes, totalVotes)}\n      />\n    ))}\n  </ul>\n}\n\ntype BarListProps = {\n  items: ResultItemType[],\n  totalVotes: number,\n  isSlim: boolean,\n  showNumber: boolean,\n  highlightedId: number\n}\n\nexport const BarList = (props: BarListProps) => {\n  const { items, isSlim, showNumber, totalVotes, highlightedId } = props\n  return <div aria-hidden class={styles['resultList__bars']}>\n    {items.map(resultItem => (\n      <BarItem\n        isSlim={isSlim}\n        showNumber={showNumber}\n        scorePercent={getScorePercent(resultItem.votes, totalVotes)}\n        resultItem={resultItem}\n        isHighlighted={shouldHighlight(resultItem, highlightedId)}\n      />\n    ))}\n  </div>\n}\n\ntype TextListProps = {\n  items: ResultItemType[],\n  totalVotes: number,\n  isSlim: boolean,\n  showNumber: boolean,\n  highlightedId: number\n}\n\nexport const TextList = (props: TextListProps) => {\n  const { items, isSlim, showNumber, totalVotes, highlightedId } = props\n\n  return (\n    <div aria-hidden class={styles['resultList__text']}>\n      {items.map(resultItem => (\n        <TextItem\n          isSlim={isSlim}\n          showNumber={showNumber}\n          scorePercent={getScorePercent(resultItem.votes, totalVotes)}\n          resultItem={resultItem}\n          isHighlighted={shouldHighlight(resultItem, highlightedId)}\n        />\n      ))}\n    </div>\n  )\n}\n\nexport const BarItem = (props: Props) => {\n  const { resultItem, scorePercent, isHighlighted, isSlim } = props\n  return (\n    <div aria-hidden='true'\n      className={styles['resultItem']}\n      data-alternativeid={resultItem.id}\n    >\n      <div className={styles.resultItem__label}>{resultItem.text}</div>\n      <div className={styles['resultItem__score-wrapper']}>\n        <Bar\n          width={scorePercent}\n          isHighlighted={isHighlighted}\n          isSlim={isSlim}\n        />\n\n      </div>\n    </div>\n  )\n}\n\nexport const TextItem = (props: Props) => {\n  const { resultItem, scorePercent, showNumber } = props\n  return <div class={styles['resultItem__score-text-wrapper']}>\n    <Number hidden={!showNumber} value={resultItem.votes || 0} />\n    <Percent hidden={showNumber} scorePercent={scorePercent} />\n  </div>\n}\n\nexport const ScreenReaderItem = ({ resultItem, scorePercent }: { resultItem: ResultItemType, scorePercent: number }) => {\n  return <li className='nrk-sr'>\n    {getTextRepresentation(resultItem, scorePercent)}\n  </li>\n}\n\nfunction shouldHighlight (\n  resultItem: ResultItemType,\n  highlightedId?: ?number\n): boolean {\n  if (!highlightedId) {\n    return false\n  }\n  return resultItem.id === highlightedId\n}\n\nfunction getTextRepresentation (\n  resultItem: ResultItemType,\n  scorePercent: number\n): string {\n  const formattedScorePercent = (scorePercent || 0).toFixed(1).replace('.', ',')\n  return `Alternativ ${\n    resultItem.text\n  } har fått ${formattedScorePercent}% av stemmene`\n}\n\n\n\n// WEBPACK FOOTER //\n// ./src/shared/components/Result/components/ResultList/components/ResultItem/ResultItem.js","// @flow\n\nexport function getScorePercent (votes: number, totalVotes: number) {\n  if (totalVotes === 0) {\n    return 0\n  }\n  return (votes / totalVotes) * 100\n}\n\n\n\n// WEBPACK FOOTER //\n// ./src/shared/components/Result/components/ResultList/helpers/getScorePercent.js","// @flow\n/** @jsx h */\n\nimport { h, Component } from 'preact'\n\nimport styles from './Bar.css'\nimport { bem } from '../../../../../../../../helpers/bem'\nimport { themeToClassName } from '../../../../../../../../helpers/themeToClassName'\n\ntype Props = {\n  width: number,\n  isHighlighted: boolean,\n  isSlim: boolean\n}\n\ntype State = {\n  isMounted: boolean\n}\n\nexport class Bar extends Component<Props, State> {\n  state = {\n    isMounted: false\n  }\n\n  componentDidMount () {\n    setTimeout(() => {\n      requestAnimationFrame(() => {\n        this.setState({\n          isMounted: true\n        })\n      })\n    }, 80)\n  }\n\n  render () {\n    const { width, isHighlighted, isSlim } = this.props\n    const { isMounted } = this.state\n    const { theme, isInteractive } = this.context\n\n    // isInteractive is set through context, and is set to true if\n    // the application / component is hydrated on the client\n    const transform = isInteractive\n      ? getTransform(isMounted ? width : 0)\n      : getTransform(width)\n    return (\n      <div className={bem(styles.bar, isSlim ? 'slim' : null)}>\n        <div\n          className={bem(\n            styles.bar__main,\n            themeToClassName(theme),\n            isHighlighted ? 'highlighted' : ''\n          )}\n          style={transform}\n        />\n      </div>\n    )\n  }\n}\n\nfunction getTransform (width: number, transitionDelayMs: number = 20): Object {\n  // Ensure bars get a certain width\n  if (width < 5) width = 5\n  const transform = `translateX(-${100 - width}%)`\n  return {\n    WebkitTransform: transform,\n    MozTransform: transform,\n    msTransform: transform,\n    OTransform: transform,\n    transform,\n    transitionDelay: '20ms'\n  }\n}\n\n\n\n// WEBPACK FOOTER //\n// ./src/shared/components/Result/components/ResultList/components/ResultItem/components/Bar/Bar.js","// @flow\n/** @jsx h */\n\nimport { h } from 'preact'\nimport styles from '../../ResultItem.css'\nimport { bem } from '../../../../../../../../helpers/bem'\n\ntype Props = {\n  scorePercent: number,\n  hidden?: boolean\n}\n\nexport function Percent ({ scorePercent, hidden = false }: Props) {\n  const shouldTransform = false\n  const transform = shouldTransform ? getTransform(scorePercent) : {}\n\n  return (\n    <div className={bem(styles['resultItem__score'], hidden ? 'hidden' : '')} style={transform}>\n      <span className={styles['resultItem__score-text']}>\n        {prettyPrintScorePercent(scorePercent)}\n      </span>\n    </div>\n  )\n}\n\nfunction prettyPrintScorePercent (scorePercent): string {\n  return `${scorePercent.toFixed(0)} %`\n}\n\nfunction getTransform (width: number, transitionDelayMs: number = 20): Object {\n  // Ensure bars get a certain width\n  if (width < 5) {\n    width = 5\n  }\n  const transform = `translateX(-${100 - width}%)`\n  return {\n    left: 40,\n    WebkitTransform: transform,\n    MozTransform: transform,\n    msTransform: transform,\n    OTransform: transform,\n    transform,\n    transitionDelay: '20ms'\n  }\n}\n\n\n\n// WEBPACK FOOTER //\n// ./src/shared/components/Result/components/ResultList/components/ResultItem/components/Percent/Percent.js","// @flow\n/** @jsx h */\n\nimport { h } from 'preact'\nimport styles from '../../ResultItem.css'\nimport { bem } from '../../../../../../../../helpers/bem'\n\ntype Props = {\n  value: number,\n  hidden?: boolean\n}\n\nexport function Number ({ value, hidden = true }: Props) {\n  return (\n    <div className={bem(styles['resultItem__score'], hidden ? 'hidden' : '')}>\n      <span className={styles['resultItem__score-text']}>\n        {prettyPrintNumber(value)}\n      </span>\n    </div>\n  )\n}\n\nconst prettyPrintNumber = (value: number): string => value.toLocaleString()\n\n\n\n// WEBPACK FOOTER //\n// ./src/shared/components/Result/components/ResultList/components/ResultItem/components/Number/Number.js","// removed by extract-text-webpack-plugin\nmodule.exports = {\"error\":\"dh-stemning-error\"};\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./src/shared/components/Error/Error.css\n// module id = 61\n// module chunks = 0 1","// removed by extract-text-webpack-plugin\nmodule.exports = {\"loader\":\"dh-stemning-loader\",\"anim\":\"dh-stemning-anim\"};\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./src/shared/components/Loader/Loader.css\n// module id = 62\n// module chunks = 0 1","// removed by extract-text-webpack-plugin\nmodule.exports = {\"stemningIcon\":\"dh-stemning-stemningIcon\",\"stemningIcon--theme-sport\":\"dh-stemning-stemningIcon--theme-sport\",\"stemningIcon--theme-sport-inverted-gray\":\"dh-stemning-stemningIcon--theme-sport-inverted-gray\",\"stemningIcon--theme-sport-inverted\":\"dh-stemning-stemningIcon--theme-sport-inverted\",\"stemningIcon--theme-monsen\":\"dh-stemning-stemningIcon--theme-monsen\",\"animate\":\"dh-stemning-animate\",\"animate--once\":\"dh-stemning-animate--once\",\"anim\":\"dh-stemning-anim\",\"animate--infinite\":\"dh-stemning-animate--infinite\",\"rect-1\":\"dh-stemning-rect-1\",\"rect-2\":\"dh-stemning-rect-2\",\"rect-3\":\"dh-stemning-rect-3\"};\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./src/shared/components/StemningIcon/StemningIcon.css\n// module id = 63\n// module chunks = 0 1","// removed by extract-text-webpack-plugin\nmodule.exports = {\"retryButton\":\"dh-stemning-retryButton\",\"retryButton--theme-sport\":\"dh-stemning-retryButton--theme-sport\"};\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./src/shared/widgets/LivePoll/components/LivePoll/RetryButton/RetryButton.css\n// module id = 64\n// module chunks = 0 1","exports.defaults = {};\r\n\r\nexports.set = function(name, value, options) {\r\n  // Retrieve options and defaults\r\n  var opts = options || {};\r\n  var defaults = exports.defaults;\r\n\r\n  // Apply default value for unspecified options\r\n  var expires  = opts.expires  || defaults.expires;\r\n  var domain   = opts.domain   || defaults.domain;\r\n  var path     = opts.path     !== undefined ? opts.path     : (defaults.path !== undefined ? defaults.path : '/');\r\n  var secure   = opts.secure   !== undefined ? opts.secure   : defaults.secure;\r\n  var httponly = opts.httponly !== undefined ? opts.httponly : defaults.httponly;\r\n\r\n  // Determine cookie expiration date\r\n  // If succesful the result will be a valid Date, otherwise it will be an invalid Date or false(ish)\r\n  var expDate = expires ? new Date(\r\n      // in case expires is an integer, it should specify the number of days till the cookie expires\r\n      typeof expires === 'number' ? new Date().getTime() + (expires * 864e5) :\r\n      // else expires should be either a Date object or in a format recognized by Date.parse()\r\n      expires\r\n  ) : '';\r\n\r\n  // Set cookie\r\n  document.cookie = name.replace(/[^+#$&^`|]/g, encodeURIComponent)                // Encode cookie name\r\n  .replace('(', '%28')\r\n  .replace(')', '%29') +\r\n  '=' + value.replace(/[^+#$&/:<-\\[\\]-}]/g, encodeURIComponent) +                  // Encode cookie value (RFC6265)\r\n  (expDate && expDate.getTime() >= 0 ? ';expires=' + expDate.toUTCString() : '') + // Add expiration date\r\n  (domain   ? ';domain=' + domain : '') +                                          // Add domain\r\n  (path     ? ';path='   + path   : '') +                                          // Add path\r\n  (secure   ? ';secure'           : '') +                                          // Add secure option\r\n  (httponly ? ';httponly'         : '');                                           // Add httponly option\r\n};\r\n\r\nexports.get = function(name) {\r\n  var cookies = document.cookie.split(';');\r\n\r\n  // Iterate all cookies\r\n  for(var i = 0; i < cookies.length; i++) {\r\n    var cookie = cookies[i];\r\n    var cookieLength = cookie.length;\r\n\r\n    // Determine separator index (\"name=value\")\r\n    var separatorIndex = cookie.indexOf('=');\r\n\r\n    // IE<11 emits the equal sign when the cookie value is empty\r\n    separatorIndex = separatorIndex < 0 ? cookieLength : separatorIndex;\r\n\r\n    var cookie_name = decodeURIComponent(cookie.substring(0, separatorIndex).replace(/^\\s+/, ''));\r\n\r\n    // Return cookie value if the name matches\r\n    if (cookie_name === name) {\r\n      return decodeURIComponent(cookie.substring(separatorIndex + 1, cookieLength));\r\n    }\r\n  }\r\n\r\n  // Return `null` as the cookie was not found\r\n  return null;\r\n};\r\n\r\nexports.erase = function(name, options) {\r\n  exports.set(name, '', {\r\n    expires:  -1,\r\n    domain:   options && options.domain,\r\n    path:     options && options.path,\r\n    secure:   0,\r\n    httponly: 0}\r\n  );\r\n};\r\n\r\nexports.all = function() {\r\n  var all = {};\r\n  var cookies = document.cookie.split(';');\r\n\r\n  // Iterate all cookies\r\n  for(var i = 0; i < cookies.length; i++) {\r\n\t  var cookie = cookies[i];\r\n    var cookieLength = cookie.length;\r\n\r\n\t  // Determine separator index (\"name=value\")\r\n\t  var separatorIndex = cookie.indexOf('=');\r\n\r\n\t  // IE<11 emits the equal sign when the cookie value is empty\r\n\t  separatorIndex = separatorIndex < 0 ? cookieLength : separatorIndex;\r\n\r\n    // add the cookie name and value to the `all` object\r\n\t  var cookie_name = decodeURIComponent(cookie.substring(0, separatorIndex).replace(/^\\s+/, ''));\r\n\t  all[cookie_name] = decodeURIComponent(cookie.substring(separatorIndex + 1, cookieLength));\r\n\t}\r\n\r\n  return all;\r\n};\r\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/browser-cookies/src/browser-cookies.js","// @flow @jsx h\n\nimport { h } from 'preact'\nimport { StemningIcon } from '../StemningIcon/StemningIcon'\n\nimport styles from './Branding.css'\nimport { bem } from '../../helpers/bem'\nimport { themeToClassName } from '../../helpers/themeToClassName'\n\nexport const Branding = (props: any, context: { theme: string }) => {\n  return (\n    <div className={bem(styles.branding, themeToClassName(context.theme))} aria-hidden>\n      <StemningIcon />\n      <span>Avstemning</span>\n    </div>\n  )\n}\n\n\n\n// WEBPACK FOOTER //\n// ./src/shared/components/Branding/Branding.js","// removed by extract-text-webpack-plugin\nmodule.exports = {\"branding\":\"dh-stemning-branding\",\"stemningIcon\":\"dh-stemning-stemningIcon\",\"branding--theme-sport\":\"dh-stemning-branding--theme-sport\"};\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./src/shared/components/Branding/Branding.css\n// module id = 67\n// module chunks = 0 1","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\n/**\n * @fileoverview Firebase constants.  Some of these (@defines) can be overridden at compile-time.\n */\nexports.CONSTANTS = {\n    /**\n     * @define {boolean} Whether this is the client Node.js SDK.\n     */\n    NODE_CLIENT: false,\n    /**\n     * @define {boolean} Whether this is the Admin Node.js SDK.\n     */\n    NODE_ADMIN: false,\n    /**\n     * Firebase SDK Version\n     */\n    SDK_VERSION: '${JSCORE_VERSION}'\n};\n\n//# sourceMappingURL=constants.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/util/dist/cjs/src/constants.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nvar __extends = (this && this.__extends) || (function () {\n    var extendStatics = Object.setPrototypeOf ||\n        ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n        function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };\n    return function (d, b) {\n        extendStatics(d, b);\n        function __() { this.constructor = d; }\n        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n    };\n})();\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar onDisconnect_1 = require(\"./onDisconnect\");\nvar TransactionResult_1 = require(\"./TransactionResult\");\nvar util_1 = require(\"../core/util/util\");\nvar NextPushId_1 = require(\"../core/util/NextPushId\");\nvar Query_1 = require(\"./Query\");\nvar Repo_1 = require(\"../core/Repo\");\nvar Path_1 = require(\"../core/util/Path\");\nvar QueryParams_1 = require(\"../core/view/QueryParams\");\nvar validation_1 = require(\"../core/util/validation\");\nvar util_2 = require(\"@firebase/util\");\nvar util_3 = require(\"@firebase/util\");\nvar SyncPoint_1 = require(\"../core/SyncPoint\");\nvar Reference = /** @class */ (function (_super) {\n    __extends(Reference, _super);\n    /**\n     * Call options:\n     *   new Reference(Repo, Path) or\n     *   new Reference(url: string, string|RepoManager)\n     *\n     * Externally - this is the firebase.database.Reference type.\n     *\n     * @param {!Repo} repo\n     * @param {(!Path)} path\n     * @extends {Query}\n     */\n    function Reference(repo, path) {\n        var _this = this;\n        if (!(repo instanceof Repo_1.Repo)) {\n            throw new Error('new Reference() no longer supported - use app.database().');\n        }\n        // call Query's constructor, passing in the repo and path.\n        _this = _super.call(this, repo, path, QueryParams_1.QueryParams.DEFAULT, false) || this;\n        return _this;\n    }\n    /** @return {?string} */\n    Reference.prototype.getKey = function () {\n        util_2.validateArgCount('Reference.key', 0, 0, arguments.length);\n        if (this.path.isEmpty())\n            return null;\n        else\n            return this.path.getBack();\n    };\n    /**\n     * @param {!(string|Path)} pathString\n     * @return {!Reference}\n     */\n    Reference.prototype.child = function (pathString) {\n        util_2.validateArgCount('Reference.child', 1, 1, arguments.length);\n        if (typeof pathString === 'number') {\n            pathString = String(pathString);\n        }\n        else if (!(pathString instanceof Path_1.Path)) {\n            if (this.path.getFront() === null)\n                validation_1.validateRootPathString('Reference.child', 1, pathString, false);\n            else\n                validation_1.validatePathString('Reference.child', 1, pathString, false);\n        }\n        return new Reference(this.repo, this.path.child(pathString));\n    };\n    /** @return {?Reference} */\n    Reference.prototype.getParent = function () {\n        util_2.validateArgCount('Reference.parent', 0, 0, arguments.length);\n        var parentPath = this.path.parent();\n        return parentPath === null ? null : new Reference(this.repo, parentPath);\n    };\n    /** @return {!Reference} */\n    Reference.prototype.getRoot = function () {\n        util_2.validateArgCount('Reference.root', 0, 0, arguments.length);\n        var ref = this;\n        while (ref.getParent() !== null) {\n            ref = ref.getParent();\n        }\n        return ref;\n    };\n    /** @return {!Database} */\n    Reference.prototype.databaseProp = function () {\n        return this.repo.database;\n    };\n    /**\n     * @param {*} newVal\n     * @param {function(?Error)=} onComplete\n     * @return {!Promise}\n     */\n    Reference.prototype.set = function (newVal, onComplete) {\n        util_2.validateArgCount('Reference.set', 1, 2, arguments.length);\n        validation_1.validateWritablePath('Reference.set', this.path);\n        validation_1.validateFirebaseDataArg('Reference.set', 1, newVal, this.path, false);\n        util_2.validateCallback('Reference.set', 2, onComplete, true);\n        var deferred = new util_3.Deferred();\n        this.repo.setWithPriority(this.path, newVal, \n        /*priority=*/ null, deferred.wrapCallback(onComplete));\n        return deferred.promise;\n    };\n    /**\n     * @param {!Object} objectToMerge\n     * @param {function(?Error)=} onComplete\n     * @return {!Promise}\n     */\n    Reference.prototype.update = function (objectToMerge, onComplete) {\n        util_2.validateArgCount('Reference.update', 1, 2, arguments.length);\n        validation_1.validateWritablePath('Reference.update', this.path);\n        if (Array.isArray(objectToMerge)) {\n            var newObjectToMerge = {};\n            for (var i = 0; i < objectToMerge.length; ++i) {\n                newObjectToMerge['' + i] = objectToMerge[i];\n            }\n            objectToMerge = newObjectToMerge;\n            util_1.warn('Passing an Array to Firebase.update() is deprecated. ' +\n                'Use set() if you want to overwrite the existing data, or ' +\n                'an Object with integer keys if you really do want to ' +\n                'only update some of the children.');\n        }\n        validation_1.validateFirebaseMergeDataArg('Reference.update', 1, objectToMerge, this.path, false);\n        util_2.validateCallback('Reference.update', 2, onComplete, true);\n        var deferred = new util_3.Deferred();\n        this.repo.update(this.path, objectToMerge, deferred.wrapCallback(onComplete));\n        return deferred.promise;\n    };\n    /**\n     * @param {*} newVal\n     * @param {string|number|null} newPriority\n     * @param {function(?Error)=} onComplete\n     * @return {!Promise}\n     */\n    Reference.prototype.setWithPriority = function (newVal, newPriority, onComplete) {\n        util_2.validateArgCount('Reference.setWithPriority', 2, 3, arguments.length);\n        validation_1.validateWritablePath('Reference.setWithPriority', this.path);\n        validation_1.validateFirebaseDataArg('Reference.setWithPriority', 1, newVal, this.path, false);\n        validation_1.validatePriority('Reference.setWithPriority', 2, newPriority, false);\n        util_2.validateCallback('Reference.setWithPriority', 3, onComplete, true);\n        if (this.getKey() === '.length' || this.getKey() === '.keys')\n            throw 'Reference.setWithPriority failed: ' +\n                this.getKey() +\n                ' is a read-only object.';\n        var deferred = new util_3.Deferred();\n        this.repo.setWithPriority(this.path, newVal, newPriority, deferred.wrapCallback(onComplete));\n        return deferred.promise;\n    };\n    /**\n     * @param {function(?Error)=} onComplete\n     * @return {!Promise}\n     */\n    Reference.prototype.remove = function (onComplete) {\n        util_2.validateArgCount('Reference.remove', 0, 1, arguments.length);\n        validation_1.validateWritablePath('Reference.remove', this.path);\n        util_2.validateCallback('Reference.remove', 1, onComplete, true);\n        return this.set(null, onComplete);\n    };\n    /**\n     * @param {function(*):*} transactionUpdate\n     * @param {(function(?Error, boolean, ?DataSnapshot))=} onComplete\n     * @param {boolean=} applyLocally\n     * @return {!Promise}\n     */\n    Reference.prototype.transaction = function (transactionUpdate, onComplete, applyLocally) {\n        util_2.validateArgCount('Reference.transaction', 1, 3, arguments.length);\n        validation_1.validateWritablePath('Reference.transaction', this.path);\n        util_2.validateCallback('Reference.transaction', 1, transactionUpdate, false);\n        util_2.validateCallback('Reference.transaction', 2, onComplete, true);\n        // NOTE: applyLocally is an internal-only option for now.  We need to decide if we want to keep it and how\n        // to expose it.\n        validation_1.validateBoolean('Reference.transaction', 3, applyLocally, true);\n        if (this.getKey() === '.length' || this.getKey() === '.keys')\n            throw 'Reference.transaction failed: ' +\n                this.getKey() +\n                ' is a read-only object.';\n        if (applyLocally === undefined)\n            applyLocally = true;\n        var deferred = new util_3.Deferred();\n        if (typeof onComplete === 'function') {\n            deferred.promise.catch(function () { });\n        }\n        var promiseComplete = function (error, committed, snapshot) {\n            if (error) {\n                deferred.reject(error);\n            }\n            else {\n                deferred.resolve(new TransactionResult_1.TransactionResult(committed, snapshot));\n            }\n            if (typeof onComplete === 'function') {\n                onComplete(error, committed, snapshot);\n            }\n        };\n        this.repo.startTransaction(this.path, transactionUpdate, promiseComplete, applyLocally);\n        return deferred.promise;\n    };\n    /**\n     * @param {string|number|null} priority\n     * @param {function(?Error)=} onComplete\n     * @return {!Promise}\n     */\n    Reference.prototype.setPriority = function (priority, onComplete) {\n        util_2.validateArgCount('Reference.setPriority', 1, 2, arguments.length);\n        validation_1.validateWritablePath('Reference.setPriority', this.path);\n        validation_1.validatePriority('Reference.setPriority', 1, priority, false);\n        util_2.validateCallback('Reference.setPriority', 2, onComplete, true);\n        var deferred = new util_3.Deferred();\n        this.repo.setWithPriority(this.path.child('.priority'), priority, null, deferred.wrapCallback(onComplete));\n        return deferred.promise;\n    };\n    /**\n     * @param {*=} value\n     * @param {function(?Error)=} onComplete\n     * @return {!Reference}\n     */\n    Reference.prototype.push = function (value, onComplete) {\n        util_2.validateArgCount('Reference.push', 0, 2, arguments.length);\n        validation_1.validateWritablePath('Reference.push', this.path);\n        validation_1.validateFirebaseDataArg('Reference.push', 1, value, this.path, true);\n        util_2.validateCallback('Reference.push', 2, onComplete, true);\n        var now = this.repo.serverTime();\n        var name = NextPushId_1.nextPushId(now);\n        // push() returns a ThennableReference whose promise is fulfilled with a regular Reference.\n        // We use child() to create handles to two different references. The first is turned into a\n        // ThennableReference below by adding then() and catch() methods and is used as the\n        // return value of push(). The second remains a regular Reference and is used as the fulfilled\n        // value of the first ThennableReference.\n        var thennablePushRef = this.child(name);\n        var pushRef = this.child(name);\n        var promise;\n        if (value != null) {\n            promise = thennablePushRef.set(value, onComplete).then(function () { return pushRef; });\n        }\n        else {\n            promise = Promise.resolve(pushRef);\n        }\n        thennablePushRef.then = promise.then.bind(promise);\n        thennablePushRef.catch = promise.then.bind(promise, undefined);\n        if (typeof onComplete === 'function') {\n            promise.catch(function () { });\n        }\n        return thennablePushRef;\n    };\n    /**\n     * @return {!OnDisconnect}\n     */\n    Reference.prototype.onDisconnect = function () {\n        validation_1.validateWritablePath('Reference.onDisconnect', this.path);\n        return new onDisconnect_1.OnDisconnect(this.repo, this.path);\n    };\n    Object.defineProperty(Reference.prototype, \"database\", {\n        get: function () {\n            return this.databaseProp();\n        },\n        enumerable: true,\n        configurable: true\n    });\n    Object.defineProperty(Reference.prototype, \"key\", {\n        get: function () {\n            return this.getKey();\n        },\n        enumerable: true,\n        configurable: true\n    });\n    Object.defineProperty(Reference.prototype, \"parent\", {\n        get: function () {\n            return this.getParent();\n        },\n        enumerable: true,\n        configurable: true\n    });\n    Object.defineProperty(Reference.prototype, \"root\", {\n        get: function () {\n            return this.getRoot();\n        },\n        enumerable: true,\n        configurable: true\n    });\n    return Reference;\n}(Query_1.Query));\nexports.Reference = Reference;\n/**\n * Define reference constructor in various modules\n *\n * We are doing this here to avoid several circular\n * dependency issues\n */\nQuery_1.Query.__referenceConstructor = Reference;\nSyncPoint_1.SyncPoint.__referenceConstructor = Reference;\n\n//# sourceMappingURL=Reference.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/api/Reference.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = require(\"@firebase/util\");\nvar validation_1 = require(\"../core/util/validation\");\nvar Path_1 = require(\"../core/util/Path\");\nvar PriorityIndex_1 = require(\"../core/snap/indexes/PriorityIndex\");\n/**\n * Class representing a firebase data snapshot.  It wraps a SnapshotNode and\n * surfaces the public methods (val, forEach, etc.) we want to expose.\n */\nvar DataSnapshot = /** @class */ (function () {\n    /**\n     * @param {!Node} node_ A SnapshotNode to wrap.\n     * @param {!Reference} ref_ The ref of the location this snapshot came from.\n     * @param {!Index} index_ The iteration order for this snapshot\n     */\n    function DataSnapshot(node_, ref_, index_) {\n        this.node_ = node_;\n        this.ref_ = ref_;\n        this.index_ = index_;\n    }\n    /**\n     * Retrieves the snapshot contents as JSON.  Returns null if the snapshot is\n     * empty.\n     *\n     * @return {*} JSON representation of the DataSnapshot contents, or null if empty.\n     */\n    DataSnapshot.prototype.val = function () {\n        util_1.validateArgCount('DataSnapshot.val', 0, 0, arguments.length);\n        return this.node_.val();\n    };\n    /**\n     * Returns the snapshot contents as JSON, including priorities of node.  Suitable for exporting\n     * the entire node contents.\n     * @return {*} JSON representation of the DataSnapshot contents, or null if empty.\n     */\n    DataSnapshot.prototype.exportVal = function () {\n        util_1.validateArgCount('DataSnapshot.exportVal', 0, 0, arguments.length);\n        return this.node_.val(true);\n    };\n    // Do not create public documentation. This is intended to make JSON serialization work but is otherwise unnecessary\n    // for end-users\n    DataSnapshot.prototype.toJSON = function () {\n        // Optional spacer argument is unnecessary because we're depending on recursion rather than stringifying the content\n        util_1.validateArgCount('DataSnapshot.toJSON', 0, 1, arguments.length);\n        return this.exportVal();\n    };\n    /**\n     * Returns whether the snapshot contains a non-null value.\n     *\n     * @return {boolean} Whether the snapshot contains a non-null value, or is empty.\n     */\n    DataSnapshot.prototype.exists = function () {\n        util_1.validateArgCount('DataSnapshot.exists', 0, 0, arguments.length);\n        return !this.node_.isEmpty();\n    };\n    /**\n     * Returns a DataSnapshot of the specified child node's contents.\n     *\n     * @param {!string} childPathString Path to a child.\n     * @return {!DataSnapshot} DataSnapshot for child node.\n     */\n    DataSnapshot.prototype.child = function (childPathString) {\n        util_1.validateArgCount('DataSnapshot.child', 0, 1, arguments.length);\n        // Ensure the childPath is a string (can be a number)\n        childPathString = String(childPathString);\n        validation_1.validatePathString('DataSnapshot.child', 1, childPathString, false);\n        var childPath = new Path_1.Path(childPathString);\n        var childRef = this.ref_.child(childPath);\n        return new DataSnapshot(this.node_.getChild(childPath), childRef, PriorityIndex_1.PRIORITY_INDEX);\n    };\n    /**\n     * Returns whether the snapshot contains a child at the specified path.\n     *\n     * @param {!string} childPathString Path to a child.\n     * @return {boolean} Whether the child exists.\n     */\n    DataSnapshot.prototype.hasChild = function (childPathString) {\n        util_1.validateArgCount('DataSnapshot.hasChild', 1, 1, arguments.length);\n        validation_1.validatePathString('DataSnapshot.hasChild', 1, childPathString, false);\n        var childPath = new Path_1.Path(childPathString);\n        return !this.node_.getChild(childPath).isEmpty();\n    };\n    /**\n     * Returns the priority of the object, or null if no priority was set.\n     *\n     * @return {string|number|null} The priority.\n     */\n    DataSnapshot.prototype.getPriority = function () {\n        util_1.validateArgCount('DataSnapshot.getPriority', 0, 0, arguments.length);\n        // typecast here because we never return deferred values or internal priorities (MAX_PRIORITY)\n        return this.node_.getPriority().val();\n    };\n    /**\n     * Iterates through child nodes and calls the specified action for each one.\n     *\n     * @param {function(!DataSnapshot)} action Callback function to be called\n     * for each child.\n     * @return {boolean} True if forEach was canceled by action returning true for\n     * one of the child nodes.\n     */\n    DataSnapshot.prototype.forEach = function (action) {\n        var _this = this;\n        util_1.validateArgCount('DataSnapshot.forEach', 1, 1, arguments.length);\n        util_1.validateCallback('DataSnapshot.forEach', 1, action, false);\n        if (this.node_.isLeafNode())\n            return false;\n        var childrenNode = this.node_;\n        // Sanitize the return value to a boolean. ChildrenNode.forEachChild has a weird return type...\n        return !!childrenNode.forEachChild(this.index_, function (key, node) {\n            return action(new DataSnapshot(node, _this.ref_.child(key), PriorityIndex_1.PRIORITY_INDEX));\n        });\n    };\n    /**\n     * Returns whether this DataSnapshot has children.\n     * @return {boolean} True if the DataSnapshot contains 1 or more child nodes.\n     */\n    DataSnapshot.prototype.hasChildren = function () {\n        util_1.validateArgCount('DataSnapshot.hasChildren', 0, 0, arguments.length);\n        if (this.node_.isLeafNode())\n            return false;\n        else\n            return !this.node_.isEmpty();\n    };\n    Object.defineProperty(DataSnapshot.prototype, \"key\", {\n        get: function () {\n            return this.ref_.getKey();\n        },\n        enumerable: true,\n        configurable: true\n    });\n    /**\n     * Returns the number of children for this DataSnapshot.\n     * @return {number} The number of children that this DataSnapshot contains.\n     */\n    DataSnapshot.prototype.numChildren = function () {\n        util_1.validateArgCount('DataSnapshot.numChildren', 0, 0, arguments.length);\n        return this.node_.numChildren();\n    };\n    /**\n     * @return {Reference} The Firebase reference for the location this snapshot's data came from.\n     */\n    DataSnapshot.prototype.getRef = function () {\n        util_1.validateArgCount('DataSnapshot.ref', 0, 0, arguments.length);\n        return this.ref_;\n    };\n    Object.defineProperty(DataSnapshot.prototype, \"ref\", {\n        get: function () {\n            return this.getRef();\n        },\n        enumerable: true,\n        configurable: true\n    });\n    return DataSnapshot;\n}());\nexports.DataSnapshot = DataSnapshot;\n\n//# sourceMappingURL=DataSnapshot.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/api/DataSnapshot.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar SortedMap_1 = require(\"./SortedMap\");\nvar Path_1 = require(\"./Path\");\nvar util_1 = require(\"./util\");\nvar util_2 = require(\"@firebase/util\");\nvar emptyChildrenSingleton;\n/**\n * Singleton empty children collection.\n *\n * @const\n * @type {!SortedMap.<string, !ImmutableTree.<?>>}\n */\nvar EmptyChildren = function () {\n    if (!emptyChildrenSingleton) {\n        emptyChildrenSingleton = new SortedMap_1.SortedMap(util_1.stringCompare);\n    }\n    return emptyChildrenSingleton;\n};\n/**\n * A tree with immutable elements.\n */\nvar ImmutableTree = /** @class */ (function () {\n    /**\n     * @template T\n     * @param {?T} value\n     * @param {SortedMap.<string, !ImmutableTree.<T>>=} children\n     */\n    function ImmutableTree(value, children) {\n        if (children === void 0) { children = EmptyChildren(); }\n        this.value = value;\n        this.children = children;\n    }\n    /**\n     * @template T\n     * @param {!Object.<string, !T>} obj\n     * @return {!ImmutableTree.<!T>}\n     */\n    ImmutableTree.fromObject = function (obj) {\n        var tree = ImmutableTree.Empty;\n        util_2.forEach(obj, function (childPath, childSnap) {\n            tree = tree.set(new Path_1.Path(childPath), childSnap);\n        });\n        return tree;\n    };\n    /**\n     * True if the value is empty and there are no children\n     * @return {boolean}\n     */\n    ImmutableTree.prototype.isEmpty = function () {\n        return this.value === null && this.children.isEmpty();\n    };\n    /**\n     * Given a path and predicate, return the first node and the path to that node\n     * where the predicate returns true.\n     *\n     * TODO Do a perf test -- If we're creating a bunch of {path: value:} objects\n     * on the way back out, it may be better to pass down a pathSoFar obj.\n     *\n     * @param {!Path} relativePath The remainder of the path\n     * @param {function(T):boolean} predicate The predicate to satisfy to return a\n     *   node\n     * @return {?{path:!Path, value:!T}}\n     */\n    ImmutableTree.prototype.findRootMostMatchingPathAndValue = function (relativePath, predicate) {\n        if (this.value != null && predicate(this.value)) {\n            return { path: Path_1.Path.Empty, value: this.value };\n        }\n        else {\n            if (relativePath.isEmpty()) {\n                return null;\n            }\n            else {\n                var front = relativePath.getFront();\n                var child = this.children.get(front);\n                if (child !== null) {\n                    var childExistingPathAndValue = child.findRootMostMatchingPathAndValue(relativePath.popFront(), predicate);\n                    if (childExistingPathAndValue != null) {\n                        var fullPath = new Path_1.Path(front).child(childExistingPathAndValue.path);\n                        return { path: fullPath, value: childExistingPathAndValue.value };\n                    }\n                    else {\n                        return null;\n                    }\n                }\n                else {\n                    return null;\n                }\n            }\n        }\n    };\n    /**\n     * Find, if it exists, the shortest subpath of the given path that points a defined\n     * value in the tree\n     * @param {!Path} relativePath\n     * @return {?{path: !Path, value: !T}}\n     */\n    ImmutableTree.prototype.findRootMostValueAndPath = function (relativePath) {\n        return this.findRootMostMatchingPathAndValue(relativePath, function () { return true; });\n    };\n    /**\n     * @param {!Path} relativePath\n     * @return {!ImmutableTree.<T>} The subtree at the given path\n     */\n    ImmutableTree.prototype.subtree = function (relativePath) {\n        if (relativePath.isEmpty()) {\n            return this;\n        }\n        else {\n            var front = relativePath.getFront();\n            var childTree = this.children.get(front);\n            if (childTree !== null) {\n                return childTree.subtree(relativePath.popFront());\n            }\n            else {\n                return ImmutableTree.Empty;\n            }\n        }\n    };\n    /**\n     * Sets a value at the specified path.\n     *\n     * @param {!Path} relativePath Path to set value at.\n     * @param {?T} toSet Value to set.\n     * @return {!ImmutableTree.<T>} Resulting tree.\n     */\n    ImmutableTree.prototype.set = function (relativePath, toSet) {\n        if (relativePath.isEmpty()) {\n            return new ImmutableTree(toSet, this.children);\n        }\n        else {\n            var front = relativePath.getFront();\n            var child = this.children.get(front) || ImmutableTree.Empty;\n            var newChild = child.set(relativePath.popFront(), toSet);\n            var newChildren = this.children.insert(front, newChild);\n            return new ImmutableTree(this.value, newChildren);\n        }\n    };\n    /**\n     * Removes the value at the specified path.\n     *\n     * @param {!Path} relativePath Path to value to remove.\n     * @return {!ImmutableTree.<T>} Resulting tree.\n     */\n    ImmutableTree.prototype.remove = function (relativePath) {\n        if (relativePath.isEmpty()) {\n            if (this.children.isEmpty()) {\n                return ImmutableTree.Empty;\n            }\n            else {\n                return new ImmutableTree(null, this.children);\n            }\n        }\n        else {\n            var front = relativePath.getFront();\n            var child = this.children.get(front);\n            if (child) {\n                var newChild = child.remove(relativePath.popFront());\n                var newChildren = void 0;\n                if (newChild.isEmpty()) {\n                    newChildren = this.children.remove(front);\n                }\n                else {\n                    newChildren = this.children.insert(front, newChild);\n                }\n                if (this.value === null && newChildren.isEmpty()) {\n                    return ImmutableTree.Empty;\n                }\n                else {\n                    return new ImmutableTree(this.value, newChildren);\n                }\n            }\n            else {\n                return this;\n            }\n        }\n    };\n    /**\n     * Gets a value from the tree.\n     *\n     * @param {!Path} relativePath Path to get value for.\n     * @return {?T} Value at path, or null.\n     */\n    ImmutableTree.prototype.get = function (relativePath) {\n        if (relativePath.isEmpty()) {\n            return this.value;\n        }\n        else {\n            var front = relativePath.getFront();\n            var child = this.children.get(front);\n            if (child) {\n                return child.get(relativePath.popFront());\n            }\n            else {\n                return null;\n            }\n        }\n    };\n    /**\n     * Replace the subtree at the specified path with the given new tree.\n     *\n     * @param {!Path} relativePath Path to replace subtree for.\n     * @param {!ImmutableTree} newTree New tree.\n     * @return {!ImmutableTree} Resulting tree.\n     */\n    ImmutableTree.prototype.setTree = function (relativePath, newTree) {\n        if (relativePath.isEmpty()) {\n            return newTree;\n        }\n        else {\n            var front = relativePath.getFront();\n            var child = this.children.get(front) || ImmutableTree.Empty;\n            var newChild = child.setTree(relativePath.popFront(), newTree);\n            var newChildren = void 0;\n            if (newChild.isEmpty()) {\n                newChildren = this.children.remove(front);\n            }\n            else {\n                newChildren = this.children.insert(front, newChild);\n            }\n            return new ImmutableTree(this.value, newChildren);\n        }\n    };\n    /**\n     * Performs a depth first fold on this tree. Transforms a tree into a single\n     * value, given a function that operates on the path to a node, an optional\n     * current value, and a map of child names to folded subtrees\n     * @template V\n     * @param {function(Path, ?T, Object.<string, V>):V} fn\n     * @return {V}\n     */\n    ImmutableTree.prototype.fold = function (fn) {\n        return this.fold_(Path_1.Path.Empty, fn);\n    };\n    /**\n     * Recursive helper for public-facing fold() method\n     * @template V\n     * @param {!Path} pathSoFar\n     * @param {function(Path, ?T, Object.<string, V>):V} fn\n     * @return {V}\n     * @private\n     */\n    ImmutableTree.prototype.fold_ = function (pathSoFar, fn) {\n        var accum = {};\n        this.children.inorderTraversal(function (childKey, childTree) {\n            accum[childKey] = childTree.fold_(pathSoFar.child(childKey), fn);\n        });\n        return fn(pathSoFar, this.value, accum);\n    };\n    /**\n     * Find the first matching value on the given path. Return the result of applying f to it.\n     * @template V\n     * @param {!Path} path\n     * @param {!function(!Path, !T):?V} f\n     * @return {?V}\n     */\n    ImmutableTree.prototype.findOnPath = function (path, f) {\n        return this.findOnPath_(path, Path_1.Path.Empty, f);\n    };\n    ImmutableTree.prototype.findOnPath_ = function (pathToFollow, pathSoFar, f) {\n        var result = this.value ? f(pathSoFar, this.value) : false;\n        if (result) {\n            return result;\n        }\n        else {\n            if (pathToFollow.isEmpty()) {\n                return null;\n            }\n            else {\n                var front = pathToFollow.getFront();\n                var nextChild = this.children.get(front);\n                if (nextChild) {\n                    return nextChild.findOnPath_(pathToFollow.popFront(), pathSoFar.child(front), f);\n                }\n                else {\n                    return null;\n                }\n            }\n        }\n    };\n    /**\n     *\n     * @param {!Path} path\n     * @param {!function(!Path, !T)} f\n     * @returns {!ImmutableTree.<T>}\n     */\n    ImmutableTree.prototype.foreachOnPath = function (path, f) {\n        return this.foreachOnPath_(path, Path_1.Path.Empty, f);\n    };\n    ImmutableTree.prototype.foreachOnPath_ = function (pathToFollow, currentRelativePath, f) {\n        if (pathToFollow.isEmpty()) {\n            return this;\n        }\n        else {\n            if (this.value) {\n                f(currentRelativePath, this.value);\n            }\n            var front = pathToFollow.getFront();\n            var nextChild = this.children.get(front);\n            if (nextChild) {\n                return nextChild.foreachOnPath_(pathToFollow.popFront(), currentRelativePath.child(front), f);\n            }\n            else {\n                return ImmutableTree.Empty;\n            }\n        }\n    };\n    /**\n     * Calls the given function for each node in the tree that has a value.\n     *\n     * @param {function(!Path, !T)} f A function to be called with\n     *   the path from the root of the tree to a node, and the value at that node.\n     *   Called in depth-first order.\n     */\n    ImmutableTree.prototype.foreach = function (f) {\n        this.foreach_(Path_1.Path.Empty, f);\n    };\n    ImmutableTree.prototype.foreach_ = function (currentRelativePath, f) {\n        this.children.inorderTraversal(function (childName, childTree) {\n            childTree.foreach_(currentRelativePath.child(childName), f);\n        });\n        if (this.value) {\n            f(currentRelativePath, this.value);\n        }\n    };\n    /**\n     *\n     * @param {function(string, !T)} f\n     */\n    ImmutableTree.prototype.foreachChild = function (f) {\n        this.children.inorderTraversal(function (childName, childTree) {\n            if (childTree.value) {\n                f(childName, childTree.value);\n            }\n        });\n    };\n    ImmutableTree.Empty = new ImmutableTree(null);\n    return ImmutableTree;\n}());\nexports.ImmutableTree = ImmutableTree;\n\n//# sourceMappingURL=ImmutableTree.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/util/ImmutableTree.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = require(\"@firebase/util\");\nvar Change_1 = require(\"../Change\");\nvar ChildrenNode_1 = require(\"../../snap/ChildrenNode\");\nvar PriorityIndex_1 = require(\"../../snap/indexes/PriorityIndex\");\n/**\n * Doesn't really filter nodes but applies an index to the node and keeps track of any changes\n *\n * @constructor\n * @implements {NodeFilter}\n * @param {!Index} index\n */\nvar IndexedFilter = /** @class */ (function () {\n    function IndexedFilter(index_) {\n        this.index_ = index_;\n    }\n    IndexedFilter.prototype.updateChild = function (snap, key, newChild, affectedPath, source, optChangeAccumulator) {\n        util_1.assert(snap.isIndexed(this.index_), 'A node must be indexed if only a child is updated');\n        var oldChild = snap.getImmediateChild(key);\n        // Check if anything actually changed.\n        if (oldChild.getChild(affectedPath).equals(newChild.getChild(affectedPath))) {\n            // There's an edge case where a child can enter or leave the view because affectedPath was set to null.\n            // In this case, affectedPath will appear null in both the old and new snapshots.  So we need\n            // to avoid treating these cases as \"nothing changed.\"\n            if (oldChild.isEmpty() == newChild.isEmpty()) {\n                // Nothing changed.\n                // This assert should be valid, but it's expensive (can dominate perf testing) so don't actually do it.\n                //assert(oldChild.equals(newChild), 'Old and new snapshots should be equal.');\n                return snap;\n            }\n        }\n        if (optChangeAccumulator != null) {\n            if (newChild.isEmpty()) {\n                if (snap.hasChild(key)) {\n                    optChangeAccumulator.trackChildChange(Change_1.Change.childRemovedChange(key, oldChild));\n                }\n                else {\n                    util_1.assert(snap.isLeafNode(), 'A child remove without an old child only makes sense on a leaf node');\n                }\n            }\n            else if (oldChild.isEmpty()) {\n                optChangeAccumulator.trackChildChange(Change_1.Change.childAddedChange(key, newChild));\n            }\n            else {\n                optChangeAccumulator.trackChildChange(Change_1.Change.childChangedChange(key, newChild, oldChild));\n            }\n        }\n        if (snap.isLeafNode() && newChild.isEmpty()) {\n            return snap;\n        }\n        else {\n            // Make sure the node is indexed\n            return snap.updateImmediateChild(key, newChild).withIndex(this.index_);\n        }\n    };\n    /**\n     * @inheritDoc\n     */\n    IndexedFilter.prototype.updateFullNode = function (oldSnap, newSnap, optChangeAccumulator) {\n        if (optChangeAccumulator != null) {\n            if (!oldSnap.isLeafNode()) {\n                oldSnap.forEachChild(PriorityIndex_1.PRIORITY_INDEX, function (key, childNode) {\n                    if (!newSnap.hasChild(key)) {\n                        optChangeAccumulator.trackChildChange(Change_1.Change.childRemovedChange(key, childNode));\n                    }\n                });\n            }\n            if (!newSnap.isLeafNode()) {\n                newSnap.forEachChild(PriorityIndex_1.PRIORITY_INDEX, function (key, childNode) {\n                    if (oldSnap.hasChild(key)) {\n                        var oldChild = oldSnap.getImmediateChild(key);\n                        if (!oldChild.equals(childNode)) {\n                            optChangeAccumulator.trackChildChange(Change_1.Change.childChangedChange(key, childNode, oldChild));\n                        }\n                    }\n                    else {\n                        optChangeAccumulator.trackChildChange(Change_1.Change.childAddedChange(key, childNode));\n                    }\n                });\n            }\n        }\n        return newSnap.withIndex(this.index_);\n    };\n    /**\n     * @inheritDoc\n     */\n    IndexedFilter.prototype.updatePriority = function (oldSnap, newPriority) {\n        if (oldSnap.isEmpty()) {\n            return ChildrenNode_1.ChildrenNode.EMPTY_NODE;\n        }\n        else {\n            return oldSnap.updatePriority(newPriority);\n        }\n    };\n    /**\n     * @inheritDoc\n     */\n    IndexedFilter.prototype.filtersNodes = function () {\n        return false;\n    };\n    /**\n     * @inheritDoc\n     */\n    IndexedFilter.prototype.getIndexedFilter = function () {\n        return this;\n    };\n    /**\n     * @inheritDoc\n     */\n    IndexedFilter.prototype.getIndex = function () {\n        return this.index_;\n    };\n    return IndexedFilter;\n}());\nexports.IndexedFilter = IndexedFilter;\n\n//# sourceMappingURL=IndexedFilter.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/view/filter/IndexedFilter.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar StatsCollection_1 = require(\"./StatsCollection\");\nvar StatsManager = /** @class */ (function () {\n    function StatsManager() {\n    }\n    StatsManager.getCollection = function (repoInfo) {\n        var hashString = repoInfo.toString();\n        if (!this.collections_[hashString]) {\n            this.collections_[hashString] = new StatsCollection_1.StatsCollection();\n        }\n        return this.collections_[hashString];\n    };\n    StatsManager.getOrCreateReporter = function (repoInfo, creatorFunction) {\n        var hashString = repoInfo.toString();\n        if (!this.reporters_[hashString]) {\n            this.reporters_[hashString] = creatorFunction();\n        }\n        return this.reporters_[hashString];\n    };\n    StatsManager.collections_ = {};\n    StatsManager.reporters_ = {};\n    return StatsManager;\n}());\nexports.StatsManager = StatsManager;\n\n//# sourceMappingURL=StatsManager.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/stats/StatsManager.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = require(\"@firebase/util\");\nvar Repo_1 = require(\"./Repo\");\nvar util_2 = require(\"./util/util\");\nvar parser_1 = require(\"./util/libs/parser\");\nvar validation_1 = require(\"./util/validation\");\nrequire(\"./Repo_transaction\");\n/** @const {string} */\nvar DATABASE_URL_OPTION = 'databaseURL';\nvar _staticInstance;\n/**\n * Creates and caches Repo instances.\n */\nvar RepoManager = /** @class */ (function () {\n    function RepoManager() {\n        /**\n         * @private {!Object.<string, Object<string, !fb.core.Repo>>}\n         */\n        this.repos_ = {};\n        /**\n         * If true, new Repos will be created to use ReadonlyRestClient (for testing purposes).\n         * @private {boolean}\n         */\n        this.useRestClient_ = false;\n    }\n    RepoManager.getInstance = function () {\n        if (!_staticInstance) {\n            _staticInstance = new RepoManager();\n        }\n        return _staticInstance;\n    };\n    // TODO(koss): Remove these functions unless used in tests?\n    RepoManager.prototype.interrupt = function () {\n        for (var appName in this.repos_) {\n            for (var dbUrl in this.repos_[appName]) {\n                this.repos_[appName][dbUrl].interrupt();\n            }\n        }\n    };\n    RepoManager.prototype.resume = function () {\n        for (var appName in this.repos_) {\n            for (var dbUrl in this.repos_[appName]) {\n                this.repos_[appName][dbUrl].resume();\n            }\n        }\n    };\n    /**\n     * This function should only ever be called to CREATE a new database instance.\n     *\n     * @param {!FirebaseApp} app\n     * @return {!Database}\n     */\n    RepoManager.prototype.databaseFromApp = function (app, url) {\n        var dbUrl = url || app.options[DATABASE_URL_OPTION];\n        if (dbUrl === undefined) {\n            util_2.fatal(\"Can't determine Firebase Database URL.  Be sure to include \" +\n                DATABASE_URL_OPTION +\n                ' option when calling firebase.intializeApp().');\n        }\n        var parsedUrl = parser_1.parseRepoInfo(dbUrl);\n        var repoInfo = parsedUrl.repoInfo;\n        validation_1.validateUrl('Invalid Firebase Database URL', 1, parsedUrl);\n        if (!parsedUrl.path.isEmpty()) {\n            util_2.fatal('Database URL must point to the root of a Firebase Database ' +\n                '(not including a child path).');\n        }\n        var repo = this.createRepo(repoInfo, app);\n        return repo.database;\n    };\n    /**\n     * Remove the repo and make sure it is disconnected.\n     *\n     * @param {!Repo} repo\n     */\n    RepoManager.prototype.deleteRepo = function (repo) {\n        var appRepos = util_1.safeGet(this.repos_, repo.app.name);\n        // This should never happen...\n        if (!appRepos || util_1.safeGet(appRepos, repo.repoInfo_.toURLString()) !== repo) {\n            util_2.fatal(\"Database \" + repo.app.name + \"(\" + repo.repoInfo_ + \") has already been deleted.\");\n        }\n        repo.interrupt();\n        delete appRepos[repo.repoInfo_.toURLString()];\n    };\n    /**\n     * Ensures a repo doesn't already exist and then creates one using the\n     * provided app.\n     *\n     * @param {!RepoInfo} repoInfo The metadata about the Repo\n     * @param {!FirebaseApp} app\n     * @return {!Repo} The Repo object for the specified server / repoName.\n     */\n    RepoManager.prototype.createRepo = function (repoInfo, app) {\n        var appRepos = util_1.safeGet(this.repos_, app.name);\n        if (!appRepos) {\n            appRepos = {};\n            this.repos_[app.name] = appRepos;\n        }\n        var repo = util_1.safeGet(appRepos, repoInfo.toURLString());\n        if (repo) {\n            util_2.fatal('Database initialized multiple times. Please make sure the format of the database URL matches with each database() call.');\n        }\n        repo = new Repo_1.Repo(repoInfo, this.useRestClient_, app);\n        appRepos[repoInfo.toURLString()] = repo;\n        return repo;\n    };\n    /**\n     * Forces us to use ReadonlyRestClient instead of PersistentConnection for new Repos.\n     * @param {boolean} forceRestClient\n     */\n    RepoManager.prototype.forceRestClient = function (forceRestClient) {\n        this.useRestClient_ = forceRestClient;\n    };\n    return RepoManager;\n}());\nexports.RepoManager = RepoManager;\n\n//# sourceMappingURL=RepoManager.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/RepoManager.js","// noinspection ES6ConvertVarToLetConst\ndeclare var __HOT__: boolean\n\nexport function enableDevtools () {\n  if (process.env.NODE_ENV !== 'development') return\n  if (__HOT__) require('preact/debug/index')\n}\n\n\n\n// WEBPACK FOOTER //\n// ./src/client/utils/devtools.js","var differenceInMilliseconds = require('../difference_in_milliseconds/index.js')\n\n/**\n * @category Second Helpers\n * @summary Get the number of seconds between the given dates.\n *\n * @description\n * Get the number of seconds between the given dates.\n *\n * @param {Date|String|Number} dateLeft - the later date\n * @param {Date|String|Number} dateRight - the earlier date\n * @returns {Number} the number of seconds\n *\n * @example\n * // How many seconds are between\n * // 2 July 2014 12:30:07.999 and 2 July 2014 12:30:20.000?\n * var result = differenceInSeconds(\n *   new Date(2014, 6, 2, 12, 30, 20, 0),\n *   new Date(2014, 6, 2, 12, 30, 7, 999)\n * )\n * //=> 12\n */\nfunction differenceInSeconds (dirtyDateLeft, dirtyDateRight) {\n  var diff = differenceInMilliseconds(dirtyDateLeft, dirtyDateRight) / 1000\n  return diff > 0 ? Math.floor(diff) : Math.ceil(diff)\n}\n\nmodule.exports = differenceInSeconds\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/date-fns/difference_in_seconds/index.js","var commonFormatterKeys = [\n  'M', 'MM', 'Q', 'D', 'DD', 'DDD', 'DDDD', 'd',\n  'E', 'W', 'WW', 'YY', 'YYYY', 'GG', 'GGGG',\n  'H', 'HH', 'h', 'hh', 'm', 'mm',\n  's', 'ss', 'S', 'SS', 'SSS',\n  'Z', 'ZZ', 'X', 'x'\n]\n\nfunction buildFormattingTokensRegExp (formatters) {\n  var formatterKeys = []\n  for (var key in formatters) {\n    if (formatters.hasOwnProperty(key)) {\n      formatterKeys.push(key)\n    }\n  }\n\n  var formattingTokens = commonFormatterKeys\n    .concat(formatterKeys)\n    .sort()\n    .reverse()\n  var formattingTokensRegExp = new RegExp(\n    '(\\\\[[^\\\\[]*\\\\])|(\\\\\\\\)?' + '(' + formattingTokens.join('|') + '|.)', 'g'\n  )\n\n  return formattingTokensRegExp\n}\n\nmodule.exports = buildFormattingTokensRegExp\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/date-fns/locale/_lib/build_formatting_tokens_reg_exp/index.js","import firebase from 'firebase/app'\nimport 'firebase/database'\nimport 'firebase/auth'\n\nlet firebaseInstance\nexport function getFirebaseInstance (authConfig) {\n  if (firebaseInstance) {\n    return firebaseInstance\n  }\n\n  firebaseInstance = firebase.initializeApp({\n    ...authConfig.firebase,\n    projectId: authConfig.projectId\n  })\n\n  return firebaseInstance\n}\n\n\n\n// WEBPACK FOOTER //\n// ./src/shared/db/firebase.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar constants_1 = require(\"./constants\");\n/**\n * Throws an error if the provided assertion is falsy\n * @param {*} assertion The assertion to be tested for falsiness\n * @param {!string} message The message to display if the check fails\n */\nexports.assert = function (assertion, message) {\n    if (!assertion) {\n        throw exports.assertionError(message);\n    }\n};\n/**\n * Returns an Error object suitable for throwing.\n * @param {string} message\n * @return {!Error}\n */\nexports.assertionError = function (message) {\n    return new Error('Firebase Database (' +\n        constants_1.CONSTANTS.SDK_VERSION +\n        ') INTERNAL ASSERT FAILED: ' +\n        message);\n};\n\n//# sourceMappingURL=assert.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/util/dist/cjs/src/assert.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar stringToByteArray = function (str) {\n    var output = [], p = 0;\n    for (var i = 0; i < str.length; i++) {\n        var c = str.charCodeAt(i);\n        while (c > 255) {\n            output[p++] = c & 255;\n            c >>= 8;\n        }\n        output[p++] = c;\n    }\n    return output;\n};\n/**\n * Turns an array of numbers into the string given by the concatenation of the\n * characters to which the numbers correspond.\n * @param {Array<number>} bytes Array of numbers representing characters.\n * @return {string} Stringification of the array.\n */\nvar byteArrayToString = function (bytes) {\n    var CHUNK_SIZE = 8192;\n    // Special-case the simple case for speed's sake.\n    if (bytes.length < CHUNK_SIZE) {\n        return String.fromCharCode.apply(null, bytes);\n    }\n    // The remaining logic splits conversion by chunks since\n    // Function#apply() has a maximum parameter count.\n    // See discussion: http://goo.gl/LrWmZ9\n    var str = '';\n    for (var i = 0; i < bytes.length; i += CHUNK_SIZE) {\n        var chunk = bytes.slice(i, i + CHUNK_SIZE);\n        str += String.fromCharCode.apply(null, chunk);\n    }\n    return str;\n};\n// Static lookup maps, lazily populated by init_()\nexports.base64 = {\n    /**\n     * Maps bytes to characters.\n     * @type {Object}\n     * @private\n     */\n    byteToCharMap_: null,\n    /**\n     * Maps characters to bytes.\n     * @type {Object}\n     * @private\n     */\n    charToByteMap_: null,\n    /**\n     * Maps bytes to websafe characters.\n     * @type {Object}\n     * @private\n     */\n    byteToCharMapWebSafe_: null,\n    /**\n     * Maps websafe characters to bytes.\n     * @type {Object}\n     * @private\n     */\n    charToByteMapWebSafe_: null,\n    /**\n     * Our default alphabet, shared between\n     * ENCODED_VALS and ENCODED_VALS_WEBSAFE\n     * @type {string}\n     */\n    ENCODED_VALS_BASE: 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' + 'abcdefghijklmnopqrstuvwxyz' + '0123456789',\n    /**\n     * Our default alphabet. Value 64 (=) is special; it means \"nothing.\"\n     * @type {string}\n     */\n    get ENCODED_VALS() {\n        return this.ENCODED_VALS_BASE + '+/=';\n    },\n    /**\n     * Our websafe alphabet.\n     * @type {string}\n     */\n    get ENCODED_VALS_WEBSAFE() {\n        return this.ENCODED_VALS_BASE + '-_.';\n    },\n    /**\n     * Whether this browser supports the atob and btoa functions. This extension\n     * started at Mozilla but is now implemented by many browsers. We use the\n     * ASSUME_* variables to avoid pulling in the full useragent detection library\n     * but still allowing the standard per-browser compilations.\n     *\n     * @type {boolean}\n     */\n    HAS_NATIVE_SUPPORT: typeof atob === 'function',\n    /**\n     * Base64-encode an array of bytes.\n     *\n     * @param {Array<number>|Uint8Array} input An array of bytes (numbers with\n     *     value in [0, 255]) to encode.\n     * @param {boolean=} opt_webSafe Boolean indicating we should use the\n     *     alternative alphabet.\n     * @return {string} The base64 encoded string.\n     */\n    encodeByteArray: function (input, opt_webSafe) {\n        if (!Array.isArray(input)) {\n            throw Error('encodeByteArray takes an array as a parameter');\n        }\n        this.init_();\n        var byteToCharMap = opt_webSafe\n            ? this.byteToCharMapWebSafe_\n            : this.byteToCharMap_;\n        var output = [];\n        for (var i = 0; i < input.length; i += 3) {\n            var byte1 = input[i];\n            var haveByte2 = i + 1 < input.length;\n            var byte2 = haveByte2 ? input[i + 1] : 0;\n            var haveByte3 = i + 2 < input.length;\n            var byte3 = haveByte3 ? input[i + 2] : 0;\n            var outByte1 = byte1 >> 2;\n            var outByte2 = ((byte1 & 0x03) << 4) | (byte2 >> 4);\n            var outByte3 = ((byte2 & 0x0f) << 2) | (byte3 >> 6);\n            var outByte4 = byte3 & 0x3f;\n            if (!haveByte3) {\n                outByte4 = 64;\n                if (!haveByte2) {\n                    outByte3 = 64;\n                }\n            }\n            output.push(byteToCharMap[outByte1], byteToCharMap[outByte2], byteToCharMap[outByte3], byteToCharMap[outByte4]);\n        }\n        return output.join('');\n    },\n    /**\n     * Base64-encode a string.\n     *\n     * @param {string} input A string to encode.\n     * @param {boolean=} opt_webSafe If true, we should use the\n     *     alternative alphabet.\n     * @return {string} The base64 encoded string.\n     */\n    encodeString: function (input, opt_webSafe) {\n        // Shortcut for Mozilla browsers that implement\n        // a native base64 encoder in the form of \"btoa/atob\"\n        if (this.HAS_NATIVE_SUPPORT && !opt_webSafe) {\n            return btoa(input);\n        }\n        return this.encodeByteArray(stringToByteArray(input), opt_webSafe);\n    },\n    /**\n     * Base64-decode a string.\n     *\n     * @param {string} input to decode.\n     * @param {boolean=} opt_webSafe True if we should use the\n     *     alternative alphabet.\n     * @return {string} string representing the decoded value.\n     */\n    decodeString: function (input, opt_webSafe) {\n        // Shortcut for Mozilla browsers that implement\n        // a native base64 encoder in the form of \"btoa/atob\"\n        if (this.HAS_NATIVE_SUPPORT && !opt_webSafe) {\n            return atob(input);\n        }\n        return byteArrayToString(this.decodeStringToByteArray(input, opt_webSafe));\n    },\n    /**\n     * Base64-decode a string.\n     *\n     * In base-64 decoding, groups of four characters are converted into three\n     * bytes.  If the encoder did not apply padding, the input length may not\n     * be a multiple of 4.\n     *\n     * In this case, the last group will have fewer than 4 characters, and\n     * padding will be inferred.  If the group has one or two characters, it decodes\n     * to one byte.  If the group has three characters, it decodes to two bytes.\n     *\n     * @param {string} input Input to decode.\n     * @param {boolean=} opt_webSafe True if we should use the web-safe alphabet.\n     * @return {!Array<number>} bytes representing the decoded value.\n     */\n    decodeStringToByteArray: function (input, opt_webSafe) {\n        this.init_();\n        var charToByteMap = opt_webSafe\n            ? this.charToByteMapWebSafe_\n            : this.charToByteMap_;\n        var output = [];\n        for (var i = 0; i < input.length;) {\n            var byte1 = charToByteMap[input.charAt(i++)];\n            var haveByte2 = i < input.length;\n            var byte2 = haveByte2 ? charToByteMap[input.charAt(i)] : 0;\n            ++i;\n            var haveByte3 = i < input.length;\n            var byte3 = haveByte3 ? charToByteMap[input.charAt(i)] : 64;\n            ++i;\n            var haveByte4 = i < input.length;\n            var byte4 = haveByte4 ? charToByteMap[input.charAt(i)] : 64;\n            ++i;\n            if (byte1 == null || byte2 == null || byte3 == null || byte4 == null) {\n                throw Error();\n            }\n            var outByte1 = (byte1 << 2) | (byte2 >> 4);\n            output.push(outByte1);\n            if (byte3 != 64) {\n                var outByte2 = ((byte2 << 4) & 0xf0) | (byte3 >> 2);\n                output.push(outByte2);\n                if (byte4 != 64) {\n                    var outByte3 = ((byte3 << 6) & 0xc0) | byte4;\n                    output.push(outByte3);\n                }\n            }\n        }\n        return output;\n    },\n    /**\n     * Lazy static initialization function. Called before\n     * accessing any of the static map variables.\n     * @private\n     */\n    init_: function () {\n        if (!this.byteToCharMap_) {\n            this.byteToCharMap_ = {};\n            this.charToByteMap_ = {};\n            this.byteToCharMapWebSafe_ = {};\n            this.charToByteMapWebSafe_ = {};\n            // We want quick mappings back and forth, so we precompute two maps.\n            for (var i = 0; i < this.ENCODED_VALS.length; i++) {\n                this.byteToCharMap_[i] = this.ENCODED_VALS.charAt(i);\n                this.charToByteMap_[this.byteToCharMap_[i]] = i;\n                this.byteToCharMapWebSafe_[i] = this.ENCODED_VALS_WEBSAFE.charAt(i);\n                this.charToByteMapWebSafe_[this.byteToCharMapWebSafe_[i]] = i;\n                // Be forgiving when decoding and correctly decode both encodings.\n                if (i >= this.ENCODED_VALS_BASE.length) {\n                    this.charToByteMap_[this.ENCODED_VALS_WEBSAFE.charAt(i)] = i;\n                    this.charToByteMapWebSafe_[this.ENCODED_VALS.charAt(i)] = i;\n                }\n            }\n        }\n    }\n};\n/**\n * URL-safe base64 encoding\n * @param {!string} str\n * @return {!string}\n */\nexports.base64Encode = function (str) {\n    var utf8Bytes = stringToByteArray(str);\n    return exports.base64.encodeByteArray(utf8Bytes, true);\n};\n/**\n * URL-safe base64 decoding\n *\n * NOTE: DO NOT use the global atob() function - it does NOT support the\n * base64Url variant encoding.\n *\n * @param {string} str To be decoded\n * @return {?string} Decoded result, if possible\n */\nexports.base64Decode = function (str) {\n    try {\n        return exports.base64.decodeString(str, true);\n    }\n    catch (e) {\n        console.error('base64Decode failed: ', e);\n    }\n    return null;\n};\n\n//# sourceMappingURL=crypt.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/util/dist/cjs/src/crypt.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\n/**\n * Evaluates a JSON string into a javascript object.\n *\n * @param {string} str A string containing JSON.\n * @return {*} The javascript object representing the specified JSON.\n */\nfunction jsonEval(str) {\n    return JSON.parse(str);\n}\nexports.jsonEval = jsonEval;\n/**\n * Returns JSON representing a javascript object.\n * @param {*} data Javascript object to be stringified.\n * @return {string} The JSON contents of the object.\n */\nfunction stringify(data) {\n    return JSON.stringify(data);\n}\nexports.stringify = stringify;\n\n//# sourceMappingURL=json.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/util/dist/cjs/src/json.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\n// See http://www.devthought.com/2012/01/18/an-object-is-not-a-hash/\nexports.contains = function (obj, key) {\n    return Object.prototype.hasOwnProperty.call(obj, key);\n};\nexports.safeGet = function (obj, key) {\n    if (Object.prototype.hasOwnProperty.call(obj, key))\n        return obj[key];\n    // else return undefined.\n};\n/**\n * Enumerates the keys/values in an object, excluding keys defined on the prototype.\n *\n * @param {?Object.<K,V>} obj Object to enumerate.\n * @param {!function(K, V)} fn Function to call for each key and value.\n * @template K,V\n */\nexports.forEach = function (obj, fn) {\n    for (var key in obj) {\n        if (Object.prototype.hasOwnProperty.call(obj, key)) {\n            fn(key, obj[key]);\n        }\n    }\n};\n/**\n * Copies all the (own) properties from one object to another.\n * @param {!Object} objTo\n * @param {!Object} objFrom\n * @return {!Object} objTo\n */\nexports.extend = function (objTo, objFrom) {\n    exports.forEach(objFrom, function (key, value) {\n        objTo[key] = value;\n    });\n    return objTo;\n};\n/**\n * Returns a clone of the specified object.\n * @param {!Object} obj\n * @return {!Object} cloned obj.\n */\nexports.clone = function (obj) {\n    return exports.extend({}, obj);\n};\n/**\n * Returns true if obj has typeof \"object\" and is not null.  Unlike goog.isObject(), does not return true\n * for functions.\n *\n * @param obj {*} A potential object.\n * @returns {boolean} True if it's an object.\n */\nexports.isNonNullObject = function (obj) {\n    return typeof obj === 'object' && obj !== null;\n};\nexports.isEmpty = function (obj) {\n    for (var key in obj) {\n        return false;\n    }\n    return true;\n};\nexports.getCount = function (obj) {\n    var rv = 0;\n    for (var key in obj) {\n        rv++;\n    }\n    return rv;\n};\nexports.map = function (obj, f, opt_obj) {\n    var res = {};\n    for (var key in obj) {\n        res[key] = f.call(opt_obj, obj[key], key, obj);\n    }\n    return res;\n};\nexports.findKey = function (obj, fn, opt_this) {\n    for (var key in obj) {\n        if (fn.call(opt_this, obj[key], key, obj)) {\n            return key;\n        }\n    }\n    return undefined;\n};\nexports.findValue = function (obj, fn, opt_this) {\n    var key = exports.findKey(obj, fn, opt_this);\n    return key && obj[key];\n};\nexports.getAnyKey = function (obj) {\n    for (var key in obj) {\n        return key;\n    }\n};\nexports.getValues = function (obj) {\n    var res = [];\n    var i = 0;\n    for (var key in obj) {\n        res[i++] = obj[key];\n    }\n    return res;\n};\n/**\n * Tests whether every key/value pair in an object pass the test implemented\n * by the provided function\n *\n * @param {?Object.<K,V>} obj Object to test.\n * @param {!function(K, V)} fn Function to call for each key and value.\n * @template K,V\n */\nexports.every = function (obj, fn) {\n    for (var key in obj) {\n        if (Object.prototype.hasOwnProperty.call(obj, key)) {\n            if (!fn(key, obj[key])) {\n                return false;\n            }\n        }\n    }\n    return true;\n};\n\n//# sourceMappingURL=obj.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/util/dist/cjs/src/obj.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = require(\"../core/util/util\");\nvar parser_1 = require(\"../core/util/libs/parser\");\nvar Path_1 = require(\"../core/util/Path\");\nvar Reference_1 = require(\"./Reference\");\nvar Repo_1 = require(\"../core/Repo\");\nvar RepoManager_1 = require(\"../core/RepoManager\");\nvar util_2 = require(\"@firebase/util\");\nvar validation_1 = require(\"../core/util/validation\");\n/**\n * Class representing a firebase database.\n * @implements {FirebaseService}\n */\nvar Database = /** @class */ (function () {\n    /**\n     * The constructor should not be called by users of our public API.\n     * @param {!Repo} repo_\n     */\n    function Database(repo_) {\n        this.repo_ = repo_;\n        if (!(repo_ instanceof Repo_1.Repo)) {\n            util_1.fatal(\"Don't call new Database() directly - please use firebase.database().\");\n        }\n        /** @type {Reference} */\n        this.root_ = new Reference_1.Reference(repo_, Path_1.Path.Empty);\n        this.INTERNAL = new DatabaseInternals(this);\n    }\n    Object.defineProperty(Database.prototype, \"app\", {\n        get: function () {\n            return this.repo_.app;\n        },\n        enumerable: true,\n        configurable: true\n    });\n    /**\n     * Returns a reference to the root or the path specified in opt_pathString.\n     * @param {string=} pathString\n     * @return {!Reference} Firebase reference.\n     */\n    Database.prototype.ref = function (pathString) {\n        this.checkDeleted_('ref');\n        util_2.validateArgCount('database.ref', 0, 1, arguments.length);\n        return pathString !== undefined ? this.root_.child(pathString) : this.root_;\n    };\n    /**\n     * Returns a reference to the root or the path specified in url.\n     * We throw a exception if the url is not in the same domain as the\n     * current repo.\n     * @param {string} url\n     * @return {!Reference} Firebase reference.\n     */\n    Database.prototype.refFromURL = function (url) {\n        /** @const {string} */\n        var apiName = 'database.refFromURL';\n        this.checkDeleted_(apiName);\n        util_2.validateArgCount(apiName, 1, 1, arguments.length);\n        var parsedURL = parser_1.parseRepoInfo(url);\n        validation_1.validateUrl(apiName, 1, parsedURL);\n        var repoInfo = parsedURL.repoInfo;\n        if (repoInfo.host !== this.repo_.repoInfo_.host) {\n            util_1.fatal(apiName +\n                ': Host name does not match the current database: ' +\n                '(found ' +\n                repoInfo.host +\n                ' but expected ' +\n                this.repo_.repoInfo_.host +\n                ')');\n        }\n        return this.ref(parsedURL.path.toString());\n    };\n    /**\n     * @param {string} apiName\n     */\n    Database.prototype.checkDeleted_ = function (apiName) {\n        if (this.repo_ === null) {\n            util_1.fatal('Cannot call ' + apiName + ' on a deleted database.');\n        }\n    };\n    // Make individual repo go offline.\n    Database.prototype.goOffline = function () {\n        util_2.validateArgCount('database.goOffline', 0, 0, arguments.length);\n        this.checkDeleted_('goOffline');\n        this.repo_.interrupt();\n    };\n    Database.prototype.goOnline = function () {\n        util_2.validateArgCount('database.goOnline', 0, 0, arguments.length);\n        this.checkDeleted_('goOnline');\n        this.repo_.resume();\n    };\n    Database.ServerValue = {\n        TIMESTAMP: {\n            '.sv': 'timestamp'\n        }\n    };\n    return Database;\n}());\nexports.Database = Database;\nvar DatabaseInternals = /** @class */ (function () {\n    /** @param {!Database} database */\n    function DatabaseInternals(database) {\n        this.database = database;\n    }\n    /** @return {Promise<void>} */\n    DatabaseInternals.prototype.delete = function () {\n        this.database.checkDeleted_('delete');\n        RepoManager_1.RepoManager.getInstance().deleteRepo(this.database.repo_);\n        this.database.repo_ = null;\n        this.database.root_ = null;\n        this.database.INTERNAL = null;\n        this.database = null;\n        return Promise.resolve();\n    };\n    return DatabaseInternals;\n}());\nexports.DatabaseInternals = DatabaseInternals;\n\n//# sourceMappingURL=Database.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/api/Database.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar Path_1 = require(\"../Path\");\nvar RepoInfo_1 = require(\"../../RepoInfo\");\nvar util_1 = require(\"../util\");\n/**\n * @param {!string} pathString\n * @return {string}\n */\nfunction decodePath(pathString) {\n    var pathStringDecoded = '';\n    var pieces = pathString.split('/');\n    for (var i = 0; i < pieces.length; i++) {\n        if (pieces[i].length > 0) {\n            var piece = pieces[i];\n            try {\n                piece = decodeURIComponent(piece.replace(/\\+/g, ' '));\n            }\n            catch (e) { }\n            pathStringDecoded += '/' + piece;\n        }\n    }\n    return pathStringDecoded;\n}\n/**\n *\n * @param {!string} dataURL\n * @return {{repoInfo: !RepoInfo, path: !Path}}\n */\nexports.parseRepoInfo = function (dataURL) {\n    var parsedUrl = exports.parseURL(dataURL), namespace = parsedUrl.subdomain;\n    if (parsedUrl.domain === 'firebase') {\n        util_1.fatal(parsedUrl.host +\n            ' is no longer supported. ' +\n            'Please use <YOUR FIREBASE>.firebaseio.com instead');\n    }\n    // Catch common error of uninitialized namespace value.\n    if (!namespace || namespace == 'undefined') {\n        util_1.fatal('Cannot parse Firebase url. Please use https://<YOUR FIREBASE>.firebaseio.com');\n    }\n    if (!parsedUrl.secure) {\n        util_1.warnIfPageIsSecure();\n    }\n    var webSocketOnly = parsedUrl.scheme === 'ws' || parsedUrl.scheme === 'wss';\n    return {\n        repoInfo: new RepoInfo_1.RepoInfo(parsedUrl.host, parsedUrl.secure, namespace, webSocketOnly),\n        path: new Path_1.Path(parsedUrl.pathString)\n    };\n};\n/**\n *\n * @param {!string} dataURL\n * @return {{host: string, port: number, domain: string, subdomain: string, secure: boolean, scheme: string, pathString: string}}\n */\nexports.parseURL = function (dataURL) {\n    // Default to empty strings in the event of a malformed string.\n    var host = '', domain = '', subdomain = '', pathString = '';\n    // Always default to SSL, unless otherwise specified.\n    var secure = true, scheme = 'https', port = 443;\n    // Don't do any validation here. The caller is responsible for validating the result of parsing.\n    if (typeof dataURL === 'string') {\n        // Parse scheme.\n        var colonInd = dataURL.indexOf('//');\n        if (colonInd >= 0) {\n            scheme = dataURL.substring(0, colonInd - 1);\n            dataURL = dataURL.substring(colonInd + 2);\n        }\n        // Parse host and path.\n        var slashInd = dataURL.indexOf('/');\n        if (slashInd === -1) {\n            slashInd = dataURL.length;\n        }\n        host = dataURL.substring(0, slashInd);\n        pathString = decodePath(dataURL.substring(slashInd));\n        var parts = host.split('.');\n        if (parts.length === 3) {\n            // Normalize namespaces to lowercase to share storage / connection.\n            domain = parts[1];\n            subdomain = parts[0].toLowerCase();\n        }\n        else if (parts.length === 2) {\n            domain = parts[0];\n        }\n        // If we have a port, use scheme for determining if it's secure.\n        colonInd = host.indexOf(':');\n        if (colonInd >= 0) {\n            secure = scheme === 'https' || scheme === 'wss';\n            port = parseInt(host.substring(colonInd + 1), 10);\n        }\n    }\n    return {\n        host: host,\n        port: port,\n        domain: domain,\n        subdomain: subdomain,\n        secure: secure,\n        scheme: scheme,\n        pathString: pathString\n    };\n};\n\n//# sourceMappingURL=parser.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/util/libs/parser.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = require(\"@firebase/util\");\nvar util_2 = require(\"@firebase/util\");\nvar storage_1 = require(\"./storage/storage\");\nvar Constants_1 = require(\"../realtime/Constants\");\n/**\n * A class that holds metadata about a Repo object\n *\n * @constructor\n */\nvar RepoInfo = /** @class */ (function () {\n    /**\n     * @param {string} host Hostname portion of the url for the repo\n     * @param {boolean} secure Whether or not this repo is accessed over ssl\n     * @param {string} namespace The namespace represented by the repo\n     * @param {boolean} webSocketOnly Whether to prefer websockets over all other transports (used by Nest).\n     * @param {string=} persistenceKey Override the default session persistence storage key\n     */\n    function RepoInfo(host, secure, namespace, webSocketOnly, persistenceKey) {\n        if (persistenceKey === void 0) { persistenceKey = ''; }\n        this.secure = secure;\n        this.namespace = namespace;\n        this.webSocketOnly = webSocketOnly;\n        this.persistenceKey = persistenceKey;\n        this.host = host.toLowerCase();\n        this.domain = this.host.substr(this.host.indexOf('.') + 1);\n        this.internalHost = storage_1.PersistentStorage.get('host:' + host) || this.host;\n    }\n    RepoInfo.prototype.needsQueryParam = function () {\n        return this.host !== this.internalHost;\n    };\n    RepoInfo.prototype.isCacheableHost = function () {\n        return this.internalHost.substr(0, 2) === 's-';\n    };\n    RepoInfo.prototype.isDemoHost = function () {\n        return this.domain === 'firebaseio-demo.com';\n    };\n    RepoInfo.prototype.isCustomHost = function () {\n        return (this.domain !== 'firebaseio.com' && this.domain !== 'firebaseio-demo.com');\n    };\n    RepoInfo.prototype.updateHost = function (newHost) {\n        if (newHost !== this.internalHost) {\n            this.internalHost = newHost;\n            if (this.isCacheableHost()) {\n                storage_1.PersistentStorage.set('host:' + this.host, this.internalHost);\n            }\n        }\n    };\n    /**\n     * Returns the websocket URL for this repo\n     * @param {string} type of connection\n     * @param {Object} params list\n     * @return {string} The URL for this repo\n     */\n    RepoInfo.prototype.connectionURL = function (type, params) {\n        util_1.assert(typeof type === 'string', 'typeof type must == string');\n        util_1.assert(typeof params === 'object', 'typeof params must == object');\n        var connURL;\n        if (type === Constants_1.WEBSOCKET) {\n            connURL =\n                (this.secure ? 'wss://' : 'ws://') + this.internalHost + '/.ws?';\n        }\n        else if (type === Constants_1.LONG_POLLING) {\n            connURL =\n                (this.secure ? 'https://' : 'http://') + this.internalHost + '/.lp?';\n        }\n        else {\n            throw new Error('Unknown connection type: ' + type);\n        }\n        if (this.needsQueryParam()) {\n            params['ns'] = this.namespace;\n        }\n        var pairs = [];\n        util_2.forEach(params, function (key, value) {\n            pairs.push(key + '=' + value);\n        });\n        return connURL + pairs.join('&');\n    };\n    /** @return {string} */\n    RepoInfo.prototype.toString = function () {\n        var str = this.toURLString();\n        if (this.persistenceKey) {\n            str += '<' + this.persistenceKey + '>';\n        }\n        return str;\n    };\n    /** @return {string} */\n    RepoInfo.prototype.toURLString = function () {\n        return (this.secure ? 'https://' : 'http://') + this.host;\n    };\n    return RepoInfo;\n}());\nexports.RepoInfo = RepoInfo;\n\n//# sourceMappingURL=RepoInfo.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/RepoInfo.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = require(\"@firebase/util\");\nvar validation_1 = require(\"../core/util/validation\");\nvar util_2 = require(\"../core/util/util\");\nvar util_3 = require(\"@firebase/util\");\n/**\n * @constructor\n */\nvar OnDisconnect = /** @class */ (function () {\n    /**\n     * @param {!Repo} repo_\n     * @param {!Path} path_\n     */\n    function OnDisconnect(repo_, path_) {\n        this.repo_ = repo_;\n        this.path_ = path_;\n    }\n    /**\n     * @param {function(?Error)=} onComplete\n     * @return {!firebase.Promise}\n     */\n    OnDisconnect.prototype.cancel = function (onComplete) {\n        util_1.validateArgCount('OnDisconnect.cancel', 0, 1, arguments.length);\n        util_1.validateCallback('OnDisconnect.cancel', 1, onComplete, true);\n        var deferred = new util_3.Deferred();\n        this.repo_.onDisconnectCancel(this.path_, deferred.wrapCallback(onComplete));\n        return deferred.promise;\n    };\n    /**\n     * @param {function(?Error)=} onComplete\n     * @return {!firebase.Promise}\n     */\n    OnDisconnect.prototype.remove = function (onComplete) {\n        util_1.validateArgCount('OnDisconnect.remove', 0, 1, arguments.length);\n        validation_1.validateWritablePath('OnDisconnect.remove', this.path_);\n        util_1.validateCallback('OnDisconnect.remove', 1, onComplete, true);\n        var deferred = new util_3.Deferred();\n        this.repo_.onDisconnectSet(this.path_, null, deferred.wrapCallback(onComplete));\n        return deferred.promise;\n    };\n    /**\n     * @param {*} value\n     * @param {function(?Error)=} onComplete\n     * @return {!firebase.Promise}\n     */\n    OnDisconnect.prototype.set = function (value, onComplete) {\n        util_1.validateArgCount('OnDisconnect.set', 1, 2, arguments.length);\n        validation_1.validateWritablePath('OnDisconnect.set', this.path_);\n        validation_1.validateFirebaseDataArg('OnDisconnect.set', 1, value, this.path_, false);\n        util_1.validateCallback('OnDisconnect.set', 2, onComplete, true);\n        var deferred = new util_3.Deferred();\n        this.repo_.onDisconnectSet(this.path_, value, deferred.wrapCallback(onComplete));\n        return deferred.promise;\n    };\n    /**\n     * @param {*} value\n     * @param {number|string|null} priority\n     * @param {function(?Error)=} onComplete\n     * @return {!firebase.Promise}\n     */\n    OnDisconnect.prototype.setWithPriority = function (value, priority, onComplete) {\n        util_1.validateArgCount('OnDisconnect.setWithPriority', 2, 3, arguments.length);\n        validation_1.validateWritablePath('OnDisconnect.setWithPriority', this.path_);\n        validation_1.validateFirebaseDataArg('OnDisconnect.setWithPriority', 1, value, this.path_, false);\n        validation_1.validatePriority('OnDisconnect.setWithPriority', 2, priority, false);\n        util_1.validateCallback('OnDisconnect.setWithPriority', 3, onComplete, true);\n        var deferred = new util_3.Deferred();\n        this.repo_.onDisconnectSetWithPriority(this.path_, value, priority, deferred.wrapCallback(onComplete));\n        return deferred.promise;\n    };\n    /**\n     * @param {!Object} objectToMerge\n     * @param {function(?Error)=} onComplete\n     * @return {!firebase.Promise}\n     */\n    OnDisconnect.prototype.update = function (objectToMerge, onComplete) {\n        util_1.validateArgCount('OnDisconnect.update', 1, 2, arguments.length);\n        validation_1.validateWritablePath('OnDisconnect.update', this.path_);\n        if (Array.isArray(objectToMerge)) {\n            var newObjectToMerge = {};\n            for (var i = 0; i < objectToMerge.length; ++i) {\n                newObjectToMerge['' + i] = objectToMerge[i];\n            }\n            objectToMerge = newObjectToMerge;\n            util_2.warn('Passing an Array to firebase.database.onDisconnect().update() is deprecated. Use set() if you want to overwrite the ' +\n                'existing data, or an Object with integer keys if you really do want to only update some of the children.');\n        }\n        validation_1.validateFirebaseMergeDataArg('OnDisconnect.update', 1, objectToMerge, this.path_, false);\n        util_1.validateCallback('OnDisconnect.update', 2, onComplete, true);\n        var deferred = new util_3.Deferred();\n        this.repo_.onDisconnectUpdate(this.path_, objectToMerge, deferred.wrapCallback(onComplete));\n        return deferred.promise;\n    };\n    return OnDisconnect;\n}());\nexports.OnDisconnect = OnDisconnect;\n\n//# sourceMappingURL=onDisconnect.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/api/onDisconnect.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = require(\"@firebase/util\");\nvar KeyIndex_1 = require(\"../core/snap/indexes/KeyIndex\");\nvar PriorityIndex_1 = require(\"../core/snap/indexes/PriorityIndex\");\nvar ValueIndex_1 = require(\"../core/snap/indexes/ValueIndex\");\nvar PathIndex_1 = require(\"../core/snap/indexes/PathIndex\");\nvar util_2 = require(\"../core/util/util\");\nvar Path_1 = require(\"../core/util/Path\");\nvar validation_1 = require(\"../core/util/validation\");\nvar util_3 = require(\"@firebase/util\");\nvar EventRegistration_1 = require(\"../core/view/EventRegistration\");\nvar util_4 = require(\"@firebase/util\");\nvar __referenceConstructor;\n/**\n * A Query represents a filter to be applied to a firebase location.  This object purely represents the\n * query expression (and exposes our public API to build the query).  The actual query logic is in ViewBase.js.\n *\n * Since every Firebase reference is a query, Firebase inherits from this object.\n */\nvar Query = /** @class */ (function () {\n    function Query(repo, path, queryParams_, orderByCalled_) {\n        this.repo = repo;\n        this.path = path;\n        this.queryParams_ = queryParams_;\n        this.orderByCalled_ = orderByCalled_;\n    }\n    Object.defineProperty(Query, \"__referenceConstructor\", {\n        get: function () {\n            util_1.assert(__referenceConstructor, 'Reference.ts has not been loaded');\n            return __referenceConstructor;\n        },\n        set: function (val) {\n            __referenceConstructor = val;\n        },\n        enumerable: true,\n        configurable: true\n    });\n    /**\n     * Validates start/end values for queries.\n     * @param {!QueryParams} params\n     * @private\n     */\n    Query.validateQueryEndpoints_ = function (params) {\n        var startNode = null;\n        var endNode = null;\n        if (params.hasStart()) {\n            startNode = params.getIndexStartValue();\n        }\n        if (params.hasEnd()) {\n            endNode = params.getIndexEndValue();\n        }\n        if (params.getIndex() === KeyIndex_1.KEY_INDEX) {\n            var tooManyArgsError = 'Query: When ordering by key, you may only pass one argument to ' +\n                'startAt(), endAt(), or equalTo().';\n            var wrongArgTypeError = 'Query: When ordering by key, the argument passed to startAt(), endAt(),' +\n                'or equalTo() must be a string.';\n            if (params.hasStart()) {\n                var startName = params.getIndexStartName();\n                if (startName != util_2.MIN_NAME) {\n                    throw new Error(tooManyArgsError);\n                }\n                else if (typeof startNode !== 'string') {\n                    throw new Error(wrongArgTypeError);\n                }\n            }\n            if (params.hasEnd()) {\n                var endName = params.getIndexEndName();\n                if (endName != util_2.MAX_NAME) {\n                    throw new Error(tooManyArgsError);\n                }\n                else if (typeof endNode !== 'string') {\n                    throw new Error(wrongArgTypeError);\n                }\n            }\n        }\n        else if (params.getIndex() === PriorityIndex_1.PRIORITY_INDEX) {\n            if ((startNode != null && !validation_1.isValidPriority(startNode)) ||\n                (endNode != null && !validation_1.isValidPriority(endNode))) {\n                throw new Error('Query: When ordering by priority, the first argument passed to startAt(), ' +\n                    'endAt(), or equalTo() must be a valid priority value (null, a number, or a string).');\n            }\n        }\n        else {\n            util_1.assert(params.getIndex() instanceof PathIndex_1.PathIndex ||\n                params.getIndex() === ValueIndex_1.VALUE_INDEX, 'unknown index type.');\n            if ((startNode != null && typeof startNode === 'object') ||\n                (endNode != null && typeof endNode === 'object')) {\n                throw new Error('Query: First argument passed to startAt(), endAt(), or equalTo() cannot be ' +\n                    'an object.');\n            }\n        }\n    };\n    /**\n     * Validates that limit* has been called with the correct combination of parameters\n     * @param {!QueryParams} params\n     * @private\n     */\n    Query.validateLimit_ = function (params) {\n        if (params.hasStart() &&\n            params.hasEnd() &&\n            params.hasLimit() &&\n            !params.hasAnchoredLimit()) {\n            throw new Error(\"Query: Can't combine startAt(), endAt(), and limit(). Use limitToFirst() or limitToLast() instead.\");\n        }\n    };\n    /**\n     * Validates that no other order by call has been made\n     * @param {!string} fnName\n     * @private\n     */\n    Query.prototype.validateNoPreviousOrderByCall_ = function (fnName) {\n        if (this.orderByCalled_ === true) {\n            throw new Error(fnName + \": You can't combine multiple orderBy calls.\");\n        }\n    };\n    /**\n     * @return {!QueryParams}\n     */\n    Query.prototype.getQueryParams = function () {\n        return this.queryParams_;\n    };\n    /**\n     * @return {!Reference}\n     */\n    Query.prototype.getRef = function () {\n        util_3.validateArgCount('Query.ref', 0, 0, arguments.length);\n        // This is a slight hack. We cannot goog.require('fb.api.Firebase'), since Firebase requires fb.api.Query.\n        // However, we will always export 'Firebase' to the global namespace, so it's guaranteed to exist by the time this\n        // method gets called.\n        return new Query.__referenceConstructor(this.repo, this.path);\n    };\n    /**\n     * @param {!string} eventType\n     * @param {!function(DataSnapshot, string=)} callback\n     * @param {(function(Error)|Object)=} cancelCallbackOrContext\n     * @param {Object=} context\n     * @return {!function(DataSnapshot, string=)}\n     */\n    Query.prototype.on = function (eventType, callback, cancelCallbackOrContext, context) {\n        util_3.validateArgCount('Query.on', 2, 4, arguments.length);\n        validation_1.validateEventType('Query.on', 1, eventType, false);\n        util_3.validateCallback('Query.on', 2, callback, false);\n        var ret = Query.getCancelAndContextArgs_('Query.on', cancelCallbackOrContext, context);\n        if (eventType === 'value') {\n            this.onValueEvent(callback, ret.cancel, ret.context);\n        }\n        else {\n            var callbacks = {};\n            callbacks[eventType] = callback;\n            this.onChildEvent(callbacks, ret.cancel, ret.context);\n        }\n        return callback;\n    };\n    /**\n     * @param {!function(!DataSnapshot)} callback\n     * @param {?function(Error)} cancelCallback\n     * @param {?Object} context\n     * @protected\n     */\n    Query.prototype.onValueEvent = function (callback, cancelCallback, context) {\n        var container = new EventRegistration_1.ValueEventRegistration(callback, cancelCallback || null, context || null);\n        this.repo.addEventCallbackForQuery(this, container);\n    };\n    /**\n     * @param {!Object.<string, !function(!DataSnapshot, ?string)>} callbacks\n     * @param {?function(Error)} cancelCallback\n     * @param {?Object} context\n     * @protected\n     */\n    Query.prototype.onChildEvent = function (callbacks, cancelCallback, context) {\n        var container = new EventRegistration_1.ChildEventRegistration(callbacks, cancelCallback, context);\n        this.repo.addEventCallbackForQuery(this, container);\n    };\n    /**\n     * @param {string=} eventType\n     * @param {(function(!DataSnapshot, ?string=))=} callback\n     * @param {Object=} context\n     */\n    Query.prototype.off = function (eventType, callback, context) {\n        util_3.validateArgCount('Query.off', 0, 3, arguments.length);\n        validation_1.validateEventType('Query.off', 1, eventType, true);\n        util_3.validateCallback('Query.off', 2, callback, true);\n        util_3.validateContextObject('Query.off', 3, context, true);\n        var container = null;\n        var callbacks = null;\n        if (eventType === 'value') {\n            var valueCallback = callback || null;\n            container = new EventRegistration_1.ValueEventRegistration(valueCallback, null, context || null);\n        }\n        else if (eventType) {\n            if (callback) {\n                callbacks = {};\n                callbacks[eventType] = callback;\n            }\n            container = new EventRegistration_1.ChildEventRegistration(callbacks, null, context || null);\n        }\n        this.repo.removeEventCallbackForQuery(this, container);\n    };\n    /**\n     * Attaches a listener, waits for the first event, and then removes the listener\n     * @param {!string} eventType\n     * @param {!function(!DataSnapshot, string=)} userCallback\n     * @param cancelOrContext\n     * @param context\n     * @return {!firebase.Promise}\n     */\n    Query.prototype.once = function (eventType, userCallback, cancelOrContext, context) {\n        var _this = this;\n        util_3.validateArgCount('Query.once', 1, 4, arguments.length);\n        validation_1.validateEventType('Query.once', 1, eventType, false);\n        util_3.validateCallback('Query.once', 2, userCallback, true);\n        var ret = Query.getCancelAndContextArgs_('Query.once', cancelOrContext, context);\n        // TODO: Implement this more efficiently (in particular, use 'get' wire protocol for 'value' event)\n        // TODO: consider actually wiring the callbacks into the promise. We cannot do this without a breaking change\n        // because the API currently expects callbacks will be called synchronously if the data is cached, but this is\n        // against the Promise specification.\n        var firstCall = true;\n        var deferred = new util_4.Deferred();\n        // A dummy error handler in case a user wasn't expecting promises\n        deferred.promise.catch(function () { });\n        var onceCallback = function (snapshot) {\n            // NOTE: Even though we unsubscribe, we may get called multiple times if a single action (e.g. set() with JSON)\n            // triggers multiple events (e.g. child_added or child_changed).\n            if (firstCall) {\n                firstCall = false;\n                _this.off(eventType, onceCallback);\n                if (userCallback) {\n                    userCallback.bind(ret.context)(snapshot);\n                }\n                deferred.resolve(snapshot);\n            }\n        };\n        this.on(eventType, onceCallback, \n        /*cancel=*/ function (err) {\n            _this.off(eventType, onceCallback);\n            if (ret.cancel)\n                ret.cancel.bind(ret.context)(err);\n            deferred.reject(err);\n        });\n        return deferred.promise;\n    };\n    /**\n     * Set a limit and anchor it to the start of the window.\n     * @param {!number} limit\n     * @return {!Query}\n     */\n    Query.prototype.limitToFirst = function (limit) {\n        util_3.validateArgCount('Query.limitToFirst', 1, 1, arguments.length);\n        if (typeof limit !== 'number' ||\n            Math.floor(limit) !== limit ||\n            limit <= 0) {\n            throw new Error('Query.limitToFirst: First argument must be a positive integer.');\n        }\n        if (this.queryParams_.hasLimit()) {\n            throw new Error('Query.limitToFirst: Limit was already set (by another call to limit, ' +\n                'limitToFirst, or limitToLast).');\n        }\n        return new Query(this.repo, this.path, this.queryParams_.limitToFirst(limit), this.orderByCalled_);\n    };\n    /**\n     * Set a limit and anchor it to the end of the window.\n     * @param {!number} limit\n     * @return {!Query}\n     */\n    Query.prototype.limitToLast = function (limit) {\n        util_3.validateArgCount('Query.limitToLast', 1, 1, arguments.length);\n        if (typeof limit !== 'number' ||\n            Math.floor(limit) !== limit ||\n            limit <= 0) {\n            throw new Error('Query.limitToLast: First argument must be a positive integer.');\n        }\n        if (this.queryParams_.hasLimit()) {\n            throw new Error('Query.limitToLast: Limit was already set (by another call to limit, ' +\n                'limitToFirst, or limitToLast).');\n        }\n        return new Query(this.repo, this.path, this.queryParams_.limitToLast(limit), this.orderByCalled_);\n    };\n    /**\n     * Given a child path, return a new query ordered by the specified grandchild path.\n     * @param {!string} path\n     * @return {!Query}\n     */\n    Query.prototype.orderByChild = function (path) {\n        util_3.validateArgCount('Query.orderByChild', 1, 1, arguments.length);\n        if (path === '$key') {\n            throw new Error('Query.orderByChild: \"$key\" is invalid.  Use Query.orderByKey() instead.');\n        }\n        else if (path === '$priority') {\n            throw new Error('Query.orderByChild: \"$priority\" is invalid.  Use Query.orderByPriority() instead.');\n        }\n        else if (path === '$value') {\n            throw new Error('Query.orderByChild: \"$value\" is invalid.  Use Query.orderByValue() instead.');\n        }\n        validation_1.validatePathString('Query.orderByChild', 1, path, false);\n        this.validateNoPreviousOrderByCall_('Query.orderByChild');\n        var parsedPath = new Path_1.Path(path);\n        if (parsedPath.isEmpty()) {\n            throw new Error('Query.orderByChild: cannot pass in empty path.  Use Query.orderByValue() instead.');\n        }\n        var index = new PathIndex_1.PathIndex(parsedPath);\n        var newParams = this.queryParams_.orderBy(index);\n        Query.validateQueryEndpoints_(newParams);\n        return new Query(this.repo, this.path, newParams, /*orderByCalled=*/ true);\n    };\n    /**\n     * Return a new query ordered by the KeyIndex\n     * @return {!Query}\n     */\n    Query.prototype.orderByKey = function () {\n        util_3.validateArgCount('Query.orderByKey', 0, 0, arguments.length);\n        this.validateNoPreviousOrderByCall_('Query.orderByKey');\n        var newParams = this.queryParams_.orderBy(KeyIndex_1.KEY_INDEX);\n        Query.validateQueryEndpoints_(newParams);\n        return new Query(this.repo, this.path, newParams, /*orderByCalled=*/ true);\n    };\n    /**\n     * Return a new query ordered by the PriorityIndex\n     * @return {!Query}\n     */\n    Query.prototype.orderByPriority = function () {\n        util_3.validateArgCount('Query.orderByPriority', 0, 0, arguments.length);\n        this.validateNoPreviousOrderByCall_('Query.orderByPriority');\n        var newParams = this.queryParams_.orderBy(PriorityIndex_1.PRIORITY_INDEX);\n        Query.validateQueryEndpoints_(newParams);\n        return new Query(this.repo, this.path, newParams, /*orderByCalled=*/ true);\n    };\n    /**\n     * Return a new query ordered by the ValueIndex\n     * @return {!Query}\n     */\n    Query.prototype.orderByValue = function () {\n        util_3.validateArgCount('Query.orderByValue', 0, 0, arguments.length);\n        this.validateNoPreviousOrderByCall_('Query.orderByValue');\n        var newParams = this.queryParams_.orderBy(ValueIndex_1.VALUE_INDEX);\n        Query.validateQueryEndpoints_(newParams);\n        return new Query(this.repo, this.path, newParams, /*orderByCalled=*/ true);\n    };\n    /**\n     * @param {number|string|boolean|null} value\n     * @param {?string=} name\n     * @return {!Query}\n     */\n    Query.prototype.startAt = function (value, name) {\n        if (value === void 0) { value = null; }\n        util_3.validateArgCount('Query.startAt', 0, 2, arguments.length);\n        validation_1.validateFirebaseDataArg('Query.startAt', 1, value, this.path, true);\n        validation_1.validateKey('Query.startAt', 2, name, true);\n        var newParams = this.queryParams_.startAt(value, name);\n        Query.validateLimit_(newParams);\n        Query.validateQueryEndpoints_(newParams);\n        if (this.queryParams_.hasStart()) {\n            throw new Error('Query.startAt: Starting point was already set (by another call to startAt ' +\n                'or equalTo).');\n        }\n        // Calling with no params tells us to start at the beginning.\n        if (value === undefined) {\n            value = null;\n            name = null;\n        }\n        return new Query(this.repo, this.path, newParams, this.orderByCalled_);\n    };\n    /**\n     * @param {number|string|boolean|null} value\n     * @param {?string=} name\n     * @return {!Query}\n     */\n    Query.prototype.endAt = function (value, name) {\n        if (value === void 0) { value = null; }\n        util_3.validateArgCount('Query.endAt', 0, 2, arguments.length);\n        validation_1.validateFirebaseDataArg('Query.endAt', 1, value, this.path, true);\n        validation_1.validateKey('Query.endAt', 2, name, true);\n        var newParams = this.queryParams_.endAt(value, name);\n        Query.validateLimit_(newParams);\n        Query.validateQueryEndpoints_(newParams);\n        if (this.queryParams_.hasEnd()) {\n            throw new Error('Query.endAt: Ending point was already set (by another call to endAt or ' +\n                'equalTo).');\n        }\n        return new Query(this.repo, this.path, newParams, this.orderByCalled_);\n    };\n    /**\n     * Load the selection of children with exactly the specified value, and, optionally,\n     * the specified name.\n     * @param {number|string|boolean|null} value\n     * @param {string=} name\n     * @return {!Query}\n     */\n    Query.prototype.equalTo = function (value, name) {\n        util_3.validateArgCount('Query.equalTo', 1, 2, arguments.length);\n        validation_1.validateFirebaseDataArg('Query.equalTo', 1, value, this.path, false);\n        validation_1.validateKey('Query.equalTo', 2, name, true);\n        if (this.queryParams_.hasStart()) {\n            throw new Error('Query.equalTo: Starting point was already set (by another call to startAt or ' +\n                'equalTo).');\n        }\n        if (this.queryParams_.hasEnd()) {\n            throw new Error('Query.equalTo: Ending point was already set (by another call to endAt or ' +\n                'equalTo).');\n        }\n        return this.startAt(value, name).endAt(value, name);\n    };\n    /**\n     * @return {!string} URL for this location.\n     */\n    Query.prototype.toString = function () {\n        util_3.validateArgCount('Query.toString', 0, 0, arguments.length);\n        return this.repo.toString() + this.path.toUrlEncodedString();\n    };\n    // Do not create public documentation. This is intended to make JSON serialization work but is otherwise unnecessary\n    // for end-users.\n    Query.prototype.toJSON = function () {\n        // An optional spacer argument is unnecessary for a string.\n        util_3.validateArgCount('Query.toJSON', 0, 1, arguments.length);\n        return this.toString();\n    };\n    /**\n     * An object representation of the query parameters used by this Query.\n     * @return {!Object}\n     */\n    Query.prototype.queryObject = function () {\n        return this.queryParams_.getQueryObject();\n    };\n    /**\n     * @return {!string}\n     */\n    Query.prototype.queryIdentifier = function () {\n        var obj = this.queryObject();\n        var id = util_2.ObjectToUniqueKey(obj);\n        return id === '{}' ? 'default' : id;\n    };\n    /**\n     * Return true if this query and the provided query are equivalent; otherwise, return false.\n     * @param {Query} other\n     * @return {boolean}\n     */\n    Query.prototype.isEqual = function (other) {\n        util_3.validateArgCount('Query.isEqual', 1, 1, arguments.length);\n        if (!(other instanceof Query)) {\n            var error = 'Query.isEqual failed: First argument must be an instance of firebase.database.Query.';\n            throw new Error(error);\n        }\n        var sameRepo = this.repo === other.repo;\n        var samePath = this.path.equals(other.path);\n        var sameQueryIdentifier = this.queryIdentifier() === other.queryIdentifier();\n        return sameRepo && samePath && sameQueryIdentifier;\n    };\n    /**\n     * Helper used by .on and .once to extract the context and or cancel arguments.\n     * @param {!string} fnName The function name (on or once)\n     * @param {(function(Error)|Object)=} cancelOrContext\n     * @param {Object=} context\n     * @return {{cancel: ?function(Error), context: ?Object}}\n     * @private\n     */\n    Query.getCancelAndContextArgs_ = function (fnName, cancelOrContext, context) {\n        var ret = { cancel: null, context: null };\n        if (cancelOrContext && context) {\n            ret.cancel = cancelOrContext;\n            util_3.validateCallback(fnName, 3, ret.cancel, true);\n            ret.context = context;\n            util_3.validateContextObject(fnName, 4, ret.context, true);\n        }\n        else if (cancelOrContext) {\n            // we have either a cancel callback or a context.\n            if (typeof cancelOrContext === 'object' && cancelOrContext !== null) {\n                // it's a context!\n                ret.context = cancelOrContext;\n            }\n            else if (typeof cancelOrContext === 'function') {\n                ret.cancel = cancelOrContext;\n            }\n            else {\n                throw new Error(util_3.errorPrefix(fnName, 3, true) +\n                    ' must either be a cancel callback or a context object.');\n            }\n        }\n        return ret;\n    };\n    Object.defineProperty(Query.prototype, \"ref\", {\n        get: function () {\n            return this.getRef();\n        },\n        enumerable: true,\n        configurable: true\n    });\n    return Query;\n}());\nexports.Query = Query;\n\n//# sourceMappingURL=Query.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/api/Query.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = require(\"@firebase/util\");\nvar util_2 = require(\"../util/util\");\nvar util_3 = require(\"@firebase/util\");\nvar MAX_NODE;\nfunction setMaxNode(val) {\n    MAX_NODE = val;\n}\nexports.setMaxNode = setMaxNode;\n/**\n * @param {(!string|!number)} priority\n * @return {!string}\n */\nexports.priorityHashText = function (priority) {\n    if (typeof priority === 'number')\n        return 'number:' + util_2.doubleToIEEE754String(priority);\n    else\n        return 'string:' + priority;\n};\n/**\n * Validates that a priority snapshot Node is valid.\n *\n * @param {!Node} priorityNode\n */\nexports.validatePriorityNode = function (priorityNode) {\n    if (priorityNode.isLeafNode()) {\n        var val = priorityNode.val();\n        util_1.assert(typeof val === 'string' ||\n            typeof val === 'number' ||\n            (typeof val === 'object' && util_3.contains(val, '.sv')), 'Priority must be a string or number.');\n    }\n    else {\n        util_1.assert(priorityNode === MAX_NODE || priorityNode.isEmpty(), 'priority of unexpected type.');\n    }\n    // Don't call getPriority() on MAX_NODE to avoid hitting assertion.\n    util_1.assert(priorityNode === MAX_NODE || priorityNode.getPriority().isEmpty(), \"Priority nodes can't have a priority of their own.\");\n};\n\n//# sourceMappingURL=snap.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/snap/snap.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nvar __extends = (this && this.__extends) || (function () {\n    var extendStatics = Object.setPrototypeOf ||\n        ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n        function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };\n    return function (d, b) {\n        extendStatics(d, b);\n        function __() { this.constructor = d; }\n        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n    };\n})();\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar Index_1 = require(\"./Index\");\nvar Node_1 = require(\"../Node\");\nvar util_1 = require(\"../../util/util\");\nvar nodeFromJSON_1 = require(\"../nodeFromJSON\");\n/**\n * @constructor\n * @extends {Index}\n * @private\n */\nvar ValueIndex = /** @class */ (function (_super) {\n    __extends(ValueIndex, _super);\n    function ValueIndex() {\n        return _super !== null && _super.apply(this, arguments) || this;\n    }\n    /**\n     * @inheritDoc\n     */\n    ValueIndex.prototype.compare = function (a, b) {\n        var indexCmp = a.node.compareTo(b.node);\n        if (indexCmp === 0) {\n            return util_1.nameCompare(a.name, b.name);\n        }\n        else {\n            return indexCmp;\n        }\n    };\n    /**\n     * @inheritDoc\n     */\n    ValueIndex.prototype.isDefinedOn = function (node) {\n        return true;\n    };\n    /**\n     * @inheritDoc\n     */\n    ValueIndex.prototype.indexedValueChanged = function (oldNode, newNode) {\n        return !oldNode.equals(newNode);\n    };\n    /**\n     * @inheritDoc\n     */\n    ValueIndex.prototype.minPost = function () {\n        return Node_1.NamedNode.MIN;\n    };\n    /**\n     * @inheritDoc\n     */\n    ValueIndex.prototype.maxPost = function () {\n        return Node_1.NamedNode.MAX;\n    };\n    /**\n     * @param {*} indexValue\n     * @param {string} name\n     * @return {!NamedNode}\n     */\n    ValueIndex.prototype.makePost = function (indexValue, name) {\n        var valueNode = nodeFromJSON_1.nodeFromJSON(indexValue);\n        return new Node_1.NamedNode(name, valueNode);\n    };\n    /**\n     * @return {!string} String representation for inclusion in a query spec\n     */\n    ValueIndex.prototype.toString = function () {\n        return '.value';\n    };\n    return ValueIndex;\n}(Index_1.Index));\nexports.ValueIndex = ValueIndex;\nexports.VALUE_INDEX = new ValueIndex();\n\n//# sourceMappingURL=ValueIndex.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/snap/indexes/ValueIndex.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = require(\"@firebase/util\");\nvar childSet_1 = require(\"./childSet\");\nvar util_2 = require(\"@firebase/util\");\nvar Node_1 = require(\"./Node\");\nvar PriorityIndex_1 = require(\"./indexes/PriorityIndex\");\nvar KeyIndex_1 = require(\"./indexes/KeyIndex\");\nvar _defaultIndexMap;\nvar fallbackObject = {};\n/**\n *\n * @param {Object.<string, FallbackType|SortedMap.<NamedNode, Node>>} indexes\n * @param {Object.<string, Index>} indexSet\n * @constructor\n */\nvar IndexMap = /** @class */ (function () {\n    function IndexMap(indexes_, indexSet_) {\n        this.indexes_ = indexes_;\n        this.indexSet_ = indexSet_;\n    }\n    Object.defineProperty(IndexMap, \"Default\", {\n        /**\n         * The default IndexMap for nodes without a priority\n         * @type {!IndexMap}\n         * @const\n         */\n        get: function () {\n            util_1.assert(fallbackObject && PriorityIndex_1.PRIORITY_INDEX, 'ChildrenNode.ts has not been loaded');\n            _defaultIndexMap =\n                _defaultIndexMap ||\n                    new IndexMap({ '.priority': fallbackObject }, { '.priority': PriorityIndex_1.PRIORITY_INDEX });\n            return _defaultIndexMap;\n        },\n        enumerable: true,\n        configurable: true\n    });\n    /**\n     *\n     * @param {!string} indexKey\n     * @return {?SortedMap.<NamedNode, Node>}\n     */\n    IndexMap.prototype.get = function (indexKey) {\n        var sortedMap = util_2.safeGet(this.indexes_, indexKey);\n        if (!sortedMap)\n            throw new Error('No index defined for ' + indexKey);\n        if (sortedMap === fallbackObject) {\n            // The index exists, but it falls back to just name comparison. Return null so that the calling code uses the\n            // regular child map\n            return null;\n        }\n        else {\n            return sortedMap;\n        }\n    };\n    /**\n     * @param {!Index} indexDefinition\n     * @return {boolean}\n     */\n    IndexMap.prototype.hasIndex = function (indexDefinition) {\n        return util_2.contains(this.indexSet_, indexDefinition.toString());\n    };\n    /**\n     * @param {!Index} indexDefinition\n     * @param {!SortedMap.<string, !Node>} existingChildren\n     * @return {!IndexMap}\n     */\n    IndexMap.prototype.addIndex = function (indexDefinition, existingChildren) {\n        util_1.assert(indexDefinition !== KeyIndex_1.KEY_INDEX, \"KeyIndex always exists and isn't meant to be added to the IndexMap.\");\n        var childList = [];\n        var sawIndexedValue = false;\n        var iter = existingChildren.getIterator(Node_1.NamedNode.Wrap);\n        var next = iter.getNext();\n        while (next) {\n            sawIndexedValue =\n                sawIndexedValue || indexDefinition.isDefinedOn(next.node);\n            childList.push(next);\n            next = iter.getNext();\n        }\n        var newIndex;\n        if (sawIndexedValue) {\n            newIndex = childSet_1.buildChildSet(childList, indexDefinition.getCompare());\n        }\n        else {\n            newIndex = fallbackObject;\n        }\n        var indexName = indexDefinition.toString();\n        var newIndexSet = util_2.clone(this.indexSet_);\n        newIndexSet[indexName] = indexDefinition;\n        var newIndexes = util_2.clone(this.indexes_);\n        newIndexes[indexName] = newIndex;\n        return new IndexMap(newIndexes, newIndexSet);\n    };\n    /**\n     * Ensure that this node is properly tracked in any indexes that we're maintaining\n     * @param {!NamedNode} namedNode\n     * @param {!SortedMap.<string, !Node>} existingChildren\n     * @return {!IndexMap}\n     */\n    IndexMap.prototype.addToIndexes = function (namedNode, existingChildren) {\n        var _this = this;\n        var newIndexes = util_2.map(this.indexes_, function (indexedChildren, indexName) {\n            var index = util_2.safeGet(_this.indexSet_, indexName);\n            util_1.assert(index, 'Missing index implementation for ' + indexName);\n            if (indexedChildren === fallbackObject) {\n                // Check to see if we need to index everything\n                if (index.isDefinedOn(namedNode.node)) {\n                    // We need to build this index\n                    var childList = [];\n                    var iter = existingChildren.getIterator(Node_1.NamedNode.Wrap);\n                    var next = iter.getNext();\n                    while (next) {\n                        if (next.name != namedNode.name) {\n                            childList.push(next);\n                        }\n                        next = iter.getNext();\n                    }\n                    childList.push(namedNode);\n                    return childSet_1.buildChildSet(childList, index.getCompare());\n                }\n                else {\n                    // No change, this remains a fallback\n                    return fallbackObject;\n                }\n            }\n            else {\n                var existingSnap = existingChildren.get(namedNode.name);\n                var newChildren = indexedChildren;\n                if (existingSnap) {\n                    newChildren = newChildren.remove(new Node_1.NamedNode(namedNode.name, existingSnap));\n                }\n                return newChildren.insert(namedNode, namedNode.node);\n            }\n        });\n        return new IndexMap(newIndexes, this.indexSet_);\n    };\n    /**\n     * Create a new IndexMap instance with the given value removed\n     * @param {!NamedNode} namedNode\n     * @param {!SortedMap.<string, !Node>} existingChildren\n     * @return {!IndexMap}\n     */\n    IndexMap.prototype.removeFromIndexes = function (namedNode, existingChildren) {\n        var newIndexes = util_2.map(this.indexes_, function (indexedChildren) {\n            if (indexedChildren === fallbackObject) {\n                // This is the fallback. Just return it, nothing to do in this case\n                return indexedChildren;\n            }\n            else {\n                var existingSnap = existingChildren.get(namedNode.name);\n                if (existingSnap) {\n                    return indexedChildren.remove(new Node_1.NamedNode(namedNode.name, existingSnap));\n                }\n                else {\n                    // No record of this child\n                    return indexedChildren;\n                }\n            }\n        });\n        return new IndexMap(newIndexes, this.indexSet_);\n    };\n    return IndexMap;\n}());\nexports.IndexMap = IndexMap;\n\n//# sourceMappingURL=IndexMap.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/snap/IndexMap.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar SortedMap_1 = require(\"../util/SortedMap\");\nvar SortedMap_2 = require(\"../util/SortedMap\");\nvar LOG_2 = Math.log(2);\n/**\n * @constructor\n */\nvar Base12Num = /** @class */ (function () {\n    /**\n     * @param {number} length\n     */\n    function Base12Num(length) {\n        var logBase2 = function (num) {\n            return parseInt((Math.log(num) / LOG_2), 10);\n        };\n        var bitMask = function (bits) { return parseInt(Array(bits + 1).join('1'), 2); };\n        this.count = logBase2(length + 1);\n        this.current_ = this.count - 1;\n        var mask = bitMask(this.count);\n        this.bits_ = (length + 1) & mask;\n    }\n    /**\n     * @return {boolean}\n     */\n    Base12Num.prototype.nextBitIsOne = function () {\n        //noinspection JSBitwiseOperatorUsage\n        var result = !(this.bits_ & (0x1 << this.current_));\n        this.current_--;\n        return result;\n    };\n    return Base12Num;\n}());\n/**\n * Takes a list of child nodes and constructs a SortedSet using the given comparison\n * function\n *\n * Uses the algorithm described in the paper linked here:\n * http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.46.1458\n *\n * @template K, V\n * @param {Array.<!NamedNode>} childList Unsorted list of children\n * @param {function(!NamedNode, !NamedNode):number} cmp The comparison method to be used\n * @param {(function(NamedNode):K)=} keyFn An optional function to extract K from a node wrapper, if K's\n *                                                        type is not NamedNode\n * @param {(function(K, K):number)=} mapSortFn An optional override for comparator used by the generated sorted map\n * @return {SortedMap.<K, V>}\n */\nexports.buildChildSet = function (childList, cmp, keyFn, mapSortFn) {\n    childList.sort(cmp);\n    var buildBalancedTree = function (low, high) {\n        var length = high - low;\n        var namedNode;\n        var key;\n        if (length == 0) {\n            return null;\n        }\n        else if (length == 1) {\n            namedNode = childList[low];\n            key = keyFn ? keyFn(namedNode) : namedNode;\n            return new SortedMap_1.LLRBNode(key, namedNode.node, SortedMap_1.LLRBNode.BLACK, null, null);\n        }\n        else {\n            var middle = parseInt((length / 2), 10) + low;\n            var left = buildBalancedTree(low, middle);\n            var right = buildBalancedTree(middle + 1, high);\n            namedNode = childList[middle];\n            key = keyFn ? keyFn(namedNode) : namedNode;\n            return new SortedMap_1.LLRBNode(key, namedNode.node, SortedMap_1.LLRBNode.BLACK, left, right);\n        }\n    };\n    var buildFrom12Array = function (base12) {\n        var node = null;\n        var root = null;\n        var index = childList.length;\n        var buildPennant = function (chunkSize, color) {\n            var low = index - chunkSize;\n            var high = index;\n            index -= chunkSize;\n            var childTree = buildBalancedTree(low + 1, high);\n            var namedNode = childList[low];\n            var key = keyFn ? keyFn(namedNode) : namedNode;\n            attachPennant(new SortedMap_1.LLRBNode(key, namedNode.node, color, null, childTree));\n        };\n        var attachPennant = function (pennant) {\n            if (node) {\n                node.left = pennant;\n                node = pennant;\n            }\n            else {\n                root = pennant;\n                node = pennant;\n            }\n        };\n        for (var i = 0; i < base12.count; ++i) {\n            var isOne = base12.nextBitIsOne();\n            // The number of nodes taken in each slice is 2^(arr.length - (i + 1))\n            var chunkSize = Math.pow(2, base12.count - (i + 1));\n            if (isOne) {\n                buildPennant(chunkSize, SortedMap_1.LLRBNode.BLACK);\n            }\n            else {\n                // current == 2\n                buildPennant(chunkSize, SortedMap_1.LLRBNode.BLACK);\n                buildPennant(chunkSize, SortedMap_1.LLRBNode.RED);\n            }\n        }\n        return root;\n    };\n    var base12 = new Base12Num(childList.length);\n    var root = buildFrom12Array(base12);\n    return new SortedMap_2.SortedMap(mapSortFn || cmp, root);\n};\n\n//# sourceMappingURL=childSet.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/snap/childSet.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = require(\"../util/util\");\nfunction NAME_ONLY_COMPARATOR(left, right) {\n    return util_1.nameCompare(left.name, right.name);\n}\nexports.NAME_ONLY_COMPARATOR = NAME_ONLY_COMPARATOR;\nfunction NAME_COMPARATOR(left, right) {\n    return util_1.nameCompare(left, right);\n}\nexports.NAME_COMPARATOR = NAME_COMPARATOR;\n\n//# sourceMappingURL=comparators.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/snap/comparators.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nvar __extends = (this && this.__extends) || (function () {\n    var extendStatics = Object.setPrototypeOf ||\n        ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n        function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };\n    return function (d, b) {\n        extendStatics(d, b);\n        function __() { this.constructor = d; }\n        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n    };\n})();\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = require(\"@firebase/util\");\nvar util_2 = require(\"../../util/util\");\nvar Index_1 = require(\"./Index\");\nvar ChildrenNode_1 = require(\"../ChildrenNode\");\nvar Node_1 = require(\"../Node\");\nvar nodeFromJSON_1 = require(\"../nodeFromJSON\");\n/**\n * @param {!Path} indexPath\n * @constructor\n * @extends {Index}\n */\nvar PathIndex = /** @class */ (function (_super) {\n    __extends(PathIndex, _super);\n    function PathIndex(indexPath_) {\n        var _this = _super.call(this) || this;\n        _this.indexPath_ = indexPath_;\n        util_1.assert(!indexPath_.isEmpty() && indexPath_.getFront() !== '.priority', \"Can't create PathIndex with empty path or .priority key\");\n        return _this;\n    }\n    /**\n     * @param {!Node} snap\n     * @return {!Node}\n     * @protected\n     */\n    PathIndex.prototype.extractChild = function (snap) {\n        return snap.getChild(this.indexPath_);\n    };\n    /**\n     * @inheritDoc\n     */\n    PathIndex.prototype.isDefinedOn = function (node) {\n        return !node.getChild(this.indexPath_).isEmpty();\n    };\n    /**\n     * @inheritDoc\n     */\n    PathIndex.prototype.compare = function (a, b) {\n        var aChild = this.extractChild(a.node);\n        var bChild = this.extractChild(b.node);\n        var indexCmp = aChild.compareTo(bChild);\n        if (indexCmp === 0) {\n            return util_2.nameCompare(a.name, b.name);\n        }\n        else {\n            return indexCmp;\n        }\n    };\n    /**\n     * @inheritDoc\n     */\n    PathIndex.prototype.makePost = function (indexValue, name) {\n        var valueNode = nodeFromJSON_1.nodeFromJSON(indexValue);\n        var node = ChildrenNode_1.ChildrenNode.EMPTY_NODE.updateChild(this.indexPath_, valueNode);\n        return new Node_1.NamedNode(name, node);\n    };\n    /**\n     * @inheritDoc\n     */\n    PathIndex.prototype.maxPost = function () {\n        var node = ChildrenNode_1.ChildrenNode.EMPTY_NODE.updateChild(this.indexPath_, ChildrenNode_1.MAX_NODE);\n        return new Node_1.NamedNode(util_2.MAX_NAME, node);\n    };\n    /**\n     * @inheritDoc\n     */\n    PathIndex.prototype.toString = function () {\n        return this.indexPath_.slice().join('/');\n    };\n    return PathIndex;\n}(Index_1.Index));\nexports.PathIndex = PathIndex;\n\n//# sourceMappingURL=PathIndex.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/snap/indexes/PathIndex.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = require(\"@firebase/util\");\nvar Path_1 = require(\"./Path\");\nvar SparseSnapshotTree_1 = require(\"../SparseSnapshotTree\");\nvar LeafNode_1 = require(\"../snap/LeafNode\");\nvar nodeFromJSON_1 = require(\"../snap/nodeFromJSON\");\nvar PriorityIndex_1 = require(\"../snap/indexes/PriorityIndex\");\n/**\n * Generate placeholders for deferred values.\n * @param {?Object} values\n * @return {!Object}\n */\nexports.generateWithValues = function (values) {\n    values = values || {};\n    values['timestamp'] = values['timestamp'] || new Date().getTime();\n    return values;\n};\n/**\n * Value to use when firing local events. When writing server values, fire\n * local events with an approximate value, otherwise return value as-is.\n * @param {(Object|string|number|boolean)} value\n * @param {!Object} serverValues\n * @return {!(string|number|boolean)}\n */\nexports.resolveDeferredValue = function (value, serverValues) {\n    if (!value || typeof value !== 'object') {\n        return value;\n    }\n    else {\n        util_1.assert('.sv' in value, 'Unexpected leaf node or priority contents');\n        return serverValues[value['.sv']];\n    }\n};\n/**\n * Recursively replace all deferred values and priorities in the tree with the\n * specified generated replacement values.\n * @param {!SparseSnapshotTree} tree\n * @param {!Object} serverValues\n * @return {!SparseSnapshotTree}\n */\nexports.resolveDeferredValueTree = function (tree, serverValues) {\n    var resolvedTree = new SparseSnapshotTree_1.SparseSnapshotTree();\n    tree.forEachTree(new Path_1.Path(''), function (path, node) {\n        resolvedTree.remember(path, exports.resolveDeferredValueSnapshot(node, serverValues));\n    });\n    return resolvedTree;\n};\n/**\n * Recursively replace all deferred values and priorities in the node with the\n * specified generated replacement values.  If there are no server values in the node,\n * it'll be returned as-is.\n * @param {!Node} node\n * @param {!Object} serverValues\n * @return {!Node}\n */\nexports.resolveDeferredValueSnapshot = function (node, serverValues) {\n    var rawPri = node.getPriority().val();\n    var priority = exports.resolveDeferredValue(rawPri, serverValues);\n    var newNode;\n    if (node.isLeafNode()) {\n        var leafNode = node;\n        var value = exports.resolveDeferredValue(leafNode.getValue(), serverValues);\n        if (value !== leafNode.getValue() ||\n            priority !== leafNode.getPriority().val()) {\n            return new LeafNode_1.LeafNode(value, nodeFromJSON_1.nodeFromJSON(priority));\n        }\n        else {\n            return node;\n        }\n    }\n    else {\n        var childrenNode = node;\n        newNode = childrenNode;\n        if (priority !== childrenNode.getPriority().val()) {\n            newNode = newNode.updatePriority(new LeafNode_1.LeafNode(priority));\n        }\n        childrenNode.forEachChild(PriorityIndex_1.PRIORITY_INDEX, function (childName, childNode) {\n            var newChildNode = exports.resolveDeferredValueSnapshot(childNode, serverValues);\n            if (newChildNode !== childNode) {\n                newNode = newNode.updateImmediateChild(childName, newChildNode);\n            }\n        });\n        return newNode;\n    }\n};\n\n//# sourceMappingURL=ServerValues.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/util/ServerValues.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar Path_1 = require(\"./util/Path\");\nvar PriorityIndex_1 = require(\"./snap/indexes/PriorityIndex\");\nvar CountedSet_1 = require(\"./util/CountedSet\");\n/**\n * Helper class to store a sparse set of snapshots.\n *\n * @constructor\n */\nvar SparseSnapshotTree = /** @class */ (function () {\n    function SparseSnapshotTree() {\n        /**\n         * @private\n         * @type {Node}\n         */\n        this.value_ = null;\n        /**\n         * @private\n         * @type {CountedSet}\n         */\n        this.children_ = null;\n    }\n    /**\n     * Gets the node stored at the given path if one exists.\n     *\n     * @param {!Path} path Path to look up snapshot for.\n     * @return {?Node} The retrieved node, or null.\n     */\n    SparseSnapshotTree.prototype.find = function (path) {\n        if (this.value_ != null) {\n            return this.value_.getChild(path);\n        }\n        else if (!path.isEmpty() && this.children_ != null) {\n            var childKey = path.getFront();\n            path = path.popFront();\n            if (this.children_.contains(childKey)) {\n                var childTree = this.children_.get(childKey);\n                return childTree.find(path);\n            }\n            else {\n                return null;\n            }\n        }\n        else {\n            return null;\n        }\n    };\n    /**\n     * Stores the given node at the specified path. If there is already a node\n     * at a shallower path, it merges the new data into that snapshot node.\n     *\n     * @param {!Path} path Path to look up snapshot for.\n     * @param {!Node} data The new data, or null.\n     */\n    SparseSnapshotTree.prototype.remember = function (path, data) {\n        if (path.isEmpty()) {\n            this.value_ = data;\n            this.children_ = null;\n        }\n        else if (this.value_ !== null) {\n            this.value_ = this.value_.updateChild(path, data);\n        }\n        else {\n            if (this.children_ == null) {\n                this.children_ = new CountedSet_1.CountedSet();\n            }\n            var childKey = path.getFront();\n            if (!this.children_.contains(childKey)) {\n                this.children_.add(childKey, new SparseSnapshotTree());\n            }\n            var child = this.children_.get(childKey);\n            path = path.popFront();\n            child.remember(path, data);\n        }\n    };\n    /**\n     * Purge the data at path from the cache.\n     *\n     * @param {!Path} path Path to look up snapshot for.\n     * @return {boolean} True if this node should now be removed.\n     */\n    SparseSnapshotTree.prototype.forget = function (path) {\n        if (path.isEmpty()) {\n            this.value_ = null;\n            this.children_ = null;\n            return true;\n        }\n        else {\n            if (this.value_ !== null) {\n                if (this.value_.isLeafNode()) {\n                    // We're trying to forget a node that doesn't exist\n                    return false;\n                }\n                else {\n                    var value = this.value_;\n                    this.value_ = null;\n                    var self_1 = this;\n                    value.forEachChild(PriorityIndex_1.PRIORITY_INDEX, function (key, tree) {\n                        self_1.remember(new Path_1.Path(key), tree);\n                    });\n                    return this.forget(path);\n                }\n            }\n            else if (this.children_ !== null) {\n                var childKey = path.getFront();\n                path = path.popFront();\n                if (this.children_.contains(childKey)) {\n                    var safeToRemove = this.children_.get(childKey).forget(path);\n                    if (safeToRemove) {\n                        this.children_.remove(childKey);\n                    }\n                }\n                if (this.children_.isEmpty()) {\n                    this.children_ = null;\n                    return true;\n                }\n                else {\n                    return false;\n                }\n            }\n            else {\n                return true;\n            }\n        }\n    };\n    /**\n     * Recursively iterates through all of the stored tree and calls the\n     * callback on each one.\n     *\n     * @param {!Path} prefixPath Path to look up node for.\n     * @param {!Function} func The function to invoke for each tree.\n     */\n    SparseSnapshotTree.prototype.forEachTree = function (prefixPath, func) {\n        if (this.value_ !== null) {\n            func(prefixPath, this.value_);\n        }\n        else {\n            this.forEachChild(function (key, tree) {\n                var path = new Path_1.Path(prefixPath.toString() + '/' + key);\n                tree.forEachTree(path, func);\n            });\n        }\n    };\n    /**\n     * Iterates through each immediate child and triggers the callback.\n     *\n     * @param {!Function} func The function to invoke for each child.\n     */\n    SparseSnapshotTree.prototype.forEachChild = function (func) {\n        if (this.children_ !== null) {\n            this.children_.each(function (key, tree) {\n                func(key, tree);\n            });\n        }\n    };\n    return SparseSnapshotTree;\n}());\nexports.SparseSnapshotTree = SparseSnapshotTree;\n\n//# sourceMappingURL=SparseSnapshotTree.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/SparseSnapshotTree.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = require(\"@firebase/util\");\n/**\n * Implements a set with a count of elements.\n *\n * @template K, V\n */\nvar CountedSet = /** @class */ (function () {\n    function CountedSet() {\n        this.set = {};\n    }\n    /**\n     * @param {!K} item\n     * @param {V} val\n     */\n    CountedSet.prototype.add = function (item, val) {\n        this.set[item] = val !== null ? val : true;\n    };\n    /**\n     * @param {!K} key\n     * @return {boolean}\n     */\n    CountedSet.prototype.contains = function (key) {\n        return util_1.contains(this.set, key);\n    };\n    /**\n     * @param {!K} item\n     * @return {V}\n     */\n    CountedSet.prototype.get = function (item) {\n        return this.contains(item) ? this.set[item] : undefined;\n    };\n    /**\n     * @param {!K} item\n     */\n    CountedSet.prototype.remove = function (item) {\n        delete this.set[item];\n    };\n    /**\n     * Deletes everything in the set\n     */\n    CountedSet.prototype.clear = function () {\n        this.set = {};\n    };\n    /**\n     * True if there's nothing in the set\n     * @return {boolean}\n     */\n    CountedSet.prototype.isEmpty = function () {\n        return util_1.isEmpty(this.set);\n    };\n    /**\n     * @return {number} The number of items in the set\n     */\n    CountedSet.prototype.count = function () {\n        return util_1.getCount(this.set);\n    };\n    /**\n     * Run a function on each k,v pair in the set\n     * @param {function(K, V)} fn\n     */\n    CountedSet.prototype.each = function (fn) {\n        util_1.forEach(this.set, function (k, v) { return fn(k, v); });\n    };\n    /**\n     * Mostly for debugging\n     * @return {Array.<K>} The keys present in this CountedSet\n     */\n    CountedSet.prototype.keys = function () {\n        var keys = [];\n        util_1.forEach(this.set, function (k) {\n            keys.push(k);\n        });\n        return keys;\n    };\n    return CountedSet;\n}());\nexports.CountedSet = CountedSet;\n\n//# sourceMappingURL=CountedSet.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/util/CountedSet.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar Operation_1 = require(\"./Operation\");\nvar Path_1 = require(\"../util/Path\");\n/**\n * @param {!OperationSource} source\n * @param {!Path} path\n * @param {!Node} snap\n * @constructor\n * @implements {Operation}\n */\nvar Overwrite = /** @class */ (function () {\n    function Overwrite(source, path, snap) {\n        this.source = source;\n        this.path = path;\n        this.snap = snap;\n        /** @inheritDoc */\n        this.type = Operation_1.OperationType.OVERWRITE;\n    }\n    Overwrite.prototype.operationForChild = function (childName) {\n        if (this.path.isEmpty()) {\n            return new Overwrite(this.source, Path_1.Path.Empty, this.snap.getImmediateChild(childName));\n        }\n        else {\n            return new Overwrite(this.source, this.path.popFront(), this.snap);\n        }\n    };\n    return Overwrite;\n}());\nexports.Overwrite = Overwrite;\n\n//# sourceMappingURL=Overwrite.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/operation/Overwrite.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar CacheNode_1 = require(\"./view/CacheNode\");\nvar ChildrenNode_1 = require(\"./snap/ChildrenNode\");\nvar util_1 = require(\"@firebase/util\");\nvar util_2 = require(\"@firebase/util\");\nvar ViewCache_1 = require(\"./view/ViewCache\");\nvar View_1 = require(\"./view/View\");\nvar __referenceConstructor;\n/**\n * SyncPoint represents a single location in a SyncTree with 1 or more event registrations, meaning we need to\n * maintain 1 or more Views at this location to cache server data and raise appropriate events for server changes\n * and user writes (set, transaction, update).\n *\n * It's responsible for:\n *  - Maintaining the set of 1 or more views necessary at this location (a SyncPoint with 0 views should be removed).\n *  - Proxying user / server operations to the views as appropriate (i.e. applyServerOverwrite,\n *    applyUserOverwrite, etc.)\n */\nvar SyncPoint = /** @class */ (function () {\n    function SyncPoint() {\n        /**\n         * The Views being tracked at this location in the tree, stored as a map where the key is a\n         * queryId and the value is the View for that query.\n         *\n         * NOTE: This list will be quite small (usually 1, but perhaps 2 or 3; any more is an odd use case).\n         *\n         * @type {!Object.<!string, !View>}\n         * @private\n         */\n        this.views_ = {};\n    }\n    Object.defineProperty(SyncPoint, \"__referenceConstructor\", {\n        get: function () {\n            util_1.assert(__referenceConstructor, 'Reference.ts has not been loaded');\n            return __referenceConstructor;\n        },\n        set: function (val) {\n            util_1.assert(!__referenceConstructor, '__referenceConstructor has already been defined');\n            __referenceConstructor = val;\n        },\n        enumerable: true,\n        configurable: true\n    });\n    /**\n     * @return {boolean}\n     */\n    SyncPoint.prototype.isEmpty = function () {\n        return util_2.isEmpty(this.views_);\n    };\n    /**\n     *\n     * @param {!Operation} operation\n     * @param {!WriteTreeRef} writesCache\n     * @param {?Node} optCompleteServerCache\n     * @return {!Array.<!Event>}\n     */\n    SyncPoint.prototype.applyOperation = function (operation, writesCache, optCompleteServerCache) {\n        var queryId = operation.source.queryId;\n        if (queryId !== null) {\n            var view = util_2.safeGet(this.views_, queryId);\n            util_1.assert(view != null, 'SyncTree gave us an op for an invalid query.');\n            return view.applyOperation(operation, writesCache, optCompleteServerCache);\n        }\n        else {\n            var events_1 = [];\n            util_2.forEach(this.views_, function (key, view) {\n                events_1 = events_1.concat(view.applyOperation(operation, writesCache, optCompleteServerCache));\n            });\n            return events_1;\n        }\n    };\n    /**\n     * Add an event callback for the specified query.\n     *\n     * @param {!Query} query\n     * @param {!EventRegistration} eventRegistration\n     * @param {!WriteTreeRef} writesCache\n     * @param {?Node} serverCache Complete server cache, if we have it.\n     * @param {boolean} serverCacheComplete\n     * @return {!Array.<!Event>} Events to raise.\n     */\n    SyncPoint.prototype.addEventRegistration = function (query, eventRegistration, writesCache, serverCache, serverCacheComplete) {\n        var queryId = query.queryIdentifier();\n        var view = util_2.safeGet(this.views_, queryId);\n        if (!view) {\n            // TODO: make writesCache take flag for complete server node\n            var eventCache = writesCache.calcCompleteEventCache(serverCacheComplete ? serverCache : null);\n            var eventCacheComplete = false;\n            if (eventCache) {\n                eventCacheComplete = true;\n            }\n            else if (serverCache instanceof ChildrenNode_1.ChildrenNode) {\n                eventCache = writesCache.calcCompleteEventChildren(serverCache);\n                eventCacheComplete = false;\n            }\n            else {\n                eventCache = ChildrenNode_1.ChildrenNode.EMPTY_NODE;\n                eventCacheComplete = false;\n            }\n            var viewCache = new ViewCache_1.ViewCache(new CacheNode_1.CacheNode(\n            /** @type {!Node} */ (eventCache), eventCacheComplete, false), new CacheNode_1.CacheNode(\n            /** @type {!Node} */ (serverCache), serverCacheComplete, false));\n            view = new View_1.View(query, viewCache);\n            this.views_[queryId] = view;\n        }\n        // This is guaranteed to exist now, we just created anything that was missing\n        view.addEventRegistration(eventRegistration);\n        return view.getInitialEvents(eventRegistration);\n    };\n    /**\n     * Remove event callback(s).  Return cancelEvents if a cancelError is specified.\n     *\n     * If query is the default query, we'll check all views for the specified eventRegistration.\n     * If eventRegistration is null, we'll remove all callbacks for the specified view(s).\n     *\n     * @param {!Query} query\n     * @param {?EventRegistration} eventRegistration If null, remove all callbacks.\n     * @param {Error=} cancelError If a cancelError is provided, appropriate cancel events will be returned.\n     * @return {{removed:!Array.<!Query>, events:!Array.<!Event>}} removed queries and any cancel events\n     */\n    SyncPoint.prototype.removeEventRegistration = function (query, eventRegistration, cancelError) {\n        var queryId = query.queryIdentifier();\n        var removed = [];\n        var cancelEvents = [];\n        var hadCompleteView = this.hasCompleteView();\n        if (queryId === 'default') {\n            // When you do ref.off(...), we search all views for the registration to remove.\n            var self_1 = this;\n            util_2.forEach(this.views_, function (viewQueryId, view) {\n                cancelEvents = cancelEvents.concat(view.removeEventRegistration(eventRegistration, cancelError));\n                if (view.isEmpty()) {\n                    delete self_1.views_[viewQueryId];\n                    // We'll deal with complete views later.\n                    if (!view\n                        .getQuery()\n                        .getQueryParams()\n                        .loadsAllData()) {\n                        removed.push(view.getQuery());\n                    }\n                }\n            });\n        }\n        else {\n            // remove the callback from the specific view.\n            var view = util_2.safeGet(this.views_, queryId);\n            if (view) {\n                cancelEvents = cancelEvents.concat(view.removeEventRegistration(eventRegistration, cancelError));\n                if (view.isEmpty()) {\n                    delete this.views_[queryId];\n                    // We'll deal with complete views later.\n                    if (!view\n                        .getQuery()\n                        .getQueryParams()\n                        .loadsAllData()) {\n                        removed.push(view.getQuery());\n                    }\n                }\n            }\n        }\n        if (hadCompleteView && !this.hasCompleteView()) {\n            // We removed our last complete view.\n            removed.push(new SyncPoint.__referenceConstructor(query.repo, query.path));\n        }\n        return { removed: removed, events: cancelEvents };\n    };\n    /**\n     * @return {!Array.<!View>}\n     */\n    SyncPoint.prototype.getQueryViews = function () {\n        var _this = this;\n        var values = Object.keys(this.views_).map(function (key) { return _this.views_[key]; });\n        return values.filter(function (view) {\n            return !view\n                .getQuery()\n                .getQueryParams()\n                .loadsAllData();\n        });\n    };\n    /**\n     *\n     * @param {!Path} path The path to the desired complete snapshot\n     * @return {?Node} A complete cache, if it exists\n     */\n    SyncPoint.prototype.getCompleteServerCache = function (path) {\n        var serverCache = null;\n        util_2.forEach(this.views_, function (key, view) {\n            serverCache = serverCache || view.getCompleteServerCache(path);\n        });\n        return serverCache;\n    };\n    /**\n     * @param {!Query} query\n     * @return {?View}\n     */\n    SyncPoint.prototype.viewForQuery = function (query) {\n        var params = query.getQueryParams();\n        if (params.loadsAllData()) {\n            return this.getCompleteView();\n        }\n        else {\n            var queryId = query.queryIdentifier();\n            return util_2.safeGet(this.views_, queryId);\n        }\n    };\n    /**\n     * @param {!Query} query\n     * @return {boolean}\n     */\n    SyncPoint.prototype.viewExistsForQuery = function (query) {\n        return this.viewForQuery(query) != null;\n    };\n    /**\n     * @return {boolean}\n     */\n    SyncPoint.prototype.hasCompleteView = function () {\n        return this.getCompleteView() != null;\n    };\n    /**\n     * @return {?View}\n     */\n    SyncPoint.prototype.getCompleteView = function () {\n        var completeView = util_2.findValue(this.views_, function (view) {\n            return view\n                .getQuery()\n                .getQueryParams()\n                .loadsAllData();\n        });\n        return completeView || null;\n    };\n    return SyncPoint;\n}());\nexports.SyncPoint = SyncPoint;\n\n//# sourceMappingURL=SyncPoint.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/SyncPoint.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar ChildrenNode_1 = require(\"../snap/ChildrenNode\");\nvar CacheNode_1 = require(\"./CacheNode\");\n/**\n * Stores the data we have cached for a view.\n *\n * serverSnap is the cached server data, eventSnap is the cached event data (server data plus any local writes).\n *\n * @constructor\n */\nvar ViewCache = /** @class */ (function () {\n    /**\n     *\n     * @param {!CacheNode} eventCache_\n     * @param {!CacheNode} serverCache_\n     */\n    function ViewCache(eventCache_, serverCache_) {\n        this.eventCache_ = eventCache_;\n        this.serverCache_ = serverCache_;\n    }\n    /**\n     * @param {!Node} eventSnap\n     * @param {boolean} complete\n     * @param {boolean} filtered\n     * @return {!ViewCache}\n     */\n    ViewCache.prototype.updateEventSnap = function (eventSnap, complete, filtered) {\n        return new ViewCache(new CacheNode_1.CacheNode(eventSnap, complete, filtered), this.serverCache_);\n    };\n    /**\n     * @param {!Node} serverSnap\n     * @param {boolean} complete\n     * @param {boolean} filtered\n     * @return {!ViewCache}\n     */\n    ViewCache.prototype.updateServerSnap = function (serverSnap, complete, filtered) {\n        return new ViewCache(this.eventCache_, new CacheNode_1.CacheNode(serverSnap, complete, filtered));\n    };\n    /**\n     * @return {!CacheNode}\n     */\n    ViewCache.prototype.getEventCache = function () {\n        return this.eventCache_;\n    };\n    /**\n     * @return {?Node}\n     */\n    ViewCache.prototype.getCompleteEventSnap = function () {\n        return this.eventCache_.isFullyInitialized()\n            ? this.eventCache_.getNode()\n            : null;\n    };\n    /**\n     * @return {!CacheNode}\n     */\n    ViewCache.prototype.getServerCache = function () {\n        return this.serverCache_;\n    };\n    /**\n     * @return {?Node}\n     */\n    ViewCache.prototype.getCompleteServerSnap = function () {\n        return this.serverCache_.isFullyInitialized()\n            ? this.serverCache_.getNode()\n            : null;\n    };\n    /**\n     * @const\n     * @type {ViewCache}\n     */\n    ViewCache.Empty = new ViewCache(new CacheNode_1.CacheNode(ChildrenNode_1.ChildrenNode.EMPTY_NODE, \n    /*fullyInitialized=*/ false, \n    /*filtered=*/ false), new CacheNode_1.CacheNode(ChildrenNode_1.ChildrenNode.EMPTY_NODE, \n    /*fullyInitialized=*/ false, \n    /*filtered=*/ false));\n    return ViewCache;\n}());\nexports.ViewCache = ViewCache;\n\n//# sourceMappingURL=ViewCache.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/view/ViewCache.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = require(\"@firebase/util\");\n/**\n * Returns the delta from the previous call to get stats.\n *\n * @param collection_ The collection to \"listen\" to.\n * @constructor\n */\nvar StatsListener = /** @class */ (function () {\n    function StatsListener(collection_) {\n        this.collection_ = collection_;\n        this.last_ = null;\n    }\n    StatsListener.prototype.get = function () {\n        var newStats = this.collection_.get();\n        var delta = util_1.clone(newStats);\n        if (this.last_) {\n            util_1.forEach(this.last_, function (stat, value) {\n                delta[stat] = delta[stat] - value;\n            });\n        }\n        this.last_ = newStats;\n        return delta;\n    };\n    return StatsListener;\n}());\nexports.StatsListener = StatsListener;\n\n//# sourceMappingURL=StatsListener.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/stats/StatsListener.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nvar __extends = (this && this.__extends) || (function () {\n    var extendStatics = Object.setPrototypeOf ||\n        ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n        function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };\n    return function (d, b) {\n        extendStatics(d, b);\n        function __() { this.constructor = d; }\n        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n    };\n})();\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar app_1 = require(\"@firebase/app\");\nvar util_1 = require(\"@firebase/util\");\nvar util_2 = require(\"@firebase/util\");\nvar util_3 = require(\"@firebase/util\");\nvar util_4 = require(\"./util/util\");\nvar Path_1 = require(\"./util/Path\");\nvar VisibilityMonitor_1 = require(\"./util/VisibilityMonitor\");\nvar OnlineMonitor_1 = require(\"./util/OnlineMonitor\");\nvar util_5 = require(\"@firebase/util\");\nvar Connection_1 = require(\"../realtime/Connection\");\nvar util_6 = require(\"@firebase/util\");\nvar util_7 = require(\"@firebase/util\");\nvar ServerActions_1 = require(\"./ServerActions\");\nvar RECONNECT_MIN_DELAY = 1000;\nvar RECONNECT_MAX_DELAY_DEFAULT = 60 * 5 * 1000; // 5 minutes in milliseconds (Case: 1858)\nvar RECONNECT_MAX_DELAY_FOR_ADMINS = 30 * 1000; // 30 seconds for admin clients (likely to be a backend server)\nvar RECONNECT_DELAY_MULTIPLIER = 1.3;\nvar RECONNECT_DELAY_RESET_TIMEOUT = 30000; // Reset delay back to MIN_DELAY after being connected for 30sec.\nvar SERVER_KILL_INTERRUPT_REASON = 'server_kill';\n// If auth fails repeatedly, we'll assume something is wrong and log a warning / back off.\nvar INVALID_AUTH_TOKEN_THRESHOLD = 3;\n/**\n * Firebase connection.  Abstracts wire protocol and handles reconnecting.\n *\n * NOTE: All JSON objects sent to the realtime connection must have property names enclosed\n * in quotes to make sure the closure compiler does not minify them.\n */\nvar PersistentConnection = /** @class */ (function (_super) {\n    __extends(PersistentConnection, _super);\n    /**\n     * @implements {ServerActions}\n     * @param {!RepoInfo} repoInfo_ Data about the namespace we are connecting to\n     * @param {function(string, *, boolean, ?number)} onDataUpdate_ A callback for new data from the server\n     * @param onConnectStatus_\n     * @param onServerInfoUpdate_\n     * @param authTokenProvider_\n     * @param authOverride_\n     */\n    function PersistentConnection(repoInfo_, onDataUpdate_, onConnectStatus_, onServerInfoUpdate_, authTokenProvider_, authOverride_) {\n        var _this = _super.call(this) || this;\n        _this.repoInfo_ = repoInfo_;\n        _this.onDataUpdate_ = onDataUpdate_;\n        _this.onConnectStatus_ = onConnectStatus_;\n        _this.onServerInfoUpdate_ = onServerInfoUpdate_;\n        _this.authTokenProvider_ = authTokenProvider_;\n        _this.authOverride_ = authOverride_;\n        // Used for diagnostic logging.\n        _this.id = PersistentConnection.nextPersistentConnectionId_++;\n        _this.log_ = util_4.logWrapper('p:' + _this.id + ':');\n        /** @private {Object} */\n        _this.interruptReasons_ = {};\n        _this.listens_ = {};\n        _this.outstandingPuts_ = [];\n        _this.outstandingPutCount_ = 0;\n        _this.onDisconnectRequestQueue_ = [];\n        _this.connected_ = false;\n        _this.reconnectDelay_ = RECONNECT_MIN_DELAY;\n        _this.maxReconnectDelay_ = RECONNECT_MAX_DELAY_DEFAULT;\n        _this.securityDebugCallback_ = null;\n        _this.lastSessionId = null;\n        /** @private {number|null} */\n        _this.establishConnectionTimer_ = null;\n        /** @private {boolean} */\n        _this.visible_ = false;\n        // Before we get connected, we keep a queue of pending messages to send.\n        _this.requestCBHash_ = {};\n        _this.requestNumber_ = 0;\n        /** @private {?{\n         *   sendRequest(Object),\n         *   close()\n         * }} */\n        _this.realtime_ = null;\n        /** @private {string|null} */\n        _this.authToken_ = null;\n        _this.forceTokenRefresh_ = false;\n        _this.invalidAuthTokenCount_ = 0;\n        _this.firstConnection_ = true;\n        _this.lastConnectionAttemptTime_ = null;\n        _this.lastConnectionEstablishedTime_ = null;\n        if (authOverride_ && !util_7.isNodeSdk()) {\n            throw new Error('Auth override specified in options, but not supported on non Node.js platforms');\n        }\n        _this.scheduleConnect_(0);\n        VisibilityMonitor_1.VisibilityMonitor.getInstance().on('visible', _this.onVisible_, _this);\n        if (repoInfo_.host.indexOf('fblocal') === -1) {\n            OnlineMonitor_1.OnlineMonitor.getInstance().on('online', _this.onOnline_, _this);\n        }\n        return _this;\n    }\n    /**\n     * @param {!string} action\n     * @param {*} body\n     * @param {function(*)=} onResponse\n     * @protected\n     */\n    PersistentConnection.prototype.sendRequest = function (action, body, onResponse) {\n        var curReqNum = ++this.requestNumber_;\n        var msg = { r: curReqNum, a: action, b: body };\n        this.log_(util_2.stringify(msg));\n        util_3.assert(this.connected_, \"sendRequest call when we're not connected not allowed.\");\n        this.realtime_.sendRequest(msg);\n        if (onResponse) {\n            this.requestCBHash_[curReqNum] = onResponse;\n        }\n    };\n    /**\n     * @inheritDoc\n     */\n    PersistentConnection.prototype.listen = function (query, currentHashFn, tag, onComplete) {\n        var queryId = query.queryIdentifier();\n        var pathString = query.path.toString();\n        this.log_('Listen called for ' + pathString + ' ' + queryId);\n        this.listens_[pathString] = this.listens_[pathString] || {};\n        util_3.assert(query.getQueryParams().isDefault() ||\n            !query.getQueryParams().loadsAllData(), 'listen() called for non-default but complete query');\n        util_3.assert(!this.listens_[pathString][queryId], 'listen() called twice for same path/queryId.');\n        var listenSpec = {\n            onComplete: onComplete,\n            hashFn: currentHashFn,\n            query: query,\n            tag: tag\n        };\n        this.listens_[pathString][queryId] = listenSpec;\n        if (this.connected_) {\n            this.sendListen_(listenSpec);\n        }\n    };\n    /**\n     * @param {!{onComplete(),\n     *           hashFn():!string,\n     *           query: !Query,\n     *           tag: ?number}} listenSpec\n     * @private\n     */\n    PersistentConnection.prototype.sendListen_ = function (listenSpec) {\n        var _this = this;\n        var query = listenSpec.query;\n        var pathString = query.path.toString();\n        var queryId = query.queryIdentifier();\n        this.log_('Listen on ' + pathString + ' for ' + queryId);\n        var req = { /*path*/ p: pathString };\n        var action = 'q';\n        // Only bother to send query if it's non-default.\n        if (listenSpec.tag) {\n            req['q'] = query.queryObject();\n            req['t'] = listenSpec.tag;\n        }\n        req['h'] = listenSpec.hashFn();\n        this.sendRequest(action, req, function (message) {\n            var payload = message['d'];\n            var status = message['s'];\n            // print warnings in any case...\n            PersistentConnection.warnOnListenWarnings_(payload, query);\n            var currentListenSpec = _this.listens_[pathString] && _this.listens_[pathString][queryId];\n            // only trigger actions if the listen hasn't been removed and readded\n            if (currentListenSpec === listenSpec) {\n                _this.log_('listen response', message);\n                if (status !== 'ok') {\n                    _this.removeListen_(pathString, queryId);\n                }\n                if (listenSpec.onComplete) {\n                    listenSpec.onComplete(status, payload);\n                }\n            }\n        });\n    };\n    /**\n     * @param {*} payload\n     * @param {!Query} query\n     * @private\n     */\n    PersistentConnection.warnOnListenWarnings_ = function (payload, query) {\n        if (payload && typeof payload === 'object' && util_1.contains(payload, 'w')) {\n            var warnings = util_1.safeGet(payload, 'w');\n            if (Array.isArray(warnings) && ~warnings.indexOf('no_index')) {\n                var indexSpec = '\".indexOn\": \"' +\n                    query\n                        .getQueryParams()\n                        .getIndex()\n                        .toString() +\n                    '\"';\n                var indexPath = query.path.toString();\n                util_4.warn(\"Using an unspecified index. Your data will be downloaded and \" +\n                    (\"filtered on the client. Consider adding \" + indexSpec + \" at \") +\n                    (indexPath + \" to your security rules for better performance.\"));\n            }\n        }\n    };\n    /**\n     * @inheritDoc\n     */\n    PersistentConnection.prototype.refreshAuthToken = function (token) {\n        this.authToken_ = token;\n        this.log_('Auth token refreshed');\n        if (this.authToken_) {\n            this.tryAuth();\n        }\n        else {\n            //If we're connected we want to let the server know to unauthenticate us. If we're not connected, simply delete\n            //the credential so we dont become authenticated next time we connect.\n            if (this.connected_) {\n                this.sendRequest('unauth', {}, function () { });\n            }\n        }\n        this.reduceReconnectDelayIfAdminCredential_(token);\n    };\n    /**\n     * @param {!string} credential\n     * @private\n     */\n    PersistentConnection.prototype.reduceReconnectDelayIfAdminCredential_ = function (credential) {\n        // NOTE: This isn't intended to be bulletproof (a malicious developer can always just modify the client).\n        // Additionally, we don't bother resetting the max delay back to the default if auth fails / expires.\n        var isFirebaseSecret = credential && credential.length === 40;\n        if (isFirebaseSecret || util_5.isAdmin(credential)) {\n            this.log_('Admin auth credential detected.  Reducing max reconnect time.');\n            this.maxReconnectDelay_ = RECONNECT_MAX_DELAY_FOR_ADMINS;\n        }\n    };\n    /**\n     * Attempts to authenticate with the given credentials. If the authentication attempt fails, it's triggered like\n     * a auth revoked (the connection is closed).\n     */\n    PersistentConnection.prototype.tryAuth = function () {\n        var _this = this;\n        if (this.connected_ && this.authToken_) {\n            var token_1 = this.authToken_;\n            var authMethod = util_5.isValidFormat(token_1) ? 'auth' : 'gauth';\n            var requestData = { cred: token_1 };\n            if (this.authOverride_ === null) {\n                requestData['noauth'] = true;\n            }\n            else if (typeof this.authOverride_ === 'object') {\n                requestData['authvar'] = this.authOverride_;\n            }\n            this.sendRequest(authMethod, requestData, function (res) {\n                var status = res['s'];\n                var data = res['d'] || 'error';\n                if (_this.authToken_ === token_1) {\n                    if (status === 'ok') {\n                        _this.invalidAuthTokenCount_ = 0;\n                    }\n                    else {\n                        // Triggers reconnect and force refresh for auth token\n                        _this.onAuthRevoked_(status, data);\n                    }\n                }\n            });\n        }\n    };\n    /**\n     * @inheritDoc\n     */\n    PersistentConnection.prototype.unlisten = function (query, tag) {\n        var pathString = query.path.toString();\n        var queryId = query.queryIdentifier();\n        this.log_('Unlisten called for ' + pathString + ' ' + queryId);\n        util_3.assert(query.getQueryParams().isDefault() ||\n            !query.getQueryParams().loadsAllData(), 'unlisten() called for non-default but complete query');\n        var listen = this.removeListen_(pathString, queryId);\n        if (listen && this.connected_) {\n            this.sendUnlisten_(pathString, queryId, query.queryObject(), tag);\n        }\n    };\n    PersistentConnection.prototype.sendUnlisten_ = function (pathString, queryId, queryObj, tag) {\n        this.log_('Unlisten on ' + pathString + ' for ' + queryId);\n        var req = { /*path*/ p: pathString };\n        var action = 'n';\n        // Only bother sending queryId if it's non-default.\n        if (tag) {\n            req['q'] = queryObj;\n            req['t'] = tag;\n        }\n        this.sendRequest(action, req);\n    };\n    /**\n     * @inheritDoc\n     */\n    PersistentConnection.prototype.onDisconnectPut = function (pathString, data, onComplete) {\n        if (this.connected_) {\n            this.sendOnDisconnect_('o', pathString, data, onComplete);\n        }\n        else {\n            this.onDisconnectRequestQueue_.push({\n                pathString: pathString,\n                action: 'o',\n                data: data,\n                onComplete: onComplete\n            });\n        }\n    };\n    /**\n     * @inheritDoc\n     */\n    PersistentConnection.prototype.onDisconnectMerge = function (pathString, data, onComplete) {\n        if (this.connected_) {\n            this.sendOnDisconnect_('om', pathString, data, onComplete);\n        }\n        else {\n            this.onDisconnectRequestQueue_.push({\n                pathString: pathString,\n                action: 'om',\n                data: data,\n                onComplete: onComplete\n            });\n        }\n    };\n    /**\n     * @inheritDoc\n     */\n    PersistentConnection.prototype.onDisconnectCancel = function (pathString, onComplete) {\n        if (this.connected_) {\n            this.sendOnDisconnect_('oc', pathString, null, onComplete);\n        }\n        else {\n            this.onDisconnectRequestQueue_.push({\n                pathString: pathString,\n                action: 'oc',\n                data: null,\n                onComplete: onComplete\n            });\n        }\n    };\n    PersistentConnection.prototype.sendOnDisconnect_ = function (action, pathString, data, onComplete) {\n        var request = { /*path*/ p: pathString, /*data*/ d: data };\n        this.log_('onDisconnect ' + action, request);\n        this.sendRequest(action, request, function (response) {\n            if (onComplete) {\n                setTimeout(function () {\n                    onComplete(response['s'], response['d']);\n                }, Math.floor(0));\n            }\n        });\n    };\n    /**\n     * @inheritDoc\n     */\n    PersistentConnection.prototype.put = function (pathString, data, onComplete, hash) {\n        this.putInternal('p', pathString, data, onComplete, hash);\n    };\n    /**\n     * @inheritDoc\n     */\n    PersistentConnection.prototype.merge = function (pathString, data, onComplete, hash) {\n        this.putInternal('m', pathString, data, onComplete, hash);\n    };\n    PersistentConnection.prototype.putInternal = function (action, pathString, data, onComplete, hash) {\n        var request = {\n            /*path*/ p: pathString,\n            /*data*/ d: data\n        };\n        if (hash !== undefined)\n            request['h'] = hash;\n        // TODO: Only keep track of the most recent put for a given path?\n        this.outstandingPuts_.push({\n            action: action,\n            request: request,\n            onComplete: onComplete\n        });\n        this.outstandingPutCount_++;\n        var index = this.outstandingPuts_.length - 1;\n        if (this.connected_) {\n            this.sendPut_(index);\n        }\n        else {\n            this.log_('Buffering put: ' + pathString);\n        }\n    };\n    PersistentConnection.prototype.sendPut_ = function (index) {\n        var _this = this;\n        var action = this.outstandingPuts_[index].action;\n        var request = this.outstandingPuts_[index].request;\n        var onComplete = this.outstandingPuts_[index].onComplete;\n        this.outstandingPuts_[index].queued = this.connected_;\n        this.sendRequest(action, request, function (message) {\n            _this.log_(action + ' response', message);\n            delete _this.outstandingPuts_[index];\n            _this.outstandingPutCount_--;\n            // Clean up array occasionally.\n            if (_this.outstandingPutCount_ === 0) {\n                _this.outstandingPuts_ = [];\n            }\n            if (onComplete)\n                onComplete(message['s'], message['d']);\n        });\n    };\n    /**\n     * @inheritDoc\n     */\n    PersistentConnection.prototype.reportStats = function (stats) {\n        var _this = this;\n        // If we're not connected, we just drop the stats.\n        if (this.connected_) {\n            var request = { /*counters*/ c: stats };\n            this.log_('reportStats', request);\n            this.sendRequest(/*stats*/ 's', request, function (result) {\n                var status = result['s'];\n                if (status !== 'ok') {\n                    var errorReason = result['d'];\n                    _this.log_('reportStats', 'Error sending stats: ' + errorReason);\n                }\n            });\n        }\n    };\n    /**\n     * @param {*} message\n     * @private\n     */\n    PersistentConnection.prototype.onDataMessage_ = function (message) {\n        if ('r' in message) {\n            // this is a response\n            this.log_('from server: ' + util_2.stringify(message));\n            var reqNum = message['r'];\n            var onResponse = this.requestCBHash_[reqNum];\n            if (onResponse) {\n                delete this.requestCBHash_[reqNum];\n                onResponse(message['b']);\n            }\n        }\n        else if ('error' in message) {\n            throw 'A server-side error has occurred: ' + message['error'];\n        }\n        else if ('a' in message) {\n            // a and b are action and body, respectively\n            this.onDataPush_(message['a'], message['b']);\n        }\n    };\n    PersistentConnection.prototype.onDataPush_ = function (action, body) {\n        this.log_('handleServerMessage', action, body);\n        if (action === 'd')\n            this.onDataUpdate_(body['p'], body['d'], \n            /*isMerge*/ false, body['t']);\n        else if (action === 'm')\n            this.onDataUpdate_(body['p'], body['d'], \n            /*isMerge=*/ true, body['t']);\n        else if (action === 'c')\n            this.onListenRevoked_(body['p'], body['q']);\n        else if (action === 'ac')\n            this.onAuthRevoked_(body['s'], body['d']);\n        else if (action === 'sd')\n            this.onSecurityDebugPacket_(body);\n        else\n            util_4.error('Unrecognized action received from server: ' +\n                util_2.stringify(action) +\n                '\\nAre you using the latest client?');\n    };\n    PersistentConnection.prototype.onReady_ = function (timestamp, sessionId) {\n        this.log_('connection ready');\n        this.connected_ = true;\n        this.lastConnectionEstablishedTime_ = new Date().getTime();\n        this.handleTimestamp_(timestamp);\n        this.lastSessionId = sessionId;\n        if (this.firstConnection_) {\n            this.sendConnectStats_();\n        }\n        this.restoreState_();\n        this.firstConnection_ = false;\n        this.onConnectStatus_(true);\n    };\n    PersistentConnection.prototype.scheduleConnect_ = function (timeout) {\n        var _this = this;\n        util_3.assert(!this.realtime_, \"Scheduling a connect when we're already connected/ing?\");\n        if (this.establishConnectionTimer_) {\n            clearTimeout(this.establishConnectionTimer_);\n        }\n        // NOTE: Even when timeout is 0, it's important to do a setTimeout to work around an infuriating \"Security Error\" in\n        // Firefox when trying to write to our long-polling iframe in some scenarios (e.g. Forge or our unit tests).\n        this.establishConnectionTimer_ = setTimeout(function () {\n            _this.establishConnectionTimer_ = null;\n            _this.establishConnection_();\n        }, Math.floor(timeout));\n    };\n    /**\n     * @param {boolean} visible\n     * @private\n     */\n    PersistentConnection.prototype.onVisible_ = function (visible) {\n        // NOTE: Tabbing away and back to a window will defeat our reconnect backoff, but I think that's fine.\n        if (visible &&\n            !this.visible_ &&\n            this.reconnectDelay_ === this.maxReconnectDelay_) {\n            this.log_('Window became visible.  Reducing delay.');\n            this.reconnectDelay_ = RECONNECT_MIN_DELAY;\n            if (!this.realtime_) {\n                this.scheduleConnect_(0);\n            }\n        }\n        this.visible_ = visible;\n    };\n    PersistentConnection.prototype.onOnline_ = function (online) {\n        if (online) {\n            this.log_('Browser went online.');\n            this.reconnectDelay_ = RECONNECT_MIN_DELAY;\n            if (!this.realtime_) {\n                this.scheduleConnect_(0);\n            }\n        }\n        else {\n            this.log_('Browser went offline.  Killing connection.');\n            if (this.realtime_) {\n                this.realtime_.close();\n            }\n        }\n    };\n    PersistentConnection.prototype.onRealtimeDisconnect_ = function () {\n        this.log_('data client disconnected');\n        this.connected_ = false;\n        this.realtime_ = null;\n        // Since we don't know if our sent transactions succeeded or not, we need to cancel them.\n        this.cancelSentTransactions_();\n        // Clear out the pending requests.\n        this.requestCBHash_ = {};\n        if (this.shouldReconnect_()) {\n            if (!this.visible_) {\n                this.log_(\"Window isn't visible.  Delaying reconnect.\");\n                this.reconnectDelay_ = this.maxReconnectDelay_;\n                this.lastConnectionAttemptTime_ = new Date().getTime();\n            }\n            else if (this.lastConnectionEstablishedTime_) {\n                // If we've been connected long enough, reset reconnect delay to minimum.\n                var timeSinceLastConnectSucceeded = new Date().getTime() - this.lastConnectionEstablishedTime_;\n                if (timeSinceLastConnectSucceeded > RECONNECT_DELAY_RESET_TIMEOUT)\n                    this.reconnectDelay_ = RECONNECT_MIN_DELAY;\n                this.lastConnectionEstablishedTime_ = null;\n            }\n            var timeSinceLastConnectAttempt = new Date().getTime() - this.lastConnectionAttemptTime_;\n            var reconnectDelay = Math.max(0, this.reconnectDelay_ - timeSinceLastConnectAttempt);\n            reconnectDelay = Math.random() * reconnectDelay;\n            this.log_('Trying to reconnect in ' + reconnectDelay + 'ms');\n            this.scheduleConnect_(reconnectDelay);\n            // Adjust reconnect delay for next time.\n            this.reconnectDelay_ = Math.min(this.maxReconnectDelay_, this.reconnectDelay_ * RECONNECT_DELAY_MULTIPLIER);\n        }\n        this.onConnectStatus_(false);\n    };\n    PersistentConnection.prototype.establishConnection_ = function () {\n        if (this.shouldReconnect_()) {\n            this.log_('Making a connection attempt');\n            this.lastConnectionAttemptTime_ = new Date().getTime();\n            this.lastConnectionEstablishedTime_ = null;\n            var onDataMessage_1 = this.onDataMessage_.bind(this);\n            var onReady_1 = this.onReady_.bind(this);\n            var onDisconnect_1 = this.onRealtimeDisconnect_.bind(this);\n            var connId_1 = this.id + ':' + PersistentConnection.nextConnectionId_++;\n            var self_1 = this;\n            var lastSessionId_1 = this.lastSessionId;\n            var canceled_1 = false;\n            var connection_1 = null;\n            var closeFn_1 = function () {\n                if (connection_1) {\n                    connection_1.close();\n                }\n                else {\n                    canceled_1 = true;\n                    onDisconnect_1();\n                }\n            };\n            var sendRequestFn = function (msg) {\n                util_3.assert(connection_1, \"sendRequest call when we're not connected not allowed.\");\n                connection_1.sendRequest(msg);\n            };\n            this.realtime_ = {\n                close: closeFn_1,\n                sendRequest: sendRequestFn\n            };\n            var forceRefresh = this.forceTokenRefresh_;\n            this.forceTokenRefresh_ = false;\n            // First fetch auth token, and establish connection after fetching the token was successful\n            this.authTokenProvider_\n                .getToken(forceRefresh)\n                .then(function (result) {\n                if (!canceled_1) {\n                    util_4.log('getToken() completed. Creating connection.');\n                    self_1.authToken_ = result && result.accessToken;\n                    connection_1 = new Connection_1.Connection(connId_1, self_1.repoInfo_, onDataMessage_1, onReady_1, onDisconnect_1, \n                    /* onKill= */ function (reason) {\n                        util_4.warn(reason + ' (' + self_1.repoInfo_.toString() + ')');\n                        self_1.interrupt(SERVER_KILL_INTERRUPT_REASON);\n                    }, lastSessionId_1);\n                }\n                else {\n                    util_4.log('getToken() completed but was canceled');\n                }\n            })\n                .then(null, function (error) {\n                self_1.log_('Failed to get token: ' + error);\n                if (!canceled_1) {\n                    if (util_6.CONSTANTS.NODE_ADMIN) {\n                        // This may be a critical error for the Admin Node.js SDK, so log a warning.\n                        // But getToken() may also just have temporarily failed, so we still want to\n                        // continue retrying.\n                        util_4.warn(error);\n                    }\n                    closeFn_1();\n                }\n            });\n        }\n    };\n    /**\n     * @param {string} reason\n     */\n    PersistentConnection.prototype.interrupt = function (reason) {\n        util_4.log('Interrupting connection for reason: ' + reason);\n        this.interruptReasons_[reason] = true;\n        if (this.realtime_) {\n            this.realtime_.close();\n        }\n        else {\n            if (this.establishConnectionTimer_) {\n                clearTimeout(this.establishConnectionTimer_);\n                this.establishConnectionTimer_ = null;\n            }\n            if (this.connected_) {\n                this.onRealtimeDisconnect_();\n            }\n        }\n    };\n    /**\n     * @param {string} reason\n     */\n    PersistentConnection.prototype.resume = function (reason) {\n        util_4.log('Resuming connection for reason: ' + reason);\n        delete this.interruptReasons_[reason];\n        if (util_1.isEmpty(this.interruptReasons_)) {\n            this.reconnectDelay_ = RECONNECT_MIN_DELAY;\n            if (!this.realtime_) {\n                this.scheduleConnect_(0);\n            }\n        }\n    };\n    PersistentConnection.prototype.handleTimestamp_ = function (timestamp) {\n        var delta = timestamp - new Date().getTime();\n        this.onServerInfoUpdate_({ serverTimeOffset: delta });\n    };\n    PersistentConnection.prototype.cancelSentTransactions_ = function () {\n        for (var i = 0; i < this.outstandingPuts_.length; i++) {\n            var put = this.outstandingPuts_[i];\n            if (put && /*hash*/ 'h' in put.request && put.queued) {\n                if (put.onComplete)\n                    put.onComplete('disconnect');\n                delete this.outstandingPuts_[i];\n                this.outstandingPutCount_--;\n            }\n        }\n        // Clean up array occasionally.\n        if (this.outstandingPutCount_ === 0)\n            this.outstandingPuts_ = [];\n    };\n    /**\n     * @param {!string} pathString\n     * @param {Array.<*>=} query\n     * @private\n     */\n    PersistentConnection.prototype.onListenRevoked_ = function (pathString, query) {\n        // Remove the listen and manufacture a \"permission_denied\" error for the failed listen.\n        var queryId;\n        if (!query) {\n            queryId = 'default';\n        }\n        else {\n            queryId = query.map(function (q) { return util_4.ObjectToUniqueKey(q); }).join('$');\n        }\n        var listen = this.removeListen_(pathString, queryId);\n        if (listen && listen.onComplete)\n            listen.onComplete('permission_denied');\n    };\n    /**\n     * @param {!string} pathString\n     * @param {!string} queryId\n     * @return {{queries:Array.<Query>, onComplete:function(string)}}\n     * @private\n     */\n    PersistentConnection.prototype.removeListen_ = function (pathString, queryId) {\n        var normalizedPathString = new Path_1.Path(pathString).toString(); // normalize path.\n        var listen;\n        if (this.listens_[normalizedPathString] !== undefined) {\n            listen = this.listens_[normalizedPathString][queryId];\n            delete this.listens_[normalizedPathString][queryId];\n            if (util_1.getCount(this.listens_[normalizedPathString]) === 0) {\n                delete this.listens_[normalizedPathString];\n            }\n        }\n        else {\n            // all listens for this path has already been removed\n            listen = undefined;\n        }\n        return listen;\n    };\n    PersistentConnection.prototype.onAuthRevoked_ = function (statusCode, explanation) {\n        util_4.log('Auth token revoked: ' + statusCode + '/' + explanation);\n        this.authToken_ = null;\n        this.forceTokenRefresh_ = true;\n        this.realtime_.close();\n        if (statusCode === 'invalid_token' || statusCode === 'permission_denied') {\n            // We'll wait a couple times before logging the warning / increasing the\n            // retry period since oauth tokens will report as \"invalid\" if they're\n            // just expired. Plus there may be transient issues that resolve themselves.\n            this.invalidAuthTokenCount_++;\n            if (this.invalidAuthTokenCount_ >= INVALID_AUTH_TOKEN_THRESHOLD) {\n                // Set a long reconnect delay because recovery is unlikely\n                this.reconnectDelay_ = RECONNECT_MAX_DELAY_FOR_ADMINS;\n                // Notify the auth token provider that the token is invalid, which will log\n                // a warning\n                this.authTokenProvider_.notifyForInvalidToken();\n            }\n        }\n    };\n    PersistentConnection.prototype.onSecurityDebugPacket_ = function (body) {\n        if (this.securityDebugCallback_) {\n            this.securityDebugCallback_(body);\n        }\n        else {\n            if ('msg' in body && typeof console !== 'undefined') {\n                console.log('FIREBASE: ' + body['msg'].replace('\\n', '\\nFIREBASE: '));\n            }\n        }\n    };\n    PersistentConnection.prototype.restoreState_ = function () {\n        var _this = this;\n        //Re-authenticate ourselves if we have a credential stored.\n        this.tryAuth();\n        // Puts depend on having received the corresponding data update from the server before they complete, so we must\n        // make sure to send listens before puts.\n        util_1.forEach(this.listens_, function (pathString, queries) {\n            util_1.forEach(queries, function (key, listenSpec) {\n                _this.sendListen_(listenSpec);\n            });\n        });\n        for (var i = 0; i < this.outstandingPuts_.length; i++) {\n            if (this.outstandingPuts_[i])\n                this.sendPut_(i);\n        }\n        while (this.onDisconnectRequestQueue_.length) {\n            var request = this.onDisconnectRequestQueue_.shift();\n            this.sendOnDisconnect_(request.action, request.pathString, request.data, request.onComplete);\n        }\n    };\n    /**\n     * Sends client stats for first connection\n     * @private\n     */\n    PersistentConnection.prototype.sendConnectStats_ = function () {\n        var stats = {};\n        var clientName = 'js';\n        if (util_6.CONSTANTS.NODE_ADMIN) {\n            clientName = 'admin_node';\n        }\n        else if (util_6.CONSTANTS.NODE_CLIENT) {\n            clientName = 'node';\n        }\n        stats['sdk.' + clientName + '.' + app_1.default.SDK_VERSION.replace(/\\./g, '-')] = 1;\n        if (util_7.isMobileCordova()) {\n            stats['framework.cordova'] = 1;\n        }\n        else if (util_7.isReactNative()) {\n            stats['framework.reactnative'] = 1;\n        }\n        this.reportStats(stats);\n    };\n    /**\n     * @return {boolean}\n     * @private\n     */\n    PersistentConnection.prototype.shouldReconnect_ = function () {\n        var online = OnlineMonitor_1.OnlineMonitor.getInstance().currentlyOnline();\n        return util_1.isEmpty(this.interruptReasons_) && online;\n    };\n    /**\n     * @private\n     */\n    PersistentConnection.nextPersistentConnectionId_ = 0;\n    /**\n     * Counter for number of connections created. Mainly used for tagging in the logs\n     * @type {number}\n     * @private\n     */\n    PersistentConnection.nextConnectionId_ = 0;\n    return PersistentConnection;\n}(ServerActions_1.ServerActions));\nexports.PersistentConnection = PersistentConnection;\n\n//# sourceMappingURL=PersistentConnection.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/PersistentConnection.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = require(\"@firebase/util\");\n/**\n * Base class to be used if you want to emit events. Call the constructor with\n * the set of allowed event names.\n */\nvar EventEmitter = /** @class */ (function () {\n    /**\n     * @param {!Array.<string>} allowedEvents_\n     */\n    function EventEmitter(allowedEvents_) {\n        this.allowedEvents_ = allowedEvents_;\n        this.listeners_ = {};\n        util_1.assert(Array.isArray(allowedEvents_) && allowedEvents_.length > 0, 'Requires a non-empty array');\n    }\n    /**\n     * To be called by derived classes to trigger events.\n     * @param {!string} eventType\n     * @param {...*} var_args\n     */\n    EventEmitter.prototype.trigger = function (eventType) {\n        var var_args = [];\n        for (var _i = 1; _i < arguments.length; _i++) {\n            var_args[_i - 1] = arguments[_i];\n        }\n        if (Array.isArray(this.listeners_[eventType])) {\n            // Clone the list, since callbacks could add/remove listeners.\n            var listeners = this.listeners_[eventType].slice();\n            for (var i = 0; i < listeners.length; i++) {\n                listeners[i].callback.apply(listeners[i].context, var_args);\n            }\n        }\n    };\n    EventEmitter.prototype.on = function (eventType, callback, context) {\n        this.validateEventType_(eventType);\n        this.listeners_[eventType] = this.listeners_[eventType] || [];\n        this.listeners_[eventType].push({ callback: callback, context: context });\n        var eventData = this.getInitialEvent(eventType);\n        if (eventData) {\n            callback.apply(context, eventData);\n        }\n    };\n    EventEmitter.prototype.off = function (eventType, callback, context) {\n        this.validateEventType_(eventType);\n        var listeners = this.listeners_[eventType] || [];\n        for (var i = 0; i < listeners.length; i++) {\n            if (listeners[i].callback === callback &&\n                (!context || context === listeners[i].context)) {\n                listeners.splice(i, 1);\n                return;\n            }\n        }\n    };\n    EventEmitter.prototype.validateEventType_ = function (eventType) {\n        util_1.assert(this.allowedEvents_.find(function (et) {\n            return et === eventType;\n        }), 'Unknown event: ' + eventType);\n    };\n    return EventEmitter;\n}());\nexports.EventEmitter = EventEmitter;\n\n//# sourceMappingURL=EventEmitter.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/util/EventEmitter.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = require(\"../core/util/util\");\nvar storage_1 = require(\"../core/storage/storage\");\nvar Constants_1 = require(\"./Constants\");\nvar TransportManager_1 = require(\"./TransportManager\");\n// Abort upgrade attempt if it takes longer than 60s.\nvar UPGRADE_TIMEOUT = 60000;\n// For some transports (WebSockets), we need to \"validate\" the transport by exchanging a few requests and responses.\n// If we haven't sent enough requests within 5s, we'll start sending noop ping requests.\nvar DELAY_BEFORE_SENDING_EXTRA_REQUESTS = 5000;\n// If the initial data sent triggers a lot of bandwidth (i.e. it's a large put or a listen for a large amount of data)\n// then we may not be able to exchange our ping/pong requests within the healthy timeout.  So if we reach the timeout\n// but we've sent/received enough bytes, we don't cancel the connection.\nvar BYTES_SENT_HEALTHY_OVERRIDE = 10 * 1024;\nvar BYTES_RECEIVED_HEALTHY_OVERRIDE = 100 * 1024;\nvar MESSAGE_TYPE = 't';\nvar MESSAGE_DATA = 'd';\nvar CONTROL_SHUTDOWN = 's';\nvar CONTROL_RESET = 'r';\nvar CONTROL_ERROR = 'e';\nvar CONTROL_PONG = 'o';\nvar SWITCH_ACK = 'a';\nvar END_TRANSMISSION = 'n';\nvar PING = 'p';\nvar SERVER_HELLO = 'h';\n/**\n * Creates a new real-time connection to the server using whichever method works\n * best in the current browser.\n *\n * @constructor\n */\nvar Connection = /** @class */ (function () {\n    /**\n     * @param {!string} id - an id for this connection\n     * @param {!RepoInfo} repoInfo_ - the info for the endpoint to connect to\n     * @param {function(Object)} onMessage_ - the callback to be triggered when a server-push message arrives\n     * @param {function(number, string)} onReady_ - the callback to be triggered when this connection is ready to send messages.\n     * @param {function()} onDisconnect_ - the callback to be triggered when a connection was lost\n     * @param {function(string)} onKill_ - the callback to be triggered when this connection has permanently shut down.\n     * @param {string=} lastSessionId - last session id in persistent connection. is used to clean up old session in real-time server\n     */\n    function Connection(id, repoInfo_, onMessage_, onReady_, onDisconnect_, onKill_, lastSessionId) {\n        this.id = id;\n        this.repoInfo_ = repoInfo_;\n        this.onMessage_ = onMessage_;\n        this.onReady_ = onReady_;\n        this.onDisconnect_ = onDisconnect_;\n        this.onKill_ = onKill_;\n        this.lastSessionId = lastSessionId;\n        this.connectionCount = 0;\n        this.pendingDataMessages = [];\n        this.state_ = 0 /* CONNECTING */;\n        this.log_ = util_1.logWrapper('c:' + this.id + ':');\n        this.transportManager_ = new TransportManager_1.TransportManager(repoInfo_);\n        this.log_('Connection created');\n        this.start_();\n    }\n    /**\n     * Starts a connection attempt\n     * @private\n     */\n    Connection.prototype.start_ = function () {\n        var _this = this;\n        var conn = this.transportManager_.initialTransport();\n        this.conn_ = new conn(this.nextTransportId_(), this.repoInfo_, undefined, this.lastSessionId);\n        // For certain transports (WebSockets), we need to send and receive several messages back and forth before we\n        // can consider the transport healthy.\n        this.primaryResponsesRequired_ = conn['responsesRequiredToBeHealthy'] || 0;\n        var onMessageReceived = this.connReceiver_(this.conn_);\n        var onConnectionLost = this.disconnReceiver_(this.conn_);\n        this.tx_ = this.conn_;\n        this.rx_ = this.conn_;\n        this.secondaryConn_ = null;\n        this.isHealthy_ = false;\n        /*\n         * Firefox doesn't like when code from one iframe tries to create another iframe by way of the parent frame.\n         * This can occur in the case of a redirect, i.e. we guessed wrong on what server to connect to and received a reset.\n         * Somehow, setTimeout seems to make this ok. That doesn't make sense from a security perspective, since you should\n         * still have the context of your originating frame.\n         */\n        setTimeout(function () {\n            // this.conn_ gets set to null in some of the tests. Check to make sure it still exists before using it\n            _this.conn_ && _this.conn_.open(onMessageReceived, onConnectionLost);\n        }, Math.floor(0));\n        var healthyTimeout_ms = conn['healthyTimeout'] || 0;\n        if (healthyTimeout_ms > 0) {\n            this.healthyTimeout_ = util_1.setTimeoutNonBlocking(function () {\n                _this.healthyTimeout_ = null;\n                if (!_this.isHealthy_) {\n                    if (_this.conn_ &&\n                        _this.conn_.bytesReceived > BYTES_RECEIVED_HEALTHY_OVERRIDE) {\n                        _this.log_('Connection exceeded healthy timeout but has received ' +\n                            _this.conn_.bytesReceived +\n                            ' bytes.  Marking connection healthy.');\n                        _this.isHealthy_ = true;\n                        _this.conn_.markConnectionHealthy();\n                    }\n                    else if (_this.conn_ &&\n                        _this.conn_.bytesSent > BYTES_SENT_HEALTHY_OVERRIDE) {\n                        _this.log_('Connection exceeded healthy timeout but has sent ' +\n                            _this.conn_.bytesSent +\n                            ' bytes.  Leaving connection alive.');\n                        // NOTE: We don't want to mark it healthy, since we have no guarantee that the bytes have made it to\n                        // the server.\n                    }\n                    else {\n                        _this.log_('Closing unhealthy connection after timeout.');\n                        _this.close();\n                    }\n                }\n            }, Math.floor(healthyTimeout_ms));\n        }\n    };\n    /**\n     * @return {!string}\n     * @private\n     */\n    Connection.prototype.nextTransportId_ = function () {\n        return 'c:' + this.id + ':' + this.connectionCount++;\n    };\n    Connection.prototype.disconnReceiver_ = function (conn) {\n        var _this = this;\n        return function (everConnected) {\n            if (conn === _this.conn_) {\n                _this.onConnectionLost_(everConnected);\n            }\n            else if (conn === _this.secondaryConn_) {\n                _this.log_('Secondary connection lost.');\n                _this.onSecondaryConnectionLost_();\n            }\n            else {\n                _this.log_('closing an old connection');\n            }\n        };\n    };\n    Connection.prototype.connReceiver_ = function (conn) {\n        var _this = this;\n        return function (message) {\n            if (_this.state_ != 2 /* DISCONNECTED */) {\n                if (conn === _this.rx_) {\n                    _this.onPrimaryMessageReceived_(message);\n                }\n                else if (conn === _this.secondaryConn_) {\n                    _this.onSecondaryMessageReceived_(message);\n                }\n                else {\n                    _this.log_('message on old connection');\n                }\n            }\n        };\n    };\n    /**\n     *\n     * @param {Object} dataMsg An arbitrary data message to be sent to the server\n     */\n    Connection.prototype.sendRequest = function (dataMsg) {\n        // wrap in a data message envelope and send it on\n        var msg = { t: 'd', d: dataMsg };\n        this.sendData_(msg);\n    };\n    Connection.prototype.tryCleanupConnection = function () {\n        if (this.tx_ === this.secondaryConn_ && this.rx_ === this.secondaryConn_) {\n            this.log_('cleaning up and promoting a connection: ' + this.secondaryConn_.connId);\n            this.conn_ = this.secondaryConn_;\n            this.secondaryConn_ = null;\n            // the server will shutdown the old connection\n        }\n    };\n    Connection.prototype.onSecondaryControl_ = function (controlData) {\n        if (MESSAGE_TYPE in controlData) {\n            var cmd = controlData[MESSAGE_TYPE];\n            if (cmd === SWITCH_ACK) {\n                this.upgradeIfSecondaryHealthy_();\n            }\n            else if (cmd === CONTROL_RESET) {\n                // Most likely the session wasn't valid. Abandon the switch attempt\n                this.log_('Got a reset on secondary, closing it');\n                this.secondaryConn_.close();\n                // If we were already using this connection for something, than we need to fully close\n                if (this.tx_ === this.secondaryConn_ ||\n                    this.rx_ === this.secondaryConn_) {\n                    this.close();\n                }\n            }\n            else if (cmd === CONTROL_PONG) {\n                this.log_('got pong on secondary.');\n                this.secondaryResponsesRequired_--;\n                this.upgradeIfSecondaryHealthy_();\n            }\n        }\n    };\n    Connection.prototype.onSecondaryMessageReceived_ = function (parsedData) {\n        var layer = util_1.requireKey('t', parsedData);\n        var data = util_1.requireKey('d', parsedData);\n        if (layer == 'c') {\n            this.onSecondaryControl_(data);\n        }\n        else if (layer == 'd') {\n            // got a data message, but we're still second connection. Need to buffer it up\n            this.pendingDataMessages.push(data);\n        }\n        else {\n            throw new Error('Unknown protocol layer: ' + layer);\n        }\n    };\n    Connection.prototype.upgradeIfSecondaryHealthy_ = function () {\n        if (this.secondaryResponsesRequired_ <= 0) {\n            this.log_('Secondary connection is healthy.');\n            this.isHealthy_ = true;\n            this.secondaryConn_.markConnectionHealthy();\n            this.proceedWithUpgrade_();\n        }\n        else {\n            // Send a ping to make sure the connection is healthy.\n            this.log_('sending ping on secondary.');\n            this.secondaryConn_.send({ t: 'c', d: { t: PING, d: {} } });\n        }\n    };\n    Connection.prototype.proceedWithUpgrade_ = function () {\n        // tell this connection to consider itself open\n        this.secondaryConn_.start();\n        // send ack\n        this.log_('sending client ack on secondary');\n        this.secondaryConn_.send({ t: 'c', d: { t: SWITCH_ACK, d: {} } });\n        // send end packet on primary transport, switch to sending on this one\n        // can receive on this one, buffer responses until end received on primary transport\n        this.log_('Ending transmission on primary');\n        this.conn_.send({ t: 'c', d: { t: END_TRANSMISSION, d: {} } });\n        this.tx_ = this.secondaryConn_;\n        this.tryCleanupConnection();\n    };\n    Connection.prototype.onPrimaryMessageReceived_ = function (parsedData) {\n        // Must refer to parsedData properties in quotes, so closure doesn't touch them.\n        var layer = util_1.requireKey('t', parsedData);\n        var data = util_1.requireKey('d', parsedData);\n        if (layer == 'c') {\n            this.onControl_(data);\n        }\n        else if (layer == 'd') {\n            this.onDataMessage_(data);\n        }\n    };\n    Connection.prototype.onDataMessage_ = function (message) {\n        this.onPrimaryResponse_();\n        // We don't do anything with data messages, just kick them up a level\n        this.onMessage_(message);\n    };\n    Connection.prototype.onPrimaryResponse_ = function () {\n        if (!this.isHealthy_) {\n            this.primaryResponsesRequired_--;\n            if (this.primaryResponsesRequired_ <= 0) {\n                this.log_('Primary connection is healthy.');\n                this.isHealthy_ = true;\n                this.conn_.markConnectionHealthy();\n            }\n        }\n    };\n    Connection.prototype.onControl_ = function (controlData) {\n        var cmd = util_1.requireKey(MESSAGE_TYPE, controlData);\n        if (MESSAGE_DATA in controlData) {\n            var payload = controlData[MESSAGE_DATA];\n            if (cmd === SERVER_HELLO) {\n                this.onHandshake_(payload);\n            }\n            else if (cmd === END_TRANSMISSION) {\n                this.log_('recvd end transmission on primary');\n                this.rx_ = this.secondaryConn_;\n                for (var i = 0; i < this.pendingDataMessages.length; ++i) {\n                    this.onDataMessage_(this.pendingDataMessages[i]);\n                }\n                this.pendingDataMessages = [];\n                this.tryCleanupConnection();\n            }\n            else if (cmd === CONTROL_SHUTDOWN) {\n                // This was previously the 'onKill' callback passed to the lower-level connection\n                // payload in this case is the reason for the shutdown. Generally a human-readable error\n                this.onConnectionShutdown_(payload);\n            }\n            else if (cmd === CONTROL_RESET) {\n                // payload in this case is the host we should contact\n                this.onReset_(payload);\n            }\n            else if (cmd === CONTROL_ERROR) {\n                util_1.error('Server Error: ' + payload);\n            }\n            else if (cmd === CONTROL_PONG) {\n                this.log_('got pong on primary.');\n                this.onPrimaryResponse_();\n                this.sendPingOnPrimaryIfNecessary_();\n            }\n            else {\n                util_1.error('Unknown control packet command: ' + cmd);\n            }\n        }\n    };\n    /**\n     *\n     * @param {Object} handshake The handshake data returned from the server\n     * @private\n     */\n    Connection.prototype.onHandshake_ = function (handshake) {\n        var timestamp = handshake.ts;\n        var version = handshake.v;\n        var host = handshake.h;\n        this.sessionId = handshake.s;\n        this.repoInfo_.updateHost(host);\n        // if we've already closed the connection, then don't bother trying to progress further\n        if (this.state_ == 0 /* CONNECTING */) {\n            this.conn_.start();\n            this.onConnectionEstablished_(this.conn_, timestamp);\n            if (Constants_1.PROTOCOL_VERSION !== version) {\n                util_1.warn('Protocol version mismatch detected');\n            }\n            // TODO: do we want to upgrade? when? maybe a delay?\n            this.tryStartUpgrade_();\n        }\n    };\n    Connection.prototype.tryStartUpgrade_ = function () {\n        var conn = this.transportManager_.upgradeTransport();\n        if (conn) {\n            this.startUpgrade_(conn);\n        }\n    };\n    Connection.prototype.startUpgrade_ = function (conn) {\n        var _this = this;\n        this.secondaryConn_ = new conn(this.nextTransportId_(), this.repoInfo_, this.sessionId);\n        // For certain transports (WebSockets), we need to send and receive several messages back and forth before we\n        // can consider the transport healthy.\n        this.secondaryResponsesRequired_ =\n            conn['responsesRequiredToBeHealthy'] || 0;\n        var onMessage = this.connReceiver_(this.secondaryConn_);\n        var onDisconnect = this.disconnReceiver_(this.secondaryConn_);\n        this.secondaryConn_.open(onMessage, onDisconnect);\n        // If we haven't successfully upgraded after UPGRADE_TIMEOUT, give up and kill the secondary.\n        util_1.setTimeoutNonBlocking(function () {\n            if (_this.secondaryConn_) {\n                _this.log_('Timed out trying to upgrade.');\n                _this.secondaryConn_.close();\n            }\n        }, Math.floor(UPGRADE_TIMEOUT));\n    };\n    Connection.prototype.onReset_ = function (host) {\n        this.log_('Reset packet received.  New host: ' + host);\n        this.repoInfo_.updateHost(host);\n        // TODO: if we're already \"connected\", we need to trigger a disconnect at the next layer up.\n        // We don't currently support resets after the connection has already been established\n        if (this.state_ === 1 /* CONNECTED */) {\n            this.close();\n        }\n        else {\n            // Close whatever connections we have open and start again.\n            this.closeConnections_();\n            this.start_();\n        }\n    };\n    Connection.prototype.onConnectionEstablished_ = function (conn, timestamp) {\n        var _this = this;\n        this.log_('Realtime connection established.');\n        this.conn_ = conn;\n        this.state_ = 1 /* CONNECTED */;\n        if (this.onReady_) {\n            this.onReady_(timestamp, this.sessionId);\n            this.onReady_ = null;\n        }\n        // If after 5 seconds we haven't sent enough requests to the server to get the connection healthy,\n        // send some pings.\n        if (this.primaryResponsesRequired_ === 0) {\n            this.log_('Primary connection is healthy.');\n            this.isHealthy_ = true;\n        }\n        else {\n            util_1.setTimeoutNonBlocking(function () {\n                _this.sendPingOnPrimaryIfNecessary_();\n            }, Math.floor(DELAY_BEFORE_SENDING_EXTRA_REQUESTS));\n        }\n    };\n    Connection.prototype.sendPingOnPrimaryIfNecessary_ = function () {\n        // If the connection isn't considered healthy yet, we'll send a noop ping packet request.\n        if (!this.isHealthy_ && this.state_ === 1 /* CONNECTED */) {\n            this.log_('sending ping on primary.');\n            this.sendData_({ t: 'c', d: { t: PING, d: {} } });\n        }\n    };\n    Connection.prototype.onSecondaryConnectionLost_ = function () {\n        var conn = this.secondaryConn_;\n        this.secondaryConn_ = null;\n        if (this.tx_ === conn || this.rx_ === conn) {\n            // we are relying on this connection already in some capacity. Therefore, a failure is real\n            this.close();\n        }\n    };\n    /**\n     *\n     * @param {boolean} everConnected Whether or not the connection ever reached a server. Used to determine if\n     * we should flush the host cache\n     * @private\n     */\n    Connection.prototype.onConnectionLost_ = function (everConnected) {\n        this.conn_ = null;\n        // NOTE: IF you're seeing a Firefox error for this line, I think it might be because it's getting\n        // called on window close and RealtimeState.CONNECTING is no longer defined.  Just a guess.\n        if (!everConnected && this.state_ === 0 /* CONNECTING */) {\n            this.log_('Realtime connection failed.');\n            // Since we failed to connect at all, clear any cached entry for this namespace in case the machine went away\n            if (this.repoInfo_.isCacheableHost()) {\n                storage_1.PersistentStorage.remove('host:' + this.repoInfo_.host);\n                // reset the internal host to what we would show the user, i.e. <ns>.firebaseio.com\n                this.repoInfo_.internalHost = this.repoInfo_.host;\n            }\n        }\n        else if (this.state_ === 1 /* CONNECTED */) {\n            this.log_('Realtime connection lost.');\n        }\n        this.close();\n    };\n    /**\n     *\n     * @param {string} reason\n     * @private\n     */\n    Connection.prototype.onConnectionShutdown_ = function (reason) {\n        this.log_('Connection shutdown command received. Shutting down...');\n        if (this.onKill_) {\n            this.onKill_(reason);\n            this.onKill_ = null;\n        }\n        // We intentionally don't want to fire onDisconnect (kill is a different case),\n        // so clear the callback.\n        this.onDisconnect_ = null;\n        this.close();\n    };\n    Connection.prototype.sendData_ = function (data) {\n        if (this.state_ !== 1 /* CONNECTED */) {\n            throw 'Connection is not connected';\n        }\n        else {\n            this.tx_.send(data);\n        }\n    };\n    /**\n     * Cleans up this connection, calling the appropriate callbacks\n     */\n    Connection.prototype.close = function () {\n        if (this.state_ !== 2 /* DISCONNECTED */) {\n            this.log_('Closing realtime connection.');\n            this.state_ = 2 /* DISCONNECTED */;\n            this.closeConnections_();\n            if (this.onDisconnect_) {\n                this.onDisconnect_();\n                this.onDisconnect_ = null;\n            }\n        }\n    };\n    /**\n     *\n     * @private\n     */\n    Connection.prototype.closeConnections_ = function () {\n        this.log_('Shutting down all connections');\n        if (this.conn_) {\n            this.conn_.close();\n            this.conn_ = null;\n        }\n        if (this.secondaryConn_) {\n            this.secondaryConn_.close();\n            this.secondaryConn_ = null;\n        }\n        if (this.healthyTimeout_) {\n            clearTimeout(this.healthyTimeout_);\n            this.healthyTimeout_ = null;\n        }\n    };\n    return Connection;\n}());\nexports.Connection = Connection;\n\n//# sourceMappingURL=Connection.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/realtime/Connection.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = require(\"../core/util/util\");\nvar CountedSet_1 = require(\"../core/util/CountedSet\");\nvar StatsManager_1 = require(\"../core/stats/StatsManager\");\nvar PacketReceiver_1 = require(\"./polling/PacketReceiver\");\nvar Constants_1 = require(\"./Constants\");\nvar util_2 = require(\"@firebase/util\");\nvar util_3 = require(\"@firebase/util\");\n// URL query parameters associated with longpolling\nexports.FIREBASE_LONGPOLL_START_PARAM = 'start';\nexports.FIREBASE_LONGPOLL_CLOSE_COMMAND = 'close';\nexports.FIREBASE_LONGPOLL_COMMAND_CB_NAME = 'pLPCommand';\nexports.FIREBASE_LONGPOLL_DATA_CB_NAME = 'pRTLPCB';\nexports.FIREBASE_LONGPOLL_ID_PARAM = 'id';\nexports.FIREBASE_LONGPOLL_PW_PARAM = 'pw';\nexports.FIREBASE_LONGPOLL_SERIAL_PARAM = 'ser';\nexports.FIREBASE_LONGPOLL_CALLBACK_ID_PARAM = 'cb';\nexports.FIREBASE_LONGPOLL_SEGMENT_NUM_PARAM = 'seg';\nexports.FIREBASE_LONGPOLL_SEGMENTS_IN_PACKET = 'ts';\nexports.FIREBASE_LONGPOLL_DATA_PARAM = 'd';\nexports.FIREBASE_LONGPOLL_DISCONN_FRAME_PARAM = 'disconn';\nexports.FIREBASE_LONGPOLL_DISCONN_FRAME_REQUEST_PARAM = 'dframe';\n//Data size constants.\n//TODO: Perf: the maximum length actually differs from browser to browser.\n// We should check what browser we're on and set accordingly.\nvar MAX_URL_DATA_SIZE = 1870;\nvar SEG_HEADER_SIZE = 30; //ie: &seg=8299234&ts=982389123&d=\nvar MAX_PAYLOAD_SIZE = MAX_URL_DATA_SIZE - SEG_HEADER_SIZE;\n/**\n * Keepalive period\n * send a fresh request at minimum every 25 seconds. Opera has a maximum request\n * length of 30 seconds that we can't exceed.\n * @const\n * @type {number}\n */\nvar KEEPALIVE_REQUEST_INTERVAL = 25000;\n/**\n * How long to wait before aborting a long-polling connection attempt.\n * @const\n * @type {number}\n */\nvar LP_CONNECT_TIMEOUT = 30000;\n/**\n * This class manages a single long-polling connection.\n *\n * @constructor\n * @implements {Transport}\n */\nvar BrowserPollConnection = /** @class */ (function () {\n    /**\n     * @param {string} connId An identifier for this connection, used for logging\n     * @param {RepoInfo} repoInfo The info for the endpoint to send data to.\n     * @param {string=} transportSessionId Optional transportSessionid if we are reconnecting for an existing\n     *                                         transport session\n     * @param {string=}  lastSessionId Optional lastSessionId if the PersistentConnection has already created a\n     *                                     connection previously\n     */\n    function BrowserPollConnection(connId, repoInfo, transportSessionId, lastSessionId) {\n        this.connId = connId;\n        this.repoInfo = repoInfo;\n        this.transportSessionId = transportSessionId;\n        this.lastSessionId = lastSessionId;\n        this.bytesSent = 0;\n        this.bytesReceived = 0;\n        this.everConnected_ = false;\n        this.log_ = util_1.logWrapper(connId);\n        this.stats_ = StatsManager_1.StatsManager.getCollection(repoInfo);\n        this.urlFn = function (params) {\n            return repoInfo.connectionURL(Constants_1.LONG_POLLING, params);\n        };\n    }\n    /**\n     *\n     * @param {function(Object)} onMessage Callback when messages arrive\n     * @param {function()} onDisconnect Callback with connection lost.\n     */\n    BrowserPollConnection.prototype.open = function (onMessage, onDisconnect) {\n        var _this = this;\n        this.curSegmentNum = 0;\n        this.onDisconnect_ = onDisconnect;\n        this.myPacketOrderer = new PacketReceiver_1.PacketReceiver(onMessage);\n        this.isClosed_ = false;\n        this.connectTimeoutTimer_ = setTimeout(function () {\n            _this.log_('Timed out trying to connect.');\n            // Make sure we clear the host cache\n            _this.onClosed_();\n            _this.connectTimeoutTimer_ = null;\n        }, Math.floor(LP_CONNECT_TIMEOUT));\n        // Ensure we delay the creation of the iframe until the DOM is loaded.\n        util_1.executeWhenDOMReady(function () {\n            if (_this.isClosed_)\n                return;\n            //Set up a callback that gets triggered once a connection is set up.\n            _this.scriptTagHolder = new FirebaseIFrameScriptHolder(function () {\n                var args = [];\n                for (var _i = 0; _i < arguments.length; _i++) {\n                    args[_i] = arguments[_i];\n                }\n                var command = args[0], arg1 = args[1], arg2 = args[2], arg3 = args[3], arg4 = args[4];\n                _this.incrementIncomingBytes_(args);\n                if (!_this.scriptTagHolder)\n                    return; // we closed the connection.\n                if (_this.connectTimeoutTimer_) {\n                    clearTimeout(_this.connectTimeoutTimer_);\n                    _this.connectTimeoutTimer_ = null;\n                }\n                _this.everConnected_ = true;\n                if (command == exports.FIREBASE_LONGPOLL_START_PARAM) {\n                    _this.id = arg1;\n                    _this.password = arg2;\n                }\n                else if (command === exports.FIREBASE_LONGPOLL_CLOSE_COMMAND) {\n                    // Don't clear the host cache. We got a response from the server, so we know it's reachable\n                    if (arg1) {\n                        // We aren't expecting any more data (other than what the server's already in the process of sending us\n                        // through our already open polls), so don't send any more.\n                        _this.scriptTagHolder.sendNewPolls = false;\n                        // arg1 in this case is the last response number sent by the server. We should try to receive\n                        // all of the responses up to this one before closing\n                        _this.myPacketOrderer.closeAfter(arg1, function () {\n                            _this.onClosed_();\n                        });\n                    }\n                    else {\n                        _this.onClosed_();\n                    }\n                }\n                else {\n                    throw new Error('Unrecognized command received: ' + command);\n                }\n            }, function () {\n                var args = [];\n                for (var _i = 0; _i < arguments.length; _i++) {\n                    args[_i] = arguments[_i];\n                }\n                var pN = args[0], data = args[1];\n                _this.incrementIncomingBytes_(args);\n                _this.myPacketOrderer.handleResponse(pN, data);\n            }, function () {\n                _this.onClosed_();\n            }, _this.urlFn);\n            //Send the initial request to connect. The serial number is simply to keep the browser from pulling previous results\n            //from cache.\n            var urlParams = {};\n            urlParams[exports.FIREBASE_LONGPOLL_START_PARAM] = 't';\n            urlParams[exports.FIREBASE_LONGPOLL_SERIAL_PARAM] = Math.floor(Math.random() * 100000000);\n            if (_this.scriptTagHolder.uniqueCallbackIdentifier)\n                urlParams[exports.FIREBASE_LONGPOLL_CALLBACK_ID_PARAM] = _this.scriptTagHolder.uniqueCallbackIdentifier;\n            urlParams[Constants_1.VERSION_PARAM] = Constants_1.PROTOCOL_VERSION;\n            if (_this.transportSessionId) {\n                urlParams[Constants_1.TRANSPORT_SESSION_PARAM] = _this.transportSessionId;\n            }\n            if (_this.lastSessionId) {\n                urlParams[Constants_1.LAST_SESSION_PARAM] = _this.lastSessionId;\n            }\n            if (!util_3.isNodeSdk() &&\n                typeof location !== 'undefined' &&\n                location.href &&\n                location.href.indexOf(Constants_1.FORGE_DOMAIN) !== -1) {\n                urlParams[Constants_1.REFERER_PARAM] = Constants_1.FORGE_REF;\n            }\n            var connectURL = _this.urlFn(urlParams);\n            _this.log_('Connecting via long-poll to ' + connectURL);\n            _this.scriptTagHolder.addTag(connectURL, function () {\n                /* do nothing */\n            });\n        });\n    };\n    /**\n     * Call this when a handshake has completed successfully and we want to consider the connection established\n     */\n    BrowserPollConnection.prototype.start = function () {\n        this.scriptTagHolder.startLongPoll(this.id, this.password);\n        this.addDisconnectPingFrame(this.id, this.password);\n    };\n    /**\n     * Forces long polling to be considered as a potential transport\n     */\n    BrowserPollConnection.forceAllow = function () {\n        BrowserPollConnection.forceAllow_ = true;\n    };\n    /**\n     * Forces longpolling to not be considered as a potential transport\n     */\n    BrowserPollConnection.forceDisallow = function () {\n        BrowserPollConnection.forceDisallow_ = true;\n    };\n    // Static method, use string literal so it can be accessed in a generic way\n    BrowserPollConnection.isAvailable = function () {\n        // NOTE: In React-Native there's normally no 'document', but if you debug a React-Native app in\n        // the Chrome debugger, 'document' is defined, but document.createElement is null (2015/06/08).\n        return (BrowserPollConnection.forceAllow_ ||\n            (!BrowserPollConnection.forceDisallow_ &&\n                typeof document !== 'undefined' &&\n                document.createElement != null &&\n                !util_1.isChromeExtensionContentScript() &&\n                !util_1.isWindowsStoreApp() &&\n                !util_3.isNodeSdk()));\n    };\n    /**\n     * No-op for polling\n     */\n    BrowserPollConnection.prototype.markConnectionHealthy = function () { };\n    /**\n     * Stops polling and cleans up the iframe\n     * @private\n     */\n    BrowserPollConnection.prototype.shutdown_ = function () {\n        this.isClosed_ = true;\n        if (this.scriptTagHolder) {\n            this.scriptTagHolder.close();\n            this.scriptTagHolder = null;\n        }\n        //remove the disconnect frame, which will trigger an XHR call to the server to tell it we're leaving.\n        if (this.myDisconnFrame) {\n            document.body.removeChild(this.myDisconnFrame);\n            this.myDisconnFrame = null;\n        }\n        if (this.connectTimeoutTimer_) {\n            clearTimeout(this.connectTimeoutTimer_);\n            this.connectTimeoutTimer_ = null;\n        }\n    };\n    /**\n     * Triggered when this transport is closed\n     * @private\n     */\n    BrowserPollConnection.prototype.onClosed_ = function () {\n        if (!this.isClosed_) {\n            this.log_('Longpoll is closing itself');\n            this.shutdown_();\n            if (this.onDisconnect_) {\n                this.onDisconnect_(this.everConnected_);\n                this.onDisconnect_ = null;\n            }\n        }\n    };\n    /**\n     * External-facing close handler. RealTime has requested we shut down. Kill our connection and tell the server\n     * that we've left.\n     */\n    BrowserPollConnection.prototype.close = function () {\n        if (!this.isClosed_) {\n            this.log_('Longpoll is being closed.');\n            this.shutdown_();\n        }\n    };\n    /**\n     * Send the JSON object down to the server. It will need to be stringified, base64 encoded, and then\n     * broken into chunks (since URLs have a small maximum length).\n     * @param {!Object} data The JSON data to transmit.\n     */\n    BrowserPollConnection.prototype.send = function (data) {\n        var dataStr = util_2.stringify(data);\n        this.bytesSent += dataStr.length;\n        this.stats_.incrementCounter('bytes_sent', dataStr.length);\n        //first, lets get the base64-encoded data\n        var base64data = util_2.base64Encode(dataStr);\n        //We can only fit a certain amount in each URL, so we need to split this request\n        //up into multiple pieces if it doesn't fit in one request.\n        var dataSegs = util_1.splitStringBySize(base64data, MAX_PAYLOAD_SIZE);\n        //Enqueue each segment for transmission. We assign each chunk a sequential ID and a total number\n        //of segments so that we can reassemble the packet on the server.\n        for (var i = 0; i < dataSegs.length; i++) {\n            this.scriptTagHolder.enqueueSegment(this.curSegmentNum, dataSegs.length, dataSegs[i]);\n            this.curSegmentNum++;\n        }\n    };\n    /**\n     * This is how we notify the server that we're leaving.\n     * We aren't able to send requests with DHTML on a window close event, but we can\n     * trigger XHR requests in some browsers (everything but Opera basically).\n     * @param {!string} id\n     * @param {!string} pw\n     */\n    BrowserPollConnection.prototype.addDisconnectPingFrame = function (id, pw) {\n        if (util_3.isNodeSdk())\n            return;\n        this.myDisconnFrame = document.createElement('iframe');\n        var urlParams = {};\n        urlParams[exports.FIREBASE_LONGPOLL_DISCONN_FRAME_REQUEST_PARAM] = 't';\n        urlParams[exports.FIREBASE_LONGPOLL_ID_PARAM] = id;\n        urlParams[exports.FIREBASE_LONGPOLL_PW_PARAM] = pw;\n        this.myDisconnFrame.src = this.urlFn(urlParams);\n        this.myDisconnFrame.style.display = 'none';\n        document.body.appendChild(this.myDisconnFrame);\n    };\n    /**\n     * Used to track the bytes received by this client\n     * @param {*} args\n     * @private\n     */\n    BrowserPollConnection.prototype.incrementIncomingBytes_ = function (args) {\n        // TODO: This is an annoying perf hit just to track the number of incoming bytes.  Maybe it should be opt-in.\n        var bytesReceived = util_2.stringify(args).length;\n        this.bytesReceived += bytesReceived;\n        this.stats_.incrementCounter('bytes_received', bytesReceived);\n    };\n    return BrowserPollConnection;\n}());\nexports.BrowserPollConnection = BrowserPollConnection;\n/*********************************************************************************************\n * A wrapper around an iframe that is used as a long-polling script holder.\n * @constructor\n *********************************************************************************************/\nvar FirebaseIFrameScriptHolder = /** @class */ (function () {\n    /**\n     * @param commandCB - The callback to be called when control commands are recevied from the server.\n     * @param onMessageCB - The callback to be triggered when responses arrive from the server.\n     * @param onDisconnect - The callback to be triggered when this tag holder is closed\n     * @param urlFn - A function that provides the URL of the endpoint to send data to.\n     */\n    function FirebaseIFrameScriptHolder(commandCB, onMessageCB, onDisconnect, urlFn) {\n        this.onDisconnect = onDisconnect;\n        this.urlFn = urlFn;\n        //We maintain a count of all of the outstanding requests, because if we have too many active at once it can cause\n        //problems in some browsers.\n        /**\n         * @type {CountedSet.<number, number>}\n         */\n        this.outstandingRequests = new CountedSet_1.CountedSet();\n        //A queue of the pending segments waiting for transmission to the server.\n        this.pendingSegs = [];\n        //A serial number. We use this for two things:\n        // 1) A way to ensure the browser doesn't cache responses to polls\n        // 2) A way to make the server aware when long-polls arrive in a different order than we started them. The\n        //    server needs to release both polls in this case or it will cause problems in Opera since Opera can only execute\n        //    JSONP code in the order it was added to the iframe.\n        this.currentSerial = Math.floor(Math.random() * 100000000);\n        // This gets set to false when we're \"closing down\" the connection (e.g. we're switching transports but there's still\n        // incoming data from the server that we're waiting for).\n        this.sendNewPolls = true;\n        if (!util_3.isNodeSdk()) {\n            //Each script holder registers a couple of uniquely named callbacks with the window. These are called from the\n            //iframes where we put the long-polling script tags. We have two callbacks:\n            //   1) Command Callback - Triggered for control issues, like starting a connection.\n            //   2) Message Callback - Triggered when new data arrives.\n            this.uniqueCallbackIdentifier = util_1.LUIDGenerator();\n            window[exports.FIREBASE_LONGPOLL_COMMAND_CB_NAME + this.uniqueCallbackIdentifier] = commandCB;\n            window[exports.FIREBASE_LONGPOLL_DATA_CB_NAME + this.uniqueCallbackIdentifier] = onMessageCB;\n            //Create an iframe for us to add script tags to.\n            this.myIFrame = FirebaseIFrameScriptHolder.createIFrame_();\n            // Set the iframe's contents.\n            var script = '';\n            // if we set a javascript url, it's IE and we need to set the document domain. The javascript url is sufficient\n            // for ie9, but ie8 needs to do it again in the document itself.\n            if (this.myIFrame.src &&\n                this.myIFrame.src.substr(0, 'javascript:'.length) === 'javascript:') {\n                var currentDomain = document.domain;\n                script = '<script>document.domain=\"' + currentDomain + '\";</script>';\n            }\n            var iframeContents = '<html><body>' + script + '</body></html>';\n            try {\n                this.myIFrame.doc.open();\n                this.myIFrame.doc.write(iframeContents);\n                this.myIFrame.doc.close();\n            }\n            catch (e) {\n                util_1.log('frame writing exception');\n                if (e.stack) {\n                    util_1.log(e.stack);\n                }\n                util_1.log(e);\n            }\n        }\n        else {\n            this.commandCB = commandCB;\n            this.onMessageCB = onMessageCB;\n        }\n    }\n    /**\n     * Each browser has its own funny way to handle iframes. Here we mush them all together into one object that I can\n     * actually use.\n     * @private\n     * @return {Element}\n     */\n    FirebaseIFrameScriptHolder.createIFrame_ = function () {\n        var iframe = document.createElement('iframe');\n        iframe.style.display = 'none';\n        // This is necessary in order to initialize the document inside the iframe\n        if (document.body) {\n            document.body.appendChild(iframe);\n            try {\n                // If document.domain has been modified in IE, this will throw an error, and we need to set the\n                // domain of the iframe's document manually. We can do this via a javascript: url as the src attribute\n                // Also note that we must do this *after* the iframe has been appended to the page. Otherwise it doesn't work.\n                var a = iframe.contentWindow.document;\n                if (!a) {\n                    // Apologies for the log-spam, I need to do something to keep closure from optimizing out the assignment above.\n                    util_1.log('No IE domain setting required');\n                }\n            }\n            catch (e) {\n                var domain = document.domain;\n                iframe.src =\n                    \"javascript:void((function(){document.open();document.domain='\" +\n                        domain +\n                        \"';document.close();})())\";\n            }\n        }\n        else {\n            // LongPollConnection attempts to delay initialization until the document is ready, so hopefully this\n            // never gets hit.\n            throw 'Document body has not initialized. Wait to initialize Firebase until after the document is ready.';\n        }\n        // Get the document of the iframe in a browser-specific way.\n        if (iframe.contentDocument) {\n            iframe.doc = iframe.contentDocument; // Firefox, Opera, Safari\n        }\n        else if (iframe.contentWindow) {\n            iframe.doc = iframe.contentWindow.document; // Internet Explorer\n        }\n        else if (iframe.document) {\n            iframe.doc = iframe.document; //others?\n        }\n        return iframe;\n    };\n    /**\n     * Cancel all outstanding queries and remove the frame.\n     */\n    FirebaseIFrameScriptHolder.prototype.close = function () {\n        var _this = this;\n        //Mark this iframe as dead, so no new requests are sent.\n        this.alive = false;\n        if (this.myIFrame) {\n            //We have to actually remove all of the html inside this iframe before removing it from the\n            //window, or IE will continue loading and executing the script tags we've already added, which\n            //can lead to some errors being thrown. Setting innerHTML seems to be the easiest way to do this.\n            this.myIFrame.doc.body.innerHTML = '';\n            setTimeout(function () {\n                if (_this.myIFrame !== null) {\n                    document.body.removeChild(_this.myIFrame);\n                    _this.myIFrame = null;\n                }\n            }, Math.floor(0));\n        }\n        if (util_3.isNodeSdk() && this.myID) {\n            var urlParams = {};\n            urlParams[exports.FIREBASE_LONGPOLL_DISCONN_FRAME_PARAM] = 't';\n            urlParams[exports.FIREBASE_LONGPOLL_ID_PARAM] = this.myID;\n            urlParams[exports.FIREBASE_LONGPOLL_PW_PARAM] = this.myPW;\n            var theURL = this.urlFn(urlParams);\n            FirebaseIFrameScriptHolder.nodeRestRequest(theURL);\n        }\n        // Protect from being called recursively.\n        var onDisconnect = this.onDisconnect;\n        if (onDisconnect) {\n            this.onDisconnect = null;\n            onDisconnect();\n        }\n    };\n    /**\n     * Actually start the long-polling session by adding the first script tag(s) to the iframe.\n     * @param {!string} id - The ID of this connection\n     * @param {!string} pw - The password for this connection\n     */\n    FirebaseIFrameScriptHolder.prototype.startLongPoll = function (id, pw) {\n        this.myID = id;\n        this.myPW = pw;\n        this.alive = true;\n        //send the initial request. If there are requests queued, make sure that we transmit as many as we are currently able to.\n        while (this.newRequest_()) { }\n    };\n    /**\n     * This is called any time someone might want a script tag to be added. It adds a script tag when there aren't\n     * too many outstanding requests and we are still alive.\n     *\n     * If there are outstanding packet segments to send, it sends one. If there aren't, it sends a long-poll anyways if\n     * needed.\n     */\n    FirebaseIFrameScriptHolder.prototype.newRequest_ = function () {\n        // We keep one outstanding request open all the time to receive data, but if we need to send data\n        // (pendingSegs.length > 0) then we create a new request to send the data.  The server will automatically\n        // close the old request.\n        if (this.alive &&\n            this.sendNewPolls &&\n            this.outstandingRequests.count() < (this.pendingSegs.length > 0 ? 2 : 1)) {\n            //construct our url\n            this.currentSerial++;\n            var urlParams = {};\n            urlParams[exports.FIREBASE_LONGPOLL_ID_PARAM] = this.myID;\n            urlParams[exports.FIREBASE_LONGPOLL_PW_PARAM] = this.myPW;\n            urlParams[exports.FIREBASE_LONGPOLL_SERIAL_PARAM] = this.currentSerial;\n            var theURL = this.urlFn(urlParams);\n            //Now add as much data as we can.\n            var curDataString = '';\n            var i = 0;\n            while (this.pendingSegs.length > 0) {\n                //first, lets see if the next segment will fit.\n                var nextSeg = this.pendingSegs[0];\n                if (nextSeg.d.length + SEG_HEADER_SIZE + curDataString.length <=\n                    MAX_URL_DATA_SIZE) {\n                    //great, the segment will fit. Lets append it.\n                    var theSeg = this.pendingSegs.shift();\n                    curDataString =\n                        curDataString +\n                            '&' +\n                            exports.FIREBASE_LONGPOLL_SEGMENT_NUM_PARAM +\n                            i +\n                            '=' +\n                            theSeg.seg +\n                            '&' +\n                            exports.FIREBASE_LONGPOLL_SEGMENTS_IN_PACKET +\n                            i +\n                            '=' +\n                            theSeg.ts +\n                            '&' +\n                            exports.FIREBASE_LONGPOLL_DATA_PARAM +\n                            i +\n                            '=' +\n                            theSeg.d;\n                    i++;\n                }\n                else {\n                    break;\n                }\n            }\n            theURL = theURL + curDataString;\n            this.addLongPollTag_(theURL, this.currentSerial);\n            return true;\n        }\n        else {\n            return false;\n        }\n    };\n    /**\n     * Queue a packet for transmission to the server.\n     * @param segnum - A sequential id for this packet segment used for reassembly\n     * @param totalsegs - The total number of segments in this packet\n     * @param data - The data for this segment.\n     */\n    FirebaseIFrameScriptHolder.prototype.enqueueSegment = function (segnum, totalsegs, data) {\n        //add this to the queue of segments to send.\n        this.pendingSegs.push({ seg: segnum, ts: totalsegs, d: data });\n        //send the data immediately if there isn't already data being transmitted, unless\n        //startLongPoll hasn't been called yet.\n        if (this.alive) {\n            this.newRequest_();\n        }\n    };\n    /**\n     * Add a script tag for a regular long-poll request.\n     * @param {!string} url - The URL of the script tag.\n     * @param {!number} serial - The serial number of the request.\n     * @private\n     */\n    FirebaseIFrameScriptHolder.prototype.addLongPollTag_ = function (url, serial) {\n        var _this = this;\n        //remember that we sent this request.\n        this.outstandingRequests.add(serial, 1);\n        var doNewRequest = function () {\n            _this.outstandingRequests.remove(serial);\n            _this.newRequest_();\n        };\n        // If this request doesn't return on its own accord (by the server sending us some data), we'll\n        // create a new one after the KEEPALIVE interval to make sure we always keep a fresh request open.\n        var keepaliveTimeout = setTimeout(doNewRequest, Math.floor(KEEPALIVE_REQUEST_INTERVAL));\n        var readyStateCB = function () {\n            // Request completed.  Cancel the keepalive.\n            clearTimeout(keepaliveTimeout);\n            // Trigger a new request so we can continue receiving data.\n            doNewRequest();\n        };\n        this.addTag(url, readyStateCB);\n    };\n    /**\n     * Add an arbitrary script tag to the iframe.\n     * @param {!string} url - The URL for the script tag source.\n     * @param {!function()} loadCB - A callback to be triggered once the script has loaded.\n     */\n    FirebaseIFrameScriptHolder.prototype.addTag = function (url, loadCB) {\n        var _this = this;\n        if (util_3.isNodeSdk()) {\n            this.doNodeLongPoll(url, loadCB);\n        }\n        else {\n            setTimeout(function () {\n                try {\n                    // if we're already closed, don't add this poll\n                    if (!_this.sendNewPolls)\n                        return;\n                    var newScript_1 = _this.myIFrame.doc.createElement('script');\n                    newScript_1.type = 'text/javascript';\n                    newScript_1.async = true;\n                    newScript_1.src = url;\n                    newScript_1.onload = newScript_1.onreadystatechange = function () {\n                        var rstate = newScript_1.readyState;\n                        if (!rstate || rstate === 'loaded' || rstate === 'complete') {\n                            newScript_1.onload = newScript_1.onreadystatechange = null;\n                            if (newScript_1.parentNode) {\n                                newScript_1.parentNode.removeChild(newScript_1);\n                            }\n                            loadCB();\n                        }\n                    };\n                    newScript_1.onerror = function () {\n                        util_1.log('Long-poll script failed to load: ' + url);\n                        _this.sendNewPolls = false;\n                        _this.close();\n                    };\n                    _this.myIFrame.doc.body.appendChild(newScript_1);\n                }\n                catch (e) {\n                    // TODO: we should make this error visible somehow\n                }\n            }, Math.floor(1));\n        }\n    };\n    return FirebaseIFrameScriptHolder;\n}());\nexports.FirebaseIFrameScriptHolder = FirebaseIFrameScriptHolder;\n\n//# sourceMappingURL=BrowserPollConnection.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/realtime/BrowserPollConnection.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar app_1 = require(\"@firebase/app\");\nvar util_1 = require(\"@firebase/util\");\nvar util_2 = require(\"../core/util/util\");\nvar StatsManager_1 = require(\"../core/stats/StatsManager\");\nvar Constants_1 = require(\"./Constants\");\nvar util_3 = require(\"@firebase/util\");\nvar storage_1 = require(\"../core/storage/storage\");\nvar util_4 = require(\"@firebase/util\");\nvar util_5 = require(\"@firebase/util\");\nvar WEBSOCKET_MAX_FRAME_SIZE = 16384;\nvar WEBSOCKET_KEEPALIVE_INTERVAL = 45000;\nvar WebSocketImpl = null;\nif (typeof MozWebSocket !== 'undefined') {\n    WebSocketImpl = MozWebSocket;\n}\nelse if (typeof WebSocket !== 'undefined') {\n    WebSocketImpl = WebSocket;\n}\nfunction setWebSocketImpl(impl) {\n    WebSocketImpl = impl;\n}\nexports.setWebSocketImpl = setWebSocketImpl;\n/**\n * Create a new websocket connection with the given callbacks.\n * @constructor\n * @implements {Transport}\n */\nvar WebSocketConnection = /** @class */ (function () {\n    /**\n     * @param {string} connId identifier for this transport\n     * @param {RepoInfo} repoInfo The info for the websocket endpoint.\n     * @param {string=} transportSessionId Optional transportSessionId if this is connecting to an existing transport\n     *                                         session\n     * @param {string=} lastSessionId Optional lastSessionId if there was a previous connection\n     */\n    function WebSocketConnection(connId, repoInfo, transportSessionId, lastSessionId) {\n        this.connId = connId;\n        this.keepaliveTimer = null;\n        this.frames = null;\n        this.totalFrames = 0;\n        this.bytesSent = 0;\n        this.bytesReceived = 0;\n        this.log_ = util_2.logWrapper(this.connId);\n        this.stats_ = StatsManager_1.StatsManager.getCollection(repoInfo);\n        this.connURL = WebSocketConnection.connectionURL_(repoInfo, transportSessionId, lastSessionId);\n    }\n    /**\n     * @param {RepoInfo} repoInfo The info for the websocket endpoint.\n     * @param {string=} transportSessionId Optional transportSessionId if this is connecting to an existing transport\n     *                                         session\n     * @param {string=} lastSessionId Optional lastSessionId if there was a previous connection\n     * @return {string} connection url\n     * @private\n     */\n    WebSocketConnection.connectionURL_ = function (repoInfo, transportSessionId, lastSessionId) {\n        var urlParams = {};\n        urlParams[Constants_1.VERSION_PARAM] = Constants_1.PROTOCOL_VERSION;\n        if (!util_5.isNodeSdk() &&\n            typeof location !== 'undefined' &&\n            location.href &&\n            location.href.indexOf(Constants_1.FORGE_DOMAIN) !== -1) {\n            urlParams[Constants_1.REFERER_PARAM] = Constants_1.FORGE_REF;\n        }\n        if (transportSessionId) {\n            urlParams[Constants_1.TRANSPORT_SESSION_PARAM] = transportSessionId;\n        }\n        if (lastSessionId) {\n            urlParams[Constants_1.LAST_SESSION_PARAM] = lastSessionId;\n        }\n        return repoInfo.connectionURL(Constants_1.WEBSOCKET, urlParams);\n    };\n    /**\n     *\n     * @param onMessage Callback when messages arrive\n     * @param onDisconnect Callback with connection lost.\n     */\n    WebSocketConnection.prototype.open = function (onMessage, onDisconnect) {\n        var _this = this;\n        this.onDisconnect = onDisconnect;\n        this.onMessage = onMessage;\n        this.log_('Websocket connecting to ' + this.connURL);\n        this.everConnected_ = false;\n        // Assume failure until proven otherwise.\n        storage_1.PersistentStorage.set('previous_websocket_failure', true);\n        try {\n            if (util_5.isNodeSdk()) {\n                var device = util_3.CONSTANTS.NODE_ADMIN ? 'AdminNode' : 'Node';\n                // UA Format: Firebase/<wire_protocol>/<sdk_version>/<platform>/<device>\n                var options = {\n                    headers: {\n                        'User-Agent': \"Firebase/\" + Constants_1.PROTOCOL_VERSION + \"/\" + app_1.default.SDK_VERSION + \"/\" + process.platform + \"/\" + device\n                    }\n                };\n                // Plumb appropriate http_proxy environment variable into faye-websocket if it exists.\n                var env = process['env'];\n                var proxy = this.connURL.indexOf('wss://') == 0\n                    ? env['HTTPS_PROXY'] || env['https_proxy']\n                    : env['HTTP_PROXY'] || env['http_proxy'];\n                if (proxy) {\n                    options['proxy'] = { origin: proxy };\n                }\n                this.mySock = new WebSocketImpl(this.connURL, [], options);\n            }\n            else {\n                this.mySock = new WebSocketImpl(this.connURL);\n            }\n        }\n        catch (e) {\n            this.log_('Error instantiating WebSocket.');\n            var error = e.message || e.data;\n            if (error) {\n                this.log_(error);\n            }\n            this.onClosed_();\n            return;\n        }\n        this.mySock.onopen = function () {\n            _this.log_('Websocket connected.');\n            _this.everConnected_ = true;\n        };\n        this.mySock.onclose = function () {\n            _this.log_('Websocket connection was disconnected.');\n            _this.mySock = null;\n            _this.onClosed_();\n        };\n        this.mySock.onmessage = function (m) {\n            _this.handleIncomingFrame(m);\n        };\n        this.mySock.onerror = function (e) {\n            _this.log_('WebSocket error.  Closing connection.');\n            var error = e.message || e.data;\n            if (error) {\n                _this.log_(error);\n            }\n            _this.onClosed_();\n        };\n    };\n    /**\n     * No-op for websockets, we don't need to do anything once the connection is confirmed as open\n     */\n    WebSocketConnection.prototype.start = function () { };\n    WebSocketConnection.forceDisallow = function () {\n        WebSocketConnection.forceDisallow_ = true;\n    };\n    WebSocketConnection.isAvailable = function () {\n        var isOldAndroid = false;\n        if (typeof navigator !== 'undefined' && navigator.userAgent) {\n            var oldAndroidRegex = /Android ([0-9]{0,}\\.[0-9]{0,})/;\n            var oldAndroidMatch = navigator.userAgent.match(oldAndroidRegex);\n            if (oldAndroidMatch && oldAndroidMatch.length > 1) {\n                if (parseFloat(oldAndroidMatch[1]) < 4.4) {\n                    isOldAndroid = true;\n                }\n            }\n        }\n        return (!isOldAndroid &&\n            WebSocketImpl !== null &&\n            !WebSocketConnection.forceDisallow_);\n    };\n    /**\n     * Returns true if we previously failed to connect with this transport.\n     * @return {boolean}\n     */\n    WebSocketConnection.previouslyFailed = function () {\n        // If our persistent storage is actually only in-memory storage,\n        // we default to assuming that it previously failed to be safe.\n        return (storage_1.PersistentStorage.isInMemoryStorage ||\n            storage_1.PersistentStorage.get('previous_websocket_failure') === true);\n    };\n    WebSocketConnection.prototype.markConnectionHealthy = function () {\n        storage_1.PersistentStorage.remove('previous_websocket_failure');\n    };\n    WebSocketConnection.prototype.appendFrame_ = function (data) {\n        this.frames.push(data);\n        if (this.frames.length == this.totalFrames) {\n            var fullMess = this.frames.join('');\n            this.frames = null;\n            var jsonMess = util_4.jsonEval(fullMess);\n            //handle the message\n            this.onMessage(jsonMess);\n        }\n    };\n    /**\n     * @param {number} frameCount The number of frames we are expecting from the server\n     * @private\n     */\n    WebSocketConnection.prototype.handleNewFrameCount_ = function (frameCount) {\n        this.totalFrames = frameCount;\n        this.frames = [];\n    };\n    /**\n     * Attempts to parse a frame count out of some text. If it can't, assumes a value of 1\n     * @param {!String} data\n     * @return {?String} Any remaining data to be process, or null if there is none\n     * @private\n     */\n    WebSocketConnection.prototype.extractFrameCount_ = function (data) {\n        util_1.assert(this.frames === null, 'We already have a frame buffer');\n        // TODO: The server is only supposed to send up to 9999 frames (i.e. length <= 4), but that isn't being enforced\n        // currently.  So allowing larger frame counts (length <= 6).  See https://app.asana.com/0/search/8688598998380/8237608042508\n        if (data.length <= 6) {\n            var frameCount = Number(data);\n            if (!isNaN(frameCount)) {\n                this.handleNewFrameCount_(frameCount);\n                return null;\n            }\n        }\n        this.handleNewFrameCount_(1);\n        return data;\n    };\n    /**\n     * Process a websocket frame that has arrived from the server.\n     * @param mess The frame data\n     */\n    WebSocketConnection.prototype.handleIncomingFrame = function (mess) {\n        if (this.mySock === null)\n            return; // Chrome apparently delivers incoming packets even after we .close() the connection sometimes.\n        var data = mess['data'];\n        this.bytesReceived += data.length;\n        this.stats_.incrementCounter('bytes_received', data.length);\n        this.resetKeepAlive();\n        if (this.frames !== null) {\n            // we're buffering\n            this.appendFrame_(data);\n        }\n        else {\n            // try to parse out a frame count, otherwise, assume 1 and process it\n            var remainingData = this.extractFrameCount_(data);\n            if (remainingData !== null) {\n                this.appendFrame_(remainingData);\n            }\n        }\n    };\n    /**\n     * Send a message to the server\n     * @param {Object} data The JSON object to transmit\n     */\n    WebSocketConnection.prototype.send = function (data) {\n        this.resetKeepAlive();\n        var dataStr = util_4.stringify(data);\n        this.bytesSent += dataStr.length;\n        this.stats_.incrementCounter('bytes_sent', dataStr.length);\n        //We can only fit a certain amount in each websocket frame, so we need to split this request\n        //up into multiple pieces if it doesn't fit in one request.\n        var dataSegs = util_2.splitStringBySize(dataStr, WEBSOCKET_MAX_FRAME_SIZE);\n        //Send the length header\n        if (dataSegs.length > 1) {\n            this.sendString_(String(dataSegs.length));\n        }\n        //Send the actual data in segments.\n        for (var i = 0; i < dataSegs.length; i++) {\n            this.sendString_(dataSegs[i]);\n        }\n    };\n    WebSocketConnection.prototype.shutdown_ = function () {\n        this.isClosed_ = true;\n        if (this.keepaliveTimer) {\n            clearInterval(this.keepaliveTimer);\n            this.keepaliveTimer = null;\n        }\n        if (this.mySock) {\n            this.mySock.close();\n            this.mySock = null;\n        }\n    };\n    WebSocketConnection.prototype.onClosed_ = function () {\n        if (!this.isClosed_) {\n            this.log_('WebSocket is closing itself');\n            this.shutdown_();\n            // since this is an internal close, trigger the close listener\n            if (this.onDisconnect) {\n                this.onDisconnect(this.everConnected_);\n                this.onDisconnect = null;\n            }\n        }\n    };\n    /**\n     * External-facing close handler.\n     * Close the websocket and kill the connection.\n     */\n    WebSocketConnection.prototype.close = function () {\n        if (!this.isClosed_) {\n            this.log_('WebSocket is being closed');\n            this.shutdown_();\n        }\n    };\n    /**\n     * Kill the current keepalive timer and start a new one, to ensure that it always fires N seconds after\n     * the last activity.\n     */\n    WebSocketConnection.prototype.resetKeepAlive = function () {\n        var _this = this;\n        clearInterval(this.keepaliveTimer);\n        this.keepaliveTimer = setInterval(function () {\n            //If there has been no websocket activity for a while, send a no-op\n            if (_this.mySock) {\n                _this.sendString_('0');\n            }\n            _this.resetKeepAlive();\n        }, Math.floor(WEBSOCKET_KEEPALIVE_INTERVAL));\n    };\n    /**\n     * Send a string over the websocket.\n     *\n     * @param {string} str String to send.\n     * @private\n     */\n    WebSocketConnection.prototype.sendString_ = function (str) {\n        // Firefox seems to sometimes throw exceptions (NS_ERROR_UNEXPECTED) from websocket .send()\n        // calls for some unknown reason.  We treat these as an error and disconnect.\n        // See https://app.asana.com/0/58926111402292/68021340250410\n        try {\n            this.mySock.send(str);\n        }\n        catch (e) {\n            this.log_('Exception thrown from WebSocket.send():', e.message || e.data, 'Closing connection.');\n            setTimeout(this.onClosed_.bind(this), 0);\n        }\n    };\n    /**\n     * Number of response before we consider the connection \"healthy.\"\n     * @type {number}\n     */\n    WebSocketConnection.responsesRequiredToBeHealthy = 2;\n    /**\n     * Time to wait for the connection te become healthy before giving up.\n     * @type {number}\n     */\n    WebSocketConnection.healthyTimeout = 30000;\n    return WebSocketConnection;\n}());\nexports.WebSocketConnection = WebSocketConnection;\n\n//# sourceMappingURL=WebSocketConnection.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/realtime/WebSocketConnection.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\n/**\n * Interface defining the set of actions that can be performed against the Firebase server\n * (basically corresponds to our wire protocol).\n *\n * @interface\n */\nvar ServerActions = /** @class */ (function () {\n    function ServerActions() {\n    }\n    /**\n     * @param {string} pathString\n     * @param {*} data\n     * @param {function(string, string)=} onComplete\n     * @param {string=} hash\n     */\n    ServerActions.prototype.put = function (pathString, data, onComplete, hash) { };\n    /**\n     * @param {string} pathString\n     * @param {*} data\n     * @param {function(string, ?string)} onComplete\n     * @param {string=} hash\n     */\n    ServerActions.prototype.merge = function (pathString, data, onComplete, hash) { };\n    /**\n     * Refreshes the auth token for the current connection.\n     * @param {string} token The authentication token\n     */\n    ServerActions.prototype.refreshAuthToken = function (token) { };\n    /**\n     * @param {string} pathString\n     * @param {*} data\n     * @param {function(string, string)=} onComplete\n     */\n    ServerActions.prototype.onDisconnectPut = function (pathString, data, onComplete) { };\n    /**\n     * @param {string} pathString\n     * @param {*} data\n     * @param {function(string, string)=} onComplete\n     */\n    ServerActions.prototype.onDisconnectMerge = function (pathString, data, onComplete) { };\n    /**\n     * @param {string} pathString\n     * @param {function(string, string)=} onComplete\n     */\n    ServerActions.prototype.onDisconnectCancel = function (pathString, onComplete) { };\n    /**\n     * @param {Object.<string, *>} stats\n     */\n    ServerActions.prototype.reportStats = function (stats) { };\n    return ServerActions;\n}());\nexports.ServerActions = ServerActions;\n\n//# sourceMappingURL=ServerActions.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/ServerActions.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar IndexedFilter_1 = require(\"./IndexedFilter\");\nvar PriorityIndex_1 = require(\"../../snap/indexes/PriorityIndex\");\nvar Node_1 = require(\"../../../core/snap/Node\");\nvar ChildrenNode_1 = require(\"../../snap/ChildrenNode\");\n/**\n * Filters nodes by range and uses an IndexFilter to track any changes after filtering the node\n *\n * @constructor\n * @implements {NodeFilter}\n */\nvar RangedFilter = /** @class */ (function () {\n    /**\n     * @param {!QueryParams} params\n     */\n    function RangedFilter(params) {\n        this.indexedFilter_ = new IndexedFilter_1.IndexedFilter(params.getIndex());\n        this.index_ = params.getIndex();\n        this.startPost_ = RangedFilter.getStartPost_(params);\n        this.endPost_ = RangedFilter.getEndPost_(params);\n    }\n    /**\n     * @return {!NamedNode}\n     */\n    RangedFilter.prototype.getStartPost = function () {\n        return this.startPost_;\n    };\n    /**\n     * @return {!NamedNode}\n     */\n    RangedFilter.prototype.getEndPost = function () {\n        return this.endPost_;\n    };\n    /**\n     * @param {!NamedNode} node\n     * @return {boolean}\n     */\n    RangedFilter.prototype.matches = function (node) {\n        return (this.index_.compare(this.getStartPost(), node) <= 0 &&\n            this.index_.compare(node, this.getEndPost()) <= 0);\n    };\n    /**\n     * @inheritDoc\n     */\n    RangedFilter.prototype.updateChild = function (snap, key, newChild, affectedPath, source, optChangeAccumulator) {\n        if (!this.matches(new Node_1.NamedNode(key, newChild))) {\n            newChild = ChildrenNode_1.ChildrenNode.EMPTY_NODE;\n        }\n        return this.indexedFilter_.updateChild(snap, key, newChild, affectedPath, source, optChangeAccumulator);\n    };\n    /**\n     * @inheritDoc\n     */\n    RangedFilter.prototype.updateFullNode = function (oldSnap, newSnap, optChangeAccumulator) {\n        if (newSnap.isLeafNode()) {\n            // Make sure we have a children node with the correct index, not a leaf node;\n            newSnap = ChildrenNode_1.ChildrenNode.EMPTY_NODE;\n        }\n        var filtered = newSnap.withIndex(this.index_);\n        // Don't support priorities on queries\n        filtered = filtered.updatePriority(ChildrenNode_1.ChildrenNode.EMPTY_NODE);\n        var self = this;\n        newSnap.forEachChild(PriorityIndex_1.PRIORITY_INDEX, function (key, childNode) {\n            if (!self.matches(new Node_1.NamedNode(key, childNode))) {\n                filtered = filtered.updateImmediateChild(key, ChildrenNode_1.ChildrenNode.EMPTY_NODE);\n            }\n        });\n        return this.indexedFilter_.updateFullNode(oldSnap, filtered, optChangeAccumulator);\n    };\n    /**\n     * @inheritDoc\n     */\n    RangedFilter.prototype.updatePriority = function (oldSnap, newPriority) {\n        // Don't support priorities on queries\n        return oldSnap;\n    };\n    /**\n     * @inheritDoc\n     */\n    RangedFilter.prototype.filtersNodes = function () {\n        return true;\n    };\n    /**\n     * @inheritDoc\n     */\n    RangedFilter.prototype.getIndexedFilter = function () {\n        return this.indexedFilter_;\n    };\n    /**\n     * @inheritDoc\n     */\n    RangedFilter.prototype.getIndex = function () {\n        return this.index_;\n    };\n    /**\n     * @param {!QueryParams} params\n     * @return {!NamedNode}\n     * @private\n     */\n    RangedFilter.getStartPost_ = function (params) {\n        if (params.hasStart()) {\n            var startName = params.getIndexStartName();\n            return params.getIndex().makePost(params.getIndexStartValue(), startName);\n        }\n        else {\n            return params.getIndex().minPost();\n        }\n    };\n    /**\n     * @param {!QueryParams} params\n     * @return {!NamedNode}\n     * @private\n     */\n    RangedFilter.getEndPost_ = function (params) {\n        if (params.hasEnd()) {\n            var endName = params.getIndexEndName();\n            return params.getIndex().makePost(params.getIndexEndValue(), endName);\n        }\n        else {\n            return params.getIndex().maxPost();\n        }\n    };\n    return RangedFilter;\n}());\nexports.RangedFilter = RangedFilter;\n\n//# sourceMappingURL=RangedFilter.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/view/filter/RangedFilter.js","// @flow\n/** @jsx h */\nimport './polyfills'\nimport domready from 'domready'\nimport { h, render } from 'preact'\nimport { LivePollWidget } from '../../../shared/widgets/LivePoll/LivePollWidget'\nimport { init } from '../../init'\nimport { enableDevtools } from '../../utils/devtools'\n\nconst rootElementClassName = 'dh-stemning-root' // import en css-modul her og på serveren - så slipper vi å hardkode\nwindow[rootElementClassName] = window[rootElementClassName] || {}\n\nfunction mountFn (el) {\n  const preloadedState = JSON.parse(decodeURIComponent(el.dataset.preloadedState))\n  const { clientId, theme, authConfig, showResult, resultMessage } = preloadedState\n  const AppComponent = (\n    <LivePollWidget\n      clientId={clientId}\n      authConfig={authConfig}\n      theme={theme}\n      showResult={showResult}\n      resultMessage={resultMessage}\n    />\n  )\n  render(AppComponent, el, el.firstChild)\n}\n\ndomready(() => init(rootElementClassName, mountFn, enableDevtools))\n\n\n\n// WEBPACK FOOTER //\n// ./src/client/widgets/livepoll/index.js","/* eslint-disable */\nimport 'regenerator-runtime/runtime'\nimport '../../polyfills/array.prototype.includes'\nimport '../../polyfills/array.prototype.find'\nimport Promise from 'promise-polyfill'\n\nif (!window.Promise) {\n  window.Promise = Promise\n}\n\n\n\n// WEBPACK FOOTER //\n// ./src/client/widgets/livepoll/polyfills.js","// @flow\n/** @jsx h */\n\nimport { h } from 'preact'\n\nimport styles from './LivePollWidget.css'\n\nimport { LivePoll } from './components/LivePoll/LivePoll'\nimport { Loader } from '../../components/Loader/Loader'\nimport { Error } from '../../components/Error/Error'\nimport { WithVotingState } from './WithVotingState'\nimport { WithPollState } from './WithPollState'\n\nimport type { Poll, AuthConfig, Breakpoint, Vote } from '../../types'\nimport type { LivePollWidgetRenderProps, WithVotingStateRenderProps, WithResultStateRenderProps } from './types'\n\nimport { WithResultState } from './WithResultState'\nimport { bem } from '../../helpers/bem'\nimport { themeToClassName } from '../../helpers/themeToClassName'\nimport\n{\n  breakpointToClassName,\n  getCurrentBreakpoint\n} from '../../helpers/breakpointToClassName'\nimport { StemningIcon } from '../../components/StemningIcon/StemningIcon'\nimport { AriaLive } from './components/LivePoll/AriaLive/AriaLive'\nimport { alternativeIdToAlternativeText } from './helpers/alternativeUtils'\nimport { RetryButton } from './components/LivePoll/RetryButton/RetryButton'\nimport { debounce } from '../../helpers/debounce'\nimport { PureComponent } from '../../helpers/pure-components'\n\ntype Props = {\n  clientId: number,\n  theme?: ?string,\n  authConfig: AuthConfig,\n  showResult?: boolean,\n  resultMessage?: string\n}\n\ntype State = {\n  poll?: Poll,\n  error?: ?Error,\n  breakpoint: Breakpoint\n}\n\nexport class LivePollWidget extends PureComponent<Props, State> {\n  debouncedResize = null\n  rootEl: ?HTMLElement = null\n  state = {\n    breakpoint: 'M'\n  }\n\n  getChildContext () {\n    return {\n      theme: this.props.theme,\n      isInteractive: true,\n      currentBreakpoint: this.state.breakpoint\n    }\n  }\n\n  componentDidMount = () => {\n    this.handleResize()\n    this.debouncedResize = debounce(this.handleResize, 16.667)\n    window.addEventListener('resize', this.debouncedResize)\n  }\n\n  componentWillUnmount = () => {\n    window.removeEventListener('resize', this.debouncedResize)\n  }\n\n  handleResize = () => {\n    if (!this.rootEl) {\n      return\n    }\n\n    const width = this.rootEl.offsetWidth\n    this.setState({ breakpoint: getCurrentBreakpoint(width) })\n  }\n\n  handleRetryButtonClicked () {\n    window.location.reload(true)\n  }\n\n  render () {\n    const {\n      clientId,\n      authConfig\n    } = this.props\n\n    return (\n      <WithPollState\n        authConfig={authConfig}\n        clientId={clientId}\n        render={this.renderWithPollState}\n      />\n    )\n  }\n  renderWithPollState = (arg: LivePollWidgetRenderProps) => {\n    const { error: loadPollError, poll, loading } = arg\n    const { breakpoint } = this.state\n    const {\n      clientId,\n      theme,\n      authConfig\n    } = this.props\n\n    return (\n      <div\n        ref={el => (this.rootEl = el)}\n        className={`${getBaseColorClass(theme)} ${bem(\n          styles.livePollWidget,\n          themeToClassName(theme),\n          breakpointToClassName(breakpoint)\n        )}`}\n      >\n\n        {loadPollError && (\n          <Error>\n            <div style={{ marginBottom: '10px' }}>\n              Avstemningen er ikke tilgjengelig akkurat nå.\n            </div>\n            <RetryButton onClick={this.handleRetryButtonClicked}>\n              Prøv å laste på nytt\n            </RetryButton>\n          </Error>\n        )}\n\n        {loading && (\n          <Loader>\n            <StemningIcon animate='infinite' />\n            <p>Laster innhold</p>\n          </Loader>\n        )}\n\n        {(!loading && !loadPollError && poll) && (\n          <WithVotingState\n            clientId={clientId}\n            poll={poll}\n            authConfig={authConfig}\n            render={arg => this.renderWithVotingState(arg, poll)}\n          />\n        )}\n      </div>\n    )\n  }\n\n  renderWithVotingState = (arg: WithVotingStateRenderProps, poll: Poll) => {\n    const {\n      hasVoted,\n      vote,\n      error: voteError,\n      onRegisterVote,\n      isDisplayVoteConfirmedMessage\n    } = arg\n\n    const { clientId,\n      authConfig } = this.props\n\n    const resultState = {\n      onRegisterVote,\n      hasVoted,\n      voteError,\n      isDisplayVoteConfirmedMessage,\n      vote\n    }\n\n    return <WithResultState\n      clientId={clientId}\n      authConfig={authConfig}\n      poll={poll}\n      render={arg => this.renderWithResultState(arg, resultState, poll)}\n    />\n  }\n\n  renderWithResultState = (arg: WithResultStateRenderProps, rest: WithResultStateRestProps, poll: Poll) => {\n    const {\n      result,\n      error: resultError,\n      lastUpdatedTime\n    } = arg\n\n    const {\n      showResult,\n      resultMessage\n    } = this.props\n\n    const { onRegisterVote,\n      hasVoted,\n      voteError,\n      isDisplayVoteConfirmedMessage,\n      vote } = rest\n    return <LivePoll\n      poll={poll}\n      onRegisterVote={onRegisterVote}\n      hasVoted={hasVoted}\n      voteError={voteError}\n      resultError={resultError}\n      result={result}\n      lastUpdatedTime={lastUpdatedTime}\n      showResult={showResult}\n      resultMessage={resultMessage}\n    >\n      <AriaLive type='assertive'>\n        {isDisplayVoteConfirmedMessage &&\n          `Din stemme på ${alternativeIdToAlternativeText(\n            vote.alternativeId,\n            poll.alternatives\n          )} ble registrert`}\n      </AriaLive>\n    </LivePoll>\n  }\n}\n\ntype WithResultStateRestProps = {\n  onRegisterVote: Function,\n  hasVoted: boolean,\n  voteError: Error,\n  isDisplayVoteConfirmedMessage: boolean,\n  vote: Vote\n}\n\nfunction getBaseColorClass (skin: ?string) {\n  if (skin === 'sport') {\n    return 'nrk-color-invert'\n  } else {\n    return 'nrk-color-base'\n  }\n}\n\n\n\n// WEBPACK FOOTER //\n// ./src/shared/widgets/LivePoll/LivePollWidget.js","// removed by extract-text-webpack-plugin\nmodule.exports = {\"livePollWidget\":\"dh-stemning-livePollWidget\",\"livePollWidget--medium\":\"dh-stemning-livePollWidget--medium\",\"livePollWidget--large\":\"dh-stemning-livePollWidget--large\",\"livePollWidget--extra-large\":\"dh-stemning-livePollWidget--extra-large\",\"livePollWidget--theme-monsen\":\"dh-stemning-livePollWidget--theme-monsen\",\"livePollWidget--theme-sport\":\"dh-stemning-livePollWidget--theme-sport\",\"livePollWidget--theme-sport-inverted-gray\":\"dh-stemning-livePollWidget--theme-sport-inverted-gray\"};\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./src/shared/widgets/LivePoll/LivePollWidget.css\n// module id = 112\n// module chunks = 0","// @flow\n/** @jsx h */\n\nimport { h, Component } from 'preact'\n\nimport styles from './LivePoll.css'\n\nimport { AlternativeList } from './AlternativeList/AlternativeList'\nimport type { Poll, Result as ResultType } from '../../../../types'\nimport { LastUpdatedTime } from './LastUpdatedTime/LastUpdatedTime'\nimport { VoteCounter } from './VoteCounter/VoteCounter'\nimport { breakpointToClassName } from '../../../../helpers/breakpointToClassName'\nimport { bem } from '../../../../helpers/bem'\nimport { LiveResult } from './LiveResult/LiveResult'\nimport { Branding } from '../../../../components/Branding/Branding'\n\ntype Props = {\n  poll: Poll,\n  onRegisterVote: any,\n  hasVoted: boolean,\n  voteError: ?Error,\n  result: ?ResultType,\n  resultError: ?Error,\n  lastUpdatedTime?: Date,\n  showResult?: boolean,\n  resultMessage?: string,\n  children?: ?any\n}\n\nexport class LivePoll extends Component<Props> {\n  render () {\n    const {\n      poll,\n      onRegisterVote,\n      hasVoted,\n      voteError,\n      resultError,\n      result,\n      lastUpdatedTime,\n      showResult,\n      resultMessage\n    } = this.props\n    const { currentBreakpoint } = this.context\n    const title = poll ? poll.title : ''\n\n    return (\n      <div\n        className={bem(\n          styles.livePoll,\n          breakpointToClassName(currentBreakpoint)\n        )}\n      >\n        <Branding />\n        <div className={styles.livePoll__header}>\n          <h2 className={styles.livePoll__title}>{title}</h2>\n        </div>\n\n        <div className={styles.livePoll__content}>\n          {!hasVoted && (\n            <AlternativeList\n              onAlternativeClicked={onRegisterVote}\n              alternatives={poll.alternatives}\n            />\n          )}\n          {hasVoted && (\n            <LiveResult\n              hasVoted={hasVoted}\n              poll={poll}\n              result={result}\n              resultError={resultError}\n              showResult={showResult}\n              resultMessage={resultMessage}\n            />\n          )}\n          {voteError &&\n            'Det skjedde en feil ved registrering av stemme. Har du skrudd av informasjonskapsler i nettleseren din?'}\n        </div>\n\n        <footer className={styles.livePoll__footer}>\n          {result && <VoteCounter voteCount={result.votes} />}\n          {hasVoted && <LastUpdatedTime lastUpdatedTime={lastUpdatedTime} />}\n        </footer>\n        {this.props.children}\n        {this.props.children}\n      </div>\n    )\n  }\n}\n\n\n\n// WEBPACK FOOTER //\n// ./src/shared/widgets/LivePoll/components/LivePoll/LivePoll.js","// removed by extract-text-webpack-plugin\nmodule.exports = {\"livePoll\":\"dh-stemning-livePoll\",\"livePoll__header\":\"dh-stemning-livePoll__header\",\"livePoll__title\":\"dh-stemning-livePoll__title\",\"livePoll--medium\":\"dh-stemning-livePoll--medium\",\"livePoll--large\":\"dh-stemning-livePoll--large\",\"livePoll--extra-large\":\"dh-stemning-livePoll--extra-large\",\"livePoll__content\":\"dh-stemning-livePoll__content\",\"livePoll__footer\":\"dh-stemning-livePoll__footer\"};\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./src/shared/widgets/LivePoll/components/LivePoll/LivePoll.css\n// module id = 114\n// module chunks = 0","// @flow\n/** @jsx h */\n\nimport { h, Component } from 'preact'\n\nimport styles from './AlternativeList.css'\nimport type { Alternative as AlternativeType } from '../../../../../types'\nimport { Alternative } from './components/Alternative'\nimport { bem } from '../../../../../helpers/bem'\nimport { breakpointToClassName } from '../../../../../helpers/breakpointToClassName'\nimport { getMaxLength } from '../../../../../helpers/get-text-max-length'\n\ntype Props = {\n  children?: ?any,\n  alternatives: any, // Array<AlternativeType>,\n  onAlternativeClicked: (alternative: AlternativeType) => void\n}\n\nconst MAX_SMALL_TEXT_LENGTH = 22\n\nexport class AlternativeList extends Component<Props> {\n  render () {\n    const { alternatives, onAlternativeClicked } = this.props\n    const { currentBreakpoint } = this.context\n    const alternativesItems = alternatives.list\n      .reduce((acc, alternativeId) => {\n        const alternative = alternatives[alternativeId]\n        alternative.id = alternativeId\n        acc.push(alternative)\n        return acc\n      }, [])\n\n    const currentMaxTextLength = getMaxLength(alternativesItems, 'text')\n    const fullWidthMobile = currentMaxTextLength > MAX_SMALL_TEXT_LENGTH\n    const oddEven = alternatives.list.length % 2 !== 0 ? 'odd' : 'even'\n    const two = alternatives.list.length === 2 ? 'two' : ''\n\n    return (\n      <div\n        className={bem(\n          styles.alternativeList,\n          two || oddEven,\n          breakpointToClassName(currentBreakpoint),\n          fullWidthMobile ? 'full-width' : null\n        )}\n      >\n        {alternativesItems.map((alternative, idx) => (\n          <div\n            key={alternative.id}\n            className={bem(\n              styles.alternativeList__item,\n              fullWidthMobile ? 'full-width' : null\n            )}\n          >\n            <Alternative\n              onClick={onAlternativeClicked}\n              alternative={alternative}\n              isLastItem={isLastItem(idx, alternatives)}\n              totalAlternativesCount={alternatives.length}\n            />\n          </div>\n        ))}\n      </div>\n    )\n  }\n}\n\nfunction isLastItem (index: number, alternatives: Array<AlternativeType>) {\n  return index === alternatives.length - 1\n}\n\n\n\n// WEBPACK FOOTER //\n// ./src/shared/widgets/LivePoll/components/LivePoll/AlternativeList/AlternativeList.js","// removed by extract-text-webpack-plugin\nmodule.exports = {\"alternativeList\":\"dh-stemning-alternativeList\",\"alternativeList--full-width\":\"dh-stemning-alternativeList--full-width\",\"alternativeList__item\":\"dh-stemning-alternativeList__item\",\"alternativeList--small\":\"dh-stemning-alternativeList--small\",\"alternativeList--extra-small\":\"dh-stemning-alternativeList--extra-small\",\"alternativeList__item--full-width\":\"dh-stemning-alternativeList__item--full-width\",\"alternativeList--medium\":\"dh-stemning-alternativeList--medium\",\"alternativeList--large\":\"dh-stemning-alternativeList--large\",\"alternativeList--extra-large\":\"dh-stemning-alternativeList--extra-large\"};\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./src/shared/widgets/LivePoll/components/LivePoll/AlternativeList/AlternativeList.css\n// module id = 116\n// module chunks = 0","// @flow\n/** @jsx h */\n\nimport { h, Component } from 'preact'\n\nimport styles from './Alternative.css'\nimport { Button } from '../../../../../../components/Button/Button'\n\nimport type { Alternative as AlternativeType } from '../../../../../../types'\nimport { bem } from '../../../../../../helpers/bem'\nimport { themeToClassName } from '../../../../../../helpers/themeToClassName'\nimport { breakpointToClassName } from '../../../../../../helpers/breakpointToClassName'\n\ntype Props = {\n  onClick: (alternative: AlternativeType) => void,\n  alternative: AlternativeType,\n  isLastItem: boolean,\n  totalAlternativesCount: number\n}\n\nexport class Alternative extends Component<Props> {\n  handleAlternativeClicked = () => {\n    this.props.onClick(this.props.alternative)\n  }\n\n  render () {\n    const { alternative, isLastItem, totalAlternativesCount } = this.props\n    const { theme, currentBreakpoint } = this.context\n    return (\n      <div\n        className={bem(\n          styles.alternative,\n          isLastItem ? 'last-item' : '',\n          totalAlternativesCount % 2 !== 0 ? 'part-of-odd-list' : '',\n          themeToClassName(theme),\n          breakpointToClassName(currentBreakpoint)\n        )}\n      >\n        <Button\n          className={styles.button}\n          onClick={this.handleAlternativeClicked}\n        >\n          {alternative.text}\n        </Button>\n      </div>\n    )\n  }\n}\n\n\n\n// WEBPACK FOOTER //\n// ./src/shared/widgets/LivePoll/components/LivePoll/AlternativeList/components/Alternative.js","// removed by extract-text-webpack-plugin\nmodule.exports = {\"alternative\":\"dh-stemning-alternative\",\"alternative--extra-small\":\"dh-stemning-alternative--extra-small\",\"alternative--part-of-odd-list\":\"dh-stemning-alternative--part-of-odd-list\",\"alternative--last-item\":\"dh-stemning-alternative--last-item\",\"alternative--medium\":\"dh-stemning-alternative--medium\",\"alternative--large\":\"dh-stemning-alternative--large\",\"alternative--extra-large\":\"dh-stemning-alternative--extra-large\",\"alternativeList__item--full-width\":\"dh-stemning-alternativeList__item--full-width\",\"button\":\"dh-stemning-button\"};\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./src/shared/widgets/LivePoll/components/LivePoll/AlternativeList/components/Alternative.css\n// module id = 118\n// module chunks = 0","// @flow\n/** @jsx h */\n\nimport { h } from 'preact'\nimport distanceInWordsStrict from 'date-fns/distance_in_words'\nimport differenceInSeconds from 'date-fns/difference_in_seconds'\nimport norwegianLocale from 'date-fns/locale/nb'\nimport { bem } from '../../../../../helpers/bem'\nimport styles from './LastUpdatedTime.css'\n\ntype Props = {\n  lastUpdatedTime: Date\n}\n\nexport function LastUpdatedTime (props: Props) {\n  const diff = differenceInSeconds(Date.now(), props.lastUpdatedTime)\n  const shouldShow = diff >= 60\n  return (\n    <div className={bem(styles.lastUpdatedTime, !shouldShow ? 'invisible' : '')} style>\n      Sist oppdatert for{' '}\n      {distanceInWordsStrict(new Date(), props.lastUpdatedTime, {\n        includeSeconds: true,\n        locale: norwegianLocale\n      })}{' '}\n      siden\n    </div>\n  )\n}\n\n\n\n// WEBPACK FOOTER //\n// ./src/shared/widgets/LivePoll/components/LivePoll/LastUpdatedTime/LastUpdatedTime.js","var compareDesc = require('../compare_desc/index.js')\nvar parse = require('../parse/index.js')\nvar differenceInSeconds = require('../difference_in_seconds/index.js')\nvar differenceInMonths = require('../difference_in_months/index.js')\nvar enLocale = require('../locale/en/index.js')\n\nvar MINUTES_IN_DAY = 1440\nvar MINUTES_IN_ALMOST_TWO_DAYS = 2520\nvar MINUTES_IN_MONTH = 43200\nvar MINUTES_IN_TWO_MONTHS = 86400\n\n/**\n * @category Common Helpers\n * @summary Return the distance between the given dates in words.\n *\n * @description\n * Return the distance between the given dates in words.\n *\n * | Distance between dates                                            | Result              |\n * |-------------------------------------------------------------------|---------------------|\n * | 0 ... 30 secs                                                     | less than a minute  |\n * | 30 secs ... 1 min 30 secs                                         | 1 minute            |\n * | 1 min 30 secs ... 44 mins 30 secs                                 | [2..44] minutes     |\n * | 44 mins ... 30 secs ... 89 mins 30 secs                           | about 1 hour        |\n * | 89 mins 30 secs ... 23 hrs 59 mins 30 secs                        | about [2..24] hours |\n * | 23 hrs 59 mins 30 secs ... 41 hrs 59 mins 30 secs                 | 1 day               |\n * | 41 hrs 59 mins 30 secs ... 29 days 23 hrs 59 mins 30 secs         | [2..30] days        |\n * | 29 days 23 hrs 59 mins 30 secs ... 44 days 23 hrs 59 mins 30 secs | about 1 month       |\n * | 44 days 23 hrs 59 mins 30 secs ... 59 days 23 hrs 59 mins 30 secs | about 2 months      |\n * | 59 days 23 hrs 59 mins 30 secs ... 1 yr                           | [2..12] months      |\n * | 1 yr ... 1 yr 3 months                                            | about 1 year        |\n * | 1 yr 3 months ... 1 yr 9 month s                                  | over 1 year         |\n * | 1 yr 9 months ... 2 yrs                                           | almost 2 years      |\n * | N yrs ... N yrs 3 months                                          | about N years       |\n * | N yrs 3 months ... N yrs 9 months                                 | over N years        |\n * | N yrs 9 months ... N+1 yrs                                        | almost N+1 years    |\n *\n * With `options.includeSeconds == true`:\n * | Distance between dates | Result               |\n * |------------------------|----------------------|\n * | 0 secs ... 5 secs      | less than 5 seconds  |\n * | 5 secs ... 10 secs     | less than 10 seconds |\n * | 10 secs ... 20 secs    | less than 20 seconds |\n * | 20 secs ... 40 secs    | half a minute        |\n * | 40 secs ... 60 secs    | less than a minute   |\n * | 60 secs ... 90 secs    | 1 minute             |\n *\n * @param {Date|String|Number} dateToCompare - the date to compare with\n * @param {Date|String|Number} date - the other date\n * @param {Object} [options] - the object with options\n * @param {Boolean} [options.includeSeconds=false] - distances less than a minute are more detailed\n * @param {Boolean} [options.addSuffix=false] - result indicates if the second date is earlier or later than the first\n * @param {Object} [options.locale=enLocale] - the locale object\n * @returns {String} the distance in words\n *\n * @example\n * // What is the distance between 2 July 2014 and 1 January 2015?\n * var result = distanceInWords(\n *   new Date(2014, 6, 2),\n *   new Date(2015, 0, 1)\n * )\n * //=> '6 months'\n *\n * @example\n * // What is the distance between 1 January 2015 00:00:15\n * // and 1 January 2015 00:00:00, including seconds?\n * var result = distanceInWords(\n *   new Date(2015, 0, 1, 0, 0, 15),\n *   new Date(2015, 0, 1, 0, 0, 0),\n *   {includeSeconds: true}\n * )\n * //=> 'less than 20 seconds'\n *\n * @example\n * // What is the distance from 1 January 2016\n * // to 1 January 2015, with a suffix?\n * var result = distanceInWords(\n *   new Date(2016, 0, 1),\n *   new Date(2015, 0, 1),\n *   {addSuffix: true}\n * )\n * //=> 'about 1 year ago'\n *\n * @example\n * // What is the distance between 1 August 2016 and 1 January 2015 in Esperanto?\n * var eoLocale = require('date-fns/locale/eo')\n * var result = distanceInWords(\n *   new Date(2016, 7, 1),\n *   new Date(2015, 0, 1),\n *   {locale: eoLocale}\n * )\n * //=> 'pli ol 1 jaro'\n */\nfunction distanceInWords (dirtyDateToCompare, dirtyDate, dirtyOptions) {\n  var options = dirtyOptions || {}\n\n  var comparison = compareDesc(dirtyDateToCompare, dirtyDate)\n\n  var locale = options.locale\n  var localize = enLocale.distanceInWords.localize\n  if (locale && locale.distanceInWords && locale.distanceInWords.localize) {\n    localize = locale.distanceInWords.localize\n  }\n\n  var localizeOptions = {\n    addSuffix: Boolean(options.addSuffix),\n    comparison: comparison\n  }\n\n  var dateLeft, dateRight\n  if (comparison > 0) {\n    dateLeft = parse(dirtyDateToCompare)\n    dateRight = parse(dirtyDate)\n  } else {\n    dateLeft = parse(dirtyDate)\n    dateRight = parse(dirtyDateToCompare)\n  }\n\n  var seconds = differenceInSeconds(dateRight, dateLeft)\n  var offset = dateRight.getTimezoneOffset() - dateLeft.getTimezoneOffset()\n  var minutes = Math.round(seconds / 60) - offset\n  var months\n\n  // 0 up to 2 mins\n  if (minutes < 2) {\n    if (options.includeSeconds) {\n      if (seconds < 5) {\n        return localize('lessThanXSeconds', 5, localizeOptions)\n      } else if (seconds < 10) {\n        return localize('lessThanXSeconds', 10, localizeOptions)\n      } else if (seconds < 20) {\n        return localize('lessThanXSeconds', 20, localizeOptions)\n      } else if (seconds < 40) {\n        return localize('halfAMinute', null, localizeOptions)\n      } else if (seconds < 60) {\n        return localize('lessThanXMinutes', 1, localizeOptions)\n      } else {\n        return localize('xMinutes', 1, localizeOptions)\n      }\n    } else {\n      if (minutes === 0) {\n        return localize('lessThanXMinutes', 1, localizeOptions)\n      } else {\n        return localize('xMinutes', minutes, localizeOptions)\n      }\n    }\n\n  // 2 mins up to 0.75 hrs\n  } else if (minutes < 45) {\n    return localize('xMinutes', minutes, localizeOptions)\n\n  // 0.75 hrs up to 1.5 hrs\n  } else if (minutes < 90) {\n    return localize('aboutXHours', 1, localizeOptions)\n\n  // 1.5 hrs up to 24 hrs\n  } else if (minutes < MINUTES_IN_DAY) {\n    var hours = Math.round(minutes / 60)\n    return localize('aboutXHours', hours, localizeOptions)\n\n  // 1 day up to 1.75 days\n  } else if (minutes < MINUTES_IN_ALMOST_TWO_DAYS) {\n    return localize('xDays', 1, localizeOptions)\n\n  // 1.75 days up to 30 days\n  } else if (minutes < MINUTES_IN_MONTH) {\n    var days = Math.round(minutes / MINUTES_IN_DAY)\n    return localize('xDays', days, localizeOptions)\n\n  // 1 month up to 2 months\n  } else if (minutes < MINUTES_IN_TWO_MONTHS) {\n    months = Math.round(minutes / MINUTES_IN_MONTH)\n    return localize('aboutXMonths', months, localizeOptions)\n  }\n\n  months = differenceInMonths(dateRight, dateLeft)\n\n  // 2 months up to 12 months\n  if (months < 12) {\n    var nearestMonth = Math.round(minutes / MINUTES_IN_MONTH)\n    return localize('xMonths', nearestMonth, localizeOptions)\n\n  // 1 year up to max Date\n  } else {\n    var monthsSinceStartOfYear = months % 12\n    var years = Math.floor(months / 12)\n\n    // N years up to 1 years 3 months\n    if (monthsSinceStartOfYear < 3) {\n      return localize('aboutXYears', years, localizeOptions)\n\n    // N years 3 months up to N years 9 months\n    } else if (monthsSinceStartOfYear < 9) {\n      return localize('overXYears', years, localizeOptions)\n\n    // N years 9 months up to N year 12 months\n    } else {\n      return localize('almostXYears', years + 1, localizeOptions)\n    }\n  }\n}\n\nmodule.exports = distanceInWords\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/date-fns/distance_in_words/index.js","var parse = require('../parse/index.js')\n\n/**\n * @category Common Helpers\n * @summary Compare the two dates reverse chronologically and return -1, 0 or 1.\n *\n * @description\n * Compare the two dates and return -1 if the first date is after the second,\n * 1 if the first date is before the second or 0 if dates are equal.\n *\n * @param {Date|String|Number} dateLeft - the first date to compare\n * @param {Date|String|Number} dateRight - the second date to compare\n * @returns {Number} the result of the comparison\n *\n * @example\n * // Compare 11 February 1987 and 10 July 1989 reverse chronologically:\n * var result = compareDesc(\n *   new Date(1987, 1, 11),\n *   new Date(1989, 6, 10)\n * )\n * //=> 1\n *\n * @example\n * // Sort the array of dates in reverse chronological order:\n * var result = [\n *   new Date(1995, 6, 2),\n *   new Date(1987, 1, 11),\n *   new Date(1989, 6, 10)\n * ].sort(compareDesc)\n * //=> [\n * //   Sun Jul 02 1995 00:00:00,\n * //   Mon Jul 10 1989 00:00:00,\n * //   Wed Feb 11 1987 00:00:00\n * // ]\n */\nfunction compareDesc (dirtyDateLeft, dirtyDateRight) {\n  var dateLeft = parse(dirtyDateLeft)\n  var timeLeft = dateLeft.getTime()\n  var dateRight = parse(dirtyDateRight)\n  var timeRight = dateRight.getTime()\n\n  if (timeLeft > timeRight) {\n    return -1\n  } else if (timeLeft < timeRight) {\n    return 1\n  } else {\n    return 0\n  }\n}\n\nmodule.exports = compareDesc\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/date-fns/compare_desc/index.js","/**\n * @category Common Helpers\n * @summary Is the given argument an instance of Date?\n *\n * @description\n * Is the given argument an instance of Date?\n *\n * @param {*} argument - the argument to check\n * @returns {Boolean} the given argument is an instance of Date\n *\n * @example\n * // Is 'mayonnaise' a Date?\n * var result = isDate('mayonnaise')\n * //=> false\n */\nfunction isDate (argument) {\n  return argument instanceof Date\n}\n\nmodule.exports = isDate\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/date-fns/is_date/index.js","var parse = require('../parse/index.js')\n\n/**\n * @category Millisecond Helpers\n * @summary Get the number of milliseconds between the given dates.\n *\n * @description\n * Get the number of milliseconds between the given dates.\n *\n * @param {Date|String|Number} dateLeft - the later date\n * @param {Date|String|Number} dateRight - the earlier date\n * @returns {Number} the number of milliseconds\n *\n * @example\n * // How many milliseconds are between\n * // 2 July 2014 12:30:20.600 and 2 July 2014 12:30:21.700?\n * var result = differenceInMilliseconds(\n *   new Date(2014, 6, 2, 12, 30, 21, 700),\n *   new Date(2014, 6, 2, 12, 30, 20, 600)\n * )\n * //=> 1100\n */\nfunction differenceInMilliseconds (dirtyDateLeft, dirtyDateRight) {\n  var dateLeft = parse(dirtyDateLeft)\n  var dateRight = parse(dirtyDateRight)\n  return dateLeft.getTime() - dateRight.getTime()\n}\n\nmodule.exports = differenceInMilliseconds\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/date-fns/difference_in_milliseconds/index.js","var parse = require('../parse/index.js')\nvar differenceInCalendarMonths = require('../difference_in_calendar_months/index.js')\nvar compareAsc = require('../compare_asc/index.js')\n\n/**\n * @category Month Helpers\n * @summary Get the number of full months between the given dates.\n *\n * @description\n * Get the number of full months between the given dates.\n *\n * @param {Date|String|Number} dateLeft - the later date\n * @param {Date|String|Number} dateRight - the earlier date\n * @returns {Number} the number of full months\n *\n * @example\n * // How many full months are between 31 January 2014 and 1 September 2014?\n * var result = differenceInMonths(\n *   new Date(2014, 8, 1),\n *   new Date(2014, 0, 31)\n * )\n * //=> 7\n */\nfunction differenceInMonths (dirtyDateLeft, dirtyDateRight) {\n  var dateLeft = parse(dirtyDateLeft)\n  var dateRight = parse(dirtyDateRight)\n\n  var sign = compareAsc(dateLeft, dateRight)\n  var difference = Math.abs(differenceInCalendarMonths(dateLeft, dateRight))\n  dateLeft.setMonth(dateLeft.getMonth() - sign * difference)\n\n  // Math.abs(diff in full months - diff in calendar months) === 1 if last calendar month is not full\n  // If so, result must be decreased by 1 in absolute value\n  var isLastMonthNotFull = compareAsc(dateLeft, dateRight) === -sign\n  return sign * (difference - isLastMonthNotFull)\n}\n\nmodule.exports = differenceInMonths\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/date-fns/difference_in_months/index.js","var parse = require('../parse/index.js')\n\n/**\n * @category Month Helpers\n * @summary Get the number of calendar months between the given dates.\n *\n * @description\n * Get the number of calendar months between the given dates.\n *\n * @param {Date|String|Number} dateLeft - the later date\n * @param {Date|String|Number} dateRight - the earlier date\n * @returns {Number} the number of calendar months\n *\n * @example\n * // How many calendar months are between 31 January 2014 and 1 September 2014?\n * var result = differenceInCalendarMonths(\n *   new Date(2014, 8, 1),\n *   new Date(2014, 0, 31)\n * )\n * //=> 8\n */\nfunction differenceInCalendarMonths (dirtyDateLeft, dirtyDateRight) {\n  var dateLeft = parse(dirtyDateLeft)\n  var dateRight = parse(dirtyDateRight)\n\n  var yearDiff = dateLeft.getFullYear() - dateRight.getFullYear()\n  var monthDiff = dateLeft.getMonth() - dateRight.getMonth()\n\n  return yearDiff * 12 + monthDiff\n}\n\nmodule.exports = differenceInCalendarMonths\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/date-fns/difference_in_calendar_months/index.js","var parse = require('../parse/index.js')\n\n/**\n * @category Common Helpers\n * @summary Compare the two dates and return -1, 0 or 1.\n *\n * @description\n * Compare the two dates and return 1 if the first date is after the second,\n * -1 if the first date is before the second or 0 if dates are equal.\n *\n * @param {Date|String|Number} dateLeft - the first date to compare\n * @param {Date|String|Number} dateRight - the second date to compare\n * @returns {Number} the result of the comparison\n *\n * @example\n * // Compare 11 February 1987 and 10 July 1989:\n * var result = compareAsc(\n *   new Date(1987, 1, 11),\n *   new Date(1989, 6, 10)\n * )\n * //=> -1\n *\n * @example\n * // Sort the array of dates:\n * var result = [\n *   new Date(1995, 6, 2),\n *   new Date(1987, 1, 11),\n *   new Date(1989, 6, 10)\n * ].sort(compareAsc)\n * //=> [\n * //   Wed Feb 11 1987 00:00:00,\n * //   Mon Jul 10 1989 00:00:00,\n * //   Sun Jul 02 1995 00:00:00\n * // ]\n */\nfunction compareAsc (dirtyDateLeft, dirtyDateRight) {\n  var dateLeft = parse(dirtyDateLeft)\n  var timeLeft = dateLeft.getTime()\n  var dateRight = parse(dirtyDateRight)\n  var timeRight = dateRight.getTime()\n\n  if (timeLeft < timeRight) {\n    return -1\n  } else if (timeLeft > timeRight) {\n    return 1\n  } else {\n    return 0\n  }\n}\n\nmodule.exports = compareAsc\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/date-fns/compare_asc/index.js","var buildDistanceInWordsLocale = require('./build_distance_in_words_locale/index.js')\nvar buildFormatLocale = require('./build_format_locale/index.js')\n\n/**\n * @category Locales\n * @summary English locale.\n */\nmodule.exports = {\n  distanceInWords: buildDistanceInWordsLocale(),\n  format: buildFormatLocale()\n}\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/date-fns/locale/en/index.js","function buildDistanceInWordsLocale () {\n  var distanceInWordsLocale = {\n    lessThanXSeconds: {\n      one: 'less than a second',\n      other: 'less than {{count}} seconds'\n    },\n\n    xSeconds: {\n      one: '1 second',\n      other: '{{count}} seconds'\n    },\n\n    halfAMinute: 'half a minute',\n\n    lessThanXMinutes: {\n      one: 'less than a minute',\n      other: 'less than {{count}} minutes'\n    },\n\n    xMinutes: {\n      one: '1 minute',\n      other: '{{count}} minutes'\n    },\n\n    aboutXHours: {\n      one: 'about 1 hour',\n      other: 'about {{count}} hours'\n    },\n\n    xHours: {\n      one: '1 hour',\n      other: '{{count}} hours'\n    },\n\n    xDays: {\n      one: '1 day',\n      other: '{{count}} days'\n    },\n\n    aboutXMonths: {\n      one: 'about 1 month',\n      other: 'about {{count}} months'\n    },\n\n    xMonths: {\n      one: '1 month',\n      other: '{{count}} months'\n    },\n\n    aboutXYears: {\n      one: 'about 1 year',\n      other: 'about {{count}} years'\n    },\n\n    xYears: {\n      one: '1 year',\n      other: '{{count}} years'\n    },\n\n    overXYears: {\n      one: 'over 1 year',\n      other: 'over {{count}} years'\n    },\n\n    almostXYears: {\n      one: 'almost 1 year',\n      other: 'almost {{count}} years'\n    }\n  }\n\n  function localize (token, count, options) {\n    options = options || {}\n\n    var result\n    if (typeof distanceInWordsLocale[token] === 'string') {\n      result = distanceInWordsLocale[token]\n    } else if (count === 1) {\n      result = distanceInWordsLocale[token].one\n    } else {\n      result = distanceInWordsLocale[token].other.replace('{{count}}', count)\n    }\n\n    if (options.addSuffix) {\n      if (options.comparison > 0) {\n        return 'in ' + result\n      } else {\n        return result + ' ago'\n      }\n    }\n\n    return result\n  }\n\n  return {\n    localize: localize\n  }\n}\n\nmodule.exports = buildDistanceInWordsLocale\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/date-fns/locale/en/build_distance_in_words_locale/index.js","var buildFormattingTokensRegExp = require('../../_lib/build_formatting_tokens_reg_exp/index.js')\n\nfunction buildFormatLocale () {\n  // Note: in English, the names of days of the week and months are capitalized.\n  // If you are making a new locale based on this one, check if the same is true for the language you're working on.\n  // Generally, formatted dates should look like they are in the middle of a sentence,\n  // e.g. in Spanish language the weekdays and months should be in the lowercase.\n  var months3char = ['Jan', 'Feb', 'Mar', 'Apr', 'May', 'Jun', 'Jul', 'Aug', 'Sep', 'Oct', 'Nov', 'Dec']\n  var monthsFull = ['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December']\n  var weekdays2char = ['Su', 'Mo', 'Tu', 'We', 'Th', 'Fr', 'Sa']\n  var weekdays3char = ['Sun', 'Mon', 'Tue', 'Wed', 'Thu', 'Fri', 'Sat']\n  var weekdaysFull = ['Sunday', 'Monday', 'Tuesday', 'Wednesday', 'Thursday', 'Friday', 'Saturday']\n  var meridiemUppercase = ['AM', 'PM']\n  var meridiemLowercase = ['am', 'pm']\n  var meridiemFull = ['a.m.', 'p.m.']\n\n  var formatters = {\n    // Month: Jan, Feb, ..., Dec\n    'MMM': function (date) {\n      return months3char[date.getMonth()]\n    },\n\n    // Month: January, February, ..., December\n    'MMMM': function (date) {\n      return monthsFull[date.getMonth()]\n    },\n\n    // Day of week: Su, Mo, ..., Sa\n    'dd': function (date) {\n      return weekdays2char[date.getDay()]\n    },\n\n    // Day of week: Sun, Mon, ..., Sat\n    'ddd': function (date) {\n      return weekdays3char[date.getDay()]\n    },\n\n    // Day of week: Sunday, Monday, ..., Saturday\n    'dddd': function (date) {\n      return weekdaysFull[date.getDay()]\n    },\n\n    // AM, PM\n    'A': function (date) {\n      return (date.getHours() / 12) >= 1 ? meridiemUppercase[1] : meridiemUppercase[0]\n    },\n\n    // am, pm\n    'a': function (date) {\n      return (date.getHours() / 12) >= 1 ? meridiemLowercase[1] : meridiemLowercase[0]\n    },\n\n    // a.m., p.m.\n    'aa': function (date) {\n      return (date.getHours() / 12) >= 1 ? meridiemFull[1] : meridiemFull[0]\n    }\n  }\n\n  // Generate ordinal version of formatters: M -> Mo, D -> Do, etc.\n  var ordinalFormatters = ['M', 'D', 'DDD', 'd', 'Q', 'W']\n  ordinalFormatters.forEach(function (formatterToken) {\n    formatters[formatterToken + 'o'] = function (date, formatters) {\n      return ordinal(formatters[formatterToken](date))\n    }\n  })\n\n  return {\n    formatters: formatters,\n    formattingTokensRegExp: buildFormattingTokensRegExp(formatters)\n  }\n}\n\nfunction ordinal (number) {\n  var rem100 = number % 100\n  if (rem100 > 20 || rem100 < 10) {\n    switch (rem100 % 10) {\n      case 1:\n        return number + 'st'\n      case 2:\n        return number + 'nd'\n      case 3:\n        return number + 'rd'\n    }\n  }\n  return number + 'th'\n}\n\nmodule.exports = buildFormatLocale\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/date-fns/locale/en/build_format_locale/index.js","var buildDistanceInWordsLocale = require('./build_distance_in_words_locale/index.js')\nvar buildFormatLocale = require('./build_format_locale/index.js')\n\n/**\n * @category Locales\n * @summary Norwegian Bokmål locale.\n * @author Hans-Kristian Koren [@Hanse]{@link https://github.com/Hanse}\n */\nmodule.exports = {\n  distanceInWords: buildDistanceInWordsLocale(),\n  format: buildFormatLocale()\n}\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/date-fns/locale/nb/index.js","function buildDistanceInWordsLocale () {\n  var distanceInWordsLocale = {\n    lessThanXSeconds: {\n      one: 'mindre enn ett sekund',\n      other: 'mindre enn {{count}} sekunder'\n    },\n\n    xSeconds: {\n      one: 'ett sekund',\n      other: '{{count}} sekunder'\n    },\n\n    halfAMinute: 'et halvt minutt',\n\n    lessThanXMinutes: {\n      one: 'mindre enn ett minutt',\n      other: 'mindre enn {{count}} minutter'\n    },\n\n    xMinutes: {\n      one: 'ett minutt',\n      other: '{{count}} minutter'\n    },\n\n    aboutXHours: {\n      one: 'rundt en time',\n      other: 'rundt {{count}} timer'\n    },\n\n    xHours: {\n      one: 'en time',\n      other: '{{count}} timer'\n    },\n\n    xDays: {\n      one: 'en dag',\n      other: '{{count}} dager'\n    },\n\n    aboutXMonths: {\n      one: 'rundt en måned',\n      other: 'rundt {{count}} måneder'\n    },\n\n    xMonths: {\n      one: 'en måned',\n      other: '{{count}} måneder'\n    },\n\n    aboutXYears: {\n      one: 'rundt ett år',\n      other: 'rundt {{count}} år'\n    },\n\n    xYears: {\n      one: 'ett år',\n      other: '{{count}} år'\n    },\n\n    overXYears: {\n      one: 'over ett år',\n      other: 'over {{count}} år'\n    },\n\n    almostXYears: {\n      one: 'nesten ett år',\n      other: 'nesten {{count}} år'\n    }\n  }\n\n  function localize (token, count, options) {\n    options = options || {}\n\n    var result\n    if (typeof distanceInWordsLocale[token] === 'string') {\n      result = distanceInWordsLocale[token]\n    } else if (count === 1) {\n      result = distanceInWordsLocale[token].one\n    } else {\n      result = distanceInWordsLocale[token].other.replace('{{count}}', count)\n    }\n\n    if (options.addSuffix) {\n      if (options.comparison > 0) {\n        return 'om ' + result\n      } else {\n        return result + ' siden'\n      }\n    }\n\n    return result\n  }\n\n  return {\n    localize: localize\n  }\n}\n\nmodule.exports = buildDistanceInWordsLocale\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/date-fns/locale/nb/build_distance_in_words_locale/index.js","var buildFormattingTokensRegExp = require('../../_lib/build_formatting_tokens_reg_exp/index.js')\n\nfunction buildFormatLocale () {\n  var months3char = ['jan.', 'feb.', 'mars', 'april', 'mai', 'juni', 'juli', 'aug.', 'sep.', 'okt.', 'nov.', 'des.']\n  var monthsFull = ['januar', 'februar', 'mars', 'april', 'mai', 'juni', 'juli', 'august', 'september', 'oktober', 'november', 'desember']\n  var weekdays2char = ['sø', 'ma', 'ti', 'on', 'to', 'fr', 'lø']\n  var weekdays3char = ['sø.', 'ma.', 'ti.', 'on.', 'to.', 'fr.', 'lø.']\n  var weekdaysFull = ['søndag', 'mandag', 'tirsdag', 'onsdag', 'torsdag', 'fredag', 'lørdag']\n  var meridiemUppercase = ['AM', 'PM']\n  var meridiemLowercase = ['am', 'pm']\n  var meridiemFull = ['a.m.', 'p.m.']\n\n  var formatters = {\n    // Month: Jan, Feb, ..., Dec\n    'MMM': function (date) {\n      return months3char[date.getMonth()]\n    },\n\n    // Month: January, February, ..., December\n    'MMMM': function (date) {\n      return monthsFull[date.getMonth()]\n    },\n\n    // Day of week: Su, Mo, ..., Sa\n    'dd': function (date) {\n      return weekdays2char[date.getDay()]\n    },\n\n    // Day of week: Sun, Mon, ..., Sat\n    'ddd': function (date) {\n      return weekdays3char[date.getDay()]\n    },\n\n    // Day of week: Sunday, Monday, ..., Saturday\n    'dddd': function (date) {\n      return weekdaysFull[date.getDay()]\n    },\n\n    // AM, PM\n    'A': function (date) {\n      return (date.getHours() / 12) >= 1 ? meridiemUppercase[1] : meridiemUppercase[0]\n    },\n\n    // am, pm\n    'a': function (date) {\n      return (date.getHours() / 12) >= 1 ? meridiemLowercase[1] : meridiemLowercase[0]\n    },\n\n    // a.m., p.m.\n    'aa': function (date) {\n      return (date.getHours() / 12) >= 1 ? meridiemFull[1] : meridiemFull[0]\n    }\n  }\n\n  // Generate ordinal version of formatters: M -> Mo, D -> Do, etc.\n  var ordinalFormatters = ['M', 'D', 'DDD', 'd', 'Q', 'W']\n  ordinalFormatters.forEach(function (formatterToken) {\n    formatters[formatterToken + 'o'] = function (date, formatters) {\n      return ordinal(formatters[formatterToken](date))\n    }\n  })\n\n  return {\n    formatters: formatters,\n    formattingTokensRegExp: buildFormattingTokensRegExp(formatters)\n  }\n}\n\nfunction ordinal (number) {\n  return number + '.'\n}\n\nmodule.exports = buildFormatLocale\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/date-fns/locale/nb/build_format_locale/index.js","// removed by extract-text-webpack-plugin\nmodule.exports = {\"lastUpdatedTime\":\"dh-stemning-lastUpdatedTime\",\"lastUpdatedTime--invisible\":\"dh-stemning-lastUpdatedTime--invisible\"};\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./src/shared/widgets/LivePoll/components/LivePoll/LastUpdatedTime/LastUpdatedTime.css\n// module id = 133\n// module chunks = 0","// @flow @jsx h\n\nimport { h } from 'preact'\nimport { Result } from '../../../../../components/Result/Result'\nimport { getSelectedAlternativeId } from '../../../helpers/cookieUtils'\nimport type { Poll, Result as ResultType } from '../../../../../types'\nimport { bem } from '../../../../../helpers/bem'\nimport { themeToClassName } from '../../../../../helpers/themeToClassName'\n\nimport styles from './LiveResult.css'\n\ntype Props = {\n  result: ResultType,\n  resultError?: Error,\n  poll: Poll,\n  showResult?: boolean,\n  resultMessage?: string\n}\n\ntype Context = {\n  theme: string\n}\n\nconst LiveResult = (props: Props, { theme }: Context) => {\n  const {\n    poll,\n    result,\n    resultError,\n    showResult = true,\n    resultMessage = 'Takk for din stemme'\n  } = props\n\n  if (showResult) {\n    return (\n      <Result\n        highlightedResultItemId={getHighlightedResultItemId(poll.id)}\n        result={result}\n        error={resultError}\n        clickable\n      />\n    )\n  }\n\n  if (!resultMessage) {\n    return null\n  }\n\n  return (\n    <div class={bem(styles['live-result'], themeToClassName(theme))}>\n      <p class={styles['live-result__paragraph']}>\n        {resultMessage}\n        <svg\n          aria-hidden\n          xmlns='http://www.w3.org/2000/svg'\n          width='14'\n          height='14'\n          viewBox='0 0 14 14'\n          class={styles['live-result__check']}\n        >\n          <path\n            fill='none'\n            stroke='#00B2F7'\n            stroke-linecap='round'\n            stroke-linejoin='round'\n            stroke-width='2'\n            d='M1 6.63L4.77 11 13 1'\n          />\n        </svg>\n      </p>\n    </div>\n  )\n}\n\nfunction getHighlightedResultItemId (pollId: number): ?number {\n  return getSelectedAlternativeId(pollId)\n}\n\nexport { LiveResult }\n\n\n\n// WEBPACK FOOTER //\n// ./src/shared/widgets/LivePoll/components/LivePoll/LiveResult/LiveResult.js","// removed by extract-text-webpack-plugin\nmodule.exports = {\"live-result\":\"dh-stemning-live-result\",\"live-result__paragraph\":\"dh-stemning-live-result__paragraph\",\"live-result__check\":\"dh-stemning-live-result__check\",\"live-result--theme-sport\":\"dh-stemning-live-result--theme-sport\",\"live-result--theme-sport-inverted\":\"dh-stemning-live-result--theme-sport-inverted\",\"live-result--theme-monsen\":\"dh-stemning-live-result--theme-monsen\"};\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./src/shared/widgets/LivePoll/components/LivePoll/LiveResult/LiveResult.css\n// module id = 135\n// module chunks = 0","// @flow\n\nimport { PureComponent } from '../../helpers/pure-components'; import { setHasVoted, hasVoted as getHasVoted } from './helpers/cookieUtils'\nimport { createVote } from './helpers/createVote'\nimport { registerVote } from '../../db/registerVote'\n\nimport type { Alternative, Poll, Vote, AuthConfig } from '../../types'\nimport type { WithVotingStateRenderProps } from './types'\n\ntype Props = {\n  clientId: number,\n  poll: Poll,\n  authConfig: AuthConfig,\n  render: (props: WithVotingStateRenderProps) =>?any\n}\n\ntype State = {\n  hasVoted?: ?boolean,\n  error?: ?Error,\n  vote?: ?Vote,\n  isDisplayVoteConfirmedMessage?: ?boolean\n}\n\nexport class WithVotingState extends PureComponent<Props, State> {\n  constructor (props: Props) {\n    super(props)\n    const { poll } = props\n    const hasVoted = getHasVoted(poll.id)\n    this.state = {\n      hasVoted\n    }\n  }\n\n  componentWillReceiveProps (nextProps: Props) {\n    const isNewPoll = this.props.poll.id !== nextProps.poll.id\n    if (isNewPoll) {\n      const hasVoted = getHasVoted(nextProps.poll.id)\n      this.setState({\n        hasVoted\n      })\n    }\n  }\n\n  handleRegisterVote = async (alternative: Alternative) => {\n    const { clientId, poll, authConfig } = this.props\n    const vote = createVote(clientId, poll, alternative)\n    this.setState({\n      hasVoted: true,\n      vote: vote,\n      error: null\n    })\n    try {\n      await registerVote(vote, authConfig)\n\n      // when vote has been registered, it is safe to set a cookie that\n      // tells the browser that the user has registered a vote for this poll\n      setHasVoted(poll.id, alternative.id)\n\n      // Facilitate the display of a 'vote confirmed' message to screen readers when vote has\n      // been registered. Remove / disable it after it has been picked up by the screen reader\n      this.setState(\n        {\n          isDisplayVoteConfirmedMessage: true\n        },\n        () => {\n          setTimeout(() => {\n            this.setState({\n              isDisplayVoteConfirmedMessage: false\n            })\n          }, 2000)\n        }\n      )\n    } catch (error) {\n      const errorMessage = 'Unable to register vote'\n      console.error(errorMessage)\n      this.setState({\n        hasVoted: false,\n        vote: null,\n        error: new Error(errorMessage)\n      })\n    }\n  }\n\n  render () {\n    return this.props.render({\n      ...this.state,\n      onRegisterVote: this.handleRegisterVote\n    })\n  }\n}\n\n\n\n// WEBPACK FOOTER //\n// ./src/shared/widgets/LivePoll/WithVotingState.js","// @flow\n\nimport type { Alternative, Poll, Vote } from '../../../types'\n\nexport function createVote (clientId: number, poll: Poll, alternative: Alternative): Vote {\n  return {\n    clientId,\n    pollId: poll.id,\n    alternativeId: alternative.id\n  }\n}\n\n\n\n// WEBPACK FOOTER //\n// ./src/shared/widgets/LivePoll/helpers/createVote.js","// @flow\n\nimport { getFirebaseInstance } from './firebase'\nimport { cookiesEnabled } from '../widgets/LivePoll/helpers/cookieUtils'\n\nimport type { Vote, AuthConfig } from '../types'\n\nexport async function registerVote (vote: Vote, authConfig: AuthConfig) {\n  if (!cookiesEnabled()) {\n    throw new Error('Cookies are not enabled')\n  }\n\n  const credentials = await getFirebaseInstance(authConfig)\n    .auth()\n    .signInAnonymously()\n\n  const pollVotesRef = getFirebaseInstance()\n    .database()\n    .ref('pollVotes')\n\n  const voted = await pollVotesRef.push({\n    uid: credentials.uid,\n    alternativeId: vote.alternativeId,\n    pollId: Number(vote.pollId),\n    channelId: Number(vote.clientId)\n  })\n  return voted\n}\n\n\n\n// WEBPACK FOOTER //\n// ./src/shared/db/registerVote.js","/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nrequire('@firebase/polyfill');\nmodule.exports = require('@firebase/app').default;\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/firebase/app/index.js","/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nimport './src/polyfills/promise';\nimport './src/shims/find';\nimport './src/shims/findIndex';\n\n//# sourceMappingURL=index.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/polyfill/dist/esm/index.js","/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nvar __global = (function () {\n    if (typeof global !== 'undefined') {\n        return global;\n    }\n    if (typeof window !== 'undefined') {\n        return window;\n    }\n    if (typeof self !== 'undefined') {\n        return self;\n    }\n    throw new Error('unable to locate global object');\n})();\n// Polyfill Promise\nif (typeof Promise === 'undefined') {\n    // HACK: TS throws an error if I attempt to use 'dot-notation'\n    __global['Promise'] = Promise = require('promise-polyfill');\n}\n\n//# sourceMappingURL=promise.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/polyfill/dist/esm/src/polyfills/promise.js","/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * This is the Array.prototype.find polyfill from MDN\n * https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/find\n * https://tc39.github.io/ecma262/#sec-array.prototype.find\n */\nif (!Array.prototype.find) {\n    Object.defineProperty(Array.prototype, 'find', {\n        value: function (predicate) {\n            // 1. Let O be ? ToObject(this value).\n            if (this == null) {\n                throw new TypeError('\"this\" is null or not defined');\n            }\n            var o = Object(this);\n            // 2. Let len be ? ToLength(? Get(O, \"length\")).\n            var len = o.length >>> 0;\n            // 3. If IsCallable(predicate) is false, throw a TypeError exception.\n            if (typeof predicate !== 'function') {\n                throw new TypeError('predicate must be a function');\n            }\n            // 4. If thisArg was supplied, let T be thisArg; else let T be undefined.\n            var thisArg = arguments[1];\n            // 5. Let k be 0.\n            var k = 0;\n            // 6. Repeat, while k < len\n            while (k < len) {\n                // a. Let Pk be ! ToString(k).\n                // b. Let kValue be ? Get(O, Pk).\n                // c. Let testResult be ToBoolean(? Call(predicate, T, « kValue, k, O »)).\n                // d. If testResult is true, return kValue.\n                var kValue = o[k];\n                if (predicate.call(thisArg, kValue, k, o)) {\n                    return kValue;\n                }\n                // e. Increase k by 1.\n                k++;\n            }\n            // 7. Return undefined.\n            return undefined;\n        }\n    });\n}\n\n//# sourceMappingURL=find.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/polyfill/dist/esm/src/shims/find.js","/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * This is the Array.prototype.findIndex polyfill from MDN\n * https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/findIndex\n * https://tc39.github.io/ecma262/#sec-array.prototype.findIndex\n */\nif (!Array.prototype.findIndex) {\n    Object.defineProperty(Array.prototype, 'findIndex', {\n        value: function (predicate) {\n            // 1. Let O be ? ToObject(this value).\n            if (this == null) {\n                throw new TypeError('\"this\" is null or not defined');\n            }\n            var o = Object(this);\n            // 2. Let len be ? ToLength(? Get(O, \"length\")).\n            var len = o.length >>> 0;\n            // 3. If IsCallable(predicate) is false, throw a TypeError exception.\n            if (typeof predicate !== 'function') {\n                throw new TypeError('predicate must be a function');\n            }\n            // 4. If thisArg was supplied, let T be thisArg; else let T be undefined.\n            var thisArg = arguments[1];\n            // 5. Let k be 0.\n            var k = 0;\n            // 6. Repeat, while k < len\n            while (k < len) {\n                // a. Let Pk be ! ToString(k).\n                // b. Let kValue be ? Get(O, Pk).\n                // c. Let testResult be ToBoolean(? Call(predicate, T, « kValue, k, O »)).\n                // d. If testResult is true, return k.\n                var kValue = o[k];\n                if (predicate.call(thisArg, kValue, k, o)) {\n                    return k;\n                }\n                // e. Increase k by 1.\n                k++;\n            }\n            // 7. Return -1.\n            return -1;\n        }\n    });\n}\n\n//# sourceMappingURL=findIndex.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/polyfill/dist/esm/src/shims/findIndex.js","/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nimport { createSubscribe } from '@firebase/util';\nimport { patchProperty, deepCopy, deepExtend, ErrorFactory } from '@firebase/util';\nvar contains = function (obj, key) {\n    return Object.prototype.hasOwnProperty.call(obj, key);\n};\nvar DEFAULT_ENTRY_NAME = '[DEFAULT]';\n// An array to capture listeners before the true auth functions\n// exist\nvar tokenListeners = [];\n/**\n * Global context object for a collection of services using\n * a shared authentication state.\n */\nvar FirebaseAppImpl = /** @class */ (function () {\n    function FirebaseAppImpl(options, name, firebase_) {\n        this.firebase_ = firebase_;\n        this.isDeleted_ = false;\n        this.services_ = {};\n        this.name_ = name;\n        this.options_ = deepCopy(options);\n        this.INTERNAL = {\n            getUid: function () { return null; },\n            getToken: function () { return Promise.resolve(null); },\n            addAuthTokenListener: function (callback) {\n                tokenListeners.push(callback);\n                // Make sure callback is called, asynchronously, in the absence of the auth module\n                setTimeout(function () { return callback(null); }, 0);\n            },\n            removeAuthTokenListener: function (callback) {\n                tokenListeners = tokenListeners.filter(function (listener) { return listener !== callback; });\n            }\n        };\n    }\n    Object.defineProperty(FirebaseAppImpl.prototype, \"name\", {\n        get: function () {\n            this.checkDestroyed_();\n            return this.name_;\n        },\n        enumerable: true,\n        configurable: true\n    });\n    Object.defineProperty(FirebaseAppImpl.prototype, \"options\", {\n        get: function () {\n            this.checkDestroyed_();\n            return this.options_;\n        },\n        enumerable: true,\n        configurable: true\n    });\n    FirebaseAppImpl.prototype.delete = function () {\n        var _this = this;\n        return new Promise(function (resolve) {\n            _this.checkDestroyed_();\n            resolve();\n        })\n            .then(function () {\n            _this.firebase_.INTERNAL.removeApp(_this.name_);\n            var services = [];\n            Object.keys(_this.services_).forEach(function (serviceKey) {\n                Object.keys(_this.services_[serviceKey]).forEach(function (instanceKey) {\n                    services.push(_this.services_[serviceKey][instanceKey]);\n                });\n            });\n            return Promise.all(services.map(function (service) {\n                return service.INTERNAL.delete();\n            }));\n        })\n            .then(function () {\n            _this.isDeleted_ = true;\n            _this.services_ = {};\n        });\n    };\n    /**\n     * Return a service instance associated with this app (creating it\n     * on demand), identified by the passed instanceIdentifier.\n     *\n     * NOTE: Currently storage is the only one that is leveraging this\n     * functionality. They invoke it by calling:\n     *\n     * ```javascript\n     * firebase.app().storage('STORAGE BUCKET ID')\n     * ```\n     *\n     * The service name is passed to this already\n     * @internal\n     */\n    FirebaseAppImpl.prototype._getService = function (name, instanceIdentifier) {\n        if (instanceIdentifier === void 0) { instanceIdentifier = DEFAULT_ENTRY_NAME; }\n        this.checkDestroyed_();\n        if (!this.services_[name]) {\n            this.services_[name] = {};\n        }\n        if (!this.services_[name][instanceIdentifier]) {\n            /**\n             * If a custom instance has been defined (i.e. not '[DEFAULT]')\n             * then we will pass that instance on, otherwise we pass `null`\n             */\n            var instanceSpecifier = instanceIdentifier !== DEFAULT_ENTRY_NAME\n                ? instanceIdentifier\n                : undefined;\n            var service = this.firebase_.INTERNAL.factories[name](this, this.extendApp.bind(this), instanceSpecifier);\n            this.services_[name][instanceIdentifier] = service;\n        }\n        return this.services_[name][instanceIdentifier];\n    };\n    /**\n     * Callback function used to extend an App instance at the time\n     * of service instance creation.\n     */\n    FirebaseAppImpl.prototype.extendApp = function (props) {\n        var _this = this;\n        // Copy the object onto the FirebaseAppImpl prototype\n        deepExtend(this, props);\n        /**\n         * If the app has overwritten the addAuthTokenListener stub, forward\n         * the active token listeners on to the true fxn.\n         *\n         * TODO: This function is required due to our current module\n         * structure. Once we are able to rely strictly upon a single module\n         * implementation, this code should be refactored and Auth should\n         * provide these stubs and the upgrade logic\n         */\n        if (props.INTERNAL && props.INTERNAL.addAuthTokenListener) {\n            tokenListeners.forEach(function (listener) {\n                _this.INTERNAL.addAuthTokenListener(listener);\n            });\n            tokenListeners = [];\n        }\n    };\n    /**\n     * This function will throw an Error if the App has already been deleted -\n     * use before performing API actions on the App.\n     */\n    FirebaseAppImpl.prototype.checkDestroyed_ = function () {\n        if (this.isDeleted_) {\n            error('app-deleted', { name: this.name_ });\n        }\n    };\n    return FirebaseAppImpl;\n}());\n// Prevent dead-code elimination of these methods w/o invalid property\n// copying.\n(FirebaseAppImpl.prototype.name && FirebaseAppImpl.prototype.options) ||\n    FirebaseAppImpl.prototype.delete ||\n    console.log('dc');\n/**\n * Return a firebase namespace object.\n *\n * In production, this will be called exactly once and the result\n * assigned to the 'firebase' global.  It may be called multiple times\n * in unit tests.\n */\nexport function createFirebaseNamespace() {\n    var apps_ = {};\n    var factories = {};\n    var appHooks = {};\n    // A namespace is a plain JavaScript Object.\n    var namespace = {\n        // Hack to prevent Babel from modifying the object returned\n        // as the firebase namespace.\n        __esModule: true,\n        initializeApp: initializeApp,\n        app: app,\n        apps: null,\n        Promise: Promise,\n        SDK_VERSION: '4.6.1',\n        INTERNAL: {\n            registerService: registerService,\n            createFirebaseNamespace: createFirebaseNamespace,\n            extendNamespace: extendNamespace,\n            createSubscribe: createSubscribe,\n            ErrorFactory: ErrorFactory,\n            removeApp: removeApp,\n            factories: factories,\n            useAsService: useAsService,\n            Promise: Promise,\n            deepExtend: deepExtend\n        }\n    };\n    // Inject a circular default export to allow Babel users who were previously\n    // using:\n    //\n    //   import firebase from 'firebase';\n    //   which becomes: var firebase = require('firebase').default;\n    //\n    // instead of\n    //\n    //   import * as firebase from 'firebase';\n    //   which becomes: var firebase = require('firebase');\n    patchProperty(namespace, 'default', namespace);\n    // firebase.apps is a read-only getter.\n    Object.defineProperty(namespace, 'apps', {\n        get: getApps\n    });\n    /**\n     * Called by App.delete() - but before any services associated with the App\n     * are deleted.\n     */\n    function removeApp(name) {\n        var app = apps_[name];\n        callAppHooks(app, 'delete');\n        delete apps_[name];\n    }\n    /**\n     * Get the App object for a given name (or DEFAULT).\n     */\n    function app(name) {\n        name = name || DEFAULT_ENTRY_NAME;\n        if (!contains(apps_, name)) {\n            error('no-app', { name: name });\n        }\n        return apps_[name];\n    }\n    patchProperty(app, 'App', FirebaseAppImpl);\n    /**\n     * Create a new App instance (name must be unique).\n     */\n    function initializeApp(options, name) {\n        if (name === undefined) {\n            name = DEFAULT_ENTRY_NAME;\n        }\n        else {\n            if (typeof name !== 'string' || name === '') {\n                error('bad-app-name', { name: name + '' });\n            }\n        }\n        if (contains(apps_, name)) {\n            error('duplicate-app', { name: name });\n        }\n        var app = new FirebaseAppImpl(options, name, namespace);\n        apps_[name] = app;\n        callAppHooks(app, 'create');\n        return app;\n    }\n    /*\n     * Return an array of all the non-deleted FirebaseApps.\n     */\n    function getApps() {\n        // Make a copy so caller cannot mutate the apps list.\n        return Object.keys(apps_).map(function (name) { return apps_[name]; });\n    }\n    /*\n     * Register a Firebase Service.\n     *\n     * firebase.INTERNAL.registerService()\n     *\n     * TODO: Implement serviceProperties.\n     */\n    function registerService(name, createService, serviceProperties, appHook, allowMultipleInstances) {\n        // Cannot re-register a service that already exists\n        if (factories[name]) {\n            error('duplicate-service', { name: name });\n        }\n        // Capture the service factory for later service instantiation\n        factories[name] = createService;\n        // Capture the appHook, if passed\n        if (appHook) {\n            appHooks[name] = appHook;\n            // Run the **new** app hook on all existing apps\n            getApps().forEach(function (app) {\n                appHook('create', app);\n            });\n        }\n        // The Service namespace is an accessor function ...\n        var serviceNamespace = function (appArg) {\n            if (appArg === void 0) { appArg = app(); }\n            if (typeof appArg[name] !== 'function') {\n                // Invalid argument.\n                // This happens in the following case: firebase.storage('gs:/')\n                error('invalid-app-argument', { name: name });\n            }\n            // Forward service instance lookup to the FirebaseApp.\n            return appArg[name]();\n        };\n        // ... and a container for service-level properties.\n        if (serviceProperties !== undefined) {\n            deepExtend(serviceNamespace, serviceProperties);\n        }\n        // Monkey-patch the serviceNamespace onto the firebase namespace\n        namespace[name] = serviceNamespace;\n        // Patch the FirebaseAppImpl prototype\n        FirebaseAppImpl.prototype[name] = function () {\n            var args = [];\n            for (var _i = 0; _i < arguments.length; _i++) {\n                args[_i] = arguments[_i];\n            }\n            var serviceFxn = this._getService.bind(this, name);\n            return serviceFxn.apply(this, allowMultipleInstances ? args : []);\n        };\n        return serviceNamespace;\n    }\n    /**\n     * Patch the top-level firebase namespace with additional properties.\n     *\n     * firebase.INTERNAL.extendNamespace()\n     */\n    function extendNamespace(props) {\n        deepExtend(namespace, props);\n    }\n    function callAppHooks(app, eventName) {\n        Object.keys(factories).forEach(function (serviceName) {\n            // Ignore virtual services\n            var factoryName = useAsService(app, serviceName);\n            if (factoryName === null) {\n                return;\n            }\n            if (appHooks[factoryName]) {\n                appHooks[factoryName](eventName, app);\n            }\n        });\n    }\n    // Map the requested service to a registered service name\n    // (used to map auth to serverAuth service when needed).\n    function useAsService(app, name) {\n        if (name === 'serverAuth') {\n            return null;\n        }\n        var useService = name;\n        var options = app.options;\n        return useService;\n    }\n    return namespace;\n}\nfunction error(code, args) {\n    throw appErrors.create(code, args);\n}\n// TypeScript does not support non-string indexes!\n// let errors: {[code: AppError: string} = {\nvar errors = {\n    'no-app': \"No Firebase App '{$name}' has been created - \" +\n        'call Firebase App.initializeApp()',\n    'bad-app-name': \"Illegal App name: '{$name}\",\n    'duplicate-app': \"Firebase App named '{$name}' already exists\",\n    'app-deleted': \"Firebase App named '{$name}' already deleted\",\n    'duplicate-service': \"Firebase service named '{$name}' already registered\",\n    'sa-not-supported': 'Initializing the Firebase SDK with a service ' +\n        'account is only allowed in a Node.js environment. On client ' +\n        'devices, you should instead initialize the SDK with an api key and ' +\n        'auth domain',\n    'invalid-app-argument': 'firebase.{$name}() takes either no argument or a ' +\n        'Firebase App instance.'\n};\nvar appErrors = new ErrorFactory('app', 'Firebase', errors);\n\n\n//# sourceMappingURL=firebaseApp.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/app/dist/esm/src/firebaseApp.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\n/**\n * Do a deep-copy of basic JavaScript Objects or Arrays.\n */\nfunction deepCopy(value) {\n    return deepExtend(undefined, value);\n}\nexports.deepCopy = deepCopy;\n/**\n * Copy properties from source to target (recursively allows extension\n * of Objects and Arrays).  Scalar values in the target are over-written.\n * If target is undefined, an object of the appropriate type will be created\n * (and returned).\n *\n * We recursively copy all child properties of plain Objects in the source- so\n * that namespace- like dictionaries are merged.\n *\n * Note that the target can be a function, in which case the properties in\n * the source Object are copied onto it as static properties of the Function.\n */\nfunction deepExtend(target, source) {\n    if (!(source instanceof Object)) {\n        return source;\n    }\n    switch (source.constructor) {\n        case Date:\n            // Treat Dates like scalars; if the target date object had any child\n            // properties - they will be lost!\n            var dateValue = source;\n            return new Date(dateValue.getTime());\n        case Object:\n            if (target === undefined) {\n                target = {};\n            }\n            break;\n        case Array:\n            // Always copy the array source and overwrite the target.\n            target = [];\n            break;\n        default:\n            // Not a plain Object - treat it as a scalar.\n            return source;\n    }\n    for (var prop in source) {\n        if (!source.hasOwnProperty(prop)) {\n            continue;\n        }\n        target[prop] = deepExtend(target[prop], source[prop]);\n    }\n    return target;\n}\nexports.deepExtend = deepExtend;\n// TODO: Really needed (for JSCompiler type checking)?\nfunction patchProperty(obj, prop, value) {\n    obj[prop] = value;\n}\nexports.patchProperty = patchProperty;\n\n//# sourceMappingURL=deepCopy.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/util/dist/cjs/src/deepCopy.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar Deferred = /** @class */ (function () {\n    function Deferred() {\n        var _this = this;\n        this.promise = new Promise(function (resolve, reject) {\n            _this.resolve = resolve;\n            _this.reject = reject;\n        });\n    }\n    /**\n    * Our API internals are not promiseified and cannot because our callback APIs have subtle expectations around\n    * invoking promises inline, which Promises are forbidden to do. This method accepts an optional node-style callback\n    * and returns a node-style callback which will resolve or reject the Deferred's promise.\n    * @param {((?function(?(Error)): (?|undefined))| (?function(?(Error),?=): (?|undefined)))=} callback\n    * @return {!function(?(Error), ?=)}\n    */\n    Deferred.prototype.wrapCallback = function (callback) {\n        var _this = this;\n        return function (error, value) {\n            if (error) {\n                _this.reject(error);\n            }\n            else {\n                _this.resolve(value);\n            }\n            if (typeof callback === 'function') {\n                // Attaching noop handler just in case developer wasn't expecting\n                // promises\n                _this.promise.catch(function () { });\n                // Some of our callbacks don't expect a value and our own tests\n                // assert that the parameter length is 1\n                if (callback.length === 1) {\n                    callback(error);\n                }\n                else {\n                    callback(error, value);\n                }\n            }\n        };\n    };\n    return Deferred;\n}());\nexports.Deferred = Deferred;\n\n//# sourceMappingURL=deferred.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/util/dist/cjs/src/deferred.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar constants_1 = require(\"./constants\");\n/**\n * Returns navigator.userAgent string or '' if it's not defined.\n * @return {string} user agent string\n */\nexports.getUA = function () {\n    if (typeof navigator !== 'undefined' &&\n        typeof navigator['userAgent'] === 'string') {\n        return navigator['userAgent'];\n    }\n    else {\n        return '';\n    }\n};\n/**\n * Detect Cordova / PhoneGap / Ionic frameworks on a mobile device.\n *\n * Deliberately does not rely on checking `file://` URLs (as this fails PhoneGap in the Ripple emulator) nor\n * Cordova `onDeviceReady`, which would normally wait for a callback.\n *\n * @return {boolean} isMobileCordova\n */\nexports.isMobileCordova = function () {\n    return (typeof window !== 'undefined' &&\n        !!(window['cordova'] || window['phonegap'] || window['PhoneGap']) &&\n        /ios|iphone|ipod|ipad|android|blackberry|iemobile/i.test(exports.getUA()));\n};\n/**\n * Detect React Native.\n *\n * @return {boolean} True if ReactNative environment is detected.\n */\nexports.isReactNative = function () {\n    return (typeof navigator === 'object' && navigator['product'] === 'ReactNative');\n};\n/**\n * Detect Node.js.\n *\n * @return {boolean} True if Node.js environment is detected.\n */\nexports.isNodeSdk = function () {\n    return constants_1.CONSTANTS.NODE_CLIENT === true || constants_1.CONSTANTS.NODE_ADMIN === true;\n};\n\n//# sourceMappingURL=environment.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/util/dist/cjs/src/environment.js","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar ERROR_NAME = 'FirebaseError';\nvar captureStackTrace = Error\n    .captureStackTrace;\n// Export for faking in tests\nfunction patchCapture(captureFake) {\n    var result = captureStackTrace;\n    captureStackTrace = captureFake;\n    return result;\n}\nexports.patchCapture = patchCapture;\nvar FirebaseError = /** @class */ (function () {\n    function FirebaseError(code, message) {\n        this.code = code;\n        this.message = message;\n        var stack;\n        // We want the stack value, if implemented by Error\n        if (captureStackTrace) {\n            // Patches this.stack, omitted calls above ErrorFactory#create\n            captureStackTrace(this, ErrorFactory.prototype.create);\n        }\n        else {\n            var err_1 = Error.apply(this, arguments);\n            this.name = ERROR_NAME;\n            // Make non-enumerable getter for the property.\n            Object.defineProperty(this, 'stack', {\n                get: function () {\n                    return err_1.stack;\n                }\n            });\n        }\n    }\n    return FirebaseError;\n}());\nexports.FirebaseError = FirebaseError;\n// Back-door inheritance\nFirebaseError.prototype = Object.create(Error.prototype);\nFirebaseError.prototype.constructor = FirebaseError;\nFirebaseError.prototype.name = ERROR_NAME;\nvar ErrorFactory = /** @class */ (function () {\n    function ErrorFactory(service, serviceName, errors) {\n        this.service = service;\n        this.serviceName = serviceName;\n        this.errors = errors;\n        // Matches {$name}, by default.\n        this.pattern = /\\{\\$([^}]+)}/g;\n        // empty\n    }\n    ErrorFactory.prototype.create = function (code, data) {\n        if (data === undefined) {\n            data = {};\n        }\n        var template = this.errors[code];\n        var fullCode = this.service + '/' + code;\n        var message;\n        if (template === undefined) {\n            message = 'Error';\n        }\n        else {\n            message = template.replace(this.pattern, function (match, key) {\n                var value = data[key];\n                return value !== undefined ? value.toString() : '<' + key + '?>';\n            });\n        }\n        // Service: Error message (service/code).\n        message = this.serviceName + ': ' + message + ' (' + fullCode + ').';\n        var err = new FirebaseError(fullCode, message);\n        // Populate the Error object with message parts for programmatic\n        // accesses (e.g., e.file).\n        for (var prop in data) {\n            if (!data.hasOwnProperty(prop) || prop.slice(-1) === '_') {\n                continue;\n            }\n            err[prop] = data[prop];\n        }\n        return err;\n    };\n    return ErrorFactory;\n}());\nexports.ErrorFactory = ErrorFactory;\n\n//# sourceMappingURL=errors.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/util/dist/cjs/src/errors.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar crypt_1 = require(\"./crypt\");\nvar json_1 = require(\"./json\");\n/**\n * Decodes a Firebase auth. token into constituent parts.\n *\n * Notes:\n * - May return with invalid / incomplete claims if there's no native base64 decoding support.\n * - Doesn't check if the token is actually valid.\n *\n * @param {?string} token\n * @return {{header: *, claims: *, data: *, signature: string}}\n */\nexports.decode = function (token) {\n    var header = {}, claims = {}, data = {}, signature = '';\n    try {\n        var parts = token.split('.');\n        header = json_1.jsonEval(crypt_1.base64Decode(parts[0]) || '');\n        claims = json_1.jsonEval(crypt_1.base64Decode(parts[1]) || '');\n        signature = parts[2];\n        data = claims['d'] || {};\n        delete claims['d'];\n    }\n    catch (e) { }\n    return {\n        header: header,\n        claims: claims,\n        data: data,\n        signature: signature\n    };\n};\n/**\n * Decodes a Firebase auth. token and checks the validity of its time-based claims. Will return true if the\n * token is within the time window authorized by the 'nbf' (not-before) and 'iat' (issued-at) claims.\n *\n * Notes:\n * - May return a false negative if there's no native base64 decoding support.\n * - Doesn't check if the token is actually valid.\n *\n * @param {?string} token\n * @return {boolean}\n */\nexports.isValidTimestamp = function (token) {\n    var claims = exports.decode(token).claims, now = Math.floor(new Date().getTime() / 1000), validSince, validUntil;\n    if (typeof claims === 'object') {\n        if (claims.hasOwnProperty('nbf')) {\n            validSince = claims['nbf'];\n        }\n        else if (claims.hasOwnProperty('iat')) {\n            validSince = claims['iat'];\n        }\n        if (claims.hasOwnProperty('exp')) {\n            validUntil = claims['exp'];\n        }\n        else {\n            // token will expire after 24h by default\n            validUntil = validSince + 86400;\n        }\n    }\n    return (now && validSince && validUntil && now >= validSince && now <= validUntil);\n};\n/**\n * Decodes a Firebase auth. token and returns its issued at time if valid, null otherwise.\n *\n * Notes:\n * - May return null if there's no native base64 decoding support.\n * - Doesn't check if the token is actually valid.\n *\n * @param {?string} token\n * @return {?number}\n */\nexports.issuedAtTime = function (token) {\n    var claims = exports.decode(token).claims;\n    if (typeof claims === 'object' && claims.hasOwnProperty('iat')) {\n        return claims['iat'];\n    }\n    return null;\n};\n/**\n * Decodes a Firebase auth. token and checks the validity of its format. Expects a valid issued-at time and non-empty\n * signature.\n *\n * Notes:\n * - May return a false negative if there's no native base64 decoding support.\n * - Doesn't check if the token is actually valid.\n *\n * @param {?string} token\n * @return {boolean}\n */\nexports.isValidFormat = function (token) {\n    var decoded = exports.decode(token), claims = decoded.claims;\n    return (!!decoded.signature &&\n        !!claims &&\n        typeof claims === 'object' &&\n        claims.hasOwnProperty('iat'));\n};\n/**\n * Attempts to peer into an auth token and determine if it's an admin auth token by looking at the claims portion.\n *\n * Notes:\n * - May return a false negative if there's no native base64 decoding support.\n * - Doesn't check if the token is actually valid.\n *\n * @param {?string} token\n * @return {boolean}\n */\nexports.isAdmin = function (token) {\n    var claims = exports.decode(token).claims;\n    return typeof claims === 'object' && claims['admin'] === true;\n};\n\n//# sourceMappingURL=jwt.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/util/dist/cjs/src/jwt.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar obj_1 = require(\"./obj\");\n/**\n * Returns a querystring-formatted string (e.g. &arg=val&arg2=val2) from a params\n * object (e.g. {arg: 'val', arg2: 'val2'})\n * Note: You must prepend it with ? when adding it to a URL.\n *\n * @param {!Object} querystringParams\n * @return {string}\n */\nexports.querystring = function (querystringParams) {\n    var params = [];\n    obj_1.forEach(querystringParams, function (key, value) {\n        if (Array.isArray(value)) {\n            value.forEach(function (arrayVal) {\n                params.push(encodeURIComponent(key) + '=' + encodeURIComponent(arrayVal));\n            });\n        }\n        else {\n            params.push(encodeURIComponent(key) + '=' + encodeURIComponent(value));\n        }\n    });\n    return params.length ? '&' + params.join('&') : '';\n};\n/**\n * Decodes a querystring (e.g. ?arg=val&arg2=val2) into a params object (e.g. {arg: 'val', arg2: 'val2'})\n *\n * @param {string} querystring\n * @return {!Object}\n */\nexports.querystringDecode = function (querystring) {\n    var obj = {};\n    var tokens = querystring.replace(/^\\?/, '').split('&');\n    tokens.forEach(function (token) {\n        if (token) {\n            var key = token.split('=');\n            obj[key[0]] = key[1];\n        }\n    });\n    return obj;\n};\n\n//# sourceMappingURL=query.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/util/dist/cjs/src/query.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nvar __extends = (this && this.__extends) || (function () {\n    var extendStatics = Object.setPrototypeOf ||\n        ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n        function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };\n    return function (d, b) {\n        extendStatics(d, b);\n        function __() { this.constructor = d; }\n        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n    };\n})();\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar hash_1 = require(\"./hash\");\n/**\n * @fileoverview SHA-1 cryptographic hash.\n * Variable names follow the notation in FIPS PUB 180-3:\n * http://csrc.nist.gov/publications/fips/fips180-3/fips180-3_final.pdf.\n *\n * Usage:\n *   var sha1 = new sha1();\n *   sha1.update(bytes);\n *   var hash = sha1.digest();\n *\n * Performance:\n *   Chrome 23:   ~400 Mbit/s\n *   Firefox 16:  ~250 Mbit/s\n *\n */\n/**\n * SHA-1 cryptographic hash constructor.\n *\n * The properties declared here are discussed in the above algorithm document.\n * @constructor\n * @extends {Hash}\n * @final\n * @struct\n */\nvar Sha1 = /** @class */ (function (_super) {\n    __extends(Sha1, _super);\n    function Sha1() {\n        var _this = _super.call(this) || this;\n        /**\n         * Holds the previous values of accumulated variables a-e in the compress_\n         * function.\n         * @type {!Array<number>}\n         * @private\n         */\n        _this.chain_ = [];\n        /**\n         * A buffer holding the partially computed hash result.\n         * @type {!Array<number>}\n         * @private\n         */\n        _this.buf_ = [];\n        /**\n         * An array of 80 bytes, each a part of the message to be hashed.  Referred to\n         * as the message schedule in the docs.\n         * @type {!Array<number>}\n         * @private\n         */\n        _this.W_ = [];\n        /**\n         * Contains data needed to pad messages less than 64 bytes.\n         * @type {!Array<number>}\n         * @private\n         */\n        _this.pad_ = [];\n        /**\n         * @private {number}\n         */\n        _this.inbuf_ = 0;\n        /**\n         * @private {number}\n         */\n        _this.total_ = 0;\n        _this.blockSize = 512 / 8;\n        _this.pad_[0] = 128;\n        for (var i = 1; i < _this.blockSize; ++i) {\n            _this.pad_[i] = 0;\n        }\n        _this.reset();\n        return _this;\n    }\n    Sha1.prototype.reset = function () {\n        this.chain_[0] = 0x67452301;\n        this.chain_[1] = 0xefcdab89;\n        this.chain_[2] = 0x98badcfe;\n        this.chain_[3] = 0x10325476;\n        this.chain_[4] = 0xc3d2e1f0;\n        this.inbuf_ = 0;\n        this.total_ = 0;\n    };\n    /**\n     * Internal compress helper function.\n     * @param {!Array<number>|!Uint8Array|string} buf Block to compress.\n     * @param {number=} opt_offset Offset of the block in the buffer.\n     * @private\n     */\n    Sha1.prototype.compress_ = function (buf, opt_offset) {\n        if (!opt_offset) {\n            opt_offset = 0;\n        }\n        var W = this.W_;\n        // get 16 big endian words\n        if (typeof buf === 'string') {\n            for (var i = 0; i < 16; i++) {\n                // TODO(user): [bug 8140122] Recent versions of Safari for Mac OS and iOS\n                // have a bug that turns the post-increment ++ operator into pre-increment\n                // during JIT compilation.  We have code that depends heavily on SHA-1 for\n                // correctness and which is affected by this bug, so I've removed all uses\n                // of post-increment ++ in which the result value is used.  We can revert\n                // this change once the Safari bug\n                // (https://bugs.webkit.org/show_bug.cgi?id=109036) has been fixed and\n                // most clients have been updated.\n                W[i] =\n                    (buf.charCodeAt(opt_offset) << 24) |\n                        (buf.charCodeAt(opt_offset + 1) << 16) |\n                        (buf.charCodeAt(opt_offset + 2) << 8) |\n                        buf.charCodeAt(opt_offset + 3);\n                opt_offset += 4;\n            }\n        }\n        else {\n            for (var i = 0; i < 16; i++) {\n                W[i] =\n                    (buf[opt_offset] << 24) |\n                        (buf[opt_offset + 1] << 16) |\n                        (buf[opt_offset + 2] << 8) |\n                        buf[opt_offset + 3];\n                opt_offset += 4;\n            }\n        }\n        // expand to 80 words\n        for (var i = 16; i < 80; i++) {\n            var t = W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16];\n            W[i] = ((t << 1) | (t >>> 31)) & 0xffffffff;\n        }\n        var a = this.chain_[0];\n        var b = this.chain_[1];\n        var c = this.chain_[2];\n        var d = this.chain_[3];\n        var e = this.chain_[4];\n        var f, k;\n        // TODO(user): Try to unroll this loop to speed up the computation.\n        for (var i = 0; i < 80; i++) {\n            if (i < 40) {\n                if (i < 20) {\n                    f = d ^ (b & (c ^ d));\n                    k = 0x5a827999;\n                }\n                else {\n                    f = b ^ c ^ d;\n                    k = 0x6ed9eba1;\n                }\n            }\n            else {\n                if (i < 60) {\n                    f = (b & c) | (d & (b | c));\n                    k = 0x8f1bbcdc;\n                }\n                else {\n                    f = b ^ c ^ d;\n                    k = 0xca62c1d6;\n                }\n            }\n            var t = (((a << 5) | (a >>> 27)) + f + e + k + W[i]) & 0xffffffff;\n            e = d;\n            d = c;\n            c = ((b << 30) | (b >>> 2)) & 0xffffffff;\n            b = a;\n            a = t;\n        }\n        this.chain_[0] = (this.chain_[0] + a) & 0xffffffff;\n        this.chain_[1] = (this.chain_[1] + b) & 0xffffffff;\n        this.chain_[2] = (this.chain_[2] + c) & 0xffffffff;\n        this.chain_[3] = (this.chain_[3] + d) & 0xffffffff;\n        this.chain_[4] = (this.chain_[4] + e) & 0xffffffff;\n    };\n    Sha1.prototype.update = function (bytes, opt_length) {\n        // TODO(johnlenz): tighten the function signature and remove this check\n        if (bytes == null) {\n            return;\n        }\n        if (opt_length === undefined) {\n            opt_length = bytes.length;\n        }\n        var lengthMinusBlock = opt_length - this.blockSize;\n        var n = 0;\n        // Using local instead of member variables gives ~5% speedup on Firefox 16.\n        var buf = this.buf_;\n        var inbuf = this.inbuf_;\n        // The outer while loop should execute at most twice.\n        while (n < opt_length) {\n            // When we have no data in the block to top up, we can directly process the\n            // input buffer (assuming it contains sufficient data). This gives ~25%\n            // speedup on Chrome 23 and ~15% speedup on Firefox 16, but requires that\n            // the data is provided in large chunks (or in multiples of 64 bytes).\n            if (inbuf == 0) {\n                while (n <= lengthMinusBlock) {\n                    this.compress_(bytes, n);\n                    n += this.blockSize;\n                }\n            }\n            if (typeof bytes === 'string') {\n                while (n < opt_length) {\n                    buf[inbuf] = bytes.charCodeAt(n);\n                    ++inbuf;\n                    ++n;\n                    if (inbuf == this.blockSize) {\n                        this.compress_(buf);\n                        inbuf = 0;\n                        // Jump to the outer loop so we use the full-block optimization.\n                        break;\n                    }\n                }\n            }\n            else {\n                while (n < opt_length) {\n                    buf[inbuf] = bytes[n];\n                    ++inbuf;\n                    ++n;\n                    if (inbuf == this.blockSize) {\n                        this.compress_(buf);\n                        inbuf = 0;\n                        // Jump to the outer loop so we use the full-block optimization.\n                        break;\n                    }\n                }\n            }\n        }\n        this.inbuf_ = inbuf;\n        this.total_ += opt_length;\n    };\n    /** @override */\n    Sha1.prototype.digest = function () {\n        var digest = [];\n        var totalBits = this.total_ * 8;\n        // Add pad 0x80 0x00*.\n        if (this.inbuf_ < 56) {\n            this.update(this.pad_, 56 - this.inbuf_);\n        }\n        else {\n            this.update(this.pad_, this.blockSize - (this.inbuf_ - 56));\n        }\n        // Add # bits.\n        for (var i = this.blockSize - 1; i >= 56; i--) {\n            this.buf_[i] = totalBits & 255;\n            totalBits /= 256; // Don't use bit-shifting here!\n        }\n        this.compress_(this.buf_);\n        var n = 0;\n        for (var i = 0; i < 5; i++) {\n            for (var j = 24; j >= 0; j -= 8) {\n                digest[n] = (this.chain_[i] >> j) & 255;\n                ++n;\n            }\n        }\n        return digest;\n    };\n    return Sha1;\n}(hash_1.Hash));\nexports.Sha1 = Sha1;\n\n//# sourceMappingURL=sha1.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/util/dist/cjs/src/sha1.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\n// Copyright 2011 The Closure Library Authors. All Rights Reserved.\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n//      http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS-IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n/**\n * @fileoverview Abstract cryptographic hash interface.\n *\n * See Sha1 and Md5 for sample implementations.\n *\n */\n/**\n * Create a cryptographic hash instance.\n *\n * @constructor\n * @struct\n */\nvar Hash = /** @class */ (function () {\n    function Hash() {\n        /**\n         * The block size for the hasher.\n         * @type {number}\n         */\n        this.blockSize = -1;\n    }\n    return Hash;\n}());\nexports.Hash = Hash;\n\n//# sourceMappingURL=hash.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/util/dist/cjs/src/hash.js","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\n/**\n * Helper to make a Subscribe function (just like Promise helps make a\n * Thenable).\n *\n * @param executor Function which can make calls to a single Observer\n *     as a proxy.\n * @param onNoObservers Callback when count of Observers goes to zero.\n */\nfunction createSubscribe(executor, onNoObservers) {\n    var proxy = new ObserverProxy(executor, onNoObservers);\n    return proxy.subscribe.bind(proxy);\n}\nexports.createSubscribe = createSubscribe;\n/**\n * Implement fan-out for any number of Observers attached via a subscribe\n * function.\n */\nvar ObserverProxy = /** @class */ (function () {\n    /**\n     * @param executor Function which can make calls to a single Observer\n     *     as a proxy.\n     * @param onNoObservers Callback when count of Observers goes to zero.\n     */\n    function ObserverProxy(executor, onNoObservers) {\n        var _this = this;\n        this.observers = [];\n        this.unsubscribes = [];\n        this.observerCount = 0;\n        // Micro-task scheduling by calling task.then().\n        this.task = Promise.resolve();\n        this.finalized = false;\n        this.onNoObservers = onNoObservers;\n        // Call the executor asynchronously so subscribers that are called\n        // synchronously after the creation of the subscribe function\n        // can still receive the very first value generated in the executor.\n        this.task\n            .then(function () {\n            executor(_this);\n        })\n            .catch(function (e) {\n            _this.error(e);\n        });\n    }\n    ObserverProxy.prototype.next = function (value) {\n        this.forEachObserver(function (observer) {\n            observer.next(value);\n        });\n    };\n    ObserverProxy.prototype.error = function (error) {\n        this.forEachObserver(function (observer) {\n            observer.error(error);\n        });\n        this.close(error);\n    };\n    ObserverProxy.prototype.complete = function () {\n        this.forEachObserver(function (observer) {\n            observer.complete();\n        });\n        this.close();\n    };\n    /**\n     * Subscribe function that can be used to add an Observer to the fan-out list.\n     *\n     * - We require that no event is sent to a subscriber sychronously to their\n     *   call to subscribe().\n     */\n    ObserverProxy.prototype.subscribe = function (nextOrObserver, error, complete) {\n        var _this = this;\n        var observer;\n        if (nextOrObserver === undefined &&\n            error === undefined &&\n            complete === undefined) {\n            throw new Error('Missing Observer.');\n        }\n        // Assemble an Observer object when passed as callback functions.\n        if (implementsAnyMethods(nextOrObserver, ['next', 'error', 'complete'])) {\n            observer = nextOrObserver;\n        }\n        else {\n            observer = {\n                next: nextOrObserver,\n                error: error,\n                complete: complete\n            };\n        }\n        if (observer.next === undefined) {\n            observer.next = noop;\n        }\n        if (observer.error === undefined) {\n            observer.error = noop;\n        }\n        if (observer.complete === undefined) {\n            observer.complete = noop;\n        }\n        var unsub = this.unsubscribeOne.bind(this, this.observers.length);\n        // Attempt to subscribe to a terminated Observable - we\n        // just respond to the Observer with the final error or complete\n        // event.\n        if (this.finalized) {\n            this.task.then(function () {\n                try {\n                    if (_this.finalError) {\n                        observer.error(_this.finalError);\n                    }\n                    else {\n                        observer.complete();\n                    }\n                }\n                catch (e) {\n                    // nothing\n                }\n                return;\n            });\n        }\n        this.observers.push(observer);\n        return unsub;\n    };\n    // Unsubscribe is synchronous - we guarantee that no events are sent to\n    // any unsubscribed Observer.\n    ObserverProxy.prototype.unsubscribeOne = function (i) {\n        if (this.observers === undefined || this.observers[i] === undefined) {\n            return;\n        }\n        delete this.observers[i];\n        this.observerCount -= 1;\n        if (this.observerCount === 0 && this.onNoObservers !== undefined) {\n            this.onNoObservers(this);\n        }\n    };\n    ObserverProxy.prototype.forEachObserver = function (fn) {\n        if (this.finalized) {\n            // Already closed by previous event....just eat the additional values.\n            return;\n        }\n        // Since sendOne calls asynchronously - there is no chance that\n        // this.observers will become undefined.\n        for (var i = 0; i < this.observers.length; i++) {\n            this.sendOne(i, fn);\n        }\n    };\n    // Call the Observer via one of it's callback function. We are careful to\n    // confirm that the observe has not been unsubscribed since this asynchronous\n    // function had been queued.\n    ObserverProxy.prototype.sendOne = function (i, fn) {\n        var _this = this;\n        // Execute the callback asynchronously\n        this.task.then(function () {\n            if (_this.observers !== undefined && _this.observers[i] !== undefined) {\n                try {\n                    fn(_this.observers[i]);\n                }\n                catch (e) {\n                    // Ignore exceptions raised in Observers or missing methods of an\n                    // Observer.\n                    // Log error to console. b/31404806\n                    if (typeof console !== 'undefined' && console.error) {\n                        console.error(e);\n                    }\n                }\n            }\n        });\n    };\n    ObserverProxy.prototype.close = function (err) {\n        var _this = this;\n        if (this.finalized) {\n            return;\n        }\n        this.finalized = true;\n        if (err !== undefined) {\n            this.finalError = err;\n        }\n        // Proxy is no longer needed - garbage collect references\n        this.task.then(function () {\n            _this.observers = undefined;\n            _this.onNoObservers = undefined;\n        });\n    };\n    return ObserverProxy;\n}());\n/** Turn synchronous function into one called asynchronously. */\nfunction async(fn, onError) {\n    return function () {\n        var args = [];\n        for (var _i = 0; _i < arguments.length; _i++) {\n            args[_i] = arguments[_i];\n        }\n        Promise.resolve(true)\n            .then(function () {\n            fn.apply(void 0, args);\n        })\n            .catch(function (error) {\n            if (onError) {\n                onError(error);\n            }\n        });\n    };\n}\nexports.async = async;\n/**\n * Return true if the object passed in implements any of the named methods.\n */\nfunction implementsAnyMethods(obj, methods) {\n    if (typeof obj !== 'object' || obj === null) {\n        return false;\n    }\n    for (var _i = 0, methods_1 = methods; _i < methods_1.length; _i++) {\n        var method = methods_1[_i];\n        if (method in obj && typeof obj[method] === 'function') {\n            return true;\n        }\n    }\n    return false;\n}\nfunction noop() {\n    // do nothing\n}\n\n//# sourceMappingURL=subscribe.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/util/dist/cjs/src/subscribe.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\n/**\n * Check to make sure the appropriate number of arguments are provided for a public function.\n * Throws an error if it fails.\n *\n * @param {!string} fnName The function name\n * @param {!number} minCount The minimum number of arguments to allow for the function call\n * @param {!number} maxCount The maximum number of argument to allow for the function call\n * @param {!number} argCount The actual number of arguments provided.\n */\nexports.validateArgCount = function (fnName, minCount, maxCount, argCount) {\n    var argError;\n    if (argCount < minCount) {\n        argError = 'at least ' + minCount;\n    }\n    else if (argCount > maxCount) {\n        argError = maxCount === 0 ? 'none' : 'no more than ' + maxCount;\n    }\n    if (argError) {\n        var error = fnName +\n            ' failed: Was called with ' +\n            argCount +\n            (argCount === 1 ? ' argument.' : ' arguments.') +\n            ' Expects ' +\n            argError +\n            '.';\n        throw new Error(error);\n    }\n};\n/**\n * Generates a string to prefix an error message about failed argument validation\n *\n * @param {!string} fnName The function name\n * @param {!number} argumentNumber The index of the argument\n * @param {boolean} optional Whether or not the argument is optional\n * @return {!string} The prefix to add to the error thrown for validation.\n */\nfunction errorPrefix(fnName, argumentNumber, optional) {\n    var argName = '';\n    switch (argumentNumber) {\n        case 1:\n            argName = optional ? 'first' : 'First';\n            break;\n        case 2:\n            argName = optional ? 'second' : 'Second';\n            break;\n        case 3:\n            argName = optional ? 'third' : 'Third';\n            break;\n        case 4:\n            argName = optional ? 'fourth' : 'Fourth';\n            break;\n        default:\n            throw new Error('errorPrefix called with argumentNumber > 4.  Need to update it?');\n    }\n    var error = fnName + ' failed: ';\n    error += argName + ' argument ';\n    return error;\n}\nexports.errorPrefix = errorPrefix;\n/**\n * @param {!string} fnName\n * @param {!number} argumentNumber\n * @param {!string} namespace\n * @param {boolean} optional\n */\nfunction validateNamespace(fnName, argumentNumber, namespace, optional) {\n    if (optional && !namespace)\n        return;\n    if (typeof namespace !== 'string') {\n        //TODO: I should do more validation here. We only allow certain chars in namespaces.\n        throw new Error(errorPrefix(fnName, argumentNumber, optional) +\n            'must be a valid firebase namespace.');\n    }\n}\nexports.validateNamespace = validateNamespace;\nfunction validateCallback(fnName, argumentNumber, callback, optional) {\n    if (optional && !callback)\n        return;\n    if (typeof callback !== 'function')\n        throw new Error(errorPrefix(fnName, argumentNumber, optional) +\n            'must be a valid function.');\n}\nexports.validateCallback = validateCallback;\nfunction validateContextObject(fnName, argumentNumber, context, optional) {\n    if (optional && !context)\n        return;\n    if (typeof context !== 'object' || context === null)\n        throw new Error(errorPrefix(fnName, argumentNumber, optional) +\n            'must be a valid context object.');\n}\nexports.validateContextObject = validateContextObject;\n\n//# sourceMappingURL=validation.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/util/dist/cjs/src/validation.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar assert_1 = require(\"./assert\");\n// Code originally came from goog.crypt.stringToUtf8ByteArray, but for some reason they\n// automatically replaced '\\r\\n' with '\\n', and they didn't handle surrogate pairs,\n// so it's been modified.\n// Note that not all Unicode characters appear as single characters in JavaScript strings.\n// fromCharCode returns the UTF-16 encoding of a character - so some Unicode characters\n// use 2 characters in Javascript.  All 4-byte UTF-8 characters begin with a first\n// character in the range 0xD800 - 0xDBFF (the first character of a so-called surrogate\n// pair).\n// See http://www.ecma-international.org/ecma-262/5.1/#sec-15.1.3\n/**\n * @param {string} str\n * @return {Array}\n */\nexports.stringToByteArray = function (str) {\n    var out = [], p = 0;\n    for (var i = 0; i < str.length; i++) {\n        var c = str.charCodeAt(i);\n        // Is this the lead surrogate in a surrogate pair?\n        if (c >= 0xd800 && c <= 0xdbff) {\n            var high = c - 0xd800; // the high 10 bits.\n            i++;\n            assert_1.assert(i < str.length, 'Surrogate pair missing trail surrogate.');\n            var low = str.charCodeAt(i) - 0xdc00; // the low 10 bits.\n            c = 0x10000 + (high << 10) + low;\n        }\n        if (c < 128) {\n            out[p++] = c;\n        }\n        else if (c < 2048) {\n            out[p++] = (c >> 6) | 192;\n            out[p++] = (c & 63) | 128;\n        }\n        else if (c < 65536) {\n            out[p++] = (c >> 12) | 224;\n            out[p++] = ((c >> 6) & 63) | 128;\n            out[p++] = (c & 63) | 128;\n        }\n        else {\n            out[p++] = (c >> 18) | 240;\n            out[p++] = ((c >> 12) & 63) | 128;\n            out[p++] = ((c >> 6) & 63) | 128;\n            out[p++] = (c & 63) | 128;\n        }\n    }\n    return out;\n};\n/**\n * Calculate length without actually converting; useful for doing cheaper validation.\n * @param {string} str\n * @return {number}\n */\nexports.stringLength = function (str) {\n    var p = 0;\n    for (var i = 0; i < str.length; i++) {\n        var c = str.charCodeAt(i);\n        if (c < 128) {\n            p++;\n        }\n        else if (c < 2048) {\n            p += 2;\n        }\n        else if (c >= 0xd800 && c <= 0xdbff) {\n            // Lead surrogate of a surrogate pair.  The pair together will take 4 bytes to represent.\n            p += 4;\n            i++; // skip trail surrogate.\n        }\n        else {\n            p += 3;\n        }\n    }\n    return p;\n};\n\n//# sourceMappingURL=utf8.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/util/dist/cjs/src/utf8.js","/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nmodule.exports = require('@firebase/database');\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/firebase/database/index.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar app_1 = require(\"@firebase/app\");\nvar Database_1 = require(\"./src/api/Database\");\nexports.Database = Database_1.Database;\nvar Query_1 = require(\"./src/api/Query\");\nexports.Query = Query_1.Query;\nvar Reference_1 = require(\"./src/api/Reference\");\nexports.Reference = Reference_1.Reference;\nvar util_1 = require(\"./src/core/util/util\");\nexports.enableLogging = util_1.enableLogging;\nvar RepoManager_1 = require(\"./src/core/RepoManager\");\nvar INTERNAL = require(\"./src/api/internal\");\nvar TEST_ACCESS = require(\"./src/api/test_access\");\nvar util_2 = require(\"@firebase/util\");\nvar ServerValue = Database_1.Database.ServerValue;\nexports.ServerValue = ServerValue;\nfunction registerDatabase(instance) {\n    // Register the Database Service with the 'firebase' namespace.\n    var namespace = instance.INTERNAL.registerService('database', function (app, unused, url) { return RepoManager_1.RepoManager.getInstance().databaseFromApp(app, url); }, \n    // firebase.database namespace properties\n    {\n        Reference: Reference_1.Reference,\n        Query: Query_1.Query,\n        Database: Database_1.Database,\n        enableLogging: util_1.enableLogging,\n        INTERNAL: INTERNAL,\n        ServerValue: ServerValue,\n        TEST_ACCESS: TEST_ACCESS\n    }, null, true);\n    if (util_2.isNodeSdk()) {\n        module.exports = namespace;\n    }\n}\nexports.registerDatabase = registerDatabase;\nregisterDatabase(app_1.default);\nvar DataSnapshot_1 = require(\"./src/api/DataSnapshot\");\nexports.DataSnapshot = DataSnapshot_1.DataSnapshot;\nvar onDisconnect_1 = require(\"./src/api/onDisconnect\");\nexports.OnDisconnect = onDisconnect_1.OnDisconnect;\n\n//# sourceMappingURL=index.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/index.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = require(\"@firebase/util\");\n/**\n * Wraps a DOM Storage object and:\n * - automatically encode objects as JSON strings before storing them to allow us to store arbitrary types.\n * - prefixes names with \"firebase:\" to avoid collisions with app data.\n *\n * We automatically (see storage.js) create two such wrappers, one for sessionStorage,\n * and one for localStorage.\n *\n * @constructor\n */\nvar DOMStorageWrapper = /** @class */ (function () {\n    /**\n     * @param {Storage} domStorage_ The underlying storage object (e.g. localStorage or sessionStorage)\n     */\n    function DOMStorageWrapper(domStorage_) {\n        this.domStorage_ = domStorage_;\n        // Use a prefix to avoid collisions with other stuff saved by the app.\n        this.prefix_ = 'firebase:';\n    }\n    /**\n     * @param {string} key The key to save the value under\n     * @param {?Object} value The value being stored, or null to remove the key.\n     */\n    DOMStorageWrapper.prototype.set = function (key, value) {\n        if (value == null) {\n            this.domStorage_.removeItem(this.prefixedName_(key));\n        }\n        else {\n            this.domStorage_.setItem(this.prefixedName_(key), util_1.stringify(value));\n        }\n    };\n    /**\n     * @param {string} key\n     * @return {*} The value that was stored under this key, or null\n     */\n    DOMStorageWrapper.prototype.get = function (key) {\n        var storedVal = this.domStorage_.getItem(this.prefixedName_(key));\n        if (storedVal == null) {\n            return null;\n        }\n        else {\n            return util_1.jsonEval(storedVal);\n        }\n    };\n    /**\n     * @param {string} key\n     */\n    DOMStorageWrapper.prototype.remove = function (key) {\n        this.domStorage_.removeItem(this.prefixedName_(key));\n    };\n    /**\n     * @param {string} name\n     * @return {string}\n     */\n    DOMStorageWrapper.prototype.prefixedName_ = function (name) {\n        return this.prefix_ + name;\n    };\n    DOMStorageWrapper.prototype.toString = function () {\n        return this.domStorage_.toString();\n    };\n    return DOMStorageWrapper;\n}());\nexports.DOMStorageWrapper = DOMStorageWrapper;\n\n//# sourceMappingURL=DOMStorageWrapper.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/storage/DOMStorageWrapper.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = require(\"@firebase/util\");\n/**\n * An in-memory storage implementation that matches the API of DOMStorageWrapper\n * (TODO: create interface for both to implement).\n *\n * @constructor\n */\nvar MemoryStorage = /** @class */ (function () {\n    function MemoryStorage() {\n        this.cache_ = {};\n        this.isInMemoryStorage = true;\n    }\n    MemoryStorage.prototype.set = function (key, value) {\n        if (value == null) {\n            delete this.cache_[key];\n        }\n        else {\n            this.cache_[key] = value;\n        }\n    };\n    MemoryStorage.prototype.get = function (key) {\n        if (util_1.contains(this.cache_, key)) {\n            return this.cache_[key];\n        }\n        return null;\n    };\n    MemoryStorage.prototype.remove = function (key) {\n        delete this.cache_[key];\n    };\n    return MemoryStorage;\n}());\nexports.MemoryStorage = MemoryStorage;\n\n//# sourceMappingURL=MemoryStorage.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/storage/MemoryStorage.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = require(\"@firebase/util\");\nvar TransactionResult = /** @class */ (function () {\n    /**\n     * A type for the resolve value of Firebase.transaction.\n     * @constructor\n     * @dict\n     * @param {boolean} committed\n     * @param {DataSnapshot} snapshot\n     */\n    function TransactionResult(committed, snapshot) {\n        this.committed = committed;\n        this.snapshot = snapshot;\n    }\n    // Do not create public documentation. This is intended to make JSON serialization work but is otherwise unnecessary\n    // for end-users\n    TransactionResult.prototype.toJSON = function () {\n        util_1.validateArgCount('TransactionResult.toJSON', 0, 1, arguments.length);\n        return { committed: this.committed, snapshot: this.snapshot.toJSON() };\n    };\n    return TransactionResult;\n}());\nexports.TransactionResult = TransactionResult;\n\n//# sourceMappingURL=TransactionResult.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/api/TransactionResult.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = require(\"@firebase/util\");\n/**\n * Fancy ID generator that creates 20-character string identifiers with the\n * following properties:\n *\n * 1. They're based on timestamp so that they sort *after* any existing ids.\n * 2. They contain 72-bits of random data after the timestamp so that IDs won't\n *    collide with other clients' IDs.\n * 3. They sort *lexicographically* (so the timestamp is converted to characters\n *    that will sort properly).\n * 4. They're monotonically increasing. Even if you generate more than one in\n *    the same timestamp, the latter ones will sort after the former ones. We do\n *    this by using the previous random bits but \"incrementing\" them by 1 (only\n *    in the case of a timestamp collision).\n */\nexports.nextPushId = (function () {\n    // Modeled after base64 web-safe chars, but ordered by ASCII.\n    var PUSH_CHARS = '-0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz';\n    // Timestamp of last push, used to prevent local collisions if you push twice\n    // in one ms.\n    var lastPushTime = 0;\n    // We generate 72-bits of randomness which get turned into 12 characters and\n    // appended to the timestamp to prevent collisions with other clients. We\n    // store the last characters we generated because in the event of a collision,\n    // we'll use those same characters except \"incremented\" by one.\n    var lastRandChars = [];\n    return function (now) {\n        var duplicateTime = now === lastPushTime;\n        lastPushTime = now;\n        var i;\n        var timeStampChars = new Array(8);\n        for (i = 7; i >= 0; i--) {\n            timeStampChars[i] = PUSH_CHARS.charAt(now % 64);\n            // NOTE: Can't use << here because javascript will convert to int and lose\n            // the upper bits.\n            now = Math.floor(now / 64);\n        }\n        util_1.assert(now === 0, 'Cannot push at time == 0');\n        var id = timeStampChars.join('');\n        if (!duplicateTime) {\n            for (i = 0; i < 12; i++) {\n                lastRandChars[i] = Math.floor(Math.random() * 64);\n            }\n        }\n        else {\n            // If the timestamp hasn't changed since last push, use the same random\n            // number, except incremented by 1.\n            for (i = 11; i >= 0 && lastRandChars[i] === 63; i--) {\n                lastRandChars[i] = 0;\n            }\n            lastRandChars[i]++;\n        }\n        for (i = 0; i < 12; i++) {\n            id += PUSH_CHARS.charAt(lastRandChars[i]);\n        }\n        util_1.assert(id.length === 20, 'nextPushId: Length should be 20.');\n        return id;\n    };\n})();\n\n//# sourceMappingURL=NextPushId.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/util/NextPushId.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar DataSnapshot_1 = require(\"../../api/DataSnapshot\");\nvar Event_1 = require(\"./Event\");\nvar util_1 = require(\"@firebase/util\");\nvar util_2 = require(\"@firebase/util\");\n/**\n * Represents registration for 'value' events.\n */\nvar ValueEventRegistration = /** @class */ (function () {\n    /**\n     * @param {?function(!DataSnapshot)} callback_\n     * @param {?function(Error)} cancelCallback_\n     * @param {?Object} context_\n     */\n    function ValueEventRegistration(callback_, cancelCallback_, context_) {\n        this.callback_ = callback_;\n        this.cancelCallback_ = cancelCallback_;\n        this.context_ = context_;\n    }\n    /**\n     * @inheritDoc\n     */\n    ValueEventRegistration.prototype.respondsTo = function (eventType) {\n        return eventType === 'value';\n    };\n    /**\n     * @inheritDoc\n     */\n    ValueEventRegistration.prototype.createEvent = function (change, query) {\n        var index = query.getQueryParams().getIndex();\n        return new Event_1.DataEvent('value', this, new DataSnapshot_1.DataSnapshot(change.snapshotNode, query.getRef(), index));\n    };\n    /**\n     * @inheritDoc\n     */\n    ValueEventRegistration.prototype.getEventRunner = function (eventData) {\n        var ctx = this.context_;\n        if (eventData.getEventType() === 'cancel') {\n            util_2.assert(this.cancelCallback_, 'Raising a cancel event on a listener with no cancel callback');\n            var cancelCB_1 = this.cancelCallback_;\n            return function () {\n                // We know that error exists, we checked above that this is a cancel event\n                cancelCB_1.call(ctx, eventData.error);\n            };\n        }\n        else {\n            var cb_1 = this.callback_;\n            return function () {\n                cb_1.call(ctx, eventData.snapshot);\n            };\n        }\n    };\n    /**\n     * @inheritDoc\n     */\n    ValueEventRegistration.prototype.createCancelEvent = function (error, path) {\n        if (this.cancelCallback_) {\n            return new Event_1.CancelEvent(this, error, path);\n        }\n        else {\n            return null;\n        }\n    };\n    /**\n     * @inheritDoc\n     */\n    ValueEventRegistration.prototype.matches = function (other) {\n        if (!(other instanceof ValueEventRegistration)) {\n            return false;\n        }\n        else if (!other.callback_ || !this.callback_) {\n            // If no callback specified, we consider it to match any callback.\n            return true;\n        }\n        else {\n            return (other.callback_ === this.callback_ && other.context_ === this.context_);\n        }\n    };\n    /**\n     * @inheritDoc\n     */\n    ValueEventRegistration.prototype.hasAnyCallback = function () {\n        return this.callback_ !== null;\n    };\n    return ValueEventRegistration;\n}());\nexports.ValueEventRegistration = ValueEventRegistration;\n/**\n * Represents the registration of 1 or more child_xxx events.\n *\n * Currently, it is always exactly 1 child_xxx event, but the idea is we might let you\n * register a group of callbacks together in the future.\n *\n * @constructor\n * @implements {EventRegistration}\n */\nvar ChildEventRegistration = /** @class */ (function () {\n    /**\n     * @param {?Object.<string, function(!DataSnapshot, ?string=)>} callbacks_\n     * @param {?function(Error)} cancelCallback_\n     * @param {Object=} context_\n     */\n    function ChildEventRegistration(callbacks_, cancelCallback_, context_) {\n        this.callbacks_ = callbacks_;\n        this.cancelCallback_ = cancelCallback_;\n        this.context_ = context_;\n    }\n    /**\n     * @inheritDoc\n     */\n    ChildEventRegistration.prototype.respondsTo = function (eventType) {\n        var eventToCheck = eventType === 'children_added' ? 'child_added' : eventType;\n        eventToCheck =\n            eventToCheck === 'children_removed' ? 'child_removed' : eventToCheck;\n        return util_1.contains(this.callbacks_, eventToCheck);\n    };\n    /**\n     * @inheritDoc\n     */\n    ChildEventRegistration.prototype.createCancelEvent = function (error, path) {\n        if (this.cancelCallback_) {\n            return new Event_1.CancelEvent(this, error, path);\n        }\n        else {\n            return null;\n        }\n    };\n    /**\n     * @inheritDoc\n     */\n    ChildEventRegistration.prototype.createEvent = function (change, query) {\n        util_2.assert(change.childName != null, 'Child events should have a childName.');\n        var ref = query.getRef().child(/** @type {!string} */ (change.childName));\n        var index = query.getQueryParams().getIndex();\n        return new Event_1.DataEvent(change.type, this, new DataSnapshot_1.DataSnapshot(change.snapshotNode, ref, index), change.prevName);\n    };\n    /**\n     * @inheritDoc\n     */\n    ChildEventRegistration.prototype.getEventRunner = function (eventData) {\n        var ctx = this.context_;\n        if (eventData.getEventType() === 'cancel') {\n            util_2.assert(this.cancelCallback_, 'Raising a cancel event on a listener with no cancel callback');\n            var cancelCB_2 = this.cancelCallback_;\n            return function () {\n                // We know that error exists, we checked above that this is a cancel event\n                cancelCB_2.call(ctx, eventData.error);\n            };\n        }\n        else {\n            var cb_2 = this.callbacks_[eventData.eventType];\n            return function () {\n                cb_2.call(ctx, eventData.snapshot, eventData.prevName);\n            };\n        }\n    };\n    /**\n     * @inheritDoc\n     */\n    ChildEventRegistration.prototype.matches = function (other) {\n        if (other instanceof ChildEventRegistration) {\n            if (!this.callbacks_ || !other.callbacks_) {\n                return true;\n            }\n            else if (this.context_ === other.context_) {\n                var otherCount = util_1.getCount(other.callbacks_);\n                var thisCount = util_1.getCount(this.callbacks_);\n                if (otherCount === thisCount) {\n                    // If count is 1, do an exact match on eventType, if either is defined but null, it's a match.\n                    //  If event types don't match, not a match\n                    // If count is not 1, exact match across all\n                    if (otherCount === 1) {\n                        var otherKey /** @type {!string} */ = util_1.getAnyKey(other.callbacks_);\n                        var thisKey /** @type {!string} */ = util_1.getAnyKey(this.callbacks_);\n                        return (thisKey === otherKey &&\n                            (!other.callbacks_[otherKey] ||\n                                !this.callbacks_[thisKey] ||\n                                other.callbacks_[otherKey] === this.callbacks_[thisKey]));\n                    }\n                    else {\n                        // Exact match on each key.\n                        return util_1.every(this.callbacks_, function (eventType, cb) { return other.callbacks_[eventType] === cb; });\n                    }\n                }\n            }\n        }\n        return false;\n    };\n    /**\n     * @inheritDoc\n     */\n    ChildEventRegistration.prototype.hasAnyCallback = function () {\n        return this.callbacks_ !== null;\n    };\n    return ChildEventRegistration;\n}());\nexports.ChildEventRegistration = ChildEventRegistration;\n\n//# sourceMappingURL=EventRegistration.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/view/EventRegistration.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = require(\"@firebase/util\");\n/**\n * Encapsulates the data needed to raise an event\n * @implements {Event}\n */\nvar DataEvent = /** @class */ (function () {\n    /**\n     * @param {!string} eventType One of: value, child_added, child_changed, child_moved, child_removed\n     * @param {!EventRegistration} eventRegistration The function to call to with the event data. User provided\n     * @param {!DataSnapshot} snapshot The data backing the event\n     * @param {?string=} prevName Optional, the name of the previous child for child_* events.\n     */\n    function DataEvent(eventType, eventRegistration, snapshot, prevName) {\n        this.eventType = eventType;\n        this.eventRegistration = eventRegistration;\n        this.snapshot = snapshot;\n        this.prevName = prevName;\n    }\n    /**\n     * @inheritDoc\n     */\n    DataEvent.prototype.getPath = function () {\n        var ref = this.snapshot.getRef();\n        if (this.eventType === 'value') {\n            return ref.path;\n        }\n        else {\n            return ref.getParent().path;\n        }\n    };\n    /**\n     * @inheritDoc\n     */\n    DataEvent.prototype.getEventType = function () {\n        return this.eventType;\n    };\n    /**\n     * @inheritDoc\n     */\n    DataEvent.prototype.getEventRunner = function () {\n        return this.eventRegistration.getEventRunner(this);\n    };\n    /**\n     * @inheritDoc\n     */\n    DataEvent.prototype.toString = function () {\n        return (this.getPath().toString() +\n            ':' +\n            this.eventType +\n            ':' +\n            util_1.stringify(this.snapshot.exportVal()));\n    };\n    return DataEvent;\n}());\nexports.DataEvent = DataEvent;\nvar CancelEvent = /** @class */ (function () {\n    /**\n     * @param {EventRegistration} eventRegistration\n     * @param {Error} error\n     * @param {!Path} path\n     */\n    function CancelEvent(eventRegistration, error, path) {\n        this.eventRegistration = eventRegistration;\n        this.error = error;\n        this.path = path;\n    }\n    /**\n     * @inheritDoc\n     */\n    CancelEvent.prototype.getPath = function () {\n        return this.path;\n    };\n    /**\n     * @inheritDoc\n     */\n    CancelEvent.prototype.getEventType = function () {\n        return 'cancel';\n    };\n    /**\n     * @inheritDoc\n     */\n    CancelEvent.prototype.getEventRunner = function () {\n        return this.eventRegistration.getEventRunner(this);\n    };\n    /**\n     * @inheritDoc\n     */\n    CancelEvent.prototype.toString = function () {\n        return this.path.toString() + ':cancel';\n    };\n    return CancelEvent;\n}());\nexports.CancelEvent = CancelEvent;\n\n//# sourceMappingURL=Event.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/view/Event.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = require(\"@firebase/util\");\nvar util_2 = require(\"./util/util\");\nvar AckUserWrite_1 = require(\"./operation/AckUserWrite\");\nvar ChildrenNode_1 = require(\"./snap/ChildrenNode\");\nvar util_3 = require(\"@firebase/util\");\nvar ImmutableTree_1 = require(\"./util/ImmutableTree\");\nvar ListenComplete_1 = require(\"./operation/ListenComplete\");\nvar Merge_1 = require(\"./operation/Merge\");\nvar Operation_1 = require(\"./operation/Operation\");\nvar Overwrite_1 = require(\"./operation/Overwrite\");\nvar Path_1 = require(\"./util/Path\");\nvar SyncPoint_1 = require(\"./SyncPoint\");\nvar WriteTree_1 = require(\"./WriteTree\");\n/**\n * SyncTree is the central class for managing event callback registration, data caching, views\n * (query processing), and event generation.  There are typically two SyncTree instances for\n * each Repo, one for the normal Firebase data, and one for the .info data.\n *\n * It has a number of responsibilities, including:\n *  - Tracking all user event callbacks (registered via addEventRegistration() and removeEventRegistration()).\n *  - Applying and caching data changes for user set(), transaction(), and update() calls\n *    (applyUserOverwrite(), applyUserMerge()).\n *  - Applying and caching data changes for server data changes (applyServerOverwrite(),\n *    applyServerMerge()).\n *  - Generating user-facing events for server and user changes (all of the apply* methods\n *    return the set of events that need to be raised as a result).\n *  - Maintaining the appropriate set of server listens to ensure we are always subscribed\n *    to the correct set of paths and queries to satisfy the current set of user event\n *    callbacks (listens are started/stopped using the provided listenProvider).\n *\n * NOTE: Although SyncTree tracks event callbacks and calculates events to raise, the actual\n * events are returned to the caller rather than raised synchronously.\n *\n * @constructor\n */\nvar SyncTree = /** @class */ (function () {\n    /**\n     * @param {!ListenProvider} listenProvider_ Used by SyncTree to start / stop listening\n     *   to server data.\n     */\n    function SyncTree(listenProvider_) {\n        this.listenProvider_ = listenProvider_;\n        /**\n         * Tree of SyncPoints.  There's a SyncPoint at any location that has 1 or more views.\n         * @type {!ImmutableTree.<!SyncPoint>}\n         * @private\n         */\n        this.syncPointTree_ = ImmutableTree_1.ImmutableTree.Empty;\n        /**\n         * A tree of all pending user writes (user-initiated set()'s, transaction()'s, update()'s, etc.).\n         * @type {!WriteTree}\n         * @private\n         */\n        this.pendingWriteTree_ = new WriteTree_1.WriteTree();\n        this.tagToQueryMap_ = {};\n        this.queryToTagMap_ = {};\n    }\n    /**\n     * Apply the data changes for a user-generated set() or transaction() call.\n     *\n     * @param {!Path} path\n     * @param {!Node} newData\n     * @param {number} writeId\n     * @param {boolean=} visible\n     * @return {!Array.<!Event>} Events to raise.\n     */\n    SyncTree.prototype.applyUserOverwrite = function (path, newData, writeId, visible) {\n        // Record pending write.\n        this.pendingWriteTree_.addOverwrite(path, newData, writeId, visible);\n        if (!visible) {\n            return [];\n        }\n        else {\n            return this.applyOperationToSyncPoints_(new Overwrite_1.Overwrite(Operation_1.OperationSource.User, path, newData));\n        }\n    };\n    /**\n     * Apply the data from a user-generated update() call\n     *\n     * @param {!Path} path\n     * @param {!Object.<string, !Node>} changedChildren\n     * @param {!number} writeId\n     * @return {!Array.<!Event>} Events to raise.\n     */\n    SyncTree.prototype.applyUserMerge = function (path, changedChildren, writeId) {\n        // Record pending merge.\n        this.pendingWriteTree_.addMerge(path, changedChildren, writeId);\n        var changeTree = ImmutableTree_1.ImmutableTree.fromObject(changedChildren);\n        return this.applyOperationToSyncPoints_(new Merge_1.Merge(Operation_1.OperationSource.User, path, changeTree));\n    };\n    /**\n     * Acknowledge a pending user write that was previously registered with applyUserOverwrite() or applyUserMerge().\n     *\n     * @param {!number} writeId\n     * @param {boolean=} revert True if the given write failed and needs to be reverted\n     * @return {!Array.<!Event>} Events to raise.\n     */\n    SyncTree.prototype.ackUserWrite = function (writeId, revert) {\n        if (revert === void 0) { revert = false; }\n        var write = this.pendingWriteTree_.getWrite(writeId);\n        var needToReevaluate = this.pendingWriteTree_.removeWrite(writeId);\n        if (!needToReevaluate) {\n            return [];\n        }\n        else {\n            var affectedTree_1 = ImmutableTree_1.ImmutableTree.Empty;\n            if (write.snap != null) {\n                // overwrite\n                affectedTree_1 = affectedTree_1.set(Path_1.Path.Empty, true);\n            }\n            else {\n                util_3.forEach(write.children, function (pathString, node) {\n                    affectedTree_1 = affectedTree_1.set(new Path_1.Path(pathString), node);\n                });\n            }\n            return this.applyOperationToSyncPoints_(new AckUserWrite_1.AckUserWrite(write.path, affectedTree_1, revert));\n        }\n    };\n    /**\n     * Apply new server data for the specified path..\n     *\n     * @param {!Path} path\n     * @param {!Node} newData\n     * @return {!Array.<!Event>} Events to raise.\n     */\n    SyncTree.prototype.applyServerOverwrite = function (path, newData) {\n        return this.applyOperationToSyncPoints_(new Overwrite_1.Overwrite(Operation_1.OperationSource.Server, path, newData));\n    };\n    /**\n     * Apply new server data to be merged in at the specified path.\n     *\n     * @param {!Path} path\n     * @param {!Object.<string, !Node>} changedChildren\n     * @return {!Array.<!Event>} Events to raise.\n     */\n    SyncTree.prototype.applyServerMerge = function (path, changedChildren) {\n        var changeTree = ImmutableTree_1.ImmutableTree.fromObject(changedChildren);\n        return this.applyOperationToSyncPoints_(new Merge_1.Merge(Operation_1.OperationSource.Server, path, changeTree));\n    };\n    /**\n     * Apply a listen complete for a query\n     *\n     * @param {!Path} path\n     * @return {!Array.<!Event>} Events to raise.\n     */\n    SyncTree.prototype.applyListenComplete = function (path) {\n        return this.applyOperationToSyncPoints_(new ListenComplete_1.ListenComplete(Operation_1.OperationSource.Server, path));\n    };\n    /**\n     * Apply new server data for the specified tagged query.\n     *\n     * @param {!Path} path\n     * @param {!Node} snap\n     * @param {!number} tag\n     * @return {!Array.<!Event>} Events to raise.\n     */\n    SyncTree.prototype.applyTaggedQueryOverwrite = function (path, snap, tag) {\n        var queryKey = this.queryKeyForTag_(tag);\n        if (queryKey != null) {\n            var r = SyncTree.parseQueryKey_(queryKey);\n            var queryPath = r.path, queryId = r.queryId;\n            var relativePath = Path_1.Path.relativePath(queryPath, path);\n            var op = new Overwrite_1.Overwrite(Operation_1.OperationSource.forServerTaggedQuery(queryId), relativePath, snap);\n            return this.applyTaggedOperation_(queryPath, op);\n        }\n        else {\n            // Query must have been removed already\n            return [];\n        }\n    };\n    /**\n     * Apply server data to be merged in for the specified tagged query.\n     *\n     * @param {!Path} path\n     * @param {!Object.<string, !Node>} changedChildren\n     * @param {!number} tag\n     * @return {!Array.<!Event>} Events to raise.\n     */\n    SyncTree.prototype.applyTaggedQueryMerge = function (path, changedChildren, tag) {\n        var queryKey = this.queryKeyForTag_(tag);\n        if (queryKey) {\n            var r = SyncTree.parseQueryKey_(queryKey);\n            var queryPath = r.path, queryId = r.queryId;\n            var relativePath = Path_1.Path.relativePath(queryPath, path);\n            var changeTree = ImmutableTree_1.ImmutableTree.fromObject(changedChildren);\n            var op = new Merge_1.Merge(Operation_1.OperationSource.forServerTaggedQuery(queryId), relativePath, changeTree);\n            return this.applyTaggedOperation_(queryPath, op);\n        }\n        else {\n            // We've already removed the query. No big deal, ignore the update\n            return [];\n        }\n    };\n    /**\n     * Apply a listen complete for a tagged query\n     *\n     * @param {!Path} path\n     * @param {!number} tag\n     * @return {!Array.<!Event>} Events to raise.\n     */\n    SyncTree.prototype.applyTaggedListenComplete = function (path, tag) {\n        var queryKey = this.queryKeyForTag_(tag);\n        if (queryKey) {\n            var r = SyncTree.parseQueryKey_(queryKey);\n            var queryPath = r.path, queryId = r.queryId;\n            var relativePath = Path_1.Path.relativePath(queryPath, path);\n            var op = new ListenComplete_1.ListenComplete(Operation_1.OperationSource.forServerTaggedQuery(queryId), relativePath);\n            return this.applyTaggedOperation_(queryPath, op);\n        }\n        else {\n            // We've already removed the query. No big deal, ignore the update\n            return [];\n        }\n    };\n    /**\n     * Add an event callback for the specified query.\n     *\n     * @param {!Query} query\n     * @param {!EventRegistration} eventRegistration\n     * @return {!Array.<!Event>} Events to raise.\n     */\n    SyncTree.prototype.addEventRegistration = function (query, eventRegistration) {\n        var path = query.path;\n        var serverCache = null;\n        var foundAncestorDefaultView = false;\n        // Any covering writes will necessarily be at the root, so really all we need to find is the server cache.\n        // Consider optimizing this once there's a better understanding of what actual behavior will be.\n        this.syncPointTree_.foreachOnPath(path, function (pathToSyncPoint, sp) {\n            var relativePath = Path_1.Path.relativePath(pathToSyncPoint, path);\n            serverCache = serverCache || sp.getCompleteServerCache(relativePath);\n            foundAncestorDefaultView =\n                foundAncestorDefaultView || sp.hasCompleteView();\n        });\n        var syncPoint = this.syncPointTree_.get(path);\n        if (!syncPoint) {\n            syncPoint = new SyncPoint_1.SyncPoint();\n            this.syncPointTree_ = this.syncPointTree_.set(path, syncPoint);\n        }\n        else {\n            foundAncestorDefaultView =\n                foundAncestorDefaultView || syncPoint.hasCompleteView();\n            serverCache = serverCache || syncPoint.getCompleteServerCache(Path_1.Path.Empty);\n        }\n        var serverCacheComplete;\n        if (serverCache != null) {\n            serverCacheComplete = true;\n        }\n        else {\n            serverCacheComplete = false;\n            serverCache = ChildrenNode_1.ChildrenNode.EMPTY_NODE;\n            var subtree = this.syncPointTree_.subtree(path);\n            subtree.foreachChild(function (childName, childSyncPoint) {\n                var completeCache = childSyncPoint.getCompleteServerCache(Path_1.Path.Empty);\n                if (completeCache) {\n                    serverCache = serverCache.updateImmediateChild(childName, completeCache);\n                }\n            });\n        }\n        var viewAlreadyExists = syncPoint.viewExistsForQuery(query);\n        if (!viewAlreadyExists && !query.getQueryParams().loadsAllData()) {\n            // We need to track a tag for this query\n            var queryKey = SyncTree.makeQueryKey_(query);\n            util_1.assert(!(queryKey in this.queryToTagMap_), 'View does not exist, but we have a tag');\n            var tag = SyncTree.getNextQueryTag_();\n            this.queryToTagMap_[queryKey] = tag;\n            // Coerce to string to avoid sparse arrays.\n            this.tagToQueryMap_['_' + tag] = queryKey;\n        }\n        var writesCache = this.pendingWriteTree_.childWrites(path);\n        var events = syncPoint.addEventRegistration(query, eventRegistration, writesCache, serverCache, serverCacheComplete);\n        if (!viewAlreadyExists && !foundAncestorDefaultView) {\n            var view /** @type !View */ = syncPoint.viewForQuery(query);\n            events = events.concat(this.setupListener_(query, view));\n        }\n        return events;\n    };\n    /**\n     * Remove event callback(s).\n     *\n     * If query is the default query, we'll check all queries for the specified eventRegistration.\n     * If eventRegistration is null, we'll remove all callbacks for the specified query/queries.\n     *\n     * @param {!Query} query\n     * @param {?EventRegistration} eventRegistration If null, all callbacks are removed.\n     * @param {Error=} cancelError If a cancelError is provided, appropriate cancel events will be returned.\n     * @return {!Array.<!Event>} Cancel events, if cancelError was provided.\n     */\n    SyncTree.prototype.removeEventRegistration = function (query, eventRegistration, cancelError) {\n        var _this = this;\n        // Find the syncPoint first. Then deal with whether or not it has matching listeners\n        var path = query.path;\n        var maybeSyncPoint = this.syncPointTree_.get(path);\n        var cancelEvents = [];\n        // A removal on a default query affects all queries at that location. A removal on an indexed query, even one without\n        // other query constraints, does *not* affect all queries at that location. So this check must be for 'default', and\n        // not loadsAllData().\n        if (maybeSyncPoint &&\n            (query.queryIdentifier() === 'default' ||\n                maybeSyncPoint.viewExistsForQuery(query))) {\n            /**\n             * @type {{removed: !Array.<!Query>, events: !Array.<!Event>}}\n             */\n            var removedAndEvents = maybeSyncPoint.removeEventRegistration(query, eventRegistration, cancelError);\n            if (maybeSyncPoint.isEmpty()) {\n                this.syncPointTree_ = this.syncPointTree_.remove(path);\n            }\n            var removed = removedAndEvents.removed;\n            cancelEvents = removedAndEvents.events;\n            // We may have just removed one of many listeners and can short-circuit this whole process\n            // We may also not have removed a default listener, in which case all of the descendant listeners should already be\n            // properly set up.\n            //\n            // Since indexed queries can shadow if they don't have other query constraints, check for loadsAllData(), instead of\n            // queryId === 'default'\n            var removingDefault = -1 !==\n                removed.findIndex(function (query) {\n                    return query.getQueryParams().loadsAllData();\n                });\n            var covered = this.syncPointTree_.findOnPath(path, function (relativePath, parentSyncPoint) {\n                return parentSyncPoint.hasCompleteView();\n            });\n            if (removingDefault && !covered) {\n                var subtree = this.syncPointTree_.subtree(path);\n                // There are potentially child listeners. Determine what if any listens we need to send before executing the\n                // removal\n                if (!subtree.isEmpty()) {\n                    // We need to fold over our subtree and collect the listeners to send\n                    var newViews = this.collectDistinctViewsForSubTree_(subtree);\n                    // Ok, we've collected all the listens we need. Set them up.\n                    for (var i = 0; i < newViews.length; ++i) {\n                        var view = newViews[i], newQuery = view.getQuery();\n                        var listener = this.createListenerForView_(view);\n                        this.listenProvider_.startListening(SyncTree.queryForListening_(newQuery), this.tagForQuery_(newQuery), listener.hashFn, listener.onComplete);\n                    }\n                }\n                else {\n                    // There's nothing below us, so nothing we need to start listening on\n                }\n            }\n            // If we removed anything and we're not covered by a higher up listen, we need to stop listening on this query\n            // The above block has us covered in terms of making sure we're set up on listens lower in the tree.\n            // Also, note that if we have a cancelError, it's already been removed at the provider level.\n            if (!covered && removed.length > 0 && !cancelError) {\n                // If we removed a default, then we weren't listening on any of the other queries here. Just cancel the one\n                // default. Otherwise, we need to iterate through and cancel each individual query\n                if (removingDefault) {\n                    // We don't tag default listeners\n                    var defaultTag = null;\n                    this.listenProvider_.stopListening(SyncTree.queryForListening_(query), defaultTag);\n                }\n                else {\n                    removed.forEach(function (queryToRemove) {\n                        var tagToRemove = _this.queryToTagMap_[SyncTree.makeQueryKey_(queryToRemove)];\n                        _this.listenProvider_.stopListening(SyncTree.queryForListening_(queryToRemove), tagToRemove);\n                    });\n                }\n            }\n            // Now, clear all of the tags we're tracking for the removed listens\n            this.removeTags_(removed);\n        }\n        else {\n            // No-op, this listener must've been already removed\n        }\n        return cancelEvents;\n    };\n    /**\n     * Returns a complete cache, if we have one, of the data at a particular path. The location must have a listener above\n     * it, but as this is only used by transaction code, that should always be the case anyways.\n     *\n     * Note: this method will *include* hidden writes from transaction with applyLocally set to false.\n     * @param {!Path} path The path to the data we want\n     * @param {Array.<number>=} writeIdsToExclude A specific set to be excluded\n     * @return {?Node}\n     */\n    SyncTree.prototype.calcCompleteEventCache = function (path, writeIdsToExclude) {\n        var includeHiddenSets = true;\n        var writeTree = this.pendingWriteTree_;\n        var serverCache = this.syncPointTree_.findOnPath(path, function (pathSoFar, syncPoint) {\n            var relativePath = Path_1.Path.relativePath(pathSoFar, path);\n            var serverCache = syncPoint.getCompleteServerCache(relativePath);\n            if (serverCache) {\n                return serverCache;\n            }\n        });\n        return writeTree.calcCompleteEventCache(path, serverCache, writeIdsToExclude, includeHiddenSets);\n    };\n    /**\n     * This collapses multiple unfiltered views into a single view, since we only need a single\n     * listener for them.\n     *\n     * @param {!ImmutableTree.<!SyncPoint>} subtree\n     * @return {!Array.<!View>}\n     * @private\n     */\n    SyncTree.prototype.collectDistinctViewsForSubTree_ = function (subtree) {\n        return subtree.fold(function (relativePath, maybeChildSyncPoint, childMap) {\n            if (maybeChildSyncPoint && maybeChildSyncPoint.hasCompleteView()) {\n                var completeView = maybeChildSyncPoint.getCompleteView();\n                return [completeView];\n            }\n            else {\n                // No complete view here, flatten any deeper listens into an array\n                var views_1 = [];\n                if (maybeChildSyncPoint) {\n                    views_1 = maybeChildSyncPoint.getQueryViews();\n                }\n                util_3.forEach(childMap, function (key, childViews) {\n                    views_1 = views_1.concat(childViews);\n                });\n                return views_1;\n            }\n        });\n    };\n    /**\n     * @param {!Array.<!Query>} queries\n     * @private\n     */\n    SyncTree.prototype.removeTags_ = function (queries) {\n        for (var j = 0; j < queries.length; ++j) {\n            var removedQuery = queries[j];\n            if (!removedQuery.getQueryParams().loadsAllData()) {\n                // We should have a tag for this\n                var removedQueryKey = SyncTree.makeQueryKey_(removedQuery);\n                var removedQueryTag = this.queryToTagMap_[removedQueryKey];\n                delete this.queryToTagMap_[removedQueryKey];\n                delete this.tagToQueryMap_['_' + removedQueryTag];\n            }\n        }\n    };\n    /**\n     * Normalizes a query to a query we send the server for listening\n     * @param {!Query} query\n     * @return {!Query} The normalized query\n     * @private\n     */\n    SyncTree.queryForListening_ = function (query) {\n        if (query.getQueryParams().loadsAllData() &&\n            !query.getQueryParams().isDefault()) {\n            // We treat queries that load all data as default queries\n            // Cast is necessary because ref() technically returns Firebase which is actually fb.api.Firebase which inherits\n            // from Query\n            return /** @type {!Query} */ query.getRef();\n        }\n        else {\n            return query;\n        }\n    };\n    /**\n     * For a given new listen, manage the de-duplication of outstanding subscriptions.\n     *\n     * @param {!Query} query\n     * @param {!View} view\n     * @return {!Array.<!Event>} This method can return events to support synchronous data sources\n     * @private\n     */\n    SyncTree.prototype.setupListener_ = function (query, view) {\n        var path = query.path;\n        var tag = this.tagForQuery_(query);\n        var listener = this.createListenerForView_(view);\n        var events = this.listenProvider_.startListening(SyncTree.queryForListening_(query), tag, listener.hashFn, listener.onComplete);\n        var subtree = this.syncPointTree_.subtree(path);\n        // The root of this subtree has our query. We're here because we definitely need to send a listen for that, but we\n        // may need to shadow other listens as well.\n        if (tag) {\n            util_1.assert(!subtree.value.hasCompleteView(), \"If we're adding a query, it shouldn't be shadowed\");\n        }\n        else {\n            // Shadow everything at or below this location, this is a default listener.\n            var queriesToStop = subtree.fold(function (relativePath, maybeChildSyncPoint, childMap) {\n                if (!relativePath.isEmpty() &&\n                    maybeChildSyncPoint &&\n                    maybeChildSyncPoint.hasCompleteView()) {\n                    return [maybeChildSyncPoint.getCompleteView().getQuery()];\n                }\n                else {\n                    // No default listener here, flatten any deeper queries into an array\n                    var queries_1 = [];\n                    if (maybeChildSyncPoint) {\n                        queries_1 = queries_1.concat(maybeChildSyncPoint.getQueryViews().map(function (view) { return view.getQuery(); }));\n                    }\n                    util_3.forEach(childMap, function (key, childQueries) {\n                        queries_1 = queries_1.concat(childQueries);\n                    });\n                    return queries_1;\n                }\n            });\n            for (var i = 0; i < queriesToStop.length; ++i) {\n                var queryToStop = queriesToStop[i];\n                this.listenProvider_.stopListening(SyncTree.queryForListening_(queryToStop), this.tagForQuery_(queryToStop));\n            }\n        }\n        return events;\n    };\n    /**\n     *\n     * @param {!View} view\n     * @return {{hashFn: function(), onComplete: function(!string, *)}}\n     * @private\n     */\n    SyncTree.prototype.createListenerForView_ = function (view) {\n        var _this = this;\n        var query = view.getQuery();\n        var tag = this.tagForQuery_(query);\n        return {\n            hashFn: function () {\n                var cache = view.getServerCache() || ChildrenNode_1.ChildrenNode.EMPTY_NODE;\n                return cache.hash();\n            },\n            onComplete: function (status) {\n                if (status === 'ok') {\n                    if (tag) {\n                        return _this.applyTaggedListenComplete(query.path, tag);\n                    }\n                    else {\n                        return _this.applyListenComplete(query.path);\n                    }\n                }\n                else {\n                    // If a listen failed, kill all of the listeners here, not just the one that triggered the error.\n                    // Note that this may need to be scoped to just this listener if we change permissions on filtered children\n                    var error = util_2.errorForServerCode(status, query);\n                    return _this.removeEventRegistration(query, \n                    /*eventRegistration*/ null, error);\n                }\n            }\n        };\n    };\n    /**\n     * Given a query, computes a \"queryKey\" suitable for use in our queryToTagMap_.\n     * @private\n     * @param {!Query} query\n     * @return {string}\n     */\n    SyncTree.makeQueryKey_ = function (query) {\n        return query.path.toString() + '$' + query.queryIdentifier();\n    };\n    /**\n     * Given a queryKey (created by makeQueryKey), parse it back into a path and queryId.\n     * @private\n     * @param {!string} queryKey\n     * @return {{queryId: !string, path: !Path}}\n     */\n    SyncTree.parseQueryKey_ = function (queryKey) {\n        var splitIndex = queryKey.indexOf('$');\n        util_1.assert(splitIndex !== -1 && splitIndex < queryKey.length - 1, 'Bad queryKey.');\n        return {\n            queryId: queryKey.substr(splitIndex + 1),\n            path: new Path_1.Path(queryKey.substr(0, splitIndex))\n        };\n    };\n    /**\n     * Return the query associated with the given tag, if we have one\n     * @param {!number} tag\n     * @return {?string}\n     * @private\n     */\n    SyncTree.prototype.queryKeyForTag_ = function (tag) {\n        return this.tagToQueryMap_['_' + tag];\n    };\n    /**\n     * Return the tag associated with the given query.\n     * @param {!Query} query\n     * @return {?number}\n     * @private\n     */\n    SyncTree.prototype.tagForQuery_ = function (query) {\n        var queryKey = SyncTree.makeQueryKey_(query);\n        return util_3.safeGet(this.queryToTagMap_, queryKey);\n    };\n    /**\n     * Static accessor for query tags.\n     * @return {number}\n     * @private\n     */\n    SyncTree.getNextQueryTag_ = function () {\n        return SyncTree.nextQueryTag_++;\n    };\n    /**\n     * A helper method to apply tagged operations\n     *\n     * @param {!Path} queryPath\n     * @param {!Operation} operation\n     * @return {!Array.<!Event>}\n     * @private\n     */\n    SyncTree.prototype.applyTaggedOperation_ = function (queryPath, operation) {\n        var syncPoint = this.syncPointTree_.get(queryPath);\n        util_1.assert(syncPoint, \"Missing sync point for query tag that we're tracking\");\n        var writesCache = this.pendingWriteTree_.childWrites(queryPath);\n        return syncPoint.applyOperation(operation, writesCache, \n        /*serverCache=*/ null);\n    };\n    /**\n     * A helper method that visits all descendant and ancestor SyncPoints, applying the operation.\n     *\n     * NOTES:\n     * - Descendant SyncPoints will be visited first (since we raise events depth-first).\n  \n     * - We call applyOperation() on each SyncPoint passing three things:\n     *   1. A version of the Operation that has been made relative to the SyncPoint location.\n     *   2. A WriteTreeRef of any writes we have cached at the SyncPoint location.\n     *   3. A snapshot Node with cached server data, if we have it.\n  \n     * - We concatenate all of the events returned by each SyncPoint and return the result.\n     *\n     * @param {!Operation} operation\n     * @return {!Array.<!Event>}\n     * @private\n     */\n    SyncTree.prototype.applyOperationToSyncPoints_ = function (operation) {\n        return this.applyOperationHelper_(operation, this.syncPointTree_, \n        /*serverCache=*/ null, this.pendingWriteTree_.childWrites(Path_1.Path.Empty));\n    };\n    /**\n     * Recursive helper for applyOperationToSyncPoints_\n     *\n     * @private\n     * @param {!Operation} operation\n     * @param {ImmutableTree.<!SyncPoint>} syncPointTree\n     * @param {?Node} serverCache\n     * @param {!WriteTreeRef} writesCache\n     * @return {!Array.<!Event>}\n     */\n    SyncTree.prototype.applyOperationHelper_ = function (operation, syncPointTree, serverCache, writesCache) {\n        if (operation.path.isEmpty()) {\n            return this.applyOperationDescendantsHelper_(operation, syncPointTree, serverCache, writesCache);\n        }\n        else {\n            var syncPoint = syncPointTree.get(Path_1.Path.Empty);\n            // If we don't have cached server data, see if we can get it from this SyncPoint.\n            if (serverCache == null && syncPoint != null) {\n                serverCache = syncPoint.getCompleteServerCache(Path_1.Path.Empty);\n            }\n            var events = [];\n            var childName = operation.path.getFront();\n            var childOperation = operation.operationForChild(childName);\n            var childTree = syncPointTree.children.get(childName);\n            if (childTree && childOperation) {\n                var childServerCache = serverCache\n                    ? serverCache.getImmediateChild(childName)\n                    : null;\n                var childWritesCache = writesCache.child(childName);\n                events = events.concat(this.applyOperationHelper_(childOperation, childTree, childServerCache, childWritesCache));\n            }\n            if (syncPoint) {\n                events = events.concat(syncPoint.applyOperation(operation, writesCache, serverCache));\n            }\n            return events;\n        }\n    };\n    /**\n     * Recursive helper for applyOperationToSyncPoints_\n     *\n     * @private\n     * @param {!Operation} operation\n     * @param {ImmutableTree.<!SyncPoint>} syncPointTree\n     * @param {?Node} serverCache\n     * @param {!WriteTreeRef} writesCache\n     * @return {!Array.<!Event>}\n     */\n    SyncTree.prototype.applyOperationDescendantsHelper_ = function (operation, syncPointTree, serverCache, writesCache) {\n        var _this = this;\n        var syncPoint = syncPointTree.get(Path_1.Path.Empty);\n        // If we don't have cached server data, see if we can get it from this SyncPoint.\n        if (serverCache == null && syncPoint != null) {\n            serverCache = syncPoint.getCompleteServerCache(Path_1.Path.Empty);\n        }\n        var events = [];\n        syncPointTree.children.inorderTraversal(function (childName, childTree) {\n            var childServerCache = serverCache\n                ? serverCache.getImmediateChild(childName)\n                : null;\n            var childWritesCache = writesCache.child(childName);\n            var childOperation = operation.operationForChild(childName);\n            if (childOperation) {\n                events = events.concat(_this.applyOperationDescendantsHelper_(childOperation, childTree, childServerCache, childWritesCache));\n            }\n        });\n        if (syncPoint) {\n            events = events.concat(syncPoint.applyOperation(operation, writesCache, serverCache));\n        }\n        return events;\n    };\n    /**\n     * Static tracker for next query tag.\n     * @type {number}\n     * @private\n     */\n    SyncTree.nextQueryTag_ = 1;\n    return SyncTree;\n}());\nexports.SyncTree = SyncTree;\n\n//# sourceMappingURL=SyncTree.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/SyncTree.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = require(\"@firebase/util\");\nvar Path_1 = require(\"../util/Path\");\nvar Operation_1 = require(\"./Operation\");\nvar AckUserWrite = /** @class */ (function () {\n    /**\n     *\n     * @param {!Path} path\n     * @param {!ImmutableTree<!boolean>} affectedTree A tree containing true for each affected path. Affected paths can't overlap.\n     * @param {!boolean} revert\n     */\n    function AckUserWrite(\n        /**@inheritDoc */ path, \n        /**@inheritDoc */ affectedTree, \n        /**@inheritDoc */ revert) {\n        this.path = path;\n        this.affectedTree = affectedTree;\n        this.revert = revert;\n        /** @inheritDoc */\n        this.type = Operation_1.OperationType.ACK_USER_WRITE;\n        /** @inheritDoc */\n        this.source = Operation_1.OperationSource.User;\n    }\n    /**\n     * @inheritDoc\n     */\n    AckUserWrite.prototype.operationForChild = function (childName) {\n        if (!this.path.isEmpty()) {\n            util_1.assert(this.path.getFront() === childName, 'operationForChild called for unrelated child.');\n            return new AckUserWrite(this.path.popFront(), this.affectedTree, this.revert);\n        }\n        else if (this.affectedTree.value != null) {\n            util_1.assert(this.affectedTree.children.isEmpty(), 'affectedTree should not have overlapping affected paths.');\n            // All child locations are affected as well; just return same operation.\n            return this;\n        }\n        else {\n            var childTree = this.affectedTree.subtree(new Path_1.Path(childName));\n            return new AckUserWrite(Path_1.Path.Empty, childTree, this.revert);\n        }\n    };\n    return AckUserWrite;\n}());\nexports.AckUserWrite = AckUserWrite;\n\n//# sourceMappingURL=AckUserWrite.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/operation/AckUserWrite.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar Path_1 = require(\"../util/Path\");\nvar Operation_1 = require(\"./Operation\");\n/**\n * @param {!OperationSource} source\n * @param {!Path} path\n * @constructor\n * @implements {Operation}\n */\nvar ListenComplete = /** @class */ (function () {\n    function ListenComplete(source, path) {\n        this.source = source;\n        this.path = path;\n        /** @inheritDoc */\n        this.type = Operation_1.OperationType.LISTEN_COMPLETE;\n    }\n    ListenComplete.prototype.operationForChild = function (childName) {\n        if (this.path.isEmpty()) {\n            return new ListenComplete(this.source, Path_1.Path.Empty);\n        }\n        else {\n            return new ListenComplete(this.source, this.path.popFront());\n        }\n    };\n    return ListenComplete;\n}());\nexports.ListenComplete = ListenComplete;\n\n//# sourceMappingURL=ListenComplete.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/operation/ListenComplete.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar Operation_1 = require(\"./Operation\");\nvar Overwrite_1 = require(\"./Overwrite\");\nvar Path_1 = require(\"../util/Path\");\nvar util_1 = require(\"@firebase/util\");\n/**\n * @param {!OperationSource} source\n * @param {!Path} path\n * @param {!ImmutableTree.<!Node>} children\n * @constructor\n * @implements {Operation}\n */\nvar Merge = /** @class */ (function () {\n    function Merge(\n        /**@inheritDoc */ source, \n        /**@inheritDoc */ path, \n        /**@inheritDoc */ children) {\n        this.source = source;\n        this.path = path;\n        this.children = children;\n        /** @inheritDoc */\n        this.type = Operation_1.OperationType.MERGE;\n    }\n    /**\n     * @inheritDoc\n     */\n    Merge.prototype.operationForChild = function (childName) {\n        if (this.path.isEmpty()) {\n            var childTree = this.children.subtree(new Path_1.Path(childName));\n            if (childTree.isEmpty()) {\n                // This child is unaffected\n                return null;\n            }\n            else if (childTree.value) {\n                // We have a snapshot for the child in question.  This becomes an overwrite of the child.\n                return new Overwrite_1.Overwrite(this.source, Path_1.Path.Empty, childTree.value);\n            }\n            else {\n                // This is a merge at a deeper level\n                return new Merge(this.source, Path_1.Path.Empty, childTree);\n            }\n        }\n        else {\n            util_1.assert(this.path.getFront() === childName, \"Can't get a merge for a child not on the path of the operation\");\n            return new Merge(this.source, this.path.popFront(), this.children);\n        }\n    };\n    /**\n     * @inheritDoc\n     */\n    Merge.prototype.toString = function () {\n        return ('Operation(' +\n            this.path +\n            ': ' +\n            this.source.toString() +\n            ' merge: ' +\n            this.children.toString() +\n            ')');\n    };\n    return Merge;\n}());\nexports.Merge = Merge;\n\n//# sourceMappingURL=Merge.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/operation/Merge.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar IndexedFilter_1 = require(\"./filter/IndexedFilter\");\nvar ViewProcessor_1 = require(\"./ViewProcessor\");\nvar ChildrenNode_1 = require(\"../snap/ChildrenNode\");\nvar CacheNode_1 = require(\"./CacheNode\");\nvar ViewCache_1 = require(\"./ViewCache\");\nvar EventGenerator_1 = require(\"./EventGenerator\");\nvar util_1 = require(\"@firebase/util\");\nvar Operation_1 = require(\"../operation/Operation\");\nvar Change_1 = require(\"./Change\");\nvar PriorityIndex_1 = require(\"../snap/indexes/PriorityIndex\");\n/**\n * A view represents a specific location and query that has 1 or more event registrations.\n *\n * It does several things:\n *  - Maintains the list of event registrations for this location/query.\n *  - Maintains a cache of the data visible for this location/query.\n *  - Applies new operations (via applyOperation), updates the cache, and based on the event\n *    registrations returns the set of events to be raised.\n * @constructor\n */\nvar View = /** @class */ (function () {\n    /**\n     *\n     * @param {!Query} query_\n     * @param {!ViewCache} initialViewCache\n     */\n    function View(query_, initialViewCache) {\n        this.query_ = query_;\n        this.eventRegistrations_ = [];\n        var params = this.query_.getQueryParams();\n        var indexFilter = new IndexedFilter_1.IndexedFilter(params.getIndex());\n        var filter = params.getNodeFilter();\n        /**\n         * @type {ViewProcessor}\n         * @private\n         */\n        this.processor_ = new ViewProcessor_1.ViewProcessor(filter);\n        var initialServerCache = initialViewCache.getServerCache();\n        var initialEventCache = initialViewCache.getEventCache();\n        // Don't filter server node with other filter than index, wait for tagged listen\n        var serverSnap = indexFilter.updateFullNode(ChildrenNode_1.ChildrenNode.EMPTY_NODE, initialServerCache.getNode(), null);\n        var eventSnap = filter.updateFullNode(ChildrenNode_1.ChildrenNode.EMPTY_NODE, initialEventCache.getNode(), null);\n        var newServerCache = new CacheNode_1.CacheNode(serverSnap, initialServerCache.isFullyInitialized(), indexFilter.filtersNodes());\n        var newEventCache = new CacheNode_1.CacheNode(eventSnap, initialEventCache.isFullyInitialized(), filter.filtersNodes());\n        /**\n         * @type {!ViewCache}\n         * @private\n         */\n        this.viewCache_ = new ViewCache_1.ViewCache(newEventCache, newServerCache);\n        /**\n         * @type {!EventGenerator}\n         * @private\n         */\n        this.eventGenerator_ = new EventGenerator_1.EventGenerator(this.query_);\n    }\n    /**\n     * @return {!Query}\n     */\n    View.prototype.getQuery = function () {\n        return this.query_;\n    };\n    /**\n     * @return {?Node}\n     */\n    View.prototype.getServerCache = function () {\n        return this.viewCache_.getServerCache().getNode();\n    };\n    /**\n     * @param {!Path} path\n     * @return {?Node}\n     */\n    View.prototype.getCompleteServerCache = function (path) {\n        var cache = this.viewCache_.getCompleteServerSnap();\n        if (cache) {\n            // If this isn't a \"loadsAllData\" view, then cache isn't actually a complete cache and\n            // we need to see if it contains the child we're interested in.\n            if (this.query_.getQueryParams().loadsAllData() ||\n                (!path.isEmpty() && !cache.getImmediateChild(path.getFront()).isEmpty())) {\n                return cache.getChild(path);\n            }\n        }\n        return null;\n    };\n    /**\n     * @return {boolean}\n     */\n    View.prototype.isEmpty = function () {\n        return this.eventRegistrations_.length === 0;\n    };\n    /**\n     * @param {!EventRegistration} eventRegistration\n     */\n    View.prototype.addEventRegistration = function (eventRegistration) {\n        this.eventRegistrations_.push(eventRegistration);\n    };\n    /**\n     * @param {?EventRegistration} eventRegistration If null, remove all callbacks.\n     * @param {Error=} cancelError If a cancelError is provided, appropriate cancel events will be returned.\n     * @return {!Array.<!Event>} Cancel events, if cancelError was provided.\n     */\n    View.prototype.removeEventRegistration = function (eventRegistration, cancelError) {\n        var cancelEvents = [];\n        if (cancelError) {\n            util_1.assert(eventRegistration == null, 'A cancel should cancel all event registrations.');\n            var path_1 = this.query_.path;\n            this.eventRegistrations_.forEach(function (registration) {\n                cancelError /** @type {!Error} */ = cancelError;\n                var maybeEvent = registration.createCancelEvent(cancelError, path_1);\n                if (maybeEvent) {\n                    cancelEvents.push(maybeEvent);\n                }\n            });\n        }\n        if (eventRegistration) {\n            var remaining = [];\n            for (var i = 0; i < this.eventRegistrations_.length; ++i) {\n                var existing = this.eventRegistrations_[i];\n                if (!existing.matches(eventRegistration)) {\n                    remaining.push(existing);\n                }\n                else if (eventRegistration.hasAnyCallback()) {\n                    // We're removing just this one\n                    remaining = remaining.concat(this.eventRegistrations_.slice(i + 1));\n                    break;\n                }\n            }\n            this.eventRegistrations_ = remaining;\n        }\n        else {\n            this.eventRegistrations_ = [];\n        }\n        return cancelEvents;\n    };\n    /**\n     * Applies the given Operation, updates our cache, and returns the appropriate events.\n     *\n     * @param {!Operation} operation\n     * @param {!WriteTreeRef} writesCache\n     * @param {?Node} completeServerCache\n     * @return {!Array.<!Event>}\n     */\n    View.prototype.applyOperation = function (operation, writesCache, completeServerCache) {\n        if (operation.type === Operation_1.OperationType.MERGE &&\n            operation.source.queryId !== null) {\n            util_1.assert(this.viewCache_.getCompleteServerSnap(), 'We should always have a full cache before handling merges');\n            util_1.assert(this.viewCache_.getCompleteEventSnap(), 'Missing event cache, even though we have a server cache');\n        }\n        var oldViewCache = this.viewCache_;\n        var result = this.processor_.applyOperation(oldViewCache, operation, writesCache, completeServerCache);\n        this.processor_.assertIndexed(result.viewCache);\n        util_1.assert(result.viewCache.getServerCache().isFullyInitialized() ||\n            !oldViewCache.getServerCache().isFullyInitialized(), 'Once a server snap is complete, it should never go back');\n        this.viewCache_ = result.viewCache;\n        return this.generateEventsForChanges_(result.changes, result.viewCache.getEventCache().getNode(), null);\n    };\n    /**\n     * @param {!EventRegistration} registration\n     * @return {!Array.<!Event>}\n     */\n    View.prototype.getInitialEvents = function (registration) {\n        var eventSnap = this.viewCache_.getEventCache();\n        var initialChanges = [];\n        if (!eventSnap.getNode().isLeafNode()) {\n            var eventNode = eventSnap.getNode();\n            eventNode.forEachChild(PriorityIndex_1.PRIORITY_INDEX, function (key, childNode) {\n                initialChanges.push(Change_1.Change.childAddedChange(key, childNode));\n            });\n        }\n        if (eventSnap.isFullyInitialized()) {\n            initialChanges.push(Change_1.Change.valueChange(eventSnap.getNode()));\n        }\n        return this.generateEventsForChanges_(initialChanges, eventSnap.getNode(), registration);\n    };\n    /**\n     * @private\n     * @param {!Array.<!Change>} changes\n     * @param {!Node} eventCache\n     * @param {EventRegistration=} eventRegistration\n     * @return {!Array.<!Event>}\n     */\n    View.prototype.generateEventsForChanges_ = function (changes, eventCache, eventRegistration) {\n        var registrations = eventRegistration\n            ? [eventRegistration]\n            : this.eventRegistrations_;\n        return this.eventGenerator_.generateEventsForChanges(changes, eventCache, registrations);\n    };\n    return View;\n}());\nexports.View = View;\n\n//# sourceMappingURL=View.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/view/View.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar Operation_1 = require(\"../operation/Operation\");\nvar util_1 = require(\"@firebase/util\");\nvar ChildChangeAccumulator_1 = require(\"./ChildChangeAccumulator\");\nvar Change_1 = require(\"./Change\");\nvar ChildrenNode_1 = require(\"../snap/ChildrenNode\");\nvar KeyIndex_1 = require(\"../snap/indexes/KeyIndex\");\nvar ImmutableTree_1 = require(\"../util/ImmutableTree\");\nvar Path_1 = require(\"../util/Path\");\nvar CompleteChildSource_1 = require(\"./CompleteChildSource\");\n/**\n * @constructor\n * @struct\n */\nvar ProcessorResult = /** @class */ (function () {\n    /**\n     * @param {!ViewCache} viewCache\n     * @param {!Array.<!Change>} changes\n     */\n    function ProcessorResult(viewCache, changes) {\n        this.viewCache = viewCache;\n        this.changes = changes;\n    }\n    return ProcessorResult;\n}());\nexports.ProcessorResult = ProcessorResult;\n/**\n * @constructor\n */\nvar ViewProcessor = /** @class */ (function () {\n    /**\n     * @param {!NodeFilter} filter_\n     */\n    function ViewProcessor(filter_) {\n        this.filter_ = filter_;\n    }\n    /**\n     * @param {!ViewCache} viewCache\n     */\n    ViewProcessor.prototype.assertIndexed = function (viewCache) {\n        util_1.assert(viewCache\n            .getEventCache()\n            .getNode()\n            .isIndexed(this.filter_.getIndex()), 'Event snap not indexed');\n        util_1.assert(viewCache\n            .getServerCache()\n            .getNode()\n            .isIndexed(this.filter_.getIndex()), 'Server snap not indexed');\n    };\n    /**\n     * @param {!ViewCache} oldViewCache\n     * @param {!Operation} operation\n     * @param {!WriteTreeRef} writesCache\n     * @param {?Node} completeCache\n     * @return {!ProcessorResult}\n     */\n    ViewProcessor.prototype.applyOperation = function (oldViewCache, operation, writesCache, completeCache) {\n        var accumulator = new ChildChangeAccumulator_1.ChildChangeAccumulator();\n        var newViewCache, filterServerNode;\n        if (operation.type === Operation_1.OperationType.OVERWRITE) {\n            var overwrite = operation;\n            if (overwrite.source.fromUser) {\n                newViewCache = this.applyUserOverwrite_(oldViewCache, overwrite.path, overwrite.snap, writesCache, completeCache, accumulator);\n            }\n            else {\n                util_1.assert(overwrite.source.fromServer, 'Unknown source.');\n                // We filter the node if it's a tagged update or the node has been previously filtered  and the\n                // update is not at the root in which case it is ok (and necessary) to mark the node unfiltered\n                // again\n                filterServerNode =\n                    overwrite.source.tagged ||\n                        (oldViewCache.getServerCache().isFiltered() &&\n                            !overwrite.path.isEmpty());\n                newViewCache = this.applyServerOverwrite_(oldViewCache, overwrite.path, overwrite.snap, writesCache, completeCache, filterServerNode, accumulator);\n            }\n        }\n        else if (operation.type === Operation_1.OperationType.MERGE) {\n            var merge = operation;\n            if (merge.source.fromUser) {\n                newViewCache = this.applyUserMerge_(oldViewCache, merge.path, merge.children, writesCache, completeCache, accumulator);\n            }\n            else {\n                util_1.assert(merge.source.fromServer, 'Unknown source.');\n                // We filter the node if it's a tagged update or the node has been previously filtered\n                filterServerNode =\n                    merge.source.tagged || oldViewCache.getServerCache().isFiltered();\n                newViewCache = this.applyServerMerge_(oldViewCache, merge.path, merge.children, writesCache, completeCache, filterServerNode, accumulator);\n            }\n        }\n        else if (operation.type === Operation_1.OperationType.ACK_USER_WRITE) {\n            var ackUserWrite = operation;\n            if (!ackUserWrite.revert) {\n                newViewCache = this.ackUserWrite_(oldViewCache, ackUserWrite.path, ackUserWrite.affectedTree, writesCache, completeCache, accumulator);\n            }\n            else {\n                newViewCache = this.revertUserWrite_(oldViewCache, ackUserWrite.path, writesCache, completeCache, accumulator);\n            }\n        }\n        else if (operation.type === Operation_1.OperationType.LISTEN_COMPLETE) {\n            newViewCache = this.listenComplete_(oldViewCache, operation.path, writesCache, accumulator);\n        }\n        else {\n            throw util_1.assertionError('Unknown operation type: ' + operation.type);\n        }\n        var changes = accumulator.getChanges();\n        ViewProcessor.maybeAddValueEvent_(oldViewCache, newViewCache, changes);\n        return new ProcessorResult(newViewCache, changes);\n    };\n    /**\n     * @param {!ViewCache} oldViewCache\n     * @param {!ViewCache} newViewCache\n     * @param {!Array.<!Change>} accumulator\n     * @private\n     */\n    ViewProcessor.maybeAddValueEvent_ = function (oldViewCache, newViewCache, accumulator) {\n        var eventSnap = newViewCache.getEventCache();\n        if (eventSnap.isFullyInitialized()) {\n            var isLeafOrEmpty = eventSnap.getNode().isLeafNode() || eventSnap.getNode().isEmpty();\n            var oldCompleteSnap = oldViewCache.getCompleteEventSnap();\n            if (accumulator.length > 0 ||\n                !oldViewCache.getEventCache().isFullyInitialized() ||\n                (isLeafOrEmpty &&\n                    !eventSnap\n                        .getNode()\n                        .equals(/** @type {!Node} */ (oldCompleteSnap))) ||\n                !eventSnap\n                    .getNode()\n                    .getPriority()\n                    .equals(oldCompleteSnap.getPriority())) {\n                accumulator.push(Change_1.Change.valueChange(\n                /** @type {!Node} */ newViewCache.getCompleteEventSnap()));\n            }\n        }\n    };\n    /**\n     * @param {!ViewCache} viewCache\n     * @param {!Path} changePath\n     * @param {!WriteTreeRef} writesCache\n     * @param {!CompleteChildSource} source\n     * @param {!ChildChangeAccumulator} accumulator\n     * @return {!ViewCache}\n     * @private\n     */\n    ViewProcessor.prototype.generateEventCacheAfterServerEvent_ = function (viewCache, changePath, writesCache, source, accumulator) {\n        var oldEventSnap = viewCache.getEventCache();\n        if (writesCache.shadowingWrite(changePath) != null) {\n            // we have a shadowing write, ignore changes\n            return viewCache;\n        }\n        else {\n            var newEventCache = void 0, serverNode = void 0;\n            if (changePath.isEmpty()) {\n                // TODO: figure out how this plays with \"sliding ack windows\"\n                util_1.assert(viewCache.getServerCache().isFullyInitialized(), 'If change path is empty, we must have complete server data');\n                if (viewCache.getServerCache().isFiltered()) {\n                    // We need to special case this, because we need to only apply writes to complete children, or\n                    // we might end up raising events for incomplete children. If the server data is filtered deep\n                    // writes cannot be guaranteed to be complete\n                    var serverCache = viewCache.getCompleteServerSnap();\n                    var completeChildren = serverCache instanceof ChildrenNode_1.ChildrenNode\n                        ? serverCache\n                        : ChildrenNode_1.ChildrenNode.EMPTY_NODE;\n                    var completeEventChildren = writesCache.calcCompleteEventChildren(completeChildren);\n                    newEventCache = this.filter_.updateFullNode(viewCache.getEventCache().getNode(), completeEventChildren, accumulator);\n                }\n                else {\n                    var completeNode = writesCache.calcCompleteEventCache(viewCache.getCompleteServerSnap());\n                    newEventCache = this.filter_.updateFullNode(viewCache.getEventCache().getNode(), completeNode, accumulator);\n                }\n            }\n            else {\n                var childKey = changePath.getFront();\n                if (childKey == '.priority') {\n                    util_1.assert(changePath.getLength() == 1, \"Can't have a priority with additional path components\");\n                    var oldEventNode = oldEventSnap.getNode();\n                    serverNode = viewCache.getServerCache().getNode();\n                    // we might have overwrites for this priority\n                    var updatedPriority = writesCache.calcEventCacheAfterServerOverwrite(changePath, oldEventNode, serverNode);\n                    if (updatedPriority != null) {\n                        newEventCache = this.filter_.updatePriority(oldEventNode, updatedPriority);\n                    }\n                    else {\n                        // priority didn't change, keep old node\n                        newEventCache = oldEventSnap.getNode();\n                    }\n                }\n                else {\n                    var childChangePath = changePath.popFront();\n                    // update child\n                    var newEventChild = void 0;\n                    if (oldEventSnap.isCompleteForChild(childKey)) {\n                        serverNode = viewCache.getServerCache().getNode();\n                        var eventChildUpdate = writesCache.calcEventCacheAfterServerOverwrite(changePath, oldEventSnap.getNode(), serverNode);\n                        if (eventChildUpdate != null) {\n                            newEventChild = oldEventSnap\n                                .getNode()\n                                .getImmediateChild(childKey)\n                                .updateChild(childChangePath, eventChildUpdate);\n                        }\n                        else {\n                            // Nothing changed, just keep the old child\n                            newEventChild = oldEventSnap\n                                .getNode()\n                                .getImmediateChild(childKey);\n                        }\n                    }\n                    else {\n                        newEventChild = writesCache.calcCompleteChild(childKey, viewCache.getServerCache());\n                    }\n                    if (newEventChild != null) {\n                        newEventCache = this.filter_.updateChild(oldEventSnap.getNode(), childKey, newEventChild, childChangePath, source, accumulator);\n                    }\n                    else {\n                        // no complete child available or no change\n                        newEventCache = oldEventSnap.getNode();\n                    }\n                }\n            }\n            return viewCache.updateEventSnap(newEventCache, oldEventSnap.isFullyInitialized() || changePath.isEmpty(), this.filter_.filtersNodes());\n        }\n    };\n    /**\n     * @param {!ViewCache} oldViewCache\n     * @param {!Path} changePath\n     * @param {!Node} changedSnap\n     * @param {!WriteTreeRef} writesCache\n     * @param {?Node} completeCache\n     * @param {boolean} filterServerNode\n     * @param {!ChildChangeAccumulator} accumulator\n     * @return {!ViewCache}\n     * @private\n     */\n    ViewProcessor.prototype.applyServerOverwrite_ = function (oldViewCache, changePath, changedSnap, writesCache, completeCache, filterServerNode, accumulator) {\n        var oldServerSnap = oldViewCache.getServerCache();\n        var newServerCache;\n        var serverFilter = filterServerNode\n            ? this.filter_\n            : this.filter_.getIndexedFilter();\n        if (changePath.isEmpty()) {\n            newServerCache = serverFilter.updateFullNode(oldServerSnap.getNode(), changedSnap, null);\n        }\n        else if (serverFilter.filtersNodes() && !oldServerSnap.isFiltered()) {\n            // we want to filter the server node, but we didn't filter the server node yet, so simulate a full update\n            var newServerNode = oldServerSnap\n                .getNode()\n                .updateChild(changePath, changedSnap);\n            newServerCache = serverFilter.updateFullNode(oldServerSnap.getNode(), newServerNode, null);\n        }\n        else {\n            var childKey = changePath.getFront();\n            if (!oldServerSnap.isCompleteForPath(changePath) &&\n                changePath.getLength() > 1) {\n                // We don't update incomplete nodes with updates intended for other listeners\n                return oldViewCache;\n            }\n            var childChangePath = changePath.popFront();\n            var childNode = oldServerSnap.getNode().getImmediateChild(childKey);\n            var newChildNode = childNode.updateChild(childChangePath, changedSnap);\n            if (childKey == '.priority') {\n                newServerCache = serverFilter.updatePriority(oldServerSnap.getNode(), newChildNode);\n            }\n            else {\n                newServerCache = serverFilter.updateChild(oldServerSnap.getNode(), childKey, newChildNode, childChangePath, CompleteChildSource_1.NO_COMPLETE_CHILD_SOURCE, null);\n            }\n        }\n        var newViewCache = oldViewCache.updateServerSnap(newServerCache, oldServerSnap.isFullyInitialized() || changePath.isEmpty(), serverFilter.filtersNodes());\n        var source = new CompleteChildSource_1.WriteTreeCompleteChildSource(writesCache, newViewCache, completeCache);\n        return this.generateEventCacheAfterServerEvent_(newViewCache, changePath, writesCache, source, accumulator);\n    };\n    /**\n     * @param {!ViewCache} oldViewCache\n     * @param {!Path} changePath\n     * @param {!Node} changedSnap\n     * @param {!WriteTreeRef} writesCache\n     * @param {?Node} completeCache\n     * @param {!ChildChangeAccumulator} accumulator\n     * @return {!ViewCache}\n     * @private\n     */\n    ViewProcessor.prototype.applyUserOverwrite_ = function (oldViewCache, changePath, changedSnap, writesCache, completeCache, accumulator) {\n        var oldEventSnap = oldViewCache.getEventCache();\n        var newViewCache, newEventCache;\n        var source = new CompleteChildSource_1.WriteTreeCompleteChildSource(writesCache, oldViewCache, completeCache);\n        if (changePath.isEmpty()) {\n            newEventCache = this.filter_.updateFullNode(oldViewCache.getEventCache().getNode(), changedSnap, accumulator);\n            newViewCache = oldViewCache.updateEventSnap(newEventCache, true, this.filter_.filtersNodes());\n        }\n        else {\n            var childKey = changePath.getFront();\n            if (childKey === '.priority') {\n                newEventCache = this.filter_.updatePriority(oldViewCache.getEventCache().getNode(), changedSnap);\n                newViewCache = oldViewCache.updateEventSnap(newEventCache, oldEventSnap.isFullyInitialized(), oldEventSnap.isFiltered());\n            }\n            else {\n                var childChangePath = changePath.popFront();\n                var oldChild = oldEventSnap.getNode().getImmediateChild(childKey);\n                var newChild = void 0;\n                if (childChangePath.isEmpty()) {\n                    // Child overwrite, we can replace the child\n                    newChild = changedSnap;\n                }\n                else {\n                    var childNode = source.getCompleteChild(childKey);\n                    if (childNode != null) {\n                        if (childChangePath.getBack() === '.priority' &&\n                            childNode.getChild(childChangePath.parent()).isEmpty()) {\n                            // This is a priority update on an empty node. If this node exists on the server, the\n                            // server will send down the priority in the update, so ignore for now\n                            newChild = childNode;\n                        }\n                        else {\n                            newChild = childNode.updateChild(childChangePath, changedSnap);\n                        }\n                    }\n                    else {\n                        // There is no complete child node available\n                        newChild = ChildrenNode_1.ChildrenNode.EMPTY_NODE;\n                    }\n                }\n                if (!oldChild.equals(newChild)) {\n                    var newEventSnap = this.filter_.updateChild(oldEventSnap.getNode(), childKey, newChild, childChangePath, source, accumulator);\n                    newViewCache = oldViewCache.updateEventSnap(newEventSnap, oldEventSnap.isFullyInitialized(), this.filter_.filtersNodes());\n                }\n                else {\n                    newViewCache = oldViewCache;\n                }\n            }\n        }\n        return newViewCache;\n    };\n    /**\n     * @param {!ViewCache} viewCache\n     * @param {string} childKey\n     * @return {boolean}\n     * @private\n     */\n    ViewProcessor.cacheHasChild_ = function (viewCache, childKey) {\n        return viewCache.getEventCache().isCompleteForChild(childKey);\n    };\n    /**\n     * @param {!ViewCache} viewCache\n     * @param {!Path} path\n     * @param {ImmutableTree.<!Node>} changedChildren\n     * @param {!WriteTreeRef} writesCache\n     * @param {?Node} serverCache\n     * @param {!ChildChangeAccumulator} accumulator\n     * @return {!ViewCache}\n     * @private\n     */\n    ViewProcessor.prototype.applyUserMerge_ = function (viewCache, path, changedChildren, writesCache, serverCache, accumulator) {\n        var _this = this;\n        // HACK: In the case of a limit query, there may be some changes that bump things out of the\n        // window leaving room for new items.  It's important we process these changes first, so we\n        // iterate the changes twice, first processing any that affect items currently in view.\n        // TODO: I consider an item \"in view\" if cacheHasChild is true, which checks both the server\n        // and event snap.  I'm not sure if this will result in edge cases when a child is in one but\n        // not the other.\n        var curViewCache = viewCache;\n        changedChildren.foreach(function (relativePath, childNode) {\n            var writePath = path.child(relativePath);\n            if (ViewProcessor.cacheHasChild_(viewCache, writePath.getFront())) {\n                curViewCache = _this.applyUserOverwrite_(curViewCache, writePath, childNode, writesCache, serverCache, accumulator);\n            }\n        });\n        changedChildren.foreach(function (relativePath, childNode) {\n            var writePath = path.child(relativePath);\n            if (!ViewProcessor.cacheHasChild_(viewCache, writePath.getFront())) {\n                curViewCache = _this.applyUserOverwrite_(curViewCache, writePath, childNode, writesCache, serverCache, accumulator);\n            }\n        });\n        return curViewCache;\n    };\n    /**\n     * @param {!Node} node\n     * @param {ImmutableTree.<!Node>} merge\n     * @return {!Node}\n     * @private\n     */\n    ViewProcessor.prototype.applyMerge_ = function (node, merge) {\n        merge.foreach(function (relativePath, childNode) {\n            node = node.updateChild(relativePath, childNode);\n        });\n        return node;\n    };\n    /**\n     * @param {!ViewCache} viewCache\n     * @param {!Path} path\n     * @param {!ImmutableTree.<!Node>} changedChildren\n     * @param {!WriteTreeRef} writesCache\n     * @param {?Node} serverCache\n     * @param {boolean} filterServerNode\n     * @param {!ChildChangeAccumulator} accumulator\n     * @return {!ViewCache}\n     * @private\n     */\n    ViewProcessor.prototype.applyServerMerge_ = function (viewCache, path, changedChildren, writesCache, serverCache, filterServerNode, accumulator) {\n        var _this = this;\n        // If we don't have a cache yet, this merge was intended for a previously listen in the same location. Ignore it and\n        // wait for the complete data update coming soon.\n        if (viewCache\n            .getServerCache()\n            .getNode()\n            .isEmpty() &&\n            !viewCache.getServerCache().isFullyInitialized()) {\n            return viewCache;\n        }\n        // HACK: In the case of a limit query, there may be some changes that bump things out of the\n        // window leaving room for new items.  It's important we process these changes first, so we\n        // iterate the changes twice, first processing any that affect items currently in view.\n        // TODO: I consider an item \"in view\" if cacheHasChild is true, which checks both the server\n        // and event snap.  I'm not sure if this will result in edge cases when a child is in one but\n        // not the other.\n        var curViewCache = viewCache;\n        var viewMergeTree;\n        if (path.isEmpty()) {\n            viewMergeTree = changedChildren;\n        }\n        else {\n            viewMergeTree = ImmutableTree_1.ImmutableTree.Empty.setTree(path, changedChildren);\n        }\n        var serverNode = viewCache.getServerCache().getNode();\n        viewMergeTree.children.inorderTraversal(function (childKey, childTree) {\n            if (serverNode.hasChild(childKey)) {\n                var serverChild = viewCache\n                    .getServerCache()\n                    .getNode()\n                    .getImmediateChild(childKey);\n                var newChild = _this.applyMerge_(serverChild, childTree);\n                curViewCache = _this.applyServerOverwrite_(curViewCache, new Path_1.Path(childKey), newChild, writesCache, serverCache, filterServerNode, accumulator);\n            }\n        });\n        viewMergeTree.children.inorderTraversal(function (childKey, childMergeTree) {\n            var isUnknownDeepMerge = !viewCache.getServerCache().isCompleteForChild(childKey) &&\n                childMergeTree.value == null;\n            if (!serverNode.hasChild(childKey) && !isUnknownDeepMerge) {\n                var serverChild = viewCache\n                    .getServerCache()\n                    .getNode()\n                    .getImmediateChild(childKey);\n                var newChild = _this.applyMerge_(serverChild, childMergeTree);\n                curViewCache = _this.applyServerOverwrite_(curViewCache, new Path_1.Path(childKey), newChild, writesCache, serverCache, filterServerNode, accumulator);\n            }\n        });\n        return curViewCache;\n    };\n    /**\n     * @param {!ViewCache} viewCache\n     * @param {!Path} ackPath\n     * @param {!ImmutableTree<!boolean>} affectedTree\n     * @param {!WriteTreeRef} writesCache\n     * @param {?Node} completeCache\n     * @param {!ChildChangeAccumulator} accumulator\n     * @return {!ViewCache}\n     * @private\n     */\n    ViewProcessor.prototype.ackUserWrite_ = function (viewCache, ackPath, affectedTree, writesCache, completeCache, accumulator) {\n        if (writesCache.shadowingWrite(ackPath) != null) {\n            return viewCache;\n        }\n        // Only filter server node if it is currently filtered\n        var filterServerNode = viewCache.getServerCache().isFiltered();\n        // Essentially we'll just get our existing server cache for the affected paths and re-apply it as a server update\n        // now that it won't be shadowed.\n        var serverCache = viewCache.getServerCache();\n        if (affectedTree.value != null) {\n            // This is an overwrite.\n            if ((ackPath.isEmpty() && serverCache.isFullyInitialized()) ||\n                serverCache.isCompleteForPath(ackPath)) {\n                return this.applyServerOverwrite_(viewCache, ackPath, serverCache.getNode().getChild(ackPath), writesCache, completeCache, filterServerNode, accumulator);\n            }\n            else if (ackPath.isEmpty()) {\n                // This is a goofy edge case where we are acking data at this location but don't have full data.  We\n                // should just re-apply whatever we have in our cache as a merge.\n                var changedChildren_1 = ImmutableTree_1.ImmutableTree.Empty;\n                serverCache.getNode().forEachChild(KeyIndex_1.KEY_INDEX, function (name, node) {\n                    changedChildren_1 = changedChildren_1.set(new Path_1.Path(name), node);\n                });\n                return this.applyServerMerge_(viewCache, ackPath, changedChildren_1, writesCache, completeCache, filterServerNode, accumulator);\n            }\n            else {\n                return viewCache;\n            }\n        }\n        else {\n            // This is a merge.\n            var changedChildren_2 = ImmutableTree_1.ImmutableTree.Empty;\n            affectedTree.foreach(function (mergePath, value) {\n                var serverCachePath = ackPath.child(mergePath);\n                if (serverCache.isCompleteForPath(serverCachePath)) {\n                    changedChildren_2 = changedChildren_2.set(mergePath, serverCache.getNode().getChild(serverCachePath));\n                }\n            });\n            return this.applyServerMerge_(viewCache, ackPath, changedChildren_2, writesCache, completeCache, filterServerNode, accumulator);\n        }\n    };\n    /**\n     * @param {!ViewCache} viewCache\n     * @param {!Path} path\n     * @param {!WriteTreeRef} writesCache\n     * @param {!ChildChangeAccumulator} accumulator\n     * @return {!ViewCache}\n     * @private\n     */\n    ViewProcessor.prototype.listenComplete_ = function (viewCache, path, writesCache, accumulator) {\n        var oldServerNode = viewCache.getServerCache();\n        var newViewCache = viewCache.updateServerSnap(oldServerNode.getNode(), oldServerNode.isFullyInitialized() || path.isEmpty(), oldServerNode.isFiltered());\n        return this.generateEventCacheAfterServerEvent_(newViewCache, path, writesCache, CompleteChildSource_1.NO_COMPLETE_CHILD_SOURCE, accumulator);\n    };\n    /**\n     * @param {!ViewCache} viewCache\n     * @param {!Path} path\n     * @param {!WriteTreeRef} writesCache\n     * @param {?Node} completeServerCache\n     * @param {!ChildChangeAccumulator} accumulator\n     * @return {!ViewCache}\n     * @private\n     */\n    ViewProcessor.prototype.revertUserWrite_ = function (viewCache, path, writesCache, completeServerCache, accumulator) {\n        var complete;\n        if (writesCache.shadowingWrite(path) != null) {\n            return viewCache;\n        }\n        else {\n            var source = new CompleteChildSource_1.WriteTreeCompleteChildSource(writesCache, viewCache, completeServerCache);\n            var oldEventCache = viewCache.getEventCache().getNode();\n            var newEventCache = void 0;\n            if (path.isEmpty() || path.getFront() === '.priority') {\n                var newNode = void 0;\n                if (viewCache.getServerCache().isFullyInitialized()) {\n                    newNode = writesCache.calcCompleteEventCache(viewCache.getCompleteServerSnap());\n                }\n                else {\n                    var serverChildren = viewCache.getServerCache().getNode();\n                    util_1.assert(serverChildren instanceof ChildrenNode_1.ChildrenNode, 'serverChildren would be complete if leaf node');\n                    newNode = writesCache.calcCompleteEventChildren(serverChildren);\n                }\n                newNode = newNode;\n                newEventCache = this.filter_.updateFullNode(oldEventCache, newNode, accumulator);\n            }\n            else {\n                var childKey = path.getFront();\n                var newChild = writesCache.calcCompleteChild(childKey, viewCache.getServerCache());\n                if (newChild == null &&\n                    viewCache.getServerCache().isCompleteForChild(childKey)) {\n                    newChild = oldEventCache.getImmediateChild(childKey);\n                }\n                if (newChild != null) {\n                    newEventCache = this.filter_.updateChild(oldEventCache, childKey, newChild, path.popFront(), source, accumulator);\n                }\n                else if (viewCache\n                    .getEventCache()\n                    .getNode()\n                    .hasChild(childKey)) {\n                    // No complete child available, delete the existing one, if any\n                    newEventCache = this.filter_.updateChild(oldEventCache, childKey, ChildrenNode_1.ChildrenNode.EMPTY_NODE, path.popFront(), source, accumulator);\n                }\n                else {\n                    newEventCache = oldEventCache;\n                }\n                if (newEventCache.isEmpty() &&\n                    viewCache.getServerCache().isFullyInitialized()) {\n                    // We might have reverted all child writes. Maybe the old event was a leaf node\n                    complete = writesCache.calcCompleteEventCache(viewCache.getCompleteServerSnap());\n                    if (complete.isLeafNode()) {\n                        newEventCache = this.filter_.updateFullNode(newEventCache, complete, accumulator);\n                    }\n                }\n            }\n            complete =\n                viewCache.getServerCache().isFullyInitialized() ||\n                    writesCache.shadowingWrite(Path_1.Path.Empty) != null;\n            return viewCache.updateEventSnap(newEventCache, complete, this.filter_.filtersNodes());\n        }\n    };\n    return ViewProcessor;\n}());\nexports.ViewProcessor = ViewProcessor;\n\n//# sourceMappingURL=ViewProcessor.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/view/ViewProcessor.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = require(\"@firebase/util\");\nvar Change_1 = require(\"./Change\");\nvar util_2 = require(\"@firebase/util\");\n/**\n * @constructor\n */\nvar ChildChangeAccumulator = /** @class */ (function () {\n    function ChildChangeAccumulator() {\n        this.changeMap_ = {};\n    }\n    /**\n     * @param {!Change} change\n     */\n    ChildChangeAccumulator.prototype.trackChildChange = function (change) {\n        var type = change.type;\n        var childKey /** @type {!string} */ = change.childName;\n        util_2.assert(type == Change_1.Change.CHILD_ADDED ||\n            type == Change_1.Change.CHILD_CHANGED ||\n            type == Change_1.Change.CHILD_REMOVED, 'Only child changes supported for tracking');\n        util_2.assert(childKey !== '.priority', 'Only non-priority child changes can be tracked.');\n        var oldChange = util_1.safeGet(this.changeMap_, childKey);\n        if (oldChange) {\n            var oldType = oldChange.type;\n            if (type == Change_1.Change.CHILD_ADDED && oldType == Change_1.Change.CHILD_REMOVED) {\n                this.changeMap_[childKey] = Change_1.Change.childChangedChange(childKey, change.snapshotNode, oldChange.snapshotNode);\n            }\n            else if (type == Change_1.Change.CHILD_REMOVED &&\n                oldType == Change_1.Change.CHILD_ADDED) {\n                delete this.changeMap_[childKey];\n            }\n            else if (type == Change_1.Change.CHILD_REMOVED &&\n                oldType == Change_1.Change.CHILD_CHANGED) {\n                this.changeMap_[childKey] = Change_1.Change.childRemovedChange(childKey, oldChange.oldSnap);\n            }\n            else if (type == Change_1.Change.CHILD_CHANGED &&\n                oldType == Change_1.Change.CHILD_ADDED) {\n                this.changeMap_[childKey] = Change_1.Change.childAddedChange(childKey, change.snapshotNode);\n            }\n            else if (type == Change_1.Change.CHILD_CHANGED &&\n                oldType == Change_1.Change.CHILD_CHANGED) {\n                this.changeMap_[childKey] = Change_1.Change.childChangedChange(childKey, change.snapshotNode, oldChange.oldSnap);\n            }\n            else {\n                throw util_2.assertionError('Illegal combination of changes: ' +\n                    change +\n                    ' occurred after ' +\n                    oldChange);\n            }\n        }\n        else {\n            this.changeMap_[childKey] = change;\n        }\n    };\n    /**\n     * @return {!Array.<!Change>}\n     */\n    ChildChangeAccumulator.prototype.getChanges = function () {\n        return util_1.getValues(this.changeMap_);\n    };\n    return ChildChangeAccumulator;\n}());\nexports.ChildChangeAccumulator = ChildChangeAccumulator;\n\n//# sourceMappingURL=ChildChangeAccumulator.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/view/ChildChangeAccumulator.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar CacheNode_1 = require(\"./CacheNode\");\n/**\n * An implementation of CompleteChildSource that never returns any additional children\n *\n * @private\n * @constructor\n * @implements CompleteChildSource\n */\nvar NoCompleteChildSource_ = /** @class */ (function () {\n    function NoCompleteChildSource_() {\n    }\n    /**\n     * @inheritDoc\n     */\n    NoCompleteChildSource_.prototype.getCompleteChild = function (childKey) {\n        return null;\n    };\n    /**\n     * @inheritDoc\n     */\n    NoCompleteChildSource_.prototype.getChildAfterChild = function (index, child, reverse) {\n        return null;\n    };\n    return NoCompleteChildSource_;\n}());\nexports.NoCompleteChildSource_ = NoCompleteChildSource_;\n/**\n * Singleton instance.\n * @const\n * @type {!CompleteChildSource}\n */\nexports.NO_COMPLETE_CHILD_SOURCE = new NoCompleteChildSource_();\n/**\n * An implementation of CompleteChildSource that uses a WriteTree in addition to any other server data or\n * old event caches available to calculate complete children.\n *\n *\n * @implements CompleteChildSource\n */\nvar WriteTreeCompleteChildSource = /** @class */ (function () {\n    /**\n     * @param {!WriteTreeRef} writes_\n     * @param {!ViewCache} viewCache_\n     * @param {?Node} optCompleteServerCache_\n     */\n    function WriteTreeCompleteChildSource(writes_, viewCache_, optCompleteServerCache_) {\n        if (optCompleteServerCache_ === void 0) { optCompleteServerCache_ = null; }\n        this.writes_ = writes_;\n        this.viewCache_ = viewCache_;\n        this.optCompleteServerCache_ = optCompleteServerCache_;\n    }\n    /**\n     * @inheritDoc\n     */\n    WriteTreeCompleteChildSource.prototype.getCompleteChild = function (childKey) {\n        var node = this.viewCache_.getEventCache();\n        if (node.isCompleteForChild(childKey)) {\n            return node.getNode().getImmediateChild(childKey);\n        }\n        else {\n            var serverNode = this.optCompleteServerCache_ != null\n                ? new CacheNode_1.CacheNode(this.optCompleteServerCache_, true, false)\n                : this.viewCache_.getServerCache();\n            return this.writes_.calcCompleteChild(childKey, serverNode);\n        }\n    };\n    /**\n     * @inheritDoc\n     */\n    WriteTreeCompleteChildSource.prototype.getChildAfterChild = function (index, child, reverse) {\n        var completeServerData = this.optCompleteServerCache_ != null\n            ? this.optCompleteServerCache_\n            : this.viewCache_.getCompleteServerSnap();\n        var nodes = this.writes_.calcIndexedSlice(completeServerData, child, 1, reverse, index);\n        if (nodes.length === 0) {\n            return null;\n        }\n        else {\n            return nodes[0];\n        }\n    };\n    return WriteTreeCompleteChildSource;\n}());\nexports.WriteTreeCompleteChildSource = WriteTreeCompleteChildSource;\n\n//# sourceMappingURL=CompleteChildSource.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/view/CompleteChildSource.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar Node_1 = require(\"../snap/Node\");\nvar Change_1 = require(\"./Change\");\nvar util_1 = require(\"@firebase/util\");\n/**\n * An EventGenerator is used to convert \"raw\" changes (Change) as computed by the\n * CacheDiffer into actual events (Event) that can be raised.  See generateEventsForChanges()\n * for details.\n *\n * @constructor\n */\nvar EventGenerator = /** @class */ (function () {\n    /**\n     *\n     * @param {!Query} query_\n     */\n    function EventGenerator(query_) {\n        this.query_ = query_;\n        /**\n         * @private\n         * @type {!Index}\n         */\n        this.index_ = this.query_.getQueryParams().getIndex();\n    }\n    /**\n     * Given a set of raw changes (no moved events and prevName not specified yet), and a set of\n     * EventRegistrations that should be notified of these changes, generate the actual events to be raised.\n     *\n     * Notes:\n     *  - child_moved events will be synthesized at this time for any child_changed events that affect\n     *    our index.\n     *  - prevName will be calculated based on the index ordering.\n     *\n     * @param {!Array.<!Change>} changes\n     * @param {!Node} eventCache\n     * @param {!Array.<!EventRegistration>} eventRegistrations\n     * @return {!Array.<!Event>}\n     */\n    EventGenerator.prototype.generateEventsForChanges = function (changes, eventCache, eventRegistrations) {\n        var _this = this;\n        var events = [];\n        var moves = [];\n        changes.forEach(function (change) {\n            if (change.type === Change_1.Change.CHILD_CHANGED &&\n                _this.index_.indexedValueChanged(change.oldSnap, change.snapshotNode)) {\n                moves.push(Change_1.Change.childMovedChange(change.childName, change.snapshotNode));\n            }\n        });\n        this.generateEventsForType_(events, Change_1.Change.CHILD_REMOVED, changes, eventRegistrations, eventCache);\n        this.generateEventsForType_(events, Change_1.Change.CHILD_ADDED, changes, eventRegistrations, eventCache);\n        this.generateEventsForType_(events, Change_1.Change.CHILD_MOVED, moves, eventRegistrations, eventCache);\n        this.generateEventsForType_(events, Change_1.Change.CHILD_CHANGED, changes, eventRegistrations, eventCache);\n        this.generateEventsForType_(events, Change_1.Change.VALUE, changes, eventRegistrations, eventCache);\n        return events;\n    };\n    /**\n     * Given changes of a single change type, generate the corresponding events.\n     *\n     * @param {!Array.<!Event>} events\n     * @param {!string} eventType\n     * @param {!Array.<!Change>} changes\n     * @param {!Array.<!EventRegistration>} registrations\n     * @param {!Node} eventCache\n     * @private\n     */\n    EventGenerator.prototype.generateEventsForType_ = function (events, eventType, changes, registrations, eventCache) {\n        var _this = this;\n        var filteredChanges = changes.filter(function (change) { return change.type === eventType; });\n        filteredChanges.sort(this.compareChanges_.bind(this));\n        filteredChanges.forEach(function (change) {\n            var materializedChange = _this.materializeSingleChange_(change, eventCache);\n            registrations.forEach(function (registration) {\n                if (registration.respondsTo(change.type)) {\n                    events.push(registration.createEvent(materializedChange, _this.query_));\n                }\n            });\n        });\n    };\n    /**\n     * @param {!Change} change\n     * @param {!Node} eventCache\n     * @return {!Change}\n     * @private\n     */\n    EventGenerator.prototype.materializeSingleChange_ = function (change, eventCache) {\n        if (change.type === 'value' || change.type === 'child_removed') {\n            return change;\n        }\n        else {\n            change.prevName = eventCache.getPredecessorChildName(\n            /** @type {!string} */\n            change.childName, change.snapshotNode, this.index_);\n            return change;\n        }\n    };\n    /**\n     * @param {!Change} a\n     * @param {!Change} b\n     * @return {number}\n     * @private\n     */\n    EventGenerator.prototype.compareChanges_ = function (a, b) {\n        if (a.childName == null || b.childName == null) {\n            throw util_1.assertionError('Should only compare child_ events.');\n        }\n        var aWrapped = new Node_1.NamedNode(a.childName, a.snapshotNode);\n        var bWrapped = new Node_1.NamedNode(b.childName, b.snapshotNode);\n        return this.index_.compare(aWrapped, bWrapped);\n    };\n    return EventGenerator;\n}());\nexports.EventGenerator = EventGenerator;\n\n//# sourceMappingURL=EventGenerator.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/view/EventGenerator.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = require(\"@firebase/util\");\nvar util_2 = require(\"@firebase/util\");\nvar Path_1 = require(\"./util/Path\");\nvar CompoundWrite_1 = require(\"./CompoundWrite\");\nvar PriorityIndex_1 = require(\"./snap/indexes/PriorityIndex\");\nvar ChildrenNode_1 = require(\"./snap/ChildrenNode\");\n/**\n * WriteTree tracks all pending user-initiated writes and has methods to calculate the result of merging them\n * with underlying server data (to create \"event cache\" data).  Pending writes are added with addOverwrite()\n * and addMerge(), and removed with removeWrite().\n *\n * @constructor\n */\nvar WriteTree = /** @class */ (function () {\n    function WriteTree() {\n        /**\n         * A tree tracking the result of applying all visible writes.  This does not include transactions with\n         * applyLocally=false or writes that are completely shadowed by other writes.\n         *\n         * @type {!CompoundWrite}\n         * @private\n         */\n        this.visibleWrites_ = CompoundWrite_1.CompoundWrite.Empty;\n        /**\n         * A list of all pending writes, regardless of visibility and shadowed-ness.  Used to calculate arbitrary\n         * sets of the changed data, such as hidden writes (from transactions) or changes with certain writes excluded (also\n         * used by transactions).\n         *\n         * @type {!Array.<!WriteRecord>}\n         * @private\n         */\n        this.allWrites_ = [];\n        this.lastWriteId_ = -1;\n    }\n    /**\n     * Create a new WriteTreeRef for the given path. For use with a new sync point at the given path.\n     *\n     * @param {!Path} path\n     * @return {!WriteTreeRef}\n     */\n    WriteTree.prototype.childWrites = function (path) {\n        return new WriteTreeRef(path, this);\n    };\n    /**\n     * Record a new overwrite from user code.\n     *\n     * @param {!Path} path\n     * @param {!Node} snap\n     * @param {!number} writeId\n     * @param {boolean=} visible This is set to false by some transactions. It should be excluded from event caches\n     */\n    WriteTree.prototype.addOverwrite = function (path, snap, writeId, visible) {\n        util_2.assert(writeId > this.lastWriteId_, 'Stacking an older write on top of newer ones');\n        if (visible === undefined) {\n            visible = true;\n        }\n        this.allWrites_.push({\n            path: path,\n            snap: snap,\n            writeId: writeId,\n            visible: visible\n        });\n        if (visible) {\n            this.visibleWrites_ = this.visibleWrites_.addWrite(path, snap);\n        }\n        this.lastWriteId_ = writeId;\n    };\n    /**\n     * Record a new merge from user code.\n     *\n     * @param {!Path} path\n     * @param {!Object.<string, !Node>} changedChildren\n     * @param {!number} writeId\n     */\n    WriteTree.prototype.addMerge = function (path, changedChildren, writeId) {\n        util_2.assert(writeId > this.lastWriteId_, 'Stacking an older merge on top of newer ones');\n        this.allWrites_.push({\n            path: path,\n            children: changedChildren,\n            writeId: writeId,\n            visible: true\n        });\n        this.visibleWrites_ = this.visibleWrites_.addWrites(path, changedChildren);\n        this.lastWriteId_ = writeId;\n    };\n    /**\n     * @param {!number} writeId\n     * @return {?WriteRecord}\n     */\n    WriteTree.prototype.getWrite = function (writeId) {\n        for (var i = 0; i < this.allWrites_.length; i++) {\n            var record = this.allWrites_[i];\n            if (record.writeId === writeId) {\n                return record;\n            }\n        }\n        return null;\n    };\n    /**\n     * Remove a write (either an overwrite or merge) that has been successfully acknowledge by the server. Recalculates\n     * the tree if necessary.  We return true if it may have been visible, meaning views need to reevaluate.\n     *\n     * @param {!number} writeId\n     * @return {boolean} true if the write may have been visible (meaning we'll need to reevaluate / raise\n     * events as a result).\n     */\n    WriteTree.prototype.removeWrite = function (writeId) {\n        // Note: disabling this check. It could be a transaction that preempted another transaction, and thus was applied\n        // out of order.\n        //const validClear = revert || this.allWrites_.length === 0 || writeId <= this.allWrites_[0].writeId;\n        //assert(validClear, \"Either we don't have this write, or it's the first one in the queue\");\n        var _this = this;\n        var idx = this.allWrites_.findIndex(function (s) {\n            return s.writeId === writeId;\n        });\n        util_2.assert(idx >= 0, 'removeWrite called with nonexistent writeId.');\n        var writeToRemove = this.allWrites_[idx];\n        this.allWrites_.splice(idx, 1);\n        var removedWriteWasVisible = writeToRemove.visible;\n        var removedWriteOverlapsWithOtherWrites = false;\n        var i = this.allWrites_.length - 1;\n        while (removedWriteWasVisible && i >= 0) {\n            var currentWrite = this.allWrites_[i];\n            if (currentWrite.visible) {\n                if (i >= idx &&\n                    this.recordContainsPath_(currentWrite, writeToRemove.path)) {\n                    // The removed write was completely shadowed by a subsequent write.\n                    removedWriteWasVisible = false;\n                }\n                else if (writeToRemove.path.contains(currentWrite.path)) {\n                    // Either we're covering some writes or they're covering part of us (depending on which came first).\n                    removedWriteOverlapsWithOtherWrites = true;\n                }\n            }\n            i--;\n        }\n        if (!removedWriteWasVisible) {\n            return false;\n        }\n        else if (removedWriteOverlapsWithOtherWrites) {\n            // There's some shadowing going on. Just rebuild the visible writes from scratch.\n            this.resetTree_();\n            return true;\n        }\n        else {\n            // There's no shadowing.  We can safely just remove the write(s) from visibleWrites.\n            if (writeToRemove.snap) {\n                this.visibleWrites_ = this.visibleWrites_.removeWrite(writeToRemove.path);\n            }\n            else {\n                var children = writeToRemove.children;\n                util_1.forEach(children, function (childName) {\n                    _this.visibleWrites_ = _this.visibleWrites_.removeWrite(writeToRemove.path.child(childName));\n                });\n            }\n            return true;\n        }\n    };\n    /**\n     * Return a complete snapshot for the given path if there's visible write data at that path, else null.\n     * No server data is considered.\n     *\n     * @param {!Path} path\n     * @return {?Node}\n     */\n    WriteTree.prototype.getCompleteWriteData = function (path) {\n        return this.visibleWrites_.getCompleteNode(path);\n    };\n    /**\n     * Given optional, underlying server data, and an optional set of constraints (exclude some sets, include hidden\n     * writes), attempt to calculate a complete snapshot for the given path\n     *\n     * @param {!Path} treePath\n     * @param {?Node} completeServerCache\n     * @param {Array.<number>=} writeIdsToExclude An optional set to be excluded\n     * @param {boolean=} includeHiddenWrites Defaults to false, whether or not to layer on writes with visible set to false\n     * @return {?Node}\n     */\n    WriteTree.prototype.calcCompleteEventCache = function (treePath, completeServerCache, writeIdsToExclude, includeHiddenWrites) {\n        if (!writeIdsToExclude && !includeHiddenWrites) {\n            var shadowingNode = this.visibleWrites_.getCompleteNode(treePath);\n            if (shadowingNode != null) {\n                return shadowingNode;\n            }\n            else {\n                var subMerge = this.visibleWrites_.childCompoundWrite(treePath);\n                if (subMerge.isEmpty()) {\n                    return completeServerCache;\n                }\n                else if (completeServerCache == null &&\n                    !subMerge.hasCompleteWrite(Path_1.Path.Empty)) {\n                    // We wouldn't have a complete snapshot, since there's no underlying data and no complete shadow\n                    return null;\n                }\n                else {\n                    var layeredCache = completeServerCache || ChildrenNode_1.ChildrenNode.EMPTY_NODE;\n                    return subMerge.apply(layeredCache);\n                }\n            }\n        }\n        else {\n            var merge = this.visibleWrites_.childCompoundWrite(treePath);\n            if (!includeHiddenWrites && merge.isEmpty()) {\n                return completeServerCache;\n            }\n            else {\n                // If the server cache is null, and we don't have a complete cache, we need to return null\n                if (!includeHiddenWrites &&\n                    completeServerCache == null &&\n                    !merge.hasCompleteWrite(Path_1.Path.Empty)) {\n                    return null;\n                }\n                else {\n                    var filter = function (write) {\n                        return ((write.visible || includeHiddenWrites) &&\n                            (!writeIdsToExclude ||\n                                !~writeIdsToExclude.indexOf(write.writeId)) &&\n                            (write.path.contains(treePath) || treePath.contains(write.path)));\n                    };\n                    var mergeAtPath = WriteTree.layerTree_(this.allWrites_, filter, treePath);\n                    var layeredCache = completeServerCache || ChildrenNode_1.ChildrenNode.EMPTY_NODE;\n                    return mergeAtPath.apply(layeredCache);\n                }\n            }\n        }\n    };\n    /**\n     * With optional, underlying server data, attempt to return a children node of children that we have complete data for.\n     * Used when creating new views, to pre-fill their complete event children snapshot.\n     *\n     * @param {!Path} treePath\n     * @param {?ChildrenNode} completeServerChildren\n     * @return {!ChildrenNode}\n     */\n    WriteTree.prototype.calcCompleteEventChildren = function (treePath, completeServerChildren) {\n        var completeChildren = ChildrenNode_1.ChildrenNode.EMPTY_NODE;\n        var topLevelSet = this.visibleWrites_.getCompleteNode(treePath);\n        if (topLevelSet) {\n            if (!topLevelSet.isLeafNode()) {\n                // we're shadowing everything. Return the children.\n                topLevelSet.forEachChild(PriorityIndex_1.PRIORITY_INDEX, function (childName, childSnap) {\n                    completeChildren = completeChildren.updateImmediateChild(childName, childSnap);\n                });\n            }\n            return completeChildren;\n        }\n        else if (completeServerChildren) {\n            // Layer any children we have on top of this\n            // We know we don't have a top-level set, so just enumerate existing children\n            var merge_1 = this.visibleWrites_.childCompoundWrite(treePath);\n            completeServerChildren.forEachChild(PriorityIndex_1.PRIORITY_INDEX, function (childName, childNode) {\n                var node = merge_1\n                    .childCompoundWrite(new Path_1.Path(childName))\n                    .apply(childNode);\n                completeChildren = completeChildren.updateImmediateChild(childName, node);\n            });\n            // Add any complete children we have from the set\n            merge_1.getCompleteChildren().forEach(function (namedNode) {\n                completeChildren = completeChildren.updateImmediateChild(namedNode.name, namedNode.node);\n            });\n            return completeChildren;\n        }\n        else {\n            // We don't have anything to layer on top of. Layer on any children we have\n            // Note that we can return an empty snap if we have a defined delete\n            var merge = this.visibleWrites_.childCompoundWrite(treePath);\n            merge.getCompleteChildren().forEach(function (namedNode) {\n                completeChildren = completeChildren.updateImmediateChild(namedNode.name, namedNode.node);\n            });\n            return completeChildren;\n        }\n    };\n    /**\n     * Given that the underlying server data has updated, determine what, if anything, needs to be\n     * applied to the event cache.\n     *\n     * Possibilities:\n     *\n     * 1. No writes are shadowing. Events should be raised, the snap to be applied comes from the server data\n     *\n     * 2. Some write is completely shadowing. No events to be raised\n     *\n     * 3. Is partially shadowed. Events\n     *\n     * Either existingEventSnap or existingServerSnap must exist\n     *\n     * @param {!Path} treePath\n     * @param {!Path} childPath\n     * @param {?Node} existingEventSnap\n     * @param {?Node} existingServerSnap\n     * @return {?Node}\n     */\n    WriteTree.prototype.calcEventCacheAfterServerOverwrite = function (treePath, childPath, existingEventSnap, existingServerSnap) {\n        util_2.assert(existingEventSnap || existingServerSnap, 'Either existingEventSnap or existingServerSnap must exist');\n        var path = treePath.child(childPath);\n        if (this.visibleWrites_.hasCompleteWrite(path)) {\n            // At this point we can probably guarantee that we're in case 2, meaning no events\n            // May need to check visibility while doing the findRootMostValueAndPath call\n            return null;\n        }\n        else {\n            // No complete shadowing. We're either partially shadowing or not shadowing at all.\n            var childMerge = this.visibleWrites_.childCompoundWrite(path);\n            if (childMerge.isEmpty()) {\n                // We're not shadowing at all. Case 1\n                return existingServerSnap.getChild(childPath);\n            }\n            else {\n                // This could be more efficient if the serverNode + updates doesn't change the eventSnap\n                // However this is tricky to find out, since user updates don't necessary change the server\n                // snap, e.g. priority updates on empty nodes, or deep deletes. Another special case is if the server\n                // adds nodes, but doesn't change any existing writes. It is therefore not enough to\n                // only check if the updates change the serverNode.\n                // Maybe check if the merge tree contains these special cases and only do a full overwrite in that case?\n                return childMerge.apply(existingServerSnap.getChild(childPath));\n            }\n        }\n    };\n    /**\n     * Returns a complete child for a given server snap after applying all user writes or null if there is no\n     * complete child for this ChildKey.\n     *\n     * @param {!Path} treePath\n     * @param {!string} childKey\n     * @param {!CacheNode} existingServerSnap\n     * @return {?Node}\n     */\n    WriteTree.prototype.calcCompleteChild = function (treePath, childKey, existingServerSnap) {\n        var path = treePath.child(childKey);\n        var shadowingNode = this.visibleWrites_.getCompleteNode(path);\n        if (shadowingNode != null) {\n            return shadowingNode;\n        }\n        else {\n            if (existingServerSnap.isCompleteForChild(childKey)) {\n                var childMerge = this.visibleWrites_.childCompoundWrite(path);\n                return childMerge.apply(existingServerSnap.getNode().getImmediateChild(childKey));\n            }\n            else {\n                return null;\n            }\n        }\n    };\n    /**\n     * Returns a node if there is a complete overwrite for this path. More specifically, if there is a write at\n     * a higher path, this will return the child of that write relative to the write and this path.\n     * Returns null if there is no write at this path.\n     *\n     * @param {!Path} path\n     * @return {?Node}\n     */\n    WriteTree.prototype.shadowingWrite = function (path) {\n        return this.visibleWrites_.getCompleteNode(path);\n    };\n    /**\n     * This method is used when processing child remove events on a query. If we can, we pull in children that were outside\n     * the window, but may now be in the window.\n     *\n     * @param {!Path} treePath\n     * @param {?Node} completeServerData\n     * @param {!NamedNode} startPost\n     * @param {!number} count\n     * @param {boolean} reverse\n     * @param {!Index} index\n     * @return {!Array.<!NamedNode>}\n     */\n    WriteTree.prototype.calcIndexedSlice = function (treePath, completeServerData, startPost, count, reverse, index) {\n        var toIterate;\n        var merge = this.visibleWrites_.childCompoundWrite(treePath);\n        var shadowingNode = merge.getCompleteNode(Path_1.Path.Empty);\n        if (shadowingNode != null) {\n            toIterate = shadowingNode;\n        }\n        else if (completeServerData != null) {\n            toIterate = merge.apply(completeServerData);\n        }\n        else {\n            // no children to iterate on\n            return [];\n        }\n        toIterate = toIterate.withIndex(index);\n        if (!toIterate.isEmpty() && !toIterate.isLeafNode()) {\n            var nodes = [];\n            var cmp = index.getCompare();\n            var iter = reverse\n                ? toIterate.getReverseIteratorFrom(startPost, index)\n                : toIterate.getIteratorFrom(startPost, index);\n            var next = iter.getNext();\n            while (next && nodes.length < count) {\n                if (cmp(next, startPost) !== 0) {\n                    nodes.push(next);\n                }\n                next = iter.getNext();\n            }\n            return nodes;\n        }\n        else {\n            return [];\n        }\n    };\n    /**\n     * @param {!WriteRecord} writeRecord\n     * @param {!Path} path\n     * @return {boolean}\n     * @private\n     */\n    WriteTree.prototype.recordContainsPath_ = function (writeRecord, path) {\n        if (writeRecord.snap) {\n            return writeRecord.path.contains(path);\n        }\n        else {\n            // findKey can return undefined, so use !! to coerce to boolean\n            return !!util_1.findKey(writeRecord.children, function (childSnap, childName) {\n                return writeRecord.path.child(childName).contains(path);\n            });\n        }\n    };\n    /**\n     * Re-layer the writes and merges into a tree so we can efficiently calculate event snapshots\n     * @private\n     */\n    WriteTree.prototype.resetTree_ = function () {\n        this.visibleWrites_ = WriteTree.layerTree_(this.allWrites_, WriteTree.DefaultFilter_, Path_1.Path.Empty);\n        if (this.allWrites_.length > 0) {\n            this.lastWriteId_ = this.allWrites_[this.allWrites_.length - 1].writeId;\n        }\n        else {\n            this.lastWriteId_ = -1;\n        }\n    };\n    /**\n     * The default filter used when constructing the tree. Keep everything that's visible.\n     *\n     * @param {!WriteRecord} write\n     * @return {boolean}\n     * @private\n     */\n    WriteTree.DefaultFilter_ = function (write) {\n        return write.visible;\n    };\n    /**\n     * Static method. Given an array of WriteRecords, a filter for which ones to include, and a path, construct the tree of\n     * event data at that path.\n     *\n     * @param {!Array.<!WriteRecord>} writes\n     * @param {!function(!WriteRecord):boolean} filter\n     * @param {!Path} treeRoot\n     * @return {!CompoundWrite}\n     * @private\n     */\n    WriteTree.layerTree_ = function (writes, filter, treeRoot) {\n        var compoundWrite = CompoundWrite_1.CompoundWrite.Empty;\n        for (var i = 0; i < writes.length; ++i) {\n            var write = writes[i];\n            // Theory, a later set will either:\n            // a) abort a relevant transaction, so no need to worry about excluding it from calculating that transaction\n            // b) not be relevant to a transaction (separate branch), so again will not affect the data for that transaction\n            if (filter(write)) {\n                var writePath = write.path;\n                var relativePath = void 0;\n                if (write.snap) {\n                    if (treeRoot.contains(writePath)) {\n                        relativePath = Path_1.Path.relativePath(treeRoot, writePath);\n                        compoundWrite = compoundWrite.addWrite(relativePath, write.snap);\n                    }\n                    else if (writePath.contains(treeRoot)) {\n                        relativePath = Path_1.Path.relativePath(writePath, treeRoot);\n                        compoundWrite = compoundWrite.addWrite(Path_1.Path.Empty, write.snap.getChild(relativePath));\n                    }\n                    else {\n                        // There is no overlap between root path and write path, ignore write\n                    }\n                }\n                else if (write.children) {\n                    if (treeRoot.contains(writePath)) {\n                        relativePath = Path_1.Path.relativePath(treeRoot, writePath);\n                        compoundWrite = compoundWrite.addWrites(relativePath, write.children);\n                    }\n                    else if (writePath.contains(treeRoot)) {\n                        relativePath = Path_1.Path.relativePath(writePath, treeRoot);\n                        if (relativePath.isEmpty()) {\n                            compoundWrite = compoundWrite.addWrites(Path_1.Path.Empty, write.children);\n                        }\n                        else {\n                            var child = util_1.safeGet(write.children, relativePath.getFront());\n                            if (child) {\n                                // There exists a child in this node that matches the root path\n                                var deepNode = child.getChild(relativePath.popFront());\n                                compoundWrite = compoundWrite.addWrite(Path_1.Path.Empty, deepNode);\n                            }\n                        }\n                    }\n                    else {\n                        // There is no overlap between root path and write path, ignore write\n                    }\n                }\n                else {\n                    throw util_2.assertionError('WriteRecord should have .snap or .children');\n                }\n            }\n        }\n        return compoundWrite;\n    };\n    return WriteTree;\n}());\nexports.WriteTree = WriteTree;\n/**\n * A WriteTreeRef wraps a WriteTree and a path, for convenient access to a particular subtree.  All of the methods\n * just proxy to the underlying WriteTree.\n *\n * @constructor\n */\nvar WriteTreeRef = /** @class */ (function () {\n    /**\n     * @param {!Path} path\n     * @param {!WriteTree} writeTree\n     */\n    function WriteTreeRef(path, writeTree) {\n        this.treePath_ = path;\n        this.writeTree_ = writeTree;\n    }\n    /**\n     * If possible, returns a complete event cache, using the underlying server data if possible. In addition, can be used\n     * to get a cache that includes hidden writes, and excludes arbitrary writes. Note that customizing the returned node\n     * can lead to a more expensive calculation.\n     *\n     * @param {?Node} completeServerCache\n     * @param {Array.<number>=} writeIdsToExclude Optional writes to exclude.\n     * @param {boolean=} includeHiddenWrites Defaults to false, whether or not to layer on writes with visible set to false\n     * @return {?Node}\n     */\n    WriteTreeRef.prototype.calcCompleteEventCache = function (completeServerCache, writeIdsToExclude, includeHiddenWrites) {\n        return this.writeTree_.calcCompleteEventCache(this.treePath_, completeServerCache, writeIdsToExclude, includeHiddenWrites);\n    };\n    /**\n     * If possible, returns a children node containing all of the complete children we have data for. The returned data is a\n     * mix of the given server data and write data.\n     *\n     * @param {?ChildrenNode} completeServerChildren\n     * @return {!ChildrenNode}\n     */\n    WriteTreeRef.prototype.calcCompleteEventChildren = function (completeServerChildren) {\n        return this.writeTree_.calcCompleteEventChildren(this.treePath_, completeServerChildren);\n    };\n    /**\n     * Given that either the underlying server data has updated or the outstanding writes have updated, determine what,\n     * if anything, needs to be applied to the event cache.\n     *\n     * Possibilities:\n     *\n     * 1. No writes are shadowing. Events should be raised, the snap to be applied comes from the server data\n     *\n     * 2. Some write is completely shadowing. No events to be raised\n     *\n     * 3. Is partially shadowed. Events should be raised\n     *\n     * Either existingEventSnap or existingServerSnap must exist, this is validated via an assert\n     *\n     * @param {!Path} path\n     * @param {?Node} existingEventSnap\n     * @param {?Node} existingServerSnap\n     * @return {?Node}\n     */\n    WriteTreeRef.prototype.calcEventCacheAfterServerOverwrite = function (path, existingEventSnap, existingServerSnap) {\n        return this.writeTree_.calcEventCacheAfterServerOverwrite(this.treePath_, path, existingEventSnap, existingServerSnap);\n    };\n    /**\n     * Returns a node if there is a complete overwrite for this path. More specifically, if there is a write at\n     * a higher path, this will return the child of that write relative to the write and this path.\n     * Returns null if there is no write at this path.\n     *\n     * @param {!Path} path\n     * @return {?Node}\n     */\n    WriteTreeRef.prototype.shadowingWrite = function (path) {\n        return this.writeTree_.shadowingWrite(this.treePath_.child(path));\n    };\n    /**\n     * This method is used when processing child remove events on a query. If we can, we pull in children that were outside\n     * the window, but may now be in the window\n     *\n     * @param {?Node} completeServerData\n     * @param {!NamedNode} startPost\n     * @param {!number} count\n     * @param {boolean} reverse\n     * @param {!Index} index\n     * @return {!Array.<!NamedNode>}\n     */\n    WriteTreeRef.prototype.calcIndexedSlice = function (completeServerData, startPost, count, reverse, index) {\n        return this.writeTree_.calcIndexedSlice(this.treePath_, completeServerData, startPost, count, reverse, index);\n    };\n    /**\n     * Returns a complete child for a given server snap after applying all user writes or null if there is no\n     * complete child for this ChildKey.\n     *\n     * @param {!string} childKey\n     * @param {!CacheNode} existingServerCache\n     * @return {?Node}\n     */\n    WriteTreeRef.prototype.calcCompleteChild = function (childKey, existingServerCache) {\n        return this.writeTree_.calcCompleteChild(this.treePath_, childKey, existingServerCache);\n    };\n    /**\n     * Return a WriteTreeRef for a child.\n     *\n     * @param {string} childName\n     * @return {!WriteTreeRef}\n     */\n    WriteTreeRef.prototype.child = function (childName) {\n        return new WriteTreeRef(this.treePath_.child(childName), this.writeTree_);\n    };\n    return WriteTreeRef;\n}());\nexports.WriteTreeRef = WriteTreeRef;\n\n//# sourceMappingURL=WriteTree.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/WriteTree.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar ImmutableTree_1 = require(\"./util/ImmutableTree\");\nvar Path_1 = require(\"./util/Path\");\nvar util_1 = require(\"@firebase/util\");\nvar Node_1 = require(\"./snap/Node\");\nvar PriorityIndex_1 = require(\"./snap/indexes/PriorityIndex\");\nvar util_2 = require(\"@firebase/util\");\n/**\n * This class holds a collection of writes that can be applied to nodes in unison. It abstracts away the logic with\n * dealing with priority writes and multiple nested writes. At any given path there is only allowed to be one write\n * modifying that path. Any write to an existing path or shadowing an existing path will modify that existing write\n * to reflect the write added.\n *\n * @constructor\n * @param {!ImmutableTree.<!Node>} writeTree\n */\nvar CompoundWrite = /** @class */ (function () {\n    function CompoundWrite(writeTree_) {\n        this.writeTree_ = writeTree_;\n    }\n    /**\n     * @param {!Path} path\n     * @param {!Node} node\n     * @return {!CompoundWrite}\n     */\n    CompoundWrite.prototype.addWrite = function (path, node) {\n        if (path.isEmpty()) {\n            return new CompoundWrite(new ImmutableTree_1.ImmutableTree(node));\n        }\n        else {\n            var rootmost = this.writeTree_.findRootMostValueAndPath(path);\n            if (rootmost != null) {\n                var rootMostPath = rootmost.path;\n                var value = rootmost.value;\n                var relativePath = Path_1.Path.relativePath(rootMostPath, path);\n                value = value.updateChild(relativePath, node);\n                return new CompoundWrite(this.writeTree_.set(rootMostPath, value));\n            }\n            else {\n                var subtree = new ImmutableTree_1.ImmutableTree(node);\n                var newWriteTree = this.writeTree_.setTree(path, subtree);\n                return new CompoundWrite(newWriteTree);\n            }\n        }\n    };\n    /**\n     * @param {!Path} path\n     * @param {!Object.<string, !Node>} updates\n     * @return {!CompoundWrite}\n     */\n    CompoundWrite.prototype.addWrites = function (path, updates) {\n        var newWrite = this;\n        util_1.forEach(updates, function (childKey, node) {\n            newWrite = newWrite.addWrite(path.child(childKey), node);\n        });\n        return newWrite;\n    };\n    /**\n     * Will remove a write at the given path and deeper paths. This will <em>not</em> modify a write at a higher\n     * location, which must be removed by calling this method with that path.\n     *\n     * @param {!Path} path The path at which a write and all deeper writes should be removed\n     * @return {!CompoundWrite} The new CompoundWrite with the removed path\n     */\n    CompoundWrite.prototype.removeWrite = function (path) {\n        if (path.isEmpty()) {\n            return CompoundWrite.Empty;\n        }\n        else {\n            var newWriteTree = this.writeTree_.setTree(path, ImmutableTree_1.ImmutableTree.Empty);\n            return new CompoundWrite(newWriteTree);\n        }\n    };\n    /**\n     * Returns whether this CompoundWrite will fully overwrite a node at a given location and can therefore be\n     * considered \"complete\".\n     *\n     * @param {!Path} path The path to check for\n     * @return {boolean} Whether there is a complete write at that path\n     */\n    CompoundWrite.prototype.hasCompleteWrite = function (path) {\n        return this.getCompleteNode(path) != null;\n    };\n    /**\n     * Returns a node for a path if and only if the node is a \"complete\" overwrite at that path. This will not aggregate\n     * writes from deeper paths, but will return child nodes from a more shallow path.\n     *\n     * @param {!Path} path The path to get a complete write\n     * @return {?Node} The node if complete at that path, or null otherwise.\n     */\n    CompoundWrite.prototype.getCompleteNode = function (path) {\n        var rootmost = this.writeTree_.findRootMostValueAndPath(path);\n        if (rootmost != null) {\n            return this.writeTree_\n                .get(rootmost.path)\n                .getChild(Path_1.Path.relativePath(rootmost.path, path));\n        }\n        else {\n            return null;\n        }\n    };\n    /**\n     * Returns all children that are guaranteed to be a complete overwrite.\n     *\n     * @return {!Array.<NamedNode>} A list of all complete children.\n     */\n    CompoundWrite.prototype.getCompleteChildren = function () {\n        var children = [];\n        var node = this.writeTree_.value;\n        if (node != null) {\n            // If it's a leaf node, it has no children; so nothing to do.\n            if (!node.isLeafNode()) {\n                node.forEachChild(PriorityIndex_1.PRIORITY_INDEX, function (childName, childNode) {\n                    children.push(new Node_1.NamedNode(childName, childNode));\n                });\n            }\n        }\n        else {\n            this.writeTree_.children.inorderTraversal(function (childName, childTree) {\n                if (childTree.value != null) {\n                    children.push(new Node_1.NamedNode(childName, childTree.value));\n                }\n            });\n        }\n        return children;\n    };\n    /**\n     * @param {!Path} path\n     * @return {!CompoundWrite}\n     */\n    CompoundWrite.prototype.childCompoundWrite = function (path) {\n        if (path.isEmpty()) {\n            return this;\n        }\n        else {\n            var shadowingNode = this.getCompleteNode(path);\n            if (shadowingNode != null) {\n                return new CompoundWrite(new ImmutableTree_1.ImmutableTree(shadowingNode));\n            }\n            else {\n                return new CompoundWrite(this.writeTree_.subtree(path));\n            }\n        }\n    };\n    /**\n     * Returns true if this CompoundWrite is empty and therefore does not modify any nodes.\n     * @return {boolean} Whether this CompoundWrite is empty\n     */\n    CompoundWrite.prototype.isEmpty = function () {\n        return this.writeTree_.isEmpty();\n    };\n    /**\n     * Applies this CompoundWrite to a node. The node is returned with all writes from this CompoundWrite applied to the\n     * node\n     * @param {!Node} node The node to apply this CompoundWrite to\n     * @return {!Node} The node with all writes applied\n     */\n    CompoundWrite.prototype.apply = function (node) {\n        return CompoundWrite.applySubtreeWrite_(Path_1.Path.Empty, this.writeTree_, node);\n    };\n    /**\n     * @type {!CompoundWrite}\n     */\n    CompoundWrite.Empty = new CompoundWrite(new ImmutableTree_1.ImmutableTree(null));\n    /**\n     * @param {!Path} relativePath\n     * @param {!ImmutableTree.<!Node>} writeTree\n     * @param {!Node} node\n     * @return {!Node}\n     * @private\n     */\n    CompoundWrite.applySubtreeWrite_ = function (relativePath, writeTree, node) {\n        if (writeTree.value != null) {\n            // Since there a write is always a leaf, we're done here\n            return node.updateChild(relativePath, writeTree.value);\n        }\n        else {\n            var priorityWrite_1 = null;\n            writeTree.children.inorderTraversal(function (childKey, childTree) {\n                if (childKey === '.priority') {\n                    // Apply priorities at the end so we don't update priorities for either empty nodes or forget\n                    // to apply priorities to empty nodes that are later filled\n                    util_2.assert(childTree.value !== null, 'Priority writes must always be leaf nodes');\n                    priorityWrite_1 = childTree.value;\n                }\n                else {\n                    node = CompoundWrite.applySubtreeWrite_(relativePath.child(childKey), childTree, node);\n                }\n            });\n            // If there was a priority write, we only apply it if the node is not empty\n            if (!node.getChild(relativePath).isEmpty() && priorityWrite_1 !== null) {\n                node = node.updateChild(relativePath.child('.priority'), priorityWrite_1);\n            }\n            return node;\n        }\n    };\n    return CompoundWrite;\n}());\nexports.CompoundWrite = CompoundWrite;\n\n//# sourceMappingURL=CompoundWrite.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/CompoundWrite.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar ChildrenNode_1 = require(\"./snap/ChildrenNode\");\n/**\n * Mutable object which basically just stores a reference to the \"latest\" immutable snapshot.\n *\n * @constructor\n */\nvar SnapshotHolder = /** @class */ (function () {\n    function SnapshotHolder() {\n        this.rootNode_ = ChildrenNode_1.ChildrenNode.EMPTY_NODE;\n    }\n    SnapshotHolder.prototype.getNode = function (path) {\n        return this.rootNode_.getChild(path);\n    };\n    SnapshotHolder.prototype.updateSnapshot = function (path, newSnapshotNode) {\n        this.rootNode_ = this.rootNode_.updateChild(path, newSnapshotNode);\n    };\n    return SnapshotHolder;\n}());\nexports.SnapshotHolder = SnapshotHolder;\n\n//# sourceMappingURL=SnapshotHolder.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/SnapshotHolder.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = require(\"./util/util\");\n/**\n * Abstraction around FirebaseApp's token fetching capabilities.\n */\nvar AuthTokenProvider = /** @class */ (function () {\n    /**\n     * @param {!FirebaseApp} app_\n     */\n    function AuthTokenProvider(app_) {\n        this.app_ = app_;\n    }\n    /**\n     * @param {boolean} forceRefresh\n     * @return {!Promise<FirebaseAuthTokenData>}\n     */\n    AuthTokenProvider.prototype.getToken = function (forceRefresh) {\n        return this.app_['INTERNAL']['getToken'](forceRefresh).then(null, \n        // .catch\n        function (error) {\n            // TODO: Need to figure out all the cases this is raised and whether\n            // this makes sense.\n            if (error && error.code === 'auth/token-not-initialized') {\n                util_1.log('Got auth/token-not-initialized error.  Treating as null token.');\n                return null;\n            }\n            else {\n                return Promise.reject(error);\n            }\n        });\n    };\n    AuthTokenProvider.prototype.addTokenChangeListener = function (listener) {\n        // TODO: We might want to wrap the listener and call it with no args to\n        // avoid a leaky abstraction, but that makes removing the listener harder.\n        this.app_['INTERNAL']['addAuthTokenListener'](listener);\n    };\n    AuthTokenProvider.prototype.removeTokenChangeListener = function (listener) {\n        this.app_['INTERNAL']['removeAuthTokenListener'](listener);\n    };\n    AuthTokenProvider.prototype.notifyForInvalidToken = function () {\n        var errorMessage = 'Provided authentication credentials for the app named \"' +\n            this.app_.name +\n            '\" are invalid. This usually indicates your app was not ' +\n            'initialized correctly. ';\n        if ('credential' in this.app_.options) {\n            errorMessage +=\n                'Make sure the \"credential\" property provided to initializeApp() ' +\n                    'is authorized to access the specified \"databaseURL\" and is from the correct ' +\n                    'project.';\n        }\n        else if ('serviceAccount' in this.app_.options) {\n            errorMessage +=\n                'Make sure the \"serviceAccount\" property provided to initializeApp() ' +\n                    'is authorized to access the specified \"databaseURL\" and is from the correct ' +\n                    'project.';\n        }\n        else {\n            errorMessage +=\n                'Make sure the \"apiKey\" and \"databaseURL\" properties provided to ' +\n                    'initializeApp() match the values provided for your app at ' +\n                    'https://console.firebase.google.com/.';\n        }\n        util_1.warn(errorMessage);\n    };\n    return AuthTokenProvider;\n}());\nexports.AuthTokenProvider = AuthTokenProvider;\n\n//# sourceMappingURL=AuthTokenProvider.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/AuthTokenProvider.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = require(\"@firebase/util\");\nvar util_2 = require(\"@firebase/util\");\n/**\n * Tracks a collection of stats.\n *\n * @constructor\n */\nvar StatsCollection = /** @class */ (function () {\n    function StatsCollection() {\n        this.counters_ = {};\n    }\n    StatsCollection.prototype.incrementCounter = function (name, amount) {\n        if (amount === void 0) { amount = 1; }\n        if (!util_2.contains(this.counters_, name))\n            this.counters_[name] = 0;\n        this.counters_[name] += amount;\n    };\n    StatsCollection.prototype.get = function () {\n        return util_1.deepCopy(this.counters_);\n    };\n    return StatsCollection;\n}());\nexports.StatsCollection = StatsCollection;\n\n//# sourceMappingURL=StatsCollection.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/stats/StatsCollection.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = require(\"@firebase/util\");\nvar util_2 = require(\"../util/util\");\nvar StatsListener_1 = require(\"./StatsListener\");\n// Assuming some apps may have a short amount of time on page, and a bulk of firebase operations probably\n// happen on page load, we try to report our first set of stats pretty quickly, but we wait at least 10\n// seconds to try to ensure the Firebase connection is established / settled.\nvar FIRST_STATS_MIN_TIME = 10 * 1000;\nvar FIRST_STATS_MAX_TIME = 30 * 1000;\n// We'll continue to report stats on average every 5 minutes.\nvar REPORT_STATS_INTERVAL = 5 * 60 * 1000;\n/**\n * @constructor\n */\nvar StatsReporter = /** @class */ (function () {\n    /**\n     * @param collection\n     * @param server_\n     */\n    function StatsReporter(collection, server_) {\n        this.server_ = server_;\n        this.statsToReport_ = {};\n        this.statsListener_ = new StatsListener_1.StatsListener(collection);\n        var timeout = FIRST_STATS_MIN_TIME +\n            (FIRST_STATS_MAX_TIME - FIRST_STATS_MIN_TIME) * Math.random();\n        util_2.setTimeoutNonBlocking(this.reportStats_.bind(this), Math.floor(timeout));\n    }\n    StatsReporter.prototype.includeStat = function (stat) {\n        this.statsToReport_[stat] = true;\n    };\n    StatsReporter.prototype.reportStats_ = function () {\n        var _this = this;\n        var stats = this.statsListener_.get();\n        var reportedStats = {};\n        var haveStatsToReport = false;\n        util_1.forEach(stats, function (stat, value) {\n            if (value > 0 && util_1.contains(_this.statsToReport_, stat)) {\n                reportedStats[stat] = value;\n                haveStatsToReport = true;\n            }\n        });\n        if (haveStatsToReport) {\n            this.server_.reportStats(reportedStats);\n        }\n        // queue our next run.\n        util_2.setTimeoutNonBlocking(this.reportStats_.bind(this), Math.floor(Math.random() * 2 * REPORT_STATS_INTERVAL));\n    };\n    return StatsReporter;\n}());\nexports.StatsReporter = StatsReporter;\n\n//# sourceMappingURL=StatsReporter.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/stats/StatsReporter.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = require(\"../util/util\");\n/**\n * The event queue serves a few purposes:\n * 1. It ensures we maintain event order in the face of event callbacks doing operations that result in more\n *    events being queued.\n * 2. raiseQueuedEvents() handles being called reentrantly nicely.  That is, if in the course of raising events,\n *    raiseQueuedEvents() is called again, the \"inner\" call will pick up raising events where the \"outer\" call\n *    left off, ensuring that the events are still raised synchronously and in order.\n * 3. You can use raiseEventsAtPath and raiseEventsForChangedPath to ensure only relevant previously-queued\n *    events are raised synchronously.\n *\n * NOTE: This can all go away if/when we move to async events.\n *\n * @constructor\n */\nvar EventQueue = /** @class */ (function () {\n    function EventQueue() {\n        /**\n         * @private\n         * @type {!Array.<EventList>}\n         */\n        this.eventLists_ = [];\n        /**\n         * Tracks recursion depth of raiseQueuedEvents_, for debugging purposes.\n         * @private\n         * @type {!number}\n         */\n        this.recursionDepth_ = 0;\n    }\n    /**\n     * @param {!Array.<Event>} eventDataList The new events to queue.\n     */\n    EventQueue.prototype.queueEvents = function (eventDataList) {\n        // We group events by path, storing them in a single EventList, to make it easier to skip over them quickly.\n        var currList = null;\n        for (var i = 0; i < eventDataList.length; i++) {\n            var eventData = eventDataList[i];\n            var eventPath = eventData.getPath();\n            if (currList !== null && !eventPath.equals(currList.getPath())) {\n                this.eventLists_.push(currList);\n                currList = null;\n            }\n            if (currList === null) {\n                currList = new EventList(eventPath);\n            }\n            currList.add(eventData);\n        }\n        if (currList) {\n            this.eventLists_.push(currList);\n        }\n    };\n    /**\n     * Queues the specified events and synchronously raises all events (including previously queued ones)\n     * for the specified path.\n     *\n     * It is assumed that the new events are all for the specified path.\n     *\n     * @param {!Path} path The path to raise events for.\n     * @param {!Array.<Event>} eventDataList The new events to raise.\n     */\n    EventQueue.prototype.raiseEventsAtPath = function (path, eventDataList) {\n        this.queueEvents(eventDataList);\n        this.raiseQueuedEventsMatchingPredicate_(function (eventPath) {\n            return eventPath.equals(path);\n        });\n    };\n    /**\n     * Queues the specified events and synchronously raises all events (including previously queued ones) for\n     * locations related to the specified change path (i.e. all ancestors and descendants).\n     *\n     * It is assumed that the new events are all related (ancestor or descendant) to the specified path.\n     *\n     * @param {!Path} changedPath The path to raise events for.\n     * @param {!Array.<!Event>} eventDataList The events to raise\n     */\n    EventQueue.prototype.raiseEventsForChangedPath = function (changedPath, eventDataList) {\n        this.queueEvents(eventDataList);\n        this.raiseQueuedEventsMatchingPredicate_(function (eventPath) {\n            return eventPath.contains(changedPath) || changedPath.contains(eventPath);\n        });\n    };\n    /**\n     * @param {!function(!Path):boolean} predicate\n     * @private\n     */\n    EventQueue.prototype.raiseQueuedEventsMatchingPredicate_ = function (predicate) {\n        this.recursionDepth_++;\n        var sentAll = true;\n        for (var i = 0; i < this.eventLists_.length; i++) {\n            var eventList = this.eventLists_[i];\n            if (eventList) {\n                var eventPath = eventList.getPath();\n                if (predicate(eventPath)) {\n                    this.eventLists_[i].raise();\n                    this.eventLists_[i] = null;\n                }\n                else {\n                    sentAll = false;\n                }\n            }\n        }\n        if (sentAll) {\n            this.eventLists_ = [];\n        }\n        this.recursionDepth_--;\n    };\n    return EventQueue;\n}());\nexports.EventQueue = EventQueue;\n/**\n * @param {!Path} path\n * @constructor\n */\nvar EventList = /** @class */ (function () {\n    function EventList(path_) {\n        this.path_ = path_;\n        /**\n         * @type {!Array.<Event>}\n         * @private\n         */\n        this.events_ = [];\n    }\n    /**\n     * @param {!Event} eventData\n     */\n    EventList.prototype.add = function (eventData) {\n        this.events_.push(eventData);\n    };\n    /**\n     * Iterates through the list and raises each event\n     */\n    EventList.prototype.raise = function () {\n        for (var i = 0; i < this.events_.length; i++) {\n            var eventData = this.events_[i];\n            if (eventData !== null) {\n                this.events_[i] = null;\n                var eventFn = eventData.getEventRunner();\n                if (util_1.logger) {\n                    util_1.log('event: ' + eventData.toString());\n                }\n                util_1.exceptionGuard(eventFn);\n            }\n        }\n    };\n    /**\n     * @return {!Path}\n     */\n    EventList.prototype.getPath = function () {\n        return this.path_;\n    };\n    return EventList;\n}());\nexports.EventList = EventList;\n\n//# sourceMappingURL=EventQueue.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/view/EventQueue.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nvar __extends = (this && this.__extends) || (function () {\n    var extendStatics = Object.setPrototypeOf ||\n        ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n        function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };\n    return function (d, b) {\n        extendStatics(d, b);\n        function __() { this.constructor = d; }\n        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n    };\n})();\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar EventEmitter_1 = require(\"./EventEmitter\");\nvar util_1 = require(\"@firebase/util\");\n/**\n * @extends {EventEmitter}\n */\nvar VisibilityMonitor = /** @class */ (function (_super) {\n    __extends(VisibilityMonitor, _super);\n    function VisibilityMonitor() {\n        var _this = _super.call(this, ['visible']) || this;\n        var hidden;\n        var visibilityChange;\n        if (typeof document !== 'undefined' &&\n            typeof document.addEventListener !== 'undefined') {\n            if (typeof document['hidden'] !== 'undefined') {\n                // Opera 12.10 and Firefox 18 and later support\n                visibilityChange = 'visibilitychange';\n                hidden = 'hidden';\n            }\n            else if (typeof document['mozHidden'] !== 'undefined') {\n                visibilityChange = 'mozvisibilitychange';\n                hidden = 'mozHidden';\n            }\n            else if (typeof document['msHidden'] !== 'undefined') {\n                visibilityChange = 'msvisibilitychange';\n                hidden = 'msHidden';\n            }\n            else if (typeof document['webkitHidden'] !== 'undefined') {\n                visibilityChange = 'webkitvisibilitychange';\n                hidden = 'webkitHidden';\n            }\n        }\n        // Initially, we always assume we are visible. This ensures that in browsers\n        // without page visibility support or in cases where we are never visible\n        // (e.g. chrome extension), we act as if we are visible, i.e. don't delay\n        // reconnects\n        _this.visible_ = true;\n        if (visibilityChange) {\n            document.addEventListener(visibilityChange, function () {\n                var visible = !document[hidden];\n                if (visible !== _this.visible_) {\n                    _this.visible_ = visible;\n                    _this.trigger('visible', visible);\n                }\n            }, false);\n        }\n        return _this;\n    }\n    VisibilityMonitor.getInstance = function () {\n        return new VisibilityMonitor();\n    };\n    /**\n     * @param {!string} eventType\n     * @return {Array.<boolean>}\n     */\n    VisibilityMonitor.prototype.getInitialEvent = function (eventType) {\n        util_1.assert(eventType === 'visible', 'Unknown event type: ' + eventType);\n        return [this.visible_];\n    };\n    return VisibilityMonitor;\n}(EventEmitter_1.EventEmitter));\nexports.VisibilityMonitor = VisibilityMonitor;\n\n//# sourceMappingURL=VisibilityMonitor.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/util/VisibilityMonitor.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nvar __extends = (this && this.__extends) || (function () {\n    var extendStatics = Object.setPrototypeOf ||\n        ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n        function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };\n    return function (d, b) {\n        extendStatics(d, b);\n        function __() { this.constructor = d; }\n        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n    };\n})();\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = require(\"@firebase/util\");\nvar EventEmitter_1 = require(\"./EventEmitter\");\nvar util_2 = require(\"@firebase/util\");\n/**\n * Monitors online state (as reported by window.online/offline events).\n *\n * The expectation is that this could have many false positives (thinks we are online\n * when we're not), but no false negatives.  So we can safely use it to determine when\n * we definitely cannot reach the internet.\n *\n * @extends {EventEmitter}\n */\nvar OnlineMonitor = /** @class */ (function (_super) {\n    __extends(OnlineMonitor, _super);\n    function OnlineMonitor() {\n        var _this = _super.call(this, ['online']) || this;\n        _this.online_ = true;\n        // We've had repeated complaints that Cordova apps can get stuck \"offline\", e.g.\n        // https://forum.ionicframework.com/t/firebase-connection-is-lost-and-never-come-back/43810\n        // It would seem that the 'online' event does not always fire consistently. So we disable it\n        // for Cordova.\n        if (typeof window !== 'undefined' &&\n            typeof window.addEventListener !== 'undefined' &&\n            !util_2.isMobileCordova()) {\n            window.addEventListener('online', function () {\n                if (!_this.online_) {\n                    _this.online_ = true;\n                    _this.trigger('online', true);\n                }\n            }, false);\n            window.addEventListener('offline', function () {\n                if (_this.online_) {\n                    _this.online_ = false;\n                    _this.trigger('online', false);\n                }\n            }, false);\n        }\n        return _this;\n    }\n    OnlineMonitor.getInstance = function () {\n        return new OnlineMonitor();\n    };\n    /**\n     * @param {!string} eventType\n     * @return {Array.<boolean>}\n     */\n    OnlineMonitor.prototype.getInitialEvent = function (eventType) {\n        util_1.assert(eventType === 'online', 'Unknown event type: ' + eventType);\n        return [this.online_];\n    };\n    /**\n     * @return {boolean}\n     */\n    OnlineMonitor.prototype.currentlyOnline = function () {\n        return this.online_;\n    };\n    return OnlineMonitor;\n}(EventEmitter_1.EventEmitter));\nexports.OnlineMonitor = OnlineMonitor;\n\n//# sourceMappingURL=OnlineMonitor.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/util/OnlineMonitor.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar BrowserPollConnection_1 = require(\"./BrowserPollConnection\");\nvar WebSocketConnection_1 = require(\"./WebSocketConnection\");\nvar util_1 = require(\"../core/util/util\");\n/**\n * Currently simplistic, this class manages what transport a Connection should use at various stages of its\n * lifecycle.\n *\n * It starts with longpolling in a browser, and httppolling on node. It then upgrades to websockets if\n * they are available.\n * @constructor\n */\nvar TransportManager = /** @class */ (function () {\n    /**\n     * @param {!RepoInfo} repoInfo Metadata around the namespace we're connecting to\n     */\n    function TransportManager(repoInfo) {\n        this.initTransports_(repoInfo);\n    }\n    Object.defineProperty(TransportManager, \"ALL_TRANSPORTS\", {\n        /**\n         * @const\n         * @type {!Array.<function(new:Transport, string, RepoInfo, string=)>}\n         */\n        get: function () {\n            return [BrowserPollConnection_1.BrowserPollConnection, WebSocketConnection_1.WebSocketConnection];\n        },\n        enumerable: true,\n        configurable: true\n    });\n    /**\n     * @param {!RepoInfo} repoInfo\n     * @private\n     */\n    TransportManager.prototype.initTransports_ = function (repoInfo) {\n        var isWebSocketsAvailable = WebSocketConnection_1.WebSocketConnection && WebSocketConnection_1.WebSocketConnection['isAvailable']();\n        var isSkipPollConnection = isWebSocketsAvailable && !WebSocketConnection_1.WebSocketConnection.previouslyFailed();\n        if (repoInfo.webSocketOnly) {\n            if (!isWebSocketsAvailable)\n                util_1.warn(\"wss:// URL used, but browser isn't known to support websockets.  Trying anyway.\");\n            isSkipPollConnection = true;\n        }\n        if (isSkipPollConnection) {\n            this.transports_ = [WebSocketConnection_1.WebSocketConnection];\n        }\n        else {\n            var transports_1 = (this.transports_ = []);\n            util_1.each(TransportManager.ALL_TRANSPORTS, function (i, transport) {\n                if (transport && transport['isAvailable']()) {\n                    transports_1.push(transport);\n                }\n            });\n        }\n    };\n    /**\n     * @return {function(new:Transport, !string, !RepoInfo, string=, string=)} The constructor for the\n     * initial transport to use\n     */\n    TransportManager.prototype.initialTransport = function () {\n        if (this.transports_.length > 0) {\n            return this.transports_[0];\n        }\n        else {\n            throw new Error('No transports available');\n        }\n    };\n    /**\n     * @return {?function(new:Transport, function(),function(), string=)} The constructor for the next\n     * transport, or null\n     */\n    TransportManager.prototype.upgradeTransport = function () {\n        if (this.transports_.length > 1) {\n            return this.transports_[1];\n        }\n        else {\n            return null;\n        }\n    };\n    return TransportManager;\n}());\nexports.TransportManager = TransportManager;\n\n//# sourceMappingURL=TransportManager.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/realtime/TransportManager.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = require(\"../../core/util/util\");\n/**\n * This class ensures the packets from the server arrive in order\n * This class takes data from the server and ensures it gets passed into the callbacks in order.\n * @constructor\n */\nvar PacketReceiver = /** @class */ (function () {\n    /**\n     * @param onMessage_\n     */\n    function PacketReceiver(onMessage_) {\n        this.onMessage_ = onMessage_;\n        this.pendingResponses = [];\n        this.currentResponseNum = 0;\n        this.closeAfterResponse = -1;\n        this.onClose = null;\n    }\n    PacketReceiver.prototype.closeAfter = function (responseNum, callback) {\n        this.closeAfterResponse = responseNum;\n        this.onClose = callback;\n        if (this.closeAfterResponse < this.currentResponseNum) {\n            this.onClose();\n            this.onClose = null;\n        }\n    };\n    /**\n     * Each message from the server comes with a response number, and an array of data. The responseNumber\n     * allows us to ensure that we process them in the right order, since we can't be guaranteed that all\n     * browsers will respond in the same order as the requests we sent\n     * @param {number} requestNum\n     * @param {Array} data\n     */\n    PacketReceiver.prototype.handleResponse = function (requestNum, data) {\n        var _this = this;\n        this.pendingResponses[requestNum] = data;\n        var _loop_1 = function () {\n            var toProcess = this_1.pendingResponses[this_1.currentResponseNum];\n            delete this_1.pendingResponses[this_1.currentResponseNum];\n            var _loop_2 = function (i) {\n                if (toProcess[i]) {\n                    util_1.exceptionGuard(function () {\n                        _this.onMessage_(toProcess[i]);\n                    });\n                }\n            };\n            for (var i = 0; i < toProcess.length; ++i) {\n                _loop_2(i);\n            }\n            if (this_1.currentResponseNum === this_1.closeAfterResponse) {\n                if (this_1.onClose) {\n                    this_1.onClose();\n                    this_1.onClose = null;\n                }\n                return \"break\";\n            }\n            this_1.currentResponseNum++;\n        };\n        var this_1 = this;\n        while (this.pendingResponses[this.currentResponseNum]) {\n            var state_1 = _loop_1();\n            if (state_1 === \"break\")\n                break;\n        }\n    };\n    return PacketReceiver;\n}());\nexports.PacketReceiver = PacketReceiver;\n\n//# sourceMappingURL=PacketReceiver.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/realtime/polling/PacketReceiver.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nvar __extends = (this && this.__extends) || (function () {\n    var extendStatics = Object.setPrototypeOf ||\n        ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n        function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };\n    return function (d, b) {\n        extendStatics(d, b);\n        function __() { this.constructor = d; }\n        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n    };\n})();\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = require(\"@firebase/util\");\nvar util_2 = require(\"./util/util\");\nvar util_3 = require(\"@firebase/util\");\nvar util_4 = require(\"@firebase/util\");\nvar util_5 = require(\"@firebase/util\");\nvar ServerActions_1 = require(\"./ServerActions\");\n/**\n * An implementation of ServerActions that communicates with the server via REST requests.\n * This is mostly useful for compatibility with crawlers, where we don't want to spin up a full\n * persistent connection (using WebSockets or long-polling)\n */\nvar ReadonlyRestClient = /** @class */ (function (_super) {\n    __extends(ReadonlyRestClient, _super);\n    /**\n     * @param {!RepoInfo} repoInfo_ Data about the namespace we are connecting to\n     * @param {function(string, *, boolean, ?number)} onDataUpdate_ A callback for new data from the server\n     * @param {AuthTokenProvider} authTokenProvider_\n     * @implements {ServerActions}\n     */\n    function ReadonlyRestClient(repoInfo_, onDataUpdate_, authTokenProvider_) {\n        var _this = _super.call(this) || this;\n        _this.repoInfo_ = repoInfo_;\n        _this.onDataUpdate_ = onDataUpdate_;\n        _this.authTokenProvider_ = authTokenProvider_;\n        /** @private {function(...[*])} */\n        _this.log_ = util_2.logWrapper('p:rest:');\n        /**\n         * We don't actually need to track listens, except to prevent us calling an onComplete for a listen\n         * that's been removed. :-/\n         *\n         * @private {!Object.<string, !Object>}\n         */\n        _this.listens_ = {};\n        return _this;\n    }\n    ReadonlyRestClient.prototype.reportStats = function (stats) {\n        throw new Error('Method not implemented.');\n    };\n    /**\n     * @param {!Query} query\n     * @param {?number=} tag\n     * @return {string}\n     * @private\n     */\n    ReadonlyRestClient.getListenId_ = function (query, tag) {\n        if (tag !== undefined) {\n            return 'tag$' + tag;\n        }\n        else {\n            util_1.assert(query.getQueryParams().isDefault(), \"should have a tag if it's not a default query.\");\n            return query.path.toString();\n        }\n    };\n    /** @inheritDoc */\n    ReadonlyRestClient.prototype.listen = function (query, currentHashFn, tag, onComplete) {\n        var _this = this;\n        var pathString = query.path.toString();\n        this.log_('Listen called for ' + pathString + ' ' + query.queryIdentifier());\n        // Mark this listener so we can tell if it's removed.\n        var listenId = ReadonlyRestClient.getListenId_(query, tag);\n        var thisListen = {};\n        this.listens_[listenId] = thisListen;\n        var queryStringParamaters = query\n            .getQueryParams()\n            .toRestQueryStringParameters();\n        this.restRequest_(pathString + '.json', queryStringParamaters, function (error, result) {\n            var data = result;\n            if (error === 404) {\n                data = null;\n                error = null;\n            }\n            if (error === null) {\n                _this.onDataUpdate_(pathString, data, /*isMerge=*/ false, tag);\n            }\n            if (util_4.safeGet(_this.listens_, listenId) === thisListen) {\n                var status_1;\n                if (!error) {\n                    status_1 = 'ok';\n                }\n                else if (error == 401) {\n                    status_1 = 'permission_denied';\n                }\n                else {\n                    status_1 = 'rest_error:' + error;\n                }\n                onComplete(status_1, null);\n            }\n        });\n    };\n    /** @inheritDoc */\n    ReadonlyRestClient.prototype.unlisten = function (query, tag) {\n        var listenId = ReadonlyRestClient.getListenId_(query, tag);\n        delete this.listens_[listenId];\n    };\n    /** @inheritDoc */\n    ReadonlyRestClient.prototype.refreshAuthToken = function (token) {\n        // no-op since we just always call getToken.\n    };\n    /**\n     * Performs a REST request to the given path, with the provided query string parameters,\n     * and any auth credentials we have.\n     *\n     * @param {!string} pathString\n     * @param {!Object.<string, *>} queryStringParameters\n     * @param {?function(?number, *=)} callback\n     * @private\n     */\n    ReadonlyRestClient.prototype.restRequest_ = function (pathString, queryStringParameters, callback) {\n        var _this = this;\n        if (queryStringParameters === void 0) { queryStringParameters = {}; }\n        queryStringParameters['format'] = 'export';\n        this.authTokenProvider_\n            .getToken(/*forceRefresh=*/ false)\n            .then(function (authTokenData) {\n            var authToken = authTokenData && authTokenData.accessToken;\n            if (authToken) {\n                queryStringParameters['auth'] = authToken;\n            }\n            var url = (_this.repoInfo_.secure ? 'https://' : 'http://') +\n                _this.repoInfo_.host +\n                pathString +\n                '?' +\n                util_5.querystring(queryStringParameters);\n            _this.log_('Sending REST request for ' + url);\n            var xhr = new XMLHttpRequest();\n            xhr.onreadystatechange = function () {\n                if (callback && xhr.readyState === 4) {\n                    _this.log_('REST Response for ' + url + ' received. status:', xhr.status, 'response:', xhr.responseText);\n                    var res = null;\n                    if (xhr.status >= 200 && xhr.status < 300) {\n                        try {\n                            res = util_3.jsonEval(xhr.responseText);\n                        }\n                        catch (e) {\n                            util_2.warn('Failed to parse JSON response for ' +\n                                url +\n                                ': ' +\n                                xhr.responseText);\n                        }\n                        callback(null, res);\n                    }\n                    else {\n                        // 401 and 404 are expected.\n                        if (xhr.status !== 401 && xhr.status !== 404) {\n                            util_2.warn('Got unsuccessful REST response for ' +\n                                url +\n                                ' Status: ' +\n                                xhr.status);\n                        }\n                        callback(xhr.status);\n                    }\n                    callback = null;\n                }\n            };\n            xhr.open('GET', url, /*asynchronous=*/ true);\n            xhr.send();\n        });\n    };\n    return ReadonlyRestClient;\n}(ServerActions_1.ServerActions));\nexports.ReadonlyRestClient = ReadonlyRestClient;\n\n//# sourceMappingURL=ReadonlyRestClient.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/ReadonlyRestClient.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = require(\"@firebase/util\");\nvar util_2 = require(\"../util/util\");\nvar KeyIndex_1 = require(\"../snap/indexes/KeyIndex\");\nvar PriorityIndex_1 = require(\"../snap/indexes/PriorityIndex\");\nvar ValueIndex_1 = require(\"../snap/indexes/ValueIndex\");\nvar PathIndex_1 = require(\"../snap/indexes/PathIndex\");\nvar IndexedFilter_1 = require(\"./filter/IndexedFilter\");\nvar LimitedFilter_1 = require(\"./filter/LimitedFilter\");\nvar RangedFilter_1 = require(\"./filter/RangedFilter\");\nvar util_3 = require(\"@firebase/util\");\n/**\n * This class is an immutable-from-the-public-api struct containing a set of query parameters defining a\n * range to be returned for a particular location. It is assumed that validation of parameters is done at the\n * user-facing API level, so it is not done here.\n * @constructor\n */\nvar QueryParams = /** @class */ (function () {\n    function QueryParams() {\n        this.limitSet_ = false;\n        this.startSet_ = false;\n        this.startNameSet_ = false;\n        this.endSet_ = false;\n        this.endNameSet_ = false;\n        this.limit_ = 0;\n        this.viewFrom_ = '';\n        this.indexStartValue_ = null;\n        this.indexStartName_ = '';\n        this.indexEndValue_ = null;\n        this.indexEndName_ = '';\n        this.index_ = PriorityIndex_1.PRIORITY_INDEX;\n    }\n    /**\n     * @return {boolean}\n     */\n    QueryParams.prototype.hasStart = function () {\n        return this.startSet_;\n    };\n    /**\n     * @return {boolean} True if it would return from left.\n     */\n    QueryParams.prototype.isViewFromLeft = function () {\n        if (this.viewFrom_ === '') {\n            // limit(), rather than limitToFirst or limitToLast was called.\n            // This means that only one of startSet_ and endSet_ is true. Use them\n            // to calculate which side of the view to anchor to. If neither is set,\n            // anchor to the end.\n            return this.startSet_;\n        }\n        else {\n            return (this.viewFrom_ === QueryParams.WIRE_PROTOCOL_CONSTANTS_.VIEW_FROM_LEFT);\n        }\n    };\n    /**\n     * Only valid to call if hasStart() returns true\n     * @return {*}\n     */\n    QueryParams.prototype.getIndexStartValue = function () {\n        util_1.assert(this.startSet_, 'Only valid if start has been set');\n        return this.indexStartValue_;\n    };\n    /**\n     * Only valid to call if hasStart() returns true.\n     * Returns the starting key name for the range defined by these query parameters\n     * @return {!string}\n     */\n    QueryParams.prototype.getIndexStartName = function () {\n        util_1.assert(this.startSet_, 'Only valid if start has been set');\n        if (this.startNameSet_) {\n            return this.indexStartName_;\n        }\n        else {\n            return util_2.MIN_NAME;\n        }\n    };\n    /**\n     * @return {boolean}\n     */\n    QueryParams.prototype.hasEnd = function () {\n        return this.endSet_;\n    };\n    /**\n     * Only valid to call if hasEnd() returns true.\n     * @return {*}\n     */\n    QueryParams.prototype.getIndexEndValue = function () {\n        util_1.assert(this.endSet_, 'Only valid if end has been set');\n        return this.indexEndValue_;\n    };\n    /**\n     * Only valid to call if hasEnd() returns true.\n     * Returns the end key name for the range defined by these query parameters\n     * @return {!string}\n     */\n    QueryParams.prototype.getIndexEndName = function () {\n        util_1.assert(this.endSet_, 'Only valid if end has been set');\n        if (this.endNameSet_) {\n            return this.indexEndName_;\n        }\n        else {\n            return util_2.MAX_NAME;\n        }\n    };\n    /**\n     * @return {boolean}\n     */\n    QueryParams.prototype.hasLimit = function () {\n        return this.limitSet_;\n    };\n    /**\n     * @return {boolean} True if a limit has been set and it has been explicitly anchored\n     */\n    QueryParams.prototype.hasAnchoredLimit = function () {\n        return this.limitSet_ && this.viewFrom_ !== '';\n    };\n    /**\n     * Only valid to call if hasLimit() returns true\n     * @return {!number}\n     */\n    QueryParams.prototype.getLimit = function () {\n        util_1.assert(this.limitSet_, 'Only valid if limit has been set');\n        return this.limit_;\n    };\n    /**\n     * @return {!Index}\n     */\n    QueryParams.prototype.getIndex = function () {\n        return this.index_;\n    };\n    /**\n     * @return {!QueryParams}\n     * @private\n     */\n    QueryParams.prototype.copy_ = function () {\n        var copy = new QueryParams();\n        copy.limitSet_ = this.limitSet_;\n        copy.limit_ = this.limit_;\n        copy.startSet_ = this.startSet_;\n        copy.indexStartValue_ = this.indexStartValue_;\n        copy.startNameSet_ = this.startNameSet_;\n        copy.indexStartName_ = this.indexStartName_;\n        copy.endSet_ = this.endSet_;\n        copy.indexEndValue_ = this.indexEndValue_;\n        copy.endNameSet_ = this.endNameSet_;\n        copy.indexEndName_ = this.indexEndName_;\n        copy.index_ = this.index_;\n        copy.viewFrom_ = this.viewFrom_;\n        return copy;\n    };\n    /**\n     * @param {!number} newLimit\n     * @return {!QueryParams}\n     */\n    QueryParams.prototype.limit = function (newLimit) {\n        var newParams = this.copy_();\n        newParams.limitSet_ = true;\n        newParams.limit_ = newLimit;\n        newParams.viewFrom_ = '';\n        return newParams;\n    };\n    /**\n     * @param {!number} newLimit\n     * @return {!QueryParams}\n     */\n    QueryParams.prototype.limitToFirst = function (newLimit) {\n        var newParams = this.copy_();\n        newParams.limitSet_ = true;\n        newParams.limit_ = newLimit;\n        newParams.viewFrom_ = QueryParams.WIRE_PROTOCOL_CONSTANTS_.VIEW_FROM_LEFT;\n        return newParams;\n    };\n    /**\n     * @param {!number} newLimit\n     * @return {!QueryParams}\n     */\n    QueryParams.prototype.limitToLast = function (newLimit) {\n        var newParams = this.copy_();\n        newParams.limitSet_ = true;\n        newParams.limit_ = newLimit;\n        newParams.viewFrom_ = QueryParams.WIRE_PROTOCOL_CONSTANTS_.VIEW_FROM_RIGHT;\n        return newParams;\n    };\n    /**\n     * @param {*} indexValue\n     * @param {?string=} key\n     * @return {!QueryParams}\n     */\n    QueryParams.prototype.startAt = function (indexValue, key) {\n        var newParams = this.copy_();\n        newParams.startSet_ = true;\n        if (!(indexValue !== undefined)) {\n            indexValue = null;\n        }\n        newParams.indexStartValue_ = indexValue;\n        if (key != null) {\n            newParams.startNameSet_ = true;\n            newParams.indexStartName_ = key;\n        }\n        else {\n            newParams.startNameSet_ = false;\n            newParams.indexStartName_ = '';\n        }\n        return newParams;\n    };\n    /**\n     * @param {*} indexValue\n     * @param {?string=} key\n     * @return {!QueryParams}\n     */\n    QueryParams.prototype.endAt = function (indexValue, key) {\n        var newParams = this.copy_();\n        newParams.endSet_ = true;\n        if (!(indexValue !== undefined)) {\n            indexValue = null;\n        }\n        newParams.indexEndValue_ = indexValue;\n        if (key !== undefined) {\n            newParams.endNameSet_ = true;\n            newParams.indexEndName_ = key;\n        }\n        else {\n            newParams.endNameSet_ = false;\n            newParams.indexEndName_ = '';\n        }\n        return newParams;\n    };\n    /**\n     * @param {!Index} index\n     * @return {!QueryParams}\n     */\n    QueryParams.prototype.orderBy = function (index) {\n        var newParams = this.copy_();\n        newParams.index_ = index;\n        return newParams;\n    };\n    /**\n     * @return {!Object}\n     */\n    QueryParams.prototype.getQueryObject = function () {\n        var WIRE_PROTOCOL_CONSTANTS = QueryParams.WIRE_PROTOCOL_CONSTANTS_;\n        var obj = {};\n        if (this.startSet_) {\n            obj[WIRE_PROTOCOL_CONSTANTS.INDEX_START_VALUE] = this.indexStartValue_;\n            if (this.startNameSet_) {\n                obj[WIRE_PROTOCOL_CONSTANTS.INDEX_START_NAME] = this.indexStartName_;\n            }\n        }\n        if (this.endSet_) {\n            obj[WIRE_PROTOCOL_CONSTANTS.INDEX_END_VALUE] = this.indexEndValue_;\n            if (this.endNameSet_) {\n                obj[WIRE_PROTOCOL_CONSTANTS.INDEX_END_NAME] = this.indexEndName_;\n            }\n        }\n        if (this.limitSet_) {\n            obj[WIRE_PROTOCOL_CONSTANTS.LIMIT] = this.limit_;\n            var viewFrom = this.viewFrom_;\n            if (viewFrom === '') {\n                if (this.isViewFromLeft()) {\n                    viewFrom = WIRE_PROTOCOL_CONSTANTS.VIEW_FROM_LEFT;\n                }\n                else {\n                    viewFrom = WIRE_PROTOCOL_CONSTANTS.VIEW_FROM_RIGHT;\n                }\n            }\n            obj[WIRE_PROTOCOL_CONSTANTS.VIEW_FROM] = viewFrom;\n        }\n        // For now, priority index is the default, so we only specify if it's some other index\n        if (this.index_ !== PriorityIndex_1.PRIORITY_INDEX) {\n            obj[WIRE_PROTOCOL_CONSTANTS.INDEX] = this.index_.toString();\n        }\n        return obj;\n    };\n    /**\n     * @return {boolean}\n     */\n    QueryParams.prototype.loadsAllData = function () {\n        return !(this.startSet_ || this.endSet_ || this.limitSet_);\n    };\n    /**\n     * @return {boolean}\n     */\n    QueryParams.prototype.isDefault = function () {\n        return this.loadsAllData() && this.index_ == PriorityIndex_1.PRIORITY_INDEX;\n    };\n    /**\n     * @return {!NodeFilter}\n     */\n    QueryParams.prototype.getNodeFilter = function () {\n        if (this.loadsAllData()) {\n            return new IndexedFilter_1.IndexedFilter(this.getIndex());\n        }\n        else if (this.hasLimit()) {\n            return new LimitedFilter_1.LimitedFilter(this);\n        }\n        else {\n            return new RangedFilter_1.RangedFilter(this);\n        }\n    };\n    /**\n     * Returns a set of REST query string parameters representing this query.\n     *\n     * @return {!Object.<string,*>} query string parameters\n     */\n    QueryParams.prototype.toRestQueryStringParameters = function () {\n        var REST_CONSTANTS = QueryParams.REST_QUERY_CONSTANTS_;\n        var qs = {};\n        if (this.isDefault()) {\n            return qs;\n        }\n        var orderBy;\n        if (this.index_ === PriorityIndex_1.PRIORITY_INDEX) {\n            orderBy = REST_CONSTANTS.PRIORITY_INDEX;\n        }\n        else if (this.index_ === ValueIndex_1.VALUE_INDEX) {\n            orderBy = REST_CONSTANTS.VALUE_INDEX;\n        }\n        else if (this.index_ === KeyIndex_1.KEY_INDEX) {\n            orderBy = REST_CONSTANTS.KEY_INDEX;\n        }\n        else {\n            util_1.assert(this.index_ instanceof PathIndex_1.PathIndex, 'Unrecognized index type!');\n            orderBy = this.index_.toString();\n        }\n        qs[REST_CONSTANTS.ORDER_BY] = util_3.stringify(orderBy);\n        if (this.startSet_) {\n            qs[REST_CONSTANTS.START_AT] = util_3.stringify(this.indexStartValue_);\n            if (this.startNameSet_) {\n                qs[REST_CONSTANTS.START_AT] += ',' + util_3.stringify(this.indexStartName_);\n            }\n        }\n        if (this.endSet_) {\n            qs[REST_CONSTANTS.END_AT] = util_3.stringify(this.indexEndValue_);\n            if (this.endNameSet_) {\n                qs[REST_CONSTANTS.END_AT] += ',' + util_3.stringify(this.indexEndName_);\n            }\n        }\n        if (this.limitSet_) {\n            if (this.isViewFromLeft()) {\n                qs[REST_CONSTANTS.LIMIT_TO_FIRST] = this.limit_;\n            }\n            else {\n                qs[REST_CONSTANTS.LIMIT_TO_LAST] = this.limit_;\n            }\n        }\n        return qs;\n    };\n    /**\n     * Wire Protocol Constants\n     * @const\n     * @enum {string}\n     * @private\n     */\n    QueryParams.WIRE_PROTOCOL_CONSTANTS_ = {\n        INDEX_START_VALUE: 'sp',\n        INDEX_START_NAME: 'sn',\n        INDEX_END_VALUE: 'ep',\n        INDEX_END_NAME: 'en',\n        LIMIT: 'l',\n        VIEW_FROM: 'vf',\n        VIEW_FROM_LEFT: 'l',\n        VIEW_FROM_RIGHT: 'r',\n        INDEX: 'i'\n    };\n    /**\n     * REST Query Constants\n     * @const\n     * @enum {string}\n     * @private\n     */\n    QueryParams.REST_QUERY_CONSTANTS_ = {\n        ORDER_BY: 'orderBy',\n        PRIORITY_INDEX: '$priority',\n        VALUE_INDEX: '$value',\n        KEY_INDEX: '$key',\n        START_AT: 'startAt',\n        END_AT: 'endAt',\n        LIMIT_TO_FIRST: 'limitToFirst',\n        LIMIT_TO_LAST: 'limitToLast'\n    };\n    /**\n     * Default, empty query parameters\n     * @type {!QueryParams}\n     * @const\n     */\n    QueryParams.DEFAULT = new QueryParams();\n    return QueryParams;\n}());\nexports.QueryParams = QueryParams;\n\n//# sourceMappingURL=QueryParams.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/view/QueryParams.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar RangedFilter_1 = require(\"./RangedFilter\");\nvar ChildrenNode_1 = require(\"../../snap/ChildrenNode\");\nvar Node_1 = require(\"../../snap/Node\");\nvar util_1 = require(\"@firebase/util\");\nvar Change_1 = require(\"../Change\");\n/**\n * Applies a limit and a range to a node and uses RangedFilter to do the heavy lifting where possible\n *\n * @constructor\n * @implements {NodeFilter}\n */\nvar LimitedFilter = /** @class */ (function () {\n    /**\n     * @param {!QueryParams} params\n     */\n    function LimitedFilter(params) {\n        this.rangedFilter_ = new RangedFilter_1.RangedFilter(params);\n        this.index_ = params.getIndex();\n        this.limit_ = params.getLimit();\n        this.reverse_ = !params.isViewFromLeft();\n    }\n    /**\n     * @inheritDoc\n     */\n    LimitedFilter.prototype.updateChild = function (snap, key, newChild, affectedPath, source, optChangeAccumulator) {\n        if (!this.rangedFilter_.matches(new Node_1.NamedNode(key, newChild))) {\n            newChild = ChildrenNode_1.ChildrenNode.EMPTY_NODE;\n        }\n        if (snap.getImmediateChild(key).equals(newChild)) {\n            // No change\n            return snap;\n        }\n        else if (snap.numChildren() < this.limit_) {\n            return this.rangedFilter_\n                .getIndexedFilter()\n                .updateChild(snap, key, newChild, affectedPath, source, optChangeAccumulator);\n        }\n        else {\n            return this.fullLimitUpdateChild_(snap, key, newChild, source, optChangeAccumulator);\n        }\n    };\n    /**\n     * @inheritDoc\n     */\n    LimitedFilter.prototype.updateFullNode = function (oldSnap, newSnap, optChangeAccumulator) {\n        var filtered;\n        if (newSnap.isLeafNode() || newSnap.isEmpty()) {\n            // Make sure we have a children node with the correct index, not a leaf node;\n            filtered = ChildrenNode_1.ChildrenNode.EMPTY_NODE.withIndex(this.index_);\n        }\n        else {\n            if (this.limit_ * 2 < newSnap.numChildren() &&\n                newSnap.isIndexed(this.index_)) {\n                // Easier to build up a snapshot, since what we're given has more than twice the elements we want\n                filtered = ChildrenNode_1.ChildrenNode.EMPTY_NODE.withIndex(this.index_);\n                // anchor to the startPost, endPost, or last element as appropriate\n                var iterator = void 0;\n                if (this.reverse_) {\n                    iterator = newSnap.getReverseIteratorFrom(this.rangedFilter_.getEndPost(), this.index_);\n                }\n                else {\n                    iterator = newSnap.getIteratorFrom(this.rangedFilter_.getStartPost(), this.index_);\n                }\n                var count = 0;\n                while (iterator.hasNext() && count < this.limit_) {\n                    var next = iterator.getNext();\n                    var inRange = void 0;\n                    if (this.reverse_) {\n                        inRange =\n                            this.index_.compare(this.rangedFilter_.getStartPost(), next) <= 0;\n                    }\n                    else {\n                        inRange =\n                            this.index_.compare(next, this.rangedFilter_.getEndPost()) <= 0;\n                    }\n                    if (inRange) {\n                        filtered = filtered.updateImmediateChild(next.name, next.node);\n                        count++;\n                    }\n                    else {\n                        // if we have reached the end post, we cannot keep adding elemments\n                        break;\n                    }\n                }\n            }\n            else {\n                // The snap contains less than twice the limit. Faster to delete from the snap than build up a new one\n                filtered = newSnap.withIndex(this.index_);\n                // Don't support priorities on queries\n                filtered = filtered.updatePriority(ChildrenNode_1.ChildrenNode.EMPTY_NODE);\n                var startPost = void 0;\n                var endPost = void 0;\n                var cmp = void 0;\n                var iterator = void 0;\n                if (this.reverse_) {\n                    iterator = filtered.getReverseIterator(this.index_);\n                    startPost = this.rangedFilter_.getEndPost();\n                    endPost = this.rangedFilter_.getStartPost();\n                    var indexCompare_1 = this.index_.getCompare();\n                    cmp = function (a, b) { return indexCompare_1(b, a); };\n                }\n                else {\n                    iterator = filtered.getIterator(this.index_);\n                    startPost = this.rangedFilter_.getStartPost();\n                    endPost = this.rangedFilter_.getEndPost();\n                    cmp = this.index_.getCompare();\n                }\n                var count = 0;\n                var foundStartPost = false;\n                while (iterator.hasNext()) {\n                    var next = iterator.getNext();\n                    if (!foundStartPost && cmp(startPost, next) <= 0) {\n                        // start adding\n                        foundStartPost = true;\n                    }\n                    var inRange = foundStartPost && count < this.limit_ && cmp(next, endPost) <= 0;\n                    if (inRange) {\n                        count++;\n                    }\n                    else {\n                        filtered = filtered.updateImmediateChild(next.name, ChildrenNode_1.ChildrenNode.EMPTY_NODE);\n                    }\n                }\n            }\n        }\n        return this.rangedFilter_\n            .getIndexedFilter()\n            .updateFullNode(oldSnap, filtered, optChangeAccumulator);\n    };\n    /**\n     * @inheritDoc\n     */\n    LimitedFilter.prototype.updatePriority = function (oldSnap, newPriority) {\n        // Don't support priorities on queries\n        return oldSnap;\n    };\n    /**\n     * @inheritDoc\n     */\n    LimitedFilter.prototype.filtersNodes = function () {\n        return true;\n    };\n    /**\n     * @inheritDoc\n     */\n    LimitedFilter.prototype.getIndexedFilter = function () {\n        return this.rangedFilter_.getIndexedFilter();\n    };\n    /**\n     * @inheritDoc\n     */\n    LimitedFilter.prototype.getIndex = function () {\n        return this.index_;\n    };\n    /**\n     * @param {!Node} snap\n     * @param {string} childKey\n     * @param {!Node} childSnap\n     * @param {!CompleteChildSource} source\n     * @param {?ChildChangeAccumulator} changeAccumulator\n     * @return {!Node}\n     * @private\n     */\n    LimitedFilter.prototype.fullLimitUpdateChild_ = function (snap, childKey, childSnap, source, changeAccumulator) {\n        // TODO: rename all cache stuff etc to general snap terminology\n        var cmp;\n        if (this.reverse_) {\n            var indexCmp_1 = this.index_.getCompare();\n            cmp = function (a, b) { return indexCmp_1(b, a); };\n        }\n        else {\n            cmp = this.index_.getCompare();\n        }\n        var oldEventCache = snap;\n        util_1.assert(oldEventCache.numChildren() == this.limit_, '');\n        var newChildNamedNode = new Node_1.NamedNode(childKey, childSnap);\n        var windowBoundary = this.reverse_\n            ? oldEventCache.getFirstChild(this.index_)\n            : oldEventCache.getLastChild(this.index_);\n        var inRange = this.rangedFilter_.matches(newChildNamedNode);\n        if (oldEventCache.hasChild(childKey)) {\n            var oldChildSnap = oldEventCache.getImmediateChild(childKey);\n            var nextChild = source.getChildAfterChild(this.index_, windowBoundary, this.reverse_);\n            while (nextChild != null &&\n                (nextChild.name == childKey || oldEventCache.hasChild(nextChild.name))) {\n                // There is a weird edge case where a node is updated as part of a merge in the write tree, but hasn't\n                // been applied to the limited filter yet. Ignore this next child which will be updated later in\n                // the limited filter...\n                nextChild = source.getChildAfterChild(this.index_, nextChild, this.reverse_);\n            }\n            var compareNext = nextChild == null ? 1 : cmp(nextChild, newChildNamedNode);\n            var remainsInWindow = inRange && !childSnap.isEmpty() && compareNext >= 0;\n            if (remainsInWindow) {\n                if (changeAccumulator != null) {\n                    changeAccumulator.trackChildChange(Change_1.Change.childChangedChange(childKey, childSnap, oldChildSnap));\n                }\n                return oldEventCache.updateImmediateChild(childKey, childSnap);\n            }\n            else {\n                if (changeAccumulator != null) {\n                    changeAccumulator.trackChildChange(Change_1.Change.childRemovedChange(childKey, oldChildSnap));\n                }\n                var newEventCache = oldEventCache.updateImmediateChild(childKey, ChildrenNode_1.ChildrenNode.EMPTY_NODE);\n                var nextChildInRange = nextChild != null && this.rangedFilter_.matches(nextChild);\n                if (nextChildInRange) {\n                    if (changeAccumulator != null) {\n                        changeAccumulator.trackChildChange(Change_1.Change.childAddedChange(nextChild.name, nextChild.node));\n                    }\n                    return newEventCache.updateImmediateChild(nextChild.name, nextChild.node);\n                }\n                else {\n                    return newEventCache;\n                }\n            }\n        }\n        else if (childSnap.isEmpty()) {\n            // we're deleting a node, but it was not in the window, so ignore it\n            return snap;\n        }\n        else if (inRange) {\n            if (cmp(windowBoundary, newChildNamedNode) >= 0) {\n                if (changeAccumulator != null) {\n                    changeAccumulator.trackChildChange(Change_1.Change.childRemovedChange(windowBoundary.name, windowBoundary.node));\n                    changeAccumulator.trackChildChange(Change_1.Change.childAddedChange(childKey, childSnap));\n                }\n                return oldEventCache\n                    .updateImmediateChild(childKey, childSnap)\n                    .updateImmediateChild(windowBoundary.name, ChildrenNode_1.ChildrenNode.EMPTY_NODE);\n            }\n            else {\n                return snap;\n            }\n        }\n        else {\n            return snap;\n        }\n    };\n    return LimitedFilter;\n}());\nexports.LimitedFilter = LimitedFilter;\n\n//# sourceMappingURL=LimitedFilter.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/view/filter/LimitedFilter.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = require(\"@firebase/util\");\nvar Reference_1 = require(\"../api/Reference\");\nvar DataSnapshot_1 = require(\"../api/DataSnapshot\");\nvar Path_1 = require(\"./util/Path\");\nvar Tree_1 = require(\"./util/Tree\");\nvar PriorityIndex_1 = require(\"./snap/indexes/PriorityIndex\");\nvar util_2 = require(\"./util/util\");\nvar ServerValues_1 = require(\"./util/ServerValues\");\nvar validation_1 = require(\"./util/validation\");\nvar util_3 = require(\"@firebase/util\");\nvar nodeFromJSON_1 = require(\"./snap/nodeFromJSON\");\nvar ChildrenNode_1 = require(\"./snap/ChildrenNode\");\nvar Repo_1 = require(\"./Repo\");\n// TODO: This is pretty messy.  Ideally, a lot of this would move into FirebaseData, or a transaction-specific\n// component used by FirebaseData, but it has ties to user callbacks (transaction update and onComplete) as well\n// as the realtime connection (to send transactions to the server).  So that all needs to be decoupled first.\n// For now it's part of Repo, but in its own file.\n/**\n * @enum {number}\n */\nvar TransactionStatus;\n(function (TransactionStatus) {\n    // We've run the transaction and updated transactionResultData_ with the result, but it isn't currently sent to the\n    // server. A transaction will go from RUN -> SENT -> RUN if it comes back from the server as rejected due to\n    // mismatched hash.\n    TransactionStatus[TransactionStatus[\"RUN\"] = 0] = \"RUN\";\n    // We've run the transaction and sent it to the server and it's currently outstanding (hasn't come back as accepted\n    // or rejected yet).\n    TransactionStatus[TransactionStatus[\"SENT\"] = 1] = \"SENT\";\n    // Temporary state used to mark completed transactions (whether successful or aborted).  The transaction will be\n    // removed when we get a chance to prune completed ones.\n    TransactionStatus[TransactionStatus[\"COMPLETED\"] = 2] = \"COMPLETED\";\n    // Used when an already-sent transaction needs to be aborted (e.g. due to a conflicting set() call that was made).\n    // If it comes back as unsuccessful, we'll abort it.\n    TransactionStatus[TransactionStatus[\"SENT_NEEDS_ABORT\"] = 3] = \"SENT_NEEDS_ABORT\";\n    // Temporary state used to mark transactions that need to be aborted.\n    TransactionStatus[TransactionStatus[\"NEEDS_ABORT\"] = 4] = \"NEEDS_ABORT\";\n})(TransactionStatus = exports.TransactionStatus || (exports.TransactionStatus = {}));\n/**\n * If a transaction does not succeed after 25 retries, we abort it.  Among other things this ensure that if there's\n * ever a bug causing a mismatch between client / server hashes for some data, we won't retry indefinitely.\n * @type {number}\n * @const\n * @private\n */\nRepo_1.Repo.MAX_TRANSACTION_RETRIES_ = 25;\n/**\n * Setup the transaction data structures\n * @private\n */\nRepo_1.Repo.prototype.transactions_init_ = function () {\n    /**\n     * Stores queues of outstanding transactions for Firebase locations.\n     *\n     * @type {!Tree.<Array.<!Transaction>>}\n     * @private\n     */\n    this.transactionQueueTree_ = new Tree_1.Tree();\n};\n/**\n * Creates a new transaction, adds it to the transactions we're tracking, and sends it to the server if possible.\n *\n * @param {!Path} path Path at which to do transaction.\n * @param {function(*):*} transactionUpdate Update callback.\n * @param {?function(?Error, boolean, ?DataSnapshot)} onComplete Completion callback.\n * @param {boolean} applyLocally Whether or not to make intermediate results visible\n */\nRepo_1.Repo.prototype.startTransaction = function (path, transactionUpdate, onComplete, applyLocally) {\n    this.log_('transaction on ' + path);\n    // Add a watch to make sure we get server updates.\n    var valueCallback = function () { };\n    var watchRef = new Reference_1.Reference(this, path);\n    watchRef.on('value', valueCallback);\n    var unwatcher = function () {\n        watchRef.off('value', valueCallback);\n    };\n    // Initialize transaction.\n    var transaction = {\n        path: path,\n        update: transactionUpdate,\n        onComplete: onComplete,\n        // One of TransactionStatus enums.\n        status: null,\n        // Used when combining transactions at different locations to figure out which one goes first.\n        order: util_2.LUIDGenerator(),\n        // Whether to raise local events for this transaction.\n        applyLocally: applyLocally,\n        // Count of how many times we've retried the transaction.\n        retryCount: 0,\n        // Function to call to clean up our .on() listener.\n        unwatcher: unwatcher,\n        // Stores why a transaction was aborted.\n        abortReason: null,\n        currentWriteId: null,\n        currentInputSnapshot: null,\n        currentOutputSnapshotRaw: null,\n        currentOutputSnapshotResolved: null\n    };\n    // Run transaction initially.\n    var currentState = this.getLatestState_(path);\n    transaction.currentInputSnapshot = currentState;\n    var newVal = transaction.update(currentState.val());\n    if (newVal === undefined) {\n        // Abort transaction.\n        transaction.unwatcher();\n        transaction.currentOutputSnapshotRaw = null;\n        transaction.currentOutputSnapshotResolved = null;\n        if (transaction.onComplete) {\n            // We just set the input snapshot, so this cast should be safe\n            var snapshot = new DataSnapshot_1.DataSnapshot(transaction.currentInputSnapshot, new Reference_1.Reference(this, transaction.path), PriorityIndex_1.PRIORITY_INDEX);\n            transaction.onComplete(null, false, snapshot);\n        }\n    }\n    else {\n        validation_1.validateFirebaseData('transaction failed: Data returned ', newVal, transaction.path);\n        // Mark as run and add to our queue.\n        transaction.status = TransactionStatus.RUN;\n        var queueNode = this.transactionQueueTree_.subTree(path);\n        var nodeQueue = queueNode.getValue() || [];\n        nodeQueue.push(transaction);\n        queueNode.setValue(nodeQueue);\n        // Update visibleData and raise events\n        // Note: We intentionally raise events after updating all of our transaction state, since the user could\n        // start new transactions from the event callbacks.\n        var priorityForNode = void 0;\n        if (typeof newVal === 'object' &&\n            newVal !== null &&\n            util_3.contains(newVal, '.priority')) {\n            priorityForNode = util_3.safeGet(newVal, '.priority');\n            util_1.assert(validation_1.isValidPriority(priorityForNode), 'Invalid priority returned by transaction. ' +\n                'Priority must be a valid string, finite number, server value, or null.');\n        }\n        else {\n            var currentNode = this.serverSyncTree_.calcCompleteEventCache(path) ||\n                ChildrenNode_1.ChildrenNode.EMPTY_NODE;\n            priorityForNode = currentNode.getPriority().val();\n        }\n        priorityForNode /** @type {null|number|string} */ = priorityForNode;\n        var serverValues = this.generateServerValues();\n        var newNodeUnresolved = nodeFromJSON_1.nodeFromJSON(newVal, priorityForNode);\n        var newNode = ServerValues_1.resolveDeferredValueSnapshot(newNodeUnresolved, serverValues);\n        transaction.currentOutputSnapshotRaw = newNodeUnresolved;\n        transaction.currentOutputSnapshotResolved = newNode;\n        transaction.currentWriteId = this.getNextWriteId_();\n        var events = this.serverSyncTree_.applyUserOverwrite(path, newNode, transaction.currentWriteId, transaction.applyLocally);\n        this.eventQueue_.raiseEventsForChangedPath(path, events);\n        this.sendReadyTransactions_();\n    }\n};\n/**\n * @param {!Path} path\n * @param {Array.<number>=} excludeSets A specific set to exclude\n * @return {Node}\n * @private\n */\nRepo_1.Repo.prototype.getLatestState_ = function (path, excludeSets) {\n    return (this.serverSyncTree_.calcCompleteEventCache(path, excludeSets) ||\n        ChildrenNode_1.ChildrenNode.EMPTY_NODE);\n};\n/**\n * Sends any already-run transactions that aren't waiting for outstanding transactions to\n * complete.\n *\n * Externally it's called with no arguments, but it calls itself recursively with a particular\n * transactionQueueTree node to recurse through the tree.\n *\n * @param {Tree.<Array.<Transaction>>=} node  transactionQueueTree node to start at.\n * @private\n */\nRepo_1.Repo.prototype.sendReadyTransactions_ = function (node) {\n    var _this = this;\n    if (node === void 0) { node = this.transactionQueueTree_; }\n    // Before recursing, make sure any completed transactions are removed.\n    if (!node) {\n        this.pruneCompletedTransactionsBelowNode_(node);\n    }\n    if (node.getValue() !== null) {\n        var queue = this.buildTransactionQueue_(node);\n        util_1.assert(queue.length > 0, 'Sending zero length transaction queue');\n        var allRun = queue.every(function (transaction) { return transaction.status === TransactionStatus.RUN; });\n        // If they're all run (and not sent), we can send them.  Else, we must wait.\n        if (allRun) {\n            this.sendTransactionQueue_(node.path(), queue);\n        }\n    }\n    else if (node.hasChildren()) {\n        node.forEachChild(function (childNode) {\n            _this.sendReadyTransactions_(childNode);\n        });\n    }\n};\n/**\n * Given a list of run transactions, send them to the server and then handle the result (success or failure).\n *\n * @param {!Path} path The location of the queue.\n * @param {!Array.<Transaction>} queue Queue of transactions under the specified location.\n * @private\n */\nRepo_1.Repo.prototype.sendTransactionQueue_ = function (path, queue) {\n    var _this = this;\n    // Mark transactions as sent and increment retry count!\n    var setsToIgnore = queue.map(function (txn) {\n        return txn.currentWriteId;\n    });\n    var latestState = this.getLatestState_(path, setsToIgnore);\n    var snapToSend = latestState;\n    var latestHash = latestState.hash();\n    for (var i = 0; i < queue.length; i++) {\n        var txn = queue[i];\n        util_1.assert(txn.status === TransactionStatus.RUN, 'tryToSendTransactionQueue_: items in queue should all be run.');\n        txn.status = TransactionStatus.SENT;\n        txn.retryCount++;\n        var relativePath = Path_1.Path.relativePath(path, txn.path);\n        // If we've gotten to this point, the output snapshot must be defined.\n        snapToSend = snapToSend.updateChild(relativePath /**@type {!Node} */, txn.currentOutputSnapshotRaw);\n    }\n    var dataToSend = snapToSend.val(true);\n    var pathToSend = path;\n    // Send the put.\n    this.server_.put(pathToSend.toString(), dataToSend, function (status) {\n        _this.log_('transaction put response', {\n            path: pathToSend.toString(),\n            status: status\n        });\n        var events = [];\n        if (status === 'ok') {\n            // Queue up the callbacks and fire them after cleaning up all of our transaction state, since\n            // the callback could trigger more transactions or sets.\n            var callbacks = [];\n            for (var i = 0; i < queue.length; i++) {\n                queue[i].status = TransactionStatus.COMPLETED;\n                events = events.concat(_this.serverSyncTree_.ackUserWrite(queue[i].currentWriteId));\n                if (queue[i].onComplete) {\n                    // We never unset the output snapshot, and given that this transaction is complete, it should be set\n                    var node = queue[i].currentOutputSnapshotResolved;\n                    var ref = new Reference_1.Reference(_this, queue[i].path);\n                    var snapshot = new DataSnapshot_1.DataSnapshot(node, ref, PriorityIndex_1.PRIORITY_INDEX);\n                    callbacks.push(queue[i].onComplete.bind(null, null, true, snapshot));\n                }\n                queue[i].unwatcher();\n            }\n            // Now remove the completed transactions.\n            _this.pruneCompletedTransactionsBelowNode_(_this.transactionQueueTree_.subTree(path));\n            // There may be pending transactions that we can now send.\n            _this.sendReadyTransactions_();\n            _this.eventQueue_.raiseEventsForChangedPath(path, events);\n            // Finally, trigger onComplete callbacks.\n            for (var i = 0; i < callbacks.length; i++) {\n                util_2.exceptionGuard(callbacks[i]);\n            }\n        }\n        else {\n            // transactions are no longer sent.  Update their status appropriately.\n            if (status === 'datastale') {\n                for (var i = 0; i < queue.length; i++) {\n                    if (queue[i].status === TransactionStatus.SENT_NEEDS_ABORT)\n                        queue[i].status = TransactionStatus.NEEDS_ABORT;\n                    else\n                        queue[i].status = TransactionStatus.RUN;\n                }\n            }\n            else {\n                util_2.warn('transaction at ' + pathToSend.toString() + ' failed: ' + status);\n                for (var i = 0; i < queue.length; i++) {\n                    queue[i].status = TransactionStatus.NEEDS_ABORT;\n                    queue[i].abortReason = status;\n                }\n            }\n            _this.rerunTransactions_(path);\n        }\n    }, latestHash);\n};\n/**\n * Finds all transactions dependent on the data at changedPath and reruns them.\n *\n * Should be called any time cached data changes.\n *\n * Return the highest path that was affected by rerunning transactions.  This is the path at which events need to\n * be raised for.\n *\n * @param {!Path} changedPath The path in mergedData that changed.\n * @return {!Path} The rootmost path that was affected by rerunning transactions.\n * @private\n */\nRepo_1.Repo.prototype.rerunTransactions_ = function (changedPath) {\n    var rootMostTransactionNode = this.getAncestorTransactionNode_(changedPath);\n    var path = rootMostTransactionNode.path();\n    var queue = this.buildTransactionQueue_(rootMostTransactionNode);\n    this.rerunTransactionQueue_(queue, path);\n    return path;\n};\n/**\n * Does all the work of rerunning transactions (as well as cleans up aborted transactions and whatnot).\n *\n * @param {Array.<Transaction>} queue The queue of transactions to run.\n * @param {!Path} path The path the queue is for.\n * @private\n */\nRepo_1.Repo.prototype.rerunTransactionQueue_ = function (queue, path) {\n    if (queue.length === 0) {\n        return; // Nothing to do!\n    }\n    // Queue up the callbacks and fire them after cleaning up all of our transaction state, since\n    // the callback could trigger more transactions or sets.\n    var callbacks = [];\n    var events = [];\n    // Ignore all of the sets we're going to re-run.\n    var txnsToRerun = queue.filter(function (q) {\n        return q.status === TransactionStatus.RUN;\n    });\n    var setsToIgnore = txnsToRerun.map(function (q) {\n        return q.currentWriteId;\n    });\n    for (var i = 0; i < queue.length; i++) {\n        var transaction = queue[i];\n        var relativePath = Path_1.Path.relativePath(path, transaction.path);\n        var abortTransaction = false, abortReason = void 0;\n        util_1.assert(relativePath !== null, 'rerunTransactionsUnderNode_: relativePath should not be null.');\n        if (transaction.status === TransactionStatus.NEEDS_ABORT) {\n            abortTransaction = true;\n            abortReason = transaction.abortReason;\n            events = events.concat(this.serverSyncTree_.ackUserWrite(transaction.currentWriteId, true));\n        }\n        else if (transaction.status === TransactionStatus.RUN) {\n            if (transaction.retryCount >= Repo_1.Repo.MAX_TRANSACTION_RETRIES_) {\n                abortTransaction = true;\n                abortReason = 'maxretry';\n                events = events.concat(this.serverSyncTree_.ackUserWrite(transaction.currentWriteId, true));\n            }\n            else {\n                // This code reruns a transaction\n                var currentNode = this.getLatestState_(transaction.path, setsToIgnore);\n                transaction.currentInputSnapshot = currentNode;\n                var newData = queue[i].update(currentNode.val());\n                if (newData !== undefined) {\n                    validation_1.validateFirebaseData('transaction failed: Data returned ', newData, transaction.path);\n                    var newDataNode = nodeFromJSON_1.nodeFromJSON(newData);\n                    var hasExplicitPriority = typeof newData === 'object' &&\n                        newData != null &&\n                        util_3.contains(newData, '.priority');\n                    if (!hasExplicitPriority) {\n                        // Keep the old priority if there wasn't a priority explicitly specified.\n                        newDataNode = newDataNode.updatePriority(currentNode.getPriority());\n                    }\n                    var oldWriteId = transaction.currentWriteId;\n                    var serverValues = this.generateServerValues();\n                    var newNodeResolved = ServerValues_1.resolveDeferredValueSnapshot(newDataNode, serverValues);\n                    transaction.currentOutputSnapshotRaw = newDataNode;\n                    transaction.currentOutputSnapshotResolved = newNodeResolved;\n                    transaction.currentWriteId = this.getNextWriteId_();\n                    // Mutates setsToIgnore in place\n                    setsToIgnore.splice(setsToIgnore.indexOf(oldWriteId), 1);\n                    events = events.concat(this.serverSyncTree_.applyUserOverwrite(transaction.path, newNodeResolved, transaction.currentWriteId, transaction.applyLocally));\n                    events = events.concat(this.serverSyncTree_.ackUserWrite(oldWriteId, true));\n                }\n                else {\n                    abortTransaction = true;\n                    abortReason = 'nodata';\n                    events = events.concat(this.serverSyncTree_.ackUserWrite(transaction.currentWriteId, true));\n                }\n            }\n        }\n        this.eventQueue_.raiseEventsForChangedPath(path, events);\n        events = [];\n        if (abortTransaction) {\n            // Abort.\n            queue[i].status = TransactionStatus.COMPLETED;\n            // Removing a listener can trigger pruning which can muck with mergedData/visibleData (as it prunes data).\n            // So defer the unwatcher until we're done.\n            (function (unwatcher) {\n                setTimeout(unwatcher, Math.floor(0));\n            })(queue[i].unwatcher);\n            if (queue[i].onComplete) {\n                if (abortReason === 'nodata') {\n                    var ref = new Reference_1.Reference(this, queue[i].path);\n                    // We set this field immediately, so it's safe to cast to an actual snapshot\n                    var lastInput /** @type {!Node} */ = queue[i].currentInputSnapshot;\n                    var snapshot = new DataSnapshot_1.DataSnapshot(lastInput, ref, PriorityIndex_1.PRIORITY_INDEX);\n                    callbacks.push(queue[i].onComplete.bind(null, null, false, snapshot));\n                }\n                else {\n                    callbacks.push(queue[i].onComplete.bind(null, new Error(abortReason), false, null));\n                }\n            }\n        }\n    }\n    // Clean up completed transactions.\n    this.pruneCompletedTransactionsBelowNode_(this.transactionQueueTree_);\n    // Now fire callbacks, now that we're in a good, known state.\n    for (var i = 0; i < callbacks.length; i++) {\n        util_2.exceptionGuard(callbacks[i]);\n    }\n    // Try to send the transaction result to the server.\n    this.sendReadyTransactions_();\n};\n/**\n * Returns the rootmost ancestor node of the specified path that has a pending transaction on it, or just returns\n * the node for the given path if there are no pending transactions on any ancestor.\n *\n * @param {!Path} path The location to start at.\n * @return {!Tree.<Array.<!Transaction>>} The rootmost node with a transaction.\n * @private\n */\nRepo_1.Repo.prototype.getAncestorTransactionNode_ = function (path) {\n    var front;\n    // Start at the root and walk deeper into the tree towards path until we find a node with pending transactions.\n    var transactionNode = this.transactionQueueTree_;\n    while ((front = path.getFront()) !== null &&\n        transactionNode.getValue() === null) {\n        transactionNode = transactionNode.subTree(front);\n        path = path.popFront();\n    }\n    return transactionNode;\n};\n/**\n * Builds the queue of all transactions at or below the specified transactionNode.\n *\n * @param {!Tree.<Array.<Transaction>>} transactionNode\n * @return {Array.<Transaction>} The generated queue.\n * @private\n */\nRepo_1.Repo.prototype.buildTransactionQueue_ = function (transactionNode) {\n    // Walk any child transaction queues and aggregate them into a single queue.\n    var transactionQueue = [];\n    this.aggregateTransactionQueuesForNode_(transactionNode, transactionQueue);\n    // Sort them by the order the transactions were created.\n    transactionQueue.sort(function (a, b) {\n        return a.order - b.order;\n    });\n    return transactionQueue;\n};\n/**\n * @param {!Tree.<Array.<Transaction>>} node\n * @param {Array.<Transaction>} queue\n * @private\n */\nRepo_1.Repo.prototype.aggregateTransactionQueuesForNode_ = function (node, queue) {\n    var _this = this;\n    var nodeQueue = node.getValue();\n    if (nodeQueue !== null) {\n        for (var i = 0; i < nodeQueue.length; i++) {\n            queue.push(nodeQueue[i]);\n        }\n    }\n    node.forEachChild(function (child) {\n        _this.aggregateTransactionQueuesForNode_(child, queue);\n    });\n};\n/**\n * Remove COMPLETED transactions at or below this node in the transactionQueueTree_.\n *\n * @param {!Tree.<Array.<!Transaction>>} node\n * @private\n */\nRepo_1.Repo.prototype.pruneCompletedTransactionsBelowNode_ = function (node) {\n    var _this = this;\n    var queue = node.getValue();\n    if (queue) {\n        var to = 0;\n        for (var from = 0; from < queue.length; from++) {\n            if (queue[from].status !== TransactionStatus.COMPLETED) {\n                queue[to] = queue[from];\n                to++;\n            }\n        }\n        queue.length = to;\n        node.setValue(queue.length > 0 ? queue : null);\n    }\n    node.forEachChild(function (childNode) {\n        _this.pruneCompletedTransactionsBelowNode_(childNode);\n    });\n};\n/**\n * Aborts all transactions on ancestors or descendants of the specified path.  Called when doing a set() or update()\n * since we consider them incompatible with transactions.\n *\n * @param {!Path} path Path for which we want to abort related transactions.\n * @return {!Path}\n * @private\n */\nRepo_1.Repo.prototype.abortTransactions_ = function (path) {\n    var _this = this;\n    var affectedPath = this.getAncestorTransactionNode_(path).path();\n    var transactionNode = this.transactionQueueTree_.subTree(path);\n    transactionNode.forEachAncestor(function (node) {\n        _this.abortTransactionsOnNode_(node);\n    });\n    this.abortTransactionsOnNode_(transactionNode);\n    transactionNode.forEachDescendant(function (node) {\n        _this.abortTransactionsOnNode_(node);\n    });\n    return affectedPath;\n};\n/**\n * Abort transactions stored in this transaction queue node.\n *\n * @param {!Tree.<Array.<Transaction>>} node Node to abort transactions for.\n * @private\n */\nRepo_1.Repo.prototype.abortTransactionsOnNode_ = function (node) {\n    var queue = node.getValue();\n    if (queue !== null) {\n        // Queue up the callbacks and fire them after cleaning up all of our transaction state, since\n        // the callback could trigger more transactions or sets.\n        var callbacks = [];\n        // Go through queue.  Any already-sent transactions must be marked for abort, while the unsent ones\n        // can be immediately aborted and removed.\n        var events = [];\n        var lastSent = -1;\n        for (var i = 0; i < queue.length; i++) {\n            if (queue[i].status === TransactionStatus.SENT_NEEDS_ABORT) {\n                // Already marked.  No action needed.\n            }\n            else if (queue[i].status === TransactionStatus.SENT) {\n                util_1.assert(lastSent === i - 1, 'All SENT items should be at beginning of queue.');\n                lastSent = i;\n                // Mark transaction for abort when it comes back.\n                queue[i].status = TransactionStatus.SENT_NEEDS_ABORT;\n                queue[i].abortReason = 'set';\n            }\n            else {\n                util_1.assert(queue[i].status === TransactionStatus.RUN, 'Unexpected transaction status in abort');\n                // We can abort it immediately.\n                queue[i].unwatcher();\n                events = events.concat(this.serverSyncTree_.ackUserWrite(queue[i].currentWriteId, true));\n                if (queue[i].onComplete) {\n                    var snapshot = null;\n                    callbacks.push(queue[i].onComplete.bind(null, new Error('set'), false, snapshot));\n                }\n            }\n        }\n        if (lastSent === -1) {\n            // We're not waiting for any sent transactions.  We can clear the queue.\n            node.setValue(null);\n        }\n        else {\n            // Remove the transactions we aborted.\n            queue.length = lastSent + 1;\n        }\n        // Now fire the callbacks.\n        this.eventQueue_.raiseEventsForChangedPath(node.path(), events);\n        for (var i = 0; i < callbacks.length; i++) {\n            util_2.exceptionGuard(callbacks[i]);\n        }\n    }\n};\n\n//# sourceMappingURL=Repo_transaction.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/Repo_transaction.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar util_1 = require(\"@firebase/util\");\nvar Path_1 = require(\"./Path\");\nvar util_2 = require(\"@firebase/util\");\n/**\n * Node in a Tree.\n */\nvar TreeNode = /** @class */ (function () {\n    function TreeNode() {\n        // TODO: Consider making accessors that create children and value lazily or\n        // separate Internal / Leaf 'types'.\n        this.children = {};\n        this.childCount = 0;\n        this.value = null;\n    }\n    return TreeNode;\n}());\nexports.TreeNode = TreeNode;\n/**\n * A light-weight tree, traversable by path.  Nodes can have both values and children.\n * Nodes are not enumerated (by forEachChild) unless they have a value or non-empty\n * children.\n */\nvar Tree = /** @class */ (function () {\n    /**\n     * @template T\n     * @param {string=} name_ Optional name of the node.\n     * @param {Tree=} parent_ Optional parent node.\n     * @param {TreeNode=} node_ Optional node to wrap.\n     */\n    function Tree(name_, parent_, node_) {\n        if (name_ === void 0) { name_ = ''; }\n        if (parent_ === void 0) { parent_ = null; }\n        if (node_ === void 0) { node_ = new TreeNode(); }\n        this.name_ = name_;\n        this.parent_ = parent_;\n        this.node_ = node_;\n    }\n    /**\n     * Returns a sub-Tree for the given path.\n     *\n     * @param {!(string|Path)} pathObj Path to look up.\n     * @return {!Tree.<T>} Tree for path.\n     */\n    Tree.prototype.subTree = function (pathObj) {\n        // TODO: Require pathObj to be Path?\n        var path = pathObj instanceof Path_1.Path ? pathObj : new Path_1.Path(pathObj);\n        var child = this, next;\n        while ((next = path.getFront()) !== null) {\n            var childNode = util_2.safeGet(child.node_.children, next) || new TreeNode();\n            child = new Tree(next, child, childNode);\n            path = path.popFront();\n        }\n        return child;\n    };\n    /**\n     * Returns the data associated with this tree node.\n     *\n     * @return {?T} The data or null if no data exists.\n     */\n    Tree.prototype.getValue = function () {\n        return this.node_.value;\n    };\n    /**\n     * Sets data to this tree node.\n     *\n     * @param {!T} value Value to set.\n     */\n    Tree.prototype.setValue = function (value) {\n        util_1.assert(typeof value !== 'undefined', 'Cannot set value to undefined');\n        this.node_.value = value;\n        this.updateParents_();\n    };\n    /**\n     * Clears the contents of the tree node (its value and all children).\n     */\n    Tree.prototype.clear = function () {\n        this.node_.value = null;\n        this.node_.children = {};\n        this.node_.childCount = 0;\n        this.updateParents_();\n    };\n    /**\n     * @return {boolean} Whether the tree has any children.\n     */\n    Tree.prototype.hasChildren = function () {\n        return this.node_.childCount > 0;\n    };\n    /**\n     * @return {boolean} Whether the tree is empty (no value or children).\n     */\n    Tree.prototype.isEmpty = function () {\n        return this.getValue() === null && !this.hasChildren();\n    };\n    /**\n     * Calls action for each child of this tree node.\n     *\n     * @param {function(!Tree.<T>)} action Action to be called for each child.\n     */\n    Tree.prototype.forEachChild = function (action) {\n        var _this = this;\n        util_2.forEach(this.node_.children, function (child, childTree) {\n            action(new Tree(child, _this, childTree));\n        });\n    };\n    /**\n     * Does a depth-first traversal of this node's descendants, calling action for each one.\n     *\n     * @param {function(!Tree.<T>)} action Action to be called for each child.\n     * @param {boolean=} includeSelf Whether to call action on this node as well. Defaults to\n     *   false.\n     * @param {boolean=} childrenFirst Whether to call action on children before calling it on\n     *   parent.\n     */\n    Tree.prototype.forEachDescendant = function (action, includeSelf, childrenFirst) {\n        if (includeSelf && !childrenFirst)\n            action(this);\n        this.forEachChild(function (child) {\n            child.forEachDescendant(action, /*includeSelf=*/ true, childrenFirst);\n        });\n        if (includeSelf && childrenFirst)\n            action(this);\n    };\n    /**\n     * Calls action on each ancestor node.\n     *\n     * @param {function(!Tree.<T>)} action Action to be called on each parent; return\n     *   true to abort.\n     * @param {boolean=} includeSelf Whether to call action on this node as well.\n     * @return {boolean} true if the action callback returned true.\n     */\n    Tree.prototype.forEachAncestor = function (action, includeSelf) {\n        var node = includeSelf ? this : this.parent();\n        while (node !== null) {\n            if (action(node)) {\n                return true;\n            }\n            node = node.parent();\n        }\n        return false;\n    };\n    /**\n     * Does a depth-first traversal of this node's descendants.  When a descendant with a value\n     * is found, action is called on it and traversal does not continue inside the node.\n     * Action is *not* called on this node.\n     *\n     * @param {function(!Tree.<T>)} action Action to be called for each child.\n     */\n    Tree.prototype.forEachImmediateDescendantWithValue = function (action) {\n        this.forEachChild(function (child) {\n            if (child.getValue() !== null)\n                action(child);\n            else\n                child.forEachImmediateDescendantWithValue(action);\n        });\n    };\n    /**\n     * @return {!Path} The path of this tree node, as a Path.\n     */\n    Tree.prototype.path = function () {\n        return new Path_1.Path(this.parent_ === null\n            ? this.name_\n            : this.parent_.path() + '/' + this.name_);\n    };\n    /**\n     * @return {string} The name of the tree node.\n     */\n    Tree.prototype.name = function () {\n        return this.name_;\n    };\n    /**\n     * @return {?Tree} The parent tree node, or null if this is the root of the tree.\n     */\n    Tree.prototype.parent = function () {\n        return this.parent_;\n    };\n    /**\n     * Adds or removes this child from its parent based on whether it's empty or not.\n     *\n     * @private\n     */\n    Tree.prototype.updateParents_ = function () {\n        if (this.parent_ !== null)\n            this.parent_.updateChild_(this.name_, this);\n    };\n    /**\n     * Adds or removes the passed child to this tree node, depending on whether it's empty.\n     *\n     * @param {string} childName The name of the child to update.\n     * @param {!Tree.<T>} child The child to update.\n     * @private\n     */\n    Tree.prototype.updateChild_ = function (childName, child) {\n        var childEmpty = child.isEmpty();\n        var childExists = util_2.contains(this.node_.children, childName);\n        if (childEmpty && childExists) {\n            delete this.node_.children[childName];\n            this.node_.childCount--;\n            this.updateParents_();\n        }\n        else if (!childEmpty && !childExists) {\n            this.node_.children[childName] = child.node_;\n            this.node_.childCount++;\n            this.updateParents_();\n        }\n    };\n    return Tree;\n}());\nexports.Tree = Tree;\n\n//# sourceMappingURL=Tree.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/core/util/Tree.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar WebSocketConnection_1 = require(\"../realtime/WebSocketConnection\");\nvar BrowserPollConnection_1 = require(\"../realtime/BrowserPollConnection\");\n/**\n * INTERNAL methods for internal-use only (tests, etc.).\n *\n * Customers shouldn't use these or else should be aware that they could break at any time.\n *\n * @const\n */\nexports.forceLongPolling = function () {\n    WebSocketConnection_1.WebSocketConnection.forceDisallow();\n    BrowserPollConnection_1.BrowserPollConnection.forceAllow();\n};\nexports.forceWebSockets = function () {\n    BrowserPollConnection_1.BrowserPollConnection.forceDisallow();\n};\n/* Used by App Manager */\nexports.isWebSocketsAvailable = function () {\n    return WebSocketConnection_1.WebSocketConnection['isAvailable']();\n};\nexports.setSecurityDebugCallback = function (ref, callback) {\n    ref.repo.persistentConnection_.securityDebugCallback_ = callback;\n};\nexports.stats = function (ref, showDelta) {\n    ref.repo.stats(showDelta);\n};\nexports.statsIncrementCounter = function (ref, metric) {\n    ref.repo.statsIncrementCounter(metric);\n};\nexports.dataUpdateCount = function (ref) {\n    return ref.repo.dataUpdateCount;\n};\nexports.interceptServerData = function (ref, callback) {\n    return ref.repo.interceptServerData_(callback);\n};\n\n//# sourceMappingURL=internal.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/api/internal.js","\"use strict\";\n/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar RepoInfo_1 = require(\"../core/RepoInfo\");\nvar PersistentConnection_1 = require(\"../core/PersistentConnection\");\nvar RepoManager_1 = require(\"../core/RepoManager\");\nvar Connection_1 = require(\"../realtime/Connection\");\nexports.DataConnection = PersistentConnection_1.PersistentConnection;\n/**\n * @param {!string} pathString\n * @param {function(*)} onComplete\n */\nPersistentConnection_1.PersistentConnection.prototype.simpleListen = function (pathString, onComplete) {\n    this.sendRequest('q', { p: pathString }, onComplete);\n};\n/**\n * @param {*} data\n * @param {function(*)} onEcho\n */\nPersistentConnection_1.PersistentConnection.prototype.echo = function (data, onEcho) {\n    this.sendRequest('echo', { d: data }, onEcho);\n};\n// RealTimeConnection properties that we use in tests.\nexports.RealTimeConnection = Connection_1.Connection;\n/**\n * @param {function(): string} newHash\n * @return {function()}\n */\nexports.hijackHash = function (newHash) {\n    var oldPut = PersistentConnection_1.PersistentConnection.prototype.put;\n    PersistentConnection_1.PersistentConnection.prototype.put = function (pathString, data, opt_onComplete, opt_hash) {\n        if (opt_hash !== undefined) {\n            opt_hash = newHash();\n        }\n        oldPut.call(this, pathString, data, opt_onComplete, opt_hash);\n    };\n    return function () {\n        PersistentConnection_1.PersistentConnection.prototype.put = oldPut;\n    };\n};\n/**\n * @type {function(new:RepoInfo, !string, boolean, !string, boolean): undefined}\n */\nexports.ConnectionTarget = RepoInfo_1.RepoInfo;\n/**\n * @param {!Query} query\n * @return {!string}\n */\nexports.queryIdentifier = function (query) {\n    return query.queryIdentifier();\n};\n/**\n * @param {!Query} firebaseRef\n * @return {!Object}\n */\nexports.listens = function (firebaseRef) {\n    return firebaseRef.repo.persistentConnection_.listens_;\n};\n/**\n * Forces the RepoManager to create Repos that use ReadonlyRestClient instead of PersistentConnection.\n *\n * @param {boolean} forceRestClient\n */\nexports.forceRestClient = function (forceRestClient) {\n    RepoManager_1.RepoManager.getInstance().forceRestClient(forceRestClient);\n};\n\n//# sourceMappingURL=test_access.js.map\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/database/dist/cjs/src/api/test_access.js","/**\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nrequire('@firebase/auth');\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/firebase/auth/index.js","(function() {\n  var firebase = require('@firebase/app').default;\n  var h,aa=aa||{},k=this;function m(a){return\"string\"==typeof a}function ba(a){return\"boolean\"==typeof a}function ca(){}\nfunction da(a){var b=typeof a;if(\"object\"==b)if(a){if(a instanceof Array)return\"array\";if(a instanceof Object)return b;var c=Object.prototype.toString.call(a);if(\"[object Window]\"==c)return\"object\";if(\"[object Array]\"==c||\"number\"==typeof a.length&&\"undefined\"!=typeof a.splice&&\"undefined\"!=typeof a.propertyIsEnumerable&&!a.propertyIsEnumerable(\"splice\"))return\"array\";if(\"[object Function]\"==c||\"undefined\"!=typeof a.call&&\"undefined\"!=typeof a.propertyIsEnumerable&&!a.propertyIsEnumerable(\"call\"))return\"function\"}else return\"null\";\nelse if(\"function\"==b&&\"undefined\"==typeof a.call)return\"object\";return b}function ea(a){return null===a}function fa(a){return\"array\"==da(a)}function ha(a){var b=da(a);return\"array\"==b||\"object\"==b&&\"number\"==typeof a.length}function p(a){return\"function\"==da(a)}function q(a){var b=typeof a;return\"object\"==b&&null!=a||\"function\"==b}var ia=\"closure_uid_\"+(1E9*Math.random()>>>0),ja=0;function ka(a,b,c){return a.call.apply(a.bind,arguments)}\nfunction la(a,b,c){if(!a)throw Error();if(2<arguments.length){var d=Array.prototype.slice.call(arguments,2);return function(){var c=Array.prototype.slice.call(arguments);Array.prototype.unshift.apply(c,d);return a.apply(b,c)}}return function(){return a.apply(b,arguments)}}function r(a,b,c){Function.prototype.bind&&-1!=Function.prototype.bind.toString().indexOf(\"native code\")?r=ka:r=la;return r.apply(null,arguments)}\nfunction ma(a,b){var c=Array.prototype.slice.call(arguments,1);return function(){var b=c.slice();b.push.apply(b,arguments);return a.apply(this,b)}}var na=Date.now||function(){return+new Date};function t(a,b){function c(){}c.prototype=b.prototype;a.ib=b.prototype;a.prototype=new c;a.prototype.constructor=a;a.Nc=function(a,c,f){for(var d=Array(arguments.length-2),e=2;e<arguments.length;e++)d[e-2]=arguments[e];return b.prototype[c].apply(a,d)}};function u(a){if(Error.captureStackTrace)Error.captureStackTrace(this,u);else{var b=Error().stack;b&&(this.stack=b)}a&&(this.message=String(a))}t(u,Error);u.prototype.name=\"CustomError\";function oa(a,b){for(var c=a.split(\"%s\"),d=\"\",e=Array.prototype.slice.call(arguments,1);e.length&&1<c.length;)d+=c.shift()+e.shift();return d+c.join(\"%s\")}var pa=String.prototype.trim?function(a){return a.trim()}:function(a){return a.replace(/^[\\s\\xa0]+|[\\s\\xa0]+$/g,\"\")};\nfunction qa(a){if(!ra.test(a))return a;-1!=a.indexOf(\"&\")&&(a=a.replace(sa,\"&amp;\"));-1!=a.indexOf(\"<\")&&(a=a.replace(ta,\"&lt;\"));-1!=a.indexOf(\">\")&&(a=a.replace(ua,\"&gt;\"));-1!=a.indexOf('\"')&&(a=a.replace(va,\"&quot;\"));-1!=a.indexOf(\"'\")&&(a=a.replace(wa,\"&#39;\"));-1!=a.indexOf(\"\\x00\")&&(a=a.replace(xa,\"&#0;\"));return a}var sa=/&/g,ta=/</g,ua=/>/g,va=/\"/g,wa=/'/g,xa=/\\x00/g,ra=/[\\x00&<>\"']/;function v(a,b){return-1!=a.indexOf(b)}function ya(a,b){return a<b?-1:a>b?1:0};function za(a,b){b.unshift(a);u.call(this,oa.apply(null,b));b.shift()}t(za,u);za.prototype.name=\"AssertionError\";function Aa(a,b){throw new za(\"Failure\"+(a?\": \"+a:\"\"),Array.prototype.slice.call(arguments,1));};var Ba=Array.prototype.indexOf?function(a,b,c){return Array.prototype.indexOf.call(a,b,c)}:function(a,b,c){c=null==c?0:0>c?Math.max(0,a.length+c):c;if(m(a))return m(b)&&1==b.length?a.indexOf(b,c):-1;for(;c<a.length;c++)if(c in a&&a[c]===b)return c;return-1},w=Array.prototype.forEach?function(a,b,c){Array.prototype.forEach.call(a,b,c)}:function(a,b,c){for(var d=a.length,e=m(a)?a.split(\"\"):a,f=0;f<d;f++)f in e&&b.call(c,e[f],f,a)};\nfunction Ca(a,b){var c=a.length,d=m(a)?a.split(\"\"):a;for(--c;0<=c;--c)c in d&&b.call(void 0,d[c],c,a)}var Da=Array.prototype.map?function(a,b,c){return Array.prototype.map.call(a,b,c)}:function(a,b,c){for(var d=a.length,e=Array(d),f=m(a)?a.split(\"\"):a,g=0;g<d;g++)g in f&&(e[g]=b.call(c,f[g],g,a));return e},Ea=Array.prototype.some?function(a,b,c){return Array.prototype.some.call(a,b,c)}:function(a,b,c){for(var d=a.length,e=m(a)?a.split(\"\"):a,f=0;f<d;f++)if(f in e&&b.call(c,e[f],f,a))return!0;return!1};\nfunction Fa(a){a:{var b=Ga;for(var c=a.length,d=m(a)?a.split(\"\"):a,e=0;e<c;e++)if(e in d&&b.call(void 0,d[e],e,a)){b=e;break a}b=-1}return 0>b?null:m(a)?a.charAt(b):a[b]}function Ha(a,b){return 0<=Ba(a,b)}function Ia(a,b){b=Ba(a,b);var c;(c=0<=b)&&Array.prototype.splice.call(a,b,1);return c}function Ja(a,b){var c=0;Ca(a,function(d,e){b.call(void 0,d,e,a)&&1==Array.prototype.splice.call(a,e,1).length&&c++})}function Ka(a){return Array.prototype.concat.apply([],arguments)}\nfunction La(a){var b=a.length;if(0<b){for(var c=Array(b),d=0;d<b;d++)c[d]=a[d];return c}return[]};var Ma;a:{var Na=k.navigator;if(Na){var Oa=Na.userAgent;if(Oa){Ma=Oa;break a}}Ma=\"\"}function x(a){return v(Ma,a)};function Pa(a,b){for(var c in a)b.call(void 0,a[c],c,a)}function Qa(a){var b=[],c=0,d;for(d in a)b[c++]=a[d];return b}function Ra(a){var b=[],c=0,d;for(d in a)b[c++]=d;return b}function Sa(a){for(var b in a)return!1;return!0}function Ta(a,b){for(var c in a)if(!(c in b)||a[c]!==b[c])return!1;for(c in b)if(!(c in a))return!1;return!0}function Ua(a){var b={},c;for(c in a)b[c]=a[c];return b}var Va=\"constructor hasOwnProperty isPrototypeOf propertyIsEnumerable toLocaleString toString valueOf\".split(\" \");\nfunction Wa(a,b){for(var c,d,e=1;e<arguments.length;e++){d=arguments[e];for(c in d)a[c]=d[c];for(var f=0;f<Va.length;f++)c=Va[f],Object.prototype.hasOwnProperty.call(d,c)&&(a[c]=d[c])}};function Xa(a){Xa[\" \"](a);return a}Xa[\" \"]=ca;function Ya(a,b){var c=Za;return Object.prototype.hasOwnProperty.call(c,a)?c[a]:c[a]=b(a)};var $a=x(\"Opera\"),y=x(\"Trident\")||x(\"MSIE\"),ab=x(\"Edge\"),bb=ab||y,cb=x(\"Gecko\")&&!(v(Ma.toLowerCase(),\"webkit\")&&!x(\"Edge\"))&&!(x(\"Trident\")||x(\"MSIE\"))&&!x(\"Edge\"),db=v(Ma.toLowerCase(),\"webkit\")&&!x(\"Edge\");function eb(){var a=k.document;return a?a.documentMode:void 0}var fb;\na:{var gb=\"\",hb=function(){var a=Ma;if(cb)return/rv\\:([^\\);]+)(\\)|;)/.exec(a);if(ab)return/Edge\\/([\\d\\.]+)/.exec(a);if(y)return/\\b(?:MSIE|rv)[: ]([^\\);]+)(\\)|;)/.exec(a);if(db)return/WebKit\\/(\\S+)/.exec(a);if($a)return/(?:Version)[ \\/]?(\\S+)/.exec(a)}();hb&&(gb=hb?hb[1]:\"\");if(y){var ib=eb();if(null!=ib&&ib>parseFloat(gb)){fb=String(ib);break a}}fb=gb}var Za={};\nfunction jb(a){return Ya(a,function(){for(var b=0,c=pa(String(fb)).split(\".\"),d=pa(String(a)).split(\".\"),e=Math.max(c.length,d.length),f=0;0==b&&f<e;f++){var g=c[f]||\"\",l=d[f]||\"\";do{g=/(\\d*)(\\D*)(.*)/.exec(g)||[\"\",\"\",\"\",\"\"];l=/(\\d*)(\\D*)(.*)/.exec(l)||[\"\",\"\",\"\",\"\"];if(0==g[0].length&&0==l[0].length)break;b=ya(0==g[1].length?0:parseInt(g[1],10),0==l[1].length?0:parseInt(l[1],10))||ya(0==g[2].length,0==l[2].length)||ya(g[2],l[2]);g=g[3];l=l[3]}while(0==b)}return 0<=b})}var kb;var lb=k.document;\nkb=lb&&y?eb()||(\"CSS1Compat\"==lb.compatMode?parseInt(fb,10):5):void 0;function mb(a){a.prototype.then=a.prototype.then;a.prototype.$goog_Thenable=!0}function nb(a){if(!a)return!1;try{return!!a.$goog_Thenable}catch(b){return!1}};function ob(a,b,c){this.f=c;this.c=a;this.g=b;this.b=0;this.a=null}ob.prototype.get=function(){if(0<this.b){this.b--;var a=this.a;this.a=a.next;a.next=null}else a=this.c();return a};function pb(a,b){a.g(b);a.b<a.f&&(a.b++,b.next=a.a,a.a=b)};var rb=new ob(function(){return new qb},function(a){a.reset()},100);function sb(){var a=tb,b=null;a.a&&(b=a.a,a.a=a.a.next,a.a||(a.b=null),b.next=null);return b}function qb(){this.next=this.b=this.a=null}qb.prototype.set=function(a,b){this.a=a;this.b=b;this.next=null};qb.prototype.reset=function(){this.next=this.b=this.a=null};function ub(a){k.setTimeout(function(){throw a;},0)}var wb;\nfunction xb(){var a=k.MessageChannel;\"undefined\"===typeof a&&\"undefined\"!==typeof window&&window.postMessage&&window.addEventListener&&!x(\"Presto\")&&(a=function(){var a=document.createElement(\"IFRAME\");a.style.display=\"none\";a.src=\"\";document.documentElement.appendChild(a);var b=a.contentWindow;a=b.document;a.open();a.write(\"\");a.close();var c=\"callImmediate\"+Math.random(),d=\"file:\"==b.location.protocol?\"*\":b.location.protocol+\"//\"+b.location.host;a=r(function(a){if((\"*\"==d||a.origin==d)&&a.data==\nc)this.port1.onmessage()},this);b.addEventListener(\"message\",a,!1);this.port1={};this.port2={postMessage:function(){b.postMessage(c,d)}}});if(\"undefined\"!==typeof a&&!x(\"Trident\")&&!x(\"MSIE\")){var b=new a,c={},d=c;b.port1.onmessage=function(){if(void 0!==c.next){c=c.next;var a=c.pb;c.pb=null;a()}};return function(a){d.next={pb:a};d=d.next;b.port2.postMessage(0)}}return\"undefined\"!==typeof document&&\"onreadystatechange\"in document.createElement(\"SCRIPT\")?function(a){var b=document.createElement(\"SCRIPT\");\nb.onreadystatechange=function(){b.onreadystatechange=null;b.parentNode.removeChild(b);b=null;a();a=null};document.documentElement.appendChild(b)}:function(a){k.setTimeout(a,0)}};function yb(a,b){zb||Ab();Bb||(zb(),Bb=!0);var c=tb,d=rb.get();d.set(a,b);c.b?c.b.next=d:c.a=d;c.b=d}var zb;function Ab(){if(-1!=String(k.Promise).indexOf(\"[native code]\")){var a=k.Promise.resolve(void 0);zb=function(){a.then(Cb)}}else zb=function(){var a=Cb;!p(k.setImmediate)||k.Window&&k.Window.prototype&&!x(\"Edge\")&&k.Window.prototype.setImmediate==k.setImmediate?(wb||(wb=xb()),wb(a)):k.setImmediate(a)}}var Bb=!1,tb=new function(){this.b=this.a=null};\nfunction Cb(){for(var a;a=sb();){try{a.a.call(a.b)}catch(b){ub(b)}pb(rb,a)}Bb=!1};function z(a,b){this.a=Db;this.i=void 0;this.f=this.b=this.c=null;this.g=this.h=!1;if(a!=ca)try{var c=this;a.call(b,function(a){Eb(c,Fb,a)},function(a){if(!(a instanceof Gb))try{if(a instanceof Error)throw a;throw Error(\"Promise rejected.\");}catch(e){}Eb(c,Hb,a)})}catch(d){Eb(this,Hb,d)}}var Db=0,Fb=2,Hb=3;function Ib(){this.next=this.f=this.b=this.g=this.a=null;this.c=!1}Ib.prototype.reset=function(){this.f=this.b=this.g=this.a=null;this.c=!1};\nvar Jb=new ob(function(){return new Ib},function(a){a.reset()},100);function Kb(a,b,c){var d=Jb.get();d.g=a;d.b=b;d.f=c;return d}function A(a){if(a instanceof z)return a;var b=new z(ca);Eb(b,Fb,a);return b}function B(a){return new z(function(b,c){c(a)})}function Lb(a,b,c){Mb(a,b,c,null)||yb(ma(b,a))}function Nb(a){return new z(function(b,c){var d=a.length,e=[];if(d)for(var f=function(a,c){d--;e[a]=c;0==d&&b(e)},g=function(a){c(a)},l=0,n;l<a.length;l++)n=a[l],Lb(n,ma(f,l),g);else b(e)})}\nfunction Ob(a){return new z(function(b){var c=a.length,d=[];if(c)for(var e=function(a,e,f){c--;d[a]=e?{Qb:!0,value:f}:{Qb:!1,reason:f};0==c&&b(d)},f=0,g;f<a.length;f++)g=a[f],Lb(g,ma(e,f,!0),ma(e,f,!1));else b(d)})}z.prototype.then=function(a,b,c){return Pb(this,p(a)?a:null,p(b)?b:null,c)};mb(z);function Qb(a,b){b=Kb(b,b,void 0);b.c=!0;Rb(a,b);return a}h=z.prototype;h.s=function(a,b){return Pb(this,null,a,b)};h.cancel=function(a){this.a==Db&&yb(function(){var b=new Gb(a);Sb(this,b)},this)};\nfunction Sb(a,b){if(a.a==Db)if(a.c){var c=a.c;if(c.b){for(var d=0,e=null,f=null,g=c.b;g&&(g.c||(d++,g.a==a&&(e=g),!(e&&1<d)));g=g.next)e||(f=g);e&&(c.a==Db&&1==d?Sb(c,b):(f?(d=f,d.next==c.f&&(c.f=d),d.next=d.next.next):Tb(c),Ub(c,e,Hb,b)))}a.c=null}else Eb(a,Hb,b)}function Rb(a,b){a.b||a.a!=Fb&&a.a!=Hb||Vb(a);a.f?a.f.next=b:a.b=b;a.f=b}\nfunction Pb(a,b,c,d){var e=Kb(null,null,null);e.a=new z(function(a,g){e.g=b?function(c){try{var e=b.call(d,c);a(e)}catch(D){g(D)}}:a;e.b=c?function(b){try{var e=c.call(d,b);void 0===e&&b instanceof Gb?g(b):a(e)}catch(D){g(D)}}:g});e.a.c=a;Rb(a,e);return e.a}h.wc=function(a){this.a=Db;Eb(this,Fb,a)};h.xc=function(a){this.a=Db;Eb(this,Hb,a)};\nfunction Eb(a,b,c){a.a==Db&&(a===c&&(b=Hb,c=new TypeError(\"Promise cannot resolve to itself\")),a.a=1,Mb(c,a.wc,a.xc,a)||(a.i=c,a.a=b,a.c=null,Vb(a),b!=Hb||c instanceof Gb||Wb(a,c)))}function Mb(a,b,c,d){if(a instanceof z)return Rb(a,Kb(b||ca,c||null,d)),!0;if(nb(a))return a.then(b,c,d),!0;if(q(a))try{var e=a.then;if(p(e))return Xb(a,e,b,c,d),!0}catch(f){return c.call(d,f),!0}return!1}\nfunction Xb(a,b,c,d,e){function f(a){l||(l=!0,d.call(e,a))}function g(a){l||(l=!0,c.call(e,a))}var l=!1;try{b.call(a,g,f)}catch(n){f(n)}}function Vb(a){a.h||(a.h=!0,yb(a.Mb,a))}function Tb(a){var b=null;a.b&&(b=a.b,a.b=b.next,b.next=null);a.b||(a.f=null);return b}h.Mb=function(){for(var a;a=Tb(this);)Ub(this,a,this.a,this.i);this.h=!1};\nfunction Ub(a,b,c,d){if(c==Hb&&b.b&&!b.c)for(;a&&a.g;a=a.c)a.g=!1;if(b.a)b.a.c=null,Yb(b,c,d);else try{b.c?b.g.call(b.f):Yb(b,c,d)}catch(e){Zb.call(null,e)}pb(Jb,b)}function Yb(a,b,c){b==Fb?a.g.call(a.f,c):a.b&&a.b.call(a.f,c)}function Wb(a,b){a.g=!0;yb(function(){a.g&&Zb.call(null,b)})}var Zb=ub;function Gb(a){u.call(this,a)}t(Gb,u);Gb.prototype.name=\"cancel\";var $b=!y||9<=Number(kb);function ac(){this.a=\"\";this.b=bc}ac.prototype.la=!0;ac.prototype.ja=function(){return this.a};ac.prototype.toString=function(){return\"Const{\"+this.a+\"}\"};function cc(a){if(a instanceof ac&&a.constructor===ac&&a.b===bc)return a.a;Aa(\"expected object of type Const, got '\"+a+\"'\");return\"type_error:Const\"}var bc={};function dc(a){var b=new ac;b.a=a;return b}dc(\"\");function ec(){this.a=\"\";this.b=fc}ec.prototype.la=!0;ec.prototype.ja=function(){return this.a};ec.prototype.toString=function(){return\"TrustedResourceUrl{\"+this.a+\"}\"};function gc(a){if(a instanceof ec&&a.constructor===ec&&a.b===fc)return a.a;Aa(\"expected object of type TrustedResourceUrl, got '\"+a+\"' of type \"+da(a));return\"type_error:TrustedResourceUrl\"}function hc(a,b){a=ic(a,b);b=new ec;b.a=a;return b}\nfunction ic(a,b){var c=cc(a);if(!jc.test(c))throw Error(\"Invalid TrustedResourceUrl format: \"+c);return c.replace(kc,function(a,e){if(!Object.prototype.hasOwnProperty.call(b,e))throw Error('Found marker, \"'+e+'\", in format string, \"'+c+'\", but no valid label mapping found in args: '+JSON.stringify(b));a=b[e];return a instanceof ac?cc(a):encodeURIComponent(String(a))})}var kc=/%{(\\w+)}/g,jc=/^(?:https:)?\\/\\/[0-9a-z.:[\\]-]+\\/|^\\/[^\\/\\\\]|^about:blank(#|$)/i,fc={};function lc(){this.a=\"\";this.b=mc}lc.prototype.la=!0;lc.prototype.ja=function(){return this.a};lc.prototype.toString=function(){return\"SafeUrl{\"+this.a+\"}\"};function nc(a){if(a instanceof lc&&a.constructor===lc&&a.b===mc)return a.a;Aa(\"expected object of type SafeUrl, got '\"+a+\"' of type \"+da(a));return\"type_error:SafeUrl\"}var oc=/^(?:(?:https?|mailto|ftp):|[^:/?#]*(?:[/?#]|$))/i;\nfunction pc(a){if(a instanceof lc)return a;a=a.la?a.ja():String(a);oc.test(a)||(a=\"about:invalid#zClosurez\");return qc(a)}var mc={};function qc(a){var b=new lc;b.a=a;return b}qc(\"about:blank\");function rc(){this.a=\"\";this.b=sc}rc.prototype.la=!0;rc.prototype.ja=function(){return this.a};rc.prototype.toString=function(){return\"SafeHtml{\"+this.a+\"}\"};function uc(a){if(a instanceof rc&&a.constructor===rc&&a.b===sc)return a.a;Aa(\"expected object of type SafeHtml, got '\"+a+\"' of type \"+da(a));return\"type_error:SafeHtml\"}var sc={};function vc(a){var b=new rc;b.a=a;return b}vc(\"<!DOCTYPE html>\");vc(\"\");vc(\"<br>\");function wc(a){var b=document;return m(a)?b.getElementById(a):a}function xc(a,b){Pa(b,function(b,d){b&&b.la&&(b=b.ja());\"style\"==d?a.style.cssText=b:\"class\"==d?a.className=b:\"for\"==d?a.htmlFor=b:yc.hasOwnProperty(d)?a.setAttribute(yc[d],b):0==d.lastIndexOf(\"aria-\",0)||0==d.lastIndexOf(\"data-\",0)?a.setAttribute(d,b):a[d]=b})}\nvar yc={cellpadding:\"cellPadding\",cellspacing:\"cellSpacing\",colspan:\"colSpan\",frameborder:\"frameBorder\",height:\"height\",maxlength:\"maxLength\",nonce:\"nonce\",role:\"role\",rowspan:\"rowSpan\",type:\"type\",usemap:\"useMap\",valign:\"vAlign\",width:\"width\"};\nfunction zc(a,b,c){var d=arguments,e=document,f=String(d[0]),g=d[1];if(!$b&&g&&(g.name||g.type)){f=[\"<\",f];g.name&&f.push(' name=\"',qa(g.name),'\"');if(g.type){f.push(' type=\"',qa(g.type),'\"');var l={};Wa(l,g);delete l.type;g=l}f.push(\">\");f=f.join(\"\")}f=e.createElement(f);g&&(m(g)?f.className=g:fa(g)?f.className=g.join(\" \"):xc(f,g));2<d.length&&Ac(e,f,d);return f}\nfunction Ac(a,b,c){function d(c){c&&b.appendChild(m(c)?a.createTextNode(c):c)}for(var e=2;e<c.length;e++){var f=c[e];!ha(f)||q(f)&&0<f.nodeType?d(f):w(Bc(f)?La(f):f,d)}}function Bc(a){if(a&&\"number\"==typeof a.length){if(q(a))return\"function\"==typeof a.item||\"string\"==typeof a.item;if(p(a))return\"function\"==typeof a.item}return!1};function Cc(a){var b=[];Dc(new Ec,a,b);return b.join(\"\")}function Ec(){}\nfunction Dc(a,b,c){if(null==b)c.push(\"null\");else{if(\"object\"==typeof b){if(fa(b)){var d=b;b=d.length;c.push(\"[\");for(var e=\"\",f=0;f<b;f++)c.push(e),Dc(a,d[f],c),e=\",\";c.push(\"]\");return}if(b instanceof String||b instanceof Number||b instanceof Boolean)b=b.valueOf();else{c.push(\"{\");e=\"\";for(d in b)Object.prototype.hasOwnProperty.call(b,d)&&(f=b[d],\"function\"!=typeof f&&(c.push(e),Fc(d,c),c.push(\":\"),Dc(a,f,c),e=\",\"));c.push(\"}\");return}}switch(typeof b){case \"string\":Fc(b,c);break;case \"number\":c.push(isFinite(b)&&\n!isNaN(b)?String(b):\"null\");break;case \"boolean\":c.push(String(b));break;case \"function\":c.push(\"null\");break;default:throw Error(\"Unknown type: \"+typeof b);}}}var Gc={'\"':'\\\\\"',\"\\\\\":\"\\\\\\\\\",\"/\":\"\\\\/\",\"\\b\":\"\\\\b\",\"\\f\":\"\\\\f\",\"\\n\":\"\\\\n\",\"\\r\":\"\\\\r\",\"\\t\":\"\\\\t\",\"\\x0B\":\"\\\\u000b\"},Hc=/\\uffff/.test(\"\\uffff\")?/[\\\\\\\"\\x00-\\x1f\\x7f-\\uffff]/g:/[\\\\\\\"\\x00-\\x1f\\x7f-\\xff]/g;\nfunction Fc(a,b){b.push('\"',a.replace(Hc,function(a){var b=Gc[a];b||(b=\"\\\\u\"+(a.charCodeAt(0)|65536).toString(16).substr(1),Gc[a]=b);return b}),'\"')};function Ic(){0!=Jc&&(Kc[this[ia]||(this[ia]=++ja)]=this);this.oa=this.oa;this.Fa=this.Fa}var Jc=0,Kc={};Ic.prototype.oa=!1;function Lc(a){a.oa||(a.oa=!0,a.ta(),0!=Jc&&(a=a[ia]||(a[ia]=++ja),delete Kc[a]))}Ic.prototype.ta=function(){if(this.Fa)for(;this.Fa.length;)this.Fa.shift()()};var Mc=Object.freeze||function(a){return a};var Nc=!y||9<=Number(kb),Oc=y&&!jb(\"9\"),Pc=function(){if(!k.addEventListener||!Object.defineProperty)return!1;var a=!1,b=Object.defineProperty({},\"passive\",{get:function(){a=!0}});k.addEventListener(\"test\",ca,b);k.removeEventListener(\"test\",ca,b);return a}();function C(a,b){this.type=a;this.b=this.target=b;this.Ab=!0}C.prototype.c=function(){this.Ab=!1};function Qc(a,b){C.call(this,a?a.type:\"\");this.relatedTarget=this.b=this.target=null;this.button=this.screenY=this.screenX=this.clientY=this.clientX=0;this.key=\"\";this.metaKey=this.shiftKey=this.altKey=this.ctrlKey=!1;this.pointerId=0;this.pointerType=\"\";this.a=null;if(a){var c=this.type=a.type,d=a.changedTouches?a.changedTouches[0]:null;this.target=a.target||a.srcElement;this.b=b;if(b=a.relatedTarget){if(cb){a:{try{Xa(b.nodeName);var e=!0;break a}catch(f){}e=!1}e||(b=null)}}else\"mouseover\"==c?b=\na.fromElement:\"mouseout\"==c&&(b=a.toElement);this.relatedTarget=b;null===d?(this.clientX=void 0!==a.clientX?a.clientX:a.pageX,this.clientY=void 0!==a.clientY?a.clientY:a.pageY,this.screenX=a.screenX||0,this.screenY=a.screenY||0):(this.clientX=void 0!==d.clientX?d.clientX:d.pageX,this.clientY=void 0!==d.clientY?d.clientY:d.pageY,this.screenX=d.screenX||0,this.screenY=d.screenY||0);this.button=a.button;this.key=a.key||\"\";this.ctrlKey=a.ctrlKey;this.altKey=a.altKey;this.shiftKey=a.shiftKey;this.metaKey=\na.metaKey;this.pointerId=a.pointerId||0;this.pointerType=m(a.pointerType)?a.pointerType:Rc[a.pointerType]||\"\";this.a=a;a.defaultPrevented&&this.c()}}t(Qc,C);var Rc=Mc({2:\"touch\",3:\"pen\",4:\"mouse\"});Qc.prototype.c=function(){Qc.ib.c.call(this);var a=this.a;if(a.preventDefault)a.preventDefault();else if(a.returnValue=!1,Oc)try{if(a.ctrlKey||112<=a.keyCode&&123>=a.keyCode)a.keyCode=-1}catch(b){}};Qc.prototype.g=function(){return this.a};var Sc=\"closure_listenable_\"+(1E6*Math.random()|0),Tc=0;function Uc(a,b,c,d,e){this.listener=a;this.a=null;this.src=b;this.type=c;this.capture=!!d;this.La=e;this.key=++Tc;this.ma=this.Ha=!1}function Vc(a){a.ma=!0;a.listener=null;a.a=null;a.src=null;a.La=null};function Wc(a){this.src=a;this.a={};this.b=0}function Xc(a,b,c,d,e,f){var g=b.toString();b=a.a[g];b||(b=a.a[g]=[],a.b++);var l=Yc(b,c,e,f);-1<l?(a=b[l],d||(a.Ha=!1)):(a=new Uc(c,a.src,g,!!e,f),a.Ha=d,b.push(a));return a}function Zc(a,b){var c=b.type;c in a.a&&Ia(a.a[c],b)&&(Vc(b),0==a.a[c].length&&(delete a.a[c],a.b--))}function Yc(a,b,c,d){for(var e=0;e<a.length;++e){var f=a[e];if(!f.ma&&f.listener==b&&f.capture==!!c&&f.La==d)return e}return-1};var $c=\"closure_lm_\"+(1E6*Math.random()|0),ad={},bd=0;function cd(a,b,c,d,e){if(d&&d.once)dd(a,b,c,d,e);else if(fa(b))for(var f=0;f<b.length;f++)cd(a,b[f],c,d,e);else c=ed(c),a&&a[Sc]?fd(a,b,c,q(d)?!!d.capture:!!d,e):gd(a,b,c,!1,d,e)}\nfunction gd(a,b,c,d,e,f){if(!b)throw Error(\"Invalid event type\");var g=q(e)?!!e.capture:!!e,l=hd(a);l||(a[$c]=l=new Wc(a));c=Xc(l,b,c,d,g,f);if(!c.a){d=id();c.a=d;d.src=a;d.listener=c;if(a.addEventListener)Pc||(e=g),void 0===e&&(e=!1),a.addEventListener(b.toString(),d,e);else if(a.attachEvent)a.attachEvent(jd(b.toString()),d);else throw Error(\"addEventListener and attachEvent are unavailable.\");bd++}}\nfunction id(){var a=kd,b=Nc?function(c){return a.call(b.src,b.listener,c)}:function(c){c=a.call(b.src,b.listener,c);if(!c)return c};return b}function dd(a,b,c,d,e){if(fa(b))for(var f=0;f<b.length;f++)dd(a,b[f],c,d,e);else c=ed(c),a&&a[Sc]?ld(a,b,c,q(d)?!!d.capture:!!d,e):gd(a,b,c,!0,d,e)}\nfunction E(a,b,c,d,e){if(fa(b))for(var f=0;f<b.length;f++)E(a,b[f],c,d,e);else(d=q(d)?!!d.capture:!!d,c=ed(c),a&&a[Sc])?(a=a.u,b=String(b).toString(),b in a.a&&(f=a.a[b],c=Yc(f,c,d,e),-1<c&&(Vc(f[c]),Array.prototype.splice.call(f,c,1),0==f.length&&(delete a.a[b],a.b--)))):a&&(a=hd(a))&&(b=a.a[b.toString()],a=-1,b&&(a=Yc(b,c,d,e)),(c=-1<a?b[a]:null)&&md(c))}\nfunction md(a){if(\"number\"!=typeof a&&a&&!a.ma){var b=a.src;if(b&&b[Sc])Zc(b.u,a);else{var c=a.type,d=a.a;b.removeEventListener?b.removeEventListener(c,d,a.capture):b.detachEvent&&b.detachEvent(jd(c),d);bd--;(c=hd(b))?(Zc(c,a),0==c.b&&(c.src=null,b[$c]=null)):Vc(a)}}}function jd(a){return a in ad?ad[a]:ad[a]=\"on\"+a}function nd(a,b,c,d){var e=!0;if(a=hd(a))if(b=a.a[b.toString()])for(b=b.concat(),a=0;a<b.length;a++){var f=b[a];f&&f.capture==c&&!f.ma&&(f=od(f,d),e=e&&!1!==f)}return e}\nfunction od(a,b){var c=a.listener,d=a.La||a.src;a.Ha&&md(a);return c.call(d,b)}\nfunction kd(a,b){if(a.ma)return!0;if(!Nc){if(!b)a:{b=[\"window\",\"event\"];for(var c=k,d=0;d<b.length;d++)if(c=c[b[d]],null==c){b=null;break a}b=c}d=b;b=new Qc(d,this);c=!0;if(!(0>d.keyCode||void 0!=d.returnValue)){a:{var e=!1;if(0==d.keyCode)try{d.keyCode=-1;break a}catch(g){e=!0}if(e||void 0==d.returnValue)d.returnValue=!0}d=[];for(e=b.b;e;e=e.parentNode)d.push(e);a=a.type;for(e=d.length-1;0<=e;e--){b.b=d[e];var f=nd(d[e],a,!0,b);c=c&&f}for(e=0;e<d.length;e++)b.b=d[e],f=nd(d[e],a,!1,b),c=c&&f}return c}return od(a,\nnew Qc(b,this))}function hd(a){a=a[$c];return a instanceof Wc?a:null}var pd=\"__closure_events_fn_\"+(1E9*Math.random()>>>0);function ed(a){if(p(a))return a;a[pd]||(a[pd]=function(b){return a.handleEvent(b)});return a[pd]};function F(){Ic.call(this);this.u=new Wc(this);this.Eb=this;this.Ra=null}t(F,Ic);F.prototype[Sc]=!0;F.prototype.removeEventListener=function(a,b,c,d){E(this,a,b,c,d)};\nfunction G(a,b){var c,d=a.Ra;if(d)for(c=[];d;d=d.Ra)c.push(d);a=a.Eb;d=b.type||b;if(m(b))b=new C(b,a);else if(b instanceof C)b.target=b.target||a;else{var e=b;b=new C(d,a);Wa(b,e)}e=!0;if(c)for(var f=c.length-1;0<=f;f--){var g=b.b=c[f];e=qd(g,d,!0,b)&&e}g=b.b=a;e=qd(g,d,!0,b)&&e;e=qd(g,d,!1,b)&&e;if(c)for(f=0;f<c.length;f++)g=b.b=c[f],e=qd(g,d,!1,b)&&e}\nF.prototype.ta=function(){F.ib.ta.call(this);if(this.u){var a=this.u,b=0,c;for(c in a.a){for(var d=a.a[c],e=0;e<d.length;e++)++b,Vc(d[e]);delete a.a[c];a.b--}}this.Ra=null};function fd(a,b,c,d,e){Xc(a.u,String(b),c,!1,d,e)}function ld(a,b,c,d,e){Xc(a.u,String(b),c,!0,d,e)}function qd(a,b,c,d){b=a.u.a[String(b)];if(!b)return!0;b=b.concat();for(var e=!0,f=0;f<b.length;++f){var g=b[f];if(g&&!g.ma&&g.capture==c){var l=g.listener,n=g.La||g.src;g.Ha&&Zc(a.u,g);e=!1!==l.call(n,d)&&e}}return e&&0!=d.Ab};function rd(a,b,c){if(p(a))c&&(a=r(a,c));else if(a&&\"function\"==typeof a.handleEvent)a=r(a.handleEvent,a);else throw Error(\"Invalid listener argument\");return 2147483647<Number(b)?-1:k.setTimeout(a,b||0)}function sd(a){var b=null;return(new z(function(c,d){b=rd(function(){c(void 0)},a);-1==b&&d(Error(\"Failed to schedule timer.\"))})).s(function(a){k.clearTimeout(b);throw a;})};function td(a,b,c,d,e){this.reset(a,b,c,d,e)}td.prototype.a=null;var ud=0;td.prototype.reset=function(a,b,c,d,e){\"number\"==typeof e||ud++;d||na();this.b=b;delete this.a};function vd(a){this.f=a;this.b=this.c=this.a=null}function wd(a,b){this.name=a;this.value=b}wd.prototype.toString=function(){return this.name};var xd=new wd(\"SEVERE\",1E3),yd=new wd(\"CONFIG\",700),zd=new wd(\"FINE\",500);function Ad(a){if(a.c)return a.c;if(a.a)return Ad(a.a);Aa(\"Root logger has no level set.\");return null}\nvd.prototype.log=function(a,b,c){if(a.value>=Ad(this).value)for(p(b)&&(b=b()),a=new td(a,String(b),this.f),c&&(a.a=c),c=\"log:\"+a.b,(a=k.console)&&a.timeStamp&&a.timeStamp(c),(a=k.msWriteProfilerMark)&&a(c),c=this;c;)c=c.a};var Bd={},Cd=null;function Dd(a){Cd||(Cd=new vd(\"\"),Bd[\"\"]=Cd,Cd.c=yd);var b;if(!(b=Bd[a])){b=new vd(a);var c=a.lastIndexOf(\".\"),d=a.substr(c+1);c=Dd(a.substr(0,c));c.b||(c.b={});c.b[d]=b;b.a=c;Bd[a]=b}return b};function Ed(a,b){this.b={};this.a=[];this.c=0;var c=arguments.length;if(1<c){if(c%2)throw Error(\"Uneven number of arguments\");for(var d=0;d<c;d+=2)this.set(arguments[d],arguments[d+1])}else if(a){a instanceof Ed?(c=a.S(),d=a.P()):(c=Ra(a),d=Qa(a));for(var e=0;e<c.length;e++)this.set(c[e],d[e])}}h=Ed.prototype;h.P=function(){Fd(this);for(var a=[],b=0;b<this.a.length;b++)a.push(this.b[this.a[b]]);return a};h.S=function(){Fd(this);return this.a.concat()};\nh.clear=function(){this.b={};this.c=this.a.length=0};function Fd(a){if(a.c!=a.a.length){for(var b=0,c=0;b<a.a.length;){var d=a.a[b];Gd(a.b,d)&&(a.a[c++]=d);b++}a.a.length=c}if(a.c!=a.a.length){var e={};for(c=b=0;b<a.a.length;)d=a.a[b],Gd(e,d)||(a.a[c++]=d,e[d]=1),b++;a.a.length=c}}h.get=function(a,b){return Gd(this.b,a)?this.b[a]:b};h.set=function(a,b){Gd(this.b,a)||(this.c++,this.a.push(a));this.b[a]=b};\nh.forEach=function(a,b){for(var c=this.S(),d=0;d<c.length;d++){var e=c[d],f=this.get(e);a.call(b,f,e,this)}};function Gd(a,b){return Object.prototype.hasOwnProperty.call(a,b)};function H(a,b){a&&a.log(zd,b,void 0)};function Hd(a){return Da(a,function(a){a=a.toString(16);return 1<a.length?a:\"0\"+a}).join(\"\")};var Id=null,Jd=null;function Kd(a){var b=\"\";Ld(a,function(a){b+=String.fromCharCode(a)});return b}function Ld(a,b){function c(b){for(;d<a.length;){var c=a.charAt(d++),e=Jd[c];if(null!=e)return e;if(!/^[\\s\\xa0]*$/.test(c))throw Error(\"Unknown base64 encoding at char: \"+c);}return b}Md();for(var d=0;;){var e=c(-1),f=c(0),g=c(64),l=c(64);if(64===l&&-1===e)break;b(e<<2|f>>4);64!=g&&(b(f<<4&240|g>>2),64!=l&&b(g<<6&192|l))}}\nfunction Md(){if(!Id){Id={};Jd={};for(var a=0;65>a;a++)Id[a]=\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=\".charAt(a),Jd[Id[a]]=a,62<=a&&(Jd[\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_.\".charAt(a)]=a)}};/*\n Portions of this code are from MochiKit, received by\n The Closure Authors under the MIT license. All other code is Copyright\n 2005-2009 The Closure Authors. All Rights Reserved.\n*/\nfunction Nd(a,b){this.g=[];this.v=a;this.o=b||null;this.f=this.a=!1;this.c=void 0;this.u=this.w=this.i=!1;this.h=0;this.b=null;this.l=0}Nd.prototype.cancel=function(a){if(this.a)this.c instanceof Nd&&this.c.cancel();else{if(this.b){var b=this.b;delete this.b;a?b.cancel(a):(b.l--,0>=b.l&&b.cancel())}this.v?this.v.call(this.o,this):this.u=!0;this.a||(a=new Od,Pd(this),Qd(this,!1,a))}};Nd.prototype.m=function(a,b){this.i=!1;Qd(this,a,b)};function Qd(a,b,c){a.a=!0;a.c=c;a.f=!b;Rd(a)}\nfunction Pd(a){if(a.a){if(!a.u)throw new Sd;a.u=!1}}Nd.prototype.A=function(a){Pd(this);Qd(this,!0,a)};function Td(a,b){Ud(a,null,b,void 0)}function Ud(a,b,c,d){a.g.push([b,c,d]);a.a&&Rd(a)}Nd.prototype.then=function(a,b,c){var d,e,f=new z(function(a,b){d=a;e=b});Ud(this,d,function(a){a instanceof Od?f.cancel():e(a)});return f.then(a,b,c)};mb(Nd);function Vd(a){return Ea(a.g,function(a){return p(a[1])})}\nfunction Rd(a){if(a.h&&a.a&&Vd(a)){var b=a.h,c=Wd[b];c&&(k.clearTimeout(c.a),delete Wd[b]);a.h=0}a.b&&(a.b.l--,delete a.b);b=a.c;for(var d=c=!1;a.g.length&&!a.i;){var e=a.g.shift(),f=e[0],g=e[1];e=e[2];if(f=a.f?g:f)try{var l=f.call(e||a.o,b);void 0!==l&&(a.f=a.f&&(l==b||l instanceof Error),a.c=b=l);if(nb(b)||\"function\"===typeof k.Promise&&b instanceof k.Promise)d=!0,a.i=!0}catch(n){b=n,a.f=!0,Vd(a)||(c=!0)}}a.c=b;d&&(l=r(a.m,a,!0),d=r(a.m,a,!1),b instanceof Nd?(Ud(b,l,d),b.w=!0):b.then(l,d));c&&(b=\nnew Xd(b),Wd[b.a]=b,a.h=b.a)}function Sd(){u.call(this)}t(Sd,u);Sd.prototype.message=\"Deferred has already fired\";Sd.prototype.name=\"AlreadyCalledError\";function Od(){u.call(this)}t(Od,u);Od.prototype.message=\"Deferred was canceled\";Od.prototype.name=\"CanceledError\";function Xd(a){this.a=k.setTimeout(r(this.c,this),0);this.b=a}Xd.prototype.c=function(){delete Wd[this.a];throw this.b;};var Wd={};function Yd(){this.b=-1};function Zd(a,b){this.b=-1;this.b=$d;this.f=k.Uint8Array?new Uint8Array(this.b):Array(this.b);this.g=this.c=0;this.a=[];this.i=a;this.h=b;this.l=k.Int32Array?new Int32Array(64):Array(64);ae||(k.Int32Array?ae=new Int32Array(be):ae=be);this.reset()}var ae;t(Zd,Yd);for(var $d=64,ce=$d-1,de=[],ee=0;ee<ce;ee++)de[ee]=0;var fe=Ka(128,de);Zd.prototype.reset=function(){this.g=this.c=0;this.a=k.Int32Array?new Int32Array(this.h):La(this.h)};\nfunction ge(a){for(var b=a.f,c=a.l,d=0,e=0;e<b.length;)c[d++]=b[e]<<24|b[e+1]<<16|b[e+2]<<8|b[e+3],e=4*d;for(b=16;64>b;b++){e=c[b-15]|0;d=c[b-2]|0;var f=(c[b-16]|0)+((e>>>7|e<<25)^(e>>>18|e<<14)^e>>>3)|0,g=(c[b-7]|0)+((d>>>17|d<<15)^(d>>>19|d<<13)^d>>>10)|0;c[b]=f+g|0}d=a.a[0]|0;e=a.a[1]|0;var l=a.a[2]|0,n=a.a[3]|0,D=a.a[4]|0,vb=a.a[5]|0,tc=a.a[6]|0;f=a.a[7]|0;for(b=0;64>b;b++){var Bj=((d>>>2|d<<30)^(d>>>13|d<<19)^(d>>>22|d<<10))+(d&e^d&l^e&l)|0;g=D&vb^~D&tc;f=f+((D>>>6|D<<26)^(D>>>11|D<<21)^(D>>>\n25|D<<7))|0;g=g+(ae[b]|0)|0;g=f+(g+(c[b]|0)|0)|0;f=tc;tc=vb;vb=D;D=n+g|0;n=l;l=e;e=d;d=g+Bj|0}a.a[0]=a.a[0]+d|0;a.a[1]=a.a[1]+e|0;a.a[2]=a.a[2]+l|0;a.a[3]=a.a[3]+n|0;a.a[4]=a.a[4]+D|0;a.a[5]=a.a[5]+vb|0;a.a[6]=a.a[6]+tc|0;a.a[7]=a.a[7]+f|0}\nfunction he(a,b,c){void 0===c&&(c=b.length);var d=0,e=a.c;if(m(b))for(;d<c;)a.f[e++]=b.charCodeAt(d++),e==a.b&&(ge(a),e=0);else if(ha(b))for(;d<c;){var f=b[d++];if(!(\"number\"==typeof f&&0<=f&&255>=f&&f==(f|0)))throw Error(\"message must be a byte array\");a.f[e++]=f;e==a.b&&(ge(a),e=0)}else throw Error(\"message must be string or array\");a.c=e;a.g+=c}\nvar be=[1116352408,1899447441,3049323471,3921009573,961987163,1508970993,2453635748,2870763221,3624381080,310598401,607225278,1426881987,1925078388,2162078206,2614888103,3248222580,3835390401,4022224774,264347078,604807628,770255983,1249150122,1555081692,1996064986,2554220882,2821834349,2952996808,3210313671,3336571891,3584528711,113926993,338241895,666307205,773529912,1294757372,1396182291,1695183700,1986661051,2177026350,2456956037,2730485921,2820302411,3259730800,3345764771,3516065817,3600352804,\n4094571909,275423344,430227734,506948616,659060556,883997877,958139571,1322822218,1537002063,1747873779,1955562222,2024104815,2227730452,2361852424,2428436474,2756734187,3204031479,3329325298];function ie(){Zd.call(this,8,je)}t(ie,Zd);var je=[1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225];function ke(a){if(a.P&&\"function\"==typeof a.P)return a.P();if(m(a))return a.split(\"\");if(ha(a)){for(var b=[],c=a.length,d=0;d<c;d++)b.push(a[d]);return b}return Qa(a)}function le(a){if(a.S&&\"function\"==typeof a.S)return a.S();if(!a.P||\"function\"!=typeof a.P){if(ha(a)||m(a)){var b=[];a=a.length;for(var c=0;c<a;c++)b.push(c);return b}return Ra(a)}}\nfunction me(a,b){if(a.forEach&&\"function\"==typeof a.forEach)a.forEach(b,void 0);else if(ha(a)||m(a))w(a,b,void 0);else for(var c=le(a),d=ke(a),e=d.length,f=0;f<e;f++)b.call(void 0,d[f],c&&c[f],a)};var ne=/^(?:([^:/?#.]+):)?(?:\\/\\/(?:([^/?#]*)@)?([^/#?]*?)(?::([0-9]+))?(?=[/#?]|$))?([^?#]+)?(?:\\?([^#]*))?(?:#([\\s\\S]*))?$/;function oe(a,b){if(a){a=a.split(\"&\");for(var c=0;c<a.length;c++){var d=a[c].indexOf(\"=\"),e=null;if(0<=d){var f=a[c].substring(0,d);e=a[c].substring(d+1)}else f=a[c];b(f,e?decodeURIComponent(e.replace(/\\+/g,\" \")):\"\")}}};function pe(a,b){this.b=this.l=this.c=\"\";this.i=null;this.h=this.g=\"\";this.f=!1;if(a instanceof pe){this.f=void 0!==b?b:a.f;qe(this,a.c);this.l=a.l;this.b=a.b;re(this,a.i);this.g=a.g;b=a.a;var c=new se;c.c=b.c;b.a&&(c.a=new Ed(b.a),c.b=b.b);te(this,c);this.h=a.h}else a&&(c=String(a).match(ne))?(this.f=!!b,qe(this,c[1]||\"\",!0),this.l=ue(c[2]||\"\"),this.b=ue(c[3]||\"\",!0),re(this,c[4]),this.g=ue(c[5]||\"\",!0),te(this,c[6]||\"\",!0),this.h=ue(c[7]||\"\")):(this.f=!!b,this.a=new se(null,0,this.f))}\npe.prototype.toString=function(){var a=[],b=this.c;b&&a.push(ve(b,we,!0),\":\");var c=this.b;if(c||\"file\"==b)a.push(\"//\"),(b=this.l)&&a.push(ve(b,we,!0),\"@\"),a.push(encodeURIComponent(String(c)).replace(/%25([0-9a-fA-F]{2})/g,\"%$1\")),c=this.i,null!=c&&a.push(\":\",String(c));if(c=this.g)this.b&&\"/\"!=c.charAt(0)&&a.push(\"/\"),a.push(ve(c,\"/\"==c.charAt(0)?xe:ye,!0));(c=this.a.toString())&&a.push(\"?\",c);(c=this.h)&&a.push(\"#\",ve(c,ze));return a.join(\"\")};\nfunction qe(a,b,c){a.c=c?ue(b,!0):b;a.c&&(a.c=a.c.replace(/:$/,\"\"))}function re(a,b){if(b){b=Number(b);if(isNaN(b)||0>b)throw Error(\"Bad port number \"+b);a.i=b}else a.i=null}function te(a,b,c){b instanceof se?(a.a=b,Ae(a.a,a.f)):(c||(b=ve(b,Be)),a.a=new se(b,0,a.f))}function I(a,b,c){a.a.set(b,c)}function Ce(a,b){return a.a.get(b)}function De(a){return a instanceof pe?new pe(a):new pe(a,void 0)}function Ee(a,b){var c=new pe(null,void 0);qe(c,\"https\");a&&(c.b=a);b&&(c.g=b);return c}\nfunction ue(a,b){return a?b?decodeURI(a.replace(/%25/g,\"%2525\")):decodeURIComponent(a):\"\"}function ve(a,b,c){return m(a)?(a=encodeURI(a).replace(b,Fe),c&&(a=a.replace(/%25([0-9a-fA-F]{2})/g,\"%$1\")),a):null}function Fe(a){a=a.charCodeAt(0);return\"%\"+(a>>4&15).toString(16)+(a&15).toString(16)}var we=/[#\\/\\?@]/g,ye=/[\\#\\?:]/g,xe=/[\\#\\?]/g,Be=/[\\#\\?@]/g,ze=/#/g;function se(a,b,c){this.b=this.a=null;this.c=a||null;this.f=!!c}\nfunction Ge(a){a.a||(a.a=new Ed,a.b=0,a.c&&oe(a.c,function(b,c){He(a,decodeURIComponent(b.replace(/\\+/g,\" \")),c)}))}function Ie(a){var b=le(a);if(\"undefined\"==typeof b)throw Error(\"Keys are undefined\");var c=new se(null,0,void 0);a=ke(a);for(var d=0;d<b.length;d++){var e=b[d],f=a[d];fa(f)?Je(c,e,f):He(c,e,f)}return c}function He(a,b,c){Ge(a);a.c=null;b=Ke(a,b);var d=a.a.get(b);d||a.a.set(b,d=[]);d.push(c);a.b+=1}\nfunction Le(a,b){Ge(a);b=Ke(a,b);Gd(a.a.b,b)&&(a.c=null,a.b-=a.a.get(b).length,a=a.a,Gd(a.b,b)&&(delete a.b[b],a.c--,a.a.length>2*a.c&&Fd(a)))}h=se.prototype;h.clear=function(){this.a=this.c=null;this.b=0};function Me(a,b){Ge(a);b=Ke(a,b);return Gd(a.a.b,b)}h.forEach=function(a,b){Ge(this);this.a.forEach(function(c,d){w(c,function(c){a.call(b,c,d,this)},this)},this)};h.S=function(){Ge(this);for(var a=this.a.P(),b=this.a.S(),c=[],d=0;d<b.length;d++)for(var e=a[d],f=0;f<e.length;f++)c.push(b[d]);return c};\nh.P=function(a){Ge(this);var b=[];if(m(a))Me(this,a)&&(b=Ka(b,this.a.get(Ke(this,a))));else{a=this.a.P();for(var c=0;c<a.length;c++)b=Ka(b,a[c])}return b};h.set=function(a,b){Ge(this);this.c=null;a=Ke(this,a);Me(this,a)&&(this.b-=this.a.get(a).length);this.a.set(a,[b]);this.b+=1;return this};h.get=function(a,b){a=a?this.P(a):[];return 0<a.length?String(a[0]):b};function Je(a,b,c){Le(a,b);0<c.length&&(a.c=null,a.a.set(Ke(a,b),La(c)),a.b+=c.length)}\nh.toString=function(){if(this.c)return this.c;if(!this.a)return\"\";for(var a=[],b=this.a.S(),c=0;c<b.length;c++){var d=b[c],e=encodeURIComponent(String(d));d=this.P(d);for(var f=0;f<d.length;f++){var g=e;\"\"!==d[f]&&(g+=\"=\"+encodeURIComponent(String(d[f])));a.push(g)}}return this.c=a.join(\"&\")};function Ke(a,b){b=String(b);a.f&&(b=b.toLowerCase());return b}function Ae(a,b){b&&!a.f&&(Ge(a),a.c=null,a.a.forEach(function(a,b){var c=b.toLowerCase();b!=c&&(Le(this,b),Je(this,c,a))},a));a.f=b};function Ne(){}Ne.prototype.c=null;function Oe(a){return a.c||(a.c=a.b())};var Pe;function Qe(){}t(Qe,Ne);Qe.prototype.a=function(){var a=Re(this);return a?new ActiveXObject(a):new XMLHttpRequest};Qe.prototype.b=function(){var a={};Re(this)&&(a[0]=!0,a[1]=!0);return a};\nfunction Re(a){if(!a.f&&\"undefined\"==typeof XMLHttpRequest&&\"undefined\"!=typeof ActiveXObject){for(var b=[\"MSXML2.XMLHTTP.6.0\",\"MSXML2.XMLHTTP.3.0\",\"MSXML2.XMLHTTP\",\"Microsoft.XMLHTTP\"],c=0;c<b.length;c++){var d=b[c];try{return new ActiveXObject(d),a.f=d}catch(e){}}throw Error(\"Could not create ActiveXObject. ActiveX might be disabled, or MSXML might not be installed\");}return a.f}Pe=new Qe;function Se(a){F.call(this);this.headers=new Ed;this.w=a||null;this.b=!1;this.v=this.a=null;this.g=this.I=this.i=\"\";this.c=this.G=this.h=this.A=!1;this.f=0;this.m=null;this.l=Te;this.o=this.N=!1}t(Se,F);var Te=\"\",Ue=Se.prototype,Ve=Dd(\"goog.net.XhrIo\");Ue.J=Ve;var We=/^https?$/i,Xe=[\"POST\",\"PUT\"];\nfunction Ye(a,b,c,d,e){if(a.a)throw Error(\"[goog.net.XhrIo] Object is active with another request=\"+a.i+\"; newUri=\"+b);c=c?c.toUpperCase():\"GET\";a.i=b;a.g=\"\";a.I=c;a.A=!1;a.b=!0;a.a=a.w?a.w.a():Pe.a();a.v=a.w?Oe(a.w):Oe(Pe);a.a.onreadystatechange=r(a.zb,a);try{H(a.J,Ze(a,\"Opening Xhr\")),a.G=!0,a.a.open(c,String(b),!0),a.G=!1}catch(g){H(a.J,Ze(a,\"Error opening Xhr: \"+g.message));$e(a,g);return}b=d||\"\";var f=new Ed(a.headers);e&&me(e,function(a,b){f.set(b,a)});e=Fa(f.S());d=k.FormData&&b instanceof\nk.FormData;!Ha(Xe,c)||e||d||f.set(\"Content-Type\",\"application/x-www-form-urlencoded;charset=utf-8\");f.forEach(function(a,b){this.a.setRequestHeader(b,a)},a);a.l&&(a.a.responseType=a.l);\"withCredentials\"in a.a&&a.a.withCredentials!==a.N&&(a.a.withCredentials=a.N);try{af(a),0<a.f&&(a.o=bf(a.a),H(a.J,Ze(a,\"Will abort after \"+a.f+\"ms if incomplete, xhr2 \"+a.o)),a.o?(a.a.timeout=a.f,a.a.ontimeout=r(a.Ea,a)):a.m=rd(a.Ea,a.f,a)),H(a.J,Ze(a,\"Sending request\")),a.h=!0,a.a.send(b),a.h=!1}catch(g){H(a.J,Ze(a,\n\"Send error: \"+g.message)),$e(a,g)}}function bf(a){return y&&jb(9)&&\"number\"==typeof a.timeout&&void 0!==a.ontimeout}function Ga(a){return\"content-type\"==a.toLowerCase()}h=Se.prototype;h.Ea=function(){\"undefined\"!=typeof aa&&this.a&&(this.g=\"Timed out after \"+this.f+\"ms, aborting\",H(this.J,Ze(this,this.g)),G(this,\"timeout\"),this.abort(8))};function $e(a,b){a.b=!1;a.a&&(a.c=!0,a.a.abort(),a.c=!1);a.g=b;cf(a);df(a)}function cf(a){a.A||(a.A=!0,G(a,\"complete\"),G(a,\"error\"))}\nh.abort=function(){this.a&&this.b&&(H(this.J,Ze(this,\"Aborting\")),this.b=!1,this.c=!0,this.a.abort(),this.c=!1,G(this,\"complete\"),G(this,\"abort\"),df(this))};h.ta=function(){this.a&&(this.b&&(this.b=!1,this.c=!0,this.a.abort(),this.c=!1),df(this,!0));Se.ib.ta.call(this)};h.zb=function(){this.oa||(this.G||this.h||this.c?ef(this):this.fc())};h.fc=function(){ef(this)};\nfunction ef(a){if(a.b&&\"undefined\"!=typeof aa)if(a.v[1]&&4==ff(a)&&2==gf(a))H(a.J,Ze(a,\"Local request error detected and ignored\"));else if(a.h&&4==ff(a))rd(a.zb,0,a);else if(G(a,\"readystatechange\"),4==ff(a)){H(a.J,Ze(a,\"Request complete\"));a.b=!1;try{var b=gf(a);a:switch(b){case 200:case 201:case 202:case 204:case 206:case 304:case 1223:var c=!0;break a;default:c=!1}var d;if(!(d=c)){var e;if(e=0===b){var f=String(a.i).match(ne)[1]||null;if(!f&&k.self&&k.self.location){var g=k.self.location.protocol;\nf=g.substr(0,g.length-1)}e=!We.test(f?f.toLowerCase():\"\")}d=e}if(d)G(a,\"complete\"),G(a,\"success\");else{try{var l=2<ff(a)?a.a.statusText:\"\"}catch(n){H(a.J,\"Can not get status: \"+n.message),l=\"\"}a.g=l+\" [\"+gf(a)+\"]\";cf(a)}}finally{df(a)}}}function df(a,b){if(a.a){af(a);var c=a.a,d=a.v[0]?ca:null;a.a=null;a.v=null;b||G(a,\"ready\");try{c.onreadystatechange=d}catch(e){(a=a.J)&&a.log(xd,\"Problem encountered resetting onreadystatechange: \"+e.message,void 0)}}}\nfunction af(a){a.a&&a.o&&(a.a.ontimeout=null);\"number\"==typeof a.m&&(k.clearTimeout(a.m),a.m=null)}function ff(a){return a.a?a.a.readyState:0}function gf(a){try{return 2<ff(a)?a.a.status:-1}catch(b){return-1}}function hf(a){try{return a.a?a.a.responseText:\"\"}catch(b){return H(a.J,\"Can not get responseText: \"+b.message),\"\"}}\nh.getResponse=function(){try{if(!this.a)return null;if(\"response\"in this.a)return this.a.response;switch(this.l){case Te:case \"text\":return this.a.responseText;case \"arraybuffer\":if(\"mozResponseArrayBuffer\"in this.a)return this.a.mozResponseArrayBuffer}var a=this.J;a&&a.log(xd,\"Response type \"+this.l+\" is not supported on this browser\",void 0);return null}catch(b){return H(this.J,\"Can not get response: \"+b.message),null}};function Ze(a,b){return b+\" [\"+a.I+\" \"+a.i+\" \"+gf(a)+\"]\"};var jf=/^[+a-zA-Z0-9_.!#$%&'*\\/=?^`{|}~-]+@([a-zA-Z0-9-]+\\.)+[a-zA-Z0-9]{2,63}$/;function kf(a){var b={},c=b.document||document,d=gc(a),e=document.createElement(\"SCRIPT\"),f={Bb:e,Ea:void 0},g=new Nd(lf,f),l=null,n=null!=b.timeout?b.timeout:5E3;0<n&&(l=window.setTimeout(function(){mf(e,!0);var a=new nf(of,\"Timeout reached for loading script \"+d);Pd(g);Qd(g,!1,a)},n),f.Ea=l);e.onload=e.onreadystatechange=function(){e.readyState&&\"loaded\"!=e.readyState&&\"complete\"!=e.readyState||(mf(e,b.Oc||!1,l),g.A(null))};e.onerror=function(){mf(e,!0,l);var a=new nf(pf,\"Error while loading script \"+\nd);Pd(g);Qd(g,!1,a)};f=b.attributes||{};Wa(f,{type:\"text/javascript\",charset:\"UTF-8\"});xc(e,f);e.src=gc(a);qf(c).appendChild(e);return g}function qf(a){var b;return(b=(a||document).getElementsByTagName(\"HEAD\"))&&0!=b.length?b[0]:a.documentElement}function lf(){if(this&&this.Bb){var a=this.Bb;a&&\"SCRIPT\"==a.tagName&&mf(a,!0,this.Ea)}}\nfunction mf(a,b,c){null!=c&&k.clearTimeout(c);a.onload=ca;a.onerror=ca;a.onreadystatechange=ca;b&&window.setTimeout(function(){a&&a.parentNode&&a.parentNode.removeChild(a)},0)}var pf=0,of=1;function nf(a,b){var c=\"Jsloader error (code #\"+a+\")\";b&&(c+=\": \"+b);u.call(this,c);this.code=a}t(nf,u);function rf(){}t(rf,Ne);rf.prototype.a=function(){var a=new XMLHttpRequest;if(\"withCredentials\"in a)return a;if(\"undefined\"!=typeof XDomainRequest)return new sf;throw Error(\"Unsupported browser\");};rf.prototype.b=function(){return{}};\nfunction sf(){this.a=new XDomainRequest;this.readyState=0;this.onreadystatechange=null;this.responseText=\"\";this.status=-1;this.statusText=this.responseXML=null;this.a.onload=r(this.Sb,this);this.a.onerror=r(this.wb,this);this.a.onprogress=r(this.Tb,this);this.a.ontimeout=r(this.Ub,this)}h=sf.prototype;h.open=function(a,b,c){if(null!=c&&!c)throw Error(\"Only async requests are supported.\");this.a.open(a,b)};\nh.send=function(a){if(a)if(\"string\"==typeof a)this.a.send(a);else throw Error(\"Only string data is supported\");else this.a.send()};h.abort=function(){this.a.abort()};h.setRequestHeader=function(){};h.getResponseHeader=function(a){return\"content-type\"==a.toLowerCase()?this.a.contentType:\"\"};h.Sb=function(){this.status=200;this.responseText=this.a.responseText;tf(this,4)};h.wb=function(){this.status=500;this.responseText=\"\";tf(this,4)};h.Ub=function(){this.wb()};\nh.Tb=function(){this.status=200;tf(this,1)};function tf(a,b){a.readyState=b;if(a.onreadystatechange)a.onreadystatechange()}h.getAllResponseHeaders=function(){return\"content-type: \"+this.a.contentType};function uf(){var a=J();return y&&!!kb&&11==kb||/Edge\\/\\d+/.test(a)}function vf(){return k.window&&k.window.location.href||\"\"}function wf(a,b){b=b||k.window;var c=\"about:blank\";a&&(c=nc(pc(a)));b.location.href=c}function xf(a,b){var c=[],d;for(d in a)d in b?typeof a[d]!=typeof b[d]?c.push(d):fa(a[d])?Ta(a[d],b[d])||c.push(d):\"object\"==typeof a[d]&&null!=a[d]&&null!=b[d]?0<xf(a[d],b[d]).length&&c.push(d):a[d]!==b[d]&&c.push(d):c.push(d);for(d in b)d in a||c.push(d);return c}\nfunction yf(){var a=J();a=zf(a)!=Af?null:(a=a.match(/\\sChrome\\/(\\d+)/i))&&2==a.length?parseInt(a[1],10):null;return a&&30>a?!1:!y||!kb||9<kb}function Bf(a){a=(a||J()).toLowerCase();return a.match(/android/)||a.match(/webos/)||a.match(/iphone|ipad|ipod/)||a.match(/blackberry/)||a.match(/windows phone/)||a.match(/iemobile/)?!0:!1}function Cf(a){a=a||k.window;try{a.close()}catch(b){}}\nfunction Df(a,b,c){var d=Math.floor(1E9*Math.random()).toString();b=b||500;c=c||600;var e=(window.screen.availHeight-c)/2,f=(window.screen.availWidth-b)/2;b={width:b,height:c,top:0<e?e:0,left:0<f?f:0,location:!0,resizable:!0,statusbar:!0,toolbar:!1};c=J().toLowerCase();d&&(b.target=d,v(c,\"crios/\")&&(b.target=\"_blank\"));zf(J())==Ef&&(a=a||\"http://localhost\",b.scrollbars=!0);c=a||\"\";(d=b)||(d={});a=window;b=c instanceof lc?c:pc(\"undefined\"!=typeof c.href?c.href:String(c));c=d.target||c.target;e=[];\nfor(g in d)switch(g){case \"width\":case \"height\":case \"top\":case \"left\":e.push(g+\"=\"+d[g]);break;case \"target\":case \"noreferrer\":break;default:e.push(g+\"=\"+(d[g]?1:0))}var g=e.join(\",\");(x(\"iPhone\")&&!x(\"iPod\")&&!x(\"iPad\")||x(\"iPad\")||x(\"iPod\"))&&a.navigator&&a.navigator.standalone&&c&&\"_self\"!=c?(g=a.document.createElement(\"A\"),b instanceof lc||b instanceof lc||(b=b.la?b.ja():String(b),oc.test(b)||(b=\"about:invalid#zClosurez\"),b=qc(b)),g.href=nc(b),g.setAttribute(\"target\",c),d.noreferrer&&g.setAttribute(\"rel\",\n\"noreferrer\"),d=document.createEvent(\"MouseEvent\"),d.initMouseEvent(\"click\",!0,!0,a,1),g.dispatchEvent(d),g={}):d.noreferrer?(g=a.open(\"\",c,g),a=nc(b),g&&(bb&&v(a,\";\")&&(a=\"'\"+a.replace(/'/g,\"%27\")+\"'\"),g.opener=null,dc(\"b/12014412, meta tag with sanitized URL\"),a='<META HTTP-EQUIV=\"refresh\" content=\"0; url='+qa(a)+'\">',a=vc(a),g.document.write(uc(a)),g.document.close())):g=a.open(nc(b),c,g);if(g)try{g.focus()}catch(l){}return g}\nfunction Ff(a){return new z(function(b){function c(){sd(2E3).then(function(){if(!a||a.closed)b();else return c()})}return c()})}var Gf=/^\\d{1,3}\\.\\d{1,3}\\.\\d{1,3}\\.\\d{1,3}$/;function Hf(){var a=null;return(new z(function(b){\"complete\"==k.document.readyState?b():(a=function(){b()},dd(window,\"load\",a))})).s(function(b){E(window,\"load\",a);throw b;})}\nfunction If(){return Jf(void 0)?Hf().then(function(){return new z(function(a,b){var c=k.document,d=setTimeout(function(){b(Error(\"Cordova framework is not ready.\"))},1E3);c.addEventListener(\"deviceready\",function(){clearTimeout(d);a()},!1)})}):B(Error(\"Cordova must run in an Android or iOS file scheme.\"))}function Jf(a){a=a||J();return!(\"file:\"!==Kf()||!a.toLowerCase().match(/iphone|ipad|ipod|android/))}function Lf(){var a=k.window;try{return!(!a||a==a.top)}catch(b){return!1}}\nfunction K(){return firebase.INTERNAL.hasOwnProperty(\"reactNative\")?\"ReactNative\":firebase.INTERNAL.hasOwnProperty(\"node\")?\"Node\":\"Browser\"}function Mf(){var a=K();return\"ReactNative\"===a||\"Node\"===a}var Ef=\"Firefox\",Af=\"Chrome\";\nfunction zf(a){var b=a.toLowerCase();if(v(b,\"opera/\")||v(b,\"opr/\")||v(b,\"opios/\"))return\"Opera\";if(v(b,\"iemobile\"))return\"IEMobile\";if(v(b,\"msie\")||v(b,\"trident/\"))return\"IE\";if(v(b,\"edge/\"))return\"Edge\";if(v(b,\"firefox/\"))return Ef;if(v(b,\"silk/\"))return\"Silk\";if(v(b,\"blackberry\"))return\"Blackberry\";if(v(b,\"webos\"))return\"Webos\";if(!v(b,\"safari/\")||v(b,\"chrome/\")||v(b,\"crios/\")||v(b,\"android\"))if(!v(b,\"chrome/\")&&!v(b,\"crios/\")||v(b,\"edge/\")){if(v(b,\"android\"))return\"Android\";if((a=a.match(/([a-zA-Z\\d\\.]+)\\/[a-zA-Z\\d\\.]*$/))&&\n2==a.length)return a[1]}else return Af;else return\"Safari\";return\"Other\"}var Nf={Cc:\"FirebaseCore-web\",Ec:\"FirebaseUI-web\"};function Of(a,b){b=b||[];var c=[],d={},e;for(e in Nf)d[Nf[e]]=!0;for(e=0;e<b.length;e++)\"undefined\"!==typeof d[b[e]]&&(delete d[b[e]],c.push(b[e]));c.sort();b=c;b.length||(b=[\"FirebaseCore-web\"]);c=K();d=\"\";\"Browser\"===c?d=zf(J()):d=c;return d+\"/JsCore/\"+a+\"/\"+b.join(\",\")}function J(){return k.navigator&&k.navigator.userAgent||\"\"}\nfunction L(a,b){a=a.split(\".\");b=b||k;for(var c=0;c<a.length&&\"object\"==typeof b&&null!=b;c++)b=b[a[c]];c!=a.length&&(b=void 0);return b}function Pf(){try{var a=k.localStorage,b=Qf();if(a)return a.setItem(b,\"1\"),a.removeItem(b),uf()?!!k.indexedDB:!0}catch(c){}return!1}function Rf(){return(Sf()||\"chrome-extension:\"===Kf()||Jf())&&!Mf()&&Pf()}function Sf(){return\"http:\"===Kf()||\"https:\"===Kf()}function Kf(){return k.location&&k.location.protocol||null}\nfunction Tf(a){a=a||J();return Bf(a)||zf(a)==Ef?!1:!0}function Uf(a){return\"undefined\"===typeof a?null:Cc(a)}function Vf(a){var b={},c;for(c in a)a.hasOwnProperty(c)&&null!==a[c]&&void 0!==a[c]&&(b[c]=a[c]);return b}function Wf(a){if(null!==a)return JSON.parse(a)}function Qf(a){return a?a:\"\"+Math.floor(1E9*Math.random()).toString()}function Xf(a){a=a||J();return\"Safari\"==zf(a)||a.toLowerCase().match(/iphone|ipad|ipod/)?!1:!0}\nfunction Yf(){var a=k.___jsl;if(a&&a.H)for(var b in a.H)if(a.H[b].r=a.H[b].r||[],a.H[b].L=a.H[b].L||[],a.H[b].r=a.H[b].L.concat(),a.CP)for(var c=0;c<a.CP.length;c++)a.CP[c]=null}function Zf(){var a=k.navigator;return a&&\"boolean\"===typeof a.onLine&&(Sf()||\"chrome-extension:\"===Kf()||\"undefined\"!==typeof a.connection)?a.onLine:!0}function $f(a,b,c,d){if(a>b)throw Error(\"Short delay should be less than long delay!\");this.c=a;this.b=b;a=c||J();d=d||K();this.a=Bf(a)||\"ReactNative\"===d}\n$f.prototype.get=function(){return this.a?this.b:this.c};function ag(){var a=k.document;return a&&\"undefined\"!==typeof a.visibilityState?\"visible\"==a.visibilityState:!0}function bg(){var a=k.document,b=null;return ag()||!a?A():(new z(function(c){b=function(){ag()&&(a.removeEventListener(\"visibilitychange\",b,!1),c())};a.addEventListener(\"visibilitychange\",b,!1)})).s(function(c){a.removeEventListener(\"visibilitychange\",b,!1);throw c;})}\nfunction cg(a){try{var b=new Date(parseInt(a,10));if(!isNaN(b.getTime())&&!/[^0-9]/.test(a))return b.toUTCString()}catch(c){}return null};var dg={};var eg;try{var fg={};Object.defineProperty(fg,\"abcd\",{configurable:!0,enumerable:!0,value:1});Object.defineProperty(fg,\"abcd\",{configurable:!0,enumerable:!0,value:2});eg=2==fg.abcd}catch(a){eg=!1}function M(a,b,c){eg?Object.defineProperty(a,b,{configurable:!0,enumerable:!0,value:c}):a[b]=c}function gg(a,b){if(b)for(var c in b)b.hasOwnProperty(c)&&M(a,c,b[c])}function hg(a){var b={};gg(b,a);return b}function ig(a){var b={},c;for(c in a)a.hasOwnProperty(c)&&(b[c]=a[c]);return b}\nfunction jg(a,b){if(!b||!b.length)return!0;if(!a)return!1;for(var c=0;c<b.length;c++){var d=a[b[c]];if(void 0===d||null===d||\"\"===d)return!1}return!0}function kg(a){var b=a;if(\"object\"==typeof a&&null!=a){b=\"length\"in a?[]:{};for(var c in a)M(b,c,kg(a[c]))}return b};function lg(a){var b={},c=a[mg],d=a[ng];a=a[og];if(!c||!a)throw Error(\"Invalid provider user info!\");b[pg]=d||null;b[qg]=c;M(this,rg,a);M(this,sg,kg(b))}var mg=\"email\",ng=\"newEmail\",og=\"requestType\",qg=\"email\",pg=\"fromEmail\",sg=\"data\",rg=\"operation\";function N(a,b){this.code=tg+a;this.message=b||ug[a]||\"\"}t(N,Error);N.prototype.B=function(){return{code:this.code,message:this.message}};N.prototype.toJSON=function(){return this.B()};function vg(a){var b=a&&a.code;return b?new N(b.substring(tg.length),a.message):null}\nvar tg=\"auth/\",ug={\"argument-error\":\"\",\"app-not-authorized\":\"This app, identified by the domain where it's hosted, is not authorized to use Firebase Authentication with the provided API key. Review your key configuration in the Google API console.\",\"app-not-installed\":\"The requested mobile application corresponding to the identifier (Android package name or iOS bundle ID) provided is not installed on this device.\",\"captcha-check-failed\":\"The reCAPTCHA response token provided is either invalid, expired, already used or the domain associated with it does not match the list of whitelisted domains.\",\n\"code-expired\":\"The SMS code has expired. Please re-send the verification code to try again.\",\"cordova-not-ready\":\"Cordova framework is not ready.\",\"cors-unsupported\":\"This browser is not supported.\",\"credential-already-in-use\":\"This credential is already associated with a different user account.\",\"custom-token-mismatch\":\"The custom token corresponds to a different audience.\",\"requires-recent-login\":\"This operation is sensitive and requires recent authentication. Log in again before retrying this request.\",\n\"dynamic-link-not-activated\":\"Please activate Dynamic Links in the Firebase Console and agree to the terms and conditions.\",\"email-already-in-use\":\"The email address is already in use by another account.\",\"expired-action-code\":\"The action code has expired. \",\"cancelled-popup-request\":\"This operation has been cancelled due to another conflicting popup being opened.\",\"internal-error\":\"An internal error has occurred.\",\"invalid-app-credential\":\"The phone verification request contains an invalid application verifier. The reCAPTCHA token response is either invalid or expired.\",\n\"invalid-app-id\":\"The mobile app identifier is not registed for the current project.\",\"invalid-user-token\":\"The user's credential is no longer valid. The user must sign in again.\",\"invalid-auth-event\":\"An internal error has occurred.\",\"invalid-verification-code\":\"The SMS verification code used to create the phone auth credential is invalid. Please resend the verification code sms and be sure use the verification code provided by the user.\",\"invalid-continue-uri\":\"The continue URL provided in the request is invalid.\",\n\"invalid-cordova-configuration\":\"The following Cordova plugins must be installed to enable OAuth sign-in: cordova-plugin-buildinfo, cordova-universal-links-plugin, cordova-plugin-browsertab, cordova-plugin-inappbrowser and cordova-plugin-customurlscheme.\",\"invalid-custom-token\":\"The custom token format is incorrect. Please check the documentation.\",\"invalid-email\":\"The email address is badly formatted.\",\"invalid-api-key\":\"Your API key is invalid, please check you have copied it correctly.\",\"invalid-cert-hash\":\"The SHA-1 certificate hash provided is invalid.\",\n\"invalid-credential\":\"The supplied auth credential is malformed or has expired.\",\"invalid-persistence-type\":\"The specified persistence type is invalid. It can only be local, session or none.\",\"invalid-message-payload\":\"The email template corresponding to this action contains invalid characters in its message. Please fix by going to the Auth email templates section in the Firebase Console.\",\"invalid-oauth-provider\":\"EmailAuthProvider is not supported for this operation. This operation only supports OAuth providers.\",\n\"invalid-oauth-client-id\":\"The OAuth client ID provided is either invalid or does not match the specified API key.\",\"unauthorized-domain\":\"This domain is not authorized for OAuth operations for your Firebase project. Edit the list of authorized domains from the Firebase console.\",\"invalid-action-code\":\"The action code is invalid. This can happen if the code is malformed, expired, or has already been used.\",\"wrong-password\":\"The password is invalid or the user does not have a password.\",\"invalid-phone-number\":\"The format of the phone number provided is incorrect. Please enter the phone number in a format that can be parsed into E.164 format. E.164 phone numbers are written in the format [+][country code][subscriber number including area code].\",\n\"invalid-recipient-email\":\"The email corresponding to this action failed to send as the provided recipient email address is invalid.\",\"invalid-sender\":\"The email template corresponding to this action contains an invalid sender email or name. Please fix by going to the Auth email templates section in the Firebase Console.\",\"invalid-verification-id\":\"The verification ID used to create the phone auth credential is invalid.\",\"missing-android-pkg-name\":\"An Android Package Name must be provided if the Android App is required to be installed.\",\n\"auth-domain-config-required\":\"Be sure to include authDomain when calling firebase.initializeApp(), by following the instructions in the Firebase console.\",\"missing-app-credential\":\"The phone verification request is missing an application verifier assertion. A reCAPTCHA response token needs to be provided.\",\"missing-verification-code\":\"The phone auth credential was created with an empty SMS verification code.\",\"missing-continue-uri\":\"A continue URL must be provided in the request.\",\"missing-iframe-start\":\"An internal error has occurred.\",\n\"missing-ios-bundle-id\":\"An iOS Bundle ID must be provided if an App Store ID is provided.\",\"missing-phone-number\":\"To send verification codes, provide a phone number for the recipient.\",\"missing-verification-id\":\"The phone auth credential was created with an empty verification ID.\",\"app-deleted\":\"This instance of FirebaseApp has been deleted.\",\"account-exists-with-different-credential\":\"An account already exists with the same email address but different sign-in credentials. Sign in using a provider associated with this email address.\",\n\"network-request-failed\":\"A network error (such as timeout, interrupted connection or unreachable host) has occurred.\",\"no-auth-event\":\"An internal error has occurred.\",\"no-such-provider\":\"User was not linked to an account with the given provider.\",\"operation-not-allowed\":\"The given sign-in provider is disabled for this Firebase project. Enable it in the Firebase console, under the sign-in method tab of the Auth section.\",\"operation-not-supported-in-this-environment\":'This operation is not supported in the environment this application is running on. \"location.protocol\" must be http, https or chrome-extension and web storage must be enabled.',\n\"popup-blocked\":\"Unable to establish a connection with the popup. It may have been blocked by the browser.\",\"popup-closed-by-user\":\"The popup has been closed by the user before finalizing the operation.\",\"provider-already-linked\":\"User can only be linked to one identity for the given provider.\",\"quota-exceeded\":\"The project's quota for this operation has been exceeded.\",\"redirect-cancelled-by-user\":\"The redirect operation has been cancelled by the user before finalizing.\",\"redirect-operation-pending\":\"A redirect sign-in operation is already pending.\",\ntimeout:\"The operation has timed out.\",\"user-token-expired\":\"The user's credential is no longer valid. The user must sign in again.\",\"too-many-requests\":\"We have blocked all requests from this device due to unusual activity. Try again later.\",\"unauthorized-continue-uri\":\"The domain of the continue URL is not whitelisted.  Please whitelist the domain in the Firebase console.\",\"unsupported-persistence-type\":\"The current environment does not support the specified persistence type.\",\"user-cancelled\":\"User did not grant your application the permissions it requested.\",\n\"user-not-found\":\"There is no user record corresponding to this identifier. The user may have been deleted.\",\"user-disabled\":\"The user account has been disabled by an administrator.\",\"user-mismatch\":\"The supplied credentials do not correspond to the previously signed in user.\",\"user-signed-out\":\"\",\"weak-password\":\"The password must be 6 characters long or more.\",\"web-storage-unsupported\":\"This browser is not supported or 3rd party cookies and data may be disabled.\"};function wg(a){var b=a[xg];if(\"undefined\"===typeof b)throw new N(\"missing-continue-uri\");if(\"string\"!==typeof b||\"string\"===typeof b&&!b.length)throw new N(\"invalid-continue-uri\");this.h=b;this.c=this.a=null;this.g=!1;var c=a[yg];if(c&&\"object\"===typeof c){b=c[zg];var d=c[Ag];c=c[Bg];if(\"string\"===typeof b&&b.length){this.a=b;if(\"undefined\"!==typeof d&&\"boolean\"!==typeof d)throw new N(\"argument-error\",Ag+\" property must be a boolean when specified.\");this.g=!!d;if(\"undefined\"!==typeof c&&(\"string\"!==\ntypeof c||\"string\"===typeof c&&!c.length))throw new N(\"argument-error\",Bg+\" property must be a non empty string when specified.\");this.c=c||null}else{if(\"undefined\"!==typeof b)throw new N(\"argument-error\",zg+\" property must be a non empty string when specified.\");if(\"undefined\"!==typeof d||\"undefined\"!==typeof c)throw new N(\"missing-android-pkg-name\");}}else if(\"undefined\"!==typeof c)throw new N(\"argument-error\",yg+\" property must be a non null object when specified.\");this.b=null;if((b=a[Cg])&&\"object\"===\ntypeof b)if(b=b[Dg],\"string\"===typeof b&&b.length)this.b=b;else{if(\"undefined\"!==typeof b)throw new N(\"argument-error\",Dg+\" property must be a non empty string when specified.\");}else if(\"undefined\"!==typeof b)throw new N(\"argument-error\",Cg+\" property must be a non null object when specified.\");a=a[Eg];if(\"undefined\"!==typeof a&&\"boolean\"!==typeof a)throw new N(\"argument-error\",Eg+\" property must be a boolean when specified.\");if((this.f=!!a)&&!this.b&&!this.a)throw new N(\"argument-error\",Eg+\" property can't be true when no mobile application is provided.\");\n}var yg=\"android\",Eg=\"handleCodeInApp\",Cg=\"iOS\",xg=\"url\",Ag=\"installApp\",Bg=\"minimumVersion\",zg=\"packageName\",Dg=\"bundleId\";function Fg(a){var b={};b.continueUrl=a.h;b.canHandleCodeInApp=a.f;if(b.androidPackageName=a.a)b.androidMinimumVersion=a.c,b.androidInstallApp=a.g;b.iOSBundleId=a.b;for(var c in b)null===b[c]&&delete b[c];return b};function Gg(a){this.b=a.sub;na();this.a=a.provider_id||a.firebase&&a.firebase.sign_in_provider||null}function Hg(a){a=a.split(\".\");if(3!=a.length)return null;a=a[1];for(var b=(4-a.length%4)%4,c=0;c<b;c++)a+=\".\";try{var d=JSON.parse(Kd(a));if(d.sub&&d.iss&&d.aud&&d.exp)return new Gg(d)}catch(e){}return null};var Ig=\"oauth_consumer_key oauth_nonce oauth_signature oauth_signature_method oauth_timestamp oauth_token oauth_version\".split(\" \"),Jg=[\"client_id\",\"response_type\",\"scope\",\"redirect_uri\",\"state\"],Kg={Dc:{Ma:\"locale\",za:500,ya:600,Na:\"facebook.com\",$a:Jg},Fc:{Ma:null,za:500,ya:620,Na:\"github.com\",$a:Jg},Gc:{Ma:\"hl\",za:515,ya:680,Na:\"google.com\",$a:Jg},Mc:{Ma:\"lang\",za:485,ya:705,Na:\"twitter.com\",$a:Ig}};function Lg(a){for(var b in Kg)if(Kg[b].Na==a)return Kg[b];return null};function Mg(a){var b={};b[\"facebook.com\"]=Ng;b[\"google.com\"]=Og;b[\"github.com\"]=Pg;b[\"twitter.com\"]=Qg;var c=a&&a[Rg];try{if(c)return b[c]?new b[c](a):new Sg(a);if(\"undefined\"!==typeof a[Tg])return new Ug(a)}catch(d){}return null}var Tg=\"idToken\",Rg=\"providerId\";function Ug(a){var b=a[Rg];if(!b&&a[Tg]){var c=Hg(a[Tg]);c&&c.a&&(b=c.a)}if(!b)throw Error(\"Invalid additional user info!\");a=!!a.isNewUser;M(this,\"providerId\",b);M(this,\"isNewUser\",a)}\nfunction Sg(a){Ug.call(this,a);a=Wf(a.rawUserInfo||\"{}\");M(this,\"profile\",kg(a||{}))}t(Sg,Ug);function Ng(a){Sg.call(this,a);if(\"facebook.com\"!=this.providerId)throw Error(\"Invalid provider ID!\");}t(Ng,Sg);function Pg(a){Sg.call(this,a);if(\"github.com\"!=this.providerId)throw Error(\"Invalid provider ID!\");M(this,\"username\",this.profile&&this.profile.login||null)}t(Pg,Sg);function Og(a){Sg.call(this,a);if(\"google.com\"!=this.providerId)throw Error(\"Invalid provider ID!\");}t(Og,Sg);\nfunction Qg(a){Sg.call(this,a);if(\"twitter.com\"!=this.providerId)throw Error(\"Invalid provider ID!\");M(this,\"username\",a.screenName||null)}t(Qg,Sg);function Vg(a,b){return a.then(function(a){if(a[O]){var c=Hg(a[O]);if(!c||b!=c.b)throw new N(\"user-mismatch\");return a}throw new N(\"user-mismatch\");}).s(function(a){throw a&&a.code&&a.code==tg+\"user-not-found\"?new N(\"user-mismatch\"):a;})}\nfunction Wg(a,b){if(b.idToken||b.accessToken)b.idToken&&M(this,\"idToken\",b.idToken),b.accessToken&&M(this,\"accessToken\",b.accessToken);else if(b.oauthToken&&b.oauthTokenSecret)M(this,\"accessToken\",b.oauthToken),M(this,\"secret\",b.oauthTokenSecret);else throw new N(\"internal-error\",\"failed to construct a credential\");M(this,\"providerId\",a)}Wg.prototype.wa=function(a){return Xg(a,Yg(this))};Wg.prototype.b=function(a,b){var c=Yg(this);c.idToken=b;return Zg(a,c)};\nWg.prototype.c=function(a,b){var c=Yg(this);return Vg($g(a,c),b)};function Yg(a){var b={};a.idToken&&(b.id_token=a.idToken);a.accessToken&&(b.access_token=a.accessToken);a.secret&&(b.oauth_token_secret=a.secret);b.providerId=a.providerId;return{postBody:Ie(b).toString(),requestUri:\"http://localhost\"}}\nWg.prototype.B=function(){var a={providerId:this.providerId};this.idToken&&(a.oauthIdToken=this.idToken);this.accessToken&&(a.oauthAccessToken=this.accessToken);this.secret&&(a.oauthTokenSecret=this.secret);return a};function ah(a,b){this.nc=b||[];gg(this,{providerId:a,isOAuthProvider:!0});this.qb={};this.Wa=(Lg(a)||{}).Ma||null;this.Ua=null}ah.prototype.Ba=function(a){this.qb=Ua(a);return this};function P(a){ah.call(this,a,Jg);this.a=[]}t(P,ah);\nP.prototype.sa=function(a){Ha(this.a,a)||this.a.push(a);return this};P.prototype.vb=function(){return La(this.a)};P.prototype.credential=function(a,b){if(!a&&!b)throw new N(\"argument-error\",\"credential failed: must provide the ID token and/or the access token.\");return new Wg(this.providerId,{idToken:a||null,accessToken:b||null})};function bh(){P.call(this,\"facebook.com\")}t(bh,P);M(bh,\"PROVIDER_ID\",\"facebook.com\");\nfunction ch(a){if(!a)throw new N(\"argument-error\",\"credential failed: expected 1 argument (the OAuth access token).\");var b=a;q(a)&&(b=a.accessToken);return(new bh).credential(null,b)}function dh(){P.call(this,\"github.com\")}t(dh,P);M(dh,\"PROVIDER_ID\",\"github.com\");function eh(a){if(!a)throw new N(\"argument-error\",\"credential failed: expected 1 argument (the OAuth access token).\");var b=a;q(a)&&(b=a.accessToken);return(new dh).credential(null,b)}\nfunction fh(){P.call(this,\"google.com\");this.sa(\"profile\")}t(fh,P);M(fh,\"PROVIDER_ID\",\"google.com\");function gh(a,b){var c=a;q(a)&&(c=a.idToken,b=a.accessToken);return(new fh).credential(c,b)}function hh(){ah.call(this,\"twitter.com\",Ig)}t(hh,ah);M(hh,\"PROVIDER_ID\",\"twitter.com\");\nfunction ih(a,b){var c=a;q(c)||(c={oauthToken:a,oauthTokenSecret:b});if(!c.oauthToken||!c.oauthTokenSecret)throw new N(\"argument-error\",\"credential failed: expected 2 arguments (the OAuth access token and secret).\");return new Wg(\"twitter.com\",c)}function jh(a,b){this.a=a;this.f=b;M(this,\"providerId\",\"password\")}jh.prototype.wa=function(a){return Q(a,kh,{email:this.a,password:this.f})};jh.prototype.b=function(a,b){return Q(a,lh,{idToken:b,email:this.a,password:this.f})};\njh.prototype.c=function(a,b){return Vg(this.wa(a),b)};jh.prototype.B=function(){return{email:this.a,password:this.f}};function mh(){gg(this,{providerId:\"password\",isOAuthProvider:!1})}gg(mh,{PROVIDER_ID:\"password\"});function nh(a){if(!(a.Pa&&a.Oa||a.Da&&a.Y))throw new N(\"internal-error\");this.a=a;M(this,\"providerId\",\"phone\")}nh.prototype.wa=function(a){return a.Qa(oh(this))};nh.prototype.b=function(a,b){var c=oh(this);c.idToken=b;return Q(a,ph,c)};\nnh.prototype.c=function(a,b){var c=oh(this);c.operation=\"REAUTH\";a=Q(a,qh,c);return Vg(a,b)};nh.prototype.B=function(){var a={providerId:\"phone\"};this.a.Pa&&(a.verificationId=this.a.Pa);this.a.Oa&&(a.verificationCode=this.a.Oa);this.a.Da&&(a.temporaryProof=this.a.Da);this.a.Y&&(a.phoneNumber=this.a.Y);return a};function oh(a){return a.a.Da&&a.a.Y?{temporaryProof:a.a.Da,phoneNumber:a.a.Y}:{sessionInfo:a.a.Pa,code:a.a.Oa}}\nfunction rh(a){try{this.a=a||firebase.auth()}catch(b){throw new N(\"argument-error\",\"Either an instance of firebase.auth.Auth must be passed as an argument to the firebase.auth.PhoneAuthProvider constructor, or the default firebase App instance must be initialized via firebase.initializeApp().\");}gg(this,{providerId:\"phone\",isOAuthProvider:!1})}\nrh.prototype.Qa=function(a,b){var c=this.a.c;return A(b.verify()).then(function(d){if(!m(d))throw new N(\"argument-error\",\"An implementation of firebase.auth.ApplicationVerifier.prototype.verify() must return a firebase.Promise that resolves with a string.\");switch(b.type){case \"recaptcha\":return sh(c,{phoneNumber:a,recaptchaToken:d}).then(function(a){\"function\"===typeof b.reset&&b.reset();return a},function(a){\"function\"===typeof b.reset&&b.reset();throw a;});default:throw new N(\"argument-error\",\n'Only firebase.auth.ApplicationVerifiers with type=\"recaptcha\" are currently supported.');}})};function th(a,b){if(!a)throw new N(\"missing-verification-id\");if(!b)throw new N(\"missing-verification-code\");return new nh({Pa:a,Oa:b})}gg(rh,{PROVIDER_ID:\"phone\"});\nfunction uh(a){if(a.temporaryProof&&a.phoneNumber)return new nh({Da:a.temporaryProof,Y:a.phoneNumber});var b=a&&a.providerId;if(!b||\"password\"===b)return null;var c=a&&a.oauthAccessToken,d=a&&a.oauthTokenSecret;a=a&&a.oauthIdToken;try{switch(b){case \"google.com\":return gh(a,c);case \"facebook.com\":return ch(c);case \"github.com\":return eh(c);case \"twitter.com\":return ih(c,d);default:return(new P(b)).credential(a,c)}}catch(e){return null}}\nfunction vh(a){if(!a.isOAuthProvider)throw new N(\"invalid-oauth-provider\");};function wh(a,b,c,d,e){this.b=a;this.c=b||null;this.f=c||null;this.g=d||null;this.a=e||null;if(this.f||this.a){if(this.f&&this.a)throw new N(\"invalid-auth-event\");if(this.f&&!this.g)throw new N(\"invalid-auth-event\");}else throw new N(\"invalid-auth-event\");}wh.prototype.B=function(){return{type:this.b,eventId:this.c,urlResponse:this.f,sessionId:this.g,error:this.a&&this.a.B()}};function xh(a){a=a||{};return a.type?new wh(a.type,a.eventId,a.urlResponse,a.sessionId,a.error&&vg(a.error)):null};function yh(a){var b=\"unauthorized-domain\",c=void 0,d=De(a);a=d.b;d=d.c;\"chrome-extension\"==d?c=oa(\"This chrome extension ID (chrome-extension://%s) is not authorized to run this operation. Add it to the OAuth redirect domains list in the Firebase console -> Auth section -> Sign in method tab.\",a):\"http\"==d||\"https\"==d?c=oa(\"This domain (%s) is not authorized to run this operation. Add it to the OAuth redirect domains list in the Firebase console -> Auth section -> Sign in method tab.\",a):b=\"operation-not-supported-in-this-environment\";\nN.call(this,b,c)}t(yh,N);function zh(a,b,c){N.call(this,a,c);a=b||{};a.rb&&M(this,\"email\",a.rb);a.Y&&M(this,\"phoneNumber\",a.Y);a.credential&&M(this,\"credential\",a.credential)}t(zh,N);zh.prototype.B=function(){var a={code:this.code,message:this.message};this.email&&(a.email=this.email);this.phoneNumber&&(a.phoneNumber=this.phoneNumber);var b=this.credential&&this.credential.B();b&&Wa(a,b);return a};zh.prototype.toJSON=function(){return this.B()};\nfunction Ah(a){if(a.code){var b=a.code||\"\";0==b.indexOf(tg)&&(b=b.substring(tg.length));var c={credential:uh(a)};if(a.email)c.rb=a.email;else if(a.phoneNumber)c.Y=a.phoneNumber;else return new N(b,a.message||void 0);return new zh(b,c,a.message)}return null};function Bh(a){this.f=a}t(Bh,Ne);Bh.prototype.a=function(){return new this.f};Bh.prototype.b=function(){return{}};\nfunction Ch(a,b,c){var d=\"Node\"==K();d=k.XMLHttpRequest||d&&firebase.INTERNAL.node&&firebase.INTERNAL.node.XMLHttpRequest;if(!d)throw new N(\"internal-error\",\"The XMLHttpRequest compatibility library was not found.\");this.b=a;a=b||{};this.i=a.secureTokenEndpoint||\"https://securetoken.googleapis.com/v1/token\";this.l=a.secureTokenTimeout||Dh;this.c=Ua(a.secureTokenHeaders||Eh);this.g=a.firebaseEndpoint||\"https://www.googleapis.com/identitytoolkit/v3/relyingparty/\";this.h=a.firebaseTimeout||Fh;this.a=\nUa(a.firebaseHeaders||Gh);c&&(this.a[\"X-Client-Version\"]=c,this.c[\"X-Client-Version\"]=c);this.f=new rf;this.o=new Bh(d)}var Hh,O=\"idToken\",Dh=new $f(3E4,6E4),Eh={\"Content-Type\":\"application/x-www-form-urlencoded\"},Fh=new $f(3E4,6E4),Gh={\"Content-Type\":\"application/json\"};function Ih(a,b){b?a.a[\"X-Firebase-Locale\"]=b:delete a.a[\"X-Firebase-Locale\"]}function Jh(a,b){b?(a.a[\"X-Client-Version\"]=b,a.c[\"X-Client-Version\"]=b):(delete a.a[\"X-Client-Version\"],delete a.c[\"X-Client-Version\"])}\nfunction Kh(a,b,c,d,e,f,g){Zf()?(yf()?a=r(a.m,a):(Hh||(Hh=new z(function(a,b){Lh(a,b)})),a=r(a.u,a)),a(b,c,d,e,f,g)):c&&c(null)}\nCh.prototype.m=function(a,b,c,d,e,f){var g=\"Node\"==K(),l=Mf()?g?new Se(this.o):new Se:new Se(this.f);if(f){l.f=Math.max(0,f);var n=setTimeout(function(){G(l,\"timeout\")},f)}fd(l,\"complete\",function(){n&&clearTimeout(n);var a=null;try{a=JSON.parse(hf(this))||null}catch(vb){a=null}b&&b(a)});ld(l,\"ready\",function(){n&&clearTimeout(n);Lc(this)});ld(l,\"timeout\",function(){n&&clearTimeout(n);Lc(this);b&&b(null)});Ye(l,a,c,d,e)};\nvar Mh=dc(\"https://apis.google.com/js/client.js?onload=%{onload}\"),Nh=\"__fcb\"+Math.floor(1E6*Math.random()).toString();function Lh(a,b){if(((window.gapi||{}).client||{}).request)a();else{k[Nh]=function(){((window.gapi||{}).client||{}).request?a():b(Error(\"CORS_UNSUPPORTED\"))};var c=hc(Mh,{onload:Nh});Td(kf(c),function(){b(Error(\"CORS_UNSUPPORTED\"))})}}\nCh.prototype.u=function(a,b,c,d,e){var f=this;Hh.then(function(){window.gapi.client.setApiKey(f.b);var g=window.gapi.auth.getToken();window.gapi.auth.setToken(null);window.gapi.client.request({path:a,method:c,body:d,headers:e,authType:\"none\",callback:function(a){window.gapi.auth.setToken(g);b&&b(a)}})}).s(function(a){b&&b({error:{message:a&&a.message||\"CORS_UNSUPPORTED\"}})})};\nfunction Oh(a,b){return new z(function(c,d){\"refresh_token\"==b.grant_type&&b.refresh_token||\"authorization_code\"==b.grant_type&&b.code?Kh(a,a.i+\"?key=\"+encodeURIComponent(a.b),function(a){a?a.error?d(Ph(a)):a.access_token&&a.refresh_token?c(a):d(new N(\"internal-error\")):d(new N(\"network-request-failed\"))},\"POST\",Ie(b).toString(),a.c,a.l.get()):d(new N(\"internal-error\"))})}\nfunction Qh(a,b,c,d,e,f){var g=De(a.g+b);I(g,\"key\",a.b);f&&I(g,\"cb\",na().toString());var l=\"GET\"==c;if(l)for(var n in d)d.hasOwnProperty(n)&&I(g,n,d[n]);return new z(function(b,f){Kh(a,g.toString(),function(a){a?a.error?f(Ph(a,e||{})):b(a):f(new N(\"network-request-failed\"))},c,l?void 0:Cc(Vf(d)),a.a,a.h.get())})}function Rh(a){if(!jf.test(a.email))throw new N(\"invalid-email\");}function Sh(a){\"email\"in a&&Rh(a)}\nfunction Th(a,b){return Q(a,Uh,{identifier:b,continueUri:Sf()?vf():\"http://localhost\"}).then(function(a){return a.allProviders||[]})}function Vh(a){return Q(a,Wh,{}).then(function(a){return a.authorizedDomains||[]})}function Xh(a){if(!a[O])throw new N(\"internal-error\");}\nfunction Yh(a){if(a.phoneNumber||a.temporaryProof){if(!a.phoneNumber||!a.temporaryProof)throw new N(\"internal-error\");}else{if(!a.sessionInfo)throw new N(\"missing-verification-id\");if(!a.code)throw new N(\"missing-verification-code\");}}Ch.prototype.gb=function(){return Q(this,Zh,{})};Ch.prototype.kb=function(a,b){return Q(this,$h,{idToken:a,email:b})};Ch.prototype.lb=function(a,b){return Q(this,lh,{idToken:a,password:b})};var ai={displayName:\"DISPLAY_NAME\",photoUrl:\"PHOTO_URL\"};h=Ch.prototype;\nh.mb=function(a,b){var c={idToken:a},d=[];Pa(ai,function(a,f){var e=b[f];null===e?d.push(a):f in b&&(c[f]=e)});d.length&&(c.deleteAttribute=d);return Q(this,$h,c)};h.cb=function(a,b){a={requestType:\"PASSWORD_RESET\",email:a};Wa(a,b);return Q(this,bi,a)};h.bb=function(a,b){a={requestType:\"VERIFY_EMAIL\",idToken:a};Wa(a,b);return Q(this,ci,a)};function sh(a,b){return Q(a,di,b)}h.Qa=function(a){return Q(this,ei,a)};function fi(a,b,c){return Q(a,gi,{idToken:b,deleteProvider:c})}\nfunction hi(a){if(!a.requestUri||!a.sessionId&&!a.postBody)throw new N(\"internal-error\");}function ii(a){var b=null;a.needConfirmation?(a.code=\"account-exists-with-different-credential\",b=Ah(a)):\"FEDERATED_USER_ID_ALREADY_LINKED\"==a.errorMessage?(a.code=\"credential-already-in-use\",b=Ah(a)):\"EMAIL_EXISTS\"==a.errorMessage?(a.code=\"email-already-in-use\",b=Ah(a)):a.errorMessage&&(b=ji(a.errorMessage));if(b)throw b;if(!a[O])throw new N(\"internal-error\");}\nfunction Xg(a,b){b.returnIdpCredential=!0;return Q(a,ki,b)}function Zg(a,b){b.returnIdpCredential=!0;return Q(a,li,b)}function $g(a,b){b.returnIdpCredential=!0;b.autoCreate=!1;return Q(a,mi,b)}function ni(a){if(!a.oobCode)throw new N(\"invalid-action-code\");}h.Ta=function(a,b){return Q(this,oi,{oobCode:a,newPassword:b})};h.Ia=function(a){return Q(this,pi,{oobCode:a})};h.Sa=function(a){return Q(this,qi,{oobCode:a})};\nvar qi={endpoint:\"setAccountInfo\",D:ni,ga:\"email\"},pi={endpoint:\"resetPassword\",D:ni,O:function(a){if(!a.email||!a.requestType)throw new N(\"internal-error\");}},ri={endpoint:\"signupNewUser\",D:function(a){Rh(a);if(!a.password)throw new N(\"weak-password\");},O:Xh,T:!0},Uh={endpoint:\"createAuthUri\"},si={endpoint:\"deleteAccount\",ea:[\"idToken\"]},gi={endpoint:\"setAccountInfo\",ea:[\"idToken\",\"deleteProvider\"],D:function(a){if(!fa(a.deleteProvider))throw new N(\"internal-error\");}},ti={endpoint:\"getAccountInfo\"},\nci={endpoint:\"getOobConfirmationCode\",ea:[\"idToken\",\"requestType\"],D:function(a){if(\"VERIFY_EMAIL\"!=a.requestType)throw new N(\"internal-error\");},ga:\"email\"},bi={endpoint:\"getOobConfirmationCode\",ea:[\"requestType\"],D:function(a){if(\"PASSWORD_RESET\"!=a.requestType)throw new N(\"internal-error\");Rh(a)},ga:\"email\"},Wh={nb:!0,endpoint:\"getProjectConfig\",yb:\"GET\"},ui={nb:!0,endpoint:\"getRecaptchaParam\",yb:\"GET\",O:function(a){if(!a.recaptchaSiteKey)throw new N(\"internal-error\");}},oi={endpoint:\"resetPassword\",\nD:ni,ga:\"email\"},di={endpoint:\"sendVerificationCode\",ea:[\"phoneNumber\",\"recaptchaToken\"],ga:\"sessionInfo\"},$h={endpoint:\"setAccountInfo\",ea:[\"idToken\"],D:Sh,T:!0},lh={endpoint:\"setAccountInfo\",ea:[\"idToken\"],D:function(a){Sh(a);if(!a.password)throw new N(\"weak-password\");},O:Xh,T:!0},Zh={endpoint:\"signupNewUser\",O:Xh,T:!0},ki={endpoint:\"verifyAssertion\",D:hi,O:ii,T:!0},mi={endpoint:\"verifyAssertion\",D:hi,O:function(a){if(a.errorMessage&&\"USER_NOT_FOUND\"==a.errorMessage)throw new N(\"user-not-found\");\nif(a.errorMessage)throw ji(a.errorMessage);if(!a[O])throw new N(\"internal-error\");},T:!0},li={endpoint:\"verifyAssertion\",D:function(a){hi(a);if(!a.idToken)throw new N(\"internal-error\");},O:ii,T:!0},vi={endpoint:\"verifyCustomToken\",D:function(a){if(!a.token)throw new N(\"invalid-custom-token\");},O:Xh,T:!0},kh={endpoint:\"verifyPassword\",D:function(a){Rh(a);if(!a.password)throw new N(\"wrong-password\");},O:Xh,T:!0},ei={endpoint:\"verifyPhoneNumber\",D:Yh,O:Xh},ph={endpoint:\"verifyPhoneNumber\",D:function(a){if(!a.idToken)throw new N(\"internal-error\");\nYh(a)},O:function(a){if(a.temporaryProof)throw a.code=\"credential-already-in-use\",Ah(a);Xh(a)}},qh={Lb:{USER_NOT_FOUND:\"user-not-found\"},endpoint:\"verifyPhoneNumber\",D:Yh,O:Xh};\nfunction Q(a,b,c){if(!jg(c,b.ea))return B(new N(\"internal-error\"));var d=b.yb||\"POST\",e;return A(c).then(b.D).then(function(){b.T&&(c.returnSecureToken=!0);return Qh(a,b.endpoint,d,c,b.Lb,b.nb||!1)}).then(function(a){return e=a}).then(b.O).then(function(){if(!b.ga)return e;if(!(b.ga in e))throw new N(\"internal-error\");return e[b.ga]})}function ji(a){return Ph({error:{errors:[{message:a}],code:400,message:a}})}\nfunction Ph(a,b){var c=(a.error&&a.error.errors&&a.error.errors[0]||{}).reason||\"\";var d={keyInvalid:\"invalid-api-key\",ipRefererBlocked:\"app-not-authorized\"};if(c=d[c]?new N(d[c]):null)return c;c=a.error&&a.error.message||\"\";d={INVALID_CUSTOM_TOKEN:\"invalid-custom-token\",CREDENTIAL_MISMATCH:\"custom-token-mismatch\",MISSING_CUSTOM_TOKEN:\"internal-error\",INVALID_IDENTIFIER:\"invalid-email\",MISSING_CONTINUE_URI:\"internal-error\",INVALID_EMAIL:\"invalid-email\",INVALID_PASSWORD:\"wrong-password\",USER_DISABLED:\"user-disabled\",\nMISSING_PASSWORD:\"internal-error\",EMAIL_EXISTS:\"email-already-in-use\",PASSWORD_LOGIN_DISABLED:\"operation-not-allowed\",INVALID_IDP_RESPONSE:\"invalid-credential\",FEDERATED_USER_ID_ALREADY_LINKED:\"credential-already-in-use\",INVALID_MESSAGE_PAYLOAD:\"invalid-message-payload\",INVALID_RECIPIENT_EMAIL:\"invalid-recipient-email\",INVALID_SENDER:\"invalid-sender\",EMAIL_NOT_FOUND:\"user-not-found\",EXPIRED_OOB_CODE:\"expired-action-code\",INVALID_OOB_CODE:\"invalid-action-code\",MISSING_OOB_CODE:\"internal-error\",CREDENTIAL_TOO_OLD_LOGIN_AGAIN:\"requires-recent-login\",\nINVALID_ID_TOKEN:\"invalid-user-token\",TOKEN_EXPIRED:\"user-token-expired\",USER_NOT_FOUND:\"user-token-expired\",CORS_UNSUPPORTED:\"cors-unsupported\",DYNAMIC_LINK_NOT_ACTIVATED:\"dynamic-link-not-activated\",INVALID_APP_ID:\"invalid-app-id\",TOO_MANY_ATTEMPTS_TRY_LATER:\"too-many-requests\",WEAK_PASSWORD:\"weak-password\",OPERATION_NOT_ALLOWED:\"operation-not-allowed\",USER_CANCELLED:\"user-cancelled\",CAPTCHA_CHECK_FAILED:\"captcha-check-failed\",INVALID_APP_CREDENTIAL:\"invalid-app-credential\",INVALID_CODE:\"invalid-verification-code\",\nINVALID_PHONE_NUMBER:\"invalid-phone-number\",INVALID_SESSION_INFO:\"invalid-verification-id\",INVALID_TEMPORARY_PROOF:\"invalid-credential\",MISSING_APP_CREDENTIAL:\"missing-app-credential\",MISSING_CODE:\"missing-verification-code\",MISSING_PHONE_NUMBER:\"missing-phone-number\",MISSING_SESSION_INFO:\"missing-verification-id\",QUOTA_EXCEEDED:\"quota-exceeded\",SESSION_EXPIRED:\"code-expired\",INVALID_CONTINUE_URI:\"invalid-continue-uri\",MISSING_ANDROID_PACKAGE_NAME:\"missing-android-pkg-name\",MISSING_IOS_BUNDLE_ID:\"missing-ios-bundle-id\",\nUNAUTHORIZED_DOMAIN:\"unauthorized-continue-uri\",INVALID_OAUTH_CLIENT_ID:\"invalid-oauth-client-id\",INVALID_CERT_HASH:\"invalid-cert-hash\"};Wa(d,b||{});b=(b=c.match(/^[^\\s]+\\s*:\\s*(.*)$/))&&1<b.length?b[1]:void 0;for(var e in d)if(0===c.indexOf(e))return new N(d[e],b);!b&&a&&(b=Uf(a));return new N(\"internal-error\",b)};var wi={Ic:{Va:\"https://www.googleapis.com/identitytoolkit/v3/relyingparty/\",ab:\"https://securetoken.googleapis.com/v1/token\",id:\"p\"},Kc:{Va:\"https://staging-www.sandbox.googleapis.com/identitytoolkit/v3/relyingparty/\",ab:\"https://staging-securetoken.sandbox.googleapis.com/v1/token\",id:\"s\"},Lc:{Va:\"https://www-googleapis-test.sandbox.google.com/identitytoolkit/v3/relyingparty/\",ab:\"https://test-securetoken.sandbox.googleapis.com/v1/token\",id:\"t\"}};\nfunction xi(a){for(var b in wi)if(wi[b].id===a)return a=wi[b],{firebaseEndpoint:a.Va,secureTokenEndpoint:a.ab};return null}var yi;yi=xi(\"__EID__\")?\"__EID__\":void 0;function zi(a){this.b=a;this.a=null;this.Ya=Ai(this)}\nfunction Ai(a){return Bi().then(function(){return new z(function(b,c){L(\"gapi.iframes.getContext\")().open({where:document.body,url:a.b,messageHandlersFilter:L(\"gapi.iframes.CROSS_ORIGIN_IFRAMES_FILTER\"),attributes:{style:{position:\"absolute\",top:\"-100px\",width:\"1px\",height:\"1px\"}},dontclear:!0},function(d){function e(){clearTimeout(f);b()}a.a=d;a.a.restyle({setHideOnLeave:!1});var f=setTimeout(function(){c(Error(\"Network Error\"))},Ci.get());d.ping(e).then(e,function(){c(Error(\"Network Error\"))})})})})}\nfunction Di(a,b){return a.Ya.then(function(){return new z(function(c){a.a.send(b.type,b,c,L(\"gapi.iframes.CROSS_ORIGIN_IFRAMES_FILTER\"))})})}function Ei(a,b){a.Ya.then(function(){a.a.register(\"authEvent\",b,L(\"gapi.iframes.CROSS_ORIGIN_IFRAMES_FILTER\"))})}var Fi=dc(\"https://apis.google.com/js/api.js?onload=%{onload}\"),Gi=new $f(3E4,6E4),Ci=new $f(5E3,15E3),Hi=null;\nfunction Bi(){return Hi?Hi:Hi=(new z(function(a,b){if(Zf()){var c=function(){Yf();L(\"gapi.load\")(\"gapi.iframes\",{callback:a,ontimeout:function(){Yf();b(Error(\"Network Error\"))},timeout:Gi.get()})};if(L(\"gapi.iframes.Iframe\"))a();else if(L(\"gapi.load\"))c();else{var d=\"__iframefcb\"+Math.floor(1E6*Math.random()).toString();k[d]=function(){L(\"gapi.load\")?c():b(Error(\"Network Error\"))};d=hc(Fi,{onload:d});A(kf(d)).s(function(){b(Error(\"Network Error\"))})}}else b(Error(\"Network Error\"))})).s(function(a){Hi=\nnull;throw a;})};function Ii(a,b,c){this.i=a;this.g=b;this.h=c;this.f=null;this.a=Ee(this.i,\"/__/auth/iframe\");I(this.a,\"apiKey\",this.g);I(this.a,\"appName\",this.h);this.b=null;this.c=[]}Ii.prototype.toString=function(){this.f?I(this.a,\"v\",this.f):Le(this.a.a,\"v\");this.b?I(this.a,\"eid\",this.b):Le(this.a.a,\"eid\");this.c.length?I(this.a,\"fw\",this.c.join(\",\")):Le(this.a.a,\"fw\");return this.a.toString()};function Ji(a,b,c,d,e){this.m=a;this.u=b;this.c=c;this.l=d;this.i=this.g=this.h=null;this.a=e;this.f=null}\nJi.prototype.toString=function(){var a=Ee(this.m,\"/__/auth/handler\");I(a,\"apiKey\",this.u);I(a,\"appName\",this.c);I(a,\"authType\",this.l);if(this.a.isOAuthProvider){var b=this.a;try{var c=firebase.app(this.c).auth().$()}catch(l){c=null}b.Ua=c;I(a,\"providerId\",this.a.providerId);b=this.a;c=Vf(b.qb);for(var d in c)c[d]=c[d].toString();d=b.nc;c=Ua(c);for(var e=0;e<d.length;e++){var f=d[e];f in c&&delete c[f]}b.Wa&&b.Ua&&!c[b.Wa]&&(c[b.Wa]=b.Ua);Sa(c)||I(a,\"customParameters\",Uf(c))}\"function\"===typeof this.a.vb&&\n(b=this.a.vb(),b.length&&I(a,\"scopes\",b.join(\",\")));this.h?I(a,\"redirectUrl\",this.h):Le(a.a,\"redirectUrl\");this.g?I(a,\"eventId\",this.g):Le(a.a,\"eventId\");this.i?I(a,\"v\",this.i):Le(a.a,\"v\");if(this.b)for(var g in this.b)this.b.hasOwnProperty(g)&&!Ce(a,g)&&I(a,g,this.b[g]);this.f?I(a,\"eid\",this.f):Le(a.a,\"eid\");g=Ki(this.c);g.length&&I(a,\"fw\",g.join(\",\"));return a.toString()};function Ki(a){try{return firebase.app(a).auth().Ka()}catch(b){return[]}}\nfunction Li(a,b,c,d,e){this.u=a;this.f=b;this.b=c;this.c=d||null;this.h=e||null;this.m=this.o=this.v=null;this.g=[];this.l=this.a=null}\nfunction Mi(a){var b=vf();return Vh(a).then(function(a){a:{var c=De(b),e=c.c;c=c.b;for(var f=0;f<a.length;f++){var g=a[f];var l=c;var n=e;0==g.indexOf(\"chrome-extension://\")?l=De(g).b==l&&\"chrome-extension\"==n:\"http\"!=n&&\"https\"!=n?l=!1:Gf.test(g)?l=l==g:(g=g.split(\".\").join(\"\\\\.\"),l=(new RegExp(\"^(.+\\\\.\"+g+\"|\"+g+\")$\",\"i\")).test(l));if(l){a=!0;break a}}a=!1}if(!a)throw new yh(vf());})}\nfunction Ni(a){if(a.l)return a.l;a.l=Hf().then(function(){if(!a.o){var b=a.c,c=a.h,d=Ki(a.b),e=new Ii(a.u,a.f,a.b);e.f=b;e.b=c;e.c=La(d||[]);a.o=e.toString()}a.i=new zi(a.o);Oi(a)});return a.l}h=Li.prototype;h.Ca=function(a,b,c){var d=new N(\"popup-closed-by-user\"),e=new N(\"web-storage-unsupported\"),f=this,g=!1;return this.ba().then(function(){Pi(f).then(function(c){c||(a&&Cf(a),b(e),g=!0)})}).s(function(){}).then(function(){if(!g)return Ff(a)}).then(function(){if(!g)return sd(c).then(function(){b(d)})})};\nh.Cb=function(){var a=J();return!Tf(a)&&!Xf(a)};h.xb=function(){return!1};\nh.ub=function(a,b,c,d,e,f,g){if(!a)return B(new N(\"popup-blocked\"));if(g&&!Tf())return this.ba().s(function(b){Cf(a);e(b)}),d(),A();this.a||(this.a=Mi(Qi(this)));var l=this;return this.a.then(function(){var b=l.ba().s(function(b){Cf(a);e(b);throw b;});d();return b}).then(function(){vh(c);if(!g){var d=Ri(l.u,l.f,l.b,b,c,null,f,l.c,void 0,l.h);wf(d,a)}}).s(function(a){\"auth/network-request-failed\"==a.code&&(l.a=null);throw a;})};\nfunction Qi(a){a.m||(a.v=a.c?Of(a.c,Ki(a.b)):null,a.m=new Ch(a.f,xi(a.h),a.v));return a.m}h.Aa=function(a,b,c){this.a||(this.a=Mi(Qi(this)));var d=this;return this.a.then(function(){vh(b);var e=Ri(d.u,d.f,d.b,a,b,vf(),c,d.c,void 0,d.h);wf(e)}).s(function(a){\"auth/network-request-failed\"==a.code&&(d.a=null);throw a;})};h.ba=function(){var a=this;return Ni(this).then(function(){return a.i.Ya}).s(function(){a.a=null;throw new N(\"network-request-failed\");})};h.Db=function(){return!0};\nfunction Ri(a,b,c,d,e,f,g,l,n,D){a=new Ji(a,b,c,d,e);a.h=f;a.g=g;a.i=l;a.b=Ua(n||null);a.f=D;return a.toString()}function Oi(a){if(!a.i)throw Error(\"IfcHandler must be initialized!\");Ei(a.i,function(b){var c={};if(b&&b.authEvent){var d=!1;b=xh(b.authEvent);for(c=0;c<a.g.length;c++)d=a.g[c](b)||d;c={};c.status=d?\"ACK\":\"ERROR\";return A(c)}c.status=\"ERROR\";return A(c)})}\nfunction Pi(a){var b={type:\"webStorageSupport\"};return Ni(a).then(function(){return Di(a.i,b)}).then(function(a){if(a&&a.length&&\"undefined\"!==typeof a[0].webStorageSupport)return a[0].webStorageSupport;throw Error();})}h.ua=function(a){this.g.push(a)};h.Ja=function(a){Ja(this.g,function(b){return b==a})};function Si(a){this.a=a||firebase.INTERNAL.reactNative&&firebase.INTERNAL.reactNative.AsyncStorage;if(!this.a)throw new N(\"internal-error\",\"The React Native compatibility library was not found.\");}h=Si.prototype;h.get=function(a){return A(this.a.getItem(a)).then(function(a){return a&&Wf(a)})};h.set=function(a,b){return A(this.a.setItem(a,Uf(b)))};h.X=function(a){return A(this.a.removeItem(a))};h.ia=function(){};h.da=function(){};function Ti(){this.a={}}h=Ti.prototype;h.get=function(a){return A(this.a[a])};h.set=function(a,b){this.a[a]=b;return A()};h.X=function(a){delete this.a[a];return A()};h.ia=function(){};h.da=function(){};function Ui(a,b,c,d,e,f){try{var g=!!k.indexedDB}catch(l){g=!1}if(!g)throw new N(\"web-storage-unsupported\");this.u=a;this.h=b;this.g=c;this.l=d;this.m=e;this.f={};this.c=[];this.a=0;this.o=f||k.indexedDB}var Vi;function Wi(a){return new z(function(b,c){var d=a.o.open(a.u,a.m);d.onerror=function(a){c(Error(a.target.errorCode))};d.onupgradeneeded=function(b){b=b.target.result;try{b.createObjectStore(a.h,{keyPath:a.g})}catch(f){c(f)}};d.onsuccess=function(a){b(a.target.result)}})}\nfunction Xi(a){a.i||(a.i=Wi(a));return a.i}function Yi(a,b){return b.objectStore(a.h)}function Zi(a,b,c){return b.transaction([a.h],c?\"readwrite\":\"readonly\")}function $i(a){return new z(function(b,c){a.onsuccess=function(a){a&&a.target?b(a.target.result):b()};a.onerror=function(a){c(Error(a.target.errorCode))}})}h=Ui.prototype;\nh.set=function(a,b){var c=!1,d,e=this;return Qb(Xi(this).then(function(b){d=b;b=Yi(e,Zi(e,d,!0));return $i(b.get(a))}).then(function(f){var g=Yi(e,Zi(e,d,!0));if(f)return f.value=b,$i(g.put(f));e.a++;c=!0;f={};f[e.g]=a;f[e.l]=b;return $i(g.add(f))}).then(function(){e.f[a]=b}),function(){c&&e.a--})};h.get=function(a){var b=this;return Xi(this).then(function(c){return $i(Yi(b,Zi(b,c,!1)).get(a))}).then(function(a){return a&&a.value})};\nh.X=function(a){var b=!1,c=this;return Qb(Xi(this).then(function(d){b=!0;c.a++;return $i(Yi(c,Zi(c,d,!0))[\"delete\"](a))}).then(function(){delete c.f[a]}),function(){b&&c.a--})};\nh.vc=function(){var a=this;return Xi(this).then(function(b){var c=Yi(a,Zi(a,b,!1));return c.getAll?$i(c.getAll()):new z(function(a,b){var d=[],e=c.openCursor();e.onsuccess=function(b){(b=b.target.result)?(d.push(b.value),b[\"continue\"]()):a(d)};e.onerror=function(a){b(Error(a.target.errorCode))}})}).then(function(b){var c={},d=[];if(0==a.a){for(d=0;d<b.length;d++)c[b[d][a.g]]=b[d][a.l];d=xf(a.f,c);a.f=c}return d})};h.ia=function(a){0==this.c.length&&aj(this);this.c.push(a)};\nh.da=function(a){Ja(this.c,function(b){return b==a});0==this.c.length&&this.b&&this.b.cancel(\"STOP_EVENT\")};function aj(a){function b(){a.b=sd(800).then(r(a.vc,a)).then(function(b){0<b.length&&w(a.c,function(a){a(b)})}).then(b).s(function(a){\"STOP_EVENT\"!=a.message&&b()});return a.b}a.b&&a.b.cancel(\"STOP_EVENT\");b()};function bj(){if(!cj()){if(\"Node\"==K())throw new N(\"internal-error\",\"The LocalStorage compatibility library was not found.\");throw new N(\"web-storage-unsupported\");}this.a=dj()||firebase.INTERNAL.node.localStorage}function dj(){try{var a=k.localStorage,b=Qf();a&&(a.setItem(b,\"1\"),a.removeItem(b));return a}catch(c){return null}}\nfunction cj(){var a=\"Node\"==K();a=dj()||a&&firebase.INTERNAL.node&&firebase.INTERNAL.node.localStorage;if(!a)return!1;try{return a.setItem(\"__sak\",\"1\"),a.removeItem(\"__sak\"),!0}catch(b){return!1}}h=bj.prototype;h.get=function(a){var b=this;return A().then(function(){var c=b.a.getItem(a);return Wf(c)})};h.set=function(a,b){var c=this;return A().then(function(){var d=Uf(b);null===d?c.X(a):c.a.setItem(a,d)})};h.X=function(a){var b=this;return A().then(function(){b.a.removeItem(a)})};\nh.ia=function(a){k.window&&cd(k.window,\"storage\",a)};h.da=function(a){k.window&&E(k.window,\"storage\",a)};function ej(){}h=ej.prototype;h.get=function(){return A(null)};h.set=function(){return A()};h.X=function(){return A()};h.ia=function(){};h.da=function(){};function fj(){if(!gj()){if(\"Node\"==K())throw new N(\"internal-error\",\"The SessionStorage compatibility library was not found.\");throw new N(\"web-storage-unsupported\");}this.a=hj()||firebase.INTERNAL.node.sessionStorage}function hj(){try{var a=k.sessionStorage,b=Qf();a&&(a.setItem(b,\"1\"),a.removeItem(b));return a}catch(c){return null}}\nfunction gj(){var a=\"Node\"==K();a=hj()||a&&firebase.INTERNAL.node&&firebase.INTERNAL.node.sessionStorage;if(!a)return!1;try{return a.setItem(\"__sak\",\"1\"),a.removeItem(\"__sak\"),!0}catch(b){return!1}}h=fj.prototype;h.get=function(a){var b=this;return A().then(function(){var c=b.a.getItem(a);return Wf(c)})};h.set=function(a,b){var c=this;return A().then(function(){var d=Uf(b);null===d?c.X(a):c.a.setItem(a,d)})};h.X=function(a){var b=this;return A().then(function(){b.a.removeItem(a)})};h.ia=function(){};\nh.da=function(){};function ij(){var a={};a.Browser=jj;a.Node=kj;a.ReactNative=lj;this.a=a[K()]}var mj,jj={C:bj,jb:fj},kj={C:bj,jb:fj},lj={C:Si,jb:ej};var nj={Hc:\"local\",NONE:\"none\",Jc:\"session\"};function oj(a){var b=new N(\"invalid-persistence-type\"),c=new N(\"unsupported-persistence-type\");a:{for(d in nj)if(nj[d]==a){var d=!0;break a}d=!1}if(!d||\"string\"!==typeof a)throw b;switch(K()){case \"ReactNative\":if(\"session\"===a)throw c;break;case \"Node\":if(\"none\"!==a)throw c;break;default:if(!Pf()&&\"none\"!==a)throw c;}}\nfunction pj(a,b,c,d,e){this.i=a;this.g=b;this.A=c;this.u=d;this.v=e;this.a={};mj||(mj=new ij);a=mj;try{if(uf()){Vi||(Vi=new Ui(\"firebaseLocalStorageDb\",\"firebaseLocalStorage\",\"fbase_key\",\"value\",1));var f=Vi}else f=new a.a.C;this.l=f}catch(g){this.l=new Ti,this.u=!0}try{this.o=new a.a.jb}catch(g){this.o=new Ti}this.w=new Ti;this.h=r(this.m,this);this.b={}}var qj;function rj(){qj||(qj=new pj(\"firebase\",\":\",!Xf(J())&&Lf()?!0:!1,Tf(),Pf()));return qj}\nfunction sj(a,b){switch(b){case \"session\":return a.o;case \"none\":return a.w;default:return a.l}}function tj(a,b,c){return a.i+a.g+b.name+(c?a.g+c:\"\")}pj.prototype.get=function(a,b){return sj(this,a.C).get(tj(this,a,b))};function uj(a,b,c){c=tj(a,b,c);\"local\"==b.C&&(a.b[c]=null);return sj(a,b.C).X(c)}pj.prototype.set=function(a,b,c){var d=tj(this,a,c),e=this,f=sj(this,a.C);return f.set(d,b).then(function(){return f.get(d)}).then(function(b){\"local\"==a.C&&(e.b[d]=b)})};\nfunction vj(a,b,c,d){b=tj(a,b,c);a.v&&(a.b[b]=k.localStorage.getItem(b));Sa(a.a)&&(sj(a,\"local\").ia(a.h),a.u||uf()||!a.v||wj(a));a.a[b]||(a.a[b]=[]);a.a[b].push(d)}function xj(a,b,c){b=tj(a,yj(\"local\"),b);a.a[b]&&(Ja(a.a[b],function(a){return a==c}),0==a.a[b].length&&delete a.a[b]);Sa(a.a)&&zj(a)}\nfunction wj(a){Aj(a);a.f=setInterval(function(){for(var b in a.a){var c=k.localStorage.getItem(b),d=a.b[b];c!=d&&(a.b[b]=c,c=new Qc({type:\"storage\",key:b,target:window,oldValue:d,newValue:c,a:!0}),a.m(c))}},1E3)}function Aj(a){a.f&&(clearInterval(a.f),a.f=null)}function zj(a){sj(a,\"local\").da(a.h);Aj(a)}\npj.prototype.m=function(a){if(a&&a.g){var b=a.a.key;if(null==b)for(var c in this.a){var d=this.b[c];\"undefined\"===typeof d&&(d=null);var e=k.localStorage.getItem(c);e!==d&&(this.b[c]=e,this.c(c))}else if(0==b.indexOf(this.i+this.g)&&this.a[b]){\"undefined\"!==typeof a.a.a?sj(this,\"local\").da(this.h):Aj(this);if(this.A)if(c=k.localStorage.getItem(b),d=a.a.newValue,d!==c)null!==d?k.localStorage.setItem(b,d):k.localStorage.removeItem(b);else if(this.b[b]===d&&\"undefined\"===typeof a.a.a)return;var f=this;\nc=function(){if(\"undefined\"!==typeof a.a.a||f.b[b]!==k.localStorage.getItem(b))f.b[b]=k.localStorage.getItem(b),f.c(b)};y&&kb&&10==kb&&k.localStorage.getItem(b)!==a.a.newValue&&a.a.newValue!==a.a.oldValue?setTimeout(c,10):c()}}else w(a,r(this.c,this))};pj.prototype.c=function(a){this.a[a]&&w(this.a[a],function(a){a()})};function Cj(a){this.a=a;this.b=rj()}var Dj={name:\"authEvent\",C:\"local\"};function Ej(a){return a.b.get(Dj,a.a).then(function(a){return xh(a)})};function Fj(){this.a=rj()};function Gj(a,b,c,d,e,f,g){this.u=a;this.i=b;this.l=c;this.m=d||null;this.o=g||null;this.h=b+\":\"+c;this.A=new Fj;this.g=new Cj(this.h);this.f=null;this.b=[];this.v=e||500;this.w=f||2E3;this.a=this.c=null}function Hj(a){return new N(\"invalid-cordova-configuration\",a)}h=Gj.prototype;\nh.ba=function(){return this.xa?this.xa:this.xa=If().then(function(){if(\"function\"!==typeof L(\"universalLinks.subscribe\",k))throw Hj(\"cordova-universal-links-plugin is not installed\");if(\"undefined\"===typeof L(\"BuildInfo.packageName\",k))throw Hj(\"cordova-plugin-buildinfo is not installed\");if(\"function\"!==typeof L(\"cordova.plugins.browsertab.openUrl\",k))throw Hj(\"cordova-plugin-browsertab is not installed\");if(\"function\"!==typeof L(\"cordova.InAppBrowser.open\",k))throw Hj(\"cordova-plugin-inappbrowser is not installed\");\n},function(){throw new N(\"cordova-not-ready\");})};function Ij(){for(var a=20,b=[];0<a;)b.push(\"1234567890abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ\".charAt(Math.floor(62*Math.random()))),a--;return b.join(\"\")}function Jj(a){var b=new ie;he(b,a);a=[];var c=8*b.g;56>b.c?he(b,fe,56-b.c):he(b,fe,b.b-(b.c-56));for(var d=63;56<=d;d--)b.f[d]=c&255,c/=256;ge(b);for(d=c=0;d<b.i;d++)for(var e=24;0<=e;e-=8)a[c++]=b.a[d]>>e&255;return Hd(a)}\nh.Ca=function(a,b){b(new N(\"operation-not-supported-in-this-environment\"));return A()};h.ub=function(){return B(new N(\"operation-not-supported-in-this-environment\"))};h.Db=function(){return!1};h.Cb=function(){return!0};h.xb=function(){return!0};\nh.Aa=function(a,b,c){if(this.c)return B(new N(\"redirect-operation-pending\"));var d=this,e=k.document,f=null,g=null,l=null,n=null;return this.c=Qb(A().then(function(){vh(b);return Kj(d)}).then(function(){return Lj(d,a,b,c)}).then(function(){return(new z(function(a,b){g=function(){var b=L(\"cordova.plugins.browsertab.close\",k);a();\"function\"===typeof b&&b();d.a&&\"function\"===typeof d.a.close&&(d.a.close(),d.a=null);return!1};d.ua(g);l=function(){f||(f=sd(d.w).then(function(){b(new N(\"redirect-cancelled-by-user\"))}))};\nn=function(){ag()&&l()};e.addEventListener(\"resume\",l,!1);J().toLowerCase().match(/android/)||e.addEventListener(\"visibilitychange\",n,!1)})).s(function(a){return Mj(d).then(function(){throw a;})})}),function(){l&&e.removeEventListener(\"resume\",l,!1);n&&e.removeEventListener(\"visibilitychange\",n,!1);f&&f.cancel();g&&d.Ja(g);d.c=null})};\nfunction Lj(a,b,c,d){var e=Ij(),f=new wh(b,d,null,e,new N(\"no-auth-event\")),g=L(\"BuildInfo.packageName\",k);if(\"string\"!==typeof g)throw new N(\"invalid-cordova-configuration\");var l=L(\"BuildInfo.displayName\",k),n={};if(J().toLowerCase().match(/iphone|ipad|ipod/))n.ibi=g;else if(J().toLowerCase().match(/android/))n.apn=g;else return B(new N(\"operation-not-supported-in-this-environment\"));l&&(n.appDisplayName=l);e=Jj(e);n.sessionId=e;var D=Ri(a.u,a.i,a.l,b,c,null,d,a.m,n,a.o);return a.ba().then(function(){var b=\na.h;return a.A.a.set(Dj,f.B(),b)}).then(function(){var b=L(\"cordova.plugins.browsertab.isAvailable\",k);if(\"function\"!==typeof b)throw new N(\"invalid-cordova-configuration\");var c=null;b(function(b){if(b){c=L(\"cordova.plugins.browsertab.openUrl\",k);if(\"function\"!==typeof c)throw new N(\"invalid-cordova-configuration\");c(D)}else{c=L(\"cordova.InAppBrowser.open\",k);if(\"function\"!==typeof c)throw new N(\"invalid-cordova-configuration\");b=J();b=!(!b.match(/(iPad|iPhone|iPod).*OS 7_\\d/i)&&!b.match(/(iPad|iPhone|iPod).*OS 8_\\d/i));\na.a=c(D,b?\"_blank\":\"_system\",\"location=yes\")}})})}function Nj(a,b){for(var c=0;c<a.b.length;c++)try{a.b[c](b)}catch(d){}}function Kj(a){a.f||(a.f=a.ba().then(function(){return new z(function(b){function c(d){b(d);a.Ja(c);return!1}a.ua(c);Oj(a)})}));return a.f}function Mj(a){var b=null;return Ej(a.g).then(function(c){b=c;c=a.g;return uj(c.b,Dj,c.a)}).then(function(){return b})}\nfunction Oj(a){function b(b){e=!0;f&&f.cancel();Mj(a).then(function(c){var e=d;if(c&&b&&b.url){e=null;var f=b.url;var g=De(f),l=Ce(g,\"link\"),n=Ce(De(l),\"link\");g=Ce(g,\"deep_link_id\");f=Ce(De(g),\"link\")||g||n||l||f;-1!=f.indexOf(\"/__/auth/callback\")&&(e=De(f),e=Wf(Ce(e,\"firebaseError\")||null),e=(e=\"object\"===typeof e?vg(e):null)?new wh(c.b,c.c,null,null,e):new wh(c.b,c.c,f,c.g));e=e||d}Nj(a,e)})}var c=L(\"universalLinks.subscribe\",k);if(\"function\"!==typeof c)throw new N(\"invalid-cordova-configuration\");\nvar d=new wh(\"unknown\",null,null,null,new N(\"no-auth-event\")),e=!1,f=sd(a.v).then(function(){return Mj(a).then(function(){e||Nj(a,d)})}),g=k.handleOpenURL;k.handleOpenURL=function(a){0==a.toLowerCase().indexOf(L(\"BuildInfo.packageName\",k).toLowerCase()+\"://\")&&b({url:a});if(\"function\"===typeof g)try{g(a)}catch(n){console.error(n)}};c(null,b)}\nh.ua=function(a){this.b.push(a);Kj(this).s(function(b){\"auth/invalid-cordova-configuration\"===b.code&&(b=new wh(\"unknown\",null,null,null,new N(\"no-auth-event\")),a(b))})};h.Ja=function(a){Ja(this.b,function(b){return b==a})};function Pj(a){this.a=a;this.b=rj()}var Qj={name:\"pendingRedirect\",C:\"session\"};function Rj(a){return a.b.set(Qj,\"pending\",a.a)}function Sj(a){return uj(a.b,Qj,a.a)}function Tj(a){return a.b.get(Qj,a.a).then(function(a){return\"pending\"==a})};function Uj(a,b,c){this.v=a;this.l=b;this.u=c;this.h=[];this.f=!1;this.i=r(this.m,this);this.c=new Vj;this.o=new Wj;this.g=new Pj(this.l+\":\"+this.u);this.b={};this.b.unknown=this.c;this.b.signInViaRedirect=this.c;this.b.linkViaRedirect=this.c;this.b.reauthViaRedirect=this.c;this.b.signInViaPopup=this.o;this.b.linkViaPopup=this.o;this.b.reauthViaPopup=this.o;this.a=Xj(this.v,this.l,this.u,yi)}\nfunction Xj(a,b,c,d){var e=firebase.SDK_VERSION||null;return Jf()?new Gj(a,b,c,e,void 0,void 0,d):new Li(a,b,c,e,d)}Uj.prototype.reset=function(){this.f=!1;this.a.Ja(this.i);this.a=Xj(this.v,this.l,this.u)};function Yj(a){a.f||(a.f=!0,a.a.ua(a.i));var b=a.a;return a.a.ba().s(function(c){a.a==b&&a.reset();throw c;})}function Zj(a){a.a.Cb()&&Yj(a).s(function(b){var c=new wh(\"unknown\",null,null,null,new N(\"operation-not-supported-in-this-environment\"));ak(b)&&a.m(c)});a.a.xb()||bk(a.c)}\nUj.prototype.subscribe=function(a){Ha(this.h,a)||this.h.push(a);if(!this.f){var b=this;Tj(this.g).then(function(a){a?Sj(b.g).then(function(){Yj(b).s(function(a){var c=new wh(\"unknown\",null,null,null,new N(\"operation-not-supported-in-this-environment\"));ak(a)&&b.m(c)})}):Zj(b)}).s(function(){Zj(b)})}};Uj.prototype.unsubscribe=function(a){Ja(this.h,function(b){return b==a})};\nUj.prototype.m=function(a){if(!a)throw new N(\"invalid-auth-event\");for(var b=!1,c=0;c<this.h.length;c++){var d=this.h[c];if(d.ob(a.b,a.c)){(b=this.b[a.b])&&b.h(a,d);b=!0;break}}bk(this.c);return b};var ck=new $f(2E3,1E4),dk=new $f(3E4,6E4);Uj.prototype.aa=function(){return this.c.aa()};function ek(a,b,c,d,e,f){return a.a.ub(b,c,d,function(){a.f||(a.f=!0,a.a.ua(a.i))},function(){a.reset()},e,f)}function ak(a){return a&&\"auth/cordova-not-ready\"==a.code?!0:!1}\nUj.prototype.Aa=function(a,b,c){var d=this,e;return Rj(this.g).then(function(){return d.a.Aa(a,b,c).s(function(a){if(ak(a))throw new N(\"operation-not-supported-in-this-environment\");e=a;return Sj(d.g).then(function(){throw e;})}).then(function(){return d.a.Db()?new z(function(){}):Sj(d.g).then(function(){return d.aa()}).then(function(){}).s(function(){})})})};Uj.prototype.Ca=function(a,b,c,d){return this.a.Ca(c,function(c){a.fa(b,null,c,d)},ck.get())};var fk={};\nfunction gk(a,b,c){var d=b+\":\"+c;fk[d]||(fk[d]=new Uj(a,b,c));return fk[d]}function Vj(){this.b=null;this.f=[];this.c=[];this.a=null;this.g=!1}Vj.prototype.reset=function(){this.b=null;this.a&&(this.a.cancel(),this.a=null)};\nVj.prototype.h=function(a,b){if(!a)return B(new N(\"invalid-auth-event\"));this.reset();this.g=!0;var c=a.b,d=a.c,e=a.a&&\"auth/web-storage-unsupported\"==a.a.code,f=a.a&&\"auth/operation-not-supported-in-this-environment\"==a.a.code;\"unknown\"!=c||e||f?a.a?(hk(this,!0,null,a.a),a=A()):a=b.va(c,d)?ik(this,a,b):B(new N(\"invalid-auth-event\")):(hk(this,!1,null,null),a=A());return a};function bk(a){a.g||(a.g=!0,hk(a,!1,null,null))}\nfunction ik(a,b,c){c=c.va(b.b,b.c);var d=b.f,e=b.g,f=!!b.b.match(/Redirect$/);return c(d,e).then(function(b){hk(a,f,b,null)}).s(function(b){hk(a,f,null,b)})}function jk(a,b){a.b=function(){return B(b)};if(a.c.length)for(var c=0;c<a.c.length;c++)a.c[c](b)}function kk(a,b){a.b=function(){return A(b)};if(a.f.length)for(var c=0;c<a.f.length;c++)a.f[c](b)}function hk(a,b,c,d){b?d?jk(a,d):kk(a,c):kk(a,{user:null});a.f=[];a.c=[]}\nVj.prototype.aa=function(){var a=this;return new z(function(b,c){a.b?a.b().then(b,c):(a.f.push(b),a.c.push(c),lk(a))})};function lk(a){var b=new N(\"timeout\");a.a&&a.a.cancel();a.a=sd(dk.get()).then(function(){a.b||hk(a,!0,null,b)})}function Wj(){}Wj.prototype.h=function(a,b){if(!a)return B(new N(\"invalid-auth-event\"));var c=a.b,d=a.c;a.a?(b.fa(a.b,null,a.a,a.c),a=A()):a=b.va(c,d)?mk(a,b):B(new N(\"invalid-auth-event\"));return a};\nfunction mk(a,b){var c=a.c,d=a.b;return b.va(d,c)(a.f,a.g).then(function(a){b.fa(d,a,null,c)}).s(function(a){b.fa(d,null,a,c)})};function nk(a,b){this.a=b;M(this,\"verificationId\",a)}nk.prototype.confirm=function(a){a=th(this.verificationId,a);return this.a(a)};function ok(a,b,c,d){return(new rh(a)).Qa(b,c).then(function(a){return new nk(a,d)})};function pk(a,b,c,d,e,f){this.h=a;this.i=b;this.g=c;this.c=d;this.f=e;this.l=!!f;this.b=null;this.a=this.c;if(this.f<this.c)throw Error(\"Proactive refresh lower bound greater than upper bound!\");}pk.prototype.start=function(){this.a=this.c;qk(this,!0)};function rk(a,b){if(b)return a.a=a.c,a.g();b=a.a;a.a*=2;a.a>a.f&&(a.a=a.f);return b}\nfunction qk(a,b){sk(a);a.b=sd(rk(a,b)).then(function(){return a.l?A():bg()}).then(function(){return a.h()}).then(function(){qk(a,!0)}).s(function(b){a.i(b)&&qk(a,!1)})}function sk(a){a.b&&(a.b.cancel(),a.b=null)};function tk(a){this.f=a;this.b=this.a=null;this.c=0}tk.prototype.B=function(){return{apiKey:this.f.b,refreshToken:this.a,accessToken:this.b,expirationTime:this.c}};function uk(a,b){var c=b[O],d=b.refreshToken;b=vk(b.expiresIn);a.b=c;a.c=b;a.a=d}function vk(a){return na()+1E3*parseInt(a,10)}\nfunction wk(a,b){return Oh(a.f,b).then(function(b){a.b=b.access_token;a.c=vk(b.expires_in);a.a=b.refresh_token;return{accessToken:a.b,expirationTime:a.c,refreshToken:a.a}}).s(function(b){\"auth/user-token-expired\"==b.code&&(a.a=null);throw b;})}tk.prototype.getToken=function(a){a=!!a;return this.b&&!this.a?B(new N(\"user-token-expired\")):a||!this.b||na()>this.c-3E4?this.a?wk(this,{grant_type:\"refresh_token\",refresh_token:this.a}):A(null):A({accessToken:this.b,expirationTime:this.c,refreshToken:this.a})};function xk(a,b){this.a=a||null;this.b=b||null;gg(this,{lastSignInTime:cg(b||null),creationTime:cg(a||null)})}function yk(a){return new xk(a.a,a.b)}xk.prototype.B=function(){return{lastLoginAt:this.b,createdAt:this.a}};function zk(a,b,c,d,e,f){gg(this,{uid:a,displayName:d||null,photoURL:e||null,email:c||null,phoneNumber:f||null,providerId:b})}function Ak(a,b){C.call(this,a);for(var c in b)this[c]=b[c]}t(Ak,C);\nfunction Bk(a,b,c){this.A=[];this.G=a.apiKey;this.o=a.appName;this.w=a.authDomain||null;a=firebase.SDK_VERSION?Of(firebase.SDK_VERSION):null;this.c=new Ch(this.G,xi(yi),a);this.h=new tk(this.c);Ck(this,b[O]);uk(this.h,b);M(this,\"refreshToken\",this.h.a);Dk(this,c||{});F.call(this);this.I=!1;this.w&&Rf()&&(this.a=gk(this.w,this.G,this.o));this.N=[];this.i=null;this.l=Ek(this);this.U=r(this.Ga,this);var d=this;this.ha=null;this.ra=function(a){d.na(a.h)};this.W=null;this.R=[];this.qa=function(a){Fk(d,\na.f)};this.V=null}t(Bk,F);Bk.prototype.na=function(a){this.ha=a;Ih(this.c,a)};Bk.prototype.$=function(){return this.ha};function Gk(a,b){a.W&&E(a.W,\"languageCodeChanged\",a.ra);(a.W=b)&&cd(b,\"languageCodeChanged\",a.ra)}function Fk(a,b){a.R=b;Jh(a.c,firebase.SDK_VERSION?Of(firebase.SDK_VERSION,a.R):null)}Bk.prototype.Ka=function(){return La(this.R)};function Hk(a,b){a.V&&E(a.V,\"frameworkChanged\",a.qa);(a.V=b)&&cd(b,\"frameworkChanged\",a.qa)}Bk.prototype.Ga=function(){this.l.b&&(sk(this.l),this.l.start())};\nfunction Ik(a){try{return firebase.app(a.o).auth()}catch(b){throw new N(\"internal-error\",\"No firebase.auth.Auth instance is available for the Firebase App '\"+a.o+\"'!\");}}function Ek(a){return new pk(function(){return a.F(!0)},function(a){return a&&\"auth/network-request-failed\"==a.code?!0:!1},function(){var b=a.h.c-na()-3E5;return 0<b?b:0},3E4,96E4,!1)}function Jk(a){a.m||a.l.b||(a.l.start(),E(a,\"tokenChanged\",a.U),cd(a,\"tokenChanged\",a.U))}function Kk(a){E(a,\"tokenChanged\",a.U);sk(a.l)}\nfunction Ck(a,b){a.pa=b;M(a,\"_lat\",b)}function Lk(a,b){Ja(a.N,function(a){return a==b})}function Mk(a){for(var b=[],c=0;c<a.N.length;c++)b.push(a.N[c](a));return Ob(b).then(function(){return a})}function Nk(a){a.a&&!a.I&&(a.I=!0,a.a.subscribe(a))}\nfunction Dk(a,b){gg(a,{uid:b.uid,displayName:b.displayName||null,photoURL:b.photoURL||null,email:b.email||null,emailVerified:b.emailVerified||!1,phoneNumber:b.phoneNumber||null,isAnonymous:b.isAnonymous||!1,metadata:new xk(b.createdAt,b.lastLoginAt),providerData:[]})}M(Bk.prototype,\"providerId\",\"firebase\");function Ok(){}function Pk(a){return A().then(function(){if(a.m)throw new N(\"app-deleted\");})}function Qk(a){return Da(a.providerData,function(a){return a.providerId})}\nfunction Rk(a,b){b&&(Sk(a,b.providerId),a.providerData.push(b))}function Sk(a,b){Ja(a.providerData,function(a){return a.providerId==b})}function Tk(a,b,c){(\"uid\"!=b||c)&&a.hasOwnProperty(b)&&M(a,b,c)}\nfunction Uk(a,b){a!=b&&(gg(a,{uid:b.uid,displayName:b.displayName,photoURL:b.photoURL,email:b.email,emailVerified:b.emailVerified,phoneNumber:b.phoneNumber,isAnonymous:b.isAnonymous,providerData:[]}),b.metadata?M(a,\"metadata\",yk(b.metadata)):M(a,\"metadata\",new xk),w(b.providerData,function(b){Rk(a,b)}),a.h=b.h,M(a,\"refreshToken\",a.h.a))}h=Bk.prototype;h.reload=function(){var a=this;return R(this,Pk(this).then(function(){return Vk(a).then(function(){return Mk(a)}).then(Ok)}))};\nfunction Vk(a){return a.F().then(function(b){var c=a.isAnonymous;return Wk(a,b).then(function(){c||Tk(a,\"isAnonymous\",!1);return b})})}h.F=function(a){var b=this;return R(this,Pk(this).then(function(){return b.h.getToken(a)}).then(function(a){if(!a)throw new N(\"internal-error\");a.accessToken!=b.pa&&(Ck(b,a.accessToken),G(b,new Ak(\"tokenChanged\")));Tk(b,\"refreshToken\",a.refreshToken);return a.accessToken}))};\nh.getToken=function(a){dg[\"firebase.User.prototype.getToken is deprecated. Please use firebase.User.prototype.getIdToken instead.\"]||(dg[\"firebase.User.prototype.getToken is deprecated. Please use firebase.User.prototype.getIdToken instead.\"]=!0,\"undefined\"!==typeof console&&\"function\"===typeof console.warn&&console.warn(\"firebase.User.prototype.getToken is deprecated. Please use firebase.User.prototype.getIdToken instead.\"));return this.F(a)};\nfunction Xk(a,b){b[O]&&a.pa!=b[O]&&(uk(a.h,b),G(a,new Ak(\"tokenChanged\")),Ck(a,b[O]),Tk(a,\"refreshToken\",a.h.a))}function Wk(a,b){return Q(a.c,ti,{idToken:b}).then(r(a.gc,a))}\nh.gc=function(a){a=a.users;if(!a||!a.length)throw new N(\"internal-error\");a=a[0];Dk(this,{uid:a.localId,displayName:a.displayName,photoURL:a.photoUrl,email:a.email,emailVerified:!!a.emailVerified,phoneNumber:a.phoneNumber,lastLoginAt:a.lastLoginAt,createdAt:a.createdAt});for(var b=Yk(a),c=0;c<b.length;c++)Rk(this,b[c]);Tk(this,\"isAnonymous\",!(this.email&&a.passwordHash)&&!(this.providerData&&this.providerData.length))};\nfunction Yk(a){return(a=a.providerUserInfo)&&a.length?Da(a,function(a){return new zk(a.rawId,a.providerId,a.email,a.displayName,a.photoUrl,a.phoneNumber)}):[]}h.Za=function(a){var b=this,c=null;return R(this,a.c(this.c,this.uid).then(function(a){Xk(b,a);c=Zk(b,a,\"reauthenticate\");b.i=null;return b.reload()}).then(function(){return c}),!0)};h.hc=function(a){return this.Za(a).then(function(){})};\nfunction $k(a,b){return Vk(a).then(function(){if(Ha(Qk(a),b))return Mk(a).then(function(){throw new N(\"provider-already-linked\");})})}h.Xa=function(a){var b=this,c=null;return R(this,$k(this,a.providerId).then(function(){return b.F()}).then(function(c){return a.b(b.c,c)}).then(function(a){c=Zk(b,a,\"link\");return al(b,a)}).then(function(){return c}))};h.Zb=function(a){return this.Xa(a).then(function(a){return a.user})};\nh.$b=function(a,b){var c=this;return R(this,$k(this,\"phone\").then(function(){return ok(Ik(c),a,b,r(c.Xa,c))}))};h.ic=function(a,b){var c=this;return R(this,A().then(function(){return ok(Ik(c),a,b,r(c.Za,c))}),!0)};function Zk(a,b,c){var d=uh(b);b=Mg(b);return hg({user:a,credential:d,additionalUserInfo:b,operationType:c})}function al(a,b){Xk(a,b);return a.reload().then(function(){return a})}\nh.kb=function(a){var b=this;return R(this,this.F().then(function(c){return b.c.kb(c,a)}).then(function(a){Xk(b,a);return b.reload()}))};h.zc=function(a){var b=this;return R(this,this.F().then(function(c){return a.b(b.c,c)}).then(function(a){Xk(b,a);return b.reload()}))};h.lb=function(a){var b=this;return R(this,this.F().then(function(c){return b.c.lb(c,a)}).then(function(a){Xk(b,a);return b.reload()}))};\nh.mb=function(a){if(void 0===a.displayName&&void 0===a.photoURL)return Pk(this);var b=this;return R(this,this.F().then(function(c){return b.c.mb(c,{displayName:a.displayName,photoUrl:a.photoURL})}).then(function(a){Xk(b,a);Tk(b,\"displayName\",a.displayName||null);Tk(b,\"photoURL\",a.photoUrl||null);w(b.providerData,function(a){\"password\"===a.providerId&&(M(a,\"displayName\",b.displayName),M(a,\"photoURL\",b.photoURL))});return Mk(b)}).then(Ok))};\nh.yc=function(a){var b=this;return R(this,Vk(this).then(function(c){return Ha(Qk(b),a)?fi(b.c,c,[a]).then(function(a){var c={};w(a.providerUserInfo||[],function(a){c[a.providerId]=!0});w(Qk(b),function(a){c[a]||Sk(b,a)});c[rh.PROVIDER_ID]||M(b,\"phoneNumber\",null);return Mk(b)}):Mk(b).then(function(){throw new N(\"no-such-provider\");})}))};\nh.delete=function(){var a=this;return R(this,this.F().then(function(b){return Q(a.c,si,{idToken:b})}).then(function(){G(a,new Ak(\"userDeleted\"))})).then(function(){for(var b=0;b<a.A.length;b++)a.A[b].cancel(\"app-deleted\");Gk(a,null);Hk(a,null);a.A=[];a.m=!0;Kk(a);M(a,\"refreshToken\",null);a.a&&a.a.unsubscribe(a)})};\nh.ob=function(a,b){return\"linkViaPopup\"==a&&(this.g||null)==b&&this.f||\"reauthViaPopup\"==a&&(this.g||null)==b&&this.f||\"linkViaRedirect\"==a&&(this.Z||null)==b||\"reauthViaRedirect\"==a&&(this.Z||null)==b?!0:!1};h.fa=function(a,b,c,d){\"linkViaPopup\"!=a&&\"reauthViaPopup\"!=a||d!=(this.g||null)||(c&&this.v?this.v(c):b&&!c&&this.f&&this.f(b),this.b&&(this.b.cancel(),this.b=null),delete this.f,delete this.v)};\nh.va=function(a,b){return\"linkViaPopup\"==a&&b==(this.g||null)?r(this.sb,this):\"reauthViaPopup\"==a&&b==(this.g||null)?r(this.tb,this):\"linkViaRedirect\"==a&&(this.Z||null)==b?r(this.sb,this):\"reauthViaRedirect\"==a&&(this.Z||null)==b?r(this.tb,this):null};h.ac=function(a){var b=this;return bl(this,\"linkViaPopup\",a,function(){return $k(b,a.providerId).then(function(){return Mk(b)})},!1)};h.jc=function(a){return bl(this,\"reauthViaPopup\",a,function(){return A()},!0)};\nfunction bl(a,b,c,d,e){if(!Rf())return B(new N(\"operation-not-supported-in-this-environment\"));if(a.i&&!e)return B(a.i);var f=Lg(c.providerId),g=Qf(a.uid+\":::\"),l=null;(!Tf()||Lf())&&a.w&&c.isOAuthProvider&&(l=Ri(a.w,a.G,a.o,b,c,null,g,firebase.SDK_VERSION||null));var n=Df(l,f&&f.za,f&&f.ya);d=d().then(function(){cl(a);if(!e)return a.F().then(function(){})}).then(function(){return ek(a.a,n,b,c,g,!!l)}).then(function(){return new z(function(c,d){a.fa(b,null,new N(\"cancelled-popup-request\"),a.g||null);\na.f=c;a.v=d;a.g=g;a.b=a.a.Ca(a,b,n,g)})}).then(function(a){n&&Cf(n);return a?hg(a):null}).s(function(a){n&&Cf(n);throw a;});return R(a,d,e)}h.bc=function(a){var b=this;return dl(this,\"linkViaRedirect\",a,function(){return $k(b,a.providerId)},!1)};h.kc=function(a){return dl(this,\"reauthViaRedirect\",a,function(){return A()},!0)};\nfunction dl(a,b,c,d,e){if(!Rf())return B(new N(\"operation-not-supported-in-this-environment\"));if(a.i&&!e)return B(a.i);var f=null,g=Qf(a.uid+\":::\");d=d().then(function(){cl(a);if(!e)return a.F().then(function(){})}).then(function(){a.Z=g;return Mk(a)}).then(function(b){a.ca&&(b=a.ca,b=b.b.set(el,a.B(),b.a));return b}).then(function(){return a.a.Aa(b,c,g)}).s(function(b){f=b;if(a.ca)return fl(a.ca);throw f;}).then(function(){if(f)throw f;});return R(a,d,e)}\nfunction cl(a){if(!a.a||!a.I){if(a.a&&!a.I)throw new N(\"internal-error\");throw new N(\"auth-domain-config-required\");}}h.sb=function(a,b){var c=this;this.b&&(this.b.cancel(),this.b=null);var d=null,e=this.F().then(function(d){return Zg(c.c,{requestUri:a,sessionId:b,idToken:d})}).then(function(a){d=Zk(c,a,\"link\");return al(c,a)}).then(function(){return d});return R(this,e)};\nh.tb=function(a,b){var c=this;this.b&&(this.b.cancel(),this.b=null);var d=null,e=A().then(function(){return Vg($g(c.c,{requestUri:a,sessionId:b}),c.uid)}).then(function(a){d=Zk(c,a,\"reauthenticate\");Xk(c,a);c.i=null;return c.reload()}).then(function(){return d});return R(this,e,!0)};h.bb=function(a){var b=this,c=null;return R(this,this.F().then(function(b){c=b;return\"undefined\"===typeof a||Sa(a)?{}:Fg(new wg(a))}).then(function(a){return b.c.bb(c,a)}).then(function(a){if(b.email!=a)return b.reload()}).then(function(){}))};\nfunction R(a,b,c){var d=gl(a,b,c);a.A.push(d);Qb(d,function(){Ia(a.A,d)});return d}function gl(a,b,c){return a.i&&!c?(b.cancel(),B(a.i)):b.s(function(b){!b||\"auth/user-disabled\"!=b.code&&\"auth/user-token-expired\"!=b.code||(a.i||G(a,new Ak(\"userInvalidated\")),a.i=b);throw b;})}h.toJSON=function(){return this.B()};\nh.B=function(){var a={uid:this.uid,displayName:this.displayName,photoURL:this.photoURL,email:this.email,emailVerified:this.emailVerified,phoneNumber:this.phoneNumber,isAnonymous:this.isAnonymous,providerData:[],apiKey:this.G,appName:this.o,authDomain:this.w,stsTokenManager:this.h.B(),redirectEventId:this.Z||null};this.metadata&&Wa(a,this.metadata.B());w(this.providerData,function(b){a.providerData.push(ig(b))});return a};\nfunction hl(a){if(!a.apiKey)return null;var b={apiKey:a.apiKey,authDomain:a.authDomain,appName:a.appName},c={};if(a.stsTokenManager&&a.stsTokenManager.accessToken&&a.stsTokenManager.expirationTime)c[O]=a.stsTokenManager.accessToken,c.refreshToken=a.stsTokenManager.refreshToken||null,c.expiresIn=(a.stsTokenManager.expirationTime-na())/1E3;else return null;var d=new Bk(b,c,a);a.providerData&&w(a.providerData,function(a){a&&Rk(d,hg(a))});a.redirectEventId&&(d.Z=a.redirectEventId);return d}\nfunction il(a,b,c,d){var e=new Bk(a,b);c&&(e.ca=c);d&&Fk(e,d);return e.reload().then(function(){return e})};function jl(a){this.a=a;this.b=rj()}var el={name:\"redirectUser\",C:\"session\"};function fl(a){return uj(a.b,el,a.a)}function kl(a,b){return a.b.get(el,a.a).then(function(a){a&&b&&(a.authDomain=b);return hl(a||{})})};function ll(a,b){this.a=a;this.b=b||rj();this.c=null;this.f=ml(this);vj(this.b,yj(\"local\"),this.a,r(this.g,this))}ll.prototype.g=function(){var a=this,b=yj(\"local\");nl(this,function(){return A().then(function(){return a.c&&\"local\"!=a.c.C?a.b.get(b,a.a):null}).then(function(c){if(c)return ol(a,\"local\").then(function(){a.c=b})})})};function ol(a,b){var c=[],d;for(d in nj)nj[d]!==b&&c.push(uj(a.b,yj(nj[d]),a.a));c.push(uj(a.b,pl,a.a));return Nb(c)}\nfunction ml(a){var b=yj(\"local\"),c=yj(\"session\"),d=yj(\"none\");return a.b.get(c,a.a).then(function(e){return e?c:a.b.get(d,a.a).then(function(c){return c?d:a.b.get(b,a.a).then(function(c){return c?b:a.b.get(pl,a.a).then(function(a){return a?yj(a):b})})})}).then(function(b){a.c=b;return ol(a,b.C)}).s(function(){a.c||(a.c=b)})}var pl={name:\"persistence\",C:\"session\"};function yj(a){return{name:\"authUser\",C:a}}\nll.prototype.eb=function(a){var b=null,c=this;oj(a);return nl(this,function(){return a!=c.c.C?c.b.get(c.c,c.a).then(function(d){b=d;return ol(c,a)}).then(function(){c.c=yj(a);if(b)return c.b.set(c.c,b,c.a)}):A()})};function ql(a){return nl(a,function(){return a.b.set(pl,a.c.C,a.a)})}function rl(a,b){return nl(a,function(){return a.b.set(a.c,b.B(),a.a)})}function sl(a){return nl(a,function(){return uj(a.b,a.c,a.a)})}\nfunction tl(a,b){return nl(a,function(){return a.b.get(a.c,a.a).then(function(a){a&&b&&(a.authDomain=b);return hl(a||{})})})}function nl(a,b){a.f=a.f.then(b,b);return a.f};function ul(a){this.l=!1;M(this,\"app\",a);if(S(this).options&&S(this).options.apiKey)a=firebase.SDK_VERSION?Of(firebase.SDK_VERSION):null,this.c=new Ch(S(this).options&&S(this).options.apiKey,xi(yi),a);else throw new N(\"invalid-api-key\");this.N=[];this.m=[];this.I=[];this.Gb=firebase.INTERNAL.createSubscribe(r(this.Xb,this));this.R=void 0;this.Hb=firebase.INTERNAL.createSubscribe(r(this.Yb,this));vl(this,null);this.h=new ll(S(this).options.apiKey+\":\"+S(this).name);this.G=new jl(S(this).options.apiKey+\n\":\"+S(this).name);this.U=T(this,wl(this));this.i=T(this,xl(this));this.W=!1;this.ha=r(this.uc,this);this.Ga=r(this.ka,this);this.pa=r(this.Pb,this);this.qa=r(this.Vb,this);this.ra=r(this.Wb,this);yl(this);this.INTERNAL={};this.INTERNAL[\"delete\"]=r(this.delete,this);this.INTERNAL.logFramework=r(this.cc,this);this.o=0;F.call(this);zl(this);this.A=[]}t(ul,F);function Al(a){C.call(this,\"languageCodeChanged\");this.h=a}t(Al,C);function Bl(a){C.call(this,\"frameworkChanged\");this.f=a}t(Bl,C);h=ul.prototype;\nh.eb=function(a){a=this.h.eb(a);return T(this,a)};h.na=function(a){this.V===a||this.l||(this.V=a,Ih(this.c,this.V),G(this,new Al(this.$())))};h.$=function(){return this.V};h.Ac=function(){var a=k.navigator;this.na(a?a.languages&&a.languages[0]||a.language||a.userLanguage||null:null)};h.cc=function(a){this.A.push(a);Jh(this.c,firebase.SDK_VERSION?Of(firebase.SDK_VERSION,this.A):null);G(this,new Bl(this.A))};h.Ka=function(){return La(this.A)};\nfunction zl(a){Object.defineProperty(a,\"lc\",{get:function(){return this.$()},set:function(a){this.na(a)},enumerable:!1});a.V=null}h.toJSON=function(){return{apiKey:S(this).options.apiKey,authDomain:S(this).options.authDomain,appName:S(this).name,currentUser:U(this)&&U(this).B()}};function Cl(a){return a.Fb||B(new N(\"auth-domain-config-required\"))}\nfunction yl(a){var b=S(a).options.authDomain,c=S(a).options.apiKey;b&&Rf()&&(a.Fb=a.U.then(function(){if(!a.l){a.a=gk(b,c,S(a).name);a.a.subscribe(a);U(a)&&Nk(U(a));if(a.w){Nk(a.w);var d=a.w;d.na(a.$());Gk(d,a);d=a.w;Fk(d,a.A);Hk(d,a);a.w=null}return a.a}}))}h.ob=function(a,b){switch(a){case \"unknown\":case \"signInViaRedirect\":return!0;case \"signInViaPopup\":return this.g==b&&!!this.f;default:return!1}};\nh.fa=function(a,b,c,d){\"signInViaPopup\"==a&&this.g==d&&(c&&this.v?this.v(c):b&&!c&&this.f&&this.f(b),this.b&&(this.b.cancel(),this.b=null),delete this.f,delete this.v)};h.va=function(a,b){return\"signInViaRedirect\"==a||\"signInViaPopup\"==a&&this.g==b&&this.f?r(this.Ob,this):null};\nh.Ob=function(a,b){var c=this;a={requestUri:a,sessionId:b};this.b&&(this.b.cancel(),this.b=null);var d=null,e=null,f=Xg(c.c,a).then(function(a){d=uh(a);e=Mg(a);return a});a=c.U.then(function(){return f}).then(function(a){return Dl(c,a)}).then(function(){return hg({user:U(c),credential:d,additionalUserInfo:e,operationType:\"signIn\"})});return T(this,a)};\nh.sc=function(a){if(!Rf())return B(new N(\"operation-not-supported-in-this-environment\"));var b=this,c=Lg(a.providerId),d=Qf(),e=null;(!Tf()||Lf())&&S(this).options.authDomain&&a.isOAuthProvider&&(e=Ri(S(this).options.authDomain,S(this).options.apiKey,S(this).name,\"signInViaPopup\",a,null,d,firebase.SDK_VERSION||null));var f=Df(e,c&&c.za,c&&c.ya);c=Cl(this).then(function(b){return ek(b,f,\"signInViaPopup\",a,d,!!e)}).then(function(){return new z(function(a,c){b.fa(\"signInViaPopup\",null,new N(\"cancelled-popup-request\"),\nb.g);b.f=a;b.v=c;b.g=d;b.b=b.a.Ca(b,\"signInViaPopup\",f,d)})}).then(function(a){f&&Cf(f);return a?hg(a):null}).s(function(a){f&&Cf(f);throw a;});return T(this,c)};h.tc=function(a){if(!Rf())return B(new N(\"operation-not-supported-in-this-environment\"));var b=this,c=Cl(this).then(function(){return ql(b.h)}).then(function(){return b.a.Aa(\"signInViaRedirect\",a)});return T(this,c)};\nh.aa=function(){if(!Rf())return B(new N(\"operation-not-supported-in-this-environment\"));var a=this,b=Cl(this).then(function(){return a.a.aa()}).then(function(a){return a?hg(a):null});return T(this,b)};function Dl(a,b){var c={};c.apiKey=S(a).options.apiKey;c.authDomain=S(a).options.authDomain;c.appName=S(a).name;return a.U.then(function(){return il(c,b,a.G,a.Ka())}).then(function(b){if(U(a)&&b.uid==U(a).uid)return Uk(U(a),b),a.ka(b);vl(a,b);Nk(b);return a.ka(b)}).then(function(){El(a)})}\nfunction vl(a,b){U(a)&&(Lk(U(a),a.Ga),E(U(a),\"tokenChanged\",a.pa),E(U(a),\"userDeleted\",a.qa),E(U(a),\"userInvalidated\",a.ra),Kk(U(a)));b&&(b.N.push(a.Ga),cd(b,\"tokenChanged\",a.pa),cd(b,\"userDeleted\",a.qa),cd(b,\"userInvalidated\",a.ra),0<a.o&&Jk(b));M(a,\"currentUser\",b);b&&(b.na(a.$()),Gk(b,a),Fk(b,a.A),Hk(b,a))}h.hb=function(){var a=this,b=this.i.then(function(){if(!U(a))return A();vl(a,null);return sl(a.h).then(function(){El(a)})});return T(this,b)};\nfunction Fl(a){var b=kl(a.G,S(a).options.authDomain).then(function(b){if(a.w=b)b.ca=a.G;return fl(a.G)});return T(a,b)}function wl(a){var b=S(a).options.authDomain,c=Fl(a).then(function(){return tl(a.h,b)}).then(function(b){return b?(b.ca=a.G,a.w&&(a.w.Z||null)==(b.Z||null)?b:b.reload().then(function(){return rl(a.h,b).then(function(){return b})}).s(function(c){return\"auth/network-request-failed\"==c.code?b:sl(a.h)})):null}).then(function(b){vl(a,b||null)});return T(a,c)}\nfunction xl(a){return a.U.then(function(){return a.aa()}).s(function(){}).then(function(){if(!a.l)return a.ha()}).s(function(){}).then(function(){if(!a.l){a.W=!0;var b=a.h;vj(b.b,yj(\"local\"),b.a,a.ha)}})}\nh.uc=function(){var a=this;return tl(this.h,S(this).options.authDomain).then(function(b){if(!a.l){var c;if(c=U(a)&&b){c=U(a).uid;var d=b.uid;c=void 0===c||null===c||\"\"===c||void 0===d||null===d||\"\"===d?!1:c==d}if(c)return Uk(U(a),b),U(a).F();if(U(a)||b)vl(a,b),b&&(Nk(b),b.ca=a.G),a.a&&a.a.subscribe(a),El(a)}})};h.ka=function(a){return rl(this.h,a)};h.Pb=function(){El(this);this.ka(U(this))};h.Vb=function(){this.hb()};h.Wb=function(){this.hb()};\nfunction Gl(a,b){var c=null,d=null;return T(a,b.then(function(b){c=uh(b);d=Mg(b);return Dl(a,b)}).then(function(){return hg({user:U(a),credential:c,additionalUserInfo:d,operationType:\"signIn\"})}))}h.Xb=function(a){var b=this;this.addAuthTokenListener(function(){a.next(U(b))})};h.Yb=function(a){var b=this;Hl(this,function(){a.next(U(b))})};h.ec=function(a,b,c){var d=this;this.W&&firebase.Promise.resolve().then(function(){p(a)?a(U(d)):p(a.next)&&a.next(U(d))});return this.Gb(a,b,c)};\nh.dc=function(a,b,c){var d=this;this.W&&firebase.Promise.resolve().then(function(){d.R=d.getUid();p(a)?a(U(d)):p(a.next)&&a.next(U(d))});return this.Hb(a,b,c)};h.Rb=function(a){var b=this,c=this.i.then(function(){return U(b)?U(b).F(a).then(function(a){return{accessToken:a}}):null});return T(this,c)};h.pc=function(a){var b=this;return this.i.then(function(){return Gl(b,Q(b.c,vi,{token:a}))}).then(function(a){a=a.user;Tk(a,\"isAnonymous\",!1);return b.ka(a)}).then(function(){return U(b)})};\nh.qc=function(a,b){var c=this;return this.i.then(function(){return Gl(c,Q(c.c,kh,{email:a,password:b}))}).then(function(a){return a.user})};h.Kb=function(a,b){var c=this;return this.i.then(function(){return Gl(c,Q(c.c,ri,{email:a,password:b}))}).then(function(a){return a.user})};h.oc=function(a){return this.fb(a).then(function(a){return a.user})};h.fb=function(a){var b=this;return this.i.then(function(){return Gl(b,a.wa(b.c))})};\nh.gb=function(){var a=this;return this.i.then(function(){var b=U(a);return b&&b.isAnonymous?b:Gl(a,a.c.gb()).then(function(b){b=b.user;Tk(b,\"isAnonymous\",!0);return a.ka(b)}).then(function(){return U(a)})})};function S(a){return a.app}function U(a){return a.currentUser}h.getUid=function(){return U(this)&&U(this).uid||null};function Il(a){return U(a)&&U(a)._lat||null}\nfunction El(a){if(a.W){for(var b=0;b<a.m.length;b++)if(a.m[b])a.m[b](Il(a));if(a.R!==a.getUid()&&a.I.length)for(a.R=a.getUid(),b=0;b<a.I.length;b++)if(a.I[b])a.I[b](Il(a))}}h.Ib=function(a){this.addAuthTokenListener(a);this.o++;0<this.o&&U(this)&&Jk(U(this))};h.mc=function(a){var b=this;w(this.m,function(c){c==a&&b.o--});0>this.o&&(this.o=0);0==this.o&&U(this)&&Kk(U(this));this.removeAuthTokenListener(a)};\nh.addAuthTokenListener=function(a){var b=this;this.m.push(a);T(this,this.i.then(function(){b.l||Ha(b.m,a)&&a(Il(b))}))};h.removeAuthTokenListener=function(a){Ja(this.m,function(b){return b==a})};function Hl(a,b){a.I.push(b);T(a,a.i.then(function(){!a.l&&Ha(a.I,b)&&a.R!==a.getUid()&&(a.R=a.getUid(),b(Il(a)))}))}h.delete=function(){this.l=!0;for(var a=0;a<this.N.length;a++)this.N[a].cancel(\"app-deleted\");this.N=[];this.h&&(a=this.h,xj(a.b,a.a,this.ha));this.a&&this.a.unsubscribe(this);return firebase.Promise.resolve()};\nfunction T(a,b){a.N.push(b);Qb(b,function(){Ia(a.N,b)});return b}h.Nb=function(a){return T(this,Th(this.c,a))};h.Bc=function(a){return this.Ia(a).then(function(a){return a.data.email})};h.Ta=function(a,b){return T(this,this.c.Ta(a,b).then(function(){}))};h.Ia=function(a){return T(this,this.c.Ia(a).then(function(a){return new lg(a)}))};h.Sa=function(a){return T(this,this.c.Sa(a).then(function(){}))};\nh.cb=function(a,b){var c=this;return T(this,A().then(function(){return\"undefined\"===typeof b||Sa(b)?{}:Fg(new wg(b))}).then(function(b){return c.c.cb(a,b)}).then(function(){}))};h.rc=function(a,b){return T(this,ok(this,a,b,r(this.fb,this)))};function Jl(a,b,c,d){a:{c=Array.prototype.slice.call(c);var e=0;for(var f=!1,g=0;g<b.length;g++)if(b[g].optional)f=!0;else{if(f)throw new N(\"internal-error\",\"Argument validator encountered a required argument after an optional argument.\");e++}f=b.length;if(c.length<e||f<c.length)d=\"Expected \"+(e==f?1==e?\"1 argument\":e+\" arguments\":e+\"-\"+f+\" arguments\")+\" but got \"+c.length+\".\";else{for(e=0;e<c.length;e++)if(f=b[e].optional&&void 0===c[e],!b[e].M(c[e])&&!f){b=b[e];if(0>e||e>=Kl.length)throw new N(\"internal-error\",\n\"Argument validator received an unsupported number of arguments.\");c=Kl[e];d=(d?\"\":c+\" argument \")+(b.name?'\"'+b.name+'\" ':\"\")+\"must be \"+b.K+\".\";break a}d=null}}if(d)throw new N(\"argument-error\",a+\" failed: \"+d);}var Kl=\"First Second Third Fourth Fifth Sixth Seventh Eighth Ninth\".split(\" \");function V(a,b){return{name:a||\"\",K:\"a valid string\",optional:!!b,M:m}}function Ll(){return{name:\"opt_forceRefresh\",K:\"a boolean\",optional:!0,M:ba}}\nfunction W(a,b){return{name:a||\"\",K:\"a valid object\",optional:!!b,M:q}}function Ml(a,b){return{name:a||\"\",K:\"a function\",optional:!!b,M:p}}function Nl(a,b){return{name:a||\"\",K:\"null\",optional:!!b,M:ea}}function Ol(){return{name:\"\",K:\"an HTML element\",optional:!1,M:function(a){return!!(a&&a instanceof Element)}}}function Pl(){return{name:\"auth\",K:\"an instance of Firebase Auth\",optional:!0,M:function(a){return!!(a&&a instanceof ul)}}}\nfunction Ql(){return{name:\"app\",K:\"an instance of Firebase App\",optional:!0,M:function(a){return!!(a&&a instanceof firebase.app.App)}}}function Rl(a){return{name:a?a+\"Credential\":\"credential\",K:a?\"a valid \"+a+\" credential\":\"a valid credential\",optional:!1,M:function(b){if(!b)return!1;var c=!a||b.providerId===a;return!(!b.wa||!c)}}}\nfunction Sl(){return{name:\"authProvider\",K:\"a valid Auth provider\",optional:!1,M:function(a){return!!(a&&a.providerId&&a.hasOwnProperty&&a.hasOwnProperty(\"isOAuthProvider\"))}}}function Tl(){return{name:\"applicationVerifier\",K:\"an implementation of firebase.auth.ApplicationVerifier\",optional:!1,M:function(a){return!!(a&&m(a.type)&&p(a.verify))}}}function X(a,b,c,d){return{name:c||\"\",K:a.K+\" or \"+b.K,optional:!!d,M:function(c){return a.M(c)||b.M(c)}}};function Ul(a,b,c,d,e,f){M(this,\"type\",\"recaptcha\");this.b=this.c=null;this.m=!1;this.l=b;this.a=c||{theme:\"light\",type:\"image\"};this.g=[];if(this.a[Vl])throw new N(\"argument-error\",\"sitekey should not be provided for reCAPTCHA as one is automatically provisioned for the current project.\");this.h=\"invisible\"===this.a[Wl];if(!wc(b)||!this.h&&wc(b).hasChildNodes())throw new N(\"argument-error\",\"reCAPTCHA container is either not found or already contains inner elements!\");this.u=new Ch(a,f||null,e||null);\nthis.o=d||function(){return null};var g=this;this.i=[];var l=this.a[Xl];this.a[Xl]=function(a){Yl(g,a);if(\"function\"===typeof l)l(a);else if(\"string\"===typeof l){var b=L(l,k);\"function\"===typeof b&&b(a)}};var n=this.a[Zl];this.a[Zl]=function(){Yl(g,null);if(\"function\"===typeof n)n();else if(\"string\"===typeof n){var a=L(n,k);\"function\"===typeof a&&a()}}}var Xl=\"callback\",Zl=\"expired-callback\",Vl=\"sitekey\",Wl=\"size\";function Yl(a,b){for(var c=0;c<a.i.length;c++)try{a.i[c](b)}catch(d){}}\nfunction $l(a,b){Ja(a.i,function(a){return a==b})}function am(a,b){a.g.push(b);Qb(b,function(){Ia(a.g,b)});return b}h=Ul.prototype;\nh.xa=function(){var a=this;return this.c?this.c:this.c=am(this,A().then(function(){if(Sf())return Hf();throw new N(\"operation-not-supported-in-this-environment\",\"RecaptchaVerifier is only supported in a browser HTTP/HTTPS environment.\");}).then(function(){return bm(cm(),a.o())}).then(function(){return Q(a.u,ui,{})}).then(function(b){a.a[Vl]=b.recaptchaSiteKey}).s(function(b){a.c=null;throw b;}))};\nh.render=function(){dm(this);var a=this;return am(this,this.xa().then(function(){if(null===a.b){var b=a.l;if(!a.h){var c=wc(b);b=zc(\"DIV\");c.appendChild(b)}a.b=grecaptcha.render(b,a.a)}return a.b}))};h.verify=function(){dm(this);var a=this;return am(this,this.render().then(function(b){return new z(function(c){var d=grecaptcha.getResponse(b);if(d)c(d);else{var e=function(b){b&&($l(a,e),c(b))};a.i.push(e);a.h&&grecaptcha.execute(a.b)}})}))};h.reset=function(){dm(this);null!==this.b&&grecaptcha.reset(this.b)};\nfunction dm(a){if(a.m)throw new N(\"internal-error\",\"RecaptchaVerifier instance has been destroyed.\");}h.clear=function(){dm(this);this.m=!0;cm().b--;for(var a=0;a<this.g.length;a++)this.g[a].cancel(\"RecaptchaVerifier instance has been destroyed.\");if(!this.h){a=wc(this.l);for(var b;b=a.firstChild;)a.removeChild(b)}};var em=dc(\"https://www.google.com/recaptcha/api.js?onload=%{onload}&render=explicit&hl=%{hl}\");\nfunction fm(){this.b=k.grecaptcha?Infinity:0;this.c=null;this.a=\"__rcb\"+Math.floor(1E6*Math.random()).toString()}\nfunction bm(a,b){return new z(function(c,d){if(Zf())if(!k.grecaptcha||b!==a.c&&!a.b){k[a.a]=function(){if(k.grecaptcha){a.c=b;var e=k.grecaptcha.render;k.grecaptcha.render=function(b,c){b=e(b,c);a.b++;return b};c()}else d(new N(\"internal-error\"));delete k[a.a]};var e=hc(em,{onload:a.a,hl:b||\"\"});A(kf(e)).s(function(){d(new N(\"internal-error\",\"Unable to load external reCAPTCHA dependencies!\"))})}else c();else d(new N(\"network-request-failed\"))})}var gm=null;\nfunction cm(){gm||(gm=new fm);return gm}function hm(a,b,c){try{this.f=c||firebase.app()}catch(f){throw new N(\"argument-error\",\"No firebase.app.App instance is currently initialized.\");}if(this.f.options&&this.f.options.apiKey)c=this.f.options.apiKey;else throw new N(\"invalid-api-key\");var d=this,e=null;try{e=this.f.auth().Ka()}catch(f){}e=firebase.SDK_VERSION?Of(firebase.SDK_VERSION,e):null;Ul.call(this,c,a,b,function(){try{var a=d.f.auth().$()}catch(g){a=null}return a},e,xi(yi))}t(hm,Ul);function Y(a,b){for(var c in b){var d=b[c].name;a[d]=im(d,a[c],b[c].j)}}function Z(a,b,c,d){a[b]=im(b,c,d)}function im(a,b,c){function d(){var a=Array.prototype.slice.call(arguments);Jl(e,c,a);return b.apply(this,a)}if(!c)return b;var e=jm(a),f;for(f in b)d[f]=b[f];for(f in b.prototype)d.prototype[f]=b.prototype[f];return d}function jm(a){a=a.split(\".\");return a[a.length-1]};Y(ul.prototype,{Sa:{name:\"applyActionCode\",j:[V(\"code\")]},Ia:{name:\"checkActionCode\",j:[V(\"code\")]},Ta:{name:\"confirmPasswordReset\",j:[V(\"code\"),V(\"newPassword\")]},Kb:{name:\"createUserWithEmailAndPassword\",j:[V(\"email\"),V(\"password\")]},Nb:{name:\"fetchProvidersForEmail\",j:[V(\"email\")]},aa:{name:\"getRedirectResult\",j:[]},dc:{name:\"onAuthStateChanged\",j:[X(W(),Ml(),\"nextOrObserver\"),Ml(\"opt_error\",!0),Ml(\"opt_completed\",!0)]},ec:{name:\"onIdTokenChanged\",j:[X(W(),Ml(),\"nextOrObserver\"),Ml(\"opt_error\",\n!0),Ml(\"opt_completed\",!0)]},cb:{name:\"sendPasswordResetEmail\",j:[V(\"email\"),X(W(\"opt_actionCodeSettings\",!0),Nl(null,!0),\"opt_actionCodeSettings\",!0)]},eb:{name:\"setPersistence\",j:[V(\"persistence\")]},fb:{name:\"signInAndRetrieveDataWithCredential\",j:[Rl()]},gb:{name:\"signInAnonymously\",j:[]},oc:{name:\"signInWithCredential\",j:[Rl()]},pc:{name:\"signInWithCustomToken\",j:[V(\"token\")]},qc:{name:\"signInWithEmailAndPassword\",j:[V(\"email\"),V(\"password\")]},rc:{name:\"signInWithPhoneNumber\",j:[V(\"phoneNumber\"),\nTl()]},sc:{name:\"signInWithPopup\",j:[Sl()]},tc:{name:\"signInWithRedirect\",j:[Sl()]},hb:{name:\"signOut\",j:[]},toJSON:{name:\"toJSON\",j:[V(null,!0)]},Ac:{name:\"useDeviceLanguage\",j:[]},Bc:{name:\"verifyPasswordResetCode\",j:[V(\"code\")]}});(function(a,b){for(var c in b){var d=b[c].name;if(d!==c){var e=b[c].Jb;Object.defineProperty(a,d,{get:function(){return this[c]},set:function(a){Jl(d,[e],[a],!0);this[c]=a},enumerable:!0})}}})(ul.prototype,{lc:{name:\"languageCode\",Jb:X(V(),Nl(),\"languageCode\")}});\nul.Persistence=nj;ul.Persistence.LOCAL=\"local\";ul.Persistence.SESSION=\"session\";ul.Persistence.NONE=\"none\";\nY(Bk.prototype,{\"delete\":{name:\"delete\",j:[]},F:{name:\"getIdToken\",j:[Ll()]},getToken:{name:\"getToken\",j:[Ll()]},Xa:{name:\"linkAndRetrieveDataWithCredential\",j:[Rl()]},Zb:{name:\"linkWithCredential\",j:[Rl()]},$b:{name:\"linkWithPhoneNumber\",j:[V(\"phoneNumber\"),Tl()]},ac:{name:\"linkWithPopup\",j:[Sl()]},bc:{name:\"linkWithRedirect\",j:[Sl()]},Za:{name:\"reauthenticateAndRetrieveDataWithCredential\",j:[Rl()]},hc:{name:\"reauthenticateWithCredential\",j:[Rl()]},ic:{name:\"reauthenticateWithPhoneNumber\",j:[V(\"phoneNumber\"),\nTl()]},jc:{name:\"reauthenticateWithPopup\",j:[Sl()]},kc:{name:\"reauthenticateWithRedirect\",j:[Sl()]},reload:{name:\"reload\",j:[]},bb:{name:\"sendEmailVerification\",j:[X(W(\"opt_actionCodeSettings\",!0),Nl(null,!0),\"opt_actionCodeSettings\",!0)]},toJSON:{name:\"toJSON\",j:[V(null,!0)]},yc:{name:\"unlink\",j:[V(\"provider\")]},kb:{name:\"updateEmail\",j:[V(\"email\")]},lb:{name:\"updatePassword\",j:[V(\"password\")]},zc:{name:\"updatePhoneNumber\",j:[Rl(\"phone\")]},mb:{name:\"updateProfile\",j:[W(\"profile\")]}});\nY(z.prototype,{s:{name:\"catch\"},then:{name:\"then\"}});Y(nk.prototype,{confirm:{name:\"confirm\",j:[V(\"verificationCode\")]}});Z(mh,\"credential\",function(a,b){return new jh(a,b)},[V(\"email\"),V(\"password\")]);Y(bh.prototype,{sa:{name:\"addScope\",j:[V(\"scope\")]},Ba:{name:\"setCustomParameters\",j:[W(\"customOAuthParameters\")]}});Z(bh,\"credential\",ch,[X(V(),W(),\"token\")]);Y(dh.prototype,{sa:{name:\"addScope\",j:[V(\"scope\")]},Ba:{name:\"setCustomParameters\",j:[W(\"customOAuthParameters\")]}});\nZ(dh,\"credential\",eh,[X(V(),W(),\"token\")]);Y(fh.prototype,{sa:{name:\"addScope\",j:[V(\"scope\")]},Ba:{name:\"setCustomParameters\",j:[W(\"customOAuthParameters\")]}});Z(fh,\"credential\",gh,[X(V(),X(W(),Nl()),\"idToken\"),X(V(),Nl(),\"accessToken\",!0)]);Y(hh.prototype,{Ba:{name:\"setCustomParameters\",j:[W(\"customOAuthParameters\")]}});Z(hh,\"credential\",ih,[X(V(),W(),\"token\"),V(\"secret\",!0)]);\nY(P.prototype,{sa:{name:\"addScope\",j:[V(\"scope\")]},credential:{name:\"credential\",j:[X(V(),Nl(),\"idToken\",!0),X(V(),Nl(),\"accessToken\",!0)]},Ba:{name:\"setCustomParameters\",j:[W(\"customOAuthParameters\")]}});Z(rh,\"credential\",th,[V(\"verificationId\"),V(\"verificationCode\")]);Y(rh.prototype,{Qa:{name:\"verifyPhoneNumber\",j:[V(\"phoneNumber\"),Tl()]}});Y(N.prototype,{toJSON:{name:\"toJSON\",j:[V(null,!0)]}});Y(zh.prototype,{toJSON:{name:\"toJSON\",j:[V(null,!0)]}});\nY(yh.prototype,{toJSON:{name:\"toJSON\",j:[V(null,!0)]}});Y(hm.prototype,{clear:{name:\"clear\",j:[]},render:{name:\"render\",j:[]},verify:{name:\"verify\",j:[]}});\n(function(){if(\"undefined\"!==typeof firebase&&firebase.INTERNAL&&firebase.INTERNAL.registerService){var a={Auth:ul,Error:N};Z(a,\"EmailAuthProvider\",mh,[]);Z(a,\"FacebookAuthProvider\",bh,[]);Z(a,\"GithubAuthProvider\",dh,[]);Z(a,\"GoogleAuthProvider\",fh,[]);Z(a,\"TwitterAuthProvider\",hh,[]);Z(a,\"OAuthProvider\",P,[V(\"providerId\")]);Z(a,\"PhoneAuthProvider\",rh,[Pl()]);Z(a,\"RecaptchaVerifier\",hm,[X(V(),Ol(),\"recaptchaContainer\"),W(\"recaptchaParameters\",!0),Ql()]);firebase.INTERNAL.registerService(\"auth\",function(a,\nc){a=new ul(a);c({INTERNAL:{getUid:r(a.getUid,a),getToken:r(a.Rb,a),addAuthTokenListener:r(a.Ib,a),removeAuthTokenListener:r(a.mc,a)}});return a},a,function(a,c){if(\"create\"===a)try{c.auth()}catch(d){}});firebase.INTERNAL.extendNamespace({User:Bk})}else throw Error(\"Cannot find the firebase namespace; be sure to include firebase-app.js before this library.\");})();\n}).call(typeof global !== 'undefined' ? global : typeof self !== 'undefined' ? self : typeof window !== 'undefined' ? window : {});\n\n\n\n// WEBPACK FOOTER //\n// ./node_modules/@firebase/auth/dist/auth.js","// @flow\n/** @jsx h */\n\nimport { PureComponent } from '../../helpers/pure-components'\nimport { getFirebaseInstance } from '../../db/firebase'\nimport { extractActivePolls, preparePoll } from './helpers/pollUtils'\nimport type { Poll, AuthConfig } from '../../types'\n\ntype RenderProps = {\n  poll?: Poll,\n  error?: ?Error,\n  loading: boolean\n}\n\ntype Props = {\n  clientId: number,\n  authConfig: AuthConfig,\n  render: (props: RenderProps) => any\n}\n\ntype State = {\n  poll?: Poll,\n  error?: ?Error,\n  loading: boolean\n}\n\nexport class WithPollState extends PureComponent<Props, State> {\n  state = {\n    loading: false,\n    poll: undefined,\n    error: null\n  }\n  componentDidMount () {\n    this.subscribeToPollChanges(this.props.clientId)\n  }\n\n  subscribeToPollChanges (clientId: number) {\n    const { authConfig } = this.props\n    try {\n      getFirebaseInstance(authConfig)\n        .database()\n        .ref(`/channels/${clientId}/interactions`)\n        .on('value', snapshot => {\n          const firebaseInteractions = snapshot.val() || []\n          const firebaseActivePolls = extractActivePolls(firebaseInteractions)\n          if (!firebaseActivePolls.length) {\n            this.setState({ error: null, poll: undefined, loading: false })\n            return\n          }\n          // If there are more than one active poll, pick the first one\n          const currentPoll = firebaseActivePolls[0]\n          this.setState({\n            poll: preparePoll(currentPoll),\n            error: null,\n            loading: false\n          })\n        })\n    } catch (err) {\n      const errorMessage = `Unable to find active polls for client ${clientId}`\n      console.error(errorMessage)\n      this.setState({ error: new Error(errorMessage) })\n    }\n  }\n\n  render () {\n    const { poll, error, loading } = this.state\n    return this.props.render({ poll, error, loading })\n  }\n}\n\n\n\n// WEBPACK FOOTER //\n// ./src/shared/widgets/LivePoll/WithPollState.js","// @flow\n\nimport type { FirebaseInteraction, Poll, Interaction } from '../../../types'\n\nexport function extractActivePolls (interactions: Interaction): Array<FirebaseInteraction> {\n  return (interactions.list || [])\n    .reduce((acc, pollId) => {\n      // Need to this because flow complains that it does not support \"non-string\" literals as keys\n      const interaction = interactions[`${pollId}`]\n      if (interaction.status === 'ACTIVE') {\n        interaction.id = pollId\n        acc.push(interaction)\n      }\n      return acc\n    }, [])\n}\n\nexport function preparePoll (poll: FirebaseInteraction): Poll {\n  return {\n    id: poll.id,\n    title: poll.title,\n    alternatives: poll.alternatives\n  }\n}\n\n\n\n// WEBPACK FOOTER //\n// ./src/shared/widgets/LivePoll/helpers/pollUtils.js","// @flow\n/** @jsx h */\nimport { PureComponent } from '../../helpers/pure-components'\n\nimport type {\n  Poll,\n  Result as ResultType,\n  AuthConfig as AuthConfigType\n} from '../../types'\nimport { prepareResult } from './helpers/prepareResult'\n\ntype RenderProps = {\n  result?: ?ResultType,\n  error?: ?Error,\n  lastUpdatedTime: Date // timestamp\n}\n\ntype Props = {\n  clientId: number,\n  poll: Poll,\n  authConfig: AuthConfigType,\n  render: (props: RenderProps) => any\n}\n\ntype State = {\n  result?: ?ResultType,\n  error?: ?Error,\n  lastUpdatedTime: Date // timestamp\n}\n\nexport class WithResultState extends PureComponent<Props, State> {\n  constructor (props: any) {\n    super(props)\n    this.state = {...this.getStateBasedOnProps(props)}\n  }\n\n  componentWillReceiveProps (nextProps: any) {\n    this.setState({\n      ...this.getStateBasedOnProps(nextProps)\n    })\n  }\n\n  getStateBasedOnProps = (props: any) => {\n    try {\n      const { clientId, poll } = props\n\n      // Prevent race conditions / setting result for previous poll\n      if (clientId !== this.props.clientId || poll.id !== this.props.poll.id) {\n        return {}\n      }\n\n      return {\n        result: prepareResult(poll),\n        error: null,\n        lastUpdatedTime: new Date()\n      }\n    } catch (error) {\n      return { error }\n    }\n  }\n\n  render () {\n    return this.props.render({ ...this.state })\n  }\n}\n\n\n\n// WEBPACK FOOTER //\n// ./src/shared/widgets/LivePoll/WithResultState.js","// @flow\n\nimport type { Result } from '../../../types'\n\nexport function prepareResult (\n  poll: any\n): Result {\n  let votes = 0\n  const items = poll.alternatives.list.map(id => {\n    votes += poll.alternatives[id].votes\n    return { id, ...poll.alternatives[id] }\n  })\n  return {\n    alternatives: poll.alternatives,\n    items,\n    votes\n  }\n}\n\n\n\n// WEBPACK FOOTER //\n// ./src/shared/widgets/LivePoll/helpers/prepareResult.js","// @flow\n/** @jsx h */\n\nimport { h, Component } from 'preact'\n\ntype Props = {\n  type: 'assertive',\n  children: any,\n}\n\nexport class AriaLive extends Component<Props> {\n  render () {\n    return (\n      <div id='ariaLive' className='nrk-sr' aria-live={this.props.type}>\n        {this.props.children}\n      </div>\n    )\n  }\n}\n\n\n\n// WEBPACK FOOTER //\n// ./src/shared/widgets/LivePoll/components/LivePoll/AriaLive/AriaLive.js","// @flow\n\nimport type { Alternative } from '../../../types'\n\nexport function alternativeIdToAlternativeText (id: number, alternatives: Object): string {\n  const alternative = getAlternativeFromId(id, getAlternativesFromPoll(alternatives))\n  return getTextFromAlternative(alternative)\n}\n\nexport function getAlternativeFromId (id: number, alternatives: Array<Alternative>): ?Alternative {\n  return alternatives.find(alternative => alternative.id === id)\n}\n\nfunction getTextFromAlternative (alternative: ?Alternative) {\n  if (!alternative) {\n    return 'ukjent'\n  }\n  return alternative.text\n}\n\nexport function getAlternativesFromPoll (poll: Object) {\n  return poll.list.reduce((acc, alternativeId) => {\n    acc.push(poll[alternativeId])\n    return acc\n  }, [])\n}\n\n\n\n// WEBPACK FOOTER //\n// ./src/shared/widgets/LivePoll/helpers/alternativeUtils.js","function debounce (func, wait, immediate) {\n  let timeout\n\n  return function () {\n    const context = this\n    const args = arguments\n\n    let later = function () {\n      timeout = null\n      if (!immediate) func.apply(context, args)\n    }\n    var callNow = immediate && !timeout\n    clearTimeout(timeout)\n    timeout = setTimeout(later, wait)\n    if (callNow) func.apply(context, args)\n  }\n}\n\nexport { debounce }\n\n\n\n// WEBPACK FOOTER //\n// ./src/shared/helpers/debounce.js"],"sourceRoot":""}