From 018e38e9ac1e9234fd4d87b16d70e0288ff133a0 Mon Sep 17 00:00:00 2001 From: squidfunk Date: Sun, 26 Jan 2020 16:03:49 +0100 Subject: [PATCH] Added support for lunr-languages --- material/assets/javascripts/bundle.js.map | 2 +- material/assets/javascripts/worker/search.js | 8 ++++---- material/assets/javascripts/worker/search.js.map | 2 +- material/partials/language.html | 8 +------- src/assets/javascripts/index.ts | 3 ++- src/assets/javascripts/modules/search/_/index.ts | 7 +++++++ src/partials/language.html | 8 +------- 7 files changed, 17 insertions(+), 21 deletions(-) diff --git a/material/assets/javascripts/bundle.js.map b/material/assets/javascripts/bundle.js.map index c6e9d116e..a2d3a7d57 100644 --- a/material/assets/javascripts/bundle.js.map +++ b/material/assets/javascripts/bundle.js.map @@ -1 +1 @@ -{"version":3,"sources":["webpack:///webpack/bootstrap","webpack:///./node_modules/rxjs/_esm5/internal/util/root.js","webpack:///(webpack)/buildin/global.js","webpack:///./node_modules/ramda/es/internal/_isPlaceholder.js","webpack:///./node_modules/ramda/es/internal/_curry1.js","webpack:///./node_modules/ramda/es/internal/_identity.js","webpack:///./node_modules/ramda/es/identity.js","webpack:///./node_modules/ramda/es/internal/_has.js","webpack:///./node_modules/ramda/es/internal/_isArguments.js","webpack:///./node_modules/ramda/es/keys.js","webpack:///./node_modules/ramda/es/values.js","webpack:///./node_modules/tslib/tslib.es6.js","webpack:///./node_modules/rxjs/_esm5/internal/util/isFunction.js","webpack:///./node_modules/rxjs/_esm5/internal/config.js","webpack:///./node_modules/rxjs/_esm5/internal/util/hostReportError.js","webpack:///./node_modules/rxjs/_esm5/internal/Observer.js","webpack:///./node_modules/rxjs/_esm5/internal/util/isArray.js","webpack:///./node_modules/rxjs/_esm5/internal/util/isObject.js","webpack:///./node_modules/rxjs/_esm5/internal/util/UnsubscriptionError.js","webpack:///./node_modules/rxjs/_esm5/internal/Subscription.js","webpack:///./node_modules/rxjs/_esm5/internal/symbol/rxSubscriber.js","webpack:///./node_modules/rxjs/_esm5/internal/Subscriber.js","webpack:///./node_modules/rxjs/_esm5/internal/symbol/observable.js","webpack:///./node_modules/rxjs/_esm5/internal/util/noop.js","webpack:///./node_modules/rxjs/_esm5/internal/util/pipe.js","webpack:///./node_modules/rxjs/_esm5/internal/Observable.js","webpack:///./node_modules/rxjs/_esm5/internal/util/toSubscriber.js","webpack:///./node_modules/rxjs/_esm5/internal/util/canReportError.js","webpack:///./node_modules/rxjs/_esm5/internal/util/ObjectUnsubscribedError.js","webpack:///./node_modules/rxjs/_esm5/internal/SubjectSubscription.js","webpack:///./node_modules/rxjs/_esm5/internal/Subject.js","webpack:///./node_modules/rxjs/_esm5/internal/util/isScheduler.js","webpack:///./node_modules/rxjs/_esm5/internal/util/subscribeToArray.js","webpack:///./node_modules/rxjs/_esm5/internal/scheduled/scheduleArray.js","webpack:///./node_modules/rxjs/_esm5/internal/observable/fromArray.js","webpack:///./node_modules/rxjs/_esm5/internal/observable/of.js","webpack:///./node_modules/rxjs/_esm5/internal/observable/empty.js","webpack:///./node_modules/rxjs/_esm5/internal/operators/map.js","webpack:///./node_modules/rxjs/_esm5/internal/symbol/iterator.js","webpack:///./node_modules/rxjs/_esm5/internal/util/isArrayLike.js","webpack:///./node_modules/rxjs/_esm5/internal/util/isPromise.js","webpack:///./node_modules/rxjs/_esm5/internal/util/subscribeTo.js","webpack:///./node_modules/rxjs/_esm5/internal/util/subscribeToObservable.js","webpack:///./node_modules/rxjs/_esm5/internal/util/subscribeToPromise.js","webpack:///./node_modules/rxjs/_esm5/internal/util/subscribeToIterable.js","webpack:///./node_modules/rxjs/_esm5/internal/scheduled/scheduled.js","webpack:///./node_modules/rxjs/_esm5/internal/util/isInteropObservable.js","webpack:///./node_modules/rxjs/_esm5/internal/scheduled/scheduleObservable.js","webpack:///./node_modules/rxjs/_esm5/internal/scheduled/schedulePromise.js","webpack:///./node_modules/rxjs/_esm5/internal/util/isIterable.js","webpack:///./node_modules/rxjs/_esm5/internal/scheduled/scheduleIterable.js","webpack:///./node_modules/rxjs/_esm5/internal/observable/from.js","webpack:///./node_modules/rxjs/_esm5/internal/observable/forkJoin.js","webpack:///./node_modules/rxjs/_esm5/internal/observable/fromEvent.js","webpack:///./node_modules/rxjs/_esm5/internal/observable/never.js","webpack:///./node_modules/rxjs/_esm5/internal/InnerSubscriber.js","webpack:///./node_modules/rxjs/_esm5/internal/util/subscribeToResult.js","webpack:///./node_modules/rxjs/_esm5/internal/OuterSubscriber.js","webpack:///./node_modules/rxjs/_esm5/internal/operators/mergeMap.js","webpack:///./node_modules/rxjs/_esm5/internal/util/identity.js","webpack:///./node_modules/rxjs/_esm5/internal/operators/mergeAll.js","webpack:///./node_modules/rxjs/_esm5/internal/observable/merge.js","webpack:///./node_modules/rxjs/_esm5/internal/observable/dom/AjaxObservable.js","webpack:///./node_modules/rxjs/_esm5/internal/observable/dom/ajax.js","webpack:///./node_modules/rxjs/_esm5/internal/operators/filter.js","webpack:///./node_modules/rxjs/_esm5/internal/operators/tap.js","webpack:///./node_modules/rxjs/_esm5/internal/operators/pluck.js","webpack:///./node_modules/rxjs/_esm5/internal/util/ArgumentOutOfRangeError.js","webpack:///./node_modules/rxjs/_esm5/internal/operators/take.js","webpack:///./node_modules/rxjs/_esm5/internal/operators/switchMap.js","webpack:///./node_modules/rxjs/_esm5/internal/Notification.js","webpack:///./node_modules/rxjs/_esm5/internal/scheduler/AsyncAction.js","webpack:///./node_modules/rxjs/_esm5/internal/scheduler/Action.js","webpack:///./node_modules/rxjs/_esm5/internal/Scheduler.js","webpack:///./node_modules/rxjs/_esm5/internal/scheduler/AsyncScheduler.js","webpack:///./node_modules/rxjs/_esm5/internal/scheduler/async.js","webpack:///./node_modules/rxjs/_esm5/internal/observable/throwError.js","webpack:///./node_modules/rxjs/_esm5/internal/operators/delay.js","webpack:///./node_modules/rxjs/_esm5/internal/util/isDate.js","webpack:///./node_modules/rxjs/_esm5/internal/operators/switchMapTo.js","webpack:///./node_modules/rxjs/_esm5/internal/operators/scan.js","webpack:///./node_modules/rxjs/_esm5/internal/scheduler/QueueAction.js","webpack:///./node_modules/rxjs/_esm5/internal/scheduler/queue.js","webpack:///./node_modules/rxjs/_esm5/internal/scheduler/QueueScheduler.js","webpack:///./node_modules/rxjs/_esm5/internal/operators/observeOn.js","webpack:///./node_modules/rxjs/_esm5/internal/ReplaySubject.js","webpack:///./node_modules/rxjs/_esm5/internal/operators/shareReplay.js","webpack:///./node_modules/rxjs/_esm5/internal/operators/mapTo.js","webpack:///./node_modules/rxjs/_esm5/internal/observable/concat.js","webpack:///./node_modules/rxjs/_esm5/internal/operators/concatAll.js","webpack:///./node_modules/rxjs/_esm5/internal/operators/startWith.js","webpack:///./node_modules/rxjs/_esm5/internal/operators/distinctUntilChanged.js","webpack:///./node_modules/rxjs/_esm5/internal/operators/skip.js","webpack:///./src/assets/javascripts/utilities/agent/document/index.ts","webpack:///./src/assets/javascripts/utilities/agent/element/_/index.ts","webpack:///./src/assets/javascripts/utilities/agent/element/offset/index.ts","webpack:///./node_modules/rxjs/_esm5/internal/operators/refCount.js","webpack:///./node_modules/rxjs/_esm5/internal/observable/ConnectableObservable.js","webpack:///./node_modules/rxjs/_esm5/internal/operators/multicast.js","webpack:///./node_modules/rxjs/_esm5/internal/operators/share.js","webpack:///./src/assets/javascripts/utilities/agent/location/index.ts","webpack:///./src/assets/javascripts/utilities/agent/media/index.ts","webpack:///./node_modules/rxjs/_esm5/internal/observable/fromEventPattern.js","webpack:///./src/assets/javascripts/utilities/agent/viewport/index.ts","webpack:///./node_modules/rxjs/_esm5/internal/operators/throttle.js","webpack:///./src/assets/javascripts/utilities/agent/worker/index.ts","webpack:///./node_modules/rxjs/_esm5/internal/scheduler/AnimationFrameAction.js","webpack:///./node_modules/rxjs/_esm5/internal/scheduler/animationFrame.js","webpack:///./node_modules/rxjs/_esm5/internal/scheduler/AnimationFrameScheduler.js","webpack:///./node_modules/rxjs/_esm5/internal/operators/finalize.js","webpack:///./src/assets/javascripts/utilities/string/index.ts","webpack:///./src/assets/javascripts/actions/anchor/index.ts","webpack:///./src/assets/javascripts/actions/search/result/index.ts","webpack:///./src/assets/javascripts/utilities/hidden/index.ts","webpack:///./src/assets/javascripts/actions/hidden/index.ts","webpack:///./src/assets/javascripts/components/header/_/index.ts","webpack:///./node_modules/rxjs/_esm5/internal/observable/defer.js","webpack:///./node_modules/rxjs/_esm5/internal/observable/combineLatest.js","webpack:///./src/assets/javascripts/components/header/offset/index.ts","webpack:///./src/assets/javascripts/components/header/shadow/index.ts","webpack:///./node_modules/rxjs/_esm5/internal/operators/distinctUntilKeyChanged.js","webpack:///./src/assets/javascripts/actions/header/index.ts","webpack:///./src/assets/javascripts/extensions/jsx/index.ts","webpack:///./node_modules/rxjs/_esm5/internal/operators/takeUntil.js","webpack:///./src/assets/javascripts/extensions/rxjs/operators/index.ts","webpack:///./src/assets/javascripts/components/hero/index.ts","webpack:///./src/assets/javascripts/components/main/_/index.ts","webpack:///./node_modules/ramda/es/internal/_curry2.js","webpack:///./node_modules/ramda/es/internal/_arrayFromIterator.js","webpack:///./node_modules/ramda/es/internal/_includesWith.js","webpack:///./node_modules/ramda/es/internal/_objectIs.js","webpack:///./node_modules/ramda/es/type.js","webpack:///./node_modules/ramda/es/internal/_equals.js","webpack:///./node_modules/ramda/es/internal/_functionName.js","webpack:///./node_modules/ramda/es/equals.js","webpack:///./src/assets/javascripts/components/main/sidebar/index.ts","webpack:///./src/assets/javascripts/actions/sidebar/index.ts","webpack:///./src/assets/javascripts/components/navigation/_/index.ts","webpack:///./src/assets/javascripts/components/search/query/index.ts","webpack:///./src/assets/javascripts/utilities/agent/element/focus/index.ts","webpack:///./src/assets/javascripts/components/search/reset/index.ts","webpack:///./src/assets/javascripts/templates/search/result/article/index.tsx","webpack:///./src/assets/javascripts/templates/search/result/section/index.tsx","webpack:///./src/assets/javascripts/templates/search/result/_/index.tsx","webpack:///./src/assets/javascripts/templates/source/index.tsx","webpack:///./node_modules/rxjs/_esm5/internal/operators/withLatestFrom.js","webpack:///./src/assets/javascripts/components/search/result/meta/index.ts","webpack:///./src/assets/javascripts/components/search/result/_/index.ts","webpack:///./src/assets/javascripts/components/search/result/list/index.ts","webpack:///./src/assets/javascripts/components/tabs/index.ts","webpack:///./node_modules/ramda/es/reverse.js","webpack:///./node_modules/ramda/es/internal/_isString.js","webpack:///./node_modules/ramda/es/internal/_includes.js","webpack:///./node_modules/ramda/es/internal/_indexOf.js","webpack:///./node_modules/ramda/es/internal/_Set.js","webpack:///./node_modules/ramda/es/difference.js","webpack:///./src/assets/javascripts/workers/packer/_/index.ts","webpack:///./src/assets/javascripts/workers/search/_/index.ts","webpack:///./src/assets/javascripts/components/toc/_/index.ts","webpack:///./src/assets/javascripts/components/toc/anchor/index.ts","webpack:///./src/assets/javascripts/index.ts","webpack:///./src/assets/javascripts/utilities/agent/_/index.ts","webpack:///./src/assets/javascripts/components/_/index.ts","webpack:///./src/assets/javascripts/utilities/toggle/index.ts"],"names":["installedModules","__webpack_require__","moduleId","exports","module","i","l","modules","call","m","c","d","name","getter","o","Object","defineProperty","enumerable","get","r","Symbol","toStringTag","value","t","mode","__esModule","ns","create","key","bind","n","object","property","prototype","hasOwnProperty","p","s","__window","window","__self","self","WorkerGlobalScope","_root","global","g","this","Function","e","_isPlaceholder","a","_curry1","fn","f1","arguments","length","apply","_identity","x","_has","prop","obj","toString","hasEnumBug","propertyIsEnumerable","nonEnumerableProps","hasArgsEnumBug","contains","list","item","idx","keys","nIdx","ks","checkArgsLength","props","len","vals","extendStatics","b","setPrototypeOf","__proto__","Array","__extends","__","constructor","isFunction","_enable_super_gross_mode_that_will_cause_bad_things","Promise","undefined","Error","stack","hostReportError","err","setTimeout","empty","closed","next","error","useDeprecatedSynchronousErrorHandling","complete","isArray","isObject","UnsubscriptionError","UnsubscriptionErrorImpl","errors","message","map","join","Subscription","unsubscribe","_parentOrParents","_subscriptions","_unsubscribe","remove","index","flattenUnsubscriptionErrors","sub","concat","push","add","teardown","subscription","EMPTY","tmp","indexOf","subscriptions","subscriptionIndex","splice","reduce","errs","rxSubscriber","Math","random","_super","Subscriber","destinationOrNext","_this","syncErrorValue","syncErrorThrown","syncErrorThrowable","isStopped","destination","subscriber","_next","_error","_complete","_unsubscribeAndRecycle","SafeSubscriber","_parentSubscriber","observerOrNext","context","_context","__tryOrSetError","__tryOrUnsub","wrappedComplete","parent","observable","noop","pipe","fns","_i","pipeFromArray","input","prev","Observable","subscribe","_isScalar","_subscribe","lift","operator","source","sink","nextOrObserver","toSubscriber","_trySubscribe","observer","_a","closed_1","canReportError","console","warn","forEach","promiseCtor","getPromiseCtor","resolve","reject","operations","toPromise","ObjectUnsubscribedError","ObjectUnsubscribedErrorImpl","SubjectSubscription","subject","observers","subscriberIndex","SubjectSubscriber","Subject","hasError","thrownError","copy","slice","asObservable","AnonymousSubject","isScheduler","schedule","subscribeToArray","array","scheduleArray","scheduler","fromArray","of","args","pop","emptyScheduled","project","thisArg","TypeError","MapOperator","MapSubscriber","count","result","getSymbolIterator","iterator","isArrayLike","isPromise","then","subscribeTo","obs","promise","iterable","done","return","scheduled","isInteropObservable","scheduleObservable","schedulePromise","isIterable","scheduleIterable","from","forkJoinInternal","sources","values","completed","emitted","_loop_1","hasValue","fromEvent","target","eventName","options","resultSelector","setupSubscription","sourceObj","handler","addEventListener","removeEventListener","isEventTarget","source_1","on","off","isJQueryStyleEventEmitter","source_2","addListener","removeListener","isNodeStyleEventEmitter","source_3","NEVER","InnerSubscriber","outerValue","outerIndex","notifyNext","notifyError","notifyComplete","subscribeToResult","outerSubscriber","OuterSubscriber","innerValue","innerIndex","innerSub","MergeMapOperator","concurrent","Number","POSITIVE_INFINITY","MergeMapSubscriber","hasCompleted","buffer","active","_tryNext","_innerSub","ish","innerSubscriber","shift","mergeAll","mergeMap","ii","merge","observables","last","ajaxGet","url","headers","method","ajaxPost","body","ajaxDelete","ajaxPut","ajaxPatch","mapResponse","response","ajaxGetJSON","responseType","AjaxObservable","urlOrRequest","request","async","createXHR","crossDomain","root","XMLHttpRequest","XDomainRequest","getCORSRequest","progId","progIds","ActiveXObject","getXMLHttpRequest","withCredentials","timeout","post","delete","put","patch","getJSON","AjaxSubscriber","getHeader","FormData","serializeBody","send","xhr","AjaxResponse","_b","user","password","setupEvents","open","setHeaders","contentType","splitIndex","substring","encodeURIComponent","JSON","stringify","setRequestHeader","headerName","toLowerCase","progressSubscriber","xhrTimeout","AjaxTimeoutError","ontimeout","upload","xhrProgress_1","xhrError_1","onprogress","AjaxError","onerror","xhrReadyStateChange","xhrLoad","readyState","status_1","status","responseText","onreadystatechange","onload","abort","originalEvent","parseXhrResponse","AjaxErrorImpl","parse","parseJson","responseXML","ajax","filter","predicate","FilterOperator","FilterSubscriber","tap","DoOperator","TapSubscriber","_tapNext","_tapError","_tapComplete","pluck","properties","currentProp","plucker","ArgumentOutOfRangeError","ArgumentOutOfRangeErrorImpl","TakeOperator","total","TakeSubscriber","switchMap","SwitchMapOperator","NotificationKind","SwitchMapSubscriber","innerSubscription","AsyncAction","work","pending","state","delay","id","recycleAsyncId","requestAsyncId","setInterval","flush","clearInterval","execute","_execute","errored","errorValue","actions","Action","Scheduler","SchedulerAction","now","Date","AsyncScheduler","delegate","action","dispatch","Notification","kind","observe","do","accept","toObservable","createNext","undefinedValueNotification","createError","createComplete","completeNotification","delayFor","isNaN","abs","DelayOperator","DelaySubscriber","queue","time","notification","delay_1","max","_schedule","scheduleNotification","DelayMessage","switchMapTo","innerObservable","scan","accumulator","seed","hasSeed","ScanOperator","ScanSubscriber","_seed","set","configurable","QueueAction","QueueScheduler","observeOn","ObserveOnOperator","ObserveOnSubscriber","arg","scheduleMessage","ObserveOnMessage","ReplaySubject","bufferSize","windowTime","_events","_infiniteTimeWindow","_bufferSize","_windowTime","nextInfiniteTimeWindow","nextTimeWindow","ReplayEvent","_getNow","_trimBufferThenGetEvents","eventsCount","spliceCount","shareReplay","configOrBufferSize","config","refCount","_c","useRefCount","isComplete","shareReplayOperator","mapTo","MapToOperator","MapToSubscriber","concatAll","startWith","distinctUntilChanged","compare","keySelector","DistinctUntilChangedOperator","DistinctUntilChangedSubscriber","hasKey","y","load$","document","getElement","selector","node","querySelector","getElements","querySelectorAll","getElementOffset","el","scrollLeft","scrollTop","RefCountOperator","connectable","_refCount","refCounter","connection","connect","RefCountSubscriber","sharedConnection","_connection","ConnectableObservable","subjectFactory","_isComplete","getSubject","_subject","connectableObservableDescriptor","connectableProto","writable","ConnectableSubscriber","MulticastOperator","shareSubjectFactory","share","subjectOrSubjectFactory","hashchange$","popstate$","watchMedia","query","media","matchMedia","fromEventPattern","addHandler","removeHandler","retValue","matches","resize$","getViewportOffset","pageXOffset","pageYOffset","getViewportSize","width","innerWidth","height","innerHeight","defaultThrottleConfig","leading","trailing","ThrottleOperator","durationSelector","ThrottleSubscriber","_leading","_trailing","_hasValue","_sendValue","_throttled","throttle","duration","tryDurationSelector","throttlingDone","watchWorker","worker","send$","recv$","postMessage","AnimationFrameAction","requestAnimationFrame","cancelAnimationFrame","animationFrame","AnimationFrameScheduler","finalize","callback","FinallyOperator","lang","FinallySubscriber","setAnchorBlur","setAttribute","resetAnchorBlur","removeAttribute","setAnchorActive","classList","toggle","resetAnchorActive","addToSearchResultList","child","appendChild","paintHidden","offset","setHidden","resetHidden","truncate","translate","innerText","ReferenceError","replace","watchHeader","observableFactory","sticky","getComputedStyle","getPropertyValue","offsetHeight","NONE","combineLatest","CombineLatestOperator","CombineLatestSubscriber","toRespond","unused","oldVal","_tryResultSelector","watchViewportOffsetFromTopOf","viewport","header$","adjust$","size$","offsetTop","offset$","paintHeaderShadow","setHeaderShadow","resetHeaderShadow","innerHTML","Node","h","tag","attributes","createElement","attr","children","TakeUntilOperator","notifier","takeUntilSubscriber","notifierSubscription","seenValue","TakeUntilSubscriber","switchMapIf","toggle$","begin$","end$","mountHero","agent","screen$","hidden","watchHero","mountMain","height$","adjust","top","bottom","active$","watchMain","_curry2","f2","_arrayFromIterator","iter","_includesWith","pred","val","_uniqContentEquals","aIterator","bIterator","stackA","stackB","eq","_equals","aItem","f","match","typeA","equals","String","valueOf","ignoreCase","multiline","unicode","size","entries","keysA","extendedStackA","extendedStackB","watchSidebar","main$","parseFloat","parentElement","min","lock$","lock","paintSidebar","style","setSidebarHeight","setSidebarLock","resetSidebarHeight","resetSidebarLock","mountNavigation","sidebar","watchNavigation","watchSearchQuery","prepare","focus$","blur$","activeElement","watchElementFocus","focus","watchSearchReset","css","link","article","title","teaser","renderSectionDocument","location","text","href","class","tabIndex","renderSearchResult","sections","renderArticleDocument","facts","fact","WithLatestFromOperator","WithLatestFromSubscriber","found","_tryProject","paintSearchResultMeta","query$","meta","withLatestFrom","textContent","setSearchResultMeta","resetSearchResultMeta","watchSearchResult","result$","container","render$","watchElementOffset","scrollHeight","resetSearchResultList","paintSearchResultList","mountTabs","watchTabs","split","reverse","_includes","inf","_indexOf","hasOrAdd","shouldAdd","prevSize","type","Infinity","_items","_nativeSet","has","bIdx","_Set","Set","first","second","out","firstLen","secondLen","toFilterOut","PackerMessageType","SearchMessageType","watchTableOfContents","sidebar$","els","anchors$","table","Map","decodeURIComponent","hash","header","path","anchor","tagName","begin","end","watchAnchorList","paintAnchorList","anchors","isSearchDumpMessage","DUMP","isSearchResultMessage","RESULT","documentElement","newvalue","trim","setupWorkers","base","Worker","search","packer","packerMessage$","packer$","BINARY","data","localStorage","setItem","searchMessage$","search$","STRING","data$","fromLocal","getItem","first_1","getPrototypeOf","resultSelector_1","forkJoin","SETUP","initialize","isConfig","SyntaxError","location$","href$","hash$","tablet$","searchWorkerRecv$","log","sessionStorage","format","toFixed","repo","stargazers_count","forks_count","public_repos","repository","dataset","mdState","renderSource","components$","names","document$","components","replaceWith","watchComponentMap","component","switchComponent","section","QUERY","checked","click","navigation$","toc$","mountTableOfContents","resultComponent$","mountSearchResult","tabs$","hero$","a$","reset$","keysIfSearchActive$","details","detail","rest","temp"],"mappings":"4DACE,IAAIA,EAAmB,GAGvB,SAASC,EAAoBC,GAG5B,GAAGF,EAAiBE,GACnB,OAAOF,EAAiBE,GAAUC,QAGnC,IAAIC,EAASJ,EAAiBE,GAAY,CACzCG,EAAGH,EACHI,GAAG,EACHH,QAAS,IAUV,OANAI,EAAQL,GAAUM,KAAKJ,EAAOD,QAASC,EAAQA,EAAOD,QAASF,GAG/DG,EAAOE,GAAI,EAGJF,EAAOD,QA0Df,OArDAF,EAAoBQ,EAAIF,EAGxBN,EAAoBS,EAAIV,EAGxBC,EAAoBU,EAAI,SAASR,EAASS,EAAMC,GAC3CZ,EAAoBa,EAAEX,EAASS,IAClCG,OAAOC,eAAeb,EAASS,EAAM,CAAEK,YAAY,EAAMC,IAAKL,KAKhEZ,EAAoBkB,EAAI,SAAShB,GACX,oBAAXiB,QAA0BA,OAAOC,aAC1CN,OAAOC,eAAeb,EAASiB,OAAOC,YAAa,CAAEC,MAAO,WAE7DP,OAAOC,eAAeb,EAAS,aAAc,CAAEmB,OAAO,KAQvDrB,EAAoBsB,EAAI,SAASD,EAAOE,GAEvC,GADU,EAAPA,IAAUF,EAAQrB,EAAoBqB,IAC/B,EAAPE,EAAU,OAAOF,EACpB,GAAW,EAAPE,GAA8B,iBAAVF,GAAsBA,GAASA,EAAMG,WAAY,OAAOH,EAChF,IAAII,EAAKX,OAAOY,OAAO,MAGvB,GAFA1B,EAAoBkB,EAAEO,GACtBX,OAAOC,eAAeU,EAAI,UAAW,CAAET,YAAY,EAAMK,MAAOA,IACtD,EAAPE,GAA4B,iBAATF,EAAmB,IAAI,IAAIM,KAAON,EAAOrB,EAAoBU,EAAEe,EAAIE,EAAK,SAASA,GAAO,OAAON,EAAMM,IAAQC,KAAK,KAAMD,IAC9I,OAAOF,GAIRzB,EAAoB6B,EAAI,SAAS1B,GAChC,IAAIS,EAAST,GAAUA,EAAOqB,WAC7B,WAAwB,OAAOrB,EAAgB,SAC/C,WAA8B,OAAOA,GAEtC,OADAH,EAAoBU,EAAEE,EAAQ,IAAKA,GAC5BA,GAIRZ,EAAoBa,EAAI,SAASiB,EAAQC,GAAY,OAAOjB,OAAOkB,UAAUC,eAAe1B,KAAKuB,EAAQC,IAGzG/B,EAAoBkC,EAAI,GAIjBlC,EAAoBA,EAAoBmC,EAAI,G,kCClFrD,8CACA,IAAIC,EAA6B,oBAAXC,QAA0BA,OAC5CC,EAAyB,oBAATC,MAAqD,oBAAtBC,mBAC/CD,gBAAgBC,mBAAqBD,KAErCE,EAAQL,QADqB,IAAXM,GAA0BA,GACZJ,I,iCCLpC,IAAIK,EAGJA,EAAI,WACH,OAAOC,KADJ,GAIJ,IAECD,EAAIA,GAAK,IAAIE,SAAS,cAAb,GACR,MAAOC,GAEc,iBAAXT,SAAqBM,EAAIN,QAOrClC,EAAOD,QAAUyC,G,6CCnBF,SAASI,EAAeC,GAChC,OAAY,MAALA,GAA0B,iBAANA,IAAoD,IAAlCA,EAAE,4BCSvC,SAASC,EAAQC,GAC9B,OAAO,SAASC,EAAGH,GACjB,OAAyB,IAArBI,UAAUC,QAAgBN,EAAeC,GACpCG,EAEAD,EAAGI,MAAMV,KAAMQ,YCfb,SAASG,EAAUC,GAChC,OAAOA,E,OCqBT,IACe,EADaP,EAAQM,GCtBrB,SAASE,EAAKC,EAAMC,GACjC,OAAO7C,OAAOkB,UAAUC,eAAe1B,KAAKoD,EAAKD,GCCnD,IAAI,EAAW5C,OAAOkB,UAAU4B,SASjB,EARiB,WAC9B,MAAoC,uBAA7B,EAASrD,KAAK6C,WAAsC,SAAsBI,GAC/E,MAA4B,uBAArB,EAASjD,KAAKiD,IACnB,SAAsBA,GACxB,OAAOC,EAAK,SAAUD,IAJM,GCE5BK,GAA4B,CAAED,SAAU,MAAOE,qBAAqB,YACpEC,EAAqB,CAAC,cAAe,UAAW,gBAAiB,WAAY,uBAAwB,iBAAkB,kBAEvHC,EAA8B,WAGhC,OAAOZ,UAAUU,qBAAqB,UAHN,GAM9BG,EAAW,SAAkBC,EAAMC,GAErC,IADA,IAAIC,EAAM,EACHA,EAAMF,EAAKb,QAAQ,CACxB,GAAIa,EAAKE,KAASD,EAChB,OAAO,EAETC,GAAO,EAET,OAAO,GA+CM,EA1BmB,mBAAhBtD,OAAOuD,MAAwBL,EAE/Bf,GAAQ,SAAcU,GACtC,GAAI7C,OAAO6C,KAASA,EAClB,MAAO,GAET,IAAID,EAAMY,EACNC,EAAK,GACLC,EAAkBR,GAAkB,EAAaL,GACrD,IAAKD,KAAQC,GACPF,EAAKC,EAAMC,IAAUa,GAA4B,WAATd,IAC1Ca,EAAGA,EAAGlB,QAAUK,GAGpB,GAAIG,EAEF,IADAS,EAAOP,EAAmBV,OAAS,EAC5BiB,GAAQ,GAETb,EADJC,EAAOK,EAAmBO,GACXX,KAASM,EAASM,EAAIb,KACnCa,EAAGA,EAAGlB,QAAUK,GAElBY,GAAQ,EAGZ,OAAOC,KAxBsEtB,GAAQ,SAAcU,GACnG,OAAO7C,OAAO6C,KAASA,EAAM,GAAK7C,OAAOuD,KAAKV,MCbjC,EAXWV,GAAQ,SAAgBU,GAKhD,IAJA,IAAIc,EAAQ,EAAKd,GACbe,EAAMD,EAAMpB,OACZsB,EAAO,GACPP,EAAM,EACHA,EAAMM,GACXC,EAAKP,GAAOT,EAAIc,EAAML,IACtBA,GAAO,EAET,OAAOO,KCbLC,EAAgB,SAASlE,EAAGmE,GAI5B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAOA,EAAE5C,eAAeC,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MACpDxB,EAAGmE,IAGrB,SAASI,EAAUvE,EAAGmE,GAEzB,SAASK,IAAOtC,KAAKuC,YAAczE,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMK,EAAGlD,UAAY6C,EAAE7C,UAAW,IAAIkD,GCzB5E,SAASE,EAAW5B,GACvB,MAAoB,mBAANA,ECDlB,IAAI6B,GAAsD,EAC/C,EAAS,CAChBC,aAASC,EACT,0CAA0ClE,GAClCA,IAC0B,IAAImE,OACqGC,MAKvIJ,EAAsDhE,GAE1D,4CACI,OAAOgE,ICdR,SAASK,EAAgBC,GAC5BC,YAAW,WAAc,MAAMD,IAAQ,GCCpC,IAAIE,EAAQ,CACfC,QAAQ,EACRC,KAAM,SAAU1E,KAChB2E,MAAO,SAAUL,GACb,GAAI,EAAOM,sCACP,MAAMN,EAGND,EAAgBC,IAGxBO,SAAU,cCbHC,EAAwB,WAAe,OAAOnB,MAAMmB,SAAW,SAAW3C,GAAK,OAAOA,GAAyB,iBAAbA,EAAEH,QAA5E,GCA5B,SAAS+C,EAAS5C,GACrB,OAAa,OAANA,GAA2B,iBAANA,ECDhC,IAYW6C,EAZiC,WACxC,SAASC,EAAwBC,GAM7B,OALAf,MAAMjF,KAAKqC,MACXA,KAAK4D,QAAUD,EACXA,EAAOlD,OAAS,4CAA8CkD,EAAOE,KAAI,SAAUd,EAAKvF,GAAK,OAAOA,EAAI,EAAI,KAAOuF,EAAI/B,cAAe8C,KAAK,QAAU,GACzJ9D,KAAKjC,KAAO,sBACZiC,KAAK2D,OAASA,EACP3D,KAGX,OADA0D,EAAwBtE,UAA0BlB,OAAOY,OAAO8D,MAAMxD,WAC/DsE,EAViC,GCIxC,EAA8B,WAC9B,SAASK,EAAaC,GAClBhE,KAAKkD,QAAS,EACdlD,KAAKiE,iBAAmB,KACxBjE,KAAKkE,eAAiB,KAClBF,IACAhE,KAAKmE,aAAeH,GAsH5B,OAnHAD,EAAa3E,UAAU4E,YAAc,WACjC,IAAIL,EACJ,IAAI3D,KAAKkD,OAAT,CAGA,IAAee,EAANjE,KAA4BiE,iBAAkBE,EAA9CnE,KAAgEmE,aAAcD,EAA9ElE,KAAkGkE,eAI3G,GAHAlE,KAAKkD,QAAS,EACdlD,KAAKiE,iBAAmB,KACxBjE,KAAKkE,eAAiB,KAClBD,aAA4BF,EAC5BE,EAAiBG,OAAOpE,WAEvB,GAAyB,OAArBiE,EACL,IAAK,IAAII,EAAQ,EAAGA,EAAQJ,EAAiBxD,SAAU4D,EAAO,CAC3CJ,EAAiBI,GACvBD,OAAOpE,MAGxB,GAAIwC,EAAW2B,GACX,IACIA,EAAaxG,KAAKqC,MAEtB,MAAOE,GACHyD,EAASzD,aAAauD,EAAsBa,EAA4BpE,EAAEyD,QAAU,CAACzD,GAG7F,GAAIqD,EAAQW,GACR,CAAIG,GAAS,EAEb,IAFA,IACIvC,EAAMoC,EAAezD,SAChB4D,EAAQvC,GAAK,CAClB,IAAIyC,EAAML,EAAeG,GACzB,GAAIb,EAASe,GACT,IACIA,EAAIP,cAER,MAAO9D,GACHyD,EAASA,GAAU,GACfzD,aAAauD,EACbE,EAASA,EAAOa,OAAOF,EAA4BpE,EAAEyD,SAGrDA,EAAOc,KAAKvE,KAMhC,GAAIyD,EACA,MAAM,IAAIF,EAAoBE,KAGtCI,EAAa3E,UAAUsF,IAAM,SAAUC,GACnC,IAAIC,EAAeD,EACnB,IAAKA,EACD,OAAOZ,EAAac,MAExB,cAAeF,GACX,IAAK,WACDC,EAAe,IAAIb,EAAaY,GACpC,IAAK,SACD,GAAIC,IAAiB5E,MAAQ4E,EAAa1B,QAA8C,mBAA7B0B,EAAaZ,YACpE,OAAOY,EAEN,GAAI5E,KAAKkD,OAEV,OADA0B,EAAaZ,cACNY,EAEN,KAAMA,aAAwBb,GAAe,CAC9C,IAAIe,EAAMF,GACVA,EAAe,IAAIb,GACNG,eAAiB,CAACY,GAEnC,MACJ,QACI,MAAM,IAAIlC,MAAM,yBAA2B+B,EAAW,2BAG9D,IAAIV,EAAmBW,EAAaX,iBACpC,GAAyB,OAArBA,EACAW,EAAaX,iBAAmBjE,UAE/B,GAAIiE,aAA4BF,EAAc,CAC/C,GAAIE,IAAqBjE,KACrB,OAAO4E,EAEXA,EAAaX,iBAAmB,CAACA,EAAkBjE,UAElD,KAAwC,IAApCiE,EAAiBc,QAAQ/E,MAI9B,OAAO4E,EAHPX,EAAiBQ,KAAKzE,MAK1B,IAAIgF,EAAgBhF,KAAKkE,eAOzB,OANsB,OAAlBc,EACAhF,KAAKkE,eAAiB,CAACU,GAGvBI,EAAcP,KAAKG,GAEhBA,GAEXb,EAAa3E,UAAUgF,OAAS,SAAUQ,GACtC,IAAII,EAAgBhF,KAAKkE,eACzB,GAAIc,EAAe,CACf,IAAIC,EAAoBD,EAAcD,QAAQH,IACnB,IAAvBK,GACAD,EAAcE,OAAOD,EAAmB,KAIpDlB,EAAac,MAAS,SAAU5B,GAE5B,OADAA,EAAMC,QAAS,EACRD,EAFU,CAGnB,IAAIc,GACCA,EA5HsB,GA+HjC,SAASO,EAA4BX,GACjC,OAAOA,EAAOwB,QAAO,SAAUC,EAAMrC,GAAO,OAAOqC,EAAKZ,OAAQzB,aAAeU,EAAuBV,EAAIY,OAASZ,KAAS,ICpIzH,IAAIsC,EAA6B,WACpC,MAAyB,mBAAX9G,OACMA,OAAO,gBACrB,kBAAkC+G,KAAKC,SAHT,GCOpC,EAA4B,SAAUC,GAEtC,SAASC,EAAWC,EAAmBtC,EAAOE,GAC1C,IAAIqC,EAAQH,EAAO7H,KAAKqC,OAASA,KAKjC,OAJA2F,EAAMC,eAAiB,KACvBD,EAAME,iBAAkB,EACxBF,EAAMG,oBAAqB,EAC3BH,EAAMI,WAAY,EACVvF,UAAUC,QACd,KAAK,EACDkF,EAAMK,YAAc/C,EACpB,MACJ,KAAK,EACD,IAAKyC,EAAmB,CACpBC,EAAMK,YAAc/C,EACpB,MAEJ,GAAiC,iBAAtByC,EAAgC,CACnCA,aAA6BD,GAC7BE,EAAMG,mBAAqBJ,EAAkBI,mBAC7CH,EAAMK,YAAcN,EACpBA,EAAkBhB,IAAIiB,KAGtBA,EAAMG,oBAAqB,EAC3BH,EAAMK,YAAc,IAAI,EAAeL,EAAOD,IAElD,MAER,QACIC,EAAMG,oBAAqB,EAC3BH,EAAMK,YAAc,IAAI,EAAeL,EAAOD,EAAmBtC,EAAOE,GAGhF,OAAOqC,EAoDX,OArFA,EAAkBF,EAAYD,GAmC9BC,EAAWrG,UAAUiG,GAAsB,WAAc,OAAOrF,MAChEyF,EAAW3G,OAAS,SAAUqE,EAAMC,EAAOE,GACvC,IAAI2C,EAAa,IAAIR,EAAWtC,EAAMC,EAAOE,GAE7C,OADA2C,EAAWH,oBAAqB,EACzBG,GAEXR,EAAWrG,UAAU+D,KAAO,SAAU1E,GAC7BuB,KAAK+F,WACN/F,KAAKkG,MAAMzH,IAGnBgH,EAAWrG,UAAUgE,MAAQ,SAAUL,GAC9B/C,KAAK+F,YACN/F,KAAK+F,WAAY,EACjB/F,KAAKmG,OAAOpD,KAGpB0C,EAAWrG,UAAUkE,SAAW,WACvBtD,KAAK+F,YACN/F,KAAK+F,WAAY,EACjB/F,KAAKoG,cAGbX,EAAWrG,UAAU4E,YAAc,WAC3BhE,KAAKkD,SAGTlD,KAAK+F,WAAY,EACjBP,EAAOpG,UAAU4E,YAAYrG,KAAKqC,QAEtCyF,EAAWrG,UAAU8G,MAAQ,SAAUzH,GACnCuB,KAAKgG,YAAY7C,KAAK1E,IAE1BgH,EAAWrG,UAAU+G,OAAS,SAAUpD,GACpC/C,KAAKgG,YAAY5C,MAAML,GACvB/C,KAAKgE,eAETyB,EAAWrG,UAAUgH,UAAY,WAC7BpG,KAAKgG,YAAY1C,WACjBtD,KAAKgE,eAETyB,EAAWrG,UAAUiH,uBAAyB,WAC1C,IAAIpC,EAAmBjE,KAAKiE,iBAM5B,OALAjE,KAAKiE,iBAAmB,KACxBjE,KAAKgE,cACLhE,KAAKkD,QAAS,EACdlD,KAAK+F,WAAY,EACjB/F,KAAKiE,iBAAmBA,EACjBjE,MAEJyF,EAtFoB,CAuF7B,GAEE,EAAgC,SAAUD,GAE1C,SAASc,EAAeC,EAAmBC,EAAgBpD,EAAOE,GAC9D,IAEIH,EAFAwC,EAAQH,EAAO7H,KAAKqC,OAASA,KACjC2F,EAAMY,kBAAoBA,EAE1B,IAAIE,EAAUd,EAoBd,OAnBInD,EAAWgE,GACXrD,EAAOqD,EAEFA,IACLrD,EAAOqD,EAAerD,KACtBC,EAAQoD,EAAepD,MACvBE,EAAWkD,EAAelD,SACtBkD,IAAmBvD,IAEfT,GADJiE,EAAUvI,OAAOY,OAAO0H,IACDxC,cACnB2B,EAAMjB,IAAI+B,EAAQzC,YAAYhF,KAAKyH,IAEvCA,EAAQzC,YAAc2B,EAAM3B,YAAYhF,KAAK2G,KAGrDA,EAAMe,SAAWD,EACjBd,EAAMO,MAAQ/C,EACdwC,EAAMQ,OAAS/C,EACfuC,EAAMS,UAAY9C,EACXqC,EA0GX,OAnIA,EAAkBW,EAAgBd,GA2BlCc,EAAelH,UAAU+D,KAAO,SAAU1E,GACtC,IAAKuB,KAAK+F,WAAa/F,KAAKkG,MAAO,CAC/B,IAAIK,EAAoBvG,KAAKuG,kBACxB,EAAOlD,uCAA0CkD,EAAkBT,mBAG/D9F,KAAK2G,gBAAgBJ,EAAmBvG,KAAKkG,MAAOzH,IACzDuB,KAAKgE,cAHLhE,KAAK4G,aAAa5G,KAAKkG,MAAOzH,KAO1C6H,EAAelH,UAAUgE,MAAQ,SAAUL,GACvC,IAAK/C,KAAK+F,UAAW,CACjB,IAAIQ,EAAoBvG,KAAKuG,kBACzBlD,EAAwC,EAAOA,sCACnD,GAAIrD,KAAKmG,OACA9C,GAA0CkD,EAAkBT,oBAK7D9F,KAAK2G,gBAAgBJ,EAAmBvG,KAAKmG,OAAQpD,GACrD/C,KAAKgE,gBALLhE,KAAK4G,aAAa5G,KAAKmG,OAAQpD,GAC/B/C,KAAKgE,oBAOR,GAAKuC,EAAkBT,mBAQpBzC,GACAkD,EAAkBX,eAAiB7C,EACnCwD,EAAkBV,iBAAkB,GAGpC/C,EAAgBC,GAEpB/C,KAAKgE,kBAfuC,CAE5C,GADAhE,KAAKgE,cACDX,EACA,MAAMN,EAEVD,EAAgBC,MAc5BuD,EAAelH,UAAUkE,SAAW,WAChC,IAAIqC,EAAQ3F,KACZ,IAAKA,KAAK+F,UAAW,CACjB,IAAIQ,EAAoBvG,KAAKuG,kBAC7B,GAAIvG,KAAKoG,UAAW,CAChB,IAAIS,EAAkB,WAAc,OAAOlB,EAAMS,UAAUzI,KAAKgI,EAAMe,WACjE,EAAOrD,uCAA0CkD,EAAkBT,oBAKpE9F,KAAK2G,gBAAgBJ,EAAmBM,GACxC7G,KAAKgE,gBALLhE,KAAK4G,aAAaC,GAClB7G,KAAKgE,oBAQThE,KAAKgE,gBAIjBsC,EAAelH,UAAUwH,aAAe,SAAUtG,EAAI7B,GAClD,IACI6B,EAAG3C,KAAKqC,KAAK0G,SAAUjI,GAE3B,MAAOsE,GAEH,GADA/C,KAAKgE,cACD,EAAOX,sCACP,MAAMN,EAGND,EAAgBC,KAI5BuD,EAAelH,UAAUuH,gBAAkB,SAAUG,EAAQxG,EAAI7B,GAC7D,IAAK,EAAO4E,sCACR,MAAM,IAAIT,MAAM,YAEpB,IACItC,EAAG3C,KAAKqC,KAAK0G,SAAUjI,GAE3B,MAAOsE,GACH,OAAI,EAAOM,uCACPyD,EAAOlB,eAAiB7C,EACxB+D,EAAOjB,iBAAkB,GAClB,IAGP/C,EAAgBC,IACT,GAGf,OAAO,GAEXuD,EAAelH,UAAU+E,aAAe,WACpC,IAAIoC,EAAoBvG,KAAKuG,kBAC7BvG,KAAK0G,SAAW,KAChB1G,KAAKuG,kBAAoB,KACzBA,EAAkBvC,eAEfsC,EApIwB,CAqIjC,GCrOK,IAAI,EAA2B,WAAe,MAAyB,mBAAX/H,QAAyBA,OAAOwI,YAAc,eAA3E,GCA/B,SAASC,KCCT,SAASC,IAEZ,IADA,IAAIC,EAAM,GACDC,EAAK,EAAGA,EAAK3G,UAAUC,OAAQ0G,IACpCD,EAAIC,GAAM3G,UAAU2G,GAExB,OAAOC,EAAcF,GAElB,SAASE,EAAcF,GAC1B,OAAKA,EAGc,IAAfA,EAAIzG,OACGyG,EAAI,GAER,SAAeG,GAClB,OAAOH,EAAI/B,QAAO,SAAUmC,EAAMhH,GAAM,OAAOA,EAAGgH,KAAUD,IANrDL,ECLf,IAAI,EAA4B,WAC5B,SAASO,EAAWC,GAChBxH,KAAKyH,WAAY,EACbD,IACAxH,KAAK0H,WAAaF,GA6F1B,OA1FAD,EAAWnI,UAAUuI,KAAO,SAAUC,GAClC,IAAIb,EAAa,IAAIQ,EAGrB,OAFAR,EAAWc,OAAS7H,KACpB+G,EAAWa,SAAWA,EACfb,GAEXQ,EAAWnI,UAAUoI,UAAY,SAAUhB,EAAgBpD,EAAOE,GAC9D,IAAIsE,EAAW5H,KAAK4H,SAChBE,ECjBL,SAAsBC,EAAgB3E,EAAOE,GAChD,GAAIyE,EAAgB,CAChB,GAAIA,aAA0B,EAC1B,OAAOA,EAEX,GAAIA,EAAe1C,GACf,OAAO0C,EAAe1C,KAG9B,OAAK0C,GAAmB3E,GAAUE,EAG3B,IAAI,EAAWyE,EAAgB3E,EAAOE,GAFlC,IAAI,EAAWL,GDOX+E,CAAaxB,EAAgBpD,EAAOE,GAS/C,GARIsE,EACAE,EAAKpD,IAAIkD,EAASjK,KAAKmK,EAAM9H,KAAK6H,SAGlCC,EAAKpD,IAAI1E,KAAK6H,QAAW,EAAOxE,wCAA0CyE,EAAKhC,mBAC3E9F,KAAK0H,WAAWI,GAChB9H,KAAKiI,cAAcH,IAEvB,EAAOzE,uCACHyE,EAAKhC,qBACLgC,EAAKhC,oBAAqB,EACtBgC,EAAKjC,iBACL,MAAMiC,EAAKlC,eAIvB,OAAOkC,GAEXP,EAAWnI,UAAU6I,cAAgB,SAAUH,GAC3C,IACI,OAAO9H,KAAK0H,WAAWI,GAE3B,MAAO/E,GACC,EAAOM,wCACPyE,EAAKjC,iBAAkB,EACvBiC,EAAKlC,eAAiB7C,IE7C/B,SAAwBmF,GAC3B,KAAOA,GAAU,CACb,IAAIC,EAAKD,EAAUE,EAAWD,EAAGjF,OAAQ8C,EAAcmC,EAAGnC,YAAaD,EAAYoC,EAAGpC,UACtF,GAAIqC,GAAYrC,EACZ,OAAO,EAGPmC,EADKlC,GAAeA,aAAuB,EAChCA,EAGA,KAGnB,OAAO,EFkCKqC,CAAeP,GAIfQ,QAAQC,KAAKxF,GAHb+E,EAAK1E,MAAML,KAOvBwE,EAAWnI,UAAUoJ,QAAU,SAAUrF,EAAMsF,GAC3C,IAAI9C,EAAQ3F,KAEZ,OAAO,IADPyI,EAAcC,EAAeD,KACN,SAAUE,EAASC,GACtC,IAAIhE,EACJA,EAAee,EAAM6B,WAAU,SAAU/I,GACrC,IACI0E,EAAK1E,GAET,MAAOsE,GACH6F,EAAO7F,GACH6B,GACAA,EAAaZ,iBAGtB4E,EAAQD,OAGnBpB,EAAWnI,UAAUsI,WAAa,SAAUzB,GACxC,IAAI4B,EAAS7H,KAAK6H,OAClB,OAAOA,GAAUA,EAAOL,UAAUvB,IAEtCsB,EAAWnI,UAAU,GAAqB,WACtC,OAAOY,MAEXuH,EAAWnI,UAAU6H,KAAO,WAExB,IADA,IAAI4B,EAAa,GACR1B,EAAK,EAAGA,EAAK3G,UAAUC,OAAQ0G,IACpC0B,EAAW1B,GAAM3G,UAAU2G,GAE/B,OAA0B,IAAtB0B,EAAWpI,OACJT,KAEJoH,EAAcyB,EAAdzB,CAA0BpH,OAErCuH,EAAWnI,UAAU0J,UAAY,SAAUL,GACvC,IAAI9C,EAAQ3F,KAEZ,OAAO,IADPyI,EAAcC,EAAeD,KACN,SAAUE,EAASC,GACtC,IAAInK,EACJkH,EAAM6B,WAAU,SAAU5G,GAAK,OAAOnC,EAAQmC,KAAM,SAAUmC,GAAO,OAAO6F,EAAO7F,MAAS,WAAc,OAAO4F,EAAQlK,UAGjI8I,EAAWzI,OAAS,SAAU0I,GAC1B,OAAO,IAAID,EAAWC,IAEnBD,EAjGoB,GAoG/B,SAASmB,EAAeD,GAIpB,GAHKA,IACDA,EAAc,EAAO/F,SAAWA,UAE/B+F,EACD,MAAM,IAAI7F,MAAM,yBAEpB,OAAO6F,EGhHX,IAUWM,EAVqC,WAC5C,SAASC,IAIL,OAHApG,MAAMjF,KAAKqC,MACXA,KAAK4D,QAAU,sBACf5D,KAAKjC,KAAO,0BACLiC,KAGX,OADAgJ,EAA4B5J,UAA0BlB,OAAOY,OAAO8D,MAAMxD,WACnE4J,EARqC,GCE5C,EAAqC,SAAUxD,GAE/C,SAASyD,EAAoBC,EAASjD,GAClC,IAAIN,EAAQH,EAAO7H,KAAKqC,OAASA,KAIjC,OAHA2F,EAAMuD,QAAUA,EAChBvD,EAAMM,WAAaA,EACnBN,EAAMzC,QAAS,EACRyC,EAkBX,OAxBA,EAAkBsD,EAAqBzD,GAQvCyD,EAAoB7J,UAAU4E,YAAc,WACxC,IAAIhE,KAAKkD,OAAT,CAGAlD,KAAKkD,QAAS,EACd,IAAIgG,EAAUlJ,KAAKkJ,QACfC,EAAYD,EAAQC,UAExB,GADAnJ,KAAKkJ,QAAU,KACVC,GAAkC,IAArBA,EAAU1I,SAAgByI,EAAQnD,YAAamD,EAAQhG,OAAzE,CAGA,IAAIkG,EAAkBD,EAAUpE,QAAQ/E,KAAKiG,aACpB,IAArBmD,GACAD,EAAUjE,OAAOkE,EAAiB,MAGnCH,EAzB6B,CA0BtC,GCrBE,EAAmC,SAAUzD,GAE7C,SAAS6D,EAAkBrD,GACvB,IAAIL,EAAQH,EAAO7H,KAAKqC,KAAMgG,IAAgBhG,KAE9C,OADA2F,EAAMK,YAAcA,EACbL,EAEX,OANA,EAAkB0D,EAAmB7D,GAM9B6D,EAP2B,CAQpC,GAEE,EAAyB,SAAU7D,GAEnC,SAAS8D,IACL,IAAI3D,EAAQH,EAAO7H,KAAKqC,OAASA,KAMjC,OALA2F,EAAMwD,UAAY,GAClBxD,EAAMzC,QAAS,EACfyC,EAAMI,WAAY,EAClBJ,EAAM4D,UAAW,EACjB5D,EAAM6D,YAAc,KACb7D,EAyFX,OAjGA,EAAkB2D,EAAS9D,GAU3B8D,EAAQlK,UAAUiG,GAAsB,WACpC,OAAO,IAAI,EAAkBrF,OAEjCsJ,EAAQlK,UAAUuI,KAAO,SAAUC,GAC/B,IAAIsB,EAAU,IAAI,EAAiBlJ,KAAMA,MAEzC,OADAkJ,EAAQtB,SAAWA,EACZsB,GAEXI,EAAQlK,UAAU+D,KAAO,SAAU1E,GAC/B,GAAIuB,KAAKkD,OACL,MAAM,IAAI6F,EAEd,IAAK/I,KAAK+F,UAIN,IAHA,IAAIoD,EAAYnJ,KAAKmJ,UACjBrH,EAAMqH,EAAU1I,OAChBgJ,EAAON,EAAUO,QACZlM,EAAI,EAAGA,EAAIsE,EAAKtE,IACrBiM,EAAKjM,GAAG2F,KAAK1E,IAIzB6K,EAAQlK,UAAUgE,MAAQ,SAAUL,GAChC,GAAI/C,KAAKkD,OACL,MAAM,IAAI6F,EAEd/I,KAAKuJ,UAAW,EAChBvJ,KAAKwJ,YAAczG,EACnB/C,KAAK+F,WAAY,EAIjB,IAHA,IAAIoD,EAAYnJ,KAAKmJ,UACjBrH,EAAMqH,EAAU1I,OAChBgJ,EAAON,EAAUO,QACZlM,EAAI,EAAGA,EAAIsE,EAAKtE,IACrBiM,EAAKjM,GAAG4F,MAAML,GAElB/C,KAAKmJ,UAAU1I,OAAS,GAE5B6I,EAAQlK,UAAUkE,SAAW,WACzB,GAAItD,KAAKkD,OACL,MAAM,IAAI6F,EAEd/I,KAAK+F,WAAY,EAIjB,IAHA,IAAIoD,EAAYnJ,KAAKmJ,UACjBrH,EAAMqH,EAAU1I,OAChBgJ,EAAON,EAAUO,QACZlM,EAAI,EAAGA,EAAIsE,EAAKtE,IACrBiM,EAAKjM,GAAG8F,WAEZtD,KAAKmJ,UAAU1I,OAAS,GAE5B6I,EAAQlK,UAAU4E,YAAc,WAC5BhE,KAAK+F,WAAY,EACjB/F,KAAKkD,QAAS,EACdlD,KAAKmJ,UAAY,MAErBG,EAAQlK,UAAU6I,cAAgB,SAAUhC,GACxC,GAAIjG,KAAKkD,OACL,MAAM,IAAI6F,EAGV,OAAOvD,EAAOpG,UAAU6I,cAActK,KAAKqC,KAAMiG,IAGzDqD,EAAQlK,UAAUsI,WAAa,SAAUzB,GACrC,GAAIjG,KAAKkD,OACL,MAAM,IAAI6F,EAET,OAAI/I,KAAKuJ,UACVtD,EAAW7C,MAAMpD,KAAKwJ,aACf,EAAa3E,OAEf7E,KAAK+F,WACVE,EAAW3C,WACJ,EAAauB,QAGpB7E,KAAKmJ,UAAU1E,KAAKwB,GACb,IAAI,EAAoBjG,KAAMiG,KAG7CqD,EAAQlK,UAAUuK,aAAe,WAC7B,IAAI5C,EAAa,IAAI,EAErB,OADAA,EAAWc,OAAS7H,KACb+G,GAEXuC,EAAQxK,OAAS,SAAUkH,EAAa6B,GACpC,OAAO,IAAI,EAAiB7B,EAAa6B,IAEtCyB,EAlGiB,CAmG1B,GAEE,EAAkC,SAAU9D,GAE5C,SAASoE,EAAiB5D,EAAa6B,GACnC,IAAIlC,EAAQH,EAAO7H,KAAKqC,OAASA,KAGjC,OAFA2F,EAAMK,YAAcA,EACpBL,EAAMkC,OAASA,EACRlC,EA6BX,OAlCA,EAAkBiE,EAAkBpE,GAOpCoE,EAAiBxK,UAAU+D,KAAO,SAAU1E,GACxC,IAAIuH,EAAchG,KAAKgG,YACnBA,GAAeA,EAAY7C,MAC3B6C,EAAY7C,KAAK1E,IAGzBmL,EAAiBxK,UAAUgE,MAAQ,SAAUL,GACzC,IAAIiD,EAAchG,KAAKgG,YACnBA,GAAeA,EAAY5C,OAC3BpD,KAAKgG,YAAY5C,MAAML,IAG/B6G,EAAiBxK,UAAUkE,SAAW,WAClC,IAAI0C,EAAchG,KAAKgG,YACnBA,GAAeA,EAAY1C,UAC3BtD,KAAKgG,YAAY1C,YAGzBsG,EAAiBxK,UAAUsI,WAAa,SAAUzB,GAE9C,OADajG,KAAK6H,OAEP7H,KAAK6H,OAAOL,UAAUvB,GAGtB,EAAapB,OAGrB+E,EAnC0B,CAoCnC,GC1JK,SAASC,EAAYpL,GACxB,OAAOA,GAAmC,mBAAnBA,EAAMqL,SCD1B,IAAIC,EAAmB,SAAUC,GACpC,OAAO,SAAU/D,GACb,IAAK,IAAIzI,EAAI,EAAGsE,EAAMkI,EAAMvJ,OAAQjD,EAAIsE,IAAQmE,EAAW/C,OAAQ1F,IAC/DyI,EAAW9C,KAAK6G,EAAMxM,IAE1ByI,EAAW3C,aCHZ,SAAS2G,EAAc5C,EAAO6C,GACjC,OAAO,IAAI,GAAW,SAAUjE,GAC5B,IAAI1B,EAAM,IAAI,EACV/G,EAAI,EAWR,OAVA+G,EAAIG,IAAIwF,EAAUJ,UAAS,WACnBtM,IAAM6J,EAAM5G,QAIhBwF,EAAW9C,KAAKkE,EAAM7J,MACjByI,EAAW/C,QACZqB,EAAIG,IAAI1E,KAAK8J,aALb7D,EAAW3C,eAQZiB,KCbR,SAAS4F,EAAU9C,EAAO6C,GAC7B,OAAKA,EAIMD,EAAc5C,EAAO6C,GAHrB,IAAI,EAAWH,EAAiB1C,ICFxC,SAAS+C,IAEZ,IADA,IAAIC,EAAO,GACFlD,EAAK,EAAGA,EAAK3G,UAAUC,OAAQ0G,IACpCkD,EAAKlD,GAAM3G,UAAU2G,GAEzB,IAAI+C,EAAYG,EAAKA,EAAK5J,OAAS,GACnC,OAAIoJ,EAAYK,IACZG,EAAKC,MACEL,EAAcI,EAAMH,IAGpBC,EAAUE,GCblB,IAAIxF,EAAsB,IAAI,GAAW,SAAUoB,GAAc,OAAOA,EAAW3C,cACnF,SAAS,EAAM4G,GAClB,OAAOA,EAEX,SAAwBA,GACpB,OAAO,IAAI,GAAW,SAAUjE,GAAc,OAAOiE,EAAUJ,UAAS,WAAc,OAAO7D,EAAW3C,iBAHrFiH,CAAeL,GAAarF,ECD5C,SAAShB,EAAI2G,EAASC,GACzB,OAAO,SAAsB5C,GACzB,GAAuB,mBAAZ2C,EACP,MAAM,IAAIE,UAAU,8DAExB,OAAO7C,EAAOF,KAAK,IAAIgD,EAAYH,EAASC,KAGpD,IAAIE,EAA6B,WAC7B,SAASA,EAAYH,EAASC,GAC1BzK,KAAKwK,QAAUA,EACfxK,KAAKyK,QAAUA,EAKnB,OAHAE,EAAYvL,UAAUzB,KAAO,SAAUsI,EAAY4B,GAC/C,OAAOA,EAAOL,UAAU,IAAI,EAAcvB,EAAYjG,KAAKwK,QAASxK,KAAKyK,WAEtEE,EARqB,GAW5B,EAA+B,SAAUnF,GAEzC,SAASoF,EAAc5E,EAAawE,EAASC,GACzC,IAAI9E,EAAQH,EAAO7H,KAAKqC,KAAMgG,IAAgBhG,KAI9C,OAHA2F,EAAM6E,QAAUA,EAChB7E,EAAMkF,MAAQ,EACdlF,EAAM8E,QAAUA,GAAW9E,EACpBA,EAaX,OAnBA,EAAkBiF,EAAepF,GAQjCoF,EAAcxL,UAAU8G,MAAQ,SAAUzH,GACtC,IAAIqM,EACJ,IACIA,EAAS9K,KAAKwK,QAAQ7M,KAAKqC,KAAKyK,QAAShM,EAAOuB,KAAK6K,SAEzD,MAAO9H,GAEH,YADA/C,KAAKgG,YAAY5C,MAAML,GAG3B/C,KAAKgG,YAAY7C,KAAK2H,IAEnBF,EApBuB,CAqBhC,GC1CK,SAASG,IACZ,MAAsB,mBAAXxM,QAA0BA,OAAOyM,SAGrCzM,OAAOyM,SAFH,aAIR,IAAI,EAAyBD,ICNzBE,GAAc,SAAWrK,GAAK,OAAOA,GAAyB,iBAAbA,EAAEH,QAAoC,mBAANG,GCArF,SAASsK,GAAUzM,GACtB,QAASA,GAAoC,mBAApBA,EAAM+I,WAAkD,mBAAf/I,EAAM0M,KCQrE,IAAIC,GAAc,SAAUN,GAC/B,GAAMA,GAA+C,mBAA9BA,EAAO,GAC1B,OCVqC/J,EDUR+J,ECT1B,SAAU7E,GACb,IAAIoF,EAAMtK,EAAI,KACd,GAA6B,mBAAlBsK,EAAI7D,UACX,MAAM,IAAIkD,UAAU,kEAGpB,OAAOW,EAAI7D,UAAUvB,IDKxB,GAAIgF,GAAYH,GACjB,OAAOf,EAAiBe,GAEvB,GAAII,GAAUJ,GACf,OEhBkCQ,EFgBRR,EEfvB,SAAU7E,GAQb,OAPAqF,EAAQH,MAAK,SAAU1M,GACdwH,EAAW/C,SACZ+C,EAAW9C,KAAK1E,GAChBwH,EAAW3C,eAEhB,SAAUP,GAAO,OAAOkD,EAAW7C,MAAML,MACvCoI,KAAK,KAAMrI,GACTmD,GFSN,GAAM6E,GAA6C,mBAA5BA,EAAO,GAC/B,OGnBmCS,EHmBRT,EGlBxB,SAAU7E,GAEb,IADA,IAAI+E,EAAWO,EAAS,OACrB,CACC,IAAIhK,EAAOyJ,EAAS7H,OACpB,GAAI5B,EAAKiK,KAAM,CACXvF,EAAW3C,WACX,MAGJ,GADA2C,EAAW9C,KAAK5B,EAAK9C,OACjBwH,EAAW/C,OACX,MAUR,MAP+B,mBAApB8H,EAASS,QAChBxF,EAAWvB,KAAI,WACPsG,EAASS,QACTT,EAASS,YAIdxF,GHCP,IGtBmCsF,EDADD,EDAGvK,EDsBjCtC,EAAQ+E,EAASsH,GAAU,oBAAsB,IAAMA,EAAS,IAGpE,MAAM,IAAIJ,UAFA,gBAAkBjM,EAAQ,8FIhBrC,SAASiN,GAAUrE,EAAO6C,GAC7B,GAAa,MAAT7C,EAAe,CACf,GCTD,SAA6BA,GAChC,OAAOA,GAA6C,mBAA7BA,EAAM,GDQrBsE,CAAoBtE,GACpB,OERL,SAA4BA,EAAO6C,GACtC,OAAO,IAAI,GAAW,SAAUjE,GAC5B,IAAI1B,EAAM,IAAI,EASd,OARAA,EAAIG,IAAIwF,EAAUJ,UAAS,WACvB,IAAI/C,EAAaM,EAAM,KACvB9C,EAAIG,IAAIqC,EAAWS,UAAU,CACzBrE,KAAM,SAAU1E,GAAS8F,EAAIG,IAAIwF,EAAUJ,UAAS,WAAc,OAAO7D,EAAW9C,KAAK1E,QACzF2E,MAAO,SAAUL,GAAOwB,EAAIG,IAAIwF,EAAUJ,UAAS,WAAc,OAAO7D,EAAW7C,MAAML,QACzFO,SAAU,WAAciB,EAAIG,IAAIwF,EAAUJ,UAAS,WAAc,OAAO7D,EAAW3C,uBAGpFiB,KFHIqH,CAAmBvE,EAAO6C,GAEhC,GAAIgB,GAAU7D,GACf,OGZL,SAAyBA,EAAO6C,GACnC,OAAO,IAAI,GAAW,SAAUjE,GAC5B,IAAI1B,EAAM,IAAI,EAWd,OAVAA,EAAIG,IAAIwF,EAAUJ,UAAS,WACvB,OAAOzC,EAAM8D,MAAK,SAAU1M,GACxB8F,EAAIG,IAAIwF,EAAUJ,UAAS,WACvB7D,EAAW9C,KAAK1E,GAChB8F,EAAIG,IAAIwF,EAAUJ,UAAS,WAAc,OAAO7D,EAAW3C,sBAEhE,SAAUP,GACTwB,EAAIG,IAAIwF,EAAUJ,UAAS,WAAc,OAAO7D,EAAW7C,MAAML,cAGlEwB,KHDIsH,CAAgBxE,EAAO6C,GAE7B,GAAIe,GAAY5D,GACjB,OAAO4C,EAAc5C,EAAO6C,GAE3B,GIlBN,SAAoB7C,GACvB,OAAOA,GAA2C,mBAA3BA,EAAM,GJiBhByE,CAAWzE,IAA2B,iBAAVA,EACjC,OKjBL,SAA0BA,EAAO6C,GACpC,IAAK7C,EACD,MAAM,IAAIzE,MAAM,2BAEpB,OAAO,IAAI,GAAW,SAAUqD,GAC5B,IACI+E,EADAzG,EAAM,IAAI,EAiCd,OA/BAA,EAAIG,KAAI,WACAsG,GAAuC,mBAApBA,EAASS,QAC5BT,EAASS,YAGjBlH,EAAIG,IAAIwF,EAAUJ,UAAS,WACvBkB,EAAW3D,EAAM,KACjB9C,EAAIG,IAAIwF,EAAUJ,UAAS,WACvB,IAAI7D,EAAW/C,OAAf,CAGA,IAAIzE,EACA+M,EACJ,IACI,IAAIV,EAASE,EAAS7H,OACtB1E,EAAQqM,EAAOrM,MACf+M,EAAOV,EAAOU,KAElB,MAAOzI,GAEH,YADAkD,EAAW7C,MAAML,GAGjByI,EACAvF,EAAW3C,YAGX2C,EAAW9C,KAAK1E,GAChBuB,KAAK8J,qBAIVvF,KLrBIwH,CAAiB1E,EAAO6C,GAGvC,MAAM,IAAIQ,WAAqB,OAAVrD,UAAyBA,GAASA,GAAS,sBMpB7D,SAAS2E,GAAK3E,EAAO6C,GACxB,OAAKA,EAOMwB,GAAUrE,EAAO6C,GANpB7C,aAAiB,EACVA,EAEJ,IAAI,EAAW+D,GAAY/D,ICmB1C,SAAS4E,GAAiBC,EAASzK,GAC/B,OAAO,IAAI,GAAW,SAAUwE,GAC5B,IAAInE,EAAMoK,EAAQzL,OAClB,GAAY,IAARqB,EAgCJ,IA5BA,IAAIqK,EAAS,IAAI/J,MAAMN,GACnBsK,EAAY,EACZC,EAAU,EACVC,EAAU,SAAU9O,GACpB,IAAIqK,EAASmE,GAAKE,EAAQ1O,IACtB+O,GAAW,EACftG,EAAWvB,IAAImD,EAAOL,UAAU,CAC5BrE,KAAM,SAAU1E,GACP8N,IACDA,GAAW,EACXF,KAEJF,EAAO3O,GAAKiB,GAEhB2E,MAAO,SAAUL,GAAO,OAAOkD,EAAW7C,MAAML,IAChDO,SAAU,aACN8I,IACkBtK,GAAQyK,IAClBF,IAAYvK,GACZmE,EAAW9C,KAAK1B,EACZA,EAAK0D,QAAO,SAAU2F,EAAQ/L,EAAKvB,GAAK,OAAQsN,EAAO/L,GAAOoN,EAAO3O,GAAIsN,IAAY,IACrFqB,GAERlG,EAAW3C,iBAKlB9F,EAAI,EAAGA,EAAIsE,EAAKtE,IACrB8O,EAAQ9O,QAhCRyI,EAAW3C,cC1BhB,SAASkJ,GAAUC,EAAQC,EAAWC,EAASC,GAKlD,OAJIpK,EAAWmK,KACXC,EAAiBD,EACjBA,OAAUhK,GAEViK,EACOJ,GAAUC,EAAQC,EAAWC,GAAS1F,KAAKpD,GAAI,SAAUwG,GAAQ,OAAO9G,EAAQ8G,GAAQuC,EAAelM,WAAM,EAAQ2J,GAAQuC,EAAevC,OAEhJ,IAAI,GAAW,SAAUpE,IAYpC,SAAS4G,EAAkBC,EAAWJ,EAAWK,EAAS9G,EAAY0G,GAClE,IAAI3I,EACJ,GA+BJ,SAAuB8I,GACnB,OAAOA,GAAmD,mBAA/BA,EAAUE,kBAA4E,mBAAlCF,EAAUG,oBAhCrFC,CAAcJ,GAAY,CAC1B,IAAIK,EAAWL,EACfA,EAAUE,iBAAiBN,EAAWK,EAASJ,GAC/C3I,EAAc,WAAc,OAAOmJ,EAASF,oBAAoBP,EAAWK,EAASJ,SAEnF,GAuBT,SAAmCG,GAC/B,OAAOA,GAAqC,mBAAjBA,EAAUM,IAA8C,mBAAlBN,EAAUO,IAxBlEC,CAA0BR,GAAY,CAC3C,IAAIS,EAAWT,EACfA,EAAUM,GAAGV,EAAWK,GACxB/I,EAAc,WAAc,OAAOuJ,EAASF,IAAIX,EAAWK,SAE1D,GAeT,SAAiCD,GAC7B,OAAOA,GAA8C,mBAA1BA,EAAUU,aAAkE,mBAA7BV,EAAUW,eAhB3EC,CAAwBZ,GAAY,CACzC,IAAIa,EAAWb,EACfA,EAAUU,YAAYd,EAAWK,GACjC/I,EAAc,WAAc,OAAO2J,EAASF,eAAef,EAAWK,QAErE,KAAID,IAAaA,EAAUrM,OAM5B,MAAM,IAAIiK,UAAU,wBALpB,IAAK,IAAIlN,EAAI,EAAGsE,EAAMgL,EAAUrM,OAAQjD,EAAIsE,EAAKtE,IAC7CqP,EAAkBC,EAAUtP,GAAIkP,EAAWK,EAAS9G,EAAY0G,GAMxE1G,EAAWvB,IAAIV,GA5BX6I,CAAkBJ,EAAQC,GAR1B,SAAiBxM,GACTM,UAAUC,OAAS,EACnBwF,EAAW9C,KAAKf,MAAMhD,UAAUsK,MAAM/L,KAAK6C,YAG3CyF,EAAW9C,KAAKjD,KAGsB+F,EAAY0G,MCpB3D,IAAIiB,GAAsB,IAAI,EAAW5G,GCAhD,IAAI,GAAiC,SAAUxB,GAE3C,SAASqI,EAAgB/G,EAAQgH,EAAYC,GACzC,IAAIpI,EAAQH,EAAO7H,KAAKqC,OAASA,KAKjC,OAJA2F,EAAMmB,OAASA,EACfnB,EAAMmI,WAAaA,EACnBnI,EAAMoI,WAAaA,EACnBpI,EAAMtB,MAAQ,EACPsB,EAaX,OApBA,EAAkBkI,EAAiBrI,GASnCqI,EAAgBzO,UAAU8G,MAAQ,SAAUzH,GACxCuB,KAAK8G,OAAOkH,WAAWhO,KAAK8N,WAAYrP,EAAOuB,KAAK+N,WAAY/N,KAAKqE,QAASrE,OAElF6N,EAAgBzO,UAAU+G,OAAS,SAAU/C,GACzCpD,KAAK8G,OAAOmH,YAAY7K,EAAOpD,MAC/BA,KAAKgE,eAET6J,EAAgBzO,UAAUgH,UAAY,WAClCpG,KAAK8G,OAAOoH,eAAelO,MAC3BA,KAAKgE,eAEF6J,EArByB,CAsBlC,GCrBK,SAASM,GAAkBC,EAAiBtD,EAAQgD,EAAYC,EAAY/H,GAI/E,QAHoB,IAAhBA,IACAA,EAAc,IAAI,GAAgBoI,EAAiBN,EAAYC,KAE/D/H,EAAY9C,OAGhB,OAAI4H,aAAkB,EACXA,EAAOtD,UAAUxB,GAErBoF,GAAYN,EAAZM,CAAoBpF,GCX/B,IAAI,GAAiC,SAAUR,GAE3C,SAAS6I,IACL,OAAkB,OAAX7I,GAAmBA,EAAO9E,MAAMV,KAAMQ,YAAcR,KAW/D,OAbA,EAAkBqO,EAAiB7I,GAInC6I,EAAgBjP,UAAU4O,WAAa,SAAUF,EAAYQ,EAAYP,EAAYQ,EAAYC,GAC7FxO,KAAKgG,YAAY7C,KAAKmL,IAE1BD,EAAgBjP,UAAU6O,YAAc,SAAU7K,EAAOoL,GACrDxO,KAAKgG,YAAY5C,MAAMA,IAE3BiL,EAAgBjP,UAAU8O,eAAiB,SAAUM,GACjDxO,KAAKgG,YAAY1C,YAEd+K,EAdyB,CAelC,GCCF,IAAII,GAAkC,WAClC,SAASA,EAAiBjE,EAASkE,QACZ,IAAfA,IACAA,EAAaC,OAAOC,mBAExB5O,KAAKwK,QAAUA,EACfxK,KAAK0O,WAAaA,EAKtB,OAHAD,EAAiBrP,UAAUzB,KAAO,SAAUuK,EAAUL,GAClD,OAAOA,EAAOL,UAAU,IAAI,GAAmBU,EAAUlI,KAAKwK,QAASxK,KAAK0O,cAEzED,EAX0B,GAcjC,GAAoC,SAAUjJ,GAE9C,SAASqJ,EAAmB7I,EAAawE,EAASkE,QAC3B,IAAfA,IACAA,EAAaC,OAAOC,mBAExB,IAAIjJ,EAAQH,EAAO7H,KAAKqC,KAAMgG,IAAgBhG,KAO9C,OANA2F,EAAM6E,QAAUA,EAChB7E,EAAM+I,WAAaA,EACnB/I,EAAMmJ,cAAe,EACrBnJ,EAAMoJ,OAAS,GACfpJ,EAAMqJ,OAAS,EACfrJ,EAAMtB,MAAQ,EACPsB,EAkDX,OA9DA,EAAkBkJ,EAAoBrJ,GActCqJ,EAAmBzP,UAAU8G,MAAQ,SAAUzH,GACvCuB,KAAKgP,OAAShP,KAAK0O,WACnB1O,KAAKiP,SAASxQ,GAGduB,KAAK+O,OAAOtK,KAAKhG,IAGzBoQ,EAAmBzP,UAAU6P,SAAW,SAAUxQ,GAC9C,IAAIqM,EACAzG,EAAQrE,KAAKqE,QACjB,IACIyG,EAAS9K,KAAKwK,QAAQ/L,EAAO4F,GAEjC,MAAOtB,GAEH,YADA/C,KAAKgG,YAAY5C,MAAML,GAG3B/C,KAAKgP,SACLhP,KAAKkP,UAAUpE,EAAQrM,EAAO4F,IAElCwK,EAAmBzP,UAAU8P,UAAY,SAAUC,EAAK1Q,EAAO4F,GAC3D,IAAI+K,EAAkB,IAAI,GAAgBpP,UAAM2C,OAAWA,GACzC3C,KAAKgG,YACXtB,IAAI0K,GAChBjB,GAAkBnO,KAAMmP,EAAK1Q,EAAO4F,EAAO+K,IAE/CP,EAAmBzP,UAAUgH,UAAY,WACrCpG,KAAK8O,cAAe,EACA,IAAhB9O,KAAKgP,QAAuC,IAAvBhP,KAAK+O,OAAOtO,QACjCT,KAAKgG,YAAY1C,WAErBtD,KAAKgE,eAET6K,EAAmBzP,UAAU4O,WAAa,SAAUF,EAAYQ,EAAYP,EAAYQ,EAAYC,GAChGxO,KAAKgG,YAAY7C,KAAKmL,IAE1BO,EAAmBzP,UAAU8O,eAAiB,SAAUM,GACpD,IAAIO,EAAS/O,KAAK+O,OAClB/O,KAAKoE,OAAOoK,GACZxO,KAAKgP,SACDD,EAAOtO,OAAS,EAChBT,KAAKkG,MAAM6I,EAAOM,SAEG,IAAhBrP,KAAKgP,QAAgBhP,KAAK8O,cAC/B9O,KAAKgG,YAAY1C,YAGlBuL,EA/D4B,CAgErC,IChGK,SAAS,GAASjO,GACrB,OAAOA,ECCJ,SAAS0O,GAASZ,GAIrB,YAHmB,IAAfA,IACAA,EAAaC,OAAOC,mBFErB,SAASW,EAAS/E,EAASoC,EAAgB8B,GAI9C,YAHmB,IAAfA,IACAA,EAAaC,OAAOC,mBAEM,mBAAnBhC,EACA,SAAU/E,GAAU,OAAOA,EAAOZ,KAAKsI,GAAS,SAAUnP,EAAG5C,GAAK,OAAOwO,GAAKxB,EAAQpK,EAAG5C,IAAIyJ,KAAKpD,GAAI,SAAU5B,EAAGuN,GAAM,OAAO5C,EAAexM,EAAG6B,EAAGzE,EAAGgS,SAAad,MAE7I,iBAAnB9B,IACZ8B,EAAa9B,GAEV,SAAU/E,GAAU,OAAOA,EAAOF,KAAK,IAAI8G,GAAiBjE,EAASkE,MEVrEa,CAAS,GAAUb,GCFvB,SAASe,KAEZ,IADA,IAAIC,EAAc,GACTvI,EAAK,EAAGA,EAAK3G,UAAUC,OAAQ0G,IACpCuI,EAAYvI,GAAM3G,UAAU2G,GAEhC,IAAIuH,EAAaC,OAAOC,kBACpB1E,EAAY,KACZyF,EAAOD,EAAYA,EAAYjP,OAAS,GAU5C,OATIoJ,EAAY8F,IACZzF,EAAYwF,EAAYpF,MACpBoF,EAAYjP,OAAS,GAAoD,iBAAxCiP,EAAYA,EAAYjP,OAAS,KAClEiO,EAAagB,EAAYpF,QAGR,iBAATqF,IACZjB,EAAagB,EAAYpF,OAEX,OAAdJ,GAA6C,IAAvBwF,EAAYjP,QAAgBiP,EAAY,aAAc,EACrEA,EAAY,GAEhBJ,GAASZ,EAATY,CAAqBnF,EAAUuF,EAAaxF,I,YCiBhD,SAAS0F,GAAQC,EAAKC,GAIzB,YAHgB,IAAZA,IACAA,EAAU,MAEP,IAAI,GAAe,CAAEC,OAAQ,MAAOF,IAAKA,EAAKC,QAASA,IAE3D,SAASE,GAASH,EAAKI,EAAMH,GAChC,OAAO,IAAI,GAAe,CAAEC,OAAQ,OAAQF,IAAKA,EAAKI,KAAMA,EAAMH,QAASA,IAExE,SAASI,GAAWL,EAAKC,GAC5B,OAAO,IAAI,GAAe,CAAEC,OAAQ,SAAUF,IAAKA,EAAKC,QAASA,IAE9D,SAASK,GAAQN,EAAKI,EAAMH,GAC/B,OAAO,IAAI,GAAe,CAAEC,OAAQ,MAAOF,IAAKA,EAAKI,KAAMA,EAAMH,QAASA,IAEvE,SAASM,GAAUP,EAAKI,EAAMH,GACjC,OAAO,IAAI,GAAe,CAAEC,OAAQ,QAASF,IAAKA,EAAKI,KAAMA,EAAMH,QAASA,IAEhF,IAAIO,GAA4BxM,GAAI,SAAUjD,EAAGyD,GAAS,OAAOzD,EAAE0P,YAC5D,SAASC,GAAYV,EAAKC,GAC7B,OAAOO,GAAY,IAAI,GAAe,CAClCN,OAAQ,MACRF,IAAKA,EACLW,aAAc,OACdV,QAASA,KAGjB,IAAI,GAAgC,SAAUtK,GAE1C,SAASiL,EAAeC,GACpB,IAAI/K,EAAQH,EAAO7H,KAAKqC,OAASA,KAC7B2Q,EAAU,CACVC,OAAO,EACPC,UAAW,WACP,OAAO7Q,KAAK8Q,YAtE5B,WACI,GAAIC,GAAA,EAAKC,eACL,OAAO,IAAID,GAAA,EAAKC,eAEf,GAAMD,GAAA,EAAKE,eACZ,OAAO,IAAIF,GAAA,EAAKE,eAGhB,MAAM,IAAIrO,MAAM,yCA8DkBsO,GA3D1C,WACI,GAAIH,GAAA,EAAKC,eACL,OAAO,IAAID,GAAA,EAAKC,eAGhB,IAAIG,OAAS,EACb,IAEI,IADA,IAAIC,EAAU,CAAC,iBAAkB,oBAAqB,sBAC7C5T,EAAI,EAAGA,EAAI,EAAGA,IACnB,IAEI,GADA2T,EAASC,EAAQ5T,GACb,IAAIuT,GAAA,EAAKM,cAAcF,GACvB,MAGR,MAAOjR,IAGX,OAAO,IAAI6Q,GAAA,EAAKM,cAAcF,GAElC,MAAOjR,GACH,MAAM,IAAI0C,MAAM,oDAsCiC0O,IAEjDR,aAAa,EACbS,iBAAiB,EACjBzB,QAAS,GACTC,OAAQ,MACRS,aAAc,OACdgB,QAAS,GAEb,GAA4B,iBAAjBd,EACPC,EAAQd,IAAMa,OAGd,IAAK,IAAI5P,KAAQ4P,EACTA,EAAarR,eAAeyB,KAC5B6P,EAAQ7P,GAAQ4P,EAAa5P,IAKzC,OADA6E,EAAMgL,QAAUA,EACThL,EAKa,IAChB7G,EAWR,OA3CA,EAAkB2R,EAAgBjL,GA4BlCiL,EAAerR,UAAUsI,WAAa,SAAUzB,GAC5C,OAAO,IAAI,GAAeA,EAAYjG,KAAK2Q,UAE/CF,EAAe3R,SACPA,EAAS,SAAU4R,GACnB,OAAO,IAAID,EAAeC,KAEvBrS,IAAMuR,GACb9Q,EAAO2S,KAAOzB,GACdlR,EAAO4S,OAASxB,GAChBpR,EAAO6S,IAAMxB,GACbrR,EAAO8S,MAAQxB,GACftR,EAAO+S,QAAUtB,GACVzR,GAEJ2R,EA5CwB,CA6CjC,GAEE,GAAgC,SAAUjL,GAE1C,SAASsM,EAAe9L,EAAa2K,GACjC,IAAIhL,EAAQH,EAAO7H,KAAKqC,KAAMgG,IAAgBhG,KAC9C2F,EAAMgL,QAAUA,EAChBhL,EAAM6F,MAAO,EACb,IAAIsE,EAAUa,EAAQb,QAAUa,EAAQb,SAAW,GAUnD,OATKa,EAAQG,aAAgBnL,EAAMoM,UAAUjC,EAAS,sBAClDA,EAAQ,oBAAsB,kBAEVnK,EAAMoM,UAAUjC,EAAS,iBACrBiB,GAAA,EAAKiB,UAAYrB,EAAQV,gBAAgBc,GAAA,EAAKiB,eAAqC,IAAjBrB,EAAQV,OAClGH,EAAQ,gBAAkB,oDAE9Ba,EAAQV,KAAOtK,EAAMsM,cAActB,EAAQV,KAAMtK,EAAMoM,UAAUpB,EAAQb,QAAS,iBAClFnK,EAAMuM,OACCvM,EAyLX,OAxMA,EAAkBmM,EAAgBtM,GAiBlCsM,EAAe1S,UAAU+D,KAAO,SAAUjD,GACtCF,KAAKwL,MAAO,EACZ,IACIV,EADWqH,EAANnS,KAAemS,IAAKxB,EAApB3Q,KAAiC2Q,QAAS3K,EAA1ChG,KAA2DgG,YAEpE,IACI8E,EAAS,IAAIsH,GAAalS,EAAGiS,EAAKxB,GAEtC,MAAO5N,GACH,OAAOiD,EAAY5C,MAAML,GAE7BiD,EAAY7C,KAAK2H,IAErBgH,EAAe1S,UAAU8S,KAAO,WAC5B,IAAevB,EAAN3Q,KAAmB2Q,QAAS0B,EAA5BrS,KAAoC2Q,QAAS2B,EAAOD,EAAGC,KAAMvC,EAASsC,EAAGtC,OAAQF,EAAMwC,EAAGxC,IAAKe,EAAQyB,EAAGzB,MAAO2B,EAAWF,EAAGE,SAAUzC,EAAUuC,EAAGvC,QAASG,EAAOoC,EAAGpC,KAClL,IACI,IAAIkC,EAAMnS,KAAKmS,IAAMxB,EAAQE,YAC7B7Q,KAAKwS,YAAYL,EAAKxB,GAClB2B,EACAH,EAAIM,KAAK1C,EAAQF,EAAKe,EAAO0B,EAAMC,GAGnCJ,EAAIM,KAAK1C,EAAQF,EAAKe,GAEtBA,IACAuB,EAAIX,QAAUb,EAAQa,QACtBW,EAAI3B,aAAeG,EAAQH,cAE3B,oBAAqB2B,IACrBA,EAAIZ,kBAAoBZ,EAAQY,iBAEpCvR,KAAK0S,WAAWP,EAAKrC,GACjBG,EACAkC,EAAID,KAAKjC,GAGTkC,EAAID,OAGZ,MAAOnP,GACH/C,KAAKoD,MAAML,KAGnB+O,EAAe1S,UAAU6S,cAAgB,SAAUhC,EAAM0C,GACrD,IAAK1C,GAAwB,iBAATA,EAChB,OAAOA,EAEN,GAAIc,GAAA,EAAKiB,UAAY/B,aAAgBc,GAAA,EAAKiB,SAC3C,OAAO/B,EAEX,GAAI0C,EAAa,CACb,IAAIC,EAAaD,EAAY5N,QAAQ,MACjB,IAAhB6N,IACAD,EAAcA,EAAYE,UAAU,EAAGD,IAG/C,OAAQD,GACJ,IAAK,oCACD,OAAOzU,OAAOuD,KAAKwO,GAAMpM,KAAI,SAAU9E,GAAO,OAAO+T,mBAAmB/T,GAAO,IAAM+T,mBAAmB7C,EAAKlR,OAAU+E,KAAK,KAChI,IAAK,mBACD,OAAOiP,KAAKC,UAAU/C,GAC1B,QACI,OAAOA,IAGnB6B,EAAe1S,UAAUsT,WAAa,SAAUP,EAAKrC,GACjD,IAAK,IAAI/Q,KAAO+Q,EACRA,EAAQzQ,eAAeN,IACvBoT,EAAIc,iBAAiBlU,EAAK+Q,EAAQ/Q,KAI9C+S,EAAe1S,UAAU2S,UAAY,SAAUjC,EAASoD,GACpD,IAAK,IAAInU,KAAO+Q,EACZ,GAAI/Q,EAAIoU,gBAAkBD,EAAWC,cACjC,OAAOrD,EAAQ/Q,IAK3B+S,EAAe1S,UAAUoT,YAAc,SAAUL,EAAKxB,GAClD,IAAIyC,EAAqBzC,EAAQyC,mBACjC,SAASC,EAAWnT,GAChB,IAIIkD,EAJA+E,EAAKkL,EAAYpN,EAAakC,EAAGlC,WAAYmN,EAAqBjL,EAAGiL,mBAAoBzC,EAAUxI,EAAGwI,QACtGyC,GACAA,EAAmBhQ,MAAMlD,GAG7B,IACIkD,EAAQ,IAAIkQ,GAAiBtT,KAAM2Q,GAEvC,MAAO5N,GACHK,EAAQL,EAEZkD,EAAW7C,MAAMA,GAMrB,GAJA+O,EAAIoB,UAAYF,EAChBA,EAAW1C,QAAUA,EACrB0C,EAAWpN,WAAajG,KACxBqT,EAAWD,mBAAqBA,EAC5BjB,EAAIqB,QAAU,oBAAqBrB,EAAK,CAEpC,IAAIsB,EAaJC,EAdJ,GAAIN,EAEAK,EAAgB,SAAUvT,GACGuT,EAAcL,mBACpBjQ,KAAKjD,IAExB6Q,GAAA,EAAKE,eACLkB,EAAIwB,WAAaF,EAGjBtB,EAAIqB,OAAOG,WAAaF,EAE5BA,EAAcL,mBAAqBA,EAGvCM,EAAa,SAAUxT,GACnB,IAIIkD,EAJA+E,EAAKuL,EAAYN,EAAqBjL,EAAGiL,mBAAoBnN,EAAakC,EAAGlC,WAAY0K,EAAUxI,EAAGwI,QACtGyC,GACAA,EAAmBhQ,MAAMlD,GAG7B,IACIkD,EAAQ,IAAIwQ,GAAU,aAAc5T,KAAM2Q,GAE9C,MAAO5N,GACHK,EAAQL,EAEZkD,EAAW7C,MAAMA,IAErB+O,EAAI0B,QAAUH,EACdA,EAAW/C,QAAUA,EACrB+C,EAAWzN,WAAajG,KACxB0T,EAAWN,mBAAqBA,EAEpC,SAASU,EAAoB5T,IAO7B,SAAS6T,EAAQ7T,GACb,IAAIiI,EAAK4L,EAAS9N,EAAakC,EAAGlC,WAAYmN,EAAqBjL,EAAGiL,mBAAoBzC,EAAUxI,EAAGwI,QACvG,GAAwB,IAApB3Q,KAAKgU,WAAkB,CACvB,IAAIC,EAA2B,OAAhBjU,KAAKkU,OAAkB,IAAMlU,KAAKkU,OAC7C5D,EAAkC,SAAtBtQ,KAAKwQ,aAA2BxQ,KAAKsQ,UAAYtQ,KAAKmU,aAAgBnU,KAAKsQ,SAI3F,GAHiB,IAAb2D,IACAA,EAAW3D,EAAW,IAAM,GAE5B2D,EAAW,IACPb,GACAA,EAAmB9P,WAEvB2C,EAAW9C,KAAKjD,GAChB+F,EAAW3C,eAEV,CACG8P,GACAA,EAAmBhQ,MAAMlD,GAE7B,IAAIkD,OAAQ,EACZ,IACIA,EAAQ,IAAIwQ,GAAU,cAAgBK,EAAUjU,KAAM2Q,GAE1D,MAAO5N,GACHK,EAAQL,EAEZkD,EAAW7C,MAAMA,KA9B7B+O,EAAIiC,mBAAqBN,EACzBA,EAAoB7N,WAAajG,KACjC8T,EAAoBV,mBAAqBA,EACzCU,EAAoBnD,QAAUA,EA+B9BwB,EAAIkC,OAASN,EACbA,EAAQ9N,WAAajG,KACrB+T,EAAQX,mBAAqBA,EAC7BW,EAAQpD,QAAUA,GAEtBmB,EAAe1S,UAAU4E,YAAc,WACnC,IAAewH,EAANxL,KAAgBwL,KAAM2G,EAAtBnS,KAA+BmS,KACnC3G,GAAQ2G,GAA0B,IAAnBA,EAAI6B,YAAyC,mBAAd7B,EAAImC,OACnDnC,EAAImC,QAER9O,EAAOpG,UAAU4E,YAAYrG,KAAKqC,OAE/B8R,EAzMwB,CA0MjC,GAEEM,GAA8B,WAS9B,OARA,SAAsBmC,EAAepC,EAAKxB,GACtC3Q,KAAKuU,cAAgBA,EACrBvU,KAAKmS,IAAMA,EACXnS,KAAK2Q,QAAUA,EACf3Q,KAAKkU,OAAS/B,EAAI+B,OAClBlU,KAAKwQ,aAAe2B,EAAI3B,cAAgBG,EAAQH,aAChDxQ,KAAKsQ,SAAWkE,GAAiBxU,KAAKwQ,aAAc2B,IAP3B,GA2BtByB,GAfuB,WAC9B,SAASa,EAAc7Q,EAASuO,EAAKxB,GASjC,OARA/N,MAAMjF,KAAKqC,MACXA,KAAK4D,QAAUA,EACf5D,KAAKjC,KAAO,YACZiC,KAAKmS,IAAMA,EACXnS,KAAK2Q,QAAUA,EACf3Q,KAAKkU,OAAS/B,EAAI+B,OAClBlU,KAAKwQ,aAAe2B,EAAI3B,cAAgBG,EAAQH,aAChDxQ,KAAKsQ,SAAWkE,GAAiBxU,KAAKwQ,aAAc2B,GAC7CnS,KAGX,OADAyU,EAAcrV,UAA0BlB,OAAOY,OAAO8D,MAAMxD,WACrDqV,EAbuB,GAwBlC,SAASD,GAAiBhE,EAAc2B,GACpC,OAAQ3B,GACJ,IAAK,OACD,OAXZ,SAAmB2B,GACf,MAAI,aAAcA,EACPA,EAAI3B,aAAe2B,EAAI7B,SAAWyC,KAAK2B,MAAMvC,EAAI7B,UAAY6B,EAAIgC,cAAgB,QAGjFpB,KAAK2B,MAAMvC,EAAIgC,cAAgB,QAM3BQ,CAAUxC,GACrB,IAAK,MACD,OAAOA,EAAIyC,YACf,IAAK,OACL,QACI,MAAQ,aAAczC,EAAOA,EAAI7B,SAAW6B,EAAIgC,cAQrD,IAAIb,GALX,SAA8BnB,EAAKxB,GAG/B,OAFAiD,GAAUjW,KAAKqC,KAAM,eAAgBmS,EAAKxB,GAC1C3Q,KAAKjC,KAAO,mBACLiC,MChXA6U,GAAqB,WAAe,OAAO,GAAe/V,OAArC,GCCzB,SAASgW,GAAOC,EAAWtK,GAC9B,OAAO,SAAgC5C,GACnC,OAAOA,EAAOF,KAAK,IAAIqN,GAAeD,EAAWtK,KAGzD,IAAIuK,GAAgC,WAChC,SAASA,EAAeD,EAAWtK,GAC/BzK,KAAK+U,UAAYA,EACjB/U,KAAKyK,QAAUA,EAKnB,OAHAuK,EAAe5V,UAAUzB,KAAO,SAAUsI,EAAY4B,GAClD,OAAOA,EAAOL,UAAU,IAAI,GAAiBvB,EAAYjG,KAAK+U,UAAW/U,KAAKyK,WAE3EuK,EARwB,GAU/B,GAAkC,SAAUxP,GAE5C,SAASyP,EAAiBjP,EAAa+O,EAAWtK,GAC9C,IAAI9E,EAAQH,EAAO7H,KAAKqC,KAAMgG,IAAgBhG,KAI9C,OAHA2F,EAAMoP,UAAYA,EAClBpP,EAAM8E,QAAUA,EAChB9E,EAAMkF,MAAQ,EACPlF,EAeX,OArBA,EAAkBsP,EAAkBzP,GAQpCyP,EAAiB7V,UAAU8G,MAAQ,SAAUzH,GACzC,IAAIqM,EACJ,IACIA,EAAS9K,KAAK+U,UAAUpX,KAAKqC,KAAKyK,QAAShM,EAAOuB,KAAK6K,SAE3D,MAAO9H,GAEH,YADA/C,KAAKgG,YAAY5C,MAAML,GAGvB+H,GACA9K,KAAKgG,YAAY7C,KAAK1E,IAGvBwW,EAtB0B,CAuBnC,GCpCK,SAASC,GAAInN,EAAgB3E,EAAOE,GACvC,OAAO,SAA6BuE,GAChC,OAAOA,EAAOF,KAAK,IAAIwN,GAAWpN,EAAgB3E,EAAOE,KAGjE,IAAI6R,GAA4B,WAC5B,SAASA,EAAWpN,EAAgB3E,EAAOE,GACvCtD,KAAK+H,eAAiBA,EACtB/H,KAAKoD,MAAQA,EACbpD,KAAKsD,SAAWA,EAKpB,OAHA6R,EAAW/V,UAAUzB,KAAO,SAAUsI,EAAY4B,GAC9C,OAAOA,EAAOL,UAAU,IAAI,GAAcvB,EAAYjG,KAAK+H,eAAgB/H,KAAKoD,MAAOpD,KAAKsD,YAEzF6R,EAToB,GAW3B,GAA+B,SAAU3P,GAEzC,SAAS4P,EAAcpP,EAAaQ,EAAgBpD,EAAOE,GACvD,IAAIqC,EAAQH,EAAO7H,KAAKqC,KAAMgG,IAAgBhG,KAgB9C,OAfA2F,EAAM0P,SAAWrO,EACjBrB,EAAM2P,UAAYtO,EAClBrB,EAAM4P,aAAevO,EACrBrB,EAAM2P,UAAYlS,GAAS4D,EAC3BrB,EAAM4P,aAAejS,GAAY0D,EAC7BxE,EAAWgE,IACXb,EAAMe,SAAWf,EACjBA,EAAM0P,SAAW7O,GAEZA,IACLb,EAAMe,SAAWF,EACjBb,EAAM0P,SAAW7O,EAAerD,MAAQ6D,EACxCrB,EAAM2P,UAAY9O,EAAepD,OAAS4D,EAC1CrB,EAAM4P,aAAe/O,EAAelD,UAAY0D,GAE7CrB,EAgCX,OAlDA,EAAkByP,EAAe5P,GAoBjC4P,EAAchW,UAAU8G,MAAQ,SAAUzH,GACtC,IACIuB,KAAKqV,SAAS1X,KAAKqC,KAAK0G,SAAUjI,GAEtC,MAAOsE,GAEH,YADA/C,KAAKgG,YAAY5C,MAAML,GAG3B/C,KAAKgG,YAAY7C,KAAK1E,IAE1B2W,EAAchW,UAAU+G,OAAS,SAAUpD,GACvC,IACI/C,KAAKsV,UAAU3X,KAAKqC,KAAK0G,SAAU3D,GAEvC,MAAOA,GAEH,YADA/C,KAAKgG,YAAY5C,MAAML,GAG3B/C,KAAKgG,YAAY5C,MAAML,IAE3BqS,EAAchW,UAAUgH,UAAY,WAChC,IACIpG,KAAKuV,aAAa5X,KAAKqC,KAAK0G,UAEhC,MAAO3D,GAEH,YADA/C,KAAKgG,YAAY5C,MAAML,GAG3B,OAAO/C,KAAKgG,YAAY1C,YAErB8R,EAnDuB,CAoDhC,GCvEK,SAASI,KAEZ,IADA,IAAIC,EAAa,GACRtO,EAAK,EAAGA,EAAK3G,UAAUC,OAAQ0G,IACpCsO,EAAWtO,GAAM3G,UAAU2G,GAE/B,IAAI1G,EAASgV,EAAWhV,OACxB,GAAe,IAAXA,EACA,MAAM,IAAImC,MAAM,uCAEpB,OAAO,SAAUiF,GAAU,OAAOhE,EAEtC,SAAiBhC,EAAOpB,GAcpB,OAba,SAAUG,GAEnB,IADA,IAAI8U,EAAc9U,EACTpD,EAAI,EAAGA,EAAIiD,EAAQjD,IAAK,CAC7B,IAAI8B,EAAIoW,EAAY7T,EAAMrE,IAC1B,QAAiB,IAAN8B,EAIP,OAHAoW,EAAcpW,EAMtB,OAAOoW,GAd2BC,CAAQF,EAAYhV,GAAxBoD,CAAiCgE,ICVvE,IAUW+N,GAVqC,WAC5C,SAASC,IAIL,OAHAjT,MAAMjF,KAAKqC,MACXA,KAAK4D,QAAU,wBACf5D,KAAKjC,KAAO,0BACLiC,KAGX,OADA6V,EAA4BzW,UAA0BlB,OAAOY,OAAO8D,MAAMxD,WACnEyW,EARqC,GCchD,IAAI,GAA8B,WAC9B,SAASC,EAAaC,GAElB,GADA/V,KAAK+V,MAAQA,EACT/V,KAAK+V,MAAQ,EACb,MAAM,IAAIH,GAMlB,OAHAE,EAAa1W,UAAUzB,KAAO,SAAUsI,EAAY4B,GAChD,OAAOA,EAAOL,UAAU,IAAI,GAAevB,EAAYjG,KAAK+V,SAEzDD,EAVsB,GAY7B,GAAgC,SAAUtQ,GAE1C,SAASwQ,EAAehQ,EAAa+P,GACjC,IAAIpQ,EAAQH,EAAO7H,KAAKqC,KAAMgG,IAAgBhG,KAG9C,OAFA2F,EAAMoQ,MAAQA,EACdpQ,EAAMkF,MAAQ,EACPlF,EAaX,OAlBA,EAAkBqQ,EAAgBxQ,GAOlCwQ,EAAe5W,UAAU8G,MAAQ,SAAUzH,GACvC,IAAIsX,EAAQ/V,KAAK+V,MACblL,IAAU7K,KAAK6K,MACfA,GAASkL,IACT/V,KAAKgG,YAAY7C,KAAK1E,GAClBoM,IAAUkL,IACV/V,KAAKgG,YAAY1C,WACjBtD,KAAKgE,iBAIVgS,EAnBwB,CAoBjC,GCxCK,SAASC,GAAUzL,EAASoC,GAC/B,MAA8B,mBAAnBA,EACA,SAAU/E,GAAU,OAAOA,EAAOZ,KAAKgP,IAAU,SAAU7V,EAAG5C,GAAK,OAAOwO,GAAKxB,EAAQpK,EAAG5C,IAAIyJ,KAAKpD,GAAI,SAAU5B,EAAGuN,GAAM,OAAO5C,EAAexM,EAAG6B,EAAGzE,EAAGgS,YAE7J,SAAU3H,GAAU,OAAOA,EAAOF,KAAK,IAAIuO,GAAkB1L,KAExE,ICTW2L,GDSPD,GAAmC,WACnC,SAASA,EAAkB1L,GACvBxK,KAAKwK,QAAUA,EAKnB,OAHA0L,EAAkB9W,UAAUzB,KAAO,SAAUsI,EAAY4B,GACrD,OAAOA,EAAOL,UAAU,IAAI,GAAoBvB,EAAYjG,KAAKwK,WAE9D0L,EAP2B,GASlC,GAAqC,SAAU1Q,GAE/C,SAAS4Q,EAAoBpQ,EAAawE,GACtC,IAAI7E,EAAQH,EAAO7H,KAAKqC,KAAMgG,IAAgBhG,KAG9C,OAFA2F,EAAM6E,QAAUA,EAChB7E,EAAMtB,MAAQ,EACPsB,EA6CX,OAlDA,EAAkByQ,EAAqB5Q,GAOvC4Q,EAAoBhX,UAAU8G,MAAQ,SAAUzH,GAC5C,IAAIqM,EACAzG,EAAQrE,KAAKqE,QACjB,IACIyG,EAAS9K,KAAKwK,QAAQ/L,EAAO4F,GAEjC,MAAOjB,GAEH,YADApD,KAAKgG,YAAY5C,MAAMA,GAG3BpD,KAAKkP,UAAUpE,EAAQrM,EAAO4F,IAElC+R,EAAoBhX,UAAU8P,UAAY,SAAUpE,EAAQrM,EAAO4F,GAC/D,IAAIgS,EAAoBrW,KAAKqW,kBACzBA,GACAA,EAAkBrS,cAEtB,IAAIoL,EAAkB,IAAI,GAAgBpP,UAAM2C,OAAWA,GACzC3C,KAAKgG,YACXtB,IAAI0K,GAChBpP,KAAKqW,kBAAoBlI,GAAkBnO,KAAM8K,EAAQrM,EAAO4F,EAAO+K,IAE3EgH,EAAoBhX,UAAUgH,UAAY,WACtC,IAAIiQ,EAAoBrW,KAAKqW,kBACxBA,IAAqBA,EAAkBnT,QACxCsC,EAAOpG,UAAUgH,UAAUzI,KAAKqC,MAEpCA,KAAKgE,eAEToS,EAAoBhX,UAAU+E,aAAe,WACzCnE,KAAKqW,kBAAoB,MAE7BD,EAAoBhX,UAAU8O,eAAiB,SAAUM,GACnCxO,KAAKgG,YACX5B,OAAOoK,GACnBxO,KAAKqW,kBAAoB,KACrBrW,KAAK+F,WACLP,EAAOpG,UAAUgH,UAAUzI,KAAKqC,OAGxCoW,EAAoBhX,UAAU4O,WAAa,SAAUF,EAAYQ,EAAYP,EAAYQ,EAAYC,GACjGxO,KAAKgG,YAAY7C,KAAKmL,IAEnB8H,EAnD6B,CAoDtC,IEvEE,GAA6B,SAAU5Q,GAEvC,SAAS8Q,EAAYpM,EAAWqM,GAC5B,IAAI5Q,EAAQH,EAAO7H,KAAKqC,KAAMkK,EAAWqM,IAASvW,KAIlD,OAHA2F,EAAMuE,UAAYA,EAClBvE,EAAM4Q,KAAOA,EACb5Q,EAAM6Q,SAAU,EACT7Q,EAiFX,OAvFA,EAAkB2Q,EAAa9Q,GAQ/B8Q,EAAYlX,UAAU0K,SAAW,SAAU2M,EAAOC,GAI9C,QAHc,IAAVA,IACAA,EAAQ,GAER1W,KAAKkD,OACL,OAAOlD,KAEXA,KAAKyW,MAAQA,EACb,IAAIE,EAAK3W,KAAK2W,GACVzM,EAAYlK,KAAKkK,UAOrB,OANU,MAANyM,IACA3W,KAAK2W,GAAK3W,KAAK4W,eAAe1M,EAAWyM,EAAID,IAEjD1W,KAAKwW,SAAU,EACfxW,KAAK0W,MAAQA,EACb1W,KAAK2W,GAAK3W,KAAK2W,IAAM3W,KAAK6W,eAAe3M,EAAWlK,KAAK2W,GAAID,GACtD1W,MAEXsW,EAAYlX,UAAUyX,eAAiB,SAAU3M,EAAWyM,EAAID,GAI5D,YAHc,IAAVA,IACAA,EAAQ,GAELI,YAAY5M,EAAU6M,MAAM/X,KAAKkL,EAAWlK,MAAO0W,IAE9DJ,EAAYlX,UAAUwX,eAAiB,SAAU1M,EAAWyM,EAAID,GAI5D,QAHc,IAAVA,IACAA,EAAQ,GAEE,OAAVA,GAAkB1W,KAAK0W,QAAUA,IAA0B,IAAjB1W,KAAKwW,QAC/C,OAAOG,EAEXK,cAAcL,IAGlBL,EAAYlX,UAAU6X,QAAU,SAAUR,EAAOC,GAC7C,GAAI1W,KAAKkD,OACL,OAAO,IAAIN,MAAM,gCAErB5C,KAAKwW,SAAU,EACf,IAAIpT,EAAQpD,KAAKkX,SAAST,EAAOC,GACjC,GAAItT,EACA,OAAOA,GAEe,IAAjBpD,KAAKwW,SAAgC,MAAXxW,KAAK2W,KACpC3W,KAAK2W,GAAK3W,KAAK4W,eAAe5W,KAAKkK,UAAWlK,KAAK2W,GAAI,QAG/DL,EAAYlX,UAAU8X,SAAW,SAAUT,EAAOC,GAC9C,IAAIS,GAAU,EACVC,OAAazU,EACjB,IACI3C,KAAKuW,KAAKE,GAEd,MAAOvW,GACHiX,GAAU,EACVC,IAAelX,GAAKA,GAAK,IAAI0C,MAAM1C,GAEvC,GAAIiX,EAEA,OADAnX,KAAKgE,cACEoT,GAGfd,EAAYlX,UAAU+E,aAAe,WACjC,IAAIwS,EAAK3W,KAAK2W,GACVzM,EAAYlK,KAAKkK,UACjBmN,EAAUnN,EAAUmN,QACpBhT,EAAQgT,EAAQtS,QAAQ/E,MAC5BA,KAAKuW,KAAO,KACZvW,KAAKyW,MAAQ,KACbzW,KAAKwW,SAAU,EACfxW,KAAKkK,UAAY,MACF,IAAX7F,GACAgT,EAAQnS,OAAOb,EAAO,GAEhB,MAANsS,IACA3W,KAAK2W,GAAK3W,KAAK4W,eAAe1M,EAAWyM,EAAI,OAEjD3W,KAAK0W,MAAQ,MAEVJ,EAxFqB,CCAJ,SAAU9Q,GAElC,SAAS8R,EAAOpN,EAAWqM,GACvB,OAAO/Q,EAAO7H,KAAKqC,OAASA,KAQhC,OAVA,EAAkBsX,EAAQ9R,GAI1B8R,EAAOlY,UAAU0K,SAAW,SAAU2M,EAAOC,GAIzC,YAHc,IAAVA,IACAA,EAAQ,GAEL1W,MAEJsX,EAXgB,CAYzB,ICfEC,GAA2B,WAC3B,SAASA,EAAUC,EAAiBC,QACpB,IAARA,IACAA,EAAMF,EAAUE,KAEpBzX,KAAKwX,gBAAkBA,EACvBxX,KAAKyX,IAAMA,EASf,OAPAF,EAAUnY,UAAU0K,SAAW,SAAUyM,EAAMG,EAAOD,GAIlD,YAHc,IAAVC,IACAA,EAAQ,GAEL,IAAI1W,KAAKwX,gBAAgBxX,KAAMuW,GAAMzM,SAAS2M,EAAOC,IAEhEa,EAAUE,IAAM,WAAc,OAAOC,KAAKD,OACnCF,EAfmB,GCG1B,GAAgC,SAAU/R,GAE1C,SAASmS,EAAeH,EAAiBC,QACzB,IAARA,IACAA,EAAMF,GAAUE,KAEpB,IAAI9R,EAAQH,EAAO7H,KAAKqC,KAAMwX,GAAiB,WAC3C,OAAIG,EAAeC,UAAYD,EAAeC,WAAajS,EAChDgS,EAAeC,SAASH,MAGxBA,QAETzX,KAIN,OAHA2F,EAAM0R,QAAU,GAChB1R,EAAMqJ,QAAS,EACfrJ,EAAM+F,eAAY/I,EACXgD,EAkCX,OAlDA,EAAkBgS,EAAgBnS,GAkBlCmS,EAAevY,UAAU0K,SAAW,SAAUyM,EAAMG,EAAOD,GAIvD,YAHc,IAAVC,IACAA,EAAQ,GAERiB,EAAeC,UAAYD,EAAeC,WAAa5X,KAChD2X,EAAeC,SAAS9N,SAASyM,EAAMG,EAAOD,GAG9CjR,EAAOpG,UAAU0K,SAASnM,KAAKqC,KAAMuW,EAAMG,EAAOD,IAGjEkB,EAAevY,UAAU2X,MAAQ,SAAUc,GACvC,IAAIR,EAAUrX,KAAKqX,QACnB,GAAIrX,KAAKgP,OACLqI,EAAQ5S,KAAKoT,OADjB,CAIA,IAAIzU,EACJpD,KAAKgP,QAAS,EACd,GACI,GAAI5L,EAAQyU,EAAOZ,QAAQY,EAAOpB,MAAOoB,EAAOnB,OAC5C,YAECmB,EAASR,EAAQhI,SAE1B,GADArP,KAAKgP,QAAS,EACV5L,EAAO,CACP,KAAOyU,EAASR,EAAQhI,SACpBwI,EAAO7T,cAEX,MAAMZ,KAGPuU,EAnDwB,CAoDjCJ,ICpDS,GAAsB,IAAI,GAAe,ICOpD,SAASO,GAAS3P,GACd,IAAI/E,EAAQ+E,EAAG/E,MAAoB+E,EAAGlC,WAC3B7C,MAAMA,GNHlB+S,KAAqBA,GAAmB,IAC3C,IAAI,GAA8B,WAC9B,SAAS4B,EAAaC,EAAMvZ,EAAO2E,GAC/BpD,KAAKgY,KAAOA,EACZhY,KAAKvB,MAAQA,EACbuB,KAAKoD,MAAQA,EACbpD,KAAKuM,SAAoB,MAATyL,EAyDpB,OAvDAD,EAAa3Y,UAAU6Y,QAAU,SAAU/P,GACvC,OAAQlI,KAAKgY,MACT,IAAK,IACD,OAAO9P,EAAS/E,MAAQ+E,EAAS/E,KAAKnD,KAAKvB,OAC/C,IAAK,IACD,OAAOyJ,EAAS9E,OAAS8E,EAAS9E,MAAMpD,KAAKoD,OACjD,IAAK,IACD,OAAO8E,EAAS5E,UAAY4E,EAAS5E,aAGjDyU,EAAa3Y,UAAU8Y,GAAK,SAAU/U,EAAMC,EAAOE,GAE/C,OADWtD,KAAKgY,MAEZ,IAAK,IACD,OAAO7U,GAAQA,EAAKnD,KAAKvB,OAC7B,IAAK,IACD,OAAO2E,GAASA,EAAMpD,KAAKoD,OAC/B,IAAK,IACD,OAAOE,GAAYA,MAG/ByU,EAAa3Y,UAAU+Y,OAAS,SAAUpQ,EAAgB3E,EAAOE,GAC7D,OAAIyE,GAAiD,mBAAxBA,EAAe5E,KACjCnD,KAAKiY,QAAQlQ,GAGb/H,KAAKkY,GAAGnQ,EAAgB3E,EAAOE,IAG9CyU,EAAa3Y,UAAUgZ,aAAe,WAClC,IM7CmBhV,EAAO8G,EN8C1B,OADWlK,KAAKgY,MAEZ,IAAK,IACD,OAAO5N,EAAGpK,KAAKvB,OACnB,IAAK,IACD,OMlDW2E,ENkDOpD,KAAKoD,MM7CxB,IAAI,EAJV8G,EAIqB,SAAUjE,GAAc,OAAOiE,EAAUJ,SAASgO,GAAU,EAAG,CAAE1U,MAAOA,EAAO6C,WAAYA,KAH3F,SAAUA,GAAc,OAAOA,EAAW7C,MAAMA,KNiDlE,IAAK,IACD,OAAO,IAEf,MAAM,IAAIR,MAAM,uCAEpBmV,EAAaM,WAAa,SAAU5Z,GAChC,YAAqB,IAAVA,EACA,IAAIsZ,EAAa,IAAKtZ,GAE1BsZ,EAAaO,4BAExBP,EAAaQ,YAAc,SAAUxV,GACjC,OAAO,IAAIgV,EAAa,SAAKpV,EAAWI,IAE5CgV,EAAaS,eAAiB,WAC1B,OAAOT,EAAaU,sBAExBV,EAAaU,qBAAuB,IAAIV,EAAa,KACrDA,EAAaO,2BAA6B,IAAIP,EAAa,SAAKpV,GACzDoV,EA9DsB,GOJ1B,SAAS,GAAMrB,EAAOxM,QACP,IAAdA,IACAA,EAAY,IAEhB,ICTmBzL,EDUfia,GCVeja,EDSQiY,aCRHgB,OAASiB,OAAOla,IDSPiY,EAAQxM,EAAUuN,MAASnS,KAAKsT,IAAIlC,GACrE,OAAO,SAAU7O,GAAU,OAAOA,EAAOF,KAAK,IAAIkR,GAAcH,EAAUxO,KAE9E,IAAI2O,GAA+B,WAC/B,SAASA,EAAcnC,EAAOxM,GAC1BlK,KAAK0W,MAAQA,EACb1W,KAAKkK,UAAYA,EAKrB,OAHA2O,EAAczZ,UAAUzB,KAAO,SAAUsI,EAAY4B,GACjD,OAAOA,EAAOL,UAAU,IAAI,GAAgBvB,EAAYjG,KAAK0W,MAAO1W,KAAKkK,aAEtE2O,EARuB,GAU9B,GAAiC,SAAUrT,GAE3C,SAASsT,EAAgB9S,EAAa0Q,EAAOxM,GACzC,IAAIvE,EAAQH,EAAO7H,KAAKqC,KAAMgG,IAAgBhG,KAM9C,OALA2F,EAAM+Q,MAAQA,EACd/Q,EAAMuE,UAAYA,EAClBvE,EAAMoT,MAAQ,GACdpT,EAAMqJ,QAAS,EACfrJ,EAAMwR,SAAU,EACTxR,EAkDX,OA1DA,EAAkBmT,EAAiBtT,GAUnCsT,EAAgBhB,SAAW,SAAUrB,GAKjC,IAJA,IAAI5O,EAAS4O,EAAM5O,OACfkR,EAAQlR,EAAOkR,MACf7O,EAAYuM,EAAMvM,UAClBlE,EAAcyQ,EAAMzQ,YACjB+S,EAAMtY,OAAS,GAAMsY,EAAM,GAAGC,KAAO9O,EAAUuN,OAAU,GAC5DsB,EAAM1J,QAAQ4J,aAAahB,QAAQjS,GAEvC,GAAI+S,EAAMtY,OAAS,EAAG,CAClB,IAAIyY,EAAU5T,KAAK6T,IAAI,EAAGJ,EAAM,GAAGC,KAAO9O,EAAUuN,OACpDzX,KAAK8J,SAAS2M,EAAOyC,QAGrBlZ,KAAKgE,cACL6D,EAAOmH,QAAS,GAGxB8J,EAAgB1Z,UAAUga,UAAY,SAAUlP,GAC5ClK,KAAKgP,QAAS,EACIhP,KAAKgG,YACXtB,IAAIwF,EAAUJ,SAASgP,EAAgBhB,SAAU9X,KAAK0W,MAAO,CACrE7O,OAAQ7H,KAAMgG,YAAahG,KAAKgG,YAAakE,UAAWA,MAGhE4O,EAAgB1Z,UAAUia,qBAAuB,SAAUJ,GACvD,IAAqB,IAAjBjZ,KAAKmX,QAAT,CAGA,IAAIjN,EAAYlK,KAAKkK,UACjBtG,EAAU,IAAI0V,GAAapP,EAAUuN,MAAQzX,KAAK0W,MAAOuC,GAC7DjZ,KAAK+Y,MAAMtU,KAAKb,IACI,IAAhB5D,KAAKgP,QACLhP,KAAKoZ,UAAUlP,KAGvB4O,EAAgB1Z,UAAU8G,MAAQ,SAAUzH,GACxCuB,KAAKqZ,qBAAqB,GAAahB,WAAW5Z,KAEtDqa,EAAgB1Z,UAAU+G,OAAS,SAAUpD,GACzC/C,KAAKmX,SAAU,EACfnX,KAAK+Y,MAAQ,GACb/Y,KAAKgG,YAAY5C,MAAML,GACvB/C,KAAKgE,eAET8U,EAAgB1Z,UAAUgH,UAAY,WAClCpG,KAAKqZ,qBAAqB,GAAab,kBACvCxY,KAAKgE,eAEF8U,EA3DyB,CA4DlC,GACEQ,GAA8B,WAK9B,OAJA,SAAsBN,EAAMC,GACxBjZ,KAAKgZ,KAAOA,EACZhZ,KAAKiZ,aAAeA,GAHK,GEnF1B,SAASM,GAAYC,EAAiB5M,GACzC,OAAOA,EAAiBqJ,IAAU,WAAc,OAAOuD,IAAoB5M,GAAkBqJ,IAAU,WAAc,OAAOuD,KCAzH,SAASC,GAAKC,EAAaC,GAC9B,IAAIC,GAAU,EAId,OAHIpZ,UAAUC,QAAU,IACpBmZ,GAAU,GAEP,SAA8B/R,GACjC,OAAOA,EAAOF,KAAK,IAAIkS,GAAaH,EAAaC,EAAMC,KAG/D,IAAIC,GAA8B,WAC9B,SAASA,EAAaH,EAAaC,EAAMC,QACrB,IAAZA,IACAA,GAAU,GAEd5Z,KAAK0Z,YAAcA,EACnB1Z,KAAK2Z,KAAOA,EACZ3Z,KAAK4Z,QAAUA,EAKnB,OAHAC,EAAaza,UAAUzB,KAAO,SAAUsI,EAAY4B,GAChD,OAAOA,EAAOL,UAAU,IAAI,GAAevB,EAAYjG,KAAK0Z,YAAa1Z,KAAK2Z,KAAM3Z,KAAK4Z,WAEtFC,EAZsB,GAc7B,GAAgC,SAAUrU,GAE1C,SAASsU,EAAe9T,EAAa0T,EAAaK,EAAOH,GACrD,IAAIjU,EAAQH,EAAO7H,KAAKqC,KAAMgG,IAAgBhG,KAK9C,OAJA2F,EAAM+T,YAAcA,EACpB/T,EAAMoU,MAAQA,EACdpU,EAAMiU,QAAUA,EAChBjU,EAAMtB,MAAQ,EACPsB,EAkCX,OAzCA,EAAkBmU,EAAgBtU,GASlCtH,OAAOC,eAAe2b,EAAe1a,UAAW,OAAQ,CACpDf,IAAK,WACD,OAAO2B,KAAK+Z,OAEhBC,IAAK,SAAUvb,GACXuB,KAAK4Z,SAAU,EACf5Z,KAAK+Z,MAAQtb,GAEjBL,YAAY,EACZ6b,cAAc,IAElBH,EAAe1a,UAAU8G,MAAQ,SAAUzH,GACvC,GAAKuB,KAAK4Z,QAKN,OAAO5Z,KAAKiP,SAASxQ,GAJrBuB,KAAK2Z,KAAOlb,EACZuB,KAAKgG,YAAY7C,KAAK1E,IAM9Bqb,EAAe1a,UAAU6P,SAAW,SAAUxQ,GAC1C,IACIqM,EADAzG,EAAQrE,KAAKqE,QAEjB,IACIyG,EAAS9K,KAAK0Z,YAAY1Z,KAAK2Z,KAAMlb,EAAO4F,GAEhD,MAAOtB,GACH/C,KAAKgG,YAAY5C,MAAML,GAE3B/C,KAAK2Z,KAAO7O,EACZ9K,KAAKgG,YAAY7C,KAAK2H,IAEnBgP,EA1CwB,CA2CjC,GClEE,GAA6B,SAAUtU,GAEvC,SAAS0U,EAAYhQ,EAAWqM,GAC5B,IAAI5Q,EAAQH,EAAO7H,KAAKqC,KAAMkK,EAAWqM,IAASvW,KAGlD,OAFA2F,EAAMuE,UAAYA,EAClBvE,EAAM4Q,KAAOA,EACN5Q,EA4BX,OAjCA,EAAkBuU,EAAa1U,GAO/B0U,EAAY9a,UAAU0K,SAAW,SAAU2M,EAAOC,GAI9C,YAHc,IAAVA,IACAA,EAAQ,GAERA,EAAQ,EACDlR,EAAOpG,UAAU0K,SAASnM,KAAKqC,KAAMyW,EAAOC,IAEvD1W,KAAK0W,MAAQA,EACb1W,KAAKyW,MAAQA,EACbzW,KAAKkK,UAAU6M,MAAM/W,MACdA,OAEXka,EAAY9a,UAAU6X,QAAU,SAAUR,EAAOC,GAC7C,OAAQA,EAAQ,GAAK1W,KAAKkD,OACtBsC,EAAOpG,UAAU6X,QAAQtZ,KAAKqC,KAAMyW,EAAOC,GAC3C1W,KAAKkX,SAAST,EAAOC,IAE7BwD,EAAY9a,UAAUyX,eAAiB,SAAU3M,EAAWyM,EAAID,GAI5D,YAHc,IAAVA,IACAA,EAAQ,GAEG,OAAVA,GAAkBA,EAAQ,GAAiB,OAAVA,GAAkB1W,KAAK0W,MAAQ,EAC1DlR,EAAOpG,UAAUyX,eAAelZ,KAAKqC,KAAMkK,EAAWyM,EAAID,GAE9DxM,EAAU6M,MAAM/W,OAEpBka,EAlCqB,CAmC9B,ICnCSnB,GAAsB,ICAG,SAAUvT,GAE1C,SAAS2U,IACL,OAAkB,OAAX3U,GAAmBA,EAAO9E,MAAMV,KAAMQ,YAAcR,KAE/D,OAJA,EAAkBma,EAAgB3U,GAI3B2U,EALwB,CAMjC,IDN+B,CAAmB,IEC7C,SAASC,GAAUlQ,EAAWwM,GAIjC,YAHc,IAAVA,IACAA,EAAQ,GAEL,SAAmC7O,GACtC,OAAOA,EAAOF,KAAK,IAAI0S,GAAkBnQ,EAAWwM,KAG5D,IAAI2D,GAAmC,WACnC,SAASA,EAAkBnQ,EAAWwM,QACpB,IAAVA,IACAA,EAAQ,GAEZ1W,KAAKkK,UAAYA,EACjBlK,KAAK0W,MAAQA,EAKjB,OAHA2D,EAAkBjb,UAAUzB,KAAO,SAAUsI,EAAY4B,GACrD,OAAOA,EAAOL,UAAU,IAAI,GAAoBvB,EAAYjG,KAAKkK,UAAWlK,KAAK0W,SAE9E2D,EAX2B,GAclC,GAAqC,SAAU7U,GAE/C,SAAS8U,EAAoBtU,EAAakE,EAAWwM,QACnC,IAAVA,IACAA,EAAQ,GAEZ,IAAI/Q,EAAQH,EAAO7H,KAAKqC,KAAMgG,IAAgBhG,KAG9C,OAFA2F,EAAMuE,UAAYA,EAClBvE,EAAM+Q,MAAQA,EACP/Q,EAsBX,OA9BA,EAAkB2U,EAAqB9U,GAUvC8U,EAAoBxC,SAAW,SAAUyC,GACrC,IAAItB,EAAesB,EAAItB,aAAcjT,EAAcuU,EAAIvU,YACvDiT,EAAahB,QAAQjS,GACrBhG,KAAKgE,eAETsW,EAAoBlb,UAAUob,gBAAkB,SAAUvB,GACpCjZ,KAAKgG,YACXtB,IAAI1E,KAAKkK,UAAUJ,SAASwQ,EAAoBxC,SAAU9X,KAAK0W,MAAO,IAAI+D,GAAiBxB,EAAcjZ,KAAKgG,gBAE9HsU,EAAoBlb,UAAU8G,MAAQ,SAAUzH,GAC5CuB,KAAKwa,gBAAgB,GAAanC,WAAW5Z,KAEjD6b,EAAoBlb,UAAU+G,OAAS,SAAUpD,GAC7C/C,KAAKwa,gBAAgB,GAAajC,YAAYxV,IAC9C/C,KAAKgE,eAETsW,EAAoBlb,UAAUgH,UAAY,WACtCpG,KAAKwa,gBAAgB,GAAahC,kBAClCxY,KAAKgE,eAEFsW,EA/B6B,CAgCtC,GAEEG,GAAkC,WAKlC,OAJA,SAA0BxB,EAAcjT,GACpChG,KAAKiZ,aAAeA,EACpBjZ,KAAKgG,YAAcA,GAHU,GCpDjC,GAA+B,SAAUR,GAEzC,SAASkV,EAAcC,EAAYC,EAAY1Q,QACxB,IAAfyQ,IACAA,EAAahM,OAAOC,wBAEL,IAAfgM,IACAA,EAAajM,OAAOC,mBAExB,IAAIjJ,EAAQH,EAAO7H,KAAKqC,OAASA,KAajC,OAZA2F,EAAMuE,UAAYA,EAClBvE,EAAMkV,QAAU,GAChBlV,EAAMmV,qBAAsB,EAC5BnV,EAAMoV,YAAcJ,EAAa,EAAI,EAAIA,EACzChV,EAAMqV,YAAcJ,EAAa,EAAI,EAAIA,EACrCA,IAAejM,OAAOC,mBACtBjJ,EAAMmV,qBAAsB,EAC5BnV,EAAMxC,KAAOwC,EAAMsV,wBAGnBtV,EAAMxC,KAAOwC,EAAMuV,eAEhBvV,EA4EX,OAjGA,EAAkB+U,EAAelV,GAuBjCkV,EAActb,UAAU6b,uBAAyB,SAAUxc,GACvD,IAAIoc,EAAU7a,KAAK6a,QACnBA,EAAQpW,KAAKhG,GACToc,EAAQpa,OAAST,KAAK+a,aACtBF,EAAQxL,QAEZ7J,EAAOpG,UAAU+D,KAAKxF,KAAKqC,KAAMvB,IAErCic,EAActb,UAAU8b,eAAiB,SAAUzc,GAC/CuB,KAAK6a,QAAQpW,KAAK,IAAI0W,GAAYnb,KAAKob,UAAW3c,IAClDuB,KAAKqb,2BACL7V,EAAOpG,UAAU+D,KAAKxF,KAAKqC,KAAMvB,IAErCic,EAActb,UAAUsI,WAAa,SAAUzB,GAC3C,IAIIrB,EAJAkW,EAAsB9a,KAAK8a,oBAC3BD,EAAUC,EAAsB9a,KAAK6a,QAAU7a,KAAKqb,2BACpDnR,EAAYlK,KAAKkK,UACjBpI,EAAM+Y,EAAQpa,OAElB,GAAIT,KAAKkD,OACL,MAAM,IAAI6F,EAYd,GAVS/I,KAAK+F,WAAa/F,KAAKuJ,SAC5B3E,EAAe,EAAaC,OAG5B7E,KAAKmJ,UAAU1E,KAAKwB,GACpBrB,EAAe,IAAI,EAAoB5E,KAAMiG,IAE7CiE,GACAjE,EAAWvB,IAAIuB,EAAa,IAAI,GAAoBA,EAAYiE,IAEhE4Q,EACA,IAAK,IAAItd,EAAI,EAAGA,EAAIsE,IAAQmE,EAAW/C,OAAQ1F,IAC3CyI,EAAW9C,KAAK0X,EAAQrd,SAI5B,IAASA,EAAI,EAAGA,EAAIsE,IAAQmE,EAAW/C,OAAQ1F,IAC3CyI,EAAW9C,KAAK0X,EAAQrd,GAAGiB,OASnC,OANIuB,KAAKuJ,SACLtD,EAAW7C,MAAMpD,KAAKwJ,aAEjBxJ,KAAK+F,WACVE,EAAW3C,WAERsB,GAEX8V,EAActb,UAAUgc,QAAU,WAC9B,OAAQpb,KAAKkK,WAAa6O,IAAOtB,OAErCiD,EAActb,UAAUic,yBAA2B,WAO/C,IANA,IAAI5D,EAAMzX,KAAKob,UACXL,EAAc/a,KAAK+a,YACnBC,EAAchb,KAAKgb,YACnBH,EAAU7a,KAAK6a,QACfS,EAAcT,EAAQpa,OACtB8a,EAAc,EACXA,EAAcD,KACZ7D,EAAMoD,EAAQU,GAAavC,KAAQgC,IAGxCO,IAQJ,OANID,EAAcP,IACdQ,EAAcjW,KAAK6T,IAAIoC,EAAaD,EAAcP,IAElDQ,EAAc,GACdV,EAAQ3V,OAAO,EAAGqW,GAEfV,GAEJH,EAlGuB,CAmGhC,GAEES,GAA6B,WAK7B,OAJA,SAAqBnC,EAAMva,GACvBuB,KAAKgZ,KAAOA,EACZhZ,KAAKvB,MAAQA,GAHW,GC3GzB,SAAS+c,GAAYC,EAAoBb,EAAY1Q,GACxD,IAAIwR,EAYJ,OAVIA,EADAD,GAAoD,iBAAvBA,EACpBA,EAGA,CACLd,WAAYc,EACZb,WAAYA,EACZe,UAAU,EACVzR,UAAWA,GAGZ,SAAUrC,GAAU,OAAOA,EAAOF,KAE7C,SAA6BQ,GACzB,IACIe,EAEAtE,EAHAyN,EAAKlK,EAAGwS,WAAYA,OAAoB,IAAPtI,EAAgB1D,OAAOC,kBAAoByD,EAAIuJ,EAAKzT,EAAGyS,WAAYA,OAAoB,IAAPgB,EAAgBjN,OAAOC,kBAAoBgN,EAAIC,EAAc1T,EAAGwT,SAAUzR,EAAY/B,EAAG+B,UAE1MyR,EAAW,EAEXpS,GAAW,EACXuS,GAAa,EACjB,OAAO,SAA8BjU,GACjC8T,IACKzS,IAAWK,IACZA,GAAW,EACXL,EAAU,IAAI,GAAcyR,EAAYC,EAAY1Q,GACpDtF,EAAeiD,EAAOL,UAAU,CAC5BrE,KAAM,SAAU1E,GAASyK,EAAQ/F,KAAK1E,IACtC2E,MAAO,SAAUL,GACbwG,GAAW,EACXL,EAAQ9F,MAAML,IAElBO,SAAU,WACNwY,GAAa,EACb5S,EAAQ5F,eAIpB,IAAIkL,EAAWtF,EAAQ1B,UAAUxH,MACjCA,KAAK0E,KAAI,WACLiX,IACAnN,EAASxK,cACLY,IAAiBkX,GAAcD,GAA4B,IAAbF,IAC9C/W,EAAaZ,cACbY,OAAejC,EACfuG,OAAUvG,OAjCwBoZ,CAAoBL,KCZ/D,SAASM,GAAMvd,GAClB,OAAO,SAAUoJ,GAAU,OAAOA,EAAOF,KAAK,IAAIsU,GAAcxd,KAEpE,IAAIwd,GAA+B,WAC/B,SAASA,EAAcxd,GACnBuB,KAAKvB,MAAQA,EAKjB,OAHAwd,EAAc7c,UAAUzB,KAAO,SAAUsI,EAAY4B,GACjD,OAAOA,EAAOL,UAAU,IAAI,GAAgBvB,EAAYjG,KAAKvB,SAE1Dwd,EAPuB,GAS9B,GAAiC,SAAUzW,GAE3C,SAAS0W,EAAgBlW,EAAavH,GAClC,IAAIkH,EAAQH,EAAO7H,KAAKqC,KAAMgG,IAAgBhG,KAE9C,OADA2F,EAAMlH,MAAQA,EACPkH,EAKX,OATA,EAAkBuW,EAAiB1W,GAMnC0W,EAAgB9c,UAAU8G,MAAQ,SAAUtF,GACxCZ,KAAKgG,YAAY7C,KAAKnD,KAAKvB,QAExByd,EAVyB,CAWlC,GCvBK,SAAS1X,KAEZ,IADA,IAAIkL,EAAc,GACTvI,EAAK,EAAGA,EAAK3G,UAAUC,OAAQ0G,IACpCuI,EAAYvI,GAAM3G,UAAU2G,GAEhC,OCLOmI,GAAS,EDKT6M,CAAY/R,EAAG1J,WAAM,EAAQgP,IELjC,SAAS0M,KAEZ,IADA,IAAIpS,EAAQ,GACH7C,EAAK,EAAGA,EAAK3G,UAAUC,OAAQ0G,IACpC6C,EAAM7C,GAAM3G,UAAU2G,GAE1B,IAAI+C,EAAYF,EAAMA,EAAMvJ,OAAS,GACrC,OAAIoJ,EAAYK,IACZF,EAAMM,MACC,SAAUzC,GAAU,OAAOrD,GAAOwF,EAAOnC,EAAQqC,KAGjD,SAAUrC,GAAU,OAAOrD,GAAOwF,EAAOnC,ICXjD,SAASwU,GAAqBC,EAASC,GAC1C,OAAO,SAAU1U,GAAU,OAAOA,EAAOF,KAAK,IAAI6U,GAA6BF,EAASC,KAE5F,IAAIC,GAA8C,WAC9C,SAASA,EAA6BF,EAASC,GAC3Cvc,KAAKsc,QAAUA,EACftc,KAAKuc,YAAcA,EAKvB,OAHAC,EAA6Bpd,UAAUzB,KAAO,SAAUsI,EAAY4B,GAChE,OAAOA,EAAOL,UAAU,IAAI,GAA+BvB,EAAYjG,KAAKsc,QAAStc,KAAKuc,eAEvFC,EARsC,GAU7C,GAAgD,SAAUhX,GAE1D,SAASiX,EAA+BzW,EAAasW,EAASC,GAC1D,IAAI5W,EAAQH,EAAO7H,KAAKqC,KAAMgG,IAAgBhG,KAM9C,OALA2F,EAAM4W,YAAcA,EACpB5W,EAAM+W,QAAS,EACQ,mBAAZJ,IACP3W,EAAM2W,QAAUA,GAEb3W,EAgCX,OAxCA,EAAkB8W,EAAgCjX,GAUlDiX,EAA+Brd,UAAUkd,QAAU,SAAU1b,EAAG+b,GAC5D,OAAO/b,IAAM+b,GAEjBF,EAA+Brd,UAAU8G,MAAQ,SAAUzH,GACvD,IAAIM,EACJ,IACI,IAAIwd,EAAcvc,KAAKuc,YACvBxd,EAAMwd,EAAcA,EAAY9d,GAASA,EAE7C,MAAOsE,GACH,OAAO/C,KAAKgG,YAAY5C,MAAML,GAElC,IAAI+H,GAAS,EACb,GAAI9K,KAAK0c,OACL,IAEI5R,GAASwR,EADKtc,KAAKsc,SACFtc,KAAKjB,IAAKA,GAE/B,MAAOgE,GACH,OAAO/C,KAAKgG,YAAY5C,MAAML,QAIlC/C,KAAK0c,QAAS,EAEb5R,IACD9K,KAAKjB,IAAMA,EACXiB,KAAKgG,YAAY7C,KAAK1E,KAGvBge,EAzCwC,CA0CjD,GCpDF,IC+CMG,GAAQpQ,GAAUqQ,SAAU,oBCjB3B,SAASC,GACdC,EAAkBC,GAElB,YAFkB,IAAAA,MAAA,UAEXA,EAAKC,cAAiBF,SAAapa,EAarC,SAASua,GACdH,EAAkBC,GAElB,YAFkB,IAAAA,MAAA,UAEX5a,MAAM4J,KAAKgR,EAAKG,iBAAoBJ,ICOtC,SAASK,GAAiBC,GAC/B,MAAO,CACLzc,EAAGyc,EAAGC,WACNX,EAAGU,EAAGE,WC9DH,SAAS,KACZ,OAAO,SAAkC1V,GACrC,OAAOA,EAAOF,KAAK,IAAI6V,GAAiB3V,KAGhD,IAAI2V,GAAkC,WAClC,SAASA,EAAiBC,GACtBzd,KAAKyd,YAAcA,EAYvB,OAVAD,EAAiBpe,UAAUzB,KAAO,SAAUsI,EAAY4B,GACpD,IAAI4V,EAAczd,KAAKyd,YACvBA,EAAYC,YACZ,IAAIC,EAAa,IAAI,GAAmB1X,EAAYwX,GAChD7Y,EAAeiD,EAAOL,UAAUmW,GAIpC,OAHKA,EAAWza,SACZya,EAAWC,WAAaH,EAAYI,WAEjCjZ,GAEJ4Y,EAd0B,GAgBjC,GAAoC,SAAUhY,GAE9C,SAASsY,EAAmB9X,EAAayX,GACrC,IAAI9X,EAAQH,EAAO7H,KAAKqC,KAAMgG,IAAgBhG,KAE9C,OADA2F,EAAM8X,YAAcA,EACb9X,EA0BX,OA9BA,EAAkBmY,EAAoBtY,GAMtCsY,EAAmB1e,UAAU+E,aAAe,WACxC,IAAIsZ,EAAczd,KAAKyd,YACvB,GAAKA,EAAL,CAIAzd,KAAKyd,YAAc,KACnB,IAAI9B,EAAW8B,EAAYC,UAC3B,GAAI/B,GAAY,EACZ3b,KAAK4d,WAAa,UAItB,GADAH,EAAYC,UAAY/B,EAAW,EAC/BA,EAAW,EACX3b,KAAK4d,WAAa,SADtB,CAIA,IAAIA,EAAa5d,KAAK4d,WAClBG,EAAmBN,EAAYO,YACnChe,KAAK4d,WAAa,MACdG,GAAsBH,GAAcG,IAAqBH,GACzDG,EAAiB/Z,oBAlBjBhE,KAAK4d,WAAa,MAqBnBE,EA/B4B,CAgCrC,GCjDE,GAAuC,SAAUtY,GAEjD,SAASyY,EAAsBpW,EAAQqW,GACnC,IAAIvY,EAAQH,EAAO7H,KAAKqC,OAASA,KAKjC,OAJA2F,EAAMkC,OAASA,EACflC,EAAMuY,eAAiBA,EACvBvY,EAAM+X,UAAY,EAClB/X,EAAMwY,aAAc,EACbxY,EA6BX,OApCA,EAAkBsY,EAAuBzY,GASzCyY,EAAsB7e,UAAUsI,WAAa,SAAUzB,GACnD,OAAOjG,KAAKoe,aAAa5W,UAAUvB,IAEvCgY,EAAsB7e,UAAUgf,WAAa,WACzC,IAAIlV,EAAUlJ,KAAKqe,SAInB,OAHKnV,IAAWA,EAAQnD,YACpB/F,KAAKqe,SAAWre,KAAKke,kBAElBle,KAAKqe,UAEhBJ,EAAsB7e,UAAUye,QAAU,WACtC,IAAID,EAAa5d,KAAKge,YAWtB,OAVKJ,IACD5d,KAAKme,aAAc,GACnBP,EAAa5d,KAAKge,YAAc,IAAI,GACzBtZ,IAAI1E,KAAK6H,OACfL,UAAU,IAAI,GAAsBxH,KAAKoe,aAAcpe,QACxD4d,EAAW1a,SACXlD,KAAKge,YAAc,KACnBJ,EAAa,EAAa/Y,QAG3B+Y,GAEXK,EAAsB7e,UAAUuc,SAAW,WACvC,OAAO,KAAsB3b,OAE1Bie,EArC+B,CAsCxC,GAESK,GAAgD,WACvD,IAAIC,EAAmB,GAAsBnf,UAC7C,MAAO,CACHwI,SAAU,CAAEnJ,MAAO,MACnBif,UAAW,CAAEjf,MAAO,EAAG+f,UAAU,GACjCH,SAAU,CAAE5f,MAAO,KAAM+f,UAAU,GACnCR,YAAa,CAAEvf,MAAO,KAAM+f,UAAU,GACtC9W,WAAY,CAAEjJ,MAAO8f,EAAiB7W,YACtCyW,YAAa,CAAE1f,MAAO8f,EAAiBJ,YAAaK,UAAU,GAC9DJ,WAAY,CAAE3f,MAAO8f,EAAiBH,YACtCP,QAAS,CAAEpf,MAAO8f,EAAiBV,SACnClC,SAAU,CAAEld,MAAO8f,EAAiB5C,WAXe,GAcvD,GAAuC,SAAUnW,GAEjD,SAASiZ,EAAsBzY,EAAayX,GACxC,IAAI9X,EAAQH,EAAO7H,KAAKqC,KAAMgG,IAAgBhG,KAE9C,OADA2F,EAAM8X,YAAcA,EACb9X,EAwBX,OA5BA,EAAkB8Y,EAAuBjZ,GAMzCiZ,EAAsBrf,UAAU+G,OAAS,SAAUpD,GAC/C/C,KAAKmE,eACLqB,EAAOpG,UAAU+G,OAAOxI,KAAKqC,KAAM+C,IAEvC0b,EAAsBrf,UAAUgH,UAAY,WACxCpG,KAAKyd,YAAYU,aAAc,EAC/Bne,KAAKmE,eACLqB,EAAOpG,UAAUgH,UAAUzI,KAAKqC,OAEpCye,EAAsBrf,UAAU+E,aAAe,WAC3C,IAAIsZ,EAAczd,KAAKyd,YACvB,GAAIA,EAAa,CACbzd,KAAKyd,YAAc,KACnB,IAAIG,EAAaH,EAAYO,YAC7BP,EAAYC,UAAY,EACxBD,EAAYY,SAAW,KACvBZ,EAAYO,YAAc,KACtBJ,GACAA,EAAW5Z,gBAIhBya,EA7B+B,CA8BxC,GCrEF,IAAIC,GAAmC,WACnC,SAASA,EAAkBR,EAAgBnB,GACvC/c,KAAKke,eAAiBA,EACtBle,KAAK+c,SAAWA,EASpB,OAPA2B,EAAkBtf,UAAUzB,KAAO,SAAUsI,EAAY4B,GACrD,IAAIkV,EAAW/c,KAAK+c,SAChB7T,EAAUlJ,KAAKke,iBACftZ,EAAemY,EAAS7T,GAAS1B,UAAUvB,GAE/C,OADArB,EAAaF,IAAImD,EAAOL,UAAU0B,IAC3BtE,GAEJ8Z,EAZ2B,GClBtC,SAASC,KACL,OAAO,IAAI,EAER,SAASC,KACZ,OAAO,SAAU/W,GAAU,OAAO,MDNZgX,ECMiCF,GDLhD,SAAmC9W,GACtC,IAAIqW,EASJ,GAPIA,EADmC,mBAA5BW,EACUA,EAGA,WACb,OAAOA,GAGS,mBAAb9B,EACP,OAAOlV,EAAOF,KAAK,IAAI+W,GAAkBR,EAAgBnB,IAE7D,IAAIU,EAAcvf,OAAOY,OAAO+I,EAAQyW,IAGxC,OAFAb,EAAY5V,OAASA,EACrB4V,EAAYS,eAAiBA,EACtBT,ICXiE5V,IDNzE,IAAmBgX,EAAyB9B,GE8BnD,IAAM+B,GAActS,GAA2B/M,OAAQ,cAKjDsf,GAAYvS,GAAyB/M,OAAQ,YCD5C,SAASuf,GAAWC,GACzB,IAAMC,EAAQC,WAAWF,GACzB,OCjCK,SAASG,EAAiBC,EAAYC,EAAe1S,GACxD,OAAIA,EACOwS,EAAiBC,EAAYC,GAAerY,KAAKpD,GAAI,SAAUwG,GAAQ,OAAO9G,EAAQ8G,GAAQuC,EAAelM,WAAM,EAAQ2J,GAAQuC,EAAevC,OAEtJ,IAAI,GAAW,SAAUpE,GAC5B,IAOIsZ,EAPAxS,EAAU,WAEV,IADA,IAAI7M,EAAI,GACCiH,EAAK,EAAGA,EAAK3G,UAAUC,OAAQ0G,IACpCjH,EAAEiH,GAAM3G,UAAU2G,GAEtB,OAAOlB,EAAW9C,KAAkB,IAAbjD,EAAEO,OAAeP,EAAE,GAAKA,IAGnD,IACIqf,EAAWF,EAAWtS,GAE1B,MAAOhK,GAEH,YADAkD,EAAW7C,MAAML,GAGrB,GAAKP,EAAW8c,GAGhB,OAAO,WAAc,OAAOA,EAAcvS,EAASwS,ODUlDH,EAA0B,SAAAjc,GAC/B,OAAA+b,EAAM1R,aAAY,WAAM,OAAArK,EAAK+b,EAAMM,eAElCvY,KACCmV,GAAU8C,EAAMM,SAChBhE,GAAY,IEXlB,IAAM,GAAUhP,GAAmB/M,OAAQ,UAKrCggB,GAAUjT,GAAmB/M,OAAQ,UA+BpC,SAASigB,KACd,MAAO,CACL9e,EAAG+e,YACHhD,EAAGiD,aASA,SAASC,KACd,MAAO,CACLC,MAAQC,WACRC,OAAQC,aC/EL,IAAIC,GAAwB,CAC/BC,SAAS,EACTC,UAAU,GAQd,IAAIC,GAAkC,WAClC,SAASA,EAAiBC,EAAkBH,EAASC,GACjDpgB,KAAKsgB,iBAAmBA,EACxBtgB,KAAKmgB,QAAUA,EACfngB,KAAKogB,SAAWA,EAKpB,OAHAC,EAAiBjhB,UAAUzB,KAAO,SAAUsI,EAAY4B,GACpD,OAAOA,EAAOL,UAAU,IAAI,GAAmBvB,EAAYjG,KAAKsgB,iBAAkBtgB,KAAKmgB,QAASngB,KAAKogB,YAElGC,EAT0B,GAWjC,GAAoC,SAAU7a,GAE9C,SAAS+a,EAAmBva,EAAasa,EAAkBE,EAAUC,GACjE,IAAI9a,EAAQH,EAAO7H,KAAKqC,KAAMgG,IAAgBhG,KAM9C,OALA2F,EAAMK,YAAcA,EACpBL,EAAM2a,iBAAmBA,EACzB3a,EAAM6a,SAAWA,EACjB7a,EAAM8a,UAAYA,EAClB9a,EAAM+a,WAAY,EACX/a,EAsDX,OA9DA,EAAkB4a,EAAoB/a,GAUtC+a,EAAmBnhB,UAAU8G,MAAQ,SAAUzH,GAC3CuB,KAAK0gB,WAAY,EACjB1gB,KAAK2gB,WAAaliB,EACbuB,KAAK4gB,aACF5gB,KAAKwgB,SACLxgB,KAAKkS,OAGLlS,KAAK6gB,SAASpiB,KAI1B8hB,EAAmBnhB,UAAU8S,KAAO,WAChC,IAAewO,EAAN1gB,KAAqB0gB,UAAWC,EAAhC3gB,KAAgD2gB,WACrDD,IACA1gB,KAAKgG,YAAY7C,KAAKwd,GACtB3gB,KAAK6gB,SAASF,IAElB3gB,KAAK0gB,WAAY,EACjB1gB,KAAK2gB,WAAa,MAEtBJ,EAAmBnhB,UAAUyhB,SAAW,SAAUpiB,GAC9C,IAAIqiB,EAAW9gB,KAAK+gB,oBAAoBtiB,GAClCqiB,GACF9gB,KAAK0E,IAAI1E,KAAK4gB,WAAazS,GAAkBnO,KAAM8gB,KAG3DP,EAAmBnhB,UAAU2hB,oBAAsB,SAAUtiB,GACzD,IACI,OAAOuB,KAAKsgB,iBAAiB7hB,GAEjC,MAAOsE,GAEH,OADA/C,KAAKgG,YAAY5C,MAAML,GAChB,OAGfwd,EAAmBnhB,UAAU4hB,eAAiB,WAC1C,IAAeJ,EAAN5gB,KAAsB4gB,WAAYH,EAAlCzgB,KAAiDygB,UACtDG,GACAA,EAAW5c,cAEfhE,KAAK4gB,WAAa,KACdH,GACAzgB,KAAKkS,QAGbqO,EAAmBnhB,UAAU4O,WAAa,SAAUF,EAAYQ,EAAYP,EAAYQ,EAAYC,GAChGxO,KAAKghB,kBAETT,EAAmBnhB,UAAU8O,eAAiB,WAC1ClO,KAAKghB,kBAEFT,EA/D4B,CAgErC,ICvBK,SAASU,GACdC,EAAgB,G,ID3DOZ,EAAkB5E,EC2DvByF,EAAA,EAAAA,MAIZC,EAAQ5U,GAAU0U,EAAQ,WAC7Bja,KACCuO,GAAgB,QAChBoJ,MAIJ,OAAOuC,EACJla,MDvEoBqZ,ECwEV,WAAM,OAAAc,QDvEF,KADwB1F,ECwEf,CAAEyE,SAAS,EAAMC,UAAU,MDtE/C1E,EAASwE,IAEN,SAAUrY,GAAU,OAAOA,EAAOF,KAAK,IAAI0Y,GAAiBC,EAAkB5E,EAAOyE,QAASzE,EAAO0E,aCqE1GlL,IAAI,SAAAtR,GAAW,OAAAsd,EAAOG,YAAYzd,MAClC2V,GAAY6H,GACZxC,MChFN,IAAI,GAAsC,SAAUpZ,GAEhD,SAAS8b,EAAqBpX,EAAWqM,GACrC,IAAI5Q,EAAQH,EAAO7H,KAAKqC,KAAMkK,EAAWqM,IAASvW,KAGlD,OAFA2F,EAAMuE,UAAYA,EAClBvE,EAAM4Q,KAAOA,EACN5Q,EAyBX,OA9BA,EAAkB2b,EAAsB9b,GAOxC8b,EAAqBliB,UAAUyX,eAAiB,SAAU3M,EAAWyM,EAAID,GAIrE,YAHc,IAAVA,IACAA,EAAQ,GAEE,OAAVA,GAAkBA,EAAQ,EACnBlR,EAAOpG,UAAUyX,eAAelZ,KAAKqC,KAAMkK,EAAWyM,EAAID,IAErExM,EAAUmN,QAAQ5S,KAAKzE,MAChBkK,EAAUwB,YAAcxB,EAAUwB,UAAY6V,uBAAsB,WAAc,OAAOrX,EAAU6M,MAAM,YAEpHuK,EAAqBliB,UAAUwX,eAAiB,SAAU1M,EAAWyM,EAAID,GAIrE,QAHc,IAAVA,IACAA,EAAQ,GAEG,OAAVA,GAAkBA,EAAQ,GAAiB,OAAVA,GAAkB1W,KAAK0W,MAAQ,EACjE,OAAOlR,EAAOpG,UAAUwX,eAAejZ,KAAKqC,KAAMkK,EAAWyM,EAAID,GAEpC,IAA7BxM,EAAUmN,QAAQ5W,SAClB+gB,qBAAqB7K,GACrBzM,EAAUwB,eAAY/I,IAIvB2e,EA/B8B,CAgCvC,IChCSG,GAA+B,ICAG,SAAUjc,GAEnD,SAASkc,IACL,OAAkB,OAAXlc,GAAmBA,EAAO9E,MAAMV,KAAMQ,YAAcR,KAuB/D,OAzBA,EAAkB0hB,EAAyBlc,GAI3Ckc,EAAwBtiB,UAAU2X,MAAQ,SAAUc,GAChD7X,KAAKgP,QAAS,EACdhP,KAAK0L,eAAY/I,EACjB,IACIS,EADAiU,EAAUrX,KAAKqX,QAEfhT,GAAS,EACTwG,EAAQwM,EAAQ5W,OACpBoX,EAASA,GAAUR,EAAQhI,QAC3B,GACI,GAAIjM,EAAQyU,EAAOZ,QAAQY,EAAOpB,MAAOoB,EAAOnB,OAC5C,cAEGrS,EAAQwG,IAAUgN,EAASR,EAAQhI,UAE9C,GADArP,KAAKgP,QAAS,EACV5L,EAAO,CACP,OAASiB,EAAQwG,IAAUgN,EAASR,EAAQhI,UACxCwI,EAAO7T,cAEX,MAAMZ,IAGPse,EA1BiC,CA2B1C,ID3BwC,CAA4B,IEC/D,SAASC,GAASC,GACrB,OAAO,SAAU/Z,GAAU,OAAOA,EAAOF,KAAK,IAAIka,GAAgBD,KAEtE,ICwBIE,GDxBAD,GAAiC,WACjC,SAASA,EAAgBD,GACrB5hB,KAAK4hB,SAAWA,EAKpB,OAHAC,EAAgBziB,UAAUzB,KAAO,SAAUsI,EAAY4B,GACnD,OAAOA,EAAOL,UAAU,IAAI,GAAkBvB,EAAYjG,KAAK4hB,YAE5DC,EAPyB,GAShC,GAAmC,SAAUrc,GAE7C,SAASuc,EAAkB/b,EAAa4b,GACpC,IAAIjc,EAAQH,EAAO7H,KAAKqC,KAAMgG,IAAgBhG,KAE9C,OADA2F,EAAMjB,IAAI,IAAI,EAAakd,IACpBjc,EAEX,OANA,EAAkBoc,EAAmBvc,GAM9Buc,EAP2B,CAQpC,GEQK,SAASC,GACd3E,EAAiB5e,GAEjB4e,EAAG4E,aAAa,gBAAiBxjB,EAAQ,OAAS,IAQ7C,SAASyjB,GACd7E,GAEAA,EAAG8E,gBAAgB,iBAWd,SAASC,GACd/E,EAAiB5e,GAEjB4e,EAAGgF,UAAUC,OAAO,uBAAwB7jB,GAQvC,SAAS8jB,GACdlF,GAEAA,EAAGgF,UAAUje,OAAO,wBCRf,SAASoe,GACdnF,EAAiBoF,GAEjBpF,EAAGqF,YAAYD,GCnBV,SAASE,GACdtF,EAAiBuF,GAEjB,YAFiB,IAAAA,MAAA,GAEV3b,EACLpD,GAAI,SAAC,GAAU,OAAR,EAAA8Y,GAAaiG,KACpBvG,KAGAjC,GAAUqH,IACVvM,IAAI,SAAAzW,ICxBD,SACL4e,EAAiB5e,GAEjB4e,EAAG4E,aAAa,gBAAiBxjB,EAAQ,SAAW,IDsBhDokB,CAAUxF,EAAI5e,MAIhBkjB,IAAS,YClBN,SACLtE,GAEAA,EAAG8E,gBAAgB,iBDgBfW,CAAYzF,OHjBX,SAAS0F,GAAStkB,EAAeQ,GACtC,IAAIzB,EAAIyB,EACR,GAAIR,EAAMgC,OAASjD,EAAG,CACpB,KAAoB,MAAbiB,EAAMjB,MAAgBA,EAAI,IACjC,OAAUiB,EAAMoU,UAAU,EAAGrV,GAAE,MAEjC,OAAOiB,EAWF,SAASukB,GAAUjkB,EAAaN,GACrC,QAAoB,IAATqjB,GAAsB,CAC/B,IAAMzE,EAAKP,GAAW,WACtBgF,GAAO/O,KAAK2B,MAAM2I,EAAG4F,WAEvB,QAAyB,IAAdnB,GAAK/iB,GACd,MAAM,IAAImkB,eAAe,wBAAwBnkB,GAEnD,YAAwB,IAAVN,EACVqjB,GAAK/iB,GAAKokB,QAAQ,IAAK1kB,GACvBqjB,GAAK/iB,G,kgBKtBJ,SAASqkB,GACd/F,GAEA,OCjDoBgG,EDiDP,WACX,IAAMC,EAC8B,WADrBC,iBAAiBlG,GAC7BmG,iBAAiB,YAGpB,OAAOpZ,EAAG,CACRkZ,OAAM,EACNtD,OAAQsD,EAASjG,EAAGoG,aAAe,KCvD9B,IAAI,GAAW,SAAUxd,GAC5B,IAAIoB,EACJ,IACIA,EAAQgc,IAEZ,MAAOtgB,GAEH,YADAkD,EAAW7C,MAAML,GAIrB,OADasE,EAAQ2E,GAAK3E,GAAS,KACrBG,UAAUvB,MAXzB,IAAeod,ECGtB,IAAIK,GAAO,GACJ,SAASC,KAEZ,IADA,IAAIjU,EAAc,GACTvI,EAAK,EAAGA,EAAK3G,UAAUC,OAAQ0G,IACpCuI,EAAYvI,GAAM3G,UAAU2G,GAEhC,IAAIyF,EAAiB,KACjB1C,EAAY,KAUhB,OATIL,EAAY6F,EAAYA,EAAYjP,OAAS,MAC7CyJ,EAAYwF,EAAYpF,OAEuB,mBAAxCoF,EAAYA,EAAYjP,OAAS,KACxCmM,EAAiB8C,EAAYpF,OAEN,IAAvBoF,EAAYjP,QAAgB8C,EAAQmM,EAAY,MAChDA,EAAcA,EAAY,IAEvBvF,EAAUuF,EAAaxF,GAAWvC,KAAK,IAAIic,GAAsBhX,IAE5E,IAAIgX,GAAuC,WACvC,SAASA,EAAsBhX,GAC3B5M,KAAK4M,eAAiBA,EAK1B,OAHAgX,EAAsBxkB,UAAUzB,KAAO,SAAUsI,EAAY4B,GACzD,OAAOA,EAAOL,UAAU,IAAI,GAAwBvB,EAAYjG,KAAK4M,kBAElEgX,EAP+B,GAUtC,GAAyC,SAAUpe,GAEnD,SAASqe,EAAwB7d,EAAa4G,GAC1C,IAAIjH,EAAQH,EAAO7H,KAAKqC,KAAMgG,IAAgBhG,KAK9C,OAJA2F,EAAMiH,eAAiBA,EACvBjH,EAAMqJ,OAAS,EACfrJ,EAAMwG,OAAS,GACfxG,EAAM+J,YAAc,GACb/J,EAqDX,OA5DA,EAAkBke,EAAyBre,GAS3Cqe,EAAwBzkB,UAAU8G,MAAQ,SAAUa,GAChD/G,KAAKmM,OAAO1H,KAAKif,IACjB1jB,KAAK0P,YAAYjL,KAAKsC,IAE1B8c,EAAwBzkB,UAAUgH,UAAY,WAC1C,IAAIsJ,EAAc1P,KAAK0P,YACnB5N,EAAM4N,EAAYjP,OACtB,GAAY,IAARqB,EACA9B,KAAKgG,YAAY1C,eAEhB,CACDtD,KAAKgP,OAASlN,EACd9B,KAAK8jB,UAAYhiB,EACjB,IAAK,IAAItE,EAAI,EAAGA,EAAIsE,EAAKtE,IAAK,CAC1B,IAAIuJ,EAAa2I,EAAYlS,GAC7BwC,KAAK0E,IAAIyJ,GAAkBnO,KAAM+G,EAAYA,EAAYvJ,OAIrEqmB,EAAwBzkB,UAAU8O,eAAiB,SAAU6V,GAC9B,IAAtB/jB,KAAKgP,QAAU,IAChBhP,KAAKgG,YAAY1C,YAGzBugB,EAAwBzkB,UAAU4O,WAAa,SAAUF,EAAYQ,EAAYP,EAAYQ,EAAYC,GACrG,IAAIrC,EAASnM,KAAKmM,OACd6X,EAAS7X,EAAO4B,GAChB+V,EAAa9jB,KAAK8jB,UAEhBE,IAAWN,KAAS1jB,KAAK8jB,UAAY9jB,KAAK8jB,UAD1C,EAEN3X,EAAO4B,GAAcO,EACH,IAAdwV,IACI9jB,KAAK4M,eACL5M,KAAKikB,mBAAmB9X,GAGxBnM,KAAKgG,YAAY7C,KAAKgJ,EAAOzC,WAIzCma,EAAwBzkB,UAAU6kB,mBAAqB,SAAU9X,GAC7D,IAAIrB,EACJ,IACIA,EAAS9K,KAAK4M,eAAelM,MAAMV,KAAMmM,GAE7C,MAAOpJ,GAEH,YADA/C,KAAKgG,YAAY5C,MAAML,GAG3B/C,KAAKgG,YAAY7C,KAAK2H,IAEnB+Y,EA7DiC,CA8D1C,I,2RCrCK,SAASK,GACd7G,EAAiB,EAAqB,G,IAAnB8G,EAAA,EAAAA,SAAqBC,EAAA,EAAAA,QAIlCC,EAAUF,EAASG,MACtBrd,KACCsS,GAAY6K,GACZvgB,GAAI,SAAC,G,IAAEmc,EAAA,EAAAA,OAAa,OAAA3C,EAAGkH,UAAYvE,KACnC3D,MAIJ,OAAOsH,GAAc,CAACQ,EAASK,QAASH,IACrCpd,KACCpD,GAAI,SAAC,G,IAAA,UAAC,OAAsB,OAAGjD,EAAvB,EAAAA,EAA0B+b,EAAvB,EAAAA,EAAK,SAChBnB,GAAY,IC5BX,SAASiJ,GACdpH,GAEA,OAAOpW,GClD+BlI,EDmDZ,SClDjBsd,IAAqB,SAAUzb,EAAG+b,GAAK,OAAOL,EAAUA,EAAQ1b,EAAE7B,GAAM4d,EAAE5d,IAAQ6B,EAAE7B,KAAS4d,EAAE5d,ODqDtGqb,GAAUqH,IACVvM,IAAI,SAAC,G,IAAElG,EAAA,EAAAA,QEzBJ,SACLqO,EAAiB5e,GAEjB4e,EAAG4E,aAAa,gBAAiBxjB,EAAQ,SAAW,IFuBhDimB,CAAgBrH,EAAIrO,MAItB2S,IAAS,YEnBN,SACLtE,GAEAA,EAAG8E,gBAAgB,iBFiBfwC,CAAkBtH,OC7DjB,IAAiCte,EAAKud,E,sTEkD7C,SAASoG,GAAYrF,EAAiBoF,G,QAGpC,GAAqB,iBAAVA,GAAuC,iBAAVA,EACtCpF,EAAGuH,WAAanC,EAAMzhB,gBAGjB,GAAIyhB,aAAiBoC,KAC1BxH,EAAGqF,YAAYD,QAGV,GAAIrgB,MAAMmB,QAAQkf,G,IACvB,IAAmB,SAAAA,GAAK,+BACtBC,GAAYrF,EADC,U,kGAkBZ,SAASyH,GACdC,EAAaC,G,gBACb,oDAEA,IAAM3H,EAAKR,SAASoI,cAAcF,GAGlC,GAAIC,E,IACF,IAAmB,WAAKA,IAAW,+BAA9B,IAAME,EAAI,QACmB,kBAArBF,EAAWE,GACpB7H,EAAG4E,aAAaiD,EAAMF,EAAWE,IAC1BF,EAAWE,IAClB7H,EAAG4E,aAAaiD,EAAM,K,qGAG5B,IAAoB,SAAAC,GAAQ,+BAC1BzC,GAAYrF,EADE,U,iGAIhB,OAAOA,EC9FT,IAAI,GAAmC,WACnC,SAAS+H,EAAkBC,GACvBrlB,KAAKqlB,SAAWA,EAWpB,OATAD,EAAkBhmB,UAAUzB,KAAO,SAAUsI,EAAY4B,GACrD,IAAIyd,EAAsB,IAAI,GAAoBrf,GAC9Csf,EAAuBpX,GAAkBmX,EAAqBtlB,KAAKqlB,UACvE,OAAIE,IAAyBD,EAAoBE,WAC7CF,EAAoB5gB,IAAI6gB,GACjB1d,EAAOL,UAAU8d,IAErBA,GAEJF,EAb2B,GAelC,GAAqC,SAAU5f,GAE/C,SAASigB,EAAoBzf,GACzB,IAAIL,EAAQH,EAAO7H,KAAKqC,KAAMgG,IAAgBhG,KAE9C,OADA2F,EAAM6f,WAAY,EACX7f,EAQX,OAZA,EAAkB8f,EAAqBjgB,GAMvCigB,EAAoBrmB,UAAU4O,WAAa,SAAUF,EAAYQ,EAAYP,EAAYQ,EAAYC,GACjGxO,KAAKwlB,WAAY,EACjBxlB,KAAKsD,YAETmiB,EAAoBrmB,UAAU8O,eAAiB,aAExCuX,EAb6B,CActC,I,2RCeK,SAASC,GACdC,EAA8Bnb,GAE9B,IAAMob,EAASD,EAAQ1e,KAAK6N,IAAO,SAAArW,GAAU,OAAAA,MACvConB,EAASF,EAAQ1e,KAAK6N,IAAO,SAAArW,GAAS,OAACA,MAC7C,OAAOwI,EACLgP,IAAU,SAAAxX,GAAS,OAAAklB,GAAc,CAACvZ,EAAG3L,GAAQmnB,OAC7C3P,IAAU,SAAC,G,IDtDWoP,ECsDX,UAAC5mB,EAAA,KAAmB,OAAZ,KACf+L,EAAQ/L,GACLwI,MDxDeoe,ECyDJQ,EDxDX,SAAUhe,GAAU,OAAOA,EAAOF,KAAK,IAAI,GAAkB0d,OC0DhExgB,MC6BD,SAASihB,GACdC,EAAcpZ,GAGd,OAAO1F,EACLye,GAFM,EAAAxG,MAEY8G,SAAS,SAAA3I,GAAM,OAhC9B,SACLA,EAAiB0I,EAAc,GAU/B,OANgB7B,GAA6B7G,EAAI0I,EAAO,CAAE3B,QAJzB,EAAAA,UAK9Bnd,KACC0b,GAAYtF,EAAI,KAKjBpW,KACCpD,GAAI,SAAAoiB,GAAU,OAAGA,OAAM,OAmBQC,CAAU7I,EAAI0I,EAAOpZ,MACtD6O,GAAY,I,+RCiCT,SAAS2K,GACdJ,EAAcpZ,GAEd,OAAO1F,EACLgP,IAAU,SAAAoH,GAAM,OA3Db,SACLA,EAAiB,EAAqB,G,IAAnB8G,EAAA,EAAAA,SAIbE,EAJkC,EAAAD,QAKrCnd,KACCuO,GAAM,WAIJ4Q,EAAUzC,GAAc,CAC5BQ,EAASK,QACTL,EAASG,MACTD,IAECpd,KACCpD,GAAI,SAAC,G,IAAA,UAAG8Y,EAAA,KAAAA,EAAOqD,EAAA,KAAAA,OAAUqG,EAAA,KACjBC,EAASjJ,EAAGkH,UACZgC,EAASlJ,EAAGoG,aAAe6C,EACjC,OAAOtG,EACH1a,KAAK6T,IAAI,EAAGmN,EAAS3J,EAAI0J,GACzB/gB,KAAK6T,IAAI,EAAG6G,EAASrD,EAAI4J,MAE/BlK,MAIEmK,EAAU7C,GAAc,CAACQ,EAASK,QAASH,IAC9Cpd,KACCpD,GAAI,SAAC,G,IAAA,UAAG8Y,EAAA,KAAAA,EAAK0J,EAAA,KAAY,OAAA1J,GAAKU,EAAGkH,UAAY8B,KAC7ChK,MAIJ,OAAOsH,GAAc,CAACyC,EAAS/B,EAASmC,IACrCvf,KACCpD,GAAI,SAAC,G,IAAA,UAACmc,EAAA,KAAQqG,EAAA,KAAQrX,EAAA,KAAY,OAChC4T,OAAQvF,EAAGkH,UAAY8B,EACvBrG,OAAM,EACNhR,OAAM,OAmBMyX,CAAUpJ,EAAI0I,EAAOpZ,MACrC6O,GAAY,IC7HD,SAASkL,GAAQpmB,GAC9B,OAAO,SAASqmB,EAAGvmB,EAAG6B,GACpB,OAAQzB,UAAUC,QAChB,KAAK,EACH,OAAOkmB,EACT,KAAK,EACH,OAAOxmB,EAAeC,GAAKumB,EAAKtmB,GAAQ,SAAUgS,GAChD,OAAO/R,EAAGF,EAAGiS,MAEjB,QACE,OAAOlS,EAAeC,IAAMD,EAAe8B,GAAK0kB,EAAKxmB,EAAeC,GAAKC,GAAQ,SAAU8H,GACzF,OAAO7H,EAAG6H,EAAIlG,MACX9B,EAAe8B,GAAK5B,GAAQ,SAAUgS,GACzC,OAAO/R,EAAGF,EAAGiS,MACV/R,EAAGF,EAAG6B,KCzBJ,SAAS2kB,GAAmBC,GAGzC,IAFA,IACI1jB,EADA7B,EAAO,KAEF6B,EAAO0jB,EAAK1jB,QAAQqI,MAC3BlK,EAAKmD,KAAKtB,EAAK1E,OAEjB,OAAO6C,ECNM,SAASwlB,GAAcC,EAAMnmB,EAAGU,GAI7C,IAHA,IAAIE,EAAM,EACNM,EAAMR,EAAKb,OAERe,EAAMM,GAAK,CAChB,GAAIilB,EAAKnmB,EAAGU,EAAKE,IACf,OAAO,EAETA,GAAO,EAET,OAAO,ECGM,8CAZf,SAAmBpB,EAAG6B,GAEpB,OAAI7B,IAAM6B,EAGK,IAAN7B,GAAW,EAAIA,GAAM,EAAI6B,EAGzB7B,GAAMA,GAAK6B,GAAMA,GCqBb,GAHS5B,GAAQ,SAAc2mB,GAC5C,OAAe,OAARA,EAAe,YAAiBrkB,IAARqkB,EAAoB,YAAc9oB,OAAOkB,UAAU4B,SAASrD,KAAKqpB,GAAKtd,MAAM,GAAI,MCTjH,SAASud,GAAmBC,EAAWC,EAAWC,EAAQC,GACxD,IAAIjnB,EAAIwmB,GAAmBM,GAG3B,SAASI,EAAGnf,EAAIkK,GACd,OAAOkV,GAAQpf,EAAIkK,EAAI+U,EAAO1d,QAAS2d,EAAO3d,SAIhD,OAAQod,IAAc,SAAU7kB,EAAGulB,GACjC,OAAQV,GAAcQ,EAAIE,EAAOvlB,KAR3B2kB,GAAmBO,GASrB/mB,GAGO,SAASmnB,GAAQnnB,EAAG6B,EAAGmlB,EAAQC,GAC5C,GAAI,GAAUjnB,EAAG6B,GACf,OAAO,EAGT,ICtCoCwlB,EAEhCC,EDoCAC,EAAQ,GAAKvnB,GAEjB,GAAIunB,IAAU,GAAK1lB,GACjB,OAAO,EAGT,GAAS,MAAL7B,GAAkB,MAAL6B,EACf,OAAO,EAGT,GAAwC,mBAA7B7B,EAAE,wBAA6E,mBAA7B6B,EAAE,uBAC7D,MAA2C,mBAA7B7B,EAAE,wBAAyCA,EAAE,uBAAuB6B,IAA0C,mBAA7BA,EAAE,wBAAyCA,EAAE,uBAAuB7B,GAGrK,GAAwB,mBAAbA,EAAEwnB,QAA6C,mBAAb3lB,EAAE2lB,OAC7C,MAA2B,mBAAbxnB,EAAEwnB,QAAyBxnB,EAAEwnB,OAAO3lB,IAA0B,mBAAbA,EAAE2lB,QAAyB3lB,EAAE2lB,OAAOxnB,GAGrG,OAAQunB,GACN,IAAK,YACL,IAAK,QACL,IAAK,SACH,GAA6B,mBAAlBvnB,EAAEmC,aAA+D,aC5D5CklB,ED4DyBrnB,EAAEmC,YCzD/C,OADZmlB,EAAQG,OAAOJ,GAAGC,MAAM,oBACL,GAAKA,EAAM,ID0D5B,OAAOtnB,IAAM6B,EAEf,MACF,IAAK,UACL,IAAK,SACL,IAAK,SACH,UAAa7B,UAAa6B,IAAK,GAAU7B,EAAE0nB,UAAW7lB,EAAE6lB,WACtD,OAAO,EAET,MACF,IAAK,OACH,IAAK,GAAU1nB,EAAE0nB,UAAW7lB,EAAE6lB,WAC5B,OAAO,EAET,MACF,IAAK,QACH,OAAO1nB,EAAErC,OAASkE,EAAElE,MAAQqC,EAAEwD,UAAY3B,EAAE2B,QAC9C,IAAK,SACH,GAAMxD,EAAEyH,SAAW5F,EAAE4F,QAAUzH,EAAEN,SAAWmC,EAAEnC,QAAUM,EAAE2nB,aAAe9lB,EAAE8lB,YAAc3nB,EAAE4nB,YAAc/lB,EAAE+lB,WAAa5nB,EAAEkjB,SAAWrhB,EAAEqhB,QAAUljB,EAAE6nB,UAAYhmB,EAAEgmB,QAC/J,OAAO,EAMb,IADA,IAAIzmB,EAAM4lB,EAAO3mB,OAAS,EACnBe,GAAO,GAAG,CACf,GAAI4lB,EAAO5lB,KAASpB,EAClB,OAAOinB,EAAO7lB,KAASS,EAEzBT,GAAO,EAGT,OAAQmmB,GACN,IAAK,MACH,OAAIvnB,EAAE8nB,OAASjmB,EAAEimB,MAIVjB,GAAmB7mB,EAAE+nB,UAAWlmB,EAAEkmB,UAAWf,EAAO5iB,OAAO,CAACpE,IAAKinB,EAAO7iB,OAAO,CAACvC,KACzF,IAAK,MACH,OAAI7B,EAAE8nB,OAASjmB,EAAEimB,MAIVjB,GAAmB7mB,EAAE+L,SAAUlK,EAAEkK,SAAUib,EAAO5iB,OAAO,CAACpE,IAAKinB,EAAO7iB,OAAO,CAACvC,KACvF,IAAK,YACL,IAAK,QACL,IAAK,SACL,IAAK,UACL,IAAK,SACL,IAAK,SACL,IAAK,OACL,IAAK,QACL,IAAK,SACL,IAAK,YACL,IAAK,aACL,IAAK,oBACL,IAAK,aACL,IAAK,cACL,IAAK,aACL,IAAK,cACL,IAAK,eACL,IAAK,eACL,IAAK,cACH,MACF,QAEE,OAAO,EAGX,IAAImmB,EAAQ,EAAKhoB,GACjB,GAAIgoB,EAAM3nB,SAAW,EAAKwB,GAAGxB,OAC3B,OAAO,EAGT,IAAI4nB,EAAiBjB,EAAO5iB,OAAO,CAACpE,IAChCkoB,EAAiBjB,EAAO7iB,OAAO,CAACvC,IAGpC,IADAT,EAAM4mB,EAAM3nB,OAAS,EACde,GAAO,GAAG,CACf,IAAIzC,EAAMqpB,EAAM5mB,GAChB,IAAMX,EAAK9B,EAAKkD,KAAMslB,GAAQtlB,EAAElD,GAAMqB,EAAErB,GAAMspB,EAAgBC,GAC5D,OAAO,EAET9mB,GAAO,EAET,OAAO,EEvHT,IAGe,GAHWklB,IAAQ,SAAgBtmB,EAAG6B,GACnD,OAAOslB,GAAQnnB,EAAG6B,EAAG,GAAI,O,2RC6DpB,SAASsmB,GACdlL,EAAiB,EAAqB,G,IAAnB8G,EAAA,EAAAA,SAAqBqE,EAAA,EAAAA,MAIlCnC,EAASoC,WACblF,iBAAiBlG,EAAGqL,eACjBlF,iBAAiB,gBAIhB4C,EAAUzC,GAAc,CAACQ,EAASK,QAASgE,IAC9CvhB,KACCpD,GAAI,SAAC,G,IAAA,UAAG8Y,EAAA,KAAAA,EAAK,OAAEiG,EAAA,EAAAA,OACb,OADqB,EAAA5C,OACLqG,EAAS/gB,KAAKqjB,IAAItC,EAAQ/gB,KAAK6T,IAAI,EAAGwD,EAAIiG,QAK1DgG,EAAQjF,GAAc,CAACQ,EAASK,QAASgE,IAC5CvhB,KACCpD,GAAI,SAAC,G,IAAA,UAAwB,OAArB,KAAA8Y,GAAO,KAAAiG,OAA4ByD,MAI/C,OAAO1C,GAAc,CAACyC,EAASwC,IAC5B3hB,KACCpD,GAAI,SAAC,G,IAAA,UAAmB,OAAGmc,OAArB,KAA6B6I,KAArB,SACdxM,GAAmC,IACnCb,GAAY,IAaX,SAASsN,GACdzL,GAEA,OAAOpW,EAGLmT,GAAUqH,IACVvM,IAAI,SAAC,G,IAAE8K,EAAA,EAAAA,OAAQ6I,EAAA,EAAAA,MC3GZ,SACLxL,EAAiB5e,GAEjB4e,EAAG0L,MAAM/I,OAAYvhB,EAAK,KDyGtBuqB,CAAiB3L,EAAI2C,GCnFpB,SACL3C,EAAiB5e,GAEjB4e,EAAG4E,aAAa,gBAAiBxjB,EAAQ,OAAS,IDiF9CwqB,CAAe5L,EAAIwL,MAIrBlH,IAAS,YCtGN,SACLtE,GAEAA,EAAG0L,MAAM/I,OAAS,GDoGdkJ,CAAmB7L,GC9ElB,SACLA,GAEAA,EAAG8E,gBAAgB,iBD4EfgH,CAAiB9L,OElDhB,SAAS+L,GACdrD,EAAcpZ,GAGd,OAAO1F,EACLye,GAFM,EAAAxG,MAEY8G,SAAS,SAAA3I,GAAM,OAhC9B,SACLA,EAAiB0I,EAAc,GAU/B,OANiBwC,GAAalL,EAAI0I,EAAO,CAAEyC,MAJV,EAAAA,QAK9BvhB,KACC6hB,GAAazL,IAKdpW,KACCpD,GAAI,SAAAwlB,GAAW,OAAGA,QAAO,OAmBMC,CAAgBjM,EAAI0I,EAAOpZ,MAC5D6O,GAAY,I,+RCpCT,SAAS+N,GACdlM,EAAsB,G,IAAEmM,EAAA,EAAAA,QAexB,OAAO7F,GAAc,CAXNnX,GAAU6Q,EAAI,SAC1BpW,KACCpD,GAAI,WAAM,OAAA2lB,EAAQnM,EAAG5e,UACrB2d,GAAU,IACVC,MCxCC,SACLgB,GAEA,IAAMoM,EAASjd,GAAU6Q,EAAI,SACvBqM,EAASld,GAAU6Q,EAAI,QAG7B,OAAO5N,GACLga,EAAOxiB,KAAK+U,IAAM,IAClB0N,EAAMziB,KAAK+U,IAAM,KAEhB/U,KACCmV,GAAUiB,IAAOR,SAAS8M,eAC1BnO,GAAY,ID+BDoO,CAAkBvM,KAI9BpW,KACCpD,GAAI,SAAC,G,IAAA,UAAmB,OAAGpF,MAArB,KAA4BorB,MAArB,SACbrO,GAAY,IElDX,SAASsO,GACdzM,GAEA,OAAO7Q,GAAU6Q,EAAI,SAClBpW,KACC+U,QAAMrZ,ICRZ,IAAMonB,GAAM,CACVC,KAAS,yBACTC,QAAS,gEACTC,MAAS,0BACTC,OAAS,4BCJX,IAAM,GAAM,CACVH,KAAS,yBACTC,QAAS,4BACTC,MAAS,0BACTC,OAAS,4BAcJ,SAASC,GACd,G,IAAEC,EAAA,EAAAA,SAAUH,EAAA,EAAAA,MAAOI,EAAA,EAAAA,KAEnB,OACE,QAAGC,KAAMF,EAAUH,MAAOA,EAAOM,MAAO,GAAIR,KAAMS,UAAW,GAC3D,cAASD,MAAO,GAAIP,SAClB,SAAIO,MAAO,GAAIN,OAAQA,GACtBI,EAAK7pB,OACF,QAAG+pB,MAAO,GAAIL,QAASpH,GAASuH,EAAM,WACtC3nB,ICzBZ,IAAM,GAAM,CACVpB,KAAM,0BAcD,SAASmpB,GACd,G,IAAET,EAAA,EAAAA,QAASU,EAAA,EAAAA,SAEX,OACE,SAAIH,MAAO,GAAIjpB,MFHZ,SACL,G,IAAE8oB,EAAA,EAAAA,SAAUH,EAAA,EAAAA,MAAOI,EAAA,EAAAA,KAEnB,OACE,QAAGC,KAAMF,EAAUH,MAAOA,EAAOM,MAAOT,GAAIC,KAAMS,UAAW,GAC3D,cAASD,MAAOT,GAAIE,SAClB,SAAIO,MAAOT,GAAIG,OAAQA,GACtBI,EAAK7pB,OACF,QAAG+pB,MAAOT,GAAII,QAASpH,GAASuH,EAAM,WACtC3nB,IELLioB,CAAsBX,GACnBU,EAAS9mB,IAAIumB,KCzBvB,IAAM,GAAM,CACVS,MAAO,mBACPC,KAAO,mBCfT,IAAIC,GAAwC,WACxC,SAASA,EAAuBrb,EAAalF,GACzCxK,KAAK0P,YAAcA,EACnB1P,KAAKwK,QAAUA,EAKnB,OAHAugB,EAAuB3rB,UAAUzB,KAAO,SAAUsI,EAAY4B,GAC1D,OAAOA,EAAOL,UAAU,IAAI,GAAyBvB,EAAYjG,KAAK0P,YAAa1P,KAAKwK,WAErFugB,EARgC,GAUvC,GAA0C,SAAUvlB,GAEpD,SAASwlB,EAAyBhlB,EAAa0J,EAAalF,GACxD,IAAI7E,EAAQH,EAAO7H,KAAKqC,KAAMgG,IAAgBhG,KAC9C2F,EAAM+J,YAAcA,EACpB/J,EAAM6E,QAAUA,EAChB7E,EAAMme,UAAY,GAClB,IAAIhiB,EAAM4N,EAAYjP,OACtBkF,EAAMwG,OAAS,IAAI/J,MAAMN,GACzB,IAAK,IAAItE,EAAI,EAAGA,EAAIsE,EAAKtE,IACrBmI,EAAMme,UAAUrf,KAAKjH,GAEzB,IAASA,EAAI,EAAGA,EAAIsE,EAAKtE,IAAK,CAC1B,IAAIuJ,EAAa2I,EAAYlS,GAC7BmI,EAAMjB,IAAIyJ,GAAkBxI,EAAOoB,EAAYA,EAAYvJ,IAE/D,OAAOmI,EAoCX,OAnDA,EAAkBqlB,EAA0BxlB,GAiB5CwlB,EAAyB5rB,UAAU4O,WAAa,SAAUF,EAAYQ,EAAYP,EAAYQ,EAAYC,GACtGxO,KAAKmM,OAAO4B,GAAcO,EAC1B,IAAIwV,EAAY9jB,KAAK8jB,UACrB,GAAIA,EAAUrjB,OAAS,EAAG,CACtB,IAAIwqB,EAAQnH,EAAU/e,QAAQgJ,IACf,IAAXkd,GACAnH,EAAU5e,OAAO+lB,EAAO,KAIpCD,EAAyB5rB,UAAU8O,eAAiB,aAEpD8c,EAAyB5rB,UAAU8G,MAAQ,SAAUzH,GACjD,GAA8B,IAA1BuB,KAAK8jB,UAAUrjB,OAAc,CAC7B,IAAI4J,EAAO,CAAC5L,GAAO+F,OAAOxE,KAAKmM,QAC3BnM,KAAKwK,QACLxK,KAAKkrB,YAAY7gB,GAGjBrK,KAAKgG,YAAY7C,KAAKkH,KAIlC2gB,EAAyB5rB,UAAU8rB,YAAc,SAAU7gB,GACvD,IAAIS,EACJ,IACIA,EAAS9K,KAAKwK,QAAQ9J,MAAMV,KAAMqK,GAEtC,MAAOtH,GAEH,YADA/C,KAAKgG,YAAY5C,MAAML,GAG3B/C,KAAKgG,YAAY7C,KAAK2H,IAEnBkgB,EApDkC,CAqD3C,I,2RC1BK,SAASG,GACd9N,EAAiB,G,IAAE+N,EAAA,EAAAA,OAEbC,EAAOvO,GAAW,0BAA2BO,GACnD,OAAOpW,EDvDF,WAEH,IADA,IAAIoD,EAAO,GACFlD,EAAK,EAAGA,EAAK3G,UAAUC,OAAQ0G,IACpCkD,EAAKlD,GAAM3G,UAAU2G,GAEzB,OAAO,SAAUU,GACb,IAAI2C,EACiC,mBAA1BH,EAAKA,EAAK5J,OAAS,KAC1B+J,EAAUH,EAAKC,OAEnB,IAAIoF,EAAcrF,EAClB,OAAOxC,EAAOF,KAAK,IAAIojB,GAAuBrb,EAAalF,KC6C/D8gB,CAAeF,GACfvnB,GAAI,SAAC,G,IAAA,UAACiH,EAAA,KAMJ,OANY,KlC3BX,SACLuS,EAAiB5e,GAEjB4e,EAAGkO,YAAc9sB,EAAQ,EACrBukB,GAAU,sBAAuBvkB,EAAMuC,YAErCgiB,GADQ,IAAVvkB,EACY,oBACA,sBkCsBV+sB,CAAoBH,EAAMvgB,EAAOrK,QlCdlC,SACL4c,GAEAA,EAAGkO,YAAcvI,GAAU,6BkCarByI,CAAsBJ,GAEjBvgB,MCJN,SAAS4gB,GACdrO,EAAiB0I,EAAc,G,IAAE4F,EAAA,EAAAA,QAASP,EAAA,EAAAA,OAEpCQ,EAAYvO,EAAGqL,cAGfmD,EpDUD,SACLxO,EAAiB,G,IAAE8G,EAAA,EAAAA,SAGnB,OAAO1U,GADSjD,GAAU6Q,EAAI,UACR8G,EAASG,OAC5Brd,KACCpD,GAAI,WAAM,OAAAuZ,GAAiBC,MAC3BjB,GAAUgB,GAAiBC,IAC3B7B,GAAY,IoDlBAsQ,CAAmBF,EAAW7F,GAC3C9e,KACCpD,GAAI,SAAC,GAAU,OAAR,EAAA8Y,GAAaiP,EAAUG,aAAeH,EAAUnI,aAAe,MACtEpH,KACAvH,GAAO,IAIX,OAAO6W,EACJ1kB,KACCkkB,GAAsB9N,EAAI,CAAE+N,OAAM,ICZjC,SACL/N,EAAiB,G,IAAEwO,EAAA,EAAAA,QAEbD,EAAYvO,EAAGqL,cACfpnB,EAAOwb,GAAW,0BAA2BO,GACnD,OAAOpW,EACLgP,IAAU,SAAAnL,GAAU,OAAA+gB,EACjB5kB,KAGCmT,GAAUqH,IACVhI,IAAK,SAAApV,GACH,KAAOA,EAAQyG,EAAOrK,SACpB+hB,GAAsBlhB,EAAMopB,GAAmB5f,EAAOzG,SAClDunB,EAAUG,aAAeH,EAAUnI,aAAe,OAGxD,OAAOpf,IACN,GAGH2X,GAAMlR,GAGN6W,IAAS,YpCjBV,SACLtE,GAEAA,EAAGuH,UAAY,GoCePoH,CAAsB1qB,WDZ1B2qB,CAAsB5O,EAAI,CAAEwO,QAAO,KEelC,SAASK,GACdnG,EAAcpZ,GAGd,OAAO1F,EACLye,GAFM,EAAAxG,MAEY8G,SAAS,SAAA3I,GAAM,OAhC9B,SACLA,EAAiB0I,EAAc,GAU/B,OANgB7B,GAA6B7G,EAAI0I,EAAO,CAAE3B,QAJzB,EAAAA,UAK9Bnd,KACC0b,GAAYtF,EAAI,IAKjBpW,KACCpD,GAAI,SAAAoiB,GAAU,OAAGA,OAAM,OAmBQkG,CAAU9O,EAAI0I,EAAOpZ,MACtD6O,GAAY,IC1EhB,IAGe,GAHYnb,GAAQ,SAAiBiB,GAClD,OC5BgCV,ED4BfU,EC3B4B,oBAAtCpD,OAAOkB,UAAU4B,SAASrD,KAAKiD,GD2BbU,EAAK8qB,MAAM,IAAIC,UAAUvoB,KAAK,IAAM1B,MAAMhD,UAAUsK,MAAM/L,KAAK2D,EAAM,GAAG+qB,UC5BpF,IAAmBzrB,KCEnB,SAAS0rB,GAAUlsB,EAAGkB,GACnC,OCDa,SAAkBA,EAAMlB,EAAGoB,GACxC,IAAI+qB,EAAKhrB,EAET,GAA4B,mBAAjBD,EAAKyD,QACd,cAAe3E,GACb,IAAK,SACH,GAAU,IAANA,EAAS,CAGX,IADAmsB,EAAM,EAAInsB,EACHoB,EAAMF,EAAKb,QAAQ,CAExB,GAAa,KADbc,EAAOD,EAAKE,KACM,EAAID,IAASgrB,EAC7B,OAAO/qB,EAETA,GAAO,EAET,OAAQ,EACH,GAAIpB,GAAMA,EAAG,CAElB,KAAOoB,EAAMF,EAAKb,QAAQ,CAExB,GAAoB,iBADpBc,EAAOD,EAAKE,KACoBD,GAASA,EACvC,OAAOC,EAETA,GAAO,EAET,OAAQ,EAGV,OAAOF,EAAKyD,QAAQ3E,EAAGoB,GAGzB,IAAK,SACL,IAAK,UACL,IAAK,WACL,IAAK,YACH,OAAOF,EAAKyD,QAAQ3E,EAAGoB,GAEzB,IAAK,SACH,GAAU,OAANpB,EAEF,OAAOkB,EAAKyD,QAAQ3E,EAAGoB,GAK/B,KAAOA,EAAMF,EAAKb,QAAQ,CACxB,GAAI,GAAOa,EAAKE,GAAMpB,GACpB,OAAOoB,EAETA,GAAO,EAET,OAAQ,EDnDDgrB,CAASlrB,EAAMlB,EAAG,IAAM,EEmCjC,SAASqsB,GAASlrB,EAAMmrB,EAAW1S,GACjC,IACI2S,EADAC,SAAcrrB,EAElB,OAAQqrB,GACN,IAAK,SACL,IAAK,SAEH,OAAa,IAATrrB,GAAc,EAAIA,IAAUsrB,MAC1B7S,EAAI8S,OAAO,QAGTJ,IACF1S,EAAI8S,OAAO,OAAQ,IAEd,GAIY,OAAnB9S,EAAI+S,WACFL,GACFC,EAAW3S,EAAI+S,WAAW7E,KAC1BlO,EAAI+S,WAAWroB,IAAInD,GACTyY,EAAI+S,WAAW7E,OACNyE,GAEZ3S,EAAI+S,WAAWC,IAAIzrB,GAGtBqrB,KAAQ5S,EAAI8S,OAMPvrB,KAAQyY,EAAI8S,OAAOF,KAGxBF,IACF1S,EAAI8S,OAAOF,GAAMrrB,IAAQ,IAEpB,IAXHmrB,IACF1S,EAAI8S,OAAOF,GAAQ,GACnB5S,EAAI8S,OAAOF,GAAMrrB,IAAQ,IAEpB,GAWb,IAAK,UAGH,GAAIqrB,KAAQ5S,EAAI8S,OAAQ,CACtB,IAAIG,EAAO1rB,EAAO,EAAI,EACtB,QAAIyY,EAAI8S,OAAOF,GAAMK,KAGfP,IACF1S,EAAI8S,OAAOF,GAAMK,IAAQ,IAEpB,GAMT,OAHIP,IACF1S,EAAI8S,OAAOF,GAAQrrB,EAAO,EAAC,GAAO,GAAQ,EAAC,GAAM,KAE5C,EAGX,IAAK,WAEH,OAAuB,OAAnByY,EAAI+S,WACFL,GACFC,EAAW3S,EAAI+S,WAAW7E,KAC1BlO,EAAI+S,WAAWroB,IAAInD,GACTyY,EAAI+S,WAAW7E,OACNyE,GAEZ3S,EAAI+S,WAAWC,IAAIzrB,GAGtBqrB,KAAQ5S,EAAI8S,SAMbR,GAAU/qB,EAAMyY,EAAI8S,OAAOF,MAC1BF,GACF1S,EAAI8S,OAAOF,GAAMnoB,KAAKlD,IAEjB,IATHmrB,IACF1S,EAAI8S,OAAOF,GAAQ,CAACrrB,KAEf,GAWb,IAAK,YACH,QAAIyY,EAAI8S,OAAOF,KAGTF,IACF1S,EAAI8S,OAAOF,IAAQ,IAEd,GAGX,IAAK,SACH,GAAa,OAATrrB,EACF,QAAKyY,EAAI8S,OAAa,OAChBJ,IACF1S,EAAI8S,OAAa,MAAI,IAEhB,GAKb,QAIE,OADAF,EAAO1uB,OAAOkB,UAAU4B,SAASrD,KAAK4D,MACxByY,EAAI8S,SAObR,GAAU/qB,EAAMyY,EAAI8S,OAAOF,MAC1BF,GACF1S,EAAI8S,OAAOF,GAAMnoB,KAAKlD,IAEjB,IAVHmrB,IACF1S,EAAI8S,OAAOF,GAAQ,CAACrrB,KAEf,IAcA,OA1KS,WACtB,SAAS2rB,IAEPltB,KAAK+sB,WAA4B,mBAARI,IAAqB,IAAIA,IAAQ,KAC1DntB,KAAK8sB,OAAS,GA6BhB,OAtBAI,EAAK9tB,UAAUsF,IAAM,SAAUnD,GAC7B,OAAQkrB,GAASlrB,GAAM,EAAMvB,OAO/BktB,EAAK9tB,UAAU4tB,IAAM,SAAUzrB,GAC7B,OAAOkrB,GAASlrB,GAAM,EAAOvB,OAaxBktB,EAjCe,GCwCT,GAnBexG,IAAQ,SAAoB0G,EAAOC,GAO/D,IANA,IAAIC,EAAM,GACN9rB,EAAM,EACN+rB,EAAWH,EAAM3sB,OACjB+sB,EAAYH,EAAO5sB,OACnBgtB,EAAc,IAAI,GAEbjwB,EAAI,EAAGA,EAAIgwB,EAAWhwB,GAAK,EAClCiwB,EAAY/oB,IAAI2oB,EAAO7vB,IAGzB,KAAOgE,EAAM+rB,GACPE,EAAY/oB,IAAI0oB,EAAM5rB,MACxB8rB,EAAIA,EAAI7sB,QAAU2sB,EAAM5rB,IAE1BA,GAAO,EAET,OAAO8rB,K,yqBCVSI,GCCAC,G,2RC+CX,SAASC,GACdvQ,EAAiB0I,EAAc,G,IAAE3B,EAAA,EAAAA,QAI3ByJ,EAAWtF,GAAalL,EAAI0I,EAAO,CAAEyC,MAJD,EAAAA,QAKvCvhB,KACC6hB,GAAazL,IAIXyQ,EAAM5Q,GAA+B,gBAAiBG,GACtD0Q,ECSD,SACLD,EAA0B,EAAqB,G,QAAnB3J,EAAA,EAAAA,SAAqBC,EAAA,EAAAA,QAE3C4J,EAAQ,IAAIC,I,IAClB,IAAiB,SAAAH,GAAG,8BAAE,CAAjB,IAAMzQ,EAAE,QAEL5Q,EAASqQ,GAAW,QADfoR,mBAAmB7Q,EAAG8Q,KAAKtb,UAAU,IACZ,WACd,IAAXpG,GACTuhB,EAAMhU,IAAIqD,EAAI5Q,I,iGAIlB,IAAM4X,EAAUD,EACbnd,KACCpD,GAAI,SAAAuqB,GAAU,UAAKA,EAAOpO,WAkF9B,OA9EmBmE,EAASG,MACzBrd,KAGCpD,GAAI,WACF,IAAIwqB,EAA4B,GAChC,OAAO,GAAIL,GAAO7oB,QAAO,SAACd,EAAO,GAC/B,I,IAD+B,UAACiqB,EAAA,KAAQ7hB,EAAA,KACjC4hB,EAAK5tB,QAAQ,CAElB,KADautB,EAAM3vB,IAAIgwB,EAAKA,EAAK5tB,OAAS,IACjC8tB,SAAW9hB,EAAO8hB,SAGzB,MAFAF,EAAK/jB,MAKT,OAAOjG,EAAM2V,IACX,GAAQqU,EAAO,GAAIA,EAAM,CAAAC,KACzB7hB,EAAO8X,aAER,IAAI0J,QAIThY,IAAU,SAAA5R,GAAS,OAAAsf,GAAcQ,EAASK,QAASH,GAChDpd,KACCwS,IAAK,SAAC,EAAc,GAGlB,I,IAHI,UAACnS,EAAA,KAAMnE,EAAA,KAAO,UAAGwZ,EAAA,KAAAA,EAAK0J,EAAA,KAGnBljB,EAAK1C,QAAQ,CAElB,KADM,WAAG,GACI4lB,EAAS1J,GAGpB,MAFArV,EAAO,GAAIA,EAAM,CAAAnE,EAAKkM,UAO1B,KAAO/H,EAAK7G,QAAQ,CAElB,KADM,oBAAG,GACI4lB,GAAU1J,GAGrB,MAFAxZ,EAAO,IAACmE,EAAKgD,OAAWnH,GAO5B,MAAO,CAACmE,EAAMnE,KACb,CAAC,GAAI,GAAIkB,KACZgY,IAAqB,SAACjc,EAAG6B,GACvB,OAAO7B,EAAE,KAAO6B,EAAE,IACX7B,EAAE,KAAO6B,EAAE,WAQzBgF,KACCpD,GAAI,SAAC,G,IAAA,UAACyD,EAAA,KAAMnE,EAAA,KAAU,OACpBmE,KAAMA,EAAKzD,KAAI,SAAC,GAAW,OAAX,QAAC,MACjBV,KAAMA,EAAKU,KAAI,SAAC,GAAW,OAAX,QAAC,UAInB4V,IAAiB,SAACrZ,EAAG6B,GACnB,IAAMusB,EAAQlpB,KAAK6T,IAAI,EAAG7T,KAAKqjB,IAAI1mB,EAAEqF,KAAK7G,OAAQL,EAAEkH,KAAK7G,QAAU,GAC7DguB,EAAQnpB,KAAK6T,IAAIlX,EAAEqF,KAAK7G,OAAQL,EAAEkH,KAAK7G,QAC7C,MAAO,CACL6G,KAAMrF,EAAEqF,KAAKoC,MAAM8kB,EAAOC,EAAM,GAChCtrB,KAAM,GAAWlB,EAAEkB,KAAM/C,EAAE+C,SAE5B,CAAEmE,KAAM,GAAInE,KAAM,MAKtB8D,KACCuU,GAAY,ID3GCkT,CAAgBZ,EAAK/H,EAAO,CAAE3B,QAAO,IACnDnd,KCuHE,SACL6mB,GAEA,OAAO7mB,EAGLmT,GAAUqH,IACVvM,IAAI,SAAC,G,YAAE5N,EAAA,EAAAA,KAAMnE,EAAA,EAAAA,K,IAGX,IAAmB,SAAAA,GAAI,8BAAE,CACvBof,GADUlF,EAAD,cAAC,IAEV6E,GAAgB7E,I,qGAIlB,IAA4B,SAAA/V,EAAK6gB,WAAS,8BAAE,CAAjC,IAAS9K,EAAT,gBAAChZ,EAAA,KACV+d,GADkB/E,EAAD,WAAC,GACEhZ,IAAUiD,EAAK7G,OAAS,GAC5CuhB,GAAc3E,GAAI,I,qGAKtBsE,IAAS,W,YACP,IAAiB,SAAAmM,GAAG,8BAAE,CAAjB,IAAMzQ,EAAE,QACXkF,GAAkBlF,GAClB6E,GAAgB7E,I,sGDhJlBsR,CAAgBb,IAIpB,OAAOnK,GAAc,CAACkK,EAAUE,IAC7B9mB,KACCpD,GAAI,SAAC,G,IAAA,UAAuB,OAAGwlB,QAAzB,KAAkCuF,QAAzB,UDSd,SAASC,GACdjrB,GAEA,OAAOA,EAAQgpB,OAASe,GAAkBmB,KAuBrC,SAASC,GACdnrB,GAEA,OAAOA,EAAQgpB,OAASe,GAAkBqB,QD1G5C,SAAkBtB,GAChB,uBACA,uBAFF,CAAkBA,QAAiB,KCCnC,SAAkBC,GAChB,qBACA,mBACA,qBACA,uBAJF,CAAkBA,QAAiB,KG/BnC,4C,05BAyGA9Q,SAASoS,gBAAgB5M,UAAUje,OAAO,SAC1CyY,SAASoS,gBAAgB5M,UAAU3d,IAAI,MAEvC,IAAM,GAAqB,CACzB,YACA,SACA,eACA,OACA,OACA,aACA,SACA,eACA,eACA,gBACA,OACA,OA8BF,SAAS,GAAQjG,GACf,IAAMywB,EAAWzwB,EACd0kB,QAAQ,+BAAgC,IACxCgM,OAEH,OAAOD,EAAWA,EAAS/L,QAAQ,SAAU,MAAQ,GAGvD,SAASiM,GAAa1T,GAEpBA,EAAO2T,KAAO3T,EAAO2T,KAAKlM,QAAQ,MAAO,IAEzC,IAAMjC,EAAS,IAAIoO,OAAO5T,EAAOwF,OAAOqO,QAClCC,EAAS,IAAIF,OAAO5T,EAAOwF,OAAOsO,QAElCC,EAAiB,IAAI,EACrBC,EAAUzO,GAAYuO,EAAQ,CAAErO,MAAOsO,IAI7CC,EAAQloB,WAAU,SAAA5D,GAGZA,EAAQgpB,OAASc,GAAkBiC,QAA8B,MAApB/rB,EAAQgsB,KAAK,IAC5DC,aAAaC,QAAQ,QAASlsB,EAAQgsB,SAK1C,IAAMG,EAAiB,IAAI,EAErBC,EAAU/O,GAAYC,EAAQ,CAAEC,MAAO4O,IAG7CC,EACG/oB,KACC6N,GAAO+Z,IACPhrB,GAAI,SAAAD,GAAW,OACbgpB,KAAMc,GAAkBuC,OACxBL,KAAMhsB,EAAQgsB,SAEhB1a,IAAI,SAAAtR,GAAW,OAAA6rB,EAAetsB,KAAKS,OAGlC4D,YAEL,I5F/LmBqD,E4F+LbqlB,EAAQrb,GAAK,CACjBhF,IAAQ6L,EAAO2T,KAAI,4BACnB7e,aAAc,OACde,iBAAiB,IAEhBtK,KACCuO,GAAM,aAIJ2a,EAAYN,aAAaO,QAAQ,SA2BvC,OAxBCD,EAAY/lB,EAAG,CACdwiB,KAAMc,GAAkBiC,OACxBC,KAAMC,aAAaO,QAAQ,WACxBvrB,GACF2C,WAAU,SAAA5G,GAET6uB,EAAetsB,KAAKvC,M5GjNnB,WAEH,IADA,IAAIsL,EAAU,GACL/E,EAAK,EAAGA,EAAK3G,UAAUC,OAAQ0G,IACpC+E,EAAQ/E,GAAM3G,UAAU2G,GAE5B,GAAuB,IAAnB+E,EAAQzL,OAAc,CACtB,IAAI4vB,EAAUnkB,EAAQ,GACtB,GAAI3I,EAAQ8sB,GACR,OAAOpkB,GAAiBokB,EAAS,MAErC,GAAI7sB,EAAS6sB,IAAYnyB,OAAOoyB,eAAeD,KAAanyB,OAAOkB,UAAW,CAC1E,IAAIqC,EAAOvD,OAAOuD,KAAK4uB,GACvB,OAAOpkB,GAAiBxK,EAAKoC,KAAI,SAAU9E,GAAO,OAAOsxB,EAAQtxB,MAAU0C,IAGnF,GAA2C,mBAAhCyK,EAAQA,EAAQzL,OAAS,GAAmB,CACnD,IAAI8vB,EAAmBrkB,EAAQ5B,MAE/B,OAAO2B,GADPC,EAA8B,IAAnBA,EAAQzL,QAAgB8C,EAAQ2I,EAAQ,IAAOA,EAAQ,GAAKA,EACtC,MAAMjF,KAAKpD,GAAI,SAAUwG,GAAQ,OAAOkmB,EAAiB7vB,WAAM,EAAQ2J,OAE5G,OAAO4B,GAAiBC,EAAS,M4GoMnCskB,CAAS,CAACN,EAJKC,EAAYT,EAAQzoB,KAAKuO,GAAM,S5FrN3B3K,E4FqNyC,E5FpNnD,SAAUhD,GACb,OAAc,IAAVgD,EACO,IAGAhD,EAAOF,KAAK,IAAI,GAAakD,O4F+MoBT,OAAGzH,KAKlEsE,KACCpD,GAAI,SAAC,G,IAAA,UAAC+rB,EAAA,KAAMvrB,EAAA,KAAW,OACrBuoB,KAAMe,GAAkB8C,MACxBb,KAAM,SAAKA,GAAI,CAAEvrB,MAAK,SAGvBmD,WAAU,SAAA5D,GACTmsB,EAAe5sB,KAAKS,MAGnB,CAACosB,EAASD,GA+EZ,SAASW,GAAWhV,GACzB,IAhLF,SAAkBA,GAChB,MAAyB,iBAAXA,GACgB,iBAAhBA,EAAO2T,MACW,iBAAlB3T,EAAOwF,QACkB,iBAAzBxF,EAAOwF,OAAOqO,QACW,iBAAzB7T,EAAOwF,OAAOsO,OA2KvBmB,CAASjV,GACZ,MAAM,IAAIkV,YAAY,0BAA0B7d,KAAKC,UAAU0I,IAGjE,I5D5QMmV,E4D4QA9K,EC9NC,CACLlJ,SAAU,CACRD,MpEhCGA,GACJ3V,KACC+U,GAAMa,UACNrB,GAAY,KoE+Bd6O,SAAU,CACRyG,O7DnDED,EAAY,IAAI,EACtB9R,GACG9X,KACCpD,GAAI,WAAM,OAAAwmB,SAASE,QACnB3L,MAECpX,UAAUqpB,GAGRA,G6D2CHE,M7DlCGjS,GACJ7X,KACCpD,GAAI,WAAM,OAAAwmB,SAAS8D,QACnBrZ,IAAO,SAAAqZ,GAAQ,OAAAA,EAAK1tB,OAAS,KAC7Bme,O6DgCFM,MAAO,CACL8G,QAAShH,GAAW,uBACpBgS,QAAShS,GAAW,uBAEtBmF,SAAU,CACRK,Q1DbG/U,GAAM,GAASgQ,IACnBxY,KACCpD,EAAI6b,IACJtD,GAAUsD,MACVlE,GAAY,I0DUZ8I,M1DAG7E,GACJxY,KACCpD,EAAIgc,IACJzD,GAAUyD,MACVrE,GAAY,MyD8MV,cACJyV,EAAA,KACAlB,EAAA,MAlFJ,WACE,IAAM1S,EAAKP,GAA8B,0BAEzC,GADAxU,QAAQ4oB,IAAI7T,IACPA,EACH,OAAOxY,EAET,IAAM+qB,EAAOuB,eAAef,QAAQ,cACpC,GAAIR,EAEF,OAAOxlB,EADG2I,KAAK2B,MAAMkb,IAKvB,SAASwB,EAAO3yB,GACd,OAAOA,EAAQ,KACPA,EAAQ,KAAM4yB,QAAQ,GAAE,IAC5B,GAAG,EAIH,qEAAG/e,EAAA,KAAMgf,EAAA,KAGf,OAAIhf,GAAQgf,EACHzc,GAAK,CACVhF,IAAK,gCAAgCyC,EAAI,IAAIgf,EAC7C9gB,aAAc,SAEbvJ,KACCpD,GAAI,SAAC,G,IAAEqQ,EAAA,EAAAA,OAAQ5D,EAAA,EAAAA,SACb,GAAe,MAAX4D,EAAgB,CACV,IAAAqd,EAAA,EAAAA,iBAAkBC,EAAA,EAAAA,YAC1B,MAAO,CACFJ,EAAOG,GAAiB,SACxBH,EAAOI,GAAY,UAG1B,MAAO,MAETtc,IAAI,SAAA0a,GAAQ,OAAAuB,eAAerB,QAAQ,aAAc/c,KAAKC,UAAU4c,QAI3Dtd,EACFuC,GAAK,CACVhF,IAAK,gCAAgCyC,EACrC9B,aAAc,SAEbvJ,KACCpD,GAAI,SAAC,G,IAAEqQ,EAAA,EAAAA,OAAQ5D,EAAA,EAAAA,SACb,OAAe,MAAX4D,EAEK,CACFkd,EAFG,EAAAK,cAEiB,iBAGpB,MAETvc,IAAI,SAAA0a,GAAQ,OAAAuB,eAAerB,QAAQ,aAAc/c,KAAKC,UAAU4c,QAG/DxlB,EAAG,KAyBVsnB,GAAalqB,WAAU,SAAAqjB,GACjBA,EAAMpqB,QACQyc,GAAY,2CACpB1U,SAAQ,SAAA8oB,GACdA,EAAKK,QAAQC,QAAU,OACvBN,EAAK5O,YhB3RN,SACLmI,GAEA,OACE,SAAIL,MAAO,GAAIK,OACZA,EAAMhnB,KAAI,SAACinB,GAAc,gBAAIN,MAAO,GAAIM,MAAOA,OgBuR5C+G,CAAahH,UASrB,IAAMiH,EElQD,SACLC,EAAoB,GAsCpB,OAtCsB,EAAAC,UAGnB/qB,KAGCpD,GAAI,SAAAgZ,GAAY,OAAAkV,EAAM5sB,QAAqB,SAAC8sB,EAAYl0B,G,MAChDsf,EAAKP,GAAW,sBAAsB/e,EAAI,IAAK8e,GACrD,OAAO,SACFoV,QACc,IAAP5U,IAAoB,MAAItf,GAAOsf,EAAE,GAAK,MAEjD,OAGH5D,IAAK,SAACnS,EAAMnE,G,YACV,IAAmB,WAAKmE,IAAK,8BAAE,CAA1B,IAAMvJ,EAAI,QACb,OAAQA,GAGN,IAAK,eACL,IAAK,YACCA,KAAQuJ,QAA8B,IAAfA,EAAKvJ,KAC9BuJ,EAAKvJ,GAAOm0B,YAAY/uB,EAAKpF,IAC7BuJ,EAAKvJ,GAAQoF,EAAKpF,IAEpB,MAGF,QACEuJ,EAAKvJ,GAAQ+e,GAAW,sBAAsB/e,EAAI,O,iGAGxD,OAAOuJ,MAMVL,KACCuU,GAAY,IFyNI2W,CAAkB,GAAO,CAAEH,UAAWjM,EAAMlJ,SAASD,QACnEwV,EAAY,SAAwBr0B,GACxC,OAAO+zB,EACJ7qB,KE7MA,SACLlJ,GAEA,OAAOkJ,EACLgP,IAAU,SAAAgc,GACR,YAAmC,IAArBA,EAAWl0B,GACrBqM,EAAG6nB,EAAWl0B,IACd6P,OFuMFykB,CAAmBt0B,KAKnBqmB,EAAUgO,EAAU,UACvBnrB,KACCgP,GAAUmN,KAIdgP,EAAU,UACPnrB,KACCgP,IAAU,SAAAoH,GAAM,OAAAmL,EACbvhB,KACCwd,GAAkBpH,QAIrB7V,YAOL,IAAMmkB,EAAUsF,EACbhqB,KAEC6N,GAAOia,IACPvZ,GAAM,QAENN,IAAI,SAAApK,GAAU,OAAAA,EAAOtC,SAAQ,SAAAjH,GAC3BA,EAAK0oB,QAAQI,SAAc3O,EAAO2T,KAAI,IAAI9tB,EAAK0oB,QAAQI,SACvD9oB,EAAKopB,SAASniB,SAAQ,SAAA8pB,GACpBA,EAAQjI,SAAc3O,EAAO2T,KAAI,IAAIiD,EAAQjI,mBAO/Ce,EAASgH,EAA4B,gBACxCnrB,KACCgP,IAAU,SAAAoH,GAAM,OAAAkM,GAAiBlM,EAAI,CAAEmM,QAAO,SAGlD4B,EACGnkB,KACCpD,GAAI,SAAAob,GAAS,OACX2N,KAAMe,GAAkB4E,MACxB3C,KAAM3Q,EAAMxgB,WAIb+I,UAAUuoB,GAKf3E,EACGnkB,KACCiO,IAAI,SAAA+J,GG9WH,IACL5B,EAAsB5e,EH8WZwgB,EAAM4K,QG9WMprB,GH+WI,GG/W1B4e,EH+WkBkS,GG7WXiD,UAAY/zB,GACjB4e,EAAGoV,aH+WAjrB,YAIL,IGtWA6V,EHsWMmL,EAAQ4J,EAAU,QACrBnrB,KACCkf,GAAUJ,EAAO,CAAE3B,QAAO,KAGxBsO,EAAcN,EAAU,cAC3BnrB,KACCmiB,GAAgBrD,EAAO,CAAEyC,MAAK,KAG5BmK,EAAOP,EAAU,OACpBnrB,KF1TE,SACL8e,EAAcpZ,GAGd,OAAO1F,EACLye,GAFM,EAAAxG,MAEY8R,SAAS,SAAA3T,GAAM,OAAAuQ,GAAqBvQ,EAAI0I,EAAOpZ,MACjE6O,GAAY,IEqTVoX,CAAqB7M,EAAO,CAAE3B,QAAO,EAAEoE,MAAK,KAI1CqK,EAAmBT,EAAU,iBAChCnrB,KblVE,SACL8e,EAAcpZ,GAEd,OAAO1F,EACLgP,IAAU,SAAAoH,GAAM,OAAAqO,GAAkBrO,EAAI0I,EAAOpZ,MAC7C6O,GAAY,Ia8UVsX,CAAkB/M,EAAO,CAAE4F,QAAO,EAAEP,OAAQA,EAAOnkB,KAAKuO,GAAM,aAG5Dud,EAAQX,EAAU,QACrBnrB,KACCilB,GAAUnG,EAAO,CAAE3B,QAAO,KAGxB4O,EAAQZ,EAAU,QACrBnrB,KACC6e,GAAUC,EAAO,CAAE3B,QAAO,KAOxBmL,GADSzS,GAA6B,2BAC7BA,GAA6B,4BAEtCmW,GG3YN5V,EH2YuBkS,EGzYhB/iB,GAAU6Q,EAAI,UAClBpW,KACCpD,GAAI,WAAM,OAAAwZ,EAAGmV,aHwYdvrB,KACC,GAAM,MAGJisB,EAASd,EAAU,gBACtBnrB,KACCgP,GAAU6T,KAKRqJ,EAAsBF,EACzBhsB,KACCgP,IAAU,SAAArV,GAAK,OAAM,IAANA,EAAa4L,GAAU/M,OAAQ,WAAamO,OAI/D6B,GAAMwjB,EAAGhsB,KAAK6N,GAAO,IAAYoe,EAAQC,GACtClsB,KACCsS,GAAY6Y,EAA4B,iBACxCld,IAAI,SAAAmI,GAAM,OAAAA,EAAGwM,YAEZriB,YAKLiI,GACEuP,GAAW,SAAS/X,KAAK6N,GAAO,IAChCtI,GAAU/M,OAAQ,gBAEjB+H,WAAU,WACT,IAAM4rB,EAAUvW,SAASM,iBAAiB,WAC1C/a,MAAMhD,UAAUoJ,QAAQ7K,KAAKy1B,GAAS,SAAAC,GACpCA,EAAOpR,aAAa,OAAQ,UAMlC,IAAMxL,EAAQ,CACZ8Y,OAAQ,CACNnE,OAAM,EACNO,QAASkH,EACTK,OAAM,GAER1K,MAAK,EACLkK,YAAW,EACXC,KAAI,EACJI,MAAK,EACLC,MAAK,GAGC,IAAAzD,OAAc,mBAItB,OAHA9f,GAAK,gBAAI,EAAO6jB,GAAU,EAAOC,KAC9B/rB,YAEI,CACLue,MAAK,EACLtP,MAAK","file":"bundle.js","sourcesContent":[" \t// The module cache\n \tvar installedModules = {};\n\n \t// The require function\n \tfunction __webpack_require__(moduleId) {\n\n \t\t// Check if module is in cache\n \t\tif(installedModules[moduleId]) {\n \t\t\treturn installedModules[moduleId].exports;\n \t\t}\n \t\t// Create a new module (and put it into the cache)\n \t\tvar module = installedModules[moduleId] = {\n \t\t\ti: moduleId,\n \t\t\tl: false,\n \t\t\texports: {}\n \t\t};\n\n \t\t// Execute the module function\n \t\tmodules[moduleId].call(module.exports, module, module.exports, __webpack_require__);\n\n \t\t// Flag the module as loaded\n \t\tmodule.l = true;\n\n \t\t// Return the exports of the module\n \t\treturn module.exports;\n \t}\n\n\n \t// expose the modules object (__webpack_modules__)\n \t__webpack_require__.m = modules;\n\n \t// expose the module cache\n \t__webpack_require__.c = installedModules;\n\n \t// define getter function for harmony exports\n \t__webpack_require__.d = function(exports, name, getter) {\n \t\tif(!__webpack_require__.o(exports, name)) {\n \t\t\tObject.defineProperty(exports, name, { enumerable: true, get: getter });\n \t\t}\n \t};\n\n \t// define __esModule on exports\n \t__webpack_require__.r = function(exports) {\n \t\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n \t\t\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\n \t\t}\n \t\tObject.defineProperty(exports, '__esModule', { value: true });\n \t};\n\n \t// create a fake namespace object\n \t// mode & 1: value is a module id, require it\n \t// mode & 2: merge all properties of value into the ns\n \t// mode & 4: return value when already ns object\n \t// mode & 8|1: behave like require\n \t__webpack_require__.t = function(value, mode) {\n \t\tif(mode & 1) value = __webpack_require__(value);\n \t\tif(mode & 8) return value;\n \t\tif((mode & 4) && typeof value === 'object' && value && value.__esModule) return value;\n \t\tvar ns = Object.create(null);\n \t\t__webpack_require__.r(ns);\n \t\tObject.defineProperty(ns, 'default', { enumerable: true, value: value });\n \t\tif(mode & 2 && typeof value != 'string') for(var key in value) __webpack_require__.d(ns, key, function(key) { return value[key]; }.bind(null, key));\n \t\treturn ns;\n \t};\n\n \t// getDefaultExport function for compatibility with non-harmony modules\n \t__webpack_require__.n = function(module) {\n \t\tvar getter = module && module.__esModule ?\n \t\t\tfunction getDefault() { return module['default']; } :\n \t\t\tfunction getModuleExports() { return module; };\n \t\t__webpack_require__.d(getter, 'a', getter);\n \t\treturn getter;\n \t};\n\n \t// Object.prototype.hasOwnProperty.call\n \t__webpack_require__.o = function(object, property) { return Object.prototype.hasOwnProperty.call(object, property); };\n\n \t// __webpack_public_path__\n \t__webpack_require__.p = \"\";\n\n\n \t// Load entry module and return exports\n \treturn __webpack_require__(__webpack_require__.s = 7);\n","/** PURE_IMPORTS_START PURE_IMPORTS_END */\nvar __window = typeof window !== 'undefined' && window;\nvar __self = typeof self !== 'undefined' && typeof WorkerGlobalScope !== 'undefined' &&\n self instanceof WorkerGlobalScope && self;\nvar __global = typeof global !== 'undefined' && global;\nvar _root = __window || __global || __self;\n/*@__PURE__*/ (function () {\n if (!_root) {\n throw /*@__PURE__*/ new Error('RxJS could not find any global context (window, self, global)');\n }\n})();\nexport { _root as root };\n//# sourceMappingURL=root.js.map\n","var g;\n\n// This works in non-strict mode\ng = (function() {\n\treturn this;\n})();\n\ntry {\n\t// This works if eval is allowed (see CSP)\n\tg = g || new Function(\"return this\")();\n} catch (e) {\n\t// This works if the window reference is available\n\tif (typeof window === \"object\") g = window;\n}\n\n// g can still be undefined, but nothing to do about it...\n// We return undefined, instead of nothing here, so it's\n// easier to handle this case. if(!global) { ...}\n\nmodule.exports = g;\n","export default function _isPlaceholder(a) {\n return a != null && typeof a === 'object' && a['@@functional/placeholder'] === true;\n}","import _isPlaceholder from './_isPlaceholder.js';\n\n/**\n * Optimized internal one-arity curry function.\n *\n * @private\n * @category Function\n * @param {Function} fn The function to curry.\n * @return {Function} The curried function.\n */\nexport default function _curry1(fn) {\n return function f1(a) {\n if (arguments.length === 0 || _isPlaceholder(a)) {\n return f1;\n } else {\n return fn.apply(this, arguments);\n }\n };\n}","export default function _identity(x) {\n return x;\n}","import _curry1 from './internal/_curry1.js';\nimport _identity from './internal/_identity.js';\n\n/**\n * A function that does nothing but return the parameter supplied to it. Good\n * as a default or placeholder function.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig a -> a\n * @param {*} x The value to return.\n * @return {*} The input value, `x`.\n * @example\n *\n * R.identity(1); //=> 1\n *\n * const obj = {};\n * R.identity(obj) === obj; //=> true\n * @symb R.identity(a) = a\n */\nvar identity = /*#__PURE__*/_curry1(_identity);\nexport default identity;","export default function _has(prop, obj) {\n return Object.prototype.hasOwnProperty.call(obj, prop);\n}","import _has from './_has.js';\n\nvar toString = Object.prototype.toString;\nvar _isArguments = /*#__PURE__*/function () {\n return toString.call(arguments) === '[object Arguments]' ? function _isArguments(x) {\n return toString.call(x) === '[object Arguments]';\n } : function _isArguments(x) {\n return _has('callee', x);\n };\n}();\n\nexport default _isArguments;","import _curry1 from './internal/_curry1.js';\nimport _has from './internal/_has.js';\nimport _isArguments from './internal/_isArguments.js';\n\n// cover IE < 9 keys issues\nvar hasEnumBug = ! /*#__PURE__*/{ toString: null }.propertyIsEnumerable('toString');\nvar nonEnumerableProps = ['constructor', 'valueOf', 'isPrototypeOf', 'toString', 'propertyIsEnumerable', 'hasOwnProperty', 'toLocaleString'];\n// Safari bug\nvar hasArgsEnumBug = /*#__PURE__*/function () {\n 'use strict';\n\n return arguments.propertyIsEnumerable('length');\n}();\n\nvar contains = function contains(list, item) {\n var idx = 0;\n while (idx < list.length) {\n if (list[idx] === item) {\n return true;\n }\n idx += 1;\n }\n return false;\n};\n\n/**\n * Returns a list containing the names of all the enumerable own properties of\n * the supplied object.\n * Note that the order of the output array is not guaranteed to be consistent\n * across different JS platforms.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Object\n * @sig {k: v} -> [k]\n * @param {Object} obj The object to extract properties from\n * @return {Array} An array of the object's own properties.\n * @see R.keysIn, R.values\n * @example\n *\n * R.keys({a: 1, b: 2, c: 3}); //=> ['a', 'b', 'c']\n */\nvar keys = typeof Object.keys === 'function' && !hasArgsEnumBug ? /*#__PURE__*/_curry1(function keys(obj) {\n return Object(obj) !== obj ? [] : Object.keys(obj);\n}) : /*#__PURE__*/_curry1(function keys(obj) {\n if (Object(obj) !== obj) {\n return [];\n }\n var prop, nIdx;\n var ks = [];\n var checkArgsLength = hasArgsEnumBug && _isArguments(obj);\n for (prop in obj) {\n if (_has(prop, obj) && (!checkArgsLength || prop !== 'length')) {\n ks[ks.length] = prop;\n }\n }\n if (hasEnumBug) {\n nIdx = nonEnumerableProps.length - 1;\n while (nIdx >= 0) {\n prop = nonEnumerableProps[nIdx];\n if (_has(prop, obj) && !contains(ks, prop)) {\n ks[ks.length] = prop;\n }\n nIdx -= 1;\n }\n }\n return ks;\n});\nexport default keys;","import _curry1 from './internal/_curry1.js';\nimport keys from './keys.js';\n\n/**\n * Returns a list of all the enumerable own properties of the supplied object.\n * Note that the order of the output array is not guaranteed across different\n * JS platforms.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Object\n * @sig {k: v} -> [v]\n * @param {Object} obj The object to extract values from\n * @return {Array} An array of the values of the object's own properties.\n * @see R.valuesIn, R.keys\n * @example\n *\n * R.values({a: 1, b: 2, c: 3}); //=> [1, 2, 3]\n */\nvar values = /*#__PURE__*/_curry1(function values(obj) {\n var props = keys(obj);\n var len = props.length;\n var vals = [];\n var idx = 0;\n while (idx < len) {\n vals[idx] = obj[props[idx]];\n idx += 1;\n }\n return vals;\n});\nexport default values;","/*! *****************************************************************************\r\nCopyright (c) Microsoft Corporation. All rights reserved.\r\nLicensed under the Apache License, Version 2.0 (the \"License\"); you may not use\r\nthis file except in compliance with the License. You may obtain a copy of the\r\nLicense at http://www.apache.org/licenses/LICENSE-2.0\r\n\r\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\r\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\r\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\r\nMERCHANTABLITY OR NON-INFRINGEMENT.\r\n\r\nSee the Apache Version 2.0 License for specific language governing permissions\r\nand limitations under the License.\r\n***************************************************************************** */\r\n/* global Reflect, Promise */\r\n\r\nvar extendStatics = function(d, b) {\r\n extendStatics = Object.setPrototypeOf ||\r\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\r\n function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };\r\n return extendStatics(d, b);\r\n};\r\n\r\nexport function __extends(d, b) {\r\n extendStatics(d, b);\r\n function __() { this.constructor = d; }\r\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\r\n}\r\n\r\nexport var __assign = function() {\r\n __assign = Object.assign || function __assign(t) {\r\n for (var s, i = 1, n = arguments.length; i < n; i++) {\r\n s = arguments[i];\r\n for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];\r\n }\r\n return t;\r\n }\r\n return __assign.apply(this, arguments);\r\n}\r\n\r\nexport function __rest(s, e) {\r\n var t = {};\r\n for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0)\r\n t[p] = s[p];\r\n if (s != null && typeof Object.getOwnPropertySymbols === \"function\")\r\n for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) if (e.indexOf(p[i]) < 0)\r\n t[p[i]] = s[p[i]];\r\n return t;\r\n}\r\n\r\nexport function __decorate(decorators, target, key, desc) {\r\n var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\r\n if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\r\n else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;\r\n return c > 3 && r && Object.defineProperty(target, key, r), r;\r\n}\r\n\r\nexport function __param(paramIndex, decorator) {\r\n return function (target, key) { decorator(target, key, paramIndex); }\r\n}\r\n\r\nexport function __metadata(metadataKey, metadataValue) {\r\n if (typeof Reflect === \"object\" && typeof Reflect.metadata === \"function\") return Reflect.metadata(metadataKey, metadataValue);\r\n}\r\n\r\nexport function __awaiter(thisArg, _arguments, P, generator) {\r\n return new (P || (P = Promise))(function (resolve, reject) {\r\n function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\r\n function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\r\n function step(result) { result.done ? resolve(result.value) : new P(function (resolve) { resolve(result.value); }).then(fulfilled, rejected); }\r\n step((generator = generator.apply(thisArg, _arguments || [])).next());\r\n });\r\n}\r\n\r\nexport function __generator(thisArg, body) {\r\n var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;\r\n return g = { next: verb(0), \"throw\": verb(1), \"return\": verb(2) }, typeof Symbol === \"function\" && (g[Symbol.iterator] = function() { return this; }), g;\r\n function verb(n) { return function (v) { return step([n, v]); }; }\r\n function step(op) {\r\n if (f) throw new TypeError(\"Generator is already executing.\");\r\n while (_) try {\r\n if (f = 1, y && (t = op[0] & 2 ? y[\"return\"] : op[0] ? y[\"throw\"] || ((t = y[\"return\"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;\r\n if (y = 0, t) op = [op[0] & 2, t.value];\r\n switch (op[0]) {\r\n case 0: case 1: t = op; break;\r\n case 4: _.label++; return { value: op[1], done: false };\r\n case 5: _.label++; y = op[1]; op = [0]; continue;\r\n case 7: op = _.ops.pop(); _.trys.pop(); continue;\r\n default:\r\n if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }\r\n if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }\r\n if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }\r\n if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }\r\n if (t[2]) _.ops.pop();\r\n _.trys.pop(); continue;\r\n }\r\n op = body.call(thisArg, _);\r\n } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }\r\n if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };\r\n }\r\n}\r\n\r\nexport function __exportStar(m, exports) {\r\n for (var p in m) if (!exports.hasOwnProperty(p)) exports[p] = m[p];\r\n}\r\n\r\nexport function __values(o) {\r\n var m = typeof Symbol === \"function\" && o[Symbol.iterator], i = 0;\r\n if (m) return m.call(o);\r\n return {\r\n next: function () {\r\n if (o && i >= o.length) o = void 0;\r\n return { value: o && o[i++], done: !o };\r\n }\r\n };\r\n}\r\n\r\nexport function __read(o, n) {\r\n var m = typeof Symbol === \"function\" && o[Symbol.iterator];\r\n if (!m) return o;\r\n var i = m.call(o), r, ar = [], e;\r\n try {\r\n while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);\r\n }\r\n catch (error) { e = { error: error }; }\r\n finally {\r\n try {\r\n if (r && !r.done && (m = i[\"return\"])) m.call(i);\r\n }\r\n finally { if (e) throw e.error; }\r\n }\r\n return ar;\r\n}\r\n\r\nexport function __spread() {\r\n for (var ar = [], i = 0; i < arguments.length; i++)\r\n ar = ar.concat(__read(arguments[i]));\r\n return ar;\r\n}\r\n\r\nexport function __await(v) {\r\n return this instanceof __await ? (this.v = v, this) : new __await(v);\r\n}\r\n\r\nexport function __asyncGenerator(thisArg, _arguments, generator) {\r\n if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\r\n var g = generator.apply(thisArg, _arguments || []), i, q = [];\r\n return i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i;\r\n function verb(n) { if (g[n]) i[n] = function (v) { return new Promise(function (a, b) { q.push([n, v, a, b]) > 1 || resume(n, v); }); }; }\r\n function resume(n, v) { try { step(g[n](v)); } catch (e) { settle(q[0][3], e); } }\r\n function step(r) { r.value instanceof __await ? Promise.resolve(r.value.v).then(fulfill, reject) : settle(q[0][2], r); }\r\n function fulfill(value) { resume(\"next\", value); }\r\n function reject(value) { resume(\"throw\", value); }\r\n function settle(f, v) { if (f(v), q.shift(), q.length) resume(q[0][0], q[0][1]); }\r\n}\r\n\r\nexport function __asyncDelegator(o) {\r\n var i, p;\r\n return i = {}, verb(\"next\"), verb(\"throw\", function (e) { throw e; }), verb(\"return\"), i[Symbol.iterator] = function () { return this; }, i;\r\n function verb(n, f) { i[n] = o[n] ? function (v) { return (p = !p) ? { value: __await(o[n](v)), done: n === \"return\" } : f ? f(v) : v; } : f; }\r\n}\r\n\r\nexport function __asyncValues(o) {\r\n if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\r\n var m = o[Symbol.asyncIterator], i;\r\n return m ? m.call(o) : (o = typeof __values === \"function\" ? __values(o) : o[Symbol.iterator](), i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i);\r\n function verb(n) { i[n] = o[n] && function (v) { return new Promise(function (resolve, reject) { v = o[n](v), settle(resolve, reject, v.done, v.value); }); }; }\r\n function settle(resolve, reject, d, v) { Promise.resolve(v).then(function(v) { resolve({ value: v, done: d }); }, reject); }\r\n}\r\n\r\nexport function __makeTemplateObject(cooked, raw) {\r\n if (Object.defineProperty) { Object.defineProperty(cooked, \"raw\", { value: raw }); } else { cooked.raw = raw; }\r\n return cooked;\r\n};\r\n\r\nexport function __importStar(mod) {\r\n if (mod && mod.__esModule) return mod;\r\n var result = {};\r\n if (mod != null) for (var k in mod) if (Object.hasOwnProperty.call(mod, k)) result[k] = mod[k];\r\n result.default = mod;\r\n return result;\r\n}\r\n\r\nexport function __importDefault(mod) {\r\n return (mod && mod.__esModule) ? mod : { default: mod };\r\n}\r\n","/** PURE_IMPORTS_START PURE_IMPORTS_END */\nexport function isFunction(x) {\n return typeof x === 'function';\n}\n//# sourceMappingURL=isFunction.js.map\n","/** PURE_IMPORTS_START PURE_IMPORTS_END */\nvar _enable_super_gross_mode_that_will_cause_bad_things = false;\nexport var config = {\n Promise: undefined,\n set useDeprecatedSynchronousErrorHandling(value) {\n if (value) {\n var error = /*@__PURE__*/ new Error();\n /*@__PURE__*/ console.warn('DEPRECATED! RxJS was set to use deprecated synchronous error handling behavior by code at: \\n' + error.stack);\n }\n else if (_enable_super_gross_mode_that_will_cause_bad_things) {\n /*@__PURE__*/ console.log('RxJS: Back to a better error behavior. Thank you. <3');\n }\n _enable_super_gross_mode_that_will_cause_bad_things = value;\n },\n get useDeprecatedSynchronousErrorHandling() {\n return _enable_super_gross_mode_that_will_cause_bad_things;\n },\n};\n//# sourceMappingURL=config.js.map\n","/** PURE_IMPORTS_START PURE_IMPORTS_END */\nexport function hostReportError(err) {\n setTimeout(function () { throw err; }, 0);\n}\n//# sourceMappingURL=hostReportError.js.map\n","/** PURE_IMPORTS_START _config,_util_hostReportError PURE_IMPORTS_END */\nimport { config } from './config';\nimport { hostReportError } from './util/hostReportError';\nexport var empty = {\n closed: true,\n next: function (value) { },\n error: function (err) {\n if (config.useDeprecatedSynchronousErrorHandling) {\n throw err;\n }\n else {\n hostReportError(err);\n }\n },\n complete: function () { }\n};\n//# sourceMappingURL=Observer.js.map\n","/** PURE_IMPORTS_START PURE_IMPORTS_END */\nexport var isArray = /*@__PURE__*/ (function () { return Array.isArray || (function (x) { return x && typeof x.length === 'number'; }); })();\n//# sourceMappingURL=isArray.js.map\n","/** PURE_IMPORTS_START PURE_IMPORTS_END */\nexport function isObject(x) {\n return x !== null && typeof x === 'object';\n}\n//# sourceMappingURL=isObject.js.map\n","/** PURE_IMPORTS_START PURE_IMPORTS_END */\nvar UnsubscriptionErrorImpl = /*@__PURE__*/ (function () {\n function UnsubscriptionErrorImpl(errors) {\n Error.call(this);\n this.message = errors ?\n errors.length + \" errors occurred during unsubscription:\\n\" + errors.map(function (err, i) { return i + 1 + \") \" + err.toString(); }).join('\\n ') : '';\n this.name = 'UnsubscriptionError';\n this.errors = errors;\n return this;\n }\n UnsubscriptionErrorImpl.prototype = /*@__PURE__*/ Object.create(Error.prototype);\n return UnsubscriptionErrorImpl;\n})();\nexport var UnsubscriptionError = UnsubscriptionErrorImpl;\n//# sourceMappingURL=UnsubscriptionError.js.map\n","/** PURE_IMPORTS_START _util_isArray,_util_isObject,_util_isFunction,_util_UnsubscriptionError PURE_IMPORTS_END */\nimport { isArray } from './util/isArray';\nimport { isObject } from './util/isObject';\nimport { isFunction } from './util/isFunction';\nimport { UnsubscriptionError } from './util/UnsubscriptionError';\nvar Subscription = /*@__PURE__*/ (function () {\n function Subscription(unsubscribe) {\n this.closed = false;\n this._parentOrParents = null;\n this._subscriptions = null;\n if (unsubscribe) {\n this._unsubscribe = unsubscribe;\n }\n }\n Subscription.prototype.unsubscribe = function () {\n var errors;\n if (this.closed) {\n return;\n }\n var _a = this, _parentOrParents = _a._parentOrParents, _unsubscribe = _a._unsubscribe, _subscriptions = _a._subscriptions;\n this.closed = true;\n this._parentOrParents = null;\n this._subscriptions = null;\n if (_parentOrParents instanceof Subscription) {\n _parentOrParents.remove(this);\n }\n else if (_parentOrParents !== null) {\n for (var index = 0; index < _parentOrParents.length; ++index) {\n var parent_1 = _parentOrParents[index];\n parent_1.remove(this);\n }\n }\n if (isFunction(_unsubscribe)) {\n try {\n _unsubscribe.call(this);\n }\n catch (e) {\n errors = e instanceof UnsubscriptionError ? flattenUnsubscriptionErrors(e.errors) : [e];\n }\n }\n if (isArray(_subscriptions)) {\n var index = -1;\n var len = _subscriptions.length;\n while (++index < len) {\n var sub = _subscriptions[index];\n if (isObject(sub)) {\n try {\n sub.unsubscribe();\n }\n catch (e) {\n errors = errors || [];\n if (e instanceof UnsubscriptionError) {\n errors = errors.concat(flattenUnsubscriptionErrors(e.errors));\n }\n else {\n errors.push(e);\n }\n }\n }\n }\n }\n if (errors) {\n throw new UnsubscriptionError(errors);\n }\n };\n Subscription.prototype.add = function (teardown) {\n var subscription = teardown;\n if (!teardown) {\n return Subscription.EMPTY;\n }\n switch (typeof teardown) {\n case 'function':\n subscription = new Subscription(teardown);\n case 'object':\n if (subscription === this || subscription.closed || typeof subscription.unsubscribe !== 'function') {\n return subscription;\n }\n else if (this.closed) {\n subscription.unsubscribe();\n return subscription;\n }\n else if (!(subscription instanceof Subscription)) {\n var tmp = subscription;\n subscription = new Subscription();\n subscription._subscriptions = [tmp];\n }\n break;\n default: {\n throw new Error('unrecognized teardown ' + teardown + ' added to Subscription.');\n }\n }\n var _parentOrParents = subscription._parentOrParents;\n if (_parentOrParents === null) {\n subscription._parentOrParents = this;\n }\n else if (_parentOrParents instanceof Subscription) {\n if (_parentOrParents === this) {\n return subscription;\n }\n subscription._parentOrParents = [_parentOrParents, this];\n }\n else if (_parentOrParents.indexOf(this) === -1) {\n _parentOrParents.push(this);\n }\n else {\n return subscription;\n }\n var subscriptions = this._subscriptions;\n if (subscriptions === null) {\n this._subscriptions = [subscription];\n }\n else {\n subscriptions.push(subscription);\n }\n return subscription;\n };\n Subscription.prototype.remove = function (subscription) {\n var subscriptions = this._subscriptions;\n if (subscriptions) {\n var subscriptionIndex = subscriptions.indexOf(subscription);\n if (subscriptionIndex !== -1) {\n subscriptions.splice(subscriptionIndex, 1);\n }\n }\n };\n Subscription.EMPTY = (function (empty) {\n empty.closed = true;\n return empty;\n }(new Subscription()));\n return Subscription;\n}());\nexport { Subscription };\nfunction flattenUnsubscriptionErrors(errors) {\n return errors.reduce(function (errs, err) { return errs.concat((err instanceof UnsubscriptionError) ? err.errors : err); }, []);\n}\n//# sourceMappingURL=Subscription.js.map\n","/** PURE_IMPORTS_START PURE_IMPORTS_END */\nexport var rxSubscriber = /*@__PURE__*/ (function () {\n return typeof Symbol === 'function'\n ? /*@__PURE__*/ Symbol('rxSubscriber')\n : '@@rxSubscriber_' + /*@__PURE__*/ Math.random();\n})();\nexport var $$rxSubscriber = rxSubscriber;\n//# sourceMappingURL=rxSubscriber.js.map\n","/** PURE_IMPORTS_START tslib,_util_isFunction,_Observer,_Subscription,_internal_symbol_rxSubscriber,_config,_util_hostReportError PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { isFunction } from './util/isFunction';\nimport { empty as emptyObserver } from './Observer';\nimport { Subscription } from './Subscription';\nimport { rxSubscriber as rxSubscriberSymbol } from '../internal/symbol/rxSubscriber';\nimport { config } from './config';\nimport { hostReportError } from './util/hostReportError';\nvar Subscriber = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(Subscriber, _super);\n function Subscriber(destinationOrNext, error, complete) {\n var _this = _super.call(this) || this;\n _this.syncErrorValue = null;\n _this.syncErrorThrown = false;\n _this.syncErrorThrowable = false;\n _this.isStopped = false;\n switch (arguments.length) {\n case 0:\n _this.destination = emptyObserver;\n break;\n case 1:\n if (!destinationOrNext) {\n _this.destination = emptyObserver;\n break;\n }\n if (typeof destinationOrNext === 'object') {\n if (destinationOrNext instanceof Subscriber) {\n _this.syncErrorThrowable = destinationOrNext.syncErrorThrowable;\n _this.destination = destinationOrNext;\n destinationOrNext.add(_this);\n }\n else {\n _this.syncErrorThrowable = true;\n _this.destination = new SafeSubscriber(_this, destinationOrNext);\n }\n break;\n }\n default:\n _this.syncErrorThrowable = true;\n _this.destination = new SafeSubscriber(_this, destinationOrNext, error, complete);\n break;\n }\n return _this;\n }\n Subscriber.prototype[rxSubscriberSymbol] = function () { return this; };\n Subscriber.create = function (next, error, complete) {\n var subscriber = new Subscriber(next, error, complete);\n subscriber.syncErrorThrowable = false;\n return subscriber;\n };\n Subscriber.prototype.next = function (value) {\n if (!this.isStopped) {\n this._next(value);\n }\n };\n Subscriber.prototype.error = function (err) {\n if (!this.isStopped) {\n this.isStopped = true;\n this._error(err);\n }\n };\n Subscriber.prototype.complete = function () {\n if (!this.isStopped) {\n this.isStopped = true;\n this._complete();\n }\n };\n Subscriber.prototype.unsubscribe = function () {\n if (this.closed) {\n return;\n }\n this.isStopped = true;\n _super.prototype.unsubscribe.call(this);\n };\n Subscriber.prototype._next = function (value) {\n this.destination.next(value);\n };\n Subscriber.prototype._error = function (err) {\n this.destination.error(err);\n this.unsubscribe();\n };\n Subscriber.prototype._complete = function () {\n this.destination.complete();\n this.unsubscribe();\n };\n Subscriber.prototype._unsubscribeAndRecycle = function () {\n var _parentOrParents = this._parentOrParents;\n this._parentOrParents = null;\n this.unsubscribe();\n this.closed = false;\n this.isStopped = false;\n this._parentOrParents = _parentOrParents;\n return this;\n };\n return Subscriber;\n}(Subscription));\nexport { Subscriber };\nvar SafeSubscriber = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(SafeSubscriber, _super);\n function SafeSubscriber(_parentSubscriber, observerOrNext, error, complete) {\n var _this = _super.call(this) || this;\n _this._parentSubscriber = _parentSubscriber;\n var next;\n var context = _this;\n if (isFunction(observerOrNext)) {\n next = observerOrNext;\n }\n else if (observerOrNext) {\n next = observerOrNext.next;\n error = observerOrNext.error;\n complete = observerOrNext.complete;\n if (observerOrNext !== emptyObserver) {\n context = Object.create(observerOrNext);\n if (isFunction(context.unsubscribe)) {\n _this.add(context.unsubscribe.bind(context));\n }\n context.unsubscribe = _this.unsubscribe.bind(_this);\n }\n }\n _this._context = context;\n _this._next = next;\n _this._error = error;\n _this._complete = complete;\n return _this;\n }\n SafeSubscriber.prototype.next = function (value) {\n if (!this.isStopped && this._next) {\n var _parentSubscriber = this._parentSubscriber;\n if (!config.useDeprecatedSynchronousErrorHandling || !_parentSubscriber.syncErrorThrowable) {\n this.__tryOrUnsub(this._next, value);\n }\n else if (this.__tryOrSetError(_parentSubscriber, this._next, value)) {\n this.unsubscribe();\n }\n }\n };\n SafeSubscriber.prototype.error = function (err) {\n if (!this.isStopped) {\n var _parentSubscriber = this._parentSubscriber;\n var useDeprecatedSynchronousErrorHandling = config.useDeprecatedSynchronousErrorHandling;\n if (this._error) {\n if (!useDeprecatedSynchronousErrorHandling || !_parentSubscriber.syncErrorThrowable) {\n this.__tryOrUnsub(this._error, err);\n this.unsubscribe();\n }\n else {\n this.__tryOrSetError(_parentSubscriber, this._error, err);\n this.unsubscribe();\n }\n }\n else if (!_parentSubscriber.syncErrorThrowable) {\n this.unsubscribe();\n if (useDeprecatedSynchronousErrorHandling) {\n throw err;\n }\n hostReportError(err);\n }\n else {\n if (useDeprecatedSynchronousErrorHandling) {\n _parentSubscriber.syncErrorValue = err;\n _parentSubscriber.syncErrorThrown = true;\n }\n else {\n hostReportError(err);\n }\n this.unsubscribe();\n }\n }\n };\n SafeSubscriber.prototype.complete = function () {\n var _this = this;\n if (!this.isStopped) {\n var _parentSubscriber = this._parentSubscriber;\n if (this._complete) {\n var wrappedComplete = function () { return _this._complete.call(_this._context); };\n if (!config.useDeprecatedSynchronousErrorHandling || !_parentSubscriber.syncErrorThrowable) {\n this.__tryOrUnsub(wrappedComplete);\n this.unsubscribe();\n }\n else {\n this.__tryOrSetError(_parentSubscriber, wrappedComplete);\n this.unsubscribe();\n }\n }\n else {\n this.unsubscribe();\n }\n }\n };\n SafeSubscriber.prototype.__tryOrUnsub = function (fn, value) {\n try {\n fn.call(this._context, value);\n }\n catch (err) {\n this.unsubscribe();\n if (config.useDeprecatedSynchronousErrorHandling) {\n throw err;\n }\n else {\n hostReportError(err);\n }\n }\n };\n SafeSubscriber.prototype.__tryOrSetError = function (parent, fn, value) {\n if (!config.useDeprecatedSynchronousErrorHandling) {\n throw new Error('bad call');\n }\n try {\n fn.call(this._context, value);\n }\n catch (err) {\n if (config.useDeprecatedSynchronousErrorHandling) {\n parent.syncErrorValue = err;\n parent.syncErrorThrown = true;\n return true;\n }\n else {\n hostReportError(err);\n return true;\n }\n }\n return false;\n };\n SafeSubscriber.prototype._unsubscribe = function () {\n var _parentSubscriber = this._parentSubscriber;\n this._context = null;\n this._parentSubscriber = null;\n _parentSubscriber.unsubscribe();\n };\n return SafeSubscriber;\n}(Subscriber));\nexport { SafeSubscriber };\n//# sourceMappingURL=Subscriber.js.map\n","/** PURE_IMPORTS_START PURE_IMPORTS_END */\nexport var observable = /*@__PURE__*/ (function () { return typeof Symbol === 'function' && Symbol.observable || '@@observable'; })();\n//# sourceMappingURL=observable.js.map\n","/** PURE_IMPORTS_START PURE_IMPORTS_END */\nexport function noop() { }\n//# sourceMappingURL=noop.js.map\n","/** PURE_IMPORTS_START _noop PURE_IMPORTS_END */\nimport { noop } from './noop';\nexport function pipe() {\n var fns = [];\n for (var _i = 0; _i < arguments.length; _i++) {\n fns[_i] = arguments[_i];\n }\n return pipeFromArray(fns);\n}\nexport function pipeFromArray(fns) {\n if (!fns) {\n return noop;\n }\n if (fns.length === 1) {\n return fns[0];\n }\n return function piped(input) {\n return fns.reduce(function (prev, fn) { return fn(prev); }, input);\n };\n}\n//# sourceMappingURL=pipe.js.map\n","/** PURE_IMPORTS_START _util_canReportError,_util_toSubscriber,_symbol_observable,_util_pipe,_config PURE_IMPORTS_END */\nimport { canReportError } from './util/canReportError';\nimport { toSubscriber } from './util/toSubscriber';\nimport { observable as Symbol_observable } from './symbol/observable';\nimport { pipeFromArray } from './util/pipe';\nimport { config } from './config';\nvar Observable = /*@__PURE__*/ (function () {\n function Observable(subscribe) {\n this._isScalar = false;\n if (subscribe) {\n this._subscribe = subscribe;\n }\n }\n Observable.prototype.lift = function (operator) {\n var observable = new Observable();\n observable.source = this;\n observable.operator = operator;\n return observable;\n };\n Observable.prototype.subscribe = function (observerOrNext, error, complete) {\n var operator = this.operator;\n var sink = toSubscriber(observerOrNext, error, complete);\n if (operator) {\n sink.add(operator.call(sink, this.source));\n }\n else {\n sink.add(this.source || (config.useDeprecatedSynchronousErrorHandling && !sink.syncErrorThrowable) ?\n this._subscribe(sink) :\n this._trySubscribe(sink));\n }\n if (config.useDeprecatedSynchronousErrorHandling) {\n if (sink.syncErrorThrowable) {\n sink.syncErrorThrowable = false;\n if (sink.syncErrorThrown) {\n throw sink.syncErrorValue;\n }\n }\n }\n return sink;\n };\n Observable.prototype._trySubscribe = function (sink) {\n try {\n return this._subscribe(sink);\n }\n catch (err) {\n if (config.useDeprecatedSynchronousErrorHandling) {\n sink.syncErrorThrown = true;\n sink.syncErrorValue = err;\n }\n if (canReportError(sink)) {\n sink.error(err);\n }\n else {\n console.warn(err);\n }\n }\n };\n Observable.prototype.forEach = function (next, promiseCtor) {\n var _this = this;\n promiseCtor = getPromiseCtor(promiseCtor);\n return new promiseCtor(function (resolve, reject) {\n var subscription;\n subscription = _this.subscribe(function (value) {\n try {\n next(value);\n }\n catch (err) {\n reject(err);\n if (subscription) {\n subscription.unsubscribe();\n }\n }\n }, reject, resolve);\n });\n };\n Observable.prototype._subscribe = function (subscriber) {\n var source = this.source;\n return source && source.subscribe(subscriber);\n };\n Observable.prototype[Symbol_observable] = function () {\n return this;\n };\n Observable.prototype.pipe = function () {\n var operations = [];\n for (var _i = 0; _i < arguments.length; _i++) {\n operations[_i] = arguments[_i];\n }\n if (operations.length === 0) {\n return this;\n }\n return pipeFromArray(operations)(this);\n };\n Observable.prototype.toPromise = function (promiseCtor) {\n var _this = this;\n promiseCtor = getPromiseCtor(promiseCtor);\n return new promiseCtor(function (resolve, reject) {\n var value;\n _this.subscribe(function (x) { return value = x; }, function (err) { return reject(err); }, function () { return resolve(value); });\n });\n };\n Observable.create = function (subscribe) {\n return new Observable(subscribe);\n };\n return Observable;\n}());\nexport { Observable };\nfunction getPromiseCtor(promiseCtor) {\n if (!promiseCtor) {\n promiseCtor = config.Promise || Promise;\n }\n if (!promiseCtor) {\n throw new Error('no Promise impl found');\n }\n return promiseCtor;\n}\n//# sourceMappingURL=Observable.js.map\n","/** PURE_IMPORTS_START _Subscriber,_symbol_rxSubscriber,_Observer PURE_IMPORTS_END */\nimport { Subscriber } from '../Subscriber';\nimport { rxSubscriber as rxSubscriberSymbol } from '../symbol/rxSubscriber';\nimport { empty as emptyObserver } from '../Observer';\nexport function toSubscriber(nextOrObserver, error, complete) {\n if (nextOrObserver) {\n if (nextOrObserver instanceof Subscriber) {\n return nextOrObserver;\n }\n if (nextOrObserver[rxSubscriberSymbol]) {\n return nextOrObserver[rxSubscriberSymbol]();\n }\n }\n if (!nextOrObserver && !error && !complete) {\n return new Subscriber(emptyObserver);\n }\n return new Subscriber(nextOrObserver, error, complete);\n}\n//# sourceMappingURL=toSubscriber.js.map\n","/** PURE_IMPORTS_START _Subscriber PURE_IMPORTS_END */\nimport { Subscriber } from '../Subscriber';\nexport function canReportError(observer) {\n while (observer) {\n var _a = observer, closed_1 = _a.closed, destination = _a.destination, isStopped = _a.isStopped;\n if (closed_1 || isStopped) {\n return false;\n }\n else if (destination && destination instanceof Subscriber) {\n observer = destination;\n }\n else {\n observer = null;\n }\n }\n return true;\n}\n//# sourceMappingURL=canReportError.js.map\n","/** PURE_IMPORTS_START PURE_IMPORTS_END */\nvar ObjectUnsubscribedErrorImpl = /*@__PURE__*/ (function () {\n function ObjectUnsubscribedErrorImpl() {\n Error.call(this);\n this.message = 'object unsubscribed';\n this.name = 'ObjectUnsubscribedError';\n return this;\n }\n ObjectUnsubscribedErrorImpl.prototype = /*@__PURE__*/ Object.create(Error.prototype);\n return ObjectUnsubscribedErrorImpl;\n})();\nexport var ObjectUnsubscribedError = ObjectUnsubscribedErrorImpl;\n//# sourceMappingURL=ObjectUnsubscribedError.js.map\n","/** PURE_IMPORTS_START tslib,_Subscription PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { Subscription } from './Subscription';\nvar SubjectSubscription = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(SubjectSubscription, _super);\n function SubjectSubscription(subject, subscriber) {\n var _this = _super.call(this) || this;\n _this.subject = subject;\n _this.subscriber = subscriber;\n _this.closed = false;\n return _this;\n }\n SubjectSubscription.prototype.unsubscribe = function () {\n if (this.closed) {\n return;\n }\n this.closed = true;\n var subject = this.subject;\n var observers = subject.observers;\n this.subject = null;\n if (!observers || observers.length === 0 || subject.isStopped || subject.closed) {\n return;\n }\n var subscriberIndex = observers.indexOf(this.subscriber);\n if (subscriberIndex !== -1) {\n observers.splice(subscriberIndex, 1);\n }\n };\n return SubjectSubscription;\n}(Subscription));\nexport { SubjectSubscription };\n//# sourceMappingURL=SubjectSubscription.js.map\n","/** PURE_IMPORTS_START tslib,_Observable,_Subscriber,_Subscription,_util_ObjectUnsubscribedError,_SubjectSubscription,_internal_symbol_rxSubscriber PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { Observable } from './Observable';\nimport { Subscriber } from './Subscriber';\nimport { Subscription } from './Subscription';\nimport { ObjectUnsubscribedError } from './util/ObjectUnsubscribedError';\nimport { SubjectSubscription } from './SubjectSubscription';\nimport { rxSubscriber as rxSubscriberSymbol } from '../internal/symbol/rxSubscriber';\nvar SubjectSubscriber = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(SubjectSubscriber, _super);\n function SubjectSubscriber(destination) {\n var _this = _super.call(this, destination) || this;\n _this.destination = destination;\n return _this;\n }\n return SubjectSubscriber;\n}(Subscriber));\nexport { SubjectSubscriber };\nvar Subject = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(Subject, _super);\n function Subject() {\n var _this = _super.call(this) || this;\n _this.observers = [];\n _this.closed = false;\n _this.isStopped = false;\n _this.hasError = false;\n _this.thrownError = null;\n return _this;\n }\n Subject.prototype[rxSubscriberSymbol] = function () {\n return new SubjectSubscriber(this);\n };\n Subject.prototype.lift = function (operator) {\n var subject = new AnonymousSubject(this, this);\n subject.operator = operator;\n return subject;\n };\n Subject.prototype.next = function (value) {\n if (this.closed) {\n throw new ObjectUnsubscribedError();\n }\n if (!this.isStopped) {\n var observers = this.observers;\n var len = observers.length;\n var copy = observers.slice();\n for (var i = 0; i < len; i++) {\n copy[i].next(value);\n }\n }\n };\n Subject.prototype.error = function (err) {\n if (this.closed) {\n throw new ObjectUnsubscribedError();\n }\n this.hasError = true;\n this.thrownError = err;\n this.isStopped = true;\n var observers = this.observers;\n var len = observers.length;\n var copy = observers.slice();\n for (var i = 0; i < len; i++) {\n copy[i].error(err);\n }\n this.observers.length = 0;\n };\n Subject.prototype.complete = function () {\n if (this.closed) {\n throw new ObjectUnsubscribedError();\n }\n this.isStopped = true;\n var observers = this.observers;\n var len = observers.length;\n var copy = observers.slice();\n for (var i = 0; i < len; i++) {\n copy[i].complete();\n }\n this.observers.length = 0;\n };\n Subject.prototype.unsubscribe = function () {\n this.isStopped = true;\n this.closed = true;\n this.observers = null;\n };\n Subject.prototype._trySubscribe = function (subscriber) {\n if (this.closed) {\n throw new ObjectUnsubscribedError();\n }\n else {\n return _super.prototype._trySubscribe.call(this, subscriber);\n }\n };\n Subject.prototype._subscribe = function (subscriber) {\n if (this.closed) {\n throw new ObjectUnsubscribedError();\n }\n else if (this.hasError) {\n subscriber.error(this.thrownError);\n return Subscription.EMPTY;\n }\n else if (this.isStopped) {\n subscriber.complete();\n return Subscription.EMPTY;\n }\n else {\n this.observers.push(subscriber);\n return new SubjectSubscription(this, subscriber);\n }\n };\n Subject.prototype.asObservable = function () {\n var observable = new Observable();\n observable.source = this;\n return observable;\n };\n Subject.create = function (destination, source) {\n return new AnonymousSubject(destination, source);\n };\n return Subject;\n}(Observable));\nexport { Subject };\nvar AnonymousSubject = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(AnonymousSubject, _super);\n function AnonymousSubject(destination, source) {\n var _this = _super.call(this) || this;\n _this.destination = destination;\n _this.source = source;\n return _this;\n }\n AnonymousSubject.prototype.next = function (value) {\n var destination = this.destination;\n if (destination && destination.next) {\n destination.next(value);\n }\n };\n AnonymousSubject.prototype.error = function (err) {\n var destination = this.destination;\n if (destination && destination.error) {\n this.destination.error(err);\n }\n };\n AnonymousSubject.prototype.complete = function () {\n var destination = this.destination;\n if (destination && destination.complete) {\n this.destination.complete();\n }\n };\n AnonymousSubject.prototype._subscribe = function (subscriber) {\n var source = this.source;\n if (source) {\n return this.source.subscribe(subscriber);\n }\n else {\n return Subscription.EMPTY;\n }\n };\n return AnonymousSubject;\n}(Subject));\nexport { AnonymousSubject };\n//# sourceMappingURL=Subject.js.map\n","/** PURE_IMPORTS_START PURE_IMPORTS_END */\nexport function isScheduler(value) {\n return value && typeof value.schedule === 'function';\n}\n//# sourceMappingURL=isScheduler.js.map\n","/** PURE_IMPORTS_START PURE_IMPORTS_END */\nexport var subscribeToArray = function (array) {\n return function (subscriber) {\n for (var i = 0, len = array.length; i < len && !subscriber.closed; i++) {\n subscriber.next(array[i]);\n }\n subscriber.complete();\n };\n};\n//# sourceMappingURL=subscribeToArray.js.map\n","/** PURE_IMPORTS_START _Observable,_Subscription PURE_IMPORTS_END */\nimport { Observable } from '../Observable';\nimport { Subscription } from '../Subscription';\nexport function scheduleArray(input, scheduler) {\n return new Observable(function (subscriber) {\n var sub = new Subscription();\n var i = 0;\n sub.add(scheduler.schedule(function () {\n if (i === input.length) {\n subscriber.complete();\n return;\n }\n subscriber.next(input[i++]);\n if (!subscriber.closed) {\n sub.add(this.schedule());\n }\n }));\n return sub;\n });\n}\n//# sourceMappingURL=scheduleArray.js.map\n","/** PURE_IMPORTS_START _Observable,_util_subscribeToArray,_scheduled_scheduleArray PURE_IMPORTS_END */\nimport { Observable } from '../Observable';\nimport { subscribeToArray } from '../util/subscribeToArray';\nimport { scheduleArray } from '../scheduled/scheduleArray';\nexport function fromArray(input, scheduler) {\n if (!scheduler) {\n return new Observable(subscribeToArray(input));\n }\n else {\n return scheduleArray(input, scheduler);\n }\n}\n//# sourceMappingURL=fromArray.js.map\n","/** PURE_IMPORTS_START _util_isScheduler,_fromArray,_scheduled_scheduleArray PURE_IMPORTS_END */\nimport { isScheduler } from '../util/isScheduler';\nimport { fromArray } from './fromArray';\nimport { scheduleArray } from '../scheduled/scheduleArray';\nexport function of() {\n var args = [];\n for (var _i = 0; _i < arguments.length; _i++) {\n args[_i] = arguments[_i];\n }\n var scheduler = args[args.length - 1];\n if (isScheduler(scheduler)) {\n args.pop();\n return scheduleArray(args, scheduler);\n }\n else {\n return fromArray(args);\n }\n}\n//# sourceMappingURL=of.js.map\n","/** PURE_IMPORTS_START _Observable PURE_IMPORTS_END */\nimport { Observable } from '../Observable';\nexport var EMPTY = /*@__PURE__*/ new Observable(function (subscriber) { return subscriber.complete(); });\nexport function empty(scheduler) {\n return scheduler ? emptyScheduled(scheduler) : EMPTY;\n}\nfunction emptyScheduled(scheduler) {\n return new Observable(function (subscriber) { return scheduler.schedule(function () { return subscriber.complete(); }); });\n}\n//# sourceMappingURL=empty.js.map\n","/** PURE_IMPORTS_START tslib,_Subscriber PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { Subscriber } from '../Subscriber';\nexport function map(project, thisArg) {\n return function mapOperation(source) {\n if (typeof project !== 'function') {\n throw new TypeError('argument is not a function. Are you looking for `mapTo()`?');\n }\n return source.lift(new MapOperator(project, thisArg));\n };\n}\nvar MapOperator = /*@__PURE__*/ (function () {\n function MapOperator(project, thisArg) {\n this.project = project;\n this.thisArg = thisArg;\n }\n MapOperator.prototype.call = function (subscriber, source) {\n return source.subscribe(new MapSubscriber(subscriber, this.project, this.thisArg));\n };\n return MapOperator;\n}());\nexport { MapOperator };\nvar MapSubscriber = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(MapSubscriber, _super);\n function MapSubscriber(destination, project, thisArg) {\n var _this = _super.call(this, destination) || this;\n _this.project = project;\n _this.count = 0;\n _this.thisArg = thisArg || _this;\n return _this;\n }\n MapSubscriber.prototype._next = function (value) {\n var result;\n try {\n result = this.project.call(this.thisArg, value, this.count++);\n }\n catch (err) {\n this.destination.error(err);\n return;\n }\n this.destination.next(result);\n };\n return MapSubscriber;\n}(Subscriber));\n//# sourceMappingURL=map.js.map\n","/** PURE_IMPORTS_START PURE_IMPORTS_END */\nexport function getSymbolIterator() {\n if (typeof Symbol !== 'function' || !Symbol.iterator) {\n return '@@iterator';\n }\n return Symbol.iterator;\n}\nexport var iterator = /*@__PURE__*/ getSymbolIterator();\nexport var $$iterator = iterator;\n//# sourceMappingURL=iterator.js.map\n","/** PURE_IMPORTS_START PURE_IMPORTS_END */\nexport var isArrayLike = (function (x) { return x && typeof x.length === 'number' && typeof x !== 'function'; });\n//# sourceMappingURL=isArrayLike.js.map\n","/** PURE_IMPORTS_START PURE_IMPORTS_END */\nexport function isPromise(value) {\n return !!value && typeof value.subscribe !== 'function' && typeof value.then === 'function';\n}\n//# sourceMappingURL=isPromise.js.map\n","/** PURE_IMPORTS_START _subscribeToArray,_subscribeToPromise,_subscribeToIterable,_subscribeToObservable,_isArrayLike,_isPromise,_isObject,_symbol_iterator,_symbol_observable PURE_IMPORTS_END */\nimport { subscribeToArray } from './subscribeToArray';\nimport { subscribeToPromise } from './subscribeToPromise';\nimport { subscribeToIterable } from './subscribeToIterable';\nimport { subscribeToObservable } from './subscribeToObservable';\nimport { isArrayLike } from './isArrayLike';\nimport { isPromise } from './isPromise';\nimport { isObject } from './isObject';\nimport { iterator as Symbol_iterator } from '../symbol/iterator';\nimport { observable as Symbol_observable } from '../symbol/observable';\nexport var subscribeTo = function (result) {\n if (!!result && typeof result[Symbol_observable] === 'function') {\n return subscribeToObservable(result);\n }\n else if (isArrayLike(result)) {\n return subscribeToArray(result);\n }\n else if (isPromise(result)) {\n return subscribeToPromise(result);\n }\n else if (!!result && typeof result[Symbol_iterator] === 'function') {\n return subscribeToIterable(result);\n }\n else {\n var value = isObject(result) ? 'an invalid object' : \"'\" + result + \"'\";\n var msg = \"You provided \" + value + \" where a stream was expected.\"\n + ' You can provide an Observable, Promise, Array, or Iterable.';\n throw new TypeError(msg);\n }\n};\n//# sourceMappingURL=subscribeTo.js.map\n","/** PURE_IMPORTS_START _symbol_observable PURE_IMPORTS_END */\nimport { observable as Symbol_observable } from '../symbol/observable';\nexport var subscribeToObservable = function (obj) {\n return function (subscriber) {\n var obs = obj[Symbol_observable]();\n if (typeof obs.subscribe !== 'function') {\n throw new TypeError('Provided object does not correctly implement Symbol.observable');\n }\n else {\n return obs.subscribe(subscriber);\n }\n };\n};\n//# sourceMappingURL=subscribeToObservable.js.map\n","/** PURE_IMPORTS_START _hostReportError PURE_IMPORTS_END */\nimport { hostReportError } from './hostReportError';\nexport var subscribeToPromise = function (promise) {\n return function (subscriber) {\n promise.then(function (value) {\n if (!subscriber.closed) {\n subscriber.next(value);\n subscriber.complete();\n }\n }, function (err) { return subscriber.error(err); })\n .then(null, hostReportError);\n return subscriber;\n };\n};\n//# sourceMappingURL=subscribeToPromise.js.map\n","/** PURE_IMPORTS_START _symbol_iterator PURE_IMPORTS_END */\nimport { iterator as Symbol_iterator } from '../symbol/iterator';\nexport var subscribeToIterable = function (iterable) {\n return function (subscriber) {\n var iterator = iterable[Symbol_iterator]();\n do {\n var item = iterator.next();\n if (item.done) {\n subscriber.complete();\n break;\n }\n subscriber.next(item.value);\n if (subscriber.closed) {\n break;\n }\n } while (true);\n if (typeof iterator.return === 'function') {\n subscriber.add(function () {\n if (iterator.return) {\n iterator.return();\n }\n });\n }\n return subscriber;\n };\n};\n//# sourceMappingURL=subscribeToIterable.js.map\n","/** PURE_IMPORTS_START _scheduleObservable,_schedulePromise,_scheduleArray,_scheduleIterable,_util_isInteropObservable,_util_isPromise,_util_isArrayLike,_util_isIterable PURE_IMPORTS_END */\nimport { scheduleObservable } from './scheduleObservable';\nimport { schedulePromise } from './schedulePromise';\nimport { scheduleArray } from './scheduleArray';\nimport { scheduleIterable } from './scheduleIterable';\nimport { isInteropObservable } from '../util/isInteropObservable';\nimport { isPromise } from '../util/isPromise';\nimport { isArrayLike } from '../util/isArrayLike';\nimport { isIterable } from '../util/isIterable';\nexport function scheduled(input, scheduler) {\n if (input != null) {\n if (isInteropObservable(input)) {\n return scheduleObservable(input, scheduler);\n }\n else if (isPromise(input)) {\n return schedulePromise(input, scheduler);\n }\n else if (isArrayLike(input)) {\n return scheduleArray(input, scheduler);\n }\n else if (isIterable(input) || typeof input === 'string') {\n return scheduleIterable(input, scheduler);\n }\n }\n throw new TypeError((input !== null && typeof input || input) + ' is not observable');\n}\n//# sourceMappingURL=scheduled.js.map\n","/** PURE_IMPORTS_START _symbol_observable PURE_IMPORTS_END */\nimport { observable as Symbol_observable } from '../symbol/observable';\nexport function isInteropObservable(input) {\n return input && typeof input[Symbol_observable] === 'function';\n}\n//# sourceMappingURL=isInteropObservable.js.map\n","/** PURE_IMPORTS_START _Observable,_Subscription,_symbol_observable PURE_IMPORTS_END */\nimport { Observable } from '../Observable';\nimport { Subscription } from '../Subscription';\nimport { observable as Symbol_observable } from '../symbol/observable';\nexport function scheduleObservable(input, scheduler) {\n return new Observable(function (subscriber) {\n var sub = new Subscription();\n sub.add(scheduler.schedule(function () {\n var observable = input[Symbol_observable]();\n sub.add(observable.subscribe({\n next: function (value) { sub.add(scheduler.schedule(function () { return subscriber.next(value); })); },\n error: function (err) { sub.add(scheduler.schedule(function () { return subscriber.error(err); })); },\n complete: function () { sub.add(scheduler.schedule(function () { return subscriber.complete(); })); },\n }));\n }));\n return sub;\n });\n}\n//# sourceMappingURL=scheduleObservable.js.map\n","/** PURE_IMPORTS_START _Observable,_Subscription PURE_IMPORTS_END */\nimport { Observable } from '../Observable';\nimport { Subscription } from '../Subscription';\nexport function schedulePromise(input, scheduler) {\n return new Observable(function (subscriber) {\n var sub = new Subscription();\n sub.add(scheduler.schedule(function () {\n return input.then(function (value) {\n sub.add(scheduler.schedule(function () {\n subscriber.next(value);\n sub.add(scheduler.schedule(function () { return subscriber.complete(); }));\n }));\n }, function (err) {\n sub.add(scheduler.schedule(function () { return subscriber.error(err); }));\n });\n }));\n return sub;\n });\n}\n//# sourceMappingURL=schedulePromise.js.map\n","/** PURE_IMPORTS_START _symbol_iterator PURE_IMPORTS_END */\nimport { iterator as Symbol_iterator } from '../symbol/iterator';\nexport function isIterable(input) {\n return input && typeof input[Symbol_iterator] === 'function';\n}\n//# sourceMappingURL=isIterable.js.map\n","/** PURE_IMPORTS_START _Observable,_Subscription,_symbol_iterator PURE_IMPORTS_END */\nimport { Observable } from '../Observable';\nimport { Subscription } from '../Subscription';\nimport { iterator as Symbol_iterator } from '../symbol/iterator';\nexport function scheduleIterable(input, scheduler) {\n if (!input) {\n throw new Error('Iterable cannot be null');\n }\n return new Observable(function (subscriber) {\n var sub = new Subscription();\n var iterator;\n sub.add(function () {\n if (iterator && typeof iterator.return === 'function') {\n iterator.return();\n }\n });\n sub.add(scheduler.schedule(function () {\n iterator = input[Symbol_iterator]();\n sub.add(scheduler.schedule(function () {\n if (subscriber.closed) {\n return;\n }\n var value;\n var done;\n try {\n var result = iterator.next();\n value = result.value;\n done = result.done;\n }\n catch (err) {\n subscriber.error(err);\n return;\n }\n if (done) {\n subscriber.complete();\n }\n else {\n subscriber.next(value);\n this.schedule();\n }\n }));\n }));\n return sub;\n });\n}\n//# sourceMappingURL=scheduleIterable.js.map\n","/** PURE_IMPORTS_START _Observable,_util_subscribeTo,_scheduled_scheduled PURE_IMPORTS_END */\nimport { Observable } from '../Observable';\nimport { subscribeTo } from '../util/subscribeTo';\nimport { scheduled } from '../scheduled/scheduled';\nexport function from(input, scheduler) {\n if (!scheduler) {\n if (input instanceof Observable) {\n return input;\n }\n return new Observable(subscribeTo(input));\n }\n else {\n return scheduled(input, scheduler);\n }\n}\n//# sourceMappingURL=from.js.map\n","/** PURE_IMPORTS_START _Observable,_util_isArray,_operators_map,_util_isObject,_from PURE_IMPORTS_END */\nimport { Observable } from '../Observable';\nimport { isArray } from '../util/isArray';\nimport { map } from '../operators/map';\nimport { isObject } from '../util/isObject';\nimport { from } from './from';\nexport function forkJoin() {\n var sources = [];\n for (var _i = 0; _i < arguments.length; _i++) {\n sources[_i] = arguments[_i];\n }\n if (sources.length === 1) {\n var first_1 = sources[0];\n if (isArray(first_1)) {\n return forkJoinInternal(first_1, null);\n }\n if (isObject(first_1) && Object.getPrototypeOf(first_1) === Object.prototype) {\n var keys = Object.keys(first_1);\n return forkJoinInternal(keys.map(function (key) { return first_1[key]; }), keys);\n }\n }\n if (typeof sources[sources.length - 1] === 'function') {\n var resultSelector_1 = sources.pop();\n sources = (sources.length === 1 && isArray(sources[0])) ? sources[0] : sources;\n return forkJoinInternal(sources, null).pipe(map(function (args) { return resultSelector_1.apply(void 0, args); }));\n }\n return forkJoinInternal(sources, null);\n}\nfunction forkJoinInternal(sources, keys) {\n return new Observable(function (subscriber) {\n var len = sources.length;\n if (len === 0) {\n subscriber.complete();\n return;\n }\n var values = new Array(len);\n var completed = 0;\n var emitted = 0;\n var _loop_1 = function (i) {\n var source = from(sources[i]);\n var hasValue = false;\n subscriber.add(source.subscribe({\n next: function (value) {\n if (!hasValue) {\n hasValue = true;\n emitted++;\n }\n values[i] = value;\n },\n error: function (err) { return subscriber.error(err); },\n complete: function () {\n completed++;\n if (completed === len || !hasValue) {\n if (emitted === len) {\n subscriber.next(keys ?\n keys.reduce(function (result, key, i) { return (result[key] = values[i], result); }, {}) :\n values);\n }\n subscriber.complete();\n }\n }\n }));\n };\n for (var i = 0; i < len; i++) {\n _loop_1(i);\n }\n });\n}\n//# sourceMappingURL=forkJoin.js.map\n","/** PURE_IMPORTS_START _Observable,_util_isArray,_util_isFunction,_operators_map PURE_IMPORTS_END */\nimport { Observable } from '../Observable';\nimport { isArray } from '../util/isArray';\nimport { isFunction } from '../util/isFunction';\nimport { map } from '../operators/map';\nvar toString = /*@__PURE__*/ (function () { return Object.prototype.toString; })();\nexport function fromEvent(target, eventName, options, resultSelector) {\n if (isFunction(options)) {\n resultSelector = options;\n options = undefined;\n }\n if (resultSelector) {\n return fromEvent(target, eventName, options).pipe(map(function (args) { return isArray(args) ? resultSelector.apply(void 0, args) : resultSelector(args); }));\n }\n return new Observable(function (subscriber) {\n function handler(e) {\n if (arguments.length > 1) {\n subscriber.next(Array.prototype.slice.call(arguments));\n }\n else {\n subscriber.next(e);\n }\n }\n setupSubscription(target, eventName, handler, subscriber, options);\n });\n}\nfunction setupSubscription(sourceObj, eventName, handler, subscriber, options) {\n var unsubscribe;\n if (isEventTarget(sourceObj)) {\n var source_1 = sourceObj;\n sourceObj.addEventListener(eventName, handler, options);\n unsubscribe = function () { return source_1.removeEventListener(eventName, handler, options); };\n }\n else if (isJQueryStyleEventEmitter(sourceObj)) {\n var source_2 = sourceObj;\n sourceObj.on(eventName, handler);\n unsubscribe = function () { return source_2.off(eventName, handler); };\n }\n else if (isNodeStyleEventEmitter(sourceObj)) {\n var source_3 = sourceObj;\n sourceObj.addListener(eventName, handler);\n unsubscribe = function () { return source_3.removeListener(eventName, handler); };\n }\n else if (sourceObj && sourceObj.length) {\n for (var i = 0, len = sourceObj.length; i < len; i++) {\n setupSubscription(sourceObj[i], eventName, handler, subscriber, options);\n }\n }\n else {\n throw new TypeError('Invalid event target');\n }\n subscriber.add(unsubscribe);\n}\nfunction isNodeStyleEventEmitter(sourceObj) {\n return sourceObj && typeof sourceObj.addListener === 'function' && typeof sourceObj.removeListener === 'function';\n}\nfunction isJQueryStyleEventEmitter(sourceObj) {\n return sourceObj && typeof sourceObj.on === 'function' && typeof sourceObj.off === 'function';\n}\nfunction isEventTarget(sourceObj) {\n return sourceObj && typeof sourceObj.addEventListener === 'function' && typeof sourceObj.removeEventListener === 'function';\n}\n//# sourceMappingURL=fromEvent.js.map\n","/** PURE_IMPORTS_START _Observable,_util_noop PURE_IMPORTS_END */\nimport { Observable } from '../Observable';\nimport { noop } from '../util/noop';\nexport var NEVER = /*@__PURE__*/ new Observable(noop);\nexport function never() {\n return NEVER;\n}\n//# sourceMappingURL=never.js.map\n","/** PURE_IMPORTS_START tslib,_Subscriber PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { Subscriber } from './Subscriber';\nvar InnerSubscriber = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(InnerSubscriber, _super);\n function InnerSubscriber(parent, outerValue, outerIndex) {\n var _this = _super.call(this) || this;\n _this.parent = parent;\n _this.outerValue = outerValue;\n _this.outerIndex = outerIndex;\n _this.index = 0;\n return _this;\n }\n InnerSubscriber.prototype._next = function (value) {\n this.parent.notifyNext(this.outerValue, value, this.outerIndex, this.index++, this);\n };\n InnerSubscriber.prototype._error = function (error) {\n this.parent.notifyError(error, this);\n this.unsubscribe();\n };\n InnerSubscriber.prototype._complete = function () {\n this.parent.notifyComplete(this);\n this.unsubscribe();\n };\n return InnerSubscriber;\n}(Subscriber));\nexport { InnerSubscriber };\n//# sourceMappingURL=InnerSubscriber.js.map\n","/** PURE_IMPORTS_START _InnerSubscriber,_subscribeTo,_Observable PURE_IMPORTS_END */\nimport { InnerSubscriber } from '../InnerSubscriber';\nimport { subscribeTo } from './subscribeTo';\nimport { Observable } from '../Observable';\nexport function subscribeToResult(outerSubscriber, result, outerValue, outerIndex, destination) {\n if (destination === void 0) {\n destination = new InnerSubscriber(outerSubscriber, outerValue, outerIndex);\n }\n if (destination.closed) {\n return undefined;\n }\n if (result instanceof Observable) {\n return result.subscribe(destination);\n }\n return subscribeTo(result)(destination);\n}\n//# sourceMappingURL=subscribeToResult.js.map\n","/** PURE_IMPORTS_START tslib,_Subscriber PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { Subscriber } from './Subscriber';\nvar OuterSubscriber = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(OuterSubscriber, _super);\n function OuterSubscriber() {\n return _super !== null && _super.apply(this, arguments) || this;\n }\n OuterSubscriber.prototype.notifyNext = function (outerValue, innerValue, outerIndex, innerIndex, innerSub) {\n this.destination.next(innerValue);\n };\n OuterSubscriber.prototype.notifyError = function (error, innerSub) {\n this.destination.error(error);\n };\n OuterSubscriber.prototype.notifyComplete = function (innerSub) {\n this.destination.complete();\n };\n return OuterSubscriber;\n}(Subscriber));\nexport { OuterSubscriber };\n//# sourceMappingURL=OuterSubscriber.js.map\n","/** PURE_IMPORTS_START tslib,_util_subscribeToResult,_OuterSubscriber,_InnerSubscriber,_map,_observable_from PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { subscribeToResult } from '../util/subscribeToResult';\nimport { OuterSubscriber } from '../OuterSubscriber';\nimport { InnerSubscriber } from '../InnerSubscriber';\nimport { map } from './map';\nimport { from } from '../observable/from';\nexport function mergeMap(project, resultSelector, concurrent) {\n if (concurrent === void 0) {\n concurrent = Number.POSITIVE_INFINITY;\n }\n if (typeof resultSelector === 'function') {\n return function (source) { return source.pipe(mergeMap(function (a, i) { return from(project(a, i)).pipe(map(function (b, ii) { return resultSelector(a, b, i, ii); })); }, concurrent)); };\n }\n else if (typeof resultSelector === 'number') {\n concurrent = resultSelector;\n }\n return function (source) { return source.lift(new MergeMapOperator(project, concurrent)); };\n}\nvar MergeMapOperator = /*@__PURE__*/ (function () {\n function MergeMapOperator(project, concurrent) {\n if (concurrent === void 0) {\n concurrent = Number.POSITIVE_INFINITY;\n }\n this.project = project;\n this.concurrent = concurrent;\n }\n MergeMapOperator.prototype.call = function (observer, source) {\n return source.subscribe(new MergeMapSubscriber(observer, this.project, this.concurrent));\n };\n return MergeMapOperator;\n}());\nexport { MergeMapOperator };\nvar MergeMapSubscriber = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(MergeMapSubscriber, _super);\n function MergeMapSubscriber(destination, project, concurrent) {\n if (concurrent === void 0) {\n concurrent = Number.POSITIVE_INFINITY;\n }\n var _this = _super.call(this, destination) || this;\n _this.project = project;\n _this.concurrent = concurrent;\n _this.hasCompleted = false;\n _this.buffer = [];\n _this.active = 0;\n _this.index = 0;\n return _this;\n }\n MergeMapSubscriber.prototype._next = function (value) {\n if (this.active < this.concurrent) {\n this._tryNext(value);\n }\n else {\n this.buffer.push(value);\n }\n };\n MergeMapSubscriber.prototype._tryNext = function (value) {\n var result;\n var index = this.index++;\n try {\n result = this.project(value, index);\n }\n catch (err) {\n this.destination.error(err);\n return;\n }\n this.active++;\n this._innerSub(result, value, index);\n };\n MergeMapSubscriber.prototype._innerSub = function (ish, value, index) {\n var innerSubscriber = new InnerSubscriber(this, undefined, undefined);\n var destination = this.destination;\n destination.add(innerSubscriber);\n subscribeToResult(this, ish, value, index, innerSubscriber);\n };\n MergeMapSubscriber.prototype._complete = function () {\n this.hasCompleted = true;\n if (this.active === 0 && this.buffer.length === 0) {\n this.destination.complete();\n }\n this.unsubscribe();\n };\n MergeMapSubscriber.prototype.notifyNext = function (outerValue, innerValue, outerIndex, innerIndex, innerSub) {\n this.destination.next(innerValue);\n };\n MergeMapSubscriber.prototype.notifyComplete = function (innerSub) {\n var buffer = this.buffer;\n this.remove(innerSub);\n this.active--;\n if (buffer.length > 0) {\n this._next(buffer.shift());\n }\n else if (this.active === 0 && this.hasCompleted) {\n this.destination.complete();\n }\n };\n return MergeMapSubscriber;\n}(OuterSubscriber));\nexport { MergeMapSubscriber };\n//# sourceMappingURL=mergeMap.js.map\n","/** PURE_IMPORTS_START PURE_IMPORTS_END */\nexport function identity(x) {\n return x;\n}\n//# sourceMappingURL=identity.js.map\n","/** PURE_IMPORTS_START _mergeMap,_util_identity PURE_IMPORTS_END */\nimport { mergeMap } from './mergeMap';\nimport { identity } from '../util/identity';\nexport function mergeAll(concurrent) {\n if (concurrent === void 0) {\n concurrent = Number.POSITIVE_INFINITY;\n }\n return mergeMap(identity, concurrent);\n}\n//# sourceMappingURL=mergeAll.js.map\n","/** PURE_IMPORTS_START _Observable,_util_isScheduler,_operators_mergeAll,_fromArray PURE_IMPORTS_END */\nimport { Observable } from '../Observable';\nimport { isScheduler } from '../util/isScheduler';\nimport { mergeAll } from '../operators/mergeAll';\nimport { fromArray } from './fromArray';\nexport function merge() {\n var observables = [];\n for (var _i = 0; _i < arguments.length; _i++) {\n observables[_i] = arguments[_i];\n }\n var concurrent = Number.POSITIVE_INFINITY;\n var scheduler = null;\n var last = observables[observables.length - 1];\n if (isScheduler(last)) {\n scheduler = observables.pop();\n if (observables.length > 1 && typeof observables[observables.length - 1] === 'number') {\n concurrent = observables.pop();\n }\n }\n else if (typeof last === 'number') {\n concurrent = observables.pop();\n }\n if (scheduler === null && observables.length === 1 && observables[0] instanceof Observable) {\n return observables[0];\n }\n return mergeAll(concurrent)(fromArray(observables, scheduler));\n}\n//# sourceMappingURL=merge.js.map\n","/** PURE_IMPORTS_START tslib,_.._util_root,_.._Observable,_.._Subscriber,_.._operators_map PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { root } from '../../util/root';\nimport { Observable } from '../../Observable';\nimport { Subscriber } from '../../Subscriber';\nimport { map } from '../../operators/map';\nfunction getCORSRequest() {\n if (root.XMLHttpRequest) {\n return new root.XMLHttpRequest();\n }\n else if (!!root.XDomainRequest) {\n return new root.XDomainRequest();\n }\n else {\n throw new Error('CORS is not supported by your browser');\n }\n}\nfunction getXMLHttpRequest() {\n if (root.XMLHttpRequest) {\n return new root.XMLHttpRequest();\n }\n else {\n var progId = void 0;\n try {\n var progIds = ['Msxml2.XMLHTTP', 'Microsoft.XMLHTTP', 'Msxml2.XMLHTTP.4.0'];\n for (var i = 0; i < 3; i++) {\n try {\n progId = progIds[i];\n if (new root.ActiveXObject(progId)) {\n break;\n }\n }\n catch (e) {\n }\n }\n return new root.ActiveXObject(progId);\n }\n catch (e) {\n throw new Error('XMLHttpRequest is not supported by your browser');\n }\n }\n}\nexport function ajaxGet(url, headers) {\n if (headers === void 0) {\n headers = null;\n }\n return new AjaxObservable({ method: 'GET', url: url, headers: headers });\n}\nexport function ajaxPost(url, body, headers) {\n return new AjaxObservable({ method: 'POST', url: url, body: body, headers: headers });\n}\nexport function ajaxDelete(url, headers) {\n return new AjaxObservable({ method: 'DELETE', url: url, headers: headers });\n}\nexport function ajaxPut(url, body, headers) {\n return new AjaxObservable({ method: 'PUT', url: url, body: body, headers: headers });\n}\nexport function ajaxPatch(url, body, headers) {\n return new AjaxObservable({ method: 'PATCH', url: url, body: body, headers: headers });\n}\nvar mapResponse = /*@__PURE__*/ map(function (x, index) { return x.response; });\nexport function ajaxGetJSON(url, headers) {\n return mapResponse(new AjaxObservable({\n method: 'GET',\n url: url,\n responseType: 'json',\n headers: headers\n }));\n}\nvar AjaxObservable = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(AjaxObservable, _super);\n function AjaxObservable(urlOrRequest) {\n var _this = _super.call(this) || this;\n var request = {\n async: true,\n createXHR: function () {\n return this.crossDomain ? getCORSRequest() : getXMLHttpRequest();\n },\n crossDomain: true,\n withCredentials: false,\n headers: {},\n method: 'GET',\n responseType: 'json',\n timeout: 0\n };\n if (typeof urlOrRequest === 'string') {\n request.url = urlOrRequest;\n }\n else {\n for (var prop in urlOrRequest) {\n if (urlOrRequest.hasOwnProperty(prop)) {\n request[prop] = urlOrRequest[prop];\n }\n }\n }\n _this.request = request;\n return _this;\n }\n AjaxObservable.prototype._subscribe = function (subscriber) {\n return new AjaxSubscriber(subscriber, this.request);\n };\n AjaxObservable.create = (function () {\n var create = function (urlOrRequest) {\n return new AjaxObservable(urlOrRequest);\n };\n create.get = ajaxGet;\n create.post = ajaxPost;\n create.delete = ajaxDelete;\n create.put = ajaxPut;\n create.patch = ajaxPatch;\n create.getJSON = ajaxGetJSON;\n return create;\n })();\n return AjaxObservable;\n}(Observable));\nexport { AjaxObservable };\nvar AjaxSubscriber = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(AjaxSubscriber, _super);\n function AjaxSubscriber(destination, request) {\n var _this = _super.call(this, destination) || this;\n _this.request = request;\n _this.done = false;\n var headers = request.headers = request.headers || {};\n if (!request.crossDomain && !_this.getHeader(headers, 'X-Requested-With')) {\n headers['X-Requested-With'] = 'XMLHttpRequest';\n }\n var contentTypeHeader = _this.getHeader(headers, 'Content-Type');\n if (!contentTypeHeader && !(root.FormData && request.body instanceof root.FormData) && typeof request.body !== 'undefined') {\n headers['Content-Type'] = 'application/x-www-form-urlencoded; charset=UTF-8';\n }\n request.body = _this.serializeBody(request.body, _this.getHeader(request.headers, 'Content-Type'));\n _this.send();\n return _this;\n }\n AjaxSubscriber.prototype.next = function (e) {\n this.done = true;\n var _a = this, xhr = _a.xhr, request = _a.request, destination = _a.destination;\n var result;\n try {\n result = new AjaxResponse(e, xhr, request);\n }\n catch (err) {\n return destination.error(err);\n }\n destination.next(result);\n };\n AjaxSubscriber.prototype.send = function () {\n var _a = this, request = _a.request, _b = _a.request, user = _b.user, method = _b.method, url = _b.url, async = _b.async, password = _b.password, headers = _b.headers, body = _b.body;\n try {\n var xhr = this.xhr = request.createXHR();\n this.setupEvents(xhr, request);\n if (user) {\n xhr.open(method, url, async, user, password);\n }\n else {\n xhr.open(method, url, async);\n }\n if (async) {\n xhr.timeout = request.timeout;\n xhr.responseType = request.responseType;\n }\n if ('withCredentials' in xhr) {\n xhr.withCredentials = !!request.withCredentials;\n }\n this.setHeaders(xhr, headers);\n if (body) {\n xhr.send(body);\n }\n else {\n xhr.send();\n }\n }\n catch (err) {\n this.error(err);\n }\n };\n AjaxSubscriber.prototype.serializeBody = function (body, contentType) {\n if (!body || typeof body === 'string') {\n return body;\n }\n else if (root.FormData && body instanceof root.FormData) {\n return body;\n }\n if (contentType) {\n var splitIndex = contentType.indexOf(';');\n if (splitIndex !== -1) {\n contentType = contentType.substring(0, splitIndex);\n }\n }\n switch (contentType) {\n case 'application/x-www-form-urlencoded':\n return Object.keys(body).map(function (key) { return encodeURIComponent(key) + \"=\" + encodeURIComponent(body[key]); }).join('&');\n case 'application/json':\n return JSON.stringify(body);\n default:\n return body;\n }\n };\n AjaxSubscriber.prototype.setHeaders = function (xhr, headers) {\n for (var key in headers) {\n if (headers.hasOwnProperty(key)) {\n xhr.setRequestHeader(key, headers[key]);\n }\n }\n };\n AjaxSubscriber.prototype.getHeader = function (headers, headerName) {\n for (var key in headers) {\n if (key.toLowerCase() === headerName.toLowerCase()) {\n return headers[key];\n }\n }\n return undefined;\n };\n AjaxSubscriber.prototype.setupEvents = function (xhr, request) {\n var progressSubscriber = request.progressSubscriber;\n function xhrTimeout(e) {\n var _a = xhrTimeout, subscriber = _a.subscriber, progressSubscriber = _a.progressSubscriber, request = _a.request;\n if (progressSubscriber) {\n progressSubscriber.error(e);\n }\n var error;\n try {\n error = new AjaxTimeoutError(this, request);\n }\n catch (err) {\n error = err;\n }\n subscriber.error(error);\n }\n xhr.ontimeout = xhrTimeout;\n xhrTimeout.request = request;\n xhrTimeout.subscriber = this;\n xhrTimeout.progressSubscriber = progressSubscriber;\n if (xhr.upload && 'withCredentials' in xhr) {\n if (progressSubscriber) {\n var xhrProgress_1;\n xhrProgress_1 = function (e) {\n var progressSubscriber = xhrProgress_1.progressSubscriber;\n progressSubscriber.next(e);\n };\n if (root.XDomainRequest) {\n xhr.onprogress = xhrProgress_1;\n }\n else {\n xhr.upload.onprogress = xhrProgress_1;\n }\n xhrProgress_1.progressSubscriber = progressSubscriber;\n }\n var xhrError_1;\n xhrError_1 = function (e) {\n var _a = xhrError_1, progressSubscriber = _a.progressSubscriber, subscriber = _a.subscriber, request = _a.request;\n if (progressSubscriber) {\n progressSubscriber.error(e);\n }\n var error;\n try {\n error = new AjaxError('ajax error', this, request);\n }\n catch (err) {\n error = err;\n }\n subscriber.error(error);\n };\n xhr.onerror = xhrError_1;\n xhrError_1.request = request;\n xhrError_1.subscriber = this;\n xhrError_1.progressSubscriber = progressSubscriber;\n }\n function xhrReadyStateChange(e) {\n return;\n }\n xhr.onreadystatechange = xhrReadyStateChange;\n xhrReadyStateChange.subscriber = this;\n xhrReadyStateChange.progressSubscriber = progressSubscriber;\n xhrReadyStateChange.request = request;\n function xhrLoad(e) {\n var _a = xhrLoad, subscriber = _a.subscriber, progressSubscriber = _a.progressSubscriber, request = _a.request;\n if (this.readyState === 4) {\n var status_1 = this.status === 1223 ? 204 : this.status;\n var response = (this.responseType === 'text' ? (this.response || this.responseText) : this.response);\n if (status_1 === 0) {\n status_1 = response ? 200 : 0;\n }\n if (status_1 < 400) {\n if (progressSubscriber) {\n progressSubscriber.complete();\n }\n subscriber.next(e);\n subscriber.complete();\n }\n else {\n if (progressSubscriber) {\n progressSubscriber.error(e);\n }\n var error = void 0;\n try {\n error = new AjaxError('ajax error ' + status_1, this, request);\n }\n catch (err) {\n error = err;\n }\n subscriber.error(error);\n }\n }\n }\n xhr.onload = xhrLoad;\n xhrLoad.subscriber = this;\n xhrLoad.progressSubscriber = progressSubscriber;\n xhrLoad.request = request;\n };\n AjaxSubscriber.prototype.unsubscribe = function () {\n var _a = this, done = _a.done, xhr = _a.xhr;\n if (!done && xhr && xhr.readyState !== 4 && typeof xhr.abort === 'function') {\n xhr.abort();\n }\n _super.prototype.unsubscribe.call(this);\n };\n return AjaxSubscriber;\n}(Subscriber));\nexport { AjaxSubscriber };\nvar AjaxResponse = /*@__PURE__*/ (function () {\n function AjaxResponse(originalEvent, xhr, request) {\n this.originalEvent = originalEvent;\n this.xhr = xhr;\n this.request = request;\n this.status = xhr.status;\n this.responseType = xhr.responseType || request.responseType;\n this.response = parseXhrResponse(this.responseType, xhr);\n }\n return AjaxResponse;\n}());\nexport { AjaxResponse };\nvar AjaxErrorImpl = /*@__PURE__*/ (function () {\n function AjaxErrorImpl(message, xhr, request) {\n Error.call(this);\n this.message = message;\n this.name = 'AjaxError';\n this.xhr = xhr;\n this.request = request;\n this.status = xhr.status;\n this.responseType = xhr.responseType || request.responseType;\n this.response = parseXhrResponse(this.responseType, xhr);\n return this;\n }\n AjaxErrorImpl.prototype = /*@__PURE__*/ Object.create(Error.prototype);\n return AjaxErrorImpl;\n})();\nexport var AjaxError = AjaxErrorImpl;\nfunction parseJson(xhr) {\n if ('response' in xhr) {\n return xhr.responseType ? xhr.response : JSON.parse(xhr.response || xhr.responseText || 'null');\n }\n else {\n return JSON.parse(xhr.responseText || 'null');\n }\n}\nfunction parseXhrResponse(responseType, xhr) {\n switch (responseType) {\n case 'json':\n return parseJson(xhr);\n case 'xml':\n return xhr.responseXML;\n case 'text':\n default:\n return ('response' in xhr) ? xhr.response : xhr.responseText;\n }\n}\nfunction AjaxTimeoutErrorImpl(xhr, request) {\n AjaxError.call(this, 'ajax timeout', xhr, request);\n this.name = 'AjaxTimeoutError';\n return this;\n}\nexport var AjaxTimeoutError = AjaxTimeoutErrorImpl;\n//# sourceMappingURL=AjaxObservable.js.map\n","/** PURE_IMPORTS_START _AjaxObservable PURE_IMPORTS_END */\nimport { AjaxObservable } from './AjaxObservable';\nexport var ajax = /*@__PURE__*/ (function () { return AjaxObservable.create; })();\n//# sourceMappingURL=ajax.js.map\n","/** PURE_IMPORTS_START tslib,_Subscriber PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { Subscriber } from '../Subscriber';\nexport function filter(predicate, thisArg) {\n return function filterOperatorFunction(source) {\n return source.lift(new FilterOperator(predicate, thisArg));\n };\n}\nvar FilterOperator = /*@__PURE__*/ (function () {\n function FilterOperator(predicate, thisArg) {\n this.predicate = predicate;\n this.thisArg = thisArg;\n }\n FilterOperator.prototype.call = function (subscriber, source) {\n return source.subscribe(new FilterSubscriber(subscriber, this.predicate, this.thisArg));\n };\n return FilterOperator;\n}());\nvar FilterSubscriber = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(FilterSubscriber, _super);\n function FilterSubscriber(destination, predicate, thisArg) {\n var _this = _super.call(this, destination) || this;\n _this.predicate = predicate;\n _this.thisArg = thisArg;\n _this.count = 0;\n return _this;\n }\n FilterSubscriber.prototype._next = function (value) {\n var result;\n try {\n result = this.predicate.call(this.thisArg, value, this.count++);\n }\n catch (err) {\n this.destination.error(err);\n return;\n }\n if (result) {\n this.destination.next(value);\n }\n };\n return FilterSubscriber;\n}(Subscriber));\n//# sourceMappingURL=filter.js.map\n","/** PURE_IMPORTS_START tslib,_Subscriber,_util_noop,_util_isFunction PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { Subscriber } from '../Subscriber';\nimport { noop } from '../util/noop';\nimport { isFunction } from '../util/isFunction';\nexport function tap(nextOrObserver, error, complete) {\n return function tapOperatorFunction(source) {\n return source.lift(new DoOperator(nextOrObserver, error, complete));\n };\n}\nvar DoOperator = /*@__PURE__*/ (function () {\n function DoOperator(nextOrObserver, error, complete) {\n this.nextOrObserver = nextOrObserver;\n this.error = error;\n this.complete = complete;\n }\n DoOperator.prototype.call = function (subscriber, source) {\n return source.subscribe(new TapSubscriber(subscriber, this.nextOrObserver, this.error, this.complete));\n };\n return DoOperator;\n}());\nvar TapSubscriber = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(TapSubscriber, _super);\n function TapSubscriber(destination, observerOrNext, error, complete) {\n var _this = _super.call(this, destination) || this;\n _this._tapNext = noop;\n _this._tapError = noop;\n _this._tapComplete = noop;\n _this._tapError = error || noop;\n _this._tapComplete = complete || noop;\n if (isFunction(observerOrNext)) {\n _this._context = _this;\n _this._tapNext = observerOrNext;\n }\n else if (observerOrNext) {\n _this._context = observerOrNext;\n _this._tapNext = observerOrNext.next || noop;\n _this._tapError = observerOrNext.error || noop;\n _this._tapComplete = observerOrNext.complete || noop;\n }\n return _this;\n }\n TapSubscriber.prototype._next = function (value) {\n try {\n this._tapNext.call(this._context, value);\n }\n catch (err) {\n this.destination.error(err);\n return;\n }\n this.destination.next(value);\n };\n TapSubscriber.prototype._error = function (err) {\n try {\n this._tapError.call(this._context, err);\n }\n catch (err) {\n this.destination.error(err);\n return;\n }\n this.destination.error(err);\n };\n TapSubscriber.prototype._complete = function () {\n try {\n this._tapComplete.call(this._context);\n }\n catch (err) {\n this.destination.error(err);\n return;\n }\n return this.destination.complete();\n };\n return TapSubscriber;\n}(Subscriber));\n//# sourceMappingURL=tap.js.map\n","/** PURE_IMPORTS_START _map PURE_IMPORTS_END */\nimport { map } from './map';\nexport function pluck() {\n var properties = [];\n for (var _i = 0; _i < arguments.length; _i++) {\n properties[_i] = arguments[_i];\n }\n var length = properties.length;\n if (length === 0) {\n throw new Error('list of properties cannot be empty.');\n }\n return function (source) { return map(plucker(properties, length))(source); };\n}\nfunction plucker(props, length) {\n var mapper = function (x) {\n var currentProp = x;\n for (var i = 0; i < length; i++) {\n var p = currentProp[props[i]];\n if (typeof p !== 'undefined') {\n currentProp = p;\n }\n else {\n return undefined;\n }\n }\n return currentProp;\n };\n return mapper;\n}\n//# sourceMappingURL=pluck.js.map\n","/** PURE_IMPORTS_START PURE_IMPORTS_END */\nvar ArgumentOutOfRangeErrorImpl = /*@__PURE__*/ (function () {\n function ArgumentOutOfRangeErrorImpl() {\n Error.call(this);\n this.message = 'argument out of range';\n this.name = 'ArgumentOutOfRangeError';\n return this;\n }\n ArgumentOutOfRangeErrorImpl.prototype = /*@__PURE__*/ Object.create(Error.prototype);\n return ArgumentOutOfRangeErrorImpl;\n})();\nexport var ArgumentOutOfRangeError = ArgumentOutOfRangeErrorImpl;\n//# sourceMappingURL=ArgumentOutOfRangeError.js.map\n","/** PURE_IMPORTS_START tslib,_Subscriber,_util_ArgumentOutOfRangeError,_observable_empty PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { Subscriber } from '../Subscriber';\nimport { ArgumentOutOfRangeError } from '../util/ArgumentOutOfRangeError';\nimport { empty } from '../observable/empty';\nexport function take(count) {\n return function (source) {\n if (count === 0) {\n return empty();\n }\n else {\n return source.lift(new TakeOperator(count));\n }\n };\n}\nvar TakeOperator = /*@__PURE__*/ (function () {\n function TakeOperator(total) {\n this.total = total;\n if (this.total < 0) {\n throw new ArgumentOutOfRangeError;\n }\n }\n TakeOperator.prototype.call = function (subscriber, source) {\n return source.subscribe(new TakeSubscriber(subscriber, this.total));\n };\n return TakeOperator;\n}());\nvar TakeSubscriber = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(TakeSubscriber, _super);\n function TakeSubscriber(destination, total) {\n var _this = _super.call(this, destination) || this;\n _this.total = total;\n _this.count = 0;\n return _this;\n }\n TakeSubscriber.prototype._next = function (value) {\n var total = this.total;\n var count = ++this.count;\n if (count <= total) {\n this.destination.next(value);\n if (count === total) {\n this.destination.complete();\n this.unsubscribe();\n }\n }\n };\n return TakeSubscriber;\n}(Subscriber));\n//# sourceMappingURL=take.js.map\n","/** PURE_IMPORTS_START tslib,_OuterSubscriber,_InnerSubscriber,_util_subscribeToResult,_map,_observable_from PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { OuterSubscriber } from '../OuterSubscriber';\nimport { InnerSubscriber } from '../InnerSubscriber';\nimport { subscribeToResult } from '../util/subscribeToResult';\nimport { map } from './map';\nimport { from } from '../observable/from';\nexport function switchMap(project, resultSelector) {\n if (typeof resultSelector === 'function') {\n return function (source) { return source.pipe(switchMap(function (a, i) { return from(project(a, i)).pipe(map(function (b, ii) { return resultSelector(a, b, i, ii); })); })); };\n }\n return function (source) { return source.lift(new SwitchMapOperator(project)); };\n}\nvar SwitchMapOperator = /*@__PURE__*/ (function () {\n function SwitchMapOperator(project) {\n this.project = project;\n }\n SwitchMapOperator.prototype.call = function (subscriber, source) {\n return source.subscribe(new SwitchMapSubscriber(subscriber, this.project));\n };\n return SwitchMapOperator;\n}());\nvar SwitchMapSubscriber = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(SwitchMapSubscriber, _super);\n function SwitchMapSubscriber(destination, project) {\n var _this = _super.call(this, destination) || this;\n _this.project = project;\n _this.index = 0;\n return _this;\n }\n SwitchMapSubscriber.prototype._next = function (value) {\n var result;\n var index = this.index++;\n try {\n result = this.project(value, index);\n }\n catch (error) {\n this.destination.error(error);\n return;\n }\n this._innerSub(result, value, index);\n };\n SwitchMapSubscriber.prototype._innerSub = function (result, value, index) {\n var innerSubscription = this.innerSubscription;\n if (innerSubscription) {\n innerSubscription.unsubscribe();\n }\n var innerSubscriber = new InnerSubscriber(this, undefined, undefined);\n var destination = this.destination;\n destination.add(innerSubscriber);\n this.innerSubscription = subscribeToResult(this, result, value, index, innerSubscriber);\n };\n SwitchMapSubscriber.prototype._complete = function () {\n var innerSubscription = this.innerSubscription;\n if (!innerSubscription || innerSubscription.closed) {\n _super.prototype._complete.call(this);\n }\n this.unsubscribe();\n };\n SwitchMapSubscriber.prototype._unsubscribe = function () {\n this.innerSubscription = null;\n };\n SwitchMapSubscriber.prototype.notifyComplete = function (innerSub) {\n var destination = this.destination;\n destination.remove(innerSub);\n this.innerSubscription = null;\n if (this.isStopped) {\n _super.prototype._complete.call(this);\n }\n };\n SwitchMapSubscriber.prototype.notifyNext = function (outerValue, innerValue, outerIndex, innerIndex, innerSub) {\n this.destination.next(innerValue);\n };\n return SwitchMapSubscriber;\n}(OuterSubscriber));\n//# sourceMappingURL=switchMap.js.map\n","/** PURE_IMPORTS_START _observable_empty,_observable_of,_observable_throwError PURE_IMPORTS_END */\nimport { empty } from './observable/empty';\nimport { of } from './observable/of';\nimport { throwError } from './observable/throwError';\nexport var NotificationKind;\n/*@__PURE__*/ (function (NotificationKind) {\n NotificationKind[\"NEXT\"] = \"N\";\n NotificationKind[\"ERROR\"] = \"E\";\n NotificationKind[\"COMPLETE\"] = \"C\";\n})(NotificationKind || (NotificationKind = {}));\nvar Notification = /*@__PURE__*/ (function () {\n function Notification(kind, value, error) {\n this.kind = kind;\n this.value = value;\n this.error = error;\n this.hasValue = kind === 'N';\n }\n Notification.prototype.observe = function (observer) {\n switch (this.kind) {\n case 'N':\n return observer.next && observer.next(this.value);\n case 'E':\n return observer.error && observer.error(this.error);\n case 'C':\n return observer.complete && observer.complete();\n }\n };\n Notification.prototype.do = function (next, error, complete) {\n var kind = this.kind;\n switch (kind) {\n case 'N':\n return next && next(this.value);\n case 'E':\n return error && error(this.error);\n case 'C':\n return complete && complete();\n }\n };\n Notification.prototype.accept = function (nextOrObserver, error, complete) {\n if (nextOrObserver && typeof nextOrObserver.next === 'function') {\n return this.observe(nextOrObserver);\n }\n else {\n return this.do(nextOrObserver, error, complete);\n }\n };\n Notification.prototype.toObservable = function () {\n var kind = this.kind;\n switch (kind) {\n case 'N':\n return of(this.value);\n case 'E':\n return throwError(this.error);\n case 'C':\n return empty();\n }\n throw new Error('unexpected notification kind value');\n };\n Notification.createNext = function (value) {\n if (typeof value !== 'undefined') {\n return new Notification('N', value);\n }\n return Notification.undefinedValueNotification;\n };\n Notification.createError = function (err) {\n return new Notification('E', undefined, err);\n };\n Notification.createComplete = function () {\n return Notification.completeNotification;\n };\n Notification.completeNotification = new Notification('C');\n Notification.undefinedValueNotification = new Notification('N', undefined);\n return Notification;\n}());\nexport { Notification };\n//# sourceMappingURL=Notification.js.map\n","/** PURE_IMPORTS_START tslib,_Action PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { Action } from './Action';\nvar AsyncAction = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(AsyncAction, _super);\n function AsyncAction(scheduler, work) {\n var _this = _super.call(this, scheduler, work) || this;\n _this.scheduler = scheduler;\n _this.work = work;\n _this.pending = false;\n return _this;\n }\n AsyncAction.prototype.schedule = function (state, delay) {\n if (delay === void 0) {\n delay = 0;\n }\n if (this.closed) {\n return this;\n }\n this.state = state;\n var id = this.id;\n var scheduler = this.scheduler;\n if (id != null) {\n this.id = this.recycleAsyncId(scheduler, id, delay);\n }\n this.pending = true;\n this.delay = delay;\n this.id = this.id || this.requestAsyncId(scheduler, this.id, delay);\n return this;\n };\n AsyncAction.prototype.requestAsyncId = function (scheduler, id, delay) {\n if (delay === void 0) {\n delay = 0;\n }\n return setInterval(scheduler.flush.bind(scheduler, this), delay);\n };\n AsyncAction.prototype.recycleAsyncId = function (scheduler, id, delay) {\n if (delay === void 0) {\n delay = 0;\n }\n if (delay !== null && this.delay === delay && this.pending === false) {\n return id;\n }\n clearInterval(id);\n return undefined;\n };\n AsyncAction.prototype.execute = function (state, delay) {\n if (this.closed) {\n return new Error('executing a cancelled action');\n }\n this.pending = false;\n var error = this._execute(state, delay);\n if (error) {\n return error;\n }\n else if (this.pending === false && this.id != null) {\n this.id = this.recycleAsyncId(this.scheduler, this.id, null);\n }\n };\n AsyncAction.prototype._execute = function (state, delay) {\n var errored = false;\n var errorValue = undefined;\n try {\n this.work(state);\n }\n catch (e) {\n errored = true;\n errorValue = !!e && e || new Error(e);\n }\n if (errored) {\n this.unsubscribe();\n return errorValue;\n }\n };\n AsyncAction.prototype._unsubscribe = function () {\n var id = this.id;\n var scheduler = this.scheduler;\n var actions = scheduler.actions;\n var index = actions.indexOf(this);\n this.work = null;\n this.state = null;\n this.pending = false;\n this.scheduler = null;\n if (index !== -1) {\n actions.splice(index, 1);\n }\n if (id != null) {\n this.id = this.recycleAsyncId(scheduler, id, null);\n }\n this.delay = null;\n };\n return AsyncAction;\n}(Action));\nexport { AsyncAction };\n//# sourceMappingURL=AsyncAction.js.map\n","/** PURE_IMPORTS_START tslib,_Subscription PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { Subscription } from '../Subscription';\nvar Action = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(Action, _super);\n function Action(scheduler, work) {\n return _super.call(this) || this;\n }\n Action.prototype.schedule = function (state, delay) {\n if (delay === void 0) {\n delay = 0;\n }\n return this;\n };\n return Action;\n}(Subscription));\nexport { Action };\n//# sourceMappingURL=Action.js.map\n","var Scheduler = /*@__PURE__*/ (function () {\n function Scheduler(SchedulerAction, now) {\n if (now === void 0) {\n now = Scheduler.now;\n }\n this.SchedulerAction = SchedulerAction;\n this.now = now;\n }\n Scheduler.prototype.schedule = function (work, delay, state) {\n if (delay === void 0) {\n delay = 0;\n }\n return new this.SchedulerAction(this, work).schedule(state, delay);\n };\n Scheduler.now = function () { return Date.now(); };\n return Scheduler;\n}());\nexport { Scheduler };\n//# sourceMappingURL=Scheduler.js.map\n","/** PURE_IMPORTS_START tslib,_Scheduler PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { Scheduler } from '../Scheduler';\nvar AsyncScheduler = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(AsyncScheduler, _super);\n function AsyncScheduler(SchedulerAction, now) {\n if (now === void 0) {\n now = Scheduler.now;\n }\n var _this = _super.call(this, SchedulerAction, function () {\n if (AsyncScheduler.delegate && AsyncScheduler.delegate !== _this) {\n return AsyncScheduler.delegate.now();\n }\n else {\n return now();\n }\n }) || this;\n _this.actions = [];\n _this.active = false;\n _this.scheduled = undefined;\n return _this;\n }\n AsyncScheduler.prototype.schedule = function (work, delay, state) {\n if (delay === void 0) {\n delay = 0;\n }\n if (AsyncScheduler.delegate && AsyncScheduler.delegate !== this) {\n return AsyncScheduler.delegate.schedule(work, delay, state);\n }\n else {\n return _super.prototype.schedule.call(this, work, delay, state);\n }\n };\n AsyncScheduler.prototype.flush = function (action) {\n var actions = this.actions;\n if (this.active) {\n actions.push(action);\n return;\n }\n var error;\n this.active = true;\n do {\n if (error = action.execute(action.state, action.delay)) {\n break;\n }\n } while (action = actions.shift());\n this.active = false;\n if (error) {\n while (action = actions.shift()) {\n action.unsubscribe();\n }\n throw error;\n }\n };\n return AsyncScheduler;\n}(Scheduler));\nexport { AsyncScheduler };\n//# sourceMappingURL=AsyncScheduler.js.map\n","/** PURE_IMPORTS_START _AsyncAction,_AsyncScheduler PURE_IMPORTS_END */\nimport { AsyncAction } from './AsyncAction';\nimport { AsyncScheduler } from './AsyncScheduler';\nexport var async = /*@__PURE__*/ new AsyncScheduler(AsyncAction);\n//# sourceMappingURL=async.js.map\n","/** PURE_IMPORTS_START _Observable PURE_IMPORTS_END */\nimport { Observable } from '../Observable';\nexport function throwError(error, scheduler) {\n if (!scheduler) {\n return new Observable(function (subscriber) { return subscriber.error(error); });\n }\n else {\n return new Observable(function (subscriber) { return scheduler.schedule(dispatch, 0, { error: error, subscriber: subscriber }); });\n }\n}\nfunction dispatch(_a) {\n var error = _a.error, subscriber = _a.subscriber;\n subscriber.error(error);\n}\n//# sourceMappingURL=throwError.js.map\n","/** PURE_IMPORTS_START tslib,_scheduler_async,_util_isDate,_Subscriber,_Notification PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { async } from '../scheduler/async';\nimport { isDate } from '../util/isDate';\nimport { Subscriber } from '../Subscriber';\nimport { Notification } from '../Notification';\nexport function delay(delay, scheduler) {\n if (scheduler === void 0) {\n scheduler = async;\n }\n var absoluteDelay = isDate(delay);\n var delayFor = absoluteDelay ? (+delay - scheduler.now()) : Math.abs(delay);\n return function (source) { return source.lift(new DelayOperator(delayFor, scheduler)); };\n}\nvar DelayOperator = /*@__PURE__*/ (function () {\n function DelayOperator(delay, scheduler) {\n this.delay = delay;\n this.scheduler = scheduler;\n }\n DelayOperator.prototype.call = function (subscriber, source) {\n return source.subscribe(new DelaySubscriber(subscriber, this.delay, this.scheduler));\n };\n return DelayOperator;\n}());\nvar DelaySubscriber = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(DelaySubscriber, _super);\n function DelaySubscriber(destination, delay, scheduler) {\n var _this = _super.call(this, destination) || this;\n _this.delay = delay;\n _this.scheduler = scheduler;\n _this.queue = [];\n _this.active = false;\n _this.errored = false;\n return _this;\n }\n DelaySubscriber.dispatch = function (state) {\n var source = state.source;\n var queue = source.queue;\n var scheduler = state.scheduler;\n var destination = state.destination;\n while (queue.length > 0 && (queue[0].time - scheduler.now()) <= 0) {\n queue.shift().notification.observe(destination);\n }\n if (queue.length > 0) {\n var delay_1 = Math.max(0, queue[0].time - scheduler.now());\n this.schedule(state, delay_1);\n }\n else {\n this.unsubscribe();\n source.active = false;\n }\n };\n DelaySubscriber.prototype._schedule = function (scheduler) {\n this.active = true;\n var destination = this.destination;\n destination.add(scheduler.schedule(DelaySubscriber.dispatch, this.delay, {\n source: this, destination: this.destination, scheduler: scheduler\n }));\n };\n DelaySubscriber.prototype.scheduleNotification = function (notification) {\n if (this.errored === true) {\n return;\n }\n var scheduler = this.scheduler;\n var message = new DelayMessage(scheduler.now() + this.delay, notification);\n this.queue.push(message);\n if (this.active === false) {\n this._schedule(scheduler);\n }\n };\n DelaySubscriber.prototype._next = function (value) {\n this.scheduleNotification(Notification.createNext(value));\n };\n DelaySubscriber.prototype._error = function (err) {\n this.errored = true;\n this.queue = [];\n this.destination.error(err);\n this.unsubscribe();\n };\n DelaySubscriber.prototype._complete = function () {\n this.scheduleNotification(Notification.createComplete());\n this.unsubscribe();\n };\n return DelaySubscriber;\n}(Subscriber));\nvar DelayMessage = /*@__PURE__*/ (function () {\n function DelayMessage(time, notification) {\n this.time = time;\n this.notification = notification;\n }\n return DelayMessage;\n}());\n//# sourceMappingURL=delay.js.map\n","/** PURE_IMPORTS_START PURE_IMPORTS_END */\nexport function isDate(value) {\n return value instanceof Date && !isNaN(+value);\n}\n//# sourceMappingURL=isDate.js.map\n","/** PURE_IMPORTS_START _switchMap PURE_IMPORTS_END */\nimport { switchMap } from './switchMap';\nexport function switchMapTo(innerObservable, resultSelector) {\n return resultSelector ? switchMap(function () { return innerObservable; }, resultSelector) : switchMap(function () { return innerObservable; });\n}\n//# sourceMappingURL=switchMapTo.js.map\n","/** PURE_IMPORTS_START tslib,_Subscriber PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { Subscriber } from '../Subscriber';\nexport function scan(accumulator, seed) {\n var hasSeed = false;\n if (arguments.length >= 2) {\n hasSeed = true;\n }\n return function scanOperatorFunction(source) {\n return source.lift(new ScanOperator(accumulator, seed, hasSeed));\n };\n}\nvar ScanOperator = /*@__PURE__*/ (function () {\n function ScanOperator(accumulator, seed, hasSeed) {\n if (hasSeed === void 0) {\n hasSeed = false;\n }\n this.accumulator = accumulator;\n this.seed = seed;\n this.hasSeed = hasSeed;\n }\n ScanOperator.prototype.call = function (subscriber, source) {\n return source.subscribe(new ScanSubscriber(subscriber, this.accumulator, this.seed, this.hasSeed));\n };\n return ScanOperator;\n}());\nvar ScanSubscriber = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(ScanSubscriber, _super);\n function ScanSubscriber(destination, accumulator, _seed, hasSeed) {\n var _this = _super.call(this, destination) || this;\n _this.accumulator = accumulator;\n _this._seed = _seed;\n _this.hasSeed = hasSeed;\n _this.index = 0;\n return _this;\n }\n Object.defineProperty(ScanSubscriber.prototype, \"seed\", {\n get: function () {\n return this._seed;\n },\n set: function (value) {\n this.hasSeed = true;\n this._seed = value;\n },\n enumerable: true,\n configurable: true\n });\n ScanSubscriber.prototype._next = function (value) {\n if (!this.hasSeed) {\n this.seed = value;\n this.destination.next(value);\n }\n else {\n return this._tryNext(value);\n }\n };\n ScanSubscriber.prototype._tryNext = function (value) {\n var index = this.index++;\n var result;\n try {\n result = this.accumulator(this.seed, value, index);\n }\n catch (err) {\n this.destination.error(err);\n }\n this.seed = result;\n this.destination.next(result);\n };\n return ScanSubscriber;\n}(Subscriber));\n//# sourceMappingURL=scan.js.map\n","/** PURE_IMPORTS_START tslib,_AsyncAction PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { AsyncAction } from './AsyncAction';\nvar QueueAction = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(QueueAction, _super);\n function QueueAction(scheduler, work) {\n var _this = _super.call(this, scheduler, work) || this;\n _this.scheduler = scheduler;\n _this.work = work;\n return _this;\n }\n QueueAction.prototype.schedule = function (state, delay) {\n if (delay === void 0) {\n delay = 0;\n }\n if (delay > 0) {\n return _super.prototype.schedule.call(this, state, delay);\n }\n this.delay = delay;\n this.state = state;\n this.scheduler.flush(this);\n return this;\n };\n QueueAction.prototype.execute = function (state, delay) {\n return (delay > 0 || this.closed) ?\n _super.prototype.execute.call(this, state, delay) :\n this._execute(state, delay);\n };\n QueueAction.prototype.requestAsyncId = function (scheduler, id, delay) {\n if (delay === void 0) {\n delay = 0;\n }\n if ((delay !== null && delay > 0) || (delay === null && this.delay > 0)) {\n return _super.prototype.requestAsyncId.call(this, scheduler, id, delay);\n }\n return scheduler.flush(this);\n };\n return QueueAction;\n}(AsyncAction));\nexport { QueueAction };\n//# sourceMappingURL=QueueAction.js.map\n","/** PURE_IMPORTS_START _QueueAction,_QueueScheduler PURE_IMPORTS_END */\nimport { QueueAction } from './QueueAction';\nimport { QueueScheduler } from './QueueScheduler';\nexport var queue = /*@__PURE__*/ new QueueScheduler(QueueAction);\n//# sourceMappingURL=queue.js.map\n","/** PURE_IMPORTS_START tslib,_AsyncScheduler PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { AsyncScheduler } from './AsyncScheduler';\nvar QueueScheduler = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(QueueScheduler, _super);\n function QueueScheduler() {\n return _super !== null && _super.apply(this, arguments) || this;\n }\n return QueueScheduler;\n}(AsyncScheduler));\nexport { QueueScheduler };\n//# sourceMappingURL=QueueScheduler.js.map\n","/** PURE_IMPORTS_START tslib,_Subscriber,_Notification PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { Subscriber } from '../Subscriber';\nimport { Notification } from '../Notification';\nexport function observeOn(scheduler, delay) {\n if (delay === void 0) {\n delay = 0;\n }\n return function observeOnOperatorFunction(source) {\n return source.lift(new ObserveOnOperator(scheduler, delay));\n };\n}\nvar ObserveOnOperator = /*@__PURE__*/ (function () {\n function ObserveOnOperator(scheduler, delay) {\n if (delay === void 0) {\n delay = 0;\n }\n this.scheduler = scheduler;\n this.delay = delay;\n }\n ObserveOnOperator.prototype.call = function (subscriber, source) {\n return source.subscribe(new ObserveOnSubscriber(subscriber, this.scheduler, this.delay));\n };\n return ObserveOnOperator;\n}());\nexport { ObserveOnOperator };\nvar ObserveOnSubscriber = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(ObserveOnSubscriber, _super);\n function ObserveOnSubscriber(destination, scheduler, delay) {\n if (delay === void 0) {\n delay = 0;\n }\n var _this = _super.call(this, destination) || this;\n _this.scheduler = scheduler;\n _this.delay = delay;\n return _this;\n }\n ObserveOnSubscriber.dispatch = function (arg) {\n var notification = arg.notification, destination = arg.destination;\n notification.observe(destination);\n this.unsubscribe();\n };\n ObserveOnSubscriber.prototype.scheduleMessage = function (notification) {\n var destination = this.destination;\n destination.add(this.scheduler.schedule(ObserveOnSubscriber.dispatch, this.delay, new ObserveOnMessage(notification, this.destination)));\n };\n ObserveOnSubscriber.prototype._next = function (value) {\n this.scheduleMessage(Notification.createNext(value));\n };\n ObserveOnSubscriber.prototype._error = function (err) {\n this.scheduleMessage(Notification.createError(err));\n this.unsubscribe();\n };\n ObserveOnSubscriber.prototype._complete = function () {\n this.scheduleMessage(Notification.createComplete());\n this.unsubscribe();\n };\n return ObserveOnSubscriber;\n}(Subscriber));\nexport { ObserveOnSubscriber };\nvar ObserveOnMessage = /*@__PURE__*/ (function () {\n function ObserveOnMessage(notification, destination) {\n this.notification = notification;\n this.destination = destination;\n }\n return ObserveOnMessage;\n}());\nexport { ObserveOnMessage };\n//# sourceMappingURL=observeOn.js.map\n","/** PURE_IMPORTS_START tslib,_Subject,_scheduler_queue,_Subscription,_operators_observeOn,_util_ObjectUnsubscribedError,_SubjectSubscription PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { Subject } from './Subject';\nimport { queue } from './scheduler/queue';\nimport { Subscription } from './Subscription';\nimport { ObserveOnSubscriber } from './operators/observeOn';\nimport { ObjectUnsubscribedError } from './util/ObjectUnsubscribedError';\nimport { SubjectSubscription } from './SubjectSubscription';\nvar ReplaySubject = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(ReplaySubject, _super);\n function ReplaySubject(bufferSize, windowTime, scheduler) {\n if (bufferSize === void 0) {\n bufferSize = Number.POSITIVE_INFINITY;\n }\n if (windowTime === void 0) {\n windowTime = Number.POSITIVE_INFINITY;\n }\n var _this = _super.call(this) || this;\n _this.scheduler = scheduler;\n _this._events = [];\n _this._infiniteTimeWindow = false;\n _this._bufferSize = bufferSize < 1 ? 1 : bufferSize;\n _this._windowTime = windowTime < 1 ? 1 : windowTime;\n if (windowTime === Number.POSITIVE_INFINITY) {\n _this._infiniteTimeWindow = true;\n _this.next = _this.nextInfiniteTimeWindow;\n }\n else {\n _this.next = _this.nextTimeWindow;\n }\n return _this;\n }\n ReplaySubject.prototype.nextInfiniteTimeWindow = function (value) {\n var _events = this._events;\n _events.push(value);\n if (_events.length > this._bufferSize) {\n _events.shift();\n }\n _super.prototype.next.call(this, value);\n };\n ReplaySubject.prototype.nextTimeWindow = function (value) {\n this._events.push(new ReplayEvent(this._getNow(), value));\n this._trimBufferThenGetEvents();\n _super.prototype.next.call(this, value);\n };\n ReplaySubject.prototype._subscribe = function (subscriber) {\n var _infiniteTimeWindow = this._infiniteTimeWindow;\n var _events = _infiniteTimeWindow ? this._events : this._trimBufferThenGetEvents();\n var scheduler = this.scheduler;\n var len = _events.length;\n var subscription;\n if (this.closed) {\n throw new ObjectUnsubscribedError();\n }\n else if (this.isStopped || this.hasError) {\n subscription = Subscription.EMPTY;\n }\n else {\n this.observers.push(subscriber);\n subscription = new SubjectSubscription(this, subscriber);\n }\n if (scheduler) {\n subscriber.add(subscriber = new ObserveOnSubscriber(subscriber, scheduler));\n }\n if (_infiniteTimeWindow) {\n for (var i = 0; i < len && !subscriber.closed; i++) {\n subscriber.next(_events[i]);\n }\n }\n else {\n for (var i = 0; i < len && !subscriber.closed; i++) {\n subscriber.next(_events[i].value);\n }\n }\n if (this.hasError) {\n subscriber.error(this.thrownError);\n }\n else if (this.isStopped) {\n subscriber.complete();\n }\n return subscription;\n };\n ReplaySubject.prototype._getNow = function () {\n return (this.scheduler || queue).now();\n };\n ReplaySubject.prototype._trimBufferThenGetEvents = function () {\n var now = this._getNow();\n var _bufferSize = this._bufferSize;\n var _windowTime = this._windowTime;\n var _events = this._events;\n var eventsCount = _events.length;\n var spliceCount = 0;\n while (spliceCount < eventsCount) {\n if ((now - _events[spliceCount].time) < _windowTime) {\n break;\n }\n spliceCount++;\n }\n if (eventsCount > _bufferSize) {\n spliceCount = Math.max(spliceCount, eventsCount - _bufferSize);\n }\n if (spliceCount > 0) {\n _events.splice(0, spliceCount);\n }\n return _events;\n };\n return ReplaySubject;\n}(Subject));\nexport { ReplaySubject };\nvar ReplayEvent = /*@__PURE__*/ (function () {\n function ReplayEvent(time, value) {\n this.time = time;\n this.value = value;\n }\n return ReplayEvent;\n}());\n//# sourceMappingURL=ReplaySubject.js.map\n","/** PURE_IMPORTS_START _ReplaySubject PURE_IMPORTS_END */\nimport { ReplaySubject } from '../ReplaySubject';\nexport function shareReplay(configOrBufferSize, windowTime, scheduler) {\n var config;\n if (configOrBufferSize && typeof configOrBufferSize === 'object') {\n config = configOrBufferSize;\n }\n else {\n config = {\n bufferSize: configOrBufferSize,\n windowTime: windowTime,\n refCount: false,\n scheduler: scheduler\n };\n }\n return function (source) { return source.lift(shareReplayOperator(config)); };\n}\nfunction shareReplayOperator(_a) {\n var _b = _a.bufferSize, bufferSize = _b === void 0 ? Number.POSITIVE_INFINITY : _b, _c = _a.windowTime, windowTime = _c === void 0 ? Number.POSITIVE_INFINITY : _c, useRefCount = _a.refCount, scheduler = _a.scheduler;\n var subject;\n var refCount = 0;\n var subscription;\n var hasError = false;\n var isComplete = false;\n return function shareReplayOperation(source) {\n refCount++;\n if (!subject || hasError) {\n hasError = false;\n subject = new ReplaySubject(bufferSize, windowTime, scheduler);\n subscription = source.subscribe({\n next: function (value) { subject.next(value); },\n error: function (err) {\n hasError = true;\n subject.error(err);\n },\n complete: function () {\n isComplete = true;\n subject.complete();\n },\n });\n }\n var innerSub = subject.subscribe(this);\n this.add(function () {\n refCount--;\n innerSub.unsubscribe();\n if (subscription && !isComplete && useRefCount && refCount === 0) {\n subscription.unsubscribe();\n subscription = undefined;\n subject = undefined;\n }\n });\n };\n}\n//# sourceMappingURL=shareReplay.js.map\n","/** PURE_IMPORTS_START tslib,_Subscriber PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { Subscriber } from '../Subscriber';\nexport function mapTo(value) {\n return function (source) { return source.lift(new MapToOperator(value)); };\n}\nvar MapToOperator = /*@__PURE__*/ (function () {\n function MapToOperator(value) {\n this.value = value;\n }\n MapToOperator.prototype.call = function (subscriber, source) {\n return source.subscribe(new MapToSubscriber(subscriber, this.value));\n };\n return MapToOperator;\n}());\nvar MapToSubscriber = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(MapToSubscriber, _super);\n function MapToSubscriber(destination, value) {\n var _this = _super.call(this, destination) || this;\n _this.value = value;\n return _this;\n }\n MapToSubscriber.prototype._next = function (x) {\n this.destination.next(this.value);\n };\n return MapToSubscriber;\n}(Subscriber));\n//# sourceMappingURL=mapTo.js.map\n","/** PURE_IMPORTS_START _of,_operators_concatAll PURE_IMPORTS_END */\nimport { of } from './of';\nimport { concatAll } from '../operators/concatAll';\nexport function concat() {\n var observables = [];\n for (var _i = 0; _i < arguments.length; _i++) {\n observables[_i] = arguments[_i];\n }\n return concatAll()(of.apply(void 0, observables));\n}\n//# sourceMappingURL=concat.js.map\n","/** PURE_IMPORTS_START _mergeAll PURE_IMPORTS_END */\nimport { mergeAll } from './mergeAll';\nexport function concatAll() {\n return mergeAll(1);\n}\n//# sourceMappingURL=concatAll.js.map\n","/** PURE_IMPORTS_START _observable_concat,_util_isScheduler PURE_IMPORTS_END */\nimport { concat } from '../observable/concat';\nimport { isScheduler } from '../util/isScheduler';\nexport function startWith() {\n var array = [];\n for (var _i = 0; _i < arguments.length; _i++) {\n array[_i] = arguments[_i];\n }\n var scheduler = array[array.length - 1];\n if (isScheduler(scheduler)) {\n array.pop();\n return function (source) { return concat(array, source, scheduler); };\n }\n else {\n return function (source) { return concat(array, source); };\n }\n}\n//# sourceMappingURL=startWith.js.map\n","/** PURE_IMPORTS_START tslib,_Subscriber PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { Subscriber } from '../Subscriber';\nexport function distinctUntilChanged(compare, keySelector) {\n return function (source) { return source.lift(new DistinctUntilChangedOperator(compare, keySelector)); };\n}\nvar DistinctUntilChangedOperator = /*@__PURE__*/ (function () {\n function DistinctUntilChangedOperator(compare, keySelector) {\n this.compare = compare;\n this.keySelector = keySelector;\n }\n DistinctUntilChangedOperator.prototype.call = function (subscriber, source) {\n return source.subscribe(new DistinctUntilChangedSubscriber(subscriber, this.compare, this.keySelector));\n };\n return DistinctUntilChangedOperator;\n}());\nvar DistinctUntilChangedSubscriber = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(DistinctUntilChangedSubscriber, _super);\n function DistinctUntilChangedSubscriber(destination, compare, keySelector) {\n var _this = _super.call(this, destination) || this;\n _this.keySelector = keySelector;\n _this.hasKey = false;\n if (typeof compare === 'function') {\n _this.compare = compare;\n }\n return _this;\n }\n DistinctUntilChangedSubscriber.prototype.compare = function (x, y) {\n return x === y;\n };\n DistinctUntilChangedSubscriber.prototype._next = function (value) {\n var key;\n try {\n var keySelector = this.keySelector;\n key = keySelector ? keySelector(value) : value;\n }\n catch (err) {\n return this.destination.error(err);\n }\n var result = false;\n if (this.hasKey) {\n try {\n var compare = this.compare;\n result = compare(this.key, key);\n }\n catch (err) {\n return this.destination.error(err);\n }\n }\n else {\n this.hasKey = true;\n }\n if (!result) {\n this.key = key;\n this.destination.next(value);\n }\n };\n return DistinctUntilChangedSubscriber;\n}(Subscriber));\n//# sourceMappingURL=distinctUntilChanged.js.map\n","/** PURE_IMPORTS_START tslib,_Subscriber PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { Subscriber } from '../Subscriber';\nexport function skip(count) {\n return function (source) { return source.lift(new SkipOperator(count)); };\n}\nvar SkipOperator = /*@__PURE__*/ (function () {\n function SkipOperator(total) {\n this.total = total;\n }\n SkipOperator.prototype.call = function (subscriber, source) {\n return source.subscribe(new SkipSubscriber(subscriber, this.total));\n };\n return SkipOperator;\n}());\nvar SkipSubscriber = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(SkipSubscriber, _super);\n function SkipSubscriber(destination, total) {\n var _this = _super.call(this, destination) || this;\n _this.total = total;\n _this.count = 0;\n return _this;\n }\n SkipSubscriber.prototype._next = function (x) {\n if (++this.count > this.total) {\n this.destination.next(x);\n }\n };\n return SkipSubscriber;\n}(Subscriber));\n//# sourceMappingURL=skip.js.map\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { Observable, fromEvent } from \"rxjs\"\nimport { ajax } from \"rxjs/ajax\"\nimport {\n distinctUntilChanged,\n map,\n mapTo,\n pluck,\n shareReplay,\n skip,\n startWith,\n switchMap\n} from \"rxjs/operators\"\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * Switch options\n */\ninterface SwitchOptions {\n location$: Observable /* Location observable */\n}\n\n/* ----------------------------------------------------------------------------\n * Data\n * ------------------------------------------------------------------------- */\n\n/**\n * Observable for document load events\n */\nconst load$ = fromEvent(document, \"DOMContentLoaded\")\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch document\n *\n * @return Document observable\n */\nexport function watchDocument(): Observable {\n return load$\n .pipe(\n mapTo(document),\n shareReplay(1)\n )\n}\n\n/**\n * Watch document switch\n *\n * This function returns an observables that fetches a document if the provided\n * location observable emits a new value (i.e. URL). If the emitted URL points\n * to the same page, the request is effectively ignored (e.g. when only the\n * fragment identifier changes)\n *\n * @param options - Options\n *\n * @return Document switch observable\n */\nexport function watchDocumentSwitch(\n { location$ }: SwitchOptions\n): Observable {\n return location$\n .pipe(\n startWith(location.href),\n map(url => url.replace(/#[^#]+$/, \"\")),\n distinctUntilChanged(),\n skip(1),\n\n /* Fetch document */\n switchMap(url => ajax({\n url,\n responseType: \"document\",\n withCredentials: true\n })\n .pipe(\n pluck(\"response\")\n )\n ),\n shareReplay(1)\n )\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Retrieve an element matching the query selector\n *\n * @template T - Element type\n *\n * @param selector - Query selector\n * @param node - Node of reference\n *\n * @return Element\n */\nexport function getElement(\n selector: string, node: ParentNode = document\n): T | undefined {\n return node.querySelector(selector) || undefined\n}\n\n/**\n * Retrieve all elements matching the query selector\n *\n * @template T - Element type\n *\n * @param selector - Query selector\n * @param node - Node of reference\n *\n * @return Elements\n */\nexport function getElements(\n selector: string, node: ParentNode = document\n): T[] {\n return Array.from(node.querySelectorAll(selector))\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { Observable, fromEvent, merge } from \"rxjs\"\nimport { map, shareReplay, startWith } from \"rxjs/operators\"\n\nimport { Agent } from \"../../_\"\nimport { ViewportSize } from \"../../viewport\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Element offset\n */\nexport interface ElementOffset {\n x: number /* Horizontal offset */\n y: number /* Vertical offset */\n}\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * Options\n */\ninterface Options {\n size$: Observable /* Viewport size observable */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Retrieve element offset\n *\n * @param el - HTML element\n *\n * @return Element offset\n */\nexport function getElementOffset(el: HTMLElement): ElementOffset {\n return {\n x: el.scrollLeft,\n y: el.scrollTop\n }\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Watch element offset\n *\n * @param el - Element\n * @param agent - Agent\n *\n * @return Element offset observable\n */\nexport function watchElementOffset(\n el: HTMLElement, { viewport }: Agent\n): Observable {\n const scroll$ = fromEvent(el, \"scroll\")\n return merge(scroll$, viewport.size$)\n .pipe(\n map(() => getElementOffset(el)),\n startWith(getElementOffset(el)),\n shareReplay(1)\n )\n}\n","/** PURE_IMPORTS_START tslib,_Subscriber PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { Subscriber } from '../Subscriber';\nexport function refCount() {\n return function refCountOperatorFunction(source) {\n return source.lift(new RefCountOperator(source));\n };\n}\nvar RefCountOperator = /*@__PURE__*/ (function () {\n function RefCountOperator(connectable) {\n this.connectable = connectable;\n }\n RefCountOperator.prototype.call = function (subscriber, source) {\n var connectable = this.connectable;\n connectable._refCount++;\n var refCounter = new RefCountSubscriber(subscriber, connectable);\n var subscription = source.subscribe(refCounter);\n if (!refCounter.closed) {\n refCounter.connection = connectable.connect();\n }\n return subscription;\n };\n return RefCountOperator;\n}());\nvar RefCountSubscriber = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(RefCountSubscriber, _super);\n function RefCountSubscriber(destination, connectable) {\n var _this = _super.call(this, destination) || this;\n _this.connectable = connectable;\n return _this;\n }\n RefCountSubscriber.prototype._unsubscribe = function () {\n var connectable = this.connectable;\n if (!connectable) {\n this.connection = null;\n return;\n }\n this.connectable = null;\n var refCount = connectable._refCount;\n if (refCount <= 0) {\n this.connection = null;\n return;\n }\n connectable._refCount = refCount - 1;\n if (refCount > 1) {\n this.connection = null;\n return;\n }\n var connection = this.connection;\n var sharedConnection = connectable._connection;\n this.connection = null;\n if (sharedConnection && (!connection || sharedConnection === connection)) {\n sharedConnection.unsubscribe();\n }\n };\n return RefCountSubscriber;\n}(Subscriber));\n//# sourceMappingURL=refCount.js.map\n","/** PURE_IMPORTS_START tslib,_Subject,_Observable,_Subscriber,_Subscription,_operators_refCount PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { SubjectSubscriber } from '../Subject';\nimport { Observable } from '../Observable';\nimport { Subscriber } from '../Subscriber';\nimport { Subscription } from '../Subscription';\nimport { refCount as higherOrderRefCount } from '../operators/refCount';\nvar ConnectableObservable = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(ConnectableObservable, _super);\n function ConnectableObservable(source, subjectFactory) {\n var _this = _super.call(this) || this;\n _this.source = source;\n _this.subjectFactory = subjectFactory;\n _this._refCount = 0;\n _this._isComplete = false;\n return _this;\n }\n ConnectableObservable.prototype._subscribe = function (subscriber) {\n return this.getSubject().subscribe(subscriber);\n };\n ConnectableObservable.prototype.getSubject = function () {\n var subject = this._subject;\n if (!subject || subject.isStopped) {\n this._subject = this.subjectFactory();\n }\n return this._subject;\n };\n ConnectableObservable.prototype.connect = function () {\n var connection = this._connection;\n if (!connection) {\n this._isComplete = false;\n connection = this._connection = new Subscription();\n connection.add(this.source\n .subscribe(new ConnectableSubscriber(this.getSubject(), this)));\n if (connection.closed) {\n this._connection = null;\n connection = Subscription.EMPTY;\n }\n }\n return connection;\n };\n ConnectableObservable.prototype.refCount = function () {\n return higherOrderRefCount()(this);\n };\n return ConnectableObservable;\n}(Observable));\nexport { ConnectableObservable };\nexport var connectableObservableDescriptor = /*@__PURE__*/ (function () {\n var connectableProto = ConnectableObservable.prototype;\n return {\n operator: { value: null },\n _refCount: { value: 0, writable: true },\n _subject: { value: null, writable: true },\n _connection: { value: null, writable: true },\n _subscribe: { value: connectableProto._subscribe },\n _isComplete: { value: connectableProto._isComplete, writable: true },\n getSubject: { value: connectableProto.getSubject },\n connect: { value: connectableProto.connect },\n refCount: { value: connectableProto.refCount }\n };\n})();\nvar ConnectableSubscriber = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(ConnectableSubscriber, _super);\n function ConnectableSubscriber(destination, connectable) {\n var _this = _super.call(this, destination) || this;\n _this.connectable = connectable;\n return _this;\n }\n ConnectableSubscriber.prototype._error = function (err) {\n this._unsubscribe();\n _super.prototype._error.call(this, err);\n };\n ConnectableSubscriber.prototype._complete = function () {\n this.connectable._isComplete = true;\n this._unsubscribe();\n _super.prototype._complete.call(this);\n };\n ConnectableSubscriber.prototype._unsubscribe = function () {\n var connectable = this.connectable;\n if (connectable) {\n this.connectable = null;\n var connection = connectable._connection;\n connectable._refCount = 0;\n connectable._subject = null;\n connectable._connection = null;\n if (connection) {\n connection.unsubscribe();\n }\n }\n };\n return ConnectableSubscriber;\n}(SubjectSubscriber));\nvar RefCountOperator = /*@__PURE__*/ (function () {\n function RefCountOperator(connectable) {\n this.connectable = connectable;\n }\n RefCountOperator.prototype.call = function (subscriber, source) {\n var connectable = this.connectable;\n connectable._refCount++;\n var refCounter = new RefCountSubscriber(subscriber, connectable);\n var subscription = source.subscribe(refCounter);\n if (!refCounter.closed) {\n refCounter.connection = connectable.connect();\n }\n return subscription;\n };\n return RefCountOperator;\n}());\nvar RefCountSubscriber = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(RefCountSubscriber, _super);\n function RefCountSubscriber(destination, connectable) {\n var _this = _super.call(this, destination) || this;\n _this.connectable = connectable;\n return _this;\n }\n RefCountSubscriber.prototype._unsubscribe = function () {\n var connectable = this.connectable;\n if (!connectable) {\n this.connection = null;\n return;\n }\n this.connectable = null;\n var refCount = connectable._refCount;\n if (refCount <= 0) {\n this.connection = null;\n return;\n }\n connectable._refCount = refCount - 1;\n if (refCount > 1) {\n this.connection = null;\n return;\n }\n var connection = this.connection;\n var sharedConnection = connectable._connection;\n this.connection = null;\n if (sharedConnection && (!connection || sharedConnection === connection)) {\n sharedConnection.unsubscribe();\n }\n };\n return RefCountSubscriber;\n}(Subscriber));\n//# sourceMappingURL=ConnectableObservable.js.map\n","/** PURE_IMPORTS_START _observable_ConnectableObservable PURE_IMPORTS_END */\nimport { connectableObservableDescriptor } from '../observable/ConnectableObservable';\nexport function multicast(subjectOrSubjectFactory, selector) {\n return function multicastOperatorFunction(source) {\n var subjectFactory;\n if (typeof subjectOrSubjectFactory === 'function') {\n subjectFactory = subjectOrSubjectFactory;\n }\n else {\n subjectFactory = function subjectFactory() {\n return subjectOrSubjectFactory;\n };\n }\n if (typeof selector === 'function') {\n return source.lift(new MulticastOperator(subjectFactory, selector));\n }\n var connectable = Object.create(source, connectableObservableDescriptor);\n connectable.source = source;\n connectable.subjectFactory = subjectFactory;\n return connectable;\n };\n}\nvar MulticastOperator = /*@__PURE__*/ (function () {\n function MulticastOperator(subjectFactory, selector) {\n this.subjectFactory = subjectFactory;\n this.selector = selector;\n }\n MulticastOperator.prototype.call = function (subscriber, source) {\n var selector = this.selector;\n var subject = this.subjectFactory();\n var subscription = selector(subject).subscribe(subscriber);\n subscription.add(source.subscribe(subject));\n return subscription;\n };\n return MulticastOperator;\n}());\nexport { MulticastOperator };\n//# sourceMappingURL=multicast.js.map\n","/** PURE_IMPORTS_START _multicast,_refCount,_Subject PURE_IMPORTS_END */\nimport { multicast } from './multicast';\nimport { refCount } from './refCount';\nimport { Subject } from '../Subject';\nfunction shareSubjectFactory() {\n return new Subject();\n}\nexport function share() {\n return function (source) { return refCount()(multicast(shareSubjectFactory)(source)); };\n}\n//# sourceMappingURL=share.js.map\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { Observable, Subject, fromEvent } from \"rxjs\"\nimport { filter, map, share } from \"rxjs/operators\"\n\n/* ----------------------------------------------------------------------------\n * Data\n * ------------------------------------------------------------------------- */\n\n/**\n * Observable for window hash change events\n */\nconst hashchange$ = fromEvent(window, \"hashchange\")\n\n/**\n * Observable for window pop state events\n */\nconst popstate$ = fromEvent(window, \"popstate\")\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch location\n *\n * @return Location subject\n */\nexport function watchLocation(): Subject {\n const location$ = new Subject()\n popstate$\n .pipe(\n map(() => location.href),\n share()\n )\n .subscribe(location$)\n\n /* Return subject */\n return location$\n}\n\n/**\n * Watch location hash\n *\n * @return Location hash observable\n */\nexport function watchLocationHash(): Observable {\n return hashchange$\n .pipe(\n map(() => location.hash),\n filter(hash => hash.length > 0),\n share()\n )\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { Observable, fromEventPattern } from \"rxjs\"\nimport { shareReplay, startWith } from \"rxjs/operators\"\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch media query\n *\n * @param query - Media query\n *\n * @return Media observable\n */\nexport function watchMedia(query: string): Observable {\n const media = matchMedia(query)\n return fromEventPattern(next =>\n media.addListener(() => next(media.matches))\n )\n .pipe(\n startWith(media.matches),\n shareReplay(1)\n )\n}\n","/** PURE_IMPORTS_START _Observable,_util_isArray,_util_isFunction,_operators_map PURE_IMPORTS_END */\nimport { Observable } from '../Observable';\nimport { isArray } from '../util/isArray';\nimport { isFunction } from '../util/isFunction';\nimport { map } from '../operators/map';\nexport function fromEventPattern(addHandler, removeHandler, resultSelector) {\n if (resultSelector) {\n return fromEventPattern(addHandler, removeHandler).pipe(map(function (args) { return isArray(args) ? resultSelector.apply(void 0, args) : resultSelector(args); }));\n }\n return new Observable(function (subscriber) {\n var handler = function () {\n var e = [];\n for (var _i = 0; _i < arguments.length; _i++) {\n e[_i] = arguments[_i];\n }\n return subscriber.next(e.length === 1 ? e[0] : e);\n };\n var retValue;\n try {\n retValue = addHandler(handler);\n }\n catch (err) {\n subscriber.error(err);\n return undefined;\n }\n if (!isFunction(removeHandler)) {\n return undefined;\n }\n return function () { return removeHandler(handler, retValue); };\n });\n}\n//# sourceMappingURL=fromEventPattern.js.map\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { Observable, fromEvent, merge } from \"rxjs\"\nimport { map, shareReplay, startWith } from \"rxjs/operators\"\n\n/* ----------------------------------------------------------------------------\n * Data\n * ------------------------------------------------------------------------- */\n\n/**\n * Observable for window scroll events\n */\nconst scroll$ = fromEvent(window, \"scroll\")\n\n/**\n * Observable for window resize events\n */\nconst resize$ = fromEvent(window, \"resize\")\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Viewport offset\n */\nexport interface ViewportOffset {\n x: number /* Horizontal offset */\n y: number /* Vertical offset */\n}\n\n/**\n * Viewport size\n */\nexport interface ViewportSize {\n width: number /* Viewport width */\n height: number /* Viewport height */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Retrieve viewport offset\n *\n * @return Viewport offset\n */\nexport function getViewportOffset(): ViewportOffset {\n return {\n x: pageXOffset,\n y: pageYOffset\n }\n}\n\n/**\n * Retrieve viewport size\n *\n * @return Viewport size\n */\nexport function getViewportSize(): ViewportSize {\n return {\n width: innerWidth,\n height: innerHeight\n }\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Watch viewport offset\n *\n * @return Viewport offset observable\n */\nexport function watchViewportOffset(): Observable {\n return merge(scroll$, resize$)\n .pipe(\n map(getViewportOffset),\n startWith(getViewportOffset()),\n shareReplay(1)\n )\n}\n\n/**\n * Watch viewport size\n *\n * @return Viewport size observable\n */\nexport function watchViewportSize(): Observable {\n return resize$\n .pipe(\n map(getViewportSize),\n startWith(getViewportSize()),\n shareReplay(1)\n )\n}\n","/** PURE_IMPORTS_START tslib,_OuterSubscriber,_util_subscribeToResult PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { OuterSubscriber } from '../OuterSubscriber';\nimport { subscribeToResult } from '../util/subscribeToResult';\nexport var defaultThrottleConfig = {\n leading: true,\n trailing: false\n};\nexport function throttle(durationSelector, config) {\n if (config === void 0) {\n config = defaultThrottleConfig;\n }\n return function (source) { return source.lift(new ThrottleOperator(durationSelector, config.leading, config.trailing)); };\n}\nvar ThrottleOperator = /*@__PURE__*/ (function () {\n function ThrottleOperator(durationSelector, leading, trailing) {\n this.durationSelector = durationSelector;\n this.leading = leading;\n this.trailing = trailing;\n }\n ThrottleOperator.prototype.call = function (subscriber, source) {\n return source.subscribe(new ThrottleSubscriber(subscriber, this.durationSelector, this.leading, this.trailing));\n };\n return ThrottleOperator;\n}());\nvar ThrottleSubscriber = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(ThrottleSubscriber, _super);\n function ThrottleSubscriber(destination, durationSelector, _leading, _trailing) {\n var _this = _super.call(this, destination) || this;\n _this.destination = destination;\n _this.durationSelector = durationSelector;\n _this._leading = _leading;\n _this._trailing = _trailing;\n _this._hasValue = false;\n return _this;\n }\n ThrottleSubscriber.prototype._next = function (value) {\n this._hasValue = true;\n this._sendValue = value;\n if (!this._throttled) {\n if (this._leading) {\n this.send();\n }\n else {\n this.throttle(value);\n }\n }\n };\n ThrottleSubscriber.prototype.send = function () {\n var _a = this, _hasValue = _a._hasValue, _sendValue = _a._sendValue;\n if (_hasValue) {\n this.destination.next(_sendValue);\n this.throttle(_sendValue);\n }\n this._hasValue = false;\n this._sendValue = null;\n };\n ThrottleSubscriber.prototype.throttle = function (value) {\n var duration = this.tryDurationSelector(value);\n if (!!duration) {\n this.add(this._throttled = subscribeToResult(this, duration));\n }\n };\n ThrottleSubscriber.prototype.tryDurationSelector = function (value) {\n try {\n return this.durationSelector(value);\n }\n catch (err) {\n this.destination.error(err);\n return null;\n }\n };\n ThrottleSubscriber.prototype.throttlingDone = function () {\n var _a = this, _throttled = _a._throttled, _trailing = _a._trailing;\n if (_throttled) {\n _throttled.unsubscribe();\n }\n this._throttled = null;\n if (_trailing) {\n this.send();\n }\n };\n ThrottleSubscriber.prototype.notifyNext = function (outerValue, innerValue, outerIndex, innerIndex, innerSub) {\n this.throttlingDone();\n };\n ThrottleSubscriber.prototype.notifyComplete = function () {\n this.throttlingDone();\n };\n return ThrottleSubscriber;\n}(OuterSubscriber));\n//# sourceMappingURL=throttle.js.map\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { Observable, fromEvent } from \"rxjs\"\nimport { pluck, share, switchMapTo, tap, throttle } from \"rxjs/operators\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Worker message\n */\nexport interface WorkerMessage {\n type: unknown /* Message type */\n data: unknown /* Message data */\n}\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * Options\n *\n * @template T - Worker message type\n */\ninterface Options {\n send$: Observable /* Message observable */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch a web worker\n *\n * This function returns an observable that will send all values emitted by the\n * message observable to the web worker. Web worker communication is expected\n * to be bidirectional (request-response) and synchronous. Messages that are\n * emitted during a pending request are throttled, the last one is emitted.\n *\n * @param worker - Web worker\n *\n * @return Worker message observable\n */\nexport function watchWorker(\n worker: Worker, { send$ }: Options\n): Observable {\n\n /* Intercept messages from web worker */\n const recv$ = fromEvent(worker, \"message\")\n .pipe(\n pluck(\"data\"),\n share()\n )\n\n /* Send and receive messages, return hot observable */\n return send$\n .pipe(\n throttle(() => recv$, { leading: true, trailing: true }),\n tap(message => worker.postMessage(message)),\n switchMapTo(recv$),\n share()\n )\n}\n","/** PURE_IMPORTS_START tslib,_AsyncAction PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { AsyncAction } from './AsyncAction';\nvar AnimationFrameAction = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(AnimationFrameAction, _super);\n function AnimationFrameAction(scheduler, work) {\n var _this = _super.call(this, scheduler, work) || this;\n _this.scheduler = scheduler;\n _this.work = work;\n return _this;\n }\n AnimationFrameAction.prototype.requestAsyncId = function (scheduler, id, delay) {\n if (delay === void 0) {\n delay = 0;\n }\n if (delay !== null && delay > 0) {\n return _super.prototype.requestAsyncId.call(this, scheduler, id, delay);\n }\n scheduler.actions.push(this);\n return scheduler.scheduled || (scheduler.scheduled = requestAnimationFrame(function () { return scheduler.flush(null); }));\n };\n AnimationFrameAction.prototype.recycleAsyncId = function (scheduler, id, delay) {\n if (delay === void 0) {\n delay = 0;\n }\n if ((delay !== null && delay > 0) || (delay === null && this.delay > 0)) {\n return _super.prototype.recycleAsyncId.call(this, scheduler, id, delay);\n }\n if (scheduler.actions.length === 0) {\n cancelAnimationFrame(id);\n scheduler.scheduled = undefined;\n }\n return undefined;\n };\n return AnimationFrameAction;\n}(AsyncAction));\nexport { AnimationFrameAction };\n//# sourceMappingURL=AnimationFrameAction.js.map\n","/** PURE_IMPORTS_START _AnimationFrameAction,_AnimationFrameScheduler PURE_IMPORTS_END */\nimport { AnimationFrameAction } from './AnimationFrameAction';\nimport { AnimationFrameScheduler } from './AnimationFrameScheduler';\nexport var animationFrame = /*@__PURE__*/ new AnimationFrameScheduler(AnimationFrameAction);\n//# sourceMappingURL=animationFrame.js.map\n","/** PURE_IMPORTS_START tslib,_AsyncScheduler PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { AsyncScheduler } from './AsyncScheduler';\nvar AnimationFrameScheduler = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(AnimationFrameScheduler, _super);\n function AnimationFrameScheduler() {\n return _super !== null && _super.apply(this, arguments) || this;\n }\n AnimationFrameScheduler.prototype.flush = function (action) {\n this.active = true;\n this.scheduled = undefined;\n var actions = this.actions;\n var error;\n var index = -1;\n var count = actions.length;\n action = action || actions.shift();\n do {\n if (error = action.execute(action.state, action.delay)) {\n break;\n }\n } while (++index < count && (action = actions.shift()));\n this.active = false;\n if (error) {\n while (++index < count && (action = actions.shift())) {\n action.unsubscribe();\n }\n throw error;\n }\n };\n return AnimationFrameScheduler;\n}(AsyncScheduler));\nexport { AnimationFrameScheduler };\n//# sourceMappingURL=AnimationFrameScheduler.js.map\n","/** PURE_IMPORTS_START tslib,_Subscriber,_Subscription PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { Subscriber } from '../Subscriber';\nimport { Subscription } from '../Subscription';\nexport function finalize(callback) {\n return function (source) { return source.lift(new FinallyOperator(callback)); };\n}\nvar FinallyOperator = /*@__PURE__*/ (function () {\n function FinallyOperator(callback) {\n this.callback = callback;\n }\n FinallyOperator.prototype.call = function (subscriber, source) {\n return source.subscribe(new FinallySubscriber(subscriber, this.callback));\n };\n return FinallyOperator;\n}());\nvar FinallySubscriber = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(FinallySubscriber, _super);\n function FinallySubscriber(destination, callback) {\n var _this = _super.call(this, destination) || this;\n _this.add(new Subscription(callback));\n return _this;\n }\n return FinallySubscriber;\n}(Subscriber));\n//# sourceMappingURL=finalize.js.map\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { getElement } from \"../agent\"\n\n/* ----------------------------------------------------------------------------\n * Data\n * ------------------------------------------------------------------------- */\n\n/**\n * Translations\n */\nlet lang: Record\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Truncate a string after the given number of characters\n *\n * @param value - Value to be truncated\n * @param n - Number of characters\n *\n * @return Truncated value\n */\nexport function truncate(value: string, n: number): string {\n let i = n\n if (value.length > i) {\n while (value[i] !== \" \" && --i > 0); // tslint:disable-line\n return `${value.substring(0, i)}...`\n }\n return value\n}\n\n/**\n * Translate the given key\n *\n * @param key - Key to be translated\n * @param value - Value to be replaced\n *\n * @return Translation\n */\nexport function translate(key: string, value?: string): string {\n if (typeof lang === \"undefined\") {\n const el = getElement(\"#__lang\")!\n lang = JSON.parse(el.innerText)\n }\n if (typeof lang[key] === \"undefined\") {\n throw new ReferenceError(`Invalid translation: ${key}`)\n }\n return typeof value !== \"undefined\"\n ? lang[key].replace(\"#\", value)\n : lang[key]\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Set anchor blur\n *\n * @param el - Anchor element\n * @param value - Whether the anchor is blurred\n */\nexport function setAnchorBlur(\n el: HTMLElement, value: boolean\n): void {\n el.setAttribute(\"data-md-state\", value ? \"blur\" : \"\")\n}\n\n/**\n * Reset anchor blur\n *\n * @param el - Anchor element\n */\nexport function resetAnchorBlur(\n el: HTMLElement\n): void {\n el.removeAttribute(\"data-md-state\")\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Set anchor active\n *\n * @param el - Anchor element\n * @param value - Whether the anchor is active\n */\nexport function setAnchorActive(\n el: HTMLElement, value: boolean\n): void {\n el.classList.toggle(\"md-nav__link--active\", value)\n}\n\n/**\n * Reset anchor active\n *\n * @param el - Anchor element\n */\nexport function resetAnchorActive(\n el: HTMLElement\n): void {\n el.classList.remove(\"md-nav__link--active\")\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { translate } from \"utilities\"\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Set number of search results\n *\n * @param el - Search result metadata element\n * @param value - Number of results\n */\nexport function setSearchResultMeta(\n el: HTMLElement, value: number\n): void {\n el.textContent = value > 1\n ? translate(\"search.result.other\", value.toString())\n : value === 1\n ? translate(\"search.result.one\")\n : translate(\"search.result.none\")\n}\n\n/**\n * Reset number of search results\n *\n * @param el - Search result metadata element\n */\nexport function resetSearchResultMeta(\n el: HTMLElement\n): void {\n el.textContent = translate(\"search.result.placeholder\")\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Add an element to the search result list\n *\n * @param el - Search result list element\n * @param child - Search result element\n */\nexport function addToSearchResultList(\n el: HTMLElement, child: HTMLElement\n): void {\n el.appendChild(child)\n}\n\n/**\n * Reset search result list\n *\n * @param el - Search result list element\n */\nexport function resetSearchResultList(\n el: HTMLElement\n): void {\n el.innerHTML = \"\"\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { OperatorFunction, animationFrameScheduler, pipe } from \"rxjs\"\nimport {\n distinctUntilChanged,\n finalize,\n map,\n observeOn,\n tap\n} from \"rxjs/operators\"\n\nimport { resetHidden, setHidden } from \"actions\"\n\nimport { ViewportOffset } from \"../agent\"\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Paint hideable from source observable\n *\n * @param el - Hideable element\n * @param offset - Additional offset\n *\n * @return Operator function\n */\nexport function paintHidden(\n el: HTMLElement, offset: number = 0\n): OperatorFunction {\n return pipe(\n map(({ y }) => y >= offset),\n distinctUntilChanged(),\n\n /* Defer repaint to next animation frame */\n observeOn(animationFrameScheduler),\n tap(value => {\n setHidden(el, value)\n }),\n\n /* Reset on complete or error */\n finalize(() => {\n resetHidden(el)\n })\n )\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Set hidden\n *\n * @param el - Hideable element\n * @param value - Whether the element is hidden\n */\nexport function setHidden(\n el: HTMLElement, value: boolean\n): void {\n el.setAttribute(\"data-md-state\", value ? \"hidden\" : \"\")\n}\n\n/**\n * Reset hidden\n *\n * @param el - Hideable element\n */\nexport function resetHidden(\n el: HTMLElement\n): void {\n el.removeAttribute(\"data-md-state\")\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { Observable, defer, of } from \"rxjs\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Header state\n */\nexport interface HeaderState {\n sticky: boolean /* Header stickyness */\n height: number /* Header visible height */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch header\n *\n * The header is wrapped in an observable to pave the way for auto-hiding or\n * other dynamic behaviors that may be implemented later on.\n *\n * @param el - Header element\n *\n * @return Header state observable\n */\nexport function watchHeader(\n el: HTMLElement\n): Observable {\n return defer(() => {\n const sticky = getComputedStyle(el)\n .getPropertyValue(\"position\") === \"sticky\"\n\n /* Return header as hot observable */\n return of({\n sticky,\n height: sticky ? el.offsetHeight : 0\n })\n })\n}\n","/** PURE_IMPORTS_START _Observable,_from,_empty PURE_IMPORTS_END */\nimport { Observable } from '../Observable';\nimport { from } from './from';\nimport { empty } from './empty';\nexport function defer(observableFactory) {\n return new Observable(function (subscriber) {\n var input;\n try {\n input = observableFactory();\n }\n catch (err) {\n subscriber.error(err);\n return undefined;\n }\n var source = input ? from(input) : empty();\n return source.subscribe(subscriber);\n });\n}\n//# sourceMappingURL=defer.js.map\n","/** PURE_IMPORTS_START tslib,_util_isScheduler,_util_isArray,_OuterSubscriber,_util_subscribeToResult,_fromArray PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { isScheduler } from '../util/isScheduler';\nimport { isArray } from '../util/isArray';\nimport { OuterSubscriber } from '../OuterSubscriber';\nimport { subscribeToResult } from '../util/subscribeToResult';\nimport { fromArray } from './fromArray';\nvar NONE = {};\nexport function combineLatest() {\n var observables = [];\n for (var _i = 0; _i < arguments.length; _i++) {\n observables[_i] = arguments[_i];\n }\n var resultSelector = null;\n var scheduler = null;\n if (isScheduler(observables[observables.length - 1])) {\n scheduler = observables.pop();\n }\n if (typeof observables[observables.length - 1] === 'function') {\n resultSelector = observables.pop();\n }\n if (observables.length === 1 && isArray(observables[0])) {\n observables = observables[0];\n }\n return fromArray(observables, scheduler).lift(new CombineLatestOperator(resultSelector));\n}\nvar CombineLatestOperator = /*@__PURE__*/ (function () {\n function CombineLatestOperator(resultSelector) {\n this.resultSelector = resultSelector;\n }\n CombineLatestOperator.prototype.call = function (subscriber, source) {\n return source.subscribe(new CombineLatestSubscriber(subscriber, this.resultSelector));\n };\n return CombineLatestOperator;\n}());\nexport { CombineLatestOperator };\nvar CombineLatestSubscriber = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(CombineLatestSubscriber, _super);\n function CombineLatestSubscriber(destination, resultSelector) {\n var _this = _super.call(this, destination) || this;\n _this.resultSelector = resultSelector;\n _this.active = 0;\n _this.values = [];\n _this.observables = [];\n return _this;\n }\n CombineLatestSubscriber.prototype._next = function (observable) {\n this.values.push(NONE);\n this.observables.push(observable);\n };\n CombineLatestSubscriber.prototype._complete = function () {\n var observables = this.observables;\n var len = observables.length;\n if (len === 0) {\n this.destination.complete();\n }\n else {\n this.active = len;\n this.toRespond = len;\n for (var i = 0; i < len; i++) {\n var observable = observables[i];\n this.add(subscribeToResult(this, observable, observable, i));\n }\n }\n };\n CombineLatestSubscriber.prototype.notifyComplete = function (unused) {\n if ((this.active -= 1) === 0) {\n this.destination.complete();\n }\n };\n CombineLatestSubscriber.prototype.notifyNext = function (outerValue, innerValue, outerIndex, innerIndex, innerSub) {\n var values = this.values;\n var oldVal = values[outerIndex];\n var toRespond = !this.toRespond\n ? 0\n : oldVal === NONE ? --this.toRespond : this.toRespond;\n values[outerIndex] = innerValue;\n if (toRespond === 0) {\n if (this.resultSelector) {\n this._tryResultSelector(values);\n }\n else {\n this.destination.next(values.slice());\n }\n }\n };\n CombineLatestSubscriber.prototype._tryResultSelector = function (values) {\n var result;\n try {\n result = this.resultSelector.apply(this, values);\n }\n catch (err) {\n this.destination.error(err);\n return;\n }\n this.destination.next(result);\n };\n return CombineLatestSubscriber;\n}(OuterSubscriber));\nexport { CombineLatestSubscriber };\n//# sourceMappingURL=combineLatest.js.map\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { Observable, combineLatest } from \"rxjs\"\nimport {\n distinctUntilChanged,\n map,\n shareReplay,\n switchMapTo\n} from \"rxjs/operators\"\n\nimport { Agent, ViewportOffset } from \"utilities\"\n\nimport { HeaderState } from \"../_\"\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * Options\n */\ninterface Options {\n header$: Observable /* Header state observable */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch viewport offset relative to an element's top\n *\n * This function returns an observable that computes the relative offset to the\n * top of the given element based on the current viewport offset.\n *\n * @param el - HTML element\n * @param agent - Agent\n * @param options - Options\n *\n * @return Viewport offset observable\n */\nexport function watchViewportOffsetFromTopOf(\n el: HTMLElement, { viewport }: Agent, { header$ }: Options\n): Observable {\n\n /* Compute necessary adjustment for offset */\n const adjust$ = viewport.size$\n .pipe(\n switchMapTo(header$),\n map(({ height }) => el.offsetTop - height),\n distinctUntilChanged()\n )\n\n /* Compute relative offset and return as hot observable */\n return combineLatest([viewport.offset$, adjust$])\n .pipe(\n map(([{ x, y }, adjust]) => ({ x, y: y - adjust })),\n shareReplay(1)\n )\n}\n\n/**\n * Watch viewport offset relative to an element's bottom\n *\n * This function returns an observable that computes the relative offset to the\n * bottom of the given element based on the current viewport offset.\n *\n * @param el - HTML element\n * @param agent - Agent\n * @param options - Options\n *\n * @return Viewport offset observable\n */\nexport function watchViewportOffsetFromBottomOf(\n el: HTMLElement, { viewport }: Agent, { header$ }: Options\n): Observable {\n\n /* Compute necessary adjustment for offset */\n const adjust$ = viewport.size$\n .pipe(\n switchMapTo(header$),\n map(({ height }) => el.offsetTop + el.offsetHeight - height),\n distinctUntilChanged()\n )\n\n /* Compute relative offset and return as hot observable */\n return combineLatest([viewport.offset$, adjust$])\n .pipe(\n map(([{ x, y }, adjust]) => ({ x, y: y - adjust })),\n shareReplay(1)\n )\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport {\n MonoTypeOperatorFunction,\n animationFrameScheduler,\n pipe\n} from \"rxjs\"\nimport {\n distinctUntilKeyChanged,\n finalize,\n observeOn,\n tap\n} from \"rxjs/operators\"\n\nimport { resetHeaderShadow, setHeaderShadow } from \"actions\"\n\nimport { MainState } from \"../../main\"\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Paint header shadow from source observable\n *\n * @param el - Header element\n *\n * @return Operator function\n */\nexport function paintHeaderShadow(\n el: HTMLElement\n): MonoTypeOperatorFunction {\n return pipe(\n distinctUntilKeyChanged(\"active\"),\n\n /* Defer repaint to next animation frame */\n observeOn(animationFrameScheduler),\n tap(({ active }) => {\n setHeaderShadow(el, active)\n }),\n\n /* Reset on complete or error */\n finalize(() => {\n resetHeaderShadow(el)\n })\n )\n}\n","/** PURE_IMPORTS_START _distinctUntilChanged PURE_IMPORTS_END */\nimport { distinctUntilChanged } from './distinctUntilChanged';\nexport function distinctUntilKeyChanged(key, compare) {\n return distinctUntilChanged(function (x, y) { return compare ? compare(x[key], y[key]) : x[key] === y[key]; });\n}\n//# sourceMappingURL=distinctUntilKeyChanged.js.map\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Set header shadow\n *\n * @param el - Header element\n * @param value - Whether the shadow is shown\n */\nexport function setHeaderShadow(\n el: HTMLElement, value: boolean\n): void {\n el.setAttribute(\"data-md-state\", value ? \"shadow\" : \"\")\n}\n\n/**\n * Reset header shadow\n *\n * @param el - Header element\n */\nexport function resetHeaderShadow(\n el: HTMLElement\n): void {\n el.removeAttribute(\"data-md-state\")\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { JSX as JSXInternal } from \"preact\"\nimport { keys } from \"ramda\"\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * HTML attributes\n */\ntype Attributes =\n & JSXInternal.HTMLAttributes\n & JSXInternal.SVGAttributes\n & Record\n\n/**\n * Child element\n */\ntype Child = Child[] | HTMLElement | Text | string | number\n\n/* ----------------------------------------------------------------------------\n * Helper functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Append a child node to an element\n *\n * @param el - HTML element\n * @param child - Child node\n */\nfunction appendChild(el: HTMLElement, child: Child): void {\n\n /* Handle primitive types (including raw HTML) */\n if (typeof child === \"string\" || typeof child === \"number\") {\n el.innerHTML += child.toString()\n\n /* Handle nodes */\n } else if (child instanceof Node) {\n el.appendChild(child)\n\n /* Handle nested children */\n } else if (Array.isArray(child)) {\n for (const node of child)\n appendChild(el, node)\n }\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * JSX factory\n *\n * @param tag - HTML tag\n * @param attributes - HTML attributes\n * @param children - Child elements\n *\n * @return HTML element\n */\nexport function h(\n tag: string, attributes: Attributes | null,\n ...children: Array\n): HTMLElement {\n const el = document.createElement(tag)\n\n /* Set attributes, if any */\n if (attributes)\n for (const attr of keys(attributes))\n if (typeof attributes[attr] !== \"boolean\")\n el.setAttribute(attr, attributes[attr])\n else if (attributes[attr])\n el.setAttribute(attr, \"\")\n\n /* Append child nodes */\n for (const child of children)\n appendChild(el, child)\n\n /* Return element */\n return el\n}\n\n/**\n * JSX factory wrapper\n *\n * @param el - JSX element\n *\n * @return HTML element\n */\nexport function toHTMLElement(el: JSXInternal.Element): HTMLElement {\n return el as any // Hack: if you have a better idea, PR!\n}\n\n/* ----------------------------------------------------------------------------\n * Namespace\n * ------------------------------------------------------------------------- */\n\nexport declare namespace h {\n export import JSX = JSXInternal\n}\n","/** PURE_IMPORTS_START tslib,_OuterSubscriber,_util_subscribeToResult PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { OuterSubscriber } from '../OuterSubscriber';\nimport { subscribeToResult } from '../util/subscribeToResult';\nexport function takeUntil(notifier) {\n return function (source) { return source.lift(new TakeUntilOperator(notifier)); };\n}\nvar TakeUntilOperator = /*@__PURE__*/ (function () {\n function TakeUntilOperator(notifier) {\n this.notifier = notifier;\n }\n TakeUntilOperator.prototype.call = function (subscriber, source) {\n var takeUntilSubscriber = new TakeUntilSubscriber(subscriber);\n var notifierSubscription = subscribeToResult(takeUntilSubscriber, this.notifier);\n if (notifierSubscription && !takeUntilSubscriber.seenValue) {\n takeUntilSubscriber.add(notifierSubscription);\n return source.subscribe(takeUntilSubscriber);\n }\n return takeUntilSubscriber;\n };\n return TakeUntilOperator;\n}());\nvar TakeUntilSubscriber = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(TakeUntilSubscriber, _super);\n function TakeUntilSubscriber(destination) {\n var _this = _super.call(this, destination) || this;\n _this.seenValue = false;\n return _this;\n }\n TakeUntilSubscriber.prototype.notifyNext = function (outerValue, innerValue, outerIndex, innerIndex, innerSub) {\n this.seenValue = true;\n this.complete();\n };\n TakeUntilSubscriber.prototype.notifyComplete = function () {\n };\n return TakeUntilSubscriber;\n}(OuterSubscriber));\n//# sourceMappingURL=takeUntil.js.map\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport {\n EMPTY,\n Observable,\n OperatorFunction,\n combineLatest,\n of,\n pipe\n} from \"rxjs\"\nimport {\n filter,\n switchMap,\n takeUntil\n} from \"rxjs/operators\"\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Toggle switch map with another observable\n *\n * @template T - Source value type\n * @template U - Target value type\n *\n * @param toggle$ - Toggle observable\n * @param project - Projection\n *\n * @return Operator function\n */\nexport function switchMapIf(\n toggle$: Observable, project: (value: T) => Observable\n): OperatorFunction {\n const begin$ = toggle$.pipe(filter(value => value))\n const end$ = toggle$.pipe(filter(value => !value))\n return pipe(\n switchMap(value => combineLatest([of(value), begin$])),\n switchMap(([value, active]) => active\n ? project(value)\n .pipe(\n takeUntil(end$)\n )\n : EMPTY\n )\n )\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { Observable, OperatorFunction, pipe } from \"rxjs\"\nimport { map, shareReplay } from \"rxjs/operators\"\n\nimport { switchMapIf } from \"extensions\"\nimport { Agent, paintHidden } from \"utilities\"\n\nimport { HeaderState, watchViewportOffsetFromTopOf } from \"../header\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Hero state\n */\nexport interface HeroState {\n hidden: boolean /* Whether the hero is hidden */\n}\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * Options\n */\ninterface Options {\n header$: Observable /* Header state observable */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch hero\n *\n * @param el - Hero element\n * @param agent - Agent\n * @param options - Options\n *\n * @return Hero state\n */\nexport function watchHero(\n el: HTMLElement, agent: Agent, { header$ }: Options\n): Observable {\n\n /* Watch and paint visibility */\n const hidden$ = watchViewportOffsetFromTopOf(el, agent, { header$ })\n .pipe(\n paintHidden(el, 20)\n )\n\n /* Combine into a single hot observable */\n return hidden$\n .pipe(\n map(hidden => ({ hidden }))\n )\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Mount hero from source observable\n *\n * @param agent - Agent\n * @param options - Options\n *\n * @return Operator function\n */\nexport function mountHero(\n agent: Agent, options: Options\n): OperatorFunction {\n const { media } = agent\n return pipe(\n switchMapIf(media.screen$, el => watchHero(el, agent, options)),\n shareReplay(1)\n )\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { Observable, OperatorFunction, combineLatest, pipe } from \"rxjs\"\nimport {\n distinctUntilChanged,\n map,\n pluck,\n shareReplay,\n switchMap\n} from \"rxjs/operators\"\n\nimport { Agent } from \"utilities\"\n\nimport { HeaderState } from \"../../header\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Main area state\n */\nexport interface MainState {\n offset: number /* Main area top offset */\n height: number /* Main area visible height */\n active: boolean /* Scrolled past top offset */\n}\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * Options\n */\ninterface Options {\n header$: Observable /* Header state observable */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch main area\n *\n * This function returns an observable that computes the visual parameters of\n * the main area which depends on the viewport height and vertical offset, as\n * well as the height of the header element, if the header is fixed.\n *\n * @param el - Main area element\n * @param agent - Agent\n * @param options - Options\n *\n * @return Main area state observable\n */\nexport function watchMain(\n el: HTMLElement, { viewport }: Agent, { header$ }: Options\n): Observable {\n\n /* Compute necessary adjustment for header */\n const adjust$ = header$\n .pipe(\n pluck(\"height\")\n )\n\n /* Compute the main area's visible height */\n const height$ = combineLatest([\n viewport.offset$,\n viewport.size$,\n adjust$\n ])\n .pipe(\n map(([{ y }, { height }, adjust]) => {\n const top = el.offsetTop\n const bottom = el.offsetHeight + top\n return height\n - Math.max(0, top - y, adjust)\n - Math.max(0, height + y - bottom)\n }),\n distinctUntilChanged()\n )\n\n /* Compute whether the viewport offset is past the main area's top */\n const active$ = combineLatest([viewport.offset$, adjust$])\n .pipe(\n map(([{ y }, adjust]) => y >= el.offsetTop - adjust),\n distinctUntilChanged()\n )\n\n /* Combine into a single hot observable */\n return combineLatest([height$, adjust$, active$])\n .pipe(\n map(([height, adjust, active]) => ({\n offset: el.offsetTop - adjust,\n height,\n active\n }))\n )\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Mount main area from source observable\n *\n * @param agent - Agent\n * @param options - Options\n *\n * @return Operator function\n */\nexport function mountMain(\n agent: Agent, options: Options\n): OperatorFunction {\n return pipe(\n switchMap(el => watchMain(el, agent, options)),\n shareReplay(1)\n )\n}\n","import _curry1 from './_curry1.js';\nimport _isPlaceholder from './_isPlaceholder.js';\n\n/**\n * Optimized internal two-arity curry function.\n *\n * @private\n * @category Function\n * @param {Function} fn The function to curry.\n * @return {Function} The curried function.\n */\nexport default function _curry2(fn) {\n return function f2(a, b) {\n switch (arguments.length) {\n case 0:\n return f2;\n case 1:\n return _isPlaceholder(a) ? f2 : _curry1(function (_b) {\n return fn(a, _b);\n });\n default:\n return _isPlaceholder(a) && _isPlaceholder(b) ? f2 : _isPlaceholder(a) ? _curry1(function (_a) {\n return fn(_a, b);\n }) : _isPlaceholder(b) ? _curry1(function (_b) {\n return fn(a, _b);\n }) : fn(a, b);\n }\n };\n}","export default function _arrayFromIterator(iter) {\n var list = [];\n var next;\n while (!(next = iter.next()).done) {\n list.push(next.value);\n }\n return list;\n}","export default function _includesWith(pred, x, list) {\n var idx = 0;\n var len = list.length;\n\n while (idx < len) {\n if (pred(x, list[idx])) {\n return true;\n }\n idx += 1;\n }\n return false;\n}","// Based on https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Object/is\nfunction _objectIs(a, b) {\n // SameValue algorithm\n if (a === b) {\n // Steps 1-5, 7-10\n // Steps 6.b-6.e: +0 != -0\n return a !== 0 || 1 / a === 1 / b;\n } else {\n // Step 6.a: NaN == NaN\n return a !== a && b !== b;\n }\n}\n\nexport default typeof Object.is === 'function' ? Object.is : _objectIs;","import _curry1 from './internal/_curry1.js';\n\n/**\n * Gives a single-word string description of the (native) type of a value,\n * returning such answers as 'Object', 'Number', 'Array', or 'Null'. Does not\n * attempt to distinguish user Object types any further, reporting them all as\n * 'Object'.\n *\n * @func\n * @memberOf R\n * @since v0.8.0\n * @category Type\n * @sig (* -> {*}) -> String\n * @param {*} val The value to test\n * @return {String}\n * @example\n *\n * R.type({}); //=> \"Object\"\n * R.type(1); //=> \"Number\"\n * R.type(false); //=> \"Boolean\"\n * R.type('s'); //=> \"String\"\n * R.type(null); //=> \"Null\"\n * R.type([]); //=> \"Array\"\n * R.type(/[A-z]/); //=> \"RegExp\"\n * R.type(() => {}); //=> \"Function\"\n * R.type(undefined); //=> \"Undefined\"\n */\nvar type = /*#__PURE__*/_curry1(function type(val) {\n return val === null ? 'Null' : val === undefined ? 'Undefined' : Object.prototype.toString.call(val).slice(8, -1);\n});\nexport default type;","import _arrayFromIterator from './_arrayFromIterator.js';\nimport _includesWith from './_includesWith.js';\nimport _functionName from './_functionName.js';\nimport _has from './_has.js';\nimport _objectIs from './_objectIs.js';\nimport keys from '../keys.js';\nimport type from '../type.js';\n\n/**\n * private _uniqContentEquals function.\n * That function is checking equality of 2 iterator contents with 2 assumptions\n * - iterators lengths are the same\n * - iterators values are unique\n *\n * false-positive result will be returned for comparision of, e.g.\n * - [1,2,3] and [1,2,3,4]\n * - [1,1,1] and [1,2,3]\n * */\n\nfunction _uniqContentEquals(aIterator, bIterator, stackA, stackB) {\n var a = _arrayFromIterator(aIterator);\n var b = _arrayFromIterator(bIterator);\n\n function eq(_a, _b) {\n return _equals(_a, _b, stackA.slice(), stackB.slice());\n }\n\n // if *a* array contains any element that is not included in *b*\n return !_includesWith(function (b, aItem) {\n return !_includesWith(eq, aItem, b);\n }, b, a);\n}\n\nexport default function _equals(a, b, stackA, stackB) {\n if (_objectIs(a, b)) {\n return true;\n }\n\n var typeA = type(a);\n\n if (typeA !== type(b)) {\n return false;\n }\n\n if (a == null || b == null) {\n return false;\n }\n\n if (typeof a['fantasy-land/equals'] === 'function' || typeof b['fantasy-land/equals'] === 'function') {\n return typeof a['fantasy-land/equals'] === 'function' && a['fantasy-land/equals'](b) && typeof b['fantasy-land/equals'] === 'function' && b['fantasy-land/equals'](a);\n }\n\n if (typeof a.equals === 'function' || typeof b.equals === 'function') {\n return typeof a.equals === 'function' && a.equals(b) && typeof b.equals === 'function' && b.equals(a);\n }\n\n switch (typeA) {\n case 'Arguments':\n case 'Array':\n case 'Object':\n if (typeof a.constructor === 'function' && _functionName(a.constructor) === 'Promise') {\n return a === b;\n }\n break;\n case 'Boolean':\n case 'Number':\n case 'String':\n if (!(typeof a === typeof b && _objectIs(a.valueOf(), b.valueOf()))) {\n return false;\n }\n break;\n case 'Date':\n if (!_objectIs(a.valueOf(), b.valueOf())) {\n return false;\n }\n break;\n case 'Error':\n return a.name === b.name && a.message === b.message;\n case 'RegExp':\n if (!(a.source === b.source && a.global === b.global && a.ignoreCase === b.ignoreCase && a.multiline === b.multiline && a.sticky === b.sticky && a.unicode === b.unicode)) {\n return false;\n }\n break;\n }\n\n var idx = stackA.length - 1;\n while (idx >= 0) {\n if (stackA[idx] === a) {\n return stackB[idx] === b;\n }\n idx -= 1;\n }\n\n switch (typeA) {\n case 'Map':\n if (a.size !== b.size) {\n return false;\n }\n\n return _uniqContentEquals(a.entries(), b.entries(), stackA.concat([a]), stackB.concat([b]));\n case 'Set':\n if (a.size !== b.size) {\n return false;\n }\n\n return _uniqContentEquals(a.values(), b.values(), stackA.concat([a]), stackB.concat([b]));\n case 'Arguments':\n case 'Array':\n case 'Object':\n case 'Boolean':\n case 'Number':\n case 'String':\n case 'Date':\n case 'Error':\n case 'RegExp':\n case 'Int8Array':\n case 'Uint8Array':\n case 'Uint8ClampedArray':\n case 'Int16Array':\n case 'Uint16Array':\n case 'Int32Array':\n case 'Uint32Array':\n case 'Float32Array':\n case 'Float64Array':\n case 'ArrayBuffer':\n break;\n default:\n // Values of other types are only equal if identical.\n return false;\n }\n\n var keysA = keys(a);\n if (keysA.length !== keys(b).length) {\n return false;\n }\n\n var extendedStackA = stackA.concat([a]);\n var extendedStackB = stackB.concat([b]);\n\n idx = keysA.length - 1;\n while (idx >= 0) {\n var key = keysA[idx];\n if (!(_has(key, b) && _equals(b[key], a[key], extendedStackA, extendedStackB))) {\n return false;\n }\n idx -= 1;\n }\n return true;\n}","export default function _functionName(f) {\n // String(x => x) evaluates to \"x => x\", so the pattern may not match.\n var match = String(f).match(/^function (\\w*)/);\n return match == null ? '' : match[1];\n}","import _curry2 from './internal/_curry2.js';\nimport _equals from './internal/_equals.js';\n\n/**\n * Returns `true` if its arguments are equivalent, `false` otherwise. Handles\n * cyclical data structures.\n *\n * Dispatches symmetrically to the `equals` methods of both arguments, if\n * present.\n *\n * @func\n * @memberOf R\n * @since v0.15.0\n * @category Relation\n * @sig a -> b -> Boolean\n * @param {*} a\n * @param {*} b\n * @return {Boolean}\n * @example\n *\n * R.equals(1, 1); //=> true\n * R.equals(1, '1'); //=> false\n * R.equals([1, 2, 3], [1, 2, 3]); //=> true\n *\n * const a = {}; a.v = a;\n * const b = {}; b.v = b;\n * R.equals(a, b); //=> true\n */\nvar equals = /*#__PURE__*/_curry2(function equals(a, b) {\n return _equals(a, b, [], []);\n});\nexport default equals;","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { equals } from \"ramda\"\nimport {\n MonoTypeOperatorFunction,\n Observable,\n animationFrameScheduler,\n combineLatest,\n pipe\n} from \"rxjs\"\nimport {\n distinctUntilChanged,\n finalize,\n map,\n observeOn,\n shareReplay,\n tap\n} from \"rxjs/operators\"\n\nimport {\n resetSidebarHeight,\n resetSidebarLock,\n setSidebarHeight,\n setSidebarLock\n} from \"actions\"\nimport { Agent } from \"utilities\"\n\nimport { MainState } from \"../_\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Sidebar state\n */\nexport interface SidebarState {\n height: number /* Sidebar height */\n lock: boolean /* Sidebar lock */\n}\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * Options\n */\ninterface Options {\n main$: Observable /* Main area state observable */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch sidebar\n *\n * This function returns an observable that computes the visual parameters of\n * the sidebar which depends on the vertical viewport offset, as well as the\n * height of the main area. When the page is scrolled beyond the header, the\n * sidebar is locked and fills the remaining space.\n *\n * @param el - Sidebar element\n * @param agent - Agent\n * @param options - Options\n *\n * @return Sidebar state observable\n */\nexport function watchSidebar(\n el: HTMLElement, { viewport }: Agent, { main$ }: Options\n): Observable {\n\n /* Adjust for internal main area offset */\n const adjust = parseFloat(\n getComputedStyle(el.parentElement!)\n .getPropertyValue(\"padding-top\")\n )\n\n /* Compute the sidebar's available height */\n const height$ = combineLatest([viewport.offset$, main$])\n .pipe(\n map(([{ y }, { offset, height }]) => {\n return height - adjust + Math.min(adjust, Math.max(0, y - offset))\n })\n )\n\n /* Compute whether the sidebar should be locked */\n const lock$ = combineLatest([viewport.offset$, main$])\n .pipe(\n map(([{ y }, { offset }]) => y >= offset + adjust)\n )\n\n /* Combine into single hot observable */\n return combineLatest([height$, lock$])\n .pipe(\n map(([height, lock]) => ({ height, lock })),\n distinctUntilChanged(equals),\n shareReplay(1)\n )\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Paint sidebar from source observable\n *\n * @param el - Sidebar element\n *\n * @return Operator function\n */\nexport function paintSidebar(\n el: HTMLElement\n): MonoTypeOperatorFunction {\n return pipe(\n\n /* Defer repaint to next animation frame */\n observeOn(animationFrameScheduler),\n tap(({ height, lock }) => {\n setSidebarHeight(el, height)\n setSidebarLock(el, lock)\n }),\n\n /* Reset on complete or error */\n finalize(() => {\n resetSidebarHeight(el)\n resetSidebarLock(el)\n })\n )\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Set sidebar height\n *\n * @param el - Sidebar element\n * @param value - Sidebar height\n */\nexport function setSidebarHeight(\n el: HTMLElement, value: number\n): void {\n el.style.height = `${value}px`\n}\n\n/**\n * Reset sidebar height\n *\n * @param el - Sidebar element\n */\nexport function resetSidebarHeight(\n el: HTMLElement\n): void {\n el.style.height = \"\"\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Set sidebar lock\n *\n * @param el - Sidebar element\n * @param value - Whether the sidebar is locked\n */\nexport function setSidebarLock(\n el: HTMLElement, value: boolean\n): void {\n el.setAttribute(\"data-md-state\", value ? \"lock\" : \"\")\n}\n\n/**\n * Reset sidebar lock\n *\n * @param el - Sidebar element\n */\nexport function resetSidebarLock(\n el: HTMLElement\n): void {\n el.removeAttribute(\"data-md-state\")\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { Observable, OperatorFunction, pipe } from \"rxjs\"\nimport { map, shareReplay } from \"rxjs/operators\"\n\nimport { switchMapIf } from \"extensions\"\nimport { Agent } from \"utilities\"\n\nimport {\n MainState,\n SidebarState,\n paintSidebar,\n watchSidebar\n} from \"../../main\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Navigation state\n */\nexport interface NavigationState {\n sidebar: SidebarState /* Sidebar state */\n}\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * Options\n */\ninterface Options {\n main$: Observable /* Main area state observable */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch navigation\n *\n * @param el - Navigation element\n * @param agent - Agent\n * @param options - Options\n *\n * @return Navigation state observable\n */\nexport function watchNavigation(\n el: HTMLElement, agent: Agent, { main$ }: Options\n): Observable {\n\n /* Watch and paint sidebar */\n const sidebar$ = watchSidebar(el, agent, { main$ })\n .pipe(\n paintSidebar(el)\n )\n\n /* Combine into a single hot observable */\n return sidebar$\n .pipe(\n map(sidebar => ({ sidebar }))\n )\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Mount navigation from source observable\n *\n * @param agent - Agent\n * @param options - Options\n *\n * @return Operator function\n */\nexport function mountNavigation(\n agent: Agent, options: Options\n): OperatorFunction {\n const { media } = agent\n return pipe(\n switchMapIf(media.screen$, el => watchNavigation(el, agent, options)),\n shareReplay(1)\n )\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { Observable, combineLatest, fromEvent } from \"rxjs\"\nimport {\n distinctUntilChanged,\n map,\n shareReplay,\n startWith\n} from \"rxjs/operators\"\n\nimport { watchElementFocus } from \"utilities\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Search query state\n */\nexport interface SearchQueryState {\n value: string /* Query value */\n focus: boolean /* Query focus state */\n}\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * Options\n */\ninterface Options {\n prepare(value: string): string /* Preparation function */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch search query\n *\n * @param el - Search query element\n * @param options - Options\n *\n * @return Search query state observable\n */\nexport function watchSearchQuery(\n el: HTMLInputElement, { prepare }: Options\n): Observable {\n\n /* Intercept keyboard events */\n const value$ = fromEvent(el, \"keyup\")\n .pipe(\n map(() => prepare(el.value)),\n startWith(\"\"),\n distinctUntilChanged()\n )\n\n /* Intercept focus events */\n const focus$ = watchElementFocus(el)\n\n /* Combine into a single hot observable */\n return combineLatest([value$, focus$])\n .pipe(\n map(([value, focus]) => ({ value, focus })),\n shareReplay(1)\n )\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { Observable, fromEvent, merge } from \"rxjs\"\nimport { mapTo, shareReplay, startWith } from \"rxjs/operators\"\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch element focus\n *\n * @param el - Element\n *\n * @return Element focus observable\n */\nexport function watchElementFocus(\n el: HTMLElement\n): Observable {\n const focus$ = fromEvent(el, \"focus\")\n const blur$ = fromEvent(el, \"blur\")\n\n /* Map events to boolean state */\n return merge(\n focus$.pipe(mapTo(true)),\n blur$.pipe(mapTo(false))\n )\n .pipe(\n startWith(el === document.activeElement),\n shareReplay(1)\n )\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { Observable, fromEvent } from \"rxjs\"\nimport { mapTo } from \"rxjs/operators\"\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch search reset\n *\n * @param el - Search reset element\n *\n * @return Search reset observable\n */\nexport function watchSearchReset(\n el: HTMLElement\n): Observable {\n return fromEvent(el, \"click\")\n .pipe(\n mapTo(undefined)\n )\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { h, toHTMLElement } from \"extensions\"\nimport { ArticleDocument } from \"modules\"\nimport { truncate } from \"utilities\"\n\n/* ----------------------------------------------------------------------------\n * Data\n * ------------------------------------------------------------------------- */\n\n/**\n * CSS classes\n */\nconst css = {\n link: \"md-search-result__link\",\n article: \"md-search-result__article md-search-result__article--document\",\n title: \"md-search-result__title\",\n teaser: \"md-search-result__teaser\"\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Render an article document\n *\n * @param article - Article document\n *\n * @return HTML element\n */\nexport function renderArticleDocument(\n { location, title, text }: ArticleDocument\n): HTMLElement {\n return toHTMLElement(\n \n
\n

{title}

\n {text.length\n ?

{truncate(text, 320)}

\n : undefined\n }\n
\n \n )\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { h, toHTMLElement } from \"extensions\"\nimport { SectionDocument } from \"modules\"\nimport { truncate } from \"utilities\"\n\n/* ----------------------------------------------------------------------------\n * Data\n * ------------------------------------------------------------------------- */\n\n/**\n * CSS classes\n */\nconst css = {\n link: \"md-search-result__link\",\n article: \"md-search-result__article\",\n title: \"md-search-result__title\",\n teaser: \"md-search-result__teaser\"\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Render a section document\n *\n * @param section - Section document\n *\n * @return HTML element\n */\nexport function renderSectionDocument(\n { location, title, text }: SectionDocument\n): HTMLElement {\n return toHTMLElement(\n \n
\n

{title}

\n {text.length\n ?

{truncate(text, 320)}

\n : undefined\n }\n
\n \n )\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { h, toHTMLElement } from \"extensions\"\nimport { SearchResult } from \"modules\"\n\nimport { renderArticleDocument } from \"../article\"\nimport { renderSectionDocument } from \"../section\"\n\n/* ----------------------------------------------------------------------------\n * Data\n * ------------------------------------------------------------------------- */\n\n/**\n * CSS classes\n */\nconst css = {\n item: \"md-search-result__item\"\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Render a search result\n *\n * @param result - Search result\n *\n * @return HTML element\n */\nexport function renderSearchResult(\n { article, sections }: SearchResult\n): HTMLElement {\n return toHTMLElement(\n
  • \n {renderArticleDocument(article)}\n {...sections.map(renderSectionDocument)}\n
    • \n )\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { h, toHTMLElement } from \"extensions\"\n\n/* ----------------------------------------------------------------------------\n * Data\n * ------------------------------------------------------------------------- */\n\n/**\n * CSS classes\n */\nconst css = {\n facts: \"md-source__facts\",\n fact: \"md-source__fact\"\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Render source facts\n *\n * @param facts - Source facts\n *\n * @return HTML element\n */\nexport function renderSource(\n facts: any // TODO: add typings\n): HTMLElement {\n return toHTMLElement(\n
      \n {facts.map((fact: any) =>
    • {fact}
      • )}\n
    \n )\n}\n","/** PURE_IMPORTS_START tslib,_OuterSubscriber,_util_subscribeToResult PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { OuterSubscriber } from '../OuterSubscriber';\nimport { subscribeToResult } from '../util/subscribeToResult';\nexport function withLatestFrom() {\n var args = [];\n for (var _i = 0; _i < arguments.length; _i++) {\n args[_i] = arguments[_i];\n }\n return function (source) {\n var project;\n if (typeof args[args.length - 1] === 'function') {\n project = args.pop();\n }\n var observables = args;\n return source.lift(new WithLatestFromOperator(observables, project));\n };\n}\nvar WithLatestFromOperator = /*@__PURE__*/ (function () {\n function WithLatestFromOperator(observables, project) {\n this.observables = observables;\n this.project = project;\n }\n WithLatestFromOperator.prototype.call = function (subscriber, source) {\n return source.subscribe(new WithLatestFromSubscriber(subscriber, this.observables, this.project));\n };\n return WithLatestFromOperator;\n}());\nvar WithLatestFromSubscriber = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(WithLatestFromSubscriber, _super);\n function WithLatestFromSubscriber(destination, observables, project) {\n var _this = _super.call(this, destination) || this;\n _this.observables = observables;\n _this.project = project;\n _this.toRespond = [];\n var len = observables.length;\n _this.values = new Array(len);\n for (var i = 0; i < len; i++) {\n _this.toRespond.push(i);\n }\n for (var i = 0; i < len; i++) {\n var observable = observables[i];\n _this.add(subscribeToResult(_this, observable, observable, i));\n }\n return _this;\n }\n WithLatestFromSubscriber.prototype.notifyNext = function (outerValue, innerValue, outerIndex, innerIndex, innerSub) {\n this.values[outerIndex] = innerValue;\n var toRespond = this.toRespond;\n if (toRespond.length > 0) {\n var found = toRespond.indexOf(outerIndex);\n if (found !== -1) {\n toRespond.splice(found, 1);\n }\n }\n };\n WithLatestFromSubscriber.prototype.notifyComplete = function () {\n };\n WithLatestFromSubscriber.prototype._next = function (value) {\n if (this.toRespond.length === 0) {\n var args = [value].concat(this.values);\n if (this.project) {\n this._tryProject(args);\n }\n else {\n this.destination.next(args);\n }\n }\n };\n WithLatestFromSubscriber.prototype._tryProject = function (args) {\n var result;\n try {\n result = this.project.apply(this, args);\n }\n catch (err) {\n this.destination.error(err);\n return;\n }\n this.destination.next(result);\n };\n return WithLatestFromSubscriber;\n}(OuterSubscriber));\n//# sourceMappingURL=withLatestFrom.js.map\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { MonoTypeOperatorFunction, Observable, pipe } from \"rxjs\"\nimport { map, withLatestFrom } from \"rxjs/operators\"\n\nimport {\n resetSearchResultMeta,\n setSearchResultMeta\n} from \"actions\"\nimport { SearchResult } from \"modules\"\nimport { getElement } from \"utilities\"\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * Options\n */\ninterface Options {\n query$: Observable /* Search query observable */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Paint search result metadata from source observable\n *\n * @param el - Search result metadata element\n * @param options - Options\n *\n * @return Operator function\n */\nexport function paintSearchResultMeta(\n el: HTMLElement, { query$ }: Options\n): MonoTypeOperatorFunction {\n const meta = getElement(\".md-search-result__meta\", el)!\n return pipe(\n withLatestFrom(query$),\n map(([result, query]) => {\n if (query) {\n setSearchResultMeta(meta, result.length)\n } else {\n resetSearchResultMeta(meta)\n }\n return result\n })\n )\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { identity } from \"ramda\"\nimport { Observable, OperatorFunction, pipe } from \"rxjs\"\nimport {\n distinctUntilChanged,\n filter,\n map,\n shareReplay,\n switchMap\n} from \"rxjs/operators\"\n\nimport { SearchResult } from \"modules\"\nimport { Agent, watchElementOffset } from \"utilities\"\n\nimport { paintSearchResultList } from \"../list\"\nimport { paintSearchResultMeta } from \"../meta\"\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * Options\n */\ninterface Options {\n result$: Observable /* Search result observable */\n query$: Observable /* Search query observable */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch search result\n *\n * @param el - Search result element\n * @param agent - Agent\n * @param options - Options\n *\n * @return Search result state observable\n */\nexport function watchSearchResult(\n el: HTMLElement, agent: Agent, { result$, query$ }: Options\n): Observable {\n const container = el.parentElement!\n\n /* Compute whether there are more search results elements */\n const render$ = watchElementOffset(container, agent)\n .pipe(\n map(({ y }) => y >= container.scrollHeight - container.offsetHeight - 16),\n distinctUntilChanged(),\n filter(identity)\n )\n\n /* Paint search results */\n return result$\n .pipe(\n paintSearchResultMeta(el, { query$ }),\n paintSearchResultList(el, { render$ })\n )\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Mount search result from source observable\n *\n * @param agent - Agent\n * @param options - Options\n *\n * @return Operator function\n */\nexport function mountSearchResult(\n agent: Agent, options: Options\n): OperatorFunction {\n return pipe(\n switchMap(el => watchSearchResult(el, agent, options)),\n shareReplay(1)\n )\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport {\n MonoTypeOperatorFunction,\n Observable,\n animationFrameScheduler,\n pipe\n} from \"rxjs\"\nimport {\n finalize,\n mapTo,\n observeOn,\n scan,\n switchMap\n} from \"rxjs/operators\"\n\nimport {\n addToSearchResultList,\n resetSearchResultList\n} from \"actions\"\nimport { SearchResult } from \"modules\"\nimport { renderSearchResult } from \"templates\"\nimport { getElement } from \"utilities\"\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * Options\n */\ninterface Options {\n render$: Observable /* Render trigger observable */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Paint search result list from source observable\n *\n * @param el - Search result element\n * @param options - Options\n *\n * @return Operator function\n */\nexport function paintSearchResultList(\n el: HTMLElement, { render$ }: Options\n): MonoTypeOperatorFunction {\n const container = el.parentElement!\n const list = getElement(\".md-search-result__list\", el)!\n return pipe(\n switchMap(result => render$\n .pipe(\n\n /* Defer repaint to next animation frame */\n observeOn(animationFrameScheduler),\n scan(index => {\n while (index < result.length) {\n addToSearchResultList(list, renderSearchResult(result[index++]))\n if (container.scrollHeight - container.offsetHeight > 16)\n break\n }\n return index\n }, 0),\n\n /* Re-map to search result */\n mapTo(result),\n\n /* Reset on complete or error */\n finalize(() => {\n resetSearchResultList(list)\n })\n )\n )\n )\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { Observable, OperatorFunction, pipe } from \"rxjs\"\nimport { map, shareReplay } from \"rxjs/operators\"\n\nimport { switchMapIf } from \"extensions\"\nimport { Agent, paintHidden } from \"utilities\"\n\nimport { HeaderState, watchViewportOffsetFromTopOf } from \"../header\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Tabs state\n */\nexport interface TabsState {\n hidden: boolean /* Whether the tabs are hidden */\n}\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * Options\n */\ninterface Options {\n header$: Observable /* Header state observable */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch tabs\n *\n * This function returns an observable that computes the visual parameters of\n * the tabs, currently only denoting whether the tabs are hidden or not.\n *\n * @param el - Tabs element\n * @param agent - Agent\n * @param options - Options\n *\n * @return Tabs state\n */\nexport function watchTabs(\n el: HTMLElement, agent: Agent, { header$ }: Options\n): Observable {\n\n /* Watch and paint visibility */\n const hidden$ = watchViewportOffsetFromTopOf(el, agent, { header$ })\n .pipe(\n paintHidden(el, 8)\n )\n\n /* Combine into a single hot observable */\n return hidden$\n .pipe(\n map(hidden => ({ hidden }))\n )\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Mount tabs from source observable\n *\n * @param agent - Agent\n * @param options - Options\n *\n * @return Operator function\n */\nexport function mountTabs(\n agent: Agent, options: Options\n): OperatorFunction {\n const { media } = agent\n return pipe(\n switchMapIf(media.screen$, el => watchTabs(el, agent, options)),\n shareReplay(1)\n )\n}\n","import _curry1 from './internal/_curry1.js';\nimport _isString from './internal/_isString.js';\n\n/**\n * Returns a new list or string with the elements or characters in reverse\n * order.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig [a] -> [a]\n * @sig String -> String\n * @param {Array|String} list\n * @return {Array|String}\n * @example\n *\n * R.reverse([1, 2, 3]); //=> [3, 2, 1]\n * R.reverse([1, 2]); //=> [2, 1]\n * R.reverse([1]); //=> [1]\n * R.reverse([]); //=> []\n *\n * R.reverse('abc'); //=> 'cba'\n * R.reverse('ab'); //=> 'ba'\n * R.reverse('a'); //=> 'a'\n * R.reverse(''); //=> ''\n */\nvar reverse = /*#__PURE__*/_curry1(function reverse(list) {\n return _isString(list) ? list.split('').reverse().join('') : Array.prototype.slice.call(list, 0).reverse();\n});\nexport default reverse;","export default function _isString(x) {\n return Object.prototype.toString.call(x) === '[object String]';\n}","import _indexOf from './_indexOf.js';\n\nexport default function _includes(a, list) {\n return _indexOf(list, a, 0) >= 0;\n}","import equals from '../equals.js';\n\nexport default function _indexOf(list, a, idx) {\n var inf, item;\n // Array.prototype.indexOf doesn't exist below IE9\n if (typeof list.indexOf === 'function') {\n switch (typeof a) {\n case 'number':\n if (a === 0) {\n // manually crawl the list to distinguish between +0 and -0\n inf = 1 / a;\n while (idx < list.length) {\n item = list[idx];\n if (item === 0 && 1 / item === inf) {\n return idx;\n }\n idx += 1;\n }\n return -1;\n } else if (a !== a) {\n // NaN\n while (idx < list.length) {\n item = list[idx];\n if (typeof item === 'number' && item !== item) {\n return idx;\n }\n idx += 1;\n }\n return -1;\n }\n // non-zero numbers can utilise Set\n return list.indexOf(a, idx);\n\n // all these types can utilise Set\n case 'string':\n case 'boolean':\n case 'function':\n case 'undefined':\n return list.indexOf(a, idx);\n\n case 'object':\n if (a === null) {\n // null can utilise Set\n return list.indexOf(a, idx);\n }\n }\n }\n // anything else not covered above, defer to R.equals\n while (idx < list.length) {\n if (equals(list[idx], a)) {\n return idx;\n }\n idx += 1;\n }\n return -1;\n}","import _includes from './_includes.js';\n\nvar _Set = /*#__PURE__*/function () {\n function _Set() {\n /* globals Set */\n this._nativeSet = typeof Set === 'function' ? new Set() : null;\n this._items = {};\n }\n\n // until we figure out why jsdoc chokes on this\n // @param item The item to add to the Set\n // @returns {boolean} true if the item did not exist prior, otherwise false\n //\n _Set.prototype.add = function (item) {\n return !hasOrAdd(item, true, this);\n };\n\n //\n // @param item The item to check for existence in the Set\n // @returns {boolean} true if the item exists in the Set, otherwise false\n //\n _Set.prototype.has = function (item) {\n return hasOrAdd(item, false, this);\n };\n\n //\n // Combines the logic for checking whether an item is a member of the set and\n // for adding a new item to the set.\n //\n // @param item The item to check or add to the Set instance.\n // @param shouldAdd If true, the item will be added to the set if it doesn't\n // already exist.\n // @param set The set instance to check or add to.\n // @return {boolean} true if the item already existed, otherwise false.\n //\n return _Set;\n}();\n\nfunction hasOrAdd(item, shouldAdd, set) {\n var type = typeof item;\n var prevSize, newSize;\n switch (type) {\n case 'string':\n case 'number':\n // distinguish between +0 and -0\n if (item === 0 && 1 / item === -Infinity) {\n if (set._items['-0']) {\n return true;\n } else {\n if (shouldAdd) {\n set._items['-0'] = true;\n }\n return false;\n }\n }\n // these types can all utilise the native Set\n if (set._nativeSet !== null) {\n if (shouldAdd) {\n prevSize = set._nativeSet.size;\n set._nativeSet.add(item);\n newSize = set._nativeSet.size;\n return newSize === prevSize;\n } else {\n return set._nativeSet.has(item);\n }\n } else {\n if (!(type in set._items)) {\n if (shouldAdd) {\n set._items[type] = {};\n set._items[type][item] = true;\n }\n return false;\n } else if (item in set._items[type]) {\n return true;\n } else {\n if (shouldAdd) {\n set._items[type][item] = true;\n }\n return false;\n }\n }\n\n case 'boolean':\n // set._items['boolean'] holds a two element array\n // representing [ falseExists, trueExists ]\n if (type in set._items) {\n var bIdx = item ? 1 : 0;\n if (set._items[type][bIdx]) {\n return true;\n } else {\n if (shouldAdd) {\n set._items[type][bIdx] = true;\n }\n return false;\n }\n } else {\n if (shouldAdd) {\n set._items[type] = item ? [false, true] : [true, false];\n }\n return false;\n }\n\n case 'function':\n // compare functions for reference equality\n if (set._nativeSet !== null) {\n if (shouldAdd) {\n prevSize = set._nativeSet.size;\n set._nativeSet.add(item);\n newSize = set._nativeSet.size;\n return newSize === prevSize;\n } else {\n return set._nativeSet.has(item);\n }\n } else {\n if (!(type in set._items)) {\n if (shouldAdd) {\n set._items[type] = [item];\n }\n return false;\n }\n if (!_includes(item, set._items[type])) {\n if (shouldAdd) {\n set._items[type].push(item);\n }\n return false;\n }\n return true;\n }\n\n case 'undefined':\n if (set._items[type]) {\n return true;\n } else {\n if (shouldAdd) {\n set._items[type] = true;\n }\n return false;\n }\n\n case 'object':\n if (item === null) {\n if (!set._items['null']) {\n if (shouldAdd) {\n set._items['null'] = true;\n }\n return false;\n }\n return true;\n }\n /* falls through */\n default:\n // reduce the search size of heterogeneous sets by creating buckets\n // for each type.\n type = Object.prototype.toString.call(item);\n if (!(type in set._items)) {\n if (shouldAdd) {\n set._items[type] = [item];\n }\n return false;\n }\n // scan through all previously applied items\n if (!_includes(item, set._items[type])) {\n if (shouldAdd) {\n set._items[type].push(item);\n }\n return false;\n }\n return true;\n }\n}\n\n// A simple Set type that honours R.equals semantics\nexport default _Set;","import _curry2 from './internal/_curry2.js';\nimport _Set from './internal/_Set.js';\n\n/**\n * Finds the set (i.e. no duplicates) of all elements in the first list not\n * contained in the second list. Objects and Arrays are compared in terms of\n * value equality, not reference equality.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig [*] -> [*] -> [*]\n * @param {Array} list1 The first list.\n * @param {Array} list2 The second list.\n * @return {Array} The elements in `list1` that are not in `list2`.\n * @see R.differenceWith, R.symmetricDifference, R.symmetricDifferenceWith, R.without\n * @example\n *\n * R.difference([1,2,3,4], [7,6,5,4,3]); //=> [1,2]\n * R.difference([7,6,5,4,3], [1,2,3,4]); //=> [7,6,5]\n * R.difference([{a: 1}, {b: 2}], [{a: 1}, {c: 3}]) //=> [{b: 2}]\n */\nvar difference = /*#__PURE__*/_curry2(function difference(first, second) {\n var out = [];\n var idx = 0;\n var firstLen = first.length;\n var secondLen = second.length;\n var toFilterOut = new _Set();\n\n for (var i = 0; i < secondLen; i += 1) {\n toFilterOut.add(second[i]);\n }\n\n while (idx < firstLen) {\n if (toFilterOut.add(first[idx])) {\n out[out.length] = first[idx];\n }\n idx += 1;\n }\n return out;\n});\nexport default difference;","\n/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Packer message type\n */\nexport const enum PackerMessageType {\n STRING, /* String data */\n BINARY /* Packed data */\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * A message containing an unpacked string\n */\nexport interface PackerStringMessage {\n type: PackerMessageType.STRING /* Message type */\n data: string /* Message data */\n}\n\n/**\n * A message containing a packed string\n */\nexport interface PackerBinaryMessage {\n type: PackerMessageType.BINARY /* Message type */\n data: string /* Message data */\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * A message exchanged with the packer worker\n */\nexport type PackerMessage =\n | PackerStringMessage\n | PackerBinaryMessage\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Type guard for packer binary messages\n *\n * @param message - Packer worker message\n *\n * @return Test result\n */\nexport function isPackerBinaryMessage(\n message: PackerMessage\n): message is PackerBinaryMessage {\n return message.type === PackerMessageType.BINARY\n}\n\n/**\n * Type guard for packer string messages\n *\n * @param message - Packer worker message\n *\n * @return Test result\n */\nexport function isPackerStringMessage(\n message: PackerMessage\n): message is PackerStringMessage {\n return message.type === PackerMessageType.STRING\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A RTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { SearchIndexOptions, SearchResult } from \"modules\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Search message type\n */\nexport const enum SearchMessageType {\n SETUP, /* Search index setup */\n DUMP, /* Search index dump */\n QUERY, /* Search query */\n RESULT /* Search results */\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * A message containing the data necessary to setup the search index\n */\nexport interface SearchSetupMessage {\n type: SearchMessageType.SETUP /* Message type */\n data: SearchIndexOptions /* Message data */\n}\n\n/**\n * A message containing the a dump of the search index\n */\nexport interface SearchDumpMessage {\n type: SearchMessageType.DUMP /* Message type */\n data: string /* Message data */\n}\n\n/**\n * A message containing a search query\n */\nexport interface SearchQueryMessage {\n type: SearchMessageType.QUERY /* Message type */\n data: string /* Message data */\n}\n\n/**\n * A message containing results for a search query\n */\nexport interface SearchResultMessage {\n type: SearchMessageType.RESULT /* Message type */\n data: SearchResult[] /* Message data */\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * A message exchanged with the search worker\n */\nexport type SearchMessage =\n | SearchSetupMessage\n | SearchDumpMessage\n | SearchQueryMessage\n | SearchResultMessage\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Type guard for search setup messages\n *\n * @param message - Search worker message\n *\n * @return Test result\n */\nexport function isSearchSetupMessage(\n message: SearchMessage\n): message is SearchSetupMessage {\n return message.type === SearchMessageType.SETUP\n}\n\n/**\n * Type guard for search dump messages\n *\n * @param message - Search worker message\n *\n * @return Test result\n */\nexport function isSearchDumpMessage(\n message: SearchMessage\n): message is SearchDumpMessage {\n return message.type === SearchMessageType.DUMP\n}\n\n/**\n * Type guard for search query messages\n *\n * @param message - Search worker message\n *\n * @return Test result\n */\nexport function isSearchQueryMessage(\n message: SearchMessage\n): message is SearchQueryMessage {\n return message.type === SearchMessageType.QUERY\n}\n\n/**\n * Type guard for search result messages\n *\n * @param message - Search worker message\n *\n * @return Test result\n */\nexport function isSearchResultMessage(\n message: SearchMessage\n): message is SearchResultMessage {\n return message.type === SearchMessageType.RESULT\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { Observable, OperatorFunction, combineLatest, pipe } from \"rxjs\"\nimport { map, shareReplay } from \"rxjs/operators\"\n\nimport { switchMapIf } from \"extensions\"\nimport { Agent, getElements } from \"utilities\"\n\nimport { HeaderState } from \"../../header\"\nimport {\n MainState,\n SidebarState,\n paintSidebar,\n watchSidebar\n} from \"../../main\"\nimport {\n AnchorList,\n paintAnchorList,\n watchAnchorList\n} from \"../anchor\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Table of contents state\n */\nexport interface TableOfContentsState {\n sidebar: SidebarState /* Sidebar state */\n anchors: AnchorList /* Anchor list */\n}\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * Options\n */\ninterface Options {\n header$: Observable /* Header state observable */\n main$: Observable /* Main area state observable */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch table of contents\n *\n * @param el - Table of contents element\n * @param agent - Agent\n * @param options - Options\n *\n * @return Table of contents state observable\n */\nexport function watchTableOfContents(\n el: HTMLElement, agent: Agent, { header$, main$ }: Options\n): Observable {\n\n /* Watch and paint sidebar */\n const sidebar$ = watchSidebar(el, agent, { main$ })\n .pipe(\n paintSidebar(el)\n )\n\n /* Watch and paint anchor list (scroll spy) */\n const els = getElements(\".md-nav__link\", el)\n const anchors$ = watchAnchorList(els, agent, { header$ })\n .pipe(\n paintAnchorList(els)\n )\n\n /* Combine into a single hot observable */\n return combineLatest([sidebar$, anchors$])\n .pipe(\n map(([sidebar, anchors]) => ({ sidebar, anchors }))\n )\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Mount table of contents from source observable\n *\n * @param agent - Agent\n * @param options - Options\n *\n * @return Operator function\n */\nexport function mountTableOfContents(\n agent: Agent, options: Options\n): OperatorFunction {\n const { media } = agent\n return pipe(\n switchMapIf(media.tablet$, el => watchTableOfContents(el, agent, options)),\n shareReplay(1)\n )\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { difference, reverse } from \"ramda\"\nimport {\n MonoTypeOperatorFunction,\n Observable,\n animationFrameScheduler,\n combineLatest,\n pipe\n} from \"rxjs\"\nimport {\n distinctUntilChanged,\n finalize,\n map,\n observeOn,\n scan,\n shareReplay,\n switchMap,\n tap\n} from \"rxjs/operators\"\n\nimport {\n resetAnchorActive,\n resetAnchorBlur,\n setAnchorActive,\n setAnchorBlur\n} from \"actions\"\nimport { Agent, getElement } from \"utilities\"\n\nimport { HeaderState } from \"../../header\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Anchor list\n */\nexport interface AnchorList {\n prev: HTMLAnchorElement[][] /* Anchors (previous) */\n next: HTMLAnchorElement[][] /* Anchors (next) */\n}\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * Options\n */\ninterface Options {\n header$: Observable /* Header state observable */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch anchor list\n *\n * This is effectively a scroll-spy implementation which will account for the\n * fixed header and automatically re-calculate anchor offsets when the viewport\n * is resized. The returned observable will only emit if the anchor list needs\n * to be repainted.\n *\n * This implementation tracks an anchor element's entire path starting from its\n * level up to the top-most anchor element, e.g. `[h3, h2, h1]`. Although the\n * Material theme currently doesn't make use of this information, it enables\n * the styling of the entire hierarchy through customization.\n *\n * Note that the current anchor is the last item of the `prev` anchor list.\n *\n * @param els - Anchor elements\n * @param agent - Agent\n * @param options - Options\n *\n * @return Anchor list observable\n */\nexport function watchAnchorList(\n els: HTMLAnchorElement[], { viewport }: Agent, { header$ }: Options\n): Observable {\n const table = new Map()\n for (const el of els) {\n const id = decodeURIComponent(el.hash.substring(1))\n const target = getElement(`[id=\"${id}\"]`)\n if (typeof target !== \"undefined\")\n table.set(el, target)\n }\n\n /* Compute necessary adjustment for header */\n const adjust$ = header$\n .pipe(\n map(header => 18 + header.height)\n )\n\n /* Compute partition of previous and next anchors */\n const partition$ = viewport.size$\n .pipe(\n\n /* Build index to map anchor paths to vertical offsets */\n map(() => {\n let path: HTMLAnchorElement[] = []\n return [...table].reduce((index, [anchor, target]) => {\n while (path.length) {\n const last = table.get(path[path.length - 1])!\n if (last.tagName >= target.tagName) {\n path.pop()\n } else {\n break\n }\n }\n return index.set(\n reverse(path = [...path, anchor]),\n target.offsetTop\n )\n }, new Map())\n }),\n\n /* Re-compute partition when viewport offset changes */\n switchMap(index => combineLatest(viewport.offset$, adjust$)\n .pipe(\n scan(([prev, next], [{ y }, adjust]) => {\n\n /* Look forward */\n while (next.length) {\n const [, offset] = next[0]\n if (offset - adjust < y) {\n prev = [...prev, next.shift()!]\n } else {\n break\n }\n }\n\n /* Look backward */\n while (prev.length) {\n const [, offset] = prev[prev.length - 1]\n if (offset - adjust >= y) {\n next = [prev.pop()!, ...next]\n } else {\n break\n }\n }\n\n /* Return partition */\n return [prev, next]\n }, [[], [...index]]),\n distinctUntilChanged((a, b) => {\n return a[0] === b[0]\n && a[1] === b[1]\n })\n )\n )\n )\n\n /* Compute anchor list migrations */\n const migration$ = partition$\n .pipe(\n map(([prev, next]) => ({\n prev: prev.map(([path]) => path),\n next: next.map(([path]) => path)\n })),\n\n /* Extract anchor list migrations */\n scan((a, b) => {\n const begin = Math.max(0, Math.min(b.prev.length, a.prev.length) - 1)\n const end = Math.max(b.prev.length, a.prev.length)\n return {\n prev: b.prev.slice(begin, end + 1),\n next: difference(b.next, a.next)\n }\n }, { prev: [], next: [] })\n )\n\n /* Return anchor list migrations as hot observable */\n return migration$\n .pipe(\n shareReplay(1)\n )\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Paint anchor list from source observable\n *\n * @param els - Anchor elements\n *\n * @return Operator function\n */\nexport function paintAnchorList(\n els: HTMLAnchorElement[]\n): MonoTypeOperatorFunction {\n return pipe(\n\n /* Defer repaint to next animation frame */\n observeOn(animationFrameScheduler),\n tap(({ prev, next }) => {\n\n /* Look forward */\n for (const [el] of next) {\n resetAnchorActive(el)\n resetAnchorBlur(el)\n }\n\n /* Look backward */\n for (const [index, [el]] of prev.entries()) {\n setAnchorActive(el, index === prev.length - 1)\n setAnchorBlur(el, true)\n }\n }),\n\n /* Reset on complete or error */\n finalize(() => {\n for (const el of els) {\n resetAnchorActive(el)\n resetAnchorBlur(el)\n }\n })\n )\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\n// TODO: remove this after we finished refactoring\n// tslint:disable\n\nimport { identity, values } from \"ramda\"\nimport {\n EMPTY,\n Observable,\n Subject,\n forkJoin,\n merge,\n of,\n fromEvent,\n interval,\n NEVER\n} from \"rxjs\"\nimport { ajax } from \"rxjs/ajax\"\nimport {\n delay,\n filter,\n map,\n pluck,\n switchMap,\n switchMapTo,\n take,\n tap,\n} from \"rxjs/operators\"\n\nimport {\n Component,\n paintHeaderShadow,\n mountHero,\n mountMain,\n mountNavigation,\n mountSearchResult,\n mountTableOfContents,\n mountTabs,\n switchComponent,\n watchComponentMap,\n watchHeader,\n watchSearchQuery,\n watchSearchReset\n} from \"./components\"\nimport { SearchIndexOptions } from \"./modules\"\nimport {\n getElement,\n setupAgent,\n watchToggle,\n watchWorker,\n setToggle,\n getElements,\n watchMedia\n} from \"./utilities\"\nimport {\n PackerMessage,\n PackerMessageType,\n SearchMessage,\n SearchMessageType,\n SearchSetupMessage,\n isSearchDumpMessage,\n isSearchResultMessage\n} from \"./workers\"\nimport { renderSource } from \"templates\"\nimport { switchMapIf, not } from \"extensions\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Configuration\n */\nexport interface Config {\n base: string /* Base URL */\n worker: {\n search: string /* Search worker URL */\n packer: string /* Packer worker URL */\n }\n}\n\n/* ----------------------------------------------------------------------------\n * TODO: where do we put this stuff?\n * ------------------------------------------------------------------------- */\n\ndocument.documentElement.classList.remove(\"no-js\")\ndocument.documentElement.classList.add(\"js\")\n\nconst names: Component[] = [\n \"container\", /* Container */\n \"header\", /* Header */\n \"header-title\", /* Header title */\n \"hero\", /* Hero */\n \"main\", /* Main area */\n \"navigation\", /* Navigation */\n \"search\", /* Search */\n \"search-query\", /* Search input */\n \"search-reset\", /* Search reset */\n \"search-result\", /* Search results */\n \"tabs\", /* Tabs */\n \"toc\" /* Table of contents */\n]\n\n/* ----------------------------------------------------------------------------\n * Helper functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Ensure that the given value is a valid configuration\n *\n * We could use `jsonschema` or any other schema validation framework, but that\n * would just add more bloat to the bundle, so we'll keep it plain and simple.\n *\n * @param config - Configuration\n *\n * @return Test result\n */\nfunction isConfig(config: any): config is Config {\n return typeof config === \"object\"\n && typeof config.base === \"string\"\n && typeof config.worker === \"object\"\n && typeof config.worker.search === \"string\"\n && typeof config.worker.packer === \"string\"\n}\n\n/**\n *\n * Rogue control characters must be filtered before handing the query to the\n * search index, as lunr will throw otherwise.\n */\nfunction prepare(value: string): string {\n const newvalue = value\n .replace(/(?:^|\\s+)[*+-:^~]+(?=\\s+|$)/g, \"\")\n .trim()\n\n return newvalue ? newvalue.replace(/\\s+|$/g, \"* \") : \"\"\n}\n\nfunction setupWorkers(config: Config) {\n // Remove trailing URL, or search might not work on the 404 page.\n config.base = config.base.replace(/\\/$/, \"\")\n\n const worker = new Worker(config.worker.search)\n const packer = new Worker(config.worker.packer)\n\n const packerMessage$ = new Subject()\n const packer$ = watchWorker(packer, { send$: packerMessage$ })\n\n // send a message, then switchMapTo worker!\n\n packer$.subscribe(message => {\n // console.log(\"PACKER.MSG\", message.data.length)\n // is always packed!\n if (message.type === PackerMessageType.BINARY && message.data[0] !== \"{\")\n localStorage.setItem(\"index\", message.data)\n })\n\n // storing = experimental feature\n\n const searchMessage$ = new Subject()\n\n const search$ = watchWorker(worker, { send$: searchMessage$ })\n\n /* Link search to packer */\n search$\n .pipe(\n filter(isSearchDumpMessage),\n map(message => ({\n type: PackerMessageType.STRING,\n data: message.data\n })),\n tap(message => packerMessage$.next(message)) // send message and wait!\n // switchMapTo(packer$)\n )\n .subscribe()\n\n const data$ = ajax({\n url: `${config.base}/search/search_index.json`,\n responseType: \"json\",\n withCredentials: true\n })\n .pipe(\n pluck(\"response\")\n // take(1)\n )\n\n const fromLocal = localStorage.getItem(\"index\")\n\n ;\n (fromLocal ? of({\n type: PackerMessageType.BINARY,\n data: localStorage.getItem(\"index\")!\n }) : EMPTY)\n .subscribe(x => {\n // console.log(\"send message to packer\")\n packerMessage$.next(x)\n })\n\n const index$ = fromLocal ? packer$.pipe(pluck(\"data\"), take(1)) : of(undefined) // of(localStorage.getItem(\"index\"))\n\n // index$.subscribe(xx => console.log(\"INDEX\", xx))\n\n forkJoin([data$, index$])\n .pipe(\n map(([data, index]) => ({\n type: SearchMessageType.SETUP,\n data: { ...data, index }\n }))\n )\n .subscribe(message => {\n searchMessage$.next(message) // TODO: this shall not complete\n })\n\n return [search$, searchMessage$] as const\n}\n\n/**\n * Yes, this is a super hacky implementation. Needs clean up.\n */\nfunction repository() {\n const el = getElement(\"[data-md-source][href]\")\n console.log(el)\n if (!el)\n return EMPTY\n\n const data = sessionStorage.getItem(\"repository\")\n if (data) {\n const x = JSON.parse(data)\n return of(x)\n }\n\n // TODO: do correct rounding, see GitHub\n function format(value: number) {\n return value > 999\n ? `${(value / 1000).toFixed(1)}k`\n : `${(value)}`\n }\n\n // github repository...\n const [, user, repo] = el.href.match(/^.+github\\.com\\/([^\\/]+)\\/?([^\\/]+)?.*$/i)\n\n // Show repo stats\n if (user && repo) {\n return ajax({\n url: `https://api.github.com/repos/${user}/${repo}`,\n responseType: \"json\"\n })\n .pipe(\n map(({ status, response }) => {\n if (status === 200) {\n const { stargazers_count, forks_count } = response\n return [\n `${format(stargazers_count)} Stars`,\n `${format(forks_count)} Forks`\n ]\n }\n return []\n }),\n tap(data => sessionStorage.setItem(\"repository\", JSON.stringify(data)))\n )\n\n // Show user or organization stats\n } else if (user) {\n return ajax({\n url: `https://api.github.com/users/${user}`,\n responseType: \"json\"\n })\n .pipe(\n map(({ status, response }) => {\n if (status === 200) {\n const { public_repos } = response\n return [\n `${format(public_repos)} Repositories`\n ]\n }\n return []\n }),\n tap(data => sessionStorage.setItem(\"repository\", JSON.stringify(data)))\n )\n }\n return of([])\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Initialize Material for MkDocs\n *\n * @param config - Configuration\n */\nexport function initialize(config: unknown) {\n if (!isConfig(config))\n throw new SyntaxError(`Invalid configuration: ${JSON.stringify(config)}`)\n\n // pass config here!?\n const agent = setupAgent() // TODO: add a config parameter here to configure media queries\n\n const [\n searchWorkerRecv$,\n searchMessage$\n ] = setupWorkers(config)\n\n // TODO: WIP repo rendering\n repository().subscribe(facts => {\n if (facts.length) {\n const sources = getElements(\"[data-md-source] .md-source__repository\")\n sources.forEach(repo => {\n repo.dataset.mdState = \"done\"\n repo.appendChild(\n renderSource(facts)\n )\n })\n }\n })\n\n /* ----------------------------------------------------------------------- */\n\n /* Create component map observable */\n const components$ = watchComponentMap(names, { document$: agent.document.load$ })\n const component = (name: Component): Observable => {\n return components$\n .pipe(\n switchComponent(name)\n )\n }\n\n /* Create header observable */\n const header$ = component(\"header\") // TODO:!\n .pipe(\n switchMap(watchHeader)\n )\n\n /* Create header shadow toggle */\n component(\"header\")\n .pipe(\n switchMap(el => main$\n .pipe(\n paintHeaderShadow(el) // technically, this could be done in paintMain\n )\n )\n )\n .subscribe()\n\n // ----------------------------------------------------------------------------\n\n // watchSearchResult // emit, if at bottom...\n // receive results as a second observable!? filter stuff, paint\n\n const result$ = searchWorkerRecv$ // move worker initialization into mountSearch ?\n .pipe(\n // tap(m => console.log(\"message from worker\", m)),\n filter(isSearchResultMessage),\n pluck(\"data\"),\n // Prefix URLs with base URL\n tap(result => result.forEach(item => {\n item.article.location = `${config.base}/${item.article.location}`\n item.sections.forEach(section => {\n section.location = `${config.base}/${section.location}`\n })\n }))\n )\n\n // handleSearchResult <-- operator\n\n const query$ = component(\"search-query\")\n .pipe(\n switchMap(el => watchSearchQuery(el, { prepare }))\n )\n\n query$\n .pipe(\n map(query => ({ // put this into some function...\n type: SearchMessageType.QUERY,\n data: query.value\n })), // TODO. ugly...\n // distinctUntilKeyChanged(\"data\")\n )\n .subscribe(searchMessage$)\n\n // create the message subject internally... and link it to the worker...?\n // watchSearchWorker(worker, agent, { query$ }) // message internally...\n\n query$\n .pipe(\n tap(query => {\n if (query.focus)\n setToggle(search, true)\n })\n )\n .subscribe()\n\n /* ----------------------------------------------------------------------- */\n\n const main$ = component(\"main\")\n .pipe(\n mountMain(agent, { header$ })\n )\n\n const navigation$ = component(\"navigation\")\n .pipe(\n mountNavigation(agent, { main$ })\n )\n\n const toc$ = component(\"toc\")\n .pipe(\n mountTableOfContents(agent, { header$, main$ })\n )\n\n // TODO: naming?\n const resultComponent$ = component(\"search-result\")\n .pipe(\n mountSearchResult(agent, { result$, query$: query$.pipe(pluck(\"value\")) })\n ) // temporary fix\n\n const tabs$ = component(\"tabs\")\n .pipe(\n mountTabs(agent, { header$ })\n )\n\n const hero$ = component(\"hero\")\n .pipe(\n mountHero(agent, { header$ })\n )\n\n\n /* ----------------------------------------------------------------------- */\n\n const drawer = getElement(\"[data-md-toggle=drawer]\")!\n const search = getElement(\"[data-md-toggle=search]\")!\n\n const a$ = watchToggle(search)\n .pipe(\n delay(400)\n )\n\n const reset$ = component(\"search-reset\")\n .pipe(\n switchMap(watchSearchReset)\n )\n\n /* Listener: focus query if search is open and character is typed */\n // TODO: combine with watchElementFocus\n const keysIfSearchActive$ = a$\n .pipe(\n switchMap(x => x === true ? fromEvent(window, \"keydown\") : NEVER),\n )\n\n // focus search on reset, on toggle and on keypress if open\n merge(a$.pipe(filter(identity)), reset$, keysIfSearchActive$)\n .pipe(\n switchMapTo(component(\"search-query\")),\n tap(el => el.focus()) // TODO: only if element isnt focused! setFocus? setToggle?\n )\n .subscribe()\n\n /* ----------------------------------------------------------------------- */\n\n /* Open details before printing */\n merge(\n watchMedia(\"print\").pipe(filter(identity)), // Webkit\n fromEvent(window, \"beforeprint\") // IE, FF\n )\n .subscribe(() => {\n const details = document.querySelectorAll(\"details\")\n Array.prototype.forEach.call(details, detail => {\n detail.setAttribute(\"open\", \"\")\n })\n })\n\n /* ----------------------------------------------------------------------- */\n\n const state = {\n search: {\n query$,\n result$: resultComponent$,\n reset$,\n },\n main$,\n navigation$,\n toc$,\n tabs$,\n hero$\n }\n\n const { search: temp, ...rest } = state\n merge(...values(rest), ...values(temp))\n .subscribe() // potential memleak <-- use takeUntil\n\n return {\n agent,\n state\n }\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { Observable, Subject } from \"rxjs\"\n\nimport {\n ViewportOffset,\n ViewportSize,\n watchDocument,\n watchLocation,\n watchLocationHash,\n watchMedia,\n watchViewportOffset,\n watchViewportSize\n} from \"utilities\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Agent document\n */\nexport interface AgentDocument {\n load$: Observable /* Document observable */\n}\n\n/**\n * Agent location\n */\nexport interface AgentLocation {\n href$: Subject /* Location subject */\n hash$: Observable /* Location hash observable */\n}\n\n/**\n * Agent media\n */\nexport interface AgentMedia {\n screen$: Observable /* Media observable for screen */\n tablet$: Observable /* Media observable for tablet */\n}\n\n/**\n * Agent viewport\n */\nexport interface AgentViewport {\n offset$: Observable /* Viewport offset observable */\n size$: Observable /* Viewport size observable */\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Agent\n */\nexport interface Agent {\n document: AgentDocument /* Document observables */\n location: AgentLocation /* Location observables */\n media: AgentMedia /* Media observables */\n viewport: AgentViewport /* Viewport observables */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Create the agent\n *\n * This function returns a data structure that contains all observables that\n * are related to the browser and/or environment.\n *\n * @return Agent\n */\nexport function setupAgent(): Agent {\n return {\n document: {\n load$: watchDocument()\n },\n location: {\n href$: watchLocation(),\n hash$: watchLocationHash()\n },\n media: {\n screen$: watchMedia(\"(min-width: 1220px)\"),\n tablet$: watchMedia(\"(min-width: 960px)\")\n },\n viewport: {\n offset$: watchViewportOffset(),\n size$: watchViewportSize()\n }\n }\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { keys } from \"ramda\"\nimport { NEVER, Observable, OperatorFunction, of, pipe } from \"rxjs\"\nimport { map, scan, shareReplay, switchMap } from \"rxjs/operators\"\n\nimport { getElement } from \"utilities\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Component names\n */\nexport type Component =\n | \"container\" /* Container */\n | \"header\" /* Header */\n | \"header-title\" /* Header title */\n | \"hero\" /* Hero */\n | \"main\" /* Main area */\n | \"navigation\" /* Navigation */\n | \"search\" /* Search */\n | \"search-query\" /* Search input */\n | \"search-reset\" /* Search reset */\n | \"search-result\" /* Search results */\n | \"tabs\" /* Tabs */\n | \"toc\" /* Table of contents */\n\n/**\n * Component map\n */\nexport type ComponentMap = {\n [P in Component]?: HTMLElement\n}\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * Options\n */\ninterface Options {\n document$: Observable /* Document observable */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch component mapping\n *\n * This function returns an observable that will maintain bindings to the given\n * components in-between document switches and update the document in-place.\n *\n * @param names - Component names\n * @param options - Options\n *\n * @return Component mapping observable\n */\nexport function watchComponentMap(\n names: Component[], { document$ }: Options\n): Observable {\n const components$ = document$\n .pipe(\n\n /* Build component map */\n map(document => names.reduce((components, name) => {\n const el = getElement(`[data-md-component=${name}]`, document)\n return {\n ...components,\n ...typeof el !== \"undefined\" ? { [name]: el } : {}\n }\n }, {})),\n\n /* Re-compute component map on document switch */\n scan((prev, next) => {\n for (const name of keys(prev)) {\n switch (name) {\n\n /* Top-level components: update */\n case \"header-title\":\n case \"container\":\n if (name in prev && typeof prev[name] !== \"undefined\") {\n prev[name]!.replaceWith(next[name]!)\n prev[name] = next[name]\n }\n break\n\n /* All other components: rebind */\n default:\n prev[name] = getElement(`[data-md-component=${name}]`)\n }\n }\n return prev\n })\n )\n\n /* Return component map as hot observable */\n return components$\n .pipe(\n shareReplay(1)\n )\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Switch to component\n *\n * @template T - Element type\n *\n * @param name - Component name\n *\n * @return Operator function\n */\nexport function switchComponent(\n name: Component\n): OperatorFunction {\n return pipe(\n switchMap(components => {\n return typeof components[name] !== \"undefined\"\n ? of(components[name] as T)\n : NEVER\n })\n )\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { Observable, fromEvent } from \"rxjs\"\nimport { map } from \"rxjs/operators\"\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Set toggle\n *\n * Simulating a click event seems to be the most cross-browser compatible way\n * of changing the value while also emitting a `change` event. Before, Material\n * used `CustomEvent` to programatically change the value of a toggle, but this\n * is a much simpler and cleaner solution.\n *\n * @param el - Toggle element\n * @param value - Toggle value\n */\nexport function setToggle(\n el: HTMLInputElement, value: boolean\n): void {\n if (el.checked !== value)\n el.click()\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Watch toggle\n *\n * @param el - Toggle element\n *\n * @return Toggle observable\n */\nexport function watchToggle(\n el: HTMLInputElement\n): Observable {\n return fromEvent(el, \"change\")\n .pipe(\n map(() => el.checked)\n )\n}\n"],"sourceRoot":""} \ No newline at end of file +{"version":3,"sources":["webpack:///webpack/bootstrap","webpack:///./node_modules/rxjs/_esm5/internal/util/root.js","webpack:///(webpack)/buildin/global.js","webpack:///./node_modules/ramda/es/internal/_isPlaceholder.js","webpack:///./node_modules/ramda/es/internal/_curry1.js","webpack:///./node_modules/ramda/es/internal/_identity.js","webpack:///./node_modules/ramda/es/identity.js","webpack:///./node_modules/ramda/es/internal/_has.js","webpack:///./node_modules/ramda/es/internal/_isArguments.js","webpack:///./node_modules/ramda/es/keys.js","webpack:///./node_modules/ramda/es/values.js","webpack:///./node_modules/tslib/tslib.es6.js","webpack:///./node_modules/rxjs/_esm5/internal/util/isFunction.js","webpack:///./node_modules/rxjs/_esm5/internal/config.js","webpack:///./node_modules/rxjs/_esm5/internal/util/hostReportError.js","webpack:///./node_modules/rxjs/_esm5/internal/Observer.js","webpack:///./node_modules/rxjs/_esm5/internal/util/isArray.js","webpack:///./node_modules/rxjs/_esm5/internal/util/isObject.js","webpack:///./node_modules/rxjs/_esm5/internal/util/UnsubscriptionError.js","webpack:///./node_modules/rxjs/_esm5/internal/Subscription.js","webpack:///./node_modules/rxjs/_esm5/internal/symbol/rxSubscriber.js","webpack:///./node_modules/rxjs/_esm5/internal/Subscriber.js","webpack:///./node_modules/rxjs/_esm5/internal/symbol/observable.js","webpack:///./node_modules/rxjs/_esm5/internal/util/noop.js","webpack:///./node_modules/rxjs/_esm5/internal/util/pipe.js","webpack:///./node_modules/rxjs/_esm5/internal/Observable.js","webpack:///./node_modules/rxjs/_esm5/internal/util/toSubscriber.js","webpack:///./node_modules/rxjs/_esm5/internal/util/canReportError.js","webpack:///./node_modules/rxjs/_esm5/internal/util/ObjectUnsubscribedError.js","webpack:///./node_modules/rxjs/_esm5/internal/SubjectSubscription.js","webpack:///./node_modules/rxjs/_esm5/internal/Subject.js","webpack:///./node_modules/rxjs/_esm5/internal/util/isScheduler.js","webpack:///./node_modules/rxjs/_esm5/internal/util/subscribeToArray.js","webpack:///./node_modules/rxjs/_esm5/internal/scheduled/scheduleArray.js","webpack:///./node_modules/rxjs/_esm5/internal/observable/fromArray.js","webpack:///./node_modules/rxjs/_esm5/internal/observable/of.js","webpack:///./node_modules/rxjs/_esm5/internal/observable/empty.js","webpack:///./node_modules/rxjs/_esm5/internal/operators/map.js","webpack:///./node_modules/rxjs/_esm5/internal/symbol/iterator.js","webpack:///./node_modules/rxjs/_esm5/internal/util/isArrayLike.js","webpack:///./node_modules/rxjs/_esm5/internal/util/isPromise.js","webpack:///./node_modules/rxjs/_esm5/internal/util/subscribeTo.js","webpack:///./node_modules/rxjs/_esm5/internal/util/subscribeToObservable.js","webpack:///./node_modules/rxjs/_esm5/internal/util/subscribeToPromise.js","webpack:///./node_modules/rxjs/_esm5/internal/util/subscribeToIterable.js","webpack:///./node_modules/rxjs/_esm5/internal/scheduled/scheduled.js","webpack:///./node_modules/rxjs/_esm5/internal/util/isInteropObservable.js","webpack:///./node_modules/rxjs/_esm5/internal/scheduled/scheduleObservable.js","webpack:///./node_modules/rxjs/_esm5/internal/scheduled/schedulePromise.js","webpack:///./node_modules/rxjs/_esm5/internal/util/isIterable.js","webpack:///./node_modules/rxjs/_esm5/internal/scheduled/scheduleIterable.js","webpack:///./node_modules/rxjs/_esm5/internal/observable/from.js","webpack:///./node_modules/rxjs/_esm5/internal/observable/forkJoin.js","webpack:///./node_modules/rxjs/_esm5/internal/observable/fromEvent.js","webpack:///./node_modules/rxjs/_esm5/internal/observable/never.js","webpack:///./node_modules/rxjs/_esm5/internal/InnerSubscriber.js","webpack:///./node_modules/rxjs/_esm5/internal/util/subscribeToResult.js","webpack:///./node_modules/rxjs/_esm5/internal/OuterSubscriber.js","webpack:///./node_modules/rxjs/_esm5/internal/operators/mergeMap.js","webpack:///./node_modules/rxjs/_esm5/internal/util/identity.js","webpack:///./node_modules/rxjs/_esm5/internal/operators/mergeAll.js","webpack:///./node_modules/rxjs/_esm5/internal/observable/merge.js","webpack:///./node_modules/rxjs/_esm5/internal/observable/dom/AjaxObservable.js","webpack:///./node_modules/rxjs/_esm5/internal/observable/dom/ajax.js","webpack:///./node_modules/rxjs/_esm5/internal/operators/filter.js","webpack:///./node_modules/rxjs/_esm5/internal/operators/tap.js","webpack:///./node_modules/rxjs/_esm5/internal/operators/pluck.js","webpack:///./node_modules/rxjs/_esm5/internal/util/ArgumentOutOfRangeError.js","webpack:///./node_modules/rxjs/_esm5/internal/operators/take.js","webpack:///./node_modules/rxjs/_esm5/internal/operators/switchMap.js","webpack:///./node_modules/rxjs/_esm5/internal/Notification.js","webpack:///./node_modules/rxjs/_esm5/internal/scheduler/AsyncAction.js","webpack:///./node_modules/rxjs/_esm5/internal/scheduler/Action.js","webpack:///./node_modules/rxjs/_esm5/internal/Scheduler.js","webpack:///./node_modules/rxjs/_esm5/internal/scheduler/AsyncScheduler.js","webpack:///./node_modules/rxjs/_esm5/internal/scheduler/async.js","webpack:///./node_modules/rxjs/_esm5/internal/observable/throwError.js","webpack:///./node_modules/rxjs/_esm5/internal/operators/delay.js","webpack:///./node_modules/rxjs/_esm5/internal/util/isDate.js","webpack:///./node_modules/rxjs/_esm5/internal/operators/switchMapTo.js","webpack:///./node_modules/rxjs/_esm5/internal/operators/scan.js","webpack:///./node_modules/rxjs/_esm5/internal/scheduler/QueueAction.js","webpack:///./node_modules/rxjs/_esm5/internal/scheduler/queue.js","webpack:///./node_modules/rxjs/_esm5/internal/scheduler/QueueScheduler.js","webpack:///./node_modules/rxjs/_esm5/internal/operators/observeOn.js","webpack:///./node_modules/rxjs/_esm5/internal/ReplaySubject.js","webpack:///./node_modules/rxjs/_esm5/internal/operators/shareReplay.js","webpack:///./node_modules/rxjs/_esm5/internal/operators/mapTo.js","webpack:///./node_modules/rxjs/_esm5/internal/observable/concat.js","webpack:///./node_modules/rxjs/_esm5/internal/operators/concatAll.js","webpack:///./node_modules/rxjs/_esm5/internal/operators/startWith.js","webpack:///./node_modules/rxjs/_esm5/internal/operators/distinctUntilChanged.js","webpack:///./node_modules/rxjs/_esm5/internal/operators/skip.js","webpack:///./src/assets/javascripts/utilities/agent/document/index.ts","webpack:///./src/assets/javascripts/utilities/agent/element/_/index.ts","webpack:///./src/assets/javascripts/utilities/agent/element/offset/index.ts","webpack:///./node_modules/rxjs/_esm5/internal/operators/refCount.js","webpack:///./node_modules/rxjs/_esm5/internal/observable/ConnectableObservable.js","webpack:///./node_modules/rxjs/_esm5/internal/operators/multicast.js","webpack:///./node_modules/rxjs/_esm5/internal/operators/share.js","webpack:///./src/assets/javascripts/utilities/agent/location/index.ts","webpack:///./src/assets/javascripts/utilities/agent/media/index.ts","webpack:///./node_modules/rxjs/_esm5/internal/observable/fromEventPattern.js","webpack:///./src/assets/javascripts/utilities/agent/viewport/index.ts","webpack:///./node_modules/rxjs/_esm5/internal/operators/throttle.js","webpack:///./src/assets/javascripts/utilities/agent/worker/index.ts","webpack:///./node_modules/rxjs/_esm5/internal/scheduler/AnimationFrameAction.js","webpack:///./node_modules/rxjs/_esm5/internal/scheduler/animationFrame.js","webpack:///./node_modules/rxjs/_esm5/internal/scheduler/AnimationFrameScheduler.js","webpack:///./node_modules/rxjs/_esm5/internal/operators/finalize.js","webpack:///./src/assets/javascripts/utilities/string/index.ts","webpack:///./src/assets/javascripts/actions/anchor/index.ts","webpack:///./src/assets/javascripts/actions/search/result/index.ts","webpack:///./src/assets/javascripts/utilities/hidden/index.ts","webpack:///./src/assets/javascripts/actions/hidden/index.ts","webpack:///./src/assets/javascripts/components/header/_/index.ts","webpack:///./node_modules/rxjs/_esm5/internal/observable/defer.js","webpack:///./node_modules/rxjs/_esm5/internal/observable/combineLatest.js","webpack:///./src/assets/javascripts/components/header/offset/index.ts","webpack:///./src/assets/javascripts/components/header/shadow/index.ts","webpack:///./node_modules/rxjs/_esm5/internal/operators/distinctUntilKeyChanged.js","webpack:///./src/assets/javascripts/actions/header/index.ts","webpack:///./src/assets/javascripts/extensions/jsx/index.ts","webpack:///./node_modules/rxjs/_esm5/internal/operators/takeUntil.js","webpack:///./src/assets/javascripts/extensions/rxjs/operators/index.ts","webpack:///./src/assets/javascripts/components/hero/index.ts","webpack:///./src/assets/javascripts/components/main/_/index.ts","webpack:///./node_modules/ramda/es/internal/_curry2.js","webpack:///./node_modules/ramda/es/internal/_arrayFromIterator.js","webpack:///./node_modules/ramda/es/internal/_includesWith.js","webpack:///./node_modules/ramda/es/internal/_objectIs.js","webpack:///./node_modules/ramda/es/type.js","webpack:///./node_modules/ramda/es/internal/_equals.js","webpack:///./node_modules/ramda/es/internal/_functionName.js","webpack:///./node_modules/ramda/es/equals.js","webpack:///./src/assets/javascripts/components/main/sidebar/index.ts","webpack:///./src/assets/javascripts/actions/sidebar/index.ts","webpack:///./src/assets/javascripts/components/navigation/_/index.ts","webpack:///./src/assets/javascripts/components/search/query/index.ts","webpack:///./src/assets/javascripts/utilities/agent/element/focus/index.ts","webpack:///./src/assets/javascripts/components/search/reset/index.ts","webpack:///./src/assets/javascripts/templates/search/result/article/index.tsx","webpack:///./src/assets/javascripts/templates/search/result/section/index.tsx","webpack:///./src/assets/javascripts/templates/search/result/_/index.tsx","webpack:///./src/assets/javascripts/templates/source/index.tsx","webpack:///./node_modules/rxjs/_esm5/internal/operators/withLatestFrom.js","webpack:///./src/assets/javascripts/components/search/result/meta/index.ts","webpack:///./src/assets/javascripts/components/search/result/_/index.ts","webpack:///./src/assets/javascripts/components/search/result/list/index.ts","webpack:///./src/assets/javascripts/components/tabs/index.ts","webpack:///./node_modules/ramda/es/reverse.js","webpack:///./node_modules/ramda/es/internal/_isString.js","webpack:///./node_modules/ramda/es/internal/_includes.js","webpack:///./node_modules/ramda/es/internal/_indexOf.js","webpack:///./node_modules/ramda/es/internal/_Set.js","webpack:///./node_modules/ramda/es/difference.js","webpack:///./src/assets/javascripts/workers/packer/_/index.ts","webpack:///./src/assets/javascripts/workers/search/_/index.ts","webpack:///./src/assets/javascripts/components/toc/_/index.ts","webpack:///./src/assets/javascripts/components/toc/anchor/index.ts","webpack:///./src/assets/javascripts/index.ts","webpack:///./src/assets/javascripts/utilities/agent/_/index.ts","webpack:///./src/assets/javascripts/components/_/index.ts","webpack:///./src/assets/javascripts/utilities/toggle/index.ts"],"names":["installedModules","__webpack_require__","moduleId","exports","module","i","l","modules","call","m","c","d","name","getter","o","Object","defineProperty","enumerable","get","r","Symbol","toStringTag","value","t","mode","__esModule","ns","create","key","bind","n","object","property","prototype","hasOwnProperty","p","s","__window","window","__self","self","WorkerGlobalScope","_root","global","g","this","Function","e","_isPlaceholder","a","_curry1","fn","f1","arguments","length","apply","_identity","x","_has","prop","obj","toString","hasEnumBug","propertyIsEnumerable","nonEnumerableProps","hasArgsEnumBug","contains","list","item","idx","keys","nIdx","ks","checkArgsLength","props","len","vals","extendStatics","b","setPrototypeOf","__proto__","Array","__extends","__","constructor","isFunction","_enable_super_gross_mode_that_will_cause_bad_things","Promise","undefined","Error","stack","hostReportError","err","setTimeout","empty","closed","next","error","useDeprecatedSynchronousErrorHandling","complete","isArray","isObject","UnsubscriptionError","UnsubscriptionErrorImpl","errors","message","map","join","Subscription","unsubscribe","_parentOrParents","_subscriptions","_unsubscribe","remove","index","flattenUnsubscriptionErrors","sub","concat","push","add","teardown","subscription","EMPTY","tmp","indexOf","subscriptions","subscriptionIndex","splice","reduce","errs","rxSubscriber","Math","random","_super","Subscriber","destinationOrNext","_this","syncErrorValue","syncErrorThrown","syncErrorThrowable","isStopped","destination","subscriber","_next","_error","_complete","_unsubscribeAndRecycle","SafeSubscriber","_parentSubscriber","observerOrNext","context","_context","__tryOrSetError","__tryOrUnsub","wrappedComplete","parent","observable","noop","pipe","fns","_i","pipeFromArray","input","prev","Observable","subscribe","_isScalar","_subscribe","lift","operator","source","sink","nextOrObserver","toSubscriber","_trySubscribe","observer","_a","closed_1","canReportError","console","warn","forEach","promiseCtor","getPromiseCtor","resolve","reject","operations","toPromise","ObjectUnsubscribedError","ObjectUnsubscribedErrorImpl","SubjectSubscription","subject","observers","subscriberIndex","SubjectSubscriber","Subject","hasError","thrownError","copy","slice","asObservable","AnonymousSubject","isScheduler","schedule","subscribeToArray","array","scheduleArray","scheduler","fromArray","of","args","pop","emptyScheduled","project","thisArg","TypeError","MapOperator","MapSubscriber","count","result","getSymbolIterator","iterator","isArrayLike","isPromise","then","subscribeTo","obs","promise","iterable","done","return","scheduled","isInteropObservable","scheduleObservable","schedulePromise","isIterable","scheduleIterable","from","forkJoinInternal","sources","values","completed","emitted","_loop_1","hasValue","fromEvent","target","eventName","options","resultSelector","setupSubscription","sourceObj","handler","addEventListener","removeEventListener","isEventTarget","source_1","on","off","isJQueryStyleEventEmitter","source_2","addListener","removeListener","isNodeStyleEventEmitter","source_3","NEVER","InnerSubscriber","outerValue","outerIndex","notifyNext","notifyError","notifyComplete","subscribeToResult","outerSubscriber","OuterSubscriber","innerValue","innerIndex","innerSub","MergeMapOperator","concurrent","Number","POSITIVE_INFINITY","MergeMapSubscriber","hasCompleted","buffer","active","_tryNext","_innerSub","ish","innerSubscriber","shift","mergeAll","mergeMap","ii","merge","observables","last","ajaxGet","url","headers","method","ajaxPost","body","ajaxDelete","ajaxPut","ajaxPatch","mapResponse","response","ajaxGetJSON","responseType","AjaxObservable","urlOrRequest","request","async","createXHR","crossDomain","root","XMLHttpRequest","XDomainRequest","getCORSRequest","progId","progIds","ActiveXObject","getXMLHttpRequest","withCredentials","timeout","post","delete","put","patch","getJSON","AjaxSubscriber","getHeader","FormData","serializeBody","send","xhr","AjaxResponse","_b","user","password","setupEvents","open","setHeaders","contentType","splitIndex","substring","encodeURIComponent","JSON","stringify","setRequestHeader","headerName","toLowerCase","progressSubscriber","xhrTimeout","AjaxTimeoutError","ontimeout","upload","xhrProgress_1","xhrError_1","onprogress","AjaxError","onerror","xhrReadyStateChange","xhrLoad","readyState","status_1","status","responseText","onreadystatechange","onload","abort","originalEvent","parseXhrResponse","AjaxErrorImpl","parse","parseJson","responseXML","ajax","filter","predicate","FilterOperator","FilterSubscriber","tap","DoOperator","TapSubscriber","_tapNext","_tapError","_tapComplete","pluck","properties","currentProp","plucker","ArgumentOutOfRangeError","ArgumentOutOfRangeErrorImpl","TakeOperator","total","TakeSubscriber","switchMap","SwitchMapOperator","NotificationKind","SwitchMapSubscriber","innerSubscription","AsyncAction","work","pending","state","delay","id","recycleAsyncId","requestAsyncId","setInterval","flush","clearInterval","execute","_execute","errored","errorValue","actions","Action","Scheduler","SchedulerAction","now","Date","AsyncScheduler","delegate","action","dispatch","Notification","kind","observe","do","accept","toObservable","createNext","undefinedValueNotification","createError","createComplete","completeNotification","delayFor","isNaN","abs","DelayOperator","DelaySubscriber","queue","time","notification","delay_1","max","_schedule","scheduleNotification","DelayMessage","switchMapTo","innerObservable","scan","accumulator","seed","hasSeed","ScanOperator","ScanSubscriber","_seed","set","configurable","QueueAction","QueueScheduler","observeOn","ObserveOnOperator","ObserveOnSubscriber","arg","scheduleMessage","ObserveOnMessage","ReplaySubject","bufferSize","windowTime","_events","_infiniteTimeWindow","_bufferSize","_windowTime","nextInfiniteTimeWindow","nextTimeWindow","ReplayEvent","_getNow","_trimBufferThenGetEvents","eventsCount","spliceCount","shareReplay","configOrBufferSize","config","refCount","_c","useRefCount","isComplete","shareReplayOperator","mapTo","MapToOperator","MapToSubscriber","concatAll","startWith","distinctUntilChanged","compare","keySelector","DistinctUntilChangedOperator","DistinctUntilChangedSubscriber","hasKey","y","load$","document","getElement","selector","node","querySelector","getElements","querySelectorAll","getElementOffset","el","scrollLeft","scrollTop","RefCountOperator","connectable","_refCount","refCounter","connection","connect","RefCountSubscriber","sharedConnection","_connection","ConnectableObservable","subjectFactory","_isComplete","getSubject","_subject","connectableObservableDescriptor","connectableProto","writable","ConnectableSubscriber","MulticastOperator","shareSubjectFactory","share","subjectOrSubjectFactory","hashchange$","popstate$","watchMedia","query","media","matchMedia","fromEventPattern","addHandler","removeHandler","retValue","matches","resize$","getViewportOffset","pageXOffset","pageYOffset","getViewportSize","width","innerWidth","height","innerHeight","defaultThrottleConfig","leading","trailing","ThrottleOperator","durationSelector","ThrottleSubscriber","_leading","_trailing","_hasValue","_sendValue","_throttled","throttle","duration","tryDurationSelector","throttlingDone","watchWorker","worker","send$","recv$","postMessage","AnimationFrameAction","requestAnimationFrame","cancelAnimationFrame","animationFrame","AnimationFrameScheduler","finalize","callback","FinallyOperator","lang","FinallySubscriber","setAnchorBlur","setAttribute","resetAnchorBlur","removeAttribute","setAnchorActive","classList","toggle","resetAnchorActive","addToSearchResultList","child","appendChild","paintHidden","offset","setHidden","resetHidden","truncate","translate","innerText","ReferenceError","replace","watchHeader","observableFactory","sticky","getComputedStyle","getPropertyValue","offsetHeight","NONE","combineLatest","CombineLatestOperator","CombineLatestSubscriber","toRespond","unused","oldVal","_tryResultSelector","watchViewportOffsetFromTopOf","viewport","header$","adjust$","size$","offsetTop","offset$","paintHeaderShadow","setHeaderShadow","resetHeaderShadow","innerHTML","Node","h","tag","attributes","createElement","attr","children","TakeUntilOperator","notifier","takeUntilSubscriber","notifierSubscription","seenValue","TakeUntilSubscriber","switchMapIf","toggle$","begin$","end$","mountHero","agent","screen$","hidden","watchHero","mountMain","height$","adjust","top","bottom","active$","watchMain","_curry2","f2","_arrayFromIterator","iter","_includesWith","pred","val","_uniqContentEquals","aIterator","bIterator","stackA","stackB","eq","_equals","aItem","f","match","typeA","equals","String","valueOf","ignoreCase","multiline","unicode","size","entries","keysA","extendedStackA","extendedStackB","watchSidebar","main$","parseFloat","parentElement","min","lock$","lock","paintSidebar","style","setSidebarHeight","setSidebarLock","resetSidebarHeight","resetSidebarLock","mountNavigation","sidebar","watchNavigation","watchSearchQuery","prepare","focus$","blur$","activeElement","watchElementFocus","focus","watchSearchReset","css","link","article","title","teaser","renderSectionDocument","location","text","href","class","tabIndex","renderSearchResult","sections","renderArticleDocument","facts","fact","WithLatestFromOperator","WithLatestFromSubscriber","found","_tryProject","paintSearchResultMeta","query$","meta","withLatestFrom","textContent","setSearchResultMeta","resetSearchResultMeta","watchSearchResult","result$","container","render$","watchElementOffset","scrollHeight","resetSearchResultList","paintSearchResultList","mountTabs","watchTabs","split","reverse","_includes","inf","_indexOf","hasOrAdd","shouldAdd","prevSize","type","Infinity","_items","_nativeSet","has","bIdx","_Set","Set","first","second","out","firstLen","secondLen","toFilterOut","PackerMessageType","SearchMessageType","watchTableOfContents","sidebar$","els","anchors$","table","Map","decodeURIComponent","hash","header","path","anchor","tagName","begin","end","watchAnchorList","paintAnchorList","anchors","isSearchDumpMessage","DUMP","isSearchResultMessage","RESULT","documentElement","newvalue","trim","setupWorkers","base","Worker","search","packer","packerMessage$","packer$","BINARY","data","localStorage","setItem","searchMessage$","search$","STRING","data$","fromLocal","getItem","first_1","getPrototypeOf","resultSelector_1","forkJoin","SETUP","initialize","isConfig","SyntaxError","location$","href$","hash$","tablet$","searchWorkerRecv$","log","sessionStorage","format","toFixed","repo","stargazers_count","forks_count","public_repos","repository","dataset","mdState","renderSource","components$","names","document$","components","replaceWith","watchComponentMap","component","switchComponent","section","QUERY","checked","click","navigation$","toc$","mountTableOfContents","resultComponent$","mountSearchResult","tabs$","hero$","a$","reset$","keysIfSearchActive$","details","detail","rest","temp"],"mappings":"4DACE,IAAIA,EAAmB,GAGvB,SAASC,EAAoBC,GAG5B,GAAGF,EAAiBE,GACnB,OAAOF,EAAiBE,GAAUC,QAGnC,IAAIC,EAASJ,EAAiBE,GAAY,CACzCG,EAAGH,EACHI,GAAG,EACHH,QAAS,IAUV,OANAI,EAAQL,GAAUM,KAAKJ,EAAOD,QAASC,EAAQA,EAAOD,QAASF,GAG/DG,EAAOE,GAAI,EAGJF,EAAOD,QA0Df,OArDAF,EAAoBQ,EAAIF,EAGxBN,EAAoBS,EAAIV,EAGxBC,EAAoBU,EAAI,SAASR,EAASS,EAAMC,GAC3CZ,EAAoBa,EAAEX,EAASS,IAClCG,OAAOC,eAAeb,EAASS,EAAM,CAAEK,YAAY,EAAMC,IAAKL,KAKhEZ,EAAoBkB,EAAI,SAAShB,GACX,oBAAXiB,QAA0BA,OAAOC,aAC1CN,OAAOC,eAAeb,EAASiB,OAAOC,YAAa,CAAEC,MAAO,WAE7DP,OAAOC,eAAeb,EAAS,aAAc,CAAEmB,OAAO,KAQvDrB,EAAoBsB,EAAI,SAASD,EAAOE,GAEvC,GADU,EAAPA,IAAUF,EAAQrB,EAAoBqB,IAC/B,EAAPE,EAAU,OAAOF,EACpB,GAAW,EAAPE,GAA8B,iBAAVF,GAAsBA,GAASA,EAAMG,WAAY,OAAOH,EAChF,IAAII,EAAKX,OAAOY,OAAO,MAGvB,GAFA1B,EAAoBkB,EAAEO,GACtBX,OAAOC,eAAeU,EAAI,UAAW,CAAET,YAAY,EAAMK,MAAOA,IACtD,EAAPE,GAA4B,iBAATF,EAAmB,IAAI,IAAIM,KAAON,EAAOrB,EAAoBU,EAAEe,EAAIE,EAAK,SAASA,GAAO,OAAON,EAAMM,IAAQC,KAAK,KAAMD,IAC9I,OAAOF,GAIRzB,EAAoB6B,EAAI,SAAS1B,GAChC,IAAIS,EAAST,GAAUA,EAAOqB,WAC7B,WAAwB,OAAOrB,EAAgB,SAC/C,WAA8B,OAAOA,GAEtC,OADAH,EAAoBU,EAAEE,EAAQ,IAAKA,GAC5BA,GAIRZ,EAAoBa,EAAI,SAASiB,EAAQC,GAAY,OAAOjB,OAAOkB,UAAUC,eAAe1B,KAAKuB,EAAQC,IAGzG/B,EAAoBkC,EAAI,GAIjBlC,EAAoBA,EAAoBmC,EAAI,G,kCClFrD,8CACA,IAAIC,EAA6B,oBAAXC,QAA0BA,OAC5CC,EAAyB,oBAATC,MAAqD,oBAAtBC,mBAC/CD,gBAAgBC,mBAAqBD,KAErCE,EAAQL,QADqB,IAAXM,GAA0BA,GACZJ,I,iCCLpC,IAAIK,EAGJA,EAAI,WACH,OAAOC,KADJ,GAIJ,IAECD,EAAIA,GAAK,IAAIE,SAAS,cAAb,GACR,MAAOC,GAEc,iBAAXT,SAAqBM,EAAIN,QAOrClC,EAAOD,QAAUyC,G,6CCnBF,SAASI,EAAeC,GAChC,OAAY,MAALA,GAA0B,iBAANA,IAAoD,IAAlCA,EAAE,4BCSvC,SAASC,EAAQC,GAC9B,OAAO,SAASC,EAAGH,GACjB,OAAyB,IAArBI,UAAUC,QAAgBN,EAAeC,GACpCG,EAEAD,EAAGI,MAAMV,KAAMQ,YCfb,SAASG,EAAUC,GAChC,OAAOA,E,OCqBT,IACe,EADaP,EAAQM,GCtBrB,SAASE,EAAKC,EAAMC,GACjC,OAAO7C,OAAOkB,UAAUC,eAAe1B,KAAKoD,EAAKD,GCCnD,IAAI,EAAW5C,OAAOkB,UAAU4B,SASjB,EARiB,WAC9B,MAAoC,uBAA7B,EAASrD,KAAK6C,WAAsC,SAAsBI,GAC/E,MAA4B,uBAArB,EAASjD,KAAKiD,IACnB,SAAsBA,GACxB,OAAOC,EAAK,SAAUD,IAJM,GCE5BK,GAA4B,CAAED,SAAU,MAAOE,qBAAqB,YACpEC,EAAqB,CAAC,cAAe,UAAW,gBAAiB,WAAY,uBAAwB,iBAAkB,kBAEvHC,EAA8B,WAGhC,OAAOZ,UAAUU,qBAAqB,UAHN,GAM9BG,EAAW,SAAkBC,EAAMC,GAErC,IADA,IAAIC,EAAM,EACHA,EAAMF,EAAKb,QAAQ,CACxB,GAAIa,EAAKE,KAASD,EAChB,OAAO,EAETC,GAAO,EAET,OAAO,GA+CM,EA1BmB,mBAAhBtD,OAAOuD,MAAwBL,EAE/Bf,GAAQ,SAAcU,GACtC,GAAI7C,OAAO6C,KAASA,EAClB,MAAO,GAET,IAAID,EAAMY,EACNC,EAAK,GACLC,EAAkBR,GAAkB,EAAaL,GACrD,IAAKD,KAAQC,GACPF,EAAKC,EAAMC,IAAUa,GAA4B,WAATd,IAC1Ca,EAAGA,EAAGlB,QAAUK,GAGpB,GAAIG,EAEF,IADAS,EAAOP,EAAmBV,OAAS,EAC5BiB,GAAQ,GAETb,EADJC,EAAOK,EAAmBO,GACXX,KAASM,EAASM,EAAIb,KACnCa,EAAGA,EAAGlB,QAAUK,GAElBY,GAAQ,EAGZ,OAAOC,KAxBsEtB,GAAQ,SAAcU,GACnG,OAAO7C,OAAO6C,KAASA,EAAM,GAAK7C,OAAOuD,KAAKV,MCbjC,EAXWV,GAAQ,SAAgBU,GAKhD,IAJA,IAAIc,EAAQ,EAAKd,GACbe,EAAMD,EAAMpB,OACZsB,EAAO,GACPP,EAAM,EACHA,EAAMM,GACXC,EAAKP,GAAOT,EAAIc,EAAML,IACtBA,GAAO,EAET,OAAOO,KCbLC,EAAgB,SAASlE,EAAGmE,GAI5B,OAHAD,EAAgB9D,OAAOgE,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUtE,EAAGmE,GAAKnE,EAAEqE,UAAYF,IACvE,SAAUnE,EAAGmE,GAAK,IAAK,IAAI3C,KAAK2C,EAAOA,EAAE5C,eAAeC,KAAIxB,EAAEwB,GAAK2C,EAAE3C,MACpDxB,EAAGmE,IAGrB,SAASI,EAAUvE,EAAGmE,GAEzB,SAASK,IAAOtC,KAAKuC,YAAczE,EADnCkE,EAAclE,EAAGmE,GAEjBnE,EAAEsB,UAAkB,OAAN6C,EAAa/D,OAAOY,OAAOmD,IAAMK,EAAGlD,UAAY6C,EAAE7C,UAAW,IAAIkD,GCzB5E,SAASE,EAAW5B,GACvB,MAAoB,mBAANA,ECDlB,IAAI6B,GAAsD,EAC/C,EAAS,CAChBC,aAASC,EACT,0CAA0ClE,GAClCA,IAC0B,IAAImE,OACqGC,MAKvIJ,EAAsDhE,GAE1D,4CACI,OAAOgE,ICdR,SAASK,EAAgBC,GAC5BC,YAAW,WAAc,MAAMD,IAAQ,GCCpC,IAAIE,EAAQ,CACfC,QAAQ,EACRC,KAAM,SAAU1E,KAChB2E,MAAO,SAAUL,GACb,GAAI,EAAOM,sCACP,MAAMN,EAGND,EAAgBC,IAGxBO,SAAU,cCbHC,EAAwB,WAAe,OAAOnB,MAAMmB,SAAW,SAAW3C,GAAK,OAAOA,GAAyB,iBAAbA,EAAEH,QAA5E,GCA5B,SAAS+C,EAAS5C,GACrB,OAAa,OAANA,GAA2B,iBAANA,ECDhC,IAYW6C,EAZiC,WACxC,SAASC,EAAwBC,GAM7B,OALAf,MAAMjF,KAAKqC,MACXA,KAAK4D,QAAUD,EACXA,EAAOlD,OAAS,4CAA8CkD,EAAOE,KAAI,SAAUd,EAAKvF,GAAK,OAAOA,EAAI,EAAI,KAAOuF,EAAI/B,cAAe8C,KAAK,QAAU,GACzJ9D,KAAKjC,KAAO,sBACZiC,KAAK2D,OAASA,EACP3D,KAGX,OADA0D,EAAwBtE,UAA0BlB,OAAOY,OAAO8D,MAAMxD,WAC/DsE,EAViC,GCIxC,EAA8B,WAC9B,SAASK,EAAaC,GAClBhE,KAAKkD,QAAS,EACdlD,KAAKiE,iBAAmB,KACxBjE,KAAKkE,eAAiB,KAClBF,IACAhE,KAAKmE,aAAeH,GAsH5B,OAnHAD,EAAa3E,UAAU4E,YAAc,WACjC,IAAIL,EACJ,IAAI3D,KAAKkD,OAAT,CAGA,IAAee,EAANjE,KAA4BiE,iBAAkBE,EAA9CnE,KAAgEmE,aAAcD,EAA9ElE,KAAkGkE,eAI3G,GAHAlE,KAAKkD,QAAS,EACdlD,KAAKiE,iBAAmB,KACxBjE,KAAKkE,eAAiB,KAClBD,aAA4BF,EAC5BE,EAAiBG,OAAOpE,WAEvB,GAAyB,OAArBiE,EACL,IAAK,IAAII,EAAQ,EAAGA,EAAQJ,EAAiBxD,SAAU4D,EAAO,CAC3CJ,EAAiBI,GACvBD,OAAOpE,MAGxB,GAAIwC,EAAW2B,GACX,IACIA,EAAaxG,KAAKqC,MAEtB,MAAOE,GACHyD,EAASzD,aAAauD,EAAsBa,EAA4BpE,EAAEyD,QAAU,CAACzD,GAG7F,GAAIqD,EAAQW,GACR,CAAIG,GAAS,EAEb,IAFA,IACIvC,EAAMoC,EAAezD,SAChB4D,EAAQvC,GAAK,CAClB,IAAIyC,EAAML,EAAeG,GACzB,GAAIb,EAASe,GACT,IACIA,EAAIP,cAER,MAAO9D,GACHyD,EAASA,GAAU,GACfzD,aAAauD,EACbE,EAASA,EAAOa,OAAOF,EAA4BpE,EAAEyD,SAGrDA,EAAOc,KAAKvE,KAMhC,GAAIyD,EACA,MAAM,IAAIF,EAAoBE,KAGtCI,EAAa3E,UAAUsF,IAAM,SAAUC,GACnC,IAAIC,EAAeD,EACnB,IAAKA,EACD,OAAOZ,EAAac,MAExB,cAAeF,GACX,IAAK,WACDC,EAAe,IAAIb,EAAaY,GACpC,IAAK,SACD,GAAIC,IAAiB5E,MAAQ4E,EAAa1B,QAA8C,mBAA7B0B,EAAaZ,YACpE,OAAOY,EAEN,GAAI5E,KAAKkD,OAEV,OADA0B,EAAaZ,cACNY,EAEN,KAAMA,aAAwBb,GAAe,CAC9C,IAAIe,EAAMF,GACVA,EAAe,IAAIb,GACNG,eAAiB,CAACY,GAEnC,MACJ,QACI,MAAM,IAAIlC,MAAM,yBAA2B+B,EAAW,2BAG9D,IAAIV,EAAmBW,EAAaX,iBACpC,GAAyB,OAArBA,EACAW,EAAaX,iBAAmBjE,UAE/B,GAAIiE,aAA4BF,EAAc,CAC/C,GAAIE,IAAqBjE,KACrB,OAAO4E,EAEXA,EAAaX,iBAAmB,CAACA,EAAkBjE,UAElD,KAAwC,IAApCiE,EAAiBc,QAAQ/E,MAI9B,OAAO4E,EAHPX,EAAiBQ,KAAKzE,MAK1B,IAAIgF,EAAgBhF,KAAKkE,eAOzB,OANsB,OAAlBc,EACAhF,KAAKkE,eAAiB,CAACU,GAGvBI,EAAcP,KAAKG,GAEhBA,GAEXb,EAAa3E,UAAUgF,OAAS,SAAUQ,GACtC,IAAII,EAAgBhF,KAAKkE,eACzB,GAAIc,EAAe,CACf,IAAIC,EAAoBD,EAAcD,QAAQH,IACnB,IAAvBK,GACAD,EAAcE,OAAOD,EAAmB,KAIpDlB,EAAac,MAAS,SAAU5B,GAE5B,OADAA,EAAMC,QAAS,EACRD,EAFU,CAGnB,IAAIc,GACCA,EA5HsB,GA+HjC,SAASO,EAA4BX,GACjC,OAAOA,EAAOwB,QAAO,SAAUC,EAAMrC,GAAO,OAAOqC,EAAKZ,OAAQzB,aAAeU,EAAuBV,EAAIY,OAASZ,KAAS,ICpIzH,IAAIsC,EAA6B,WACpC,MAAyB,mBAAX9G,OACMA,OAAO,gBACrB,kBAAkC+G,KAAKC,SAHT,GCOpC,EAA4B,SAAUC,GAEtC,SAASC,EAAWC,EAAmBtC,EAAOE,GAC1C,IAAIqC,EAAQH,EAAO7H,KAAKqC,OAASA,KAKjC,OAJA2F,EAAMC,eAAiB,KACvBD,EAAME,iBAAkB,EACxBF,EAAMG,oBAAqB,EAC3BH,EAAMI,WAAY,EACVvF,UAAUC,QACd,KAAK,EACDkF,EAAMK,YAAc/C,EACpB,MACJ,KAAK,EACD,IAAKyC,EAAmB,CACpBC,EAAMK,YAAc/C,EACpB,MAEJ,GAAiC,iBAAtByC,EAAgC,CACnCA,aAA6BD,GAC7BE,EAAMG,mBAAqBJ,EAAkBI,mBAC7CH,EAAMK,YAAcN,EACpBA,EAAkBhB,IAAIiB,KAGtBA,EAAMG,oBAAqB,EAC3BH,EAAMK,YAAc,IAAI,EAAeL,EAAOD,IAElD,MAER,QACIC,EAAMG,oBAAqB,EAC3BH,EAAMK,YAAc,IAAI,EAAeL,EAAOD,EAAmBtC,EAAOE,GAGhF,OAAOqC,EAoDX,OArFA,EAAkBF,EAAYD,GAmC9BC,EAAWrG,UAAUiG,GAAsB,WAAc,OAAOrF,MAChEyF,EAAW3G,OAAS,SAAUqE,EAAMC,EAAOE,GACvC,IAAI2C,EAAa,IAAIR,EAAWtC,EAAMC,EAAOE,GAE7C,OADA2C,EAAWH,oBAAqB,EACzBG,GAEXR,EAAWrG,UAAU+D,KAAO,SAAU1E,GAC7BuB,KAAK+F,WACN/F,KAAKkG,MAAMzH,IAGnBgH,EAAWrG,UAAUgE,MAAQ,SAAUL,GAC9B/C,KAAK+F,YACN/F,KAAK+F,WAAY,EACjB/F,KAAKmG,OAAOpD,KAGpB0C,EAAWrG,UAAUkE,SAAW,WACvBtD,KAAK+F,YACN/F,KAAK+F,WAAY,EACjB/F,KAAKoG,cAGbX,EAAWrG,UAAU4E,YAAc,WAC3BhE,KAAKkD,SAGTlD,KAAK+F,WAAY,EACjBP,EAAOpG,UAAU4E,YAAYrG,KAAKqC,QAEtCyF,EAAWrG,UAAU8G,MAAQ,SAAUzH,GACnCuB,KAAKgG,YAAY7C,KAAK1E,IAE1BgH,EAAWrG,UAAU+G,OAAS,SAAUpD,GACpC/C,KAAKgG,YAAY5C,MAAML,GACvB/C,KAAKgE,eAETyB,EAAWrG,UAAUgH,UAAY,WAC7BpG,KAAKgG,YAAY1C,WACjBtD,KAAKgE,eAETyB,EAAWrG,UAAUiH,uBAAyB,WAC1C,IAAIpC,EAAmBjE,KAAKiE,iBAM5B,OALAjE,KAAKiE,iBAAmB,KACxBjE,KAAKgE,cACLhE,KAAKkD,QAAS,EACdlD,KAAK+F,WAAY,EACjB/F,KAAKiE,iBAAmBA,EACjBjE,MAEJyF,EAtFoB,CAuF7B,GAEE,EAAgC,SAAUD,GAE1C,SAASc,EAAeC,EAAmBC,EAAgBpD,EAAOE,GAC9D,IAEIH,EAFAwC,EAAQH,EAAO7H,KAAKqC,OAASA,KACjC2F,EAAMY,kBAAoBA,EAE1B,IAAIE,EAAUd,EAoBd,OAnBInD,EAAWgE,GACXrD,EAAOqD,EAEFA,IACLrD,EAAOqD,EAAerD,KACtBC,EAAQoD,EAAepD,MACvBE,EAAWkD,EAAelD,SACtBkD,IAAmBvD,IAEfT,GADJiE,EAAUvI,OAAOY,OAAO0H,IACDxC,cACnB2B,EAAMjB,IAAI+B,EAAQzC,YAAYhF,KAAKyH,IAEvCA,EAAQzC,YAAc2B,EAAM3B,YAAYhF,KAAK2G,KAGrDA,EAAMe,SAAWD,EACjBd,EAAMO,MAAQ/C,EACdwC,EAAMQ,OAAS/C,EACfuC,EAAMS,UAAY9C,EACXqC,EA0GX,OAnIA,EAAkBW,EAAgBd,GA2BlCc,EAAelH,UAAU+D,KAAO,SAAU1E,GACtC,IAAKuB,KAAK+F,WAAa/F,KAAKkG,MAAO,CAC/B,IAAIK,EAAoBvG,KAAKuG,kBACxB,EAAOlD,uCAA0CkD,EAAkBT,mBAG/D9F,KAAK2G,gBAAgBJ,EAAmBvG,KAAKkG,MAAOzH,IACzDuB,KAAKgE,cAHLhE,KAAK4G,aAAa5G,KAAKkG,MAAOzH,KAO1C6H,EAAelH,UAAUgE,MAAQ,SAAUL,GACvC,IAAK/C,KAAK+F,UAAW,CACjB,IAAIQ,EAAoBvG,KAAKuG,kBACzBlD,EAAwC,EAAOA,sCACnD,GAAIrD,KAAKmG,OACA9C,GAA0CkD,EAAkBT,oBAK7D9F,KAAK2G,gBAAgBJ,EAAmBvG,KAAKmG,OAAQpD,GACrD/C,KAAKgE,gBALLhE,KAAK4G,aAAa5G,KAAKmG,OAAQpD,GAC/B/C,KAAKgE,oBAOR,GAAKuC,EAAkBT,mBAQpBzC,GACAkD,EAAkBX,eAAiB7C,EACnCwD,EAAkBV,iBAAkB,GAGpC/C,EAAgBC,GAEpB/C,KAAKgE,kBAfuC,CAE5C,GADAhE,KAAKgE,cACDX,EACA,MAAMN,EAEVD,EAAgBC,MAc5BuD,EAAelH,UAAUkE,SAAW,WAChC,IAAIqC,EAAQ3F,KACZ,IAAKA,KAAK+F,UAAW,CACjB,IAAIQ,EAAoBvG,KAAKuG,kBAC7B,GAAIvG,KAAKoG,UAAW,CAChB,IAAIS,EAAkB,WAAc,OAAOlB,EAAMS,UAAUzI,KAAKgI,EAAMe,WACjE,EAAOrD,uCAA0CkD,EAAkBT,oBAKpE9F,KAAK2G,gBAAgBJ,EAAmBM,GACxC7G,KAAKgE,gBALLhE,KAAK4G,aAAaC,GAClB7G,KAAKgE,oBAQThE,KAAKgE,gBAIjBsC,EAAelH,UAAUwH,aAAe,SAAUtG,EAAI7B,GAClD,IACI6B,EAAG3C,KAAKqC,KAAK0G,SAAUjI,GAE3B,MAAOsE,GAEH,GADA/C,KAAKgE,cACD,EAAOX,sCACP,MAAMN,EAGND,EAAgBC,KAI5BuD,EAAelH,UAAUuH,gBAAkB,SAAUG,EAAQxG,EAAI7B,GAC7D,IAAK,EAAO4E,sCACR,MAAM,IAAIT,MAAM,YAEpB,IACItC,EAAG3C,KAAKqC,KAAK0G,SAAUjI,GAE3B,MAAOsE,GACH,OAAI,EAAOM,uCACPyD,EAAOlB,eAAiB7C,EACxB+D,EAAOjB,iBAAkB,GAClB,IAGP/C,EAAgBC,IACT,GAGf,OAAO,GAEXuD,EAAelH,UAAU+E,aAAe,WACpC,IAAIoC,EAAoBvG,KAAKuG,kBAC7BvG,KAAK0G,SAAW,KAChB1G,KAAKuG,kBAAoB,KACzBA,EAAkBvC,eAEfsC,EApIwB,CAqIjC,GCrOK,IAAI,EAA2B,WAAe,MAAyB,mBAAX/H,QAAyBA,OAAOwI,YAAc,eAA3E,GCA/B,SAASC,KCCT,SAASC,IAEZ,IADA,IAAIC,EAAM,GACDC,EAAK,EAAGA,EAAK3G,UAAUC,OAAQ0G,IACpCD,EAAIC,GAAM3G,UAAU2G,GAExB,OAAOC,EAAcF,GAElB,SAASE,EAAcF,GAC1B,OAAKA,EAGc,IAAfA,EAAIzG,OACGyG,EAAI,GAER,SAAeG,GAClB,OAAOH,EAAI/B,QAAO,SAAUmC,EAAMhH,GAAM,OAAOA,EAAGgH,KAAUD,IANrDL,ECLf,IAAI,EAA4B,WAC5B,SAASO,EAAWC,GAChBxH,KAAKyH,WAAY,EACbD,IACAxH,KAAK0H,WAAaF,GA6F1B,OA1FAD,EAAWnI,UAAUuI,KAAO,SAAUC,GAClC,IAAIb,EAAa,IAAIQ,EAGrB,OAFAR,EAAWc,OAAS7H,KACpB+G,EAAWa,SAAWA,EACfb,GAEXQ,EAAWnI,UAAUoI,UAAY,SAAUhB,EAAgBpD,EAAOE,GAC9D,IAAIsE,EAAW5H,KAAK4H,SAChBE,ECjBL,SAAsBC,EAAgB3E,EAAOE,GAChD,GAAIyE,EAAgB,CAChB,GAAIA,aAA0B,EAC1B,OAAOA,EAEX,GAAIA,EAAe1C,GACf,OAAO0C,EAAe1C,KAG9B,OAAK0C,GAAmB3E,GAAUE,EAG3B,IAAI,EAAWyE,EAAgB3E,EAAOE,GAFlC,IAAI,EAAWL,GDOX+E,CAAaxB,EAAgBpD,EAAOE,GAS/C,GARIsE,EACAE,EAAKpD,IAAIkD,EAASjK,KAAKmK,EAAM9H,KAAK6H,SAGlCC,EAAKpD,IAAI1E,KAAK6H,QAAW,EAAOxE,wCAA0CyE,EAAKhC,mBAC3E9F,KAAK0H,WAAWI,GAChB9H,KAAKiI,cAAcH,IAEvB,EAAOzE,uCACHyE,EAAKhC,qBACLgC,EAAKhC,oBAAqB,EACtBgC,EAAKjC,iBACL,MAAMiC,EAAKlC,eAIvB,OAAOkC,GAEXP,EAAWnI,UAAU6I,cAAgB,SAAUH,GAC3C,IACI,OAAO9H,KAAK0H,WAAWI,GAE3B,MAAO/E,GACC,EAAOM,wCACPyE,EAAKjC,iBAAkB,EACvBiC,EAAKlC,eAAiB7C,IE7C/B,SAAwBmF,GAC3B,KAAOA,GAAU,CACb,IAAIC,EAAKD,EAAUE,EAAWD,EAAGjF,OAAQ8C,EAAcmC,EAAGnC,YAAaD,EAAYoC,EAAGpC,UACtF,GAAIqC,GAAYrC,EACZ,OAAO,EAGPmC,EADKlC,GAAeA,aAAuB,EAChCA,EAGA,KAGnB,OAAO,EFkCKqC,CAAeP,GAIfQ,QAAQC,KAAKxF,GAHb+E,EAAK1E,MAAML,KAOvBwE,EAAWnI,UAAUoJ,QAAU,SAAUrF,EAAMsF,GAC3C,IAAI9C,EAAQ3F,KAEZ,OAAO,IADPyI,EAAcC,EAAeD,KACN,SAAUE,EAASC,GACtC,IAAIhE,EACJA,EAAee,EAAM6B,WAAU,SAAU/I,GACrC,IACI0E,EAAK1E,GAET,MAAOsE,GACH6F,EAAO7F,GACH6B,GACAA,EAAaZ,iBAGtB4E,EAAQD,OAGnBpB,EAAWnI,UAAUsI,WAAa,SAAUzB,GACxC,IAAI4B,EAAS7H,KAAK6H,OAClB,OAAOA,GAAUA,EAAOL,UAAUvB,IAEtCsB,EAAWnI,UAAU,GAAqB,WACtC,OAAOY,MAEXuH,EAAWnI,UAAU6H,KAAO,WAExB,IADA,IAAI4B,EAAa,GACR1B,EAAK,EAAGA,EAAK3G,UAAUC,OAAQ0G,IACpC0B,EAAW1B,GAAM3G,UAAU2G,GAE/B,OAA0B,IAAtB0B,EAAWpI,OACJT,KAEJoH,EAAcyB,EAAdzB,CAA0BpH,OAErCuH,EAAWnI,UAAU0J,UAAY,SAAUL,GACvC,IAAI9C,EAAQ3F,KAEZ,OAAO,IADPyI,EAAcC,EAAeD,KACN,SAAUE,EAASC,GACtC,IAAInK,EACJkH,EAAM6B,WAAU,SAAU5G,GAAK,OAAOnC,EAAQmC,KAAM,SAAUmC,GAAO,OAAO6F,EAAO7F,MAAS,WAAc,OAAO4F,EAAQlK,UAGjI8I,EAAWzI,OAAS,SAAU0I,GAC1B,OAAO,IAAID,EAAWC,IAEnBD,EAjGoB,GAoG/B,SAASmB,EAAeD,GAIpB,GAHKA,IACDA,EAAc,EAAO/F,SAAWA,UAE/B+F,EACD,MAAM,IAAI7F,MAAM,yBAEpB,OAAO6F,EGhHX,IAUWM,EAVqC,WAC5C,SAASC,IAIL,OAHApG,MAAMjF,KAAKqC,MACXA,KAAK4D,QAAU,sBACf5D,KAAKjC,KAAO,0BACLiC,KAGX,OADAgJ,EAA4B5J,UAA0BlB,OAAOY,OAAO8D,MAAMxD,WACnE4J,EARqC,GCE5C,EAAqC,SAAUxD,GAE/C,SAASyD,EAAoBC,EAASjD,GAClC,IAAIN,EAAQH,EAAO7H,KAAKqC,OAASA,KAIjC,OAHA2F,EAAMuD,QAAUA,EAChBvD,EAAMM,WAAaA,EACnBN,EAAMzC,QAAS,EACRyC,EAkBX,OAxBA,EAAkBsD,EAAqBzD,GAQvCyD,EAAoB7J,UAAU4E,YAAc,WACxC,IAAIhE,KAAKkD,OAAT,CAGAlD,KAAKkD,QAAS,EACd,IAAIgG,EAAUlJ,KAAKkJ,QACfC,EAAYD,EAAQC,UAExB,GADAnJ,KAAKkJ,QAAU,KACVC,GAAkC,IAArBA,EAAU1I,SAAgByI,EAAQnD,YAAamD,EAAQhG,OAAzE,CAGA,IAAIkG,EAAkBD,EAAUpE,QAAQ/E,KAAKiG,aACpB,IAArBmD,GACAD,EAAUjE,OAAOkE,EAAiB,MAGnCH,EAzB6B,CA0BtC,GCrBE,EAAmC,SAAUzD,GAE7C,SAAS6D,EAAkBrD,GACvB,IAAIL,EAAQH,EAAO7H,KAAKqC,KAAMgG,IAAgBhG,KAE9C,OADA2F,EAAMK,YAAcA,EACbL,EAEX,OANA,EAAkB0D,EAAmB7D,GAM9B6D,EAP2B,CAQpC,GAEE,EAAyB,SAAU7D,GAEnC,SAAS8D,IACL,IAAI3D,EAAQH,EAAO7H,KAAKqC,OAASA,KAMjC,OALA2F,EAAMwD,UAAY,GAClBxD,EAAMzC,QAAS,EACfyC,EAAMI,WAAY,EAClBJ,EAAM4D,UAAW,EACjB5D,EAAM6D,YAAc,KACb7D,EAyFX,OAjGA,EAAkB2D,EAAS9D,GAU3B8D,EAAQlK,UAAUiG,GAAsB,WACpC,OAAO,IAAI,EAAkBrF,OAEjCsJ,EAAQlK,UAAUuI,KAAO,SAAUC,GAC/B,IAAIsB,EAAU,IAAI,EAAiBlJ,KAAMA,MAEzC,OADAkJ,EAAQtB,SAAWA,EACZsB,GAEXI,EAAQlK,UAAU+D,KAAO,SAAU1E,GAC/B,GAAIuB,KAAKkD,OACL,MAAM,IAAI6F,EAEd,IAAK/I,KAAK+F,UAIN,IAHA,IAAIoD,EAAYnJ,KAAKmJ,UACjBrH,EAAMqH,EAAU1I,OAChBgJ,EAAON,EAAUO,QACZlM,EAAI,EAAGA,EAAIsE,EAAKtE,IACrBiM,EAAKjM,GAAG2F,KAAK1E,IAIzB6K,EAAQlK,UAAUgE,MAAQ,SAAUL,GAChC,GAAI/C,KAAKkD,OACL,MAAM,IAAI6F,EAEd/I,KAAKuJ,UAAW,EAChBvJ,KAAKwJ,YAAczG,EACnB/C,KAAK+F,WAAY,EAIjB,IAHA,IAAIoD,EAAYnJ,KAAKmJ,UACjBrH,EAAMqH,EAAU1I,OAChBgJ,EAAON,EAAUO,QACZlM,EAAI,EAAGA,EAAIsE,EAAKtE,IACrBiM,EAAKjM,GAAG4F,MAAML,GAElB/C,KAAKmJ,UAAU1I,OAAS,GAE5B6I,EAAQlK,UAAUkE,SAAW,WACzB,GAAItD,KAAKkD,OACL,MAAM,IAAI6F,EAEd/I,KAAK+F,WAAY,EAIjB,IAHA,IAAIoD,EAAYnJ,KAAKmJ,UACjBrH,EAAMqH,EAAU1I,OAChBgJ,EAAON,EAAUO,QACZlM,EAAI,EAAGA,EAAIsE,EAAKtE,IACrBiM,EAAKjM,GAAG8F,WAEZtD,KAAKmJ,UAAU1I,OAAS,GAE5B6I,EAAQlK,UAAU4E,YAAc,WAC5BhE,KAAK+F,WAAY,EACjB/F,KAAKkD,QAAS,EACdlD,KAAKmJ,UAAY,MAErBG,EAAQlK,UAAU6I,cAAgB,SAAUhC,GACxC,GAAIjG,KAAKkD,OACL,MAAM,IAAI6F,EAGV,OAAOvD,EAAOpG,UAAU6I,cAActK,KAAKqC,KAAMiG,IAGzDqD,EAAQlK,UAAUsI,WAAa,SAAUzB,GACrC,GAAIjG,KAAKkD,OACL,MAAM,IAAI6F,EAET,OAAI/I,KAAKuJ,UACVtD,EAAW7C,MAAMpD,KAAKwJ,aACf,EAAa3E,OAEf7E,KAAK+F,WACVE,EAAW3C,WACJ,EAAauB,QAGpB7E,KAAKmJ,UAAU1E,KAAKwB,GACb,IAAI,EAAoBjG,KAAMiG,KAG7CqD,EAAQlK,UAAUuK,aAAe,WAC7B,IAAI5C,EAAa,IAAI,EAErB,OADAA,EAAWc,OAAS7H,KACb+G,GAEXuC,EAAQxK,OAAS,SAAUkH,EAAa6B,GACpC,OAAO,IAAI,EAAiB7B,EAAa6B,IAEtCyB,EAlGiB,CAmG1B,GAEE,EAAkC,SAAU9D,GAE5C,SAASoE,EAAiB5D,EAAa6B,GACnC,IAAIlC,EAAQH,EAAO7H,KAAKqC,OAASA,KAGjC,OAFA2F,EAAMK,YAAcA,EACpBL,EAAMkC,OAASA,EACRlC,EA6BX,OAlCA,EAAkBiE,EAAkBpE,GAOpCoE,EAAiBxK,UAAU+D,KAAO,SAAU1E,GACxC,IAAIuH,EAAchG,KAAKgG,YACnBA,GAAeA,EAAY7C,MAC3B6C,EAAY7C,KAAK1E,IAGzBmL,EAAiBxK,UAAUgE,MAAQ,SAAUL,GACzC,IAAIiD,EAAchG,KAAKgG,YACnBA,GAAeA,EAAY5C,OAC3BpD,KAAKgG,YAAY5C,MAAML,IAG/B6G,EAAiBxK,UAAUkE,SAAW,WAClC,IAAI0C,EAAchG,KAAKgG,YACnBA,GAAeA,EAAY1C,UAC3BtD,KAAKgG,YAAY1C,YAGzBsG,EAAiBxK,UAAUsI,WAAa,SAAUzB,GAE9C,OADajG,KAAK6H,OAEP7H,KAAK6H,OAAOL,UAAUvB,GAGtB,EAAapB,OAGrB+E,EAnC0B,CAoCnC,GC1JK,SAASC,EAAYpL,GACxB,OAAOA,GAAmC,mBAAnBA,EAAMqL,SCD1B,IAAIC,EAAmB,SAAUC,GACpC,OAAO,SAAU/D,GACb,IAAK,IAAIzI,EAAI,EAAGsE,EAAMkI,EAAMvJ,OAAQjD,EAAIsE,IAAQmE,EAAW/C,OAAQ1F,IAC/DyI,EAAW9C,KAAK6G,EAAMxM,IAE1ByI,EAAW3C,aCHZ,SAAS2G,EAAc5C,EAAO6C,GACjC,OAAO,IAAI,GAAW,SAAUjE,GAC5B,IAAI1B,EAAM,IAAI,EACV/G,EAAI,EAWR,OAVA+G,EAAIG,IAAIwF,EAAUJ,UAAS,WACnBtM,IAAM6J,EAAM5G,QAIhBwF,EAAW9C,KAAKkE,EAAM7J,MACjByI,EAAW/C,QACZqB,EAAIG,IAAI1E,KAAK8J,aALb7D,EAAW3C,eAQZiB,KCbR,SAAS4F,EAAU9C,EAAO6C,GAC7B,OAAKA,EAIMD,EAAc5C,EAAO6C,GAHrB,IAAI,EAAWH,EAAiB1C,ICFxC,SAAS+C,IAEZ,IADA,IAAIC,EAAO,GACFlD,EAAK,EAAGA,EAAK3G,UAAUC,OAAQ0G,IACpCkD,EAAKlD,GAAM3G,UAAU2G,GAEzB,IAAI+C,EAAYG,EAAKA,EAAK5J,OAAS,GACnC,OAAIoJ,EAAYK,IACZG,EAAKC,MACEL,EAAcI,EAAMH,IAGpBC,EAAUE,GCblB,IAAIxF,EAAsB,IAAI,GAAW,SAAUoB,GAAc,OAAOA,EAAW3C,cACnF,SAAS,EAAM4G,GAClB,OAAOA,EAEX,SAAwBA,GACpB,OAAO,IAAI,GAAW,SAAUjE,GAAc,OAAOiE,EAAUJ,UAAS,WAAc,OAAO7D,EAAW3C,iBAHrFiH,CAAeL,GAAarF,ECD5C,SAAShB,EAAI2G,EAASC,GACzB,OAAO,SAAsB5C,GACzB,GAAuB,mBAAZ2C,EACP,MAAM,IAAIE,UAAU,8DAExB,OAAO7C,EAAOF,KAAK,IAAIgD,EAAYH,EAASC,KAGpD,IAAIE,EAA6B,WAC7B,SAASA,EAAYH,EAASC,GAC1BzK,KAAKwK,QAAUA,EACfxK,KAAKyK,QAAUA,EAKnB,OAHAE,EAAYvL,UAAUzB,KAAO,SAAUsI,EAAY4B,GAC/C,OAAOA,EAAOL,UAAU,IAAI,EAAcvB,EAAYjG,KAAKwK,QAASxK,KAAKyK,WAEtEE,EARqB,GAW5B,EAA+B,SAAUnF,GAEzC,SAASoF,EAAc5E,EAAawE,EAASC,GACzC,IAAI9E,EAAQH,EAAO7H,KAAKqC,KAAMgG,IAAgBhG,KAI9C,OAHA2F,EAAM6E,QAAUA,EAChB7E,EAAMkF,MAAQ,EACdlF,EAAM8E,QAAUA,GAAW9E,EACpBA,EAaX,OAnBA,EAAkBiF,EAAepF,GAQjCoF,EAAcxL,UAAU8G,MAAQ,SAAUzH,GACtC,IAAIqM,EACJ,IACIA,EAAS9K,KAAKwK,QAAQ7M,KAAKqC,KAAKyK,QAAShM,EAAOuB,KAAK6K,SAEzD,MAAO9H,GAEH,YADA/C,KAAKgG,YAAY5C,MAAML,GAG3B/C,KAAKgG,YAAY7C,KAAK2H,IAEnBF,EApBuB,CAqBhC,GC1CK,SAASG,IACZ,MAAsB,mBAAXxM,QAA0BA,OAAOyM,SAGrCzM,OAAOyM,SAFH,aAIR,IAAI,EAAyBD,ICNzBE,GAAc,SAAWrK,GAAK,OAAOA,GAAyB,iBAAbA,EAAEH,QAAoC,mBAANG,GCArF,SAASsK,GAAUzM,GACtB,QAASA,GAAoC,mBAApBA,EAAM+I,WAAkD,mBAAf/I,EAAM0M,KCQrE,IAAIC,GAAc,SAAUN,GAC/B,GAAMA,GAA+C,mBAA9BA,EAAO,GAC1B,OCVqC/J,EDUR+J,ECT1B,SAAU7E,GACb,IAAIoF,EAAMtK,EAAI,KACd,GAA6B,mBAAlBsK,EAAI7D,UACX,MAAM,IAAIkD,UAAU,kEAGpB,OAAOW,EAAI7D,UAAUvB,IDKxB,GAAIgF,GAAYH,GACjB,OAAOf,EAAiBe,GAEvB,GAAII,GAAUJ,GACf,OEhBkCQ,EFgBRR,EEfvB,SAAU7E,GAQb,OAPAqF,EAAQH,MAAK,SAAU1M,GACdwH,EAAW/C,SACZ+C,EAAW9C,KAAK1E,GAChBwH,EAAW3C,eAEhB,SAAUP,GAAO,OAAOkD,EAAW7C,MAAML,MACvCoI,KAAK,KAAMrI,GACTmD,GFSN,GAAM6E,GAA6C,mBAA5BA,EAAO,GAC/B,OGnBmCS,EHmBRT,EGlBxB,SAAU7E,GAEb,IADA,IAAI+E,EAAWO,EAAS,OACrB,CACC,IAAIhK,EAAOyJ,EAAS7H,OACpB,GAAI5B,EAAKiK,KAAM,CACXvF,EAAW3C,WACX,MAGJ,GADA2C,EAAW9C,KAAK5B,EAAK9C,OACjBwH,EAAW/C,OACX,MAUR,MAP+B,mBAApB8H,EAASS,QAChBxF,EAAWvB,KAAI,WACPsG,EAASS,QACTT,EAASS,YAIdxF,GHCP,IGtBmCsF,EDADD,EDAGvK,EDsBjCtC,EAAQ+E,EAASsH,GAAU,oBAAsB,IAAMA,EAAS,IAGpE,MAAM,IAAIJ,UAFA,gBAAkBjM,EAAQ,8FIhBrC,SAASiN,GAAUrE,EAAO6C,GAC7B,GAAa,MAAT7C,EAAe,CACf,GCTD,SAA6BA,GAChC,OAAOA,GAA6C,mBAA7BA,EAAM,GDQrBsE,CAAoBtE,GACpB,OERL,SAA4BA,EAAO6C,GACtC,OAAO,IAAI,GAAW,SAAUjE,GAC5B,IAAI1B,EAAM,IAAI,EASd,OARAA,EAAIG,IAAIwF,EAAUJ,UAAS,WACvB,IAAI/C,EAAaM,EAAM,KACvB9C,EAAIG,IAAIqC,EAAWS,UAAU,CACzBrE,KAAM,SAAU1E,GAAS8F,EAAIG,IAAIwF,EAAUJ,UAAS,WAAc,OAAO7D,EAAW9C,KAAK1E,QACzF2E,MAAO,SAAUL,GAAOwB,EAAIG,IAAIwF,EAAUJ,UAAS,WAAc,OAAO7D,EAAW7C,MAAML,QACzFO,SAAU,WAAciB,EAAIG,IAAIwF,EAAUJ,UAAS,WAAc,OAAO7D,EAAW3C,uBAGpFiB,KFHIqH,CAAmBvE,EAAO6C,GAEhC,GAAIgB,GAAU7D,GACf,OGZL,SAAyBA,EAAO6C,GACnC,OAAO,IAAI,GAAW,SAAUjE,GAC5B,IAAI1B,EAAM,IAAI,EAWd,OAVAA,EAAIG,IAAIwF,EAAUJ,UAAS,WACvB,OAAOzC,EAAM8D,MAAK,SAAU1M,GACxB8F,EAAIG,IAAIwF,EAAUJ,UAAS,WACvB7D,EAAW9C,KAAK1E,GAChB8F,EAAIG,IAAIwF,EAAUJ,UAAS,WAAc,OAAO7D,EAAW3C,sBAEhE,SAAUP,GACTwB,EAAIG,IAAIwF,EAAUJ,UAAS,WAAc,OAAO7D,EAAW7C,MAAML,cAGlEwB,KHDIsH,CAAgBxE,EAAO6C,GAE7B,GAAIe,GAAY5D,GACjB,OAAO4C,EAAc5C,EAAO6C,GAE3B,GIlBN,SAAoB7C,GACvB,OAAOA,GAA2C,mBAA3BA,EAAM,GJiBhByE,CAAWzE,IAA2B,iBAAVA,EACjC,OKjBL,SAA0BA,EAAO6C,GACpC,IAAK7C,EACD,MAAM,IAAIzE,MAAM,2BAEpB,OAAO,IAAI,GAAW,SAAUqD,GAC5B,IACI+E,EADAzG,EAAM,IAAI,EAiCd,OA/BAA,EAAIG,KAAI,WACAsG,GAAuC,mBAApBA,EAASS,QAC5BT,EAASS,YAGjBlH,EAAIG,IAAIwF,EAAUJ,UAAS,WACvBkB,EAAW3D,EAAM,KACjB9C,EAAIG,IAAIwF,EAAUJ,UAAS,WACvB,IAAI7D,EAAW/C,OAAf,CAGA,IAAIzE,EACA+M,EACJ,IACI,IAAIV,EAASE,EAAS7H,OACtB1E,EAAQqM,EAAOrM,MACf+M,EAAOV,EAAOU,KAElB,MAAOzI,GAEH,YADAkD,EAAW7C,MAAML,GAGjByI,EACAvF,EAAW3C,YAGX2C,EAAW9C,KAAK1E,GAChBuB,KAAK8J,qBAIVvF,KLrBIwH,CAAiB1E,EAAO6C,GAGvC,MAAM,IAAIQ,WAAqB,OAAVrD,UAAyBA,GAASA,GAAS,sBMpB7D,SAAS2E,GAAK3E,EAAO6C,GACxB,OAAKA,EAOMwB,GAAUrE,EAAO6C,GANpB7C,aAAiB,EACVA,EAEJ,IAAI,EAAW+D,GAAY/D,ICmB1C,SAAS4E,GAAiBC,EAASzK,GAC/B,OAAO,IAAI,GAAW,SAAUwE,GAC5B,IAAInE,EAAMoK,EAAQzL,OAClB,GAAY,IAARqB,EAgCJ,IA5BA,IAAIqK,EAAS,IAAI/J,MAAMN,GACnBsK,EAAY,EACZC,EAAU,EACVC,EAAU,SAAU9O,GACpB,IAAIqK,EAASmE,GAAKE,EAAQ1O,IACtB+O,GAAW,EACftG,EAAWvB,IAAImD,EAAOL,UAAU,CAC5BrE,KAAM,SAAU1E,GACP8N,IACDA,GAAW,EACXF,KAEJF,EAAO3O,GAAKiB,GAEhB2E,MAAO,SAAUL,GAAO,OAAOkD,EAAW7C,MAAML,IAChDO,SAAU,aACN8I,IACkBtK,GAAQyK,IAClBF,IAAYvK,GACZmE,EAAW9C,KAAK1B,EACZA,EAAK0D,QAAO,SAAU2F,EAAQ/L,EAAKvB,GAAK,OAAQsN,EAAO/L,GAAOoN,EAAO3O,GAAIsN,IAAY,IACrFqB,GAERlG,EAAW3C,iBAKlB9F,EAAI,EAAGA,EAAIsE,EAAKtE,IACrB8O,EAAQ9O,QAhCRyI,EAAW3C,cC1BhB,SAASkJ,GAAUC,EAAQC,EAAWC,EAASC,GAKlD,OAJIpK,EAAWmK,KACXC,EAAiBD,EACjBA,OAAUhK,GAEViK,EACOJ,GAAUC,EAAQC,EAAWC,GAAS1F,KAAKpD,GAAI,SAAUwG,GAAQ,OAAO9G,EAAQ8G,GAAQuC,EAAelM,WAAM,EAAQ2J,GAAQuC,EAAevC,OAEhJ,IAAI,GAAW,SAAUpE,IAYpC,SAAS4G,EAAkBC,EAAWJ,EAAWK,EAAS9G,EAAY0G,GAClE,IAAI3I,EACJ,GA+BJ,SAAuB8I,GACnB,OAAOA,GAAmD,mBAA/BA,EAAUE,kBAA4E,mBAAlCF,EAAUG,oBAhCrFC,CAAcJ,GAAY,CAC1B,IAAIK,EAAWL,EACfA,EAAUE,iBAAiBN,EAAWK,EAASJ,GAC/C3I,EAAc,WAAc,OAAOmJ,EAASF,oBAAoBP,EAAWK,EAASJ,SAEnF,GAuBT,SAAmCG,GAC/B,OAAOA,GAAqC,mBAAjBA,EAAUM,IAA8C,mBAAlBN,EAAUO,IAxBlEC,CAA0BR,GAAY,CAC3C,IAAIS,EAAWT,EACfA,EAAUM,GAAGV,EAAWK,GACxB/I,EAAc,WAAc,OAAOuJ,EAASF,IAAIX,EAAWK,SAE1D,GAeT,SAAiCD,GAC7B,OAAOA,GAA8C,mBAA1BA,EAAUU,aAAkE,mBAA7BV,EAAUW,eAhB3EC,CAAwBZ,GAAY,CACzC,IAAIa,EAAWb,EACfA,EAAUU,YAAYd,EAAWK,GACjC/I,EAAc,WAAc,OAAO2J,EAASF,eAAef,EAAWK,QAErE,KAAID,IAAaA,EAAUrM,OAM5B,MAAM,IAAIiK,UAAU,wBALpB,IAAK,IAAIlN,EAAI,EAAGsE,EAAMgL,EAAUrM,OAAQjD,EAAIsE,EAAKtE,IAC7CqP,EAAkBC,EAAUtP,GAAIkP,EAAWK,EAAS9G,EAAY0G,GAMxE1G,EAAWvB,IAAIV,GA5BX6I,CAAkBJ,EAAQC,GAR1B,SAAiBxM,GACTM,UAAUC,OAAS,EACnBwF,EAAW9C,KAAKf,MAAMhD,UAAUsK,MAAM/L,KAAK6C,YAG3CyF,EAAW9C,KAAKjD,KAGsB+F,EAAY0G,MCpB3D,IAAIiB,GAAsB,IAAI,EAAW5G,GCAhD,IAAI,GAAiC,SAAUxB,GAE3C,SAASqI,EAAgB/G,EAAQgH,EAAYC,GACzC,IAAIpI,EAAQH,EAAO7H,KAAKqC,OAASA,KAKjC,OAJA2F,EAAMmB,OAASA,EACfnB,EAAMmI,WAAaA,EACnBnI,EAAMoI,WAAaA,EACnBpI,EAAMtB,MAAQ,EACPsB,EAaX,OApBA,EAAkBkI,EAAiBrI,GASnCqI,EAAgBzO,UAAU8G,MAAQ,SAAUzH,GACxCuB,KAAK8G,OAAOkH,WAAWhO,KAAK8N,WAAYrP,EAAOuB,KAAK+N,WAAY/N,KAAKqE,QAASrE,OAElF6N,EAAgBzO,UAAU+G,OAAS,SAAU/C,GACzCpD,KAAK8G,OAAOmH,YAAY7K,EAAOpD,MAC/BA,KAAKgE,eAET6J,EAAgBzO,UAAUgH,UAAY,WAClCpG,KAAK8G,OAAOoH,eAAelO,MAC3BA,KAAKgE,eAEF6J,EArByB,CAsBlC,GCrBK,SAASM,GAAkBC,EAAiBtD,EAAQgD,EAAYC,EAAY/H,GAI/E,QAHoB,IAAhBA,IACAA,EAAc,IAAI,GAAgBoI,EAAiBN,EAAYC,KAE/D/H,EAAY9C,OAGhB,OAAI4H,aAAkB,EACXA,EAAOtD,UAAUxB,GAErBoF,GAAYN,EAAZM,CAAoBpF,GCX/B,IAAI,GAAiC,SAAUR,GAE3C,SAAS6I,IACL,OAAkB,OAAX7I,GAAmBA,EAAO9E,MAAMV,KAAMQ,YAAcR,KAW/D,OAbA,EAAkBqO,EAAiB7I,GAInC6I,EAAgBjP,UAAU4O,WAAa,SAAUF,EAAYQ,EAAYP,EAAYQ,EAAYC,GAC7FxO,KAAKgG,YAAY7C,KAAKmL,IAE1BD,EAAgBjP,UAAU6O,YAAc,SAAU7K,EAAOoL,GACrDxO,KAAKgG,YAAY5C,MAAMA,IAE3BiL,EAAgBjP,UAAU8O,eAAiB,SAAUM,GACjDxO,KAAKgG,YAAY1C,YAEd+K,EAdyB,CAelC,GCCF,IAAII,GAAkC,WAClC,SAASA,EAAiBjE,EAASkE,QACZ,IAAfA,IACAA,EAAaC,OAAOC,mBAExB5O,KAAKwK,QAAUA,EACfxK,KAAK0O,WAAaA,EAKtB,OAHAD,EAAiBrP,UAAUzB,KAAO,SAAUuK,EAAUL,GAClD,OAAOA,EAAOL,UAAU,IAAI,GAAmBU,EAAUlI,KAAKwK,QAASxK,KAAK0O,cAEzED,EAX0B,GAcjC,GAAoC,SAAUjJ,GAE9C,SAASqJ,EAAmB7I,EAAawE,EAASkE,QAC3B,IAAfA,IACAA,EAAaC,OAAOC,mBAExB,IAAIjJ,EAAQH,EAAO7H,KAAKqC,KAAMgG,IAAgBhG,KAO9C,OANA2F,EAAM6E,QAAUA,EAChB7E,EAAM+I,WAAaA,EACnB/I,EAAMmJ,cAAe,EACrBnJ,EAAMoJ,OAAS,GACfpJ,EAAMqJ,OAAS,EACfrJ,EAAMtB,MAAQ,EACPsB,EAkDX,OA9DA,EAAkBkJ,EAAoBrJ,GActCqJ,EAAmBzP,UAAU8G,MAAQ,SAAUzH,GACvCuB,KAAKgP,OAAShP,KAAK0O,WACnB1O,KAAKiP,SAASxQ,GAGduB,KAAK+O,OAAOtK,KAAKhG,IAGzBoQ,EAAmBzP,UAAU6P,SAAW,SAAUxQ,GAC9C,IAAIqM,EACAzG,EAAQrE,KAAKqE,QACjB,IACIyG,EAAS9K,KAAKwK,QAAQ/L,EAAO4F,GAEjC,MAAOtB,GAEH,YADA/C,KAAKgG,YAAY5C,MAAML,GAG3B/C,KAAKgP,SACLhP,KAAKkP,UAAUpE,EAAQrM,EAAO4F,IAElCwK,EAAmBzP,UAAU8P,UAAY,SAAUC,EAAK1Q,EAAO4F,GAC3D,IAAI+K,EAAkB,IAAI,GAAgBpP,UAAM2C,OAAWA,GACzC3C,KAAKgG,YACXtB,IAAI0K,GAChBjB,GAAkBnO,KAAMmP,EAAK1Q,EAAO4F,EAAO+K,IAE/CP,EAAmBzP,UAAUgH,UAAY,WACrCpG,KAAK8O,cAAe,EACA,IAAhB9O,KAAKgP,QAAuC,IAAvBhP,KAAK+O,OAAOtO,QACjCT,KAAKgG,YAAY1C,WAErBtD,KAAKgE,eAET6K,EAAmBzP,UAAU4O,WAAa,SAAUF,EAAYQ,EAAYP,EAAYQ,EAAYC,GAChGxO,KAAKgG,YAAY7C,KAAKmL,IAE1BO,EAAmBzP,UAAU8O,eAAiB,SAAUM,GACpD,IAAIO,EAAS/O,KAAK+O,OAClB/O,KAAKoE,OAAOoK,GACZxO,KAAKgP,SACDD,EAAOtO,OAAS,EAChBT,KAAKkG,MAAM6I,EAAOM,SAEG,IAAhBrP,KAAKgP,QAAgBhP,KAAK8O,cAC/B9O,KAAKgG,YAAY1C,YAGlBuL,EA/D4B,CAgErC,IChGK,SAAS,GAASjO,GACrB,OAAOA,ECCJ,SAAS0O,GAASZ,GAIrB,YAHmB,IAAfA,IACAA,EAAaC,OAAOC,mBFErB,SAASW,EAAS/E,EAASoC,EAAgB8B,GAI9C,YAHmB,IAAfA,IACAA,EAAaC,OAAOC,mBAEM,mBAAnBhC,EACA,SAAU/E,GAAU,OAAOA,EAAOZ,KAAKsI,GAAS,SAAUnP,EAAG5C,GAAK,OAAOwO,GAAKxB,EAAQpK,EAAG5C,IAAIyJ,KAAKpD,GAAI,SAAU5B,EAAGuN,GAAM,OAAO5C,EAAexM,EAAG6B,EAAGzE,EAAGgS,SAAad,MAE7I,iBAAnB9B,IACZ8B,EAAa9B,GAEV,SAAU/E,GAAU,OAAOA,EAAOF,KAAK,IAAI8G,GAAiBjE,EAASkE,MEVrEa,CAAS,GAAUb,GCFvB,SAASe,KAEZ,IADA,IAAIC,EAAc,GACTvI,EAAK,EAAGA,EAAK3G,UAAUC,OAAQ0G,IACpCuI,EAAYvI,GAAM3G,UAAU2G,GAEhC,IAAIuH,EAAaC,OAAOC,kBACpB1E,EAAY,KACZyF,EAAOD,EAAYA,EAAYjP,OAAS,GAU5C,OATIoJ,EAAY8F,IACZzF,EAAYwF,EAAYpF,MACpBoF,EAAYjP,OAAS,GAAoD,iBAAxCiP,EAAYA,EAAYjP,OAAS,KAClEiO,EAAagB,EAAYpF,QAGR,iBAATqF,IACZjB,EAAagB,EAAYpF,OAEX,OAAdJ,GAA6C,IAAvBwF,EAAYjP,QAAgBiP,EAAY,aAAc,EACrEA,EAAY,GAEhBJ,GAASZ,EAATY,CAAqBnF,EAAUuF,EAAaxF,I,YCiBhD,SAAS0F,GAAQC,EAAKC,GAIzB,YAHgB,IAAZA,IACAA,EAAU,MAEP,IAAI,GAAe,CAAEC,OAAQ,MAAOF,IAAKA,EAAKC,QAASA,IAE3D,SAASE,GAASH,EAAKI,EAAMH,GAChC,OAAO,IAAI,GAAe,CAAEC,OAAQ,OAAQF,IAAKA,EAAKI,KAAMA,EAAMH,QAASA,IAExE,SAASI,GAAWL,EAAKC,GAC5B,OAAO,IAAI,GAAe,CAAEC,OAAQ,SAAUF,IAAKA,EAAKC,QAASA,IAE9D,SAASK,GAAQN,EAAKI,EAAMH,GAC/B,OAAO,IAAI,GAAe,CAAEC,OAAQ,MAAOF,IAAKA,EAAKI,KAAMA,EAAMH,QAASA,IAEvE,SAASM,GAAUP,EAAKI,EAAMH,GACjC,OAAO,IAAI,GAAe,CAAEC,OAAQ,QAASF,IAAKA,EAAKI,KAAMA,EAAMH,QAASA,IAEhF,IAAIO,GAA4BxM,GAAI,SAAUjD,EAAGyD,GAAS,OAAOzD,EAAE0P,YAC5D,SAASC,GAAYV,EAAKC,GAC7B,OAAOO,GAAY,IAAI,GAAe,CAClCN,OAAQ,MACRF,IAAKA,EACLW,aAAc,OACdV,QAASA,KAGjB,IAAI,GAAgC,SAAUtK,GAE1C,SAASiL,EAAeC,GACpB,IAAI/K,EAAQH,EAAO7H,KAAKqC,OAASA,KAC7B2Q,EAAU,CACVC,OAAO,EACPC,UAAW,WACP,OAAO7Q,KAAK8Q,YAtE5B,WACI,GAAIC,GAAA,EAAKC,eACL,OAAO,IAAID,GAAA,EAAKC,eAEf,GAAMD,GAAA,EAAKE,eACZ,OAAO,IAAIF,GAAA,EAAKE,eAGhB,MAAM,IAAIrO,MAAM,yCA8DkBsO,GA3D1C,WACI,GAAIH,GAAA,EAAKC,eACL,OAAO,IAAID,GAAA,EAAKC,eAGhB,IAAIG,OAAS,EACb,IAEI,IADA,IAAIC,EAAU,CAAC,iBAAkB,oBAAqB,sBAC7C5T,EAAI,EAAGA,EAAI,EAAGA,IACnB,IAEI,GADA2T,EAASC,EAAQ5T,GACb,IAAIuT,GAAA,EAAKM,cAAcF,GACvB,MAGR,MAAOjR,IAGX,OAAO,IAAI6Q,GAAA,EAAKM,cAAcF,GAElC,MAAOjR,GACH,MAAM,IAAI0C,MAAM,oDAsCiC0O,IAEjDR,aAAa,EACbS,iBAAiB,EACjBzB,QAAS,GACTC,OAAQ,MACRS,aAAc,OACdgB,QAAS,GAEb,GAA4B,iBAAjBd,EACPC,EAAQd,IAAMa,OAGd,IAAK,IAAI5P,KAAQ4P,EACTA,EAAarR,eAAeyB,KAC5B6P,EAAQ7P,GAAQ4P,EAAa5P,IAKzC,OADA6E,EAAMgL,QAAUA,EACThL,EAKa,IAChB7G,EAWR,OA3CA,EAAkB2R,EAAgBjL,GA4BlCiL,EAAerR,UAAUsI,WAAa,SAAUzB,GAC5C,OAAO,IAAI,GAAeA,EAAYjG,KAAK2Q,UAE/CF,EAAe3R,SACPA,EAAS,SAAU4R,GACnB,OAAO,IAAID,EAAeC,KAEvBrS,IAAMuR,GACb9Q,EAAO2S,KAAOzB,GACdlR,EAAO4S,OAASxB,GAChBpR,EAAO6S,IAAMxB,GACbrR,EAAO8S,MAAQxB,GACftR,EAAO+S,QAAUtB,GACVzR,GAEJ2R,EA5CwB,CA6CjC,GAEE,GAAgC,SAAUjL,GAE1C,SAASsM,EAAe9L,EAAa2K,GACjC,IAAIhL,EAAQH,EAAO7H,KAAKqC,KAAMgG,IAAgBhG,KAC9C2F,EAAMgL,QAAUA,EAChBhL,EAAM6F,MAAO,EACb,IAAIsE,EAAUa,EAAQb,QAAUa,EAAQb,SAAW,GAUnD,OATKa,EAAQG,aAAgBnL,EAAMoM,UAAUjC,EAAS,sBAClDA,EAAQ,oBAAsB,kBAEVnK,EAAMoM,UAAUjC,EAAS,iBACrBiB,GAAA,EAAKiB,UAAYrB,EAAQV,gBAAgBc,GAAA,EAAKiB,eAAqC,IAAjBrB,EAAQV,OAClGH,EAAQ,gBAAkB,oDAE9Ba,EAAQV,KAAOtK,EAAMsM,cAActB,EAAQV,KAAMtK,EAAMoM,UAAUpB,EAAQb,QAAS,iBAClFnK,EAAMuM,OACCvM,EAyLX,OAxMA,EAAkBmM,EAAgBtM,GAiBlCsM,EAAe1S,UAAU+D,KAAO,SAAUjD,GACtCF,KAAKwL,MAAO,EACZ,IACIV,EADWqH,EAANnS,KAAemS,IAAKxB,EAApB3Q,KAAiC2Q,QAAS3K,EAA1ChG,KAA2DgG,YAEpE,IACI8E,EAAS,IAAIsH,GAAalS,EAAGiS,EAAKxB,GAEtC,MAAO5N,GACH,OAAOiD,EAAY5C,MAAML,GAE7BiD,EAAY7C,KAAK2H,IAErBgH,EAAe1S,UAAU8S,KAAO,WAC5B,IAAevB,EAAN3Q,KAAmB2Q,QAAS0B,EAA5BrS,KAAoC2Q,QAAS2B,EAAOD,EAAGC,KAAMvC,EAASsC,EAAGtC,OAAQF,EAAMwC,EAAGxC,IAAKe,EAAQyB,EAAGzB,MAAO2B,EAAWF,EAAGE,SAAUzC,EAAUuC,EAAGvC,QAASG,EAAOoC,EAAGpC,KAClL,IACI,IAAIkC,EAAMnS,KAAKmS,IAAMxB,EAAQE,YAC7B7Q,KAAKwS,YAAYL,EAAKxB,GAClB2B,EACAH,EAAIM,KAAK1C,EAAQF,EAAKe,EAAO0B,EAAMC,GAGnCJ,EAAIM,KAAK1C,EAAQF,EAAKe,GAEtBA,IACAuB,EAAIX,QAAUb,EAAQa,QACtBW,EAAI3B,aAAeG,EAAQH,cAE3B,oBAAqB2B,IACrBA,EAAIZ,kBAAoBZ,EAAQY,iBAEpCvR,KAAK0S,WAAWP,EAAKrC,GACjBG,EACAkC,EAAID,KAAKjC,GAGTkC,EAAID,OAGZ,MAAOnP,GACH/C,KAAKoD,MAAML,KAGnB+O,EAAe1S,UAAU6S,cAAgB,SAAUhC,EAAM0C,GACrD,IAAK1C,GAAwB,iBAATA,EAChB,OAAOA,EAEN,GAAIc,GAAA,EAAKiB,UAAY/B,aAAgBc,GAAA,EAAKiB,SAC3C,OAAO/B,EAEX,GAAI0C,EAAa,CACb,IAAIC,EAAaD,EAAY5N,QAAQ,MACjB,IAAhB6N,IACAD,EAAcA,EAAYE,UAAU,EAAGD,IAG/C,OAAQD,GACJ,IAAK,oCACD,OAAOzU,OAAOuD,KAAKwO,GAAMpM,KAAI,SAAU9E,GAAO,OAAO+T,mBAAmB/T,GAAO,IAAM+T,mBAAmB7C,EAAKlR,OAAU+E,KAAK,KAChI,IAAK,mBACD,OAAOiP,KAAKC,UAAU/C,GAC1B,QACI,OAAOA,IAGnB6B,EAAe1S,UAAUsT,WAAa,SAAUP,EAAKrC,GACjD,IAAK,IAAI/Q,KAAO+Q,EACRA,EAAQzQ,eAAeN,IACvBoT,EAAIc,iBAAiBlU,EAAK+Q,EAAQ/Q,KAI9C+S,EAAe1S,UAAU2S,UAAY,SAAUjC,EAASoD,GACpD,IAAK,IAAInU,KAAO+Q,EACZ,GAAI/Q,EAAIoU,gBAAkBD,EAAWC,cACjC,OAAOrD,EAAQ/Q,IAK3B+S,EAAe1S,UAAUoT,YAAc,SAAUL,EAAKxB,GAClD,IAAIyC,EAAqBzC,EAAQyC,mBACjC,SAASC,EAAWnT,GAChB,IAIIkD,EAJA+E,EAAKkL,EAAYpN,EAAakC,EAAGlC,WAAYmN,EAAqBjL,EAAGiL,mBAAoBzC,EAAUxI,EAAGwI,QACtGyC,GACAA,EAAmBhQ,MAAMlD,GAG7B,IACIkD,EAAQ,IAAIkQ,GAAiBtT,KAAM2Q,GAEvC,MAAO5N,GACHK,EAAQL,EAEZkD,EAAW7C,MAAMA,GAMrB,GAJA+O,EAAIoB,UAAYF,EAChBA,EAAW1C,QAAUA,EACrB0C,EAAWpN,WAAajG,KACxBqT,EAAWD,mBAAqBA,EAC5BjB,EAAIqB,QAAU,oBAAqBrB,EAAK,CAEpC,IAAIsB,EAaJC,EAdJ,GAAIN,EAEAK,EAAgB,SAAUvT,GACGuT,EAAcL,mBACpBjQ,KAAKjD,IAExB6Q,GAAA,EAAKE,eACLkB,EAAIwB,WAAaF,EAGjBtB,EAAIqB,OAAOG,WAAaF,EAE5BA,EAAcL,mBAAqBA,EAGvCM,EAAa,SAAUxT,GACnB,IAIIkD,EAJA+E,EAAKuL,EAAYN,EAAqBjL,EAAGiL,mBAAoBnN,EAAakC,EAAGlC,WAAY0K,EAAUxI,EAAGwI,QACtGyC,GACAA,EAAmBhQ,MAAMlD,GAG7B,IACIkD,EAAQ,IAAIwQ,GAAU,aAAc5T,KAAM2Q,GAE9C,MAAO5N,GACHK,EAAQL,EAEZkD,EAAW7C,MAAMA,IAErB+O,EAAI0B,QAAUH,EACdA,EAAW/C,QAAUA,EACrB+C,EAAWzN,WAAajG,KACxB0T,EAAWN,mBAAqBA,EAEpC,SAASU,EAAoB5T,IAO7B,SAAS6T,EAAQ7T,GACb,IAAIiI,EAAK4L,EAAS9N,EAAakC,EAAGlC,WAAYmN,EAAqBjL,EAAGiL,mBAAoBzC,EAAUxI,EAAGwI,QACvG,GAAwB,IAApB3Q,KAAKgU,WAAkB,CACvB,IAAIC,EAA2B,OAAhBjU,KAAKkU,OAAkB,IAAMlU,KAAKkU,OAC7C5D,EAAkC,SAAtBtQ,KAAKwQ,aAA2BxQ,KAAKsQ,UAAYtQ,KAAKmU,aAAgBnU,KAAKsQ,SAI3F,GAHiB,IAAb2D,IACAA,EAAW3D,EAAW,IAAM,GAE5B2D,EAAW,IACPb,GACAA,EAAmB9P,WAEvB2C,EAAW9C,KAAKjD,GAChB+F,EAAW3C,eAEV,CACG8P,GACAA,EAAmBhQ,MAAMlD,GAE7B,IAAIkD,OAAQ,EACZ,IACIA,EAAQ,IAAIwQ,GAAU,cAAgBK,EAAUjU,KAAM2Q,GAE1D,MAAO5N,GACHK,EAAQL,EAEZkD,EAAW7C,MAAMA,KA9B7B+O,EAAIiC,mBAAqBN,EACzBA,EAAoB7N,WAAajG,KACjC8T,EAAoBV,mBAAqBA,EACzCU,EAAoBnD,QAAUA,EA+B9BwB,EAAIkC,OAASN,EACbA,EAAQ9N,WAAajG,KACrB+T,EAAQX,mBAAqBA,EAC7BW,EAAQpD,QAAUA,GAEtBmB,EAAe1S,UAAU4E,YAAc,WACnC,IAAewH,EAANxL,KAAgBwL,KAAM2G,EAAtBnS,KAA+BmS,KACnC3G,GAAQ2G,GAA0B,IAAnBA,EAAI6B,YAAyC,mBAAd7B,EAAImC,OACnDnC,EAAImC,QAER9O,EAAOpG,UAAU4E,YAAYrG,KAAKqC,OAE/B8R,EAzMwB,CA0MjC,GAEEM,GAA8B,WAS9B,OARA,SAAsBmC,EAAepC,EAAKxB,GACtC3Q,KAAKuU,cAAgBA,EACrBvU,KAAKmS,IAAMA,EACXnS,KAAK2Q,QAAUA,EACf3Q,KAAKkU,OAAS/B,EAAI+B,OAClBlU,KAAKwQ,aAAe2B,EAAI3B,cAAgBG,EAAQH,aAChDxQ,KAAKsQ,SAAWkE,GAAiBxU,KAAKwQ,aAAc2B,IAP3B,GA2BtByB,GAfuB,WAC9B,SAASa,EAAc7Q,EAASuO,EAAKxB,GASjC,OARA/N,MAAMjF,KAAKqC,MACXA,KAAK4D,QAAUA,EACf5D,KAAKjC,KAAO,YACZiC,KAAKmS,IAAMA,EACXnS,KAAK2Q,QAAUA,EACf3Q,KAAKkU,OAAS/B,EAAI+B,OAClBlU,KAAKwQ,aAAe2B,EAAI3B,cAAgBG,EAAQH,aAChDxQ,KAAKsQ,SAAWkE,GAAiBxU,KAAKwQ,aAAc2B,GAC7CnS,KAGX,OADAyU,EAAcrV,UAA0BlB,OAAOY,OAAO8D,MAAMxD,WACrDqV,EAbuB,GAwBlC,SAASD,GAAiBhE,EAAc2B,GACpC,OAAQ3B,GACJ,IAAK,OACD,OAXZ,SAAmB2B,GACf,MAAI,aAAcA,EACPA,EAAI3B,aAAe2B,EAAI7B,SAAWyC,KAAK2B,MAAMvC,EAAI7B,UAAY6B,EAAIgC,cAAgB,QAGjFpB,KAAK2B,MAAMvC,EAAIgC,cAAgB,QAM3BQ,CAAUxC,GACrB,IAAK,MACD,OAAOA,EAAIyC,YACf,IAAK,OACL,QACI,MAAQ,aAAczC,EAAOA,EAAI7B,SAAW6B,EAAIgC,cAQrD,IAAIb,GALX,SAA8BnB,EAAKxB,GAG/B,OAFAiD,GAAUjW,KAAKqC,KAAM,eAAgBmS,EAAKxB,GAC1C3Q,KAAKjC,KAAO,mBACLiC,MChXA6U,GAAqB,WAAe,OAAO,GAAe/V,OAArC,GCCzB,SAASgW,GAAOC,EAAWtK,GAC9B,OAAO,SAAgC5C,GACnC,OAAOA,EAAOF,KAAK,IAAIqN,GAAeD,EAAWtK,KAGzD,IAAIuK,GAAgC,WAChC,SAASA,EAAeD,EAAWtK,GAC/BzK,KAAK+U,UAAYA,EACjB/U,KAAKyK,QAAUA,EAKnB,OAHAuK,EAAe5V,UAAUzB,KAAO,SAAUsI,EAAY4B,GAClD,OAAOA,EAAOL,UAAU,IAAI,GAAiBvB,EAAYjG,KAAK+U,UAAW/U,KAAKyK,WAE3EuK,EARwB,GAU/B,GAAkC,SAAUxP,GAE5C,SAASyP,EAAiBjP,EAAa+O,EAAWtK,GAC9C,IAAI9E,EAAQH,EAAO7H,KAAKqC,KAAMgG,IAAgBhG,KAI9C,OAHA2F,EAAMoP,UAAYA,EAClBpP,EAAM8E,QAAUA,EAChB9E,EAAMkF,MAAQ,EACPlF,EAeX,OArBA,EAAkBsP,EAAkBzP,GAQpCyP,EAAiB7V,UAAU8G,MAAQ,SAAUzH,GACzC,IAAIqM,EACJ,IACIA,EAAS9K,KAAK+U,UAAUpX,KAAKqC,KAAKyK,QAAShM,EAAOuB,KAAK6K,SAE3D,MAAO9H,GAEH,YADA/C,KAAKgG,YAAY5C,MAAML,GAGvB+H,GACA9K,KAAKgG,YAAY7C,KAAK1E,IAGvBwW,EAtB0B,CAuBnC,GCpCK,SAASC,GAAInN,EAAgB3E,EAAOE,GACvC,OAAO,SAA6BuE,GAChC,OAAOA,EAAOF,KAAK,IAAIwN,GAAWpN,EAAgB3E,EAAOE,KAGjE,IAAI6R,GAA4B,WAC5B,SAASA,EAAWpN,EAAgB3E,EAAOE,GACvCtD,KAAK+H,eAAiBA,EACtB/H,KAAKoD,MAAQA,EACbpD,KAAKsD,SAAWA,EAKpB,OAHA6R,EAAW/V,UAAUzB,KAAO,SAAUsI,EAAY4B,GAC9C,OAAOA,EAAOL,UAAU,IAAI,GAAcvB,EAAYjG,KAAK+H,eAAgB/H,KAAKoD,MAAOpD,KAAKsD,YAEzF6R,EAToB,GAW3B,GAA+B,SAAU3P,GAEzC,SAAS4P,EAAcpP,EAAaQ,EAAgBpD,EAAOE,GACvD,IAAIqC,EAAQH,EAAO7H,KAAKqC,KAAMgG,IAAgBhG,KAgB9C,OAfA2F,EAAM0P,SAAWrO,EACjBrB,EAAM2P,UAAYtO,EAClBrB,EAAM4P,aAAevO,EACrBrB,EAAM2P,UAAYlS,GAAS4D,EAC3BrB,EAAM4P,aAAejS,GAAY0D,EAC7BxE,EAAWgE,IACXb,EAAMe,SAAWf,EACjBA,EAAM0P,SAAW7O,GAEZA,IACLb,EAAMe,SAAWF,EACjBb,EAAM0P,SAAW7O,EAAerD,MAAQ6D,EACxCrB,EAAM2P,UAAY9O,EAAepD,OAAS4D,EAC1CrB,EAAM4P,aAAe/O,EAAelD,UAAY0D,GAE7CrB,EAgCX,OAlDA,EAAkByP,EAAe5P,GAoBjC4P,EAAchW,UAAU8G,MAAQ,SAAUzH,GACtC,IACIuB,KAAKqV,SAAS1X,KAAKqC,KAAK0G,SAAUjI,GAEtC,MAAOsE,GAEH,YADA/C,KAAKgG,YAAY5C,MAAML,GAG3B/C,KAAKgG,YAAY7C,KAAK1E,IAE1B2W,EAAchW,UAAU+G,OAAS,SAAUpD,GACvC,IACI/C,KAAKsV,UAAU3X,KAAKqC,KAAK0G,SAAU3D,GAEvC,MAAOA,GAEH,YADA/C,KAAKgG,YAAY5C,MAAML,GAG3B/C,KAAKgG,YAAY5C,MAAML,IAE3BqS,EAAchW,UAAUgH,UAAY,WAChC,IACIpG,KAAKuV,aAAa5X,KAAKqC,KAAK0G,UAEhC,MAAO3D,GAEH,YADA/C,KAAKgG,YAAY5C,MAAML,GAG3B,OAAO/C,KAAKgG,YAAY1C,YAErB8R,EAnDuB,CAoDhC,GCvEK,SAASI,KAEZ,IADA,IAAIC,EAAa,GACRtO,EAAK,EAAGA,EAAK3G,UAAUC,OAAQ0G,IACpCsO,EAAWtO,GAAM3G,UAAU2G,GAE/B,IAAI1G,EAASgV,EAAWhV,OACxB,GAAe,IAAXA,EACA,MAAM,IAAImC,MAAM,uCAEpB,OAAO,SAAUiF,GAAU,OAAOhE,EAEtC,SAAiBhC,EAAOpB,GAcpB,OAba,SAAUG,GAEnB,IADA,IAAI8U,EAAc9U,EACTpD,EAAI,EAAGA,EAAIiD,EAAQjD,IAAK,CAC7B,IAAI8B,EAAIoW,EAAY7T,EAAMrE,IAC1B,QAAiB,IAAN8B,EAIP,OAHAoW,EAAcpW,EAMtB,OAAOoW,GAd2BC,CAAQF,EAAYhV,GAAxBoD,CAAiCgE,ICVvE,IAUW+N,GAVqC,WAC5C,SAASC,IAIL,OAHAjT,MAAMjF,KAAKqC,MACXA,KAAK4D,QAAU,wBACf5D,KAAKjC,KAAO,0BACLiC,KAGX,OADA6V,EAA4BzW,UAA0BlB,OAAOY,OAAO8D,MAAMxD,WACnEyW,EARqC,GCchD,IAAI,GAA8B,WAC9B,SAASC,EAAaC,GAElB,GADA/V,KAAK+V,MAAQA,EACT/V,KAAK+V,MAAQ,EACb,MAAM,IAAIH,GAMlB,OAHAE,EAAa1W,UAAUzB,KAAO,SAAUsI,EAAY4B,GAChD,OAAOA,EAAOL,UAAU,IAAI,GAAevB,EAAYjG,KAAK+V,SAEzDD,EAVsB,GAY7B,GAAgC,SAAUtQ,GAE1C,SAASwQ,EAAehQ,EAAa+P,GACjC,IAAIpQ,EAAQH,EAAO7H,KAAKqC,KAAMgG,IAAgBhG,KAG9C,OAFA2F,EAAMoQ,MAAQA,EACdpQ,EAAMkF,MAAQ,EACPlF,EAaX,OAlBA,EAAkBqQ,EAAgBxQ,GAOlCwQ,EAAe5W,UAAU8G,MAAQ,SAAUzH,GACvC,IAAIsX,EAAQ/V,KAAK+V,MACblL,IAAU7K,KAAK6K,MACfA,GAASkL,IACT/V,KAAKgG,YAAY7C,KAAK1E,GAClBoM,IAAUkL,IACV/V,KAAKgG,YAAY1C,WACjBtD,KAAKgE,iBAIVgS,EAnBwB,CAoBjC,GCxCK,SAASC,GAAUzL,EAASoC,GAC/B,MAA8B,mBAAnBA,EACA,SAAU/E,GAAU,OAAOA,EAAOZ,KAAKgP,IAAU,SAAU7V,EAAG5C,GAAK,OAAOwO,GAAKxB,EAAQpK,EAAG5C,IAAIyJ,KAAKpD,GAAI,SAAU5B,EAAGuN,GAAM,OAAO5C,EAAexM,EAAG6B,EAAGzE,EAAGgS,YAE7J,SAAU3H,GAAU,OAAOA,EAAOF,KAAK,IAAIuO,GAAkB1L,KAExE,ICTW2L,GDSPD,GAAmC,WACnC,SAASA,EAAkB1L,GACvBxK,KAAKwK,QAAUA,EAKnB,OAHA0L,EAAkB9W,UAAUzB,KAAO,SAAUsI,EAAY4B,GACrD,OAAOA,EAAOL,UAAU,IAAI,GAAoBvB,EAAYjG,KAAKwK,WAE9D0L,EAP2B,GASlC,GAAqC,SAAU1Q,GAE/C,SAAS4Q,EAAoBpQ,EAAawE,GACtC,IAAI7E,EAAQH,EAAO7H,KAAKqC,KAAMgG,IAAgBhG,KAG9C,OAFA2F,EAAM6E,QAAUA,EAChB7E,EAAMtB,MAAQ,EACPsB,EA6CX,OAlDA,EAAkByQ,EAAqB5Q,GAOvC4Q,EAAoBhX,UAAU8G,MAAQ,SAAUzH,GAC5C,IAAIqM,EACAzG,EAAQrE,KAAKqE,QACjB,IACIyG,EAAS9K,KAAKwK,QAAQ/L,EAAO4F,GAEjC,MAAOjB,GAEH,YADApD,KAAKgG,YAAY5C,MAAMA,GAG3BpD,KAAKkP,UAAUpE,EAAQrM,EAAO4F,IAElC+R,EAAoBhX,UAAU8P,UAAY,SAAUpE,EAAQrM,EAAO4F,GAC/D,IAAIgS,EAAoBrW,KAAKqW,kBACzBA,GACAA,EAAkBrS,cAEtB,IAAIoL,EAAkB,IAAI,GAAgBpP,UAAM2C,OAAWA,GACzC3C,KAAKgG,YACXtB,IAAI0K,GAChBpP,KAAKqW,kBAAoBlI,GAAkBnO,KAAM8K,EAAQrM,EAAO4F,EAAO+K,IAE3EgH,EAAoBhX,UAAUgH,UAAY,WACtC,IAAIiQ,EAAoBrW,KAAKqW,kBACxBA,IAAqBA,EAAkBnT,QACxCsC,EAAOpG,UAAUgH,UAAUzI,KAAKqC,MAEpCA,KAAKgE,eAEToS,EAAoBhX,UAAU+E,aAAe,WACzCnE,KAAKqW,kBAAoB,MAE7BD,EAAoBhX,UAAU8O,eAAiB,SAAUM,GACnCxO,KAAKgG,YACX5B,OAAOoK,GACnBxO,KAAKqW,kBAAoB,KACrBrW,KAAK+F,WACLP,EAAOpG,UAAUgH,UAAUzI,KAAKqC,OAGxCoW,EAAoBhX,UAAU4O,WAAa,SAAUF,EAAYQ,EAAYP,EAAYQ,EAAYC,GACjGxO,KAAKgG,YAAY7C,KAAKmL,IAEnB8H,EAnD6B,CAoDtC,IEvEE,GAA6B,SAAU5Q,GAEvC,SAAS8Q,EAAYpM,EAAWqM,GAC5B,IAAI5Q,EAAQH,EAAO7H,KAAKqC,KAAMkK,EAAWqM,IAASvW,KAIlD,OAHA2F,EAAMuE,UAAYA,EAClBvE,EAAM4Q,KAAOA,EACb5Q,EAAM6Q,SAAU,EACT7Q,EAiFX,OAvFA,EAAkB2Q,EAAa9Q,GAQ/B8Q,EAAYlX,UAAU0K,SAAW,SAAU2M,EAAOC,GAI9C,QAHc,IAAVA,IACAA,EAAQ,GAER1W,KAAKkD,OACL,OAAOlD,KAEXA,KAAKyW,MAAQA,EACb,IAAIE,EAAK3W,KAAK2W,GACVzM,EAAYlK,KAAKkK,UAOrB,OANU,MAANyM,IACA3W,KAAK2W,GAAK3W,KAAK4W,eAAe1M,EAAWyM,EAAID,IAEjD1W,KAAKwW,SAAU,EACfxW,KAAK0W,MAAQA,EACb1W,KAAK2W,GAAK3W,KAAK2W,IAAM3W,KAAK6W,eAAe3M,EAAWlK,KAAK2W,GAAID,GACtD1W,MAEXsW,EAAYlX,UAAUyX,eAAiB,SAAU3M,EAAWyM,EAAID,GAI5D,YAHc,IAAVA,IACAA,EAAQ,GAELI,YAAY5M,EAAU6M,MAAM/X,KAAKkL,EAAWlK,MAAO0W,IAE9DJ,EAAYlX,UAAUwX,eAAiB,SAAU1M,EAAWyM,EAAID,GAI5D,QAHc,IAAVA,IACAA,EAAQ,GAEE,OAAVA,GAAkB1W,KAAK0W,QAAUA,IAA0B,IAAjB1W,KAAKwW,QAC/C,OAAOG,EAEXK,cAAcL,IAGlBL,EAAYlX,UAAU6X,QAAU,SAAUR,EAAOC,GAC7C,GAAI1W,KAAKkD,OACL,OAAO,IAAIN,MAAM,gCAErB5C,KAAKwW,SAAU,EACf,IAAIpT,EAAQpD,KAAKkX,SAAST,EAAOC,GACjC,GAAItT,EACA,OAAOA,GAEe,IAAjBpD,KAAKwW,SAAgC,MAAXxW,KAAK2W,KACpC3W,KAAK2W,GAAK3W,KAAK4W,eAAe5W,KAAKkK,UAAWlK,KAAK2W,GAAI,QAG/DL,EAAYlX,UAAU8X,SAAW,SAAUT,EAAOC,GAC9C,IAAIS,GAAU,EACVC,OAAazU,EACjB,IACI3C,KAAKuW,KAAKE,GAEd,MAAOvW,GACHiX,GAAU,EACVC,IAAelX,GAAKA,GAAK,IAAI0C,MAAM1C,GAEvC,GAAIiX,EAEA,OADAnX,KAAKgE,cACEoT,GAGfd,EAAYlX,UAAU+E,aAAe,WACjC,IAAIwS,EAAK3W,KAAK2W,GACVzM,EAAYlK,KAAKkK,UACjBmN,EAAUnN,EAAUmN,QACpBhT,EAAQgT,EAAQtS,QAAQ/E,MAC5BA,KAAKuW,KAAO,KACZvW,KAAKyW,MAAQ,KACbzW,KAAKwW,SAAU,EACfxW,KAAKkK,UAAY,MACF,IAAX7F,GACAgT,EAAQnS,OAAOb,EAAO,GAEhB,MAANsS,IACA3W,KAAK2W,GAAK3W,KAAK4W,eAAe1M,EAAWyM,EAAI,OAEjD3W,KAAK0W,MAAQ,MAEVJ,EAxFqB,CCAJ,SAAU9Q,GAElC,SAAS8R,EAAOpN,EAAWqM,GACvB,OAAO/Q,EAAO7H,KAAKqC,OAASA,KAQhC,OAVA,EAAkBsX,EAAQ9R,GAI1B8R,EAAOlY,UAAU0K,SAAW,SAAU2M,EAAOC,GAIzC,YAHc,IAAVA,IACAA,EAAQ,GAEL1W,MAEJsX,EAXgB,CAYzB,ICfEC,GAA2B,WAC3B,SAASA,EAAUC,EAAiBC,QACpB,IAARA,IACAA,EAAMF,EAAUE,KAEpBzX,KAAKwX,gBAAkBA,EACvBxX,KAAKyX,IAAMA,EASf,OAPAF,EAAUnY,UAAU0K,SAAW,SAAUyM,EAAMG,EAAOD,GAIlD,YAHc,IAAVC,IACAA,EAAQ,GAEL,IAAI1W,KAAKwX,gBAAgBxX,KAAMuW,GAAMzM,SAAS2M,EAAOC,IAEhEa,EAAUE,IAAM,WAAc,OAAOC,KAAKD,OACnCF,EAfmB,GCG1B,GAAgC,SAAU/R,GAE1C,SAASmS,EAAeH,EAAiBC,QACzB,IAARA,IACAA,EAAMF,GAAUE,KAEpB,IAAI9R,EAAQH,EAAO7H,KAAKqC,KAAMwX,GAAiB,WAC3C,OAAIG,EAAeC,UAAYD,EAAeC,WAAajS,EAChDgS,EAAeC,SAASH,MAGxBA,QAETzX,KAIN,OAHA2F,EAAM0R,QAAU,GAChB1R,EAAMqJ,QAAS,EACfrJ,EAAM+F,eAAY/I,EACXgD,EAkCX,OAlDA,EAAkBgS,EAAgBnS,GAkBlCmS,EAAevY,UAAU0K,SAAW,SAAUyM,EAAMG,EAAOD,GAIvD,YAHc,IAAVC,IACAA,EAAQ,GAERiB,EAAeC,UAAYD,EAAeC,WAAa5X,KAChD2X,EAAeC,SAAS9N,SAASyM,EAAMG,EAAOD,GAG9CjR,EAAOpG,UAAU0K,SAASnM,KAAKqC,KAAMuW,EAAMG,EAAOD,IAGjEkB,EAAevY,UAAU2X,MAAQ,SAAUc,GACvC,IAAIR,EAAUrX,KAAKqX,QACnB,GAAIrX,KAAKgP,OACLqI,EAAQ5S,KAAKoT,OADjB,CAIA,IAAIzU,EACJpD,KAAKgP,QAAS,EACd,GACI,GAAI5L,EAAQyU,EAAOZ,QAAQY,EAAOpB,MAAOoB,EAAOnB,OAC5C,YAECmB,EAASR,EAAQhI,SAE1B,GADArP,KAAKgP,QAAS,EACV5L,EAAO,CACP,KAAOyU,EAASR,EAAQhI,SACpBwI,EAAO7T,cAEX,MAAMZ,KAGPuU,EAnDwB,CAoDjCJ,ICpDS,GAAsB,IAAI,GAAe,ICOpD,SAASO,GAAS3P,GACd,IAAI/E,EAAQ+E,EAAG/E,MAAoB+E,EAAGlC,WAC3B7C,MAAMA,GNHlB+S,KAAqBA,GAAmB,IAC3C,IAAI,GAA8B,WAC9B,SAAS4B,EAAaC,EAAMvZ,EAAO2E,GAC/BpD,KAAKgY,KAAOA,EACZhY,KAAKvB,MAAQA,EACbuB,KAAKoD,MAAQA,EACbpD,KAAKuM,SAAoB,MAATyL,EAyDpB,OAvDAD,EAAa3Y,UAAU6Y,QAAU,SAAU/P,GACvC,OAAQlI,KAAKgY,MACT,IAAK,IACD,OAAO9P,EAAS/E,MAAQ+E,EAAS/E,KAAKnD,KAAKvB,OAC/C,IAAK,IACD,OAAOyJ,EAAS9E,OAAS8E,EAAS9E,MAAMpD,KAAKoD,OACjD,IAAK,IACD,OAAO8E,EAAS5E,UAAY4E,EAAS5E,aAGjDyU,EAAa3Y,UAAU8Y,GAAK,SAAU/U,EAAMC,EAAOE,GAE/C,OADWtD,KAAKgY,MAEZ,IAAK,IACD,OAAO7U,GAAQA,EAAKnD,KAAKvB,OAC7B,IAAK,IACD,OAAO2E,GAASA,EAAMpD,KAAKoD,OAC/B,IAAK,IACD,OAAOE,GAAYA,MAG/ByU,EAAa3Y,UAAU+Y,OAAS,SAAUpQ,EAAgB3E,EAAOE,GAC7D,OAAIyE,GAAiD,mBAAxBA,EAAe5E,KACjCnD,KAAKiY,QAAQlQ,GAGb/H,KAAKkY,GAAGnQ,EAAgB3E,EAAOE,IAG9CyU,EAAa3Y,UAAUgZ,aAAe,WAClC,IM7CmBhV,EAAO8G,EN8C1B,OADWlK,KAAKgY,MAEZ,IAAK,IACD,OAAO5N,EAAGpK,KAAKvB,OACnB,IAAK,IACD,OMlDW2E,ENkDOpD,KAAKoD,MM7CxB,IAAI,EAJV8G,EAIqB,SAAUjE,GAAc,OAAOiE,EAAUJ,SAASgO,GAAU,EAAG,CAAE1U,MAAOA,EAAO6C,WAAYA,KAH3F,SAAUA,GAAc,OAAOA,EAAW7C,MAAMA,KNiDlE,IAAK,IACD,OAAO,IAEf,MAAM,IAAIR,MAAM,uCAEpBmV,EAAaM,WAAa,SAAU5Z,GAChC,YAAqB,IAAVA,EACA,IAAIsZ,EAAa,IAAKtZ,GAE1BsZ,EAAaO,4BAExBP,EAAaQ,YAAc,SAAUxV,GACjC,OAAO,IAAIgV,EAAa,SAAKpV,EAAWI,IAE5CgV,EAAaS,eAAiB,WAC1B,OAAOT,EAAaU,sBAExBV,EAAaU,qBAAuB,IAAIV,EAAa,KACrDA,EAAaO,2BAA6B,IAAIP,EAAa,SAAKpV,GACzDoV,EA9DsB,GOJ1B,SAAS,GAAMrB,EAAOxM,QACP,IAAdA,IACAA,EAAY,IAEhB,ICTmBzL,EDUfia,GCVeja,EDSQiY,aCRHgB,OAASiB,OAAOla,IDSPiY,EAAQxM,EAAUuN,MAASnS,KAAKsT,IAAIlC,GACrE,OAAO,SAAU7O,GAAU,OAAOA,EAAOF,KAAK,IAAIkR,GAAcH,EAAUxO,KAE9E,IAAI2O,GAA+B,WAC/B,SAASA,EAAcnC,EAAOxM,GAC1BlK,KAAK0W,MAAQA,EACb1W,KAAKkK,UAAYA,EAKrB,OAHA2O,EAAczZ,UAAUzB,KAAO,SAAUsI,EAAY4B,GACjD,OAAOA,EAAOL,UAAU,IAAI,GAAgBvB,EAAYjG,KAAK0W,MAAO1W,KAAKkK,aAEtE2O,EARuB,GAU9B,GAAiC,SAAUrT,GAE3C,SAASsT,EAAgB9S,EAAa0Q,EAAOxM,GACzC,IAAIvE,EAAQH,EAAO7H,KAAKqC,KAAMgG,IAAgBhG,KAM9C,OALA2F,EAAM+Q,MAAQA,EACd/Q,EAAMuE,UAAYA,EAClBvE,EAAMoT,MAAQ,GACdpT,EAAMqJ,QAAS,EACfrJ,EAAMwR,SAAU,EACTxR,EAkDX,OA1DA,EAAkBmT,EAAiBtT,GAUnCsT,EAAgBhB,SAAW,SAAUrB,GAKjC,IAJA,IAAI5O,EAAS4O,EAAM5O,OACfkR,EAAQlR,EAAOkR,MACf7O,EAAYuM,EAAMvM,UAClBlE,EAAcyQ,EAAMzQ,YACjB+S,EAAMtY,OAAS,GAAMsY,EAAM,GAAGC,KAAO9O,EAAUuN,OAAU,GAC5DsB,EAAM1J,QAAQ4J,aAAahB,QAAQjS,GAEvC,GAAI+S,EAAMtY,OAAS,EAAG,CAClB,IAAIyY,EAAU5T,KAAK6T,IAAI,EAAGJ,EAAM,GAAGC,KAAO9O,EAAUuN,OACpDzX,KAAK8J,SAAS2M,EAAOyC,QAGrBlZ,KAAKgE,cACL6D,EAAOmH,QAAS,GAGxB8J,EAAgB1Z,UAAUga,UAAY,SAAUlP,GAC5ClK,KAAKgP,QAAS,EACIhP,KAAKgG,YACXtB,IAAIwF,EAAUJ,SAASgP,EAAgBhB,SAAU9X,KAAK0W,MAAO,CACrE7O,OAAQ7H,KAAMgG,YAAahG,KAAKgG,YAAakE,UAAWA,MAGhE4O,EAAgB1Z,UAAUia,qBAAuB,SAAUJ,GACvD,IAAqB,IAAjBjZ,KAAKmX,QAAT,CAGA,IAAIjN,EAAYlK,KAAKkK,UACjBtG,EAAU,IAAI0V,GAAapP,EAAUuN,MAAQzX,KAAK0W,MAAOuC,GAC7DjZ,KAAK+Y,MAAMtU,KAAKb,IACI,IAAhB5D,KAAKgP,QACLhP,KAAKoZ,UAAUlP,KAGvB4O,EAAgB1Z,UAAU8G,MAAQ,SAAUzH,GACxCuB,KAAKqZ,qBAAqB,GAAahB,WAAW5Z,KAEtDqa,EAAgB1Z,UAAU+G,OAAS,SAAUpD,GACzC/C,KAAKmX,SAAU,EACfnX,KAAK+Y,MAAQ,GACb/Y,KAAKgG,YAAY5C,MAAML,GACvB/C,KAAKgE,eAET8U,EAAgB1Z,UAAUgH,UAAY,WAClCpG,KAAKqZ,qBAAqB,GAAab,kBACvCxY,KAAKgE,eAEF8U,EA3DyB,CA4DlC,GACEQ,GAA8B,WAK9B,OAJA,SAAsBN,EAAMC,GACxBjZ,KAAKgZ,KAAOA,EACZhZ,KAAKiZ,aAAeA,GAHK,GEnF1B,SAASM,GAAYC,EAAiB5M,GACzC,OAAOA,EAAiBqJ,IAAU,WAAc,OAAOuD,IAAoB5M,GAAkBqJ,IAAU,WAAc,OAAOuD,KCAzH,SAASC,GAAKC,EAAaC,GAC9B,IAAIC,GAAU,EAId,OAHIpZ,UAAUC,QAAU,IACpBmZ,GAAU,GAEP,SAA8B/R,GACjC,OAAOA,EAAOF,KAAK,IAAIkS,GAAaH,EAAaC,EAAMC,KAG/D,IAAIC,GAA8B,WAC9B,SAASA,EAAaH,EAAaC,EAAMC,QACrB,IAAZA,IACAA,GAAU,GAEd5Z,KAAK0Z,YAAcA,EACnB1Z,KAAK2Z,KAAOA,EACZ3Z,KAAK4Z,QAAUA,EAKnB,OAHAC,EAAaza,UAAUzB,KAAO,SAAUsI,EAAY4B,GAChD,OAAOA,EAAOL,UAAU,IAAI,GAAevB,EAAYjG,KAAK0Z,YAAa1Z,KAAK2Z,KAAM3Z,KAAK4Z,WAEtFC,EAZsB,GAc7B,GAAgC,SAAUrU,GAE1C,SAASsU,EAAe9T,EAAa0T,EAAaK,EAAOH,GACrD,IAAIjU,EAAQH,EAAO7H,KAAKqC,KAAMgG,IAAgBhG,KAK9C,OAJA2F,EAAM+T,YAAcA,EACpB/T,EAAMoU,MAAQA,EACdpU,EAAMiU,QAAUA,EAChBjU,EAAMtB,MAAQ,EACPsB,EAkCX,OAzCA,EAAkBmU,EAAgBtU,GASlCtH,OAAOC,eAAe2b,EAAe1a,UAAW,OAAQ,CACpDf,IAAK,WACD,OAAO2B,KAAK+Z,OAEhBC,IAAK,SAAUvb,GACXuB,KAAK4Z,SAAU,EACf5Z,KAAK+Z,MAAQtb,GAEjBL,YAAY,EACZ6b,cAAc,IAElBH,EAAe1a,UAAU8G,MAAQ,SAAUzH,GACvC,GAAKuB,KAAK4Z,QAKN,OAAO5Z,KAAKiP,SAASxQ,GAJrBuB,KAAK2Z,KAAOlb,EACZuB,KAAKgG,YAAY7C,KAAK1E,IAM9Bqb,EAAe1a,UAAU6P,SAAW,SAAUxQ,GAC1C,IACIqM,EADAzG,EAAQrE,KAAKqE,QAEjB,IACIyG,EAAS9K,KAAK0Z,YAAY1Z,KAAK2Z,KAAMlb,EAAO4F,GAEhD,MAAOtB,GACH/C,KAAKgG,YAAY5C,MAAML,GAE3B/C,KAAK2Z,KAAO7O,EACZ9K,KAAKgG,YAAY7C,KAAK2H,IAEnBgP,EA1CwB,CA2CjC,GClEE,GAA6B,SAAUtU,GAEvC,SAAS0U,EAAYhQ,EAAWqM,GAC5B,IAAI5Q,EAAQH,EAAO7H,KAAKqC,KAAMkK,EAAWqM,IAASvW,KAGlD,OAFA2F,EAAMuE,UAAYA,EAClBvE,EAAM4Q,KAAOA,EACN5Q,EA4BX,OAjCA,EAAkBuU,EAAa1U,GAO/B0U,EAAY9a,UAAU0K,SAAW,SAAU2M,EAAOC,GAI9C,YAHc,IAAVA,IACAA,EAAQ,GAERA,EAAQ,EACDlR,EAAOpG,UAAU0K,SAASnM,KAAKqC,KAAMyW,EAAOC,IAEvD1W,KAAK0W,MAAQA,EACb1W,KAAKyW,MAAQA,EACbzW,KAAKkK,UAAU6M,MAAM/W,MACdA,OAEXka,EAAY9a,UAAU6X,QAAU,SAAUR,EAAOC,GAC7C,OAAQA,EAAQ,GAAK1W,KAAKkD,OACtBsC,EAAOpG,UAAU6X,QAAQtZ,KAAKqC,KAAMyW,EAAOC,GAC3C1W,KAAKkX,SAAST,EAAOC,IAE7BwD,EAAY9a,UAAUyX,eAAiB,SAAU3M,EAAWyM,EAAID,GAI5D,YAHc,IAAVA,IACAA,EAAQ,GAEG,OAAVA,GAAkBA,EAAQ,GAAiB,OAAVA,GAAkB1W,KAAK0W,MAAQ,EAC1DlR,EAAOpG,UAAUyX,eAAelZ,KAAKqC,KAAMkK,EAAWyM,EAAID,GAE9DxM,EAAU6M,MAAM/W,OAEpBka,EAlCqB,CAmC9B,ICnCSnB,GAAsB,ICAG,SAAUvT,GAE1C,SAAS2U,IACL,OAAkB,OAAX3U,GAAmBA,EAAO9E,MAAMV,KAAMQ,YAAcR,KAE/D,OAJA,EAAkBma,EAAgB3U,GAI3B2U,EALwB,CAMjC,IDN+B,CAAmB,IEC7C,SAASC,GAAUlQ,EAAWwM,GAIjC,YAHc,IAAVA,IACAA,EAAQ,GAEL,SAAmC7O,GACtC,OAAOA,EAAOF,KAAK,IAAI0S,GAAkBnQ,EAAWwM,KAG5D,IAAI2D,GAAmC,WACnC,SAASA,EAAkBnQ,EAAWwM,QACpB,IAAVA,IACAA,EAAQ,GAEZ1W,KAAKkK,UAAYA,EACjBlK,KAAK0W,MAAQA,EAKjB,OAHA2D,EAAkBjb,UAAUzB,KAAO,SAAUsI,EAAY4B,GACrD,OAAOA,EAAOL,UAAU,IAAI,GAAoBvB,EAAYjG,KAAKkK,UAAWlK,KAAK0W,SAE9E2D,EAX2B,GAclC,GAAqC,SAAU7U,GAE/C,SAAS8U,EAAoBtU,EAAakE,EAAWwM,QACnC,IAAVA,IACAA,EAAQ,GAEZ,IAAI/Q,EAAQH,EAAO7H,KAAKqC,KAAMgG,IAAgBhG,KAG9C,OAFA2F,EAAMuE,UAAYA,EAClBvE,EAAM+Q,MAAQA,EACP/Q,EAsBX,OA9BA,EAAkB2U,EAAqB9U,GAUvC8U,EAAoBxC,SAAW,SAAUyC,GACrC,IAAItB,EAAesB,EAAItB,aAAcjT,EAAcuU,EAAIvU,YACvDiT,EAAahB,QAAQjS,GACrBhG,KAAKgE,eAETsW,EAAoBlb,UAAUob,gBAAkB,SAAUvB,GACpCjZ,KAAKgG,YACXtB,IAAI1E,KAAKkK,UAAUJ,SAASwQ,EAAoBxC,SAAU9X,KAAK0W,MAAO,IAAI+D,GAAiBxB,EAAcjZ,KAAKgG,gBAE9HsU,EAAoBlb,UAAU8G,MAAQ,SAAUzH,GAC5CuB,KAAKwa,gBAAgB,GAAanC,WAAW5Z,KAEjD6b,EAAoBlb,UAAU+G,OAAS,SAAUpD,GAC7C/C,KAAKwa,gBAAgB,GAAajC,YAAYxV,IAC9C/C,KAAKgE,eAETsW,EAAoBlb,UAAUgH,UAAY,WACtCpG,KAAKwa,gBAAgB,GAAahC,kBAClCxY,KAAKgE,eAEFsW,EA/B6B,CAgCtC,GAEEG,GAAkC,WAKlC,OAJA,SAA0BxB,EAAcjT,GACpChG,KAAKiZ,aAAeA,EACpBjZ,KAAKgG,YAAcA,GAHU,GCpDjC,GAA+B,SAAUR,GAEzC,SAASkV,EAAcC,EAAYC,EAAY1Q,QACxB,IAAfyQ,IACAA,EAAahM,OAAOC,wBAEL,IAAfgM,IACAA,EAAajM,OAAOC,mBAExB,IAAIjJ,EAAQH,EAAO7H,KAAKqC,OAASA,KAajC,OAZA2F,EAAMuE,UAAYA,EAClBvE,EAAMkV,QAAU,GAChBlV,EAAMmV,qBAAsB,EAC5BnV,EAAMoV,YAAcJ,EAAa,EAAI,EAAIA,EACzChV,EAAMqV,YAAcJ,EAAa,EAAI,EAAIA,EACrCA,IAAejM,OAAOC,mBACtBjJ,EAAMmV,qBAAsB,EAC5BnV,EAAMxC,KAAOwC,EAAMsV,wBAGnBtV,EAAMxC,KAAOwC,EAAMuV,eAEhBvV,EA4EX,OAjGA,EAAkB+U,EAAelV,GAuBjCkV,EAActb,UAAU6b,uBAAyB,SAAUxc,GACvD,IAAIoc,EAAU7a,KAAK6a,QACnBA,EAAQpW,KAAKhG,GACToc,EAAQpa,OAAST,KAAK+a,aACtBF,EAAQxL,QAEZ7J,EAAOpG,UAAU+D,KAAKxF,KAAKqC,KAAMvB,IAErCic,EAActb,UAAU8b,eAAiB,SAAUzc,GAC/CuB,KAAK6a,QAAQpW,KAAK,IAAI0W,GAAYnb,KAAKob,UAAW3c,IAClDuB,KAAKqb,2BACL7V,EAAOpG,UAAU+D,KAAKxF,KAAKqC,KAAMvB,IAErCic,EAActb,UAAUsI,WAAa,SAAUzB,GAC3C,IAIIrB,EAJAkW,EAAsB9a,KAAK8a,oBAC3BD,EAAUC,EAAsB9a,KAAK6a,QAAU7a,KAAKqb,2BACpDnR,EAAYlK,KAAKkK,UACjBpI,EAAM+Y,EAAQpa,OAElB,GAAIT,KAAKkD,OACL,MAAM,IAAI6F,EAYd,GAVS/I,KAAK+F,WAAa/F,KAAKuJ,SAC5B3E,EAAe,EAAaC,OAG5B7E,KAAKmJ,UAAU1E,KAAKwB,GACpBrB,EAAe,IAAI,EAAoB5E,KAAMiG,IAE7CiE,GACAjE,EAAWvB,IAAIuB,EAAa,IAAI,GAAoBA,EAAYiE,IAEhE4Q,EACA,IAAK,IAAItd,EAAI,EAAGA,EAAIsE,IAAQmE,EAAW/C,OAAQ1F,IAC3CyI,EAAW9C,KAAK0X,EAAQrd,SAI5B,IAASA,EAAI,EAAGA,EAAIsE,IAAQmE,EAAW/C,OAAQ1F,IAC3CyI,EAAW9C,KAAK0X,EAAQrd,GAAGiB,OASnC,OANIuB,KAAKuJ,SACLtD,EAAW7C,MAAMpD,KAAKwJ,aAEjBxJ,KAAK+F,WACVE,EAAW3C,WAERsB,GAEX8V,EAActb,UAAUgc,QAAU,WAC9B,OAAQpb,KAAKkK,WAAa6O,IAAOtB,OAErCiD,EAActb,UAAUic,yBAA2B,WAO/C,IANA,IAAI5D,EAAMzX,KAAKob,UACXL,EAAc/a,KAAK+a,YACnBC,EAAchb,KAAKgb,YACnBH,EAAU7a,KAAK6a,QACfS,EAAcT,EAAQpa,OACtB8a,EAAc,EACXA,EAAcD,KACZ7D,EAAMoD,EAAQU,GAAavC,KAAQgC,IAGxCO,IAQJ,OANID,EAAcP,IACdQ,EAAcjW,KAAK6T,IAAIoC,EAAaD,EAAcP,IAElDQ,EAAc,GACdV,EAAQ3V,OAAO,EAAGqW,GAEfV,GAEJH,EAlGuB,CAmGhC,GAEES,GAA6B,WAK7B,OAJA,SAAqBnC,EAAMva,GACvBuB,KAAKgZ,KAAOA,EACZhZ,KAAKvB,MAAQA,GAHW,GC3GzB,SAAS+c,GAAYC,EAAoBb,EAAY1Q,GACxD,IAAIwR,EAYJ,OAVIA,EADAD,GAAoD,iBAAvBA,EACpBA,EAGA,CACLd,WAAYc,EACZb,WAAYA,EACZe,UAAU,EACVzR,UAAWA,GAGZ,SAAUrC,GAAU,OAAOA,EAAOF,KAE7C,SAA6BQ,GACzB,IACIe,EAEAtE,EAHAyN,EAAKlK,EAAGwS,WAAYA,OAAoB,IAAPtI,EAAgB1D,OAAOC,kBAAoByD,EAAIuJ,EAAKzT,EAAGyS,WAAYA,OAAoB,IAAPgB,EAAgBjN,OAAOC,kBAAoBgN,EAAIC,EAAc1T,EAAGwT,SAAUzR,EAAY/B,EAAG+B,UAE1MyR,EAAW,EAEXpS,GAAW,EACXuS,GAAa,EACjB,OAAO,SAA8BjU,GACjC8T,IACKzS,IAAWK,IACZA,GAAW,EACXL,EAAU,IAAI,GAAcyR,EAAYC,EAAY1Q,GACpDtF,EAAeiD,EAAOL,UAAU,CAC5BrE,KAAM,SAAU1E,GAASyK,EAAQ/F,KAAK1E,IACtC2E,MAAO,SAAUL,GACbwG,GAAW,EACXL,EAAQ9F,MAAML,IAElBO,SAAU,WACNwY,GAAa,EACb5S,EAAQ5F,eAIpB,IAAIkL,EAAWtF,EAAQ1B,UAAUxH,MACjCA,KAAK0E,KAAI,WACLiX,IACAnN,EAASxK,cACLY,IAAiBkX,GAAcD,GAA4B,IAAbF,IAC9C/W,EAAaZ,cACbY,OAAejC,EACfuG,OAAUvG,OAjCwBoZ,CAAoBL,KCZ/D,SAASM,GAAMvd,GAClB,OAAO,SAAUoJ,GAAU,OAAOA,EAAOF,KAAK,IAAIsU,GAAcxd,KAEpE,IAAIwd,GAA+B,WAC/B,SAASA,EAAcxd,GACnBuB,KAAKvB,MAAQA,EAKjB,OAHAwd,EAAc7c,UAAUzB,KAAO,SAAUsI,EAAY4B,GACjD,OAAOA,EAAOL,UAAU,IAAI,GAAgBvB,EAAYjG,KAAKvB,SAE1Dwd,EAPuB,GAS9B,GAAiC,SAAUzW,GAE3C,SAAS0W,EAAgBlW,EAAavH,GAClC,IAAIkH,EAAQH,EAAO7H,KAAKqC,KAAMgG,IAAgBhG,KAE9C,OADA2F,EAAMlH,MAAQA,EACPkH,EAKX,OATA,EAAkBuW,EAAiB1W,GAMnC0W,EAAgB9c,UAAU8G,MAAQ,SAAUtF,GACxCZ,KAAKgG,YAAY7C,KAAKnD,KAAKvB,QAExByd,EAVyB,CAWlC,GCvBK,SAAS1X,KAEZ,IADA,IAAIkL,EAAc,GACTvI,EAAK,EAAGA,EAAK3G,UAAUC,OAAQ0G,IACpCuI,EAAYvI,GAAM3G,UAAU2G,GAEhC,OCLOmI,GAAS,EDKT6M,CAAY/R,EAAG1J,WAAM,EAAQgP,IELjC,SAAS0M,KAEZ,IADA,IAAIpS,EAAQ,GACH7C,EAAK,EAAGA,EAAK3G,UAAUC,OAAQ0G,IACpC6C,EAAM7C,GAAM3G,UAAU2G,GAE1B,IAAI+C,EAAYF,EAAMA,EAAMvJ,OAAS,GACrC,OAAIoJ,EAAYK,IACZF,EAAMM,MACC,SAAUzC,GAAU,OAAOrD,GAAOwF,EAAOnC,EAAQqC,KAGjD,SAAUrC,GAAU,OAAOrD,GAAOwF,EAAOnC,ICXjD,SAASwU,GAAqBC,EAASC,GAC1C,OAAO,SAAU1U,GAAU,OAAOA,EAAOF,KAAK,IAAI6U,GAA6BF,EAASC,KAE5F,IAAIC,GAA8C,WAC9C,SAASA,EAA6BF,EAASC,GAC3Cvc,KAAKsc,QAAUA,EACftc,KAAKuc,YAAcA,EAKvB,OAHAC,EAA6Bpd,UAAUzB,KAAO,SAAUsI,EAAY4B,GAChE,OAAOA,EAAOL,UAAU,IAAI,GAA+BvB,EAAYjG,KAAKsc,QAAStc,KAAKuc,eAEvFC,EARsC,GAU7C,GAAgD,SAAUhX,GAE1D,SAASiX,EAA+BzW,EAAasW,EAASC,GAC1D,IAAI5W,EAAQH,EAAO7H,KAAKqC,KAAMgG,IAAgBhG,KAM9C,OALA2F,EAAM4W,YAAcA,EACpB5W,EAAM+W,QAAS,EACQ,mBAAZJ,IACP3W,EAAM2W,QAAUA,GAEb3W,EAgCX,OAxCA,EAAkB8W,EAAgCjX,GAUlDiX,EAA+Brd,UAAUkd,QAAU,SAAU1b,EAAG+b,GAC5D,OAAO/b,IAAM+b,GAEjBF,EAA+Brd,UAAU8G,MAAQ,SAAUzH,GACvD,IAAIM,EACJ,IACI,IAAIwd,EAAcvc,KAAKuc,YACvBxd,EAAMwd,EAAcA,EAAY9d,GAASA,EAE7C,MAAOsE,GACH,OAAO/C,KAAKgG,YAAY5C,MAAML,GAElC,IAAI+H,GAAS,EACb,GAAI9K,KAAK0c,OACL,IAEI5R,GAASwR,EADKtc,KAAKsc,SACFtc,KAAKjB,IAAKA,GAE/B,MAAOgE,GACH,OAAO/C,KAAKgG,YAAY5C,MAAML,QAIlC/C,KAAK0c,QAAS,EAEb5R,IACD9K,KAAKjB,IAAMA,EACXiB,KAAKgG,YAAY7C,KAAK1E,KAGvBge,EAzCwC,CA0CjD,GCpDF,IC+CMG,GAAQpQ,GAAUqQ,SAAU,oBCjB3B,SAASC,GACdC,EAAkBC,GAElB,YAFkB,IAAAA,MAAA,UAEXA,EAAKC,cAAiBF,SAAapa,EAarC,SAASua,GACdH,EAAkBC,GAElB,YAFkB,IAAAA,MAAA,UAEX5a,MAAM4J,KAAKgR,EAAKG,iBAAoBJ,ICOtC,SAASK,GAAiBC,GAC/B,MAAO,CACLzc,EAAGyc,EAAGC,WACNX,EAAGU,EAAGE,WC9DH,SAAS,KACZ,OAAO,SAAkC1V,GACrC,OAAOA,EAAOF,KAAK,IAAI6V,GAAiB3V,KAGhD,IAAI2V,GAAkC,WAClC,SAASA,EAAiBC,GACtBzd,KAAKyd,YAAcA,EAYvB,OAVAD,EAAiBpe,UAAUzB,KAAO,SAAUsI,EAAY4B,GACpD,IAAI4V,EAAczd,KAAKyd,YACvBA,EAAYC,YACZ,IAAIC,EAAa,IAAI,GAAmB1X,EAAYwX,GAChD7Y,EAAeiD,EAAOL,UAAUmW,GAIpC,OAHKA,EAAWza,SACZya,EAAWC,WAAaH,EAAYI,WAEjCjZ,GAEJ4Y,EAd0B,GAgBjC,GAAoC,SAAUhY,GAE9C,SAASsY,EAAmB9X,EAAayX,GACrC,IAAI9X,EAAQH,EAAO7H,KAAKqC,KAAMgG,IAAgBhG,KAE9C,OADA2F,EAAM8X,YAAcA,EACb9X,EA0BX,OA9BA,EAAkBmY,EAAoBtY,GAMtCsY,EAAmB1e,UAAU+E,aAAe,WACxC,IAAIsZ,EAAczd,KAAKyd,YACvB,GAAKA,EAAL,CAIAzd,KAAKyd,YAAc,KACnB,IAAI9B,EAAW8B,EAAYC,UAC3B,GAAI/B,GAAY,EACZ3b,KAAK4d,WAAa,UAItB,GADAH,EAAYC,UAAY/B,EAAW,EAC/BA,EAAW,EACX3b,KAAK4d,WAAa,SADtB,CAIA,IAAIA,EAAa5d,KAAK4d,WAClBG,EAAmBN,EAAYO,YACnChe,KAAK4d,WAAa,MACdG,GAAsBH,GAAcG,IAAqBH,GACzDG,EAAiB/Z,oBAlBjBhE,KAAK4d,WAAa,MAqBnBE,EA/B4B,CAgCrC,GCjDE,GAAuC,SAAUtY,GAEjD,SAASyY,EAAsBpW,EAAQqW,GACnC,IAAIvY,EAAQH,EAAO7H,KAAKqC,OAASA,KAKjC,OAJA2F,EAAMkC,OAASA,EACflC,EAAMuY,eAAiBA,EACvBvY,EAAM+X,UAAY,EAClB/X,EAAMwY,aAAc,EACbxY,EA6BX,OApCA,EAAkBsY,EAAuBzY,GASzCyY,EAAsB7e,UAAUsI,WAAa,SAAUzB,GACnD,OAAOjG,KAAKoe,aAAa5W,UAAUvB,IAEvCgY,EAAsB7e,UAAUgf,WAAa,WACzC,IAAIlV,EAAUlJ,KAAKqe,SAInB,OAHKnV,IAAWA,EAAQnD,YACpB/F,KAAKqe,SAAWre,KAAKke,kBAElBle,KAAKqe,UAEhBJ,EAAsB7e,UAAUye,QAAU,WACtC,IAAID,EAAa5d,KAAKge,YAWtB,OAVKJ,IACD5d,KAAKme,aAAc,GACnBP,EAAa5d,KAAKge,YAAc,IAAI,GACzBtZ,IAAI1E,KAAK6H,OACfL,UAAU,IAAI,GAAsBxH,KAAKoe,aAAcpe,QACxD4d,EAAW1a,SACXlD,KAAKge,YAAc,KACnBJ,EAAa,EAAa/Y,QAG3B+Y,GAEXK,EAAsB7e,UAAUuc,SAAW,WACvC,OAAO,KAAsB3b,OAE1Bie,EArC+B,CAsCxC,GAESK,GAAgD,WACvD,IAAIC,EAAmB,GAAsBnf,UAC7C,MAAO,CACHwI,SAAU,CAAEnJ,MAAO,MACnBif,UAAW,CAAEjf,MAAO,EAAG+f,UAAU,GACjCH,SAAU,CAAE5f,MAAO,KAAM+f,UAAU,GACnCR,YAAa,CAAEvf,MAAO,KAAM+f,UAAU,GACtC9W,WAAY,CAAEjJ,MAAO8f,EAAiB7W,YACtCyW,YAAa,CAAE1f,MAAO8f,EAAiBJ,YAAaK,UAAU,GAC9DJ,WAAY,CAAE3f,MAAO8f,EAAiBH,YACtCP,QAAS,CAAEpf,MAAO8f,EAAiBV,SACnClC,SAAU,CAAEld,MAAO8f,EAAiB5C,WAXe,GAcvD,GAAuC,SAAUnW,GAEjD,SAASiZ,EAAsBzY,EAAayX,GACxC,IAAI9X,EAAQH,EAAO7H,KAAKqC,KAAMgG,IAAgBhG,KAE9C,OADA2F,EAAM8X,YAAcA,EACb9X,EAwBX,OA5BA,EAAkB8Y,EAAuBjZ,GAMzCiZ,EAAsBrf,UAAU+G,OAAS,SAAUpD,GAC/C/C,KAAKmE,eACLqB,EAAOpG,UAAU+G,OAAOxI,KAAKqC,KAAM+C,IAEvC0b,EAAsBrf,UAAUgH,UAAY,WACxCpG,KAAKyd,YAAYU,aAAc,EAC/Bne,KAAKmE,eACLqB,EAAOpG,UAAUgH,UAAUzI,KAAKqC,OAEpCye,EAAsBrf,UAAU+E,aAAe,WAC3C,IAAIsZ,EAAczd,KAAKyd,YACvB,GAAIA,EAAa,CACbzd,KAAKyd,YAAc,KACnB,IAAIG,EAAaH,EAAYO,YAC7BP,EAAYC,UAAY,EACxBD,EAAYY,SAAW,KACvBZ,EAAYO,YAAc,KACtBJ,GACAA,EAAW5Z,gBAIhBya,EA7B+B,CA8BxC,GCrEF,IAAIC,GAAmC,WACnC,SAASA,EAAkBR,EAAgBnB,GACvC/c,KAAKke,eAAiBA,EACtBle,KAAK+c,SAAWA,EASpB,OAPA2B,EAAkBtf,UAAUzB,KAAO,SAAUsI,EAAY4B,GACrD,IAAIkV,EAAW/c,KAAK+c,SAChB7T,EAAUlJ,KAAKke,iBACftZ,EAAemY,EAAS7T,GAAS1B,UAAUvB,GAE/C,OADArB,EAAaF,IAAImD,EAAOL,UAAU0B,IAC3BtE,GAEJ8Z,EAZ2B,GClBtC,SAASC,KACL,OAAO,IAAI,EAER,SAASC,KACZ,OAAO,SAAU/W,GAAU,OAAO,MDNZgX,ECMiCF,GDLhD,SAAmC9W,GACtC,IAAIqW,EASJ,GAPIA,EADmC,mBAA5BW,EACUA,EAGA,WACb,OAAOA,GAGS,mBAAb9B,EACP,OAAOlV,EAAOF,KAAK,IAAI+W,GAAkBR,EAAgBnB,IAE7D,IAAIU,EAAcvf,OAAOY,OAAO+I,EAAQyW,IAGxC,OAFAb,EAAY5V,OAASA,EACrB4V,EAAYS,eAAiBA,EACtBT,ICXiE5V,IDNzE,IAAmBgX,EAAyB9B,GE8BnD,IAAM+B,GAActS,GAA2B/M,OAAQ,cAKjDsf,GAAYvS,GAAyB/M,OAAQ,YCD5C,SAASuf,GAAWC,GACzB,IAAMC,EAAQC,WAAWF,GACzB,OCjCK,SAASG,EAAiBC,EAAYC,EAAe1S,GACxD,OAAIA,EACOwS,EAAiBC,EAAYC,GAAerY,KAAKpD,GAAI,SAAUwG,GAAQ,OAAO9G,EAAQ8G,GAAQuC,EAAelM,WAAM,EAAQ2J,GAAQuC,EAAevC,OAEtJ,IAAI,GAAW,SAAUpE,GAC5B,IAOIsZ,EAPAxS,EAAU,WAEV,IADA,IAAI7M,EAAI,GACCiH,EAAK,EAAGA,EAAK3G,UAAUC,OAAQ0G,IACpCjH,EAAEiH,GAAM3G,UAAU2G,GAEtB,OAAOlB,EAAW9C,KAAkB,IAAbjD,EAAEO,OAAeP,EAAE,GAAKA,IAGnD,IACIqf,EAAWF,EAAWtS,GAE1B,MAAOhK,GAEH,YADAkD,EAAW7C,MAAML,GAGrB,GAAKP,EAAW8c,GAGhB,OAAO,WAAc,OAAOA,EAAcvS,EAASwS,ODUlDH,EAA0B,SAAAjc,GAC/B,OAAA+b,EAAM1R,aAAY,WAAM,OAAArK,EAAK+b,EAAMM,eAElCvY,KACCmV,GAAU8C,EAAMM,SAChBhE,GAAY,IEXlB,IAAM,GAAUhP,GAAmB/M,OAAQ,UAKrCggB,GAAUjT,GAAmB/M,OAAQ,UA+BpC,SAASigB,KACd,MAAO,CACL9e,EAAG+e,YACHhD,EAAGiD,aASA,SAASC,KACd,MAAO,CACLC,MAAQC,WACRC,OAAQC,aC/EL,IAAIC,GAAwB,CAC/BC,SAAS,EACTC,UAAU,GAQd,IAAIC,GAAkC,WAClC,SAASA,EAAiBC,EAAkBH,EAASC,GACjDpgB,KAAKsgB,iBAAmBA,EACxBtgB,KAAKmgB,QAAUA,EACfngB,KAAKogB,SAAWA,EAKpB,OAHAC,EAAiBjhB,UAAUzB,KAAO,SAAUsI,EAAY4B,GACpD,OAAOA,EAAOL,UAAU,IAAI,GAAmBvB,EAAYjG,KAAKsgB,iBAAkBtgB,KAAKmgB,QAASngB,KAAKogB,YAElGC,EAT0B,GAWjC,GAAoC,SAAU7a,GAE9C,SAAS+a,EAAmBva,EAAasa,EAAkBE,EAAUC,GACjE,IAAI9a,EAAQH,EAAO7H,KAAKqC,KAAMgG,IAAgBhG,KAM9C,OALA2F,EAAMK,YAAcA,EACpBL,EAAM2a,iBAAmBA,EACzB3a,EAAM6a,SAAWA,EACjB7a,EAAM8a,UAAYA,EAClB9a,EAAM+a,WAAY,EACX/a,EAsDX,OA9DA,EAAkB4a,EAAoB/a,GAUtC+a,EAAmBnhB,UAAU8G,MAAQ,SAAUzH,GAC3CuB,KAAK0gB,WAAY,EACjB1gB,KAAK2gB,WAAaliB,EACbuB,KAAK4gB,aACF5gB,KAAKwgB,SACLxgB,KAAKkS,OAGLlS,KAAK6gB,SAASpiB,KAI1B8hB,EAAmBnhB,UAAU8S,KAAO,WAChC,IAAewO,EAAN1gB,KAAqB0gB,UAAWC,EAAhC3gB,KAAgD2gB,WACrDD,IACA1gB,KAAKgG,YAAY7C,KAAKwd,GACtB3gB,KAAK6gB,SAASF,IAElB3gB,KAAK0gB,WAAY,EACjB1gB,KAAK2gB,WAAa,MAEtBJ,EAAmBnhB,UAAUyhB,SAAW,SAAUpiB,GAC9C,IAAIqiB,EAAW9gB,KAAK+gB,oBAAoBtiB,GAClCqiB,GACF9gB,KAAK0E,IAAI1E,KAAK4gB,WAAazS,GAAkBnO,KAAM8gB,KAG3DP,EAAmBnhB,UAAU2hB,oBAAsB,SAAUtiB,GACzD,IACI,OAAOuB,KAAKsgB,iBAAiB7hB,GAEjC,MAAOsE,GAEH,OADA/C,KAAKgG,YAAY5C,MAAML,GAChB,OAGfwd,EAAmBnhB,UAAU4hB,eAAiB,WAC1C,IAAeJ,EAAN5gB,KAAsB4gB,WAAYH,EAAlCzgB,KAAiDygB,UACtDG,GACAA,EAAW5c,cAEfhE,KAAK4gB,WAAa,KACdH,GACAzgB,KAAKkS,QAGbqO,EAAmBnhB,UAAU4O,WAAa,SAAUF,EAAYQ,EAAYP,EAAYQ,EAAYC,GAChGxO,KAAKghB,kBAETT,EAAmBnhB,UAAU8O,eAAiB,WAC1ClO,KAAKghB,kBAEFT,EA/D4B,CAgErC,ICvBK,SAASU,GACdC,EAAgB,G,ID3DOZ,EAAkB5E,EC2DvByF,EAAA,EAAAA,MAIZC,EAAQ5U,GAAU0U,EAAQ,WAC7Bja,KACCuO,GAAgB,QAChBoJ,MAIJ,OAAOuC,EACJla,MDvEoBqZ,ECwEV,WAAM,OAAAc,QDvEF,KADwB1F,ECwEf,CAAEyE,SAAS,EAAMC,UAAU,MDtE/C1E,EAASwE,IAEN,SAAUrY,GAAU,OAAOA,EAAOF,KAAK,IAAI0Y,GAAiBC,EAAkB5E,EAAOyE,QAASzE,EAAO0E,aCqE1GlL,IAAI,SAAAtR,GAAW,OAAAsd,EAAOG,YAAYzd,MAClC2V,GAAY6H,GACZxC,MChFN,IAAI,GAAsC,SAAUpZ,GAEhD,SAAS8b,EAAqBpX,EAAWqM,GACrC,IAAI5Q,EAAQH,EAAO7H,KAAKqC,KAAMkK,EAAWqM,IAASvW,KAGlD,OAFA2F,EAAMuE,UAAYA,EAClBvE,EAAM4Q,KAAOA,EACN5Q,EAyBX,OA9BA,EAAkB2b,EAAsB9b,GAOxC8b,EAAqBliB,UAAUyX,eAAiB,SAAU3M,EAAWyM,EAAID,GAIrE,YAHc,IAAVA,IACAA,EAAQ,GAEE,OAAVA,GAAkBA,EAAQ,EACnBlR,EAAOpG,UAAUyX,eAAelZ,KAAKqC,KAAMkK,EAAWyM,EAAID,IAErExM,EAAUmN,QAAQ5S,KAAKzE,MAChBkK,EAAUwB,YAAcxB,EAAUwB,UAAY6V,uBAAsB,WAAc,OAAOrX,EAAU6M,MAAM,YAEpHuK,EAAqBliB,UAAUwX,eAAiB,SAAU1M,EAAWyM,EAAID,GAIrE,QAHc,IAAVA,IACAA,EAAQ,GAEG,OAAVA,GAAkBA,EAAQ,GAAiB,OAAVA,GAAkB1W,KAAK0W,MAAQ,EACjE,OAAOlR,EAAOpG,UAAUwX,eAAejZ,KAAKqC,KAAMkK,EAAWyM,EAAID,GAEpC,IAA7BxM,EAAUmN,QAAQ5W,SAClB+gB,qBAAqB7K,GACrBzM,EAAUwB,eAAY/I,IAIvB2e,EA/B8B,CAgCvC,IChCSG,GAA+B,ICAG,SAAUjc,GAEnD,SAASkc,IACL,OAAkB,OAAXlc,GAAmBA,EAAO9E,MAAMV,KAAMQ,YAAcR,KAuB/D,OAzBA,EAAkB0hB,EAAyBlc,GAI3Ckc,EAAwBtiB,UAAU2X,MAAQ,SAAUc,GAChD7X,KAAKgP,QAAS,EACdhP,KAAK0L,eAAY/I,EACjB,IACIS,EADAiU,EAAUrX,KAAKqX,QAEfhT,GAAS,EACTwG,EAAQwM,EAAQ5W,OACpBoX,EAASA,GAAUR,EAAQhI,QAC3B,GACI,GAAIjM,EAAQyU,EAAOZ,QAAQY,EAAOpB,MAAOoB,EAAOnB,OAC5C,cAEGrS,EAAQwG,IAAUgN,EAASR,EAAQhI,UAE9C,GADArP,KAAKgP,QAAS,EACV5L,EAAO,CACP,OAASiB,EAAQwG,IAAUgN,EAASR,EAAQhI,UACxCwI,EAAO7T,cAEX,MAAMZ,IAGPse,EA1BiC,CA2B1C,ID3BwC,CAA4B,IEC/D,SAASC,GAASC,GACrB,OAAO,SAAU/Z,GAAU,OAAOA,EAAOF,KAAK,IAAIka,GAAgBD,KAEtE,ICwBIE,GDxBAD,GAAiC,WACjC,SAASA,EAAgBD,GACrB5hB,KAAK4hB,SAAWA,EAKpB,OAHAC,EAAgBziB,UAAUzB,KAAO,SAAUsI,EAAY4B,GACnD,OAAOA,EAAOL,UAAU,IAAI,GAAkBvB,EAAYjG,KAAK4hB,YAE5DC,EAPyB,GAShC,GAAmC,SAAUrc,GAE7C,SAASuc,EAAkB/b,EAAa4b,GACpC,IAAIjc,EAAQH,EAAO7H,KAAKqC,KAAMgG,IAAgBhG,KAE9C,OADA2F,EAAMjB,IAAI,IAAI,EAAakd,IACpBjc,EAEX,OANA,EAAkBoc,EAAmBvc,GAM9Buc,EAP2B,CAQpC,GEQK,SAASC,GACd3E,EAAiB5e,GAEjB4e,EAAG4E,aAAa,gBAAiBxjB,EAAQ,OAAS,IAQ7C,SAASyjB,GACd7E,GAEAA,EAAG8E,gBAAgB,iBAWd,SAASC,GACd/E,EAAiB5e,GAEjB4e,EAAGgF,UAAUC,OAAO,uBAAwB7jB,GAQvC,SAAS8jB,GACdlF,GAEAA,EAAGgF,UAAUje,OAAO,wBCRf,SAASoe,GACdnF,EAAiBoF,GAEjBpF,EAAGqF,YAAYD,GCnBV,SAASE,GACdtF,EAAiBuF,GAEjB,YAFiB,IAAAA,MAAA,GAEV3b,EACLpD,GAAI,SAAC,GAAU,OAAR,EAAA8Y,GAAaiG,KACpBvG,KAGAjC,GAAUqH,IACVvM,IAAI,SAAAzW,ICxBD,SACL4e,EAAiB5e,GAEjB4e,EAAG4E,aAAa,gBAAiBxjB,EAAQ,SAAW,IDsBhDokB,CAAUxF,EAAI5e,MAIhBkjB,IAAS,YClBN,SACLtE,GAEAA,EAAG8E,gBAAgB,iBDgBfW,CAAYzF,OHjBX,SAAS0F,GAAStkB,EAAeQ,GACtC,IAAIzB,EAAIyB,EACR,GAAIR,EAAMgC,OAASjD,EAAG,CACpB,KAAoB,MAAbiB,EAAMjB,MAAgBA,EAAI,IACjC,OAAUiB,EAAMoU,UAAU,EAAGrV,GAAE,MAEjC,OAAOiB,EAWF,SAASukB,GAAUjkB,EAAaN,GACrC,QAAoB,IAATqjB,GAAsB,CAC/B,IAAMzE,EAAKP,GAAW,WACtBgF,GAAO/O,KAAK2B,MAAM2I,EAAG4F,WAEvB,QAAyB,IAAdnB,GAAK/iB,GACd,MAAM,IAAImkB,eAAe,wBAAwBnkB,GAEnD,YAAwB,IAAVN,EACVqjB,GAAK/iB,GAAKokB,QAAQ,IAAK1kB,GACvBqjB,GAAK/iB,G,kgBKtBJ,SAASqkB,GACd/F,GAEA,OCjDoBgG,EDiDP,WACX,IAAMC,EAC8B,WADrBC,iBAAiBlG,GAC7BmG,iBAAiB,YAGpB,OAAOpZ,EAAG,CACRkZ,OAAM,EACNtD,OAAQsD,EAASjG,EAAGoG,aAAe,KCvD9B,IAAI,GAAW,SAAUxd,GAC5B,IAAIoB,EACJ,IACIA,EAAQgc,IAEZ,MAAOtgB,GAEH,YADAkD,EAAW7C,MAAML,GAIrB,OADasE,EAAQ2E,GAAK3E,GAAS,KACrBG,UAAUvB,MAXzB,IAAeod,ECGtB,IAAIK,GAAO,GACJ,SAASC,KAEZ,IADA,IAAIjU,EAAc,GACTvI,EAAK,EAAGA,EAAK3G,UAAUC,OAAQ0G,IACpCuI,EAAYvI,GAAM3G,UAAU2G,GAEhC,IAAIyF,EAAiB,KACjB1C,EAAY,KAUhB,OATIL,EAAY6F,EAAYA,EAAYjP,OAAS,MAC7CyJ,EAAYwF,EAAYpF,OAEuB,mBAAxCoF,EAAYA,EAAYjP,OAAS,KACxCmM,EAAiB8C,EAAYpF,OAEN,IAAvBoF,EAAYjP,QAAgB8C,EAAQmM,EAAY,MAChDA,EAAcA,EAAY,IAEvBvF,EAAUuF,EAAaxF,GAAWvC,KAAK,IAAIic,GAAsBhX,IAE5E,IAAIgX,GAAuC,WACvC,SAASA,EAAsBhX,GAC3B5M,KAAK4M,eAAiBA,EAK1B,OAHAgX,EAAsBxkB,UAAUzB,KAAO,SAAUsI,EAAY4B,GACzD,OAAOA,EAAOL,UAAU,IAAI,GAAwBvB,EAAYjG,KAAK4M,kBAElEgX,EAP+B,GAUtC,GAAyC,SAAUpe,GAEnD,SAASqe,EAAwB7d,EAAa4G,GAC1C,IAAIjH,EAAQH,EAAO7H,KAAKqC,KAAMgG,IAAgBhG,KAK9C,OAJA2F,EAAMiH,eAAiBA,EACvBjH,EAAMqJ,OAAS,EACfrJ,EAAMwG,OAAS,GACfxG,EAAM+J,YAAc,GACb/J,EAqDX,OA5DA,EAAkBke,EAAyBre,GAS3Cqe,EAAwBzkB,UAAU8G,MAAQ,SAAUa,GAChD/G,KAAKmM,OAAO1H,KAAKif,IACjB1jB,KAAK0P,YAAYjL,KAAKsC,IAE1B8c,EAAwBzkB,UAAUgH,UAAY,WAC1C,IAAIsJ,EAAc1P,KAAK0P,YACnB5N,EAAM4N,EAAYjP,OACtB,GAAY,IAARqB,EACA9B,KAAKgG,YAAY1C,eAEhB,CACDtD,KAAKgP,OAASlN,EACd9B,KAAK8jB,UAAYhiB,EACjB,IAAK,IAAItE,EAAI,EAAGA,EAAIsE,EAAKtE,IAAK,CAC1B,IAAIuJ,EAAa2I,EAAYlS,GAC7BwC,KAAK0E,IAAIyJ,GAAkBnO,KAAM+G,EAAYA,EAAYvJ,OAIrEqmB,EAAwBzkB,UAAU8O,eAAiB,SAAU6V,GAC9B,IAAtB/jB,KAAKgP,QAAU,IAChBhP,KAAKgG,YAAY1C,YAGzBugB,EAAwBzkB,UAAU4O,WAAa,SAAUF,EAAYQ,EAAYP,EAAYQ,EAAYC,GACrG,IAAIrC,EAASnM,KAAKmM,OACd6X,EAAS7X,EAAO4B,GAChB+V,EAAa9jB,KAAK8jB,UAEhBE,IAAWN,KAAS1jB,KAAK8jB,UAAY9jB,KAAK8jB,UAD1C,EAEN3X,EAAO4B,GAAcO,EACH,IAAdwV,IACI9jB,KAAK4M,eACL5M,KAAKikB,mBAAmB9X,GAGxBnM,KAAKgG,YAAY7C,KAAKgJ,EAAOzC,WAIzCma,EAAwBzkB,UAAU6kB,mBAAqB,SAAU9X,GAC7D,IAAIrB,EACJ,IACIA,EAAS9K,KAAK4M,eAAelM,MAAMV,KAAMmM,GAE7C,MAAOpJ,GAEH,YADA/C,KAAKgG,YAAY5C,MAAML,GAG3B/C,KAAKgG,YAAY7C,KAAK2H,IAEnB+Y,EA7DiC,CA8D1C,I,2RCrCK,SAASK,GACd7G,EAAiB,EAAqB,G,IAAnB8G,EAAA,EAAAA,SAAqBC,EAAA,EAAAA,QAIlCC,EAAUF,EAASG,MACtBrd,KACCsS,GAAY6K,GACZvgB,GAAI,SAAC,G,IAAEmc,EAAA,EAAAA,OAAa,OAAA3C,EAAGkH,UAAYvE,KACnC3D,MAIJ,OAAOsH,GAAc,CAACQ,EAASK,QAASH,IACrCpd,KACCpD,GAAI,SAAC,G,IAAA,UAAC,OAAsB,OAAGjD,EAAvB,EAAAA,EAA0B+b,EAAvB,EAAAA,EAAK,SAChBnB,GAAY,IC5BX,SAASiJ,GACdpH,GAEA,OAAOpW,GClD+BlI,EDmDZ,SClDjBsd,IAAqB,SAAUzb,EAAG+b,GAAK,OAAOL,EAAUA,EAAQ1b,EAAE7B,GAAM4d,EAAE5d,IAAQ6B,EAAE7B,KAAS4d,EAAE5d,ODqDtGqb,GAAUqH,IACVvM,IAAI,SAAC,G,IAAElG,EAAA,EAAAA,QEzBJ,SACLqO,EAAiB5e,GAEjB4e,EAAG4E,aAAa,gBAAiBxjB,EAAQ,SAAW,IFuBhDimB,CAAgBrH,EAAIrO,MAItB2S,IAAS,YEnBN,SACLtE,GAEAA,EAAG8E,gBAAgB,iBFiBfwC,CAAkBtH,OC7DjB,IAAiCte,EAAKud,E,sTEkD7C,SAASoG,GAAYrF,EAAiBoF,G,QAGpC,GAAqB,iBAAVA,GAAuC,iBAAVA,EACtCpF,EAAGuH,WAAanC,EAAMzhB,gBAGjB,GAAIyhB,aAAiBoC,KAC1BxH,EAAGqF,YAAYD,QAGV,GAAIrgB,MAAMmB,QAAQkf,G,IACvB,IAAmB,SAAAA,GAAK,+BACtBC,GAAYrF,EADC,U,kGAkBZ,SAASyH,GACdC,EAAaC,G,gBACb,oDAEA,IAAM3H,EAAKR,SAASoI,cAAcF,GAGlC,GAAIC,E,IACF,IAAmB,WAAKA,IAAW,+BAA9B,IAAME,EAAI,QACmB,kBAArBF,EAAWE,GACpB7H,EAAG4E,aAAaiD,EAAMF,EAAWE,IAC1BF,EAAWE,IAClB7H,EAAG4E,aAAaiD,EAAM,K,qGAG5B,IAAoB,SAAAC,GAAQ,+BAC1BzC,GAAYrF,EADE,U,iGAIhB,OAAOA,EC9FT,IAAI,GAAmC,WACnC,SAAS+H,EAAkBC,GACvBrlB,KAAKqlB,SAAWA,EAWpB,OATAD,EAAkBhmB,UAAUzB,KAAO,SAAUsI,EAAY4B,GACrD,IAAIyd,EAAsB,IAAI,GAAoBrf,GAC9Csf,EAAuBpX,GAAkBmX,EAAqBtlB,KAAKqlB,UACvE,OAAIE,IAAyBD,EAAoBE,WAC7CF,EAAoB5gB,IAAI6gB,GACjB1d,EAAOL,UAAU8d,IAErBA,GAEJF,EAb2B,GAelC,GAAqC,SAAU5f,GAE/C,SAASigB,EAAoBzf,GACzB,IAAIL,EAAQH,EAAO7H,KAAKqC,KAAMgG,IAAgBhG,KAE9C,OADA2F,EAAM6f,WAAY,EACX7f,EAQX,OAZA,EAAkB8f,EAAqBjgB,GAMvCigB,EAAoBrmB,UAAU4O,WAAa,SAAUF,EAAYQ,EAAYP,EAAYQ,EAAYC,GACjGxO,KAAKwlB,WAAY,EACjBxlB,KAAKsD,YAETmiB,EAAoBrmB,UAAU8O,eAAiB,aAExCuX,EAb6B,CActC,I,2RCeK,SAASC,GACdC,EAA8Bnb,GAE9B,IAAMob,EAASD,EAAQ1e,KAAK6N,IAAO,SAAArW,GAAU,OAAAA,MACvConB,EAASF,EAAQ1e,KAAK6N,IAAO,SAAArW,GAAS,OAACA,MAC7C,OAAOwI,EACLgP,IAAU,SAAAxX,GAAS,OAAAklB,GAAc,CAACvZ,EAAG3L,GAAQmnB,OAC7C3P,IAAU,SAAC,G,IDtDWoP,ECsDX,UAAC5mB,EAAA,KAAmB,OAAZ,KACf+L,EAAQ/L,GACLwI,MDxDeoe,ECyDJQ,EDxDX,SAAUhe,GAAU,OAAOA,EAAOF,KAAK,IAAI,GAAkB0d,OC0DhExgB,MC6BD,SAASihB,GACdC,EAAcpZ,GAGd,OAAO1F,EACLye,GAFM,EAAAxG,MAEY8G,SAAS,SAAA3I,GAAM,OAhC9B,SACLA,EAAiB0I,EAAc,GAU/B,OANgB7B,GAA6B7G,EAAI0I,EAAO,CAAE3B,QAJzB,EAAAA,UAK9Bnd,KACC0b,GAAYtF,EAAI,KAKjBpW,KACCpD,GAAI,SAAAoiB,GAAU,OAAGA,OAAM,OAmBQC,CAAU7I,EAAI0I,EAAOpZ,MACtD6O,GAAY,I,+RCiCT,SAAS2K,GACdJ,EAAcpZ,GAEd,OAAO1F,EACLgP,IAAU,SAAAoH,GAAM,OA3Db,SACLA,EAAiB,EAAqB,G,IAAnB8G,EAAA,EAAAA,SAIbE,EAJkC,EAAAD,QAKrCnd,KACCuO,GAAM,WAIJ4Q,EAAUzC,GAAc,CAC5BQ,EAASK,QACTL,EAASG,MACTD,IAECpd,KACCpD,GAAI,SAAC,G,IAAA,UAAG8Y,EAAA,KAAAA,EAAOqD,EAAA,KAAAA,OAAUqG,EAAA,KACjBC,EAASjJ,EAAGkH,UACZgC,EAASlJ,EAAGoG,aAAe6C,EACjC,OAAOtG,EACH1a,KAAK6T,IAAI,EAAGmN,EAAS3J,EAAI0J,GACzB/gB,KAAK6T,IAAI,EAAG6G,EAASrD,EAAI4J,MAE/BlK,MAIEmK,EAAU7C,GAAc,CAACQ,EAASK,QAASH,IAC9Cpd,KACCpD,GAAI,SAAC,G,IAAA,UAAG8Y,EAAA,KAAAA,EAAK0J,EAAA,KAAY,OAAA1J,GAAKU,EAAGkH,UAAY8B,KAC7ChK,MAIJ,OAAOsH,GAAc,CAACyC,EAAS/B,EAASmC,IACrCvf,KACCpD,GAAI,SAAC,G,IAAA,UAACmc,EAAA,KAAQqG,EAAA,KAAQrX,EAAA,KAAY,OAChC4T,OAAQvF,EAAGkH,UAAY8B,EACvBrG,OAAM,EACNhR,OAAM,OAmBMyX,CAAUpJ,EAAI0I,EAAOpZ,MACrC6O,GAAY,IC7HD,SAASkL,GAAQpmB,GAC9B,OAAO,SAASqmB,EAAGvmB,EAAG6B,GACpB,OAAQzB,UAAUC,QAChB,KAAK,EACH,OAAOkmB,EACT,KAAK,EACH,OAAOxmB,EAAeC,GAAKumB,EAAKtmB,GAAQ,SAAUgS,GAChD,OAAO/R,EAAGF,EAAGiS,MAEjB,QACE,OAAOlS,EAAeC,IAAMD,EAAe8B,GAAK0kB,EAAKxmB,EAAeC,GAAKC,GAAQ,SAAU8H,GACzF,OAAO7H,EAAG6H,EAAIlG,MACX9B,EAAe8B,GAAK5B,GAAQ,SAAUgS,GACzC,OAAO/R,EAAGF,EAAGiS,MACV/R,EAAGF,EAAG6B,KCzBJ,SAAS2kB,GAAmBC,GAGzC,IAFA,IACI1jB,EADA7B,EAAO,KAEF6B,EAAO0jB,EAAK1jB,QAAQqI,MAC3BlK,EAAKmD,KAAKtB,EAAK1E,OAEjB,OAAO6C,ECNM,SAASwlB,GAAcC,EAAMnmB,EAAGU,GAI7C,IAHA,IAAIE,EAAM,EACNM,EAAMR,EAAKb,OAERe,EAAMM,GAAK,CAChB,GAAIilB,EAAKnmB,EAAGU,EAAKE,IACf,OAAO,EAETA,GAAO,EAET,OAAO,ECGM,8CAZf,SAAmBpB,EAAG6B,GAEpB,OAAI7B,IAAM6B,EAGK,IAAN7B,GAAW,EAAIA,GAAM,EAAI6B,EAGzB7B,GAAMA,GAAK6B,GAAMA,GCqBb,GAHS5B,GAAQ,SAAc2mB,GAC5C,OAAe,OAARA,EAAe,YAAiBrkB,IAARqkB,EAAoB,YAAc9oB,OAAOkB,UAAU4B,SAASrD,KAAKqpB,GAAKtd,MAAM,GAAI,MCTjH,SAASud,GAAmBC,EAAWC,EAAWC,EAAQC,GACxD,IAAIjnB,EAAIwmB,GAAmBM,GAG3B,SAASI,EAAGnf,EAAIkK,GACd,OAAOkV,GAAQpf,EAAIkK,EAAI+U,EAAO1d,QAAS2d,EAAO3d,SAIhD,OAAQod,IAAc,SAAU7kB,EAAGulB,GACjC,OAAQV,GAAcQ,EAAIE,EAAOvlB,KAR3B2kB,GAAmBO,GASrB/mB,GAGO,SAASmnB,GAAQnnB,EAAG6B,EAAGmlB,EAAQC,GAC5C,GAAI,GAAUjnB,EAAG6B,GACf,OAAO,EAGT,ICtCoCwlB,EAEhCC,EDoCAC,EAAQ,GAAKvnB,GAEjB,GAAIunB,IAAU,GAAK1lB,GACjB,OAAO,EAGT,GAAS,MAAL7B,GAAkB,MAAL6B,EACf,OAAO,EAGT,GAAwC,mBAA7B7B,EAAE,wBAA6E,mBAA7B6B,EAAE,uBAC7D,MAA2C,mBAA7B7B,EAAE,wBAAyCA,EAAE,uBAAuB6B,IAA0C,mBAA7BA,EAAE,wBAAyCA,EAAE,uBAAuB7B,GAGrK,GAAwB,mBAAbA,EAAEwnB,QAA6C,mBAAb3lB,EAAE2lB,OAC7C,MAA2B,mBAAbxnB,EAAEwnB,QAAyBxnB,EAAEwnB,OAAO3lB,IAA0B,mBAAbA,EAAE2lB,QAAyB3lB,EAAE2lB,OAAOxnB,GAGrG,OAAQunB,GACN,IAAK,YACL,IAAK,QACL,IAAK,SACH,GAA6B,mBAAlBvnB,EAAEmC,aAA+D,aC5D5CklB,ED4DyBrnB,EAAEmC,YCzD/C,OADZmlB,EAAQG,OAAOJ,GAAGC,MAAM,oBACL,GAAKA,EAAM,ID0D5B,OAAOtnB,IAAM6B,EAEf,MACF,IAAK,UACL,IAAK,SACL,IAAK,SACH,UAAa7B,UAAa6B,IAAK,GAAU7B,EAAE0nB,UAAW7lB,EAAE6lB,WACtD,OAAO,EAET,MACF,IAAK,OACH,IAAK,GAAU1nB,EAAE0nB,UAAW7lB,EAAE6lB,WAC5B,OAAO,EAET,MACF,IAAK,QACH,OAAO1nB,EAAErC,OAASkE,EAAElE,MAAQqC,EAAEwD,UAAY3B,EAAE2B,QAC9C,IAAK,SACH,GAAMxD,EAAEyH,SAAW5F,EAAE4F,QAAUzH,EAAEN,SAAWmC,EAAEnC,QAAUM,EAAE2nB,aAAe9lB,EAAE8lB,YAAc3nB,EAAE4nB,YAAc/lB,EAAE+lB,WAAa5nB,EAAEkjB,SAAWrhB,EAAEqhB,QAAUljB,EAAE6nB,UAAYhmB,EAAEgmB,QAC/J,OAAO,EAMb,IADA,IAAIzmB,EAAM4lB,EAAO3mB,OAAS,EACnBe,GAAO,GAAG,CACf,GAAI4lB,EAAO5lB,KAASpB,EAClB,OAAOinB,EAAO7lB,KAASS,EAEzBT,GAAO,EAGT,OAAQmmB,GACN,IAAK,MACH,OAAIvnB,EAAE8nB,OAASjmB,EAAEimB,MAIVjB,GAAmB7mB,EAAE+nB,UAAWlmB,EAAEkmB,UAAWf,EAAO5iB,OAAO,CAACpE,IAAKinB,EAAO7iB,OAAO,CAACvC,KACzF,IAAK,MACH,OAAI7B,EAAE8nB,OAASjmB,EAAEimB,MAIVjB,GAAmB7mB,EAAE+L,SAAUlK,EAAEkK,SAAUib,EAAO5iB,OAAO,CAACpE,IAAKinB,EAAO7iB,OAAO,CAACvC,KACvF,IAAK,YACL,IAAK,QACL,IAAK,SACL,IAAK,UACL,IAAK,SACL,IAAK,SACL,IAAK,OACL,IAAK,QACL,IAAK,SACL,IAAK,YACL,IAAK,aACL,IAAK,oBACL,IAAK,aACL,IAAK,cACL,IAAK,aACL,IAAK,cACL,IAAK,eACL,IAAK,eACL,IAAK,cACH,MACF,QAEE,OAAO,EAGX,IAAImmB,EAAQ,EAAKhoB,GACjB,GAAIgoB,EAAM3nB,SAAW,EAAKwB,GAAGxB,OAC3B,OAAO,EAGT,IAAI4nB,EAAiBjB,EAAO5iB,OAAO,CAACpE,IAChCkoB,EAAiBjB,EAAO7iB,OAAO,CAACvC,IAGpC,IADAT,EAAM4mB,EAAM3nB,OAAS,EACde,GAAO,GAAG,CACf,IAAIzC,EAAMqpB,EAAM5mB,GAChB,IAAMX,EAAK9B,EAAKkD,KAAMslB,GAAQtlB,EAAElD,GAAMqB,EAAErB,GAAMspB,EAAgBC,GAC5D,OAAO,EAET9mB,GAAO,EAET,OAAO,EEvHT,IAGe,GAHWklB,IAAQ,SAAgBtmB,EAAG6B,GACnD,OAAOslB,GAAQnnB,EAAG6B,EAAG,GAAI,O,2RC6DpB,SAASsmB,GACdlL,EAAiB,EAAqB,G,IAAnB8G,EAAA,EAAAA,SAAqBqE,EAAA,EAAAA,MAIlCnC,EAASoC,WACblF,iBAAiBlG,EAAGqL,eACjBlF,iBAAiB,gBAIhB4C,EAAUzC,GAAc,CAACQ,EAASK,QAASgE,IAC9CvhB,KACCpD,GAAI,SAAC,G,IAAA,UAAG8Y,EAAA,KAAAA,EAAK,OAAEiG,EAAA,EAAAA,OACb,OADqB,EAAA5C,OACLqG,EAAS/gB,KAAKqjB,IAAItC,EAAQ/gB,KAAK6T,IAAI,EAAGwD,EAAIiG,QAK1DgG,EAAQjF,GAAc,CAACQ,EAASK,QAASgE,IAC5CvhB,KACCpD,GAAI,SAAC,G,IAAA,UAAwB,OAArB,KAAA8Y,GAAO,KAAAiG,OAA4ByD,MAI/C,OAAO1C,GAAc,CAACyC,EAASwC,IAC5B3hB,KACCpD,GAAI,SAAC,G,IAAA,UAAmB,OAAGmc,OAArB,KAA6B6I,KAArB,SACdxM,GAAmC,IACnCb,GAAY,IAaX,SAASsN,GACdzL,GAEA,OAAOpW,EAGLmT,GAAUqH,IACVvM,IAAI,SAAC,G,IAAE8K,EAAA,EAAAA,OAAQ6I,EAAA,EAAAA,MC3GZ,SACLxL,EAAiB5e,GAEjB4e,EAAG0L,MAAM/I,OAAYvhB,EAAK,KDyGtBuqB,CAAiB3L,EAAI2C,GCnFpB,SACL3C,EAAiB5e,GAEjB4e,EAAG4E,aAAa,gBAAiBxjB,EAAQ,OAAS,IDiF9CwqB,CAAe5L,EAAIwL,MAIrBlH,IAAS,YCtGN,SACLtE,GAEAA,EAAG0L,MAAM/I,OAAS,GDoGdkJ,CAAmB7L,GC9ElB,SACLA,GAEAA,EAAG8E,gBAAgB,iBD4EfgH,CAAiB9L,OElDhB,SAAS+L,GACdrD,EAAcpZ,GAGd,OAAO1F,EACLye,GAFM,EAAAxG,MAEY8G,SAAS,SAAA3I,GAAM,OAhC9B,SACLA,EAAiB0I,EAAc,GAU/B,OANiBwC,GAAalL,EAAI0I,EAAO,CAAEyC,MAJV,EAAAA,QAK9BvhB,KACC6hB,GAAazL,IAKdpW,KACCpD,GAAI,SAAAwlB,GAAW,OAAGA,QAAO,OAmBMC,CAAgBjM,EAAI0I,EAAOpZ,MAC5D6O,GAAY,I,+RCpCT,SAAS+N,GACdlM,EAAsB,G,IAAEmM,EAAA,EAAAA,QAexB,OAAO7F,GAAc,CAXNnX,GAAU6Q,EAAI,SAC1BpW,KACCpD,GAAI,WAAM,OAAA2lB,EAAQnM,EAAG5e,UACrB2d,GAAU,IACVC,MCxCC,SACLgB,GAEA,IAAMoM,EAASjd,GAAU6Q,EAAI,SACvBqM,EAASld,GAAU6Q,EAAI,QAG7B,OAAO5N,GACLga,EAAOxiB,KAAK+U,IAAM,IAClB0N,EAAMziB,KAAK+U,IAAM,KAEhB/U,KACCmV,GAAUiB,IAAOR,SAAS8M,eAC1BnO,GAAY,ID+BDoO,CAAkBvM,KAI9BpW,KACCpD,GAAI,SAAC,G,IAAA,UAAmB,OAAGpF,MAArB,KAA4BorB,MAArB,SACbrO,GAAY,IElDX,SAASsO,GACdzM,GAEA,OAAO7Q,GAAU6Q,EAAI,SAClBpW,KACC+U,QAAMrZ,ICRZ,IAAMonB,GAAM,CACVC,KAAS,yBACTC,QAAS,gEACTC,MAAS,0BACTC,OAAS,4BCJX,IAAM,GAAM,CACVH,KAAS,yBACTC,QAAS,4BACTC,MAAS,0BACTC,OAAS,4BAcJ,SAASC,GACd,G,IAAEC,EAAA,EAAAA,SAAUH,EAAA,EAAAA,MAAOI,EAAA,EAAAA,KAEnB,OACE,QAAGC,KAAMF,EAAUH,MAAOA,EAAOM,MAAO,GAAIR,KAAMS,UAAW,GAC3D,cAASD,MAAO,GAAIP,SAClB,SAAIO,MAAO,GAAIN,OAAQA,GACtBI,EAAK7pB,OACF,QAAG+pB,MAAO,GAAIL,QAASpH,GAASuH,EAAM,WACtC3nB,ICzBZ,IAAM,GAAM,CACVpB,KAAM,0BAcD,SAASmpB,GACd,G,IAAET,EAAA,EAAAA,QAASU,EAAA,EAAAA,SAEX,OACE,SAAIH,MAAO,GAAIjpB,MFHZ,SACL,G,IAAE8oB,EAAA,EAAAA,SAAUH,EAAA,EAAAA,MAAOI,EAAA,EAAAA,KAEnB,OACE,QAAGC,KAAMF,EAAUH,MAAOA,EAAOM,MAAOT,GAAIC,KAAMS,UAAW,GAC3D,cAASD,MAAOT,GAAIE,SAClB,SAAIO,MAAOT,GAAIG,OAAQA,GACtBI,EAAK7pB,OACF,QAAG+pB,MAAOT,GAAII,QAASpH,GAASuH,EAAM,WACtC3nB,IELLioB,CAAsBX,GACnBU,EAAS9mB,IAAIumB,KCzBvB,IAAM,GAAM,CACVS,MAAO,mBACPC,KAAO,mBCfT,IAAIC,GAAwC,WACxC,SAASA,EAAuBrb,EAAalF,GACzCxK,KAAK0P,YAAcA,EACnB1P,KAAKwK,QAAUA,EAKnB,OAHAugB,EAAuB3rB,UAAUzB,KAAO,SAAUsI,EAAY4B,GAC1D,OAAOA,EAAOL,UAAU,IAAI,GAAyBvB,EAAYjG,KAAK0P,YAAa1P,KAAKwK,WAErFugB,EARgC,GAUvC,GAA0C,SAAUvlB,GAEpD,SAASwlB,EAAyBhlB,EAAa0J,EAAalF,GACxD,IAAI7E,EAAQH,EAAO7H,KAAKqC,KAAMgG,IAAgBhG,KAC9C2F,EAAM+J,YAAcA,EACpB/J,EAAM6E,QAAUA,EAChB7E,EAAMme,UAAY,GAClB,IAAIhiB,EAAM4N,EAAYjP,OACtBkF,EAAMwG,OAAS,IAAI/J,MAAMN,GACzB,IAAK,IAAItE,EAAI,EAAGA,EAAIsE,EAAKtE,IACrBmI,EAAMme,UAAUrf,KAAKjH,GAEzB,IAASA,EAAI,EAAGA,EAAIsE,EAAKtE,IAAK,CAC1B,IAAIuJ,EAAa2I,EAAYlS,GAC7BmI,EAAMjB,IAAIyJ,GAAkBxI,EAAOoB,EAAYA,EAAYvJ,IAE/D,OAAOmI,EAoCX,OAnDA,EAAkBqlB,EAA0BxlB,GAiB5CwlB,EAAyB5rB,UAAU4O,WAAa,SAAUF,EAAYQ,EAAYP,EAAYQ,EAAYC,GACtGxO,KAAKmM,OAAO4B,GAAcO,EAC1B,IAAIwV,EAAY9jB,KAAK8jB,UACrB,GAAIA,EAAUrjB,OAAS,EAAG,CACtB,IAAIwqB,EAAQnH,EAAU/e,QAAQgJ,IACf,IAAXkd,GACAnH,EAAU5e,OAAO+lB,EAAO,KAIpCD,EAAyB5rB,UAAU8O,eAAiB,aAEpD8c,EAAyB5rB,UAAU8G,MAAQ,SAAUzH,GACjD,GAA8B,IAA1BuB,KAAK8jB,UAAUrjB,OAAc,CAC7B,IAAI4J,EAAO,CAAC5L,GAAO+F,OAAOxE,KAAKmM,QAC3BnM,KAAKwK,QACLxK,KAAKkrB,YAAY7gB,GAGjBrK,KAAKgG,YAAY7C,KAAKkH,KAIlC2gB,EAAyB5rB,UAAU8rB,YAAc,SAAU7gB,GACvD,IAAIS,EACJ,IACIA,EAAS9K,KAAKwK,QAAQ9J,MAAMV,KAAMqK,GAEtC,MAAOtH,GAEH,YADA/C,KAAKgG,YAAY5C,MAAML,GAG3B/C,KAAKgG,YAAY7C,KAAK2H,IAEnBkgB,EApDkC,CAqD3C,I,2RC1BK,SAASG,GACd9N,EAAiB,G,IAAE+N,EAAA,EAAAA,OAEbC,EAAOvO,GAAW,0BAA2BO,GACnD,OAAOpW,EDvDF,WAEH,IADA,IAAIoD,EAAO,GACFlD,EAAK,EAAGA,EAAK3G,UAAUC,OAAQ0G,IACpCkD,EAAKlD,GAAM3G,UAAU2G,GAEzB,OAAO,SAAUU,GACb,IAAI2C,EACiC,mBAA1BH,EAAKA,EAAK5J,OAAS,KAC1B+J,EAAUH,EAAKC,OAEnB,IAAIoF,EAAcrF,EAClB,OAAOxC,EAAOF,KAAK,IAAIojB,GAAuBrb,EAAalF,KC6C/D8gB,CAAeF,GACfvnB,GAAI,SAAC,G,IAAA,UAACiH,EAAA,KAMJ,OANY,KlC3BX,SACLuS,EAAiB5e,GAEjB4e,EAAGkO,YAAc9sB,EAAQ,EACrBukB,GAAU,sBAAuBvkB,EAAMuC,YAErCgiB,GADQ,IAAVvkB,EACY,oBACA,sBkCsBV+sB,CAAoBH,EAAMvgB,EAAOrK,QlCdlC,SACL4c,GAEAA,EAAGkO,YAAcvI,GAAU,6BkCarByI,CAAsBJ,GAEjBvgB,MCJN,SAAS4gB,GACdrO,EAAiB0I,EAAc,G,IAAE4F,EAAA,EAAAA,QAASP,EAAA,EAAAA,OAEpCQ,EAAYvO,EAAGqL,cAGfmD,EpDUD,SACLxO,EAAiB,G,IAAE8G,EAAA,EAAAA,SAGnB,OAAO1U,GADSjD,GAAU6Q,EAAI,UACR8G,EAASG,OAC5Brd,KACCpD,GAAI,WAAM,OAAAuZ,GAAiBC,MAC3BjB,GAAUgB,GAAiBC,IAC3B7B,GAAY,IoDlBAsQ,CAAmBF,EAAW7F,GAC3C9e,KACCpD,GAAI,SAAC,GAAU,OAAR,EAAA8Y,GAAaiP,EAAUG,aAAeH,EAAUnI,aAAe,MACtEpH,KACAvH,GAAO,IAIX,OAAO6W,EACJ1kB,KACCkkB,GAAsB9N,EAAI,CAAE+N,OAAM,ICZjC,SACL/N,EAAiB,G,IAAEwO,EAAA,EAAAA,QAEbD,EAAYvO,EAAGqL,cACfpnB,EAAOwb,GAAW,0BAA2BO,GACnD,OAAOpW,EACLgP,IAAU,SAAAnL,GAAU,OAAA+gB,EACjB5kB,KAGCmT,GAAUqH,IACVhI,IAAK,SAAApV,GACH,KAAOA,EAAQyG,EAAOrK,SACpB+hB,GAAsBlhB,EAAMopB,GAAmB5f,EAAOzG,SAClDunB,EAAUG,aAAeH,EAAUnI,aAAe,OAGxD,OAAOpf,IACN,GAGH2X,GAAMlR,GAGN6W,IAAS,YpCjBV,SACLtE,GAEAA,EAAGuH,UAAY,GoCePoH,CAAsB1qB,WDZ1B2qB,CAAsB5O,EAAI,CAAEwO,QAAO,KEelC,SAASK,GACdnG,EAAcpZ,GAGd,OAAO1F,EACLye,GAFM,EAAAxG,MAEY8G,SAAS,SAAA3I,GAAM,OAhC9B,SACLA,EAAiB0I,EAAc,GAU/B,OANgB7B,GAA6B7G,EAAI0I,EAAO,CAAE3B,QAJzB,EAAAA,UAK9Bnd,KACC0b,GAAYtF,EAAI,IAKjBpW,KACCpD,GAAI,SAAAoiB,GAAU,OAAGA,OAAM,OAmBQkG,CAAU9O,EAAI0I,EAAOpZ,MACtD6O,GAAY,IC1EhB,IAGe,GAHYnb,GAAQ,SAAiBiB,GAClD,OC5BgCV,ED4BfU,EC3B4B,oBAAtCpD,OAAOkB,UAAU4B,SAASrD,KAAKiD,GD2BbU,EAAK8qB,MAAM,IAAIC,UAAUvoB,KAAK,IAAM1B,MAAMhD,UAAUsK,MAAM/L,KAAK2D,EAAM,GAAG+qB,UC5BpF,IAAmBzrB,KCEnB,SAAS0rB,GAAUlsB,EAAGkB,GACnC,OCDa,SAAkBA,EAAMlB,EAAGoB,GACxC,IAAI+qB,EAAKhrB,EAET,GAA4B,mBAAjBD,EAAKyD,QACd,cAAe3E,GACb,IAAK,SACH,GAAU,IAANA,EAAS,CAGX,IADAmsB,EAAM,EAAInsB,EACHoB,EAAMF,EAAKb,QAAQ,CAExB,GAAa,KADbc,EAAOD,EAAKE,KACM,EAAID,IAASgrB,EAC7B,OAAO/qB,EAETA,GAAO,EAET,OAAQ,EACH,GAAIpB,GAAMA,EAAG,CAElB,KAAOoB,EAAMF,EAAKb,QAAQ,CAExB,GAAoB,iBADpBc,EAAOD,EAAKE,KACoBD,GAASA,EACvC,OAAOC,EAETA,GAAO,EAET,OAAQ,EAGV,OAAOF,EAAKyD,QAAQ3E,EAAGoB,GAGzB,IAAK,SACL,IAAK,UACL,IAAK,WACL,IAAK,YACH,OAAOF,EAAKyD,QAAQ3E,EAAGoB,GAEzB,IAAK,SACH,GAAU,OAANpB,EAEF,OAAOkB,EAAKyD,QAAQ3E,EAAGoB,GAK/B,KAAOA,EAAMF,EAAKb,QAAQ,CACxB,GAAI,GAAOa,EAAKE,GAAMpB,GACpB,OAAOoB,EAETA,GAAO,EAET,OAAQ,EDnDDgrB,CAASlrB,EAAMlB,EAAG,IAAM,EEmCjC,SAASqsB,GAASlrB,EAAMmrB,EAAW1S,GACjC,IACI2S,EADAC,SAAcrrB,EAElB,OAAQqrB,GACN,IAAK,SACL,IAAK,SAEH,OAAa,IAATrrB,GAAc,EAAIA,IAAUsrB,MAC1B7S,EAAI8S,OAAO,QAGTJ,IACF1S,EAAI8S,OAAO,OAAQ,IAEd,GAIY,OAAnB9S,EAAI+S,WACFL,GACFC,EAAW3S,EAAI+S,WAAW7E,KAC1BlO,EAAI+S,WAAWroB,IAAInD,GACTyY,EAAI+S,WAAW7E,OACNyE,GAEZ3S,EAAI+S,WAAWC,IAAIzrB,GAGtBqrB,KAAQ5S,EAAI8S,OAMPvrB,KAAQyY,EAAI8S,OAAOF,KAGxBF,IACF1S,EAAI8S,OAAOF,GAAMrrB,IAAQ,IAEpB,IAXHmrB,IACF1S,EAAI8S,OAAOF,GAAQ,GACnB5S,EAAI8S,OAAOF,GAAMrrB,IAAQ,IAEpB,GAWb,IAAK,UAGH,GAAIqrB,KAAQ5S,EAAI8S,OAAQ,CACtB,IAAIG,EAAO1rB,EAAO,EAAI,EACtB,QAAIyY,EAAI8S,OAAOF,GAAMK,KAGfP,IACF1S,EAAI8S,OAAOF,GAAMK,IAAQ,IAEpB,GAMT,OAHIP,IACF1S,EAAI8S,OAAOF,GAAQrrB,EAAO,EAAC,GAAO,GAAQ,EAAC,GAAM,KAE5C,EAGX,IAAK,WAEH,OAAuB,OAAnByY,EAAI+S,WACFL,GACFC,EAAW3S,EAAI+S,WAAW7E,KAC1BlO,EAAI+S,WAAWroB,IAAInD,GACTyY,EAAI+S,WAAW7E,OACNyE,GAEZ3S,EAAI+S,WAAWC,IAAIzrB,GAGtBqrB,KAAQ5S,EAAI8S,SAMbR,GAAU/qB,EAAMyY,EAAI8S,OAAOF,MAC1BF,GACF1S,EAAI8S,OAAOF,GAAMnoB,KAAKlD,IAEjB,IATHmrB,IACF1S,EAAI8S,OAAOF,GAAQ,CAACrrB,KAEf,GAWb,IAAK,YACH,QAAIyY,EAAI8S,OAAOF,KAGTF,IACF1S,EAAI8S,OAAOF,IAAQ,IAEd,GAGX,IAAK,SACH,GAAa,OAATrrB,EACF,QAAKyY,EAAI8S,OAAa,OAChBJ,IACF1S,EAAI8S,OAAa,MAAI,IAEhB,GAKb,QAIE,OADAF,EAAO1uB,OAAOkB,UAAU4B,SAASrD,KAAK4D,MACxByY,EAAI8S,SAObR,GAAU/qB,EAAMyY,EAAI8S,OAAOF,MAC1BF,GACF1S,EAAI8S,OAAOF,GAAMnoB,KAAKlD,IAEjB,IAVHmrB,IACF1S,EAAI8S,OAAOF,GAAQ,CAACrrB,KAEf,IAcA,OA1KS,WACtB,SAAS2rB,IAEPltB,KAAK+sB,WAA4B,mBAARI,IAAqB,IAAIA,IAAQ,KAC1DntB,KAAK8sB,OAAS,GA6BhB,OAtBAI,EAAK9tB,UAAUsF,IAAM,SAAUnD,GAC7B,OAAQkrB,GAASlrB,GAAM,EAAMvB,OAO/BktB,EAAK9tB,UAAU4tB,IAAM,SAAUzrB,GAC7B,OAAOkrB,GAASlrB,GAAM,EAAOvB,OAaxBktB,EAjCe,GCwCT,GAnBexG,IAAQ,SAAoB0G,EAAOC,GAO/D,IANA,IAAIC,EAAM,GACN9rB,EAAM,EACN+rB,EAAWH,EAAM3sB,OACjB+sB,EAAYH,EAAO5sB,OACnBgtB,EAAc,IAAI,GAEbjwB,EAAI,EAAGA,EAAIgwB,EAAWhwB,GAAK,EAClCiwB,EAAY/oB,IAAI2oB,EAAO7vB,IAGzB,KAAOgE,EAAM+rB,GACPE,EAAY/oB,IAAI0oB,EAAM5rB,MACxB8rB,EAAIA,EAAI7sB,QAAU2sB,EAAM5rB,IAE1BA,GAAO,EAET,OAAO8rB,K,yqBCVSI,GCCAC,G,2RC+CX,SAASC,GACdvQ,EAAiB0I,EAAc,G,IAAE3B,EAAA,EAAAA,QAI3ByJ,EAAWtF,GAAalL,EAAI0I,EAAO,CAAEyC,MAJD,EAAAA,QAKvCvhB,KACC6hB,GAAazL,IAIXyQ,EAAM5Q,GAA+B,gBAAiBG,GACtD0Q,ECSD,SACLD,EAA0B,EAAqB,G,QAAnB3J,EAAA,EAAAA,SAAqBC,EAAA,EAAAA,QAE3C4J,EAAQ,IAAIC,I,IAClB,IAAiB,SAAAH,GAAG,8BAAE,CAAjB,IAAMzQ,EAAE,QAEL5Q,EAASqQ,GAAW,QADfoR,mBAAmB7Q,EAAG8Q,KAAKtb,UAAU,IACZ,WACd,IAAXpG,GACTuhB,EAAMhU,IAAIqD,EAAI5Q,I,iGAIlB,IAAM4X,EAAUD,EACbnd,KACCpD,GAAI,SAAAuqB,GAAU,UAAKA,EAAOpO,WAkF9B,OA9EmBmE,EAASG,MACzBrd,KAGCpD,GAAI,WACF,IAAIwqB,EAA4B,GAChC,OAAO,GAAIL,GAAO7oB,QAAO,SAACd,EAAO,GAC/B,I,IAD+B,UAACiqB,EAAA,KAAQ7hB,EAAA,KACjC4hB,EAAK5tB,QAAQ,CAElB,KADautB,EAAM3vB,IAAIgwB,EAAKA,EAAK5tB,OAAS,IACjC8tB,SAAW9hB,EAAO8hB,SAGzB,MAFAF,EAAK/jB,MAKT,OAAOjG,EAAM2V,IACX,GAAQqU,EAAO,GAAIA,EAAM,CAAAC,KACzB7hB,EAAO8X,aAER,IAAI0J,QAIThY,IAAU,SAAA5R,GAAS,OAAAsf,GAAcQ,EAASK,QAASH,GAChDpd,KACCwS,IAAK,SAAC,EAAc,GAGlB,I,IAHI,UAACnS,EAAA,KAAMnE,EAAA,KAAO,UAAGwZ,EAAA,KAAAA,EAAK0J,EAAA,KAGnBljB,EAAK1C,QAAQ,CAElB,KADM,WAAG,GACI4lB,EAAS1J,GAGpB,MAFArV,EAAO,GAAIA,EAAM,CAAAnE,EAAKkM,UAO1B,KAAO/H,EAAK7G,QAAQ,CAElB,KADM,oBAAG,GACI4lB,GAAU1J,GAGrB,MAFAxZ,EAAO,IAACmE,EAAKgD,OAAWnH,GAO5B,MAAO,CAACmE,EAAMnE,KACb,CAAC,GAAI,GAAIkB,KACZgY,IAAqB,SAACjc,EAAG6B,GACvB,OAAO7B,EAAE,KAAO6B,EAAE,IACX7B,EAAE,KAAO6B,EAAE,WAQzBgF,KACCpD,GAAI,SAAC,G,IAAA,UAACyD,EAAA,KAAMnE,EAAA,KAAU,OACpBmE,KAAMA,EAAKzD,KAAI,SAAC,GAAW,OAAX,QAAC,MACjBV,KAAMA,EAAKU,KAAI,SAAC,GAAW,OAAX,QAAC,UAInB4V,IAAiB,SAACrZ,EAAG6B,GACnB,IAAMusB,EAAQlpB,KAAK6T,IAAI,EAAG7T,KAAKqjB,IAAI1mB,EAAEqF,KAAK7G,OAAQL,EAAEkH,KAAK7G,QAAU,GAC7DguB,EAAQnpB,KAAK6T,IAAIlX,EAAEqF,KAAK7G,OAAQL,EAAEkH,KAAK7G,QAC7C,MAAO,CACL6G,KAAMrF,EAAEqF,KAAKoC,MAAM8kB,EAAOC,EAAM,GAChCtrB,KAAM,GAAWlB,EAAEkB,KAAM/C,EAAE+C,SAE5B,CAAEmE,KAAM,GAAInE,KAAM,MAKtB8D,KACCuU,GAAY,ID3GCkT,CAAgBZ,EAAK/H,EAAO,CAAE3B,QAAO,IACnDnd,KCuHE,SACL6mB,GAEA,OAAO7mB,EAGLmT,GAAUqH,IACVvM,IAAI,SAAC,G,YAAE5N,EAAA,EAAAA,KAAMnE,EAAA,EAAAA,K,IAGX,IAAmB,SAAAA,GAAI,8BAAE,CACvBof,GADUlF,EAAD,cAAC,IAEV6E,GAAgB7E,I,qGAIlB,IAA4B,SAAA/V,EAAK6gB,WAAS,8BAAE,CAAjC,IAAS9K,EAAT,gBAAChZ,EAAA,KACV+d,GADkB/E,EAAD,WAAC,GACEhZ,IAAUiD,EAAK7G,OAAS,GAC5CuhB,GAAc3E,GAAI,I,qGAKtBsE,IAAS,W,YACP,IAAiB,SAAAmM,GAAG,8BAAE,CAAjB,IAAMzQ,EAAE,QACXkF,GAAkBlF,GAClB6E,GAAgB7E,I,sGDhJlBsR,CAAgBb,IAIpB,OAAOnK,GAAc,CAACkK,EAAUE,IAC7B9mB,KACCpD,GAAI,SAAC,G,IAAA,UAAuB,OAAGwlB,QAAzB,KAAkCuF,QAAzB,UDSd,SAASC,GACdjrB,GAEA,OAAOA,EAAQgpB,OAASe,GAAkBmB,KAuBrC,SAASC,GACdnrB,GAEA,OAAOA,EAAQgpB,OAASe,GAAkBqB,QD1G5C,SAAkBtB,GAChB,uBACA,uBAFF,CAAkBA,QAAiB,KCCnC,SAAkBC,GAChB,qBACA,mBACA,qBACA,uBAJF,CAAkBA,QAAiB,KG/BnC,4C,05BA0GA9Q,SAASoS,gBAAgB5M,UAAUje,OAAO,SAC1CyY,SAASoS,gBAAgB5M,UAAU3d,IAAI,MAEvC,IAAM,GAAqB,CACzB,YACA,SACA,eACA,OACA,OACA,aACA,SACA,eACA,eACA,gBACA,OACA,OA8BF,SAAS,GAAQjG,GACf,IAAMywB,EAAWzwB,EACd0kB,QAAQ,+BAAgC,IACxCgM,OAEH,OAAOD,EAAWA,EAAS/L,QAAQ,SAAU,MAAQ,GAGvD,SAASiM,GAAa1T,GAEpBA,EAAO2T,KAAO3T,EAAO2T,KAAKlM,QAAQ,MAAO,IAEzC,IAAMjC,EAAS,IAAIoO,OAAO5T,EAAOwF,OAAOqO,QAClCC,EAAS,IAAIF,OAAO5T,EAAOwF,OAAOsO,QAElCC,EAAiB,IAAI,EACrBC,EAAUzO,GAAYuO,EAAQ,CAAErO,MAAOsO,IAI7CC,EAAQloB,WAAU,SAAA5D,GAGZA,EAAQgpB,OAASc,GAAkBiC,QAA8B,MAApB/rB,EAAQgsB,KAAK,IAC5DC,aAAaC,QAAQ,QAASlsB,EAAQgsB,SAK1C,IAAMG,EAAiB,IAAI,EAErBC,EAAU/O,GAAYC,EAAQ,CAAEC,MAAO4O,IAG7CC,EACG/oB,KACC6N,GAAO+Z,IACPhrB,GAAI,SAAAD,GAAW,OACbgpB,KAAMc,GAAkBuC,OACxBL,KAAMhsB,EAAQgsB,SAEhB1a,IAAI,SAAAtR,GAAW,OAAA6rB,EAAetsB,KAAKS,OAGlC4D,YAEL,I5FhMmBqD,E4FgMbqlB,EAAQrb,GAAK,CACjBhF,IAAQ6L,EAAO2T,KAAI,4BACnB7e,aAAc,OACde,iBAAiB,IAEhBtK,KACCuO,GAAM,aAaJ2a,EAAYN,aAAaO,QAAQ,SA2BvC,OAxBCD,EAAY/lB,EAAG,CACdwiB,KAAMc,GAAkBiC,OACxBC,KAAMC,aAAaO,QAAQ,WACxBvrB,GACF2C,WAAU,SAAA5G,GAET6uB,EAAetsB,KAAKvC,M5G3NnB,WAEH,IADA,IAAIsL,EAAU,GACL/E,EAAK,EAAGA,EAAK3G,UAAUC,OAAQ0G,IACpC+E,EAAQ/E,GAAM3G,UAAU2G,GAE5B,GAAuB,IAAnB+E,EAAQzL,OAAc,CACtB,IAAI4vB,EAAUnkB,EAAQ,GACtB,GAAI3I,EAAQ8sB,GACR,OAAOpkB,GAAiBokB,EAAS,MAErC,GAAI7sB,EAAS6sB,IAAYnyB,OAAOoyB,eAAeD,KAAanyB,OAAOkB,UAAW,CAC1E,IAAIqC,EAAOvD,OAAOuD,KAAK4uB,GACvB,OAAOpkB,GAAiBxK,EAAKoC,KAAI,SAAU9E,GAAO,OAAOsxB,EAAQtxB,MAAU0C,IAGnF,GAA2C,mBAAhCyK,EAAQA,EAAQzL,OAAS,GAAmB,CACnD,IAAI8vB,EAAmBrkB,EAAQ5B,MAE/B,OAAO2B,GADPC,EAA8B,IAAnBA,EAAQzL,QAAgB8C,EAAQ2I,EAAQ,IAAOA,EAAQ,GAAKA,EACtC,MAAMjF,KAAKpD,GAAI,SAAUwG,GAAQ,OAAOkmB,EAAiB7vB,WAAM,EAAQ2J,OAE5G,OAAO4B,GAAiBC,EAAS,M4G8MnCskB,CAAS,CAACN,EAJKC,EAAYT,EAAQzoB,KAAKuO,GAAM,S5F/N3B3K,E4F+NyC,E5F9NnD,SAAUhD,GACb,OAAc,IAAVgD,EACO,IAGAhD,EAAOF,KAAK,IAAI,GAAakD,O4FyNoBT,OAAGzH,KAKlEsE,KACCpD,GAAI,SAAC,G,IAAA,UAAC+rB,EAAA,KAAMvrB,EAAA,KAAW,OACrBuoB,KAAMe,GAAkB8C,MACxBb,KAAM,SAAKA,GAAI,CAAEvrB,MAAK,SAGvBmD,WAAU,SAAA5D,GACTmsB,EAAe5sB,KAAKS,MAGnB,CAACosB,EAASD,GA+EZ,SAASW,GAAWhV,GACzB,IAzLF,SAAkBA,GAChB,MAAyB,iBAAXA,GACgB,iBAAhBA,EAAO2T,MACW,iBAAlB3T,EAAOwF,QACkB,iBAAzBxF,EAAOwF,OAAOqO,QACW,iBAAzB7T,EAAOwF,OAAOsO,OAoLvBmB,CAASjV,GACZ,MAAM,IAAIkV,YAAY,0BAA0B7d,KAAKC,UAAU0I,IAGjE,I5DtRMmV,E4DsRA9K,ECxOC,CACLlJ,SAAU,CACRD,MpEhCGA,GACJ3V,KACC+U,GAAMa,UACNrB,GAAY,KoE+Bd6O,SAAU,CACRyG,O7DnDED,EAAY,IAAI,EACtB9R,GACG9X,KACCpD,GAAI,WAAM,OAAAwmB,SAASE,QACnB3L,MAECpX,UAAUqpB,GAGRA,G6D2CHE,M7DlCGjS,GACJ7X,KACCpD,GAAI,WAAM,OAAAwmB,SAAS8D,QACnBrZ,IAAO,SAAAqZ,GAAQ,OAAAA,EAAK1tB,OAAS,KAC7Bme,O6DgCFM,MAAO,CACL8G,QAAShH,GAAW,uBACpBgS,QAAShS,GAAW,uBAEtBmF,SAAU,CACRK,Q1DbG/U,GAAM,GAASgQ,IACnBxY,KACCpD,EAAI6b,IACJtD,GAAUsD,MACVlE,GAAY,I0DUZ8I,M1DAG7E,GACJxY,KACCpD,EAAIgc,IACJzD,GAAUyD,MACVrE,GAAY,MyDwNV,cACJyV,EAAA,KACAlB,EAAA,MAlFJ,WACE,IAAM1S,EAAKP,GAA8B,0BAEzC,GADAxU,QAAQ4oB,IAAI7T,IACPA,EACH,OAAOxY,EAET,IAAM+qB,EAAOuB,eAAef,QAAQ,cACpC,GAAIR,EAEF,OAAOxlB,EADG2I,KAAK2B,MAAMkb,IAKvB,SAASwB,EAAO3yB,GACd,OAAOA,EAAQ,KACPA,EAAQ,KAAM4yB,QAAQ,GAAE,IAC5B,GAAG,EAIH,qEAAG/e,EAAA,KAAMgf,EAAA,KAGf,OAAIhf,GAAQgf,EACHzc,GAAK,CACVhF,IAAK,gCAAgCyC,EAAI,IAAIgf,EAC7C9gB,aAAc,SAEbvJ,KACCpD,GAAI,SAAC,G,IAAEqQ,EAAA,EAAAA,OAAQ5D,EAAA,EAAAA,SACb,GAAe,MAAX4D,EAAgB,CACV,IAAAqd,EAAA,EAAAA,iBAAkBC,EAAA,EAAAA,YAC1B,MAAO,CACFJ,EAAOG,GAAiB,SACxBH,EAAOI,GAAY,UAG1B,MAAO,MAETtc,IAAI,SAAA0a,GAAQ,OAAAuB,eAAerB,QAAQ,aAAc/c,KAAKC,UAAU4c,QAI3Dtd,EACFuC,GAAK,CACVhF,IAAK,gCAAgCyC,EACrC9B,aAAc,SAEbvJ,KACCpD,GAAI,SAAC,G,IAAEqQ,EAAA,EAAAA,OAAQ5D,EAAA,EAAAA,SACb,OAAe,MAAX4D,EAEK,CACFkd,EAFG,EAAAK,cAEiB,iBAGpB,MAETvc,IAAI,SAAA0a,GAAQ,OAAAuB,eAAerB,QAAQ,aAAc/c,KAAKC,UAAU4c,QAG/DxlB,EAAG,KAyBVsnB,GAAalqB,WAAU,SAAAqjB,GACjBA,EAAMpqB,QACQyc,GAAY,2CACpB1U,SAAQ,SAAA8oB,GACdA,EAAKK,QAAQC,QAAU,OACvBN,EAAK5O,YhBrSN,SACLmI,GAEA,OACE,SAAIL,MAAO,GAAIK,OACZA,EAAMhnB,KAAI,SAACinB,GAAc,gBAAIN,MAAO,GAAIM,MAAOA,OgBiS5C+G,CAAahH,UASrB,IAAMiH,EE5QD,SACLC,EAAoB,GAsCpB,OAtCsB,EAAAC,UAGnB/qB,KAGCpD,GAAI,SAAAgZ,GAAY,OAAAkV,EAAM5sB,QAAqB,SAAC8sB,EAAYl0B,G,MAChDsf,EAAKP,GAAW,sBAAsB/e,EAAI,IAAK8e,GACrD,OAAO,SACFoV,QACc,IAAP5U,IAAoB,MAAItf,GAAOsf,EAAE,GAAK,MAEjD,OAGH5D,IAAK,SAACnS,EAAMnE,G,YACV,IAAmB,WAAKmE,IAAK,8BAAE,CAA1B,IAAMvJ,EAAI,QACb,OAAQA,GAGN,IAAK,eACL,IAAK,YACCA,KAAQuJ,QAA8B,IAAfA,EAAKvJ,KAC9BuJ,EAAKvJ,GAAOm0B,YAAY/uB,EAAKpF,IAC7BuJ,EAAKvJ,GAAQoF,EAAKpF,IAEpB,MAGF,QACEuJ,EAAKvJ,GAAQ+e,GAAW,sBAAsB/e,EAAI,O,iGAGxD,OAAOuJ,MAMVL,KACCuU,GAAY,IFmOI2W,CAAkB,GAAO,CAAEH,UAAWjM,EAAMlJ,SAASD,QACnEwV,EAAY,SAAwBr0B,GACxC,OAAO+zB,EACJ7qB,KEvNA,SACLlJ,GAEA,OAAOkJ,EACLgP,IAAU,SAAAgc,GACR,YAAmC,IAArBA,EAAWl0B,GACrBqM,EAAG6nB,EAAWl0B,IACd6P,OFiNFykB,CAAmBt0B,KAKnBqmB,EAAUgO,EAAU,UACvBnrB,KACCgP,GAAUmN,KAIdgP,EAAU,UACPnrB,KACCgP,IAAU,SAAAoH,GAAM,OAAAmL,EACbvhB,KACCwd,GAAkBpH,QAIrB7V,YAOL,IAAMmkB,EAAUsF,EACbhqB,KAEC6N,GAAOia,IACPvZ,GAAM,QAENN,IAAI,SAAApK,GAAU,OAAAA,EAAOtC,SAAQ,SAAAjH,GAC3BA,EAAK0oB,QAAQI,SAAc3O,EAAO2T,KAAI,IAAI9tB,EAAK0oB,QAAQI,SACvD9oB,EAAKopB,SAASniB,SAAQ,SAAA8pB,GACpBA,EAAQjI,SAAc3O,EAAO2T,KAAI,IAAIiD,EAAQjI,mBAO/Ce,EAASgH,EAA4B,gBACxCnrB,KACCgP,IAAU,SAAAoH,GAAM,OAAAkM,GAAiBlM,EAAI,CAAEmM,QAAO,SAGlD4B,EACGnkB,KACCpD,GAAI,SAAAob,GAAS,OACX2N,KAAMe,GAAkB4E,MACxB3C,KAAM3Q,EAAMxgB,WAIb+I,UAAUuoB,GAKf3E,EACGnkB,KACCiO,IAAI,SAAA+J,GGxXH,IACL5B,EAAsB5e,EHwXZwgB,EAAM4K,QGxXMprB,GHyXI,GGzX1B4e,EHyXkBkS,GGvXXiD,UAAY/zB,GACjB4e,EAAGoV,aHyXAjrB,YAIL,IGhXA6V,EHgXMmL,EAAQ4J,EAAU,QACrBnrB,KACCkf,GAAUJ,EAAO,CAAE3B,QAAO,KAGxBsO,EAAcN,EAAU,cAC3BnrB,KACCmiB,GAAgBrD,EAAO,CAAEyC,MAAK,KAG5BmK,EAAOP,EAAU,OACpBnrB,KFpUE,SACL8e,EAAcpZ,GAGd,OAAO1F,EACLye,GAFM,EAAAxG,MAEY8R,SAAS,SAAA3T,GAAM,OAAAuQ,GAAqBvQ,EAAI0I,EAAOpZ,MACjE6O,GAAY,IE+TVoX,CAAqB7M,EAAO,CAAE3B,QAAO,EAAEoE,MAAK,KAI1CqK,EAAmBT,EAAU,iBAChCnrB,Kb5VE,SACL8e,EAAcpZ,GAEd,OAAO1F,EACLgP,IAAU,SAAAoH,GAAM,OAAAqO,GAAkBrO,EAAI0I,EAAOpZ,MAC7C6O,GAAY,IawVVsX,CAAkB/M,EAAO,CAAE4F,QAAO,EAAEP,OAAQA,EAAOnkB,KAAKuO,GAAM,aAG5Dud,EAAQX,EAAU,QACrBnrB,KACCilB,GAAUnG,EAAO,CAAE3B,QAAO,KAGxB4O,EAAQZ,EAAU,QACrBnrB,KACC6e,GAAUC,EAAO,CAAE3B,QAAO,KAOxBmL,GADSzS,GAA6B,2BAC7BA,GAA6B,4BAEtCmW,GGrZN5V,EHqZuBkS,EGnZhB/iB,GAAU6Q,EAAI,UAClBpW,KACCpD,GAAI,WAAM,OAAAwZ,EAAGmV,aHkZdvrB,KACC,GAAM,MAGJisB,EAASd,EAAU,gBACtBnrB,KACCgP,GAAU6T,KAKRqJ,EAAsBF,EACzBhsB,KACCgP,IAAU,SAAArV,GAAK,OAAM,IAANA,EAAa4L,GAAU/M,OAAQ,WAAamO,OAI/D6B,GAAMwjB,EAAGhsB,KAAK6N,GAAO,IAAYoe,EAAQC,GACtClsB,KACCsS,GAAY6Y,EAA4B,iBACxCld,IAAI,SAAAmI,GAAM,OAAAA,EAAGwM,YAEZriB,YAKLiI,GACEuP,GAAW,SAAS/X,KAAK6N,GAAO,IAChCtI,GAAU/M,OAAQ,gBAEjB+H,WAAU,WACT,IAAM4rB,EAAUvW,SAASM,iBAAiB,WAC1C/a,MAAMhD,UAAUoJ,QAAQ7K,KAAKy1B,GAAS,SAAAC,GACpCA,EAAOpR,aAAa,OAAQ,UAMlC,IAAMxL,EAAQ,CACZ8Y,OAAQ,CACNnE,OAAM,EACNO,QAASkH,EACTK,OAAM,GAER1K,MAAK,EACLkK,YAAW,EACXC,KAAI,EACJI,MAAK,EACLC,MAAK,GAGC,IAAAzD,OAAc,mBAItB,OAHA9f,GAAK,gBAAI,EAAO6jB,GAAU,EAAOC,KAC9B/rB,YAEI,CACLue,MAAK,EACLtP,MAAK","file":"bundle.js","sourcesContent":[" \t// The module cache\n \tvar installedModules = {};\n\n \t// The require function\n \tfunction __webpack_require__(moduleId) {\n\n \t\t// Check if module is in cache\n \t\tif(installedModules[moduleId]) {\n \t\t\treturn installedModules[moduleId].exports;\n \t\t}\n \t\t// Create a new module (and put it into the cache)\n \t\tvar module = installedModules[moduleId] = {\n \t\t\ti: moduleId,\n \t\t\tl: false,\n \t\t\texports: {}\n \t\t};\n\n \t\t// Execute the module function\n \t\tmodules[moduleId].call(module.exports, module, module.exports, __webpack_require__);\n\n \t\t// Flag the module as loaded\n \t\tmodule.l = true;\n\n \t\t// Return the exports of the module\n \t\treturn module.exports;\n \t}\n\n\n \t// expose the modules object (__webpack_modules__)\n \t__webpack_require__.m = modules;\n\n \t// expose the module cache\n \t__webpack_require__.c = installedModules;\n\n \t// define getter function for harmony exports\n \t__webpack_require__.d = function(exports, name, getter) {\n \t\tif(!__webpack_require__.o(exports, name)) {\n \t\t\tObject.defineProperty(exports, name, { enumerable: true, get: getter });\n \t\t}\n \t};\n\n \t// define __esModule on exports\n \t__webpack_require__.r = function(exports) {\n \t\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n \t\t\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\n \t\t}\n \t\tObject.defineProperty(exports, '__esModule', { value: true });\n \t};\n\n \t// create a fake namespace object\n \t// mode & 1: value is a module id, require it\n \t// mode & 2: merge all properties of value into the ns\n \t// mode & 4: return value when already ns object\n \t// mode & 8|1: behave like require\n \t__webpack_require__.t = function(value, mode) {\n \t\tif(mode & 1) value = __webpack_require__(value);\n \t\tif(mode & 8) return value;\n \t\tif((mode & 4) && typeof value === 'object' && value && value.__esModule) return value;\n \t\tvar ns = Object.create(null);\n \t\t__webpack_require__.r(ns);\n \t\tObject.defineProperty(ns, 'default', { enumerable: true, value: value });\n \t\tif(mode & 2 && typeof value != 'string') for(var key in value) __webpack_require__.d(ns, key, function(key) { return value[key]; }.bind(null, key));\n \t\treturn ns;\n \t};\n\n \t// getDefaultExport function for compatibility with non-harmony modules\n \t__webpack_require__.n = function(module) {\n \t\tvar getter = module && module.__esModule ?\n \t\t\tfunction getDefault() { return module['default']; } :\n \t\t\tfunction getModuleExports() { return module; };\n \t\t__webpack_require__.d(getter, 'a', getter);\n \t\treturn getter;\n \t};\n\n \t// Object.prototype.hasOwnProperty.call\n \t__webpack_require__.o = function(object, property) { return Object.prototype.hasOwnProperty.call(object, property); };\n\n \t// __webpack_public_path__\n \t__webpack_require__.p = \"\";\n\n\n \t// Load entry module and return exports\n \treturn __webpack_require__(__webpack_require__.s = 7);\n","/** PURE_IMPORTS_START PURE_IMPORTS_END */\nvar __window = typeof window !== 'undefined' && window;\nvar __self = typeof self !== 'undefined' && typeof WorkerGlobalScope !== 'undefined' &&\n self instanceof WorkerGlobalScope && self;\nvar __global = typeof global !== 'undefined' && global;\nvar _root = __window || __global || __self;\n/*@__PURE__*/ (function () {\n if (!_root) {\n throw /*@__PURE__*/ new Error('RxJS could not find any global context (window, self, global)');\n }\n})();\nexport { _root as root };\n//# sourceMappingURL=root.js.map\n","var g;\n\n// This works in non-strict mode\ng = (function() {\n\treturn this;\n})();\n\ntry {\n\t// This works if eval is allowed (see CSP)\n\tg = g || new Function(\"return this\")();\n} catch (e) {\n\t// This works if the window reference is available\n\tif (typeof window === \"object\") g = window;\n}\n\n// g can still be undefined, but nothing to do about it...\n// We return undefined, instead of nothing here, so it's\n// easier to handle this case. if(!global) { ...}\n\nmodule.exports = g;\n","export default function _isPlaceholder(a) {\n return a != null && typeof a === 'object' && a['@@functional/placeholder'] === true;\n}","import _isPlaceholder from './_isPlaceholder.js';\n\n/**\n * Optimized internal one-arity curry function.\n *\n * @private\n * @category Function\n * @param {Function} fn The function to curry.\n * @return {Function} The curried function.\n */\nexport default function _curry1(fn) {\n return function f1(a) {\n if (arguments.length === 0 || _isPlaceholder(a)) {\n return f1;\n } else {\n return fn.apply(this, arguments);\n }\n };\n}","export default function _identity(x) {\n return x;\n}","import _curry1 from './internal/_curry1.js';\nimport _identity from './internal/_identity.js';\n\n/**\n * A function that does nothing but return the parameter supplied to it. Good\n * as a default or placeholder function.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Function\n * @sig a -> a\n * @param {*} x The value to return.\n * @return {*} The input value, `x`.\n * @example\n *\n * R.identity(1); //=> 1\n *\n * const obj = {};\n * R.identity(obj) === obj; //=> true\n * @symb R.identity(a) = a\n */\nvar identity = /*#__PURE__*/_curry1(_identity);\nexport default identity;","export default function _has(prop, obj) {\n return Object.prototype.hasOwnProperty.call(obj, prop);\n}","import _has from './_has.js';\n\nvar toString = Object.prototype.toString;\nvar _isArguments = /*#__PURE__*/function () {\n return toString.call(arguments) === '[object Arguments]' ? function _isArguments(x) {\n return toString.call(x) === '[object Arguments]';\n } : function _isArguments(x) {\n return _has('callee', x);\n };\n}();\n\nexport default _isArguments;","import _curry1 from './internal/_curry1.js';\nimport _has from './internal/_has.js';\nimport _isArguments from './internal/_isArguments.js';\n\n// cover IE < 9 keys issues\nvar hasEnumBug = ! /*#__PURE__*/{ toString: null }.propertyIsEnumerable('toString');\nvar nonEnumerableProps = ['constructor', 'valueOf', 'isPrototypeOf', 'toString', 'propertyIsEnumerable', 'hasOwnProperty', 'toLocaleString'];\n// Safari bug\nvar hasArgsEnumBug = /*#__PURE__*/function () {\n 'use strict';\n\n return arguments.propertyIsEnumerable('length');\n}();\n\nvar contains = function contains(list, item) {\n var idx = 0;\n while (idx < list.length) {\n if (list[idx] === item) {\n return true;\n }\n idx += 1;\n }\n return false;\n};\n\n/**\n * Returns a list containing the names of all the enumerable own properties of\n * the supplied object.\n * Note that the order of the output array is not guaranteed to be consistent\n * across different JS platforms.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Object\n * @sig {k: v} -> [k]\n * @param {Object} obj The object to extract properties from\n * @return {Array} An array of the object's own properties.\n * @see R.keysIn, R.values\n * @example\n *\n * R.keys({a: 1, b: 2, c: 3}); //=> ['a', 'b', 'c']\n */\nvar keys = typeof Object.keys === 'function' && !hasArgsEnumBug ? /*#__PURE__*/_curry1(function keys(obj) {\n return Object(obj) !== obj ? [] : Object.keys(obj);\n}) : /*#__PURE__*/_curry1(function keys(obj) {\n if (Object(obj) !== obj) {\n return [];\n }\n var prop, nIdx;\n var ks = [];\n var checkArgsLength = hasArgsEnumBug && _isArguments(obj);\n for (prop in obj) {\n if (_has(prop, obj) && (!checkArgsLength || prop !== 'length')) {\n ks[ks.length] = prop;\n }\n }\n if (hasEnumBug) {\n nIdx = nonEnumerableProps.length - 1;\n while (nIdx >= 0) {\n prop = nonEnumerableProps[nIdx];\n if (_has(prop, obj) && !contains(ks, prop)) {\n ks[ks.length] = prop;\n }\n nIdx -= 1;\n }\n }\n return ks;\n});\nexport default keys;","import _curry1 from './internal/_curry1.js';\nimport keys from './keys.js';\n\n/**\n * Returns a list of all the enumerable own properties of the supplied object.\n * Note that the order of the output array is not guaranteed across different\n * JS platforms.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Object\n * @sig {k: v} -> [v]\n * @param {Object} obj The object to extract values from\n * @return {Array} An array of the values of the object's own properties.\n * @see R.valuesIn, R.keys\n * @example\n *\n * R.values({a: 1, b: 2, c: 3}); //=> [1, 2, 3]\n */\nvar values = /*#__PURE__*/_curry1(function values(obj) {\n var props = keys(obj);\n var len = props.length;\n var vals = [];\n var idx = 0;\n while (idx < len) {\n vals[idx] = obj[props[idx]];\n idx += 1;\n }\n return vals;\n});\nexport default values;","/*! *****************************************************************************\r\nCopyright (c) Microsoft Corporation. All rights reserved.\r\nLicensed under the Apache License, Version 2.0 (the \"License\"); you may not use\r\nthis file except in compliance with the License. You may obtain a copy of the\r\nLicense at http://www.apache.org/licenses/LICENSE-2.0\r\n\r\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\r\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\r\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\r\nMERCHANTABLITY OR NON-INFRINGEMENT.\r\n\r\nSee the Apache Version 2.0 License for specific language governing permissions\r\nand limitations under the License.\r\n***************************************************************************** */\r\n/* global Reflect, Promise */\r\n\r\nvar extendStatics = function(d, b) {\r\n extendStatics = Object.setPrototypeOf ||\r\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\r\n function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };\r\n return extendStatics(d, b);\r\n};\r\n\r\nexport function __extends(d, b) {\r\n extendStatics(d, b);\r\n function __() { this.constructor = d; }\r\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\r\n}\r\n\r\nexport var __assign = function() {\r\n __assign = Object.assign || function __assign(t) {\r\n for (var s, i = 1, n = arguments.length; i < n; i++) {\r\n s = arguments[i];\r\n for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];\r\n }\r\n return t;\r\n }\r\n return __assign.apply(this, arguments);\r\n}\r\n\r\nexport function __rest(s, e) {\r\n var t = {};\r\n for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0)\r\n t[p] = s[p];\r\n if (s != null && typeof Object.getOwnPropertySymbols === \"function\")\r\n for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) if (e.indexOf(p[i]) < 0)\r\n t[p[i]] = s[p[i]];\r\n return t;\r\n}\r\n\r\nexport function __decorate(decorators, target, key, desc) {\r\n var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\r\n if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\r\n else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;\r\n return c > 3 && r && Object.defineProperty(target, key, r), r;\r\n}\r\n\r\nexport function __param(paramIndex, decorator) {\r\n return function (target, key) { decorator(target, key, paramIndex); }\r\n}\r\n\r\nexport function __metadata(metadataKey, metadataValue) {\r\n if (typeof Reflect === \"object\" && typeof Reflect.metadata === \"function\") return Reflect.metadata(metadataKey, metadataValue);\r\n}\r\n\r\nexport function __awaiter(thisArg, _arguments, P, generator) {\r\n return new (P || (P = Promise))(function (resolve, reject) {\r\n function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\r\n function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\r\n function step(result) { result.done ? resolve(result.value) : new P(function (resolve) { resolve(result.value); }).then(fulfilled, rejected); }\r\n step((generator = generator.apply(thisArg, _arguments || [])).next());\r\n });\r\n}\r\n\r\nexport function __generator(thisArg, body) {\r\n var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;\r\n return g = { next: verb(0), \"throw\": verb(1), \"return\": verb(2) }, typeof Symbol === \"function\" && (g[Symbol.iterator] = function() { return this; }), g;\r\n function verb(n) { return function (v) { return step([n, v]); }; }\r\n function step(op) {\r\n if (f) throw new TypeError(\"Generator is already executing.\");\r\n while (_) try {\r\n if (f = 1, y && (t = op[0] & 2 ? y[\"return\"] : op[0] ? y[\"throw\"] || ((t = y[\"return\"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;\r\n if (y = 0, t) op = [op[0] & 2, t.value];\r\n switch (op[0]) {\r\n case 0: case 1: t = op; break;\r\n case 4: _.label++; return { value: op[1], done: false };\r\n case 5: _.label++; y = op[1]; op = [0]; continue;\r\n case 7: op = _.ops.pop(); _.trys.pop(); continue;\r\n default:\r\n if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }\r\n if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }\r\n if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }\r\n if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }\r\n if (t[2]) _.ops.pop();\r\n _.trys.pop(); continue;\r\n }\r\n op = body.call(thisArg, _);\r\n } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }\r\n if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };\r\n }\r\n}\r\n\r\nexport function __exportStar(m, exports) {\r\n for (var p in m) if (!exports.hasOwnProperty(p)) exports[p] = m[p];\r\n}\r\n\r\nexport function __values(o) {\r\n var m = typeof Symbol === \"function\" && o[Symbol.iterator], i = 0;\r\n if (m) return m.call(o);\r\n return {\r\n next: function () {\r\n if (o && i >= o.length) o = void 0;\r\n return { value: o && o[i++], done: !o };\r\n }\r\n };\r\n}\r\n\r\nexport function __read(o, n) {\r\n var m = typeof Symbol === \"function\" && o[Symbol.iterator];\r\n if (!m) return o;\r\n var i = m.call(o), r, ar = [], e;\r\n try {\r\n while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);\r\n }\r\n catch (error) { e = { error: error }; }\r\n finally {\r\n try {\r\n if (r && !r.done && (m = i[\"return\"])) m.call(i);\r\n }\r\n finally { if (e) throw e.error; }\r\n }\r\n return ar;\r\n}\r\n\r\nexport function __spread() {\r\n for (var ar = [], i = 0; i < arguments.length; i++)\r\n ar = ar.concat(__read(arguments[i]));\r\n return ar;\r\n}\r\n\r\nexport function __await(v) {\r\n return this instanceof __await ? (this.v = v, this) : new __await(v);\r\n}\r\n\r\nexport function __asyncGenerator(thisArg, _arguments, generator) {\r\n if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\r\n var g = generator.apply(thisArg, _arguments || []), i, q = [];\r\n return i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i;\r\n function verb(n) { if (g[n]) i[n] = function (v) { return new Promise(function (a, b) { q.push([n, v, a, b]) > 1 || resume(n, v); }); }; }\r\n function resume(n, v) { try { step(g[n](v)); } catch (e) { settle(q[0][3], e); } }\r\n function step(r) { r.value instanceof __await ? Promise.resolve(r.value.v).then(fulfill, reject) : settle(q[0][2], r); }\r\n function fulfill(value) { resume(\"next\", value); }\r\n function reject(value) { resume(\"throw\", value); }\r\n function settle(f, v) { if (f(v), q.shift(), q.length) resume(q[0][0], q[0][1]); }\r\n}\r\n\r\nexport function __asyncDelegator(o) {\r\n var i, p;\r\n return i = {}, verb(\"next\"), verb(\"throw\", function (e) { throw e; }), verb(\"return\"), i[Symbol.iterator] = function () { return this; }, i;\r\n function verb(n, f) { i[n] = o[n] ? function (v) { return (p = !p) ? { value: __await(o[n](v)), done: n === \"return\" } : f ? f(v) : v; } : f; }\r\n}\r\n\r\nexport function __asyncValues(o) {\r\n if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\r\n var m = o[Symbol.asyncIterator], i;\r\n return m ? m.call(o) : (o = typeof __values === \"function\" ? __values(o) : o[Symbol.iterator](), i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i);\r\n function verb(n) { i[n] = o[n] && function (v) { return new Promise(function (resolve, reject) { v = o[n](v), settle(resolve, reject, v.done, v.value); }); }; }\r\n function settle(resolve, reject, d, v) { Promise.resolve(v).then(function(v) { resolve({ value: v, done: d }); }, reject); }\r\n}\r\n\r\nexport function __makeTemplateObject(cooked, raw) {\r\n if (Object.defineProperty) { Object.defineProperty(cooked, \"raw\", { value: raw }); } else { cooked.raw = raw; }\r\n return cooked;\r\n};\r\n\r\nexport function __importStar(mod) {\r\n if (mod && mod.__esModule) return mod;\r\n var result = {};\r\n if (mod != null) for (var k in mod) if (Object.hasOwnProperty.call(mod, k)) result[k] = mod[k];\r\n result.default = mod;\r\n return result;\r\n}\r\n\r\nexport function __importDefault(mod) {\r\n return (mod && mod.__esModule) ? mod : { default: mod };\r\n}\r\n","/** PURE_IMPORTS_START PURE_IMPORTS_END */\nexport function isFunction(x) {\n return typeof x === 'function';\n}\n//# sourceMappingURL=isFunction.js.map\n","/** PURE_IMPORTS_START PURE_IMPORTS_END */\nvar _enable_super_gross_mode_that_will_cause_bad_things = false;\nexport var config = {\n Promise: undefined,\n set useDeprecatedSynchronousErrorHandling(value) {\n if (value) {\n var error = /*@__PURE__*/ new Error();\n /*@__PURE__*/ console.warn('DEPRECATED! RxJS was set to use deprecated synchronous error handling behavior by code at: \\n' + error.stack);\n }\n else if (_enable_super_gross_mode_that_will_cause_bad_things) {\n /*@__PURE__*/ console.log('RxJS: Back to a better error behavior. Thank you. <3');\n }\n _enable_super_gross_mode_that_will_cause_bad_things = value;\n },\n get useDeprecatedSynchronousErrorHandling() {\n return _enable_super_gross_mode_that_will_cause_bad_things;\n },\n};\n//# sourceMappingURL=config.js.map\n","/** PURE_IMPORTS_START PURE_IMPORTS_END */\nexport function hostReportError(err) {\n setTimeout(function () { throw err; }, 0);\n}\n//# sourceMappingURL=hostReportError.js.map\n","/** PURE_IMPORTS_START _config,_util_hostReportError PURE_IMPORTS_END */\nimport { config } from './config';\nimport { hostReportError } from './util/hostReportError';\nexport var empty = {\n closed: true,\n next: function (value) { },\n error: function (err) {\n if (config.useDeprecatedSynchronousErrorHandling) {\n throw err;\n }\n else {\n hostReportError(err);\n }\n },\n complete: function () { }\n};\n//# sourceMappingURL=Observer.js.map\n","/** PURE_IMPORTS_START PURE_IMPORTS_END */\nexport var isArray = /*@__PURE__*/ (function () { return Array.isArray || (function (x) { return x && typeof x.length === 'number'; }); })();\n//# sourceMappingURL=isArray.js.map\n","/** PURE_IMPORTS_START PURE_IMPORTS_END */\nexport function isObject(x) {\n return x !== null && typeof x === 'object';\n}\n//# sourceMappingURL=isObject.js.map\n","/** PURE_IMPORTS_START PURE_IMPORTS_END */\nvar UnsubscriptionErrorImpl = /*@__PURE__*/ (function () {\n function UnsubscriptionErrorImpl(errors) {\n Error.call(this);\n this.message = errors ?\n errors.length + \" errors occurred during unsubscription:\\n\" + errors.map(function (err, i) { return i + 1 + \") \" + err.toString(); }).join('\\n ') : '';\n this.name = 'UnsubscriptionError';\n this.errors = errors;\n return this;\n }\n UnsubscriptionErrorImpl.prototype = /*@__PURE__*/ Object.create(Error.prototype);\n return UnsubscriptionErrorImpl;\n})();\nexport var UnsubscriptionError = UnsubscriptionErrorImpl;\n//# sourceMappingURL=UnsubscriptionError.js.map\n","/** PURE_IMPORTS_START _util_isArray,_util_isObject,_util_isFunction,_util_UnsubscriptionError PURE_IMPORTS_END */\nimport { isArray } from './util/isArray';\nimport { isObject } from './util/isObject';\nimport { isFunction } from './util/isFunction';\nimport { UnsubscriptionError } from './util/UnsubscriptionError';\nvar Subscription = /*@__PURE__*/ (function () {\n function Subscription(unsubscribe) {\n this.closed = false;\n this._parentOrParents = null;\n this._subscriptions = null;\n if (unsubscribe) {\n this._unsubscribe = unsubscribe;\n }\n }\n Subscription.prototype.unsubscribe = function () {\n var errors;\n if (this.closed) {\n return;\n }\n var _a = this, _parentOrParents = _a._parentOrParents, _unsubscribe = _a._unsubscribe, _subscriptions = _a._subscriptions;\n this.closed = true;\n this._parentOrParents = null;\n this._subscriptions = null;\n if (_parentOrParents instanceof Subscription) {\n _parentOrParents.remove(this);\n }\n else if (_parentOrParents !== null) {\n for (var index = 0; index < _parentOrParents.length; ++index) {\n var parent_1 = _parentOrParents[index];\n parent_1.remove(this);\n }\n }\n if (isFunction(_unsubscribe)) {\n try {\n _unsubscribe.call(this);\n }\n catch (e) {\n errors = e instanceof UnsubscriptionError ? flattenUnsubscriptionErrors(e.errors) : [e];\n }\n }\n if (isArray(_subscriptions)) {\n var index = -1;\n var len = _subscriptions.length;\n while (++index < len) {\n var sub = _subscriptions[index];\n if (isObject(sub)) {\n try {\n sub.unsubscribe();\n }\n catch (e) {\n errors = errors || [];\n if (e instanceof UnsubscriptionError) {\n errors = errors.concat(flattenUnsubscriptionErrors(e.errors));\n }\n else {\n errors.push(e);\n }\n }\n }\n }\n }\n if (errors) {\n throw new UnsubscriptionError(errors);\n }\n };\n Subscription.prototype.add = function (teardown) {\n var subscription = teardown;\n if (!teardown) {\n return Subscription.EMPTY;\n }\n switch (typeof teardown) {\n case 'function':\n subscription = new Subscription(teardown);\n case 'object':\n if (subscription === this || subscription.closed || typeof subscription.unsubscribe !== 'function') {\n return subscription;\n }\n else if (this.closed) {\n subscription.unsubscribe();\n return subscription;\n }\n else if (!(subscription instanceof Subscription)) {\n var tmp = subscription;\n subscription = new Subscription();\n subscription._subscriptions = [tmp];\n }\n break;\n default: {\n throw new Error('unrecognized teardown ' + teardown + ' added to Subscription.');\n }\n }\n var _parentOrParents = subscription._parentOrParents;\n if (_parentOrParents === null) {\n subscription._parentOrParents = this;\n }\n else if (_parentOrParents instanceof Subscription) {\n if (_parentOrParents === this) {\n return subscription;\n }\n subscription._parentOrParents = [_parentOrParents, this];\n }\n else if (_parentOrParents.indexOf(this) === -1) {\n _parentOrParents.push(this);\n }\n else {\n return subscription;\n }\n var subscriptions = this._subscriptions;\n if (subscriptions === null) {\n this._subscriptions = [subscription];\n }\n else {\n subscriptions.push(subscription);\n }\n return subscription;\n };\n Subscription.prototype.remove = function (subscription) {\n var subscriptions = this._subscriptions;\n if (subscriptions) {\n var subscriptionIndex = subscriptions.indexOf(subscription);\n if (subscriptionIndex !== -1) {\n subscriptions.splice(subscriptionIndex, 1);\n }\n }\n };\n Subscription.EMPTY = (function (empty) {\n empty.closed = true;\n return empty;\n }(new Subscription()));\n return Subscription;\n}());\nexport { Subscription };\nfunction flattenUnsubscriptionErrors(errors) {\n return errors.reduce(function (errs, err) { return errs.concat((err instanceof UnsubscriptionError) ? err.errors : err); }, []);\n}\n//# sourceMappingURL=Subscription.js.map\n","/** PURE_IMPORTS_START PURE_IMPORTS_END */\nexport var rxSubscriber = /*@__PURE__*/ (function () {\n return typeof Symbol === 'function'\n ? /*@__PURE__*/ Symbol('rxSubscriber')\n : '@@rxSubscriber_' + /*@__PURE__*/ Math.random();\n})();\nexport var $$rxSubscriber = rxSubscriber;\n//# sourceMappingURL=rxSubscriber.js.map\n","/** PURE_IMPORTS_START tslib,_util_isFunction,_Observer,_Subscription,_internal_symbol_rxSubscriber,_config,_util_hostReportError PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { isFunction } from './util/isFunction';\nimport { empty as emptyObserver } from './Observer';\nimport { Subscription } from './Subscription';\nimport { rxSubscriber as rxSubscriberSymbol } from '../internal/symbol/rxSubscriber';\nimport { config } from './config';\nimport { hostReportError } from './util/hostReportError';\nvar Subscriber = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(Subscriber, _super);\n function Subscriber(destinationOrNext, error, complete) {\n var _this = _super.call(this) || this;\n _this.syncErrorValue = null;\n _this.syncErrorThrown = false;\n _this.syncErrorThrowable = false;\n _this.isStopped = false;\n switch (arguments.length) {\n case 0:\n _this.destination = emptyObserver;\n break;\n case 1:\n if (!destinationOrNext) {\n _this.destination = emptyObserver;\n break;\n }\n if (typeof destinationOrNext === 'object') {\n if (destinationOrNext instanceof Subscriber) {\n _this.syncErrorThrowable = destinationOrNext.syncErrorThrowable;\n _this.destination = destinationOrNext;\n destinationOrNext.add(_this);\n }\n else {\n _this.syncErrorThrowable = true;\n _this.destination = new SafeSubscriber(_this, destinationOrNext);\n }\n break;\n }\n default:\n _this.syncErrorThrowable = true;\n _this.destination = new SafeSubscriber(_this, destinationOrNext, error, complete);\n break;\n }\n return _this;\n }\n Subscriber.prototype[rxSubscriberSymbol] = function () { return this; };\n Subscriber.create = function (next, error, complete) {\n var subscriber = new Subscriber(next, error, complete);\n subscriber.syncErrorThrowable = false;\n return subscriber;\n };\n Subscriber.prototype.next = function (value) {\n if (!this.isStopped) {\n this._next(value);\n }\n };\n Subscriber.prototype.error = function (err) {\n if (!this.isStopped) {\n this.isStopped = true;\n this._error(err);\n }\n };\n Subscriber.prototype.complete = function () {\n if (!this.isStopped) {\n this.isStopped = true;\n this._complete();\n }\n };\n Subscriber.prototype.unsubscribe = function () {\n if (this.closed) {\n return;\n }\n this.isStopped = true;\n _super.prototype.unsubscribe.call(this);\n };\n Subscriber.prototype._next = function (value) {\n this.destination.next(value);\n };\n Subscriber.prototype._error = function (err) {\n this.destination.error(err);\n this.unsubscribe();\n };\n Subscriber.prototype._complete = function () {\n this.destination.complete();\n this.unsubscribe();\n };\n Subscriber.prototype._unsubscribeAndRecycle = function () {\n var _parentOrParents = this._parentOrParents;\n this._parentOrParents = null;\n this.unsubscribe();\n this.closed = false;\n this.isStopped = false;\n this._parentOrParents = _parentOrParents;\n return this;\n };\n return Subscriber;\n}(Subscription));\nexport { Subscriber };\nvar SafeSubscriber = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(SafeSubscriber, _super);\n function SafeSubscriber(_parentSubscriber, observerOrNext, error, complete) {\n var _this = _super.call(this) || this;\n _this._parentSubscriber = _parentSubscriber;\n var next;\n var context = _this;\n if (isFunction(observerOrNext)) {\n next = observerOrNext;\n }\n else if (observerOrNext) {\n next = observerOrNext.next;\n error = observerOrNext.error;\n complete = observerOrNext.complete;\n if (observerOrNext !== emptyObserver) {\n context = Object.create(observerOrNext);\n if (isFunction(context.unsubscribe)) {\n _this.add(context.unsubscribe.bind(context));\n }\n context.unsubscribe = _this.unsubscribe.bind(_this);\n }\n }\n _this._context = context;\n _this._next = next;\n _this._error = error;\n _this._complete = complete;\n return _this;\n }\n SafeSubscriber.prototype.next = function (value) {\n if (!this.isStopped && this._next) {\n var _parentSubscriber = this._parentSubscriber;\n if (!config.useDeprecatedSynchronousErrorHandling || !_parentSubscriber.syncErrorThrowable) {\n this.__tryOrUnsub(this._next, value);\n }\n else if (this.__tryOrSetError(_parentSubscriber, this._next, value)) {\n this.unsubscribe();\n }\n }\n };\n SafeSubscriber.prototype.error = function (err) {\n if (!this.isStopped) {\n var _parentSubscriber = this._parentSubscriber;\n var useDeprecatedSynchronousErrorHandling = config.useDeprecatedSynchronousErrorHandling;\n if (this._error) {\n if (!useDeprecatedSynchronousErrorHandling || !_parentSubscriber.syncErrorThrowable) {\n this.__tryOrUnsub(this._error, err);\n this.unsubscribe();\n }\n else {\n this.__tryOrSetError(_parentSubscriber, this._error, err);\n this.unsubscribe();\n }\n }\n else if (!_parentSubscriber.syncErrorThrowable) {\n this.unsubscribe();\n if (useDeprecatedSynchronousErrorHandling) {\n throw err;\n }\n hostReportError(err);\n }\n else {\n if (useDeprecatedSynchronousErrorHandling) {\n _parentSubscriber.syncErrorValue = err;\n _parentSubscriber.syncErrorThrown = true;\n }\n else {\n hostReportError(err);\n }\n this.unsubscribe();\n }\n }\n };\n SafeSubscriber.prototype.complete = function () {\n var _this = this;\n if (!this.isStopped) {\n var _parentSubscriber = this._parentSubscriber;\n if (this._complete) {\n var wrappedComplete = function () { return _this._complete.call(_this._context); };\n if (!config.useDeprecatedSynchronousErrorHandling || !_parentSubscriber.syncErrorThrowable) {\n this.__tryOrUnsub(wrappedComplete);\n this.unsubscribe();\n }\n else {\n this.__tryOrSetError(_parentSubscriber, wrappedComplete);\n this.unsubscribe();\n }\n }\n else {\n this.unsubscribe();\n }\n }\n };\n SafeSubscriber.prototype.__tryOrUnsub = function (fn, value) {\n try {\n fn.call(this._context, value);\n }\n catch (err) {\n this.unsubscribe();\n if (config.useDeprecatedSynchronousErrorHandling) {\n throw err;\n }\n else {\n hostReportError(err);\n }\n }\n };\n SafeSubscriber.prototype.__tryOrSetError = function (parent, fn, value) {\n if (!config.useDeprecatedSynchronousErrorHandling) {\n throw new Error('bad call');\n }\n try {\n fn.call(this._context, value);\n }\n catch (err) {\n if (config.useDeprecatedSynchronousErrorHandling) {\n parent.syncErrorValue = err;\n parent.syncErrorThrown = true;\n return true;\n }\n else {\n hostReportError(err);\n return true;\n }\n }\n return false;\n };\n SafeSubscriber.prototype._unsubscribe = function () {\n var _parentSubscriber = this._parentSubscriber;\n this._context = null;\n this._parentSubscriber = null;\n _parentSubscriber.unsubscribe();\n };\n return SafeSubscriber;\n}(Subscriber));\nexport { SafeSubscriber };\n//# sourceMappingURL=Subscriber.js.map\n","/** PURE_IMPORTS_START PURE_IMPORTS_END */\nexport var observable = /*@__PURE__*/ (function () { return typeof Symbol === 'function' && Symbol.observable || '@@observable'; })();\n//# sourceMappingURL=observable.js.map\n","/** PURE_IMPORTS_START PURE_IMPORTS_END */\nexport function noop() { }\n//# sourceMappingURL=noop.js.map\n","/** PURE_IMPORTS_START _noop PURE_IMPORTS_END */\nimport { noop } from './noop';\nexport function pipe() {\n var fns = [];\n for (var _i = 0; _i < arguments.length; _i++) {\n fns[_i] = arguments[_i];\n }\n return pipeFromArray(fns);\n}\nexport function pipeFromArray(fns) {\n if (!fns) {\n return noop;\n }\n if (fns.length === 1) {\n return fns[0];\n }\n return function piped(input) {\n return fns.reduce(function (prev, fn) { return fn(prev); }, input);\n };\n}\n//# sourceMappingURL=pipe.js.map\n","/** PURE_IMPORTS_START _util_canReportError,_util_toSubscriber,_symbol_observable,_util_pipe,_config PURE_IMPORTS_END */\nimport { canReportError } from './util/canReportError';\nimport { toSubscriber } from './util/toSubscriber';\nimport { observable as Symbol_observable } from './symbol/observable';\nimport { pipeFromArray } from './util/pipe';\nimport { config } from './config';\nvar Observable = /*@__PURE__*/ (function () {\n function Observable(subscribe) {\n this._isScalar = false;\n if (subscribe) {\n this._subscribe = subscribe;\n }\n }\n Observable.prototype.lift = function (operator) {\n var observable = new Observable();\n observable.source = this;\n observable.operator = operator;\n return observable;\n };\n Observable.prototype.subscribe = function (observerOrNext, error, complete) {\n var operator = this.operator;\n var sink = toSubscriber(observerOrNext, error, complete);\n if (operator) {\n sink.add(operator.call(sink, this.source));\n }\n else {\n sink.add(this.source || (config.useDeprecatedSynchronousErrorHandling && !sink.syncErrorThrowable) ?\n this._subscribe(sink) :\n this._trySubscribe(sink));\n }\n if (config.useDeprecatedSynchronousErrorHandling) {\n if (sink.syncErrorThrowable) {\n sink.syncErrorThrowable = false;\n if (sink.syncErrorThrown) {\n throw sink.syncErrorValue;\n }\n }\n }\n return sink;\n };\n Observable.prototype._trySubscribe = function (sink) {\n try {\n return this._subscribe(sink);\n }\n catch (err) {\n if (config.useDeprecatedSynchronousErrorHandling) {\n sink.syncErrorThrown = true;\n sink.syncErrorValue = err;\n }\n if (canReportError(sink)) {\n sink.error(err);\n }\n else {\n console.warn(err);\n }\n }\n };\n Observable.prototype.forEach = function (next, promiseCtor) {\n var _this = this;\n promiseCtor = getPromiseCtor(promiseCtor);\n return new promiseCtor(function (resolve, reject) {\n var subscription;\n subscription = _this.subscribe(function (value) {\n try {\n next(value);\n }\n catch (err) {\n reject(err);\n if (subscription) {\n subscription.unsubscribe();\n }\n }\n }, reject, resolve);\n });\n };\n Observable.prototype._subscribe = function (subscriber) {\n var source = this.source;\n return source && source.subscribe(subscriber);\n };\n Observable.prototype[Symbol_observable] = function () {\n return this;\n };\n Observable.prototype.pipe = function () {\n var operations = [];\n for (var _i = 0; _i < arguments.length; _i++) {\n operations[_i] = arguments[_i];\n }\n if (operations.length === 0) {\n return this;\n }\n return pipeFromArray(operations)(this);\n };\n Observable.prototype.toPromise = function (promiseCtor) {\n var _this = this;\n promiseCtor = getPromiseCtor(promiseCtor);\n return new promiseCtor(function (resolve, reject) {\n var value;\n _this.subscribe(function (x) { return value = x; }, function (err) { return reject(err); }, function () { return resolve(value); });\n });\n };\n Observable.create = function (subscribe) {\n return new Observable(subscribe);\n };\n return Observable;\n}());\nexport { Observable };\nfunction getPromiseCtor(promiseCtor) {\n if (!promiseCtor) {\n promiseCtor = config.Promise || Promise;\n }\n if (!promiseCtor) {\n throw new Error('no Promise impl found');\n }\n return promiseCtor;\n}\n//# sourceMappingURL=Observable.js.map\n","/** PURE_IMPORTS_START _Subscriber,_symbol_rxSubscriber,_Observer PURE_IMPORTS_END */\nimport { Subscriber } from '../Subscriber';\nimport { rxSubscriber as rxSubscriberSymbol } from '../symbol/rxSubscriber';\nimport { empty as emptyObserver } from '../Observer';\nexport function toSubscriber(nextOrObserver, error, complete) {\n if (nextOrObserver) {\n if (nextOrObserver instanceof Subscriber) {\n return nextOrObserver;\n }\n if (nextOrObserver[rxSubscriberSymbol]) {\n return nextOrObserver[rxSubscriberSymbol]();\n }\n }\n if (!nextOrObserver && !error && !complete) {\n return new Subscriber(emptyObserver);\n }\n return new Subscriber(nextOrObserver, error, complete);\n}\n//# sourceMappingURL=toSubscriber.js.map\n","/** PURE_IMPORTS_START _Subscriber PURE_IMPORTS_END */\nimport { Subscriber } from '../Subscriber';\nexport function canReportError(observer) {\n while (observer) {\n var _a = observer, closed_1 = _a.closed, destination = _a.destination, isStopped = _a.isStopped;\n if (closed_1 || isStopped) {\n return false;\n }\n else if (destination && destination instanceof Subscriber) {\n observer = destination;\n }\n else {\n observer = null;\n }\n }\n return true;\n}\n//# sourceMappingURL=canReportError.js.map\n","/** PURE_IMPORTS_START PURE_IMPORTS_END */\nvar ObjectUnsubscribedErrorImpl = /*@__PURE__*/ (function () {\n function ObjectUnsubscribedErrorImpl() {\n Error.call(this);\n this.message = 'object unsubscribed';\n this.name = 'ObjectUnsubscribedError';\n return this;\n }\n ObjectUnsubscribedErrorImpl.prototype = /*@__PURE__*/ Object.create(Error.prototype);\n return ObjectUnsubscribedErrorImpl;\n})();\nexport var ObjectUnsubscribedError = ObjectUnsubscribedErrorImpl;\n//# sourceMappingURL=ObjectUnsubscribedError.js.map\n","/** PURE_IMPORTS_START tslib,_Subscription PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { Subscription } from './Subscription';\nvar SubjectSubscription = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(SubjectSubscription, _super);\n function SubjectSubscription(subject, subscriber) {\n var _this = _super.call(this) || this;\n _this.subject = subject;\n _this.subscriber = subscriber;\n _this.closed = false;\n return _this;\n }\n SubjectSubscription.prototype.unsubscribe = function () {\n if (this.closed) {\n return;\n }\n this.closed = true;\n var subject = this.subject;\n var observers = subject.observers;\n this.subject = null;\n if (!observers || observers.length === 0 || subject.isStopped || subject.closed) {\n return;\n }\n var subscriberIndex = observers.indexOf(this.subscriber);\n if (subscriberIndex !== -1) {\n observers.splice(subscriberIndex, 1);\n }\n };\n return SubjectSubscription;\n}(Subscription));\nexport { SubjectSubscription };\n//# sourceMappingURL=SubjectSubscription.js.map\n","/** PURE_IMPORTS_START tslib,_Observable,_Subscriber,_Subscription,_util_ObjectUnsubscribedError,_SubjectSubscription,_internal_symbol_rxSubscriber PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { Observable } from './Observable';\nimport { Subscriber } from './Subscriber';\nimport { Subscription } from './Subscription';\nimport { ObjectUnsubscribedError } from './util/ObjectUnsubscribedError';\nimport { SubjectSubscription } from './SubjectSubscription';\nimport { rxSubscriber as rxSubscriberSymbol } from '../internal/symbol/rxSubscriber';\nvar SubjectSubscriber = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(SubjectSubscriber, _super);\n function SubjectSubscriber(destination) {\n var _this = _super.call(this, destination) || this;\n _this.destination = destination;\n return _this;\n }\n return SubjectSubscriber;\n}(Subscriber));\nexport { SubjectSubscriber };\nvar Subject = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(Subject, _super);\n function Subject() {\n var _this = _super.call(this) || this;\n _this.observers = [];\n _this.closed = false;\n _this.isStopped = false;\n _this.hasError = false;\n _this.thrownError = null;\n return _this;\n }\n Subject.prototype[rxSubscriberSymbol] = function () {\n return new SubjectSubscriber(this);\n };\n Subject.prototype.lift = function (operator) {\n var subject = new AnonymousSubject(this, this);\n subject.operator = operator;\n return subject;\n };\n Subject.prototype.next = function (value) {\n if (this.closed) {\n throw new ObjectUnsubscribedError();\n }\n if (!this.isStopped) {\n var observers = this.observers;\n var len = observers.length;\n var copy = observers.slice();\n for (var i = 0; i < len; i++) {\n copy[i].next(value);\n }\n }\n };\n Subject.prototype.error = function (err) {\n if (this.closed) {\n throw new ObjectUnsubscribedError();\n }\n this.hasError = true;\n this.thrownError = err;\n this.isStopped = true;\n var observers = this.observers;\n var len = observers.length;\n var copy = observers.slice();\n for (var i = 0; i < len; i++) {\n copy[i].error(err);\n }\n this.observers.length = 0;\n };\n Subject.prototype.complete = function () {\n if (this.closed) {\n throw new ObjectUnsubscribedError();\n }\n this.isStopped = true;\n var observers = this.observers;\n var len = observers.length;\n var copy = observers.slice();\n for (var i = 0; i < len; i++) {\n copy[i].complete();\n }\n this.observers.length = 0;\n };\n Subject.prototype.unsubscribe = function () {\n this.isStopped = true;\n this.closed = true;\n this.observers = null;\n };\n Subject.prototype._trySubscribe = function (subscriber) {\n if (this.closed) {\n throw new ObjectUnsubscribedError();\n }\n else {\n return _super.prototype._trySubscribe.call(this, subscriber);\n }\n };\n Subject.prototype._subscribe = function (subscriber) {\n if (this.closed) {\n throw new ObjectUnsubscribedError();\n }\n else if (this.hasError) {\n subscriber.error(this.thrownError);\n return Subscription.EMPTY;\n }\n else if (this.isStopped) {\n subscriber.complete();\n return Subscription.EMPTY;\n }\n else {\n this.observers.push(subscriber);\n return new SubjectSubscription(this, subscriber);\n }\n };\n Subject.prototype.asObservable = function () {\n var observable = new Observable();\n observable.source = this;\n return observable;\n };\n Subject.create = function (destination, source) {\n return new AnonymousSubject(destination, source);\n };\n return Subject;\n}(Observable));\nexport { Subject };\nvar AnonymousSubject = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(AnonymousSubject, _super);\n function AnonymousSubject(destination, source) {\n var _this = _super.call(this) || this;\n _this.destination = destination;\n _this.source = source;\n return _this;\n }\n AnonymousSubject.prototype.next = function (value) {\n var destination = this.destination;\n if (destination && destination.next) {\n destination.next(value);\n }\n };\n AnonymousSubject.prototype.error = function (err) {\n var destination = this.destination;\n if (destination && destination.error) {\n this.destination.error(err);\n }\n };\n AnonymousSubject.prototype.complete = function () {\n var destination = this.destination;\n if (destination && destination.complete) {\n this.destination.complete();\n }\n };\n AnonymousSubject.prototype._subscribe = function (subscriber) {\n var source = this.source;\n if (source) {\n return this.source.subscribe(subscriber);\n }\n else {\n return Subscription.EMPTY;\n }\n };\n return AnonymousSubject;\n}(Subject));\nexport { AnonymousSubject };\n//# sourceMappingURL=Subject.js.map\n","/** PURE_IMPORTS_START PURE_IMPORTS_END */\nexport function isScheduler(value) {\n return value && typeof value.schedule === 'function';\n}\n//# sourceMappingURL=isScheduler.js.map\n","/** PURE_IMPORTS_START PURE_IMPORTS_END */\nexport var subscribeToArray = function (array) {\n return function (subscriber) {\n for (var i = 0, len = array.length; i < len && !subscriber.closed; i++) {\n subscriber.next(array[i]);\n }\n subscriber.complete();\n };\n};\n//# sourceMappingURL=subscribeToArray.js.map\n","/** PURE_IMPORTS_START _Observable,_Subscription PURE_IMPORTS_END */\nimport { Observable } from '../Observable';\nimport { Subscription } from '../Subscription';\nexport function scheduleArray(input, scheduler) {\n return new Observable(function (subscriber) {\n var sub = new Subscription();\n var i = 0;\n sub.add(scheduler.schedule(function () {\n if (i === input.length) {\n subscriber.complete();\n return;\n }\n subscriber.next(input[i++]);\n if (!subscriber.closed) {\n sub.add(this.schedule());\n }\n }));\n return sub;\n });\n}\n//# sourceMappingURL=scheduleArray.js.map\n","/** PURE_IMPORTS_START _Observable,_util_subscribeToArray,_scheduled_scheduleArray PURE_IMPORTS_END */\nimport { Observable } from '../Observable';\nimport { subscribeToArray } from '../util/subscribeToArray';\nimport { scheduleArray } from '../scheduled/scheduleArray';\nexport function fromArray(input, scheduler) {\n if (!scheduler) {\n return new Observable(subscribeToArray(input));\n }\n else {\n return scheduleArray(input, scheduler);\n }\n}\n//# sourceMappingURL=fromArray.js.map\n","/** PURE_IMPORTS_START _util_isScheduler,_fromArray,_scheduled_scheduleArray PURE_IMPORTS_END */\nimport { isScheduler } from '../util/isScheduler';\nimport { fromArray } from './fromArray';\nimport { scheduleArray } from '../scheduled/scheduleArray';\nexport function of() {\n var args = [];\n for (var _i = 0; _i < arguments.length; _i++) {\n args[_i] = arguments[_i];\n }\n var scheduler = args[args.length - 1];\n if (isScheduler(scheduler)) {\n args.pop();\n return scheduleArray(args, scheduler);\n }\n else {\n return fromArray(args);\n }\n}\n//# sourceMappingURL=of.js.map\n","/** PURE_IMPORTS_START _Observable PURE_IMPORTS_END */\nimport { Observable } from '../Observable';\nexport var EMPTY = /*@__PURE__*/ new Observable(function (subscriber) { return subscriber.complete(); });\nexport function empty(scheduler) {\n return scheduler ? emptyScheduled(scheduler) : EMPTY;\n}\nfunction emptyScheduled(scheduler) {\n return new Observable(function (subscriber) { return scheduler.schedule(function () { return subscriber.complete(); }); });\n}\n//# sourceMappingURL=empty.js.map\n","/** PURE_IMPORTS_START tslib,_Subscriber PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { Subscriber } from '../Subscriber';\nexport function map(project, thisArg) {\n return function mapOperation(source) {\n if (typeof project !== 'function') {\n throw new TypeError('argument is not a function. Are you looking for `mapTo()`?');\n }\n return source.lift(new MapOperator(project, thisArg));\n };\n}\nvar MapOperator = /*@__PURE__*/ (function () {\n function MapOperator(project, thisArg) {\n this.project = project;\n this.thisArg = thisArg;\n }\n MapOperator.prototype.call = function (subscriber, source) {\n return source.subscribe(new MapSubscriber(subscriber, this.project, this.thisArg));\n };\n return MapOperator;\n}());\nexport { MapOperator };\nvar MapSubscriber = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(MapSubscriber, _super);\n function MapSubscriber(destination, project, thisArg) {\n var _this = _super.call(this, destination) || this;\n _this.project = project;\n _this.count = 0;\n _this.thisArg = thisArg || _this;\n return _this;\n }\n MapSubscriber.prototype._next = function (value) {\n var result;\n try {\n result = this.project.call(this.thisArg, value, this.count++);\n }\n catch (err) {\n this.destination.error(err);\n return;\n }\n this.destination.next(result);\n };\n return MapSubscriber;\n}(Subscriber));\n//# sourceMappingURL=map.js.map\n","/** PURE_IMPORTS_START PURE_IMPORTS_END */\nexport function getSymbolIterator() {\n if (typeof Symbol !== 'function' || !Symbol.iterator) {\n return '@@iterator';\n }\n return Symbol.iterator;\n}\nexport var iterator = /*@__PURE__*/ getSymbolIterator();\nexport var $$iterator = iterator;\n//# sourceMappingURL=iterator.js.map\n","/** PURE_IMPORTS_START PURE_IMPORTS_END */\nexport var isArrayLike = (function (x) { return x && typeof x.length === 'number' && typeof x !== 'function'; });\n//# sourceMappingURL=isArrayLike.js.map\n","/** PURE_IMPORTS_START PURE_IMPORTS_END */\nexport function isPromise(value) {\n return !!value && typeof value.subscribe !== 'function' && typeof value.then === 'function';\n}\n//# sourceMappingURL=isPromise.js.map\n","/** PURE_IMPORTS_START _subscribeToArray,_subscribeToPromise,_subscribeToIterable,_subscribeToObservable,_isArrayLike,_isPromise,_isObject,_symbol_iterator,_symbol_observable PURE_IMPORTS_END */\nimport { subscribeToArray } from './subscribeToArray';\nimport { subscribeToPromise } from './subscribeToPromise';\nimport { subscribeToIterable } from './subscribeToIterable';\nimport { subscribeToObservable } from './subscribeToObservable';\nimport { isArrayLike } from './isArrayLike';\nimport { isPromise } from './isPromise';\nimport { isObject } from './isObject';\nimport { iterator as Symbol_iterator } from '../symbol/iterator';\nimport { observable as Symbol_observable } from '../symbol/observable';\nexport var subscribeTo = function (result) {\n if (!!result && typeof result[Symbol_observable] === 'function') {\n return subscribeToObservable(result);\n }\n else if (isArrayLike(result)) {\n return subscribeToArray(result);\n }\n else if (isPromise(result)) {\n return subscribeToPromise(result);\n }\n else if (!!result && typeof result[Symbol_iterator] === 'function') {\n return subscribeToIterable(result);\n }\n else {\n var value = isObject(result) ? 'an invalid object' : \"'\" + result + \"'\";\n var msg = \"You provided \" + value + \" where a stream was expected.\"\n + ' You can provide an Observable, Promise, Array, or Iterable.';\n throw new TypeError(msg);\n }\n};\n//# sourceMappingURL=subscribeTo.js.map\n","/** PURE_IMPORTS_START _symbol_observable PURE_IMPORTS_END */\nimport { observable as Symbol_observable } from '../symbol/observable';\nexport var subscribeToObservable = function (obj) {\n return function (subscriber) {\n var obs = obj[Symbol_observable]();\n if (typeof obs.subscribe !== 'function') {\n throw new TypeError('Provided object does not correctly implement Symbol.observable');\n }\n else {\n return obs.subscribe(subscriber);\n }\n };\n};\n//# sourceMappingURL=subscribeToObservable.js.map\n","/** PURE_IMPORTS_START _hostReportError PURE_IMPORTS_END */\nimport { hostReportError } from './hostReportError';\nexport var subscribeToPromise = function (promise) {\n return function (subscriber) {\n promise.then(function (value) {\n if (!subscriber.closed) {\n subscriber.next(value);\n subscriber.complete();\n }\n }, function (err) { return subscriber.error(err); })\n .then(null, hostReportError);\n return subscriber;\n };\n};\n//# sourceMappingURL=subscribeToPromise.js.map\n","/** PURE_IMPORTS_START _symbol_iterator PURE_IMPORTS_END */\nimport { iterator as Symbol_iterator } from '../symbol/iterator';\nexport var subscribeToIterable = function (iterable) {\n return function (subscriber) {\n var iterator = iterable[Symbol_iterator]();\n do {\n var item = iterator.next();\n if (item.done) {\n subscriber.complete();\n break;\n }\n subscriber.next(item.value);\n if (subscriber.closed) {\n break;\n }\n } while (true);\n if (typeof iterator.return === 'function') {\n subscriber.add(function () {\n if (iterator.return) {\n iterator.return();\n }\n });\n }\n return subscriber;\n };\n};\n//# sourceMappingURL=subscribeToIterable.js.map\n","/** PURE_IMPORTS_START _scheduleObservable,_schedulePromise,_scheduleArray,_scheduleIterable,_util_isInteropObservable,_util_isPromise,_util_isArrayLike,_util_isIterable PURE_IMPORTS_END */\nimport { scheduleObservable } from './scheduleObservable';\nimport { schedulePromise } from './schedulePromise';\nimport { scheduleArray } from './scheduleArray';\nimport { scheduleIterable } from './scheduleIterable';\nimport { isInteropObservable } from '../util/isInteropObservable';\nimport { isPromise } from '../util/isPromise';\nimport { isArrayLike } from '../util/isArrayLike';\nimport { isIterable } from '../util/isIterable';\nexport function scheduled(input, scheduler) {\n if (input != null) {\n if (isInteropObservable(input)) {\n return scheduleObservable(input, scheduler);\n }\n else if (isPromise(input)) {\n return schedulePromise(input, scheduler);\n }\n else if (isArrayLike(input)) {\n return scheduleArray(input, scheduler);\n }\n else if (isIterable(input) || typeof input === 'string') {\n return scheduleIterable(input, scheduler);\n }\n }\n throw new TypeError((input !== null && typeof input || input) + ' is not observable');\n}\n//# sourceMappingURL=scheduled.js.map\n","/** PURE_IMPORTS_START _symbol_observable PURE_IMPORTS_END */\nimport { observable as Symbol_observable } from '../symbol/observable';\nexport function isInteropObservable(input) {\n return input && typeof input[Symbol_observable] === 'function';\n}\n//# sourceMappingURL=isInteropObservable.js.map\n","/** PURE_IMPORTS_START _Observable,_Subscription,_symbol_observable PURE_IMPORTS_END */\nimport { Observable } from '../Observable';\nimport { Subscription } from '../Subscription';\nimport { observable as Symbol_observable } from '../symbol/observable';\nexport function scheduleObservable(input, scheduler) {\n return new Observable(function (subscriber) {\n var sub = new Subscription();\n sub.add(scheduler.schedule(function () {\n var observable = input[Symbol_observable]();\n sub.add(observable.subscribe({\n next: function (value) { sub.add(scheduler.schedule(function () { return subscriber.next(value); })); },\n error: function (err) { sub.add(scheduler.schedule(function () { return subscriber.error(err); })); },\n complete: function () { sub.add(scheduler.schedule(function () { return subscriber.complete(); })); },\n }));\n }));\n return sub;\n });\n}\n//# sourceMappingURL=scheduleObservable.js.map\n","/** PURE_IMPORTS_START _Observable,_Subscription PURE_IMPORTS_END */\nimport { Observable } from '../Observable';\nimport { Subscription } from '../Subscription';\nexport function schedulePromise(input, scheduler) {\n return new Observable(function (subscriber) {\n var sub = new Subscription();\n sub.add(scheduler.schedule(function () {\n return input.then(function (value) {\n sub.add(scheduler.schedule(function () {\n subscriber.next(value);\n sub.add(scheduler.schedule(function () { return subscriber.complete(); }));\n }));\n }, function (err) {\n sub.add(scheduler.schedule(function () { return subscriber.error(err); }));\n });\n }));\n return sub;\n });\n}\n//# sourceMappingURL=schedulePromise.js.map\n","/** PURE_IMPORTS_START _symbol_iterator PURE_IMPORTS_END */\nimport { iterator as Symbol_iterator } from '../symbol/iterator';\nexport function isIterable(input) {\n return input && typeof input[Symbol_iterator] === 'function';\n}\n//# sourceMappingURL=isIterable.js.map\n","/** PURE_IMPORTS_START _Observable,_Subscription,_symbol_iterator PURE_IMPORTS_END */\nimport { Observable } from '../Observable';\nimport { Subscription } from '../Subscription';\nimport { iterator as Symbol_iterator } from '../symbol/iterator';\nexport function scheduleIterable(input, scheduler) {\n if (!input) {\n throw new Error('Iterable cannot be null');\n }\n return new Observable(function (subscriber) {\n var sub = new Subscription();\n var iterator;\n sub.add(function () {\n if (iterator && typeof iterator.return === 'function') {\n iterator.return();\n }\n });\n sub.add(scheduler.schedule(function () {\n iterator = input[Symbol_iterator]();\n sub.add(scheduler.schedule(function () {\n if (subscriber.closed) {\n return;\n }\n var value;\n var done;\n try {\n var result = iterator.next();\n value = result.value;\n done = result.done;\n }\n catch (err) {\n subscriber.error(err);\n return;\n }\n if (done) {\n subscriber.complete();\n }\n else {\n subscriber.next(value);\n this.schedule();\n }\n }));\n }));\n return sub;\n });\n}\n//# sourceMappingURL=scheduleIterable.js.map\n","/** PURE_IMPORTS_START _Observable,_util_subscribeTo,_scheduled_scheduled PURE_IMPORTS_END */\nimport { Observable } from '../Observable';\nimport { subscribeTo } from '../util/subscribeTo';\nimport { scheduled } from '../scheduled/scheduled';\nexport function from(input, scheduler) {\n if (!scheduler) {\n if (input instanceof Observable) {\n return input;\n }\n return new Observable(subscribeTo(input));\n }\n else {\n return scheduled(input, scheduler);\n }\n}\n//# sourceMappingURL=from.js.map\n","/** PURE_IMPORTS_START _Observable,_util_isArray,_operators_map,_util_isObject,_from PURE_IMPORTS_END */\nimport { Observable } from '../Observable';\nimport { isArray } from '../util/isArray';\nimport { map } from '../operators/map';\nimport { isObject } from '../util/isObject';\nimport { from } from './from';\nexport function forkJoin() {\n var sources = [];\n for (var _i = 0; _i < arguments.length; _i++) {\n sources[_i] = arguments[_i];\n }\n if (sources.length === 1) {\n var first_1 = sources[0];\n if (isArray(first_1)) {\n return forkJoinInternal(first_1, null);\n }\n if (isObject(first_1) && Object.getPrototypeOf(first_1) === Object.prototype) {\n var keys = Object.keys(first_1);\n return forkJoinInternal(keys.map(function (key) { return first_1[key]; }), keys);\n }\n }\n if (typeof sources[sources.length - 1] === 'function') {\n var resultSelector_1 = sources.pop();\n sources = (sources.length === 1 && isArray(sources[0])) ? sources[0] : sources;\n return forkJoinInternal(sources, null).pipe(map(function (args) { return resultSelector_1.apply(void 0, args); }));\n }\n return forkJoinInternal(sources, null);\n}\nfunction forkJoinInternal(sources, keys) {\n return new Observable(function (subscriber) {\n var len = sources.length;\n if (len === 0) {\n subscriber.complete();\n return;\n }\n var values = new Array(len);\n var completed = 0;\n var emitted = 0;\n var _loop_1 = function (i) {\n var source = from(sources[i]);\n var hasValue = false;\n subscriber.add(source.subscribe({\n next: function (value) {\n if (!hasValue) {\n hasValue = true;\n emitted++;\n }\n values[i] = value;\n },\n error: function (err) { return subscriber.error(err); },\n complete: function () {\n completed++;\n if (completed === len || !hasValue) {\n if (emitted === len) {\n subscriber.next(keys ?\n keys.reduce(function (result, key, i) { return (result[key] = values[i], result); }, {}) :\n values);\n }\n subscriber.complete();\n }\n }\n }));\n };\n for (var i = 0; i < len; i++) {\n _loop_1(i);\n }\n });\n}\n//# sourceMappingURL=forkJoin.js.map\n","/** PURE_IMPORTS_START _Observable,_util_isArray,_util_isFunction,_operators_map PURE_IMPORTS_END */\nimport { Observable } from '../Observable';\nimport { isArray } from '../util/isArray';\nimport { isFunction } from '../util/isFunction';\nimport { map } from '../operators/map';\nvar toString = /*@__PURE__*/ (function () { return Object.prototype.toString; })();\nexport function fromEvent(target, eventName, options, resultSelector) {\n if (isFunction(options)) {\n resultSelector = options;\n options = undefined;\n }\n if (resultSelector) {\n return fromEvent(target, eventName, options).pipe(map(function (args) { return isArray(args) ? resultSelector.apply(void 0, args) : resultSelector(args); }));\n }\n return new Observable(function (subscriber) {\n function handler(e) {\n if (arguments.length > 1) {\n subscriber.next(Array.prototype.slice.call(arguments));\n }\n else {\n subscriber.next(e);\n }\n }\n setupSubscription(target, eventName, handler, subscriber, options);\n });\n}\nfunction setupSubscription(sourceObj, eventName, handler, subscriber, options) {\n var unsubscribe;\n if (isEventTarget(sourceObj)) {\n var source_1 = sourceObj;\n sourceObj.addEventListener(eventName, handler, options);\n unsubscribe = function () { return source_1.removeEventListener(eventName, handler, options); };\n }\n else if (isJQueryStyleEventEmitter(sourceObj)) {\n var source_2 = sourceObj;\n sourceObj.on(eventName, handler);\n unsubscribe = function () { return source_2.off(eventName, handler); };\n }\n else if (isNodeStyleEventEmitter(sourceObj)) {\n var source_3 = sourceObj;\n sourceObj.addListener(eventName, handler);\n unsubscribe = function () { return source_3.removeListener(eventName, handler); };\n }\n else if (sourceObj && sourceObj.length) {\n for (var i = 0, len = sourceObj.length; i < len; i++) {\n setupSubscription(sourceObj[i], eventName, handler, subscriber, options);\n }\n }\n else {\n throw new TypeError('Invalid event target');\n }\n subscriber.add(unsubscribe);\n}\nfunction isNodeStyleEventEmitter(sourceObj) {\n return sourceObj && typeof sourceObj.addListener === 'function' && typeof sourceObj.removeListener === 'function';\n}\nfunction isJQueryStyleEventEmitter(sourceObj) {\n return sourceObj && typeof sourceObj.on === 'function' && typeof sourceObj.off === 'function';\n}\nfunction isEventTarget(sourceObj) {\n return sourceObj && typeof sourceObj.addEventListener === 'function' && typeof sourceObj.removeEventListener === 'function';\n}\n//# sourceMappingURL=fromEvent.js.map\n","/** PURE_IMPORTS_START _Observable,_util_noop PURE_IMPORTS_END */\nimport { Observable } from '../Observable';\nimport { noop } from '../util/noop';\nexport var NEVER = /*@__PURE__*/ new Observable(noop);\nexport function never() {\n return NEVER;\n}\n//# sourceMappingURL=never.js.map\n","/** PURE_IMPORTS_START tslib,_Subscriber PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { Subscriber } from './Subscriber';\nvar InnerSubscriber = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(InnerSubscriber, _super);\n function InnerSubscriber(parent, outerValue, outerIndex) {\n var _this = _super.call(this) || this;\n _this.parent = parent;\n _this.outerValue = outerValue;\n _this.outerIndex = outerIndex;\n _this.index = 0;\n return _this;\n }\n InnerSubscriber.prototype._next = function (value) {\n this.parent.notifyNext(this.outerValue, value, this.outerIndex, this.index++, this);\n };\n InnerSubscriber.prototype._error = function (error) {\n this.parent.notifyError(error, this);\n this.unsubscribe();\n };\n InnerSubscriber.prototype._complete = function () {\n this.parent.notifyComplete(this);\n this.unsubscribe();\n };\n return InnerSubscriber;\n}(Subscriber));\nexport { InnerSubscriber };\n//# sourceMappingURL=InnerSubscriber.js.map\n","/** PURE_IMPORTS_START _InnerSubscriber,_subscribeTo,_Observable PURE_IMPORTS_END */\nimport { InnerSubscriber } from '../InnerSubscriber';\nimport { subscribeTo } from './subscribeTo';\nimport { Observable } from '../Observable';\nexport function subscribeToResult(outerSubscriber, result, outerValue, outerIndex, destination) {\n if (destination === void 0) {\n destination = new InnerSubscriber(outerSubscriber, outerValue, outerIndex);\n }\n if (destination.closed) {\n return undefined;\n }\n if (result instanceof Observable) {\n return result.subscribe(destination);\n }\n return subscribeTo(result)(destination);\n}\n//# sourceMappingURL=subscribeToResult.js.map\n","/** PURE_IMPORTS_START tslib,_Subscriber PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { Subscriber } from './Subscriber';\nvar OuterSubscriber = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(OuterSubscriber, _super);\n function OuterSubscriber() {\n return _super !== null && _super.apply(this, arguments) || this;\n }\n OuterSubscriber.prototype.notifyNext = function (outerValue, innerValue, outerIndex, innerIndex, innerSub) {\n this.destination.next(innerValue);\n };\n OuterSubscriber.prototype.notifyError = function (error, innerSub) {\n this.destination.error(error);\n };\n OuterSubscriber.prototype.notifyComplete = function (innerSub) {\n this.destination.complete();\n };\n return OuterSubscriber;\n}(Subscriber));\nexport { OuterSubscriber };\n//# sourceMappingURL=OuterSubscriber.js.map\n","/** PURE_IMPORTS_START tslib,_util_subscribeToResult,_OuterSubscriber,_InnerSubscriber,_map,_observable_from PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { subscribeToResult } from '../util/subscribeToResult';\nimport { OuterSubscriber } from '../OuterSubscriber';\nimport { InnerSubscriber } from '../InnerSubscriber';\nimport { map } from './map';\nimport { from } from '../observable/from';\nexport function mergeMap(project, resultSelector, concurrent) {\n if (concurrent === void 0) {\n concurrent = Number.POSITIVE_INFINITY;\n }\n if (typeof resultSelector === 'function') {\n return function (source) { return source.pipe(mergeMap(function (a, i) { return from(project(a, i)).pipe(map(function (b, ii) { return resultSelector(a, b, i, ii); })); }, concurrent)); };\n }\n else if (typeof resultSelector === 'number') {\n concurrent = resultSelector;\n }\n return function (source) { return source.lift(new MergeMapOperator(project, concurrent)); };\n}\nvar MergeMapOperator = /*@__PURE__*/ (function () {\n function MergeMapOperator(project, concurrent) {\n if (concurrent === void 0) {\n concurrent = Number.POSITIVE_INFINITY;\n }\n this.project = project;\n this.concurrent = concurrent;\n }\n MergeMapOperator.prototype.call = function (observer, source) {\n return source.subscribe(new MergeMapSubscriber(observer, this.project, this.concurrent));\n };\n return MergeMapOperator;\n}());\nexport { MergeMapOperator };\nvar MergeMapSubscriber = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(MergeMapSubscriber, _super);\n function MergeMapSubscriber(destination, project, concurrent) {\n if (concurrent === void 0) {\n concurrent = Number.POSITIVE_INFINITY;\n }\n var _this = _super.call(this, destination) || this;\n _this.project = project;\n _this.concurrent = concurrent;\n _this.hasCompleted = false;\n _this.buffer = [];\n _this.active = 0;\n _this.index = 0;\n return _this;\n }\n MergeMapSubscriber.prototype._next = function (value) {\n if (this.active < this.concurrent) {\n this._tryNext(value);\n }\n else {\n this.buffer.push(value);\n }\n };\n MergeMapSubscriber.prototype._tryNext = function (value) {\n var result;\n var index = this.index++;\n try {\n result = this.project(value, index);\n }\n catch (err) {\n this.destination.error(err);\n return;\n }\n this.active++;\n this._innerSub(result, value, index);\n };\n MergeMapSubscriber.prototype._innerSub = function (ish, value, index) {\n var innerSubscriber = new InnerSubscriber(this, undefined, undefined);\n var destination = this.destination;\n destination.add(innerSubscriber);\n subscribeToResult(this, ish, value, index, innerSubscriber);\n };\n MergeMapSubscriber.prototype._complete = function () {\n this.hasCompleted = true;\n if (this.active === 0 && this.buffer.length === 0) {\n this.destination.complete();\n }\n this.unsubscribe();\n };\n MergeMapSubscriber.prototype.notifyNext = function (outerValue, innerValue, outerIndex, innerIndex, innerSub) {\n this.destination.next(innerValue);\n };\n MergeMapSubscriber.prototype.notifyComplete = function (innerSub) {\n var buffer = this.buffer;\n this.remove(innerSub);\n this.active--;\n if (buffer.length > 0) {\n this._next(buffer.shift());\n }\n else if (this.active === 0 && this.hasCompleted) {\n this.destination.complete();\n }\n };\n return MergeMapSubscriber;\n}(OuterSubscriber));\nexport { MergeMapSubscriber };\n//# sourceMappingURL=mergeMap.js.map\n","/** PURE_IMPORTS_START PURE_IMPORTS_END */\nexport function identity(x) {\n return x;\n}\n//# sourceMappingURL=identity.js.map\n","/** PURE_IMPORTS_START _mergeMap,_util_identity PURE_IMPORTS_END */\nimport { mergeMap } from './mergeMap';\nimport { identity } from '../util/identity';\nexport function mergeAll(concurrent) {\n if (concurrent === void 0) {\n concurrent = Number.POSITIVE_INFINITY;\n }\n return mergeMap(identity, concurrent);\n}\n//# sourceMappingURL=mergeAll.js.map\n","/** PURE_IMPORTS_START _Observable,_util_isScheduler,_operators_mergeAll,_fromArray PURE_IMPORTS_END */\nimport { Observable } from '../Observable';\nimport { isScheduler } from '../util/isScheduler';\nimport { mergeAll } from '../operators/mergeAll';\nimport { fromArray } from './fromArray';\nexport function merge() {\n var observables = [];\n for (var _i = 0; _i < arguments.length; _i++) {\n observables[_i] = arguments[_i];\n }\n var concurrent = Number.POSITIVE_INFINITY;\n var scheduler = null;\n var last = observables[observables.length - 1];\n if (isScheduler(last)) {\n scheduler = observables.pop();\n if (observables.length > 1 && typeof observables[observables.length - 1] === 'number') {\n concurrent = observables.pop();\n }\n }\n else if (typeof last === 'number') {\n concurrent = observables.pop();\n }\n if (scheduler === null && observables.length === 1 && observables[0] instanceof Observable) {\n return observables[0];\n }\n return mergeAll(concurrent)(fromArray(observables, scheduler));\n}\n//# sourceMappingURL=merge.js.map\n","/** PURE_IMPORTS_START tslib,_.._util_root,_.._Observable,_.._Subscriber,_.._operators_map PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { root } from '../../util/root';\nimport { Observable } from '../../Observable';\nimport { Subscriber } from '../../Subscriber';\nimport { map } from '../../operators/map';\nfunction getCORSRequest() {\n if (root.XMLHttpRequest) {\n return new root.XMLHttpRequest();\n }\n else if (!!root.XDomainRequest) {\n return new root.XDomainRequest();\n }\n else {\n throw new Error('CORS is not supported by your browser');\n }\n}\nfunction getXMLHttpRequest() {\n if (root.XMLHttpRequest) {\n return new root.XMLHttpRequest();\n }\n else {\n var progId = void 0;\n try {\n var progIds = ['Msxml2.XMLHTTP', 'Microsoft.XMLHTTP', 'Msxml2.XMLHTTP.4.0'];\n for (var i = 0; i < 3; i++) {\n try {\n progId = progIds[i];\n if (new root.ActiveXObject(progId)) {\n break;\n }\n }\n catch (e) {\n }\n }\n return new root.ActiveXObject(progId);\n }\n catch (e) {\n throw new Error('XMLHttpRequest is not supported by your browser');\n }\n }\n}\nexport function ajaxGet(url, headers) {\n if (headers === void 0) {\n headers = null;\n }\n return new AjaxObservable({ method: 'GET', url: url, headers: headers });\n}\nexport function ajaxPost(url, body, headers) {\n return new AjaxObservable({ method: 'POST', url: url, body: body, headers: headers });\n}\nexport function ajaxDelete(url, headers) {\n return new AjaxObservable({ method: 'DELETE', url: url, headers: headers });\n}\nexport function ajaxPut(url, body, headers) {\n return new AjaxObservable({ method: 'PUT', url: url, body: body, headers: headers });\n}\nexport function ajaxPatch(url, body, headers) {\n return new AjaxObservable({ method: 'PATCH', url: url, body: body, headers: headers });\n}\nvar mapResponse = /*@__PURE__*/ map(function (x, index) { return x.response; });\nexport function ajaxGetJSON(url, headers) {\n return mapResponse(new AjaxObservable({\n method: 'GET',\n url: url,\n responseType: 'json',\n headers: headers\n }));\n}\nvar AjaxObservable = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(AjaxObservable, _super);\n function AjaxObservable(urlOrRequest) {\n var _this = _super.call(this) || this;\n var request = {\n async: true,\n createXHR: function () {\n return this.crossDomain ? getCORSRequest() : getXMLHttpRequest();\n },\n crossDomain: true,\n withCredentials: false,\n headers: {},\n method: 'GET',\n responseType: 'json',\n timeout: 0\n };\n if (typeof urlOrRequest === 'string') {\n request.url = urlOrRequest;\n }\n else {\n for (var prop in urlOrRequest) {\n if (urlOrRequest.hasOwnProperty(prop)) {\n request[prop] = urlOrRequest[prop];\n }\n }\n }\n _this.request = request;\n return _this;\n }\n AjaxObservable.prototype._subscribe = function (subscriber) {\n return new AjaxSubscriber(subscriber, this.request);\n };\n AjaxObservable.create = (function () {\n var create = function (urlOrRequest) {\n return new AjaxObservable(urlOrRequest);\n };\n create.get = ajaxGet;\n create.post = ajaxPost;\n create.delete = ajaxDelete;\n create.put = ajaxPut;\n create.patch = ajaxPatch;\n create.getJSON = ajaxGetJSON;\n return create;\n })();\n return AjaxObservable;\n}(Observable));\nexport { AjaxObservable };\nvar AjaxSubscriber = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(AjaxSubscriber, _super);\n function AjaxSubscriber(destination, request) {\n var _this = _super.call(this, destination) || this;\n _this.request = request;\n _this.done = false;\n var headers = request.headers = request.headers || {};\n if (!request.crossDomain && !_this.getHeader(headers, 'X-Requested-With')) {\n headers['X-Requested-With'] = 'XMLHttpRequest';\n }\n var contentTypeHeader = _this.getHeader(headers, 'Content-Type');\n if (!contentTypeHeader && !(root.FormData && request.body instanceof root.FormData) && typeof request.body !== 'undefined') {\n headers['Content-Type'] = 'application/x-www-form-urlencoded; charset=UTF-8';\n }\n request.body = _this.serializeBody(request.body, _this.getHeader(request.headers, 'Content-Type'));\n _this.send();\n return _this;\n }\n AjaxSubscriber.prototype.next = function (e) {\n this.done = true;\n var _a = this, xhr = _a.xhr, request = _a.request, destination = _a.destination;\n var result;\n try {\n result = new AjaxResponse(e, xhr, request);\n }\n catch (err) {\n return destination.error(err);\n }\n destination.next(result);\n };\n AjaxSubscriber.prototype.send = function () {\n var _a = this, request = _a.request, _b = _a.request, user = _b.user, method = _b.method, url = _b.url, async = _b.async, password = _b.password, headers = _b.headers, body = _b.body;\n try {\n var xhr = this.xhr = request.createXHR();\n this.setupEvents(xhr, request);\n if (user) {\n xhr.open(method, url, async, user, password);\n }\n else {\n xhr.open(method, url, async);\n }\n if (async) {\n xhr.timeout = request.timeout;\n xhr.responseType = request.responseType;\n }\n if ('withCredentials' in xhr) {\n xhr.withCredentials = !!request.withCredentials;\n }\n this.setHeaders(xhr, headers);\n if (body) {\n xhr.send(body);\n }\n else {\n xhr.send();\n }\n }\n catch (err) {\n this.error(err);\n }\n };\n AjaxSubscriber.prototype.serializeBody = function (body, contentType) {\n if (!body || typeof body === 'string') {\n return body;\n }\n else if (root.FormData && body instanceof root.FormData) {\n return body;\n }\n if (contentType) {\n var splitIndex = contentType.indexOf(';');\n if (splitIndex !== -1) {\n contentType = contentType.substring(0, splitIndex);\n }\n }\n switch (contentType) {\n case 'application/x-www-form-urlencoded':\n return Object.keys(body).map(function (key) { return encodeURIComponent(key) + \"=\" + encodeURIComponent(body[key]); }).join('&');\n case 'application/json':\n return JSON.stringify(body);\n default:\n return body;\n }\n };\n AjaxSubscriber.prototype.setHeaders = function (xhr, headers) {\n for (var key in headers) {\n if (headers.hasOwnProperty(key)) {\n xhr.setRequestHeader(key, headers[key]);\n }\n }\n };\n AjaxSubscriber.prototype.getHeader = function (headers, headerName) {\n for (var key in headers) {\n if (key.toLowerCase() === headerName.toLowerCase()) {\n return headers[key];\n }\n }\n return undefined;\n };\n AjaxSubscriber.prototype.setupEvents = function (xhr, request) {\n var progressSubscriber = request.progressSubscriber;\n function xhrTimeout(e) {\n var _a = xhrTimeout, subscriber = _a.subscriber, progressSubscriber = _a.progressSubscriber, request = _a.request;\n if (progressSubscriber) {\n progressSubscriber.error(e);\n }\n var error;\n try {\n error = new AjaxTimeoutError(this, request);\n }\n catch (err) {\n error = err;\n }\n subscriber.error(error);\n }\n xhr.ontimeout = xhrTimeout;\n xhrTimeout.request = request;\n xhrTimeout.subscriber = this;\n xhrTimeout.progressSubscriber = progressSubscriber;\n if (xhr.upload && 'withCredentials' in xhr) {\n if (progressSubscriber) {\n var xhrProgress_1;\n xhrProgress_1 = function (e) {\n var progressSubscriber = xhrProgress_1.progressSubscriber;\n progressSubscriber.next(e);\n };\n if (root.XDomainRequest) {\n xhr.onprogress = xhrProgress_1;\n }\n else {\n xhr.upload.onprogress = xhrProgress_1;\n }\n xhrProgress_1.progressSubscriber = progressSubscriber;\n }\n var xhrError_1;\n xhrError_1 = function (e) {\n var _a = xhrError_1, progressSubscriber = _a.progressSubscriber, subscriber = _a.subscriber, request = _a.request;\n if (progressSubscriber) {\n progressSubscriber.error(e);\n }\n var error;\n try {\n error = new AjaxError('ajax error', this, request);\n }\n catch (err) {\n error = err;\n }\n subscriber.error(error);\n };\n xhr.onerror = xhrError_1;\n xhrError_1.request = request;\n xhrError_1.subscriber = this;\n xhrError_1.progressSubscriber = progressSubscriber;\n }\n function xhrReadyStateChange(e) {\n return;\n }\n xhr.onreadystatechange = xhrReadyStateChange;\n xhrReadyStateChange.subscriber = this;\n xhrReadyStateChange.progressSubscriber = progressSubscriber;\n xhrReadyStateChange.request = request;\n function xhrLoad(e) {\n var _a = xhrLoad, subscriber = _a.subscriber, progressSubscriber = _a.progressSubscriber, request = _a.request;\n if (this.readyState === 4) {\n var status_1 = this.status === 1223 ? 204 : this.status;\n var response = (this.responseType === 'text' ? (this.response || this.responseText) : this.response);\n if (status_1 === 0) {\n status_1 = response ? 200 : 0;\n }\n if (status_1 < 400) {\n if (progressSubscriber) {\n progressSubscriber.complete();\n }\n subscriber.next(e);\n subscriber.complete();\n }\n else {\n if (progressSubscriber) {\n progressSubscriber.error(e);\n }\n var error = void 0;\n try {\n error = new AjaxError('ajax error ' + status_1, this, request);\n }\n catch (err) {\n error = err;\n }\n subscriber.error(error);\n }\n }\n }\n xhr.onload = xhrLoad;\n xhrLoad.subscriber = this;\n xhrLoad.progressSubscriber = progressSubscriber;\n xhrLoad.request = request;\n };\n AjaxSubscriber.prototype.unsubscribe = function () {\n var _a = this, done = _a.done, xhr = _a.xhr;\n if (!done && xhr && xhr.readyState !== 4 && typeof xhr.abort === 'function') {\n xhr.abort();\n }\n _super.prototype.unsubscribe.call(this);\n };\n return AjaxSubscriber;\n}(Subscriber));\nexport { AjaxSubscriber };\nvar AjaxResponse = /*@__PURE__*/ (function () {\n function AjaxResponse(originalEvent, xhr, request) {\n this.originalEvent = originalEvent;\n this.xhr = xhr;\n this.request = request;\n this.status = xhr.status;\n this.responseType = xhr.responseType || request.responseType;\n this.response = parseXhrResponse(this.responseType, xhr);\n }\n return AjaxResponse;\n}());\nexport { AjaxResponse };\nvar AjaxErrorImpl = /*@__PURE__*/ (function () {\n function AjaxErrorImpl(message, xhr, request) {\n Error.call(this);\n this.message = message;\n this.name = 'AjaxError';\n this.xhr = xhr;\n this.request = request;\n this.status = xhr.status;\n this.responseType = xhr.responseType || request.responseType;\n this.response = parseXhrResponse(this.responseType, xhr);\n return this;\n }\n AjaxErrorImpl.prototype = /*@__PURE__*/ Object.create(Error.prototype);\n return AjaxErrorImpl;\n})();\nexport var AjaxError = AjaxErrorImpl;\nfunction parseJson(xhr) {\n if ('response' in xhr) {\n return xhr.responseType ? xhr.response : JSON.parse(xhr.response || xhr.responseText || 'null');\n }\n else {\n return JSON.parse(xhr.responseText || 'null');\n }\n}\nfunction parseXhrResponse(responseType, xhr) {\n switch (responseType) {\n case 'json':\n return parseJson(xhr);\n case 'xml':\n return xhr.responseXML;\n case 'text':\n default:\n return ('response' in xhr) ? xhr.response : xhr.responseText;\n }\n}\nfunction AjaxTimeoutErrorImpl(xhr, request) {\n AjaxError.call(this, 'ajax timeout', xhr, request);\n this.name = 'AjaxTimeoutError';\n return this;\n}\nexport var AjaxTimeoutError = AjaxTimeoutErrorImpl;\n//# sourceMappingURL=AjaxObservable.js.map\n","/** PURE_IMPORTS_START _AjaxObservable PURE_IMPORTS_END */\nimport { AjaxObservable } from './AjaxObservable';\nexport var ajax = /*@__PURE__*/ (function () { return AjaxObservable.create; })();\n//# sourceMappingURL=ajax.js.map\n","/** PURE_IMPORTS_START tslib,_Subscriber PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { Subscriber } from '../Subscriber';\nexport function filter(predicate, thisArg) {\n return function filterOperatorFunction(source) {\n return source.lift(new FilterOperator(predicate, thisArg));\n };\n}\nvar FilterOperator = /*@__PURE__*/ (function () {\n function FilterOperator(predicate, thisArg) {\n this.predicate = predicate;\n this.thisArg = thisArg;\n }\n FilterOperator.prototype.call = function (subscriber, source) {\n return source.subscribe(new FilterSubscriber(subscriber, this.predicate, this.thisArg));\n };\n return FilterOperator;\n}());\nvar FilterSubscriber = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(FilterSubscriber, _super);\n function FilterSubscriber(destination, predicate, thisArg) {\n var _this = _super.call(this, destination) || this;\n _this.predicate = predicate;\n _this.thisArg = thisArg;\n _this.count = 0;\n return _this;\n }\n FilterSubscriber.prototype._next = function (value) {\n var result;\n try {\n result = this.predicate.call(this.thisArg, value, this.count++);\n }\n catch (err) {\n this.destination.error(err);\n return;\n }\n if (result) {\n this.destination.next(value);\n }\n };\n return FilterSubscriber;\n}(Subscriber));\n//# sourceMappingURL=filter.js.map\n","/** PURE_IMPORTS_START tslib,_Subscriber,_util_noop,_util_isFunction PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { Subscriber } from '../Subscriber';\nimport { noop } from '../util/noop';\nimport { isFunction } from '../util/isFunction';\nexport function tap(nextOrObserver, error, complete) {\n return function tapOperatorFunction(source) {\n return source.lift(new DoOperator(nextOrObserver, error, complete));\n };\n}\nvar DoOperator = /*@__PURE__*/ (function () {\n function DoOperator(nextOrObserver, error, complete) {\n this.nextOrObserver = nextOrObserver;\n this.error = error;\n this.complete = complete;\n }\n DoOperator.prototype.call = function (subscriber, source) {\n return source.subscribe(new TapSubscriber(subscriber, this.nextOrObserver, this.error, this.complete));\n };\n return DoOperator;\n}());\nvar TapSubscriber = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(TapSubscriber, _super);\n function TapSubscriber(destination, observerOrNext, error, complete) {\n var _this = _super.call(this, destination) || this;\n _this._tapNext = noop;\n _this._tapError = noop;\n _this._tapComplete = noop;\n _this._tapError = error || noop;\n _this._tapComplete = complete || noop;\n if (isFunction(observerOrNext)) {\n _this._context = _this;\n _this._tapNext = observerOrNext;\n }\n else if (observerOrNext) {\n _this._context = observerOrNext;\n _this._tapNext = observerOrNext.next || noop;\n _this._tapError = observerOrNext.error || noop;\n _this._tapComplete = observerOrNext.complete || noop;\n }\n return _this;\n }\n TapSubscriber.prototype._next = function (value) {\n try {\n this._tapNext.call(this._context, value);\n }\n catch (err) {\n this.destination.error(err);\n return;\n }\n this.destination.next(value);\n };\n TapSubscriber.prototype._error = function (err) {\n try {\n this._tapError.call(this._context, err);\n }\n catch (err) {\n this.destination.error(err);\n return;\n }\n this.destination.error(err);\n };\n TapSubscriber.prototype._complete = function () {\n try {\n this._tapComplete.call(this._context);\n }\n catch (err) {\n this.destination.error(err);\n return;\n }\n return this.destination.complete();\n };\n return TapSubscriber;\n}(Subscriber));\n//# sourceMappingURL=tap.js.map\n","/** PURE_IMPORTS_START _map PURE_IMPORTS_END */\nimport { map } from './map';\nexport function pluck() {\n var properties = [];\n for (var _i = 0; _i < arguments.length; _i++) {\n properties[_i] = arguments[_i];\n }\n var length = properties.length;\n if (length === 0) {\n throw new Error('list of properties cannot be empty.');\n }\n return function (source) { return map(plucker(properties, length))(source); };\n}\nfunction plucker(props, length) {\n var mapper = function (x) {\n var currentProp = x;\n for (var i = 0; i < length; i++) {\n var p = currentProp[props[i]];\n if (typeof p !== 'undefined') {\n currentProp = p;\n }\n else {\n return undefined;\n }\n }\n return currentProp;\n };\n return mapper;\n}\n//# sourceMappingURL=pluck.js.map\n","/** PURE_IMPORTS_START PURE_IMPORTS_END */\nvar ArgumentOutOfRangeErrorImpl = /*@__PURE__*/ (function () {\n function ArgumentOutOfRangeErrorImpl() {\n Error.call(this);\n this.message = 'argument out of range';\n this.name = 'ArgumentOutOfRangeError';\n return this;\n }\n ArgumentOutOfRangeErrorImpl.prototype = /*@__PURE__*/ Object.create(Error.prototype);\n return ArgumentOutOfRangeErrorImpl;\n})();\nexport var ArgumentOutOfRangeError = ArgumentOutOfRangeErrorImpl;\n//# sourceMappingURL=ArgumentOutOfRangeError.js.map\n","/** PURE_IMPORTS_START tslib,_Subscriber,_util_ArgumentOutOfRangeError,_observable_empty PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { Subscriber } from '../Subscriber';\nimport { ArgumentOutOfRangeError } from '../util/ArgumentOutOfRangeError';\nimport { empty } from '../observable/empty';\nexport function take(count) {\n return function (source) {\n if (count === 0) {\n return empty();\n }\n else {\n return source.lift(new TakeOperator(count));\n }\n };\n}\nvar TakeOperator = /*@__PURE__*/ (function () {\n function TakeOperator(total) {\n this.total = total;\n if (this.total < 0) {\n throw new ArgumentOutOfRangeError;\n }\n }\n TakeOperator.prototype.call = function (subscriber, source) {\n return source.subscribe(new TakeSubscriber(subscriber, this.total));\n };\n return TakeOperator;\n}());\nvar TakeSubscriber = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(TakeSubscriber, _super);\n function TakeSubscriber(destination, total) {\n var _this = _super.call(this, destination) || this;\n _this.total = total;\n _this.count = 0;\n return _this;\n }\n TakeSubscriber.prototype._next = function (value) {\n var total = this.total;\n var count = ++this.count;\n if (count <= total) {\n this.destination.next(value);\n if (count === total) {\n this.destination.complete();\n this.unsubscribe();\n }\n }\n };\n return TakeSubscriber;\n}(Subscriber));\n//# sourceMappingURL=take.js.map\n","/** PURE_IMPORTS_START tslib,_OuterSubscriber,_InnerSubscriber,_util_subscribeToResult,_map,_observable_from PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { OuterSubscriber } from '../OuterSubscriber';\nimport { InnerSubscriber } from '../InnerSubscriber';\nimport { subscribeToResult } from '../util/subscribeToResult';\nimport { map } from './map';\nimport { from } from '../observable/from';\nexport function switchMap(project, resultSelector) {\n if (typeof resultSelector === 'function') {\n return function (source) { return source.pipe(switchMap(function (a, i) { return from(project(a, i)).pipe(map(function (b, ii) { return resultSelector(a, b, i, ii); })); })); };\n }\n return function (source) { return source.lift(new SwitchMapOperator(project)); };\n}\nvar SwitchMapOperator = /*@__PURE__*/ (function () {\n function SwitchMapOperator(project) {\n this.project = project;\n }\n SwitchMapOperator.prototype.call = function (subscriber, source) {\n return source.subscribe(new SwitchMapSubscriber(subscriber, this.project));\n };\n return SwitchMapOperator;\n}());\nvar SwitchMapSubscriber = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(SwitchMapSubscriber, _super);\n function SwitchMapSubscriber(destination, project) {\n var _this = _super.call(this, destination) || this;\n _this.project = project;\n _this.index = 0;\n return _this;\n }\n SwitchMapSubscriber.prototype._next = function (value) {\n var result;\n var index = this.index++;\n try {\n result = this.project(value, index);\n }\n catch (error) {\n this.destination.error(error);\n return;\n }\n this._innerSub(result, value, index);\n };\n SwitchMapSubscriber.prototype._innerSub = function (result, value, index) {\n var innerSubscription = this.innerSubscription;\n if (innerSubscription) {\n innerSubscription.unsubscribe();\n }\n var innerSubscriber = new InnerSubscriber(this, undefined, undefined);\n var destination = this.destination;\n destination.add(innerSubscriber);\n this.innerSubscription = subscribeToResult(this, result, value, index, innerSubscriber);\n };\n SwitchMapSubscriber.prototype._complete = function () {\n var innerSubscription = this.innerSubscription;\n if (!innerSubscription || innerSubscription.closed) {\n _super.prototype._complete.call(this);\n }\n this.unsubscribe();\n };\n SwitchMapSubscriber.prototype._unsubscribe = function () {\n this.innerSubscription = null;\n };\n SwitchMapSubscriber.prototype.notifyComplete = function (innerSub) {\n var destination = this.destination;\n destination.remove(innerSub);\n this.innerSubscription = null;\n if (this.isStopped) {\n _super.prototype._complete.call(this);\n }\n };\n SwitchMapSubscriber.prototype.notifyNext = function (outerValue, innerValue, outerIndex, innerIndex, innerSub) {\n this.destination.next(innerValue);\n };\n return SwitchMapSubscriber;\n}(OuterSubscriber));\n//# sourceMappingURL=switchMap.js.map\n","/** PURE_IMPORTS_START _observable_empty,_observable_of,_observable_throwError PURE_IMPORTS_END */\nimport { empty } from './observable/empty';\nimport { of } from './observable/of';\nimport { throwError } from './observable/throwError';\nexport var NotificationKind;\n/*@__PURE__*/ (function (NotificationKind) {\n NotificationKind[\"NEXT\"] = \"N\";\n NotificationKind[\"ERROR\"] = \"E\";\n NotificationKind[\"COMPLETE\"] = \"C\";\n})(NotificationKind || (NotificationKind = {}));\nvar Notification = /*@__PURE__*/ (function () {\n function Notification(kind, value, error) {\n this.kind = kind;\n this.value = value;\n this.error = error;\n this.hasValue = kind === 'N';\n }\n Notification.prototype.observe = function (observer) {\n switch (this.kind) {\n case 'N':\n return observer.next && observer.next(this.value);\n case 'E':\n return observer.error && observer.error(this.error);\n case 'C':\n return observer.complete && observer.complete();\n }\n };\n Notification.prototype.do = function (next, error, complete) {\n var kind = this.kind;\n switch (kind) {\n case 'N':\n return next && next(this.value);\n case 'E':\n return error && error(this.error);\n case 'C':\n return complete && complete();\n }\n };\n Notification.prototype.accept = function (nextOrObserver, error, complete) {\n if (nextOrObserver && typeof nextOrObserver.next === 'function') {\n return this.observe(nextOrObserver);\n }\n else {\n return this.do(nextOrObserver, error, complete);\n }\n };\n Notification.prototype.toObservable = function () {\n var kind = this.kind;\n switch (kind) {\n case 'N':\n return of(this.value);\n case 'E':\n return throwError(this.error);\n case 'C':\n return empty();\n }\n throw new Error('unexpected notification kind value');\n };\n Notification.createNext = function (value) {\n if (typeof value !== 'undefined') {\n return new Notification('N', value);\n }\n return Notification.undefinedValueNotification;\n };\n Notification.createError = function (err) {\n return new Notification('E', undefined, err);\n };\n Notification.createComplete = function () {\n return Notification.completeNotification;\n };\n Notification.completeNotification = new Notification('C');\n Notification.undefinedValueNotification = new Notification('N', undefined);\n return Notification;\n}());\nexport { Notification };\n//# sourceMappingURL=Notification.js.map\n","/** PURE_IMPORTS_START tslib,_Action PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { Action } from './Action';\nvar AsyncAction = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(AsyncAction, _super);\n function AsyncAction(scheduler, work) {\n var _this = _super.call(this, scheduler, work) || this;\n _this.scheduler = scheduler;\n _this.work = work;\n _this.pending = false;\n return _this;\n }\n AsyncAction.prototype.schedule = function (state, delay) {\n if (delay === void 0) {\n delay = 0;\n }\n if (this.closed) {\n return this;\n }\n this.state = state;\n var id = this.id;\n var scheduler = this.scheduler;\n if (id != null) {\n this.id = this.recycleAsyncId(scheduler, id, delay);\n }\n this.pending = true;\n this.delay = delay;\n this.id = this.id || this.requestAsyncId(scheduler, this.id, delay);\n return this;\n };\n AsyncAction.prototype.requestAsyncId = function (scheduler, id, delay) {\n if (delay === void 0) {\n delay = 0;\n }\n return setInterval(scheduler.flush.bind(scheduler, this), delay);\n };\n AsyncAction.prototype.recycleAsyncId = function (scheduler, id, delay) {\n if (delay === void 0) {\n delay = 0;\n }\n if (delay !== null && this.delay === delay && this.pending === false) {\n return id;\n }\n clearInterval(id);\n return undefined;\n };\n AsyncAction.prototype.execute = function (state, delay) {\n if (this.closed) {\n return new Error('executing a cancelled action');\n }\n this.pending = false;\n var error = this._execute(state, delay);\n if (error) {\n return error;\n }\n else if (this.pending === false && this.id != null) {\n this.id = this.recycleAsyncId(this.scheduler, this.id, null);\n }\n };\n AsyncAction.prototype._execute = function (state, delay) {\n var errored = false;\n var errorValue = undefined;\n try {\n this.work(state);\n }\n catch (e) {\n errored = true;\n errorValue = !!e && e || new Error(e);\n }\n if (errored) {\n this.unsubscribe();\n return errorValue;\n }\n };\n AsyncAction.prototype._unsubscribe = function () {\n var id = this.id;\n var scheduler = this.scheduler;\n var actions = scheduler.actions;\n var index = actions.indexOf(this);\n this.work = null;\n this.state = null;\n this.pending = false;\n this.scheduler = null;\n if (index !== -1) {\n actions.splice(index, 1);\n }\n if (id != null) {\n this.id = this.recycleAsyncId(scheduler, id, null);\n }\n this.delay = null;\n };\n return AsyncAction;\n}(Action));\nexport { AsyncAction };\n//# sourceMappingURL=AsyncAction.js.map\n","/** PURE_IMPORTS_START tslib,_Subscription PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { Subscription } from '../Subscription';\nvar Action = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(Action, _super);\n function Action(scheduler, work) {\n return _super.call(this) || this;\n }\n Action.prototype.schedule = function (state, delay) {\n if (delay === void 0) {\n delay = 0;\n }\n return this;\n };\n return Action;\n}(Subscription));\nexport { Action };\n//# sourceMappingURL=Action.js.map\n","var Scheduler = /*@__PURE__*/ (function () {\n function Scheduler(SchedulerAction, now) {\n if (now === void 0) {\n now = Scheduler.now;\n }\n this.SchedulerAction = SchedulerAction;\n this.now = now;\n }\n Scheduler.prototype.schedule = function (work, delay, state) {\n if (delay === void 0) {\n delay = 0;\n }\n return new this.SchedulerAction(this, work).schedule(state, delay);\n };\n Scheduler.now = function () { return Date.now(); };\n return Scheduler;\n}());\nexport { Scheduler };\n//# sourceMappingURL=Scheduler.js.map\n","/** PURE_IMPORTS_START tslib,_Scheduler PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { Scheduler } from '../Scheduler';\nvar AsyncScheduler = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(AsyncScheduler, _super);\n function AsyncScheduler(SchedulerAction, now) {\n if (now === void 0) {\n now = Scheduler.now;\n }\n var _this = _super.call(this, SchedulerAction, function () {\n if (AsyncScheduler.delegate && AsyncScheduler.delegate !== _this) {\n return AsyncScheduler.delegate.now();\n }\n else {\n return now();\n }\n }) || this;\n _this.actions = [];\n _this.active = false;\n _this.scheduled = undefined;\n return _this;\n }\n AsyncScheduler.prototype.schedule = function (work, delay, state) {\n if (delay === void 0) {\n delay = 0;\n }\n if (AsyncScheduler.delegate && AsyncScheduler.delegate !== this) {\n return AsyncScheduler.delegate.schedule(work, delay, state);\n }\n else {\n return _super.prototype.schedule.call(this, work, delay, state);\n }\n };\n AsyncScheduler.prototype.flush = function (action) {\n var actions = this.actions;\n if (this.active) {\n actions.push(action);\n return;\n }\n var error;\n this.active = true;\n do {\n if (error = action.execute(action.state, action.delay)) {\n break;\n }\n } while (action = actions.shift());\n this.active = false;\n if (error) {\n while (action = actions.shift()) {\n action.unsubscribe();\n }\n throw error;\n }\n };\n return AsyncScheduler;\n}(Scheduler));\nexport { AsyncScheduler };\n//# sourceMappingURL=AsyncScheduler.js.map\n","/** PURE_IMPORTS_START _AsyncAction,_AsyncScheduler PURE_IMPORTS_END */\nimport { AsyncAction } from './AsyncAction';\nimport { AsyncScheduler } from './AsyncScheduler';\nexport var async = /*@__PURE__*/ new AsyncScheduler(AsyncAction);\n//# sourceMappingURL=async.js.map\n","/** PURE_IMPORTS_START _Observable PURE_IMPORTS_END */\nimport { Observable } from '../Observable';\nexport function throwError(error, scheduler) {\n if (!scheduler) {\n return new Observable(function (subscriber) { return subscriber.error(error); });\n }\n else {\n return new Observable(function (subscriber) { return scheduler.schedule(dispatch, 0, { error: error, subscriber: subscriber }); });\n }\n}\nfunction dispatch(_a) {\n var error = _a.error, subscriber = _a.subscriber;\n subscriber.error(error);\n}\n//# sourceMappingURL=throwError.js.map\n","/** PURE_IMPORTS_START tslib,_scheduler_async,_util_isDate,_Subscriber,_Notification PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { async } from '../scheduler/async';\nimport { isDate } from '../util/isDate';\nimport { Subscriber } from '../Subscriber';\nimport { Notification } from '../Notification';\nexport function delay(delay, scheduler) {\n if (scheduler === void 0) {\n scheduler = async;\n }\n var absoluteDelay = isDate(delay);\n var delayFor = absoluteDelay ? (+delay - scheduler.now()) : Math.abs(delay);\n return function (source) { return source.lift(new DelayOperator(delayFor, scheduler)); };\n}\nvar DelayOperator = /*@__PURE__*/ (function () {\n function DelayOperator(delay, scheduler) {\n this.delay = delay;\n this.scheduler = scheduler;\n }\n DelayOperator.prototype.call = function (subscriber, source) {\n return source.subscribe(new DelaySubscriber(subscriber, this.delay, this.scheduler));\n };\n return DelayOperator;\n}());\nvar DelaySubscriber = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(DelaySubscriber, _super);\n function DelaySubscriber(destination, delay, scheduler) {\n var _this = _super.call(this, destination) || this;\n _this.delay = delay;\n _this.scheduler = scheduler;\n _this.queue = [];\n _this.active = false;\n _this.errored = false;\n return _this;\n }\n DelaySubscriber.dispatch = function (state) {\n var source = state.source;\n var queue = source.queue;\n var scheduler = state.scheduler;\n var destination = state.destination;\n while (queue.length > 0 && (queue[0].time - scheduler.now()) <= 0) {\n queue.shift().notification.observe(destination);\n }\n if (queue.length > 0) {\n var delay_1 = Math.max(0, queue[0].time - scheduler.now());\n this.schedule(state, delay_1);\n }\n else {\n this.unsubscribe();\n source.active = false;\n }\n };\n DelaySubscriber.prototype._schedule = function (scheduler) {\n this.active = true;\n var destination = this.destination;\n destination.add(scheduler.schedule(DelaySubscriber.dispatch, this.delay, {\n source: this, destination: this.destination, scheduler: scheduler\n }));\n };\n DelaySubscriber.prototype.scheduleNotification = function (notification) {\n if (this.errored === true) {\n return;\n }\n var scheduler = this.scheduler;\n var message = new DelayMessage(scheduler.now() + this.delay, notification);\n this.queue.push(message);\n if (this.active === false) {\n this._schedule(scheduler);\n }\n };\n DelaySubscriber.prototype._next = function (value) {\n this.scheduleNotification(Notification.createNext(value));\n };\n DelaySubscriber.prototype._error = function (err) {\n this.errored = true;\n this.queue = [];\n this.destination.error(err);\n this.unsubscribe();\n };\n DelaySubscriber.prototype._complete = function () {\n this.scheduleNotification(Notification.createComplete());\n this.unsubscribe();\n };\n return DelaySubscriber;\n}(Subscriber));\nvar DelayMessage = /*@__PURE__*/ (function () {\n function DelayMessage(time, notification) {\n this.time = time;\n this.notification = notification;\n }\n return DelayMessage;\n}());\n//# sourceMappingURL=delay.js.map\n","/** PURE_IMPORTS_START PURE_IMPORTS_END */\nexport function isDate(value) {\n return value instanceof Date && !isNaN(+value);\n}\n//# sourceMappingURL=isDate.js.map\n","/** PURE_IMPORTS_START _switchMap PURE_IMPORTS_END */\nimport { switchMap } from './switchMap';\nexport function switchMapTo(innerObservable, resultSelector) {\n return resultSelector ? switchMap(function () { return innerObservable; }, resultSelector) : switchMap(function () { return innerObservable; });\n}\n//# sourceMappingURL=switchMapTo.js.map\n","/** PURE_IMPORTS_START tslib,_Subscriber PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { Subscriber } from '../Subscriber';\nexport function scan(accumulator, seed) {\n var hasSeed = false;\n if (arguments.length >= 2) {\n hasSeed = true;\n }\n return function scanOperatorFunction(source) {\n return source.lift(new ScanOperator(accumulator, seed, hasSeed));\n };\n}\nvar ScanOperator = /*@__PURE__*/ (function () {\n function ScanOperator(accumulator, seed, hasSeed) {\n if (hasSeed === void 0) {\n hasSeed = false;\n }\n this.accumulator = accumulator;\n this.seed = seed;\n this.hasSeed = hasSeed;\n }\n ScanOperator.prototype.call = function (subscriber, source) {\n return source.subscribe(new ScanSubscriber(subscriber, this.accumulator, this.seed, this.hasSeed));\n };\n return ScanOperator;\n}());\nvar ScanSubscriber = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(ScanSubscriber, _super);\n function ScanSubscriber(destination, accumulator, _seed, hasSeed) {\n var _this = _super.call(this, destination) || this;\n _this.accumulator = accumulator;\n _this._seed = _seed;\n _this.hasSeed = hasSeed;\n _this.index = 0;\n return _this;\n }\n Object.defineProperty(ScanSubscriber.prototype, \"seed\", {\n get: function () {\n return this._seed;\n },\n set: function (value) {\n this.hasSeed = true;\n this._seed = value;\n },\n enumerable: true,\n configurable: true\n });\n ScanSubscriber.prototype._next = function (value) {\n if (!this.hasSeed) {\n this.seed = value;\n this.destination.next(value);\n }\n else {\n return this._tryNext(value);\n }\n };\n ScanSubscriber.prototype._tryNext = function (value) {\n var index = this.index++;\n var result;\n try {\n result = this.accumulator(this.seed, value, index);\n }\n catch (err) {\n this.destination.error(err);\n }\n this.seed = result;\n this.destination.next(result);\n };\n return ScanSubscriber;\n}(Subscriber));\n//# sourceMappingURL=scan.js.map\n","/** PURE_IMPORTS_START tslib,_AsyncAction PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { AsyncAction } from './AsyncAction';\nvar QueueAction = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(QueueAction, _super);\n function QueueAction(scheduler, work) {\n var _this = _super.call(this, scheduler, work) || this;\n _this.scheduler = scheduler;\n _this.work = work;\n return _this;\n }\n QueueAction.prototype.schedule = function (state, delay) {\n if (delay === void 0) {\n delay = 0;\n }\n if (delay > 0) {\n return _super.prototype.schedule.call(this, state, delay);\n }\n this.delay = delay;\n this.state = state;\n this.scheduler.flush(this);\n return this;\n };\n QueueAction.prototype.execute = function (state, delay) {\n return (delay > 0 || this.closed) ?\n _super.prototype.execute.call(this, state, delay) :\n this._execute(state, delay);\n };\n QueueAction.prototype.requestAsyncId = function (scheduler, id, delay) {\n if (delay === void 0) {\n delay = 0;\n }\n if ((delay !== null && delay > 0) || (delay === null && this.delay > 0)) {\n return _super.prototype.requestAsyncId.call(this, scheduler, id, delay);\n }\n return scheduler.flush(this);\n };\n return QueueAction;\n}(AsyncAction));\nexport { QueueAction };\n//# sourceMappingURL=QueueAction.js.map\n","/** PURE_IMPORTS_START _QueueAction,_QueueScheduler PURE_IMPORTS_END */\nimport { QueueAction } from './QueueAction';\nimport { QueueScheduler } from './QueueScheduler';\nexport var queue = /*@__PURE__*/ new QueueScheduler(QueueAction);\n//# sourceMappingURL=queue.js.map\n","/** PURE_IMPORTS_START tslib,_AsyncScheduler PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { AsyncScheduler } from './AsyncScheduler';\nvar QueueScheduler = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(QueueScheduler, _super);\n function QueueScheduler() {\n return _super !== null && _super.apply(this, arguments) || this;\n }\n return QueueScheduler;\n}(AsyncScheduler));\nexport { QueueScheduler };\n//# sourceMappingURL=QueueScheduler.js.map\n","/** PURE_IMPORTS_START tslib,_Subscriber,_Notification PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { Subscriber } from '../Subscriber';\nimport { Notification } from '../Notification';\nexport function observeOn(scheduler, delay) {\n if (delay === void 0) {\n delay = 0;\n }\n return function observeOnOperatorFunction(source) {\n return source.lift(new ObserveOnOperator(scheduler, delay));\n };\n}\nvar ObserveOnOperator = /*@__PURE__*/ (function () {\n function ObserveOnOperator(scheduler, delay) {\n if (delay === void 0) {\n delay = 0;\n }\n this.scheduler = scheduler;\n this.delay = delay;\n }\n ObserveOnOperator.prototype.call = function (subscriber, source) {\n return source.subscribe(new ObserveOnSubscriber(subscriber, this.scheduler, this.delay));\n };\n return ObserveOnOperator;\n}());\nexport { ObserveOnOperator };\nvar ObserveOnSubscriber = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(ObserveOnSubscriber, _super);\n function ObserveOnSubscriber(destination, scheduler, delay) {\n if (delay === void 0) {\n delay = 0;\n }\n var _this = _super.call(this, destination) || this;\n _this.scheduler = scheduler;\n _this.delay = delay;\n return _this;\n }\n ObserveOnSubscriber.dispatch = function (arg) {\n var notification = arg.notification, destination = arg.destination;\n notification.observe(destination);\n this.unsubscribe();\n };\n ObserveOnSubscriber.prototype.scheduleMessage = function (notification) {\n var destination = this.destination;\n destination.add(this.scheduler.schedule(ObserveOnSubscriber.dispatch, this.delay, new ObserveOnMessage(notification, this.destination)));\n };\n ObserveOnSubscriber.prototype._next = function (value) {\n this.scheduleMessage(Notification.createNext(value));\n };\n ObserveOnSubscriber.prototype._error = function (err) {\n this.scheduleMessage(Notification.createError(err));\n this.unsubscribe();\n };\n ObserveOnSubscriber.prototype._complete = function () {\n this.scheduleMessage(Notification.createComplete());\n this.unsubscribe();\n };\n return ObserveOnSubscriber;\n}(Subscriber));\nexport { ObserveOnSubscriber };\nvar ObserveOnMessage = /*@__PURE__*/ (function () {\n function ObserveOnMessage(notification, destination) {\n this.notification = notification;\n this.destination = destination;\n }\n return ObserveOnMessage;\n}());\nexport { ObserveOnMessage };\n//# sourceMappingURL=observeOn.js.map\n","/** PURE_IMPORTS_START tslib,_Subject,_scheduler_queue,_Subscription,_operators_observeOn,_util_ObjectUnsubscribedError,_SubjectSubscription PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { Subject } from './Subject';\nimport { queue } from './scheduler/queue';\nimport { Subscription } from './Subscription';\nimport { ObserveOnSubscriber } from './operators/observeOn';\nimport { ObjectUnsubscribedError } from './util/ObjectUnsubscribedError';\nimport { SubjectSubscription } from './SubjectSubscription';\nvar ReplaySubject = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(ReplaySubject, _super);\n function ReplaySubject(bufferSize, windowTime, scheduler) {\n if (bufferSize === void 0) {\n bufferSize = Number.POSITIVE_INFINITY;\n }\n if (windowTime === void 0) {\n windowTime = Number.POSITIVE_INFINITY;\n }\n var _this = _super.call(this) || this;\n _this.scheduler = scheduler;\n _this._events = [];\n _this._infiniteTimeWindow = false;\n _this._bufferSize = bufferSize < 1 ? 1 : bufferSize;\n _this._windowTime = windowTime < 1 ? 1 : windowTime;\n if (windowTime === Number.POSITIVE_INFINITY) {\n _this._infiniteTimeWindow = true;\n _this.next = _this.nextInfiniteTimeWindow;\n }\n else {\n _this.next = _this.nextTimeWindow;\n }\n return _this;\n }\n ReplaySubject.prototype.nextInfiniteTimeWindow = function (value) {\n var _events = this._events;\n _events.push(value);\n if (_events.length > this._bufferSize) {\n _events.shift();\n }\n _super.prototype.next.call(this, value);\n };\n ReplaySubject.prototype.nextTimeWindow = function (value) {\n this._events.push(new ReplayEvent(this._getNow(), value));\n this._trimBufferThenGetEvents();\n _super.prototype.next.call(this, value);\n };\n ReplaySubject.prototype._subscribe = function (subscriber) {\n var _infiniteTimeWindow = this._infiniteTimeWindow;\n var _events = _infiniteTimeWindow ? this._events : this._trimBufferThenGetEvents();\n var scheduler = this.scheduler;\n var len = _events.length;\n var subscription;\n if (this.closed) {\n throw new ObjectUnsubscribedError();\n }\n else if (this.isStopped || this.hasError) {\n subscription = Subscription.EMPTY;\n }\n else {\n this.observers.push(subscriber);\n subscription = new SubjectSubscription(this, subscriber);\n }\n if (scheduler) {\n subscriber.add(subscriber = new ObserveOnSubscriber(subscriber, scheduler));\n }\n if (_infiniteTimeWindow) {\n for (var i = 0; i < len && !subscriber.closed; i++) {\n subscriber.next(_events[i]);\n }\n }\n else {\n for (var i = 0; i < len && !subscriber.closed; i++) {\n subscriber.next(_events[i].value);\n }\n }\n if (this.hasError) {\n subscriber.error(this.thrownError);\n }\n else if (this.isStopped) {\n subscriber.complete();\n }\n return subscription;\n };\n ReplaySubject.prototype._getNow = function () {\n return (this.scheduler || queue).now();\n };\n ReplaySubject.prototype._trimBufferThenGetEvents = function () {\n var now = this._getNow();\n var _bufferSize = this._bufferSize;\n var _windowTime = this._windowTime;\n var _events = this._events;\n var eventsCount = _events.length;\n var spliceCount = 0;\n while (spliceCount < eventsCount) {\n if ((now - _events[spliceCount].time) < _windowTime) {\n break;\n }\n spliceCount++;\n }\n if (eventsCount > _bufferSize) {\n spliceCount = Math.max(spliceCount, eventsCount - _bufferSize);\n }\n if (spliceCount > 0) {\n _events.splice(0, spliceCount);\n }\n return _events;\n };\n return ReplaySubject;\n}(Subject));\nexport { ReplaySubject };\nvar ReplayEvent = /*@__PURE__*/ (function () {\n function ReplayEvent(time, value) {\n this.time = time;\n this.value = value;\n }\n return ReplayEvent;\n}());\n//# sourceMappingURL=ReplaySubject.js.map\n","/** PURE_IMPORTS_START _ReplaySubject PURE_IMPORTS_END */\nimport { ReplaySubject } from '../ReplaySubject';\nexport function shareReplay(configOrBufferSize, windowTime, scheduler) {\n var config;\n if (configOrBufferSize && typeof configOrBufferSize === 'object') {\n config = configOrBufferSize;\n }\n else {\n config = {\n bufferSize: configOrBufferSize,\n windowTime: windowTime,\n refCount: false,\n scheduler: scheduler\n };\n }\n return function (source) { return source.lift(shareReplayOperator(config)); };\n}\nfunction shareReplayOperator(_a) {\n var _b = _a.bufferSize, bufferSize = _b === void 0 ? Number.POSITIVE_INFINITY : _b, _c = _a.windowTime, windowTime = _c === void 0 ? Number.POSITIVE_INFINITY : _c, useRefCount = _a.refCount, scheduler = _a.scheduler;\n var subject;\n var refCount = 0;\n var subscription;\n var hasError = false;\n var isComplete = false;\n return function shareReplayOperation(source) {\n refCount++;\n if (!subject || hasError) {\n hasError = false;\n subject = new ReplaySubject(bufferSize, windowTime, scheduler);\n subscription = source.subscribe({\n next: function (value) { subject.next(value); },\n error: function (err) {\n hasError = true;\n subject.error(err);\n },\n complete: function () {\n isComplete = true;\n subject.complete();\n },\n });\n }\n var innerSub = subject.subscribe(this);\n this.add(function () {\n refCount--;\n innerSub.unsubscribe();\n if (subscription && !isComplete && useRefCount && refCount === 0) {\n subscription.unsubscribe();\n subscription = undefined;\n subject = undefined;\n }\n });\n };\n}\n//# sourceMappingURL=shareReplay.js.map\n","/** PURE_IMPORTS_START tslib,_Subscriber PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { Subscriber } from '../Subscriber';\nexport function mapTo(value) {\n return function (source) { return source.lift(new MapToOperator(value)); };\n}\nvar MapToOperator = /*@__PURE__*/ (function () {\n function MapToOperator(value) {\n this.value = value;\n }\n MapToOperator.prototype.call = function (subscriber, source) {\n return source.subscribe(new MapToSubscriber(subscriber, this.value));\n };\n return MapToOperator;\n}());\nvar MapToSubscriber = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(MapToSubscriber, _super);\n function MapToSubscriber(destination, value) {\n var _this = _super.call(this, destination) || this;\n _this.value = value;\n return _this;\n }\n MapToSubscriber.prototype._next = function (x) {\n this.destination.next(this.value);\n };\n return MapToSubscriber;\n}(Subscriber));\n//# sourceMappingURL=mapTo.js.map\n","/** PURE_IMPORTS_START _of,_operators_concatAll PURE_IMPORTS_END */\nimport { of } from './of';\nimport { concatAll } from '../operators/concatAll';\nexport function concat() {\n var observables = [];\n for (var _i = 0; _i < arguments.length; _i++) {\n observables[_i] = arguments[_i];\n }\n return concatAll()(of.apply(void 0, observables));\n}\n//# sourceMappingURL=concat.js.map\n","/** PURE_IMPORTS_START _mergeAll PURE_IMPORTS_END */\nimport { mergeAll } from './mergeAll';\nexport function concatAll() {\n return mergeAll(1);\n}\n//# sourceMappingURL=concatAll.js.map\n","/** PURE_IMPORTS_START _observable_concat,_util_isScheduler PURE_IMPORTS_END */\nimport { concat } from '../observable/concat';\nimport { isScheduler } from '../util/isScheduler';\nexport function startWith() {\n var array = [];\n for (var _i = 0; _i < arguments.length; _i++) {\n array[_i] = arguments[_i];\n }\n var scheduler = array[array.length - 1];\n if (isScheduler(scheduler)) {\n array.pop();\n return function (source) { return concat(array, source, scheduler); };\n }\n else {\n return function (source) { return concat(array, source); };\n }\n}\n//# sourceMappingURL=startWith.js.map\n","/** PURE_IMPORTS_START tslib,_Subscriber PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { Subscriber } from '../Subscriber';\nexport function distinctUntilChanged(compare, keySelector) {\n return function (source) { return source.lift(new DistinctUntilChangedOperator(compare, keySelector)); };\n}\nvar DistinctUntilChangedOperator = /*@__PURE__*/ (function () {\n function DistinctUntilChangedOperator(compare, keySelector) {\n this.compare = compare;\n this.keySelector = keySelector;\n }\n DistinctUntilChangedOperator.prototype.call = function (subscriber, source) {\n return source.subscribe(new DistinctUntilChangedSubscriber(subscriber, this.compare, this.keySelector));\n };\n return DistinctUntilChangedOperator;\n}());\nvar DistinctUntilChangedSubscriber = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(DistinctUntilChangedSubscriber, _super);\n function DistinctUntilChangedSubscriber(destination, compare, keySelector) {\n var _this = _super.call(this, destination) || this;\n _this.keySelector = keySelector;\n _this.hasKey = false;\n if (typeof compare === 'function') {\n _this.compare = compare;\n }\n return _this;\n }\n DistinctUntilChangedSubscriber.prototype.compare = function (x, y) {\n return x === y;\n };\n DistinctUntilChangedSubscriber.prototype._next = function (value) {\n var key;\n try {\n var keySelector = this.keySelector;\n key = keySelector ? keySelector(value) : value;\n }\n catch (err) {\n return this.destination.error(err);\n }\n var result = false;\n if (this.hasKey) {\n try {\n var compare = this.compare;\n result = compare(this.key, key);\n }\n catch (err) {\n return this.destination.error(err);\n }\n }\n else {\n this.hasKey = true;\n }\n if (!result) {\n this.key = key;\n this.destination.next(value);\n }\n };\n return DistinctUntilChangedSubscriber;\n}(Subscriber));\n//# sourceMappingURL=distinctUntilChanged.js.map\n","/** PURE_IMPORTS_START tslib,_Subscriber PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { Subscriber } from '../Subscriber';\nexport function skip(count) {\n return function (source) { return source.lift(new SkipOperator(count)); };\n}\nvar SkipOperator = /*@__PURE__*/ (function () {\n function SkipOperator(total) {\n this.total = total;\n }\n SkipOperator.prototype.call = function (subscriber, source) {\n return source.subscribe(new SkipSubscriber(subscriber, this.total));\n };\n return SkipOperator;\n}());\nvar SkipSubscriber = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(SkipSubscriber, _super);\n function SkipSubscriber(destination, total) {\n var _this = _super.call(this, destination) || this;\n _this.total = total;\n _this.count = 0;\n return _this;\n }\n SkipSubscriber.prototype._next = function (x) {\n if (++this.count > this.total) {\n this.destination.next(x);\n }\n };\n return SkipSubscriber;\n}(Subscriber));\n//# sourceMappingURL=skip.js.map\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { Observable, fromEvent } from \"rxjs\"\nimport { ajax } from \"rxjs/ajax\"\nimport {\n distinctUntilChanged,\n map,\n mapTo,\n pluck,\n shareReplay,\n skip,\n startWith,\n switchMap\n} from \"rxjs/operators\"\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * Switch options\n */\ninterface SwitchOptions {\n location$: Observable /* Location observable */\n}\n\n/* ----------------------------------------------------------------------------\n * Data\n * ------------------------------------------------------------------------- */\n\n/**\n * Observable for document load events\n */\nconst load$ = fromEvent(document, \"DOMContentLoaded\")\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch document\n *\n * @return Document observable\n */\nexport function watchDocument(): Observable {\n return load$\n .pipe(\n mapTo(document),\n shareReplay(1)\n )\n}\n\n/**\n * Watch document switch\n *\n * This function returns an observables that fetches a document if the provided\n * location observable emits a new value (i.e. URL). If the emitted URL points\n * to the same page, the request is effectively ignored (e.g. when only the\n * fragment identifier changes)\n *\n * @param options - Options\n *\n * @return Document switch observable\n */\nexport function watchDocumentSwitch(\n { location$ }: SwitchOptions\n): Observable {\n return location$\n .pipe(\n startWith(location.href),\n map(url => url.replace(/#[^#]+$/, \"\")),\n distinctUntilChanged(),\n skip(1),\n\n /* Fetch document */\n switchMap(url => ajax({\n url,\n responseType: \"document\",\n withCredentials: true\n })\n .pipe(\n pluck(\"response\")\n )\n ),\n shareReplay(1)\n )\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Retrieve an element matching the query selector\n *\n * @template T - Element type\n *\n * @param selector - Query selector\n * @param node - Node of reference\n *\n * @return Element\n */\nexport function getElement(\n selector: string, node: ParentNode = document\n): T | undefined {\n return node.querySelector(selector) || undefined\n}\n\n/**\n * Retrieve all elements matching the query selector\n *\n * @template T - Element type\n *\n * @param selector - Query selector\n * @param node - Node of reference\n *\n * @return Elements\n */\nexport function getElements(\n selector: string, node: ParentNode = document\n): T[] {\n return Array.from(node.querySelectorAll(selector))\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { Observable, fromEvent, merge } from \"rxjs\"\nimport { map, shareReplay, startWith } from \"rxjs/operators\"\n\nimport { Agent } from \"../../_\"\nimport { ViewportSize } from \"../../viewport\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Element offset\n */\nexport interface ElementOffset {\n x: number /* Horizontal offset */\n y: number /* Vertical offset */\n}\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * Options\n */\ninterface Options {\n size$: Observable /* Viewport size observable */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Retrieve element offset\n *\n * @param el - HTML element\n *\n * @return Element offset\n */\nexport function getElementOffset(el: HTMLElement): ElementOffset {\n return {\n x: el.scrollLeft,\n y: el.scrollTop\n }\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Watch element offset\n *\n * @param el - Element\n * @param agent - Agent\n *\n * @return Element offset observable\n */\nexport function watchElementOffset(\n el: HTMLElement, { viewport }: Agent\n): Observable {\n const scroll$ = fromEvent(el, \"scroll\")\n return merge(scroll$, viewport.size$)\n .pipe(\n map(() => getElementOffset(el)),\n startWith(getElementOffset(el)),\n shareReplay(1)\n )\n}\n","/** PURE_IMPORTS_START tslib,_Subscriber PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { Subscriber } from '../Subscriber';\nexport function refCount() {\n return function refCountOperatorFunction(source) {\n return source.lift(new RefCountOperator(source));\n };\n}\nvar RefCountOperator = /*@__PURE__*/ (function () {\n function RefCountOperator(connectable) {\n this.connectable = connectable;\n }\n RefCountOperator.prototype.call = function (subscriber, source) {\n var connectable = this.connectable;\n connectable._refCount++;\n var refCounter = new RefCountSubscriber(subscriber, connectable);\n var subscription = source.subscribe(refCounter);\n if (!refCounter.closed) {\n refCounter.connection = connectable.connect();\n }\n return subscription;\n };\n return RefCountOperator;\n}());\nvar RefCountSubscriber = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(RefCountSubscriber, _super);\n function RefCountSubscriber(destination, connectable) {\n var _this = _super.call(this, destination) || this;\n _this.connectable = connectable;\n return _this;\n }\n RefCountSubscriber.prototype._unsubscribe = function () {\n var connectable = this.connectable;\n if (!connectable) {\n this.connection = null;\n return;\n }\n this.connectable = null;\n var refCount = connectable._refCount;\n if (refCount <= 0) {\n this.connection = null;\n return;\n }\n connectable._refCount = refCount - 1;\n if (refCount > 1) {\n this.connection = null;\n return;\n }\n var connection = this.connection;\n var sharedConnection = connectable._connection;\n this.connection = null;\n if (sharedConnection && (!connection || sharedConnection === connection)) {\n sharedConnection.unsubscribe();\n }\n };\n return RefCountSubscriber;\n}(Subscriber));\n//# sourceMappingURL=refCount.js.map\n","/** PURE_IMPORTS_START tslib,_Subject,_Observable,_Subscriber,_Subscription,_operators_refCount PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { SubjectSubscriber } from '../Subject';\nimport { Observable } from '../Observable';\nimport { Subscriber } from '../Subscriber';\nimport { Subscription } from '../Subscription';\nimport { refCount as higherOrderRefCount } from '../operators/refCount';\nvar ConnectableObservable = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(ConnectableObservable, _super);\n function ConnectableObservable(source, subjectFactory) {\n var _this = _super.call(this) || this;\n _this.source = source;\n _this.subjectFactory = subjectFactory;\n _this._refCount = 0;\n _this._isComplete = false;\n return _this;\n }\n ConnectableObservable.prototype._subscribe = function (subscriber) {\n return this.getSubject().subscribe(subscriber);\n };\n ConnectableObservable.prototype.getSubject = function () {\n var subject = this._subject;\n if (!subject || subject.isStopped) {\n this._subject = this.subjectFactory();\n }\n return this._subject;\n };\n ConnectableObservable.prototype.connect = function () {\n var connection = this._connection;\n if (!connection) {\n this._isComplete = false;\n connection = this._connection = new Subscription();\n connection.add(this.source\n .subscribe(new ConnectableSubscriber(this.getSubject(), this)));\n if (connection.closed) {\n this._connection = null;\n connection = Subscription.EMPTY;\n }\n }\n return connection;\n };\n ConnectableObservable.prototype.refCount = function () {\n return higherOrderRefCount()(this);\n };\n return ConnectableObservable;\n}(Observable));\nexport { ConnectableObservable };\nexport var connectableObservableDescriptor = /*@__PURE__*/ (function () {\n var connectableProto = ConnectableObservable.prototype;\n return {\n operator: { value: null },\n _refCount: { value: 0, writable: true },\n _subject: { value: null, writable: true },\n _connection: { value: null, writable: true },\n _subscribe: { value: connectableProto._subscribe },\n _isComplete: { value: connectableProto._isComplete, writable: true },\n getSubject: { value: connectableProto.getSubject },\n connect: { value: connectableProto.connect },\n refCount: { value: connectableProto.refCount }\n };\n})();\nvar ConnectableSubscriber = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(ConnectableSubscriber, _super);\n function ConnectableSubscriber(destination, connectable) {\n var _this = _super.call(this, destination) || this;\n _this.connectable = connectable;\n return _this;\n }\n ConnectableSubscriber.prototype._error = function (err) {\n this._unsubscribe();\n _super.prototype._error.call(this, err);\n };\n ConnectableSubscriber.prototype._complete = function () {\n this.connectable._isComplete = true;\n this._unsubscribe();\n _super.prototype._complete.call(this);\n };\n ConnectableSubscriber.prototype._unsubscribe = function () {\n var connectable = this.connectable;\n if (connectable) {\n this.connectable = null;\n var connection = connectable._connection;\n connectable._refCount = 0;\n connectable._subject = null;\n connectable._connection = null;\n if (connection) {\n connection.unsubscribe();\n }\n }\n };\n return ConnectableSubscriber;\n}(SubjectSubscriber));\nvar RefCountOperator = /*@__PURE__*/ (function () {\n function RefCountOperator(connectable) {\n this.connectable = connectable;\n }\n RefCountOperator.prototype.call = function (subscriber, source) {\n var connectable = this.connectable;\n connectable._refCount++;\n var refCounter = new RefCountSubscriber(subscriber, connectable);\n var subscription = source.subscribe(refCounter);\n if (!refCounter.closed) {\n refCounter.connection = connectable.connect();\n }\n return subscription;\n };\n return RefCountOperator;\n}());\nvar RefCountSubscriber = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(RefCountSubscriber, _super);\n function RefCountSubscriber(destination, connectable) {\n var _this = _super.call(this, destination) || this;\n _this.connectable = connectable;\n return _this;\n }\n RefCountSubscriber.prototype._unsubscribe = function () {\n var connectable = this.connectable;\n if (!connectable) {\n this.connection = null;\n return;\n }\n this.connectable = null;\n var refCount = connectable._refCount;\n if (refCount <= 0) {\n this.connection = null;\n return;\n }\n connectable._refCount = refCount - 1;\n if (refCount > 1) {\n this.connection = null;\n return;\n }\n var connection = this.connection;\n var sharedConnection = connectable._connection;\n this.connection = null;\n if (sharedConnection && (!connection || sharedConnection === connection)) {\n sharedConnection.unsubscribe();\n }\n };\n return RefCountSubscriber;\n}(Subscriber));\n//# sourceMappingURL=ConnectableObservable.js.map\n","/** PURE_IMPORTS_START _observable_ConnectableObservable PURE_IMPORTS_END */\nimport { connectableObservableDescriptor } from '../observable/ConnectableObservable';\nexport function multicast(subjectOrSubjectFactory, selector) {\n return function multicastOperatorFunction(source) {\n var subjectFactory;\n if (typeof subjectOrSubjectFactory === 'function') {\n subjectFactory = subjectOrSubjectFactory;\n }\n else {\n subjectFactory = function subjectFactory() {\n return subjectOrSubjectFactory;\n };\n }\n if (typeof selector === 'function') {\n return source.lift(new MulticastOperator(subjectFactory, selector));\n }\n var connectable = Object.create(source, connectableObservableDescriptor);\n connectable.source = source;\n connectable.subjectFactory = subjectFactory;\n return connectable;\n };\n}\nvar MulticastOperator = /*@__PURE__*/ (function () {\n function MulticastOperator(subjectFactory, selector) {\n this.subjectFactory = subjectFactory;\n this.selector = selector;\n }\n MulticastOperator.prototype.call = function (subscriber, source) {\n var selector = this.selector;\n var subject = this.subjectFactory();\n var subscription = selector(subject).subscribe(subscriber);\n subscription.add(source.subscribe(subject));\n return subscription;\n };\n return MulticastOperator;\n}());\nexport { MulticastOperator };\n//# sourceMappingURL=multicast.js.map\n","/** PURE_IMPORTS_START _multicast,_refCount,_Subject PURE_IMPORTS_END */\nimport { multicast } from './multicast';\nimport { refCount } from './refCount';\nimport { Subject } from '../Subject';\nfunction shareSubjectFactory() {\n return new Subject();\n}\nexport function share() {\n return function (source) { return refCount()(multicast(shareSubjectFactory)(source)); };\n}\n//# sourceMappingURL=share.js.map\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { Observable, Subject, fromEvent } from \"rxjs\"\nimport { filter, map, share } from \"rxjs/operators\"\n\n/* ----------------------------------------------------------------------------\n * Data\n * ------------------------------------------------------------------------- */\n\n/**\n * Observable for window hash change events\n */\nconst hashchange$ = fromEvent(window, \"hashchange\")\n\n/**\n * Observable for window pop state events\n */\nconst popstate$ = fromEvent(window, \"popstate\")\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch location\n *\n * @return Location subject\n */\nexport function watchLocation(): Subject {\n const location$ = new Subject()\n popstate$\n .pipe(\n map(() => location.href),\n share()\n )\n .subscribe(location$)\n\n /* Return subject */\n return location$\n}\n\n/**\n * Watch location hash\n *\n * @return Location hash observable\n */\nexport function watchLocationHash(): Observable {\n return hashchange$\n .pipe(\n map(() => location.hash),\n filter(hash => hash.length > 0),\n share()\n )\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { Observable, fromEventPattern } from \"rxjs\"\nimport { shareReplay, startWith } from \"rxjs/operators\"\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch media query\n *\n * @param query - Media query\n *\n * @return Media observable\n */\nexport function watchMedia(query: string): Observable {\n const media = matchMedia(query)\n return fromEventPattern(next =>\n media.addListener(() => next(media.matches))\n )\n .pipe(\n startWith(media.matches),\n shareReplay(1)\n )\n}\n","/** PURE_IMPORTS_START _Observable,_util_isArray,_util_isFunction,_operators_map PURE_IMPORTS_END */\nimport { Observable } from '../Observable';\nimport { isArray } from '../util/isArray';\nimport { isFunction } from '../util/isFunction';\nimport { map } from '../operators/map';\nexport function fromEventPattern(addHandler, removeHandler, resultSelector) {\n if (resultSelector) {\n return fromEventPattern(addHandler, removeHandler).pipe(map(function (args) { return isArray(args) ? resultSelector.apply(void 0, args) : resultSelector(args); }));\n }\n return new Observable(function (subscriber) {\n var handler = function () {\n var e = [];\n for (var _i = 0; _i < arguments.length; _i++) {\n e[_i] = arguments[_i];\n }\n return subscriber.next(e.length === 1 ? e[0] : e);\n };\n var retValue;\n try {\n retValue = addHandler(handler);\n }\n catch (err) {\n subscriber.error(err);\n return undefined;\n }\n if (!isFunction(removeHandler)) {\n return undefined;\n }\n return function () { return removeHandler(handler, retValue); };\n });\n}\n//# sourceMappingURL=fromEventPattern.js.map\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { Observable, fromEvent, merge } from \"rxjs\"\nimport { map, shareReplay, startWith } from \"rxjs/operators\"\n\n/* ----------------------------------------------------------------------------\n * Data\n * ------------------------------------------------------------------------- */\n\n/**\n * Observable for window scroll events\n */\nconst scroll$ = fromEvent(window, \"scroll\")\n\n/**\n * Observable for window resize events\n */\nconst resize$ = fromEvent(window, \"resize\")\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Viewport offset\n */\nexport interface ViewportOffset {\n x: number /* Horizontal offset */\n y: number /* Vertical offset */\n}\n\n/**\n * Viewport size\n */\nexport interface ViewportSize {\n width: number /* Viewport width */\n height: number /* Viewport height */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Retrieve viewport offset\n *\n * @return Viewport offset\n */\nexport function getViewportOffset(): ViewportOffset {\n return {\n x: pageXOffset,\n y: pageYOffset\n }\n}\n\n/**\n * Retrieve viewport size\n *\n * @return Viewport size\n */\nexport function getViewportSize(): ViewportSize {\n return {\n width: innerWidth,\n height: innerHeight\n }\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Watch viewport offset\n *\n * @return Viewport offset observable\n */\nexport function watchViewportOffset(): Observable {\n return merge(scroll$, resize$)\n .pipe(\n map(getViewportOffset),\n startWith(getViewportOffset()),\n shareReplay(1)\n )\n}\n\n/**\n * Watch viewport size\n *\n * @return Viewport size observable\n */\nexport function watchViewportSize(): Observable {\n return resize$\n .pipe(\n map(getViewportSize),\n startWith(getViewportSize()),\n shareReplay(1)\n )\n}\n","/** PURE_IMPORTS_START tslib,_OuterSubscriber,_util_subscribeToResult PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { OuterSubscriber } from '../OuterSubscriber';\nimport { subscribeToResult } from '../util/subscribeToResult';\nexport var defaultThrottleConfig = {\n leading: true,\n trailing: false\n};\nexport function throttle(durationSelector, config) {\n if (config === void 0) {\n config = defaultThrottleConfig;\n }\n return function (source) { return source.lift(new ThrottleOperator(durationSelector, config.leading, config.trailing)); };\n}\nvar ThrottleOperator = /*@__PURE__*/ (function () {\n function ThrottleOperator(durationSelector, leading, trailing) {\n this.durationSelector = durationSelector;\n this.leading = leading;\n this.trailing = trailing;\n }\n ThrottleOperator.prototype.call = function (subscriber, source) {\n return source.subscribe(new ThrottleSubscriber(subscriber, this.durationSelector, this.leading, this.trailing));\n };\n return ThrottleOperator;\n}());\nvar ThrottleSubscriber = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(ThrottleSubscriber, _super);\n function ThrottleSubscriber(destination, durationSelector, _leading, _trailing) {\n var _this = _super.call(this, destination) || this;\n _this.destination = destination;\n _this.durationSelector = durationSelector;\n _this._leading = _leading;\n _this._trailing = _trailing;\n _this._hasValue = false;\n return _this;\n }\n ThrottleSubscriber.prototype._next = function (value) {\n this._hasValue = true;\n this._sendValue = value;\n if (!this._throttled) {\n if (this._leading) {\n this.send();\n }\n else {\n this.throttle(value);\n }\n }\n };\n ThrottleSubscriber.prototype.send = function () {\n var _a = this, _hasValue = _a._hasValue, _sendValue = _a._sendValue;\n if (_hasValue) {\n this.destination.next(_sendValue);\n this.throttle(_sendValue);\n }\n this._hasValue = false;\n this._sendValue = null;\n };\n ThrottleSubscriber.prototype.throttle = function (value) {\n var duration = this.tryDurationSelector(value);\n if (!!duration) {\n this.add(this._throttled = subscribeToResult(this, duration));\n }\n };\n ThrottleSubscriber.prototype.tryDurationSelector = function (value) {\n try {\n return this.durationSelector(value);\n }\n catch (err) {\n this.destination.error(err);\n return null;\n }\n };\n ThrottleSubscriber.prototype.throttlingDone = function () {\n var _a = this, _throttled = _a._throttled, _trailing = _a._trailing;\n if (_throttled) {\n _throttled.unsubscribe();\n }\n this._throttled = null;\n if (_trailing) {\n this.send();\n }\n };\n ThrottleSubscriber.prototype.notifyNext = function (outerValue, innerValue, outerIndex, innerIndex, innerSub) {\n this.throttlingDone();\n };\n ThrottleSubscriber.prototype.notifyComplete = function () {\n this.throttlingDone();\n };\n return ThrottleSubscriber;\n}(OuterSubscriber));\n//# sourceMappingURL=throttle.js.map\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { Observable, fromEvent } from \"rxjs\"\nimport { pluck, share, switchMapTo, tap, throttle } from \"rxjs/operators\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Worker message\n */\nexport interface WorkerMessage {\n type: unknown /* Message type */\n data: unknown /* Message data */\n}\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * Options\n *\n * @template T - Worker message type\n */\ninterface Options {\n send$: Observable /* Message observable */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch a web worker\n *\n * This function returns an observable that will send all values emitted by the\n * message observable to the web worker. Web worker communication is expected\n * to be bidirectional (request-response) and synchronous. Messages that are\n * emitted during a pending request are throttled, the last one is emitted.\n *\n * @param worker - Web worker\n *\n * @return Worker message observable\n */\nexport function watchWorker(\n worker: Worker, { send$ }: Options\n): Observable {\n\n /* Intercept messages from web worker */\n const recv$ = fromEvent(worker, \"message\")\n .pipe(\n pluck(\"data\"),\n share()\n )\n\n /* Send and receive messages, return hot observable */\n return send$\n .pipe(\n throttle(() => recv$, { leading: true, trailing: true }),\n tap(message => worker.postMessage(message)),\n switchMapTo(recv$),\n share()\n )\n}\n","/** PURE_IMPORTS_START tslib,_AsyncAction PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { AsyncAction } from './AsyncAction';\nvar AnimationFrameAction = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(AnimationFrameAction, _super);\n function AnimationFrameAction(scheduler, work) {\n var _this = _super.call(this, scheduler, work) || this;\n _this.scheduler = scheduler;\n _this.work = work;\n return _this;\n }\n AnimationFrameAction.prototype.requestAsyncId = function (scheduler, id, delay) {\n if (delay === void 0) {\n delay = 0;\n }\n if (delay !== null && delay > 0) {\n return _super.prototype.requestAsyncId.call(this, scheduler, id, delay);\n }\n scheduler.actions.push(this);\n return scheduler.scheduled || (scheduler.scheduled = requestAnimationFrame(function () { return scheduler.flush(null); }));\n };\n AnimationFrameAction.prototype.recycleAsyncId = function (scheduler, id, delay) {\n if (delay === void 0) {\n delay = 0;\n }\n if ((delay !== null && delay > 0) || (delay === null && this.delay > 0)) {\n return _super.prototype.recycleAsyncId.call(this, scheduler, id, delay);\n }\n if (scheduler.actions.length === 0) {\n cancelAnimationFrame(id);\n scheduler.scheduled = undefined;\n }\n return undefined;\n };\n return AnimationFrameAction;\n}(AsyncAction));\nexport { AnimationFrameAction };\n//# sourceMappingURL=AnimationFrameAction.js.map\n","/** PURE_IMPORTS_START _AnimationFrameAction,_AnimationFrameScheduler PURE_IMPORTS_END */\nimport { AnimationFrameAction } from './AnimationFrameAction';\nimport { AnimationFrameScheduler } from './AnimationFrameScheduler';\nexport var animationFrame = /*@__PURE__*/ new AnimationFrameScheduler(AnimationFrameAction);\n//# sourceMappingURL=animationFrame.js.map\n","/** PURE_IMPORTS_START tslib,_AsyncScheduler PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { AsyncScheduler } from './AsyncScheduler';\nvar AnimationFrameScheduler = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(AnimationFrameScheduler, _super);\n function AnimationFrameScheduler() {\n return _super !== null && _super.apply(this, arguments) || this;\n }\n AnimationFrameScheduler.prototype.flush = function (action) {\n this.active = true;\n this.scheduled = undefined;\n var actions = this.actions;\n var error;\n var index = -1;\n var count = actions.length;\n action = action || actions.shift();\n do {\n if (error = action.execute(action.state, action.delay)) {\n break;\n }\n } while (++index < count && (action = actions.shift()));\n this.active = false;\n if (error) {\n while (++index < count && (action = actions.shift())) {\n action.unsubscribe();\n }\n throw error;\n }\n };\n return AnimationFrameScheduler;\n}(AsyncScheduler));\nexport { AnimationFrameScheduler };\n//# sourceMappingURL=AnimationFrameScheduler.js.map\n","/** PURE_IMPORTS_START tslib,_Subscriber,_Subscription PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { Subscriber } from '../Subscriber';\nimport { Subscription } from '../Subscription';\nexport function finalize(callback) {\n return function (source) { return source.lift(new FinallyOperator(callback)); };\n}\nvar FinallyOperator = /*@__PURE__*/ (function () {\n function FinallyOperator(callback) {\n this.callback = callback;\n }\n FinallyOperator.prototype.call = function (subscriber, source) {\n return source.subscribe(new FinallySubscriber(subscriber, this.callback));\n };\n return FinallyOperator;\n}());\nvar FinallySubscriber = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(FinallySubscriber, _super);\n function FinallySubscriber(destination, callback) {\n var _this = _super.call(this, destination) || this;\n _this.add(new Subscription(callback));\n return _this;\n }\n return FinallySubscriber;\n}(Subscriber));\n//# sourceMappingURL=finalize.js.map\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { getElement } from \"../agent\"\n\n/* ----------------------------------------------------------------------------\n * Data\n * ------------------------------------------------------------------------- */\n\n/**\n * Translations\n */\nlet lang: Record\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Truncate a string after the given number of characters\n *\n * @param value - Value to be truncated\n * @param n - Number of characters\n *\n * @return Truncated value\n */\nexport function truncate(value: string, n: number): string {\n let i = n\n if (value.length > i) {\n while (value[i] !== \" \" && --i > 0); // tslint:disable-line\n return `${value.substring(0, i)}...`\n }\n return value\n}\n\n/**\n * Translate the given key\n *\n * @param key - Key to be translated\n * @param value - Value to be replaced\n *\n * @return Translation\n */\nexport function translate(key: string, value?: string): string {\n if (typeof lang === \"undefined\") {\n const el = getElement(\"#__lang\")!\n lang = JSON.parse(el.innerText)\n }\n if (typeof lang[key] === \"undefined\") {\n throw new ReferenceError(`Invalid translation: ${key}`)\n }\n return typeof value !== \"undefined\"\n ? lang[key].replace(\"#\", value)\n : lang[key]\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Set anchor blur\n *\n * @param el - Anchor element\n * @param value - Whether the anchor is blurred\n */\nexport function setAnchorBlur(\n el: HTMLElement, value: boolean\n): void {\n el.setAttribute(\"data-md-state\", value ? \"blur\" : \"\")\n}\n\n/**\n * Reset anchor blur\n *\n * @param el - Anchor element\n */\nexport function resetAnchorBlur(\n el: HTMLElement\n): void {\n el.removeAttribute(\"data-md-state\")\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Set anchor active\n *\n * @param el - Anchor element\n * @param value - Whether the anchor is active\n */\nexport function setAnchorActive(\n el: HTMLElement, value: boolean\n): void {\n el.classList.toggle(\"md-nav__link--active\", value)\n}\n\n/**\n * Reset anchor active\n *\n * @param el - Anchor element\n */\nexport function resetAnchorActive(\n el: HTMLElement\n): void {\n el.classList.remove(\"md-nav__link--active\")\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { translate } from \"utilities\"\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Set number of search results\n *\n * @param el - Search result metadata element\n * @param value - Number of results\n */\nexport function setSearchResultMeta(\n el: HTMLElement, value: number\n): void {\n el.textContent = value > 1\n ? translate(\"search.result.other\", value.toString())\n : value === 1\n ? translate(\"search.result.one\")\n : translate(\"search.result.none\")\n}\n\n/**\n * Reset number of search results\n *\n * @param el - Search result metadata element\n */\nexport function resetSearchResultMeta(\n el: HTMLElement\n): void {\n el.textContent = translate(\"search.result.placeholder\")\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Add an element to the search result list\n *\n * @param el - Search result list element\n * @param child - Search result element\n */\nexport function addToSearchResultList(\n el: HTMLElement, child: HTMLElement\n): void {\n el.appendChild(child)\n}\n\n/**\n * Reset search result list\n *\n * @param el - Search result list element\n */\nexport function resetSearchResultList(\n el: HTMLElement\n): void {\n el.innerHTML = \"\"\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { OperatorFunction, animationFrameScheduler, pipe } from \"rxjs\"\nimport {\n distinctUntilChanged,\n finalize,\n map,\n observeOn,\n tap\n} from \"rxjs/operators\"\n\nimport { resetHidden, setHidden } from \"actions\"\n\nimport { ViewportOffset } from \"../agent\"\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Paint hideable from source observable\n *\n * @param el - Hideable element\n * @param offset - Additional offset\n *\n * @return Operator function\n */\nexport function paintHidden(\n el: HTMLElement, offset: number = 0\n): OperatorFunction {\n return pipe(\n map(({ y }) => y >= offset),\n distinctUntilChanged(),\n\n /* Defer repaint to next animation frame */\n observeOn(animationFrameScheduler),\n tap(value => {\n setHidden(el, value)\n }),\n\n /* Reset on complete or error */\n finalize(() => {\n resetHidden(el)\n })\n )\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Set hidden\n *\n * @param el - Hideable element\n * @param value - Whether the element is hidden\n */\nexport function setHidden(\n el: HTMLElement, value: boolean\n): void {\n el.setAttribute(\"data-md-state\", value ? \"hidden\" : \"\")\n}\n\n/**\n * Reset hidden\n *\n * @param el - Hideable element\n */\nexport function resetHidden(\n el: HTMLElement\n): void {\n el.removeAttribute(\"data-md-state\")\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { Observable, defer, of } from \"rxjs\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Header state\n */\nexport interface HeaderState {\n sticky: boolean /* Header stickyness */\n height: number /* Header visible height */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch header\n *\n * The header is wrapped in an observable to pave the way for auto-hiding or\n * other dynamic behaviors that may be implemented later on.\n *\n * @param el - Header element\n *\n * @return Header state observable\n */\nexport function watchHeader(\n el: HTMLElement\n): Observable {\n return defer(() => {\n const sticky = getComputedStyle(el)\n .getPropertyValue(\"position\") === \"sticky\"\n\n /* Return header as hot observable */\n return of({\n sticky,\n height: sticky ? el.offsetHeight : 0\n })\n })\n}\n","/** PURE_IMPORTS_START _Observable,_from,_empty PURE_IMPORTS_END */\nimport { Observable } from '../Observable';\nimport { from } from './from';\nimport { empty } from './empty';\nexport function defer(observableFactory) {\n return new Observable(function (subscriber) {\n var input;\n try {\n input = observableFactory();\n }\n catch (err) {\n subscriber.error(err);\n return undefined;\n }\n var source = input ? from(input) : empty();\n return source.subscribe(subscriber);\n });\n}\n//# sourceMappingURL=defer.js.map\n","/** PURE_IMPORTS_START tslib,_util_isScheduler,_util_isArray,_OuterSubscriber,_util_subscribeToResult,_fromArray PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { isScheduler } from '../util/isScheduler';\nimport { isArray } from '../util/isArray';\nimport { OuterSubscriber } from '../OuterSubscriber';\nimport { subscribeToResult } from '../util/subscribeToResult';\nimport { fromArray } from './fromArray';\nvar NONE = {};\nexport function combineLatest() {\n var observables = [];\n for (var _i = 0; _i < arguments.length; _i++) {\n observables[_i] = arguments[_i];\n }\n var resultSelector = null;\n var scheduler = null;\n if (isScheduler(observables[observables.length - 1])) {\n scheduler = observables.pop();\n }\n if (typeof observables[observables.length - 1] === 'function') {\n resultSelector = observables.pop();\n }\n if (observables.length === 1 && isArray(observables[0])) {\n observables = observables[0];\n }\n return fromArray(observables, scheduler).lift(new CombineLatestOperator(resultSelector));\n}\nvar CombineLatestOperator = /*@__PURE__*/ (function () {\n function CombineLatestOperator(resultSelector) {\n this.resultSelector = resultSelector;\n }\n CombineLatestOperator.prototype.call = function (subscriber, source) {\n return source.subscribe(new CombineLatestSubscriber(subscriber, this.resultSelector));\n };\n return CombineLatestOperator;\n}());\nexport { CombineLatestOperator };\nvar CombineLatestSubscriber = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(CombineLatestSubscriber, _super);\n function CombineLatestSubscriber(destination, resultSelector) {\n var _this = _super.call(this, destination) || this;\n _this.resultSelector = resultSelector;\n _this.active = 0;\n _this.values = [];\n _this.observables = [];\n return _this;\n }\n CombineLatestSubscriber.prototype._next = function (observable) {\n this.values.push(NONE);\n this.observables.push(observable);\n };\n CombineLatestSubscriber.prototype._complete = function () {\n var observables = this.observables;\n var len = observables.length;\n if (len === 0) {\n this.destination.complete();\n }\n else {\n this.active = len;\n this.toRespond = len;\n for (var i = 0; i < len; i++) {\n var observable = observables[i];\n this.add(subscribeToResult(this, observable, observable, i));\n }\n }\n };\n CombineLatestSubscriber.prototype.notifyComplete = function (unused) {\n if ((this.active -= 1) === 0) {\n this.destination.complete();\n }\n };\n CombineLatestSubscriber.prototype.notifyNext = function (outerValue, innerValue, outerIndex, innerIndex, innerSub) {\n var values = this.values;\n var oldVal = values[outerIndex];\n var toRespond = !this.toRespond\n ? 0\n : oldVal === NONE ? --this.toRespond : this.toRespond;\n values[outerIndex] = innerValue;\n if (toRespond === 0) {\n if (this.resultSelector) {\n this._tryResultSelector(values);\n }\n else {\n this.destination.next(values.slice());\n }\n }\n };\n CombineLatestSubscriber.prototype._tryResultSelector = function (values) {\n var result;\n try {\n result = this.resultSelector.apply(this, values);\n }\n catch (err) {\n this.destination.error(err);\n return;\n }\n this.destination.next(result);\n };\n return CombineLatestSubscriber;\n}(OuterSubscriber));\nexport { CombineLatestSubscriber };\n//# sourceMappingURL=combineLatest.js.map\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { Observable, combineLatest } from \"rxjs\"\nimport {\n distinctUntilChanged,\n map,\n shareReplay,\n switchMapTo\n} from \"rxjs/operators\"\n\nimport { Agent, ViewportOffset } from \"utilities\"\n\nimport { HeaderState } from \"../_\"\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * Options\n */\ninterface Options {\n header$: Observable /* Header state observable */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch viewport offset relative to an element's top\n *\n * This function returns an observable that computes the relative offset to the\n * top of the given element based on the current viewport offset.\n *\n * @param el - HTML element\n * @param agent - Agent\n * @param options - Options\n *\n * @return Viewport offset observable\n */\nexport function watchViewportOffsetFromTopOf(\n el: HTMLElement, { viewport }: Agent, { header$ }: Options\n): Observable {\n\n /* Compute necessary adjustment for offset */\n const adjust$ = viewport.size$\n .pipe(\n switchMapTo(header$),\n map(({ height }) => el.offsetTop - height),\n distinctUntilChanged()\n )\n\n /* Compute relative offset and return as hot observable */\n return combineLatest([viewport.offset$, adjust$])\n .pipe(\n map(([{ x, y }, adjust]) => ({ x, y: y - adjust })),\n shareReplay(1)\n )\n}\n\n/**\n * Watch viewport offset relative to an element's bottom\n *\n * This function returns an observable that computes the relative offset to the\n * bottom of the given element based on the current viewport offset.\n *\n * @param el - HTML element\n * @param agent - Agent\n * @param options - Options\n *\n * @return Viewport offset observable\n */\nexport function watchViewportOffsetFromBottomOf(\n el: HTMLElement, { viewport }: Agent, { header$ }: Options\n): Observable {\n\n /* Compute necessary adjustment for offset */\n const adjust$ = viewport.size$\n .pipe(\n switchMapTo(header$),\n map(({ height }) => el.offsetTop + el.offsetHeight - height),\n distinctUntilChanged()\n )\n\n /* Compute relative offset and return as hot observable */\n return combineLatest([viewport.offset$, adjust$])\n .pipe(\n map(([{ x, y }, adjust]) => ({ x, y: y - adjust })),\n shareReplay(1)\n )\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport {\n MonoTypeOperatorFunction,\n animationFrameScheduler,\n pipe\n} from \"rxjs\"\nimport {\n distinctUntilKeyChanged,\n finalize,\n observeOn,\n tap\n} from \"rxjs/operators\"\n\nimport { resetHeaderShadow, setHeaderShadow } from \"actions\"\n\nimport { MainState } from \"../../main\"\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Paint header shadow from source observable\n *\n * @param el - Header element\n *\n * @return Operator function\n */\nexport function paintHeaderShadow(\n el: HTMLElement\n): MonoTypeOperatorFunction {\n return pipe(\n distinctUntilKeyChanged(\"active\"),\n\n /* Defer repaint to next animation frame */\n observeOn(animationFrameScheduler),\n tap(({ active }) => {\n setHeaderShadow(el, active)\n }),\n\n /* Reset on complete or error */\n finalize(() => {\n resetHeaderShadow(el)\n })\n )\n}\n","/** PURE_IMPORTS_START _distinctUntilChanged PURE_IMPORTS_END */\nimport { distinctUntilChanged } from './distinctUntilChanged';\nexport function distinctUntilKeyChanged(key, compare) {\n return distinctUntilChanged(function (x, y) { return compare ? compare(x[key], y[key]) : x[key] === y[key]; });\n}\n//# sourceMappingURL=distinctUntilKeyChanged.js.map\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Set header shadow\n *\n * @param el - Header element\n * @param value - Whether the shadow is shown\n */\nexport function setHeaderShadow(\n el: HTMLElement, value: boolean\n): void {\n el.setAttribute(\"data-md-state\", value ? \"shadow\" : \"\")\n}\n\n/**\n * Reset header shadow\n *\n * @param el - Header element\n */\nexport function resetHeaderShadow(\n el: HTMLElement\n): void {\n el.removeAttribute(\"data-md-state\")\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { JSX as JSXInternal } from \"preact\"\nimport { keys } from \"ramda\"\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * HTML attributes\n */\ntype Attributes =\n & JSXInternal.HTMLAttributes\n & JSXInternal.SVGAttributes\n & Record\n\n/**\n * Child element\n */\ntype Child = Child[] | HTMLElement | Text | string | number\n\n/* ----------------------------------------------------------------------------\n * Helper functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Append a child node to an element\n *\n * @param el - HTML element\n * @param child - Child node\n */\nfunction appendChild(el: HTMLElement, child: Child): void {\n\n /* Handle primitive types (including raw HTML) */\n if (typeof child === \"string\" || typeof child === \"number\") {\n el.innerHTML += child.toString()\n\n /* Handle nodes */\n } else if (child instanceof Node) {\n el.appendChild(child)\n\n /* Handle nested children */\n } else if (Array.isArray(child)) {\n for (const node of child)\n appendChild(el, node)\n }\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * JSX factory\n *\n * @param tag - HTML tag\n * @param attributes - HTML attributes\n * @param children - Child elements\n *\n * @return HTML element\n */\nexport function h(\n tag: string, attributes: Attributes | null,\n ...children: Array\n): HTMLElement {\n const el = document.createElement(tag)\n\n /* Set attributes, if any */\n if (attributes)\n for (const attr of keys(attributes))\n if (typeof attributes[attr] !== \"boolean\")\n el.setAttribute(attr, attributes[attr])\n else if (attributes[attr])\n el.setAttribute(attr, \"\")\n\n /* Append child nodes */\n for (const child of children)\n appendChild(el, child)\n\n /* Return element */\n return el\n}\n\n/**\n * JSX factory wrapper\n *\n * @param el - JSX element\n *\n * @return HTML element\n */\nexport function toHTMLElement(el: JSXInternal.Element): HTMLElement {\n return el as any // Hack: if you have a better idea, PR!\n}\n\n/* ----------------------------------------------------------------------------\n * Namespace\n * ------------------------------------------------------------------------- */\n\nexport declare namespace h {\n export import JSX = JSXInternal\n}\n","/** PURE_IMPORTS_START tslib,_OuterSubscriber,_util_subscribeToResult PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { OuterSubscriber } from '../OuterSubscriber';\nimport { subscribeToResult } from '../util/subscribeToResult';\nexport function takeUntil(notifier) {\n return function (source) { return source.lift(new TakeUntilOperator(notifier)); };\n}\nvar TakeUntilOperator = /*@__PURE__*/ (function () {\n function TakeUntilOperator(notifier) {\n this.notifier = notifier;\n }\n TakeUntilOperator.prototype.call = function (subscriber, source) {\n var takeUntilSubscriber = new TakeUntilSubscriber(subscriber);\n var notifierSubscription = subscribeToResult(takeUntilSubscriber, this.notifier);\n if (notifierSubscription && !takeUntilSubscriber.seenValue) {\n takeUntilSubscriber.add(notifierSubscription);\n return source.subscribe(takeUntilSubscriber);\n }\n return takeUntilSubscriber;\n };\n return TakeUntilOperator;\n}());\nvar TakeUntilSubscriber = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(TakeUntilSubscriber, _super);\n function TakeUntilSubscriber(destination) {\n var _this = _super.call(this, destination) || this;\n _this.seenValue = false;\n return _this;\n }\n TakeUntilSubscriber.prototype.notifyNext = function (outerValue, innerValue, outerIndex, innerIndex, innerSub) {\n this.seenValue = true;\n this.complete();\n };\n TakeUntilSubscriber.prototype.notifyComplete = function () {\n };\n return TakeUntilSubscriber;\n}(OuterSubscriber));\n//# sourceMappingURL=takeUntil.js.map\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport {\n EMPTY,\n Observable,\n OperatorFunction,\n combineLatest,\n of,\n pipe\n} from \"rxjs\"\nimport {\n filter,\n switchMap,\n takeUntil\n} from \"rxjs/operators\"\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Toggle switch map with another observable\n *\n * @template T - Source value type\n * @template U - Target value type\n *\n * @param toggle$ - Toggle observable\n * @param project - Projection\n *\n * @return Operator function\n */\nexport function switchMapIf(\n toggle$: Observable, project: (value: T) => Observable\n): OperatorFunction {\n const begin$ = toggle$.pipe(filter(value => value))\n const end$ = toggle$.pipe(filter(value => !value))\n return pipe(\n switchMap(value => combineLatest([of(value), begin$])),\n switchMap(([value, active]) => active\n ? project(value)\n .pipe(\n takeUntil(end$)\n )\n : EMPTY\n )\n )\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { Observable, OperatorFunction, pipe } from \"rxjs\"\nimport { map, shareReplay } from \"rxjs/operators\"\n\nimport { switchMapIf } from \"extensions\"\nimport { Agent, paintHidden } from \"utilities\"\n\nimport { HeaderState, watchViewportOffsetFromTopOf } from \"../header\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Hero state\n */\nexport interface HeroState {\n hidden: boolean /* Whether the hero is hidden */\n}\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * Options\n */\ninterface Options {\n header$: Observable /* Header state observable */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch hero\n *\n * @param el - Hero element\n * @param agent - Agent\n * @param options - Options\n *\n * @return Hero state\n */\nexport function watchHero(\n el: HTMLElement, agent: Agent, { header$ }: Options\n): Observable {\n\n /* Watch and paint visibility */\n const hidden$ = watchViewportOffsetFromTopOf(el, agent, { header$ })\n .pipe(\n paintHidden(el, 20)\n )\n\n /* Combine into a single hot observable */\n return hidden$\n .pipe(\n map(hidden => ({ hidden }))\n )\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Mount hero from source observable\n *\n * @param agent - Agent\n * @param options - Options\n *\n * @return Operator function\n */\nexport function mountHero(\n agent: Agent, options: Options\n): OperatorFunction {\n const { media } = agent\n return pipe(\n switchMapIf(media.screen$, el => watchHero(el, agent, options)),\n shareReplay(1)\n )\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { Observable, OperatorFunction, combineLatest, pipe } from \"rxjs\"\nimport {\n distinctUntilChanged,\n map,\n pluck,\n shareReplay,\n switchMap\n} from \"rxjs/operators\"\n\nimport { Agent } from \"utilities\"\n\nimport { HeaderState } from \"../../header\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Main area state\n */\nexport interface MainState {\n offset: number /* Main area top offset */\n height: number /* Main area visible height */\n active: boolean /* Scrolled past top offset */\n}\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * Options\n */\ninterface Options {\n header$: Observable /* Header state observable */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch main area\n *\n * This function returns an observable that computes the visual parameters of\n * the main area which depends on the viewport height and vertical offset, as\n * well as the height of the header element, if the header is fixed.\n *\n * @param el - Main area element\n * @param agent - Agent\n * @param options - Options\n *\n * @return Main area state observable\n */\nexport function watchMain(\n el: HTMLElement, { viewport }: Agent, { header$ }: Options\n): Observable {\n\n /* Compute necessary adjustment for header */\n const adjust$ = header$\n .pipe(\n pluck(\"height\")\n )\n\n /* Compute the main area's visible height */\n const height$ = combineLatest([\n viewport.offset$,\n viewport.size$,\n adjust$\n ])\n .pipe(\n map(([{ y }, { height }, adjust]) => {\n const top = el.offsetTop\n const bottom = el.offsetHeight + top\n return height\n - Math.max(0, top - y, adjust)\n - Math.max(0, height + y - bottom)\n }),\n distinctUntilChanged()\n )\n\n /* Compute whether the viewport offset is past the main area's top */\n const active$ = combineLatest([viewport.offset$, adjust$])\n .pipe(\n map(([{ y }, adjust]) => y >= el.offsetTop - adjust),\n distinctUntilChanged()\n )\n\n /* Combine into a single hot observable */\n return combineLatest([height$, adjust$, active$])\n .pipe(\n map(([height, adjust, active]) => ({\n offset: el.offsetTop - adjust,\n height,\n active\n }))\n )\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Mount main area from source observable\n *\n * @param agent - Agent\n * @param options - Options\n *\n * @return Operator function\n */\nexport function mountMain(\n agent: Agent, options: Options\n): OperatorFunction {\n return pipe(\n switchMap(el => watchMain(el, agent, options)),\n shareReplay(1)\n )\n}\n","import _curry1 from './_curry1.js';\nimport _isPlaceholder from './_isPlaceholder.js';\n\n/**\n * Optimized internal two-arity curry function.\n *\n * @private\n * @category Function\n * @param {Function} fn The function to curry.\n * @return {Function} The curried function.\n */\nexport default function _curry2(fn) {\n return function f2(a, b) {\n switch (arguments.length) {\n case 0:\n return f2;\n case 1:\n return _isPlaceholder(a) ? f2 : _curry1(function (_b) {\n return fn(a, _b);\n });\n default:\n return _isPlaceholder(a) && _isPlaceholder(b) ? f2 : _isPlaceholder(a) ? _curry1(function (_a) {\n return fn(_a, b);\n }) : _isPlaceholder(b) ? _curry1(function (_b) {\n return fn(a, _b);\n }) : fn(a, b);\n }\n };\n}","export default function _arrayFromIterator(iter) {\n var list = [];\n var next;\n while (!(next = iter.next()).done) {\n list.push(next.value);\n }\n return list;\n}","export default function _includesWith(pred, x, list) {\n var idx = 0;\n var len = list.length;\n\n while (idx < len) {\n if (pred(x, list[idx])) {\n return true;\n }\n idx += 1;\n }\n return false;\n}","// Based on https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Object/is\nfunction _objectIs(a, b) {\n // SameValue algorithm\n if (a === b) {\n // Steps 1-5, 7-10\n // Steps 6.b-6.e: +0 != -0\n return a !== 0 || 1 / a === 1 / b;\n } else {\n // Step 6.a: NaN == NaN\n return a !== a && b !== b;\n }\n}\n\nexport default typeof Object.is === 'function' ? Object.is : _objectIs;","import _curry1 from './internal/_curry1.js';\n\n/**\n * Gives a single-word string description of the (native) type of a value,\n * returning such answers as 'Object', 'Number', 'Array', or 'Null'. Does not\n * attempt to distinguish user Object types any further, reporting them all as\n * 'Object'.\n *\n * @func\n * @memberOf R\n * @since v0.8.0\n * @category Type\n * @sig (* -> {*}) -> String\n * @param {*} val The value to test\n * @return {String}\n * @example\n *\n * R.type({}); //=> \"Object\"\n * R.type(1); //=> \"Number\"\n * R.type(false); //=> \"Boolean\"\n * R.type('s'); //=> \"String\"\n * R.type(null); //=> \"Null\"\n * R.type([]); //=> \"Array\"\n * R.type(/[A-z]/); //=> \"RegExp\"\n * R.type(() => {}); //=> \"Function\"\n * R.type(undefined); //=> \"Undefined\"\n */\nvar type = /*#__PURE__*/_curry1(function type(val) {\n return val === null ? 'Null' : val === undefined ? 'Undefined' : Object.prototype.toString.call(val).slice(8, -1);\n});\nexport default type;","import _arrayFromIterator from './_arrayFromIterator.js';\nimport _includesWith from './_includesWith.js';\nimport _functionName from './_functionName.js';\nimport _has from './_has.js';\nimport _objectIs from './_objectIs.js';\nimport keys from '../keys.js';\nimport type from '../type.js';\n\n/**\n * private _uniqContentEquals function.\n * That function is checking equality of 2 iterator contents with 2 assumptions\n * - iterators lengths are the same\n * - iterators values are unique\n *\n * false-positive result will be returned for comparision of, e.g.\n * - [1,2,3] and [1,2,3,4]\n * - [1,1,1] and [1,2,3]\n * */\n\nfunction _uniqContentEquals(aIterator, bIterator, stackA, stackB) {\n var a = _arrayFromIterator(aIterator);\n var b = _arrayFromIterator(bIterator);\n\n function eq(_a, _b) {\n return _equals(_a, _b, stackA.slice(), stackB.slice());\n }\n\n // if *a* array contains any element that is not included in *b*\n return !_includesWith(function (b, aItem) {\n return !_includesWith(eq, aItem, b);\n }, b, a);\n}\n\nexport default function _equals(a, b, stackA, stackB) {\n if (_objectIs(a, b)) {\n return true;\n }\n\n var typeA = type(a);\n\n if (typeA !== type(b)) {\n return false;\n }\n\n if (a == null || b == null) {\n return false;\n }\n\n if (typeof a['fantasy-land/equals'] === 'function' || typeof b['fantasy-land/equals'] === 'function') {\n return typeof a['fantasy-land/equals'] === 'function' && a['fantasy-land/equals'](b) && typeof b['fantasy-land/equals'] === 'function' && b['fantasy-land/equals'](a);\n }\n\n if (typeof a.equals === 'function' || typeof b.equals === 'function') {\n return typeof a.equals === 'function' && a.equals(b) && typeof b.equals === 'function' && b.equals(a);\n }\n\n switch (typeA) {\n case 'Arguments':\n case 'Array':\n case 'Object':\n if (typeof a.constructor === 'function' && _functionName(a.constructor) === 'Promise') {\n return a === b;\n }\n break;\n case 'Boolean':\n case 'Number':\n case 'String':\n if (!(typeof a === typeof b && _objectIs(a.valueOf(), b.valueOf()))) {\n return false;\n }\n break;\n case 'Date':\n if (!_objectIs(a.valueOf(), b.valueOf())) {\n return false;\n }\n break;\n case 'Error':\n return a.name === b.name && a.message === b.message;\n case 'RegExp':\n if (!(a.source === b.source && a.global === b.global && a.ignoreCase === b.ignoreCase && a.multiline === b.multiline && a.sticky === b.sticky && a.unicode === b.unicode)) {\n return false;\n }\n break;\n }\n\n var idx = stackA.length - 1;\n while (idx >= 0) {\n if (stackA[idx] === a) {\n return stackB[idx] === b;\n }\n idx -= 1;\n }\n\n switch (typeA) {\n case 'Map':\n if (a.size !== b.size) {\n return false;\n }\n\n return _uniqContentEquals(a.entries(), b.entries(), stackA.concat([a]), stackB.concat([b]));\n case 'Set':\n if (a.size !== b.size) {\n return false;\n }\n\n return _uniqContentEquals(a.values(), b.values(), stackA.concat([a]), stackB.concat([b]));\n case 'Arguments':\n case 'Array':\n case 'Object':\n case 'Boolean':\n case 'Number':\n case 'String':\n case 'Date':\n case 'Error':\n case 'RegExp':\n case 'Int8Array':\n case 'Uint8Array':\n case 'Uint8ClampedArray':\n case 'Int16Array':\n case 'Uint16Array':\n case 'Int32Array':\n case 'Uint32Array':\n case 'Float32Array':\n case 'Float64Array':\n case 'ArrayBuffer':\n break;\n default:\n // Values of other types are only equal if identical.\n return false;\n }\n\n var keysA = keys(a);\n if (keysA.length !== keys(b).length) {\n return false;\n }\n\n var extendedStackA = stackA.concat([a]);\n var extendedStackB = stackB.concat([b]);\n\n idx = keysA.length - 1;\n while (idx >= 0) {\n var key = keysA[idx];\n if (!(_has(key, b) && _equals(b[key], a[key], extendedStackA, extendedStackB))) {\n return false;\n }\n idx -= 1;\n }\n return true;\n}","export default function _functionName(f) {\n // String(x => x) evaluates to \"x => x\", so the pattern may not match.\n var match = String(f).match(/^function (\\w*)/);\n return match == null ? '' : match[1];\n}","import _curry2 from './internal/_curry2.js';\nimport _equals from './internal/_equals.js';\n\n/**\n * Returns `true` if its arguments are equivalent, `false` otherwise. Handles\n * cyclical data structures.\n *\n * Dispatches symmetrically to the `equals` methods of both arguments, if\n * present.\n *\n * @func\n * @memberOf R\n * @since v0.15.0\n * @category Relation\n * @sig a -> b -> Boolean\n * @param {*} a\n * @param {*} b\n * @return {Boolean}\n * @example\n *\n * R.equals(1, 1); //=> true\n * R.equals(1, '1'); //=> false\n * R.equals([1, 2, 3], [1, 2, 3]); //=> true\n *\n * const a = {}; a.v = a;\n * const b = {}; b.v = b;\n * R.equals(a, b); //=> true\n */\nvar equals = /*#__PURE__*/_curry2(function equals(a, b) {\n return _equals(a, b, [], []);\n});\nexport default equals;","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { equals } from \"ramda\"\nimport {\n MonoTypeOperatorFunction,\n Observable,\n animationFrameScheduler,\n combineLatest,\n pipe\n} from \"rxjs\"\nimport {\n distinctUntilChanged,\n finalize,\n map,\n observeOn,\n shareReplay,\n tap\n} from \"rxjs/operators\"\n\nimport {\n resetSidebarHeight,\n resetSidebarLock,\n setSidebarHeight,\n setSidebarLock\n} from \"actions\"\nimport { Agent } from \"utilities\"\n\nimport { MainState } from \"../_\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Sidebar state\n */\nexport interface SidebarState {\n height: number /* Sidebar height */\n lock: boolean /* Sidebar lock */\n}\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * Options\n */\ninterface Options {\n main$: Observable /* Main area state observable */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch sidebar\n *\n * This function returns an observable that computes the visual parameters of\n * the sidebar which depends on the vertical viewport offset, as well as the\n * height of the main area. When the page is scrolled beyond the header, the\n * sidebar is locked and fills the remaining space.\n *\n * @param el - Sidebar element\n * @param agent - Agent\n * @param options - Options\n *\n * @return Sidebar state observable\n */\nexport function watchSidebar(\n el: HTMLElement, { viewport }: Agent, { main$ }: Options\n): Observable {\n\n /* Adjust for internal main area offset */\n const adjust = parseFloat(\n getComputedStyle(el.parentElement!)\n .getPropertyValue(\"padding-top\")\n )\n\n /* Compute the sidebar's available height */\n const height$ = combineLatest([viewport.offset$, main$])\n .pipe(\n map(([{ y }, { offset, height }]) => {\n return height - adjust + Math.min(adjust, Math.max(0, y - offset))\n })\n )\n\n /* Compute whether the sidebar should be locked */\n const lock$ = combineLatest([viewport.offset$, main$])\n .pipe(\n map(([{ y }, { offset }]) => y >= offset + adjust)\n )\n\n /* Combine into single hot observable */\n return combineLatest([height$, lock$])\n .pipe(\n map(([height, lock]) => ({ height, lock })),\n distinctUntilChanged(equals),\n shareReplay(1)\n )\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Paint sidebar from source observable\n *\n * @param el - Sidebar element\n *\n * @return Operator function\n */\nexport function paintSidebar(\n el: HTMLElement\n): MonoTypeOperatorFunction {\n return pipe(\n\n /* Defer repaint to next animation frame */\n observeOn(animationFrameScheduler),\n tap(({ height, lock }) => {\n setSidebarHeight(el, height)\n setSidebarLock(el, lock)\n }),\n\n /* Reset on complete or error */\n finalize(() => {\n resetSidebarHeight(el)\n resetSidebarLock(el)\n })\n )\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Set sidebar height\n *\n * @param el - Sidebar element\n * @param value - Sidebar height\n */\nexport function setSidebarHeight(\n el: HTMLElement, value: number\n): void {\n el.style.height = `${value}px`\n}\n\n/**\n * Reset sidebar height\n *\n * @param el - Sidebar element\n */\nexport function resetSidebarHeight(\n el: HTMLElement\n): void {\n el.style.height = \"\"\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Set sidebar lock\n *\n * @param el - Sidebar element\n * @param value - Whether the sidebar is locked\n */\nexport function setSidebarLock(\n el: HTMLElement, value: boolean\n): void {\n el.setAttribute(\"data-md-state\", value ? \"lock\" : \"\")\n}\n\n/**\n * Reset sidebar lock\n *\n * @param el - Sidebar element\n */\nexport function resetSidebarLock(\n el: HTMLElement\n): void {\n el.removeAttribute(\"data-md-state\")\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { Observable, OperatorFunction, pipe } from \"rxjs\"\nimport { map, shareReplay } from \"rxjs/operators\"\n\nimport { switchMapIf } from \"extensions\"\nimport { Agent } from \"utilities\"\n\nimport {\n MainState,\n SidebarState,\n paintSidebar,\n watchSidebar\n} from \"../../main\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Navigation state\n */\nexport interface NavigationState {\n sidebar: SidebarState /* Sidebar state */\n}\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * Options\n */\ninterface Options {\n main$: Observable /* Main area state observable */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch navigation\n *\n * @param el - Navigation element\n * @param agent - Agent\n * @param options - Options\n *\n * @return Navigation state observable\n */\nexport function watchNavigation(\n el: HTMLElement, agent: Agent, { main$ }: Options\n): Observable {\n\n /* Watch and paint sidebar */\n const sidebar$ = watchSidebar(el, agent, { main$ })\n .pipe(\n paintSidebar(el)\n )\n\n /* Combine into a single hot observable */\n return sidebar$\n .pipe(\n map(sidebar => ({ sidebar }))\n )\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Mount navigation from source observable\n *\n * @param agent - Agent\n * @param options - Options\n *\n * @return Operator function\n */\nexport function mountNavigation(\n agent: Agent, options: Options\n): OperatorFunction {\n const { media } = agent\n return pipe(\n switchMapIf(media.screen$, el => watchNavigation(el, agent, options)),\n shareReplay(1)\n )\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { Observable, combineLatest, fromEvent } from \"rxjs\"\nimport {\n distinctUntilChanged,\n map,\n shareReplay,\n startWith\n} from \"rxjs/operators\"\n\nimport { watchElementFocus } from \"utilities\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Search query state\n */\nexport interface SearchQueryState {\n value: string /* Query value */\n focus: boolean /* Query focus state */\n}\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * Options\n */\ninterface Options {\n prepare(value: string): string /* Preparation function */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch search query\n *\n * @param el - Search query element\n * @param options - Options\n *\n * @return Search query state observable\n */\nexport function watchSearchQuery(\n el: HTMLInputElement, { prepare }: Options\n): Observable {\n\n /* Intercept keyboard events */\n const value$ = fromEvent(el, \"keyup\")\n .pipe(\n map(() => prepare(el.value)),\n startWith(\"\"),\n distinctUntilChanged()\n )\n\n /* Intercept focus events */\n const focus$ = watchElementFocus(el)\n\n /* Combine into a single hot observable */\n return combineLatest([value$, focus$])\n .pipe(\n map(([value, focus]) => ({ value, focus })),\n shareReplay(1)\n )\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { Observable, fromEvent, merge } from \"rxjs\"\nimport { mapTo, shareReplay, startWith } from \"rxjs/operators\"\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch element focus\n *\n * @param el - Element\n *\n * @return Element focus observable\n */\nexport function watchElementFocus(\n el: HTMLElement\n): Observable {\n const focus$ = fromEvent(el, \"focus\")\n const blur$ = fromEvent(el, \"blur\")\n\n /* Map events to boolean state */\n return merge(\n focus$.pipe(mapTo(true)),\n blur$.pipe(mapTo(false))\n )\n .pipe(\n startWith(el === document.activeElement),\n shareReplay(1)\n )\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { Observable, fromEvent } from \"rxjs\"\nimport { mapTo } from \"rxjs/operators\"\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch search reset\n *\n * @param el - Search reset element\n *\n * @return Search reset observable\n */\nexport function watchSearchReset(\n el: HTMLElement\n): Observable {\n return fromEvent(el, \"click\")\n .pipe(\n mapTo(undefined)\n )\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { h, toHTMLElement } from \"extensions\"\nimport { ArticleDocument } from \"modules\"\nimport { truncate } from \"utilities\"\n\n/* ----------------------------------------------------------------------------\n * Data\n * ------------------------------------------------------------------------- */\n\n/**\n * CSS classes\n */\nconst css = {\n link: \"md-search-result__link\",\n article: \"md-search-result__article md-search-result__article--document\",\n title: \"md-search-result__title\",\n teaser: \"md-search-result__teaser\"\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Render an article document\n *\n * @param article - Article document\n *\n * @return HTML element\n */\nexport function renderArticleDocument(\n { location, title, text }: ArticleDocument\n): HTMLElement {\n return toHTMLElement(\n \n
    \n

    {title}

    \n {text.length\n ?

    {truncate(text, 320)}

    \n : undefined\n }\n
    \n     \n )\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { h, toHTMLElement } from \"extensions\"\nimport { SectionDocument } from \"modules\"\nimport { truncate } from \"utilities\"\n\n/* ----------------------------------------------------------------------------\n * Data\n * ------------------------------------------------------------------------- */\n\n/**\n * CSS classes\n */\nconst css = {\n link: \"md-search-result__link\",\n article: \"md-search-result__article\",\n title: \"md-search-result__title\",\n teaser: \"md-search-result__teaser\"\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Render a section document\n *\n * @param section - Section document\n *\n * @return HTML element\n */\nexport function renderSectionDocument(\n { location, title, text }: SectionDocument\n): HTMLElement {\n return toHTMLElement(\n \n
    \n

    {title}

    \n {text.length\n ?

    {truncate(text, 320)}

    \n : undefined\n }\n
    \n     \n )\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { h, toHTMLElement } from \"extensions\"\nimport { SearchResult } from \"modules\"\n\nimport { renderArticleDocument } from \"../article\"\nimport { renderSectionDocument } from \"../section\"\n\n/* ----------------------------------------------------------------------------\n * Data\n * ------------------------------------------------------------------------- */\n\n/**\n * CSS classes\n */\nconst css = {\n item: \"md-search-result__item\"\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Render a search result\n *\n * @param result - Search result\n *\n * @return HTML element\n */\nexport function renderSearchResult(\n { article, sections }: SearchResult\n): HTMLElement {\n return toHTMLElement(\n
  • \n {renderArticleDocument(article)}\n {...sections.map(renderSectionDocument)}\n
    • \n )\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { h, toHTMLElement } from \"extensions\"\n\n/* ----------------------------------------------------------------------------\n * Data\n * ------------------------------------------------------------------------- */\n\n/**\n * CSS classes\n */\nconst css = {\n facts: \"md-source__facts\",\n fact: \"md-source__fact\"\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Render source facts\n *\n * @param facts - Source facts\n *\n * @return HTML element\n */\nexport function renderSource(\n facts: any // TODO: add typings\n): HTMLElement {\n return toHTMLElement(\n
      \n {facts.map((fact: any) =>
    • {fact}
      • )}\n
    \n )\n}\n","/** PURE_IMPORTS_START tslib,_OuterSubscriber,_util_subscribeToResult PURE_IMPORTS_END */\nimport * as tslib_1 from \"tslib\";\nimport { OuterSubscriber } from '../OuterSubscriber';\nimport { subscribeToResult } from '../util/subscribeToResult';\nexport function withLatestFrom() {\n var args = [];\n for (var _i = 0; _i < arguments.length; _i++) {\n args[_i] = arguments[_i];\n }\n return function (source) {\n var project;\n if (typeof args[args.length - 1] === 'function') {\n project = args.pop();\n }\n var observables = args;\n return source.lift(new WithLatestFromOperator(observables, project));\n };\n}\nvar WithLatestFromOperator = /*@__PURE__*/ (function () {\n function WithLatestFromOperator(observables, project) {\n this.observables = observables;\n this.project = project;\n }\n WithLatestFromOperator.prototype.call = function (subscriber, source) {\n return source.subscribe(new WithLatestFromSubscriber(subscriber, this.observables, this.project));\n };\n return WithLatestFromOperator;\n}());\nvar WithLatestFromSubscriber = /*@__PURE__*/ (function (_super) {\n tslib_1.__extends(WithLatestFromSubscriber, _super);\n function WithLatestFromSubscriber(destination, observables, project) {\n var _this = _super.call(this, destination) || this;\n _this.observables = observables;\n _this.project = project;\n _this.toRespond = [];\n var len = observables.length;\n _this.values = new Array(len);\n for (var i = 0; i < len; i++) {\n _this.toRespond.push(i);\n }\n for (var i = 0; i < len; i++) {\n var observable = observables[i];\n _this.add(subscribeToResult(_this, observable, observable, i));\n }\n return _this;\n }\n WithLatestFromSubscriber.prototype.notifyNext = function (outerValue, innerValue, outerIndex, innerIndex, innerSub) {\n this.values[outerIndex] = innerValue;\n var toRespond = this.toRespond;\n if (toRespond.length > 0) {\n var found = toRespond.indexOf(outerIndex);\n if (found !== -1) {\n toRespond.splice(found, 1);\n }\n }\n };\n WithLatestFromSubscriber.prototype.notifyComplete = function () {\n };\n WithLatestFromSubscriber.prototype._next = function (value) {\n if (this.toRespond.length === 0) {\n var args = [value].concat(this.values);\n if (this.project) {\n this._tryProject(args);\n }\n else {\n this.destination.next(args);\n }\n }\n };\n WithLatestFromSubscriber.prototype._tryProject = function (args) {\n var result;\n try {\n result = this.project.apply(this, args);\n }\n catch (err) {\n this.destination.error(err);\n return;\n }\n this.destination.next(result);\n };\n return WithLatestFromSubscriber;\n}(OuterSubscriber));\n//# sourceMappingURL=withLatestFrom.js.map\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { MonoTypeOperatorFunction, Observable, pipe } from \"rxjs\"\nimport { map, withLatestFrom } from \"rxjs/operators\"\n\nimport {\n resetSearchResultMeta,\n setSearchResultMeta\n} from \"actions\"\nimport { SearchResult } from \"modules\"\nimport { getElement } from \"utilities\"\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * Options\n */\ninterface Options {\n query$: Observable /* Search query observable */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Paint search result metadata from source observable\n *\n * @param el - Search result metadata element\n * @param options - Options\n *\n * @return Operator function\n */\nexport function paintSearchResultMeta(\n el: HTMLElement, { query$ }: Options\n): MonoTypeOperatorFunction {\n const meta = getElement(\".md-search-result__meta\", el)!\n return pipe(\n withLatestFrom(query$),\n map(([result, query]) => {\n if (query) {\n setSearchResultMeta(meta, result.length)\n } else {\n resetSearchResultMeta(meta)\n }\n return result\n })\n )\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { identity } from \"ramda\"\nimport { Observable, OperatorFunction, pipe } from \"rxjs\"\nimport {\n distinctUntilChanged,\n filter,\n map,\n shareReplay,\n switchMap\n} from \"rxjs/operators\"\n\nimport { SearchResult } from \"modules\"\nimport { Agent, watchElementOffset } from \"utilities\"\n\nimport { paintSearchResultList } from \"../list\"\nimport { paintSearchResultMeta } from \"../meta\"\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * Options\n */\ninterface Options {\n result$: Observable /* Search result observable */\n query$: Observable /* Search query observable */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch search result\n *\n * @param el - Search result element\n * @param agent - Agent\n * @param options - Options\n *\n * @return Search result state observable\n */\nexport function watchSearchResult(\n el: HTMLElement, agent: Agent, { result$, query$ }: Options\n): Observable {\n const container = el.parentElement!\n\n /* Compute whether there are more search results elements */\n const render$ = watchElementOffset(container, agent)\n .pipe(\n map(({ y }) => y >= container.scrollHeight - container.offsetHeight - 16),\n distinctUntilChanged(),\n filter(identity)\n )\n\n /* Paint search results */\n return result$\n .pipe(\n paintSearchResultMeta(el, { query$ }),\n paintSearchResultList(el, { render$ })\n )\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Mount search result from source observable\n *\n * @param agent - Agent\n * @param options - Options\n *\n * @return Operator function\n */\nexport function mountSearchResult(\n agent: Agent, options: Options\n): OperatorFunction {\n return pipe(\n switchMap(el => watchSearchResult(el, agent, options)),\n shareReplay(1)\n )\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport {\n MonoTypeOperatorFunction,\n Observable,\n animationFrameScheduler,\n pipe\n} from \"rxjs\"\nimport {\n finalize,\n mapTo,\n observeOn,\n scan,\n switchMap\n} from \"rxjs/operators\"\n\nimport {\n addToSearchResultList,\n resetSearchResultList\n} from \"actions\"\nimport { SearchResult } from \"modules\"\nimport { renderSearchResult } from \"templates\"\nimport { getElement } from \"utilities\"\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * Options\n */\ninterface Options {\n render$: Observable /* Render trigger observable */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Paint search result list from source observable\n *\n * @param el - Search result element\n * @param options - Options\n *\n * @return Operator function\n */\nexport function paintSearchResultList(\n el: HTMLElement, { render$ }: Options\n): MonoTypeOperatorFunction {\n const container = el.parentElement!\n const list = getElement(\".md-search-result__list\", el)!\n return pipe(\n switchMap(result => render$\n .pipe(\n\n /* Defer repaint to next animation frame */\n observeOn(animationFrameScheduler),\n scan(index => {\n while (index < result.length) {\n addToSearchResultList(list, renderSearchResult(result[index++]))\n if (container.scrollHeight - container.offsetHeight > 16)\n break\n }\n return index\n }, 0),\n\n /* Re-map to search result */\n mapTo(result),\n\n /* Reset on complete or error */\n finalize(() => {\n resetSearchResultList(list)\n })\n )\n )\n )\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { Observable, OperatorFunction, pipe } from \"rxjs\"\nimport { map, shareReplay } from \"rxjs/operators\"\n\nimport { switchMapIf } from \"extensions\"\nimport { Agent, paintHidden } from \"utilities\"\n\nimport { HeaderState, watchViewportOffsetFromTopOf } from \"../header\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Tabs state\n */\nexport interface TabsState {\n hidden: boolean /* Whether the tabs are hidden */\n}\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * Options\n */\ninterface Options {\n header$: Observable /* Header state observable */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch tabs\n *\n * This function returns an observable that computes the visual parameters of\n * the tabs, currently only denoting whether the tabs are hidden or not.\n *\n * @param el - Tabs element\n * @param agent - Agent\n * @param options - Options\n *\n * @return Tabs state\n */\nexport function watchTabs(\n el: HTMLElement, agent: Agent, { header$ }: Options\n): Observable {\n\n /* Watch and paint visibility */\n const hidden$ = watchViewportOffsetFromTopOf(el, agent, { header$ })\n .pipe(\n paintHidden(el, 8)\n )\n\n /* Combine into a single hot observable */\n return hidden$\n .pipe(\n map(hidden => ({ hidden }))\n )\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Mount tabs from source observable\n *\n * @param agent - Agent\n * @param options - Options\n *\n * @return Operator function\n */\nexport function mountTabs(\n agent: Agent, options: Options\n): OperatorFunction {\n const { media } = agent\n return pipe(\n switchMapIf(media.screen$, el => watchTabs(el, agent, options)),\n shareReplay(1)\n )\n}\n","import _curry1 from './internal/_curry1.js';\nimport _isString from './internal/_isString.js';\n\n/**\n * Returns a new list or string with the elements or characters in reverse\n * order.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category List\n * @sig [a] -> [a]\n * @sig String -> String\n * @param {Array|String} list\n * @return {Array|String}\n * @example\n *\n * R.reverse([1, 2, 3]); //=> [3, 2, 1]\n * R.reverse([1, 2]); //=> [2, 1]\n * R.reverse([1]); //=> [1]\n * R.reverse([]); //=> []\n *\n * R.reverse('abc'); //=> 'cba'\n * R.reverse('ab'); //=> 'ba'\n * R.reverse('a'); //=> 'a'\n * R.reverse(''); //=> ''\n */\nvar reverse = /*#__PURE__*/_curry1(function reverse(list) {\n return _isString(list) ? list.split('').reverse().join('') : Array.prototype.slice.call(list, 0).reverse();\n});\nexport default reverse;","export default function _isString(x) {\n return Object.prototype.toString.call(x) === '[object String]';\n}","import _indexOf from './_indexOf.js';\n\nexport default function _includes(a, list) {\n return _indexOf(list, a, 0) >= 0;\n}","import equals from '../equals.js';\n\nexport default function _indexOf(list, a, idx) {\n var inf, item;\n // Array.prototype.indexOf doesn't exist below IE9\n if (typeof list.indexOf === 'function') {\n switch (typeof a) {\n case 'number':\n if (a === 0) {\n // manually crawl the list to distinguish between +0 and -0\n inf = 1 / a;\n while (idx < list.length) {\n item = list[idx];\n if (item === 0 && 1 / item === inf) {\n return idx;\n }\n idx += 1;\n }\n return -1;\n } else if (a !== a) {\n // NaN\n while (idx < list.length) {\n item = list[idx];\n if (typeof item === 'number' && item !== item) {\n return idx;\n }\n idx += 1;\n }\n return -1;\n }\n // non-zero numbers can utilise Set\n return list.indexOf(a, idx);\n\n // all these types can utilise Set\n case 'string':\n case 'boolean':\n case 'function':\n case 'undefined':\n return list.indexOf(a, idx);\n\n case 'object':\n if (a === null) {\n // null can utilise Set\n return list.indexOf(a, idx);\n }\n }\n }\n // anything else not covered above, defer to R.equals\n while (idx < list.length) {\n if (equals(list[idx], a)) {\n return idx;\n }\n idx += 1;\n }\n return -1;\n}","import _includes from './_includes.js';\n\nvar _Set = /*#__PURE__*/function () {\n function _Set() {\n /* globals Set */\n this._nativeSet = typeof Set === 'function' ? new Set() : null;\n this._items = {};\n }\n\n // until we figure out why jsdoc chokes on this\n // @param item The item to add to the Set\n // @returns {boolean} true if the item did not exist prior, otherwise false\n //\n _Set.prototype.add = function (item) {\n return !hasOrAdd(item, true, this);\n };\n\n //\n // @param item The item to check for existence in the Set\n // @returns {boolean} true if the item exists in the Set, otherwise false\n //\n _Set.prototype.has = function (item) {\n return hasOrAdd(item, false, this);\n };\n\n //\n // Combines the logic for checking whether an item is a member of the set and\n // for adding a new item to the set.\n //\n // @param item The item to check or add to the Set instance.\n // @param shouldAdd If true, the item will be added to the set if it doesn't\n // already exist.\n // @param set The set instance to check or add to.\n // @return {boolean} true if the item already existed, otherwise false.\n //\n return _Set;\n}();\n\nfunction hasOrAdd(item, shouldAdd, set) {\n var type = typeof item;\n var prevSize, newSize;\n switch (type) {\n case 'string':\n case 'number':\n // distinguish between +0 and -0\n if (item === 0 && 1 / item === -Infinity) {\n if (set._items['-0']) {\n return true;\n } else {\n if (shouldAdd) {\n set._items['-0'] = true;\n }\n return false;\n }\n }\n // these types can all utilise the native Set\n if (set._nativeSet !== null) {\n if (shouldAdd) {\n prevSize = set._nativeSet.size;\n set._nativeSet.add(item);\n newSize = set._nativeSet.size;\n return newSize === prevSize;\n } else {\n return set._nativeSet.has(item);\n }\n } else {\n if (!(type in set._items)) {\n if (shouldAdd) {\n set._items[type] = {};\n set._items[type][item] = true;\n }\n return false;\n } else if (item in set._items[type]) {\n return true;\n } else {\n if (shouldAdd) {\n set._items[type][item] = true;\n }\n return false;\n }\n }\n\n case 'boolean':\n // set._items['boolean'] holds a two element array\n // representing [ falseExists, trueExists ]\n if (type in set._items) {\n var bIdx = item ? 1 : 0;\n if (set._items[type][bIdx]) {\n return true;\n } else {\n if (shouldAdd) {\n set._items[type][bIdx] = true;\n }\n return false;\n }\n } else {\n if (shouldAdd) {\n set._items[type] = item ? [false, true] : [true, false];\n }\n return false;\n }\n\n case 'function':\n // compare functions for reference equality\n if (set._nativeSet !== null) {\n if (shouldAdd) {\n prevSize = set._nativeSet.size;\n set._nativeSet.add(item);\n newSize = set._nativeSet.size;\n return newSize === prevSize;\n } else {\n return set._nativeSet.has(item);\n }\n } else {\n if (!(type in set._items)) {\n if (shouldAdd) {\n set._items[type] = [item];\n }\n return false;\n }\n if (!_includes(item, set._items[type])) {\n if (shouldAdd) {\n set._items[type].push(item);\n }\n return false;\n }\n return true;\n }\n\n case 'undefined':\n if (set._items[type]) {\n return true;\n } else {\n if (shouldAdd) {\n set._items[type] = true;\n }\n return false;\n }\n\n case 'object':\n if (item === null) {\n if (!set._items['null']) {\n if (shouldAdd) {\n set._items['null'] = true;\n }\n return false;\n }\n return true;\n }\n /* falls through */\n default:\n // reduce the search size of heterogeneous sets by creating buckets\n // for each type.\n type = Object.prototype.toString.call(item);\n if (!(type in set._items)) {\n if (shouldAdd) {\n set._items[type] = [item];\n }\n return false;\n }\n // scan through all previously applied items\n if (!_includes(item, set._items[type])) {\n if (shouldAdd) {\n set._items[type].push(item);\n }\n return false;\n }\n return true;\n }\n}\n\n// A simple Set type that honours R.equals semantics\nexport default _Set;","import _curry2 from './internal/_curry2.js';\nimport _Set from './internal/_Set.js';\n\n/**\n * Finds the set (i.e. no duplicates) of all elements in the first list not\n * contained in the second list. Objects and Arrays are compared in terms of\n * value equality, not reference equality.\n *\n * @func\n * @memberOf R\n * @since v0.1.0\n * @category Relation\n * @sig [*] -> [*] -> [*]\n * @param {Array} list1 The first list.\n * @param {Array} list2 The second list.\n * @return {Array} The elements in `list1` that are not in `list2`.\n * @see R.differenceWith, R.symmetricDifference, R.symmetricDifferenceWith, R.without\n * @example\n *\n * R.difference([1,2,3,4], [7,6,5,4,3]); //=> [1,2]\n * R.difference([7,6,5,4,3], [1,2,3,4]); //=> [7,6,5]\n * R.difference([{a: 1}, {b: 2}], [{a: 1}, {c: 3}]) //=> [{b: 2}]\n */\nvar difference = /*#__PURE__*/_curry2(function difference(first, second) {\n var out = [];\n var idx = 0;\n var firstLen = first.length;\n var secondLen = second.length;\n var toFilterOut = new _Set();\n\n for (var i = 0; i < secondLen; i += 1) {\n toFilterOut.add(second[i]);\n }\n\n while (idx < firstLen) {\n if (toFilterOut.add(first[idx])) {\n out[out.length] = first[idx];\n }\n idx += 1;\n }\n return out;\n});\nexport default difference;","\n/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Packer message type\n */\nexport const enum PackerMessageType {\n STRING, /* String data */\n BINARY /* Packed data */\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * A message containing an unpacked string\n */\nexport interface PackerStringMessage {\n type: PackerMessageType.STRING /* Message type */\n data: string /* Message data */\n}\n\n/**\n * A message containing a packed string\n */\nexport interface PackerBinaryMessage {\n type: PackerMessageType.BINARY /* Message type */\n data: string /* Message data */\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * A message exchanged with the packer worker\n */\nexport type PackerMessage =\n | PackerStringMessage\n | PackerBinaryMessage\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Type guard for packer binary messages\n *\n * @param message - Packer worker message\n *\n * @return Test result\n */\nexport function isPackerBinaryMessage(\n message: PackerMessage\n): message is PackerBinaryMessage {\n return message.type === PackerMessageType.BINARY\n}\n\n/**\n * Type guard for packer string messages\n *\n * @param message - Packer worker message\n *\n * @return Test result\n */\nexport function isPackerStringMessage(\n message: PackerMessage\n): message is PackerStringMessage {\n return message.type === PackerMessageType.STRING\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A RTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { SearchIndexOptions, SearchResult } from \"modules\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Search message type\n */\nexport const enum SearchMessageType {\n SETUP, /* Search index setup */\n DUMP, /* Search index dump */\n QUERY, /* Search query */\n RESULT /* Search results */\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * A message containing the data necessary to setup the search index\n */\nexport interface SearchSetupMessage {\n type: SearchMessageType.SETUP /* Message type */\n data: SearchIndexOptions /* Message data */\n}\n\n/**\n * A message containing the a dump of the search index\n */\nexport interface SearchDumpMessage {\n type: SearchMessageType.DUMP /* Message type */\n data: string /* Message data */\n}\n\n/**\n * A message containing a search query\n */\nexport interface SearchQueryMessage {\n type: SearchMessageType.QUERY /* Message type */\n data: string /* Message data */\n}\n\n/**\n * A message containing results for a search query\n */\nexport interface SearchResultMessage {\n type: SearchMessageType.RESULT /* Message type */\n data: SearchResult[] /* Message data */\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * A message exchanged with the search worker\n */\nexport type SearchMessage =\n | SearchSetupMessage\n | SearchDumpMessage\n | SearchQueryMessage\n | SearchResultMessage\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Type guard for search setup messages\n *\n * @param message - Search worker message\n *\n * @return Test result\n */\nexport function isSearchSetupMessage(\n message: SearchMessage\n): message is SearchSetupMessage {\n return message.type === SearchMessageType.SETUP\n}\n\n/**\n * Type guard for search dump messages\n *\n * @param message - Search worker message\n *\n * @return Test result\n */\nexport function isSearchDumpMessage(\n message: SearchMessage\n): message is SearchDumpMessage {\n return message.type === SearchMessageType.DUMP\n}\n\n/**\n * Type guard for search query messages\n *\n * @param message - Search worker message\n *\n * @return Test result\n */\nexport function isSearchQueryMessage(\n message: SearchMessage\n): message is SearchQueryMessage {\n return message.type === SearchMessageType.QUERY\n}\n\n/**\n * Type guard for search result messages\n *\n * @param message - Search worker message\n *\n * @return Test result\n */\nexport function isSearchResultMessage(\n message: SearchMessage\n): message is SearchResultMessage {\n return message.type === SearchMessageType.RESULT\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { Observable, OperatorFunction, combineLatest, pipe } from \"rxjs\"\nimport { map, shareReplay } from \"rxjs/operators\"\n\nimport { switchMapIf } from \"extensions\"\nimport { Agent, getElements } from \"utilities\"\n\nimport { HeaderState } from \"../../header\"\nimport {\n MainState,\n SidebarState,\n paintSidebar,\n watchSidebar\n} from \"../../main\"\nimport {\n AnchorList,\n paintAnchorList,\n watchAnchorList\n} from \"../anchor\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Table of contents state\n */\nexport interface TableOfContentsState {\n sidebar: SidebarState /* Sidebar state */\n anchors: AnchorList /* Anchor list */\n}\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * Options\n */\ninterface Options {\n header$: Observable /* Header state observable */\n main$: Observable /* Main area state observable */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch table of contents\n *\n * @param el - Table of contents element\n * @param agent - Agent\n * @param options - Options\n *\n * @return Table of contents state observable\n */\nexport function watchTableOfContents(\n el: HTMLElement, agent: Agent, { header$, main$ }: Options\n): Observable {\n\n /* Watch and paint sidebar */\n const sidebar$ = watchSidebar(el, agent, { main$ })\n .pipe(\n paintSidebar(el)\n )\n\n /* Watch and paint anchor list (scroll spy) */\n const els = getElements(\".md-nav__link\", el)\n const anchors$ = watchAnchorList(els, agent, { header$ })\n .pipe(\n paintAnchorList(els)\n )\n\n /* Combine into a single hot observable */\n return combineLatest([sidebar$, anchors$])\n .pipe(\n map(([sidebar, anchors]) => ({ sidebar, anchors }))\n )\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Mount table of contents from source observable\n *\n * @param agent - Agent\n * @param options - Options\n *\n * @return Operator function\n */\nexport function mountTableOfContents(\n agent: Agent, options: Options\n): OperatorFunction {\n const { media } = agent\n return pipe(\n switchMapIf(media.tablet$, el => watchTableOfContents(el, agent, options)),\n shareReplay(1)\n )\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { difference, reverse } from \"ramda\"\nimport {\n MonoTypeOperatorFunction,\n Observable,\n animationFrameScheduler,\n combineLatest,\n pipe\n} from \"rxjs\"\nimport {\n distinctUntilChanged,\n finalize,\n map,\n observeOn,\n scan,\n shareReplay,\n switchMap,\n tap\n} from \"rxjs/operators\"\n\nimport {\n resetAnchorActive,\n resetAnchorBlur,\n setAnchorActive,\n setAnchorBlur\n} from \"actions\"\nimport { Agent, getElement } from \"utilities\"\n\nimport { HeaderState } from \"../../header\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Anchor list\n */\nexport interface AnchorList {\n prev: HTMLAnchorElement[][] /* Anchors (previous) */\n next: HTMLAnchorElement[][] /* Anchors (next) */\n}\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * Options\n */\ninterface Options {\n header$: Observable /* Header state observable */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch anchor list\n *\n * This is effectively a scroll-spy implementation which will account for the\n * fixed header and automatically re-calculate anchor offsets when the viewport\n * is resized. The returned observable will only emit if the anchor list needs\n * to be repainted.\n *\n * This implementation tracks an anchor element's entire path starting from its\n * level up to the top-most anchor element, e.g. `[h3, h2, h1]`. Although the\n * Material theme currently doesn't make use of this information, it enables\n * the styling of the entire hierarchy through customization.\n *\n * Note that the current anchor is the last item of the `prev` anchor list.\n *\n * @param els - Anchor elements\n * @param agent - Agent\n * @param options - Options\n *\n * @return Anchor list observable\n */\nexport function watchAnchorList(\n els: HTMLAnchorElement[], { viewport }: Agent, { header$ }: Options\n): Observable {\n const table = new Map()\n for (const el of els) {\n const id = decodeURIComponent(el.hash.substring(1))\n const target = getElement(`[id=\"${id}\"]`)\n if (typeof target !== \"undefined\")\n table.set(el, target)\n }\n\n /* Compute necessary adjustment for header */\n const adjust$ = header$\n .pipe(\n map(header => 18 + header.height)\n )\n\n /* Compute partition of previous and next anchors */\n const partition$ = viewport.size$\n .pipe(\n\n /* Build index to map anchor paths to vertical offsets */\n map(() => {\n let path: HTMLAnchorElement[] = []\n return [...table].reduce((index, [anchor, target]) => {\n while (path.length) {\n const last = table.get(path[path.length - 1])!\n if (last.tagName >= target.tagName) {\n path.pop()\n } else {\n break\n }\n }\n return index.set(\n reverse(path = [...path, anchor]),\n target.offsetTop\n )\n }, new Map())\n }),\n\n /* Re-compute partition when viewport offset changes */\n switchMap(index => combineLatest(viewport.offset$, adjust$)\n .pipe(\n scan(([prev, next], [{ y }, adjust]) => {\n\n /* Look forward */\n while (next.length) {\n const [, offset] = next[0]\n if (offset - adjust < y) {\n prev = [...prev, next.shift()!]\n } else {\n break\n }\n }\n\n /* Look backward */\n while (prev.length) {\n const [, offset] = prev[prev.length - 1]\n if (offset - adjust >= y) {\n next = [prev.pop()!, ...next]\n } else {\n break\n }\n }\n\n /* Return partition */\n return [prev, next]\n }, [[], [...index]]),\n distinctUntilChanged((a, b) => {\n return a[0] === b[0]\n && a[1] === b[1]\n })\n )\n )\n )\n\n /* Compute anchor list migrations */\n const migration$ = partition$\n .pipe(\n map(([prev, next]) => ({\n prev: prev.map(([path]) => path),\n next: next.map(([path]) => path)\n })),\n\n /* Extract anchor list migrations */\n scan((a, b) => {\n const begin = Math.max(0, Math.min(b.prev.length, a.prev.length) - 1)\n const end = Math.max(b.prev.length, a.prev.length)\n return {\n prev: b.prev.slice(begin, end + 1),\n next: difference(b.next, a.next)\n }\n }, { prev: [], next: [] })\n )\n\n /* Return anchor list migrations as hot observable */\n return migration$\n .pipe(\n shareReplay(1)\n )\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Paint anchor list from source observable\n *\n * @param els - Anchor elements\n *\n * @return Operator function\n */\nexport function paintAnchorList(\n els: HTMLAnchorElement[]\n): MonoTypeOperatorFunction {\n return pipe(\n\n /* Defer repaint to next animation frame */\n observeOn(animationFrameScheduler),\n tap(({ prev, next }) => {\n\n /* Look forward */\n for (const [el] of next) {\n resetAnchorActive(el)\n resetAnchorBlur(el)\n }\n\n /* Look backward */\n for (const [index, [el]] of prev.entries()) {\n setAnchorActive(el, index === prev.length - 1)\n setAnchorBlur(el, true)\n }\n }),\n\n /* Reset on complete or error */\n finalize(() => {\n for (const el of els) {\n resetAnchorActive(el)\n resetAnchorBlur(el)\n }\n })\n )\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\n// TODO: remove this after we finished refactoring\n// tslint:disable\n\nimport { identity, values } from \"ramda\"\nimport {\n EMPTY,\n Observable,\n Subject,\n forkJoin,\n merge,\n of,\n fromEvent,\n interval,\n NEVER\n} from \"rxjs\"\nimport { ajax } from \"rxjs/ajax\"\nimport {\n delay,\n filter,\n map,\n pluck,\n switchMap,\n switchMapTo,\n take,\n tap,\n} from \"rxjs/operators\"\n\nimport {\n Component,\n paintHeaderShadow,\n mountHero,\n mountMain,\n mountNavigation,\n mountSearchResult,\n mountTableOfContents,\n mountTabs,\n switchComponent,\n watchComponentMap,\n watchHeader,\n watchSearchQuery,\n watchSearchReset\n} from \"./components\"\nimport { SearchIndexOptions } from \"./modules\"\nimport {\n getElement,\n setupAgent,\n watchToggle,\n watchWorker,\n setToggle,\n getElements,\n watchMedia,\n translate\n} from \"./utilities\"\nimport {\n PackerMessage,\n PackerMessageType,\n SearchMessage,\n SearchMessageType,\n SearchSetupMessage,\n isSearchDumpMessage,\n isSearchResultMessage\n} from \"./workers\"\nimport { renderSource } from \"templates\"\nimport { switchMapIf, not } from \"extensions\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Configuration\n */\nexport interface Config {\n base: string /* Base URL */\n worker: {\n search: string /* Search worker URL */\n packer: string /* Packer worker URL */\n }\n}\n\n/* ----------------------------------------------------------------------------\n * TODO: where do we put this stuff?\n * ------------------------------------------------------------------------- */\n\ndocument.documentElement.classList.remove(\"no-js\")\ndocument.documentElement.classList.add(\"js\")\n\nconst names: Component[] = [\n \"container\", /* Container */\n \"header\", /* Header */\n \"header-title\", /* Header title */\n \"hero\", /* Hero */\n \"main\", /* Main area */\n \"navigation\", /* Navigation */\n \"search\", /* Search */\n \"search-query\", /* Search input */\n \"search-reset\", /* Search reset */\n \"search-result\", /* Search results */\n \"tabs\", /* Tabs */\n \"toc\" /* Table of contents */\n]\n\n/* ----------------------------------------------------------------------------\n * Helper functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Ensure that the given value is a valid configuration\n *\n * We could use `jsonschema` or any other schema validation framework, but that\n * would just add more bloat to the bundle, so we'll keep it plain and simple.\n *\n * @param config - Configuration\n *\n * @return Test result\n */\nfunction isConfig(config: any): config is Config {\n return typeof config === \"object\"\n && typeof config.base === \"string\"\n && typeof config.worker === \"object\"\n && typeof config.worker.search === \"string\"\n && typeof config.worker.packer === \"string\"\n}\n\n/**\n *\n * Rogue control characters must be filtered before handing the query to the\n * search index, as lunr will throw otherwise.\n */\nfunction prepare(value: string): string {\n const newvalue = value\n .replace(/(?:^|\\s+)[*+-:^~]+(?=\\s+|$)/g, \"\")\n .trim()\n\n return newvalue ? newvalue.replace(/\\s+|$/g, \"* \") : \"\"\n}\n\nfunction setupWorkers(config: Config) {\n // Remove trailing URL, or search might not work on the 404 page.\n config.base = config.base.replace(/\\/$/, \"\")\n\n const worker = new Worker(config.worker.search)\n const packer = new Worker(config.worker.packer)\n\n const packerMessage$ = new Subject()\n const packer$ = watchWorker(packer, { send$: packerMessage$ })\n\n // send a message, then switchMapTo worker!\n\n packer$.subscribe(message => {\n // console.log(\"PACKER.MSG\", message.data.length)\n // is always packed!\n if (message.type === PackerMessageType.BINARY && message.data[0] !== \"{\")\n localStorage.setItem(\"index\", message.data)\n })\n\n // storing = experimental feature\n\n const searchMessage$ = new Subject()\n\n const search$ = watchWorker(worker, { send$: searchMessage$ })\n\n /* Link search to packer */\n search$\n .pipe(\n filter(isSearchDumpMessage),\n map(message => ({\n type: PackerMessageType.STRING,\n data: message.data\n })),\n tap(message => packerMessage$.next(message)) // send message and wait!\n // switchMapTo(packer$)\n )\n .subscribe()\n\n const data$ = ajax({\n url: `${config.base}/search/search_index.json`,\n responseType: \"json\",\n withCredentials: true\n })\n .pipe(\n pluck(\"response\"),\n // map(res => {\n // // search language... default for theme language...\n // const override = translate(\"search.tokenizer\")\n // // TODO: ???\n // if (override.length)\n // res.config.separator = override\n\n // return res\n // })\n // take(1)\n )\n\n const fromLocal = localStorage.getItem(\"index\")\n\n ;\n (fromLocal ? of({\n type: PackerMessageType.BINARY,\n data: localStorage.getItem(\"index\")!\n }) : EMPTY)\n .subscribe(x => {\n // console.log(\"send message to packer\")\n packerMessage$.next(x)\n })\n\n const index$ = fromLocal ? packer$.pipe(pluck(\"data\"), take(1)) : of(undefined) // of(localStorage.getItem(\"index\"))\n\n // index$.subscribe(xx => console.log(\"INDEX\", xx))\n\n forkJoin([data$, index$])\n .pipe(\n map(([data, index]) => ({\n type: SearchMessageType.SETUP,\n data: { ...data, index }\n }))\n )\n .subscribe(message => {\n searchMessage$.next(message) // TODO: this shall not complete\n })\n\n return [search$, searchMessage$] as const\n}\n\n/**\n * Yes, this is a super hacky implementation. Needs clean up.\n */\nfunction repository() {\n const el = getElement(\"[data-md-source][href]\")\n console.log(el)\n if (!el)\n return EMPTY\n\n const data = sessionStorage.getItem(\"repository\")\n if (data) {\n const x = JSON.parse(data)\n return of(x)\n }\n\n // TODO: do correct rounding, see GitHub\n function format(value: number) {\n return value > 999\n ? `${(value / 1000).toFixed(1)}k`\n : `${(value)}`\n }\n\n // github repository...\n const [, user, repo] = el.href.match(/^.+github\\.com\\/([^\\/]+)\\/?([^\\/]+)?.*$/i)\n\n // Show repo stats\n if (user && repo) {\n return ajax({\n url: `https://api.github.com/repos/${user}/${repo}`,\n responseType: \"json\"\n })\n .pipe(\n map(({ status, response }) => {\n if (status === 200) {\n const { stargazers_count, forks_count } = response\n return [\n `${format(stargazers_count)} Stars`,\n `${format(forks_count)} Forks`\n ]\n }\n return []\n }),\n tap(data => sessionStorage.setItem(\"repository\", JSON.stringify(data)))\n )\n\n // Show user or organization stats\n } else if (user) {\n return ajax({\n url: `https://api.github.com/users/${user}`,\n responseType: \"json\"\n })\n .pipe(\n map(({ status, response }) => {\n if (status === 200) {\n const { public_repos } = response\n return [\n `${format(public_repos)} Repositories`\n ]\n }\n return []\n }),\n tap(data => sessionStorage.setItem(\"repository\", JSON.stringify(data)))\n )\n }\n return of([])\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Initialize Material for MkDocs\n *\n * @param config - Configuration\n */\nexport function initialize(config: unknown) {\n if (!isConfig(config))\n throw new SyntaxError(`Invalid configuration: ${JSON.stringify(config)}`)\n\n // pass config here!?\n const agent = setupAgent() // TODO: add a config parameter here to configure media queries\n\n const [\n searchWorkerRecv$,\n searchMessage$\n ] = setupWorkers(config)\n\n // TODO: WIP repo rendering\n repository().subscribe(facts => {\n if (facts.length) {\n const sources = getElements(\"[data-md-source] .md-source__repository\")\n sources.forEach(repo => {\n repo.dataset.mdState = \"done\"\n repo.appendChild(\n renderSource(facts)\n )\n })\n }\n })\n\n /* ----------------------------------------------------------------------- */\n\n /* Create component map observable */\n const components$ = watchComponentMap(names, { document$: agent.document.load$ })\n const component = (name: Component): Observable => {\n return components$\n .pipe(\n switchComponent(name)\n )\n }\n\n /* Create header observable */\n const header$ = component(\"header\") // TODO:!\n .pipe(\n switchMap(watchHeader)\n )\n\n /* Create header shadow toggle */\n component(\"header\")\n .pipe(\n switchMap(el => main$\n .pipe(\n paintHeaderShadow(el) // technically, this could be done in paintMain\n )\n )\n )\n .subscribe()\n\n // ----------------------------------------------------------------------------\n\n // watchSearchResult // emit, if at bottom...\n // receive results as a second observable!? filter stuff, paint\n\n const result$ = searchWorkerRecv$ // move worker initialization into mountSearch ?\n .pipe(\n // tap(m => console.log(\"message from worker\", m)),\n filter(isSearchResultMessage),\n pluck(\"data\"),\n // Prefix URLs with base URL\n tap(result => result.forEach(item => {\n item.article.location = `${config.base}/${item.article.location}`\n item.sections.forEach(section => {\n section.location = `${config.base}/${section.location}`\n })\n }))\n )\n\n // handleSearchResult <-- operator\n\n const query$ = component(\"search-query\")\n .pipe(\n switchMap(el => watchSearchQuery(el, { prepare }))\n )\n\n query$\n .pipe(\n map(query => ({ // put this into some function...\n type: SearchMessageType.QUERY,\n data: query.value\n })), // TODO. ugly...\n // distinctUntilKeyChanged(\"data\")\n )\n .subscribe(searchMessage$)\n\n // create the message subject internally... and link it to the worker...?\n // watchSearchWorker(worker, agent, { query$ }) // message internally...\n\n query$\n .pipe(\n tap(query => {\n if (query.focus)\n setToggle(search, true)\n })\n )\n .subscribe()\n\n /* ----------------------------------------------------------------------- */\n\n const main$ = component(\"main\")\n .pipe(\n mountMain(agent, { header$ })\n )\n\n const navigation$ = component(\"navigation\")\n .pipe(\n mountNavigation(agent, { main$ })\n )\n\n const toc$ = component(\"toc\")\n .pipe(\n mountTableOfContents(agent, { header$, main$ })\n )\n\n // TODO: naming?\n const resultComponent$ = component(\"search-result\")\n .pipe(\n mountSearchResult(agent, { result$, query$: query$.pipe(pluck(\"value\")) })\n ) // temporary fix\n\n const tabs$ = component(\"tabs\")\n .pipe(\n mountTabs(agent, { header$ })\n )\n\n const hero$ = component(\"hero\")\n .pipe(\n mountHero(agent, { header$ })\n )\n\n\n /* ----------------------------------------------------------------------- */\n\n const drawer = getElement(\"[data-md-toggle=drawer]\")!\n const search = getElement(\"[data-md-toggle=search]\")!\n\n const a$ = watchToggle(search)\n .pipe(\n delay(400)\n )\n\n const reset$ = component(\"search-reset\")\n .pipe(\n switchMap(watchSearchReset)\n )\n\n /* Listener: focus query if search is open and character is typed */\n // TODO: combine with watchElementFocus\n const keysIfSearchActive$ = a$\n .pipe(\n switchMap(x => x === true ? fromEvent(window, \"keydown\") : NEVER),\n )\n\n // focus search on reset, on toggle and on keypress if open\n merge(a$.pipe(filter(identity)), reset$, keysIfSearchActive$)\n .pipe(\n switchMapTo(component(\"search-query\")),\n tap(el => el.focus()) // TODO: only if element isnt focused! setFocus? setToggle?\n )\n .subscribe()\n\n /* ----------------------------------------------------------------------- */\n\n /* Open details before printing */\n merge(\n watchMedia(\"print\").pipe(filter(identity)), // Webkit\n fromEvent(window, \"beforeprint\") // IE, FF\n )\n .subscribe(() => {\n const details = document.querySelectorAll(\"details\")\n Array.prototype.forEach.call(details, detail => {\n detail.setAttribute(\"open\", \"\")\n })\n })\n\n /* ----------------------------------------------------------------------- */\n\n const state = {\n search: {\n query$,\n result$: resultComponent$,\n reset$,\n },\n main$,\n navigation$,\n toc$,\n tabs$,\n hero$\n }\n\n const { search: temp, ...rest } = state\n merge(...values(rest), ...values(temp))\n .subscribe() // potential memleak <-- use takeUntil\n\n return {\n agent,\n state\n }\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { Observable, Subject } from \"rxjs\"\n\nimport {\n ViewportOffset,\n ViewportSize,\n watchDocument,\n watchLocation,\n watchLocationHash,\n watchMedia,\n watchViewportOffset,\n watchViewportSize\n} from \"utilities\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Agent document\n */\nexport interface AgentDocument {\n load$: Observable /* Document observable */\n}\n\n/**\n * Agent location\n */\nexport interface AgentLocation {\n href$: Subject /* Location subject */\n hash$: Observable /* Location hash observable */\n}\n\n/**\n * Agent media\n */\nexport interface AgentMedia {\n screen$: Observable /* Media observable for screen */\n tablet$: Observable /* Media observable for tablet */\n}\n\n/**\n * Agent viewport\n */\nexport interface AgentViewport {\n offset$: Observable /* Viewport offset observable */\n size$: Observable /* Viewport size observable */\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Agent\n */\nexport interface Agent {\n document: AgentDocument /* Document observables */\n location: AgentLocation /* Location observables */\n media: AgentMedia /* Media observables */\n viewport: AgentViewport /* Viewport observables */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Create the agent\n *\n * This function returns a data structure that contains all observables that\n * are related to the browser and/or environment.\n *\n * @return Agent\n */\nexport function setupAgent(): Agent {\n return {\n document: {\n load$: watchDocument()\n },\n location: {\n href$: watchLocation(),\n hash$: watchLocationHash()\n },\n media: {\n screen$: watchMedia(\"(min-width: 1220px)\"),\n tablet$: watchMedia(\"(min-width: 960px)\")\n },\n viewport: {\n offset$: watchViewportOffset(),\n size$: watchViewportSize()\n }\n }\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { keys } from \"ramda\"\nimport { NEVER, Observable, OperatorFunction, of, pipe } from \"rxjs\"\nimport { map, scan, shareReplay, switchMap } from \"rxjs/operators\"\n\nimport { getElement } from \"utilities\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Component names\n */\nexport type Component =\n | \"container\" /* Container */\n | \"header\" /* Header */\n | \"header-title\" /* Header title */\n | \"hero\" /* Hero */\n | \"main\" /* Main area */\n | \"navigation\" /* Navigation */\n | \"search\" /* Search */\n | \"search-query\" /* Search input */\n | \"search-reset\" /* Search reset */\n | \"search-result\" /* Search results */\n | \"tabs\" /* Tabs */\n | \"toc\" /* Table of contents */\n\n/**\n * Component map\n */\nexport type ComponentMap = {\n [P in Component]?: HTMLElement\n}\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * Options\n */\ninterface Options {\n document$: Observable /* Document observable */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch component mapping\n *\n * This function returns an observable that will maintain bindings to the given\n * components in-between document switches and update the document in-place.\n *\n * @param names - Component names\n * @param options - Options\n *\n * @return Component mapping observable\n */\nexport function watchComponentMap(\n names: Component[], { document$ }: Options\n): Observable {\n const components$ = document$\n .pipe(\n\n /* Build component map */\n map(document => names.reduce((components, name) => {\n const el = getElement(`[data-md-component=${name}]`, document)\n return {\n ...components,\n ...typeof el !== \"undefined\" ? { [name]: el } : {}\n }\n }, {})),\n\n /* Re-compute component map on document switch */\n scan((prev, next) => {\n for (const name of keys(prev)) {\n switch (name) {\n\n /* Top-level components: update */\n case \"header-title\":\n case \"container\":\n if (name in prev && typeof prev[name] !== \"undefined\") {\n prev[name]!.replaceWith(next[name]!)\n prev[name] = next[name]\n }\n break\n\n /* All other components: rebind */\n default:\n prev[name] = getElement(`[data-md-component=${name}]`)\n }\n }\n return prev\n })\n )\n\n /* Return component map as hot observable */\n return components$\n .pipe(\n shareReplay(1)\n )\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Switch to component\n *\n * @template T - Element type\n *\n * @param name - Component name\n *\n * @return Operator function\n */\nexport function switchComponent(\n name: Component\n): OperatorFunction {\n return pipe(\n switchMap(components => {\n return typeof components[name] !== \"undefined\"\n ? of(components[name] as T)\n : NEVER\n })\n )\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { Observable, fromEvent } from \"rxjs\"\nimport { map } from \"rxjs/operators\"\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Set toggle\n *\n * Simulating a click event seems to be the most cross-browser compatible way\n * of changing the value while also emitting a `change` event. Before, Material\n * used `CustomEvent` to programatically change the value of a toggle, but this\n * is a much simpler and cleaner solution.\n *\n * @param el - Toggle element\n * @param value - Toggle value\n */\nexport function setToggle(\n el: HTMLInputElement, value: boolean\n): void {\n if (el.checked !== value)\n el.click()\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Watch toggle\n *\n * @param el - Toggle element\n *\n * @return Toggle observable\n */\nexport function watchToggle(\n el: HTMLInputElement\n): Observable {\n return fromEvent(el, \"change\")\n .pipe(\n map(() => el.checked)\n )\n}\n"],"sourceRoot":""} \ No newline at end of file diff --git a/material/assets/javascripts/worker/search.js b/material/assets/javascripts/worker/search.js index b0f780310..9ff7cc32d 100644 --- a/material/assets/javascripts/worker/search.js +++ b/material/assets/javascripts/worker/search.js @@ -10,7 +10,7 @@ * lunr - http://lunrjs.com - A bit like Solr, but much smaller and not as bright - 2.3.8 * Copyright (C) 2019 Oliver Nightingale * @license MIT - */!function(){var s,o,a,u,l,c,h,d,f,p,y,m,g,v,x,w,b,S,Q,E,k,P,L,T,O,I,R=function(e){var t=new R.Builder;return t.pipeline.add(R.trimmer,R.stopWordFilter,R.stemmer),t.searchPipeline.add(R.stemmer),e.call(t,t),t.build()};R.version="2.3.8" + */!function(){var s,o,a,u,l,c,h,d,f,p,y,m,g,v,x,w,b,S,Q,E,k,L,P,T,O,I,R=function(e){var t=new R.Builder;return t.pipeline.add(R.trimmer,R.stopWordFilter,R.stemmer),t.searchPipeline.add(R.stemmer),e.call(t,t),t.build()};R.version="2.3.8" /*! * lunr.utils * Copyright (C) 2019 Oliver Nightingale @@ -35,7 +35,7 @@ * lunr.stemmer * Copyright (C) 2019 Oliver Nightingale * Includes code from - http://tartarus.org/~martin/PorterStemmer/js.txt - */,R.stemmer=(o={ational:"ate",tional:"tion",enci:"ence",anci:"ance",izer:"ize",bli:"ble",alli:"al",entli:"ent",eli:"e",ousli:"ous",ization:"ize",ation:"ate",ator:"ate",alism:"al",iveness:"ive",fulness:"ful",ousness:"ous",aliti:"al",iviti:"ive",biliti:"ble",logi:"log"},a={icate:"ic",ative:"",alize:"al",iciti:"ic",ical:"ic",ful:"",ness:""},u="[aeiouy]",l="[^aeiou][^aeiouy]*",c=new RegExp("^([^aeiou][^aeiouy]*)?[aeiouy][aeiou]*[^aeiou][^aeiouy]*"),h=new RegExp("^([^aeiou][^aeiouy]*)?[aeiouy][aeiou]*[^aeiou][^aeiouy]*[aeiouy][aeiou]*[^aeiou][^aeiouy]*"),d=new RegExp("^([^aeiou][^aeiouy]*)?[aeiouy][aeiou]*[^aeiou][^aeiouy]*([aeiouy][aeiou]*)?$"),f=new RegExp("^([^aeiou][^aeiouy]*)?[aeiouy]"),p=/^(.+?)(ss|i)es$/,y=/^(.+?)([^s])s$/,m=/^(.+?)eed$/,g=/^(.+?)(ed|ing)$/,v=/.$/,x=/(at|bl|iz)$/,w=new RegExp("([^aeiouylsz])\\1$"),b=new RegExp("^"+l+u+"[^aeiouwxy]$"),S=/^(.+?[^aeiou])y$/,Q=/^(.+?)(ational|tional|enci|anci|izer|bli|alli|entli|eli|ousli|ization|ation|ator|alism|iveness|fulness|ousness|aliti|iviti|biliti|logi)$/,E=/^(.+?)(icate|ative|alize|iciti|ical|ful|ness)$/,k=/^(.+?)(al|ance|ence|er|ic|able|ible|ant|ement|ment|ent|ou|ism|ate|iti|ous|ive|ize)$/,P=/^(.+?)(s|t)(ion)$/,L=/^(.+?)e$/,T=/ll$/,O=new RegExp("^"+l+u+"[^aeiouwxy]$"),I=function(e){var t,r,n,i,s,u,l;if(e.length<3)return e;if("y"==(n=e.substr(0,1))&&(e=n.toUpperCase()+e.substr(1)),s=y,(i=p).test(e)?e=e.replace(i,"$1$2"):s.test(e)&&(e=e.replace(s,"$1$2")),s=g,(i=m).test(e)){var I=i.exec(e);(i=c).test(I[1])&&(i=v,e=e.replace(i,""))}else s.test(e)&&(t=(I=s.exec(e))[1],(s=f).test(t)&&(u=w,l=b,(s=x).test(e=t)?e+="e":u.test(e)?(i=v,e=e.replace(i,"")):l.test(e)&&(e+="e")));return(i=S).test(e)&&(e=(t=(I=i.exec(e))[1])+"i"),(i=Q).test(e)&&(t=(I=i.exec(e))[1],r=I[2],(i=c).test(t)&&(e=t+o[r])),(i=E).test(e)&&(t=(I=i.exec(e))[1],r=I[2],(i=c).test(t)&&(e=t+a[r])),s=P,(i=k).test(e)?(t=(I=i.exec(e))[1],(i=h).test(t)&&(e=t)):s.test(e)&&(t=(I=s.exec(e))[1]+I[2],(s=h).test(t)&&(e=t)),(i=L).test(e)&&(t=(I=i.exec(e))[1],s=d,u=O,((i=h).test(t)||s.test(t)&&!u.test(t))&&(e=t)),s=h,(i=T).test(e)&&s.test(e)&&(i=v,e=e.replace(i,"")),"y"==n&&(e=n.toLowerCase()+e.substr(1)),e},function(e){return e.update(I)}),R.Pipeline.registerFunction(R.stemmer,"stemmer") + */,R.stemmer=(o={ational:"ate",tional:"tion",enci:"ence",anci:"ance",izer:"ize",bli:"ble",alli:"al",entli:"ent",eli:"e",ousli:"ous",ization:"ize",ation:"ate",ator:"ate",alism:"al",iveness:"ive",fulness:"ful",ousness:"ous",aliti:"al",iviti:"ive",biliti:"ble",logi:"log"},a={icate:"ic",ative:"",alize:"al",iciti:"ic",ical:"ic",ful:"",ness:""},u="[aeiouy]",l="[^aeiou][^aeiouy]*",c=new RegExp("^([^aeiou][^aeiouy]*)?[aeiouy][aeiou]*[^aeiou][^aeiouy]*"),h=new RegExp("^([^aeiou][^aeiouy]*)?[aeiouy][aeiou]*[^aeiou][^aeiouy]*[aeiouy][aeiou]*[^aeiou][^aeiouy]*"),d=new RegExp("^([^aeiou][^aeiouy]*)?[aeiouy][aeiou]*[^aeiou][^aeiouy]*([aeiouy][aeiou]*)?$"),f=new RegExp("^([^aeiou][^aeiouy]*)?[aeiouy]"),p=/^(.+?)(ss|i)es$/,y=/^(.+?)([^s])s$/,m=/^(.+?)eed$/,g=/^(.+?)(ed|ing)$/,v=/.$/,x=/(at|bl|iz)$/,w=new RegExp("([^aeiouylsz])\\1$"),b=new RegExp("^"+l+u+"[^aeiouwxy]$"),S=/^(.+?[^aeiou])y$/,Q=/^(.+?)(ational|tional|enci|anci|izer|bli|alli|entli|eli|ousli|ization|ation|ator|alism|iveness|fulness|ousness|aliti|iviti|biliti|logi)$/,E=/^(.+?)(icate|ative|alize|iciti|ical|ful|ness)$/,k=/^(.+?)(al|ance|ence|er|ic|able|ible|ant|ement|ment|ent|ou|ism|ate|iti|ous|ive|ize)$/,L=/^(.+?)(s|t)(ion)$/,P=/^(.+?)e$/,T=/ll$/,O=new RegExp("^"+l+u+"[^aeiouwxy]$"),I=function(e){var t,r,n,i,s,u,l;if(e.length<3)return e;if("y"==(n=e.substr(0,1))&&(e=n.toUpperCase()+e.substr(1)),s=y,(i=p).test(e)?e=e.replace(i,"$1$2"):s.test(e)&&(e=e.replace(s,"$1$2")),s=g,(i=m).test(e)){var I=i.exec(e);(i=c).test(I[1])&&(i=v,e=e.replace(i,""))}else s.test(e)&&(t=(I=s.exec(e))[1],(s=f).test(t)&&(u=w,l=b,(s=x).test(e=t)?e+="e":u.test(e)?(i=v,e=e.replace(i,"")):l.test(e)&&(e+="e")));return(i=S).test(e)&&(e=(t=(I=i.exec(e))[1])+"i"),(i=Q).test(e)&&(t=(I=i.exec(e))[1],r=I[2],(i=c).test(t)&&(e=t+o[r])),(i=E).test(e)&&(t=(I=i.exec(e))[1],r=I[2],(i=c).test(t)&&(e=t+a[r])),s=L,(i=k).test(e)?(t=(I=i.exec(e))[1],(i=h).test(t)&&(e=t)):s.test(e)&&(t=(I=s.exec(e))[1]+I[2],(s=h).test(t)&&(e=t)),(i=P).test(e)&&(t=(I=i.exec(e))[1],s=d,u=O,((i=h).test(t)||s.test(t)&&!u.test(t))&&(e=t)),s=h,(i=T).test(e)&&s.test(e)&&(i=v,e=e.replace(i,"")),"y"==n&&(e=n.toLowerCase()+e.substr(1)),e},function(e){return e.update(I)}),R.Pipeline.registerFunction(R.stemmer,"stemmer") /*! * lunr.stopWordFilter * Copyright (C) 2019 Oliver Nightingale @@ -51,9 +51,9 @@ /*! * lunr.Index * Copyright (C) 2019 Oliver Nightingale - */,R.Index=function(e){this.invertedIndex=e.invertedIndex,this.fieldVectors=e.fieldVectors,this.tokenSet=e.tokenSet,this.fields=e.fields,this.pipeline=e.pipeline},R.Index.prototype.search=function(e){return this.query((function(t){new R.QueryParser(e,t).parse()}))},R.Index.prototype.query=function(e){for(var t=new R.Query(this.fields),r=Object.create(null),n=Object.create(null),i=Object.create(null),s=Object.create(null),o=Object.create(null),a=0;a1?1:e},R.Builder.prototype.k1=function(e){this._k1=e},R.Builder.prototype.add=function(e,t){var r=e[this._ref],n=Object.keys(this._fields);this._documents[r]=t||{},this.documentCount+=1;for(var i=0;i=this.length)return R.QueryLexer.EOS;var e=this.str.charAt(this.pos);return this.pos+=1,e},R.QueryLexer.prototype.width=function(){return this.pos-this.start},R.QueryLexer.prototype.ignore=function(){this.start==this.pos&&(this.pos+=1),this.start=this.pos},R.QueryLexer.prototype.backup=function(){this.pos-=1},R.QueryLexer.prototype.acceptDigitRun=function(){var e,t;do{t=(e=this.next()).charCodeAt(0)}while(t>47&&t<58);e!=R.QueryLexer.EOS&&this.backup()},R.QueryLexer.prototype.more=function(){return this.pos1&&(e.backup(),e.emit(R.QueryLexer.TERM)),e.ignore(),e.more())return R.QueryLexer.lexText},R.QueryLexer.lexEditDistance=function(e){return e.ignore(),e.acceptDigitRun(),e.emit(R.QueryLexer.EDIT_DISTANCE),R.QueryLexer.lexText},R.QueryLexer.lexBoost=function(e){return e.ignore(),e.acceptDigitRun(),e.emit(R.QueryLexer.BOOST),R.QueryLexer.lexText},R.QueryLexer.lexEOS=function(e){e.width()>0&&e.emit(R.QueryLexer.TERM)},R.QueryLexer.termSeparator=R.tokenizer.separator,R.QueryLexer.lexText=function(e){for(;;){var t=e.next();if(t==R.QueryLexer.EOS)return R.QueryLexer.lexEOS;if(92!=t.charCodeAt(0)){if(":"==t)return R.QueryLexer.lexField;if("~"==t)return e.backup(),e.width()>0&&e.emit(R.QueryLexer.TERM),R.QueryLexer.lexEditDistance;if("^"==t)return e.backup(),e.width()>0&&e.emit(R.QueryLexer.TERM),R.QueryLexer.lexBoost;if("+"==t&&1===e.width())return e.emit(R.QueryLexer.PRESENCE),R.QueryLexer.lexText;if("-"==t&&1===e.width())return e.emit(R.QueryLexer.PRESENCE),R.QueryLexer.lexText;if(t.match(R.QueryLexer.termSeparator))return R.QueryLexer.lexTerm}else e.escapeCharacter()}},R.QueryParser=function(e,t){this.lexer=new R.QueryLexer(e),this.query=t,this.currentClause={},this.lexemeIdx=0},R.QueryParser.prototype.parse=function(){this.lexer.run(),this.lexemes=this.lexer.lexemes;for(var e=R.QueryParser.parseClause;e;)e=e(this);return this.query},R.QueryParser.prototype.peekLexeme=function(){return this.lexemes[this.lexemeIdx]},R.QueryParser.prototype.consumeLexeme=function(){var e=this.peekLexeme();return this.lexemeIdx+=1,e},R.QueryParser.prototype.nextClause=function(){var e=this.currentClause;this.query.clause(e),this.currentClause={}},R.QueryParser.parseClause=function(e){var t=e.peekLexeme();if(null!=t)switch(t.type){case R.QueryLexer.PRESENCE:return R.QueryParser.parsePresence;case R.QueryLexer.FIELD:return R.QueryParser.parseField;case R.QueryLexer.TERM:return R.QueryParser.parseTerm;default:var r="expected either a field or a term, found "+t.type;throw t.str.length>=1&&(r+=" with value '"+t.str+"'"),new R.QueryParseError(r,t.start,t.end)}},R.QueryParser.parsePresence=function(e){var t=e.consumeLexeme();if(null!=t){switch(t.str){case"-":e.currentClause.presence=R.Query.presence.PROHIBITED;break;case"+":e.currentClause.presence=R.Query.presence.REQUIRED;break;default:var r="unrecognised presence operator'"+t.str+"'";throw new R.QueryParseError(r,t.start,t.end)}var n=e.peekLexeme();if(null==n){r="expecting term or field, found nothing";throw new R.QueryParseError(r,t.start,t.end)}switch(n.type){case R.QueryLexer.FIELD:return R.QueryParser.parseField;case R.QueryLexer.TERM:return R.QueryParser.parseTerm;default:r="expecting term or field, found '"+n.type+"'";throw new R.QueryParseError(r,n.start,n.end)}}},R.QueryParser.parseField=function(e){var t=e.consumeLexeme();if(null!=t){if(-1==e.query.allFields.indexOf(t.str)){var r=e.query.allFields.map((function(e){return"'"+e+"'"})).join(", "),n="unrecognised field '"+t.str+"', possible fields: "+r;throw new R.QueryParseError(n,t.start,t.end)}e.currentClause.fields=[t.str];var i=e.peekLexeme();if(null==i){n="expecting term, found nothing";throw new R.QueryParseError(n,t.start,t.end)}switch(i.type){case R.QueryLexer.TERM:return R.QueryParser.parseTerm;default:n="expecting term, found '"+i.type+"'";throw new R.QueryParseError(n,i.start,i.end)}}},R.QueryParser.parseTerm=function(e){var t=e.consumeLexeme();if(null!=t){e.currentClause.term=t.str.toLowerCase(),-1!=t.str.indexOf("*")&&(e.currentClause.usePipeline=!1);var r=e.peekLexeme();if(null!=r)switch(r.type){case R.QueryLexer.TERM:return e.nextClause(),R.QueryParser.parseTerm;case R.QueryLexer.FIELD:return e.nextClause(),R.QueryParser.parseField;case R.QueryLexer.EDIT_DISTANCE:return R.QueryParser.parseEditDistance;case R.QueryLexer.BOOST:return R.QueryParser.parseBoost;case R.QueryLexer.PRESENCE:return e.nextClause(),R.QueryParser.parsePresence;default:var n="Unexpected lexeme type '"+r.type+"'";throw new R.QueryParseError(n,r.start,r.end)}else e.nextClause()}},R.QueryParser.parseEditDistance=function(e){var t=e.consumeLexeme();if(null!=t){var r=parseInt(t.str,10);if(isNaN(r)){var n="edit distance must be numeric";throw new R.QueryParseError(n,t.start,t.end)}e.currentClause.editDistance=r;var i=e.peekLexeme();if(null!=i)switch(i.type){case R.QueryLexer.TERM:return e.nextClause(),R.QueryParser.parseTerm;case R.QueryLexer.FIELD:return e.nextClause(),R.QueryParser.parseField;case R.QueryLexer.EDIT_DISTANCE:return R.QueryParser.parseEditDistance;case R.QueryLexer.BOOST:return R.QueryParser.parseBoost;case R.QueryLexer.PRESENCE:return e.nextClause(),R.QueryParser.parsePresence;default:n="Unexpected lexeme type '"+i.type+"'";throw new R.QueryParseError(n,i.start,i.end)}else e.nextClause()}},R.QueryParser.parseBoost=function(e){var t=e.consumeLexeme();if(null!=t){var r=parseInt(t.str,10);if(isNaN(r)){var n="boost must be numeric";throw new R.QueryParseError(n,t.start,t.end)}e.currentClause.boost=r;var i=e.peekLexeme();if(null!=i)switch(i.type){case R.QueryLexer.TERM:return e.nextClause(),R.QueryParser.parseTerm;case R.QueryLexer.FIELD:return e.nextClause(),R.QueryParser.parseField;case R.QueryLexer.EDIT_DISTANCE:return R.QueryParser.parseEditDistance;case R.QueryLexer.BOOST:return R.QueryParser.parseBoost;case R.QueryLexer.PRESENCE:return e.nextClause(),R.QueryParser.parsePresence;default:n="Unexpected lexeme type '"+i.type+"'";throw new R.QueryParseError(n,i.start,i.end)}else e.nextClause()}},void 0===(i="function"==typeof(n=function(){return R})?n.call(t,r,t,e):n)||(e.exports=i)}()},function(e,t,r){"use strict";r.r(t);var n=r(0),i=r(1),s=function(e){var t="function"==typeof Symbol&&Symbol.iterator,r=t&&e[t],n=0;if(r)return r.call(e);if(e&&"number"==typeof e.length)return{next:function(){return e&&n>=e.length&&(e=void 0),{value:e&&e[n++],done:!e}}};throw new TypeError(t?"Object is not iterable.":"Symbol.iterator is not defined.")},o=function(e,t){var r="function"==typeof Symbol&&e[Symbol.iterator];if(!r)return e;var n,i,s=r.call(e),o=[];try{for(;(void 0===t||t-- >0)&&!(n=s.next()).done;)o.push(n.value)}catch(e){i={error:e}}finally{try{n&&!n.done&&(r=s.return)&&r.call(s)}finally{if(i)throw i.error}}return o};var a=r(2),u=function(){return(u=Object.assign||function(e){for(var t,r=1,n=arguments.length;r=e.length&&(e=void 0),{value:e&&e[n++],done:!e}}};throw new TypeError(t?"Object is not iterable.":"Symbol.iterator is not defined.")},h=function(e,t){var r="function"==typeof Symbol&&e[Symbol.iterator];if(!r)return e;var n,i,s=r.call(e),o=[];try{for(;(void 0===t||t-- >0)&&!(n=s.next()).done;)o.push(n.value)}catch(e){i={error:e}}finally{try{n&&!n.done&&(r=s.return)&&r.call(s)}finally{if(i)throw i.error}}return o},d=function(){for(var e=[],t=0;t"+r+""};return function(n){n=n.replace(/[\s*+-:~^]+/g," ").trim();var i=new RegExp("(^|"+e.separator+")("+a(n).replace(t,"|")+")","img");return function(e){return u(u({},e),{title:e.title.replace(i,r),text:e.text.replace(i,r)})}}}(t),console.dir(t,{depth:null}),this.index=void 0===h?n((function(){var e,t;l=l||{trimmer:!0,stopwords:!0},this.pipeline.reset(),l.trimmer&&this.pipeline.add(n.trimmer),l.stopwords&&this.pipeline.add(n.stopWordFilter),this.field("title",{boost:10}),this.field("text"),this.ref("location");try{for(var i=c(r),s=i.next();!s.done;s=i.next()){var o=s.value;this.add(o)}}catch(t){e={error:t}}finally{try{s&&!s.done&&(t=i.return)&&t.call(i)}finally{if(e)throw e.error}}})):n.Index.load("string"==typeof h?JSON.parse(h):h)}return e.prototype.search=function(e){var t=this;if(e)try{var r=this.index.search(e).reduce((function(e,r){var n=t.documents.get(r.ref);if(void 0!==n)if("parent"in n){var i=n.parent.location;e.set(i,d(e.get(i)||[],[r]))}else{i=n.location;e.set(i,e.get(i)||[])}return e}),new Map),n=this.highlight(e);return d(r).map((function(e){var r=h(e,2),i=r[0],s=r[1];return{article:n(t.documents.get(i)),sections:s.map((function(e){return n(t.documents.get(e.ref))}))}}))}catch(t){console.warn("Invalid query: "+e+" – see https://bit.ly/2s3ChXG")}return[]},e.prototype.toString=function(){return JSON.stringify(this.index)},e}();!function(e){e[e.SETUP=0]="SETUP",e[e.DUMP=1]="DUMP",e[e.QUERY=2]="QUERY",e[e.RESULT=3]="RESULT"}(l||(l={})),r.d(t,"handler",(function(){return v}));var p,y=function(e){var t="function"==typeof Symbol&&Symbol.iterator,r=t&&e[t],n=0;if(r)return r.call(e);if(e&&"number"==typeof e.length)return{next:function(){return e&&n>=e.length&&(e=void 0),{value:e&&e[n++],done:!e}}};throw new TypeError(t?"Object is not iterable.":"Symbol.iterator is not defined.")},m=function(e,t){var r="function"==typeof Symbol&&e[Symbol.iterator];if(!r)return e;var n,i,s=r.call(e),o=[];try{for(;(void 0===t||t-- >0)&&!(n=s.next()).done;)o.push(n.value)}catch(e){i={error:e}}finally{try{n&&!n.done&&(r=s.return)&&r.call(s)}finally{if(i)throw i.error}}return o},g=function(){for(var e=[],t=0;t1&&i.push(n+"/lunr.multi.min.js"),importScripts.apply(void 0,g(i))}(e.data.config),p=new f(e.data),{type:l.DUMP,data:p.toString()};case l.QUERY:return{type:l.RESULT,data:p?p.search(e.data):[]};default:throw new TypeError("Invalid message type")}}self.addEventListener("message",(function(e){self.postMessage(v(e.data))}))}]); + */,R.Builder=function(){this._ref="id",this._fields=Object.create(null),this._documents=Object.create(null),this.invertedIndex=Object.create(null),this.fieldTermFrequencies={},this.fieldLengths={},this.tokenizer=R.tokenizer,this.pipeline=new R.Pipeline,this.searchPipeline=new R.Pipeline,this.documentCount=0,this._b=.75,this._k1=1.2,this.termIndex=0,this.metadataWhitelist=[]},R.Builder.prototype.ref=function(e){this._ref=e},R.Builder.prototype.field=function(e,t){if(/\//.test(e))throw new RangeError("Field '"+e+"' contains illegal character '/'");this._fields[e]=t||{}},R.Builder.prototype.b=function(e){this._b=e<0?0:e>1?1:e},R.Builder.prototype.k1=function(e){this._k1=e},R.Builder.prototype.add=function(e,t){var r=e[this._ref],n=Object.keys(this._fields);this._documents[r]=t||{},this.documentCount+=1;for(var i=0;i=this.length)return R.QueryLexer.EOS;var e=this.str.charAt(this.pos);return this.pos+=1,e},R.QueryLexer.prototype.width=function(){return this.pos-this.start},R.QueryLexer.prototype.ignore=function(){this.start==this.pos&&(this.pos+=1),this.start=this.pos},R.QueryLexer.prototype.backup=function(){this.pos-=1},R.QueryLexer.prototype.acceptDigitRun=function(){var e,t;do{t=(e=this.next()).charCodeAt(0)}while(t>47&&t<58);e!=R.QueryLexer.EOS&&this.backup()},R.QueryLexer.prototype.more=function(){return this.pos1&&(e.backup(),e.emit(R.QueryLexer.TERM)),e.ignore(),e.more())return R.QueryLexer.lexText},R.QueryLexer.lexEditDistance=function(e){return e.ignore(),e.acceptDigitRun(),e.emit(R.QueryLexer.EDIT_DISTANCE),R.QueryLexer.lexText},R.QueryLexer.lexBoost=function(e){return e.ignore(),e.acceptDigitRun(),e.emit(R.QueryLexer.BOOST),R.QueryLexer.lexText},R.QueryLexer.lexEOS=function(e){e.width()>0&&e.emit(R.QueryLexer.TERM)},R.QueryLexer.termSeparator=R.tokenizer.separator,R.QueryLexer.lexText=function(e){for(;;){var t=e.next();if(t==R.QueryLexer.EOS)return R.QueryLexer.lexEOS;if(92!=t.charCodeAt(0)){if(":"==t)return R.QueryLexer.lexField;if("~"==t)return e.backup(),e.width()>0&&e.emit(R.QueryLexer.TERM),R.QueryLexer.lexEditDistance;if("^"==t)return e.backup(),e.width()>0&&e.emit(R.QueryLexer.TERM),R.QueryLexer.lexBoost;if("+"==t&&1===e.width())return e.emit(R.QueryLexer.PRESENCE),R.QueryLexer.lexText;if("-"==t&&1===e.width())return e.emit(R.QueryLexer.PRESENCE),R.QueryLexer.lexText;if(t.match(R.QueryLexer.termSeparator))return R.QueryLexer.lexTerm}else e.escapeCharacter()}},R.QueryParser=function(e,t){this.lexer=new R.QueryLexer(e),this.query=t,this.currentClause={},this.lexemeIdx=0},R.QueryParser.prototype.parse=function(){this.lexer.run(),this.lexemes=this.lexer.lexemes;for(var e=R.QueryParser.parseClause;e;)e=e(this);return this.query},R.QueryParser.prototype.peekLexeme=function(){return this.lexemes[this.lexemeIdx]},R.QueryParser.prototype.consumeLexeme=function(){var e=this.peekLexeme();return this.lexemeIdx+=1,e},R.QueryParser.prototype.nextClause=function(){var e=this.currentClause;this.query.clause(e),this.currentClause={}},R.QueryParser.parseClause=function(e){var t=e.peekLexeme();if(null!=t)switch(t.type){case R.QueryLexer.PRESENCE:return R.QueryParser.parsePresence;case R.QueryLexer.FIELD:return R.QueryParser.parseField;case R.QueryLexer.TERM:return R.QueryParser.parseTerm;default:var r="expected either a field or a term, found "+t.type;throw t.str.length>=1&&(r+=" with value '"+t.str+"'"),new R.QueryParseError(r,t.start,t.end)}},R.QueryParser.parsePresence=function(e){var t=e.consumeLexeme();if(null!=t){switch(t.str){case"-":e.currentClause.presence=R.Query.presence.PROHIBITED;break;case"+":e.currentClause.presence=R.Query.presence.REQUIRED;break;default:var r="unrecognised presence operator'"+t.str+"'";throw new R.QueryParseError(r,t.start,t.end)}var n=e.peekLexeme();if(null==n){r="expecting term or field, found nothing";throw new R.QueryParseError(r,t.start,t.end)}switch(n.type){case R.QueryLexer.FIELD:return R.QueryParser.parseField;case R.QueryLexer.TERM:return R.QueryParser.parseTerm;default:r="expecting term or field, found '"+n.type+"'";throw new R.QueryParseError(r,n.start,n.end)}}},R.QueryParser.parseField=function(e){var t=e.consumeLexeme();if(null!=t){if(-1==e.query.allFields.indexOf(t.str)){var r=e.query.allFields.map((function(e){return"'"+e+"'"})).join(", "),n="unrecognised field '"+t.str+"', possible fields: "+r;throw new R.QueryParseError(n,t.start,t.end)}e.currentClause.fields=[t.str];var i=e.peekLexeme();if(null==i){n="expecting term, found nothing";throw new R.QueryParseError(n,t.start,t.end)}switch(i.type){case R.QueryLexer.TERM:return R.QueryParser.parseTerm;default:n="expecting term, found '"+i.type+"'";throw new R.QueryParseError(n,i.start,i.end)}}},R.QueryParser.parseTerm=function(e){var t=e.consumeLexeme();if(null!=t){e.currentClause.term=t.str.toLowerCase(),-1!=t.str.indexOf("*")&&(e.currentClause.usePipeline=!1);var r=e.peekLexeme();if(null!=r)switch(r.type){case R.QueryLexer.TERM:return e.nextClause(),R.QueryParser.parseTerm;case R.QueryLexer.FIELD:return e.nextClause(),R.QueryParser.parseField;case R.QueryLexer.EDIT_DISTANCE:return R.QueryParser.parseEditDistance;case R.QueryLexer.BOOST:return R.QueryParser.parseBoost;case R.QueryLexer.PRESENCE:return e.nextClause(),R.QueryParser.parsePresence;default:var n="Unexpected lexeme type '"+r.type+"'";throw new R.QueryParseError(n,r.start,r.end)}else e.nextClause()}},R.QueryParser.parseEditDistance=function(e){var t=e.consumeLexeme();if(null!=t){var r=parseInt(t.str,10);if(isNaN(r)){var n="edit distance must be numeric";throw new R.QueryParseError(n,t.start,t.end)}e.currentClause.editDistance=r;var i=e.peekLexeme();if(null!=i)switch(i.type){case R.QueryLexer.TERM:return e.nextClause(),R.QueryParser.parseTerm;case R.QueryLexer.FIELD:return e.nextClause(),R.QueryParser.parseField;case R.QueryLexer.EDIT_DISTANCE:return R.QueryParser.parseEditDistance;case R.QueryLexer.BOOST:return R.QueryParser.parseBoost;case R.QueryLexer.PRESENCE:return e.nextClause(),R.QueryParser.parsePresence;default:n="Unexpected lexeme type '"+i.type+"'";throw new R.QueryParseError(n,i.start,i.end)}else e.nextClause()}},R.QueryParser.parseBoost=function(e){var t=e.consumeLexeme();if(null!=t){var r=parseInt(t.str,10);if(isNaN(r)){var n="boost must be numeric";throw new R.QueryParseError(n,t.start,t.end)}e.currentClause.boost=r;var i=e.peekLexeme();if(null!=i)switch(i.type){case R.QueryLexer.TERM:return e.nextClause(),R.QueryParser.parseTerm;case R.QueryLexer.FIELD:return e.nextClause(),R.QueryParser.parseField;case R.QueryLexer.EDIT_DISTANCE:return R.QueryParser.parseEditDistance;case R.QueryLexer.BOOST:return R.QueryParser.parseBoost;case R.QueryLexer.PRESENCE:return e.nextClause(),R.QueryParser.parsePresence;default:n="Unexpected lexeme type '"+i.type+"'";throw new R.QueryParseError(n,i.start,i.end)}else e.nextClause()}},void 0===(i="function"==typeof(n=function(){return R})?n.call(t,r,t,e):n)||(e.exports=i)}()},function(e,t,r){"use strict";r.r(t);var n=r(0),i=r(1),s=function(e){var t="function"==typeof Symbol&&Symbol.iterator,r=t&&e[t],n=0;if(r)return r.call(e);if(e&&"number"==typeof e.length)return{next:function(){return e&&n>=e.length&&(e=void 0),{value:e&&e[n++],done:!e}}};throw new TypeError(t?"Object is not iterable.":"Symbol.iterator is not defined.")},o=function(e,t){var r="function"==typeof Symbol&&e[Symbol.iterator];if(!r)return e;var n,i,s=r.call(e),o=[];try{for(;(void 0===t||t-- >0)&&!(n=s.next()).done;)o.push(n.value)}catch(e){i={error:e}}finally{try{n&&!n.done&&(r=s.return)&&r.call(s)}finally{if(i)throw i.error}}return o};var a=r(2),u=function(){return(u=Object.assign||function(e){for(var t,r=1,n=arguments.length;r0)&&!(n=s.next()).done;)o.push(n.value)}catch(e){i={error:e}}finally{try{n&&!n.done&&(r=s.return)&&r.call(s)}finally{if(i)throw i.error}}return o},h=function(){for(var e=[],t=0;t=e.length&&(e=void 0),{value:e&&e[n++],done:!e}}};throw new TypeError(t?"Object is not iterable.":"Symbol.iterator is not defined.")},f=function(){function e(e){var t=e.config,r=e.docs,l=e.pipeline,c=e.index;this.documents=function(e){var t,r,n=new Map;try{for(var a=s(e),u=a.next();!u.done;u=a.next()){var l=u.value,c=o(l.location.split("#"),2),h=c[0],d=c[1],f=l.location,p=l.title,y=i(l.text).replace(/\s+(?=[,.:;!?])/g,"").replace(/\s+/g," ");if(d){var m=n.get(h);m.linked?n.set(f,{location:f,title:p,text:y,parent:m}):(m.title=l.title,m.text=y,m.linked=!0)}else n.set(f,{location:f,title:p,text:y,linked:!1})}}catch(e){t={error:e}}finally{try{u&&!u.done&&(r=a.return)&&r.call(a)}finally{if(t)throw t.error}}return n}(r),this.highlight=function(e){var t=new RegExp(e.separator,"img"),r=function(e,t,r){return t+""+r+""};return function(n){n=n.replace(/[\s*+-:~^]+/g," ").trim();var i=new RegExp("(^|"+e.separator+")("+a(n).replace(t,"|")+")","img");return function(e){return u(u({},e),{title:e.title.replace(i,r),text:e.text.replace(i,r)})}}}(t),this.index=void 0===c?n((function(){var e,i,s;l=l||{trimmer:!0,stopwords:!0},this.pipeline.reset(),l.trimmer&&this.pipeline.add(n.trimmer),l.stopwords&&this.pipeline.add(n.stopWordFilter),1===t.lang.length&&"en"!==t.lang[0]?this.use(n[t.lang[0]]):t.lang.length>1&&this.use((e=n).multiLanguage.apply(e,h(t.lang))),this.field("title",{boost:10}),this.field("text"),this.ref("location");try{for(var o=d(r),a=o.next();!a.done;a=o.next()){var u=a.value;this.add(u)}}catch(e){i={error:e}}finally{try{a&&!a.done&&(s=o.return)&&s.call(o)}finally{if(i)throw i.error}}})):n.Index.load("string"==typeof c?JSON.parse(c):c)}return e.prototype.search=function(e){var t=this;if(e)try{var r=this.index.search(e).reduce((function(e,r){var n=t.documents.get(r.ref);if(void 0!==n)if("parent"in n){var i=n.parent.location;e.set(i,h(e.get(i)||[],[r]))}else{i=n.location;e.set(i,e.get(i)||[])}return e}),new Map),n=this.highlight(e);return h(r).map((function(e){var r=c(e,2),i=r[0],s=r[1];return{article:n(t.documents.get(i)),sections:s.map((function(e){return n(t.documents.get(e.ref))}))}}))}catch(t){console.warn("Invalid query: "+e+" – see https://bit.ly/2s3ChXG")}return[]},e.prototype.toString=function(){return JSON.stringify(this.index)},e}();!function(e){e[e.SETUP=0]="SETUP",e[e.DUMP=1]="DUMP",e[e.QUERY=2]="QUERY",e[e.RESULT=3]="RESULT"}(l||(l={})),r.d(t,"handler",(function(){return v}));var p,y=function(e){var t="function"==typeof Symbol&&Symbol.iterator,r=t&&e[t],n=0;if(r)return r.call(e);if(e&&"number"==typeof e.length)return{next:function(){return e&&n>=e.length&&(e=void 0),{value:e&&e[n++],done:!e}}};throw new TypeError(t?"Object is not iterable.":"Symbol.iterator is not defined.")},m=function(e,t){var r="function"==typeof Symbol&&e[Symbol.iterator];if(!r)return e;var n,i,s=r.call(e),o=[];try{for(;(void 0===t||t-- >0)&&!(n=s.next()).done;)o.push(n.value)}catch(e){i={error:e}}finally{try{n&&!n.done&&(r=s.return)&&r.call(s)}finally{if(i)throw i.error}}return o},g=function(){for(var e=[],t=0;t1&&i.push(n+"/lunr.multi.min.js"),importScripts.apply(void 0,g(i))}(e.data.config),p=new f(e.data),{type:l.DUMP,data:p.toString()};case l.QUERY:return{type:l.RESULT,data:p?p.search(e.data):[]};default:throw new TypeError("Invalid message type")}}self.addEventListener("message",(function(e){self.postMessage(v(e.data))}))}]); //# sourceMappingURL=search.js.map \ No newline at end of file diff --git a/material/assets/javascripts/worker/search.js.map b/material/assets/javascripts/worker/search.js.map index c50f6863e..049aee551 100644 --- a/material/assets/javascripts/worker/search.js.map +++ b/material/assets/javascripts/worker/search.js.map @@ -1 +1 @@ -{"version":3,"sources":["webpack:///webpack/bootstrap","webpack:///./node_modules/lunr/lunr.js-exposed","webpack:///./node_modules/escape-html/index.js","webpack:///./node_modules/escape-string-regexp/index.js","webpack:///(webpack)/buildin/global.js","webpack:///./node_modules/lunr/lunr.js","webpack:///./src/assets/javascripts/workers/search/_/index.ts","webpack:///./src/assets/javascripts/modules/search/_/index.ts","webpack:///./src/assets/javascripts/modules/search/document/index.ts","webpack:///./src/assets/javascripts/modules/search/highlight/index.ts","webpack:///./src/assets/javascripts/workers/search/main/index.ts"],"names":["installedModules","__webpack_require__","moduleId","exports","module","i","l","modules","call","m","c","d","name","getter","o","Object","defineProperty","enumerable","get","r","Symbol","toStringTag","value","t","mode","__esModule","ns","create","key","bind","n","object","property","prototype","hasOwnProperty","p","s","matchHtmlRegExp","string","escape","str","match","exec","html","index","lastIndex","length","charCodeAt","substring","matchOperatorsRegex","TypeError","replace","g","this","Function","e","window","global","step2list","step3list","v","C","re_mgr0","re_mgr1","re_meq1","re_s_v","re_1a","re2_1a","re_1b","re2_1b","re_1b_2","re2_1b_2","re3_1b_2","re4_1b_2","re_1c","re_2","re_3","re_4","re2_4","re_5","re_5_1","re3_5","porterStemmer","lunr","config","builder","Builder","pipeline","add","trimmer","stopWordFilter","stemmer","searchPipeline","build","version","utils","warn","message","console","asString","obj","toString","clone","keys","val","Array","isArray","slice","FieldRef","docRef","fieldName","stringValue","_stringValue","joiner","fromString","indexOf","fieldRef","undefined","Set","elements","complete","intersect","other","union","contains","empty","a","b","intersection","element","push","concat","idf","posting","documentCount","documentsWithTerm","x","Math","log","abs","Token","metadata","update","fn","tokenizer","map","toLowerCase","len","tokens","sliceEnd","sliceStart","sliceLength","charAt","separator","tokenMetadata","Pipeline","_stack","registeredFunctions","registerFunction","label","warnIfFunctionNotRegistered","load","serialised","forEach","fnName","Error","fns","arguments","after","existingFn","newFn","pos","splice","before","remove","run","stackLength","memo","j","result","k","runString","token","reset","toJSON","Vector","_magnitude","positionForIndex","start","end","pivotPoint","floor","pivotIndex","insert","insertIdx","upsert","position","magnitude","sumOfSquares","elementsLength","sqrt","dot","otherVector","dotProduct","aLen","bLen","aVal","bVal","similarity","toArray","output","RegExp","w","stem","suffix","firstch","re","re2","re3","re4","substr","toUpperCase","test","fp","generateStopWordFilter","stopWords","words","reduce","stopWord","TokenSet","final","edges","id","_nextId","fromArray","arr","finish","root","fromClause","clause","fromFuzzyString","term","editDistance","stack","node","editsRemaining","frame","pop","noEditNode","char","insertionNode","substitutionNode","transposeNode","charA","charB","next","prefix","edge","_str","labels","sort","qNode","qEdges","qLen","nEdges","nLen","q","qEdge","nEdge","previousWord","uncheckedNodes","minimizedNodes","word","commonPrefix","minimize","child","nextNode","parent","downTo","childKey","Index","attrs","invertedIndex","fieldVectors","tokenSet","fields","search","queryString","query","QueryParser","parse","Query","matchingFields","queryVectors","termFieldCache","requiredMatches","prohibitedMatches","clauses","terms","clauseMatches","usePipeline","termTokenSet","expandedTerms","presence","REQUIRED","field","expandedTerm","termIndex","_index","fieldPosting","matchingDocumentRefs","termField","matchingDocumentsSet","PROHIBITED","boost","fieldMatch","matchingDocumentRef","matchingFieldRef","MatchData","allRequiredMatches","allProhibitedMatches","matchingFieldRefs","results","matches","isNegated","docMatch","fieldVector","score","matchData","combine","ref","serializedIndex","serializedVectors","serializedInvertedIndex","tokenSetBuilder","tuple","_ref","_fields","_documents","fieldTermFrequencies","fieldLengths","_b","_k1","metadataWhitelist","attributes","RangeError","number","k1","doc","extractor","fieldTerms","metadataKey","calculateAverageFieldLengths","fieldRefs","numberOfFields","accumulator","documentsWithField","averageFieldLength","createFieldVectors","fieldRefsLength","termIdfCache","fieldLength","termFrequencies","termsLength","fieldBoost","docBoost","scoreWithPrecision","tf","round","createTokenSet","use","args","unshift","apply","clonedMetadata","metadataKeys","otherMatchData","allFields","wildcard","String","NONE","LEADING","TRAILING","OPTIONAL","options","QueryParseError","QueryLexer","lexemes","escapeCharPositions","state","lexText","sliceString","subSlices","join","emit","type","escapeCharacter","EOS","width","ignore","backup","acceptDigitRun","charCode","more","FIELD","TERM","EDIT_DISTANCE","BOOST","PRESENCE","lexField","lexer","lexTerm","lexEditDistance","lexBoost","lexEOS","termSeparator","currentClause","lexemeIdx","parseClause","peekLexeme","consumeLexeme","lexeme","nextClause","completedClause","parser","parsePresence","parseField","parseTerm","errorMessage","nextLexeme","possibleFields","f","parseEditDistance","parseBoost","parseInt","isNaN","SearchMessageType","docs","documents","Map","path","hash","location","title","text","linked","set","setupSearchDocumentMap","highlight","_","data","trim","document","setupSearchHighlighter","dir","depth","stopwords","JSON","groups","sections","article","section","err","stringify","handler","SETUP","base","scripts","lang","importScripts","setupLunrLanguages","DUMP","QUERY","RESULT","self","addEventListener","ev","postMessage"],"mappings":"aACE,IAAIA,EAAmB,GAGvB,SAASC,EAAoBC,GAG5B,GAAGF,EAAiBE,GACnB,OAAOF,EAAiBE,GAAUC,QAGnC,IAAIC,EAASJ,EAAiBE,GAAY,CACzCG,EAAGH,EACHI,GAAG,EACHH,QAAS,IAUV,OANAI,EAAQL,GAAUM,KAAKJ,EAAOD,QAASC,EAAQA,EAAOD,QAASF,GAG/DG,EAAOE,GAAI,EAGJF,EAAOD,QAKfF,EAAoBQ,EAAIF,EAGxBN,EAAoBS,EAAIV,EAGxBC,EAAoBU,EAAI,SAASR,EAASS,EAAMC,GAC3CZ,EAAoBa,EAAEX,EAASS,IAClCG,OAAOC,eAAeb,EAASS,EAAM,CAAEK,YAAY,EAAMC,IAAKL,KAKhEZ,EAAoBkB,EAAI,SAAShB,GACX,oBAAXiB,QAA0BA,OAAOC,aAC1CN,OAAOC,eAAeb,EAASiB,OAAOC,YAAa,CAAEC,MAAO,WAE7DP,OAAOC,eAAeb,EAAS,aAAc,CAAEmB,OAAO,KAQvDrB,EAAoBsB,EAAI,SAASD,EAAOE,GAEvC,GADU,EAAPA,IAAUF,EAAQrB,EAAoBqB,IAC/B,EAAPE,EAAU,OAAOF,EACpB,GAAW,EAAPE,GAA8B,iBAAVF,GAAsBA,GAASA,EAAMG,WAAY,OAAOH,EAChF,IAAII,EAAKX,OAAOY,OAAO,MAGvB,GAFA1B,EAAoBkB,EAAEO,GACtBX,OAAOC,eAAeU,EAAI,UAAW,CAAET,YAAY,EAAMK,MAAOA,IACtD,EAAPE,GAA4B,iBAATF,EAAmB,IAAI,IAAIM,KAAON,EAAOrB,EAAoBU,EAAEe,EAAIE,EAAK,SAASA,GAAO,OAAON,EAAMM,IAAQC,KAAK,KAAMD,IAC9I,OAAOF,GAIRzB,EAAoB6B,EAAI,SAAS1B,GAChC,IAAIS,EAAST,GAAUA,EAAOqB,WAC7B,WAAwB,OAAOrB,EAAgB,SAC/C,WAA8B,OAAOA,GAEtC,OADAH,EAAoBU,EAAEE,EAAQ,IAAKA,GAC5BA,GAIRZ,EAAoBa,EAAI,SAASiB,EAAQC,GAAY,OAAOjB,OAAOkB,UAAUC,eAAe1B,KAAKuB,EAAQC,IAGzG/B,EAAoBkC,EAAI,GAIjBlC,EAAoBA,EAAoBmC,EAAI,G,mBClFrD,YAAAhC,EAAA,eAAkC,EAAQ,K;;;;;;;GCe1C,IAAIiC,EAAkB,UAOtBjC,EAAOD,QAUP,SAAoBmC,GAClB,IAOIC,EAPAC,EAAM,GAAKF,EACXG,EAAQJ,EAAgBK,KAAKF,GAEjC,IAAKC,EACH,OAAOD,EAIT,IAAIG,EAAO,GACPC,EAAQ,EACRC,EAAY,EAEhB,IAAKD,EAAQH,EAAMG,MAAOA,EAAQJ,EAAIM,OAAQF,IAAS,CACrD,OAAQJ,EAAIO,WAAWH,IACrB,KAAK,GACHL,EAAS,SACT,MACF,KAAK,GACHA,EAAS,QACT,MACF,KAAK,GACHA,EAAS,QACT,MACF,KAAK,GACHA,EAAS,OACT,MACF,KAAK,GACHA,EAAS,OACT,MACF,QACE,SAGAM,IAAcD,IAChBD,GAAQH,EAAIQ,UAAUH,EAAWD,IAGnCC,EAAYD,EAAQ,EACpBD,GAAQJ,EAGV,OAAOM,IAAcD,EACjBD,EAAOH,EAAIQ,UAAUH,EAAWD,GAChCD,I,6BC1EN,MAAMM,EAAsB,uBAE5B7C,EAAOD,QAAUmC,IAChB,GAAsB,iBAAXA,EACV,MAAM,IAAIY,UAAU,qBAGrB,OAAOZ,EAAOa,QAAQF,EAAqB,U,cCT5C,IAAIG,EAGJA,EAAI,WACH,OAAOC,KADJ,GAIJ,IAECD,EAAIA,GAAK,IAAIE,SAAS,cAAb,GACR,MAAOC,GAEc,iBAAXC,SAAqBJ,EAAII,QAOrCpD,EAAOD,QAAUiD,G,gBCnBjB;;;;;IAMC,WAiCD,IAoC6BK,EAw2BvBC,EAwBFC,EAWAC,EACAC,EAQEC,EACAC,EACAC,EACAC,EAEAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAEAC,EACAC,EAEAC,EAEAC,EACAC,EAEAC,EACAC,EACAC,EAEAC,EAl9BFC,EAAO,SAAUC,GACnB,IAAIC,EAAU,IAAIF,EAAKG,QAavB,OAXAD,EAAQE,SAASC,IACfL,EAAKM,QACLN,EAAKO,eACLP,EAAKQ,SAGPN,EAAQO,eAAeJ,IACrBL,EAAKQ,SAGPP,EAAO5E,KAAK6E,EAASA,GACdA,EAAQQ,SAGjBV,EAAKW,QAAU;;;;IAUfX,EAAKY,MAAQ,GASbZ,EAAKY,MAAMC,MAAkBvC,EAQ1BJ,KANM,SAAU4C,GACXxC,EAAOyC,SAAWA,QAAQF,MAC5BE,QAAQF,KAAKC,KAiBnBd,EAAKY,MAAMI,SAAW,SAAUC,GAC9B,OAAIA,QACK,GAEAA,EAAIC,YAoBflB,EAAKY,MAAMO,MAAQ,SAAUF,GAC3B,GAAIA,QACF,OAAOA,EAMT,IAHA,IAAIE,EAAQvF,OAAOY,OAAO,MACtB4E,EAAOxF,OAAOwF,KAAKH,GAEd/F,EAAI,EAAGA,EAAIkG,EAAKzD,OAAQzC,IAAK,CACpC,IAAIuB,EAAM2E,EAAKlG,GACXmG,EAAMJ,EAAIxE,GAEd,GAAI6E,MAAMC,QAAQF,GAChBF,EAAM1E,GAAO4E,EAAIG,YADnB,CAKA,GAAmB,iBAARH,GACQ,iBAARA,GACQ,kBAARA,EAKX,MAAM,IAAItD,UAAU,yDAJlBoD,EAAM1E,GAAO4E,GAOjB,OAAOF,GAETnB,EAAKyB,SAAW,SAAUC,EAAQC,EAAWC,GAC3C1D,KAAKwD,OAASA,EACdxD,KAAKyD,UAAYA,EACjBzD,KAAK2D,aAAeD,GAGtB5B,EAAKyB,SAASK,OAAS,IAEvB9B,EAAKyB,SAASM,WAAa,SAAU9E,GACnC,IAAIN,EAAIM,EAAE+E,QAAQhC,EAAKyB,SAASK,QAEhC,IAAW,IAAPnF,EACF,KAAM,6BAGR,IAAIsF,EAAWhF,EAAEuE,MAAM,EAAG7E,GACtB+E,EAASzE,EAAEuE,MAAM7E,EAAI,GAEzB,OAAO,IAAIqD,EAAKyB,SAAUC,EAAQO,EAAUhF,IAG9C+C,EAAKyB,SAAS3E,UAAUoE,SAAW,WAKjC,OAJyBgB,MAArBhE,KAAK2D,eACP3D,KAAK2D,aAAe3D,KAAKyD,UAAY3B,EAAKyB,SAASK,OAAS5D,KAAKwD,QAG5DxD,KAAK2D;;;;IAYd7B,EAAKmC,IAAM,SAAUC,GAGnB,GAFAlE,KAAKkE,SAAWxG,OAAOY,OAAO,MAE1B4F,EAAU,CACZlE,KAAKP,OAASyE,EAASzE,OAEvB,IAAK,IAAIzC,EAAI,EAAGA,EAAIgD,KAAKP,OAAQzC,IAC/BgD,KAAKkE,SAASA,EAASlH,KAAM,OAG/BgD,KAAKP,OAAS,GAWlBqC,EAAKmC,IAAIE,SAAW,CAClBC,UAAW,SAAUC,GACnB,OAAOA,GAGTC,MAAO,SAAUD,GACf,OAAOA,GAGTE,SAAU,WACR,OAAO,IAWXzC,EAAKmC,IAAIO,MAAQ,CACfJ,UAAW,WACT,OAAOpE,MAGTsE,MAAO,SAAUD,GACf,OAAOA,GAGTE,SAAU,WACR,OAAO,IAUXzC,EAAKmC,IAAIrF,UAAU2F,SAAW,SAAU7F,GACtC,QAASsB,KAAKkE,SAASxF,IAWzBoD,EAAKmC,IAAIrF,UAAUwF,UAAY,SAAUC,GACvC,IAAII,EAAGC,EAAGR,EAAUS,EAAe,GAEnC,GAAIN,IAAUvC,EAAKmC,IAAIE,SACrB,OAAOnE,KAGT,GAAIqE,IAAUvC,EAAKmC,IAAIO,MACrB,OAAOH,EAGLrE,KAAKP,OAAS4E,EAAM5E,QACtBgF,EAAIzE,KACJ0E,EAAIL,IAEJI,EAAIJ,EACJK,EAAI1E,MAGNkE,EAAWxG,OAAOwF,KAAKuB,EAAEP,UAEzB,IAAK,IAAIlH,EAAI,EAAGA,EAAIkH,EAASzE,OAAQzC,IAAK,CACxC,IAAI4H,EAAUV,EAASlH,GACnB4H,KAAWF,EAAER,UACfS,EAAaE,KAAKD,GAItB,OAAO,IAAI9C,EAAKmC,IAAKU,IAUvB7C,EAAKmC,IAAIrF,UAAU0F,MAAQ,SAAUD,GACnC,OAAIA,IAAUvC,EAAKmC,IAAIE,SACdrC,EAAKmC,IAAIE,SAGdE,IAAUvC,EAAKmC,IAAIO,MACdxE,KAGF,IAAI8B,EAAKmC,IAAIvG,OAAOwF,KAAKlD,KAAKkE,UAAUY,OAAOpH,OAAOwF,KAAKmB,EAAMH,aAU1EpC,EAAKiD,IAAM,SAAUC,EAASC,GAC5B,IAAIC,EAAoB,EAExB,IAAK,IAAIzB,KAAauB,EACH,UAAbvB,IACJyB,GAAqBxH,OAAOwF,KAAK8B,EAAQvB,IAAYhE,QAGvD,IAAI0F,GAAKF,EAAgBC,EAAoB,KAAQA,EAAoB,IAEzE,OAAOE,KAAKC,IAAI,EAAID,KAAKE,IAAIH,KAW/BrD,EAAKyD,MAAQ,SAAUpG,EAAKqG,GAC1BxF,KAAKb,IAAMA,GAAO,GAClBa,KAAKwF,SAAWA,GAAY,IAQ9B1D,EAAKyD,MAAM3G,UAAUoE,SAAW,WAC9B,OAAOhD,KAAKb,KAuBd2C,EAAKyD,MAAM3G,UAAU6G,OAAS,SAAUC,GAEtC,OADA1F,KAAKb,IAAMuG,EAAG1F,KAAKb,IAAKa,KAAKwF,UACtBxF,MAUT8B,EAAKyD,MAAM3G,UAAUqE,MAAQ,SAAUyC,GAErC,OADAA,EAAKA,GAAM,SAAU3G,GAAK,OAAOA,GAC1B,IAAI+C,EAAKyD,MAAOG,EAAG1F,KAAKb,IAAKa,KAAKwF,UAAWxF,KAAKwF;;;;IAyB3D1D,EAAK6D,UAAY,SAAU5C,EAAKyC,GAC9B,GAAW,MAAPzC,GAAsBiB,MAAPjB,EACjB,MAAO,GAGT,GAAIK,MAAMC,QAAQN,GAChB,OAAOA,EAAI6C,KAAI,SAAU1H,GACvB,OAAO,IAAI4D,EAAKyD,MACdzD,EAAKY,MAAMI,SAAS5E,GAAG2H,cACvB/D,EAAKY,MAAMO,MAAMuC,OASvB,IAJA,IAAIrG,EAAM4D,EAAIC,WAAW6C,cACrBC,EAAM3G,EAAIM,OACVsG,EAAS,GAEJC,EAAW,EAAGC,EAAa,EAAGD,GAAYF,EAAKE,IAAY,CAClE,IACIE,EAAcF,EAAWC,EAE7B,GAHW9G,EAAIgH,OAAOH,GAGZ5G,MAAM0C,EAAK6D,UAAUS,YAAcJ,GAAYF,EAAM,CAE7D,GAAII,EAAc,EAAG,CACnB,IAAIG,EAAgBvE,EAAKY,MAAMO,MAAMuC,IAAa,GAClDa,EAAwB,SAAI,CAACJ,EAAYC,GACzCG,EAAqB,MAAIN,EAAOtG,OAEhCsG,EAAOlB,KACL,IAAI/C,EAAKyD,MACPpG,EAAImE,MAAM2C,EAAYD,GACtBK,IAKNJ,EAAaD,EAAW,GAK5B,OAAOD,GAUTjE,EAAK6D,UAAUS,UAAY;;;;IAmC3BtE,EAAKwE,SAAW,WACdtG,KAAKuG,OAAS,IAGhBzE,EAAKwE,SAASE,oBAAsB9I,OAAOY,OAAO,MAmClDwD,EAAKwE,SAASG,iBAAmB,SAAUf,EAAIgB,GACzCA,KAAS1G,KAAKwG,qBAChB1E,EAAKY,MAAMC,KAAK,6CAA+C+D,GAGjEhB,EAAGgB,MAAQA,EACX5E,EAAKwE,SAASE,oBAAoBd,EAAGgB,OAAShB,GAShD5D,EAAKwE,SAASK,4BAA8B,SAAUjB,GACjCA,EAAGgB,OAAUhB,EAAGgB,SAAS1G,KAAKwG,qBAG/C1E,EAAKY,MAAMC,KAAK,kGAAmG+C,IAcvH5D,EAAKwE,SAASM,KAAO,SAAUC,GAC7B,IAAI3E,EAAW,IAAIJ,EAAKwE,SAYxB,OAVAO,EAAWC,SAAQ,SAAUC,GAC3B,IAAIrB,EAAK5D,EAAKwE,SAASE,oBAAoBO,GAE3C,IAAIrB,EAGF,MAAM,IAAIsB,MAAM,sCAAwCD,GAFxD7E,EAASC,IAAIuD,MAMVxD,GAUTJ,EAAKwE,SAAS1H,UAAUuD,IAAM,WAC5B,IAAI8E,EAAM7D,MAAMxE,UAAU0E,MAAMnG,KAAK+J,WAErCD,EAAIH,SAAQ,SAAUpB,GACpB5D,EAAKwE,SAASK,4BAA4BjB,GAC1C1F,KAAKuG,OAAO1B,KAAKa,KAChB1F,OAYL8B,EAAKwE,SAAS1H,UAAUuI,MAAQ,SAAUC,EAAYC,GACpDvF,EAAKwE,SAASK,4BAA4BU,GAE1C,IAAIC,EAAMtH,KAAKuG,OAAOzC,QAAQsD,GAC9B,IAAY,GAARE,EACF,MAAM,IAAIN,MAAM,0BAGlBM,GAAY,EACZtH,KAAKuG,OAAOgB,OAAOD,EAAK,EAAGD,IAY7BvF,EAAKwE,SAAS1H,UAAU4I,OAAS,SAAUJ,EAAYC,GACrDvF,EAAKwE,SAASK,4BAA4BU,GAE1C,IAAIC,EAAMtH,KAAKuG,OAAOzC,QAAQsD,GAC9B,IAAY,GAARE,EACF,MAAM,IAAIN,MAAM,0BAGlBhH,KAAKuG,OAAOgB,OAAOD,EAAK,EAAGD,IAQ7BvF,EAAKwE,SAAS1H,UAAU6I,OAAS,SAAU/B,GACzC,IAAI4B,EAAMtH,KAAKuG,OAAOzC,QAAQ4B,IAClB,GAAR4B,GAIJtH,KAAKuG,OAAOgB,OAAOD,EAAK,IAU1BxF,EAAKwE,SAAS1H,UAAU8I,IAAM,SAAU3B,GAGtC,IAFA,IAAI4B,EAAc3H,KAAKuG,OAAO9G,OAErBzC,EAAI,EAAGA,EAAI2K,EAAa3K,IAAK,CAIpC,IAHA,IAAI0I,EAAK1F,KAAKuG,OAAOvJ,GACjB4K,EAAO,GAEFC,EAAI,EAAGA,EAAI9B,EAAOtG,OAAQoI,IAAK,CACtC,IAAIC,EAASpC,EAAGK,EAAO8B,GAAIA,EAAG9B,GAE9B,GAAI+B,SAAmD,KAAXA,EAE5C,GAAI1E,MAAMC,QAAQyE,GAChB,IAAK,IAAIC,EAAI,EAAGA,EAAID,EAAOrI,OAAQsI,IACjCH,EAAK/C,KAAKiD,EAAOC,SAGnBH,EAAK/C,KAAKiD,GAId/B,EAAS6B,EAGX,OAAO7B,GAaTjE,EAAKwE,SAAS1H,UAAUoJ,UAAY,SAAU7I,EAAKqG,GACjD,IAAIyC,EAAQ,IAAInG,EAAKyD,MAAOpG,EAAKqG,GAEjC,OAAOxF,KAAK0H,IAAI,CAACO,IAAQrC,KAAI,SAAU1H,GACrC,OAAOA,EAAE8E,eAQblB,EAAKwE,SAAS1H,UAAUsJ,MAAQ,WAC9BlI,KAAKuG,OAAS,IAUhBzE,EAAKwE,SAAS1H,UAAUuJ,OAAS,WAC/B,OAAOnI,KAAKuG,OAAOX,KAAI,SAAUF,GAG/B,OAFA5D,EAAKwE,SAASK,4BAA4BjB,GAEnCA,EAAGgB;;;;IAwBd5E,EAAKsG,OAAS,SAAUlE,GACtBlE,KAAKqI,WAAa,EAClBrI,KAAKkE,SAAWA,GAAY,IAc9BpC,EAAKsG,OAAOxJ,UAAU0J,iBAAmB,SAAU/I,GAEjD,GAA4B,GAAxBS,KAAKkE,SAASzE,OAChB,OAAO,EAST,IANA,IAAI8I,EAAQ,EACRC,EAAMxI,KAAKkE,SAASzE,OAAS,EAC7ByG,EAAcsC,EAAMD,EACpBE,EAAarD,KAAKsD,MAAMxC,EAAc,GACtCyC,EAAa3I,KAAKkE,SAAsB,EAAbuE,GAExBvC,EAAc,IACfyC,EAAapJ,IACfgJ,EAAQE,GAGNE,EAAapJ,IACfiJ,EAAMC,GAGJE,GAAcpJ,IAIlB2G,EAAcsC,EAAMD,EACpBE,EAAaF,EAAQnD,KAAKsD,MAAMxC,EAAc,GAC9CyC,EAAa3I,KAAKkE,SAAsB,EAAbuE,GAG7B,OAAIE,GAAcpJ,EACI,EAAbkJ,EAGLE,EAAapJ,EACK,EAAbkJ,EAGLE,EAAapJ,EACW,GAAlBkJ,EAAa,QADvB,GAcF3G,EAAKsG,OAAOxJ,UAAUgK,OAAS,SAAUC,EAAW1F,GAClDnD,KAAK8I,OAAOD,EAAW1F,GAAK,WAC1B,KAAM,sBAYVrB,EAAKsG,OAAOxJ,UAAUkK,OAAS,SAAUD,EAAW1F,EAAKuC,GACvD1F,KAAKqI,WAAa,EAClB,IAAIU,EAAW/I,KAAKsI,iBAAiBO,GAEjC7I,KAAKkE,SAAS6E,IAAaF,EAC7B7I,KAAKkE,SAAS6E,EAAW,GAAKrD,EAAG1F,KAAKkE,SAAS6E,EAAW,GAAI5F,GAE9DnD,KAAKkE,SAASqD,OAAOwB,EAAU,EAAGF,EAAW1F,IASjDrB,EAAKsG,OAAOxJ,UAAUoK,UAAY,WAChC,GAAIhJ,KAAKqI,WAAY,OAAOrI,KAAKqI,WAKjC,IAHA,IAAIY,EAAe,EACfC,EAAiBlJ,KAAKkE,SAASzE,OAE1BzC,EAAI,EAAGA,EAAIkM,EAAgBlM,GAAK,EAAG,CAC1C,IAAImG,EAAMnD,KAAKkE,SAASlH,GACxBiM,GAAgB9F,EAAMA,EAGxB,OAAOnD,KAAKqI,WAAajD,KAAK+D,KAAKF,IASrCnH,EAAKsG,OAAOxJ,UAAUwK,IAAM,SAAUC,GAOpC,IANA,IAAIC,EAAa,EACb7E,EAAIzE,KAAKkE,SAAUQ,EAAI2E,EAAYnF,SACnCqF,EAAO9E,EAAEhF,OAAQ+J,EAAO9E,EAAEjF,OAC1BgK,EAAO,EAAGC,EAAO,EACjB1M,EAAI,EAAG6K,EAAI,EAER7K,EAAIuM,GAAQ1B,EAAI2B,IACrBC,EAAOhF,EAAEzH,KAAI0M,EAAOhF,EAAEmD,IAEpB7K,GAAK,EACIyM,EAAOC,EAChB7B,GAAK,EACI4B,GAAQC,IACjBJ,GAAc7E,EAAEzH,EAAI,GAAK0H,EAAEmD,EAAI,GAC/B7K,GAAK,EACL6K,GAAK,GAIT,OAAOyB,GAUTxH,EAAKsG,OAAOxJ,UAAU+K,WAAa,SAAUN,GAC3C,OAAOrJ,KAAKoJ,IAAIC,GAAerJ,KAAKgJ,aAAe,GAQrDlH,EAAKsG,OAAOxJ,UAAUgL,QAAU,WAG9B,IAFA,IAAIC,EAAS,IAAIzG,MAAOpD,KAAKkE,SAASzE,OAAS,GAEtCzC,EAAI,EAAG6K,EAAI,EAAG7K,EAAIgD,KAAKkE,SAASzE,OAAQzC,GAAK,EAAG6K,IACvDgC,EAAOhC,GAAK7H,KAAKkE,SAASlH,GAG5B,OAAO6M,GAQT/H,EAAKsG,OAAOxJ,UAAUuJ,OAAS,WAC7B,OAAOnI,KAAKkE;;;;;IAoBdpC,EAAKQ,SACCjC,EAAY,CACZ,QAAY,MACZ,OAAW,OACX,KAAS,OACT,KAAS,OACT,KAAS,MACT,IAAQ,MACR,KAAS,KACT,MAAU,MACV,IAAQ,IACR,MAAU,MACV,QAAY,MACZ,MAAU,MACV,KAAS,MACT,MAAU,KACV,QAAY,MACZ,QAAY,MACZ,QAAY,MACZ,MAAU,KACV,MAAU,MACV,OAAW,MACX,KAAS,OAGXC,EAAY,CACV,MAAU,KACV,MAAU,GACV,MAAU,KACV,MAAU,KACV,KAAS,KACT,IAAQ,GACR,KAAS,IAIXC,EAAI,WACJC,EAAInD,qBAQFoD,EAAU,IAAIqJ,OALT,4DAMLpJ,EAAU,IAAIoJ,OAJT,8FAKLnJ,EAAU,IAAImJ,OANT,gFAOLlJ,EAAS,IAAIkJ,OALT,kCAOJjJ,EAAQ,kBACRC,EAAS,iBACTC,EAAQ,aACRC,EAAS,kBACTC,EAAU,KACVC,EAAW,cACXC,EAAW,IAAI2I,OAAO,sBACtB1I,EAAW,IAAI0I,OAAO,IAAMtJ,EAAID,EAAI,gBAEpCc,EAAQ,mBACRC,EAAO,2IAEPC,EAAO,iDAEPC,EAAO,sFACPC,EAAQ,oBAERC,EAAO,WACPC,EAAS,MACTC,EAAQ,IAAIkI,OAAO,IAAMtJ,EAAID,EAAI,gBAEjCsB,EAAgB,SAAuBkI,GACzC,IAAIC,EACFC,EACAC,EACAC,EACAC,EACAC,EACAC,EAEF,GAAIP,EAAEtK,OAAS,EAAK,OAAOsK,EAiB3B,GAde,MADfG,EAAUH,EAAEQ,OAAO,EAAE,MAEnBR,EAAIG,EAAQM,cAAgBT,EAAEQ,OAAO,IAKvCH,EAAMtJ,GADNqJ,EAAKtJ,GAGE4J,KAAKV,GAAMA,EAAIA,EAAEjK,QAAQqK,EAAG,QAC1BC,EAAIK,KAAKV,KAAMA,EAAIA,EAAEjK,QAAQsK,EAAI,SAI1CA,EAAMpJ,GADNmJ,EAAKpJ,GAEE0J,KAAKV,GAAI,CACd,IAAIW,EAAKP,EAAG9K,KAAK0K,IACjBI,EAAK1J,GACEgK,KAAKC,EAAG,MACbP,EAAKlJ,EACL8I,EAAIA,EAAEjK,QAAQqK,EAAG,UAEVC,EAAIK,KAAKV,KAElBC,GADIU,EAAKN,EAAI/K,KAAK0K,IACR,IACVK,EAAMxJ,GACE6J,KAAKT,KAGXK,EAAMlJ,EACNmJ,EAAMlJ,GAFNgJ,EAAMlJ,GAGEuJ,KAJRV,EAAIC,GAIeD,GAAQ,IAClBM,EAAII,KAAKV,IAAMI,EAAKlJ,EAAS8I,EAAIA,EAAEjK,QAAQqK,EAAG,KAC9CG,EAAIG,KAAKV,KAAMA,GAAQ,OAiFpC,OA5EAI,EAAK9I,GACEoJ,KAAKV,KAGVA,GADAC,GADIU,EAAKP,EAAG9K,KAAK0K,IACP,IACC,MAIbI,EAAK7I,GACEmJ,KAAKV,KAEVC,GADIU,EAAKP,EAAG9K,KAAK0K,IACP,GACVE,EAASS,EAAG,IACZP,EAAK1J,GACEgK,KAAKT,KACVD,EAAIC,EAAO3J,EAAU4J,MAKzBE,EAAK5I,GACEkJ,KAAKV,KAEVC,GADIU,EAAKP,EAAG9K,KAAK0K,IACP,GACVE,EAASS,EAAG,IACZP,EAAK1J,GACEgK,KAAKT,KACVD,EAAIC,EAAO1J,EAAU2J,KAMzBG,EAAM3I,GADN0I,EAAK3I,GAEEiJ,KAAKV,IAEVC,GADIU,EAAKP,EAAG9K,KAAK0K,IACP,IACVI,EAAKzJ,GACE+J,KAAKT,KACVD,EAAIC,IAEGI,EAAIK,KAAKV,KAElBC,GADIU,EAAKN,EAAI/K,KAAK0K,IACR,GAAKW,EAAG,IAClBN,EAAM1J,GACE+J,KAAKT,KACXD,EAAIC,KAKRG,EAAKzI,GACE+I,KAAKV,KAEVC,GADIU,EAAKP,EAAG9K,KAAK0K,IACP,GAEVK,EAAMzJ,EACN0J,EAAMzI,IAFNuI,EAAKzJ,GAGE+J,KAAKT,IAAUI,EAAIK,KAAKT,KAAWK,EAAII,KAAKT,MACjDD,EAAIC,IAKRI,EAAM1J,GADNyJ,EAAKxI,GAEE8I,KAAKV,IAAMK,EAAIK,KAAKV,KACzBI,EAAKlJ,EACL8I,EAAIA,EAAEjK,QAAQqK,EAAG,KAKJ,KAAXD,IACFH,EAAIG,EAAQrE,cAAgBkE,EAAEQ,OAAO,IAGhCR,GAGF,SAAU9B,GACf,OAAOA,EAAMxC,OAAO5D,KAIxBC,EAAKwE,SAASG,iBAAiB3E,EAAKQ,QAAS;;;;IAmB7CR,EAAK6I,uBAAyB,SAAUC,GACtC,IAAIC,EAAQD,EAAUE,QAAO,SAAUlD,EAAMmD,GAE3C,OADAnD,EAAKmD,GAAYA,EACVnD,IACN,IAEH,OAAO,SAAUK,GACf,GAAIA,GAAS4C,EAAM5C,EAAMjF,cAAgBiF,EAAMjF,WAAY,OAAOiF,IAiBtEnG,EAAKO,eAAiBP,EAAK6I,uBAAuB,CAChD,IACA,OACA,QACA,SACA,QACA,MACA,SACA,OACA,KACA,QACA,KACA,MACA,MACA,MACA,KACA,KACA,KACA,UACA,OACA,MACA,KACA,MACA,SACA,QACA,OACA,MACA,KACA,OACA,SACA,OACA,OACA,QACA,MACA,OACA,MACA,MACA,MACA,MACA,OACA,KACA,MACA,OACA,MACA,MACA,MACA,UACA,IACA,KACA,KACA,OACA,KACA,KACA,MACA,OACA,QACA,MACA,OACA,SACA,MACA,KACA,QACA,OACA,OACA,KACA,UACA,KACA,MACA,MACA,KACA,MACA,QACA,KACA,OACA,KACA,QACA,MACA,MACA,SACA,OACA,MACA,OACA,MACA,SACA,QACA,KACA,OACA,OACA,OACA,MACA,QACA,OACA,OACA,QACA,QACA,OACA,OACA,MACA,KACA,MACA,OACA,KACA,QACA,MACA,KACA,OACA,OACA,OACA,QACA,QACA,QACA,MACA,OACA,MACA,OACA,OACA,QACA,MACA,MACA,SAGF7I,EAAKwE,SAASG,iBAAiB3E,EAAKO,eAAgB;;;;IAqBpDP,EAAKM,QAAU,SAAU6F,GACvB,OAAOA,EAAMxC,QAAO,SAAU1G,GAC5B,OAAOA,EAAEe,QAAQ,OAAQ,IAAIA,QAAQ,OAAQ,QAIjDgC,EAAKwE,SAASG,iBAAiB3E,EAAKM,QAAS;;;;IA2B7CN,EAAKkJ,SAAW,WACdhL,KAAKiL,OAAQ,EACbjL,KAAKkL,MAAQ,GACblL,KAAKmL,GAAKrJ,EAAKkJ,SAASI,QACxBtJ,EAAKkJ,SAASI,SAAW,GAW3BtJ,EAAKkJ,SAASI,QAAU,EASxBtJ,EAAKkJ,SAASK,UAAY,SAAUC,GAGlC,IAFA,IAAItJ,EAAU,IAAIF,EAAKkJ,SAAS/I,QAEvBjF,EAAI,EAAG8I,EAAMwF,EAAI7L,OAAQzC,EAAI8I,EAAK9I,IACzCgF,EAAQ4G,OAAO0C,EAAItO,IAIrB,OADAgF,EAAQuJ,SACDvJ,EAAQwJ,MAYjB1J,EAAKkJ,SAASS,WAAa,SAAUC,GACnC,MAAI,iBAAkBA,EACb5J,EAAKkJ,SAASW,gBAAgBD,EAAOE,KAAMF,EAAOG,cAElD/J,EAAKkJ,SAASnH,WAAW6H,EAAOE,OAmB3C9J,EAAKkJ,SAASW,gBAAkB,SAAUxM,EAAK0M,GAS7C,IARA,IAAIL,EAAO,IAAI1J,EAAKkJ,SAEhBc,EAAQ,CAAC,CACXC,KAAMP,EACNQ,eAAgBH,EAChB1M,IAAKA,IAGA2M,EAAMrM,QAAQ,CACnB,IAAIwM,EAAQH,EAAMI,MAGlB,GAAID,EAAM9M,IAAIM,OAAS,EAAG,CACxB,IACI0M,EADAC,EAAOH,EAAM9M,IAAIgH,OAAO,GAGxBiG,KAAQH,EAAMF,KAAKb,MACrBiB,EAAaF,EAAMF,KAAKb,MAAMkB,IAE9BD,EAAa,IAAIrK,EAAKkJ,SACtBiB,EAAMF,KAAKb,MAAMkB,GAAQD,GAGH,GAApBF,EAAM9M,IAAIM,SACZ0M,EAAWlB,OAAQ,GAGrBa,EAAMjH,KAAK,CACTkH,KAAMI,EACNH,eAAgBC,EAAMD,eACtB7M,IAAK8M,EAAM9M,IAAImE,MAAM,KAIzB,GAA4B,GAAxB2I,EAAMD,eAAV,CAKA,GAAI,MAAOC,EAAMF,KAAKb,MACpB,IAAImB,EAAgBJ,EAAMF,KAAKb,MAAM,SAChC,CACDmB,EAAgB,IAAIvK,EAAKkJ,SAC7BiB,EAAMF,KAAKb,MAAM,KAAOmB,EAiC1B,GA9BwB,GAApBJ,EAAM9M,IAAIM,SACZ4M,EAAcpB,OAAQ,GAGxBa,EAAMjH,KAAK,CACTkH,KAAMM,EACNL,eAAgBC,EAAMD,eAAiB,EACvC7M,IAAK8M,EAAM9M,MAMT8M,EAAM9M,IAAIM,OAAS,GACrBqM,EAAMjH,KAAK,CACTkH,KAAME,EAAMF,KACZC,eAAgBC,EAAMD,eAAiB,EACvC7M,IAAK8M,EAAM9M,IAAImE,MAAM,KAMD,GAApB2I,EAAM9M,IAAIM,SACZwM,EAAMF,KAAKd,OAAQ,GAMjBgB,EAAM9M,IAAIM,QAAU,EAAG,CACzB,GAAI,MAAOwM,EAAMF,KAAKb,MACpB,IAAIoB,EAAmBL,EAAMF,KAAKb,MAAM,SACnC,CACDoB,EAAmB,IAAIxK,EAAKkJ,SAChCiB,EAAMF,KAAKb,MAAM,KAAOoB,EAGF,GAApBL,EAAM9M,IAAIM,SACZ6M,EAAiBrB,OAAQ,GAG3Ba,EAAMjH,KAAK,CACTkH,KAAMO,EACNN,eAAgBC,EAAMD,eAAiB,EACvC7M,IAAK8M,EAAM9M,IAAImE,MAAM,KAOzB,GAAI2I,EAAM9M,IAAIM,OAAS,EAAG,CACxB,IAEI8M,EAFAC,EAAQP,EAAM9M,IAAIgH,OAAO,GACzBsG,EAAQR,EAAM9M,IAAIgH,OAAO,GAGzBsG,KAASR,EAAMF,KAAKb,MACtBqB,EAAgBN,EAAMF,KAAKb,MAAMuB,IAEjCF,EAAgB,IAAIzK,EAAKkJ,SACzBiB,EAAMF,KAAKb,MAAMuB,GAASF,GAGJ,GAApBN,EAAM9M,IAAIM,SACZ8M,EAActB,OAAQ,GAGxBa,EAAMjH,KAAK,CACTkH,KAAMQ,EACNP,eAAgBC,EAAMD,eAAiB,EACvC7M,IAAKqN,EAAQP,EAAM9M,IAAImE,MAAM,OAKnC,OAAOkI,GAaT1J,EAAKkJ,SAASnH,WAAa,SAAU1E,GAYnC,IAXA,IAAI4M,EAAO,IAAIjK,EAAKkJ,SAChBQ,EAAOO,EAUF/O,EAAI,EAAG8I,EAAM3G,EAAIM,OAAQzC,EAAI8I,EAAK9I,IAAK,CAC9C,IAAIoP,EAAOjN,EAAInC,GACXiO,EAASjO,GAAK8I,EAAM,EAExB,GAAY,KAARsG,EACFL,EAAKb,MAAMkB,GAAQL,EACnBA,EAAKd,MAAQA,MAER,CACL,IAAIyB,EAAO,IAAI5K,EAAKkJ,SACpB0B,EAAKzB,MAAQA,EAEbc,EAAKb,MAAMkB,GAAQM,EACnBX,EAAOW,GAIX,OAAOlB,GAaT1J,EAAKkJ,SAASpM,UAAUgL,QAAU,WAQhC,IAPA,IAAIiB,EAAQ,GAERiB,EAAQ,CAAC,CACXa,OAAQ,GACRZ,KAAM/L,OAGD8L,EAAMrM,QAAQ,CACnB,IAAIwM,EAAQH,EAAMI,MACdhB,EAAQxN,OAAOwF,KAAK+I,EAAMF,KAAKb,OAC/BpF,EAAMoF,EAAMzL,OAEZwM,EAAMF,KAAKd,QAKbgB,EAAMU,OAAOxG,OAAO,GACpB0E,EAAMhG,KAAKoH,EAAMU,SAGnB,IAAK,IAAI3P,EAAI,EAAGA,EAAI8I,EAAK9I,IAAK,CAC5B,IAAI4P,EAAO1B,EAAMlO,GAEjB8O,EAAMjH,KAAK,CACT8H,OAAQV,EAAMU,OAAO7H,OAAO8H,GAC5Bb,KAAME,EAAMF,KAAKb,MAAM0B,MAK7B,OAAO/B,GAaT/I,EAAKkJ,SAASpM,UAAUoE,SAAW,WASjC,GAAIhD,KAAK6M,KACP,OAAO7M,KAAK6M,KAOd,IAJA,IAAI1N,EAAMa,KAAKiL,MAAQ,IAAM,IACzB6B,EAASpP,OAAOwF,KAAKlD,KAAKkL,OAAO6B,OACjCjH,EAAMgH,EAAOrN,OAERzC,EAAI,EAAGA,EAAI8I,EAAK9I,IAAK,CAC5B,IAAI0J,EAAQoG,EAAO9P,GAGnBmC,EAAMA,EAAMuH,EAFD1G,KAAKkL,MAAMxE,GAEGyE,GAG3B,OAAOhM,GAaT2C,EAAKkJ,SAASpM,UAAUwF,UAAY,SAAUM,GAU5C,IATA,IAAImF,EAAS,IAAI/H,EAAKkJ,SAClBiB,OAAQjI,EAER8H,EAAQ,CAAC,CACXkB,MAAOtI,EACPmF,OAAQA,EACRkC,KAAM/L,OAGD8L,EAAMrM,QAAQ,CACnBwM,EAAQH,EAAMI,MAWd,IALA,IAAIe,EAASvP,OAAOwF,KAAK+I,EAAMe,MAAM9B,OACjCgC,EAAOD,EAAOxN,OACd0N,EAASzP,OAAOwF,KAAK+I,EAAMF,KAAKb,OAChCkC,EAAOD,EAAO1N,OAET4N,EAAI,EAAGA,EAAIH,EAAMG,IAGxB,IAFA,IAAIC,EAAQL,EAAOI,GAEV5O,EAAI,EAAGA,EAAI2O,EAAM3O,IAAK,CAC7B,IAAI8O,EAAQJ,EAAO1O,GAEnB,GAAI8O,GAASD,GAAkB,KAATA,EAAc,CAClC,IAAIvB,EAAOE,EAAMF,KAAKb,MAAMqC,GACxBP,EAAQf,EAAMe,MAAM9B,MAAMoC,GAC1BrC,EAAQc,EAAKd,OAAS+B,EAAM/B,MAC5ByB,OAAO1I,EAEPuJ,KAAStB,EAAMpC,OAAOqB,OAIxBwB,EAAOT,EAAMpC,OAAOqB,MAAMqC,IACrBtC,MAAQyB,EAAKzB,OAASA,IAM3ByB,EAAO,IAAI5K,EAAKkJ,UACXC,MAAQA,EACbgB,EAAMpC,OAAOqB,MAAMqC,GAASb,GAG9BZ,EAAMjH,KAAK,CACTmI,MAAOA,EACPnD,OAAQ6C,EACRX,KAAMA,MAOhB,OAAOlC,GAET/H,EAAKkJ,SAAS/I,QAAU,WACtBjC,KAAKwN,aAAe,GACpBxN,KAAKwL,KAAO,IAAI1J,EAAKkJ,SACrBhL,KAAKyN,eAAiB,GACtBzN,KAAK0N,eAAiB,IAGxB5L,EAAKkJ,SAAS/I,QAAQrD,UAAUgK,OAAS,SAAU+E,GACjD,IAAI5B,EACA6B,EAAe,EAEnB,GAAID,EAAO3N,KAAKwN,aACd,MAAM,IAAIxG,MAAO,+BAGnB,IAAK,IAAIhK,EAAI,EAAGA,EAAI2Q,EAAKlO,QAAUzC,EAAIgD,KAAKwN,aAAa/N,QACnDkO,EAAK3Q,IAAMgD,KAAKwN,aAAaxQ,GAD8BA,IAE/D4Q,IAGF5N,KAAK6N,SAASD,GAGZ7B,EADgC,GAA9B/L,KAAKyN,eAAehO,OACfO,KAAKwL,KAELxL,KAAKyN,eAAezN,KAAKyN,eAAehO,OAAS,GAAGqO,MAG7D,IAAS9Q,EAAI4Q,EAAc5Q,EAAI2Q,EAAKlO,OAAQzC,IAAK,CAC/C,IAAI+Q,EAAW,IAAIjM,EAAKkJ,SACpBoB,EAAOuB,EAAK3Q,GAEhB+O,EAAKb,MAAMkB,GAAQ2B,EAEnB/N,KAAKyN,eAAe5I,KAAK,CACvBmJ,OAAQjC,EACRK,KAAMA,EACN0B,MAAOC,IAGThC,EAAOgC,EAGThC,EAAKd,OAAQ,EACbjL,KAAKwN,aAAeG,GAGtB7L,EAAKkJ,SAAS/I,QAAQrD,UAAU2M,OAAS,WACvCvL,KAAK6N,SAAS,IAGhB/L,EAAKkJ,SAAS/I,QAAQrD,UAAUiP,SAAW,SAAUI,GACnD,IAAK,IAAIjR,EAAIgD,KAAKyN,eAAehO,OAAS,EAAGzC,GAAKiR,EAAQjR,IAAK,CAC7D,IAAI+O,EAAO/L,KAAKyN,eAAezQ,GAC3BkR,EAAWnC,EAAK+B,MAAM9K,WAEtBkL,KAAYlO,KAAK0N,eACnB3B,EAAKiC,OAAO9C,MAAMa,EAAKK,MAAQpM,KAAK0N,eAAeQ,IAInDnC,EAAK+B,MAAMjB,KAAOqB,EAElBlO,KAAK0N,eAAeQ,GAAYnC,EAAK+B,OAGvC9N,KAAKyN,eAAevB;;;;IAwBxBpK,EAAKqM,MAAQ,SAAUC,GACrBpO,KAAKqO,cAAgBD,EAAMC,cAC3BrO,KAAKsO,aAAeF,EAAME,aAC1BtO,KAAKuO,SAAWH,EAAMG,SACtBvO,KAAKwO,OAASJ,EAAMI,OACpBxO,KAAKkC,SAAWkM,EAAMlM,UA0ExBJ,EAAKqM,MAAMvP,UAAU6P,OAAS,SAAUC,GACtC,OAAO1O,KAAK2O,OAAM,SAAUA,GACb,IAAI7M,EAAK8M,YAAYF,EAAaC,GACxCE,YA6BX/M,EAAKqM,MAAMvP,UAAU+P,MAAQ,SAAUjJ,GAoBrC,IAZA,IAAIiJ,EAAQ,IAAI7M,EAAKgN,MAAM9O,KAAKwO,QAC5BO,EAAiBrR,OAAOY,OAAO,MAC/B0Q,EAAetR,OAAOY,OAAO,MAC7B2Q,EAAiBvR,OAAOY,OAAO,MAC/B4Q,EAAkBxR,OAAOY,OAAO,MAChC6Q,EAAoBzR,OAAOY,OAAO,MAO7BtB,EAAI,EAAGA,EAAIgD,KAAKwO,OAAO/O,OAAQzC,IACtCgS,EAAahP,KAAKwO,OAAOxR,IAAM,IAAI8E,EAAKsG,OAG1C1C,EAAGvI,KAAKwR,EAAOA,GAEf,IAAS3R,EAAI,EAAGA,EAAI2R,EAAMS,QAAQ3P,OAAQzC,IAAK,CAS7C,IAAI0O,EAASiD,EAAMS,QAAQpS,GACvBqS,EAAQ,KACRC,EAAgBxN,EAAKmC,IAAIE,SAG3BkL,EADE3D,EAAO6D,YACDvP,KAAKkC,SAAS8F,UAAU0D,EAAOE,KAAM,CAC3C4C,OAAQ9C,EAAO8C,SAGT,CAAC9C,EAAOE,MAGlB,IAAK,IAAIxO,EAAI,EAAGA,EAAIiS,EAAM5P,OAAQrC,IAAK,CACrC,IAAIwO,EAAOyD,EAAMjS,GAQjBsO,EAAOE,KAAOA,EAOd,IAAI4D,EAAe1N,EAAKkJ,SAASS,WAAWC,GACxC+D,EAAgBzP,KAAKuO,SAASnK,UAAUoL,GAAc5F,UAQ1D,GAA6B,IAAzB6F,EAAchQ,QAAgBiM,EAAOgE,WAAa5N,EAAKgN,MAAMY,SAASC,SAAU,CAClF,IAAK,IAAI5H,EAAI,EAAGA,EAAI2D,EAAO8C,OAAO/O,OAAQsI,IAAK,CAE7CmH,EADIU,EAAQlE,EAAO8C,OAAOzG,IACDjG,EAAKmC,IAAIO,MAGpC,MAGF,IAAK,IAAIqD,EAAI,EAAGA,EAAI4H,EAAchQ,OAAQoI,IAKxC,KAAIgI,EAAeJ,EAAc5H,GAC7B7C,EAAUhF,KAAKqO,cAAcwB,GAC7BC,EAAY9K,EAAQ+K,OAExB,IAAShI,EAAI,EAAGA,EAAI2D,EAAO8C,OAAO/O,OAAQsI,IAAK,CAS7C,IACIiI,EAAehL,EADf4K,EAAQlE,EAAO8C,OAAOzG,IAEtBkI,EAAuBvS,OAAOwF,KAAK8M,GACnCE,EAAYL,EAAe,IAAMD,EACjCO,EAAuB,IAAIrO,EAAKmC,IAAIgM,GAoBxC,GAbIvE,EAAOgE,UAAY5N,EAAKgN,MAAMY,SAASC,WACzCL,EAAgBA,EAAchL,MAAM6L,QAELnM,IAA3BkL,EAAgBU,KAClBV,EAAgBU,GAAS9N,EAAKmC,IAAIE,WASlCuH,EAAOgE,UAAY5N,EAAKgN,MAAMY,SAASU,YA4B3C,GANApB,EAAaY,GAAO9G,OAAOgH,EAAWpE,EAAO2E,OAAO,SAAU5L,EAAGC,GAAK,OAAOD,EAAIC,MAM7EuK,EAAeiB,GAAnB,CAIA,IAAK,IAAIjT,EAAI,EAAGA,EAAIgT,EAAqBxQ,OAAQxC,IAAK,CAOpD,IAGIqT,EAHAC,EAAsBN,EAAqBhT,GAC3CuT,EAAmB,IAAI1O,EAAKyB,SAAUgN,EAAqBX,GAC3DpK,EAAWwK,EAAaO,QAG4BvM,KAAnDsM,EAAavB,EAAeyB,IAC/BzB,EAAeyB,GAAoB,IAAI1O,EAAK2O,UAAWZ,EAAcD,EAAOpK,GAE5E8K,EAAWnO,IAAI0N,EAAcD,EAAOpK,GAKxCyJ,EAAeiB,IAAa,aAnDOlM,IAA7BmL,EAAkBS,KACpBT,EAAkBS,GAAS9N,EAAKmC,IAAIO,OAGtC2K,EAAkBS,GAAST,EAAkBS,GAAOtL,MAAM6L,KA0DlE,GAAIzE,EAAOgE,WAAa5N,EAAKgN,MAAMY,SAASC,SAC1C,IAAS5H,EAAI,EAAGA,EAAI2D,EAAO8C,OAAO/O,OAAQsI,IAAK,CAE7CmH,EADIU,EAAQlE,EAAO8C,OAAOzG,IACDmH,EAAgBU,GAAOxL,UAAUkL,IAUhE,IAAIoB,EAAqB5O,EAAKmC,IAAIE,SAC9BwM,EAAuB7O,EAAKmC,IAAIO,MAEpC,IAASxH,EAAI,EAAGA,EAAIgD,KAAKwO,OAAO/O,OAAQzC,IAAK,CAC3C,IAAI4S,EAEAV,EAFAU,EAAQ5P,KAAKwO,OAAOxR,MAGtB0T,EAAqBA,EAAmBtM,UAAU8K,EAAgBU,KAGhET,EAAkBS,KACpBe,EAAuBA,EAAqBrM,MAAM6K,EAAkBS,KAIxE,IAAIgB,EAAoBlT,OAAOwF,KAAK6L,GAChC8B,EAAU,GACVC,EAAUpT,OAAOY,OAAO,MAY5B,GAAIqQ,EAAMoC,YAAa,CACrBH,EAAoBlT,OAAOwF,KAAKlD,KAAKsO,cAErC,IAAStR,EAAI,EAAGA,EAAI4T,EAAkBnR,OAAQzC,IAAK,CAC7CwT,EAAmBI,EAAkB5T,GAAzC,IACI+G,EAAWjC,EAAKyB,SAASM,WAAW2M,GACxCzB,EAAeyB,GAAoB,IAAI1O,EAAK2O,WAIhD,IAASzT,EAAI,EAAGA,EAAI4T,EAAkBnR,OAAQzC,IAAK,CASjD,IACIwG,GADAO,EAAWjC,EAAKyB,SAASM,WAAW+M,EAAkB5T,KACpCwG,OAEtB,GAAKkN,EAAmBnM,SAASf,KAI7BmN,EAAqBpM,SAASf,GAAlC,CAIA,IAEIwN,EAFAC,EAAcjR,KAAKsO,aAAavK,GAChCmN,EAAQlC,EAAajL,EAASN,WAAWkG,WAAWsH,GAGxD,QAAqCjN,KAAhCgN,EAAWF,EAAQtN,IACtBwN,EAASE,OAASA,EAClBF,EAASG,UAAUC,QAAQrC,EAAehL,QACrC,CACL,IAAI3E,EAAQ,CACViS,IAAK7N,EACL0N,MAAOA,EACPC,UAAWpC,EAAehL,IAE5B+M,EAAQtN,GAAUpE,EAClByR,EAAQhM,KAAKzF,KAOjB,OAAOyR,EAAQ9D,MAAK,SAAUtI,EAAGC,GAC/B,OAAOA,EAAEwM,MAAQzM,EAAEyM,UAYvBpP,EAAKqM,MAAMvP,UAAUuJ,OAAS,WAC5B,IAAIkG,EAAgB3Q,OAAOwF,KAAKlD,KAAKqO,eAClCtB,OACAnH,KAAI,SAAUgG,GACb,MAAO,CAACA,EAAM5L,KAAKqO,cAAczC,MAChC5L,MAEDsO,EAAe5Q,OAAOwF,KAAKlD,KAAKsO,cACjC1I,KAAI,SAAUyL,GACb,MAAO,CAACA,EAAKrR,KAAKsO,aAAa+C,GAAKlJ,YACnCnI,MAEL,MAAO,CACLyC,QAASX,EAAKW,QACd+L,OAAQxO,KAAKwO,OACbF,aAAcA,EACdD,cAAeA,EACfnM,SAAUlC,KAAKkC,SAASiG,WAU5BrG,EAAKqM,MAAMvH,KAAO,SAAU0K,GAC1B,IAAIlD,EAAQ,GACRE,EAAe,GACfiD,EAAoBD,EAAgBhD,aACpCD,EAAgB3Q,OAAOY,OAAO,MAC9BkT,EAA0BF,EAAgBjD,cAC1CoD,EAAkB,IAAI3P,EAAKkJ,SAAS/I,QACpCC,EAAWJ,EAAKwE,SAASM,KAAK0K,EAAgBpP,UAE9CoP,EAAgB7O,SAAWX,EAAKW,SAClCX,EAAKY,MAAMC,KAAK,4EAA8Eb,EAAKW,QAAU,sCAAwC6O,EAAgB7O,QAAU,KAGjL,IAAK,IAAIzF,EAAI,EAAGA,EAAIuU,EAAkB9R,OAAQzC,IAAK,CACjD,IACIqU,GADAK,EAAQH,EAAkBvU,IACd,GACZkH,EAAWwN,EAAM,GAErBpD,EAAa+C,GAAO,IAAIvP,EAAKsG,OAAOlE,GAGtC,IAASlH,EAAI,EAAGA,EAAIwU,EAAwB/R,OAAQzC,IAAK,CACvD,IAAI0U,EACA9F,GADA8F,EAAQF,EAAwBxU,IACnB,GACbgI,EAAU0M,EAAM,GAEpBD,EAAgB7I,OAAOgD,GACvByC,EAAczC,GAAQ5G,EAYxB,OATAyM,EAAgBlG,SAEhB6C,EAAMI,OAAS8C,EAAgB9C,OAE/BJ,EAAME,aAAeA,EACrBF,EAAMC,cAAgBA,EACtBD,EAAMG,SAAWkD,EAAgBjG,KACjC4C,EAAMlM,SAAWA,EAEV,IAAIJ,EAAKqM,MAAMC;;;;IA+BxBtM,EAAKG,QAAU,WACbjC,KAAK2R,KAAO,KACZ3R,KAAK4R,QAAUlU,OAAOY,OAAO,MAC7B0B,KAAK6R,WAAanU,OAAOY,OAAO,MAChC0B,KAAKqO,cAAgB3Q,OAAOY,OAAO,MACnC0B,KAAK8R,qBAAuB,GAC5B9R,KAAK+R,aAAe,GACpB/R,KAAK2F,UAAY7D,EAAK6D,UACtB3F,KAAKkC,SAAW,IAAIJ,EAAKwE,SACzBtG,KAAKuC,eAAiB,IAAIT,EAAKwE,SAC/BtG,KAAKiF,cAAgB,EACrBjF,KAAKgS,GAAK,IACVhS,KAAKiS,IAAM,IACXjS,KAAK8P,UAAY,EACjB9P,KAAKkS,kBAAoB,IAe3BpQ,EAAKG,QAAQrD,UAAUyS,IAAM,SAAUA,GACrCrR,KAAK2R,KAAON,GAmCdvP,EAAKG,QAAQrD,UAAUgR,MAAQ,SAAUnM,EAAW0O,GAClD,GAAI,KAAK1H,KAAKhH,GACZ,MAAM,IAAI2O,WAAY,UAAY3O,EAAY,oCAGhDzD,KAAK4R,QAAQnO,GAAa0O,GAAc,IAW1CrQ,EAAKG,QAAQrD,UAAU8F,EAAI,SAAU2N,GAEjCrS,KAAKgS,GADHK,EAAS,EACD,EACDA,EAAS,EACR,EAEAA,GAWdvQ,EAAKG,QAAQrD,UAAU0T,GAAK,SAAUD,GACpCrS,KAAKiS,IAAMI,GAoBbvQ,EAAKG,QAAQrD,UAAUuD,IAAM,SAAUoQ,EAAKJ,GAC1C,IAAI3O,EAAS+O,EAAIvS,KAAK2R,MAClBnD,EAAS9Q,OAAOwF,KAAKlD,KAAK4R,SAE9B5R,KAAK6R,WAAWrO,GAAU2O,GAAc,GACxCnS,KAAKiF,eAAiB,EAEtB,IAAK,IAAIjI,EAAI,EAAGA,EAAIwR,EAAO/O,OAAQzC,IAAK,CACtC,IAAIyG,EAAY+K,EAAOxR,GACnBwV,EAAYxS,KAAK4R,QAAQnO,GAAW+O,UACpC5C,EAAQ4C,EAAYA,EAAUD,GAAOA,EAAI9O,GACzCsC,EAAS/F,KAAK2F,UAAUiK,EAAO,CAC7BpB,OAAQ,CAAC/K,KAEX4L,EAAQrP,KAAKkC,SAASwF,IAAI3B,GAC1BhC,EAAW,IAAIjC,EAAKyB,SAAUC,EAAQC,GACtCgP,EAAa/U,OAAOY,OAAO,MAE/B0B,KAAK8R,qBAAqB/N,GAAY0O,EACtCzS,KAAK+R,aAAahO,GAAY,EAG9B/D,KAAK+R,aAAahO,IAAasL,EAAM5P,OAGrC,IAAK,IAAIoI,EAAI,EAAGA,EAAIwH,EAAM5P,OAAQoI,IAAK,CACrC,IAAI+D,EAAOyD,EAAMxH,GAUjB,GARwB7D,MAApByO,EAAW7G,KACb6G,EAAW7G,GAAQ,GAGrB6G,EAAW7G,IAAS,EAIY5H,MAA5BhE,KAAKqO,cAAczC,GAAoB,CACzC,IAAI5G,EAAUtH,OAAOY,OAAO,MAC5B0G,EAAgB,OAAIhF,KAAK8P,UACzB9P,KAAK8P,WAAa,EAElB,IAAK,IAAI/H,EAAI,EAAGA,EAAIyG,EAAO/O,OAAQsI,IACjC/C,EAAQwJ,EAAOzG,IAAMrK,OAAOY,OAAO,MAGrC0B,KAAKqO,cAAczC,GAAQ5G,EAIsBhB,MAA/ChE,KAAKqO,cAAczC,GAAMnI,GAAWD,KACtCxD,KAAKqO,cAAczC,GAAMnI,GAAWD,GAAU9F,OAAOY,OAAO,OAK9D,IAAK,IAAIrB,EAAI,EAAGA,EAAI+C,KAAKkS,kBAAkBzS,OAAQxC,IAAK,CACtD,IAAIyV,EAAc1S,KAAKkS,kBAAkBjV,GACrCuI,EAAWoG,EAAKpG,SAASkN,GAEmC1O,MAA5DhE,KAAKqO,cAAczC,GAAMnI,GAAWD,GAAQkP,KAC9C1S,KAAKqO,cAAczC,GAAMnI,GAAWD,GAAQkP,GAAe,IAG7D1S,KAAKqO,cAAczC,GAAMnI,GAAWD,GAAQkP,GAAa7N,KAAKW,OAYtE1D,EAAKG,QAAQrD,UAAU+T,6BAA+B,WAOpD,IALA,IAAIC,EAAYlV,OAAOwF,KAAKlD,KAAK+R,cAC7Bc,EAAiBD,EAAUnT,OAC3BqT,EAAc,GACdC,EAAqB,GAEhB/V,EAAI,EAAGA,EAAI6V,EAAgB7V,IAAK,CACvC,IAAI+G,EAAWjC,EAAKyB,SAASM,WAAW+O,EAAU5V,IAC9C4S,EAAQ7L,EAASN,UAErBsP,EAAmBnD,KAAWmD,EAAmBnD,GAAS,GAC1DmD,EAAmBnD,IAAU,EAE7BkD,EAAYlD,KAAWkD,EAAYlD,GAAS,GAC5CkD,EAAYlD,IAAU5P,KAAK+R,aAAahO,GAG1C,IAAIyK,EAAS9Q,OAAOwF,KAAKlD,KAAK4R,SAE9B,IAAS5U,EAAI,EAAGA,EAAIwR,EAAO/O,OAAQzC,IAAK,CACtC,IAAIyG,EAAY+K,EAAOxR,GACvB8V,EAAYrP,GAAaqP,EAAYrP,GAAasP,EAAmBtP,GAGvEzD,KAAKgT,mBAAqBF,GAQ5BhR,EAAKG,QAAQrD,UAAUqU,mBAAqB,WAM1C,IALA,IAAI3E,EAAe,GACfsE,EAAYlV,OAAOwF,KAAKlD,KAAK8R,sBAC7BoB,EAAkBN,EAAUnT,OAC5B0T,EAAezV,OAAOY,OAAO,MAExBtB,EAAI,EAAGA,EAAIkW,EAAiBlW,IAAK,CAaxC,IAZA,IAAI+G,EAAWjC,EAAKyB,SAASM,WAAW+O,EAAU5V,IAC9CyG,EAAYM,EAASN,UACrB2P,EAAcpT,KAAK+R,aAAahO,GAChCkN,EAAc,IAAInP,EAAKsG,OACvBiL,EAAkBrT,KAAK8R,qBAAqB/N,GAC5CsL,EAAQ3R,OAAOwF,KAAKmQ,GACpBC,EAAcjE,EAAM5P,OAGpB8T,EAAavT,KAAK4R,QAAQnO,GAAW4M,OAAS,EAC9CmD,EAAWxT,KAAK6R,WAAW9N,EAASP,QAAQ6M,OAAS,EAEhDxI,EAAI,EAAGA,EAAIyL,EAAazL,IAAK,CACpC,IAGI9C,EAAKmM,EAAOuC,EAHZ7H,EAAOyD,EAAMxH,GACb6L,EAAKL,EAAgBzH,GACrBkE,EAAY9P,KAAKqO,cAAczC,GAAMmE,YAGd/L,IAAvBmP,EAAavH,IACf7G,EAAMjD,EAAKiD,IAAI/E,KAAKqO,cAAczC,GAAO5L,KAAKiF,eAC9CkO,EAAavH,GAAQ7G,GAErBA,EAAMoO,EAAavH,GAGrBsF,EAAQnM,IAAQ/E,KAAKiS,IAAM,GAAKyB,IAAO1T,KAAKiS,KAAO,EAAIjS,KAAKgS,GAAKhS,KAAKgS,IAAMoB,EAAcpT,KAAKgT,mBAAmBvP,KAAeiQ,GACjIxC,GAASqC,EACTrC,GAASsC,EACTC,EAAqBrO,KAAKuO,MAAc,IAARzC,GAAgB,IAQhDD,EAAYrI,OAAOkH,EAAW2D,GAGhCnF,EAAavK,GAAYkN,EAG3BjR,KAAKsO,aAAeA,GAQtBxM,EAAKG,QAAQrD,UAAUgV,eAAiB,WACtC5T,KAAKuO,SAAWzM,EAAKkJ,SAASK,UAC5B3N,OAAOwF,KAAKlD,KAAKqO,eAAetB,SAYpCjL,EAAKG,QAAQrD,UAAU4D,MAAQ,WAK7B,OAJAxC,KAAK2S,+BACL3S,KAAKiT,qBACLjT,KAAK4T,iBAEE,IAAI9R,EAAKqM,MAAM,CACpBE,cAAerO,KAAKqO,cACpBC,aAActO,KAAKsO,aACnBC,SAAUvO,KAAKuO,SACfC,OAAQ9Q,OAAOwF,KAAKlD,KAAK4R,SACzB1P,SAAUlC,KAAKuC,kBAkBnBT,EAAKG,QAAQrD,UAAUiV,IAAM,SAAUnO,GACrC,IAAIoO,EAAO1Q,MAAMxE,UAAU0E,MAAMnG,KAAK+J,UAAW,GACjD4M,EAAKC,QAAQ/T,MACb0F,EAAGsO,MAAMhU,KAAM8T,IAcjBhS,EAAK2O,UAAY,SAAU7E,EAAMgE,EAAOpK,GAStC,IARA,IAAIyO,EAAiBvW,OAAOY,OAAO,MAC/B4V,EAAexW,OAAOwF,KAAKsC,GAAY,IAOlCxI,EAAI,EAAGA,EAAIkX,EAAazU,OAAQzC,IAAK,CAC5C,IAAIuB,EAAM2V,EAAalX,GACvBiX,EAAe1V,GAAOiH,EAASjH,GAAK+E,QAGtCtD,KAAKwF,SAAW9H,OAAOY,OAAO,WAEjB0F,IAAT4H,IACF5L,KAAKwF,SAASoG,GAAQlO,OAAOY,OAAO,MACpC0B,KAAKwF,SAASoG,GAAMgE,GAASqE,IAajCnS,EAAK2O,UAAU7R,UAAUwS,QAAU,SAAU+C,GAG3C,IAFA,IAAI9E,EAAQ3R,OAAOwF,KAAKiR,EAAe3O,UAE9BxI,EAAI,EAAGA,EAAIqS,EAAM5P,OAAQzC,IAAK,CACrC,IAAI4O,EAAOyD,EAAMrS,GACbwR,EAAS9Q,OAAOwF,KAAKiR,EAAe3O,SAASoG,IAEtB5H,MAAvBhE,KAAKwF,SAASoG,KAChB5L,KAAKwF,SAASoG,GAAQlO,OAAOY,OAAO,OAGtC,IAAK,IAAIuJ,EAAI,EAAGA,EAAI2G,EAAO/O,OAAQoI,IAAK,CACtC,IAAI+H,EAAQpB,EAAO3G,GACf3E,EAAOxF,OAAOwF,KAAKiR,EAAe3O,SAASoG,GAAMgE,IAEnB5L,MAA9BhE,KAAKwF,SAASoG,GAAMgE,KACtB5P,KAAKwF,SAASoG,GAAMgE,GAASlS,OAAOY,OAAO,OAG7C,IAAK,IAAIyJ,EAAI,EAAGA,EAAI7E,EAAKzD,OAAQsI,IAAK,CACpC,IAAIxJ,EAAM2E,EAAK6E,GAEwB/D,MAAnChE,KAAKwF,SAASoG,GAAMgE,GAAOrR,GAC7ByB,KAAKwF,SAASoG,GAAMgE,GAAOrR,GAAO4V,EAAe3O,SAASoG,GAAMgE,GAAOrR,GAEvEyB,KAAKwF,SAASoG,GAAMgE,GAAOrR,GAAOyB,KAAKwF,SAASoG,GAAMgE,GAAOrR,GAAKuG,OAAOqP,EAAe3O,SAASoG,GAAMgE,GAAOrR,QAexHuD,EAAK2O,UAAU7R,UAAUuD,IAAM,SAAUyJ,EAAMgE,EAAOpK,GACpD,KAAMoG,KAAQ5L,KAAKwF,UAGjB,OAFAxF,KAAKwF,SAASoG,GAAQlO,OAAOY,OAAO,WACpC0B,KAAKwF,SAASoG,GAAMgE,GAASpK,GAI/B,GAAMoK,KAAS5P,KAAKwF,SAASoG,GAO7B,IAFA,IAAIsI,EAAexW,OAAOwF,KAAKsC,GAEtBxI,EAAI,EAAGA,EAAIkX,EAAazU,OAAQzC,IAAK,CAC5C,IAAIuB,EAAM2V,EAAalX,GAEnBuB,KAAOyB,KAAKwF,SAASoG,GAAMgE,GAC7B5P,KAAKwF,SAASoG,GAAMgE,GAAOrR,GAAOyB,KAAKwF,SAASoG,GAAMgE,GAAOrR,GAAKuG,OAAOU,EAASjH,IAElFyB,KAAKwF,SAASoG,GAAMgE,GAAOrR,GAAOiH,EAASjH,QAZ7CyB,KAAKwF,SAASoG,GAAMgE,GAASpK,GA2BjC1D,EAAKgN,MAAQ,SAAUsF,GACrBpU,KAAKoP,QAAU,GACfpP,KAAKoU,UAAYA,GA2BnBtS,EAAKgN,MAAMuF,SAAW,IAAIC,OAAQ,KAClCxS,EAAKgN,MAAMuF,SAASE,KAAO,EAC3BzS,EAAKgN,MAAMuF,SAASG,QAAU,EAC9B1S,EAAKgN,MAAMuF,SAASI,SAAW,EAa/B3S,EAAKgN,MAAMY,SAAW,CAIpBgF,SAAU,EAMV/E,SAAU,EAMVS,WAAY,GA0BdtO,EAAKgN,MAAMlQ,UAAU8M,OAAS,SAAUA,GA+BtC,MA9BM,WAAYA,IAChBA,EAAO8C,OAASxO,KAAKoU,WAGjB,UAAW1I,IACfA,EAAO2E,MAAQ,GAGX,gBAAiB3E,IACrBA,EAAO6D,aAAc,GAGjB,aAAc7D,IAClBA,EAAO2I,SAAWvS,EAAKgN,MAAMuF,SAASE,MAGnC7I,EAAO2I,SAAWvS,EAAKgN,MAAMuF,SAASG,SAAa9I,EAAOE,KAAKzF,OAAO,IAAMrE,EAAKgN,MAAMuF,WAC1F3I,EAAOE,KAAO,IAAMF,EAAOE,MAGxBF,EAAO2I,SAAWvS,EAAKgN,MAAMuF,SAASI,UAAc/I,EAAOE,KAAKtI,OAAO,IAAMxB,EAAKgN,MAAMuF,WAC3F3I,EAAOE,KAAYF,EAAOE,KAAO,KAG7B,aAAcF,IAClBA,EAAOgE,SAAW5N,EAAKgN,MAAMY,SAASgF,UAGxC1U,KAAKoP,QAAQvK,KAAK6G,GAEX1L,MAUT8B,EAAKgN,MAAMlQ,UAAUmS,UAAY,WAC/B,IAAK,IAAI/T,EAAI,EAAGA,EAAIgD,KAAKoP,QAAQ3P,OAAQzC,IACvC,GAAIgD,KAAKoP,QAAQpS,GAAG0S,UAAY5N,EAAKgN,MAAMY,SAASU,WAClD,OAAO,EAIX,OAAO,GA6BTtO,EAAKgN,MAAMlQ,UAAUgN,KAAO,SAAUA,EAAM+I,GAC1C,GAAIvR,MAAMC,QAAQuI,GAEhB,OADAA,EAAK9E,SAAQ,SAAU5I,GAAK8B,KAAK4L,KAAK1N,EAAG4D,EAAKY,MAAMO,MAAM0R,MAAa3U,MAChEA,KAGT,IAAI0L,EAASiJ,GAAW,GAKxB,OAJAjJ,EAAOE,KAAOA,EAAK5I,WAEnBhD,KAAK0L,OAAOA,GAEL1L,MAET8B,EAAK8S,gBAAkB,SAAUhS,EAAS2F,EAAOC,GAC/CxI,KAAKzC,KAAO,kBACZyC,KAAK4C,QAAUA,EACf5C,KAAKuI,MAAQA,EACbvI,KAAKwI,IAAMA,GAGb1G,EAAK8S,gBAAgBhW,UAAY,IAAIoI,MACrClF,EAAK+S,WAAa,SAAU1V,GAC1Ba,KAAK8U,QAAU,GACf9U,KAAKb,IAAMA,EACXa,KAAKP,OAASN,EAAIM,OAClBO,KAAKsH,IAAM,EACXtH,KAAKuI,MAAQ,EACbvI,KAAK+U,oBAAsB,IAG7BjT,EAAK+S,WAAWjW,UAAU8I,IAAM,WAG9B,IAFA,IAAIsN,EAAQlT,EAAK+S,WAAWI,QAErBD,GACLA,EAAQA,EAAMhV,OAIlB8B,EAAK+S,WAAWjW,UAAUsW,YAAc,WAKtC,IAJA,IAAIC,EAAY,GACZlP,EAAajG,KAAKuI,MAClBvC,EAAWhG,KAAKsH,IAEXtK,EAAI,EAAGA,EAAIgD,KAAK+U,oBAAoBtV,OAAQzC,IACnDgJ,EAAWhG,KAAK+U,oBAAoB/X,GACpCmY,EAAUtQ,KAAK7E,KAAKb,IAAImE,MAAM2C,EAAYD,IAC1CC,EAAaD,EAAW,EAM1B,OAHAmP,EAAUtQ,KAAK7E,KAAKb,IAAImE,MAAM2C,EAAYjG,KAAKsH,MAC/CtH,KAAK+U,oBAAoBtV,OAAS,EAE3B0V,EAAUC,KAAK,KAGxBtT,EAAK+S,WAAWjW,UAAUyW,KAAO,SAAUC,GACzCtV,KAAK8U,QAAQjQ,KAAK,CAChByQ,KAAMA,EACNnW,IAAKa,KAAKkV,cACV3M,MAAOvI,KAAKuI,MACZC,IAAKxI,KAAKsH,MAGZtH,KAAKuI,MAAQvI,KAAKsH,KAGpBxF,EAAK+S,WAAWjW,UAAU2W,gBAAkB,WAC1CvV,KAAK+U,oBAAoBlQ,KAAK7E,KAAKsH,IAAM,GACzCtH,KAAKsH,KAAO,GAGdxF,EAAK+S,WAAWjW,UAAU8N,KAAO,WAC/B,GAAI1M,KAAKsH,KAAOtH,KAAKP,OACnB,OAAOqC,EAAK+S,WAAWW,IAGzB,IAAIpJ,EAAOpM,KAAKb,IAAIgH,OAAOnG,KAAKsH,KAEhC,OADAtH,KAAKsH,KAAO,EACL8E,GAGTtK,EAAK+S,WAAWjW,UAAU6W,MAAQ,WAChC,OAAOzV,KAAKsH,IAAMtH,KAAKuI,OAGzBzG,EAAK+S,WAAWjW,UAAU8W,OAAS,WAC7B1V,KAAKuI,OAASvI,KAAKsH,MACrBtH,KAAKsH,KAAO,GAGdtH,KAAKuI,MAAQvI,KAAKsH,KAGpBxF,EAAK+S,WAAWjW,UAAU+W,OAAS,WACjC3V,KAAKsH,KAAO,GAGdxF,EAAK+S,WAAWjW,UAAUgX,eAAiB,WACzC,IAAIxJ,EAAMyJ,EAEV,GAEEA,GADAzJ,EAAOpM,KAAK0M,QACIhN,WAAW,SACpBmW,EAAW,IAAMA,EAAW,IAEjCzJ,GAAQtK,EAAK+S,WAAWW,KAC1BxV,KAAK2V,UAIT7T,EAAK+S,WAAWjW,UAAUkX,KAAO,WAC/B,OAAO9V,KAAKsH,IAAMtH,KAAKP,QAGzBqC,EAAK+S,WAAWW,IAAM,MACtB1T,EAAK+S,WAAWkB,MAAQ,QACxBjU,EAAK+S,WAAWmB,KAAO,OACvBlU,EAAK+S,WAAWoB,cAAgB,gBAChCnU,EAAK+S,WAAWqB,MAAQ,QACxBpU,EAAK+S,WAAWsB,SAAW,WAE3BrU,EAAK+S,WAAWuB,SAAW,SAAUC,GAInC,OAHAA,EAAMV,SACNU,EAAMhB,KAAKvT,EAAK+S,WAAWkB,OAC3BM,EAAMX,SACC5T,EAAK+S,WAAWI,SAGzBnT,EAAK+S,WAAWyB,QAAU,SAAUD,GAQlC,GAPIA,EAAMZ,QAAU,IAClBY,EAAMV,SACNU,EAAMhB,KAAKvT,EAAK+S,WAAWmB,OAG7BK,EAAMX,SAEFW,EAAMP,OACR,OAAOhU,EAAK+S,WAAWI,SAI3BnT,EAAK+S,WAAW0B,gBAAkB,SAAUF,GAI1C,OAHAA,EAAMX,SACNW,EAAMT,iBACNS,EAAMhB,KAAKvT,EAAK+S,WAAWoB,eACpBnU,EAAK+S,WAAWI,SAGzBnT,EAAK+S,WAAW2B,SAAW,SAAUH,GAInC,OAHAA,EAAMX,SACNW,EAAMT,iBACNS,EAAMhB,KAAKvT,EAAK+S,WAAWqB,OACpBpU,EAAK+S,WAAWI,SAGzBnT,EAAK+S,WAAW4B,OAAS,SAAUJ,GAC7BA,EAAMZ,QAAU,GAClBY,EAAMhB,KAAKvT,EAAK+S,WAAWmB,OAe/BlU,EAAK+S,WAAW6B,cAAgB5U,EAAK6D,UAAUS,UAE/CtE,EAAK+S,WAAWI,QAAU,SAAUoB,GAClC,OAAa,CACX,IAAIjK,EAAOiK,EAAM3J,OAEjB,GAAIN,GAAQtK,EAAK+S,WAAWW,IAC1B,OAAO1T,EAAK+S,WAAW4B,OAIzB,GAA0B,IAAtBrK,EAAK1M,WAAW,GAApB,CAKA,GAAY,KAAR0M,EACF,OAAOtK,EAAK+S,WAAWuB,SAGzB,GAAY,KAARhK,EAKF,OAJAiK,EAAMV,SACFU,EAAMZ,QAAU,GAClBY,EAAMhB,KAAKvT,EAAK+S,WAAWmB,MAEtBlU,EAAK+S,WAAW0B,gBAGzB,GAAY,KAARnK,EAKF,OAJAiK,EAAMV,SACFU,EAAMZ,QAAU,GAClBY,EAAMhB,KAAKvT,EAAK+S,WAAWmB,MAEtBlU,EAAK+S,WAAW2B,SAMzB,GAAY,KAARpK,GAAiC,IAAlBiK,EAAMZ,QAEvB,OADAY,EAAMhB,KAAKvT,EAAK+S,WAAWsB,UACpBrU,EAAK+S,WAAWI,QAMzB,GAAY,KAAR7I,GAAiC,IAAlBiK,EAAMZ,QAEvB,OADAY,EAAMhB,KAAKvT,EAAK+S,WAAWsB,UACpBrU,EAAK+S,WAAWI,QAGzB,GAAI7I,EAAKhN,MAAM0C,EAAK+S,WAAW6B,eAC7B,OAAO5U,EAAK+S,WAAWyB,aAzCvBD,EAAMd,oBA8CZzT,EAAK8M,YAAc,SAAUzP,EAAKwP,GAChC3O,KAAKqW,MAAQ,IAAIvU,EAAK+S,WAAY1V,GAClCa,KAAK2O,MAAQA,EACb3O,KAAK2W,cAAgB,GACrB3W,KAAK4W,UAAY,GAGnB9U,EAAK8M,YAAYhQ,UAAUiQ,MAAQ,WACjC7O,KAAKqW,MAAM3O,MACX1H,KAAK8U,QAAU9U,KAAKqW,MAAMvB,QAI1B,IAFA,IAAIE,EAAQlT,EAAK8M,YAAYiI,YAEtB7B,GACLA,EAAQA,EAAMhV,MAGhB,OAAOA,KAAK2O,OAGd7M,EAAK8M,YAAYhQ,UAAUkY,WAAa,WACtC,OAAO9W,KAAK8U,QAAQ9U,KAAK4W,YAG3B9U,EAAK8M,YAAYhQ,UAAUmY,cAAgB,WACzC,IAAIC,EAAShX,KAAK8W,aAElB,OADA9W,KAAK4W,WAAa,EACXI,GAGTlV,EAAK8M,YAAYhQ,UAAUqY,WAAa,WACtC,IAAIC,EAAkBlX,KAAK2W,cAC3B3W,KAAK2O,MAAMjD,OAAOwL,GAClBlX,KAAK2W,cAAgB,IAGvB7U,EAAK8M,YAAYiI,YAAc,SAAUM,GACvC,IAAIH,EAASG,EAAOL,aAEpB,GAAc9S,MAAVgT,EAIJ,OAAQA,EAAO1B,MACb,KAAKxT,EAAK+S,WAAWsB,SACnB,OAAOrU,EAAK8M,YAAYwI,cAC1B,KAAKtV,EAAK+S,WAAWkB,MACnB,OAAOjU,EAAK8M,YAAYyI,WAC1B,KAAKvV,EAAK+S,WAAWmB,KACnB,OAAOlU,EAAK8M,YAAY0I,UAC1B,QACE,IAAIC,EAAe,4CAA8CP,EAAO1B,KAMxE,MAJI0B,EAAO7X,IAAIM,QAAU,IACvB8X,GAAgB,gBAAkBP,EAAO7X,IAAM,KAG3C,IAAI2C,EAAK8S,gBAAiB2C,EAAcP,EAAOzO,MAAOyO,EAAOxO,OAIzE1G,EAAK8M,YAAYwI,cAAgB,SAAUD,GACzC,IAAIH,EAASG,EAAOJ,gBAEpB,GAAc/S,MAAVgT,EAAJ,CAIA,OAAQA,EAAO7X,KACb,IAAK,IACHgY,EAAOR,cAAcjH,SAAW5N,EAAKgN,MAAMY,SAASU,WACpD,MACF,IAAK,IACH+G,EAAOR,cAAcjH,SAAW5N,EAAKgN,MAAMY,SAASC,SACpD,MACF,QACE,IAAI4H,EAAe,kCAAoCP,EAAO7X,IAAM,IACpE,MAAM,IAAI2C,EAAK8S,gBAAiB2C,EAAcP,EAAOzO,MAAOyO,EAAOxO,KAGvE,IAAIgP,EAAaL,EAAOL,aAExB,GAAkB9S,MAAdwT,EAAyB,CACvBD,EAAe,yCACnB,MAAM,IAAIzV,EAAK8S,gBAAiB2C,EAAcP,EAAOzO,MAAOyO,EAAOxO,KAGrE,OAAQgP,EAAWlC,MACjB,KAAKxT,EAAK+S,WAAWkB,MACnB,OAAOjU,EAAK8M,YAAYyI,WAC1B,KAAKvV,EAAK+S,WAAWmB,KACnB,OAAOlU,EAAK8M,YAAY0I,UAC1B,QACMC,EAAe,mCAAqCC,EAAWlC,KAAO,IAC1E,MAAM,IAAIxT,EAAK8S,gBAAiB2C,EAAcC,EAAWjP,MAAOiP,EAAWhP,QAIjF1G,EAAK8M,YAAYyI,WAAa,SAAUF,GACtC,IAAIH,EAASG,EAAOJ,gBAEpB,GAAc/S,MAAVgT,EAAJ,CAIA,IAAmD,GAA/CG,EAAOxI,MAAMyF,UAAUtQ,QAAQkT,EAAO7X,KAAY,CACpD,IAAIsY,EAAiBN,EAAOxI,MAAMyF,UAAUxO,KAAI,SAAU8R,GAAK,MAAO,IAAMA,EAAI,OAAOtC,KAAK,MACxFmC,EAAe,uBAAyBP,EAAO7X,IAAM,uBAAyBsY,EAElF,MAAM,IAAI3V,EAAK8S,gBAAiB2C,EAAcP,EAAOzO,MAAOyO,EAAOxO,KAGrE2O,EAAOR,cAAcnI,OAAS,CAACwI,EAAO7X,KAEtC,IAAIqY,EAAaL,EAAOL,aAExB,GAAkB9S,MAAdwT,EAAyB,CACvBD,EAAe,gCACnB,MAAM,IAAIzV,EAAK8S,gBAAiB2C,EAAcP,EAAOzO,MAAOyO,EAAOxO,KAGrE,OAAQgP,EAAWlC,MACjB,KAAKxT,EAAK+S,WAAWmB,KACnB,OAAOlU,EAAK8M,YAAY0I,UAC1B,QACMC,EAAe,0BAA4BC,EAAWlC,KAAO,IACjE,MAAM,IAAIxT,EAAK8S,gBAAiB2C,EAAcC,EAAWjP,MAAOiP,EAAWhP,QAIjF1G,EAAK8M,YAAY0I,UAAY,SAAUH,GACrC,IAAIH,EAASG,EAAOJ,gBAEpB,GAAc/S,MAAVgT,EAAJ,CAIAG,EAAOR,cAAc/K,KAAOoL,EAAO7X,IAAI0G,eAEP,GAA5BmR,EAAO7X,IAAI2E,QAAQ,OACrBqT,EAAOR,cAAcpH,aAAc,GAGrC,IAAIiI,EAAaL,EAAOL,aAExB,GAAkB9S,MAAdwT,EAKJ,OAAQA,EAAWlC,MACjB,KAAKxT,EAAK+S,WAAWmB,KAEnB,OADAmB,EAAOF,aACAnV,EAAK8M,YAAY0I,UAC1B,KAAKxV,EAAK+S,WAAWkB,MAEnB,OADAoB,EAAOF,aACAnV,EAAK8M,YAAYyI,WAC1B,KAAKvV,EAAK+S,WAAWoB,cACnB,OAAOnU,EAAK8M,YAAY+I,kBAC1B,KAAK7V,EAAK+S,WAAWqB,MACnB,OAAOpU,EAAK8M,YAAYgJ,WAC1B,KAAK9V,EAAK+S,WAAWsB,SAEnB,OADAgB,EAAOF,aACAnV,EAAK8M,YAAYwI,cAC1B,QACE,IAAIG,EAAe,2BAA6BC,EAAWlC,KAAO,IAClE,MAAM,IAAIxT,EAAK8S,gBAAiB2C,EAAcC,EAAWjP,MAAOiP,EAAWhP,UApB7E2O,EAAOF,eAwBXnV,EAAK8M,YAAY+I,kBAAoB,SAAUR,GAC7C,IAAIH,EAASG,EAAOJ,gBAEpB,GAAc/S,MAAVgT,EAAJ,CAIA,IAAInL,EAAegM,SAASb,EAAO7X,IAAK,IAExC,GAAI2Y,MAAMjM,GAAe,CACvB,IAAI0L,EAAe,gCACnB,MAAM,IAAIzV,EAAK8S,gBAAiB2C,EAAcP,EAAOzO,MAAOyO,EAAOxO,KAGrE2O,EAAOR,cAAc9K,aAAeA,EAEpC,IAAI2L,EAAaL,EAAOL,aAExB,GAAkB9S,MAAdwT,EAKJ,OAAQA,EAAWlC,MACjB,KAAKxT,EAAK+S,WAAWmB,KAEnB,OADAmB,EAAOF,aACAnV,EAAK8M,YAAY0I,UAC1B,KAAKxV,EAAK+S,WAAWkB,MAEnB,OADAoB,EAAOF,aACAnV,EAAK8M,YAAYyI,WAC1B,KAAKvV,EAAK+S,WAAWoB,cACnB,OAAOnU,EAAK8M,YAAY+I,kBAC1B,KAAK7V,EAAK+S,WAAWqB,MACnB,OAAOpU,EAAK8M,YAAYgJ,WAC1B,KAAK9V,EAAK+S,WAAWsB,SAEnB,OADAgB,EAAOF,aACAnV,EAAK8M,YAAYwI,cAC1B,QACMG,EAAe,2BAA6BC,EAAWlC,KAAO,IAClE,MAAM,IAAIxT,EAAK8S,gBAAiB2C,EAAcC,EAAWjP,MAAOiP,EAAWhP,UApB7E2O,EAAOF,eAwBXnV,EAAK8M,YAAYgJ,WAAa,SAAUT,GACtC,IAAIH,EAASG,EAAOJ,gBAEpB,GAAc/S,MAAVgT,EAAJ,CAIA,IAAI3G,EAAQwH,SAASb,EAAO7X,IAAK,IAEjC,GAAI2Y,MAAMzH,GAAQ,CAChB,IAAIkH,EAAe,wBACnB,MAAM,IAAIzV,EAAK8S,gBAAiB2C,EAAcP,EAAOzO,MAAOyO,EAAOxO,KAGrE2O,EAAOR,cAActG,MAAQA,EAE7B,IAAImH,EAAaL,EAAOL,aAExB,GAAkB9S,MAAdwT,EAKJ,OAAQA,EAAWlC,MACjB,KAAKxT,EAAK+S,WAAWmB,KAEnB,OADAmB,EAAOF,aACAnV,EAAK8M,YAAY0I,UAC1B,KAAKxV,EAAK+S,WAAWkB,MAEnB,OADAoB,EAAOF,aACAnV,EAAK8M,YAAYyI,WAC1B,KAAKvV,EAAK+S,WAAWoB,cACnB,OAAOnU,EAAK8M,YAAY+I,kBAC1B,KAAK7V,EAAK+S,WAAWqB,MACnB,OAAOpU,EAAK8M,YAAYgJ,WAC1B,KAAK9V,EAAK+S,WAAWsB,SAEnB,OADAgB,EAAOF,aACAnV,EAAK8M,YAAYwI,cAC1B,QACMG,EAAe,2BAA6BC,EAAWlC,KAAO,IAClE,MAAM,IAAIxT,EAAK8S,gBAAiB2C,EAAcC,EAAWjP,MAAOiP,EAAWhP,UApB7E2O,EAAOF,oBA+BS,0BAAd,EAYI,WAMN,OAAOnV,IAlBS,kCAx3GnB,I,01BCyBiBiW,E,iqBC8DlB,aA2BE,WAAmB,G,IAAEhW,EAAA,EAAAA,OAAQiW,EAAA,EAAAA,KAAM9V,EAAA,EAAAA,SAAU3C,EAAA,EAAAA,MAC3CS,KAAKiY,UCpDF,SACLD,G,QAEMC,EAAY,IAAIC,I,IACtB,IAAkB,QAAAF,GAAI,8BAAE,CAAnB,IAAMzF,EAAG,QACN,6BAAC4F,EAAA,KAAMC,EAAA,KAGPC,EAAW9F,EAAI8F,SACfC,EAAW/F,EAAI+F,MAGfC,EAAO,EAAWhG,EAAIgG,MACzBzY,QAAQ,mBAAoB,IAC5BA,QAAQ,OAAQ,KAGnB,GAAIsY,EAAM,CACR,IAAMpK,EAASiK,EAAUpa,IAAIsa,GAGxBnK,EAAOwK,OAOVP,EAAUQ,IAAIJ,EAAU,CAAEA,SAAQ,EAAEC,MAAK,EAAEC,KAAI,EAAEvK,OAAM,KANvDA,EAAOsK,MAAS/F,EAAI+F,MACpBtK,EAAOuK,KAASA,EAChBvK,EAAOwK,QAAS,QASlBP,EAAUQ,IAAIJ,EAAU,CAAEA,SAAQ,EAAEC,MAAK,EAAEC,KAAI,EAAEC,QAAQ,K,iGAG7D,OAAOP,EDgBYS,CAAuBV,GACxChY,KAAK2Y,UE1DF,SACL5W,GAEA,IAAMqE,EAAY,IAAI0D,OAAO/H,EAAOqE,UAAW,OACzCuS,EAAY,SAACC,EAAYC,EAAcjN,GAC3C,OAAUiN,EAAI,OAAOjN,EAAI,SAI3B,OAAO,SAAC+C,GACNA,EAAQA,EACL7O,QAAQ,eAAgB,KACxBgZ,OAGH,IAAM1Z,EAAQ,IAAI0K,OAAO,MAAM/H,EAAOqE,UAAS,KAC7C,EAAauI,GAAO7O,QAAQsG,EAAW,KAAI,IACxC,OAGL,OAAO,SAAA2S,GAAY,cACdA,GAAQ,CACXT,MAAOS,EAAST,MAAMxY,QAAQV,EAAOuZ,GACrCJ,KAAOQ,EAASR,KAAKzY,QAAQV,EAAOuZ,OFmCrBK,CAAuBjX,GACxCc,QAAQoW,IAAIlX,EAAQ,CAAEmX,MAAO,OAI3BlZ,KAAKT,WADc,IAAVA,EACI,GAAK,W,QAChB2C,EAAWA,GAAY,CACrBE,SAAS,EACT+W,WAAW,GAIbnZ,KAAKkC,SAASgG,QACVhG,EAASE,SACXpC,KAAKkC,SAASC,IAAI,WAChBD,EAASiX,WACXnZ,KAAKkC,SAASC,IAAI,kBAGpBnC,KAAK4P,MAAM,QAAS,CAAES,MAAO,KAC7BrQ,KAAK4P,MAAM,QACX5P,KAAKqR,IAAI,Y,IAGT,IAAkB,QAAA2G,GAAI,+BAAjB,IAAMzF,EAAG,QACZvS,KAAKmC,IAAIoQ,I,qGAKA,QAAW3L,KACL,iBAAVrH,EACH6Z,KAAKvK,MAAMtP,GACXA,GAuEZ,OAlDS,YAAAkP,OAAP,SAAcE,GAAd,WACE,GAAIA,EACF,IAGE,IAAM0K,EAASrZ,KAAKT,MAAMkP,OAAOE,GAC9B7D,QAAO,SAAC+F,EAAS/I,GAChB,IAAMiR,EAAW,EAAKd,UAAUpa,IAAIiK,EAAOuJ,KAC3C,QAAwB,IAAb0H,EACT,GAAI,WAAYA,EAAU,CACxB,IAAM1H,EAAM0H,EAAS/K,OAAOqK,SAC5BxH,EAAQ4H,IAAIpH,EAAK,EAAIR,EAAQhT,IAAIwT,IAAQ,GAAI,CAAAvJ,SACxC,CACCuJ,EAAM0H,EAASV,SACrBxH,EAAQ4H,IAAIpH,EAAKR,EAAQhT,IAAIwT,IAAQ,IAGzC,OAAOR,IACN,IAAIqH,KAGH,EAAKlY,KAAK2Y,UAAUhK,GAG1B,OAAO,EAAI0K,GAAQzT,KAAI,SAAC,G,IAAA,SAACyL,EAAA,KAAKiI,EAAA,KAAc,OAC1CC,QAAS,EAAG,EAAKtB,UAAUpa,IAAIwT,IAC/BiI,SAAUA,EAAS1T,KAAI,SAAA4T,GACrB,OAAO,EAAG,EAAKvB,UAAUpa,IAAI2b,EAAQnI,aAKzC,MAAOoI,GAEP5W,QAAQF,KAAK,kBAAkBgM,EAAK,iCAKxC,MAAO,IAQF,YAAA3L,SAAP,WACE,OAAOoW,KAAKM,UAAU1Z,KAAKT,QAE/B,EArIA,ID9DA,SAAkBwY,GAChB,qBACA,mBACA,qBACA,uBAJF,CAAkBA,MAAiB,KI/BnC,wC,IAiCI,E,iqBAwCG,SAAS4B,EAAQ/W,GACtB,OAAQA,EAAQ0S,MAGd,KAAKyC,EAAkB6B,MAGrB,OApCN,SAA4B7X,G,QACpB8X,EAAO,UAGPC,EAAU,CAAID,EAAI,gC,IACxB,IAAmB,QAAA9X,EAAOgY,MAAI,8BAAE,CAA3B,IAAMA,EAAI,QACA,OAATA,GAAeD,EAAQjV,KAAQgV,EAAI,eAC1B,OAATE,GAAeD,EAAQjV,KAAQgV,EAAI,SAASE,EAAI,Y,iGAIlDD,EAAQra,OAAS,GACnBqa,EAAQjV,KAAQgV,EAAI,sBAGtBG,cAAa,eAAIF,IAmBbG,CAAmBrX,EAAQiW,KAAK9W,QAChC,EAAQ,IAAI,EAAYa,EAAQiW,MACzB,CACLvD,KAAMyC,EAAkBmC,KACxBrB,KAAM,EAAM7V,YAIhB,KAAK+U,EAAkBoC,MACrB,MAAO,CACL7E,KAAMyC,EAAkBqC,OACxBvB,KAAM,EAAQ,EAAMpK,OAAO7L,EAAQiW,MAAQ,IAI/C,QACE,MAAM,IAAIhZ,UAAU,yBAQ1Bwa,KAAKC,iBAAiB,WAAW,SAAAC,GAC/BF,KAAKG,YAAYb,EAAQY,EAAG1B","file":"worker/search.js","sourcesContent":[" \t// The module cache\n \tvar installedModules = {};\n\n \t// The require function\n \tfunction __webpack_require__(moduleId) {\n\n \t\t// Check if module is in cache\n \t\tif(installedModules[moduleId]) {\n \t\t\treturn installedModules[moduleId].exports;\n \t\t}\n \t\t// Create a new module (and put it into the cache)\n \t\tvar module = installedModules[moduleId] = {\n \t\t\ti: moduleId,\n \t\t\tl: false,\n \t\t\texports: {}\n \t\t};\n\n \t\t// Execute the module function\n \t\tmodules[moduleId].call(module.exports, module, module.exports, __webpack_require__);\n\n \t\t// Flag the module as loaded\n \t\tmodule.l = true;\n\n \t\t// Return the exports of the module\n \t\treturn module.exports;\n \t}\n\n\n \t// expose the modules object (__webpack_modules__)\n \t__webpack_require__.m = modules;\n\n \t// expose the module cache\n \t__webpack_require__.c = installedModules;\n\n \t// define getter function for harmony exports\n \t__webpack_require__.d = function(exports, name, getter) {\n \t\tif(!__webpack_require__.o(exports, name)) {\n \t\t\tObject.defineProperty(exports, name, { enumerable: true, get: getter });\n \t\t}\n \t};\n\n \t// define __esModule on exports\n \t__webpack_require__.r = function(exports) {\n \t\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n \t\t\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\n \t\t}\n \t\tObject.defineProperty(exports, '__esModule', { value: true });\n \t};\n\n \t// create a fake namespace object\n \t// mode & 1: value is a module id, require it\n \t// mode & 2: merge all properties of value into the ns\n \t// mode & 4: return value when already ns object\n \t// mode & 8|1: behave like require\n \t__webpack_require__.t = function(value, mode) {\n \t\tif(mode & 1) value = __webpack_require__(value);\n \t\tif(mode & 8) return value;\n \t\tif((mode & 4) && typeof value === 'object' && value && value.__esModule) return value;\n \t\tvar ns = Object.create(null);\n \t\t__webpack_require__.r(ns);\n \t\tObject.defineProperty(ns, 'default', { enumerable: true, value: value });\n \t\tif(mode & 2 && typeof value != 'string') for(var key in value) __webpack_require__.d(ns, key, function(key) { return value[key]; }.bind(null, key));\n \t\treturn ns;\n \t};\n\n \t// getDefaultExport function for compatibility with non-harmony modules\n \t__webpack_require__.n = function(module) {\n \t\tvar getter = module && module.__esModule ?\n \t\t\tfunction getDefault() { return module['default']; } :\n \t\t\tfunction getModuleExports() { return module; };\n \t\t__webpack_require__.d(getter, 'a', getter);\n \t\treturn getter;\n \t};\n\n \t// Object.prototype.hasOwnProperty.call\n \t__webpack_require__.o = function(object, property) { return Object.prototype.hasOwnProperty.call(object, property); };\n\n \t// __webpack_public_path__\n \t__webpack_require__.p = \"\";\n\n\n \t// Load entry module and return exports\n \treturn __webpack_require__(__webpack_require__.s = 5);\n","module.exports = global[\"lunr\"] = require(\"-!./lunr.js\");","/*!\n * escape-html\n * Copyright(c) 2012-2013 TJ Holowaychuk\n * Copyright(c) 2015 Andreas Lubbe\n * Copyright(c) 2015 Tiancheng \"Timothy\" Gu\n * MIT Licensed\n */\n\n'use strict';\n\n/**\n * Module variables.\n * @private\n */\n\nvar matchHtmlRegExp = /[\"'&<>]/;\n\n/**\n * Module exports.\n * @public\n */\n\nmodule.exports = escapeHtml;\n\n/**\n * Escape special characters in the given string of html.\n *\n * @param {string} string The string to escape for inserting into HTML\n * @return {string}\n * @public\n */\n\nfunction escapeHtml(string) {\n var str = '' + string;\n var match = matchHtmlRegExp.exec(str);\n\n if (!match) {\n return str;\n }\n\n var escape;\n var html = '';\n var index = 0;\n var lastIndex = 0;\n\n for (index = match.index; index < str.length; index++) {\n switch (str.charCodeAt(index)) {\n case 34: // \"\n escape = '"';\n break;\n case 38: // &\n escape = '&';\n break;\n case 39: // '\n escape = ''';\n break;\n case 60: // <\n escape = '<';\n break;\n case 62: // >\n escape = '>';\n break;\n default:\n continue;\n }\n\n if (lastIndex !== index) {\n html += str.substring(lastIndex, index);\n }\n\n lastIndex = index + 1;\n html += escape;\n }\n\n return lastIndex !== index\n ? html + str.substring(lastIndex, index)\n : html;\n}\n","'use strict';\n\nconst matchOperatorsRegex = /[|\\\\{}()[\\]^$+*?.-]/g;\n\nmodule.exports = string => {\n\tif (typeof string !== 'string') {\n\t\tthrow new TypeError('Expected a string');\n\t}\n\n\treturn string.replace(matchOperatorsRegex, '\\\\$&');\n};\n","var g;\n\n// This works in non-strict mode\ng = (function() {\n\treturn this;\n})();\n\ntry {\n\t// This works if eval is allowed (see CSP)\n\tg = g || new Function(\"return this\")();\n} catch (e) {\n\t// This works if the window reference is available\n\tif (typeof window === \"object\") g = window;\n}\n\n// g can still be undefined, but nothing to do about it...\n// We return undefined, instead of nothing here, so it's\n// easier to handle this case. if(!global) { ...}\n\nmodule.exports = g;\n","/**\n * lunr - http://lunrjs.com - A bit like Solr, but much smaller and not as bright - 2.3.8\n * Copyright (C) 2019 Oliver Nightingale\n * @license MIT\n */\n\n;(function(){\n\n/**\n * A convenience function for configuring and constructing\n * a new lunr Index.\n *\n * A lunr.Builder instance is created and the pipeline setup\n * with a trimmer, stop word filter and stemmer.\n *\n * This builder object is yielded to the configuration function\n * that is passed as a parameter, allowing the list of fields\n * and other builder parameters to be customised.\n *\n * All documents _must_ be added within the passed config function.\n *\n * @example\n * var idx = lunr(function () {\n * this.field('title')\n * this.field('body')\n * this.ref('id')\n *\n * documents.forEach(function (doc) {\n * this.add(doc)\n * }, this)\n * })\n *\n * @see {@link lunr.Builder}\n * @see {@link lunr.Pipeline}\n * @see {@link lunr.trimmer}\n * @see {@link lunr.stopWordFilter}\n * @see {@link lunr.stemmer}\n * @namespace {function} lunr\n */\nvar lunr = function (config) {\n var builder = new lunr.Builder\n\n builder.pipeline.add(\n lunr.trimmer,\n lunr.stopWordFilter,\n lunr.stemmer\n )\n\n builder.searchPipeline.add(\n lunr.stemmer\n )\n\n config.call(builder, builder)\n return builder.build()\n}\n\nlunr.version = \"2.3.8\"\n/*!\n * lunr.utils\n * Copyright (C) 2019 Oliver Nightingale\n */\n\n/**\n * A namespace containing utils for the rest of the lunr library\n * @namespace lunr.utils\n */\nlunr.utils = {}\n\n/**\n * Print a warning message to the console.\n *\n * @param {String} message The message to be printed.\n * @memberOf lunr.utils\n * @function\n */\nlunr.utils.warn = (function (global) {\n /* eslint-disable no-console */\n return function (message) {\n if (global.console && console.warn) {\n console.warn(message)\n }\n }\n /* eslint-enable no-console */\n})(this)\n\n/**\n * Convert an object to a string.\n *\n * In the case of `null` and `undefined` the function returns\n * the empty string, in all other cases the result of calling\n * `toString` on the passed object is returned.\n *\n * @param {Any} obj The object to convert to a string.\n * @return {String} string representation of the passed object.\n * @memberOf lunr.utils\n */\nlunr.utils.asString = function (obj) {\n if (obj === void 0 || obj === null) {\n return \"\"\n } else {\n return obj.toString()\n }\n}\n\n/**\n * Clones an object.\n *\n * Will create a copy of an existing object such that any mutations\n * on the copy cannot affect the original.\n *\n * Only shallow objects are supported, passing a nested object to this\n * function will cause a TypeError.\n *\n * Objects with primitives, and arrays of primitives are supported.\n *\n * @param {Object} obj The object to clone.\n * @return {Object} a clone of the passed object.\n * @throws {TypeError} when a nested object is passed.\n * @memberOf Utils\n */\nlunr.utils.clone = function (obj) {\n if (obj === null || obj === undefined) {\n return obj\n }\n\n var clone = Object.create(null),\n keys = Object.keys(obj)\n\n for (var i = 0; i < keys.length; i++) {\n var key = keys[i],\n val = obj[key]\n\n if (Array.isArray(val)) {\n clone[key] = val.slice()\n continue\n }\n\n if (typeof val === 'string' ||\n typeof val === 'number' ||\n typeof val === 'boolean') {\n clone[key] = val\n continue\n }\n\n throw new TypeError(\"clone is not deep and does not support nested objects\")\n }\n\n return clone\n}\nlunr.FieldRef = function (docRef, fieldName, stringValue) {\n this.docRef = docRef\n this.fieldName = fieldName\n this._stringValue = stringValue\n}\n\nlunr.FieldRef.joiner = \"/\"\n\nlunr.FieldRef.fromString = function (s) {\n var n = s.indexOf(lunr.FieldRef.joiner)\n\n if (n === -1) {\n throw \"malformed field ref string\"\n }\n\n var fieldRef = s.slice(0, n),\n docRef = s.slice(n + 1)\n\n return new lunr.FieldRef (docRef, fieldRef, s)\n}\n\nlunr.FieldRef.prototype.toString = function () {\n if (this._stringValue == undefined) {\n this._stringValue = this.fieldName + lunr.FieldRef.joiner + this.docRef\n }\n\n return this._stringValue\n}\n/*!\n * lunr.Set\n * Copyright (C) 2019 Oliver Nightingale\n */\n\n/**\n * A lunr set.\n *\n * @constructor\n */\nlunr.Set = function (elements) {\n this.elements = Object.create(null)\n\n if (elements) {\n this.length = elements.length\n\n for (var i = 0; i < this.length; i++) {\n this.elements[elements[i]] = true\n }\n } else {\n this.length = 0\n }\n}\n\n/**\n * A complete set that contains all elements.\n *\n * @static\n * @readonly\n * @type {lunr.Set}\n */\nlunr.Set.complete = {\n intersect: function (other) {\n return other\n },\n\n union: function (other) {\n return other\n },\n\n contains: function () {\n return true\n }\n}\n\n/**\n * An empty set that contains no elements.\n *\n * @static\n * @readonly\n * @type {lunr.Set}\n */\nlunr.Set.empty = {\n intersect: function () {\n return this\n },\n\n union: function (other) {\n return other\n },\n\n contains: function () {\n return false\n }\n}\n\n/**\n * Returns true if this set contains the specified object.\n *\n * @param {object} object - Object whose presence in this set is to be tested.\n * @returns {boolean} - True if this set contains the specified object.\n */\nlunr.Set.prototype.contains = function (object) {\n return !!this.elements[object]\n}\n\n/**\n * Returns a new set containing only the elements that are present in both\n * this set and the specified set.\n *\n * @param {lunr.Set} other - set to intersect with this set.\n * @returns {lunr.Set} a new set that is the intersection of this and the specified set.\n */\n\nlunr.Set.prototype.intersect = function (other) {\n var a, b, elements, intersection = []\n\n if (other === lunr.Set.complete) {\n return this\n }\n\n if (other === lunr.Set.empty) {\n return other\n }\n\n if (this.length < other.length) {\n a = this\n b = other\n } else {\n a = other\n b = this\n }\n\n elements = Object.keys(a.elements)\n\n for (var i = 0; i < elements.length; i++) {\n var element = elements[i]\n if (element in b.elements) {\n intersection.push(element)\n }\n }\n\n return new lunr.Set (intersection)\n}\n\n/**\n * Returns a new set combining the elements of this and the specified set.\n *\n * @param {lunr.Set} other - set to union with this set.\n * @return {lunr.Set} a new set that is the union of this and the specified set.\n */\n\nlunr.Set.prototype.union = function (other) {\n if (other === lunr.Set.complete) {\n return lunr.Set.complete\n }\n\n if (other === lunr.Set.empty) {\n return this\n }\n\n return new lunr.Set(Object.keys(this.elements).concat(Object.keys(other.elements)))\n}\n/**\n * A function to calculate the inverse document frequency for\n * a posting. This is shared between the builder and the index\n *\n * @private\n * @param {object} posting - The posting for a given term\n * @param {number} documentCount - The total number of documents.\n */\nlunr.idf = function (posting, documentCount) {\n var documentsWithTerm = 0\n\n for (var fieldName in posting) {\n if (fieldName == '_index') continue // Ignore the term index, its not a field\n documentsWithTerm += Object.keys(posting[fieldName]).length\n }\n\n var x = (documentCount - documentsWithTerm + 0.5) / (documentsWithTerm + 0.5)\n\n return Math.log(1 + Math.abs(x))\n}\n\n/**\n * A token wraps a string representation of a token\n * as it is passed through the text processing pipeline.\n *\n * @constructor\n * @param {string} [str=''] - The string token being wrapped.\n * @param {object} [metadata={}] - Metadata associated with this token.\n */\nlunr.Token = function (str, metadata) {\n this.str = str || \"\"\n this.metadata = metadata || {}\n}\n\n/**\n * Returns the token string that is being wrapped by this object.\n *\n * @returns {string}\n */\nlunr.Token.prototype.toString = function () {\n return this.str\n}\n\n/**\n * A token update function is used when updating or optionally\n * when cloning a token.\n *\n * @callback lunr.Token~updateFunction\n * @param {string} str - The string representation of the token.\n * @param {Object} metadata - All metadata associated with this token.\n */\n\n/**\n * Applies the given function to the wrapped string token.\n *\n * @example\n * token.update(function (str, metadata) {\n * return str.toUpperCase()\n * })\n *\n * @param {lunr.Token~updateFunction} fn - A function to apply to the token string.\n * @returns {lunr.Token}\n */\nlunr.Token.prototype.update = function (fn) {\n this.str = fn(this.str, this.metadata)\n return this\n}\n\n/**\n * Creates a clone of this token. Optionally a function can be\n * applied to the cloned token.\n *\n * @param {lunr.Token~updateFunction} [fn] - An optional function to apply to the cloned token.\n * @returns {lunr.Token}\n */\nlunr.Token.prototype.clone = function (fn) {\n fn = fn || function (s) { return s }\n return new lunr.Token (fn(this.str, this.metadata), this.metadata)\n}\n/*!\n * lunr.tokenizer\n * Copyright (C) 2019 Oliver Nightingale\n */\n\n/**\n * A function for splitting a string into tokens ready to be inserted into\n * the search index. Uses `lunr.tokenizer.separator` to split strings, change\n * the value of this property to change how strings are split into tokens.\n *\n * This tokenizer will convert its parameter to a string by calling `toString` and\n * then will split this string on the character in `lunr.tokenizer.separator`.\n * Arrays will have their elements converted to strings and wrapped in a lunr.Token.\n *\n * Optional metadata can be passed to the tokenizer, this metadata will be cloned and\n * added as metadata to every token that is created from the object to be tokenized.\n *\n * @static\n * @param {?(string|object|object[])} obj - The object to convert into tokens\n * @param {?object} metadata - Optional metadata to associate with every token\n * @returns {lunr.Token[]}\n * @see {@link lunr.Pipeline}\n */\nlunr.tokenizer = function (obj, metadata) {\n if (obj == null || obj == undefined) {\n return []\n }\n\n if (Array.isArray(obj)) {\n return obj.map(function (t) {\n return new lunr.Token(\n lunr.utils.asString(t).toLowerCase(),\n lunr.utils.clone(metadata)\n )\n })\n }\n\n var str = obj.toString().toLowerCase(),\n len = str.length,\n tokens = []\n\n for (var sliceEnd = 0, sliceStart = 0; sliceEnd <= len; sliceEnd++) {\n var char = str.charAt(sliceEnd),\n sliceLength = sliceEnd - sliceStart\n\n if ((char.match(lunr.tokenizer.separator) || sliceEnd == len)) {\n\n if (sliceLength > 0) {\n var tokenMetadata = lunr.utils.clone(metadata) || {}\n tokenMetadata[\"position\"] = [sliceStart, sliceLength]\n tokenMetadata[\"index\"] = tokens.length\n\n tokens.push(\n new lunr.Token (\n str.slice(sliceStart, sliceEnd),\n tokenMetadata\n )\n )\n }\n\n sliceStart = sliceEnd + 1\n }\n\n }\n\n return tokens\n}\n\n/**\n * The separator used to split a string into tokens. Override this property to change the behaviour of\n * `lunr.tokenizer` behaviour when tokenizing strings. By default this splits on whitespace and hyphens.\n *\n * @static\n * @see lunr.tokenizer\n */\nlunr.tokenizer.separator = /[\\s\\-]+/\n/*!\n * lunr.Pipeline\n * Copyright (C) 2019 Oliver Nightingale\n */\n\n/**\n * lunr.Pipelines maintain an ordered list of functions to be applied to all\n * tokens in documents entering the search index and queries being ran against\n * the index.\n *\n * An instance of lunr.Index created with the lunr shortcut will contain a\n * pipeline with a stop word filter and an English language stemmer. Extra\n * functions can be added before or after either of these functions or these\n * default functions can be removed.\n *\n * When run the pipeline will call each function in turn, passing a token, the\n * index of that token in the original list of all tokens and finally a list of\n * all the original tokens.\n *\n * The output of functions in the pipeline will be passed to the next function\n * in the pipeline. To exclude a token from entering the index the function\n * should return undefined, the rest of the pipeline will not be called with\n * this token.\n *\n * For serialisation of pipelines to work, all functions used in an instance of\n * a pipeline should be registered with lunr.Pipeline. Registered functions can\n * then be loaded. If trying to load a serialised pipeline that uses functions\n * that are not registered an error will be thrown.\n *\n * If not planning on serialising the pipeline then registering pipeline functions\n * is not necessary.\n *\n * @constructor\n */\nlunr.Pipeline = function () {\n this._stack = []\n}\n\nlunr.Pipeline.registeredFunctions = Object.create(null)\n\n/**\n * A pipeline function maps lunr.Token to lunr.Token. A lunr.Token contains the token\n * string as well as all known metadata. A pipeline function can mutate the token string\n * or mutate (or add) metadata for a given token.\n *\n * A pipeline function can indicate that the passed token should be discarded by returning\n * null, undefined or an empty string. This token will not be passed to any downstream pipeline\n * functions and will not be added to the index.\n *\n * Multiple tokens can be returned by returning an array of tokens. Each token will be passed\n * to any downstream pipeline functions and all will returned tokens will be added to the index.\n *\n * Any number of pipeline functions may be chained together using a lunr.Pipeline.\n *\n * @interface lunr.PipelineFunction\n * @param {lunr.Token} token - A token from the document being processed.\n * @param {number} i - The index of this token in the complete list of tokens for this document/field.\n * @param {lunr.Token[]} tokens - All tokens for this document/field.\n * @returns {(?lunr.Token|lunr.Token[])}\n */\n\n/**\n * Register a function with the pipeline.\n *\n * Functions that are used in the pipeline should be registered if the pipeline\n * needs to be serialised, or a serialised pipeline needs to be loaded.\n *\n * Registering a function does not add it to a pipeline, functions must still be\n * added to instances of the pipeline for them to be used when running a pipeline.\n *\n * @param {lunr.PipelineFunction} fn - The function to check for.\n * @param {String} label - The label to register this function with\n */\nlunr.Pipeline.registerFunction = function (fn, label) {\n if (label in this.registeredFunctions) {\n lunr.utils.warn('Overwriting existing registered function: ' + label)\n }\n\n fn.label = label\n lunr.Pipeline.registeredFunctions[fn.label] = fn\n}\n\n/**\n * Warns if the function is not registered as a Pipeline function.\n *\n * @param {lunr.PipelineFunction} fn - The function to check for.\n * @private\n */\nlunr.Pipeline.warnIfFunctionNotRegistered = function (fn) {\n var isRegistered = fn.label && (fn.label in this.registeredFunctions)\n\n if (!isRegistered) {\n lunr.utils.warn('Function is not registered with pipeline. This may cause problems when serialising the index.\\n', fn)\n }\n}\n\n/**\n * Loads a previously serialised pipeline.\n *\n * All functions to be loaded must already be registered with lunr.Pipeline.\n * If any function from the serialised data has not been registered then an\n * error will be thrown.\n *\n * @param {Object} serialised - The serialised pipeline to load.\n * @returns {lunr.Pipeline}\n */\nlunr.Pipeline.load = function (serialised) {\n var pipeline = new lunr.Pipeline\n\n serialised.forEach(function (fnName) {\n var fn = lunr.Pipeline.registeredFunctions[fnName]\n\n if (fn) {\n pipeline.add(fn)\n } else {\n throw new Error('Cannot load unregistered function: ' + fnName)\n }\n })\n\n return pipeline\n}\n\n/**\n * Adds new functions to the end of the pipeline.\n *\n * Logs a warning if the function has not been registered.\n *\n * @param {lunr.PipelineFunction[]} functions - Any number of functions to add to the pipeline.\n */\nlunr.Pipeline.prototype.add = function () {\n var fns = Array.prototype.slice.call(arguments)\n\n fns.forEach(function (fn) {\n lunr.Pipeline.warnIfFunctionNotRegistered(fn)\n this._stack.push(fn)\n }, this)\n}\n\n/**\n * Adds a single function after a function that already exists in the\n * pipeline.\n *\n * Logs a warning if the function has not been registered.\n *\n * @param {lunr.PipelineFunction} existingFn - A function that already exists in the pipeline.\n * @param {lunr.PipelineFunction} newFn - The new function to add to the pipeline.\n */\nlunr.Pipeline.prototype.after = function (existingFn, newFn) {\n lunr.Pipeline.warnIfFunctionNotRegistered(newFn)\n\n var pos = this._stack.indexOf(existingFn)\n if (pos == -1) {\n throw new Error('Cannot find existingFn')\n }\n\n pos = pos + 1\n this._stack.splice(pos, 0, newFn)\n}\n\n/**\n * Adds a single function before a function that already exists in the\n * pipeline.\n *\n * Logs a warning if the function has not been registered.\n *\n * @param {lunr.PipelineFunction} existingFn - A function that already exists in the pipeline.\n * @param {lunr.PipelineFunction} newFn - The new function to add to the pipeline.\n */\nlunr.Pipeline.prototype.before = function (existingFn, newFn) {\n lunr.Pipeline.warnIfFunctionNotRegistered(newFn)\n\n var pos = this._stack.indexOf(existingFn)\n if (pos == -1) {\n throw new Error('Cannot find existingFn')\n }\n\n this._stack.splice(pos, 0, newFn)\n}\n\n/**\n * Removes a function from the pipeline.\n *\n * @param {lunr.PipelineFunction} fn The function to remove from the pipeline.\n */\nlunr.Pipeline.prototype.remove = function (fn) {\n var pos = this._stack.indexOf(fn)\n if (pos == -1) {\n return\n }\n\n this._stack.splice(pos, 1)\n}\n\n/**\n * Runs the current list of functions that make up the pipeline against the\n * passed tokens.\n *\n * @param {Array} tokens The tokens to run through the pipeline.\n * @returns {Array}\n */\nlunr.Pipeline.prototype.run = function (tokens) {\n var stackLength = this._stack.length\n\n for (var i = 0; i < stackLength; i++) {\n var fn = this._stack[i]\n var memo = []\n\n for (var j = 0; j < tokens.length; j++) {\n var result = fn(tokens[j], j, tokens)\n\n if (result === null || result === void 0 || result === '') continue\n\n if (Array.isArray(result)) {\n for (var k = 0; k < result.length; k++) {\n memo.push(result[k])\n }\n } else {\n memo.push(result)\n }\n }\n\n tokens = memo\n }\n\n return tokens\n}\n\n/**\n * Convenience method for passing a string through a pipeline and getting\n * strings out. This method takes care of wrapping the passed string in a\n * token and mapping the resulting tokens back to strings.\n *\n * @param {string} str - The string to pass through the pipeline.\n * @param {?object} metadata - Optional metadata to associate with the token\n * passed to the pipeline.\n * @returns {string[]}\n */\nlunr.Pipeline.prototype.runString = function (str, metadata) {\n var token = new lunr.Token (str, metadata)\n\n return this.run([token]).map(function (t) {\n return t.toString()\n })\n}\n\n/**\n * Resets the pipeline by removing any existing processors.\n *\n */\nlunr.Pipeline.prototype.reset = function () {\n this._stack = []\n}\n\n/**\n * Returns a representation of the pipeline ready for serialisation.\n *\n * Logs a warning if the function has not been registered.\n *\n * @returns {Array}\n */\nlunr.Pipeline.prototype.toJSON = function () {\n return this._stack.map(function (fn) {\n lunr.Pipeline.warnIfFunctionNotRegistered(fn)\n\n return fn.label\n })\n}\n/*!\n * lunr.Vector\n * Copyright (C) 2019 Oliver Nightingale\n */\n\n/**\n * A vector is used to construct the vector space of documents and queries. These\n * vectors support operations to determine the similarity between two documents or\n * a document and a query.\n *\n * Normally no parameters are required for initializing a vector, but in the case of\n * loading a previously dumped vector the raw elements can be provided to the constructor.\n *\n * For performance reasons vectors are implemented with a flat array, where an elements\n * index is immediately followed by its value. E.g. [index, value, index, value]. This\n * allows the underlying array to be as sparse as possible and still offer decent\n * performance when being used for vector calculations.\n *\n * @constructor\n * @param {Number[]} [elements] - The flat list of element index and element value pairs.\n */\nlunr.Vector = function (elements) {\n this._magnitude = 0\n this.elements = elements || []\n}\n\n\n/**\n * Calculates the position within the vector to insert a given index.\n *\n * This is used internally by insert and upsert. If there are duplicate indexes then\n * the position is returned as if the value for that index were to be updated, but it\n * is the callers responsibility to check whether there is a duplicate at that index\n *\n * @param {Number} insertIdx - The index at which the element should be inserted.\n * @returns {Number}\n */\nlunr.Vector.prototype.positionForIndex = function (index) {\n // For an empty vector the tuple can be inserted at the beginning\n if (this.elements.length == 0) {\n return 0\n }\n\n var start = 0,\n end = this.elements.length / 2,\n sliceLength = end - start,\n pivotPoint = Math.floor(sliceLength / 2),\n pivotIndex = this.elements[pivotPoint * 2]\n\n while (sliceLength > 1) {\n if (pivotIndex < index) {\n start = pivotPoint\n }\n\n if (pivotIndex > index) {\n end = pivotPoint\n }\n\n if (pivotIndex == index) {\n break\n }\n\n sliceLength = end - start\n pivotPoint = start + Math.floor(sliceLength / 2)\n pivotIndex = this.elements[pivotPoint * 2]\n }\n\n if (pivotIndex == index) {\n return pivotPoint * 2\n }\n\n if (pivotIndex > index) {\n return pivotPoint * 2\n }\n\n if (pivotIndex < index) {\n return (pivotPoint + 1) * 2\n }\n}\n\n/**\n * Inserts an element at an index within the vector.\n *\n * Does not allow duplicates, will throw an error if there is already an entry\n * for this index.\n *\n * @param {Number} insertIdx - The index at which the element should be inserted.\n * @param {Number} val - The value to be inserted into the vector.\n */\nlunr.Vector.prototype.insert = function (insertIdx, val) {\n this.upsert(insertIdx, val, function () {\n throw \"duplicate index\"\n })\n}\n\n/**\n * Inserts or updates an existing index within the vector.\n *\n * @param {Number} insertIdx - The index at which the element should be inserted.\n * @param {Number} val - The value to be inserted into the vector.\n * @param {function} fn - A function that is called for updates, the existing value and the\n * requested value are passed as arguments\n */\nlunr.Vector.prototype.upsert = function (insertIdx, val, fn) {\n this._magnitude = 0\n var position = this.positionForIndex(insertIdx)\n\n if (this.elements[position] == insertIdx) {\n this.elements[position + 1] = fn(this.elements[position + 1], val)\n } else {\n this.elements.splice(position, 0, insertIdx, val)\n }\n}\n\n/**\n * Calculates the magnitude of this vector.\n *\n * @returns {Number}\n */\nlunr.Vector.prototype.magnitude = function () {\n if (this._magnitude) return this._magnitude\n\n var sumOfSquares = 0,\n elementsLength = this.elements.length\n\n for (var i = 1; i < elementsLength; i += 2) {\n var val = this.elements[i]\n sumOfSquares += val * val\n }\n\n return this._magnitude = Math.sqrt(sumOfSquares)\n}\n\n/**\n * Calculates the dot product of this vector and another vector.\n *\n * @param {lunr.Vector} otherVector - The vector to compute the dot product with.\n * @returns {Number}\n */\nlunr.Vector.prototype.dot = function (otherVector) {\n var dotProduct = 0,\n a = this.elements, b = otherVector.elements,\n aLen = a.length, bLen = b.length,\n aVal = 0, bVal = 0,\n i = 0, j = 0\n\n while (i < aLen && j < bLen) {\n aVal = a[i], bVal = b[j]\n if (aVal < bVal) {\n i += 2\n } else if (aVal > bVal) {\n j += 2\n } else if (aVal == bVal) {\n dotProduct += a[i + 1] * b[j + 1]\n i += 2\n j += 2\n }\n }\n\n return dotProduct\n}\n\n/**\n * Calculates the similarity between this vector and another vector.\n *\n * @param {lunr.Vector} otherVector - The other vector to calculate the\n * similarity with.\n * @returns {Number}\n */\nlunr.Vector.prototype.similarity = function (otherVector) {\n return this.dot(otherVector) / this.magnitude() || 0\n}\n\n/**\n * Converts the vector to an array of the elements within the vector.\n *\n * @returns {Number[]}\n */\nlunr.Vector.prototype.toArray = function () {\n var output = new Array (this.elements.length / 2)\n\n for (var i = 1, j = 0; i < this.elements.length; i += 2, j++) {\n output[j] = this.elements[i]\n }\n\n return output\n}\n\n/**\n * A JSON serializable representation of the vector.\n *\n * @returns {Number[]}\n */\nlunr.Vector.prototype.toJSON = function () {\n return this.elements\n}\n/* eslint-disable */\n/*!\n * lunr.stemmer\n * Copyright (C) 2019 Oliver Nightingale\n * Includes code from - http://tartarus.org/~martin/PorterStemmer/js.txt\n */\n\n/**\n * lunr.stemmer is an english language stemmer, this is a JavaScript\n * implementation of the PorterStemmer taken from http://tartarus.org/~martin\n *\n * @static\n * @implements {lunr.PipelineFunction}\n * @param {lunr.Token} token - The string to stem\n * @returns {lunr.Token}\n * @see {@link lunr.Pipeline}\n * @function\n */\nlunr.stemmer = (function(){\n var step2list = {\n \"ational\" : \"ate\",\n \"tional\" : \"tion\",\n \"enci\" : \"ence\",\n \"anci\" : \"ance\",\n \"izer\" : \"ize\",\n \"bli\" : \"ble\",\n \"alli\" : \"al\",\n \"entli\" : \"ent\",\n \"eli\" : \"e\",\n \"ousli\" : \"ous\",\n \"ization\" : \"ize\",\n \"ation\" : \"ate\",\n \"ator\" : \"ate\",\n \"alism\" : \"al\",\n \"iveness\" : \"ive\",\n \"fulness\" : \"ful\",\n \"ousness\" : \"ous\",\n \"aliti\" : \"al\",\n \"iviti\" : \"ive\",\n \"biliti\" : \"ble\",\n \"logi\" : \"log\"\n },\n\n step3list = {\n \"icate\" : \"ic\",\n \"ative\" : \"\",\n \"alize\" : \"al\",\n \"iciti\" : \"ic\",\n \"ical\" : \"ic\",\n \"ful\" : \"\",\n \"ness\" : \"\"\n },\n\n c = \"[^aeiou]\", // consonant\n v = \"[aeiouy]\", // vowel\n C = c + \"[^aeiouy]*\", // consonant sequence\n V = v + \"[aeiou]*\", // vowel sequence\n\n mgr0 = \"^(\" + C + \")?\" + V + C, // [C]VC... is m>0\n meq1 = \"^(\" + C + \")?\" + V + C + \"(\" + V + \")?$\", // [C]VC[V] is m=1\n mgr1 = \"^(\" + C + \")?\" + V + C + V + C, // [C]VCVC... is m>1\n s_v = \"^(\" + C + \")?\" + v; // vowel in stem\n\n var re_mgr0 = new RegExp(mgr0);\n var re_mgr1 = new RegExp(mgr1);\n var re_meq1 = new RegExp(meq1);\n var re_s_v = new RegExp(s_v);\n\n var re_1a = /^(.+?)(ss|i)es$/;\n var re2_1a = /^(.+?)([^s])s$/;\n var re_1b = /^(.+?)eed$/;\n var re2_1b = /^(.+?)(ed|ing)$/;\n var re_1b_2 = /.$/;\n var re2_1b_2 = /(at|bl|iz)$/;\n var re3_1b_2 = new RegExp(\"([^aeiouylsz])\\\\1$\");\n var re4_1b_2 = new RegExp(\"^\" + C + v + \"[^aeiouwxy]$\");\n\n var re_1c = /^(.+?[^aeiou])y$/;\n var re_2 = /^(.+?)(ational|tional|enci|anci|izer|bli|alli|entli|eli|ousli|ization|ation|ator|alism|iveness|fulness|ousness|aliti|iviti|biliti|logi)$/;\n\n var re_3 = /^(.+?)(icate|ative|alize|iciti|ical|ful|ness)$/;\n\n var re_4 = /^(.+?)(al|ance|ence|er|ic|able|ible|ant|ement|ment|ent|ou|ism|ate|iti|ous|ive|ize)$/;\n var re2_4 = /^(.+?)(s|t)(ion)$/;\n\n var re_5 = /^(.+?)e$/;\n var re_5_1 = /ll$/;\n var re3_5 = new RegExp(\"^\" + C + v + \"[^aeiouwxy]$\");\n\n var porterStemmer = function porterStemmer(w) {\n var stem,\n suffix,\n firstch,\n re,\n re2,\n re3,\n re4;\n\n if (w.length < 3) { return w; }\n\n firstch = w.substr(0,1);\n if (firstch == \"y\") {\n w = firstch.toUpperCase() + w.substr(1);\n }\n\n // Step 1a\n re = re_1a\n re2 = re2_1a;\n\n if (re.test(w)) { w = w.replace(re,\"$1$2\"); }\n else if (re2.test(w)) { w = w.replace(re2,\"$1$2\"); }\n\n // Step 1b\n re = re_1b;\n re2 = re2_1b;\n if (re.test(w)) {\n var fp = re.exec(w);\n re = re_mgr0;\n if (re.test(fp[1])) {\n re = re_1b_2;\n w = w.replace(re,\"\");\n }\n } else if (re2.test(w)) {\n var fp = re2.exec(w);\n stem = fp[1];\n re2 = re_s_v;\n if (re2.test(stem)) {\n w = stem;\n re2 = re2_1b_2;\n re3 = re3_1b_2;\n re4 = re4_1b_2;\n if (re2.test(w)) { w = w + \"e\"; }\n else if (re3.test(w)) { re = re_1b_2; w = w.replace(re,\"\"); }\n else if (re4.test(w)) { w = w + \"e\"; }\n }\n }\n\n // Step 1c - replace suffix y or Y by i if preceded by a non-vowel which is not the first letter of the word (so cry -> cri, by -> by, say -> say)\n re = re_1c;\n if (re.test(w)) {\n var fp = re.exec(w);\n stem = fp[1];\n w = stem + \"i\";\n }\n\n // Step 2\n re = re_2;\n if (re.test(w)) {\n var fp = re.exec(w);\n stem = fp[1];\n suffix = fp[2];\n re = re_mgr0;\n if (re.test(stem)) {\n w = stem + step2list[suffix];\n }\n }\n\n // Step 3\n re = re_3;\n if (re.test(w)) {\n var fp = re.exec(w);\n stem = fp[1];\n suffix = fp[2];\n re = re_mgr0;\n if (re.test(stem)) {\n w = stem + step3list[suffix];\n }\n }\n\n // Step 4\n re = re_4;\n re2 = re2_4;\n if (re.test(w)) {\n var fp = re.exec(w);\n stem = fp[1];\n re = re_mgr1;\n if (re.test(stem)) {\n w = stem;\n }\n } else if (re2.test(w)) {\n var fp = re2.exec(w);\n stem = fp[1] + fp[2];\n re2 = re_mgr1;\n if (re2.test(stem)) {\n w = stem;\n }\n }\n\n // Step 5\n re = re_5;\n if (re.test(w)) {\n var fp = re.exec(w);\n stem = fp[1];\n re = re_mgr1;\n re2 = re_meq1;\n re3 = re3_5;\n if (re.test(stem) || (re2.test(stem) && !(re3.test(stem)))) {\n w = stem;\n }\n }\n\n re = re_5_1;\n re2 = re_mgr1;\n if (re.test(w) && re2.test(w)) {\n re = re_1b_2;\n w = w.replace(re,\"\");\n }\n\n // and turn initial Y back to y\n\n if (firstch == \"y\") {\n w = firstch.toLowerCase() + w.substr(1);\n }\n\n return w;\n };\n\n return function (token) {\n return token.update(porterStemmer);\n }\n})();\n\nlunr.Pipeline.registerFunction(lunr.stemmer, 'stemmer')\n/*!\n * lunr.stopWordFilter\n * Copyright (C) 2019 Oliver Nightingale\n */\n\n/**\n * lunr.generateStopWordFilter builds a stopWordFilter function from the provided\n * list of stop words.\n *\n * The built in lunr.stopWordFilter is built using this generator and can be used\n * to generate custom stopWordFilters for applications or non English languages.\n *\n * @function\n * @param {Array} token The token to pass through the filter\n * @returns {lunr.PipelineFunction}\n * @see lunr.Pipeline\n * @see lunr.stopWordFilter\n */\nlunr.generateStopWordFilter = function (stopWords) {\n var words = stopWords.reduce(function (memo, stopWord) {\n memo[stopWord] = stopWord\n return memo\n }, {})\n\n return function (token) {\n if (token && words[token.toString()] !== token.toString()) return token\n }\n}\n\n/**\n * lunr.stopWordFilter is an English language stop word list filter, any words\n * contained in the list will not be passed through the filter.\n *\n * This is intended to be used in the Pipeline. If the token does not pass the\n * filter then undefined will be returned.\n *\n * @function\n * @implements {lunr.PipelineFunction}\n * @params {lunr.Token} token - A token to check for being a stop word.\n * @returns {lunr.Token}\n * @see {@link lunr.Pipeline}\n */\nlunr.stopWordFilter = lunr.generateStopWordFilter([\n 'a',\n 'able',\n 'about',\n 'across',\n 'after',\n 'all',\n 'almost',\n 'also',\n 'am',\n 'among',\n 'an',\n 'and',\n 'any',\n 'are',\n 'as',\n 'at',\n 'be',\n 'because',\n 'been',\n 'but',\n 'by',\n 'can',\n 'cannot',\n 'could',\n 'dear',\n 'did',\n 'do',\n 'does',\n 'either',\n 'else',\n 'ever',\n 'every',\n 'for',\n 'from',\n 'get',\n 'got',\n 'had',\n 'has',\n 'have',\n 'he',\n 'her',\n 'hers',\n 'him',\n 'his',\n 'how',\n 'however',\n 'i',\n 'if',\n 'in',\n 'into',\n 'is',\n 'it',\n 'its',\n 'just',\n 'least',\n 'let',\n 'like',\n 'likely',\n 'may',\n 'me',\n 'might',\n 'most',\n 'must',\n 'my',\n 'neither',\n 'no',\n 'nor',\n 'not',\n 'of',\n 'off',\n 'often',\n 'on',\n 'only',\n 'or',\n 'other',\n 'our',\n 'own',\n 'rather',\n 'said',\n 'say',\n 'says',\n 'she',\n 'should',\n 'since',\n 'so',\n 'some',\n 'than',\n 'that',\n 'the',\n 'their',\n 'them',\n 'then',\n 'there',\n 'these',\n 'they',\n 'this',\n 'tis',\n 'to',\n 'too',\n 'twas',\n 'us',\n 'wants',\n 'was',\n 'we',\n 'were',\n 'what',\n 'when',\n 'where',\n 'which',\n 'while',\n 'who',\n 'whom',\n 'why',\n 'will',\n 'with',\n 'would',\n 'yet',\n 'you',\n 'your'\n])\n\nlunr.Pipeline.registerFunction(lunr.stopWordFilter, 'stopWordFilter')\n/*!\n * lunr.trimmer\n * Copyright (C) 2019 Oliver Nightingale\n */\n\n/**\n * lunr.trimmer is a pipeline function for trimming non word\n * characters from the beginning and end of tokens before they\n * enter the index.\n *\n * This implementation may not work correctly for non latin\n * characters and should either be removed or adapted for use\n * with languages with non-latin characters.\n *\n * @static\n * @implements {lunr.PipelineFunction}\n * @param {lunr.Token} token The token to pass through the filter\n * @returns {lunr.Token}\n * @see lunr.Pipeline\n */\nlunr.trimmer = function (token) {\n return token.update(function (s) {\n return s.replace(/^\\W+/, '').replace(/\\W+$/, '')\n })\n}\n\nlunr.Pipeline.registerFunction(lunr.trimmer, 'trimmer')\n/*!\n * lunr.TokenSet\n * Copyright (C) 2019 Oliver Nightingale\n */\n\n/**\n * A token set is used to store the unique list of all tokens\n * within an index. Token sets are also used to represent an\n * incoming query to the index, this query token set and index\n * token set are then intersected to find which tokens to look\n * up in the inverted index.\n *\n * A token set can hold multiple tokens, as in the case of the\n * index token set, or it can hold a single token as in the\n * case of a simple query token set.\n *\n * Additionally token sets are used to perform wildcard matching.\n * Leading, contained and trailing wildcards are supported, and\n * from this edit distance matching can also be provided.\n *\n * Token sets are implemented as a minimal finite state automata,\n * where both common prefixes and suffixes are shared between tokens.\n * This helps to reduce the space used for storing the token set.\n *\n * @constructor\n */\nlunr.TokenSet = function () {\n this.final = false\n this.edges = {}\n this.id = lunr.TokenSet._nextId\n lunr.TokenSet._nextId += 1\n}\n\n/**\n * Keeps track of the next, auto increment, identifier to assign\n * to a new tokenSet.\n *\n * TokenSets require a unique identifier to be correctly minimised.\n *\n * @private\n */\nlunr.TokenSet._nextId = 1\n\n/**\n * Creates a TokenSet instance from the given sorted array of words.\n *\n * @param {String[]} arr - A sorted array of strings to create the set from.\n * @returns {lunr.TokenSet}\n * @throws Will throw an error if the input array is not sorted.\n */\nlunr.TokenSet.fromArray = function (arr) {\n var builder = new lunr.TokenSet.Builder\n\n for (var i = 0, len = arr.length; i < len; i++) {\n builder.insert(arr[i])\n }\n\n builder.finish()\n return builder.root\n}\n\n/**\n * Creates a token set from a query clause.\n *\n * @private\n * @param {Object} clause - A single clause from lunr.Query.\n * @param {string} clause.term - The query clause term.\n * @param {number} [clause.editDistance] - The optional edit distance for the term.\n * @returns {lunr.TokenSet}\n */\nlunr.TokenSet.fromClause = function (clause) {\n if ('editDistance' in clause) {\n return lunr.TokenSet.fromFuzzyString(clause.term, clause.editDistance)\n } else {\n return lunr.TokenSet.fromString(clause.term)\n }\n}\n\n/**\n * Creates a token set representing a single string with a specified\n * edit distance.\n *\n * Insertions, deletions, substitutions and transpositions are each\n * treated as an edit distance of 1.\n *\n * Increasing the allowed edit distance will have a dramatic impact\n * on the performance of both creating and intersecting these TokenSets.\n * It is advised to keep the edit distance less than 3.\n *\n * @param {string} str - The string to create the token set from.\n * @param {number} editDistance - The allowed edit distance to match.\n * @returns {lunr.Vector}\n */\nlunr.TokenSet.fromFuzzyString = function (str, editDistance) {\n var root = new lunr.TokenSet\n\n var stack = [{\n node: root,\n editsRemaining: editDistance,\n str: str\n }]\n\n while (stack.length) {\n var frame = stack.pop()\n\n // no edit\n if (frame.str.length > 0) {\n var char = frame.str.charAt(0),\n noEditNode\n\n if (char in frame.node.edges) {\n noEditNode = frame.node.edges[char]\n } else {\n noEditNode = new lunr.TokenSet\n frame.node.edges[char] = noEditNode\n }\n\n if (frame.str.length == 1) {\n noEditNode.final = true\n }\n\n stack.push({\n node: noEditNode,\n editsRemaining: frame.editsRemaining,\n str: frame.str.slice(1)\n })\n }\n\n if (frame.editsRemaining == 0) {\n continue\n }\n\n // insertion\n if (\"*\" in frame.node.edges) {\n var insertionNode = frame.node.edges[\"*\"]\n } else {\n var insertionNode = new lunr.TokenSet\n frame.node.edges[\"*\"] = insertionNode\n }\n\n if (frame.str.length == 0) {\n insertionNode.final = true\n }\n\n stack.push({\n node: insertionNode,\n editsRemaining: frame.editsRemaining - 1,\n str: frame.str\n })\n\n // deletion\n // can only do a deletion if we have enough edits remaining\n // and if there are characters left to delete in the string\n if (frame.str.length > 1) {\n stack.push({\n node: frame.node,\n editsRemaining: frame.editsRemaining - 1,\n str: frame.str.slice(1)\n })\n }\n\n // deletion\n // just removing the last character from the str\n if (frame.str.length == 1) {\n frame.node.final = true\n }\n\n // substitution\n // can only do a substitution if we have enough edits remaining\n // and if there are characters left to substitute\n if (frame.str.length >= 1) {\n if (\"*\" in frame.node.edges) {\n var substitutionNode = frame.node.edges[\"*\"]\n } else {\n var substitutionNode = new lunr.TokenSet\n frame.node.edges[\"*\"] = substitutionNode\n }\n\n if (frame.str.length == 1) {\n substitutionNode.final = true\n }\n\n stack.push({\n node: substitutionNode,\n editsRemaining: frame.editsRemaining - 1,\n str: frame.str.slice(1)\n })\n }\n\n // transposition\n // can only do a transposition if there are edits remaining\n // and there are enough characters to transpose\n if (frame.str.length > 1) {\n var charA = frame.str.charAt(0),\n charB = frame.str.charAt(1),\n transposeNode\n\n if (charB in frame.node.edges) {\n transposeNode = frame.node.edges[charB]\n } else {\n transposeNode = new lunr.TokenSet\n frame.node.edges[charB] = transposeNode\n }\n\n if (frame.str.length == 1) {\n transposeNode.final = true\n }\n\n stack.push({\n node: transposeNode,\n editsRemaining: frame.editsRemaining - 1,\n str: charA + frame.str.slice(2)\n })\n }\n }\n\n return root\n}\n\n/**\n * Creates a TokenSet from a string.\n *\n * The string may contain one or more wildcard characters (*)\n * that will allow wildcard matching when intersecting with\n * another TokenSet.\n *\n * @param {string} str - The string to create a TokenSet from.\n * @returns {lunr.TokenSet}\n */\nlunr.TokenSet.fromString = function (str) {\n var node = new lunr.TokenSet,\n root = node\n\n /*\n * Iterates through all characters within the passed string\n * appending a node for each character.\n *\n * When a wildcard character is found then a self\n * referencing edge is introduced to continually match\n * any number of any characters.\n */\n for (var i = 0, len = str.length; i < len; i++) {\n var char = str[i],\n final = (i == len - 1)\n\n if (char == \"*\") {\n node.edges[char] = node\n node.final = final\n\n } else {\n var next = new lunr.TokenSet\n next.final = final\n\n node.edges[char] = next\n node = next\n }\n }\n\n return root\n}\n\n/**\n * Converts this TokenSet into an array of strings\n * contained within the TokenSet.\n *\n * This is not intended to be used on a TokenSet that\n * contains wildcards, in these cases the results are\n * undefined and are likely to cause an infinite loop.\n *\n * @returns {string[]}\n */\nlunr.TokenSet.prototype.toArray = function () {\n var words = []\n\n var stack = [{\n prefix: \"\",\n node: this\n }]\n\n while (stack.length) {\n var frame = stack.pop(),\n edges = Object.keys(frame.node.edges),\n len = edges.length\n\n if (frame.node.final) {\n /* In Safari, at this point the prefix is sometimes corrupted, see:\n * https://github.com/olivernn/lunr.js/issues/279 Calling any\n * String.prototype method forces Safari to \"cast\" this string to what\n * it's supposed to be, fixing the bug. */\n frame.prefix.charAt(0)\n words.push(frame.prefix)\n }\n\n for (var i = 0; i < len; i++) {\n var edge = edges[i]\n\n stack.push({\n prefix: frame.prefix.concat(edge),\n node: frame.node.edges[edge]\n })\n }\n }\n\n return words\n}\n\n/**\n * Generates a string representation of a TokenSet.\n *\n * This is intended to allow TokenSets to be used as keys\n * in objects, largely to aid the construction and minimisation\n * of a TokenSet. As such it is not designed to be a human\n * friendly representation of the TokenSet.\n *\n * @returns {string}\n */\nlunr.TokenSet.prototype.toString = function () {\n // NOTE: Using Object.keys here as this.edges is very likely\n // to enter 'hash-mode' with many keys being added\n //\n // avoiding a for-in loop here as it leads to the function\n // being de-optimised (at least in V8). From some simple\n // benchmarks the performance is comparable, but allowing\n // V8 to optimize may mean easy performance wins in the future.\n\n if (this._str) {\n return this._str\n }\n\n var str = this.final ? '1' : '0',\n labels = Object.keys(this.edges).sort(),\n len = labels.length\n\n for (var i = 0; i < len; i++) {\n var label = labels[i],\n node = this.edges[label]\n\n str = str + label + node.id\n }\n\n return str\n}\n\n/**\n * Returns a new TokenSet that is the intersection of\n * this TokenSet and the passed TokenSet.\n *\n * This intersection will take into account any wildcards\n * contained within the TokenSet.\n *\n * @param {lunr.TokenSet} b - An other TokenSet to intersect with.\n * @returns {lunr.TokenSet}\n */\nlunr.TokenSet.prototype.intersect = function (b) {\n var output = new lunr.TokenSet,\n frame = undefined\n\n var stack = [{\n qNode: b,\n output: output,\n node: this\n }]\n\n while (stack.length) {\n frame = stack.pop()\n\n // NOTE: As with the #toString method, we are using\n // Object.keys and a for loop instead of a for-in loop\n // as both of these objects enter 'hash' mode, causing\n // the function to be de-optimised in V8\n var qEdges = Object.keys(frame.qNode.edges),\n qLen = qEdges.length,\n nEdges = Object.keys(frame.node.edges),\n nLen = nEdges.length\n\n for (var q = 0; q < qLen; q++) {\n var qEdge = qEdges[q]\n\n for (var n = 0; n < nLen; n++) {\n var nEdge = nEdges[n]\n\n if (nEdge == qEdge || qEdge == '*') {\n var node = frame.node.edges[nEdge],\n qNode = frame.qNode.edges[qEdge],\n final = node.final && qNode.final,\n next = undefined\n\n if (nEdge in frame.output.edges) {\n // an edge already exists for this character\n // no need to create a new node, just set the finality\n // bit unless this node is already final\n next = frame.output.edges[nEdge]\n next.final = next.final || final\n\n } else {\n // no edge exists yet, must create one\n // set the finality bit and insert it\n // into the output\n next = new lunr.TokenSet\n next.final = final\n frame.output.edges[nEdge] = next\n }\n\n stack.push({\n qNode: qNode,\n output: next,\n node: node\n })\n }\n }\n }\n }\n\n return output\n}\nlunr.TokenSet.Builder = function () {\n this.previousWord = \"\"\n this.root = new lunr.TokenSet\n this.uncheckedNodes = []\n this.minimizedNodes = {}\n}\n\nlunr.TokenSet.Builder.prototype.insert = function (word) {\n var node,\n commonPrefix = 0\n\n if (word < this.previousWord) {\n throw new Error (\"Out of order word insertion\")\n }\n\n for (var i = 0; i < word.length && i < this.previousWord.length; i++) {\n if (word[i] != this.previousWord[i]) break\n commonPrefix++\n }\n\n this.minimize(commonPrefix)\n\n if (this.uncheckedNodes.length == 0) {\n node = this.root\n } else {\n node = this.uncheckedNodes[this.uncheckedNodes.length - 1].child\n }\n\n for (var i = commonPrefix; i < word.length; i++) {\n var nextNode = new lunr.TokenSet,\n char = word[i]\n\n node.edges[char] = nextNode\n\n this.uncheckedNodes.push({\n parent: node,\n char: char,\n child: nextNode\n })\n\n node = nextNode\n }\n\n node.final = true\n this.previousWord = word\n}\n\nlunr.TokenSet.Builder.prototype.finish = function () {\n this.minimize(0)\n}\n\nlunr.TokenSet.Builder.prototype.minimize = function (downTo) {\n for (var i = this.uncheckedNodes.length - 1; i >= downTo; i--) {\n var node = this.uncheckedNodes[i],\n childKey = node.child.toString()\n\n if (childKey in this.minimizedNodes) {\n node.parent.edges[node.char] = this.minimizedNodes[childKey]\n } else {\n // Cache the key for this node since\n // we know it can't change anymore\n node.child._str = childKey\n\n this.minimizedNodes[childKey] = node.child\n }\n\n this.uncheckedNodes.pop()\n }\n}\n/*!\n * lunr.Index\n * Copyright (C) 2019 Oliver Nightingale\n */\n\n/**\n * An index contains the built index of all documents and provides a query interface\n * to the index.\n *\n * Usually instances of lunr.Index will not be created using this constructor, instead\n * lunr.Builder should be used to construct new indexes, or lunr.Index.load should be\n * used to load previously built and serialized indexes.\n *\n * @constructor\n * @param {Object} attrs - The attributes of the built search index.\n * @param {Object} attrs.invertedIndex - An index of term/field to document reference.\n * @param {Object} attrs.fieldVectors - Field vectors\n * @param {lunr.TokenSet} attrs.tokenSet - An set of all corpus tokens.\n * @param {string[]} attrs.fields - The names of indexed document fields.\n * @param {lunr.Pipeline} attrs.pipeline - The pipeline to use for search terms.\n */\nlunr.Index = function (attrs) {\n this.invertedIndex = attrs.invertedIndex\n this.fieldVectors = attrs.fieldVectors\n this.tokenSet = attrs.tokenSet\n this.fields = attrs.fields\n this.pipeline = attrs.pipeline\n}\n\n/**\n * A result contains details of a document matching a search query.\n * @typedef {Object} lunr.Index~Result\n * @property {string} ref - The reference of the document this result represents.\n * @property {number} score - A number between 0 and 1 representing how similar this document is to the query.\n * @property {lunr.MatchData} matchData - Contains metadata about this match including which term(s) caused the match.\n */\n\n/**\n * Although lunr provides the ability to create queries using lunr.Query, it also provides a simple\n * query language which itself is parsed into an instance of lunr.Query.\n *\n * For programmatically building queries it is advised to directly use lunr.Query, the query language\n * is best used for human entered text rather than program generated text.\n *\n * At its simplest queries can just be a single term, e.g. `hello`, multiple terms are also supported\n * and will be combined with OR, e.g `hello world` will match documents that contain either 'hello'\n * or 'world', though those that contain both will rank higher in the results.\n *\n * Wildcards can be included in terms to match one or more unspecified characters, these wildcards can\n * be inserted anywhere within the term, and more than one wildcard can exist in a single term. Adding\n * wildcards will increase the number of documents that will be found but can also have a negative\n * impact on query performance, especially with wildcards at the beginning of a term.\n *\n * Terms can be restricted to specific fields, e.g. `title:hello`, only documents with the term\n * hello in the title field will match this query. Using a field not present in the index will lead\n * to an error being thrown.\n *\n * Modifiers can also be added to terms, lunr supports edit distance and boost modifiers on terms. A term\n * boost will make documents matching that term score higher, e.g. `foo^5`. Edit distance is also supported\n * to provide fuzzy matching, e.g. 'hello~2' will match documents with hello with an edit distance of 2.\n * Avoid large values for edit distance to improve query performance.\n *\n * Each term also supports a presence modifier. By default a term's presence in document is optional, however\n * this can be changed to either required or prohibited. For a term's presence to be required in a document the\n * term should be prefixed with a '+', e.g. `+foo bar` is a search for documents that must contain 'foo' and\n * optionally contain 'bar'. Conversely a leading '-' sets the terms presence to prohibited, i.e. it must not\n * appear in a document, e.g. `-foo bar` is a search for documents that do not contain 'foo' but may contain 'bar'.\n *\n * To escape special characters the backslash character '\\' can be used, this allows searches to include\n * characters that would normally be considered modifiers, e.g. `foo\\~2` will search for a term \"foo~2\" instead\n * of attempting to apply a boost of 2 to the search term \"foo\".\n *\n * @typedef {string} lunr.Index~QueryString\n * @example Simple single term query\n * hello\n * @example Multiple term query\n * hello world\n * @example term scoped to a field\n * title:hello\n * @example term with a boost of 10\n * hello^10\n * @example term with an edit distance of 2\n * hello~2\n * @example terms with presence modifiers\n * -foo +bar baz\n */\n\n/**\n * Performs a search against the index using lunr query syntax.\n *\n * Results will be returned sorted by their score, the most relevant results\n * will be returned first. For details on how the score is calculated, please see\n * the {@link https://lunrjs.com/guides/searching.html#scoring|guide}.\n *\n * For more programmatic querying use lunr.Index#query.\n *\n * @param {lunr.Index~QueryString} queryString - A string containing a lunr query.\n * @throws {lunr.QueryParseError} If the passed query string cannot be parsed.\n * @returns {lunr.Index~Result[]}\n */\nlunr.Index.prototype.search = function (queryString) {\n return this.query(function (query) {\n var parser = new lunr.QueryParser(queryString, query)\n parser.parse()\n })\n}\n\n/**\n * A query builder callback provides a query object to be used to express\n * the query to perform on the index.\n *\n * @callback lunr.Index~queryBuilder\n * @param {lunr.Query} query - The query object to build up.\n * @this lunr.Query\n */\n\n/**\n * Performs a query against the index using the yielded lunr.Query object.\n *\n * If performing programmatic queries against the index, this method is preferred\n * over lunr.Index#search so as to avoid the additional query parsing overhead.\n *\n * A query object is yielded to the supplied function which should be used to\n * express the query to be run against the index.\n *\n * Note that although this function takes a callback parameter it is _not_ an\n * asynchronous operation, the callback is just yielded a query object to be\n * customized.\n *\n * @param {lunr.Index~queryBuilder} fn - A function that is used to build the query.\n * @returns {lunr.Index~Result[]}\n */\nlunr.Index.prototype.query = function (fn) {\n // for each query clause\n // * process terms\n // * expand terms from token set\n // * find matching documents and metadata\n // * get document vectors\n // * score documents\n\n var query = new lunr.Query(this.fields),\n matchingFields = Object.create(null),\n queryVectors = Object.create(null),\n termFieldCache = Object.create(null),\n requiredMatches = Object.create(null),\n prohibitedMatches = Object.create(null)\n\n /*\n * To support field level boosts a query vector is created per\n * field. An empty vector is eagerly created to support negated\n * queries.\n */\n for (var i = 0; i < this.fields.length; i++) {\n queryVectors[this.fields[i]] = new lunr.Vector\n }\n\n fn.call(query, query)\n\n for (var i = 0; i < query.clauses.length; i++) {\n /*\n * Unless the pipeline has been disabled for this term, which is\n * the case for terms with wildcards, we need to pass the clause\n * term through the search pipeline. A pipeline returns an array\n * of processed terms. Pipeline functions may expand the passed\n * term, which means we may end up performing multiple index lookups\n * for a single query term.\n */\n var clause = query.clauses[i],\n terms = null,\n clauseMatches = lunr.Set.complete\n\n if (clause.usePipeline) {\n terms = this.pipeline.runString(clause.term, {\n fields: clause.fields\n })\n } else {\n terms = [clause.term]\n }\n\n for (var m = 0; m < terms.length; m++) {\n var term = terms[m]\n\n /*\n * Each term returned from the pipeline needs to use the same query\n * clause object, e.g. the same boost and or edit distance. The\n * simplest way to do this is to re-use the clause object but mutate\n * its term property.\n */\n clause.term = term\n\n /*\n * From the term in the clause we create a token set which will then\n * be used to intersect the indexes token set to get a list of terms\n * to lookup in the inverted index\n */\n var termTokenSet = lunr.TokenSet.fromClause(clause),\n expandedTerms = this.tokenSet.intersect(termTokenSet).toArray()\n\n /*\n * If a term marked as required does not exist in the tokenSet it is\n * impossible for the search to return any matches. We set all the field\n * scoped required matches set to empty and stop examining any further\n * clauses.\n */\n if (expandedTerms.length === 0 && clause.presence === lunr.Query.presence.REQUIRED) {\n for (var k = 0; k < clause.fields.length; k++) {\n var field = clause.fields[k]\n requiredMatches[field] = lunr.Set.empty\n }\n\n break\n }\n\n for (var j = 0; j < expandedTerms.length; j++) {\n /*\n * For each term get the posting and termIndex, this is required for\n * building the query vector.\n */\n var expandedTerm = expandedTerms[j],\n posting = this.invertedIndex[expandedTerm],\n termIndex = posting._index\n\n for (var k = 0; k < clause.fields.length; k++) {\n /*\n * For each field that this query term is scoped by (by default\n * all fields are in scope) we need to get all the document refs\n * that have this term in that field.\n *\n * The posting is the entry in the invertedIndex for the matching\n * term from above.\n */\n var field = clause.fields[k],\n fieldPosting = posting[field],\n matchingDocumentRefs = Object.keys(fieldPosting),\n termField = expandedTerm + \"/\" + field,\n matchingDocumentsSet = new lunr.Set(matchingDocumentRefs)\n\n /*\n * if the presence of this term is required ensure that the matching\n * documents are added to the set of required matches for this clause.\n *\n */\n if (clause.presence == lunr.Query.presence.REQUIRED) {\n clauseMatches = clauseMatches.union(matchingDocumentsSet)\n\n if (requiredMatches[field] === undefined) {\n requiredMatches[field] = lunr.Set.complete\n }\n }\n\n /*\n * if the presence of this term is prohibited ensure that the matching\n * documents are added to the set of prohibited matches for this field,\n * creating that set if it does not yet exist.\n */\n if (clause.presence == lunr.Query.presence.PROHIBITED) {\n if (prohibitedMatches[field] === undefined) {\n prohibitedMatches[field] = lunr.Set.empty\n }\n\n prohibitedMatches[field] = prohibitedMatches[field].union(matchingDocumentsSet)\n\n /*\n * Prohibited matches should not be part of the query vector used for\n * similarity scoring and no metadata should be extracted so we continue\n * to the next field\n */\n continue\n }\n\n /*\n * The query field vector is populated using the termIndex found for\n * the term and a unit value with the appropriate boost applied.\n * Using upsert because there could already be an entry in the vector\n * for the term we are working with. In that case we just add the scores\n * together.\n */\n queryVectors[field].upsert(termIndex, clause.boost, function (a, b) { return a + b })\n\n /**\n * If we've already seen this term, field combo then we've already collected\n * the matching documents and metadata, no need to go through all that again\n */\n if (termFieldCache[termField]) {\n continue\n }\n\n for (var l = 0; l < matchingDocumentRefs.length; l++) {\n /*\n * All metadata for this term/field/document triple\n * are then extracted and collected into an instance\n * of lunr.MatchData ready to be returned in the query\n * results\n */\n var matchingDocumentRef = matchingDocumentRefs[l],\n matchingFieldRef = new lunr.FieldRef (matchingDocumentRef, field),\n metadata = fieldPosting[matchingDocumentRef],\n fieldMatch\n\n if ((fieldMatch = matchingFields[matchingFieldRef]) === undefined) {\n matchingFields[matchingFieldRef] = new lunr.MatchData (expandedTerm, field, metadata)\n } else {\n fieldMatch.add(expandedTerm, field, metadata)\n }\n\n }\n\n termFieldCache[termField] = true\n }\n }\n }\n\n /**\n * If the presence was required we need to update the requiredMatches field sets.\n * We do this after all fields for the term have collected their matches because\n * the clause terms presence is required in _any_ of the fields not _all_ of the\n * fields.\n */\n if (clause.presence === lunr.Query.presence.REQUIRED) {\n for (var k = 0; k < clause.fields.length; k++) {\n var field = clause.fields[k]\n requiredMatches[field] = requiredMatches[field].intersect(clauseMatches)\n }\n }\n }\n\n /**\n * Need to combine the field scoped required and prohibited\n * matching documents into a global set of required and prohibited\n * matches\n */\n var allRequiredMatches = lunr.Set.complete,\n allProhibitedMatches = lunr.Set.empty\n\n for (var i = 0; i < this.fields.length; i++) {\n var field = this.fields[i]\n\n if (requiredMatches[field]) {\n allRequiredMatches = allRequiredMatches.intersect(requiredMatches[field])\n }\n\n if (prohibitedMatches[field]) {\n allProhibitedMatches = allProhibitedMatches.union(prohibitedMatches[field])\n }\n }\n\n var matchingFieldRefs = Object.keys(matchingFields),\n results = [],\n matches = Object.create(null)\n\n /*\n * If the query is negated (contains only prohibited terms)\n * we need to get _all_ fieldRefs currently existing in the\n * index. This is only done when we know that the query is\n * entirely prohibited terms to avoid any cost of getting all\n * fieldRefs unnecessarily.\n *\n * Additionally, blank MatchData must be created to correctly\n * populate the results.\n */\n if (query.isNegated()) {\n matchingFieldRefs = Object.keys(this.fieldVectors)\n\n for (var i = 0; i < matchingFieldRefs.length; i++) {\n var matchingFieldRef = matchingFieldRefs[i]\n var fieldRef = lunr.FieldRef.fromString(matchingFieldRef)\n matchingFields[matchingFieldRef] = new lunr.MatchData\n }\n }\n\n for (var i = 0; i < matchingFieldRefs.length; i++) {\n /*\n * Currently we have document fields that match the query, but we\n * need to return documents. The matchData and scores are combined\n * from multiple fields belonging to the same document.\n *\n * Scores are calculated by field, using the query vectors created\n * above, and combined into a final document score using addition.\n */\n var fieldRef = lunr.FieldRef.fromString(matchingFieldRefs[i]),\n docRef = fieldRef.docRef\n\n if (!allRequiredMatches.contains(docRef)) {\n continue\n }\n\n if (allProhibitedMatches.contains(docRef)) {\n continue\n }\n\n var fieldVector = this.fieldVectors[fieldRef],\n score = queryVectors[fieldRef.fieldName].similarity(fieldVector),\n docMatch\n\n if ((docMatch = matches[docRef]) !== undefined) {\n docMatch.score += score\n docMatch.matchData.combine(matchingFields[fieldRef])\n } else {\n var match = {\n ref: docRef,\n score: score,\n matchData: matchingFields[fieldRef]\n }\n matches[docRef] = match\n results.push(match)\n }\n }\n\n /*\n * Sort the results objects by score, highest first.\n */\n return results.sort(function (a, b) {\n return b.score - a.score\n })\n}\n\n/**\n * Prepares the index for JSON serialization.\n *\n * The schema for this JSON blob will be described in a\n * separate JSON schema file.\n *\n * @returns {Object}\n */\nlunr.Index.prototype.toJSON = function () {\n var invertedIndex = Object.keys(this.invertedIndex)\n .sort()\n .map(function (term) {\n return [term, this.invertedIndex[term]]\n }, this)\n\n var fieldVectors = Object.keys(this.fieldVectors)\n .map(function (ref) {\n return [ref, this.fieldVectors[ref].toJSON()]\n }, this)\n\n return {\n version: lunr.version,\n fields: this.fields,\n fieldVectors: fieldVectors,\n invertedIndex: invertedIndex,\n pipeline: this.pipeline.toJSON()\n }\n}\n\n/**\n * Loads a previously serialized lunr.Index\n *\n * @param {Object} serializedIndex - A previously serialized lunr.Index\n * @returns {lunr.Index}\n */\nlunr.Index.load = function (serializedIndex) {\n var attrs = {},\n fieldVectors = {},\n serializedVectors = serializedIndex.fieldVectors,\n invertedIndex = Object.create(null),\n serializedInvertedIndex = serializedIndex.invertedIndex,\n tokenSetBuilder = new lunr.TokenSet.Builder,\n pipeline = lunr.Pipeline.load(serializedIndex.pipeline)\n\n if (serializedIndex.version != lunr.version) {\n lunr.utils.warn(\"Version mismatch when loading serialised index. Current version of lunr '\" + lunr.version + \"' does not match serialized index '\" + serializedIndex.version + \"'\")\n }\n\n for (var i = 0; i < serializedVectors.length; i++) {\n var tuple = serializedVectors[i],\n ref = tuple[0],\n elements = tuple[1]\n\n fieldVectors[ref] = new lunr.Vector(elements)\n }\n\n for (var i = 0; i < serializedInvertedIndex.length; i++) {\n var tuple = serializedInvertedIndex[i],\n term = tuple[0],\n posting = tuple[1]\n\n tokenSetBuilder.insert(term)\n invertedIndex[term] = posting\n }\n\n tokenSetBuilder.finish()\n\n attrs.fields = serializedIndex.fields\n\n attrs.fieldVectors = fieldVectors\n attrs.invertedIndex = invertedIndex\n attrs.tokenSet = tokenSetBuilder.root\n attrs.pipeline = pipeline\n\n return new lunr.Index(attrs)\n}\n/*!\n * lunr.Builder\n * Copyright (C) 2019 Oliver Nightingale\n */\n\n/**\n * lunr.Builder performs indexing on a set of documents and\n * returns instances of lunr.Index ready for querying.\n *\n * All configuration of the index is done via the builder, the\n * fields to index, the document reference, the text processing\n * pipeline and document scoring parameters are all set on the\n * builder before indexing.\n *\n * @constructor\n * @property {string} _ref - Internal reference to the document reference field.\n * @property {string[]} _fields - Internal reference to the document fields to index.\n * @property {object} invertedIndex - The inverted index maps terms to document fields.\n * @property {object} documentTermFrequencies - Keeps track of document term frequencies.\n * @property {object} documentLengths - Keeps track of the length of documents added to the index.\n * @property {lunr.tokenizer} tokenizer - Function for splitting strings into tokens for indexing.\n * @property {lunr.Pipeline} pipeline - The pipeline performs text processing on tokens before indexing.\n * @property {lunr.Pipeline} searchPipeline - A pipeline for processing search terms before querying the index.\n * @property {number} documentCount - Keeps track of the total number of documents indexed.\n * @property {number} _b - A parameter to control field length normalization, setting this to 0 disabled normalization, 1 fully normalizes field lengths, the default value is 0.75.\n * @property {number} _k1 - A parameter to control how quickly an increase in term frequency results in term frequency saturation, the default value is 1.2.\n * @property {number} termIndex - A counter incremented for each unique term, used to identify a terms position in the vector space.\n * @property {array} metadataWhitelist - A list of metadata keys that have been whitelisted for entry in the index.\n */\nlunr.Builder = function () {\n this._ref = \"id\"\n this._fields = Object.create(null)\n this._documents = Object.create(null)\n this.invertedIndex = Object.create(null)\n this.fieldTermFrequencies = {}\n this.fieldLengths = {}\n this.tokenizer = lunr.tokenizer\n this.pipeline = new lunr.Pipeline\n this.searchPipeline = new lunr.Pipeline\n this.documentCount = 0\n this._b = 0.75\n this._k1 = 1.2\n this.termIndex = 0\n this.metadataWhitelist = []\n}\n\n/**\n * Sets the document field used as the document reference. Every document must have this field.\n * The type of this field in the document should be a string, if it is not a string it will be\n * coerced into a string by calling toString.\n *\n * The default ref is 'id'.\n *\n * The ref should _not_ be changed during indexing, it should be set before any documents are\n * added to the index. Changing it during indexing can lead to inconsistent results.\n *\n * @param {string} ref - The name of the reference field in the document.\n */\nlunr.Builder.prototype.ref = function (ref) {\n this._ref = ref\n}\n\n/**\n * A function that is used to extract a field from a document.\n *\n * Lunr expects a field to be at the top level of a document, if however the field\n * is deeply nested within a document an extractor function can be used to extract\n * the right field for indexing.\n *\n * @callback fieldExtractor\n * @param {object} doc - The document being added to the index.\n * @returns {?(string|object|object[])} obj - The object that will be indexed for this field.\n * @example Extracting a nested field\n * function (doc) { return doc.nested.field }\n */\n\n/**\n * Adds a field to the list of document fields that will be indexed. Every document being\n * indexed should have this field. Null values for this field in indexed documents will\n * not cause errors but will limit the chance of that document being retrieved by searches.\n *\n * All fields should be added before adding documents to the index. Adding fields after\n * a document has been indexed will have no effect on already indexed documents.\n *\n * Fields can be boosted at build time. This allows terms within that field to have more\n * importance when ranking search results. Use a field boost to specify that matches within\n * one field are more important than other fields.\n *\n * @param {string} fieldName - The name of a field to index in all documents.\n * @param {object} attributes - Optional attributes associated with this field.\n * @param {number} [attributes.boost=1] - Boost applied to all terms within this field.\n * @param {fieldExtractor} [attributes.extractor] - Function to extract a field from a document.\n * @throws {RangeError} fieldName cannot contain unsupported characters '/'\n */\nlunr.Builder.prototype.field = function (fieldName, attributes) {\n if (/\\//.test(fieldName)) {\n throw new RangeError (\"Field '\" + fieldName + \"' contains illegal character '/'\")\n }\n\n this._fields[fieldName] = attributes || {}\n}\n\n/**\n * A parameter to tune the amount of field length normalisation that is applied when\n * calculating relevance scores. A value of 0 will completely disable any normalisation\n * and a value of 1 will fully normalise field lengths. The default is 0.75. Values of b\n * will be clamped to the range 0 - 1.\n *\n * @param {number} number - The value to set for this tuning parameter.\n */\nlunr.Builder.prototype.b = function (number) {\n if (number < 0) {\n this._b = 0\n } else if (number > 1) {\n this._b = 1\n } else {\n this._b = number\n }\n}\n\n/**\n * A parameter that controls the speed at which a rise in term frequency results in term\n * frequency saturation. The default value is 1.2. Setting this to a higher value will give\n * slower saturation levels, a lower value will result in quicker saturation.\n *\n * @param {number} number - The value to set for this tuning parameter.\n */\nlunr.Builder.prototype.k1 = function (number) {\n this._k1 = number\n}\n\n/**\n * Adds a document to the index.\n *\n * Before adding fields to the index the index should have been fully setup, with the document\n * ref and all fields to index already having been specified.\n *\n * The document must have a field name as specified by the ref (by default this is 'id') and\n * it should have all fields defined for indexing, though null or undefined values will not\n * cause errors.\n *\n * Entire documents can be boosted at build time. Applying a boost to a document indicates that\n * this document should rank higher in search results than other documents.\n *\n * @param {object} doc - The document to add to the index.\n * @param {object} attributes - Optional attributes associated with this document.\n * @param {number} [attributes.boost=1] - Boost applied to all terms within this document.\n */\nlunr.Builder.prototype.add = function (doc, attributes) {\n var docRef = doc[this._ref],\n fields = Object.keys(this._fields)\n\n this._documents[docRef] = attributes || {}\n this.documentCount += 1\n\n for (var i = 0; i < fields.length; i++) {\n var fieldName = fields[i],\n extractor = this._fields[fieldName].extractor,\n field = extractor ? extractor(doc) : doc[fieldName],\n tokens = this.tokenizer(field, {\n fields: [fieldName]\n }),\n terms = this.pipeline.run(tokens),\n fieldRef = new lunr.FieldRef (docRef, fieldName),\n fieldTerms = Object.create(null)\n\n this.fieldTermFrequencies[fieldRef] = fieldTerms\n this.fieldLengths[fieldRef] = 0\n\n // store the length of this field for this document\n this.fieldLengths[fieldRef] += terms.length\n\n // calculate term frequencies for this field\n for (var j = 0; j < terms.length; j++) {\n var term = terms[j]\n\n if (fieldTerms[term] == undefined) {\n fieldTerms[term] = 0\n }\n\n fieldTerms[term] += 1\n\n // add to inverted index\n // create an initial posting if one doesn't exist\n if (this.invertedIndex[term] == undefined) {\n var posting = Object.create(null)\n posting[\"_index\"] = this.termIndex\n this.termIndex += 1\n\n for (var k = 0; k < fields.length; k++) {\n posting[fields[k]] = Object.create(null)\n }\n\n this.invertedIndex[term] = posting\n }\n\n // add an entry for this term/fieldName/docRef to the invertedIndex\n if (this.invertedIndex[term][fieldName][docRef] == undefined) {\n this.invertedIndex[term][fieldName][docRef] = Object.create(null)\n }\n\n // store all whitelisted metadata about this token in the\n // inverted index\n for (var l = 0; l < this.metadataWhitelist.length; l++) {\n var metadataKey = this.metadataWhitelist[l],\n metadata = term.metadata[metadataKey]\n\n if (this.invertedIndex[term][fieldName][docRef][metadataKey] == undefined) {\n this.invertedIndex[term][fieldName][docRef][metadataKey] = []\n }\n\n this.invertedIndex[term][fieldName][docRef][metadataKey].push(metadata)\n }\n }\n\n }\n}\n\n/**\n * Calculates the average document length for this index\n *\n * @private\n */\nlunr.Builder.prototype.calculateAverageFieldLengths = function () {\n\n var fieldRefs = Object.keys(this.fieldLengths),\n numberOfFields = fieldRefs.length,\n accumulator = {},\n documentsWithField = {}\n\n for (var i = 0; i < numberOfFields; i++) {\n var fieldRef = lunr.FieldRef.fromString(fieldRefs[i]),\n field = fieldRef.fieldName\n\n documentsWithField[field] || (documentsWithField[field] = 0)\n documentsWithField[field] += 1\n\n accumulator[field] || (accumulator[field] = 0)\n accumulator[field] += this.fieldLengths[fieldRef]\n }\n\n var fields = Object.keys(this._fields)\n\n for (var i = 0; i < fields.length; i++) {\n var fieldName = fields[i]\n accumulator[fieldName] = accumulator[fieldName] / documentsWithField[fieldName]\n }\n\n this.averageFieldLength = accumulator\n}\n\n/**\n * Builds a vector space model of every document using lunr.Vector\n *\n * @private\n */\nlunr.Builder.prototype.createFieldVectors = function () {\n var fieldVectors = {},\n fieldRefs = Object.keys(this.fieldTermFrequencies),\n fieldRefsLength = fieldRefs.length,\n termIdfCache = Object.create(null)\n\n for (var i = 0; i < fieldRefsLength; i++) {\n var fieldRef = lunr.FieldRef.fromString(fieldRefs[i]),\n fieldName = fieldRef.fieldName,\n fieldLength = this.fieldLengths[fieldRef],\n fieldVector = new lunr.Vector,\n termFrequencies = this.fieldTermFrequencies[fieldRef],\n terms = Object.keys(termFrequencies),\n termsLength = terms.length\n\n\n var fieldBoost = this._fields[fieldName].boost || 1,\n docBoost = this._documents[fieldRef.docRef].boost || 1\n\n for (var j = 0; j < termsLength; j++) {\n var term = terms[j],\n tf = termFrequencies[term],\n termIndex = this.invertedIndex[term]._index,\n idf, score, scoreWithPrecision\n\n if (termIdfCache[term] === undefined) {\n idf = lunr.idf(this.invertedIndex[term], this.documentCount)\n termIdfCache[term] = idf\n } else {\n idf = termIdfCache[term]\n }\n\n score = idf * ((this._k1 + 1) * tf) / (this._k1 * (1 - this._b + this._b * (fieldLength / this.averageFieldLength[fieldName])) + tf)\n score *= fieldBoost\n score *= docBoost\n scoreWithPrecision = Math.round(score * 1000) / 1000\n // Converts 1.23456789 to 1.234.\n // Reducing the precision so that the vectors take up less\n // space when serialised. Doing it now so that they behave\n // the same before and after serialisation. Also, this is\n // the fastest approach to reducing a number's precision in\n // JavaScript.\n\n fieldVector.insert(termIndex, scoreWithPrecision)\n }\n\n fieldVectors[fieldRef] = fieldVector\n }\n\n this.fieldVectors = fieldVectors\n}\n\n/**\n * Creates a token set of all tokens in the index using lunr.TokenSet\n *\n * @private\n */\nlunr.Builder.prototype.createTokenSet = function () {\n this.tokenSet = lunr.TokenSet.fromArray(\n Object.keys(this.invertedIndex).sort()\n )\n}\n\n/**\n * Builds the index, creating an instance of lunr.Index.\n *\n * This completes the indexing process and should only be called\n * once all documents have been added to the index.\n *\n * @returns {lunr.Index}\n */\nlunr.Builder.prototype.build = function () {\n this.calculateAverageFieldLengths()\n this.createFieldVectors()\n this.createTokenSet()\n\n return new lunr.Index({\n invertedIndex: this.invertedIndex,\n fieldVectors: this.fieldVectors,\n tokenSet: this.tokenSet,\n fields: Object.keys(this._fields),\n pipeline: this.searchPipeline\n })\n}\n\n/**\n * Applies a plugin to the index builder.\n *\n * A plugin is a function that is called with the index builder as its context.\n * Plugins can be used to customise or extend the behaviour of the index\n * in some way. A plugin is just a function, that encapsulated the custom\n * behaviour that should be applied when building the index.\n *\n * The plugin function will be called with the index builder as its argument, additional\n * arguments can also be passed when calling use. The function will be called\n * with the index builder as its context.\n *\n * @param {Function} plugin The plugin to apply.\n */\nlunr.Builder.prototype.use = function (fn) {\n var args = Array.prototype.slice.call(arguments, 1)\n args.unshift(this)\n fn.apply(this, args)\n}\n/**\n * Contains and collects metadata about a matching document.\n * A single instance of lunr.MatchData is returned as part of every\n * lunr.Index~Result.\n *\n * @constructor\n * @param {string} term - The term this match data is associated with\n * @param {string} field - The field in which the term was found\n * @param {object} metadata - The metadata recorded about this term in this field\n * @property {object} metadata - A cloned collection of metadata associated with this document.\n * @see {@link lunr.Index~Result}\n */\nlunr.MatchData = function (term, field, metadata) {\n var clonedMetadata = Object.create(null),\n metadataKeys = Object.keys(metadata || {})\n\n // Cloning the metadata to prevent the original\n // being mutated during match data combination.\n // Metadata is kept in an array within the inverted\n // index so cloning the data can be done with\n // Array#slice\n for (var i = 0; i < metadataKeys.length; i++) {\n var key = metadataKeys[i]\n clonedMetadata[key] = metadata[key].slice()\n }\n\n this.metadata = Object.create(null)\n\n if (term !== undefined) {\n this.metadata[term] = Object.create(null)\n this.metadata[term][field] = clonedMetadata\n }\n}\n\n/**\n * An instance of lunr.MatchData will be created for every term that matches a\n * document. However only one instance is required in a lunr.Index~Result. This\n * method combines metadata from another instance of lunr.MatchData with this\n * objects metadata.\n *\n * @param {lunr.MatchData} otherMatchData - Another instance of match data to merge with this one.\n * @see {@link lunr.Index~Result}\n */\nlunr.MatchData.prototype.combine = function (otherMatchData) {\n var terms = Object.keys(otherMatchData.metadata)\n\n for (var i = 0; i < terms.length; i++) {\n var term = terms[i],\n fields = Object.keys(otherMatchData.metadata[term])\n\n if (this.metadata[term] == undefined) {\n this.metadata[term] = Object.create(null)\n }\n\n for (var j = 0; j < fields.length; j++) {\n var field = fields[j],\n keys = Object.keys(otherMatchData.metadata[term][field])\n\n if (this.metadata[term][field] == undefined) {\n this.metadata[term][field] = Object.create(null)\n }\n\n for (var k = 0; k < keys.length; k++) {\n var key = keys[k]\n\n if (this.metadata[term][field][key] == undefined) {\n this.metadata[term][field][key] = otherMatchData.metadata[term][field][key]\n } else {\n this.metadata[term][field][key] = this.metadata[term][field][key].concat(otherMatchData.metadata[term][field][key])\n }\n\n }\n }\n }\n}\n\n/**\n * Add metadata for a term/field pair to this instance of match data.\n *\n * @param {string} term - The term this match data is associated with\n * @param {string} field - The field in which the term was found\n * @param {object} metadata - The metadata recorded about this term in this field\n */\nlunr.MatchData.prototype.add = function (term, field, metadata) {\n if (!(term in this.metadata)) {\n this.metadata[term] = Object.create(null)\n this.metadata[term][field] = metadata\n return\n }\n\n if (!(field in this.metadata[term])) {\n this.metadata[term][field] = metadata\n return\n }\n\n var metadataKeys = Object.keys(metadata)\n\n for (var i = 0; i < metadataKeys.length; i++) {\n var key = metadataKeys[i]\n\n if (key in this.metadata[term][field]) {\n this.metadata[term][field][key] = this.metadata[term][field][key].concat(metadata[key])\n } else {\n this.metadata[term][field][key] = metadata[key]\n }\n }\n}\n/**\n * A lunr.Query provides a programmatic way of defining queries to be performed\n * against a {@link lunr.Index}.\n *\n * Prefer constructing a lunr.Query using the {@link lunr.Index#query} method\n * so the query object is pre-initialized with the right index fields.\n *\n * @constructor\n * @property {lunr.Query~Clause[]} clauses - An array of query clauses.\n * @property {string[]} allFields - An array of all available fields in a lunr.Index.\n */\nlunr.Query = function (allFields) {\n this.clauses = []\n this.allFields = allFields\n}\n\n/**\n * Constants for indicating what kind of automatic wildcard insertion will be used when constructing a query clause.\n *\n * This allows wildcards to be added to the beginning and end of a term without having to manually do any string\n * concatenation.\n *\n * The wildcard constants can be bitwise combined to select both leading and trailing wildcards.\n *\n * @constant\n * @default\n * @property {number} wildcard.NONE - The term will have no wildcards inserted, this is the default behaviour\n * @property {number} wildcard.LEADING - Prepend the term with a wildcard, unless a leading wildcard already exists\n * @property {number} wildcard.TRAILING - Append a wildcard to the term, unless a trailing wildcard already exists\n * @see lunr.Query~Clause\n * @see lunr.Query#clause\n * @see lunr.Query#term\n * @example query term with trailing wildcard\n * query.term('foo', { wildcard: lunr.Query.wildcard.TRAILING })\n * @example query term with leading and trailing wildcard\n * query.term('foo', {\n * wildcard: lunr.Query.wildcard.LEADING | lunr.Query.wildcard.TRAILING\n * })\n */\n\nlunr.Query.wildcard = new String (\"*\")\nlunr.Query.wildcard.NONE = 0\nlunr.Query.wildcard.LEADING = 1\nlunr.Query.wildcard.TRAILING = 2\n\n/**\n * Constants for indicating what kind of presence a term must have in matching documents.\n *\n * @constant\n * @enum {number}\n * @see lunr.Query~Clause\n * @see lunr.Query#clause\n * @see lunr.Query#term\n * @example query term with required presence\n * query.term('foo', { presence: lunr.Query.presence.REQUIRED })\n */\nlunr.Query.presence = {\n /**\n * Term's presence in a document is optional, this is the default value.\n */\n OPTIONAL: 1,\n\n /**\n * Term's presence in a document is required, documents that do not contain\n * this term will not be returned.\n */\n REQUIRED: 2,\n\n /**\n * Term's presence in a document is prohibited, documents that do contain\n * this term will not be returned.\n */\n PROHIBITED: 3\n}\n\n/**\n * A single clause in a {@link lunr.Query} contains a term and details on how to\n * match that term against a {@link lunr.Index}.\n *\n * @typedef {Object} lunr.Query~Clause\n * @property {string[]} fields - The fields in an index this clause should be matched against.\n * @property {number} [boost=1] - Any boost that should be applied when matching this clause.\n * @property {number} [editDistance] - Whether the term should have fuzzy matching applied, and how fuzzy the match should be.\n * @property {boolean} [usePipeline] - Whether the term should be passed through the search pipeline.\n * @property {number} [wildcard=lunr.Query.wildcard.NONE] - Whether the term should have wildcards appended or prepended.\n * @property {number} [presence=lunr.Query.presence.OPTIONAL] - The terms presence in any matching documents.\n */\n\n/**\n * Adds a {@link lunr.Query~Clause} to this query.\n *\n * Unless the clause contains the fields to be matched all fields will be matched. In addition\n * a default boost of 1 is applied to the clause.\n *\n * @param {lunr.Query~Clause} clause - The clause to add to this query.\n * @see lunr.Query~Clause\n * @returns {lunr.Query}\n */\nlunr.Query.prototype.clause = function (clause) {\n if (!('fields' in clause)) {\n clause.fields = this.allFields\n }\n\n if (!('boost' in clause)) {\n clause.boost = 1\n }\n\n if (!('usePipeline' in clause)) {\n clause.usePipeline = true\n }\n\n if (!('wildcard' in clause)) {\n clause.wildcard = lunr.Query.wildcard.NONE\n }\n\n if ((clause.wildcard & lunr.Query.wildcard.LEADING) && (clause.term.charAt(0) != lunr.Query.wildcard)) {\n clause.term = \"*\" + clause.term\n }\n\n if ((clause.wildcard & lunr.Query.wildcard.TRAILING) && (clause.term.slice(-1) != lunr.Query.wildcard)) {\n clause.term = \"\" + clause.term + \"*\"\n }\n\n if (!('presence' in clause)) {\n clause.presence = lunr.Query.presence.OPTIONAL\n }\n\n this.clauses.push(clause)\n\n return this\n}\n\n/**\n * A negated query is one in which every clause has a presence of\n * prohibited. These queries require some special processing to return\n * the expected results.\n *\n * @returns boolean\n */\nlunr.Query.prototype.isNegated = function () {\n for (var i = 0; i < this.clauses.length; i++) {\n if (this.clauses[i].presence != lunr.Query.presence.PROHIBITED) {\n return false\n }\n }\n\n return true\n}\n\n/**\n * Adds a term to the current query, under the covers this will create a {@link lunr.Query~Clause}\n * to the list of clauses that make up this query.\n *\n * The term is used as is, i.e. no tokenization will be performed by this method. Instead conversion\n * to a token or token-like string should be done before calling this method.\n *\n * The term will be converted to a string by calling `toString`. Multiple terms can be passed as an\n * array, each term in the array will share the same options.\n *\n * @param {object|object[]} term - The term(s) to add to the query.\n * @param {object} [options] - Any additional properties to add to the query clause.\n * @returns {lunr.Query}\n * @see lunr.Query#clause\n * @see lunr.Query~Clause\n * @example adding a single term to a query\n * query.term(\"foo\")\n * @example adding a single term to a query and specifying search fields, term boost and automatic trailing wildcard\n * query.term(\"foo\", {\n * fields: [\"title\"],\n * boost: 10,\n * wildcard: lunr.Query.wildcard.TRAILING\n * })\n * @example using lunr.tokenizer to convert a string to tokens before using them as terms\n * query.term(lunr.tokenizer(\"foo bar\"))\n */\nlunr.Query.prototype.term = function (term, options) {\n if (Array.isArray(term)) {\n term.forEach(function (t) { this.term(t, lunr.utils.clone(options)) }, this)\n return this\n }\n\n var clause = options || {}\n clause.term = term.toString()\n\n this.clause(clause)\n\n return this\n}\nlunr.QueryParseError = function (message, start, end) {\n this.name = \"QueryParseError\"\n this.message = message\n this.start = start\n this.end = end\n}\n\nlunr.QueryParseError.prototype = new Error\nlunr.QueryLexer = function (str) {\n this.lexemes = []\n this.str = str\n this.length = str.length\n this.pos = 0\n this.start = 0\n this.escapeCharPositions = []\n}\n\nlunr.QueryLexer.prototype.run = function () {\n var state = lunr.QueryLexer.lexText\n\n while (state) {\n state = state(this)\n }\n}\n\nlunr.QueryLexer.prototype.sliceString = function () {\n var subSlices = [],\n sliceStart = this.start,\n sliceEnd = this.pos\n\n for (var i = 0; i < this.escapeCharPositions.length; i++) {\n sliceEnd = this.escapeCharPositions[i]\n subSlices.push(this.str.slice(sliceStart, sliceEnd))\n sliceStart = sliceEnd + 1\n }\n\n subSlices.push(this.str.slice(sliceStart, this.pos))\n this.escapeCharPositions.length = 0\n\n return subSlices.join('')\n}\n\nlunr.QueryLexer.prototype.emit = function (type) {\n this.lexemes.push({\n type: type,\n str: this.sliceString(),\n start: this.start,\n end: this.pos\n })\n\n this.start = this.pos\n}\n\nlunr.QueryLexer.prototype.escapeCharacter = function () {\n this.escapeCharPositions.push(this.pos - 1)\n this.pos += 1\n}\n\nlunr.QueryLexer.prototype.next = function () {\n if (this.pos >= this.length) {\n return lunr.QueryLexer.EOS\n }\n\n var char = this.str.charAt(this.pos)\n this.pos += 1\n return char\n}\n\nlunr.QueryLexer.prototype.width = function () {\n return this.pos - this.start\n}\n\nlunr.QueryLexer.prototype.ignore = function () {\n if (this.start == this.pos) {\n this.pos += 1\n }\n\n this.start = this.pos\n}\n\nlunr.QueryLexer.prototype.backup = function () {\n this.pos -= 1\n}\n\nlunr.QueryLexer.prototype.acceptDigitRun = function () {\n var char, charCode\n\n do {\n char = this.next()\n charCode = char.charCodeAt(0)\n } while (charCode > 47 && charCode < 58)\n\n if (char != lunr.QueryLexer.EOS) {\n this.backup()\n }\n}\n\nlunr.QueryLexer.prototype.more = function () {\n return this.pos < this.length\n}\n\nlunr.QueryLexer.EOS = 'EOS'\nlunr.QueryLexer.FIELD = 'FIELD'\nlunr.QueryLexer.TERM = 'TERM'\nlunr.QueryLexer.EDIT_DISTANCE = 'EDIT_DISTANCE'\nlunr.QueryLexer.BOOST = 'BOOST'\nlunr.QueryLexer.PRESENCE = 'PRESENCE'\n\nlunr.QueryLexer.lexField = function (lexer) {\n lexer.backup()\n lexer.emit(lunr.QueryLexer.FIELD)\n lexer.ignore()\n return lunr.QueryLexer.lexText\n}\n\nlunr.QueryLexer.lexTerm = function (lexer) {\n if (lexer.width() > 1) {\n lexer.backup()\n lexer.emit(lunr.QueryLexer.TERM)\n }\n\n lexer.ignore()\n\n if (lexer.more()) {\n return lunr.QueryLexer.lexText\n }\n}\n\nlunr.QueryLexer.lexEditDistance = function (lexer) {\n lexer.ignore()\n lexer.acceptDigitRun()\n lexer.emit(lunr.QueryLexer.EDIT_DISTANCE)\n return lunr.QueryLexer.lexText\n}\n\nlunr.QueryLexer.lexBoost = function (lexer) {\n lexer.ignore()\n lexer.acceptDigitRun()\n lexer.emit(lunr.QueryLexer.BOOST)\n return lunr.QueryLexer.lexText\n}\n\nlunr.QueryLexer.lexEOS = function (lexer) {\n if (lexer.width() > 0) {\n lexer.emit(lunr.QueryLexer.TERM)\n }\n}\n\n// This matches the separator used when tokenising fields\n// within a document. These should match otherwise it is\n// not possible to search for some tokens within a document.\n//\n// It is possible for the user to change the separator on the\n// tokenizer so it _might_ clash with any other of the special\n// characters already used within the search string, e.g. :.\n//\n// This means that it is possible to change the separator in\n// such a way that makes some words unsearchable using a search\n// string.\nlunr.QueryLexer.termSeparator = lunr.tokenizer.separator\n\nlunr.QueryLexer.lexText = function (lexer) {\n while (true) {\n var char = lexer.next()\n\n if (char == lunr.QueryLexer.EOS) {\n return lunr.QueryLexer.lexEOS\n }\n\n // Escape character is '\\'\n if (char.charCodeAt(0) == 92) {\n lexer.escapeCharacter()\n continue\n }\n\n if (char == \":\") {\n return lunr.QueryLexer.lexField\n }\n\n if (char == \"~\") {\n lexer.backup()\n if (lexer.width() > 0) {\n lexer.emit(lunr.QueryLexer.TERM)\n }\n return lunr.QueryLexer.lexEditDistance\n }\n\n if (char == \"^\") {\n lexer.backup()\n if (lexer.width() > 0) {\n lexer.emit(lunr.QueryLexer.TERM)\n }\n return lunr.QueryLexer.lexBoost\n }\n\n // \"+\" indicates term presence is required\n // checking for length to ensure that only\n // leading \"+\" are considered\n if (char == \"+\" && lexer.width() === 1) {\n lexer.emit(lunr.QueryLexer.PRESENCE)\n return lunr.QueryLexer.lexText\n }\n\n // \"-\" indicates term presence is prohibited\n // checking for length to ensure that only\n // leading \"-\" are considered\n if (char == \"-\" && lexer.width() === 1) {\n lexer.emit(lunr.QueryLexer.PRESENCE)\n return lunr.QueryLexer.lexText\n }\n\n if (char.match(lunr.QueryLexer.termSeparator)) {\n return lunr.QueryLexer.lexTerm\n }\n }\n}\n\nlunr.QueryParser = function (str, query) {\n this.lexer = new lunr.QueryLexer (str)\n this.query = query\n this.currentClause = {}\n this.lexemeIdx = 0\n}\n\nlunr.QueryParser.prototype.parse = function () {\n this.lexer.run()\n this.lexemes = this.lexer.lexemes\n\n var state = lunr.QueryParser.parseClause\n\n while (state) {\n state = state(this)\n }\n\n return this.query\n}\n\nlunr.QueryParser.prototype.peekLexeme = function () {\n return this.lexemes[this.lexemeIdx]\n}\n\nlunr.QueryParser.prototype.consumeLexeme = function () {\n var lexeme = this.peekLexeme()\n this.lexemeIdx += 1\n return lexeme\n}\n\nlunr.QueryParser.prototype.nextClause = function () {\n var completedClause = this.currentClause\n this.query.clause(completedClause)\n this.currentClause = {}\n}\n\nlunr.QueryParser.parseClause = function (parser) {\n var lexeme = parser.peekLexeme()\n\n if (lexeme == undefined) {\n return\n }\n\n switch (lexeme.type) {\n case lunr.QueryLexer.PRESENCE:\n return lunr.QueryParser.parsePresence\n case lunr.QueryLexer.FIELD:\n return lunr.QueryParser.parseField\n case lunr.QueryLexer.TERM:\n return lunr.QueryParser.parseTerm\n default:\n var errorMessage = \"expected either a field or a term, found \" + lexeme.type\n\n if (lexeme.str.length >= 1) {\n errorMessage += \" with value '\" + lexeme.str + \"'\"\n }\n\n throw new lunr.QueryParseError (errorMessage, lexeme.start, lexeme.end)\n }\n}\n\nlunr.QueryParser.parsePresence = function (parser) {\n var lexeme = parser.consumeLexeme()\n\n if (lexeme == undefined) {\n return\n }\n\n switch (lexeme.str) {\n case \"-\":\n parser.currentClause.presence = lunr.Query.presence.PROHIBITED\n break\n case \"+\":\n parser.currentClause.presence = lunr.Query.presence.REQUIRED\n break\n default:\n var errorMessage = \"unrecognised presence operator'\" + lexeme.str + \"'\"\n throw new lunr.QueryParseError (errorMessage, lexeme.start, lexeme.end)\n }\n\n var nextLexeme = parser.peekLexeme()\n\n if (nextLexeme == undefined) {\n var errorMessage = \"expecting term or field, found nothing\"\n throw new lunr.QueryParseError (errorMessage, lexeme.start, lexeme.end)\n }\n\n switch (nextLexeme.type) {\n case lunr.QueryLexer.FIELD:\n return lunr.QueryParser.parseField\n case lunr.QueryLexer.TERM:\n return lunr.QueryParser.parseTerm\n default:\n var errorMessage = \"expecting term or field, found '\" + nextLexeme.type + \"'\"\n throw new lunr.QueryParseError (errorMessage, nextLexeme.start, nextLexeme.end)\n }\n}\n\nlunr.QueryParser.parseField = function (parser) {\n var lexeme = parser.consumeLexeme()\n\n if (lexeme == undefined) {\n return\n }\n\n if (parser.query.allFields.indexOf(lexeme.str) == -1) {\n var possibleFields = parser.query.allFields.map(function (f) { return \"'\" + f + \"'\" }).join(', '),\n errorMessage = \"unrecognised field '\" + lexeme.str + \"', possible fields: \" + possibleFields\n\n throw new lunr.QueryParseError (errorMessage, lexeme.start, lexeme.end)\n }\n\n parser.currentClause.fields = [lexeme.str]\n\n var nextLexeme = parser.peekLexeme()\n\n if (nextLexeme == undefined) {\n var errorMessage = \"expecting term, found nothing\"\n throw new lunr.QueryParseError (errorMessage, lexeme.start, lexeme.end)\n }\n\n switch (nextLexeme.type) {\n case lunr.QueryLexer.TERM:\n return lunr.QueryParser.parseTerm\n default:\n var errorMessage = \"expecting term, found '\" + nextLexeme.type + \"'\"\n throw new lunr.QueryParseError (errorMessage, nextLexeme.start, nextLexeme.end)\n }\n}\n\nlunr.QueryParser.parseTerm = function (parser) {\n var lexeme = parser.consumeLexeme()\n\n if (lexeme == undefined) {\n return\n }\n\n parser.currentClause.term = lexeme.str.toLowerCase()\n\n if (lexeme.str.indexOf(\"*\") != -1) {\n parser.currentClause.usePipeline = false\n }\n\n var nextLexeme = parser.peekLexeme()\n\n if (nextLexeme == undefined) {\n parser.nextClause()\n return\n }\n\n switch (nextLexeme.type) {\n case lunr.QueryLexer.TERM:\n parser.nextClause()\n return lunr.QueryParser.parseTerm\n case lunr.QueryLexer.FIELD:\n parser.nextClause()\n return lunr.QueryParser.parseField\n case lunr.QueryLexer.EDIT_DISTANCE:\n return lunr.QueryParser.parseEditDistance\n case lunr.QueryLexer.BOOST:\n return lunr.QueryParser.parseBoost\n case lunr.QueryLexer.PRESENCE:\n parser.nextClause()\n return lunr.QueryParser.parsePresence\n default:\n var errorMessage = \"Unexpected lexeme type '\" + nextLexeme.type + \"'\"\n throw new lunr.QueryParseError (errorMessage, nextLexeme.start, nextLexeme.end)\n }\n}\n\nlunr.QueryParser.parseEditDistance = function (parser) {\n var lexeme = parser.consumeLexeme()\n\n if (lexeme == undefined) {\n return\n }\n\n var editDistance = parseInt(lexeme.str, 10)\n\n if (isNaN(editDistance)) {\n var errorMessage = \"edit distance must be numeric\"\n throw new lunr.QueryParseError (errorMessage, lexeme.start, lexeme.end)\n }\n\n parser.currentClause.editDistance = editDistance\n\n var nextLexeme = parser.peekLexeme()\n\n if (nextLexeme == undefined) {\n parser.nextClause()\n return\n }\n\n switch (nextLexeme.type) {\n case lunr.QueryLexer.TERM:\n parser.nextClause()\n return lunr.QueryParser.parseTerm\n case lunr.QueryLexer.FIELD:\n parser.nextClause()\n return lunr.QueryParser.parseField\n case lunr.QueryLexer.EDIT_DISTANCE:\n return lunr.QueryParser.parseEditDistance\n case lunr.QueryLexer.BOOST:\n return lunr.QueryParser.parseBoost\n case lunr.QueryLexer.PRESENCE:\n parser.nextClause()\n return lunr.QueryParser.parsePresence\n default:\n var errorMessage = \"Unexpected lexeme type '\" + nextLexeme.type + \"'\"\n throw new lunr.QueryParseError (errorMessage, nextLexeme.start, nextLexeme.end)\n }\n}\n\nlunr.QueryParser.parseBoost = function (parser) {\n var lexeme = parser.consumeLexeme()\n\n if (lexeme == undefined) {\n return\n }\n\n var boost = parseInt(lexeme.str, 10)\n\n if (isNaN(boost)) {\n var errorMessage = \"boost must be numeric\"\n throw new lunr.QueryParseError (errorMessage, lexeme.start, lexeme.end)\n }\n\n parser.currentClause.boost = boost\n\n var nextLexeme = parser.peekLexeme()\n\n if (nextLexeme == undefined) {\n parser.nextClause()\n return\n }\n\n switch (nextLexeme.type) {\n case lunr.QueryLexer.TERM:\n parser.nextClause()\n return lunr.QueryParser.parseTerm\n case lunr.QueryLexer.FIELD:\n parser.nextClause()\n return lunr.QueryParser.parseField\n case lunr.QueryLexer.EDIT_DISTANCE:\n return lunr.QueryParser.parseEditDistance\n case lunr.QueryLexer.BOOST:\n return lunr.QueryParser.parseBoost\n case lunr.QueryLexer.PRESENCE:\n parser.nextClause()\n return lunr.QueryParser.parsePresence\n default:\n var errorMessage = \"Unexpected lexeme type '\" + nextLexeme.type + \"'\"\n throw new lunr.QueryParseError (errorMessage, nextLexeme.start, nextLexeme.end)\n }\n}\n\n /**\n * export the module via AMD, CommonJS or as a browser global\n * Export code from https://github.com/umdjs/umd/blob/master/returnExports.js\n */\n ;(function (root, factory) {\n if (typeof define === 'function' && define.amd) {\n // AMD. Register as an anonymous module.\n define(factory)\n } else if (typeof exports === 'object') {\n /**\n * Node. Does not work with strict CommonJS, but\n * only CommonJS-like enviroments that support module.exports,\n * like Node.\n */\n module.exports = factory()\n } else {\n // Browser globals (root is window)\n root.lunr = factory()\n }\n }(this, function () {\n /**\n * Just return a value to define the module export.\n * This example returns an object, but the module\n * can return a function as the exported value.\n */\n return lunr\n }))\n})();\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A RTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { SearchIndexOptions, SearchResult } from \"modules\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Search message type\n */\nexport const enum SearchMessageType {\n SETUP, /* Search index setup */\n DUMP, /* Search index dump */\n QUERY, /* Search query */\n RESULT /* Search results */\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * A message containing the data necessary to setup the search index\n */\nexport interface SearchSetupMessage {\n type: SearchMessageType.SETUP /* Message type */\n data: SearchIndexOptions /* Message data */\n}\n\n/**\n * A message containing the a dump of the search index\n */\nexport interface SearchDumpMessage {\n type: SearchMessageType.DUMP /* Message type */\n data: string /* Message data */\n}\n\n/**\n * A message containing a search query\n */\nexport interface SearchQueryMessage {\n type: SearchMessageType.QUERY /* Message type */\n data: string /* Message data */\n}\n\n/**\n * A message containing results for a search query\n */\nexport interface SearchResultMessage {\n type: SearchMessageType.RESULT /* Message type */\n data: SearchResult[] /* Message data */\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * A message exchanged with the search worker\n */\nexport type SearchMessage =\n | SearchSetupMessage\n | SearchDumpMessage\n | SearchQueryMessage\n | SearchResultMessage\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Type guard for search setup messages\n *\n * @param message - Search worker message\n *\n * @return Test result\n */\nexport function isSearchSetupMessage(\n message: SearchMessage\n): message is SearchSetupMessage {\n return message.type === SearchMessageType.SETUP\n}\n\n/**\n * Type guard for search dump messages\n *\n * @param message - Search worker message\n *\n * @return Test result\n */\nexport function isSearchDumpMessage(\n message: SearchMessage\n): message is SearchDumpMessage {\n return message.type === SearchMessageType.DUMP\n}\n\n/**\n * Type guard for search query messages\n *\n * @param message - Search worker message\n *\n * @return Test result\n */\nexport function isSearchQueryMessage(\n message: SearchMessage\n): message is SearchQueryMessage {\n return message.type === SearchMessageType.QUERY\n}\n\n/**\n * Type guard for search result messages\n *\n * @param message - Search worker message\n *\n * @return Test result\n */\nexport function isSearchResultMessage(\n message: SearchMessage\n): message is SearchResultMessage {\n return message.type === SearchMessageType.RESULT\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport * as lunr from \"expose-loader?lunr!lunr\"\n\nimport {\n ArticleDocument,\n SearchDocumentMap,\n SectionDocument,\n setupSearchDocumentMap\n} from \"../document\"\nimport {\n SearchHighlightFactoryFn,\n setupSearchHighlighter\n} from \"../highlight\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Search index configuration\n */\nexport interface SearchIndexConfig {\n lang: string[] /* Search languages */\n separator: string /* Search separator */\n}\n\n/**\n * Search index document\n */\nexport interface SearchIndexDocument {\n location: string /* Document location */\n title: string /* Document title */\n text: string /* Document text */\n}\n\n/**\n * Search index pipeline\n */\nexport interface SearchIndexPipeline {\n trimmer: boolean /* Add trimmer to pipeline */\n stopwords: boolean /* Add stopword filter to pipeline */\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Search index options\n *\n * This interfaces describes the format of the `search_index.json` file which\n * is automatically built by the MkDocs search plugin.\n */\nexport interface SearchIndexOptions {\n config: SearchIndexConfig /* Search index configuration */\n docs: SearchIndexDocument[] /* Search index documents */\n pipeline?: SearchIndexPipeline /* Search index pipeline */\n index?: object | string /* Prebuilt or serialized index */\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Search result\n */\nexport interface SearchResult {\n article: ArticleDocument /* Article document */\n sections: SectionDocument[] /* Section documents */\n}\n\n/* ----------------------------------------------------------------------------\n * Class\n * ------------------------------------------------------------------------- */\n\nexport class SearchIndex {\n\n /**\n * Search document mapping\n *\n * A mapping of URLs (including hash fragments) to the actual articles and\n * sections of the documentation. The search document mapping must be created\n * regardless of whether the index was prebuilt or not, as lunr itself will\n * only store the actual index.\n */\n protected documents: SearchDocumentMap\n\n /**\n * Search highlight factory function\n */\n protected highlight: SearchHighlightFactoryFn\n\n /**\n * The lunr search index\n */\n protected index: lunr.Index\n\n /**\n * Create a search index\n *\n * @param options - Options\n */\n public constructor({ config, docs, pipeline, index }: SearchIndexOptions) {\n this.documents = setupSearchDocumentMap(docs)\n this.highlight = setupSearchHighlighter(config)\n console.dir(config, { depth: null })\n\n /* If no index was given, create it */\n if (typeof index === \"undefined\") {\n this.index = lunr(function() {\n pipeline = pipeline || {\n trimmer: true,\n stopwords: true\n }\n\n /* Remove stemmer, as it cripples search experience */\n this.pipeline.reset()\n if (pipeline.trimmer)\n this.pipeline.add(lunr.trimmer)\n if (pipeline.stopwords)\n this.pipeline.add(lunr.stopWordFilter)\n\n /* Setup fields and reference */\n this.field(\"title\", { boost: 10 })\n this.field(\"text\")\n this.ref(\"location\")\n\n /* Index documents */\n for (const doc of docs)\n this.add(doc)\n })\n\n /* Prebuilt or serialized index */\n } else {\n this.index = lunr.Index.load(\n typeof index === \"string\"\n ? JSON.parse(index)\n : index\n )\n }\n }\n\n /**\n * Search for matching documents\n *\n * The search index which MkDocs provides is divided up into articles, which\n * contain the whole content of the individual pages, and sections, which only\n * contain the contents of the subsections obtained by breaking the individual\n * pages up at `h1` ... `h6`. As there may be many sections on different pages\n * with indentical titles (for example within this very project, e.g. \"Usage\"\n * or \"Installation\"), they need to be put into the context of the containing\n * page. For this reason, section results are grouped within their respective\n * articles which are the top-level results that are returned.\n *\n * @param query - Query string\n *\n * @return Search results\n */\n public search(query: string): SearchResult[] {\n if (query) {\n try {\n\n /* Group sections by containing article */\n const groups = this.index.search(query)\n .reduce((results, result) => {\n const document = this.documents.get(result.ref)\n if (typeof document !== \"undefined\") {\n if (\"parent\" in document) {\n const ref = document.parent.location\n results.set(ref, [...results.get(ref) || [], result])\n } else {\n const ref = document.location\n results.set(ref, results.get(ref) || [])\n }\n }\n return results\n }, new Map())\n\n /* Create highlighter for query */\n const fn = this.highlight(query)\n\n /* Map groups to search documents */\n return [...groups].map(([ref, sections]) => ({\n article: fn(this.documents.get(ref) as ArticleDocument),\n sections: sections.map(section => {\n return fn(this.documents.get(section.ref) as SectionDocument)\n })\n }))\n\n /* Log errors to console (for now) */\n } catch (err) {\n // tslint:disable-next-line no-console\n console.warn(`Invalid query: ${query} – see https://bit.ly/2s3ChXG`)\n }\n }\n\n /* Return nothing in case of error or empty query */\n return []\n }\n\n /**\n * Serialize search index\n *\n * @return String representation\n */\n public toString(): string {\n return JSON.stringify(this.index)\n }\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport * as escapeHTML from \"escape-html\"\n\nimport { SearchIndexDocument } from \"../_\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * A top-level article\n */\nexport interface ArticleDocument extends SearchIndexDocument {\n linked: boolean /* Whether the section was linked */\n}\n\n/**\n * A section of an article\n */\nexport interface SectionDocument extends SearchIndexDocument {\n parent: ArticleDocument /* Parent article */\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Search document\n */\nexport type SearchDocument =\n | ArticleDocument\n | SectionDocument\n\n/**\n * Search document mapping\n */\nexport type SearchDocumentMap = Map\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Create a search document mapping\n *\n * @param docs - Search index documents\n *\n * @return Search document map\n */\nexport function setupSearchDocumentMap(\n docs: SearchIndexDocument[]\n): SearchDocumentMap {\n const documents = new Map()\n for (const doc of docs) {\n const [path, hash] = doc.location.split(\"#\")\n\n /* Extract location and title */\n const location = doc.location\n const title = doc.title\n\n /* Escape and cleanup text */\n const text = escapeHTML(doc.text)\n .replace(/\\s+(?=[,.:;!?])/g, \"\")\n .replace(/\\s+/g, \" \")\n\n /* Handle section */\n if (hash) {\n const parent = documents.get(path) as ArticleDocument\n\n /* Ignore first section, override article */\n if (!parent.linked) {\n parent.title = doc.title\n parent.text = text\n parent.linked = true\n\n /* Add subsequent section */\n } else {\n documents.set(location, { location, title, text, parent })\n }\n\n /* Add article */\n } else {\n documents.set(location, { location, title, text, linked: false })\n }\n }\n return documents\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport * as escapeRegExp from \"escape-string-regexp\"\n\nimport { SearchIndexConfig } from \"../_\"\nimport { SearchDocument } from \"../document\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Search highlight function\n *\n * @template T - Search document type\n *\n * @param document - Search document\n *\n * @return Highlighted document\n */\nexport type SearchHighlightFn =\n (document: Readonly) => T\n\n/**\n * Search highlight factory function\n *\n * @param query - Query string\n *\n * @return Search highlight function\n */\nexport type SearchHighlightFactoryFn =\n (query: string) => SearchHighlightFn\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Create a search highlighter\n *\n * @param config - Search index configuration\n *\n * @return Search highlight factory function\n */\nexport function setupSearchHighlighter(\n config: SearchIndexConfig\n): SearchHighlightFactoryFn {\n const separator = new RegExp(config.separator, \"img\")\n const highlight = (_: unknown, data: string, term: string) => {\n return `${data}${term}`\n }\n\n /* Return factory function */\n return (query: string) => {\n query = query\n .replace(/[\\s*+-:~^]+/g, \" \")\n .trim()\n\n /* Create search term match expression */\n const match = new RegExp(`(^|${config.separator})(${\n escapeRegExp(query).replace(separator, \"|\")\n })`, \"img\")\n\n /* Highlight document */\n return document => ({\n ...document,\n title: document.title.replace(match, highlight),\n text: document.text.replace(match, highlight)\n })\n }\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A RTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { SearchIndex, SearchIndexConfig } from \"modules\"\n\nimport { SearchMessage, SearchMessageType } from \"../_\"\n\n/* ----------------------------------------------------------------------------\n * Data\n * ------------------------------------------------------------------------- */\n\n/**\n * Search index\n */\nlet index: SearchIndex\n\n/* ----------------------------------------------------------------------------\n * Helper functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Setup multi-language support through `lunr-languages`\n *\n * @param config - Search index configuration\n */\nfunction setupLunrLanguages(config: SearchIndexConfig): void {\n const base = \"../lunr\"\n\n /* Add scripts for languages */\n const scripts = [`${base}/lunr.stemmer.support.min.js`]\n for (const lang of config.lang) {\n if (lang === \"ja\") scripts.push(`${base}/tinyseg.js`)\n if (lang !== \"en\") scripts.push(`${base}/lunr.${lang}.min.js`)\n }\n\n /* Add multi-language support */\n if (scripts.length > 1)\n scripts.push(`${base}/lunr.multi.min.js`)\n\n /* Load scripts synchronously */\n importScripts(...scripts)\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Message handler\n *\n * @param message - Source message\n *\n * @return Target message\n */\nexport function handler(message: SearchMessage): SearchMessage {\n switch (message.type) {\n\n /* Setup search index */\n case SearchMessageType.SETUP:\n setupLunrLanguages(message.data.config)\n index = new SearchIndex(message.data)\n return {\n type: SearchMessageType.DUMP,\n data: index.toString()\n }\n\n /* Query search index */\n case SearchMessageType.QUERY:\n return {\n type: SearchMessageType.RESULT,\n data: index ? index.search(message.data) : []\n }\n\n /* All other messages */\n default:\n throw new TypeError(\"Invalid message type\")\n }\n}\n\n/* ----------------------------------------------------------------------------\n * Worker\n * ------------------------------------------------------------------------- */\n\nself.addEventListener(\"message\", ev => {\n self.postMessage(handler(ev.data))\n})\n"],"sourceRoot":""} \ No newline at end of file +{"version":3,"sources":["webpack:///webpack/bootstrap","webpack:///./node_modules/lunr/lunr.js-exposed","webpack:///./node_modules/escape-html/index.js","webpack:///./node_modules/escape-string-regexp/index.js","webpack:///(webpack)/buildin/global.js","webpack:///./node_modules/lunr/lunr.js","webpack:///./src/assets/javascripts/workers/search/_/index.ts","webpack:///./src/assets/javascripts/modules/search/_/index.ts","webpack:///./src/assets/javascripts/modules/search/document/index.ts","webpack:///./src/assets/javascripts/modules/search/highlight/index.ts","webpack:///./src/assets/javascripts/workers/search/main/index.ts"],"names":["installedModules","__webpack_require__","moduleId","exports","module","i","l","modules","call","m","c","d","name","getter","o","Object","defineProperty","enumerable","get","r","Symbol","toStringTag","value","t","mode","__esModule","ns","create","key","bind","n","object","property","prototype","hasOwnProperty","p","s","matchHtmlRegExp","string","escape","str","match","exec","html","index","lastIndex","length","charCodeAt","substring","matchOperatorsRegex","TypeError","replace","g","this","Function","e","window","global","step2list","step3list","v","C","re_mgr0","re_mgr1","re_meq1","re_s_v","re_1a","re2_1a","re_1b","re2_1b","re_1b_2","re2_1b_2","re3_1b_2","re4_1b_2","re_1c","re_2","re_3","re_4","re2_4","re_5","re_5_1","re3_5","porterStemmer","lunr","config","builder","Builder","pipeline","add","trimmer","stopWordFilter","stemmer","searchPipeline","build","version","utils","warn","message","console","asString","obj","toString","clone","keys","val","Array","isArray","slice","FieldRef","docRef","fieldName","stringValue","_stringValue","joiner","fromString","indexOf","fieldRef","undefined","Set","elements","complete","intersect","other","union","contains","empty","a","b","intersection","element","push","concat","idf","posting","documentCount","documentsWithTerm","x","Math","log","abs","Token","metadata","update","fn","tokenizer","map","toLowerCase","len","tokens","sliceEnd","sliceStart","sliceLength","charAt","separator","tokenMetadata","Pipeline","_stack","registeredFunctions","registerFunction","label","warnIfFunctionNotRegistered","load","serialised","forEach","fnName","Error","fns","arguments","after","existingFn","newFn","pos","splice","before","remove","run","stackLength","memo","j","result","k","runString","token","reset","toJSON","Vector","_magnitude","positionForIndex","start","end","pivotPoint","floor","pivotIndex","insert","insertIdx","upsert","position","magnitude","sumOfSquares","elementsLength","sqrt","dot","otherVector","dotProduct","aLen","bLen","aVal","bVal","similarity","toArray","output","RegExp","w","stem","suffix","firstch","re","re2","re3","re4","substr","toUpperCase","test","fp","generateStopWordFilter","stopWords","words","reduce","stopWord","TokenSet","final","edges","id","_nextId","fromArray","arr","finish","root","fromClause","clause","fromFuzzyString","term","editDistance","stack","node","editsRemaining","frame","pop","noEditNode","char","insertionNode","substitutionNode","transposeNode","charA","charB","next","prefix","edge","_str","labels","sort","qNode","qEdges","qLen","nEdges","nLen","q","qEdge","nEdge","previousWord","uncheckedNodes","minimizedNodes","word","commonPrefix","minimize","child","nextNode","parent","downTo","childKey","Index","attrs","invertedIndex","fieldVectors","tokenSet","fields","search","queryString","query","QueryParser","parse","Query","matchingFields","queryVectors","termFieldCache","requiredMatches","prohibitedMatches","clauses","terms","clauseMatches","usePipeline","termTokenSet","expandedTerms","presence","REQUIRED","field","expandedTerm","termIndex","_index","fieldPosting","matchingDocumentRefs","termField","matchingDocumentsSet","PROHIBITED","boost","fieldMatch","matchingDocumentRef","matchingFieldRef","MatchData","allRequiredMatches","allProhibitedMatches","matchingFieldRefs","results","matches","isNegated","docMatch","fieldVector","score","matchData","combine","ref","serializedIndex","serializedVectors","serializedInvertedIndex","tokenSetBuilder","tuple","_ref","_fields","_documents","fieldTermFrequencies","fieldLengths","_b","_k1","metadataWhitelist","attributes","RangeError","number","k1","doc","extractor","fieldTerms","metadataKey","calculateAverageFieldLengths","fieldRefs","numberOfFields","accumulator","documentsWithField","averageFieldLength","createFieldVectors","fieldRefsLength","termIdfCache","fieldLength","termFrequencies","termsLength","fieldBoost","docBoost","scoreWithPrecision","tf","round","createTokenSet","use","args","unshift","apply","clonedMetadata","metadataKeys","otherMatchData","allFields","wildcard","String","NONE","LEADING","TRAILING","OPTIONAL","options","QueryParseError","QueryLexer","lexemes","escapeCharPositions","state","lexText","sliceString","subSlices","join","emit","type","escapeCharacter","EOS","width","ignore","backup","acceptDigitRun","charCode","more","FIELD","TERM","EDIT_DISTANCE","BOOST","PRESENCE","lexField","lexer","lexTerm","lexEditDistance","lexBoost","lexEOS","termSeparator","currentClause","lexemeIdx","parseClause","peekLexeme","consumeLexeme","lexeme","nextClause","completedClause","parser","parsePresence","parseField","parseTerm","errorMessage","nextLexeme","possibleFields","f","parseEditDistance","parseBoost","parseInt","isNaN","SearchMessageType","docs","documents","Map","path","hash","location","title","text","linked","set","setupSearchDocumentMap","highlight","_","data","trim","document","setupSearchHighlighter","stopwords","lang","multiLanguage","JSON","groups","sections","article","section","err","stringify","handler","SETUP","base","scripts","importScripts","setupLunrLanguages","DUMP","QUERY","RESULT","self","addEventListener","ev","postMessage"],"mappings":"aACE,IAAIA,EAAmB,GAGvB,SAASC,EAAoBC,GAG5B,GAAGF,EAAiBE,GACnB,OAAOF,EAAiBE,GAAUC,QAGnC,IAAIC,EAASJ,EAAiBE,GAAY,CACzCG,EAAGH,EACHI,GAAG,EACHH,QAAS,IAUV,OANAI,EAAQL,GAAUM,KAAKJ,EAAOD,QAASC,EAAQA,EAAOD,QAASF,GAG/DG,EAAOE,GAAI,EAGJF,EAAOD,QAKfF,EAAoBQ,EAAIF,EAGxBN,EAAoBS,EAAIV,EAGxBC,EAAoBU,EAAI,SAASR,EAASS,EAAMC,GAC3CZ,EAAoBa,EAAEX,EAASS,IAClCG,OAAOC,eAAeb,EAASS,EAAM,CAAEK,YAAY,EAAMC,IAAKL,KAKhEZ,EAAoBkB,EAAI,SAAShB,GACX,oBAAXiB,QAA0BA,OAAOC,aAC1CN,OAAOC,eAAeb,EAASiB,OAAOC,YAAa,CAAEC,MAAO,WAE7DP,OAAOC,eAAeb,EAAS,aAAc,CAAEmB,OAAO,KAQvDrB,EAAoBsB,EAAI,SAASD,EAAOE,GAEvC,GADU,EAAPA,IAAUF,EAAQrB,EAAoBqB,IAC/B,EAAPE,EAAU,OAAOF,EACpB,GAAW,EAAPE,GAA8B,iBAAVF,GAAsBA,GAASA,EAAMG,WAAY,OAAOH,EAChF,IAAII,EAAKX,OAAOY,OAAO,MAGvB,GAFA1B,EAAoBkB,EAAEO,GACtBX,OAAOC,eAAeU,EAAI,UAAW,CAAET,YAAY,EAAMK,MAAOA,IACtD,EAAPE,GAA4B,iBAATF,EAAmB,IAAI,IAAIM,KAAON,EAAOrB,EAAoBU,EAAEe,EAAIE,EAAK,SAASA,GAAO,OAAON,EAAMM,IAAQC,KAAK,KAAMD,IAC9I,OAAOF,GAIRzB,EAAoB6B,EAAI,SAAS1B,GAChC,IAAIS,EAAST,GAAUA,EAAOqB,WAC7B,WAAwB,OAAOrB,EAAgB,SAC/C,WAA8B,OAAOA,GAEtC,OADAH,EAAoBU,EAAEE,EAAQ,IAAKA,GAC5BA,GAIRZ,EAAoBa,EAAI,SAASiB,EAAQC,GAAY,OAAOjB,OAAOkB,UAAUC,eAAe1B,KAAKuB,EAAQC,IAGzG/B,EAAoBkC,EAAI,GAIjBlC,EAAoBA,EAAoBmC,EAAI,G,mBClFrD,YAAAhC,EAAA,eAAkC,EAAQ,K;;;;;;;GCe1C,IAAIiC,EAAkB,UAOtBjC,EAAOD,QAUP,SAAoBmC,GAClB,IAOIC,EAPAC,EAAM,GAAKF,EACXG,EAAQJ,EAAgBK,KAAKF,GAEjC,IAAKC,EACH,OAAOD,EAIT,IAAIG,EAAO,GACPC,EAAQ,EACRC,EAAY,EAEhB,IAAKD,EAAQH,EAAMG,MAAOA,EAAQJ,EAAIM,OAAQF,IAAS,CACrD,OAAQJ,EAAIO,WAAWH,IACrB,KAAK,GACHL,EAAS,SACT,MACF,KAAK,GACHA,EAAS,QACT,MACF,KAAK,GACHA,EAAS,QACT,MACF,KAAK,GACHA,EAAS,OACT,MACF,KAAK,GACHA,EAAS,OACT,MACF,QACE,SAGAM,IAAcD,IAChBD,GAAQH,EAAIQ,UAAUH,EAAWD,IAGnCC,EAAYD,EAAQ,EACpBD,GAAQJ,EAGV,OAAOM,IAAcD,EACjBD,EAAOH,EAAIQ,UAAUH,EAAWD,GAChCD,I,6BC1EN,MAAMM,EAAsB,uBAE5B7C,EAAOD,QAAUmC,IAChB,GAAsB,iBAAXA,EACV,MAAM,IAAIY,UAAU,qBAGrB,OAAOZ,EAAOa,QAAQF,EAAqB,U,cCT5C,IAAIG,EAGJA,EAAI,WACH,OAAOC,KADJ,GAIJ,IAECD,EAAIA,GAAK,IAAIE,SAAS,cAAb,GACR,MAAOC,GAEc,iBAAXC,SAAqBJ,EAAII,QAOrCpD,EAAOD,QAAUiD,G,gBCnBjB;;;;;IAMC,WAiCD,IAoC6BK,EAw2BvBC,EAwBFC,EAWAC,EACAC,EAQEC,EACAC,EACAC,EACAC,EAEAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAEAC,EACAC,EAEAC,EAEAC,EACAC,EAEAC,EACAC,EACAC,EAEAC,EAl9BFC,EAAO,SAAUC,GACnB,IAAIC,EAAU,IAAIF,EAAKG,QAavB,OAXAD,EAAQE,SAASC,IACfL,EAAKM,QACLN,EAAKO,eACLP,EAAKQ,SAGPN,EAAQO,eAAeJ,IACrBL,EAAKQ,SAGPP,EAAO5E,KAAK6E,EAASA,GACdA,EAAQQ,SAGjBV,EAAKW,QAAU;;;;IAUfX,EAAKY,MAAQ,GASbZ,EAAKY,MAAMC,MAAkBvC,EAQ1BJ,KANM,SAAU4C,GACXxC,EAAOyC,SAAWA,QAAQF,MAC5BE,QAAQF,KAAKC,KAiBnBd,EAAKY,MAAMI,SAAW,SAAUC,GAC9B,OAAIA,QACK,GAEAA,EAAIC,YAoBflB,EAAKY,MAAMO,MAAQ,SAAUF,GAC3B,GAAIA,QACF,OAAOA,EAMT,IAHA,IAAIE,EAAQvF,OAAOY,OAAO,MACtB4E,EAAOxF,OAAOwF,KAAKH,GAEd/F,EAAI,EAAGA,EAAIkG,EAAKzD,OAAQzC,IAAK,CACpC,IAAIuB,EAAM2E,EAAKlG,GACXmG,EAAMJ,EAAIxE,GAEd,GAAI6E,MAAMC,QAAQF,GAChBF,EAAM1E,GAAO4E,EAAIG,YADnB,CAKA,GAAmB,iBAARH,GACQ,iBAARA,GACQ,kBAARA,EAKX,MAAM,IAAItD,UAAU,yDAJlBoD,EAAM1E,GAAO4E,GAOjB,OAAOF,GAETnB,EAAKyB,SAAW,SAAUC,EAAQC,EAAWC,GAC3C1D,KAAKwD,OAASA,EACdxD,KAAKyD,UAAYA,EACjBzD,KAAK2D,aAAeD,GAGtB5B,EAAKyB,SAASK,OAAS,IAEvB9B,EAAKyB,SAASM,WAAa,SAAU9E,GACnC,IAAIN,EAAIM,EAAE+E,QAAQhC,EAAKyB,SAASK,QAEhC,IAAW,IAAPnF,EACF,KAAM,6BAGR,IAAIsF,EAAWhF,EAAEuE,MAAM,EAAG7E,GACtB+E,EAASzE,EAAEuE,MAAM7E,EAAI,GAEzB,OAAO,IAAIqD,EAAKyB,SAAUC,EAAQO,EAAUhF,IAG9C+C,EAAKyB,SAAS3E,UAAUoE,SAAW,WAKjC,OAJyBgB,MAArBhE,KAAK2D,eACP3D,KAAK2D,aAAe3D,KAAKyD,UAAY3B,EAAKyB,SAASK,OAAS5D,KAAKwD,QAG5DxD,KAAK2D;;;;IAYd7B,EAAKmC,IAAM,SAAUC,GAGnB,GAFAlE,KAAKkE,SAAWxG,OAAOY,OAAO,MAE1B4F,EAAU,CACZlE,KAAKP,OAASyE,EAASzE,OAEvB,IAAK,IAAIzC,EAAI,EAAGA,EAAIgD,KAAKP,OAAQzC,IAC/BgD,KAAKkE,SAASA,EAASlH,KAAM,OAG/BgD,KAAKP,OAAS,GAWlBqC,EAAKmC,IAAIE,SAAW,CAClBC,UAAW,SAAUC,GACnB,OAAOA,GAGTC,MAAO,SAAUD,GACf,OAAOA,GAGTE,SAAU,WACR,OAAO,IAWXzC,EAAKmC,IAAIO,MAAQ,CACfJ,UAAW,WACT,OAAOpE,MAGTsE,MAAO,SAAUD,GACf,OAAOA,GAGTE,SAAU,WACR,OAAO,IAUXzC,EAAKmC,IAAIrF,UAAU2F,SAAW,SAAU7F,GACtC,QAASsB,KAAKkE,SAASxF,IAWzBoD,EAAKmC,IAAIrF,UAAUwF,UAAY,SAAUC,GACvC,IAAII,EAAGC,EAAGR,EAAUS,EAAe,GAEnC,GAAIN,IAAUvC,EAAKmC,IAAIE,SACrB,OAAOnE,KAGT,GAAIqE,IAAUvC,EAAKmC,IAAIO,MACrB,OAAOH,EAGLrE,KAAKP,OAAS4E,EAAM5E,QACtBgF,EAAIzE,KACJ0E,EAAIL,IAEJI,EAAIJ,EACJK,EAAI1E,MAGNkE,EAAWxG,OAAOwF,KAAKuB,EAAEP,UAEzB,IAAK,IAAIlH,EAAI,EAAGA,EAAIkH,EAASzE,OAAQzC,IAAK,CACxC,IAAI4H,EAAUV,EAASlH,GACnB4H,KAAWF,EAAER,UACfS,EAAaE,KAAKD,GAItB,OAAO,IAAI9C,EAAKmC,IAAKU,IAUvB7C,EAAKmC,IAAIrF,UAAU0F,MAAQ,SAAUD,GACnC,OAAIA,IAAUvC,EAAKmC,IAAIE,SACdrC,EAAKmC,IAAIE,SAGdE,IAAUvC,EAAKmC,IAAIO,MACdxE,KAGF,IAAI8B,EAAKmC,IAAIvG,OAAOwF,KAAKlD,KAAKkE,UAAUY,OAAOpH,OAAOwF,KAAKmB,EAAMH,aAU1EpC,EAAKiD,IAAM,SAAUC,EAASC,GAC5B,IAAIC,EAAoB,EAExB,IAAK,IAAIzB,KAAauB,EACH,UAAbvB,IACJyB,GAAqBxH,OAAOwF,KAAK8B,EAAQvB,IAAYhE,QAGvD,IAAI0F,GAAKF,EAAgBC,EAAoB,KAAQA,EAAoB,IAEzE,OAAOE,KAAKC,IAAI,EAAID,KAAKE,IAAIH,KAW/BrD,EAAKyD,MAAQ,SAAUpG,EAAKqG,GAC1BxF,KAAKb,IAAMA,GAAO,GAClBa,KAAKwF,SAAWA,GAAY,IAQ9B1D,EAAKyD,MAAM3G,UAAUoE,SAAW,WAC9B,OAAOhD,KAAKb,KAuBd2C,EAAKyD,MAAM3G,UAAU6G,OAAS,SAAUC,GAEtC,OADA1F,KAAKb,IAAMuG,EAAG1F,KAAKb,IAAKa,KAAKwF,UACtBxF,MAUT8B,EAAKyD,MAAM3G,UAAUqE,MAAQ,SAAUyC,GAErC,OADAA,EAAKA,GAAM,SAAU3G,GAAK,OAAOA,GAC1B,IAAI+C,EAAKyD,MAAOG,EAAG1F,KAAKb,IAAKa,KAAKwF,UAAWxF,KAAKwF;;;;IAyB3D1D,EAAK6D,UAAY,SAAU5C,EAAKyC,GAC9B,GAAW,MAAPzC,GAAsBiB,MAAPjB,EACjB,MAAO,GAGT,GAAIK,MAAMC,QAAQN,GAChB,OAAOA,EAAI6C,KAAI,SAAU1H,GACvB,OAAO,IAAI4D,EAAKyD,MACdzD,EAAKY,MAAMI,SAAS5E,GAAG2H,cACvB/D,EAAKY,MAAMO,MAAMuC,OASvB,IAJA,IAAIrG,EAAM4D,EAAIC,WAAW6C,cACrBC,EAAM3G,EAAIM,OACVsG,EAAS,GAEJC,EAAW,EAAGC,EAAa,EAAGD,GAAYF,EAAKE,IAAY,CAClE,IACIE,EAAcF,EAAWC,EAE7B,GAHW9G,EAAIgH,OAAOH,GAGZ5G,MAAM0C,EAAK6D,UAAUS,YAAcJ,GAAYF,EAAM,CAE7D,GAAII,EAAc,EAAG,CACnB,IAAIG,EAAgBvE,EAAKY,MAAMO,MAAMuC,IAAa,GAClDa,EAAwB,SAAI,CAACJ,EAAYC,GACzCG,EAAqB,MAAIN,EAAOtG,OAEhCsG,EAAOlB,KACL,IAAI/C,EAAKyD,MACPpG,EAAImE,MAAM2C,EAAYD,GACtBK,IAKNJ,EAAaD,EAAW,GAK5B,OAAOD,GAUTjE,EAAK6D,UAAUS,UAAY;;;;IAmC3BtE,EAAKwE,SAAW,WACdtG,KAAKuG,OAAS,IAGhBzE,EAAKwE,SAASE,oBAAsB9I,OAAOY,OAAO,MAmClDwD,EAAKwE,SAASG,iBAAmB,SAAUf,EAAIgB,GACzCA,KAAS1G,KAAKwG,qBAChB1E,EAAKY,MAAMC,KAAK,6CAA+C+D,GAGjEhB,EAAGgB,MAAQA,EACX5E,EAAKwE,SAASE,oBAAoBd,EAAGgB,OAAShB,GAShD5D,EAAKwE,SAASK,4BAA8B,SAAUjB,GACjCA,EAAGgB,OAAUhB,EAAGgB,SAAS1G,KAAKwG,qBAG/C1E,EAAKY,MAAMC,KAAK,kGAAmG+C,IAcvH5D,EAAKwE,SAASM,KAAO,SAAUC,GAC7B,IAAI3E,EAAW,IAAIJ,EAAKwE,SAYxB,OAVAO,EAAWC,SAAQ,SAAUC,GAC3B,IAAIrB,EAAK5D,EAAKwE,SAASE,oBAAoBO,GAE3C,IAAIrB,EAGF,MAAM,IAAIsB,MAAM,sCAAwCD,GAFxD7E,EAASC,IAAIuD,MAMVxD,GAUTJ,EAAKwE,SAAS1H,UAAUuD,IAAM,WAC5B,IAAI8E,EAAM7D,MAAMxE,UAAU0E,MAAMnG,KAAK+J,WAErCD,EAAIH,SAAQ,SAAUpB,GACpB5D,EAAKwE,SAASK,4BAA4BjB,GAC1C1F,KAAKuG,OAAO1B,KAAKa,KAChB1F,OAYL8B,EAAKwE,SAAS1H,UAAUuI,MAAQ,SAAUC,EAAYC,GACpDvF,EAAKwE,SAASK,4BAA4BU,GAE1C,IAAIC,EAAMtH,KAAKuG,OAAOzC,QAAQsD,GAC9B,IAAY,GAARE,EACF,MAAM,IAAIN,MAAM,0BAGlBM,GAAY,EACZtH,KAAKuG,OAAOgB,OAAOD,EAAK,EAAGD,IAY7BvF,EAAKwE,SAAS1H,UAAU4I,OAAS,SAAUJ,EAAYC,GACrDvF,EAAKwE,SAASK,4BAA4BU,GAE1C,IAAIC,EAAMtH,KAAKuG,OAAOzC,QAAQsD,GAC9B,IAAY,GAARE,EACF,MAAM,IAAIN,MAAM,0BAGlBhH,KAAKuG,OAAOgB,OAAOD,EAAK,EAAGD,IAQ7BvF,EAAKwE,SAAS1H,UAAU6I,OAAS,SAAU/B,GACzC,IAAI4B,EAAMtH,KAAKuG,OAAOzC,QAAQ4B,IAClB,GAAR4B,GAIJtH,KAAKuG,OAAOgB,OAAOD,EAAK,IAU1BxF,EAAKwE,SAAS1H,UAAU8I,IAAM,SAAU3B,GAGtC,IAFA,IAAI4B,EAAc3H,KAAKuG,OAAO9G,OAErBzC,EAAI,EAAGA,EAAI2K,EAAa3K,IAAK,CAIpC,IAHA,IAAI0I,EAAK1F,KAAKuG,OAAOvJ,GACjB4K,EAAO,GAEFC,EAAI,EAAGA,EAAI9B,EAAOtG,OAAQoI,IAAK,CACtC,IAAIC,EAASpC,EAAGK,EAAO8B,GAAIA,EAAG9B,GAE9B,GAAI+B,SAAmD,KAAXA,EAE5C,GAAI1E,MAAMC,QAAQyE,GAChB,IAAK,IAAIC,EAAI,EAAGA,EAAID,EAAOrI,OAAQsI,IACjCH,EAAK/C,KAAKiD,EAAOC,SAGnBH,EAAK/C,KAAKiD,GAId/B,EAAS6B,EAGX,OAAO7B,GAaTjE,EAAKwE,SAAS1H,UAAUoJ,UAAY,SAAU7I,EAAKqG,GACjD,IAAIyC,EAAQ,IAAInG,EAAKyD,MAAOpG,EAAKqG,GAEjC,OAAOxF,KAAK0H,IAAI,CAACO,IAAQrC,KAAI,SAAU1H,GACrC,OAAOA,EAAE8E,eAQblB,EAAKwE,SAAS1H,UAAUsJ,MAAQ,WAC9BlI,KAAKuG,OAAS,IAUhBzE,EAAKwE,SAAS1H,UAAUuJ,OAAS,WAC/B,OAAOnI,KAAKuG,OAAOX,KAAI,SAAUF,GAG/B,OAFA5D,EAAKwE,SAASK,4BAA4BjB,GAEnCA,EAAGgB;;;;IAwBd5E,EAAKsG,OAAS,SAAUlE,GACtBlE,KAAKqI,WAAa,EAClBrI,KAAKkE,SAAWA,GAAY,IAc9BpC,EAAKsG,OAAOxJ,UAAU0J,iBAAmB,SAAU/I,GAEjD,GAA4B,GAAxBS,KAAKkE,SAASzE,OAChB,OAAO,EAST,IANA,IAAI8I,EAAQ,EACRC,EAAMxI,KAAKkE,SAASzE,OAAS,EAC7ByG,EAAcsC,EAAMD,EACpBE,EAAarD,KAAKsD,MAAMxC,EAAc,GACtCyC,EAAa3I,KAAKkE,SAAsB,EAAbuE,GAExBvC,EAAc,IACfyC,EAAapJ,IACfgJ,EAAQE,GAGNE,EAAapJ,IACfiJ,EAAMC,GAGJE,GAAcpJ,IAIlB2G,EAAcsC,EAAMD,EACpBE,EAAaF,EAAQnD,KAAKsD,MAAMxC,EAAc,GAC9CyC,EAAa3I,KAAKkE,SAAsB,EAAbuE,GAG7B,OAAIE,GAAcpJ,EACI,EAAbkJ,EAGLE,EAAapJ,EACK,EAAbkJ,EAGLE,EAAapJ,EACW,GAAlBkJ,EAAa,QADvB,GAcF3G,EAAKsG,OAAOxJ,UAAUgK,OAAS,SAAUC,EAAW1F,GAClDnD,KAAK8I,OAAOD,EAAW1F,GAAK,WAC1B,KAAM,sBAYVrB,EAAKsG,OAAOxJ,UAAUkK,OAAS,SAAUD,EAAW1F,EAAKuC,GACvD1F,KAAKqI,WAAa,EAClB,IAAIU,EAAW/I,KAAKsI,iBAAiBO,GAEjC7I,KAAKkE,SAAS6E,IAAaF,EAC7B7I,KAAKkE,SAAS6E,EAAW,GAAKrD,EAAG1F,KAAKkE,SAAS6E,EAAW,GAAI5F,GAE9DnD,KAAKkE,SAASqD,OAAOwB,EAAU,EAAGF,EAAW1F,IASjDrB,EAAKsG,OAAOxJ,UAAUoK,UAAY,WAChC,GAAIhJ,KAAKqI,WAAY,OAAOrI,KAAKqI,WAKjC,IAHA,IAAIY,EAAe,EACfC,EAAiBlJ,KAAKkE,SAASzE,OAE1BzC,EAAI,EAAGA,EAAIkM,EAAgBlM,GAAK,EAAG,CAC1C,IAAImG,EAAMnD,KAAKkE,SAASlH,GACxBiM,GAAgB9F,EAAMA,EAGxB,OAAOnD,KAAKqI,WAAajD,KAAK+D,KAAKF,IASrCnH,EAAKsG,OAAOxJ,UAAUwK,IAAM,SAAUC,GAOpC,IANA,IAAIC,EAAa,EACb7E,EAAIzE,KAAKkE,SAAUQ,EAAI2E,EAAYnF,SACnCqF,EAAO9E,EAAEhF,OAAQ+J,EAAO9E,EAAEjF,OAC1BgK,EAAO,EAAGC,EAAO,EACjB1M,EAAI,EAAG6K,EAAI,EAER7K,EAAIuM,GAAQ1B,EAAI2B,IACrBC,EAAOhF,EAAEzH,KAAI0M,EAAOhF,EAAEmD,IAEpB7K,GAAK,EACIyM,EAAOC,EAChB7B,GAAK,EACI4B,GAAQC,IACjBJ,GAAc7E,EAAEzH,EAAI,GAAK0H,EAAEmD,EAAI,GAC/B7K,GAAK,EACL6K,GAAK,GAIT,OAAOyB,GAUTxH,EAAKsG,OAAOxJ,UAAU+K,WAAa,SAAUN,GAC3C,OAAOrJ,KAAKoJ,IAAIC,GAAerJ,KAAKgJ,aAAe,GAQrDlH,EAAKsG,OAAOxJ,UAAUgL,QAAU,WAG9B,IAFA,IAAIC,EAAS,IAAIzG,MAAOpD,KAAKkE,SAASzE,OAAS,GAEtCzC,EAAI,EAAG6K,EAAI,EAAG7K,EAAIgD,KAAKkE,SAASzE,OAAQzC,GAAK,EAAG6K,IACvDgC,EAAOhC,GAAK7H,KAAKkE,SAASlH,GAG5B,OAAO6M,GAQT/H,EAAKsG,OAAOxJ,UAAUuJ,OAAS,WAC7B,OAAOnI,KAAKkE;;;;;IAoBdpC,EAAKQ,SACCjC,EAAY,CACZ,QAAY,MACZ,OAAW,OACX,KAAS,OACT,KAAS,OACT,KAAS,MACT,IAAQ,MACR,KAAS,KACT,MAAU,MACV,IAAQ,IACR,MAAU,MACV,QAAY,MACZ,MAAU,MACV,KAAS,MACT,MAAU,KACV,QAAY,MACZ,QAAY,MACZ,QAAY,MACZ,MAAU,KACV,MAAU,MACV,OAAW,MACX,KAAS,OAGXC,EAAY,CACV,MAAU,KACV,MAAU,GACV,MAAU,KACV,MAAU,KACV,KAAS,KACT,IAAQ,GACR,KAAS,IAIXC,EAAI,WACJC,EAAInD,qBAQFoD,EAAU,IAAIqJ,OALT,4DAMLpJ,EAAU,IAAIoJ,OAJT,8FAKLnJ,EAAU,IAAImJ,OANT,gFAOLlJ,EAAS,IAAIkJ,OALT,kCAOJjJ,EAAQ,kBACRC,EAAS,iBACTC,EAAQ,aACRC,EAAS,kBACTC,EAAU,KACVC,EAAW,cACXC,EAAW,IAAI2I,OAAO,sBACtB1I,EAAW,IAAI0I,OAAO,IAAMtJ,EAAID,EAAI,gBAEpCc,EAAQ,mBACRC,EAAO,2IAEPC,EAAO,iDAEPC,EAAO,sFACPC,EAAQ,oBAERC,EAAO,WACPC,EAAS,MACTC,EAAQ,IAAIkI,OAAO,IAAMtJ,EAAID,EAAI,gBAEjCsB,EAAgB,SAAuBkI,GACzC,IAAIC,EACFC,EACAC,EACAC,EACAC,EACAC,EACAC,EAEF,GAAIP,EAAEtK,OAAS,EAAK,OAAOsK,EAiB3B,GAde,MADfG,EAAUH,EAAEQ,OAAO,EAAE,MAEnBR,EAAIG,EAAQM,cAAgBT,EAAEQ,OAAO,IAKvCH,EAAMtJ,GADNqJ,EAAKtJ,GAGE4J,KAAKV,GAAMA,EAAIA,EAAEjK,QAAQqK,EAAG,QAC1BC,EAAIK,KAAKV,KAAMA,EAAIA,EAAEjK,QAAQsK,EAAI,SAI1CA,EAAMpJ,GADNmJ,EAAKpJ,GAEE0J,KAAKV,GAAI,CACd,IAAIW,EAAKP,EAAG9K,KAAK0K,IACjBI,EAAK1J,GACEgK,KAAKC,EAAG,MACbP,EAAKlJ,EACL8I,EAAIA,EAAEjK,QAAQqK,EAAG,UAEVC,EAAIK,KAAKV,KAElBC,GADIU,EAAKN,EAAI/K,KAAK0K,IACR,IACVK,EAAMxJ,GACE6J,KAAKT,KAGXK,EAAMlJ,EACNmJ,EAAMlJ,GAFNgJ,EAAMlJ,GAGEuJ,KAJRV,EAAIC,GAIeD,GAAQ,IAClBM,EAAII,KAAKV,IAAMI,EAAKlJ,EAAS8I,EAAIA,EAAEjK,QAAQqK,EAAG,KAC9CG,EAAIG,KAAKV,KAAMA,GAAQ,OAiFpC,OA5EAI,EAAK9I,GACEoJ,KAAKV,KAGVA,GADAC,GADIU,EAAKP,EAAG9K,KAAK0K,IACP,IACC,MAIbI,EAAK7I,GACEmJ,KAAKV,KAEVC,GADIU,EAAKP,EAAG9K,KAAK0K,IACP,GACVE,EAASS,EAAG,IACZP,EAAK1J,GACEgK,KAAKT,KACVD,EAAIC,EAAO3J,EAAU4J,MAKzBE,EAAK5I,GACEkJ,KAAKV,KAEVC,GADIU,EAAKP,EAAG9K,KAAK0K,IACP,GACVE,EAASS,EAAG,IACZP,EAAK1J,GACEgK,KAAKT,KACVD,EAAIC,EAAO1J,EAAU2J,KAMzBG,EAAM3I,GADN0I,EAAK3I,GAEEiJ,KAAKV,IAEVC,GADIU,EAAKP,EAAG9K,KAAK0K,IACP,IACVI,EAAKzJ,GACE+J,KAAKT,KACVD,EAAIC,IAEGI,EAAIK,KAAKV,KAElBC,GADIU,EAAKN,EAAI/K,KAAK0K,IACR,GAAKW,EAAG,IAClBN,EAAM1J,GACE+J,KAAKT,KACXD,EAAIC,KAKRG,EAAKzI,GACE+I,KAAKV,KAEVC,GADIU,EAAKP,EAAG9K,KAAK0K,IACP,GAEVK,EAAMzJ,EACN0J,EAAMzI,IAFNuI,EAAKzJ,GAGE+J,KAAKT,IAAUI,EAAIK,KAAKT,KAAWK,EAAII,KAAKT,MACjDD,EAAIC,IAKRI,EAAM1J,GADNyJ,EAAKxI,GAEE8I,KAAKV,IAAMK,EAAIK,KAAKV,KACzBI,EAAKlJ,EACL8I,EAAIA,EAAEjK,QAAQqK,EAAG,KAKJ,KAAXD,IACFH,EAAIG,EAAQrE,cAAgBkE,EAAEQ,OAAO,IAGhCR,GAGF,SAAU9B,GACf,OAAOA,EAAMxC,OAAO5D,KAIxBC,EAAKwE,SAASG,iBAAiB3E,EAAKQ,QAAS;;;;IAmB7CR,EAAK6I,uBAAyB,SAAUC,GACtC,IAAIC,EAAQD,EAAUE,QAAO,SAAUlD,EAAMmD,GAE3C,OADAnD,EAAKmD,GAAYA,EACVnD,IACN,IAEH,OAAO,SAAUK,GACf,GAAIA,GAAS4C,EAAM5C,EAAMjF,cAAgBiF,EAAMjF,WAAY,OAAOiF,IAiBtEnG,EAAKO,eAAiBP,EAAK6I,uBAAuB,CAChD,IACA,OACA,QACA,SACA,QACA,MACA,SACA,OACA,KACA,QACA,KACA,MACA,MACA,MACA,KACA,KACA,KACA,UACA,OACA,MACA,KACA,MACA,SACA,QACA,OACA,MACA,KACA,OACA,SACA,OACA,OACA,QACA,MACA,OACA,MACA,MACA,MACA,MACA,OACA,KACA,MACA,OACA,MACA,MACA,MACA,UACA,IACA,KACA,KACA,OACA,KACA,KACA,MACA,OACA,QACA,MACA,OACA,SACA,MACA,KACA,QACA,OACA,OACA,KACA,UACA,KACA,MACA,MACA,KACA,MACA,QACA,KACA,OACA,KACA,QACA,MACA,MACA,SACA,OACA,MACA,OACA,MACA,SACA,QACA,KACA,OACA,OACA,OACA,MACA,QACA,OACA,OACA,QACA,QACA,OACA,OACA,MACA,KACA,MACA,OACA,KACA,QACA,MACA,KACA,OACA,OACA,OACA,QACA,QACA,QACA,MACA,OACA,MACA,OACA,OACA,QACA,MACA,MACA,SAGF7I,EAAKwE,SAASG,iBAAiB3E,EAAKO,eAAgB;;;;IAqBpDP,EAAKM,QAAU,SAAU6F,GACvB,OAAOA,EAAMxC,QAAO,SAAU1G,GAC5B,OAAOA,EAAEe,QAAQ,OAAQ,IAAIA,QAAQ,OAAQ,QAIjDgC,EAAKwE,SAASG,iBAAiB3E,EAAKM,QAAS;;;;IA2B7CN,EAAKkJ,SAAW,WACdhL,KAAKiL,OAAQ,EACbjL,KAAKkL,MAAQ,GACblL,KAAKmL,GAAKrJ,EAAKkJ,SAASI,QACxBtJ,EAAKkJ,SAASI,SAAW,GAW3BtJ,EAAKkJ,SAASI,QAAU,EASxBtJ,EAAKkJ,SAASK,UAAY,SAAUC,GAGlC,IAFA,IAAItJ,EAAU,IAAIF,EAAKkJ,SAAS/I,QAEvBjF,EAAI,EAAG8I,EAAMwF,EAAI7L,OAAQzC,EAAI8I,EAAK9I,IACzCgF,EAAQ4G,OAAO0C,EAAItO,IAIrB,OADAgF,EAAQuJ,SACDvJ,EAAQwJ,MAYjB1J,EAAKkJ,SAASS,WAAa,SAAUC,GACnC,MAAI,iBAAkBA,EACb5J,EAAKkJ,SAASW,gBAAgBD,EAAOE,KAAMF,EAAOG,cAElD/J,EAAKkJ,SAASnH,WAAW6H,EAAOE,OAmB3C9J,EAAKkJ,SAASW,gBAAkB,SAAUxM,EAAK0M,GAS7C,IARA,IAAIL,EAAO,IAAI1J,EAAKkJ,SAEhBc,EAAQ,CAAC,CACXC,KAAMP,EACNQ,eAAgBH,EAChB1M,IAAKA,IAGA2M,EAAMrM,QAAQ,CACnB,IAAIwM,EAAQH,EAAMI,MAGlB,GAAID,EAAM9M,IAAIM,OAAS,EAAG,CACxB,IACI0M,EADAC,EAAOH,EAAM9M,IAAIgH,OAAO,GAGxBiG,KAAQH,EAAMF,KAAKb,MACrBiB,EAAaF,EAAMF,KAAKb,MAAMkB,IAE9BD,EAAa,IAAIrK,EAAKkJ,SACtBiB,EAAMF,KAAKb,MAAMkB,GAAQD,GAGH,GAApBF,EAAM9M,IAAIM,SACZ0M,EAAWlB,OAAQ,GAGrBa,EAAMjH,KAAK,CACTkH,KAAMI,EACNH,eAAgBC,EAAMD,eACtB7M,IAAK8M,EAAM9M,IAAImE,MAAM,KAIzB,GAA4B,GAAxB2I,EAAMD,eAAV,CAKA,GAAI,MAAOC,EAAMF,KAAKb,MACpB,IAAImB,EAAgBJ,EAAMF,KAAKb,MAAM,SAChC,CACDmB,EAAgB,IAAIvK,EAAKkJ,SAC7BiB,EAAMF,KAAKb,MAAM,KAAOmB,EAiC1B,GA9BwB,GAApBJ,EAAM9M,IAAIM,SACZ4M,EAAcpB,OAAQ,GAGxBa,EAAMjH,KAAK,CACTkH,KAAMM,EACNL,eAAgBC,EAAMD,eAAiB,EACvC7M,IAAK8M,EAAM9M,MAMT8M,EAAM9M,IAAIM,OAAS,GACrBqM,EAAMjH,KAAK,CACTkH,KAAME,EAAMF,KACZC,eAAgBC,EAAMD,eAAiB,EACvC7M,IAAK8M,EAAM9M,IAAImE,MAAM,KAMD,GAApB2I,EAAM9M,IAAIM,SACZwM,EAAMF,KAAKd,OAAQ,GAMjBgB,EAAM9M,IAAIM,QAAU,EAAG,CACzB,GAAI,MAAOwM,EAAMF,KAAKb,MACpB,IAAIoB,EAAmBL,EAAMF,KAAKb,MAAM,SACnC,CACDoB,EAAmB,IAAIxK,EAAKkJ,SAChCiB,EAAMF,KAAKb,MAAM,KAAOoB,EAGF,GAApBL,EAAM9M,IAAIM,SACZ6M,EAAiBrB,OAAQ,GAG3Ba,EAAMjH,KAAK,CACTkH,KAAMO,EACNN,eAAgBC,EAAMD,eAAiB,EACvC7M,IAAK8M,EAAM9M,IAAImE,MAAM,KAOzB,GAAI2I,EAAM9M,IAAIM,OAAS,EAAG,CACxB,IAEI8M,EAFAC,EAAQP,EAAM9M,IAAIgH,OAAO,GACzBsG,EAAQR,EAAM9M,IAAIgH,OAAO,GAGzBsG,KAASR,EAAMF,KAAKb,MACtBqB,EAAgBN,EAAMF,KAAKb,MAAMuB,IAEjCF,EAAgB,IAAIzK,EAAKkJ,SACzBiB,EAAMF,KAAKb,MAAMuB,GAASF,GAGJ,GAApBN,EAAM9M,IAAIM,SACZ8M,EAActB,OAAQ,GAGxBa,EAAMjH,KAAK,CACTkH,KAAMQ,EACNP,eAAgBC,EAAMD,eAAiB,EACvC7M,IAAKqN,EAAQP,EAAM9M,IAAImE,MAAM,OAKnC,OAAOkI,GAaT1J,EAAKkJ,SAASnH,WAAa,SAAU1E,GAYnC,IAXA,IAAI4M,EAAO,IAAIjK,EAAKkJ,SAChBQ,EAAOO,EAUF/O,EAAI,EAAG8I,EAAM3G,EAAIM,OAAQzC,EAAI8I,EAAK9I,IAAK,CAC9C,IAAIoP,EAAOjN,EAAInC,GACXiO,EAASjO,GAAK8I,EAAM,EAExB,GAAY,KAARsG,EACFL,EAAKb,MAAMkB,GAAQL,EACnBA,EAAKd,MAAQA,MAER,CACL,IAAIyB,EAAO,IAAI5K,EAAKkJ,SACpB0B,EAAKzB,MAAQA,EAEbc,EAAKb,MAAMkB,GAAQM,EACnBX,EAAOW,GAIX,OAAOlB,GAaT1J,EAAKkJ,SAASpM,UAAUgL,QAAU,WAQhC,IAPA,IAAIiB,EAAQ,GAERiB,EAAQ,CAAC,CACXa,OAAQ,GACRZ,KAAM/L,OAGD8L,EAAMrM,QAAQ,CACnB,IAAIwM,EAAQH,EAAMI,MACdhB,EAAQxN,OAAOwF,KAAK+I,EAAMF,KAAKb,OAC/BpF,EAAMoF,EAAMzL,OAEZwM,EAAMF,KAAKd,QAKbgB,EAAMU,OAAOxG,OAAO,GACpB0E,EAAMhG,KAAKoH,EAAMU,SAGnB,IAAK,IAAI3P,EAAI,EAAGA,EAAI8I,EAAK9I,IAAK,CAC5B,IAAI4P,EAAO1B,EAAMlO,GAEjB8O,EAAMjH,KAAK,CACT8H,OAAQV,EAAMU,OAAO7H,OAAO8H,GAC5Bb,KAAME,EAAMF,KAAKb,MAAM0B,MAK7B,OAAO/B,GAaT/I,EAAKkJ,SAASpM,UAAUoE,SAAW,WASjC,GAAIhD,KAAK6M,KACP,OAAO7M,KAAK6M,KAOd,IAJA,IAAI1N,EAAMa,KAAKiL,MAAQ,IAAM,IACzB6B,EAASpP,OAAOwF,KAAKlD,KAAKkL,OAAO6B,OACjCjH,EAAMgH,EAAOrN,OAERzC,EAAI,EAAGA,EAAI8I,EAAK9I,IAAK,CAC5B,IAAI0J,EAAQoG,EAAO9P,GAGnBmC,EAAMA,EAAMuH,EAFD1G,KAAKkL,MAAMxE,GAEGyE,GAG3B,OAAOhM,GAaT2C,EAAKkJ,SAASpM,UAAUwF,UAAY,SAAUM,GAU5C,IATA,IAAImF,EAAS,IAAI/H,EAAKkJ,SAClBiB,OAAQjI,EAER8H,EAAQ,CAAC,CACXkB,MAAOtI,EACPmF,OAAQA,EACRkC,KAAM/L,OAGD8L,EAAMrM,QAAQ,CACnBwM,EAAQH,EAAMI,MAWd,IALA,IAAIe,EAASvP,OAAOwF,KAAK+I,EAAMe,MAAM9B,OACjCgC,EAAOD,EAAOxN,OACd0N,EAASzP,OAAOwF,KAAK+I,EAAMF,KAAKb,OAChCkC,EAAOD,EAAO1N,OAET4N,EAAI,EAAGA,EAAIH,EAAMG,IAGxB,IAFA,IAAIC,EAAQL,EAAOI,GAEV5O,EAAI,EAAGA,EAAI2O,EAAM3O,IAAK,CAC7B,IAAI8O,EAAQJ,EAAO1O,GAEnB,GAAI8O,GAASD,GAAkB,KAATA,EAAc,CAClC,IAAIvB,EAAOE,EAAMF,KAAKb,MAAMqC,GACxBP,EAAQf,EAAMe,MAAM9B,MAAMoC,GAC1BrC,EAAQc,EAAKd,OAAS+B,EAAM/B,MAC5ByB,OAAO1I,EAEPuJ,KAAStB,EAAMpC,OAAOqB,OAIxBwB,EAAOT,EAAMpC,OAAOqB,MAAMqC,IACrBtC,MAAQyB,EAAKzB,OAASA,IAM3ByB,EAAO,IAAI5K,EAAKkJ,UACXC,MAAQA,EACbgB,EAAMpC,OAAOqB,MAAMqC,GAASb,GAG9BZ,EAAMjH,KAAK,CACTmI,MAAOA,EACPnD,OAAQ6C,EACRX,KAAMA,MAOhB,OAAOlC,GAET/H,EAAKkJ,SAAS/I,QAAU,WACtBjC,KAAKwN,aAAe,GACpBxN,KAAKwL,KAAO,IAAI1J,EAAKkJ,SACrBhL,KAAKyN,eAAiB,GACtBzN,KAAK0N,eAAiB,IAGxB5L,EAAKkJ,SAAS/I,QAAQrD,UAAUgK,OAAS,SAAU+E,GACjD,IAAI5B,EACA6B,EAAe,EAEnB,GAAID,EAAO3N,KAAKwN,aACd,MAAM,IAAIxG,MAAO,+BAGnB,IAAK,IAAIhK,EAAI,EAAGA,EAAI2Q,EAAKlO,QAAUzC,EAAIgD,KAAKwN,aAAa/N,QACnDkO,EAAK3Q,IAAMgD,KAAKwN,aAAaxQ,GAD8BA,IAE/D4Q,IAGF5N,KAAK6N,SAASD,GAGZ7B,EADgC,GAA9B/L,KAAKyN,eAAehO,OACfO,KAAKwL,KAELxL,KAAKyN,eAAezN,KAAKyN,eAAehO,OAAS,GAAGqO,MAG7D,IAAS9Q,EAAI4Q,EAAc5Q,EAAI2Q,EAAKlO,OAAQzC,IAAK,CAC/C,IAAI+Q,EAAW,IAAIjM,EAAKkJ,SACpBoB,EAAOuB,EAAK3Q,GAEhB+O,EAAKb,MAAMkB,GAAQ2B,EAEnB/N,KAAKyN,eAAe5I,KAAK,CACvBmJ,OAAQjC,EACRK,KAAMA,EACN0B,MAAOC,IAGThC,EAAOgC,EAGThC,EAAKd,OAAQ,EACbjL,KAAKwN,aAAeG,GAGtB7L,EAAKkJ,SAAS/I,QAAQrD,UAAU2M,OAAS,WACvCvL,KAAK6N,SAAS,IAGhB/L,EAAKkJ,SAAS/I,QAAQrD,UAAUiP,SAAW,SAAUI,GACnD,IAAK,IAAIjR,EAAIgD,KAAKyN,eAAehO,OAAS,EAAGzC,GAAKiR,EAAQjR,IAAK,CAC7D,IAAI+O,EAAO/L,KAAKyN,eAAezQ,GAC3BkR,EAAWnC,EAAK+B,MAAM9K,WAEtBkL,KAAYlO,KAAK0N,eACnB3B,EAAKiC,OAAO9C,MAAMa,EAAKK,MAAQpM,KAAK0N,eAAeQ,IAInDnC,EAAK+B,MAAMjB,KAAOqB,EAElBlO,KAAK0N,eAAeQ,GAAYnC,EAAK+B,OAGvC9N,KAAKyN,eAAevB;;;;IAwBxBpK,EAAKqM,MAAQ,SAAUC,GACrBpO,KAAKqO,cAAgBD,EAAMC,cAC3BrO,KAAKsO,aAAeF,EAAME,aAC1BtO,KAAKuO,SAAWH,EAAMG,SACtBvO,KAAKwO,OAASJ,EAAMI,OACpBxO,KAAKkC,SAAWkM,EAAMlM,UA0ExBJ,EAAKqM,MAAMvP,UAAU6P,OAAS,SAAUC,GACtC,OAAO1O,KAAK2O,OAAM,SAAUA,GACb,IAAI7M,EAAK8M,YAAYF,EAAaC,GACxCE,YA6BX/M,EAAKqM,MAAMvP,UAAU+P,MAAQ,SAAUjJ,GAoBrC,IAZA,IAAIiJ,EAAQ,IAAI7M,EAAKgN,MAAM9O,KAAKwO,QAC5BO,EAAiBrR,OAAOY,OAAO,MAC/B0Q,EAAetR,OAAOY,OAAO,MAC7B2Q,EAAiBvR,OAAOY,OAAO,MAC/B4Q,EAAkBxR,OAAOY,OAAO,MAChC6Q,EAAoBzR,OAAOY,OAAO,MAO7BtB,EAAI,EAAGA,EAAIgD,KAAKwO,OAAO/O,OAAQzC,IACtCgS,EAAahP,KAAKwO,OAAOxR,IAAM,IAAI8E,EAAKsG,OAG1C1C,EAAGvI,KAAKwR,EAAOA,GAEf,IAAS3R,EAAI,EAAGA,EAAI2R,EAAMS,QAAQ3P,OAAQzC,IAAK,CAS7C,IAAI0O,EAASiD,EAAMS,QAAQpS,GACvBqS,EAAQ,KACRC,EAAgBxN,EAAKmC,IAAIE,SAG3BkL,EADE3D,EAAO6D,YACDvP,KAAKkC,SAAS8F,UAAU0D,EAAOE,KAAM,CAC3C4C,OAAQ9C,EAAO8C,SAGT,CAAC9C,EAAOE,MAGlB,IAAK,IAAIxO,EAAI,EAAGA,EAAIiS,EAAM5P,OAAQrC,IAAK,CACrC,IAAIwO,EAAOyD,EAAMjS,GAQjBsO,EAAOE,KAAOA,EAOd,IAAI4D,EAAe1N,EAAKkJ,SAASS,WAAWC,GACxC+D,EAAgBzP,KAAKuO,SAASnK,UAAUoL,GAAc5F,UAQ1D,GAA6B,IAAzB6F,EAAchQ,QAAgBiM,EAAOgE,WAAa5N,EAAKgN,MAAMY,SAASC,SAAU,CAClF,IAAK,IAAI5H,EAAI,EAAGA,EAAI2D,EAAO8C,OAAO/O,OAAQsI,IAAK,CAE7CmH,EADIU,EAAQlE,EAAO8C,OAAOzG,IACDjG,EAAKmC,IAAIO,MAGpC,MAGF,IAAK,IAAIqD,EAAI,EAAGA,EAAI4H,EAAchQ,OAAQoI,IAKxC,KAAIgI,EAAeJ,EAAc5H,GAC7B7C,EAAUhF,KAAKqO,cAAcwB,GAC7BC,EAAY9K,EAAQ+K,OAExB,IAAShI,EAAI,EAAGA,EAAI2D,EAAO8C,OAAO/O,OAAQsI,IAAK,CAS7C,IACIiI,EAAehL,EADf4K,EAAQlE,EAAO8C,OAAOzG,IAEtBkI,EAAuBvS,OAAOwF,KAAK8M,GACnCE,EAAYL,EAAe,IAAMD,EACjCO,EAAuB,IAAIrO,EAAKmC,IAAIgM,GAoBxC,GAbIvE,EAAOgE,UAAY5N,EAAKgN,MAAMY,SAASC,WACzCL,EAAgBA,EAAchL,MAAM6L,QAELnM,IAA3BkL,EAAgBU,KAClBV,EAAgBU,GAAS9N,EAAKmC,IAAIE,WASlCuH,EAAOgE,UAAY5N,EAAKgN,MAAMY,SAASU,YA4B3C,GANApB,EAAaY,GAAO9G,OAAOgH,EAAWpE,EAAO2E,OAAO,SAAU5L,EAAGC,GAAK,OAAOD,EAAIC,MAM7EuK,EAAeiB,GAAnB,CAIA,IAAK,IAAIjT,EAAI,EAAGA,EAAIgT,EAAqBxQ,OAAQxC,IAAK,CAOpD,IAGIqT,EAHAC,EAAsBN,EAAqBhT,GAC3CuT,EAAmB,IAAI1O,EAAKyB,SAAUgN,EAAqBX,GAC3DpK,EAAWwK,EAAaO,QAG4BvM,KAAnDsM,EAAavB,EAAeyB,IAC/BzB,EAAeyB,GAAoB,IAAI1O,EAAK2O,UAAWZ,EAAcD,EAAOpK,GAE5E8K,EAAWnO,IAAI0N,EAAcD,EAAOpK,GAKxCyJ,EAAeiB,IAAa,aAnDOlM,IAA7BmL,EAAkBS,KACpBT,EAAkBS,GAAS9N,EAAKmC,IAAIO,OAGtC2K,EAAkBS,GAAST,EAAkBS,GAAOtL,MAAM6L,KA0DlE,GAAIzE,EAAOgE,WAAa5N,EAAKgN,MAAMY,SAASC,SAC1C,IAAS5H,EAAI,EAAGA,EAAI2D,EAAO8C,OAAO/O,OAAQsI,IAAK,CAE7CmH,EADIU,EAAQlE,EAAO8C,OAAOzG,IACDmH,EAAgBU,GAAOxL,UAAUkL,IAUhE,IAAIoB,EAAqB5O,EAAKmC,IAAIE,SAC9BwM,EAAuB7O,EAAKmC,IAAIO,MAEpC,IAASxH,EAAI,EAAGA,EAAIgD,KAAKwO,OAAO/O,OAAQzC,IAAK,CAC3C,IAAI4S,EAEAV,EAFAU,EAAQ5P,KAAKwO,OAAOxR,MAGtB0T,EAAqBA,EAAmBtM,UAAU8K,EAAgBU,KAGhET,EAAkBS,KACpBe,EAAuBA,EAAqBrM,MAAM6K,EAAkBS,KAIxE,IAAIgB,EAAoBlT,OAAOwF,KAAK6L,GAChC8B,EAAU,GACVC,EAAUpT,OAAOY,OAAO,MAY5B,GAAIqQ,EAAMoC,YAAa,CACrBH,EAAoBlT,OAAOwF,KAAKlD,KAAKsO,cAErC,IAAStR,EAAI,EAAGA,EAAI4T,EAAkBnR,OAAQzC,IAAK,CAC7CwT,EAAmBI,EAAkB5T,GAAzC,IACI+G,EAAWjC,EAAKyB,SAASM,WAAW2M,GACxCzB,EAAeyB,GAAoB,IAAI1O,EAAK2O,WAIhD,IAASzT,EAAI,EAAGA,EAAI4T,EAAkBnR,OAAQzC,IAAK,CASjD,IACIwG,GADAO,EAAWjC,EAAKyB,SAASM,WAAW+M,EAAkB5T,KACpCwG,OAEtB,GAAKkN,EAAmBnM,SAASf,KAI7BmN,EAAqBpM,SAASf,GAAlC,CAIA,IAEIwN,EAFAC,EAAcjR,KAAKsO,aAAavK,GAChCmN,EAAQlC,EAAajL,EAASN,WAAWkG,WAAWsH,GAGxD,QAAqCjN,KAAhCgN,EAAWF,EAAQtN,IACtBwN,EAASE,OAASA,EAClBF,EAASG,UAAUC,QAAQrC,EAAehL,QACrC,CACL,IAAI3E,EAAQ,CACViS,IAAK7N,EACL0N,MAAOA,EACPC,UAAWpC,EAAehL,IAE5B+M,EAAQtN,GAAUpE,EAClByR,EAAQhM,KAAKzF,KAOjB,OAAOyR,EAAQ9D,MAAK,SAAUtI,EAAGC,GAC/B,OAAOA,EAAEwM,MAAQzM,EAAEyM,UAYvBpP,EAAKqM,MAAMvP,UAAUuJ,OAAS,WAC5B,IAAIkG,EAAgB3Q,OAAOwF,KAAKlD,KAAKqO,eAClCtB,OACAnH,KAAI,SAAUgG,GACb,MAAO,CAACA,EAAM5L,KAAKqO,cAAczC,MAChC5L,MAEDsO,EAAe5Q,OAAOwF,KAAKlD,KAAKsO,cACjC1I,KAAI,SAAUyL,GACb,MAAO,CAACA,EAAKrR,KAAKsO,aAAa+C,GAAKlJ,YACnCnI,MAEL,MAAO,CACLyC,QAASX,EAAKW,QACd+L,OAAQxO,KAAKwO,OACbF,aAAcA,EACdD,cAAeA,EACfnM,SAAUlC,KAAKkC,SAASiG,WAU5BrG,EAAKqM,MAAMvH,KAAO,SAAU0K,GAC1B,IAAIlD,EAAQ,GACRE,EAAe,GACfiD,EAAoBD,EAAgBhD,aACpCD,EAAgB3Q,OAAOY,OAAO,MAC9BkT,EAA0BF,EAAgBjD,cAC1CoD,EAAkB,IAAI3P,EAAKkJ,SAAS/I,QACpCC,EAAWJ,EAAKwE,SAASM,KAAK0K,EAAgBpP,UAE9CoP,EAAgB7O,SAAWX,EAAKW,SAClCX,EAAKY,MAAMC,KAAK,4EAA8Eb,EAAKW,QAAU,sCAAwC6O,EAAgB7O,QAAU,KAGjL,IAAK,IAAIzF,EAAI,EAAGA,EAAIuU,EAAkB9R,OAAQzC,IAAK,CACjD,IACIqU,GADAK,EAAQH,EAAkBvU,IACd,GACZkH,EAAWwN,EAAM,GAErBpD,EAAa+C,GAAO,IAAIvP,EAAKsG,OAAOlE,GAGtC,IAASlH,EAAI,EAAGA,EAAIwU,EAAwB/R,OAAQzC,IAAK,CACvD,IAAI0U,EACA9F,GADA8F,EAAQF,EAAwBxU,IACnB,GACbgI,EAAU0M,EAAM,GAEpBD,EAAgB7I,OAAOgD,GACvByC,EAAczC,GAAQ5G,EAYxB,OATAyM,EAAgBlG,SAEhB6C,EAAMI,OAAS8C,EAAgB9C,OAE/BJ,EAAME,aAAeA,EACrBF,EAAMC,cAAgBA,EACtBD,EAAMG,SAAWkD,EAAgBjG,KACjC4C,EAAMlM,SAAWA,EAEV,IAAIJ,EAAKqM,MAAMC;;;;IA+BxBtM,EAAKG,QAAU,WACbjC,KAAK2R,KAAO,KACZ3R,KAAK4R,QAAUlU,OAAOY,OAAO,MAC7B0B,KAAK6R,WAAanU,OAAOY,OAAO,MAChC0B,KAAKqO,cAAgB3Q,OAAOY,OAAO,MACnC0B,KAAK8R,qBAAuB,GAC5B9R,KAAK+R,aAAe,GACpB/R,KAAK2F,UAAY7D,EAAK6D,UACtB3F,KAAKkC,SAAW,IAAIJ,EAAKwE,SACzBtG,KAAKuC,eAAiB,IAAIT,EAAKwE,SAC/BtG,KAAKiF,cAAgB,EACrBjF,KAAKgS,GAAK,IACVhS,KAAKiS,IAAM,IACXjS,KAAK8P,UAAY,EACjB9P,KAAKkS,kBAAoB,IAe3BpQ,EAAKG,QAAQrD,UAAUyS,IAAM,SAAUA,GACrCrR,KAAK2R,KAAON,GAmCdvP,EAAKG,QAAQrD,UAAUgR,MAAQ,SAAUnM,EAAW0O,GAClD,GAAI,KAAK1H,KAAKhH,GACZ,MAAM,IAAI2O,WAAY,UAAY3O,EAAY,oCAGhDzD,KAAK4R,QAAQnO,GAAa0O,GAAc,IAW1CrQ,EAAKG,QAAQrD,UAAU8F,EAAI,SAAU2N,GAEjCrS,KAAKgS,GADHK,EAAS,EACD,EACDA,EAAS,EACR,EAEAA,GAWdvQ,EAAKG,QAAQrD,UAAU0T,GAAK,SAAUD,GACpCrS,KAAKiS,IAAMI,GAoBbvQ,EAAKG,QAAQrD,UAAUuD,IAAM,SAAUoQ,EAAKJ,GAC1C,IAAI3O,EAAS+O,EAAIvS,KAAK2R,MAClBnD,EAAS9Q,OAAOwF,KAAKlD,KAAK4R,SAE9B5R,KAAK6R,WAAWrO,GAAU2O,GAAc,GACxCnS,KAAKiF,eAAiB,EAEtB,IAAK,IAAIjI,EAAI,EAAGA,EAAIwR,EAAO/O,OAAQzC,IAAK,CACtC,IAAIyG,EAAY+K,EAAOxR,GACnBwV,EAAYxS,KAAK4R,QAAQnO,GAAW+O,UACpC5C,EAAQ4C,EAAYA,EAAUD,GAAOA,EAAI9O,GACzCsC,EAAS/F,KAAK2F,UAAUiK,EAAO,CAC7BpB,OAAQ,CAAC/K,KAEX4L,EAAQrP,KAAKkC,SAASwF,IAAI3B,GAC1BhC,EAAW,IAAIjC,EAAKyB,SAAUC,EAAQC,GACtCgP,EAAa/U,OAAOY,OAAO,MAE/B0B,KAAK8R,qBAAqB/N,GAAY0O,EACtCzS,KAAK+R,aAAahO,GAAY,EAG9B/D,KAAK+R,aAAahO,IAAasL,EAAM5P,OAGrC,IAAK,IAAIoI,EAAI,EAAGA,EAAIwH,EAAM5P,OAAQoI,IAAK,CACrC,IAAI+D,EAAOyD,EAAMxH,GAUjB,GARwB7D,MAApByO,EAAW7G,KACb6G,EAAW7G,GAAQ,GAGrB6G,EAAW7G,IAAS,EAIY5H,MAA5BhE,KAAKqO,cAAczC,GAAoB,CACzC,IAAI5G,EAAUtH,OAAOY,OAAO,MAC5B0G,EAAgB,OAAIhF,KAAK8P,UACzB9P,KAAK8P,WAAa,EAElB,IAAK,IAAI/H,EAAI,EAAGA,EAAIyG,EAAO/O,OAAQsI,IACjC/C,EAAQwJ,EAAOzG,IAAMrK,OAAOY,OAAO,MAGrC0B,KAAKqO,cAAczC,GAAQ5G,EAIsBhB,MAA/ChE,KAAKqO,cAAczC,GAAMnI,GAAWD,KACtCxD,KAAKqO,cAAczC,GAAMnI,GAAWD,GAAU9F,OAAOY,OAAO,OAK9D,IAAK,IAAIrB,EAAI,EAAGA,EAAI+C,KAAKkS,kBAAkBzS,OAAQxC,IAAK,CACtD,IAAIyV,EAAc1S,KAAKkS,kBAAkBjV,GACrCuI,EAAWoG,EAAKpG,SAASkN,GAEmC1O,MAA5DhE,KAAKqO,cAAczC,GAAMnI,GAAWD,GAAQkP,KAC9C1S,KAAKqO,cAAczC,GAAMnI,GAAWD,GAAQkP,GAAe,IAG7D1S,KAAKqO,cAAczC,GAAMnI,GAAWD,GAAQkP,GAAa7N,KAAKW,OAYtE1D,EAAKG,QAAQrD,UAAU+T,6BAA+B,WAOpD,IALA,IAAIC,EAAYlV,OAAOwF,KAAKlD,KAAK+R,cAC7Bc,EAAiBD,EAAUnT,OAC3BqT,EAAc,GACdC,EAAqB,GAEhB/V,EAAI,EAAGA,EAAI6V,EAAgB7V,IAAK,CACvC,IAAI+G,EAAWjC,EAAKyB,SAASM,WAAW+O,EAAU5V,IAC9C4S,EAAQ7L,EAASN,UAErBsP,EAAmBnD,KAAWmD,EAAmBnD,GAAS,GAC1DmD,EAAmBnD,IAAU,EAE7BkD,EAAYlD,KAAWkD,EAAYlD,GAAS,GAC5CkD,EAAYlD,IAAU5P,KAAK+R,aAAahO,GAG1C,IAAIyK,EAAS9Q,OAAOwF,KAAKlD,KAAK4R,SAE9B,IAAS5U,EAAI,EAAGA,EAAIwR,EAAO/O,OAAQzC,IAAK,CACtC,IAAIyG,EAAY+K,EAAOxR,GACvB8V,EAAYrP,GAAaqP,EAAYrP,GAAasP,EAAmBtP,GAGvEzD,KAAKgT,mBAAqBF,GAQ5BhR,EAAKG,QAAQrD,UAAUqU,mBAAqB,WAM1C,IALA,IAAI3E,EAAe,GACfsE,EAAYlV,OAAOwF,KAAKlD,KAAK8R,sBAC7BoB,EAAkBN,EAAUnT,OAC5B0T,EAAezV,OAAOY,OAAO,MAExBtB,EAAI,EAAGA,EAAIkW,EAAiBlW,IAAK,CAaxC,IAZA,IAAI+G,EAAWjC,EAAKyB,SAASM,WAAW+O,EAAU5V,IAC9CyG,EAAYM,EAASN,UACrB2P,EAAcpT,KAAK+R,aAAahO,GAChCkN,EAAc,IAAInP,EAAKsG,OACvBiL,EAAkBrT,KAAK8R,qBAAqB/N,GAC5CsL,EAAQ3R,OAAOwF,KAAKmQ,GACpBC,EAAcjE,EAAM5P,OAGpB8T,EAAavT,KAAK4R,QAAQnO,GAAW4M,OAAS,EAC9CmD,EAAWxT,KAAK6R,WAAW9N,EAASP,QAAQ6M,OAAS,EAEhDxI,EAAI,EAAGA,EAAIyL,EAAazL,IAAK,CACpC,IAGI9C,EAAKmM,EAAOuC,EAHZ7H,EAAOyD,EAAMxH,GACb6L,EAAKL,EAAgBzH,GACrBkE,EAAY9P,KAAKqO,cAAczC,GAAMmE,YAGd/L,IAAvBmP,EAAavH,IACf7G,EAAMjD,EAAKiD,IAAI/E,KAAKqO,cAAczC,GAAO5L,KAAKiF,eAC9CkO,EAAavH,GAAQ7G,GAErBA,EAAMoO,EAAavH,GAGrBsF,EAAQnM,IAAQ/E,KAAKiS,IAAM,GAAKyB,IAAO1T,KAAKiS,KAAO,EAAIjS,KAAKgS,GAAKhS,KAAKgS,IAAMoB,EAAcpT,KAAKgT,mBAAmBvP,KAAeiQ,GACjIxC,GAASqC,EACTrC,GAASsC,EACTC,EAAqBrO,KAAKuO,MAAc,IAARzC,GAAgB,IAQhDD,EAAYrI,OAAOkH,EAAW2D,GAGhCnF,EAAavK,GAAYkN,EAG3BjR,KAAKsO,aAAeA,GAQtBxM,EAAKG,QAAQrD,UAAUgV,eAAiB,WACtC5T,KAAKuO,SAAWzM,EAAKkJ,SAASK,UAC5B3N,OAAOwF,KAAKlD,KAAKqO,eAAetB,SAYpCjL,EAAKG,QAAQrD,UAAU4D,MAAQ,WAK7B,OAJAxC,KAAK2S,+BACL3S,KAAKiT,qBACLjT,KAAK4T,iBAEE,IAAI9R,EAAKqM,MAAM,CACpBE,cAAerO,KAAKqO,cACpBC,aAActO,KAAKsO,aACnBC,SAAUvO,KAAKuO,SACfC,OAAQ9Q,OAAOwF,KAAKlD,KAAK4R,SACzB1P,SAAUlC,KAAKuC,kBAkBnBT,EAAKG,QAAQrD,UAAUiV,IAAM,SAAUnO,GACrC,IAAIoO,EAAO1Q,MAAMxE,UAAU0E,MAAMnG,KAAK+J,UAAW,GACjD4M,EAAKC,QAAQ/T,MACb0F,EAAGsO,MAAMhU,KAAM8T,IAcjBhS,EAAK2O,UAAY,SAAU7E,EAAMgE,EAAOpK,GAStC,IARA,IAAIyO,EAAiBvW,OAAOY,OAAO,MAC/B4V,EAAexW,OAAOwF,KAAKsC,GAAY,IAOlCxI,EAAI,EAAGA,EAAIkX,EAAazU,OAAQzC,IAAK,CAC5C,IAAIuB,EAAM2V,EAAalX,GACvBiX,EAAe1V,GAAOiH,EAASjH,GAAK+E,QAGtCtD,KAAKwF,SAAW9H,OAAOY,OAAO,WAEjB0F,IAAT4H,IACF5L,KAAKwF,SAASoG,GAAQlO,OAAOY,OAAO,MACpC0B,KAAKwF,SAASoG,GAAMgE,GAASqE,IAajCnS,EAAK2O,UAAU7R,UAAUwS,QAAU,SAAU+C,GAG3C,IAFA,IAAI9E,EAAQ3R,OAAOwF,KAAKiR,EAAe3O,UAE9BxI,EAAI,EAAGA,EAAIqS,EAAM5P,OAAQzC,IAAK,CACrC,IAAI4O,EAAOyD,EAAMrS,GACbwR,EAAS9Q,OAAOwF,KAAKiR,EAAe3O,SAASoG,IAEtB5H,MAAvBhE,KAAKwF,SAASoG,KAChB5L,KAAKwF,SAASoG,GAAQlO,OAAOY,OAAO,OAGtC,IAAK,IAAIuJ,EAAI,EAAGA,EAAI2G,EAAO/O,OAAQoI,IAAK,CACtC,IAAI+H,EAAQpB,EAAO3G,GACf3E,EAAOxF,OAAOwF,KAAKiR,EAAe3O,SAASoG,GAAMgE,IAEnB5L,MAA9BhE,KAAKwF,SAASoG,GAAMgE,KACtB5P,KAAKwF,SAASoG,GAAMgE,GAASlS,OAAOY,OAAO,OAG7C,IAAK,IAAIyJ,EAAI,EAAGA,EAAI7E,EAAKzD,OAAQsI,IAAK,CACpC,IAAIxJ,EAAM2E,EAAK6E,GAEwB/D,MAAnChE,KAAKwF,SAASoG,GAAMgE,GAAOrR,GAC7ByB,KAAKwF,SAASoG,GAAMgE,GAAOrR,GAAO4V,EAAe3O,SAASoG,GAAMgE,GAAOrR,GAEvEyB,KAAKwF,SAASoG,GAAMgE,GAAOrR,GAAOyB,KAAKwF,SAASoG,GAAMgE,GAAOrR,GAAKuG,OAAOqP,EAAe3O,SAASoG,GAAMgE,GAAOrR,QAexHuD,EAAK2O,UAAU7R,UAAUuD,IAAM,SAAUyJ,EAAMgE,EAAOpK,GACpD,KAAMoG,KAAQ5L,KAAKwF,UAGjB,OAFAxF,KAAKwF,SAASoG,GAAQlO,OAAOY,OAAO,WACpC0B,KAAKwF,SAASoG,GAAMgE,GAASpK,GAI/B,GAAMoK,KAAS5P,KAAKwF,SAASoG,GAO7B,IAFA,IAAIsI,EAAexW,OAAOwF,KAAKsC,GAEtBxI,EAAI,EAAGA,EAAIkX,EAAazU,OAAQzC,IAAK,CAC5C,IAAIuB,EAAM2V,EAAalX,GAEnBuB,KAAOyB,KAAKwF,SAASoG,GAAMgE,GAC7B5P,KAAKwF,SAASoG,GAAMgE,GAAOrR,GAAOyB,KAAKwF,SAASoG,GAAMgE,GAAOrR,GAAKuG,OAAOU,EAASjH,IAElFyB,KAAKwF,SAASoG,GAAMgE,GAAOrR,GAAOiH,EAASjH,QAZ7CyB,KAAKwF,SAASoG,GAAMgE,GAASpK,GA2BjC1D,EAAKgN,MAAQ,SAAUsF,GACrBpU,KAAKoP,QAAU,GACfpP,KAAKoU,UAAYA,GA2BnBtS,EAAKgN,MAAMuF,SAAW,IAAIC,OAAQ,KAClCxS,EAAKgN,MAAMuF,SAASE,KAAO,EAC3BzS,EAAKgN,MAAMuF,SAASG,QAAU,EAC9B1S,EAAKgN,MAAMuF,SAASI,SAAW,EAa/B3S,EAAKgN,MAAMY,SAAW,CAIpBgF,SAAU,EAMV/E,SAAU,EAMVS,WAAY,GA0BdtO,EAAKgN,MAAMlQ,UAAU8M,OAAS,SAAUA,GA+BtC,MA9BM,WAAYA,IAChBA,EAAO8C,OAASxO,KAAKoU,WAGjB,UAAW1I,IACfA,EAAO2E,MAAQ,GAGX,gBAAiB3E,IACrBA,EAAO6D,aAAc,GAGjB,aAAc7D,IAClBA,EAAO2I,SAAWvS,EAAKgN,MAAMuF,SAASE,MAGnC7I,EAAO2I,SAAWvS,EAAKgN,MAAMuF,SAASG,SAAa9I,EAAOE,KAAKzF,OAAO,IAAMrE,EAAKgN,MAAMuF,WAC1F3I,EAAOE,KAAO,IAAMF,EAAOE,MAGxBF,EAAO2I,SAAWvS,EAAKgN,MAAMuF,SAASI,UAAc/I,EAAOE,KAAKtI,OAAO,IAAMxB,EAAKgN,MAAMuF,WAC3F3I,EAAOE,KAAYF,EAAOE,KAAO,KAG7B,aAAcF,IAClBA,EAAOgE,SAAW5N,EAAKgN,MAAMY,SAASgF,UAGxC1U,KAAKoP,QAAQvK,KAAK6G,GAEX1L,MAUT8B,EAAKgN,MAAMlQ,UAAUmS,UAAY,WAC/B,IAAK,IAAI/T,EAAI,EAAGA,EAAIgD,KAAKoP,QAAQ3P,OAAQzC,IACvC,GAAIgD,KAAKoP,QAAQpS,GAAG0S,UAAY5N,EAAKgN,MAAMY,SAASU,WAClD,OAAO,EAIX,OAAO,GA6BTtO,EAAKgN,MAAMlQ,UAAUgN,KAAO,SAAUA,EAAM+I,GAC1C,GAAIvR,MAAMC,QAAQuI,GAEhB,OADAA,EAAK9E,SAAQ,SAAU5I,GAAK8B,KAAK4L,KAAK1N,EAAG4D,EAAKY,MAAMO,MAAM0R,MAAa3U,MAChEA,KAGT,IAAI0L,EAASiJ,GAAW,GAKxB,OAJAjJ,EAAOE,KAAOA,EAAK5I,WAEnBhD,KAAK0L,OAAOA,GAEL1L,MAET8B,EAAK8S,gBAAkB,SAAUhS,EAAS2F,EAAOC,GAC/CxI,KAAKzC,KAAO,kBACZyC,KAAK4C,QAAUA,EACf5C,KAAKuI,MAAQA,EACbvI,KAAKwI,IAAMA,GAGb1G,EAAK8S,gBAAgBhW,UAAY,IAAIoI,MACrClF,EAAK+S,WAAa,SAAU1V,GAC1Ba,KAAK8U,QAAU,GACf9U,KAAKb,IAAMA,EACXa,KAAKP,OAASN,EAAIM,OAClBO,KAAKsH,IAAM,EACXtH,KAAKuI,MAAQ,EACbvI,KAAK+U,oBAAsB,IAG7BjT,EAAK+S,WAAWjW,UAAU8I,IAAM,WAG9B,IAFA,IAAIsN,EAAQlT,EAAK+S,WAAWI,QAErBD,GACLA,EAAQA,EAAMhV,OAIlB8B,EAAK+S,WAAWjW,UAAUsW,YAAc,WAKtC,IAJA,IAAIC,EAAY,GACZlP,EAAajG,KAAKuI,MAClBvC,EAAWhG,KAAKsH,IAEXtK,EAAI,EAAGA,EAAIgD,KAAK+U,oBAAoBtV,OAAQzC,IACnDgJ,EAAWhG,KAAK+U,oBAAoB/X,GACpCmY,EAAUtQ,KAAK7E,KAAKb,IAAImE,MAAM2C,EAAYD,IAC1CC,EAAaD,EAAW,EAM1B,OAHAmP,EAAUtQ,KAAK7E,KAAKb,IAAImE,MAAM2C,EAAYjG,KAAKsH,MAC/CtH,KAAK+U,oBAAoBtV,OAAS,EAE3B0V,EAAUC,KAAK,KAGxBtT,EAAK+S,WAAWjW,UAAUyW,KAAO,SAAUC,GACzCtV,KAAK8U,QAAQjQ,KAAK,CAChByQ,KAAMA,EACNnW,IAAKa,KAAKkV,cACV3M,MAAOvI,KAAKuI,MACZC,IAAKxI,KAAKsH,MAGZtH,KAAKuI,MAAQvI,KAAKsH,KAGpBxF,EAAK+S,WAAWjW,UAAU2W,gBAAkB,WAC1CvV,KAAK+U,oBAAoBlQ,KAAK7E,KAAKsH,IAAM,GACzCtH,KAAKsH,KAAO,GAGdxF,EAAK+S,WAAWjW,UAAU8N,KAAO,WAC/B,GAAI1M,KAAKsH,KAAOtH,KAAKP,OACnB,OAAOqC,EAAK+S,WAAWW,IAGzB,IAAIpJ,EAAOpM,KAAKb,IAAIgH,OAAOnG,KAAKsH,KAEhC,OADAtH,KAAKsH,KAAO,EACL8E,GAGTtK,EAAK+S,WAAWjW,UAAU6W,MAAQ,WAChC,OAAOzV,KAAKsH,IAAMtH,KAAKuI,OAGzBzG,EAAK+S,WAAWjW,UAAU8W,OAAS,WAC7B1V,KAAKuI,OAASvI,KAAKsH,MACrBtH,KAAKsH,KAAO,GAGdtH,KAAKuI,MAAQvI,KAAKsH,KAGpBxF,EAAK+S,WAAWjW,UAAU+W,OAAS,WACjC3V,KAAKsH,KAAO,GAGdxF,EAAK+S,WAAWjW,UAAUgX,eAAiB,WACzC,IAAIxJ,EAAMyJ,EAEV,GAEEA,GADAzJ,EAAOpM,KAAK0M,QACIhN,WAAW,SACpBmW,EAAW,IAAMA,EAAW,IAEjCzJ,GAAQtK,EAAK+S,WAAWW,KAC1BxV,KAAK2V,UAIT7T,EAAK+S,WAAWjW,UAAUkX,KAAO,WAC/B,OAAO9V,KAAKsH,IAAMtH,KAAKP,QAGzBqC,EAAK+S,WAAWW,IAAM,MACtB1T,EAAK+S,WAAWkB,MAAQ,QACxBjU,EAAK+S,WAAWmB,KAAO,OACvBlU,EAAK+S,WAAWoB,cAAgB,gBAChCnU,EAAK+S,WAAWqB,MAAQ,QACxBpU,EAAK+S,WAAWsB,SAAW,WAE3BrU,EAAK+S,WAAWuB,SAAW,SAAUC,GAInC,OAHAA,EAAMV,SACNU,EAAMhB,KAAKvT,EAAK+S,WAAWkB,OAC3BM,EAAMX,SACC5T,EAAK+S,WAAWI,SAGzBnT,EAAK+S,WAAWyB,QAAU,SAAUD,GAQlC,GAPIA,EAAMZ,QAAU,IAClBY,EAAMV,SACNU,EAAMhB,KAAKvT,EAAK+S,WAAWmB,OAG7BK,EAAMX,SAEFW,EAAMP,OACR,OAAOhU,EAAK+S,WAAWI,SAI3BnT,EAAK+S,WAAW0B,gBAAkB,SAAUF,GAI1C,OAHAA,EAAMX,SACNW,EAAMT,iBACNS,EAAMhB,KAAKvT,EAAK+S,WAAWoB,eACpBnU,EAAK+S,WAAWI,SAGzBnT,EAAK+S,WAAW2B,SAAW,SAAUH,GAInC,OAHAA,EAAMX,SACNW,EAAMT,iBACNS,EAAMhB,KAAKvT,EAAK+S,WAAWqB,OACpBpU,EAAK+S,WAAWI,SAGzBnT,EAAK+S,WAAW4B,OAAS,SAAUJ,GAC7BA,EAAMZ,QAAU,GAClBY,EAAMhB,KAAKvT,EAAK+S,WAAWmB,OAe/BlU,EAAK+S,WAAW6B,cAAgB5U,EAAK6D,UAAUS,UAE/CtE,EAAK+S,WAAWI,QAAU,SAAUoB,GAClC,OAAa,CACX,IAAIjK,EAAOiK,EAAM3J,OAEjB,GAAIN,GAAQtK,EAAK+S,WAAWW,IAC1B,OAAO1T,EAAK+S,WAAW4B,OAIzB,GAA0B,IAAtBrK,EAAK1M,WAAW,GAApB,CAKA,GAAY,KAAR0M,EACF,OAAOtK,EAAK+S,WAAWuB,SAGzB,GAAY,KAARhK,EAKF,OAJAiK,EAAMV,SACFU,EAAMZ,QAAU,GAClBY,EAAMhB,KAAKvT,EAAK+S,WAAWmB,MAEtBlU,EAAK+S,WAAW0B,gBAGzB,GAAY,KAARnK,EAKF,OAJAiK,EAAMV,SACFU,EAAMZ,QAAU,GAClBY,EAAMhB,KAAKvT,EAAK+S,WAAWmB,MAEtBlU,EAAK+S,WAAW2B,SAMzB,GAAY,KAARpK,GAAiC,IAAlBiK,EAAMZ,QAEvB,OADAY,EAAMhB,KAAKvT,EAAK+S,WAAWsB,UACpBrU,EAAK+S,WAAWI,QAMzB,GAAY,KAAR7I,GAAiC,IAAlBiK,EAAMZ,QAEvB,OADAY,EAAMhB,KAAKvT,EAAK+S,WAAWsB,UACpBrU,EAAK+S,WAAWI,QAGzB,GAAI7I,EAAKhN,MAAM0C,EAAK+S,WAAW6B,eAC7B,OAAO5U,EAAK+S,WAAWyB,aAzCvBD,EAAMd,oBA8CZzT,EAAK8M,YAAc,SAAUzP,EAAKwP,GAChC3O,KAAKqW,MAAQ,IAAIvU,EAAK+S,WAAY1V,GAClCa,KAAK2O,MAAQA,EACb3O,KAAK2W,cAAgB,GACrB3W,KAAK4W,UAAY,GAGnB9U,EAAK8M,YAAYhQ,UAAUiQ,MAAQ,WACjC7O,KAAKqW,MAAM3O,MACX1H,KAAK8U,QAAU9U,KAAKqW,MAAMvB,QAI1B,IAFA,IAAIE,EAAQlT,EAAK8M,YAAYiI,YAEtB7B,GACLA,EAAQA,EAAMhV,MAGhB,OAAOA,KAAK2O,OAGd7M,EAAK8M,YAAYhQ,UAAUkY,WAAa,WACtC,OAAO9W,KAAK8U,QAAQ9U,KAAK4W,YAG3B9U,EAAK8M,YAAYhQ,UAAUmY,cAAgB,WACzC,IAAIC,EAAShX,KAAK8W,aAElB,OADA9W,KAAK4W,WAAa,EACXI,GAGTlV,EAAK8M,YAAYhQ,UAAUqY,WAAa,WACtC,IAAIC,EAAkBlX,KAAK2W,cAC3B3W,KAAK2O,MAAMjD,OAAOwL,GAClBlX,KAAK2W,cAAgB,IAGvB7U,EAAK8M,YAAYiI,YAAc,SAAUM,GACvC,IAAIH,EAASG,EAAOL,aAEpB,GAAc9S,MAAVgT,EAIJ,OAAQA,EAAO1B,MACb,KAAKxT,EAAK+S,WAAWsB,SACnB,OAAOrU,EAAK8M,YAAYwI,cAC1B,KAAKtV,EAAK+S,WAAWkB,MACnB,OAAOjU,EAAK8M,YAAYyI,WAC1B,KAAKvV,EAAK+S,WAAWmB,KACnB,OAAOlU,EAAK8M,YAAY0I,UAC1B,QACE,IAAIC,EAAe,4CAA8CP,EAAO1B,KAMxE,MAJI0B,EAAO7X,IAAIM,QAAU,IACvB8X,GAAgB,gBAAkBP,EAAO7X,IAAM,KAG3C,IAAI2C,EAAK8S,gBAAiB2C,EAAcP,EAAOzO,MAAOyO,EAAOxO,OAIzE1G,EAAK8M,YAAYwI,cAAgB,SAAUD,GACzC,IAAIH,EAASG,EAAOJ,gBAEpB,GAAc/S,MAAVgT,EAAJ,CAIA,OAAQA,EAAO7X,KACb,IAAK,IACHgY,EAAOR,cAAcjH,SAAW5N,EAAKgN,MAAMY,SAASU,WACpD,MACF,IAAK,IACH+G,EAAOR,cAAcjH,SAAW5N,EAAKgN,MAAMY,SAASC,SACpD,MACF,QACE,IAAI4H,EAAe,kCAAoCP,EAAO7X,IAAM,IACpE,MAAM,IAAI2C,EAAK8S,gBAAiB2C,EAAcP,EAAOzO,MAAOyO,EAAOxO,KAGvE,IAAIgP,EAAaL,EAAOL,aAExB,GAAkB9S,MAAdwT,EAAyB,CACvBD,EAAe,yCACnB,MAAM,IAAIzV,EAAK8S,gBAAiB2C,EAAcP,EAAOzO,MAAOyO,EAAOxO,KAGrE,OAAQgP,EAAWlC,MACjB,KAAKxT,EAAK+S,WAAWkB,MACnB,OAAOjU,EAAK8M,YAAYyI,WAC1B,KAAKvV,EAAK+S,WAAWmB,KACnB,OAAOlU,EAAK8M,YAAY0I,UAC1B,QACMC,EAAe,mCAAqCC,EAAWlC,KAAO,IAC1E,MAAM,IAAIxT,EAAK8S,gBAAiB2C,EAAcC,EAAWjP,MAAOiP,EAAWhP,QAIjF1G,EAAK8M,YAAYyI,WAAa,SAAUF,GACtC,IAAIH,EAASG,EAAOJ,gBAEpB,GAAc/S,MAAVgT,EAAJ,CAIA,IAAmD,GAA/CG,EAAOxI,MAAMyF,UAAUtQ,QAAQkT,EAAO7X,KAAY,CACpD,IAAIsY,EAAiBN,EAAOxI,MAAMyF,UAAUxO,KAAI,SAAU8R,GAAK,MAAO,IAAMA,EAAI,OAAOtC,KAAK,MACxFmC,EAAe,uBAAyBP,EAAO7X,IAAM,uBAAyBsY,EAElF,MAAM,IAAI3V,EAAK8S,gBAAiB2C,EAAcP,EAAOzO,MAAOyO,EAAOxO,KAGrE2O,EAAOR,cAAcnI,OAAS,CAACwI,EAAO7X,KAEtC,IAAIqY,EAAaL,EAAOL,aAExB,GAAkB9S,MAAdwT,EAAyB,CACvBD,EAAe,gCACnB,MAAM,IAAIzV,EAAK8S,gBAAiB2C,EAAcP,EAAOzO,MAAOyO,EAAOxO,KAGrE,OAAQgP,EAAWlC,MACjB,KAAKxT,EAAK+S,WAAWmB,KACnB,OAAOlU,EAAK8M,YAAY0I,UAC1B,QACMC,EAAe,0BAA4BC,EAAWlC,KAAO,IACjE,MAAM,IAAIxT,EAAK8S,gBAAiB2C,EAAcC,EAAWjP,MAAOiP,EAAWhP,QAIjF1G,EAAK8M,YAAY0I,UAAY,SAAUH,GACrC,IAAIH,EAASG,EAAOJ,gBAEpB,GAAc/S,MAAVgT,EAAJ,CAIAG,EAAOR,cAAc/K,KAAOoL,EAAO7X,IAAI0G,eAEP,GAA5BmR,EAAO7X,IAAI2E,QAAQ,OACrBqT,EAAOR,cAAcpH,aAAc,GAGrC,IAAIiI,EAAaL,EAAOL,aAExB,GAAkB9S,MAAdwT,EAKJ,OAAQA,EAAWlC,MACjB,KAAKxT,EAAK+S,WAAWmB,KAEnB,OADAmB,EAAOF,aACAnV,EAAK8M,YAAY0I,UAC1B,KAAKxV,EAAK+S,WAAWkB,MAEnB,OADAoB,EAAOF,aACAnV,EAAK8M,YAAYyI,WAC1B,KAAKvV,EAAK+S,WAAWoB,cACnB,OAAOnU,EAAK8M,YAAY+I,kBAC1B,KAAK7V,EAAK+S,WAAWqB,MACnB,OAAOpU,EAAK8M,YAAYgJ,WAC1B,KAAK9V,EAAK+S,WAAWsB,SAEnB,OADAgB,EAAOF,aACAnV,EAAK8M,YAAYwI,cAC1B,QACE,IAAIG,EAAe,2BAA6BC,EAAWlC,KAAO,IAClE,MAAM,IAAIxT,EAAK8S,gBAAiB2C,EAAcC,EAAWjP,MAAOiP,EAAWhP,UApB7E2O,EAAOF,eAwBXnV,EAAK8M,YAAY+I,kBAAoB,SAAUR,GAC7C,IAAIH,EAASG,EAAOJ,gBAEpB,GAAc/S,MAAVgT,EAAJ,CAIA,IAAInL,EAAegM,SAASb,EAAO7X,IAAK,IAExC,GAAI2Y,MAAMjM,GAAe,CACvB,IAAI0L,EAAe,gCACnB,MAAM,IAAIzV,EAAK8S,gBAAiB2C,EAAcP,EAAOzO,MAAOyO,EAAOxO,KAGrE2O,EAAOR,cAAc9K,aAAeA,EAEpC,IAAI2L,EAAaL,EAAOL,aAExB,GAAkB9S,MAAdwT,EAKJ,OAAQA,EAAWlC,MACjB,KAAKxT,EAAK+S,WAAWmB,KAEnB,OADAmB,EAAOF,aACAnV,EAAK8M,YAAY0I,UAC1B,KAAKxV,EAAK+S,WAAWkB,MAEnB,OADAoB,EAAOF,aACAnV,EAAK8M,YAAYyI,WAC1B,KAAKvV,EAAK+S,WAAWoB,cACnB,OAAOnU,EAAK8M,YAAY+I,kBAC1B,KAAK7V,EAAK+S,WAAWqB,MACnB,OAAOpU,EAAK8M,YAAYgJ,WAC1B,KAAK9V,EAAK+S,WAAWsB,SAEnB,OADAgB,EAAOF,aACAnV,EAAK8M,YAAYwI,cAC1B,QACMG,EAAe,2BAA6BC,EAAWlC,KAAO,IAClE,MAAM,IAAIxT,EAAK8S,gBAAiB2C,EAAcC,EAAWjP,MAAOiP,EAAWhP,UApB7E2O,EAAOF,eAwBXnV,EAAK8M,YAAYgJ,WAAa,SAAUT,GACtC,IAAIH,EAASG,EAAOJ,gBAEpB,GAAc/S,MAAVgT,EAAJ,CAIA,IAAI3G,EAAQwH,SAASb,EAAO7X,IAAK,IAEjC,GAAI2Y,MAAMzH,GAAQ,CAChB,IAAIkH,EAAe,wBACnB,MAAM,IAAIzV,EAAK8S,gBAAiB2C,EAAcP,EAAOzO,MAAOyO,EAAOxO,KAGrE2O,EAAOR,cAActG,MAAQA,EAE7B,IAAImH,EAAaL,EAAOL,aAExB,GAAkB9S,MAAdwT,EAKJ,OAAQA,EAAWlC,MACjB,KAAKxT,EAAK+S,WAAWmB,KAEnB,OADAmB,EAAOF,aACAnV,EAAK8M,YAAY0I,UAC1B,KAAKxV,EAAK+S,WAAWkB,MAEnB,OADAoB,EAAOF,aACAnV,EAAK8M,YAAYyI,WAC1B,KAAKvV,EAAK+S,WAAWoB,cACnB,OAAOnU,EAAK8M,YAAY+I,kBAC1B,KAAK7V,EAAK+S,WAAWqB,MACnB,OAAOpU,EAAK8M,YAAYgJ,WAC1B,KAAK9V,EAAK+S,WAAWsB,SAEnB,OADAgB,EAAOF,aACAnV,EAAK8M,YAAYwI,cAC1B,QACMG,EAAe,2BAA6BC,EAAWlC,KAAO,IAClE,MAAM,IAAIxT,EAAK8S,gBAAiB2C,EAAcC,EAAWjP,MAAOiP,EAAWhP,UApB7E2O,EAAOF,oBA+BS,0BAAd,EAYI,WAMN,OAAOnV,IAlBS,kCAx3GnB,I,01BCyBiBiW,E,iqBC8DlB,aA2BE,WAAmB,G,IAAEhW,EAAA,EAAAA,OAAQiW,EAAA,EAAAA,KAAM9V,EAAA,EAAAA,SAAU3C,EAAA,EAAAA,MAC3CS,KAAKiY,UCpDF,SACLD,G,QAEMC,EAAY,IAAIC,I,IACtB,IAAkB,QAAAF,GAAI,8BAAE,CAAnB,IAAMzF,EAAG,QACN,6BAAC4F,EAAA,KAAMC,EAAA,KAGPC,EAAW9F,EAAI8F,SACfC,EAAW/F,EAAI+F,MAGfC,EAAO,EAAWhG,EAAIgG,MACzBzY,QAAQ,mBAAoB,IAC5BA,QAAQ,OAAQ,KAGnB,GAAIsY,EAAM,CACR,IAAMpK,EAASiK,EAAUpa,IAAIsa,GAGxBnK,EAAOwK,OAOVP,EAAUQ,IAAIJ,EAAU,CAAEA,SAAQ,EAAEC,MAAK,EAAEC,KAAI,EAAEvK,OAAM,KANvDA,EAAOsK,MAAS/F,EAAI+F,MACpBtK,EAAOuK,KAASA,EAChBvK,EAAOwK,QAAS,QASlBP,EAAUQ,IAAIJ,EAAU,CAAEA,SAAQ,EAAEC,MAAK,EAAEC,KAAI,EAAEC,QAAQ,K,iGAG7D,OAAOP,EDgBYS,CAAuBV,GACxChY,KAAK2Y,UE1DF,SACL5W,GAEA,IAAMqE,EAAY,IAAI0D,OAAO/H,EAAOqE,UAAW,OACzCuS,EAAY,SAACC,EAAYC,EAAcjN,GAC3C,OAAUiN,EAAI,OAAOjN,EAAI,SAI3B,OAAO,SAAC+C,GACNA,EAAQA,EACL7O,QAAQ,eAAgB,KACxBgZ,OAGH,IAAM1Z,EAAQ,IAAI0K,OAAO,MAAM/H,EAAOqE,UAAS,KAC7C,EAAauI,GAAO7O,QAAQsG,EAAW,KAAI,IACxC,OAGL,OAAO,SAAA2S,GAAY,cACdA,GAAQ,CACXT,MAAOS,EAAST,MAAMxY,QAAQV,EAAOuZ,GACrCJ,KAAOQ,EAASR,KAAKzY,QAAQV,EAAOuZ,OFmCrBK,CAAuBjX,GAItC/B,KAAKT,WADc,IAAVA,EACI,GAAK,W,UAChB2C,EAAWA,GAAY,CACrBE,SAAS,EACT6W,WAAW,GAIbjZ,KAAKkC,SAASgG,QACVhG,EAASE,SACXpC,KAAKkC,SAASC,IAAI,WAChBD,EAAS+W,WACXjZ,KAAKkC,SAASC,IAAI,kBAGO,IAAvBJ,EAAOmX,KAAKzZ,QAAmC,OAAnBsC,EAAOmX,KAAK,GAC1ClZ,KAAK6T,IAAK,EAAa9R,EAAOmX,KAAK,KAC1BnX,EAAOmX,KAAKzZ,OAAS,GAC9BO,KAAK6T,KAAK,KAAasF,cAAa,UAAIpX,EAAOmX,QAIjDlZ,KAAK4P,MAAM,QAAS,CAAES,MAAO,KAC7BrQ,KAAK4P,MAAM,QACX5P,KAAKqR,IAAI,Y,IAGT,IAAkB,QAAA2G,GAAI,+BAAjB,IAAMzF,EAAG,QACZvS,KAAKmC,IAAIoQ,I,qGAKA,QAAW3L,KACL,iBAAVrH,EACH6Z,KAAKvK,MAAMtP,GACXA,GAuEZ,OAlDS,YAAAkP,OAAP,SAAcE,GAAd,WACE,GAAIA,EACF,IAGE,IAAM0K,EAASrZ,KAAKT,MAAMkP,OAAOE,GAC9B7D,QAAO,SAAC+F,EAAS/I,GAChB,IAAMiR,EAAW,EAAKd,UAAUpa,IAAIiK,EAAOuJ,KAC3C,QAAwB,IAAb0H,EACT,GAAI,WAAYA,EAAU,CACxB,IAAM1H,EAAM0H,EAAS/K,OAAOqK,SAC5BxH,EAAQ4H,IAAIpH,EAAK,EAAIR,EAAQhT,IAAIwT,IAAQ,GAAI,CAAAvJ,SACxC,CACCuJ,EAAM0H,EAASV,SACrBxH,EAAQ4H,IAAIpH,EAAKR,EAAQhT,IAAIwT,IAAQ,IAGzC,OAAOR,IACN,IAAIqH,KAGH,EAAKlY,KAAK2Y,UAAUhK,GAG1B,OAAO,EAAI0K,GAAQzT,KAAI,SAAC,G,IAAA,SAACyL,EAAA,KAAKiI,EAAA,KAAc,OAC1CC,QAAS,EAAG,EAAKtB,UAAUpa,IAAIwT,IAC/BiI,SAAUA,EAAS1T,KAAI,SAAA4T,GACrB,OAAO,EAAG,EAAKvB,UAAUpa,IAAI2b,EAAQnI,aAKzC,MAAOoI,GAEP5W,QAAQF,KAAK,kBAAkBgM,EAAK,iCAKxC,MAAO,IAQF,YAAA3L,SAAP,WACE,OAAOoW,KAAKM,UAAU1Z,KAAKT,QAE/B,EA3IA,ID9DA,SAAkBwY,GAChB,qBACA,mBACA,qBACA,uBAJF,CAAkBA,MAAiB,KI/BnC,wC,IAiCI,E,iqBAwCG,SAAS4B,EAAQ/W,GACtB,OAAQA,EAAQ0S,MAGd,KAAKyC,EAAkB6B,MAGrB,OApCN,SAA4B7X,G,QACpB8X,EAAO,UAGPC,EAAU,CAAID,EAAI,gC,IACxB,IAAmB,QAAA9X,EAAOmX,MAAI,8BAAE,CAA3B,IAAMA,EAAI,QACA,OAATA,GAAeY,EAAQjV,KAAQgV,EAAI,eAC1B,OAATX,GAAeY,EAAQjV,KAAQgV,EAAI,SAASX,EAAI,Y,iGAIlDY,EAAQra,OAAS,GACnBqa,EAAQjV,KAAQgV,EAAI,sBAGtBE,cAAa,eAAID,IAmBbE,CAAmBpX,EAAQiW,KAAK9W,QAChC,EAAQ,IAAI,EAAYa,EAAQiW,MACzB,CACLvD,KAAMyC,EAAkBkC,KACxBpB,KAAM,EAAM7V,YAIhB,KAAK+U,EAAkBmC,MACrB,MAAO,CACL5E,KAAMyC,EAAkBoC,OACxBtB,KAAM,EAAQ,EAAMpK,OAAO7L,EAAQiW,MAAQ,IAI/C,QACE,MAAM,IAAIhZ,UAAU,yBAQ1Bua,KAAKC,iBAAiB,WAAW,SAAAC,GAC/BF,KAAKG,YAAYZ,EAAQW,EAAGzB","file":"worker/search.js","sourcesContent":[" \t// The module cache\n \tvar installedModules = {};\n\n \t// The require function\n \tfunction __webpack_require__(moduleId) {\n\n \t\t// Check if module is in cache\n \t\tif(installedModules[moduleId]) {\n \t\t\treturn installedModules[moduleId].exports;\n \t\t}\n \t\t// Create a new module (and put it into the cache)\n \t\tvar module = installedModules[moduleId] = {\n \t\t\ti: moduleId,\n \t\t\tl: false,\n \t\t\texports: {}\n \t\t};\n\n \t\t// Execute the module function\n \t\tmodules[moduleId].call(module.exports, module, module.exports, __webpack_require__);\n\n \t\t// Flag the module as loaded\n \t\tmodule.l = true;\n\n \t\t// Return the exports of the module\n \t\treturn module.exports;\n \t}\n\n\n \t// expose the modules object (__webpack_modules__)\n \t__webpack_require__.m = modules;\n\n \t// expose the module cache\n \t__webpack_require__.c = installedModules;\n\n \t// define getter function for harmony exports\n \t__webpack_require__.d = function(exports, name, getter) {\n \t\tif(!__webpack_require__.o(exports, name)) {\n \t\t\tObject.defineProperty(exports, name, { enumerable: true, get: getter });\n \t\t}\n \t};\n\n \t// define __esModule on exports\n \t__webpack_require__.r = function(exports) {\n \t\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n \t\t\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\n \t\t}\n \t\tObject.defineProperty(exports, '__esModule', { value: true });\n \t};\n\n \t// create a fake namespace object\n \t// mode & 1: value is a module id, require it\n \t// mode & 2: merge all properties of value into the ns\n \t// mode & 4: return value when already ns object\n \t// mode & 8|1: behave like require\n \t__webpack_require__.t = function(value, mode) {\n \t\tif(mode & 1) value = __webpack_require__(value);\n \t\tif(mode & 8) return value;\n \t\tif((mode & 4) && typeof value === 'object' && value && value.__esModule) return value;\n \t\tvar ns = Object.create(null);\n \t\t__webpack_require__.r(ns);\n \t\tObject.defineProperty(ns, 'default', { enumerable: true, value: value });\n \t\tif(mode & 2 && typeof value != 'string') for(var key in value) __webpack_require__.d(ns, key, function(key) { return value[key]; }.bind(null, key));\n \t\treturn ns;\n \t};\n\n \t// getDefaultExport function for compatibility with non-harmony modules\n \t__webpack_require__.n = function(module) {\n \t\tvar getter = module && module.__esModule ?\n \t\t\tfunction getDefault() { return module['default']; } :\n \t\t\tfunction getModuleExports() { return module; };\n \t\t__webpack_require__.d(getter, 'a', getter);\n \t\treturn getter;\n \t};\n\n \t// Object.prototype.hasOwnProperty.call\n \t__webpack_require__.o = function(object, property) { return Object.prototype.hasOwnProperty.call(object, property); };\n\n \t// __webpack_public_path__\n \t__webpack_require__.p = \"\";\n\n\n \t// Load entry module and return exports\n \treturn __webpack_require__(__webpack_require__.s = 5);\n","module.exports = global[\"lunr\"] = require(\"-!./lunr.js\");","/*!\n * escape-html\n * Copyright(c) 2012-2013 TJ Holowaychuk\n * Copyright(c) 2015 Andreas Lubbe\n * Copyright(c) 2015 Tiancheng \"Timothy\" Gu\n * MIT Licensed\n */\n\n'use strict';\n\n/**\n * Module variables.\n * @private\n */\n\nvar matchHtmlRegExp = /[\"'&<>]/;\n\n/**\n * Module exports.\n * @public\n */\n\nmodule.exports = escapeHtml;\n\n/**\n * Escape special characters in the given string of html.\n *\n * @param {string} string The string to escape for inserting into HTML\n * @return {string}\n * @public\n */\n\nfunction escapeHtml(string) {\n var str = '' + string;\n var match = matchHtmlRegExp.exec(str);\n\n if (!match) {\n return str;\n }\n\n var escape;\n var html = '';\n var index = 0;\n var lastIndex = 0;\n\n for (index = match.index; index < str.length; index++) {\n switch (str.charCodeAt(index)) {\n case 34: // \"\n escape = '"';\n break;\n case 38: // &\n escape = '&';\n break;\n case 39: // '\n escape = ''';\n break;\n case 60: // <\n escape = '<';\n break;\n case 62: // >\n escape = '>';\n break;\n default:\n continue;\n }\n\n if (lastIndex !== index) {\n html += str.substring(lastIndex, index);\n }\n\n lastIndex = index + 1;\n html += escape;\n }\n\n return lastIndex !== index\n ? html + str.substring(lastIndex, index)\n : html;\n}\n","'use strict';\n\nconst matchOperatorsRegex = /[|\\\\{}()[\\]^$+*?.-]/g;\n\nmodule.exports = string => {\n\tif (typeof string !== 'string') {\n\t\tthrow new TypeError('Expected a string');\n\t}\n\n\treturn string.replace(matchOperatorsRegex, '\\\\$&');\n};\n","var g;\n\n// This works in non-strict mode\ng = (function() {\n\treturn this;\n})();\n\ntry {\n\t// This works if eval is allowed (see CSP)\n\tg = g || new Function(\"return this\")();\n} catch (e) {\n\t// This works if the window reference is available\n\tif (typeof window === \"object\") g = window;\n}\n\n// g can still be undefined, but nothing to do about it...\n// We return undefined, instead of nothing here, so it's\n// easier to handle this case. if(!global) { ...}\n\nmodule.exports = g;\n","/**\n * lunr - http://lunrjs.com - A bit like Solr, but much smaller and not as bright - 2.3.8\n * Copyright (C) 2019 Oliver Nightingale\n * @license MIT\n */\n\n;(function(){\n\n/**\n * A convenience function for configuring and constructing\n * a new lunr Index.\n *\n * A lunr.Builder instance is created and the pipeline setup\n * with a trimmer, stop word filter and stemmer.\n *\n * This builder object is yielded to the configuration function\n * that is passed as a parameter, allowing the list of fields\n * and other builder parameters to be customised.\n *\n * All documents _must_ be added within the passed config function.\n *\n * @example\n * var idx = lunr(function () {\n * this.field('title')\n * this.field('body')\n * this.ref('id')\n *\n * documents.forEach(function (doc) {\n * this.add(doc)\n * }, this)\n * })\n *\n * @see {@link lunr.Builder}\n * @see {@link lunr.Pipeline}\n * @see {@link lunr.trimmer}\n * @see {@link lunr.stopWordFilter}\n * @see {@link lunr.stemmer}\n * @namespace {function} lunr\n */\nvar lunr = function (config) {\n var builder = new lunr.Builder\n\n builder.pipeline.add(\n lunr.trimmer,\n lunr.stopWordFilter,\n lunr.stemmer\n )\n\n builder.searchPipeline.add(\n lunr.stemmer\n )\n\n config.call(builder, builder)\n return builder.build()\n}\n\nlunr.version = \"2.3.8\"\n/*!\n * lunr.utils\n * Copyright (C) 2019 Oliver Nightingale\n */\n\n/**\n * A namespace containing utils for the rest of the lunr library\n * @namespace lunr.utils\n */\nlunr.utils = {}\n\n/**\n * Print a warning message to the console.\n *\n * @param {String} message The message to be printed.\n * @memberOf lunr.utils\n * @function\n */\nlunr.utils.warn = (function (global) {\n /* eslint-disable no-console */\n return function (message) {\n if (global.console && console.warn) {\n console.warn(message)\n }\n }\n /* eslint-enable no-console */\n})(this)\n\n/**\n * Convert an object to a string.\n *\n * In the case of `null` and `undefined` the function returns\n * the empty string, in all other cases the result of calling\n * `toString` on the passed object is returned.\n *\n * @param {Any} obj The object to convert to a string.\n * @return {String} string representation of the passed object.\n * @memberOf lunr.utils\n */\nlunr.utils.asString = function (obj) {\n if (obj === void 0 || obj === null) {\n return \"\"\n } else {\n return obj.toString()\n }\n}\n\n/**\n * Clones an object.\n *\n * Will create a copy of an existing object such that any mutations\n * on the copy cannot affect the original.\n *\n * Only shallow objects are supported, passing a nested object to this\n * function will cause a TypeError.\n *\n * Objects with primitives, and arrays of primitives are supported.\n *\n * @param {Object} obj The object to clone.\n * @return {Object} a clone of the passed object.\n * @throws {TypeError} when a nested object is passed.\n * @memberOf Utils\n */\nlunr.utils.clone = function (obj) {\n if (obj === null || obj === undefined) {\n return obj\n }\n\n var clone = Object.create(null),\n keys = Object.keys(obj)\n\n for (var i = 0; i < keys.length; i++) {\n var key = keys[i],\n val = obj[key]\n\n if (Array.isArray(val)) {\n clone[key] = val.slice()\n continue\n }\n\n if (typeof val === 'string' ||\n typeof val === 'number' ||\n typeof val === 'boolean') {\n clone[key] = val\n continue\n }\n\n throw new TypeError(\"clone is not deep and does not support nested objects\")\n }\n\n return clone\n}\nlunr.FieldRef = function (docRef, fieldName, stringValue) {\n this.docRef = docRef\n this.fieldName = fieldName\n this._stringValue = stringValue\n}\n\nlunr.FieldRef.joiner = \"/\"\n\nlunr.FieldRef.fromString = function (s) {\n var n = s.indexOf(lunr.FieldRef.joiner)\n\n if (n === -1) {\n throw \"malformed field ref string\"\n }\n\n var fieldRef = s.slice(0, n),\n docRef = s.slice(n + 1)\n\n return new lunr.FieldRef (docRef, fieldRef, s)\n}\n\nlunr.FieldRef.prototype.toString = function () {\n if (this._stringValue == undefined) {\n this._stringValue = this.fieldName + lunr.FieldRef.joiner + this.docRef\n }\n\n return this._stringValue\n}\n/*!\n * lunr.Set\n * Copyright (C) 2019 Oliver Nightingale\n */\n\n/**\n * A lunr set.\n *\n * @constructor\n */\nlunr.Set = function (elements) {\n this.elements = Object.create(null)\n\n if (elements) {\n this.length = elements.length\n\n for (var i = 0; i < this.length; i++) {\n this.elements[elements[i]] = true\n }\n } else {\n this.length = 0\n }\n}\n\n/**\n * A complete set that contains all elements.\n *\n * @static\n * @readonly\n * @type {lunr.Set}\n */\nlunr.Set.complete = {\n intersect: function (other) {\n return other\n },\n\n union: function (other) {\n return other\n },\n\n contains: function () {\n return true\n }\n}\n\n/**\n * An empty set that contains no elements.\n *\n * @static\n * @readonly\n * @type {lunr.Set}\n */\nlunr.Set.empty = {\n intersect: function () {\n return this\n },\n\n union: function (other) {\n return other\n },\n\n contains: function () {\n return false\n }\n}\n\n/**\n * Returns true if this set contains the specified object.\n *\n * @param {object} object - Object whose presence in this set is to be tested.\n * @returns {boolean} - True if this set contains the specified object.\n */\nlunr.Set.prototype.contains = function (object) {\n return !!this.elements[object]\n}\n\n/**\n * Returns a new set containing only the elements that are present in both\n * this set and the specified set.\n *\n * @param {lunr.Set} other - set to intersect with this set.\n * @returns {lunr.Set} a new set that is the intersection of this and the specified set.\n */\n\nlunr.Set.prototype.intersect = function (other) {\n var a, b, elements, intersection = []\n\n if (other === lunr.Set.complete) {\n return this\n }\n\n if (other === lunr.Set.empty) {\n return other\n }\n\n if (this.length < other.length) {\n a = this\n b = other\n } else {\n a = other\n b = this\n }\n\n elements = Object.keys(a.elements)\n\n for (var i = 0; i < elements.length; i++) {\n var element = elements[i]\n if (element in b.elements) {\n intersection.push(element)\n }\n }\n\n return new lunr.Set (intersection)\n}\n\n/**\n * Returns a new set combining the elements of this and the specified set.\n *\n * @param {lunr.Set} other - set to union with this set.\n * @return {lunr.Set} a new set that is the union of this and the specified set.\n */\n\nlunr.Set.prototype.union = function (other) {\n if (other === lunr.Set.complete) {\n return lunr.Set.complete\n }\n\n if (other === lunr.Set.empty) {\n return this\n }\n\n return new lunr.Set(Object.keys(this.elements).concat(Object.keys(other.elements)))\n}\n/**\n * A function to calculate the inverse document frequency for\n * a posting. This is shared between the builder and the index\n *\n * @private\n * @param {object} posting - The posting for a given term\n * @param {number} documentCount - The total number of documents.\n */\nlunr.idf = function (posting, documentCount) {\n var documentsWithTerm = 0\n\n for (var fieldName in posting) {\n if (fieldName == '_index') continue // Ignore the term index, its not a field\n documentsWithTerm += Object.keys(posting[fieldName]).length\n }\n\n var x = (documentCount - documentsWithTerm + 0.5) / (documentsWithTerm + 0.5)\n\n return Math.log(1 + Math.abs(x))\n}\n\n/**\n * A token wraps a string representation of a token\n * as it is passed through the text processing pipeline.\n *\n * @constructor\n * @param {string} [str=''] - The string token being wrapped.\n * @param {object} [metadata={}] - Metadata associated with this token.\n */\nlunr.Token = function (str, metadata) {\n this.str = str || \"\"\n this.metadata = metadata || {}\n}\n\n/**\n * Returns the token string that is being wrapped by this object.\n *\n * @returns {string}\n */\nlunr.Token.prototype.toString = function () {\n return this.str\n}\n\n/**\n * A token update function is used when updating or optionally\n * when cloning a token.\n *\n * @callback lunr.Token~updateFunction\n * @param {string} str - The string representation of the token.\n * @param {Object} metadata - All metadata associated with this token.\n */\n\n/**\n * Applies the given function to the wrapped string token.\n *\n * @example\n * token.update(function (str, metadata) {\n * return str.toUpperCase()\n * })\n *\n * @param {lunr.Token~updateFunction} fn - A function to apply to the token string.\n * @returns {lunr.Token}\n */\nlunr.Token.prototype.update = function (fn) {\n this.str = fn(this.str, this.metadata)\n return this\n}\n\n/**\n * Creates a clone of this token. Optionally a function can be\n * applied to the cloned token.\n *\n * @param {lunr.Token~updateFunction} [fn] - An optional function to apply to the cloned token.\n * @returns {lunr.Token}\n */\nlunr.Token.prototype.clone = function (fn) {\n fn = fn || function (s) { return s }\n return new lunr.Token (fn(this.str, this.metadata), this.metadata)\n}\n/*!\n * lunr.tokenizer\n * Copyright (C) 2019 Oliver Nightingale\n */\n\n/**\n * A function for splitting a string into tokens ready to be inserted into\n * the search index. Uses `lunr.tokenizer.separator` to split strings, change\n * the value of this property to change how strings are split into tokens.\n *\n * This tokenizer will convert its parameter to a string by calling `toString` and\n * then will split this string on the character in `lunr.tokenizer.separator`.\n * Arrays will have their elements converted to strings and wrapped in a lunr.Token.\n *\n * Optional metadata can be passed to the tokenizer, this metadata will be cloned and\n * added as metadata to every token that is created from the object to be tokenized.\n *\n * @static\n * @param {?(string|object|object[])} obj - The object to convert into tokens\n * @param {?object} metadata - Optional metadata to associate with every token\n * @returns {lunr.Token[]}\n * @see {@link lunr.Pipeline}\n */\nlunr.tokenizer = function (obj, metadata) {\n if (obj == null || obj == undefined) {\n return []\n }\n\n if (Array.isArray(obj)) {\n return obj.map(function (t) {\n return new lunr.Token(\n lunr.utils.asString(t).toLowerCase(),\n lunr.utils.clone(metadata)\n )\n })\n }\n\n var str = obj.toString().toLowerCase(),\n len = str.length,\n tokens = []\n\n for (var sliceEnd = 0, sliceStart = 0; sliceEnd <= len; sliceEnd++) {\n var char = str.charAt(sliceEnd),\n sliceLength = sliceEnd - sliceStart\n\n if ((char.match(lunr.tokenizer.separator) || sliceEnd == len)) {\n\n if (sliceLength > 0) {\n var tokenMetadata = lunr.utils.clone(metadata) || {}\n tokenMetadata[\"position\"] = [sliceStart, sliceLength]\n tokenMetadata[\"index\"] = tokens.length\n\n tokens.push(\n new lunr.Token (\n str.slice(sliceStart, sliceEnd),\n tokenMetadata\n )\n )\n }\n\n sliceStart = sliceEnd + 1\n }\n\n }\n\n return tokens\n}\n\n/**\n * The separator used to split a string into tokens. Override this property to change the behaviour of\n * `lunr.tokenizer` behaviour when tokenizing strings. By default this splits on whitespace and hyphens.\n *\n * @static\n * @see lunr.tokenizer\n */\nlunr.tokenizer.separator = /[\\s\\-]+/\n/*!\n * lunr.Pipeline\n * Copyright (C) 2019 Oliver Nightingale\n */\n\n/**\n * lunr.Pipelines maintain an ordered list of functions to be applied to all\n * tokens in documents entering the search index and queries being ran against\n * the index.\n *\n * An instance of lunr.Index created with the lunr shortcut will contain a\n * pipeline with a stop word filter and an English language stemmer. Extra\n * functions can be added before or after either of these functions or these\n * default functions can be removed.\n *\n * When run the pipeline will call each function in turn, passing a token, the\n * index of that token in the original list of all tokens and finally a list of\n * all the original tokens.\n *\n * The output of functions in the pipeline will be passed to the next function\n * in the pipeline. To exclude a token from entering the index the function\n * should return undefined, the rest of the pipeline will not be called with\n * this token.\n *\n * For serialisation of pipelines to work, all functions used in an instance of\n * a pipeline should be registered with lunr.Pipeline. Registered functions can\n * then be loaded. If trying to load a serialised pipeline that uses functions\n * that are not registered an error will be thrown.\n *\n * If not planning on serialising the pipeline then registering pipeline functions\n * is not necessary.\n *\n * @constructor\n */\nlunr.Pipeline = function () {\n this._stack = []\n}\n\nlunr.Pipeline.registeredFunctions = Object.create(null)\n\n/**\n * A pipeline function maps lunr.Token to lunr.Token. A lunr.Token contains the token\n * string as well as all known metadata. A pipeline function can mutate the token string\n * or mutate (or add) metadata for a given token.\n *\n * A pipeline function can indicate that the passed token should be discarded by returning\n * null, undefined or an empty string. This token will not be passed to any downstream pipeline\n * functions and will not be added to the index.\n *\n * Multiple tokens can be returned by returning an array of tokens. Each token will be passed\n * to any downstream pipeline functions and all will returned tokens will be added to the index.\n *\n * Any number of pipeline functions may be chained together using a lunr.Pipeline.\n *\n * @interface lunr.PipelineFunction\n * @param {lunr.Token} token - A token from the document being processed.\n * @param {number} i - The index of this token in the complete list of tokens for this document/field.\n * @param {lunr.Token[]} tokens - All tokens for this document/field.\n * @returns {(?lunr.Token|lunr.Token[])}\n */\n\n/**\n * Register a function with the pipeline.\n *\n * Functions that are used in the pipeline should be registered if the pipeline\n * needs to be serialised, or a serialised pipeline needs to be loaded.\n *\n * Registering a function does not add it to a pipeline, functions must still be\n * added to instances of the pipeline for them to be used when running a pipeline.\n *\n * @param {lunr.PipelineFunction} fn - The function to check for.\n * @param {String} label - The label to register this function with\n */\nlunr.Pipeline.registerFunction = function (fn, label) {\n if (label in this.registeredFunctions) {\n lunr.utils.warn('Overwriting existing registered function: ' + label)\n }\n\n fn.label = label\n lunr.Pipeline.registeredFunctions[fn.label] = fn\n}\n\n/**\n * Warns if the function is not registered as a Pipeline function.\n *\n * @param {lunr.PipelineFunction} fn - The function to check for.\n * @private\n */\nlunr.Pipeline.warnIfFunctionNotRegistered = function (fn) {\n var isRegistered = fn.label && (fn.label in this.registeredFunctions)\n\n if (!isRegistered) {\n lunr.utils.warn('Function is not registered with pipeline. This may cause problems when serialising the index.\\n', fn)\n }\n}\n\n/**\n * Loads a previously serialised pipeline.\n *\n * All functions to be loaded must already be registered with lunr.Pipeline.\n * If any function from the serialised data has not been registered then an\n * error will be thrown.\n *\n * @param {Object} serialised - The serialised pipeline to load.\n * @returns {lunr.Pipeline}\n */\nlunr.Pipeline.load = function (serialised) {\n var pipeline = new lunr.Pipeline\n\n serialised.forEach(function (fnName) {\n var fn = lunr.Pipeline.registeredFunctions[fnName]\n\n if (fn) {\n pipeline.add(fn)\n } else {\n throw new Error('Cannot load unregistered function: ' + fnName)\n }\n })\n\n return pipeline\n}\n\n/**\n * Adds new functions to the end of the pipeline.\n *\n * Logs a warning if the function has not been registered.\n *\n * @param {lunr.PipelineFunction[]} functions - Any number of functions to add to the pipeline.\n */\nlunr.Pipeline.prototype.add = function () {\n var fns = Array.prototype.slice.call(arguments)\n\n fns.forEach(function (fn) {\n lunr.Pipeline.warnIfFunctionNotRegistered(fn)\n this._stack.push(fn)\n }, this)\n}\n\n/**\n * Adds a single function after a function that already exists in the\n * pipeline.\n *\n * Logs a warning if the function has not been registered.\n *\n * @param {lunr.PipelineFunction} existingFn - A function that already exists in the pipeline.\n * @param {lunr.PipelineFunction} newFn - The new function to add to the pipeline.\n */\nlunr.Pipeline.prototype.after = function (existingFn, newFn) {\n lunr.Pipeline.warnIfFunctionNotRegistered(newFn)\n\n var pos = this._stack.indexOf(existingFn)\n if (pos == -1) {\n throw new Error('Cannot find existingFn')\n }\n\n pos = pos + 1\n this._stack.splice(pos, 0, newFn)\n}\n\n/**\n * Adds a single function before a function that already exists in the\n * pipeline.\n *\n * Logs a warning if the function has not been registered.\n *\n * @param {lunr.PipelineFunction} existingFn - A function that already exists in the pipeline.\n * @param {lunr.PipelineFunction} newFn - The new function to add to the pipeline.\n */\nlunr.Pipeline.prototype.before = function (existingFn, newFn) {\n lunr.Pipeline.warnIfFunctionNotRegistered(newFn)\n\n var pos = this._stack.indexOf(existingFn)\n if (pos == -1) {\n throw new Error('Cannot find existingFn')\n }\n\n this._stack.splice(pos, 0, newFn)\n}\n\n/**\n * Removes a function from the pipeline.\n *\n * @param {lunr.PipelineFunction} fn The function to remove from the pipeline.\n */\nlunr.Pipeline.prototype.remove = function (fn) {\n var pos = this._stack.indexOf(fn)\n if (pos == -1) {\n return\n }\n\n this._stack.splice(pos, 1)\n}\n\n/**\n * Runs the current list of functions that make up the pipeline against the\n * passed tokens.\n *\n * @param {Array} tokens The tokens to run through the pipeline.\n * @returns {Array}\n */\nlunr.Pipeline.prototype.run = function (tokens) {\n var stackLength = this._stack.length\n\n for (var i = 0; i < stackLength; i++) {\n var fn = this._stack[i]\n var memo = []\n\n for (var j = 0; j < tokens.length; j++) {\n var result = fn(tokens[j], j, tokens)\n\n if (result === null || result === void 0 || result === '') continue\n\n if (Array.isArray(result)) {\n for (var k = 0; k < result.length; k++) {\n memo.push(result[k])\n }\n } else {\n memo.push(result)\n }\n }\n\n tokens = memo\n }\n\n return tokens\n}\n\n/**\n * Convenience method for passing a string through a pipeline and getting\n * strings out. This method takes care of wrapping the passed string in a\n * token and mapping the resulting tokens back to strings.\n *\n * @param {string} str - The string to pass through the pipeline.\n * @param {?object} metadata - Optional metadata to associate with the token\n * passed to the pipeline.\n * @returns {string[]}\n */\nlunr.Pipeline.prototype.runString = function (str, metadata) {\n var token = new lunr.Token (str, metadata)\n\n return this.run([token]).map(function (t) {\n return t.toString()\n })\n}\n\n/**\n * Resets the pipeline by removing any existing processors.\n *\n */\nlunr.Pipeline.prototype.reset = function () {\n this._stack = []\n}\n\n/**\n * Returns a representation of the pipeline ready for serialisation.\n *\n * Logs a warning if the function has not been registered.\n *\n * @returns {Array}\n */\nlunr.Pipeline.prototype.toJSON = function () {\n return this._stack.map(function (fn) {\n lunr.Pipeline.warnIfFunctionNotRegistered(fn)\n\n return fn.label\n })\n}\n/*!\n * lunr.Vector\n * Copyright (C) 2019 Oliver Nightingale\n */\n\n/**\n * A vector is used to construct the vector space of documents and queries. These\n * vectors support operations to determine the similarity between two documents or\n * a document and a query.\n *\n * Normally no parameters are required for initializing a vector, but in the case of\n * loading a previously dumped vector the raw elements can be provided to the constructor.\n *\n * For performance reasons vectors are implemented with a flat array, where an elements\n * index is immediately followed by its value. E.g. [index, value, index, value]. This\n * allows the underlying array to be as sparse as possible and still offer decent\n * performance when being used for vector calculations.\n *\n * @constructor\n * @param {Number[]} [elements] - The flat list of element index and element value pairs.\n */\nlunr.Vector = function (elements) {\n this._magnitude = 0\n this.elements = elements || []\n}\n\n\n/**\n * Calculates the position within the vector to insert a given index.\n *\n * This is used internally by insert and upsert. If there are duplicate indexes then\n * the position is returned as if the value for that index were to be updated, but it\n * is the callers responsibility to check whether there is a duplicate at that index\n *\n * @param {Number} insertIdx - The index at which the element should be inserted.\n * @returns {Number}\n */\nlunr.Vector.prototype.positionForIndex = function (index) {\n // For an empty vector the tuple can be inserted at the beginning\n if (this.elements.length == 0) {\n return 0\n }\n\n var start = 0,\n end = this.elements.length / 2,\n sliceLength = end - start,\n pivotPoint = Math.floor(sliceLength / 2),\n pivotIndex = this.elements[pivotPoint * 2]\n\n while (sliceLength > 1) {\n if (pivotIndex < index) {\n start = pivotPoint\n }\n\n if (pivotIndex > index) {\n end = pivotPoint\n }\n\n if (pivotIndex == index) {\n break\n }\n\n sliceLength = end - start\n pivotPoint = start + Math.floor(sliceLength / 2)\n pivotIndex = this.elements[pivotPoint * 2]\n }\n\n if (pivotIndex == index) {\n return pivotPoint * 2\n }\n\n if (pivotIndex > index) {\n return pivotPoint * 2\n }\n\n if (pivotIndex < index) {\n return (pivotPoint + 1) * 2\n }\n}\n\n/**\n * Inserts an element at an index within the vector.\n *\n * Does not allow duplicates, will throw an error if there is already an entry\n * for this index.\n *\n * @param {Number} insertIdx - The index at which the element should be inserted.\n * @param {Number} val - The value to be inserted into the vector.\n */\nlunr.Vector.prototype.insert = function (insertIdx, val) {\n this.upsert(insertIdx, val, function () {\n throw \"duplicate index\"\n })\n}\n\n/**\n * Inserts or updates an existing index within the vector.\n *\n * @param {Number} insertIdx - The index at which the element should be inserted.\n * @param {Number} val - The value to be inserted into the vector.\n * @param {function} fn - A function that is called for updates, the existing value and the\n * requested value are passed as arguments\n */\nlunr.Vector.prototype.upsert = function (insertIdx, val, fn) {\n this._magnitude = 0\n var position = this.positionForIndex(insertIdx)\n\n if (this.elements[position] == insertIdx) {\n this.elements[position + 1] = fn(this.elements[position + 1], val)\n } else {\n this.elements.splice(position, 0, insertIdx, val)\n }\n}\n\n/**\n * Calculates the magnitude of this vector.\n *\n * @returns {Number}\n */\nlunr.Vector.prototype.magnitude = function () {\n if (this._magnitude) return this._magnitude\n\n var sumOfSquares = 0,\n elementsLength = this.elements.length\n\n for (var i = 1; i < elementsLength; i += 2) {\n var val = this.elements[i]\n sumOfSquares += val * val\n }\n\n return this._magnitude = Math.sqrt(sumOfSquares)\n}\n\n/**\n * Calculates the dot product of this vector and another vector.\n *\n * @param {lunr.Vector} otherVector - The vector to compute the dot product with.\n * @returns {Number}\n */\nlunr.Vector.prototype.dot = function (otherVector) {\n var dotProduct = 0,\n a = this.elements, b = otherVector.elements,\n aLen = a.length, bLen = b.length,\n aVal = 0, bVal = 0,\n i = 0, j = 0\n\n while (i < aLen && j < bLen) {\n aVal = a[i], bVal = b[j]\n if (aVal < bVal) {\n i += 2\n } else if (aVal > bVal) {\n j += 2\n } else if (aVal == bVal) {\n dotProduct += a[i + 1] * b[j + 1]\n i += 2\n j += 2\n }\n }\n\n return dotProduct\n}\n\n/**\n * Calculates the similarity between this vector and another vector.\n *\n * @param {lunr.Vector} otherVector - The other vector to calculate the\n * similarity with.\n * @returns {Number}\n */\nlunr.Vector.prototype.similarity = function (otherVector) {\n return this.dot(otherVector) / this.magnitude() || 0\n}\n\n/**\n * Converts the vector to an array of the elements within the vector.\n *\n * @returns {Number[]}\n */\nlunr.Vector.prototype.toArray = function () {\n var output = new Array (this.elements.length / 2)\n\n for (var i = 1, j = 0; i < this.elements.length; i += 2, j++) {\n output[j] = this.elements[i]\n }\n\n return output\n}\n\n/**\n * A JSON serializable representation of the vector.\n *\n * @returns {Number[]}\n */\nlunr.Vector.prototype.toJSON = function () {\n return this.elements\n}\n/* eslint-disable */\n/*!\n * lunr.stemmer\n * Copyright (C) 2019 Oliver Nightingale\n * Includes code from - http://tartarus.org/~martin/PorterStemmer/js.txt\n */\n\n/**\n * lunr.stemmer is an english language stemmer, this is a JavaScript\n * implementation of the PorterStemmer taken from http://tartarus.org/~martin\n *\n * @static\n * @implements {lunr.PipelineFunction}\n * @param {lunr.Token} token - The string to stem\n * @returns {lunr.Token}\n * @see {@link lunr.Pipeline}\n * @function\n */\nlunr.stemmer = (function(){\n var step2list = {\n \"ational\" : \"ate\",\n \"tional\" : \"tion\",\n \"enci\" : \"ence\",\n \"anci\" : \"ance\",\n \"izer\" : \"ize\",\n \"bli\" : \"ble\",\n \"alli\" : \"al\",\n \"entli\" : \"ent\",\n \"eli\" : \"e\",\n \"ousli\" : \"ous\",\n \"ization\" : \"ize\",\n \"ation\" : \"ate\",\n \"ator\" : \"ate\",\n \"alism\" : \"al\",\n \"iveness\" : \"ive\",\n \"fulness\" : \"ful\",\n \"ousness\" : \"ous\",\n \"aliti\" : \"al\",\n \"iviti\" : \"ive\",\n \"biliti\" : \"ble\",\n \"logi\" : \"log\"\n },\n\n step3list = {\n \"icate\" : \"ic\",\n \"ative\" : \"\",\n \"alize\" : \"al\",\n \"iciti\" : \"ic\",\n \"ical\" : \"ic\",\n \"ful\" : \"\",\n \"ness\" : \"\"\n },\n\n c = \"[^aeiou]\", // consonant\n v = \"[aeiouy]\", // vowel\n C = c + \"[^aeiouy]*\", // consonant sequence\n V = v + \"[aeiou]*\", // vowel sequence\n\n mgr0 = \"^(\" + C + \")?\" + V + C, // [C]VC... is m>0\n meq1 = \"^(\" + C + \")?\" + V + C + \"(\" + V + \")?$\", // [C]VC[V] is m=1\n mgr1 = \"^(\" + C + \")?\" + V + C + V + C, // [C]VCVC... is m>1\n s_v = \"^(\" + C + \")?\" + v; // vowel in stem\n\n var re_mgr0 = new RegExp(mgr0);\n var re_mgr1 = new RegExp(mgr1);\n var re_meq1 = new RegExp(meq1);\n var re_s_v = new RegExp(s_v);\n\n var re_1a = /^(.+?)(ss|i)es$/;\n var re2_1a = /^(.+?)([^s])s$/;\n var re_1b = /^(.+?)eed$/;\n var re2_1b = /^(.+?)(ed|ing)$/;\n var re_1b_2 = /.$/;\n var re2_1b_2 = /(at|bl|iz)$/;\n var re3_1b_2 = new RegExp(\"([^aeiouylsz])\\\\1$\");\n var re4_1b_2 = new RegExp(\"^\" + C + v + \"[^aeiouwxy]$\");\n\n var re_1c = /^(.+?[^aeiou])y$/;\n var re_2 = /^(.+?)(ational|tional|enci|anci|izer|bli|alli|entli|eli|ousli|ization|ation|ator|alism|iveness|fulness|ousness|aliti|iviti|biliti|logi)$/;\n\n var re_3 = /^(.+?)(icate|ative|alize|iciti|ical|ful|ness)$/;\n\n var re_4 = /^(.+?)(al|ance|ence|er|ic|able|ible|ant|ement|ment|ent|ou|ism|ate|iti|ous|ive|ize)$/;\n var re2_4 = /^(.+?)(s|t)(ion)$/;\n\n var re_5 = /^(.+?)e$/;\n var re_5_1 = /ll$/;\n var re3_5 = new RegExp(\"^\" + C + v + \"[^aeiouwxy]$\");\n\n var porterStemmer = function porterStemmer(w) {\n var stem,\n suffix,\n firstch,\n re,\n re2,\n re3,\n re4;\n\n if (w.length < 3) { return w; }\n\n firstch = w.substr(0,1);\n if (firstch == \"y\") {\n w = firstch.toUpperCase() + w.substr(1);\n }\n\n // Step 1a\n re = re_1a\n re2 = re2_1a;\n\n if (re.test(w)) { w = w.replace(re,\"$1$2\"); }\n else if (re2.test(w)) { w = w.replace(re2,\"$1$2\"); }\n\n // Step 1b\n re = re_1b;\n re2 = re2_1b;\n if (re.test(w)) {\n var fp = re.exec(w);\n re = re_mgr0;\n if (re.test(fp[1])) {\n re = re_1b_2;\n w = w.replace(re,\"\");\n }\n } else if (re2.test(w)) {\n var fp = re2.exec(w);\n stem = fp[1];\n re2 = re_s_v;\n if (re2.test(stem)) {\n w = stem;\n re2 = re2_1b_2;\n re3 = re3_1b_2;\n re4 = re4_1b_2;\n if (re2.test(w)) { w = w + \"e\"; }\n else if (re3.test(w)) { re = re_1b_2; w = w.replace(re,\"\"); }\n else if (re4.test(w)) { w = w + \"e\"; }\n }\n }\n\n // Step 1c - replace suffix y or Y by i if preceded by a non-vowel which is not the first letter of the word (so cry -> cri, by -> by, say -> say)\n re = re_1c;\n if (re.test(w)) {\n var fp = re.exec(w);\n stem = fp[1];\n w = stem + \"i\";\n }\n\n // Step 2\n re = re_2;\n if (re.test(w)) {\n var fp = re.exec(w);\n stem = fp[1];\n suffix = fp[2];\n re = re_mgr0;\n if (re.test(stem)) {\n w = stem + step2list[suffix];\n }\n }\n\n // Step 3\n re = re_3;\n if (re.test(w)) {\n var fp = re.exec(w);\n stem = fp[1];\n suffix = fp[2];\n re = re_mgr0;\n if (re.test(stem)) {\n w = stem + step3list[suffix];\n }\n }\n\n // Step 4\n re = re_4;\n re2 = re2_4;\n if (re.test(w)) {\n var fp = re.exec(w);\n stem = fp[1];\n re = re_mgr1;\n if (re.test(stem)) {\n w = stem;\n }\n } else if (re2.test(w)) {\n var fp = re2.exec(w);\n stem = fp[1] + fp[2];\n re2 = re_mgr1;\n if (re2.test(stem)) {\n w = stem;\n }\n }\n\n // Step 5\n re = re_5;\n if (re.test(w)) {\n var fp = re.exec(w);\n stem = fp[1];\n re = re_mgr1;\n re2 = re_meq1;\n re3 = re3_5;\n if (re.test(stem) || (re2.test(stem) && !(re3.test(stem)))) {\n w = stem;\n }\n }\n\n re = re_5_1;\n re2 = re_mgr1;\n if (re.test(w) && re2.test(w)) {\n re = re_1b_2;\n w = w.replace(re,\"\");\n }\n\n // and turn initial Y back to y\n\n if (firstch == \"y\") {\n w = firstch.toLowerCase() + w.substr(1);\n }\n\n return w;\n };\n\n return function (token) {\n return token.update(porterStemmer);\n }\n})();\n\nlunr.Pipeline.registerFunction(lunr.stemmer, 'stemmer')\n/*!\n * lunr.stopWordFilter\n * Copyright (C) 2019 Oliver Nightingale\n */\n\n/**\n * lunr.generateStopWordFilter builds a stopWordFilter function from the provided\n * list of stop words.\n *\n * The built in lunr.stopWordFilter is built using this generator and can be used\n * to generate custom stopWordFilters for applications or non English languages.\n *\n * @function\n * @param {Array} token The token to pass through the filter\n * @returns {lunr.PipelineFunction}\n * @see lunr.Pipeline\n * @see lunr.stopWordFilter\n */\nlunr.generateStopWordFilter = function (stopWords) {\n var words = stopWords.reduce(function (memo, stopWord) {\n memo[stopWord] = stopWord\n return memo\n }, {})\n\n return function (token) {\n if (token && words[token.toString()] !== token.toString()) return token\n }\n}\n\n/**\n * lunr.stopWordFilter is an English language stop word list filter, any words\n * contained in the list will not be passed through the filter.\n *\n * This is intended to be used in the Pipeline. If the token does not pass the\n * filter then undefined will be returned.\n *\n * @function\n * @implements {lunr.PipelineFunction}\n * @params {lunr.Token} token - A token to check for being a stop word.\n * @returns {lunr.Token}\n * @see {@link lunr.Pipeline}\n */\nlunr.stopWordFilter = lunr.generateStopWordFilter([\n 'a',\n 'able',\n 'about',\n 'across',\n 'after',\n 'all',\n 'almost',\n 'also',\n 'am',\n 'among',\n 'an',\n 'and',\n 'any',\n 'are',\n 'as',\n 'at',\n 'be',\n 'because',\n 'been',\n 'but',\n 'by',\n 'can',\n 'cannot',\n 'could',\n 'dear',\n 'did',\n 'do',\n 'does',\n 'either',\n 'else',\n 'ever',\n 'every',\n 'for',\n 'from',\n 'get',\n 'got',\n 'had',\n 'has',\n 'have',\n 'he',\n 'her',\n 'hers',\n 'him',\n 'his',\n 'how',\n 'however',\n 'i',\n 'if',\n 'in',\n 'into',\n 'is',\n 'it',\n 'its',\n 'just',\n 'least',\n 'let',\n 'like',\n 'likely',\n 'may',\n 'me',\n 'might',\n 'most',\n 'must',\n 'my',\n 'neither',\n 'no',\n 'nor',\n 'not',\n 'of',\n 'off',\n 'often',\n 'on',\n 'only',\n 'or',\n 'other',\n 'our',\n 'own',\n 'rather',\n 'said',\n 'say',\n 'says',\n 'she',\n 'should',\n 'since',\n 'so',\n 'some',\n 'than',\n 'that',\n 'the',\n 'their',\n 'them',\n 'then',\n 'there',\n 'these',\n 'they',\n 'this',\n 'tis',\n 'to',\n 'too',\n 'twas',\n 'us',\n 'wants',\n 'was',\n 'we',\n 'were',\n 'what',\n 'when',\n 'where',\n 'which',\n 'while',\n 'who',\n 'whom',\n 'why',\n 'will',\n 'with',\n 'would',\n 'yet',\n 'you',\n 'your'\n])\n\nlunr.Pipeline.registerFunction(lunr.stopWordFilter, 'stopWordFilter')\n/*!\n * lunr.trimmer\n * Copyright (C) 2019 Oliver Nightingale\n */\n\n/**\n * lunr.trimmer is a pipeline function for trimming non word\n * characters from the beginning and end of tokens before they\n * enter the index.\n *\n * This implementation may not work correctly for non latin\n * characters and should either be removed or adapted for use\n * with languages with non-latin characters.\n *\n * @static\n * @implements {lunr.PipelineFunction}\n * @param {lunr.Token} token The token to pass through the filter\n * @returns {lunr.Token}\n * @see lunr.Pipeline\n */\nlunr.trimmer = function (token) {\n return token.update(function (s) {\n return s.replace(/^\\W+/, '').replace(/\\W+$/, '')\n })\n}\n\nlunr.Pipeline.registerFunction(lunr.trimmer, 'trimmer')\n/*!\n * lunr.TokenSet\n * Copyright (C) 2019 Oliver Nightingale\n */\n\n/**\n * A token set is used to store the unique list of all tokens\n * within an index. Token sets are also used to represent an\n * incoming query to the index, this query token set and index\n * token set are then intersected to find which tokens to look\n * up in the inverted index.\n *\n * A token set can hold multiple tokens, as in the case of the\n * index token set, or it can hold a single token as in the\n * case of a simple query token set.\n *\n * Additionally token sets are used to perform wildcard matching.\n * Leading, contained and trailing wildcards are supported, and\n * from this edit distance matching can also be provided.\n *\n * Token sets are implemented as a minimal finite state automata,\n * where both common prefixes and suffixes are shared between tokens.\n * This helps to reduce the space used for storing the token set.\n *\n * @constructor\n */\nlunr.TokenSet = function () {\n this.final = false\n this.edges = {}\n this.id = lunr.TokenSet._nextId\n lunr.TokenSet._nextId += 1\n}\n\n/**\n * Keeps track of the next, auto increment, identifier to assign\n * to a new tokenSet.\n *\n * TokenSets require a unique identifier to be correctly minimised.\n *\n * @private\n */\nlunr.TokenSet._nextId = 1\n\n/**\n * Creates a TokenSet instance from the given sorted array of words.\n *\n * @param {String[]} arr - A sorted array of strings to create the set from.\n * @returns {lunr.TokenSet}\n * @throws Will throw an error if the input array is not sorted.\n */\nlunr.TokenSet.fromArray = function (arr) {\n var builder = new lunr.TokenSet.Builder\n\n for (var i = 0, len = arr.length; i < len; i++) {\n builder.insert(arr[i])\n }\n\n builder.finish()\n return builder.root\n}\n\n/**\n * Creates a token set from a query clause.\n *\n * @private\n * @param {Object} clause - A single clause from lunr.Query.\n * @param {string} clause.term - The query clause term.\n * @param {number} [clause.editDistance] - The optional edit distance for the term.\n * @returns {lunr.TokenSet}\n */\nlunr.TokenSet.fromClause = function (clause) {\n if ('editDistance' in clause) {\n return lunr.TokenSet.fromFuzzyString(clause.term, clause.editDistance)\n } else {\n return lunr.TokenSet.fromString(clause.term)\n }\n}\n\n/**\n * Creates a token set representing a single string with a specified\n * edit distance.\n *\n * Insertions, deletions, substitutions and transpositions are each\n * treated as an edit distance of 1.\n *\n * Increasing the allowed edit distance will have a dramatic impact\n * on the performance of both creating and intersecting these TokenSets.\n * It is advised to keep the edit distance less than 3.\n *\n * @param {string} str - The string to create the token set from.\n * @param {number} editDistance - The allowed edit distance to match.\n * @returns {lunr.Vector}\n */\nlunr.TokenSet.fromFuzzyString = function (str, editDistance) {\n var root = new lunr.TokenSet\n\n var stack = [{\n node: root,\n editsRemaining: editDistance,\n str: str\n }]\n\n while (stack.length) {\n var frame = stack.pop()\n\n // no edit\n if (frame.str.length > 0) {\n var char = frame.str.charAt(0),\n noEditNode\n\n if (char in frame.node.edges) {\n noEditNode = frame.node.edges[char]\n } else {\n noEditNode = new lunr.TokenSet\n frame.node.edges[char] = noEditNode\n }\n\n if (frame.str.length == 1) {\n noEditNode.final = true\n }\n\n stack.push({\n node: noEditNode,\n editsRemaining: frame.editsRemaining,\n str: frame.str.slice(1)\n })\n }\n\n if (frame.editsRemaining == 0) {\n continue\n }\n\n // insertion\n if (\"*\" in frame.node.edges) {\n var insertionNode = frame.node.edges[\"*\"]\n } else {\n var insertionNode = new lunr.TokenSet\n frame.node.edges[\"*\"] = insertionNode\n }\n\n if (frame.str.length == 0) {\n insertionNode.final = true\n }\n\n stack.push({\n node: insertionNode,\n editsRemaining: frame.editsRemaining - 1,\n str: frame.str\n })\n\n // deletion\n // can only do a deletion if we have enough edits remaining\n // and if there are characters left to delete in the string\n if (frame.str.length > 1) {\n stack.push({\n node: frame.node,\n editsRemaining: frame.editsRemaining - 1,\n str: frame.str.slice(1)\n })\n }\n\n // deletion\n // just removing the last character from the str\n if (frame.str.length == 1) {\n frame.node.final = true\n }\n\n // substitution\n // can only do a substitution if we have enough edits remaining\n // and if there are characters left to substitute\n if (frame.str.length >= 1) {\n if (\"*\" in frame.node.edges) {\n var substitutionNode = frame.node.edges[\"*\"]\n } else {\n var substitutionNode = new lunr.TokenSet\n frame.node.edges[\"*\"] = substitutionNode\n }\n\n if (frame.str.length == 1) {\n substitutionNode.final = true\n }\n\n stack.push({\n node: substitutionNode,\n editsRemaining: frame.editsRemaining - 1,\n str: frame.str.slice(1)\n })\n }\n\n // transposition\n // can only do a transposition if there are edits remaining\n // and there are enough characters to transpose\n if (frame.str.length > 1) {\n var charA = frame.str.charAt(0),\n charB = frame.str.charAt(1),\n transposeNode\n\n if (charB in frame.node.edges) {\n transposeNode = frame.node.edges[charB]\n } else {\n transposeNode = new lunr.TokenSet\n frame.node.edges[charB] = transposeNode\n }\n\n if (frame.str.length == 1) {\n transposeNode.final = true\n }\n\n stack.push({\n node: transposeNode,\n editsRemaining: frame.editsRemaining - 1,\n str: charA + frame.str.slice(2)\n })\n }\n }\n\n return root\n}\n\n/**\n * Creates a TokenSet from a string.\n *\n * The string may contain one or more wildcard characters (*)\n * that will allow wildcard matching when intersecting with\n * another TokenSet.\n *\n * @param {string} str - The string to create a TokenSet from.\n * @returns {lunr.TokenSet}\n */\nlunr.TokenSet.fromString = function (str) {\n var node = new lunr.TokenSet,\n root = node\n\n /*\n * Iterates through all characters within the passed string\n * appending a node for each character.\n *\n * When a wildcard character is found then a self\n * referencing edge is introduced to continually match\n * any number of any characters.\n */\n for (var i = 0, len = str.length; i < len; i++) {\n var char = str[i],\n final = (i == len - 1)\n\n if (char == \"*\") {\n node.edges[char] = node\n node.final = final\n\n } else {\n var next = new lunr.TokenSet\n next.final = final\n\n node.edges[char] = next\n node = next\n }\n }\n\n return root\n}\n\n/**\n * Converts this TokenSet into an array of strings\n * contained within the TokenSet.\n *\n * This is not intended to be used on a TokenSet that\n * contains wildcards, in these cases the results are\n * undefined and are likely to cause an infinite loop.\n *\n * @returns {string[]}\n */\nlunr.TokenSet.prototype.toArray = function () {\n var words = []\n\n var stack = [{\n prefix: \"\",\n node: this\n }]\n\n while (stack.length) {\n var frame = stack.pop(),\n edges = Object.keys(frame.node.edges),\n len = edges.length\n\n if (frame.node.final) {\n /* In Safari, at this point the prefix is sometimes corrupted, see:\n * https://github.com/olivernn/lunr.js/issues/279 Calling any\n * String.prototype method forces Safari to \"cast\" this string to what\n * it's supposed to be, fixing the bug. */\n frame.prefix.charAt(0)\n words.push(frame.prefix)\n }\n\n for (var i = 0; i < len; i++) {\n var edge = edges[i]\n\n stack.push({\n prefix: frame.prefix.concat(edge),\n node: frame.node.edges[edge]\n })\n }\n }\n\n return words\n}\n\n/**\n * Generates a string representation of a TokenSet.\n *\n * This is intended to allow TokenSets to be used as keys\n * in objects, largely to aid the construction and minimisation\n * of a TokenSet. As such it is not designed to be a human\n * friendly representation of the TokenSet.\n *\n * @returns {string}\n */\nlunr.TokenSet.prototype.toString = function () {\n // NOTE: Using Object.keys here as this.edges is very likely\n // to enter 'hash-mode' with many keys being added\n //\n // avoiding a for-in loop here as it leads to the function\n // being de-optimised (at least in V8). From some simple\n // benchmarks the performance is comparable, but allowing\n // V8 to optimize may mean easy performance wins in the future.\n\n if (this._str) {\n return this._str\n }\n\n var str = this.final ? '1' : '0',\n labels = Object.keys(this.edges).sort(),\n len = labels.length\n\n for (var i = 0; i < len; i++) {\n var label = labels[i],\n node = this.edges[label]\n\n str = str + label + node.id\n }\n\n return str\n}\n\n/**\n * Returns a new TokenSet that is the intersection of\n * this TokenSet and the passed TokenSet.\n *\n * This intersection will take into account any wildcards\n * contained within the TokenSet.\n *\n * @param {lunr.TokenSet} b - An other TokenSet to intersect with.\n * @returns {lunr.TokenSet}\n */\nlunr.TokenSet.prototype.intersect = function (b) {\n var output = new lunr.TokenSet,\n frame = undefined\n\n var stack = [{\n qNode: b,\n output: output,\n node: this\n }]\n\n while (stack.length) {\n frame = stack.pop()\n\n // NOTE: As with the #toString method, we are using\n // Object.keys and a for loop instead of a for-in loop\n // as both of these objects enter 'hash' mode, causing\n // the function to be de-optimised in V8\n var qEdges = Object.keys(frame.qNode.edges),\n qLen = qEdges.length,\n nEdges = Object.keys(frame.node.edges),\n nLen = nEdges.length\n\n for (var q = 0; q < qLen; q++) {\n var qEdge = qEdges[q]\n\n for (var n = 0; n < nLen; n++) {\n var nEdge = nEdges[n]\n\n if (nEdge == qEdge || qEdge == '*') {\n var node = frame.node.edges[nEdge],\n qNode = frame.qNode.edges[qEdge],\n final = node.final && qNode.final,\n next = undefined\n\n if (nEdge in frame.output.edges) {\n // an edge already exists for this character\n // no need to create a new node, just set the finality\n // bit unless this node is already final\n next = frame.output.edges[nEdge]\n next.final = next.final || final\n\n } else {\n // no edge exists yet, must create one\n // set the finality bit and insert it\n // into the output\n next = new lunr.TokenSet\n next.final = final\n frame.output.edges[nEdge] = next\n }\n\n stack.push({\n qNode: qNode,\n output: next,\n node: node\n })\n }\n }\n }\n }\n\n return output\n}\nlunr.TokenSet.Builder = function () {\n this.previousWord = \"\"\n this.root = new lunr.TokenSet\n this.uncheckedNodes = []\n this.minimizedNodes = {}\n}\n\nlunr.TokenSet.Builder.prototype.insert = function (word) {\n var node,\n commonPrefix = 0\n\n if (word < this.previousWord) {\n throw new Error (\"Out of order word insertion\")\n }\n\n for (var i = 0; i < word.length && i < this.previousWord.length; i++) {\n if (word[i] != this.previousWord[i]) break\n commonPrefix++\n }\n\n this.minimize(commonPrefix)\n\n if (this.uncheckedNodes.length == 0) {\n node = this.root\n } else {\n node = this.uncheckedNodes[this.uncheckedNodes.length - 1].child\n }\n\n for (var i = commonPrefix; i < word.length; i++) {\n var nextNode = new lunr.TokenSet,\n char = word[i]\n\n node.edges[char] = nextNode\n\n this.uncheckedNodes.push({\n parent: node,\n char: char,\n child: nextNode\n })\n\n node = nextNode\n }\n\n node.final = true\n this.previousWord = word\n}\n\nlunr.TokenSet.Builder.prototype.finish = function () {\n this.minimize(0)\n}\n\nlunr.TokenSet.Builder.prototype.minimize = function (downTo) {\n for (var i = this.uncheckedNodes.length - 1; i >= downTo; i--) {\n var node = this.uncheckedNodes[i],\n childKey = node.child.toString()\n\n if (childKey in this.minimizedNodes) {\n node.parent.edges[node.char] = this.minimizedNodes[childKey]\n } else {\n // Cache the key for this node since\n // we know it can't change anymore\n node.child._str = childKey\n\n this.minimizedNodes[childKey] = node.child\n }\n\n this.uncheckedNodes.pop()\n }\n}\n/*!\n * lunr.Index\n * Copyright (C) 2019 Oliver Nightingale\n */\n\n/**\n * An index contains the built index of all documents and provides a query interface\n * to the index.\n *\n * Usually instances of lunr.Index will not be created using this constructor, instead\n * lunr.Builder should be used to construct new indexes, or lunr.Index.load should be\n * used to load previously built and serialized indexes.\n *\n * @constructor\n * @param {Object} attrs - The attributes of the built search index.\n * @param {Object} attrs.invertedIndex - An index of term/field to document reference.\n * @param {Object} attrs.fieldVectors - Field vectors\n * @param {lunr.TokenSet} attrs.tokenSet - An set of all corpus tokens.\n * @param {string[]} attrs.fields - The names of indexed document fields.\n * @param {lunr.Pipeline} attrs.pipeline - The pipeline to use for search terms.\n */\nlunr.Index = function (attrs) {\n this.invertedIndex = attrs.invertedIndex\n this.fieldVectors = attrs.fieldVectors\n this.tokenSet = attrs.tokenSet\n this.fields = attrs.fields\n this.pipeline = attrs.pipeline\n}\n\n/**\n * A result contains details of a document matching a search query.\n * @typedef {Object} lunr.Index~Result\n * @property {string} ref - The reference of the document this result represents.\n * @property {number} score - A number between 0 and 1 representing how similar this document is to the query.\n * @property {lunr.MatchData} matchData - Contains metadata about this match including which term(s) caused the match.\n */\n\n/**\n * Although lunr provides the ability to create queries using lunr.Query, it also provides a simple\n * query language which itself is parsed into an instance of lunr.Query.\n *\n * For programmatically building queries it is advised to directly use lunr.Query, the query language\n * is best used for human entered text rather than program generated text.\n *\n * At its simplest queries can just be a single term, e.g. `hello`, multiple terms are also supported\n * and will be combined with OR, e.g `hello world` will match documents that contain either 'hello'\n * or 'world', though those that contain both will rank higher in the results.\n *\n * Wildcards can be included in terms to match one or more unspecified characters, these wildcards can\n * be inserted anywhere within the term, and more than one wildcard can exist in a single term. Adding\n * wildcards will increase the number of documents that will be found but can also have a negative\n * impact on query performance, especially with wildcards at the beginning of a term.\n *\n * Terms can be restricted to specific fields, e.g. `title:hello`, only documents with the term\n * hello in the title field will match this query. Using a field not present in the index will lead\n * to an error being thrown.\n *\n * Modifiers can also be added to terms, lunr supports edit distance and boost modifiers on terms. A term\n * boost will make documents matching that term score higher, e.g. `foo^5`. Edit distance is also supported\n * to provide fuzzy matching, e.g. 'hello~2' will match documents with hello with an edit distance of 2.\n * Avoid large values for edit distance to improve query performance.\n *\n * Each term also supports a presence modifier. By default a term's presence in document is optional, however\n * this can be changed to either required or prohibited. For a term's presence to be required in a document the\n * term should be prefixed with a '+', e.g. `+foo bar` is a search for documents that must contain 'foo' and\n * optionally contain 'bar'. Conversely a leading '-' sets the terms presence to prohibited, i.e. it must not\n * appear in a document, e.g. `-foo bar` is a search for documents that do not contain 'foo' but may contain 'bar'.\n *\n * To escape special characters the backslash character '\\' can be used, this allows searches to include\n * characters that would normally be considered modifiers, e.g. `foo\\~2` will search for a term \"foo~2\" instead\n * of attempting to apply a boost of 2 to the search term \"foo\".\n *\n * @typedef {string} lunr.Index~QueryString\n * @example Simple single term query\n * hello\n * @example Multiple term query\n * hello world\n * @example term scoped to a field\n * title:hello\n * @example term with a boost of 10\n * hello^10\n * @example term with an edit distance of 2\n * hello~2\n * @example terms with presence modifiers\n * -foo +bar baz\n */\n\n/**\n * Performs a search against the index using lunr query syntax.\n *\n * Results will be returned sorted by their score, the most relevant results\n * will be returned first. For details on how the score is calculated, please see\n * the {@link https://lunrjs.com/guides/searching.html#scoring|guide}.\n *\n * For more programmatic querying use lunr.Index#query.\n *\n * @param {lunr.Index~QueryString} queryString - A string containing a lunr query.\n * @throws {lunr.QueryParseError} If the passed query string cannot be parsed.\n * @returns {lunr.Index~Result[]}\n */\nlunr.Index.prototype.search = function (queryString) {\n return this.query(function (query) {\n var parser = new lunr.QueryParser(queryString, query)\n parser.parse()\n })\n}\n\n/**\n * A query builder callback provides a query object to be used to express\n * the query to perform on the index.\n *\n * @callback lunr.Index~queryBuilder\n * @param {lunr.Query} query - The query object to build up.\n * @this lunr.Query\n */\n\n/**\n * Performs a query against the index using the yielded lunr.Query object.\n *\n * If performing programmatic queries against the index, this method is preferred\n * over lunr.Index#search so as to avoid the additional query parsing overhead.\n *\n * A query object is yielded to the supplied function which should be used to\n * express the query to be run against the index.\n *\n * Note that although this function takes a callback parameter it is _not_ an\n * asynchronous operation, the callback is just yielded a query object to be\n * customized.\n *\n * @param {lunr.Index~queryBuilder} fn - A function that is used to build the query.\n * @returns {lunr.Index~Result[]}\n */\nlunr.Index.prototype.query = function (fn) {\n // for each query clause\n // * process terms\n // * expand terms from token set\n // * find matching documents and metadata\n // * get document vectors\n // * score documents\n\n var query = new lunr.Query(this.fields),\n matchingFields = Object.create(null),\n queryVectors = Object.create(null),\n termFieldCache = Object.create(null),\n requiredMatches = Object.create(null),\n prohibitedMatches = Object.create(null)\n\n /*\n * To support field level boosts a query vector is created per\n * field. An empty vector is eagerly created to support negated\n * queries.\n */\n for (var i = 0; i < this.fields.length; i++) {\n queryVectors[this.fields[i]] = new lunr.Vector\n }\n\n fn.call(query, query)\n\n for (var i = 0; i < query.clauses.length; i++) {\n /*\n * Unless the pipeline has been disabled for this term, which is\n * the case for terms with wildcards, we need to pass the clause\n * term through the search pipeline. A pipeline returns an array\n * of processed terms. Pipeline functions may expand the passed\n * term, which means we may end up performing multiple index lookups\n * for a single query term.\n */\n var clause = query.clauses[i],\n terms = null,\n clauseMatches = lunr.Set.complete\n\n if (clause.usePipeline) {\n terms = this.pipeline.runString(clause.term, {\n fields: clause.fields\n })\n } else {\n terms = [clause.term]\n }\n\n for (var m = 0; m < terms.length; m++) {\n var term = terms[m]\n\n /*\n * Each term returned from the pipeline needs to use the same query\n * clause object, e.g. the same boost and or edit distance. The\n * simplest way to do this is to re-use the clause object but mutate\n * its term property.\n */\n clause.term = term\n\n /*\n * From the term in the clause we create a token set which will then\n * be used to intersect the indexes token set to get a list of terms\n * to lookup in the inverted index\n */\n var termTokenSet = lunr.TokenSet.fromClause(clause),\n expandedTerms = this.tokenSet.intersect(termTokenSet).toArray()\n\n /*\n * If a term marked as required does not exist in the tokenSet it is\n * impossible for the search to return any matches. We set all the field\n * scoped required matches set to empty and stop examining any further\n * clauses.\n */\n if (expandedTerms.length === 0 && clause.presence === lunr.Query.presence.REQUIRED) {\n for (var k = 0; k < clause.fields.length; k++) {\n var field = clause.fields[k]\n requiredMatches[field] = lunr.Set.empty\n }\n\n break\n }\n\n for (var j = 0; j < expandedTerms.length; j++) {\n /*\n * For each term get the posting and termIndex, this is required for\n * building the query vector.\n */\n var expandedTerm = expandedTerms[j],\n posting = this.invertedIndex[expandedTerm],\n termIndex = posting._index\n\n for (var k = 0; k < clause.fields.length; k++) {\n /*\n * For each field that this query term is scoped by (by default\n * all fields are in scope) we need to get all the document refs\n * that have this term in that field.\n *\n * The posting is the entry in the invertedIndex for the matching\n * term from above.\n */\n var field = clause.fields[k],\n fieldPosting = posting[field],\n matchingDocumentRefs = Object.keys(fieldPosting),\n termField = expandedTerm + \"/\" + field,\n matchingDocumentsSet = new lunr.Set(matchingDocumentRefs)\n\n /*\n * if the presence of this term is required ensure that the matching\n * documents are added to the set of required matches for this clause.\n *\n */\n if (clause.presence == lunr.Query.presence.REQUIRED) {\n clauseMatches = clauseMatches.union(matchingDocumentsSet)\n\n if (requiredMatches[field] === undefined) {\n requiredMatches[field] = lunr.Set.complete\n }\n }\n\n /*\n * if the presence of this term is prohibited ensure that the matching\n * documents are added to the set of prohibited matches for this field,\n * creating that set if it does not yet exist.\n */\n if (clause.presence == lunr.Query.presence.PROHIBITED) {\n if (prohibitedMatches[field] === undefined) {\n prohibitedMatches[field] = lunr.Set.empty\n }\n\n prohibitedMatches[field] = prohibitedMatches[field].union(matchingDocumentsSet)\n\n /*\n * Prohibited matches should not be part of the query vector used for\n * similarity scoring and no metadata should be extracted so we continue\n * to the next field\n */\n continue\n }\n\n /*\n * The query field vector is populated using the termIndex found for\n * the term and a unit value with the appropriate boost applied.\n * Using upsert because there could already be an entry in the vector\n * for the term we are working with. In that case we just add the scores\n * together.\n */\n queryVectors[field].upsert(termIndex, clause.boost, function (a, b) { return a + b })\n\n /**\n * If we've already seen this term, field combo then we've already collected\n * the matching documents and metadata, no need to go through all that again\n */\n if (termFieldCache[termField]) {\n continue\n }\n\n for (var l = 0; l < matchingDocumentRefs.length; l++) {\n /*\n * All metadata for this term/field/document triple\n * are then extracted and collected into an instance\n * of lunr.MatchData ready to be returned in the query\n * results\n */\n var matchingDocumentRef = matchingDocumentRefs[l],\n matchingFieldRef = new lunr.FieldRef (matchingDocumentRef, field),\n metadata = fieldPosting[matchingDocumentRef],\n fieldMatch\n\n if ((fieldMatch = matchingFields[matchingFieldRef]) === undefined) {\n matchingFields[matchingFieldRef] = new lunr.MatchData (expandedTerm, field, metadata)\n } else {\n fieldMatch.add(expandedTerm, field, metadata)\n }\n\n }\n\n termFieldCache[termField] = true\n }\n }\n }\n\n /**\n * If the presence was required we need to update the requiredMatches field sets.\n * We do this after all fields for the term have collected their matches because\n * the clause terms presence is required in _any_ of the fields not _all_ of the\n * fields.\n */\n if (clause.presence === lunr.Query.presence.REQUIRED) {\n for (var k = 0; k < clause.fields.length; k++) {\n var field = clause.fields[k]\n requiredMatches[field] = requiredMatches[field].intersect(clauseMatches)\n }\n }\n }\n\n /**\n * Need to combine the field scoped required and prohibited\n * matching documents into a global set of required and prohibited\n * matches\n */\n var allRequiredMatches = lunr.Set.complete,\n allProhibitedMatches = lunr.Set.empty\n\n for (var i = 0; i < this.fields.length; i++) {\n var field = this.fields[i]\n\n if (requiredMatches[field]) {\n allRequiredMatches = allRequiredMatches.intersect(requiredMatches[field])\n }\n\n if (prohibitedMatches[field]) {\n allProhibitedMatches = allProhibitedMatches.union(prohibitedMatches[field])\n }\n }\n\n var matchingFieldRefs = Object.keys(matchingFields),\n results = [],\n matches = Object.create(null)\n\n /*\n * If the query is negated (contains only prohibited terms)\n * we need to get _all_ fieldRefs currently existing in the\n * index. This is only done when we know that the query is\n * entirely prohibited terms to avoid any cost of getting all\n * fieldRefs unnecessarily.\n *\n * Additionally, blank MatchData must be created to correctly\n * populate the results.\n */\n if (query.isNegated()) {\n matchingFieldRefs = Object.keys(this.fieldVectors)\n\n for (var i = 0; i < matchingFieldRefs.length; i++) {\n var matchingFieldRef = matchingFieldRefs[i]\n var fieldRef = lunr.FieldRef.fromString(matchingFieldRef)\n matchingFields[matchingFieldRef] = new lunr.MatchData\n }\n }\n\n for (var i = 0; i < matchingFieldRefs.length; i++) {\n /*\n * Currently we have document fields that match the query, but we\n * need to return documents. The matchData and scores are combined\n * from multiple fields belonging to the same document.\n *\n * Scores are calculated by field, using the query vectors created\n * above, and combined into a final document score using addition.\n */\n var fieldRef = lunr.FieldRef.fromString(matchingFieldRefs[i]),\n docRef = fieldRef.docRef\n\n if (!allRequiredMatches.contains(docRef)) {\n continue\n }\n\n if (allProhibitedMatches.contains(docRef)) {\n continue\n }\n\n var fieldVector = this.fieldVectors[fieldRef],\n score = queryVectors[fieldRef.fieldName].similarity(fieldVector),\n docMatch\n\n if ((docMatch = matches[docRef]) !== undefined) {\n docMatch.score += score\n docMatch.matchData.combine(matchingFields[fieldRef])\n } else {\n var match = {\n ref: docRef,\n score: score,\n matchData: matchingFields[fieldRef]\n }\n matches[docRef] = match\n results.push(match)\n }\n }\n\n /*\n * Sort the results objects by score, highest first.\n */\n return results.sort(function (a, b) {\n return b.score - a.score\n })\n}\n\n/**\n * Prepares the index for JSON serialization.\n *\n * The schema for this JSON blob will be described in a\n * separate JSON schema file.\n *\n * @returns {Object}\n */\nlunr.Index.prototype.toJSON = function () {\n var invertedIndex = Object.keys(this.invertedIndex)\n .sort()\n .map(function (term) {\n return [term, this.invertedIndex[term]]\n }, this)\n\n var fieldVectors = Object.keys(this.fieldVectors)\n .map(function (ref) {\n return [ref, this.fieldVectors[ref].toJSON()]\n }, this)\n\n return {\n version: lunr.version,\n fields: this.fields,\n fieldVectors: fieldVectors,\n invertedIndex: invertedIndex,\n pipeline: this.pipeline.toJSON()\n }\n}\n\n/**\n * Loads a previously serialized lunr.Index\n *\n * @param {Object} serializedIndex - A previously serialized lunr.Index\n * @returns {lunr.Index}\n */\nlunr.Index.load = function (serializedIndex) {\n var attrs = {},\n fieldVectors = {},\n serializedVectors = serializedIndex.fieldVectors,\n invertedIndex = Object.create(null),\n serializedInvertedIndex = serializedIndex.invertedIndex,\n tokenSetBuilder = new lunr.TokenSet.Builder,\n pipeline = lunr.Pipeline.load(serializedIndex.pipeline)\n\n if (serializedIndex.version != lunr.version) {\n lunr.utils.warn(\"Version mismatch when loading serialised index. Current version of lunr '\" + lunr.version + \"' does not match serialized index '\" + serializedIndex.version + \"'\")\n }\n\n for (var i = 0; i < serializedVectors.length; i++) {\n var tuple = serializedVectors[i],\n ref = tuple[0],\n elements = tuple[1]\n\n fieldVectors[ref] = new lunr.Vector(elements)\n }\n\n for (var i = 0; i < serializedInvertedIndex.length; i++) {\n var tuple = serializedInvertedIndex[i],\n term = tuple[0],\n posting = tuple[1]\n\n tokenSetBuilder.insert(term)\n invertedIndex[term] = posting\n }\n\n tokenSetBuilder.finish()\n\n attrs.fields = serializedIndex.fields\n\n attrs.fieldVectors = fieldVectors\n attrs.invertedIndex = invertedIndex\n attrs.tokenSet = tokenSetBuilder.root\n attrs.pipeline = pipeline\n\n return new lunr.Index(attrs)\n}\n/*!\n * lunr.Builder\n * Copyright (C) 2019 Oliver Nightingale\n */\n\n/**\n * lunr.Builder performs indexing on a set of documents and\n * returns instances of lunr.Index ready for querying.\n *\n * All configuration of the index is done via the builder, the\n * fields to index, the document reference, the text processing\n * pipeline and document scoring parameters are all set on the\n * builder before indexing.\n *\n * @constructor\n * @property {string} _ref - Internal reference to the document reference field.\n * @property {string[]} _fields - Internal reference to the document fields to index.\n * @property {object} invertedIndex - The inverted index maps terms to document fields.\n * @property {object} documentTermFrequencies - Keeps track of document term frequencies.\n * @property {object} documentLengths - Keeps track of the length of documents added to the index.\n * @property {lunr.tokenizer} tokenizer - Function for splitting strings into tokens for indexing.\n * @property {lunr.Pipeline} pipeline - The pipeline performs text processing on tokens before indexing.\n * @property {lunr.Pipeline} searchPipeline - A pipeline for processing search terms before querying the index.\n * @property {number} documentCount - Keeps track of the total number of documents indexed.\n * @property {number} _b - A parameter to control field length normalization, setting this to 0 disabled normalization, 1 fully normalizes field lengths, the default value is 0.75.\n * @property {number} _k1 - A parameter to control how quickly an increase in term frequency results in term frequency saturation, the default value is 1.2.\n * @property {number} termIndex - A counter incremented for each unique term, used to identify a terms position in the vector space.\n * @property {array} metadataWhitelist - A list of metadata keys that have been whitelisted for entry in the index.\n */\nlunr.Builder = function () {\n this._ref = \"id\"\n this._fields = Object.create(null)\n this._documents = Object.create(null)\n this.invertedIndex = Object.create(null)\n this.fieldTermFrequencies = {}\n this.fieldLengths = {}\n this.tokenizer = lunr.tokenizer\n this.pipeline = new lunr.Pipeline\n this.searchPipeline = new lunr.Pipeline\n this.documentCount = 0\n this._b = 0.75\n this._k1 = 1.2\n this.termIndex = 0\n this.metadataWhitelist = []\n}\n\n/**\n * Sets the document field used as the document reference. Every document must have this field.\n * The type of this field in the document should be a string, if it is not a string it will be\n * coerced into a string by calling toString.\n *\n * The default ref is 'id'.\n *\n * The ref should _not_ be changed during indexing, it should be set before any documents are\n * added to the index. Changing it during indexing can lead to inconsistent results.\n *\n * @param {string} ref - The name of the reference field in the document.\n */\nlunr.Builder.prototype.ref = function (ref) {\n this._ref = ref\n}\n\n/**\n * A function that is used to extract a field from a document.\n *\n * Lunr expects a field to be at the top level of a document, if however the field\n * is deeply nested within a document an extractor function can be used to extract\n * the right field for indexing.\n *\n * @callback fieldExtractor\n * @param {object} doc - The document being added to the index.\n * @returns {?(string|object|object[])} obj - The object that will be indexed for this field.\n * @example Extracting a nested field\n * function (doc) { return doc.nested.field }\n */\n\n/**\n * Adds a field to the list of document fields that will be indexed. Every document being\n * indexed should have this field. Null values for this field in indexed documents will\n * not cause errors but will limit the chance of that document being retrieved by searches.\n *\n * All fields should be added before adding documents to the index. Adding fields after\n * a document has been indexed will have no effect on already indexed documents.\n *\n * Fields can be boosted at build time. This allows terms within that field to have more\n * importance when ranking search results. Use a field boost to specify that matches within\n * one field are more important than other fields.\n *\n * @param {string} fieldName - The name of a field to index in all documents.\n * @param {object} attributes - Optional attributes associated with this field.\n * @param {number} [attributes.boost=1] - Boost applied to all terms within this field.\n * @param {fieldExtractor} [attributes.extractor] - Function to extract a field from a document.\n * @throws {RangeError} fieldName cannot contain unsupported characters '/'\n */\nlunr.Builder.prototype.field = function (fieldName, attributes) {\n if (/\\//.test(fieldName)) {\n throw new RangeError (\"Field '\" + fieldName + \"' contains illegal character '/'\")\n }\n\n this._fields[fieldName] = attributes || {}\n}\n\n/**\n * A parameter to tune the amount of field length normalisation that is applied when\n * calculating relevance scores. A value of 0 will completely disable any normalisation\n * and a value of 1 will fully normalise field lengths. The default is 0.75. Values of b\n * will be clamped to the range 0 - 1.\n *\n * @param {number} number - The value to set for this tuning parameter.\n */\nlunr.Builder.prototype.b = function (number) {\n if (number < 0) {\n this._b = 0\n } else if (number > 1) {\n this._b = 1\n } else {\n this._b = number\n }\n}\n\n/**\n * A parameter that controls the speed at which a rise in term frequency results in term\n * frequency saturation. The default value is 1.2. Setting this to a higher value will give\n * slower saturation levels, a lower value will result in quicker saturation.\n *\n * @param {number} number - The value to set for this tuning parameter.\n */\nlunr.Builder.prototype.k1 = function (number) {\n this._k1 = number\n}\n\n/**\n * Adds a document to the index.\n *\n * Before adding fields to the index the index should have been fully setup, with the document\n * ref and all fields to index already having been specified.\n *\n * The document must have a field name as specified by the ref (by default this is 'id') and\n * it should have all fields defined for indexing, though null or undefined values will not\n * cause errors.\n *\n * Entire documents can be boosted at build time. Applying a boost to a document indicates that\n * this document should rank higher in search results than other documents.\n *\n * @param {object} doc - The document to add to the index.\n * @param {object} attributes - Optional attributes associated with this document.\n * @param {number} [attributes.boost=1] - Boost applied to all terms within this document.\n */\nlunr.Builder.prototype.add = function (doc, attributes) {\n var docRef = doc[this._ref],\n fields = Object.keys(this._fields)\n\n this._documents[docRef] = attributes || {}\n this.documentCount += 1\n\n for (var i = 0; i < fields.length; i++) {\n var fieldName = fields[i],\n extractor = this._fields[fieldName].extractor,\n field = extractor ? extractor(doc) : doc[fieldName],\n tokens = this.tokenizer(field, {\n fields: [fieldName]\n }),\n terms = this.pipeline.run(tokens),\n fieldRef = new lunr.FieldRef (docRef, fieldName),\n fieldTerms = Object.create(null)\n\n this.fieldTermFrequencies[fieldRef] = fieldTerms\n this.fieldLengths[fieldRef] = 0\n\n // store the length of this field for this document\n this.fieldLengths[fieldRef] += terms.length\n\n // calculate term frequencies for this field\n for (var j = 0; j < terms.length; j++) {\n var term = terms[j]\n\n if (fieldTerms[term] == undefined) {\n fieldTerms[term] = 0\n }\n\n fieldTerms[term] += 1\n\n // add to inverted index\n // create an initial posting if one doesn't exist\n if (this.invertedIndex[term] == undefined) {\n var posting = Object.create(null)\n posting[\"_index\"] = this.termIndex\n this.termIndex += 1\n\n for (var k = 0; k < fields.length; k++) {\n posting[fields[k]] = Object.create(null)\n }\n\n this.invertedIndex[term] = posting\n }\n\n // add an entry for this term/fieldName/docRef to the invertedIndex\n if (this.invertedIndex[term][fieldName][docRef] == undefined) {\n this.invertedIndex[term][fieldName][docRef] = Object.create(null)\n }\n\n // store all whitelisted metadata about this token in the\n // inverted index\n for (var l = 0; l < this.metadataWhitelist.length; l++) {\n var metadataKey = this.metadataWhitelist[l],\n metadata = term.metadata[metadataKey]\n\n if (this.invertedIndex[term][fieldName][docRef][metadataKey] == undefined) {\n this.invertedIndex[term][fieldName][docRef][metadataKey] = []\n }\n\n this.invertedIndex[term][fieldName][docRef][metadataKey].push(metadata)\n }\n }\n\n }\n}\n\n/**\n * Calculates the average document length for this index\n *\n * @private\n */\nlunr.Builder.prototype.calculateAverageFieldLengths = function () {\n\n var fieldRefs = Object.keys(this.fieldLengths),\n numberOfFields = fieldRefs.length,\n accumulator = {},\n documentsWithField = {}\n\n for (var i = 0; i < numberOfFields; i++) {\n var fieldRef = lunr.FieldRef.fromString(fieldRefs[i]),\n field = fieldRef.fieldName\n\n documentsWithField[field] || (documentsWithField[field] = 0)\n documentsWithField[field] += 1\n\n accumulator[field] || (accumulator[field] = 0)\n accumulator[field] += this.fieldLengths[fieldRef]\n }\n\n var fields = Object.keys(this._fields)\n\n for (var i = 0; i < fields.length; i++) {\n var fieldName = fields[i]\n accumulator[fieldName] = accumulator[fieldName] / documentsWithField[fieldName]\n }\n\n this.averageFieldLength = accumulator\n}\n\n/**\n * Builds a vector space model of every document using lunr.Vector\n *\n * @private\n */\nlunr.Builder.prototype.createFieldVectors = function () {\n var fieldVectors = {},\n fieldRefs = Object.keys(this.fieldTermFrequencies),\n fieldRefsLength = fieldRefs.length,\n termIdfCache = Object.create(null)\n\n for (var i = 0; i < fieldRefsLength; i++) {\n var fieldRef = lunr.FieldRef.fromString(fieldRefs[i]),\n fieldName = fieldRef.fieldName,\n fieldLength = this.fieldLengths[fieldRef],\n fieldVector = new lunr.Vector,\n termFrequencies = this.fieldTermFrequencies[fieldRef],\n terms = Object.keys(termFrequencies),\n termsLength = terms.length\n\n\n var fieldBoost = this._fields[fieldName].boost || 1,\n docBoost = this._documents[fieldRef.docRef].boost || 1\n\n for (var j = 0; j < termsLength; j++) {\n var term = terms[j],\n tf = termFrequencies[term],\n termIndex = this.invertedIndex[term]._index,\n idf, score, scoreWithPrecision\n\n if (termIdfCache[term] === undefined) {\n idf = lunr.idf(this.invertedIndex[term], this.documentCount)\n termIdfCache[term] = idf\n } else {\n idf = termIdfCache[term]\n }\n\n score = idf * ((this._k1 + 1) * tf) / (this._k1 * (1 - this._b + this._b * (fieldLength / this.averageFieldLength[fieldName])) + tf)\n score *= fieldBoost\n score *= docBoost\n scoreWithPrecision = Math.round(score * 1000) / 1000\n // Converts 1.23456789 to 1.234.\n // Reducing the precision so that the vectors take up less\n // space when serialised. Doing it now so that they behave\n // the same before and after serialisation. Also, this is\n // the fastest approach to reducing a number's precision in\n // JavaScript.\n\n fieldVector.insert(termIndex, scoreWithPrecision)\n }\n\n fieldVectors[fieldRef] = fieldVector\n }\n\n this.fieldVectors = fieldVectors\n}\n\n/**\n * Creates a token set of all tokens in the index using lunr.TokenSet\n *\n * @private\n */\nlunr.Builder.prototype.createTokenSet = function () {\n this.tokenSet = lunr.TokenSet.fromArray(\n Object.keys(this.invertedIndex).sort()\n )\n}\n\n/**\n * Builds the index, creating an instance of lunr.Index.\n *\n * This completes the indexing process and should only be called\n * once all documents have been added to the index.\n *\n * @returns {lunr.Index}\n */\nlunr.Builder.prototype.build = function () {\n this.calculateAverageFieldLengths()\n this.createFieldVectors()\n this.createTokenSet()\n\n return new lunr.Index({\n invertedIndex: this.invertedIndex,\n fieldVectors: this.fieldVectors,\n tokenSet: this.tokenSet,\n fields: Object.keys(this._fields),\n pipeline: this.searchPipeline\n })\n}\n\n/**\n * Applies a plugin to the index builder.\n *\n * A plugin is a function that is called with the index builder as its context.\n * Plugins can be used to customise or extend the behaviour of the index\n * in some way. A plugin is just a function, that encapsulated the custom\n * behaviour that should be applied when building the index.\n *\n * The plugin function will be called with the index builder as its argument, additional\n * arguments can also be passed when calling use. The function will be called\n * with the index builder as its context.\n *\n * @param {Function} plugin The plugin to apply.\n */\nlunr.Builder.prototype.use = function (fn) {\n var args = Array.prototype.slice.call(arguments, 1)\n args.unshift(this)\n fn.apply(this, args)\n}\n/**\n * Contains and collects metadata about a matching document.\n * A single instance of lunr.MatchData is returned as part of every\n * lunr.Index~Result.\n *\n * @constructor\n * @param {string} term - The term this match data is associated with\n * @param {string} field - The field in which the term was found\n * @param {object} metadata - The metadata recorded about this term in this field\n * @property {object} metadata - A cloned collection of metadata associated with this document.\n * @see {@link lunr.Index~Result}\n */\nlunr.MatchData = function (term, field, metadata) {\n var clonedMetadata = Object.create(null),\n metadataKeys = Object.keys(metadata || {})\n\n // Cloning the metadata to prevent the original\n // being mutated during match data combination.\n // Metadata is kept in an array within the inverted\n // index so cloning the data can be done with\n // Array#slice\n for (var i = 0; i < metadataKeys.length; i++) {\n var key = metadataKeys[i]\n clonedMetadata[key] = metadata[key].slice()\n }\n\n this.metadata = Object.create(null)\n\n if (term !== undefined) {\n this.metadata[term] = Object.create(null)\n this.metadata[term][field] = clonedMetadata\n }\n}\n\n/**\n * An instance of lunr.MatchData will be created for every term that matches a\n * document. However only one instance is required in a lunr.Index~Result. This\n * method combines metadata from another instance of lunr.MatchData with this\n * objects metadata.\n *\n * @param {lunr.MatchData} otherMatchData - Another instance of match data to merge with this one.\n * @see {@link lunr.Index~Result}\n */\nlunr.MatchData.prototype.combine = function (otherMatchData) {\n var terms = Object.keys(otherMatchData.metadata)\n\n for (var i = 0; i < terms.length; i++) {\n var term = terms[i],\n fields = Object.keys(otherMatchData.metadata[term])\n\n if (this.metadata[term] == undefined) {\n this.metadata[term] = Object.create(null)\n }\n\n for (var j = 0; j < fields.length; j++) {\n var field = fields[j],\n keys = Object.keys(otherMatchData.metadata[term][field])\n\n if (this.metadata[term][field] == undefined) {\n this.metadata[term][field] = Object.create(null)\n }\n\n for (var k = 0; k < keys.length; k++) {\n var key = keys[k]\n\n if (this.metadata[term][field][key] == undefined) {\n this.metadata[term][field][key] = otherMatchData.metadata[term][field][key]\n } else {\n this.metadata[term][field][key] = this.metadata[term][field][key].concat(otherMatchData.metadata[term][field][key])\n }\n\n }\n }\n }\n}\n\n/**\n * Add metadata for a term/field pair to this instance of match data.\n *\n * @param {string} term - The term this match data is associated with\n * @param {string} field - The field in which the term was found\n * @param {object} metadata - The metadata recorded about this term in this field\n */\nlunr.MatchData.prototype.add = function (term, field, metadata) {\n if (!(term in this.metadata)) {\n this.metadata[term] = Object.create(null)\n this.metadata[term][field] = metadata\n return\n }\n\n if (!(field in this.metadata[term])) {\n this.metadata[term][field] = metadata\n return\n }\n\n var metadataKeys = Object.keys(metadata)\n\n for (var i = 0; i < metadataKeys.length; i++) {\n var key = metadataKeys[i]\n\n if (key in this.metadata[term][field]) {\n this.metadata[term][field][key] = this.metadata[term][field][key].concat(metadata[key])\n } else {\n this.metadata[term][field][key] = metadata[key]\n }\n }\n}\n/**\n * A lunr.Query provides a programmatic way of defining queries to be performed\n * against a {@link lunr.Index}.\n *\n * Prefer constructing a lunr.Query using the {@link lunr.Index#query} method\n * so the query object is pre-initialized with the right index fields.\n *\n * @constructor\n * @property {lunr.Query~Clause[]} clauses - An array of query clauses.\n * @property {string[]} allFields - An array of all available fields in a lunr.Index.\n */\nlunr.Query = function (allFields) {\n this.clauses = []\n this.allFields = allFields\n}\n\n/**\n * Constants for indicating what kind of automatic wildcard insertion will be used when constructing a query clause.\n *\n * This allows wildcards to be added to the beginning and end of a term without having to manually do any string\n * concatenation.\n *\n * The wildcard constants can be bitwise combined to select both leading and trailing wildcards.\n *\n * @constant\n * @default\n * @property {number} wildcard.NONE - The term will have no wildcards inserted, this is the default behaviour\n * @property {number} wildcard.LEADING - Prepend the term with a wildcard, unless a leading wildcard already exists\n * @property {number} wildcard.TRAILING - Append a wildcard to the term, unless a trailing wildcard already exists\n * @see lunr.Query~Clause\n * @see lunr.Query#clause\n * @see lunr.Query#term\n * @example query term with trailing wildcard\n * query.term('foo', { wildcard: lunr.Query.wildcard.TRAILING })\n * @example query term with leading and trailing wildcard\n * query.term('foo', {\n * wildcard: lunr.Query.wildcard.LEADING | lunr.Query.wildcard.TRAILING\n * })\n */\n\nlunr.Query.wildcard = new String (\"*\")\nlunr.Query.wildcard.NONE = 0\nlunr.Query.wildcard.LEADING = 1\nlunr.Query.wildcard.TRAILING = 2\n\n/**\n * Constants for indicating what kind of presence a term must have in matching documents.\n *\n * @constant\n * @enum {number}\n * @see lunr.Query~Clause\n * @see lunr.Query#clause\n * @see lunr.Query#term\n * @example query term with required presence\n * query.term('foo', { presence: lunr.Query.presence.REQUIRED })\n */\nlunr.Query.presence = {\n /**\n * Term's presence in a document is optional, this is the default value.\n */\n OPTIONAL: 1,\n\n /**\n * Term's presence in a document is required, documents that do not contain\n * this term will not be returned.\n */\n REQUIRED: 2,\n\n /**\n * Term's presence in a document is prohibited, documents that do contain\n * this term will not be returned.\n */\n PROHIBITED: 3\n}\n\n/**\n * A single clause in a {@link lunr.Query} contains a term and details on how to\n * match that term against a {@link lunr.Index}.\n *\n * @typedef {Object} lunr.Query~Clause\n * @property {string[]} fields - The fields in an index this clause should be matched against.\n * @property {number} [boost=1] - Any boost that should be applied when matching this clause.\n * @property {number} [editDistance] - Whether the term should have fuzzy matching applied, and how fuzzy the match should be.\n * @property {boolean} [usePipeline] - Whether the term should be passed through the search pipeline.\n * @property {number} [wildcard=lunr.Query.wildcard.NONE] - Whether the term should have wildcards appended or prepended.\n * @property {number} [presence=lunr.Query.presence.OPTIONAL] - The terms presence in any matching documents.\n */\n\n/**\n * Adds a {@link lunr.Query~Clause} to this query.\n *\n * Unless the clause contains the fields to be matched all fields will be matched. In addition\n * a default boost of 1 is applied to the clause.\n *\n * @param {lunr.Query~Clause} clause - The clause to add to this query.\n * @see lunr.Query~Clause\n * @returns {lunr.Query}\n */\nlunr.Query.prototype.clause = function (clause) {\n if (!('fields' in clause)) {\n clause.fields = this.allFields\n }\n\n if (!('boost' in clause)) {\n clause.boost = 1\n }\n\n if (!('usePipeline' in clause)) {\n clause.usePipeline = true\n }\n\n if (!('wildcard' in clause)) {\n clause.wildcard = lunr.Query.wildcard.NONE\n }\n\n if ((clause.wildcard & lunr.Query.wildcard.LEADING) && (clause.term.charAt(0) != lunr.Query.wildcard)) {\n clause.term = \"*\" + clause.term\n }\n\n if ((clause.wildcard & lunr.Query.wildcard.TRAILING) && (clause.term.slice(-1) != lunr.Query.wildcard)) {\n clause.term = \"\" + clause.term + \"*\"\n }\n\n if (!('presence' in clause)) {\n clause.presence = lunr.Query.presence.OPTIONAL\n }\n\n this.clauses.push(clause)\n\n return this\n}\n\n/**\n * A negated query is one in which every clause has a presence of\n * prohibited. These queries require some special processing to return\n * the expected results.\n *\n * @returns boolean\n */\nlunr.Query.prototype.isNegated = function () {\n for (var i = 0; i < this.clauses.length; i++) {\n if (this.clauses[i].presence != lunr.Query.presence.PROHIBITED) {\n return false\n }\n }\n\n return true\n}\n\n/**\n * Adds a term to the current query, under the covers this will create a {@link lunr.Query~Clause}\n * to the list of clauses that make up this query.\n *\n * The term is used as is, i.e. no tokenization will be performed by this method. Instead conversion\n * to a token or token-like string should be done before calling this method.\n *\n * The term will be converted to a string by calling `toString`. Multiple terms can be passed as an\n * array, each term in the array will share the same options.\n *\n * @param {object|object[]} term - The term(s) to add to the query.\n * @param {object} [options] - Any additional properties to add to the query clause.\n * @returns {lunr.Query}\n * @see lunr.Query#clause\n * @see lunr.Query~Clause\n * @example adding a single term to a query\n * query.term(\"foo\")\n * @example adding a single term to a query and specifying search fields, term boost and automatic trailing wildcard\n * query.term(\"foo\", {\n * fields: [\"title\"],\n * boost: 10,\n * wildcard: lunr.Query.wildcard.TRAILING\n * })\n * @example using lunr.tokenizer to convert a string to tokens before using them as terms\n * query.term(lunr.tokenizer(\"foo bar\"))\n */\nlunr.Query.prototype.term = function (term, options) {\n if (Array.isArray(term)) {\n term.forEach(function (t) { this.term(t, lunr.utils.clone(options)) }, this)\n return this\n }\n\n var clause = options || {}\n clause.term = term.toString()\n\n this.clause(clause)\n\n return this\n}\nlunr.QueryParseError = function (message, start, end) {\n this.name = \"QueryParseError\"\n this.message = message\n this.start = start\n this.end = end\n}\n\nlunr.QueryParseError.prototype = new Error\nlunr.QueryLexer = function (str) {\n this.lexemes = []\n this.str = str\n this.length = str.length\n this.pos = 0\n this.start = 0\n this.escapeCharPositions = []\n}\n\nlunr.QueryLexer.prototype.run = function () {\n var state = lunr.QueryLexer.lexText\n\n while (state) {\n state = state(this)\n }\n}\n\nlunr.QueryLexer.prototype.sliceString = function () {\n var subSlices = [],\n sliceStart = this.start,\n sliceEnd = this.pos\n\n for (var i = 0; i < this.escapeCharPositions.length; i++) {\n sliceEnd = this.escapeCharPositions[i]\n subSlices.push(this.str.slice(sliceStart, sliceEnd))\n sliceStart = sliceEnd + 1\n }\n\n subSlices.push(this.str.slice(sliceStart, this.pos))\n this.escapeCharPositions.length = 0\n\n return subSlices.join('')\n}\n\nlunr.QueryLexer.prototype.emit = function (type) {\n this.lexemes.push({\n type: type,\n str: this.sliceString(),\n start: this.start,\n end: this.pos\n })\n\n this.start = this.pos\n}\n\nlunr.QueryLexer.prototype.escapeCharacter = function () {\n this.escapeCharPositions.push(this.pos - 1)\n this.pos += 1\n}\n\nlunr.QueryLexer.prototype.next = function () {\n if (this.pos >= this.length) {\n return lunr.QueryLexer.EOS\n }\n\n var char = this.str.charAt(this.pos)\n this.pos += 1\n return char\n}\n\nlunr.QueryLexer.prototype.width = function () {\n return this.pos - this.start\n}\n\nlunr.QueryLexer.prototype.ignore = function () {\n if (this.start == this.pos) {\n this.pos += 1\n }\n\n this.start = this.pos\n}\n\nlunr.QueryLexer.prototype.backup = function () {\n this.pos -= 1\n}\n\nlunr.QueryLexer.prototype.acceptDigitRun = function () {\n var char, charCode\n\n do {\n char = this.next()\n charCode = char.charCodeAt(0)\n } while (charCode > 47 && charCode < 58)\n\n if (char != lunr.QueryLexer.EOS) {\n this.backup()\n }\n}\n\nlunr.QueryLexer.prototype.more = function () {\n return this.pos < this.length\n}\n\nlunr.QueryLexer.EOS = 'EOS'\nlunr.QueryLexer.FIELD = 'FIELD'\nlunr.QueryLexer.TERM = 'TERM'\nlunr.QueryLexer.EDIT_DISTANCE = 'EDIT_DISTANCE'\nlunr.QueryLexer.BOOST = 'BOOST'\nlunr.QueryLexer.PRESENCE = 'PRESENCE'\n\nlunr.QueryLexer.lexField = function (lexer) {\n lexer.backup()\n lexer.emit(lunr.QueryLexer.FIELD)\n lexer.ignore()\n return lunr.QueryLexer.lexText\n}\n\nlunr.QueryLexer.lexTerm = function (lexer) {\n if (lexer.width() > 1) {\n lexer.backup()\n lexer.emit(lunr.QueryLexer.TERM)\n }\n\n lexer.ignore()\n\n if (lexer.more()) {\n return lunr.QueryLexer.lexText\n }\n}\n\nlunr.QueryLexer.lexEditDistance = function (lexer) {\n lexer.ignore()\n lexer.acceptDigitRun()\n lexer.emit(lunr.QueryLexer.EDIT_DISTANCE)\n return lunr.QueryLexer.lexText\n}\n\nlunr.QueryLexer.lexBoost = function (lexer) {\n lexer.ignore()\n lexer.acceptDigitRun()\n lexer.emit(lunr.QueryLexer.BOOST)\n return lunr.QueryLexer.lexText\n}\n\nlunr.QueryLexer.lexEOS = function (lexer) {\n if (lexer.width() > 0) {\n lexer.emit(lunr.QueryLexer.TERM)\n }\n}\n\n// This matches the separator used when tokenising fields\n// within a document. These should match otherwise it is\n// not possible to search for some tokens within a document.\n//\n// It is possible for the user to change the separator on the\n// tokenizer so it _might_ clash with any other of the special\n// characters already used within the search string, e.g. :.\n//\n// This means that it is possible to change the separator in\n// such a way that makes some words unsearchable using a search\n// string.\nlunr.QueryLexer.termSeparator = lunr.tokenizer.separator\n\nlunr.QueryLexer.lexText = function (lexer) {\n while (true) {\n var char = lexer.next()\n\n if (char == lunr.QueryLexer.EOS) {\n return lunr.QueryLexer.lexEOS\n }\n\n // Escape character is '\\'\n if (char.charCodeAt(0) == 92) {\n lexer.escapeCharacter()\n continue\n }\n\n if (char == \":\") {\n return lunr.QueryLexer.lexField\n }\n\n if (char == \"~\") {\n lexer.backup()\n if (lexer.width() > 0) {\n lexer.emit(lunr.QueryLexer.TERM)\n }\n return lunr.QueryLexer.lexEditDistance\n }\n\n if (char == \"^\") {\n lexer.backup()\n if (lexer.width() > 0) {\n lexer.emit(lunr.QueryLexer.TERM)\n }\n return lunr.QueryLexer.lexBoost\n }\n\n // \"+\" indicates term presence is required\n // checking for length to ensure that only\n // leading \"+\" are considered\n if (char == \"+\" && lexer.width() === 1) {\n lexer.emit(lunr.QueryLexer.PRESENCE)\n return lunr.QueryLexer.lexText\n }\n\n // \"-\" indicates term presence is prohibited\n // checking for length to ensure that only\n // leading \"-\" are considered\n if (char == \"-\" && lexer.width() === 1) {\n lexer.emit(lunr.QueryLexer.PRESENCE)\n return lunr.QueryLexer.lexText\n }\n\n if (char.match(lunr.QueryLexer.termSeparator)) {\n return lunr.QueryLexer.lexTerm\n }\n }\n}\n\nlunr.QueryParser = function (str, query) {\n this.lexer = new lunr.QueryLexer (str)\n this.query = query\n this.currentClause = {}\n this.lexemeIdx = 0\n}\n\nlunr.QueryParser.prototype.parse = function () {\n this.lexer.run()\n this.lexemes = this.lexer.lexemes\n\n var state = lunr.QueryParser.parseClause\n\n while (state) {\n state = state(this)\n }\n\n return this.query\n}\n\nlunr.QueryParser.prototype.peekLexeme = function () {\n return this.lexemes[this.lexemeIdx]\n}\n\nlunr.QueryParser.prototype.consumeLexeme = function () {\n var lexeme = this.peekLexeme()\n this.lexemeIdx += 1\n return lexeme\n}\n\nlunr.QueryParser.prototype.nextClause = function () {\n var completedClause = this.currentClause\n this.query.clause(completedClause)\n this.currentClause = {}\n}\n\nlunr.QueryParser.parseClause = function (parser) {\n var lexeme = parser.peekLexeme()\n\n if (lexeme == undefined) {\n return\n }\n\n switch (lexeme.type) {\n case lunr.QueryLexer.PRESENCE:\n return lunr.QueryParser.parsePresence\n case lunr.QueryLexer.FIELD:\n return lunr.QueryParser.parseField\n case lunr.QueryLexer.TERM:\n return lunr.QueryParser.parseTerm\n default:\n var errorMessage = \"expected either a field or a term, found \" + lexeme.type\n\n if (lexeme.str.length >= 1) {\n errorMessage += \" with value '\" + lexeme.str + \"'\"\n }\n\n throw new lunr.QueryParseError (errorMessage, lexeme.start, lexeme.end)\n }\n}\n\nlunr.QueryParser.parsePresence = function (parser) {\n var lexeme = parser.consumeLexeme()\n\n if (lexeme == undefined) {\n return\n }\n\n switch (lexeme.str) {\n case \"-\":\n parser.currentClause.presence = lunr.Query.presence.PROHIBITED\n break\n case \"+\":\n parser.currentClause.presence = lunr.Query.presence.REQUIRED\n break\n default:\n var errorMessage = \"unrecognised presence operator'\" + lexeme.str + \"'\"\n throw new lunr.QueryParseError (errorMessage, lexeme.start, lexeme.end)\n }\n\n var nextLexeme = parser.peekLexeme()\n\n if (nextLexeme == undefined) {\n var errorMessage = \"expecting term or field, found nothing\"\n throw new lunr.QueryParseError (errorMessage, lexeme.start, lexeme.end)\n }\n\n switch (nextLexeme.type) {\n case lunr.QueryLexer.FIELD:\n return lunr.QueryParser.parseField\n case lunr.QueryLexer.TERM:\n return lunr.QueryParser.parseTerm\n default:\n var errorMessage = \"expecting term or field, found '\" + nextLexeme.type + \"'\"\n throw new lunr.QueryParseError (errorMessage, nextLexeme.start, nextLexeme.end)\n }\n}\n\nlunr.QueryParser.parseField = function (parser) {\n var lexeme = parser.consumeLexeme()\n\n if (lexeme == undefined) {\n return\n }\n\n if (parser.query.allFields.indexOf(lexeme.str) == -1) {\n var possibleFields = parser.query.allFields.map(function (f) { return \"'\" + f + \"'\" }).join(', '),\n errorMessage = \"unrecognised field '\" + lexeme.str + \"', possible fields: \" + possibleFields\n\n throw new lunr.QueryParseError (errorMessage, lexeme.start, lexeme.end)\n }\n\n parser.currentClause.fields = [lexeme.str]\n\n var nextLexeme = parser.peekLexeme()\n\n if (nextLexeme == undefined) {\n var errorMessage = \"expecting term, found nothing\"\n throw new lunr.QueryParseError (errorMessage, lexeme.start, lexeme.end)\n }\n\n switch (nextLexeme.type) {\n case lunr.QueryLexer.TERM:\n return lunr.QueryParser.parseTerm\n default:\n var errorMessage = \"expecting term, found '\" + nextLexeme.type + \"'\"\n throw new lunr.QueryParseError (errorMessage, nextLexeme.start, nextLexeme.end)\n }\n}\n\nlunr.QueryParser.parseTerm = function (parser) {\n var lexeme = parser.consumeLexeme()\n\n if (lexeme == undefined) {\n return\n }\n\n parser.currentClause.term = lexeme.str.toLowerCase()\n\n if (lexeme.str.indexOf(\"*\") != -1) {\n parser.currentClause.usePipeline = false\n }\n\n var nextLexeme = parser.peekLexeme()\n\n if (nextLexeme == undefined) {\n parser.nextClause()\n return\n }\n\n switch (nextLexeme.type) {\n case lunr.QueryLexer.TERM:\n parser.nextClause()\n return lunr.QueryParser.parseTerm\n case lunr.QueryLexer.FIELD:\n parser.nextClause()\n return lunr.QueryParser.parseField\n case lunr.QueryLexer.EDIT_DISTANCE:\n return lunr.QueryParser.parseEditDistance\n case lunr.QueryLexer.BOOST:\n return lunr.QueryParser.parseBoost\n case lunr.QueryLexer.PRESENCE:\n parser.nextClause()\n return lunr.QueryParser.parsePresence\n default:\n var errorMessage = \"Unexpected lexeme type '\" + nextLexeme.type + \"'\"\n throw new lunr.QueryParseError (errorMessage, nextLexeme.start, nextLexeme.end)\n }\n}\n\nlunr.QueryParser.parseEditDistance = function (parser) {\n var lexeme = parser.consumeLexeme()\n\n if (lexeme == undefined) {\n return\n }\n\n var editDistance = parseInt(lexeme.str, 10)\n\n if (isNaN(editDistance)) {\n var errorMessage = \"edit distance must be numeric\"\n throw new lunr.QueryParseError (errorMessage, lexeme.start, lexeme.end)\n }\n\n parser.currentClause.editDistance = editDistance\n\n var nextLexeme = parser.peekLexeme()\n\n if (nextLexeme == undefined) {\n parser.nextClause()\n return\n }\n\n switch (nextLexeme.type) {\n case lunr.QueryLexer.TERM:\n parser.nextClause()\n return lunr.QueryParser.parseTerm\n case lunr.QueryLexer.FIELD:\n parser.nextClause()\n return lunr.QueryParser.parseField\n case lunr.QueryLexer.EDIT_DISTANCE:\n return lunr.QueryParser.parseEditDistance\n case lunr.QueryLexer.BOOST:\n return lunr.QueryParser.parseBoost\n case lunr.QueryLexer.PRESENCE:\n parser.nextClause()\n return lunr.QueryParser.parsePresence\n default:\n var errorMessage = \"Unexpected lexeme type '\" + nextLexeme.type + \"'\"\n throw new lunr.QueryParseError (errorMessage, nextLexeme.start, nextLexeme.end)\n }\n}\n\nlunr.QueryParser.parseBoost = function (parser) {\n var lexeme = parser.consumeLexeme()\n\n if (lexeme == undefined) {\n return\n }\n\n var boost = parseInt(lexeme.str, 10)\n\n if (isNaN(boost)) {\n var errorMessage = \"boost must be numeric\"\n throw new lunr.QueryParseError (errorMessage, lexeme.start, lexeme.end)\n }\n\n parser.currentClause.boost = boost\n\n var nextLexeme = parser.peekLexeme()\n\n if (nextLexeme == undefined) {\n parser.nextClause()\n return\n }\n\n switch (nextLexeme.type) {\n case lunr.QueryLexer.TERM:\n parser.nextClause()\n return lunr.QueryParser.parseTerm\n case lunr.QueryLexer.FIELD:\n parser.nextClause()\n return lunr.QueryParser.parseField\n case lunr.QueryLexer.EDIT_DISTANCE:\n return lunr.QueryParser.parseEditDistance\n case lunr.QueryLexer.BOOST:\n return lunr.QueryParser.parseBoost\n case lunr.QueryLexer.PRESENCE:\n parser.nextClause()\n return lunr.QueryParser.parsePresence\n default:\n var errorMessage = \"Unexpected lexeme type '\" + nextLexeme.type + \"'\"\n throw new lunr.QueryParseError (errorMessage, nextLexeme.start, nextLexeme.end)\n }\n}\n\n /**\n * export the module via AMD, CommonJS or as a browser global\n * Export code from https://github.com/umdjs/umd/blob/master/returnExports.js\n */\n ;(function (root, factory) {\n if (typeof define === 'function' && define.amd) {\n // AMD. Register as an anonymous module.\n define(factory)\n } else if (typeof exports === 'object') {\n /**\n * Node. Does not work with strict CommonJS, but\n * only CommonJS-like enviroments that support module.exports,\n * like Node.\n */\n module.exports = factory()\n } else {\n // Browser globals (root is window)\n root.lunr = factory()\n }\n }(this, function () {\n /**\n * Just return a value to define the module export.\n * This example returns an object, but the module\n * can return a function as the exported value.\n */\n return lunr\n }))\n})();\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A RTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { SearchIndexOptions, SearchResult } from \"modules\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Search message type\n */\nexport const enum SearchMessageType {\n SETUP, /* Search index setup */\n DUMP, /* Search index dump */\n QUERY, /* Search query */\n RESULT /* Search results */\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * A message containing the data necessary to setup the search index\n */\nexport interface SearchSetupMessage {\n type: SearchMessageType.SETUP /* Message type */\n data: SearchIndexOptions /* Message data */\n}\n\n/**\n * A message containing the a dump of the search index\n */\nexport interface SearchDumpMessage {\n type: SearchMessageType.DUMP /* Message type */\n data: string /* Message data */\n}\n\n/**\n * A message containing a search query\n */\nexport interface SearchQueryMessage {\n type: SearchMessageType.QUERY /* Message type */\n data: string /* Message data */\n}\n\n/**\n * A message containing results for a search query\n */\nexport interface SearchResultMessage {\n type: SearchMessageType.RESULT /* Message type */\n data: SearchResult[] /* Message data */\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * A message exchanged with the search worker\n */\nexport type SearchMessage =\n | SearchSetupMessage\n | SearchDumpMessage\n | SearchQueryMessage\n | SearchResultMessage\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Type guard for search setup messages\n *\n * @param message - Search worker message\n *\n * @return Test result\n */\nexport function isSearchSetupMessage(\n message: SearchMessage\n): message is SearchSetupMessage {\n return message.type === SearchMessageType.SETUP\n}\n\n/**\n * Type guard for search dump messages\n *\n * @param message - Search worker message\n *\n * @return Test result\n */\nexport function isSearchDumpMessage(\n message: SearchMessage\n): message is SearchDumpMessage {\n return message.type === SearchMessageType.DUMP\n}\n\n/**\n * Type guard for search query messages\n *\n * @param message - Search worker message\n *\n * @return Test result\n */\nexport function isSearchQueryMessage(\n message: SearchMessage\n): message is SearchQueryMessage {\n return message.type === SearchMessageType.QUERY\n}\n\n/**\n * Type guard for search result messages\n *\n * @param message - Search worker message\n *\n * @return Test result\n */\nexport function isSearchResultMessage(\n message: SearchMessage\n): message is SearchResultMessage {\n return message.type === SearchMessageType.RESULT\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport * as lunr from \"expose-loader?lunr!lunr\"\n\nimport {\n ArticleDocument,\n SearchDocumentMap,\n SectionDocument,\n setupSearchDocumentMap\n} from \"../document\"\nimport {\n SearchHighlightFactoryFn,\n setupSearchHighlighter\n} from \"../highlight\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Search index configuration\n */\nexport interface SearchIndexConfig {\n lang: string[] /* Search languages */\n separator: string /* Search separator */\n}\n\n/**\n * Search index document\n */\nexport interface SearchIndexDocument {\n location: string /* Document location */\n title: string /* Document title */\n text: string /* Document text */\n}\n\n/**\n * Search index pipeline\n */\nexport interface SearchIndexPipeline {\n trimmer: boolean /* Add trimmer to pipeline */\n stopwords: boolean /* Add stopword filter to pipeline */\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Search index options\n *\n * This interfaces describes the format of the `search_index.json` file which\n * is automatically built by the MkDocs search plugin.\n */\nexport interface SearchIndexOptions {\n config: SearchIndexConfig /* Search index configuration */\n docs: SearchIndexDocument[] /* Search index documents */\n pipeline?: SearchIndexPipeline /* Search index pipeline */\n index?: object | string /* Prebuilt or serialized index */\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Search result\n */\nexport interface SearchResult {\n article: ArticleDocument /* Article document */\n sections: SectionDocument[] /* Section documents */\n}\n\n/* ----------------------------------------------------------------------------\n * Class\n * ------------------------------------------------------------------------- */\n\nexport class SearchIndex {\n\n /**\n * Search document mapping\n *\n * A mapping of URLs (including hash fragments) to the actual articles and\n * sections of the documentation. The search document mapping must be created\n * regardless of whether the index was prebuilt or not, as lunr itself will\n * only store the actual index.\n */\n protected documents: SearchDocumentMap\n\n /**\n * Search highlight factory function\n */\n protected highlight: SearchHighlightFactoryFn\n\n /**\n * The lunr search index\n */\n protected index: lunr.Index\n\n /**\n * Create a search index\n *\n * @param options - Options\n */\n public constructor({ config, docs, pipeline, index }: SearchIndexOptions) {\n this.documents = setupSearchDocumentMap(docs)\n this.highlight = setupSearchHighlighter(config)\n\n /* If no index was given, create it */\n if (typeof index === \"undefined\") {\n this.index = lunr(function() {\n pipeline = pipeline || {\n trimmer: true,\n stopwords: true\n }\n\n /* Remove stemmer, as it cripples search experience */\n this.pipeline.reset()\n if (pipeline.trimmer)\n this.pipeline.add(lunr.trimmer)\n if (pipeline.stopwords)\n this.pipeline.add(lunr.stopWordFilter)\n\n /* Set up alternate search languages */\n if (config.lang.length === 1 && config.lang[0] !== \"en\") {\n this.use((lunr as any)[config.lang[0]])\n } else if (config.lang.length > 1) {\n this.use((lunr as any).multiLanguage(...config.lang))\n }\n\n /* Setup fields and reference */\n this.field(\"title\", { boost: 10 })\n this.field(\"text\")\n this.ref(\"location\")\n\n /* Index documents */\n for (const doc of docs)\n this.add(doc)\n })\n\n /* Prebuilt or serialized index */\n } else {\n this.index = lunr.Index.load(\n typeof index === \"string\"\n ? JSON.parse(index)\n : index\n )\n }\n }\n\n /**\n * Search for matching documents\n *\n * The search index which MkDocs provides is divided up into articles, which\n * contain the whole content of the individual pages, and sections, which only\n * contain the contents of the subsections obtained by breaking the individual\n * pages up at `h1` ... `h6`. As there may be many sections on different pages\n * with indentical titles (for example within this very project, e.g. \"Usage\"\n * or \"Installation\"), they need to be put into the context of the containing\n * page. For this reason, section results are grouped within their respective\n * articles which are the top-level results that are returned.\n *\n * @param query - Query string\n *\n * @return Search results\n */\n public search(query: string): SearchResult[] {\n if (query) {\n try {\n\n /* Group sections by containing article */\n const groups = this.index.search(query)\n .reduce((results, result) => {\n const document = this.documents.get(result.ref)\n if (typeof document !== \"undefined\") {\n if (\"parent\" in document) {\n const ref = document.parent.location\n results.set(ref, [...results.get(ref) || [], result])\n } else {\n const ref = document.location\n results.set(ref, results.get(ref) || [])\n }\n }\n return results\n }, new Map())\n\n /* Create highlighter for query */\n const fn = this.highlight(query)\n\n /* Map groups to search documents */\n return [...groups].map(([ref, sections]) => ({\n article: fn(this.documents.get(ref) as ArticleDocument),\n sections: sections.map(section => {\n return fn(this.documents.get(section.ref) as SectionDocument)\n })\n }))\n\n /* Log errors to console (for now) */\n } catch (err) {\n // tslint:disable-next-line no-console\n console.warn(`Invalid query: ${query} – see https://bit.ly/2s3ChXG`)\n }\n }\n\n /* Return nothing in case of error or empty query */\n return []\n }\n\n /**\n * Serialize search index\n *\n * @return String representation\n */\n public toString(): string {\n return JSON.stringify(this.index)\n }\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport * as escapeHTML from \"escape-html\"\n\nimport { SearchIndexDocument } from \"../_\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * A top-level article\n */\nexport interface ArticleDocument extends SearchIndexDocument {\n linked: boolean /* Whether the section was linked */\n}\n\n/**\n * A section of an article\n */\nexport interface SectionDocument extends SearchIndexDocument {\n parent: ArticleDocument /* Parent article */\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Search document\n */\nexport type SearchDocument =\n | ArticleDocument\n | SectionDocument\n\n/**\n * Search document mapping\n */\nexport type SearchDocumentMap = Map\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Create a search document mapping\n *\n * @param docs - Search index documents\n *\n * @return Search document map\n */\nexport function setupSearchDocumentMap(\n docs: SearchIndexDocument[]\n): SearchDocumentMap {\n const documents = new Map()\n for (const doc of docs) {\n const [path, hash] = doc.location.split(\"#\")\n\n /* Extract location and title */\n const location = doc.location\n const title = doc.title\n\n /* Escape and cleanup text */\n const text = escapeHTML(doc.text)\n .replace(/\\s+(?=[,.:;!?])/g, \"\")\n .replace(/\\s+/g, \" \")\n\n /* Handle section */\n if (hash) {\n const parent = documents.get(path) as ArticleDocument\n\n /* Ignore first section, override article */\n if (!parent.linked) {\n parent.title = doc.title\n parent.text = text\n parent.linked = true\n\n /* Add subsequent section */\n } else {\n documents.set(location, { location, title, text, parent })\n }\n\n /* Add article */\n } else {\n documents.set(location, { location, title, text, linked: false })\n }\n }\n return documents\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport * as escapeRegExp from \"escape-string-regexp\"\n\nimport { SearchIndexConfig } from \"../_\"\nimport { SearchDocument } from \"../document\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Search highlight function\n *\n * @template T - Search document type\n *\n * @param document - Search document\n *\n * @return Highlighted document\n */\nexport type SearchHighlightFn =\n (document: Readonly) => T\n\n/**\n * Search highlight factory function\n *\n * @param query - Query string\n *\n * @return Search highlight function\n */\nexport type SearchHighlightFactoryFn =\n (query: string) => SearchHighlightFn\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Create a search highlighter\n *\n * @param config - Search index configuration\n *\n * @return Search highlight factory function\n */\nexport function setupSearchHighlighter(\n config: SearchIndexConfig\n): SearchHighlightFactoryFn {\n const separator = new RegExp(config.separator, \"img\")\n const highlight = (_: unknown, data: string, term: string) => {\n return `${data}${term}`\n }\n\n /* Return factory function */\n return (query: string) => {\n query = query\n .replace(/[\\s*+-:~^]+/g, \" \")\n .trim()\n\n /* Create search term match expression */\n const match = new RegExp(`(^|${config.separator})(${\n escapeRegExp(query).replace(separator, \"|\")\n })`, \"img\")\n\n /* Highlight document */\n return document => ({\n ...document,\n title: document.title.replace(match, highlight),\n text: document.text.replace(match, highlight)\n })\n }\n}\n","/*\n * Copyright (c) 2016-2019 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A RTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { SearchIndex, SearchIndexConfig } from \"modules\"\n\nimport { SearchMessage, SearchMessageType } from \"../_\"\n\n/* ----------------------------------------------------------------------------\n * Data\n * ------------------------------------------------------------------------- */\n\n/**\n * Search index\n */\nlet index: SearchIndex\n\n/* ----------------------------------------------------------------------------\n * Helper functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Setup multi-language support through `lunr-languages`\n *\n * @param config - Search index configuration\n */\nfunction setupLunrLanguages(config: SearchIndexConfig): void {\n const base = \"../lunr\"\n\n /* Add scripts for languages */\n const scripts = [`${base}/lunr.stemmer.support.min.js`]\n for (const lang of config.lang) {\n if (lang === \"ja\") scripts.push(`${base}/tinyseg.js`)\n if (lang !== \"en\") scripts.push(`${base}/lunr.${lang}.min.js`)\n }\n\n /* Add multi-language support */\n if (scripts.length > 1)\n scripts.push(`${base}/lunr.multi.min.js`)\n\n /* Load scripts synchronously */\n importScripts(...scripts)\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Message handler\n *\n * @param message - Source message\n *\n * @return Target message\n */\nexport function handler(message: SearchMessage): SearchMessage {\n switch (message.type) {\n\n /* Setup search index */\n case SearchMessageType.SETUP:\n setupLunrLanguages(message.data.config)\n index = new SearchIndex(message.data)\n return {\n type: SearchMessageType.DUMP,\n data: index.toString()\n }\n\n /* Query search index */\n case SearchMessageType.QUERY:\n return {\n type: SearchMessageType.RESULT,\n data: index ? index.search(message.data) : []\n }\n\n /* All other messages */\n default:\n throw new TypeError(\"Invalid message type\")\n }\n}\n\n/* ----------------------------------------------------------------------------\n * Worker\n * ------------------------------------------------------------------------- */\n\nself.addEventListener(\"message\", ev => {\n self.postMessage(handler(ev.data))\n})\n"],"sourceRoot":""} \ No newline at end of file diff --git a/material/partials/language.html b/material/partials/language.html index d0314ffc9..b05ffd729 100644 --- a/material/partials/language.html +++ b/material/partials/language.html @@ -4,11 +4,5 @@ {% import "partials/language/" + config.theme.language + ".html" as lang %} {% import "partials/language/en.html" as fallback %} {% macro t(key) %}{{ { - "direction": config.theme.direction, - "search.language": ( - config.extra.search | default({}) - ).language, - "search.tokenizer": ( - config.extra.search | default({}) - ).tokenizer | default("", true), + "direction": config.theme.direction }[key] or lang.t(key) or fallback.t(key) }}{% endmacro %} diff --git a/src/assets/javascripts/index.ts b/src/assets/javascripts/index.ts index 36091b6cb..83f3fb4ab 100644 --- a/src/assets/javascripts/index.ts +++ b/src/assets/javascripts/index.ts @@ -70,7 +70,8 @@ import { watchWorker, setToggle, getElements, - watchMedia + watchMedia, + translate } from "./utilities" import { PackerMessage, diff --git a/src/assets/javascripts/modules/search/_/index.ts b/src/assets/javascripts/modules/search/_/index.ts index 2a8d158b6..e86efecc7 100644 --- a/src/assets/javascripts/modules/search/_/index.ts +++ b/src/assets/javascripts/modules/search/_/index.ts @@ -137,6 +137,13 @@ export class SearchIndex { if (pipeline.stopwords) this.pipeline.add(lunr.stopWordFilter) + /* Set up alternate search languages */ + if (config.lang.length === 1 && config.lang[0] !== "en") { + this.use((lunr as any)[config.lang[0]]) + } else if (config.lang.length > 1) { + this.use((lunr as any).multiLanguage(...config.lang)) + } + /* Setup fields and reference */ this.field("title", { boost: 10 }) this.field("text") diff --git a/src/partials/language.html b/src/partials/language.html index 3bb83f0bf..3d3d33980 100644 --- a/src/partials/language.html +++ b/src/partials/language.html @@ -28,11 +28,5 @@ {% macro t(key) %}{{ { - "direction": config.theme.direction, - "search.language": ( - config.extra.search | default({}) - ).language, - "search.tokenizer": ( - config.extra.search | default({}) - ).tokenizer | default("", true), + "direction": config.theme.direction }[key] or lang.t(key) or fallback.t(key) }}{% endmacro %}