npm - homebridge-config-ui-x - Versions diffs - 5.3.1-beta.12 → 5.3.1-beta.13 - Mend

homebridge-config-ui-x 5.3.1-beta.12 → 5.3.1-beta.13

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (94) hide show

package/public/assets/monaco/min-maps/vs/base/worker/workerMain.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"sources":["vs/base/worker/fake","vs/base/worker/vs/loader.js","vs/base/worker/file:/C:/Alex/src/vscode-standalone/out-editor-src/vs/base/common/arrays.ts","vs/base/worker/file:/C:/Alex/src/vscode-standalone/out-editor-src/vs/base/common/diff/diffChange.ts","vs/base/worker/file:/C:/Alex/src/vscode-standalone/out-editor-src/vs/base/common/errors.ts","vs/base/worker/file:/C:/Alex/src/vscode-standalone/out-editor-src/vs/base/common/iterator.ts","vs/base/worker/file:/C:/Alex/src/vscode-standalone/out-editor-src/vs/base/common/keyCodes.ts","vs/base/worker/file:/C:/Alex/src/vscode-standalone/out-editor-src/vs/base/common/lifecycle.ts","vs/base/worker/file:/C:/Alex/src/vscode-standalone/out-editor-src/vs/base/common/linkedList.ts","vs/base/worker/file:/C:/Alex/src/vscode-standalone/out-editor-src/vs/base/common/event.ts","vs/base/worker/file:/C:/Alex/src/vscode-standalone/out-editor-src/vs/base/common/cancellation.ts","vs/base/worker/file:/C:/Alex/src/vscode-standalone/out-editor-src/vs/base/common/platform.ts","vs/base/worker/file:/C:/Alex/src/vscode-standalone/out-editor-src/vs/base/common/process.ts","vs/base/worker/file:/C:/Alex/src/vscode-standalone/out-editor-src/vs/base/common/path.ts","vs/base/worker/file:/C:/Alex/src/vscode-standalone/out-editor-src/vs/base/common/strings.ts","vs/base/worker/file:/C:/Alex/src/vscode-standalone/out-editor-src/vs/base/common/hash.ts","vs/base/worker/file:/C:/Alex/src/vscode-standalone/out-editor-src/vs/base/common/diff/diff.ts","vs/base/worker/file:/C:/Alex/src/vscode-standalone/out-editor-src/vs/base/common/types.ts","vs/base/worker/file:/C:/Alex/src/vscode-standalone/out-editor-src/vs/base/common/uint.ts","vs/base/worker/file:/C:/Alex/src/vscode-standalone/out-editor-src/vs/base/common/uri.ts","vs/base/worker/file:/C:/Alex/src/vscode-standalone/out-editor-src/vs/base/common/worker/simpleWorker.ts","vs/base/worker/file:/C:/Alex/src/vscode-standalone/out-editor-src/vs/editor/common/core/characterClassifier.ts","vs/base/worker/file:/C:/Alex/src/vscode-standalone/out-editor-src/vs/editor/common/core/position.ts","vs/base/worker/file:/C:/Alex/src/vscode-standalone/out-editor-src/vs/editor/common/core/range.ts","vs/base/worker/file:/C:/Alex/src/vscode-standalone/out-editor-src/vs/editor/common/core/selection.ts","vs/base/worker/file:/C:/Alex/src/vscode-standalone/out-editor-src/vs/editor/common/core/token.ts","vs/base/worker/file:/C:/Alex/src/vscode-standalone/out-editor-src/vs/editor/common/diff/diffComputer.ts","vs/base/worker/file:/C:/Alex/src/vscode-standalone/out-editor-src/vs/editor/common/model/wordHelper.ts","vs/base/worker/file:/C:/Alex/src/vscode-standalone/out-editor-src/vs/editor/common/modes/linkComputer.ts","vs/base/worker/file:/C:/Alex/src/vscode-standalone/out-editor-src/vs/editor/common/modes/supports/inplaceReplaceSupport.ts","vs/base/worker/file:/C:/Alex/src/vscode-standalone/out-editor-src/vs/editor/common/standalone/standaloneEnums.ts","vs/base/worker/file:/C:/Alex/src/vscode-standalone/out-editor-src/vs/editor/common/standalone/standaloneBase.ts","vs/base/worker/file:/C:/Alex/src/vscode-standalone/out-editor-src/vs/editor/common/viewModel/prefixSumComputer.ts","vs/base/worker/file:/C:/Alex/src/vscode-standalone/out-editor-src/vs/editor/common/model/mirrorTextModel.ts","vs/base/worker/file:/C:/Alex/src/vscode-standalone/out-editor-src/vs/editor/common/services/editorSimpleWorker.ts","vs/base/worker/file:/C:/Alex/src/vscode-standalone/out-editor-src/vs/base/worker/workerMain.ts"],"names":["define","AMDLoader","__m","__M","deps","result","i","len","length","_amdLoaderGlobal","this","_commonjsGlobal","global","Environment","_detected","_isWindows","_isNode","_isElectronRenderer","_isWebWorker","Object","defineProperty","prototype","get","_detect","enumerable","configurable","module","exports","process","versions","electron","type","importScripts","navigator","userAgent","indexOf","platform","LoaderEvent","detail","timestamp","LoaderEventRecorder","loaderAvailableTimestamp","_events","record","push","Utilities","getHighPerformanceTimestamp","getEvents","NullLoaderEventRecorder","INSTANCE","fileUriToFilePath","isWindows","uri","decodeURI","replace","test","substr","startsWith","haystack","needle","endsWith","containsQueryString","url","isAbsolutePath","forEachProperty","obj","callback","key","hasOwnProperty","isEmpty","recursiveClone","RegExp","Array","isArray","value","generateAnonymousModule","NEXT_ANONYMOUS_ID","isAnonymousModule","id","PERFORMANCE_NOW_PROBED","HAS_PERFORMANCE_NOW","performance","now","Date","ensureError","err","Error","message","String","stack","ConfigurationOptionsUtil","validateConfigurationOptions","options","baseUrl","isBuild","paths","config","catchError","recordStats","urlArgs","onError","phase","console","error","moduleId","neededBy","ignoreDuplicateModules","cspNonce","preferScriptTags","nodeModules","nodeCachedData","seed","writeDelay","path","undefined","mergeConfigurationOptions","overwrite","base","concat","key2","value2","Configuration","env","_env","_createIgnoreDuplicateModulesMap","_createNodeModulesMap","_createSortedPathsRules","nodeRequire","main","filename","isNode","nodeMain","dirnameIndex","Math","max","lastIndexOf","substring","ignoreDuplicateModulesMap","nodeModulesMap","create","_i","_a","nodeModule","_this","sortedPathsRules","from","to","sort","a","b","cloneAndMerge","getOptionsLiteral","_applyPaths","pathRule","j","lenJ","_addUrlArgsToUrl","_addUrlArgsIfNecessaryToUrl","_addUrlArgsIfNecessaryToUrls","urls","moduleIdToPaths","amdModulesPattern","results","requireToUrl","isDuplicateMessageIgnoredFor","getConfigForModule","shouldCatchError","shouldRecordStats","OnlyOnceScriptLoader","_scriptLoader","_callbackMap","load","moduleManager","scriptSrc","errorback","isWebWorker","WorkerScriptLoader","isElectronRenderer","getConfig","BrowserScriptLoader","NodeScriptLoader","scriptCallbacks","triggerCallback","triggerErrorback","attachListeners","script","unbind","removeEventListener","loadEventListener","errorEventListener","e","addEventListener","pieces","split","moduleExports_1","enqueueDefineAnonymousModule","document","createElement","setAttribute","getElementsByTagName","appendChild","_didInitialize","_didPatchNodeRequire","_init","_fs","_vm","_path","_crypto","_initNodeRequire","that","Module","_compile","content","hashData","scriptSource","wrap","recorder","getRecorder","cachedDataPath","_getCachedDataPath","data","readFileSync","slice","cachedData","_e","Script","compileWrapper","runInThisContext","dirname","require","mod","constructor","resolve","request","_resolveFilename","mainModule","extensions","_extensions","cache","_cache","makeRequireFunction","args","Buffer","apply","_handleCachedData","_verifyCachedData","opts","nodeInstrumenter","c","moduleExports_2","normalizedScriptSrc_1","normalize","vmScriptPathOrUri_1","_getElectronRendererScriptPathOrUri","wantsCachedData_1","Boolean","cachedDataPath_1","_readSourceAndCachedData","charCodeAt","_BOM","_PREFIX","_SUFFIX","scriptOpts","_createAndEvalScript","contents","ret","globalDefineFunc","getGlobalAMDDefineFunc","receivedDefineCall","localDefineFunc","arguments","amd","call","getGlobalAMDRequireFunc","driveLetterMatch","match","toUpperCase","hash","createHash","update","digest","basename","join","createCachedData","cachedDataRejected","unlink","_createAndWriteCachedData","timeout","ceil","random","lastSize","iteration","createLoop","setTimeout","writeFile","pow","sourcePath","source_1","cachedData_1","hashData_1","steps_1","step_1","readFile","encoding","hashDataNow","equals","createScriptLoader","ModuleIdResolver","fromModuleId","lastSlash","fromModulePath","_normalizeModuleId","pattern","r","resolveModule","ROOT","strId","dependencies","moduleIdResolver","_callback","_errorback","exportsPassedIn","unresolvedDependenciesCount","_isComplete","_safeInvokeFunction","returnedValue","producedError","_invokeFactory","strModuleId","dependenciesValues","complete","onDependencyError","isComplete","ModuleIdProvider","_nextId","_strModuleIdToIntModuleId","Map","_intModuleIdToStrModuleId","getModuleId","getMaxModuleId","set","getStrModuleId","RegularDependency","EXPORTS","MODULE","REQUIRE","PluginDependency","pluginId","pluginParam","ModuleManager","scriptLoader","defineFunc","requireFunc","_loaderAvailableTimestamp","_defineFunc","_requireFunc","_moduleIdProvider","_config","_modules2","_knownModules2","_inverseDependencies2","_inversePluginDependencies2","_currentAnnonymousDefineCall","_recorder","_buildInfoPath","_buildInfoDefineStack","_buildInfoDependencies","reset","_findRelevantLocationInStack","str","normalizedPath","stackPieces","m","stackPath","stackLine","stackColumn","trimPathOffset","line","parseInt","col","getBuildInfo","resultLen","location_1","defineStack","defineLocation","shim","getLoaderEvents","defineModule","warn","_normalizeDependencies","map","dep","_resolve","_normalizeDependency","dependency","bangIndex","strPluginId","dependencyId","_relativeRequire","synchronousRequire","_strModuleId","configure","params","shouldOverwrite","oldShouldRecordStats","_onLoad","defineCall","_createLoadError","_err","intModuleId","_onLoadError","seenModuleId","someoneNotified","queue","queueElement","shift","inverseDeps","inverseDep","_hasDependencyPath","fromId","toId","inQueue","dependencyModule","_findCyclePath","depth","_createRequire","toUrl","getStats","__$__nodeRequire","_loadModule","lastPathIndex","loadNextPath","currentPath_1","recorder_1","_loadPluginDependency","plugin","pluginDependency","cyclePath","reverse","inversePluginDeps","_onModuleComplete","inverseDependencyId","inverseDependency","delete","DefineFunc","jQuery","_requireFunc_config","RequireFunc","init","_nodeRequire_1","what","doNotInitLoader","mergeSort","compare","_sort","lo","hi","aux","mid","leftIdx","rightIdx","_merge","firstIndex","array","fn","tail","n","tail2","arr","one","other","itemEquals","binarySearch","comparator","low","high","comp","findFirstInSorted","p","floor","groupBy","currentGroup","element","coalesce","filter","isFalsyOrEmpty","isNonEmptyArray","distinct","keyFn","position","seen","elem","distinctES6","Set","has","add","first","notFoundValue","index","firstOrDefault","flatten","range","arg","arrayInsert","target","insertIndex","insertArr","before","after","pushToStart","splice","unshift","pushToEnd","asArray","x","DiffChange","[object Object]","originalStart","originalLength","modifiedStart","modifiedLength","ErrorHandler","listeners","unexpectedErrorHandler","forEach","listener","emit","errorHandler","onUnexpectedError","isPromiseCanceledError","onUnexpectedExternalError","transformErrorForSerialization","name","$isError","stacktrace","canceledName","canceled","illegalArgument","illegalState","Iterable","is","thing","Symbol","iterator","_empty","freeze","empty","single","iterable","next","some","predicate","iterables","consume","atMost","Number","POSITIVE_INFINITY","consumed","done","KeyCodeStrMap","_keyCodeToStr","_strToKeyCode","keyCode","toLowerCase","uiMap","userSettingsUSMap","userSettingsGeneralMap","createSimpleKeybinding","keybinding","OS","ctrlCmd","winCtrl","SimpleKeybinding","uiLabel","usUserSettingsLabel","generalUserSettingsLabel","KeyCodeUtils","toString","keyCodeToStr","fromString","strToKeyCode","toUserSettingsUS","toUserSettingsGeneral","fromUserSettings","KeyChord","firstPart","secondPart","createKeybinding","chordPart","ChordKeybinding","ctrlKey","shiftKey","altKey","metaKey","parts","errors_1","ResolvedKeybindingPart","kbLabel","kbAriaLabel","keyLabel","keyAriaLabel","ResolvedKeybinding","TRACK_DISPOSABLES","__is_disposable_tracked__","markTracked","Disposable","None","trackDisposable","log","MultiDisposeError","errors","super","dispose","iterator_1","d","isDisposable","combinedDisposable","disposables","toDisposable","self","DisposableStore","_toDispose","_isDisposed","clear","values","t","DISABLE_DISPOSED_WARNING","_store","MutableDisposable","_value","ImmortalReference","object","Node","Undefined","prev","LinkedList","_first","_last","_size","size","_insert","atTheEnd","newNode","oldLast","oldFirst","didRemove","_remove","res","node","anchor","Event","once","event","thisArgs","didFire","snapshot","each","reduce","merge","initial","output","emitter","Emitter","fire","debounce","delay","leading","leakWarningThreshold","subscription","handle","numDebouncedCalls","cur","clearTimeout","_output","latch","firstCall","shouldEmit","lifecycle_1","signal","any","events","stopwatch","start","getTime","_","buffer","nextTick","_buffer","flush","ChainableEvent","chain","fromNodeEventEmitter","eventName","onFirstListenerAdd","on","onLastListenerRemove","removeListener","fromDOMEventEmitter","fromPromise","promise","then","toPromise","Promise","_globalLeakWarningThreshold","LeakageMonitor","customThreshold","_warnCountdown","_stacks","listenerCount","threshold","count","topStack","topCount","_disposed","_options","_leakageMon","_event","_listeners","linkedList_1","firstListener","remove","removeMonitor","onFirstListenerDidAdd","onListenerDidAdd","check","_noop","_deliveryQueue","PauseableEmitter","_isPaused","_eventQueue","_mergeFn","toArray","EventBufferer","buffers","pop","Relay","listening","inputEvent","inputEventListener","input","shortcutEvent","context","bind","CancellationToken","isCancellationToken","Cancelled","MutableToken","isCancellationRequested","onCancellationRequested","event_1","_isCancelled","_emitter","CancellationTokenSource","parent","_token","_parentListener","cancel","token","_isMacintosh","_isLinux","_isNative","_isWeb","_isIOS","_locale","_language","_translationsConfigFile","_userAgent","rawNlsConfig","nlsConfig","JSON","parse","resolved","availableLanguages","locale","maxTouchPoints","language","_platform","isMacintosh","isLinux","isNative","isWeb","isIOS","_globals","globals","setImmediate","postMessage","pending","vscodeSetImmediateId","candidate","lastId","myId","_promise","_isLittleEndian","_isLittleEndianComputed","isLittleEndian","Uint8Array","view","Uint16Array","safeProcess","cwd","platform_1","CHAR_UPPERCASE_A","CHAR_LOWERCASE_A","CHAR_UPPERCASE_Z","CHAR_LOWERCASE_Z","CHAR_DOT","CHAR_FORWARD_SLASH","CHAR_BACKWARD_SLASH","ErrorInvalidArgType","expected","actual","determiner","msg","code","validateString","isPathSeparator","isPosixPathSeparator","isWindowsDeviceRoot","normalizeString","allowAboveRoot","separator","lastSegmentLength","dots","lastSlashIndex","_format","sep","pathObject","dir","root","ext","win32","pathSegments","resolvedDevice","resolvedTail","resolvedAbsolute","rootEnd","device","isAbsolute","last","joined","needsReplace","slashCount","firstLen","fromOrig","toOrig","fromStart","fromEnd","fromLen","toStart","toEnd","toLen","lastCommonSep","fromCode","out","resolvedPath","offset","end","matchedSlash","extIdx","firstNonSlashEnd","startDot","startPart","preDotState","format","delimiter","posix","trailingSeparator","toNamespacedPath","hasRoot","relative","extname","isFalsyOrWhitespace","trim","pad","l","char","_formatRegexp","escapeRegExpCharacters","ltrim","needleLen","rtrim","haystackLen","idx","compareSubstring","aStart","aEnd","bStart","bEnd","codeA","codeB","aLen","bLen","compareSubstringIgnoreCase","diff","isUpperAsciiLetter","isLowerAsciiLetter","isAsciiLetter","doEqualsIgnoreCase","stopAt","abs","fromCharCode","isHighSurrogate","charCode","isLowSurrogate","computeCodePoint","highSurrogate","lowSurrogate","getNextCodePoint","nextCharCode","getPrevCodePoint","prevCharCode","group","isNaN","escape","html","convertSimple2RegExpPattern","stripWildcards","createRegExp","searchString","isRegex","wholeWord","charAt","modifiers","matchCase","multiline","unicode","regExpLeadsToEndlessLoop","regexp","source","exec","lastIndex","regExpFlags","ignoreCase","firstNonWhitespaceIndex","chCode","getLeadingWhitespace","lastNonWhitespaceIndex","startIndex","compareIgnoreCase","equalsIgnoreCase","startsWithIgnoreCase","candidateLength","commonPrefixLength","min","commonSuffixLength","aLastIndex","bLastIndex","nextCharLength","graphemeBreakTree","GraphemeBreakTree","getInstance","initialOffset","initialCodePoint","graphemeBreakType","getGraphemeBreakType","nextCodePoint","nextGraphemeBreakType","breakBetweenGraphemeBreakType","prevCharLength","prevCodePoint","prevGraphemeBreakType","decodeUTF8","byteLength","v0","codePoint","uPrime","w1","w2","CONTAINS_RTL","containsRTL","CONTAINS_EMOJI","containsEmoji","IS_BASIC_ASCII","isFullWidthCharacter","breakTypeA","breakTypeB","isBasicASCII","UNUSUAL_LINE_TERMINATORS","containsUnusualLineTerminators","containsFullWidthCharacter","isEmojiImprecise","UTF8_BOM_CHARACTER","startsWithUTF8BOM","containsUppercaseCharacter","ignoreEscapedChars","singleLetterHash","_data","_INSTANCE","nodeCount","nodeIndex","doHash","hashVal","numberHash","initialHashVal","item","keys","stringHash","objectHash","booleanHash","val","s","leftRotate","bits","totalBits","delta","fill","dest","toHexString","bitsize","leftPad","StringSHA1","_h0","_h1","_h2","_h3","_h4","_buff","_buffDV","DataView","_buffLen","_totalLen","_leftoverHighSurrogate","_finished","strLen","buff","buffLen","leftoverHighSurrogate","strings","_push","_step","_wrapUp","ml","setUint32","bigBlock32","_bigBlock32","getUint32","f","k","temp","ArrayBuffer","StringDiffSequence","characters","Int32Array","stringDiff","original","modified","pretty","LcsDiff","ComputeDiff","changes","Debug","condition","MyArray","sourceArray","sourceIndex","destinationArray","destinationIndex","DiffChangeHelper","m_changes","m_originalStart","m_modifiedStart","m_originalCount","m_modifiedCount","diffChange_1","originalIndex","modifiedIndex","MarkNextChange","originalSequence","modifiedSequence","continueProcessingPredicate","ContinueProcessingPredicate","originalStringElements","originalElementsOrHash","originalHasStrings","_getElements","modifiedStringElements","modifiedElementsOrHash","modifiedHasStrings","_hasStrings","_originalStringElements","_originalElementsOrHash","_modifiedStringElements","_modifiedElementsOrHash","m_forwardHistory","m_reverseHistory","sequence","elements","getElements","_isStringArray","hashes","hash_1","newIndex","index1","index2","_ComputeDiff","originalEnd","modifiedEnd","quitEarlyArr","ComputeDiffRecursive","PrettifyChanges","quitEarly","ElementsAreEqual","Assert","midOriginalArr","midModifiedArr","ComputeRecursionPoint","midOriginal","midModified","leftChanges","rightChanges","ConcatenateChanges","diagonalForwardBase","diagonalForwardStart","diagonalForwardEnd","diagonalForwardOffset","diagonalReverseBase","diagonalReverseStart","diagonalReverseEnd","diagonalReverseOffset","forwardPoints","reversePoints","deltaIsEven","forwardChanges","reverseChanges","changeHelper","diagonalMin","diagonalMax","diagonalRelative","lastOriginalIndex","historyIndex","diagonal","AddModifiedElement","AddOriginalElement","getReverseChanges","originalStartPoint","modifiedStartPoint","lastForwardChange","getOriginalEnd","getModifiedEnd","getChanges","maxDifferences","numDiagonals","numDifferences","furthestOriginalIndex","furthestModifiedIndex","ClipDiagonalBound","tempOriginalIndex","WALKTRACE","matchLengthOfLongest","Copy2","change","originalStop","modifiedStop","checkOriginal","checkModified","OriginalElementsAreEqual","ModifiedElementsAreEqual","mergedChangeArr","ChangesOverlap","prevChange","bestDelta","bestScore","_boundaryScore","score","_OriginalIsBoundary","_ModifiedIsBoundary","_OriginalRegionIsBoundary","_ModifiedRegionIsBoundary","left","right","Copy","diagonalBaseIndex","diffEven","isString","isUndefined","isUndefinedOrNull","isFunction","validateConstraint","constraint","getAllPropertyNames","proto","getPrototypeOf","getOwnPropertyNames","isObject","isNumber","isBoolean","assertType","assertIsDefined","validateConstraints","constraints","getAllMethodNames","methods","prop","createProxyObject","methodNames","invoke","createProxyMethod","method","methodName","withNullAsUndefined","toUint8","v","toUint32","_schemePattern","_singleSlashStart","_doubleSlashStart","_slash","_regexp","URI","schemeOrData","authority","query","fragment","_strict","scheme","_schemeFix","_referenceResolution","_validateUri","fsPath","with","uriToFsPath","Uri","percentDecode","components","pathFragment","newPath","file","skipEncoding","_asFormatted","_formatted","external","_fsPath","_sep","_pathSepMarker","$mid","encodeTable","58","47","63","35","91","93","64","33","36","38","39","40","41","42","43","44","59","61","32","encodeURIComponentFast","uriComponent","allowSlash","nativeEncodePos","pos","encodeURIComponent","escaped","encodeURIComponentMinimal","keepDriveLetterCasing","encoder","userinfo","_rEncodedAsHex","decodeURIComponentGraceful","decodeURIComponent","INITIALIZE","webWorkerWarningLogged","logOnceWebWorkerWarning","SimpleWorkerProtocol","handler","_workerId","_handler","_lastSentReq","_pendingReplies","workerId","req","reject","_send","vsWorker","_handleMessage","seq","replyMessage","reply","requestMessage","handleMessage","transfer","sendMessage","SimpleWorkerClient","workerFactory","host","lazyProxyReject","_worker","_register","_protocol","setWorkerId","getId","loaderConfiguration","requirejs","contexts","hostMethods","types","_onModuleLoaded","stringify","proxyMethodRequest","_request","_lazyProxy","availableMethods","_onError","info","SimpleWorkerServer","requestHandlerFactory","_requestHandlerFactory","_requestHandler","initialize","loaderConfig","hostProxy","vs","CharacterClassifier","_defaultValue","defaultValue","uint_1","_asciiMap","_createAsciiMap","_map","asciiMap","CharacterSet","_actual","Position","lineNumber","column","newLineNumber","newColumn","deltaLineNumber","deltaColumn","isBefore","isBeforeOrEqual","aLineNumber","bLineNumber","Range","startLineNumber","startColumn","endLineNumber","endColumn","containsPosition","containsRange","otherRange","strictContainsRange","plusRange","intersectRanges","resultStartLineNumber","resultStartColumn","resultEndLineNumber","resultEndColumn","otherStartLineNumber","otherStartColumn","otherEndLineNumber","otherEndColumn","equalsRange","getEndPosition","position_1","getStartPosition","collapseToStart","aStartLineNumber","bStartLineNumber","aStartColumn","bStartColumn","aEndLineNumber","bEndLineNumber","Selection","range_1","selectionStartLineNumber","selectionStartColumn","positionLineNumber","positionColumn","selectionsEqual","getDirection","sel","direction","Token","TokenizationResult","tokens","endState","TokenizationResult2","MINIMUM_MATCHING_CHARACTER_LENGTH","computeDiff","diff_1","LineSequence","lines","startColumns","endColumns","getFirstNonBlankColumn","getLastNonBlankColumn","_startColumns","_endColumns","shouldIgnoreTrimWhitespace","endIndex","charCodes","lineNumbers","columns","lineContent","CharSequence","_charCodes","_lineNumbers","_columns","CharChange","originalStartLineNumber","originalStartColumn","originalEndLineNumber","originalEndColumn","modifiedStartLineNumber","modifiedStartColumn","modifiedEndLineNumber","modifiedEndColumn","diffChange","originalCharSequence","modifiedCharSequence","getStartLineNumber","getStartColumn","getEndLineNumber","getEndColumn","LineChange","charChanges","originalLineSequence","modifiedLineSequence","continueCharDiff","shouldComputeCharChanges","shouldPostProcessCharChanges","createCharSequence","rawChanges","currChange","originalMatchingLength","modifiedMatchingLength","postProcessCharChanges","createFromDiffChange","txt","createContinueProcessingPredicate","maximumRuntime","startTime","DiffComputer","originalLines","modifiedLines","shouldMakePrettyDiff","continueLineDiff","maxComputationTime","diffResult","lineChanges","createFromDiffResult","originalLineIndex","modifiedLineIndex","nextChange","originalLine","modifiedLine","_pushTrimWhitespaceCharChange","originalMaxColumn","modifiedMaxColumn","originalLineNumber","modifiedLineNumber","_mergeTrimWhitespaceCharChange","USUAL_WORD_SEPARATORS","DEFAULT_WORD_REGEXP","allowInWords","createWordRegExp","ensureValidWordDefinition","wordDefinition","flags","_defaultConfig","maxLen","windowSize","timeBudget","_findRegexMatchEnclosingPosition","text","stopPos","matchIndex","getWordAtText","textOffset","prevRegexIndex","regexIndex","thisMatch","word","Uint8Matrix","rows","cols","row","StateMachine","edges","maxCharCode","maxState","states","_states","_maxCharCode","currentState","_stateMachine","_classifier","LinkComputer","classifier","linkBeginIndex","linkEndIndex","lastIncludedCharIndex","charCodeBeforeLink","lastCharCodeInLink","model","stateMachine","characterClassifier_1","FORCE_TERMINATION_CHARACTERS","CANNOT_END_WITH_CHARACTERS","getClassifier","lineCount","getLineCount","getLineContent","linkBeginChCode","state","hasOpenParens","hasOpenSquareBracket","inSquareBrackets","hasOpenCurlyBracket","resetStateMachine","chClass","_createLink","nextState","computeLinks","BasicInplaceReplace","_defaultValueSet","range1","text1","range2","text2","up","doNavigateValueSet","numberResult","numberReplace","textReplace","precision","n1","n2","parseFloat","valueSetsReplace","valueSets","valueSetReplace","valueSet","AccessibilitySupport","CompletionItemInsertTextRule","CompletionItemKind","CompletionItemTag","CompletionTriggerKind","ContentWidgetPositionPreference","CursorChangeReason","DefaultEndOfLine","DocumentHighlightKind","EditorAutoIndentStrategy","EditorOption","EndOfLinePreference","EndOfLineSequence","IndentAction","KeyCode","MarkerSeverity","MarkerTag","MinimapPosition","MouseTargetType","OverlayWidgetPositionPreference","OverviewRulerLane","RenderLineNumbersType","RenderMinimap","ScrollType","ScrollbarVisibility","SelectionDirection","SignatureHelpTriggerKind","SymbolKind","SymbolTag","TextEditorCursorBlinkingStyle","TextEditorCursorStyle","TrackedRangeStickiness","WrappingIndent","KeyMod","keyCodes_1","CtrlCmd","Shift","Alt","WinCtrl","createMonacoBaseAPI","editor","languages","cancellation_1","standaloneEnums","selection_1","uri_1","token_1","PrefixSumIndexOfResult","remainder","PrefixSumComputer","prefixSum","Uint32Array","prefixSumValidIndex","insertValues","oldValues","oldPrefixSum","insertValuesLen","subarray","cnt","maxCnt","_getAccumulatedValue","accumulatedValue","getTotalValue","midStop","midStart","MirrorTextModel","eol","versionId","_uri","_lines","_eol","_versionId","_lineStarts","_cachedTextValue","_acceptDeleteRange","_acceptInsertText","eolLength","linesLength","lineStartValues","prefixSumComputer_1","lineIndex","newValue","changeValue","_setLineText","removeValues","insertText","insertLines","newLengths","MirrorModel","mirrorTextModel_1","version","getText","wordAtText","wordHelper_1","wordenize","_wordenize","lineText","wordRangesIdx","wordRanges","ranges","words","_validateRange","lineEnding","startLineIndex","endLineIndex","resultLines","_validatePosition","_ensureLineStarts","getAccumulatedValue","getIndexOf","lineLength","isIPosition","hasChanged","maxCharacter","EditorSimpleWorker","foreignModuleFactory","_host","_models","_foreignModuleFactory","_foreignModule","all","EOL","strURL","onEvents","originalUrl","modifiedUrl","ignoreTrimWhitespace","_getModel","getLinesContent","diffComputer_1","identical","_modelsAreIdentical","originalLineCount","modelUrl","edits","lastEol","arrays_1","compareRangesUsingStarts","getValueInRange","_diffLimit","editOffset","offsetAt","lift","positionAt","newEdit","linkComputer_1","wordDef","wordDefFlags","wordDefRegExp","wordAt","getWordAtPosition","_suggestionsLimit","getLineWords","selectionText","wordRange","inplaceReplaceSupport_1","navigateValueSet","createData","foreignHostMethods","ctx","fhr","getMirrorModels","_getModels","foreignModule","monaco","standaloneBase_1","MonacoEnvironment","monacoBaseUrl","isFirstMessage","beforeReadyMessages","onmessage","ws","messageHandler","loadCode"],"mappings":";;;;;;CAAA;AACA,IC6sDAA,EACAC,ED9sDAC,EAAA,CAAA,UAAA,UAAA,iCAAA,0BAAA,wBAAA,8BAAA,2BAAA,uBAAA,yBAAA,2BAAA,uBAAA,sBAAA,qBAAA,wBAAA,iCAAA,0BAAA,0BAAA,4BAAA,8BAAA,yBAAA,sBAAA,sBAAA,4CAAA,kCAAA,8BAAA,qCAAA,oCAAA,sCAAA,wDAAA,8CAAA,6CAAA,+CAAA,yCAAA,qCAAA,gDACAC,EAAA,SAAAC;AAEA,IADA,IAAAC,EAAA,GACAC,EAAA,EAAAC,EAAAH,EAAAI,OAAAF,EAAAC,EAAAD,IACAD,EAAAC,GAAAJ,EAAAE,EAAAE,IAEA,OAAAD,GCaAI,EAAAC,KACAC,EAAA,iBAAAC,OAAAA,OAAA,IAEA,SAAAX,GACAA,EAAAW,OAAAH,EACA,IAAAI,EAAA,WACA,SAAAA,IACAH,KAAAI,WAAA,EACAJ,KAAAK,YAAA,EACAL,KAAAM,SAAA,EACAN,KAAAO,qBAAA,EACAP,KAAAQ,cAAA,EAuDA,OArDAC,OAAAC,eAAAP,EAAAQ,UAAA,YAAA,CACAC,IAAA,WAEA,OADAZ,KAAAa,UACAb,KAAAK,YAEAS,YAAA,EACAC,cAAA,IAEAN,OAAAC,eAAAP,EAAAQ,UAAA,SAAA,CACAC,IAAA,WAEA,OADAZ,KAAAa,UACAb,KAAAM,SAEAQ,YAAA,EACAC,cAAA,IAEAN,OAAAC,eAAAP,EAAAQ,UAAA,qBAAA,CACAC,IAAA,WAEA,OADAZ,KAAAa,UACAb,KAAAO,qBAEAO,YAAA,EACAC,cAAA,IAEAN,OAAAC,eAAAP,EAAAQ,UAAA,cAAA,CACAC,IAAA,WAEA,OADAZ,KAAAa,UACAb,KAAAQ,cAEAM,YAAA,EACAC,cAAA,IAEAZ,EAAAQ,UAAAE,QAAA,WACAb,KAAAI,YAGAJ,KAAAI,WAAA,EACAJ,KAAAK,WAAAF,EAAAE,aACAL,KAAAM,QAAA,oBAAAU,UAAAA,OAAAC;AACAjB,KAAAO,oBAAA,oBAAAW,cAAA,IAAAA,QAAAC,eAAA,IAAAD,QAAAC,SAAAC,UAAA,aAAAF,QAAAG,KACArB,KAAAQ,aAAA,mBAAAjB,EAAAW,OAAAoB,gBAEAnB,EAAAE,WAAA,WACA,SAAA,oBAAAkB,WACAA,UAAAC,WAAAD,UAAAC,UAAAC,QAAA,YAAA,IAIA,oBAAAP,SACA,UAAAA,QAAAQ,UAIAvB,EA7DA,GA+DAZ,EAAAY,YAAAA,EAjEA,CAkEAZ,IAAAA,EAAA,KAMA,SAAAA,GACA,IAAAoC,EACA,SAAAN,EAAAO,EAAAC,GACA7B,KAAAqB,KAAAA,EACArB,KAAA4B,OAAAA,EACA5B,KAAA6B,UAAAA,GAIAtC,EAAAoC,YAAAA,EACA,IAAAG,EAAA,WACA,SAAAA,EAAAC,GACA/B,KAAAgC,QAAA,CAAA,IAAAL,EAAA,EAAA,GAAAI,IAQA,OANAD,EAAAnB,UAAAsB,OAAA,SAAAZ,EAAAO,GACA5B,KAAAgC,QAAAE,KAAA,IAAAP,EAAAN,EAAAO,EAAArC,EAAA4C,UAAAC,iCAEAN,EAAAnB,UAAA0B,UAAA,WACA,OAAArC,KAAAgC,SAEAF,EAVA,GAYAvC,EAAAuC,oBAAAA,EACA,IAAAQ,EAAA,WACA,SAAAA,KASA,OAPAA,EAAA3B,UAAAsB,OAAA,SAAAZ,EAAAO,KAGAU,EAAA3B,UAAA0B,UAAA,WACA,MAAA,IAEAC,EAAAC,SAAA,IAAAD,EACAA,EAVA,GAYA/C,EAAA+C,wBAAAA,EAnCA,CAoCA/C,IAAAA,EAAA,KAMA,SAAAA,GACA,IAAA4C,EAAA,WACA,SAAAA;AAwFA,OAnFAA,EAAAK,kBAAA,SAAAC,EAAAC,GAEA,GADAA,EAAAC,UAAAD,GAAAE,QAAA,OAAA,KACAH,EAAA,CACA,GAAA,eAAAI,KAAAH,GAEA,OAAAA,EAAAI,OAAA,GAEA,GAAA,aAAAD,KAAAH,GACA,OAAAA,EAAAI,OAAA,QAIA,GAAA,aAAAD,KAAAH,GACA,OAAAA,EAAAI,OAAA,GAIA,OAAAJ,GAEAP,EAAAY,WAAA,SAAAC,EAAAC,GACA,OAAAD,EAAAlD,QAAAmD,EAAAnD,QAAAkD,EAAAF,OAAA,EAAAG,EAAAnD,UAAAmD,GAEAd,EAAAe,SAAA,SAAAF,EAAAC,GACA,OAAAD,EAAAlD,QAAAmD,EAAAnD,QAAAkD,EAAAF,OAAAE,EAAAlD,OAAAmD,EAAAnD,UAAAmD,GAGAd,EAAAgB,oBAAA,SAAAC,GACA,MAAA,cAAAP,KAAAO,IAKAjB,EAAAkB,eAAA,SAAAD,GACA,MAAA,+CAAAP,KAAAO,IAEAjB,EAAAmB,gBAAA,SAAAC,EAAAC,GACA,GAAAD,EAAA,CACA,IAAAE,OAAA,EACA,IAAAA,KAAAF,EACAA,EAAAG,eAAAD,IACAD,EAAAC,EAAAF,EAAAE,MAKAtB,EAAAwB,QAAA,SAAAJ,GACA,IAAAI,GAAA,EAIA,OAHAxB,EAAAmB,gBAAAC,GAAA,WACAI,GAAA,KAEAA,GAEAxB,EAAAyB,eAAA,SAAAL,GACA,IAAAA,GAAA,iBAAAA,GAAAA,aAAAM,OACA,OAAAN,EAEA,IAAA5D,EAAAmE,MAAAC,QAAAR,GAAA,GAAA,GASA,OARApB,EAAAmB,gBAAAC,GAAA,SAAAE,EAAAO,GAEArE,EAAA8D,GADAO,GAAA,iBAAAA,EACA7B,EAAAyB,eAAAI,GAGAA,KAGArE,GAEAwC,EAAA8B,wBAAA,WACA,MAAA,eAAA9B,EAAA+B,oBAAA;AAEA/B,EAAAgC,kBAAA,SAAAC,GACA,OAAAjC,EAAAY,WAAAqB,EAAA,iBAEAjC,EAAAC,4BAAA,WAKA,OAJApC,KAAAqE,yBACArE,KAAAqE,wBAAA,EACArE,KAAAsE,oBAAA/E,EAAAW,OAAAqE,aAAA,mBAAAhF,EAAAW,OAAAqE,YAAAC,KAEAxE,KAAAsE,oBAAA/E,EAAAW,OAAAqE,YAAAC,MAAAC,KAAAD,OAEArC,EAAA+B,kBAAA,EACA/B,EAAAkC,wBAAA,EACAlC,EAAAmC,qBAAA,EACAnC,EAzFA,GA2FA5C,EAAA4C,UAAAA,EA5FA,CA6FA5C,IAAAA,EAAA,KAMA,SAAAA,GACA,SAAAmF,EAAAC,GACA,GAAAA,aAAAC,MACA,OAAAD,EAEA,IAAAhF,EAAA,IAAAiF,MAAAD,EAAAE,SAAAC,OAAAH,IAAA,iBAIA,OAHAA,EAAAI,QACApF,EAAAoF,MAAAJ,EAAAI,OAEApF,EAEAJ,EAAAmF,YAAAA,EAEA,IAAAM,EAAA,WACA,SAAAA,KAmGA,OA9FAA,EAAAC,6BAAA,SAAAC,GAyDA,GAzCA,iBADAA,EAAAA,GAAA,IACAC,UACAD,EAAAC,QAAA,IAEA,kBAAAD,EAAAE,UACAF,EAAAE,SAAA,GAEA,iBAAAF,EAAAG,QACAH,EAAAG,MAAA,IAEA,iBAAAH,EAAAI,SACAJ,EAAAI,OAAA,SAEA,IAAAJ,EAAAK,aACAL,EAAAK,YAAA,QAEA,IAAAL,EAAAM,cACAN,EAAAM,aAAA,GAEA,iBAAAN,EAAAO,UACAP,EAAAO,QAAA;AAEA,mBAAAP,EAAAQ,UACAR,EAAAQ,QArCA,SAAAf,GACA,MAAA,YAAAA,EAAAgB,OACAC,QAAAC,MAAA,YAAAlB,EAAAmB,SAAA,YACAF,QAAAC,MAAAlB,GACAiB,QAAAC,MAAA,gDACAD,QAAAC,MAAAlB,EAAAoB,WAGA,YAAApB,EAAAgB,OACAC,QAAAC,MAAA,0BAAAlB,EAAAmB,SAAA,kCACAF,QAAAC,MAAAlB,SAFA,IA+BAb,MAAAC,QAAAmB,EAAAc,0BACAd,EAAAc,uBAAA,IAEAd,EAAAC,QAAArF,OAAA,IACAP,EAAA4C,UAAAe,SAAAgC,EAAAC,QAAA,OACAD,EAAAC,SAAA,MAGA,iBAAAD,EAAAe,WACAf,EAAAe,SAAA,SAEA,IAAAf,EAAAgB,mBACAhB,EAAAgB,kBAAA,GAEApC,MAAAC,QAAAmB,EAAAiB,eACAjB,EAAAiB,YAAA,IAEAjB,EAAAkB,gBAAA,iBAAAlB,EAAAkB,iBACA,iBAAAlB,EAAAkB,eAAAC,OACAnB,EAAAkB,eAAAC,KAAA,SAEA,iBAAAnB,EAAAkB,eAAAE,YAAApB,EAAAkB,eAAAE,WAAA,KACApB,EAAAkB,eAAAE,WAAA,MAEApB,EAAAkB,eAAAG,MAAA,iBAAArB,EAAAkB,eAAAG,MAAA;AACA,IAAA5B,EAAAD,EAAA,IAAAE,MAAA,0DACAD,EAAAgB,MAAA,gBACAT,EAAAQ,QAAAf,GACAO,EAAAkB,oBAAAI,EAGA,OAAAtB,GAEAF,EAAAyB,0BAAA,SAAAC,EAAAC,QACA,IAAAD,IAAAA,EAAA,WACA,IAAAC,IAAAA,EAAA,MACA,IAAAhH,EAAAJ,EAAA4C,UAAAyB,eAAA+C,GAAA,IAgBA,OAdApH,EAAA4C,UAAAmB,gBAAAoD,GAAA,SAAAjD,EAAAO,GACA,2BAAAP,QAAA,IAAA9D,EAAAqG,uBACArG,EAAAqG,uBAAArG,EAAAqG,uBAAAY,OAAA5C,GAEA,UAAAP,QAAA,IAAA9D,EAAA0F,MACA9F,EAAA4C,UAAAmB,gBAAAU,GAAA,SAAA6C,EAAAC,GAAA,OAAAnH,EAAA0F,MAAAwB,GAAAC,KAEA,WAAArD,QAAA,IAAA9D,EAAA2F,OACA/F,EAAA4C,UAAAmB,gBAAAU,GAAA,SAAA6C,EAAAC,GAAA,OAAAnH,EAAA2F,OAAAuB,GAAAC,KAGAnH,EAAA8D,GAAAlE,EAAA4C,UAAAyB,eAAAI,MAGAgB,EAAAC,6BAAAtF,IAEAqF,EApGA,GAsGAzF,EAAAyF,yBAAAA,EACA,IAAA+B,EAAA,WACA,SAAAA,EAAAC,EAAA9B,GAMA,GALAlF,KAAAiH,KAAAD,EACAhH,KAAAkF,QAAAF,EAAAyB,0BAAAvB,GACAlF,KAAAkH,mCACAlH,KAAAmH,wBACAnH,KAAAoH,0BACA,KAAApH,KAAAkF,QAAAC,QAAA;AACA,GAAAnF,KAAAkF,QAAAmC,aAAArH,KAAAkF,QAAAmC,YAAAC,MAAAtH,KAAAkF,QAAAmC,YAAAC,KAAAC,UAAAvH,KAAAiH,KAAAO,OAAA,CACA,IAAAC,EAAAzH,KAAAkF,QAAAmC,YAAAC,KAAAC,SACAG,EAAAC,KAAAC,IAAAH,EAAAI,YAAA,KAAAJ,EAAAI,YAAA,OACA7H,KAAAkF,QAAAC,QAAAsC,EAAAK,UAAA,EAAAJ,EAAA,GAEA,GAAA1H,KAAAkF,QAAAuC,UAAAzH,KAAAiH,KAAAO,OAAA,CACAC,EAAAzH,KAAAkF,QAAAuC,SACAC,EAAAC,KAAAC,IAAAH,EAAAI,YAAA,KAAAJ,EAAAI,YAAA,OACA7H,KAAAkF,QAAAC,QAAAsC,EAAAK,UAAA,EAAAJ,EAAA,KAwLA,OApLAX,EAAApG,UAAAuG,iCAAA,WAEAlH,KAAA+H,0BAAA,GACA,IAAA,IAAAnI,EAAA,EAAAA,EAAAI,KAAAkF,QAAAc,uBAAAlG,OAAAF,IACAI,KAAA+H,0BAAA/H,KAAAkF,QAAAc,uBAAApG,KAAA,GAGAmH,EAAApG,UAAAwG,sBAAA,WAEAnH,KAAAgI,eAAAvH,OAAAwH,OAAA,MACA,IAAA,IAAAC,EAAA,EAAAC,EAAAnI,KAAAkF,QAAAiB,YAAA+B,EAAAC,EAAArI,OAAAoI,IAAA,CACA,IAAAE,EAAAD,EAAAD,GACAlI,KAAAgI,eAAAI,IAAA,IAGArB,EAAApG,UAAAyG,wBAAA,WACA,IAAAiB,EAAArI,KAGAA,KAAAsI,iBAAA,GACA/I,EAAA4C,UAAAmB,gBAAAtD,KAAAkF,QAAAG,OAAA,SAAAkD,EAAAC,GACA1E,MAAAC,QAAAyE,GAOAH,EAAAC,iBAAApG,KAAA,CACAqG,KAAAA;AACAC,GAAAA,IARAH,EAAAC,iBAAApG,KAAA,CACAqG,KAAAA,EACAC,GAAA,CAAAA,QAUAxI,KAAAsI,iBAAAG,MAAA,SAAAC,EAAAC,GACA,OAAAA,EAAAJ,KAAAzI,OAAA4I,EAAAH,KAAAzI,WAQAiH,EAAApG,UAAAiI,cAAA,SAAA1D,GACA,OAAA,IAAA6B,EAAA/G,KAAAiH,KAAAjC,EAAAyB,0BAAAvB,EAAAlF,KAAAkF,WAKA6B,EAAApG,UAAAkI,kBAAA,WACA,OAAA7I,KAAAkF,SAEA6B,EAAApG,UAAAmI,YAAA,SAAAhD,GAEA,IADA,IAAAiD,EACAnJ,EAAA,EAAAC,EAAAG,KAAAsI,iBAAAxI,OAAAF,EAAAC,EAAAD,IAEA,GADAmJ,EAAA/I,KAAAsI,iBAAA1I,GACAL,EAAA4C,UAAAY,WAAA+C,EAAAiD,EAAAR,MAAA,CAEA,IADA,IAAA5I,EAAA,GACAqJ,EAAA,EAAAC,EAAAF,EAAAP,GAAA1I,OAAAkJ,EAAAC,EAAAD,IACArJ,EAAAuC,KAAA6G,EAAAP,GAAAQ,GAAAlD,EAAAhD,OAAAiG,EAAAR,KAAAzI,SAEA,OAAAH,EAGA,MAAA,CAAAmG,IAEAiB,EAAApG,UAAAuI,iBAAA,SAAA9F,GACA,OAAA7D,EAAA4C,UAAAgB,oBAAAC,GACAA,EAAA,IAAApD,KAAAkF,QAAAO,QAGArC,EAAA,IAAApD,KAAAkF,QAAAO,SAGAsB,EAAApG,UAAAwI,4BAAA,SAAA/F,GACA,OAAApD,KAAAkF,QAAAO,QACAzF,KAAAkJ,iBAAA9F,GAEAA,GAEA2D,EAAApG,UAAAyI,6BAAA,SAAAC,GACA,GAAArJ,KAAAkF,QAAAO,QACA,IAAA,IAAA7F,EAAA,EAAAC,EAAAwJ,EAAAvJ,OAAAF,EAAAC,EAAAD,IACAyJ,EAAAzJ,GAAAI,KAAAkJ,iBAAAG,EAAAzJ,IAGA,OAAAyJ,GAKAtC,EAAApG,UAAA2I,gBAAA,SAAAxD;AAGA,IAFA,IAAA9F,KAAAgI,eAAAlC,IACA9F,KAAAkF,QAAAqE,6BAAA1F,SAAA7D,KAAAkF,QAAAqE,kBAAA1G,KAAAiD,GAGA,OAAA9F,KAAAoF,UAEA,CAAA,UAIA,CAAA,QAAAU,GAGA,IACA0D,EADA7J,EAAAmG,EAEA,GAAAvG,EAAA4C,UAAAe,SAAAvD,EAAA,QAAAJ,EAAA4C,UAAAkB,eAAA1D,GAeAJ,EAAA4C,UAAAe,SAAAvD,EAAA,QAAAJ,EAAA4C,UAAAgB,oBAAAxD,KACAA,GAAA,OAEA6J,EAAA,CAAA7J,QAhBA,IAAA,IAAAC,EAAA,EAAAC,GADA2J,EAAAxJ,KAAA8I,YAAAnJ,IACAG,OAAAF,EAAAC,EAAAD,IACAI,KAAAoF,WAAA,WAAAoE,EAAA5J,KAGAL,EAAA4C,UAAAkB,eAAAmG,EAAA5J,MACA4J,EAAA5J,GAAAI,KAAAkF,QAAAC,QAAAqE,EAAA5J,IAEAL,EAAA4C,UAAAe,SAAAsG,EAAA5J,GAAA,QAAAL,EAAA4C,UAAAgB,oBAAAqG,EAAA5J,MACA4J,EAAA5J,GAAA4J,EAAA5J,GAAA,QAUA,OAAAI,KAAAoJ,6BAAAI,IAKAzC,EAAApG,UAAA8I,aAAA,SAAArG,GACA,IAAAzD,EAAAyD,EAOA,OANA7D,EAAA4C,UAAAkB,eAAA1D,KACAA,EAAAK,KAAA8I,YAAAnJ,GAAA,GACAJ,EAAA4C,UAAAkB,eAAA1D,KACAA,EAAAK,KAAAkF,QAAAC,QAAAxF,IAGAK,KAAAmJ,4BAAAxJ,IAKAoH,EAAApG,UAAAyE,QAAA,WACA,OAAApF,KAAAkF,QAAAE,SAKA2B,EAAApG,UAAA+I,6BAAA,SAAA5D,GACA,OAAA9F,KAAA+H,0BAAArE,eAAAoC;AAKAiB,EAAApG,UAAAgJ,mBAAA,SAAA7D,GACA,GAAA9F,KAAAkF,QAAAI,OACA,OAAAtF,KAAAkF,QAAAI,OAAAQ,IAMAiB,EAAApG,UAAAiJ,iBAAA,WACA,OAAA5J,KAAAkF,QAAAK,YAKAwB,EAAApG,UAAAkJ,kBAAA,WACA,OAAA7J,KAAAkF,QAAAM,aAKAuB,EAAApG,UAAA+E,QAAA,SAAAf,GACA3E,KAAAkF,QAAAQ,QAAAf,IAEAoC,EAxMA,GA0MAxH,EAAAwH,cAAAA,EA9TA,CA+TAxH,IAAAA,EAAA,KAMA,SAAAA,GAIA,IAAAuK,EAAA,WACA,SAAAA,EAAA9C,GACAhH,KAAAiH,KAAAD,EACAhH,KAAA+J,cAAA,KACA/J,KAAAgK,aAAA,GAiDA,OA/CAF,EAAAnJ,UAAAsJ,KAAA,SAAAC,EAAAC,EAAA3G,EAAA4G,GACA,IAAA/B,EAAArI,KACA,IAAAA,KAAA+J,cACA,GAAA/J,KAAAiH,KAAAoD,YACArK,KAAA+J,cAAA,IAAAO,OAEA,GAAAtK,KAAAiH,KAAAsD,mBAAA,CACA,IAAArE,EAAAgE,EAAAM,YAAA3B,oBAAA3C,iBAEAlG,KAAA+J,cADA7D,EACA,IAAAuE,EAGA,IAAAC,EAAA1K,KAAAiH,WAGAjH,KAAAiH,KAAAO,OACAxH,KAAA+J,cAAA,IAAAW,EAAA1K,KAAAiH,MAGAjH,KAAA+J,cAAA,IAAAU,EAGA,IAAAE,EAAA,CACAnH,SAAAA,EACA4G,UAAAA,GAEApK,KAAAgK,aAAAtG,eAAAyG,GACAnK,KAAAgK,aAAAG,GAAAjI,KAAAyI,IAGA3K,KAAAgK,aAAAG,GAAA,CAAAQ,GACA3K,KAAA+J,cAAAE,KAAAC,EAAAC,GAAA,WAAA,OAAA9B,EAAAuC,gBAAAT,MAAA,SAAAxF,GAAA,OAAA0D,EAAAwC,iBAAAV,EAAAxF;AAEAmF,EAAAnJ,UAAAiK,gBAAA,SAAAT,GACA,IAAAQ,EAAA3K,KAAAgK,aAAAG,UACAnK,KAAAgK,aAAAG,GACA,IAAA,IAAAvK,EAAA,EAAAA,EAAA+K,EAAA7K,OAAAF,IACA+K,EAAA/K,GAAA4D,YAGAsG,EAAAnJ,UAAAkK,iBAAA,SAAAV,EAAAxF,GACA,IAAAgG,EAAA3K,KAAAgK,aAAAG,UACAnK,KAAAgK,aAAAG,GACA,IAAA,IAAAvK,EAAA,EAAAA,EAAA+K,EAAA7K,OAAAF,IACA+K,EAAA/K,GAAAwK,UAAAzF,IAGAmF,EArDA,GAuDAW,EAAA,WACA,SAAAA,KAoDA,OA9CAA,EAAA9J,UAAAmK,gBAAA,SAAAC,EAAAvH,EAAA4G,GACA,IAAAY,EAAA,WACAD,EAAAE,oBAAA,OAAAC,GACAH,EAAAE,oBAAA,QAAAE,IAEAD,EAAA,SAAAE,GACAJ,IACAxH,KAEA2H,EAAA,SAAAC,GACAJ,IACAZ,EAAAgB,IAEAL,EAAAM,iBAAA,OAAAH,GACAH,EAAAM,iBAAA,QAAAF,IAEAV,EAAA9J,UAAAsJ,KAAA,SAAAC,EAAAC,EAAA3G,EAAA4G,GACA,GAAA,UAAAvH,KAAAsH,GAAA,CACA,IACA9C,EADA6C,EAAAM,YAAA3B,oBACAxB,aAAA9H,EAAAW,OAAAmH,YACAiE,EAAAnB,EAAAoB,MAAA,KACAC,EAAA,KACA,IACAA,EAAAnE,EAAAiE,EAAA,IAEA,MAAA3G,GAEA,YADAyF,EAAAzF,GAGAuF,EAAAuB,6BAAA,IAAA,WAAA,OAAAD,KACAhI,QAEA,CACA,IAAAuH,EAAAW,SAAAC,cAAA,UACAZ,EAAAa,aAAA,QAAA,SACAb,EAAAa,aAAA,OAAA,mBACA5L,KAAA8K,gBAAAC,EAAAvH,EAAA4G,GACAW,EAAAa,aAAA,MAAAzB;CAEA,IAAAlE,EAAAiE,EAAAM,YAAA3B,oBAAA5C,SACAA,GACA8E,EAAAa,aAAA,QAAA3F,GAEAyF,SAAAG,qBAAA,QAAA,GAAAC,YAAAf,KAGAN,EArDA,GAuDAH,EAAA,WACA,SAAAA,KAWA,OATAA,EAAA3J,UAAAsJ,KAAA,SAAAC,EAAAC,EAAA3G,EAAA4G,GACA,IACA9I,cAAA6I,GACA3G,IAEA,MAAA4H,GACAhB,EAAAgB,KAGAd,EAZA,GAcAI,EAAA,WACA,SAAAA,EAAA1D,GACAhH,KAAAiH,KAAAD,EACAhH,KAAA+L,gBAAA,EACA/L,KAAAgM,sBAAA,EA4RA,OA1RAtB,EAAA/J,UAAAsL,MAAA,SAAA5E,GACArH,KAAA+L,iBAGA/L,KAAA+L,gBAAA,EAEA/L,KAAAkM,IAAA7E,EAAA,MACArH,KAAAmM,IAAA9E,EAAA,MACArH,KAAAoM,MAAA/E,EAAA,QACArH,KAAAqM,QAAAhF,EAAA,YAIAqD,EAAA/J,UAAA2L,iBAAA,SAAAjF,EAAA6C,GAGA,IAAA9D,EAAA8D,EAAAM,YAAA3B,oBAAAzC,eACA,GAAAA,IAGApG,KAAAgM,qBAAA,CAGAhM,KAAAgM,sBAAA,EACA,IAAAO,EAAAvM,KACAwM,EAAAnF,EAAA,UAmBAmF,EAAA7L,UAAA8L,SAAA,SAAAC,EAAAnF,GAEA,IAKAoF,EALAC,EAAAJ,EAAAK,KAAAH,EAAA9J,QAAA,QAAA,KAEAkK,EAAA5C,EAAA6C,cACAC,EAAAT,EAAAU,mBAAA7G,EAAAmB,GACArC,EAAA,CAAAqC,SAAAA,GAEA,IACA,IAAA2F,EAAAX,EAAAL,IAAAiB,aAAAH,GACAL,EAAAO,EAAAE,MAAA,EAAA,IACAlI,EAAAmI,WAAAH,EAAAE,MAAA,IACAN,EAAA7K,OAAA,GAAA+K,GAEA,MAAAM,GACAR,EAAA7K,OAAA,GAAA+K;AAEA,IAAAjC,EAAA,IAAAwB,EAAAJ,IAAAoB,OAAAX,EAAA1H,GACAsI,EAAAzC,EAAA0C,iBAAAvI,GAEAwI,EAAAnB,EAAAH,MAAAsB,QAAAnG,GACAoG,EAvCA,SAAAC,GACA,IAAApB,EAAAoB,EAAAC,YACAF,EAAA,SAAApH,GACA,IACA,OAAAqH,EAAAD,QAAApH,GAEA,WAUA,OANAoH,EAAAG,QAAA,SAAAC,GACA,OAAAvB,EAAAwB,iBAAAD,EAAAH,IAEAD,EAAArG,KAAApG,QAAA+M,WACAN,EAAAO,WAAA1B,EAAA2B,YACAR,EAAAS,MAAA5B,EAAA6B,OACAV,EAuBAW,CAAAtO,MACAuO,EAAA,CAAAvO,KAAAiB,QAAA0M,EAAA3N,KAAAuH,EAAAmG,EAAAxM,QAAAjB,EAAAuO,QACA7O,EAAA6N,EAAAiB,MAAAzO,KAAAiB,QAAAsN,GAIA,OAFAhC,EAAAmC,kBAAA3D,EAAA6B,EAAAI,GAAA9H,EAAAmI,WAAAnD,GACAqC,EAAAoC,kBAAA5D,EAAA6B,EAAAI,EAAAL,EAAAzC,GACAvK,KAGA+K,EAAA/J,UAAAsJ,KAAA,SAAAC,EAAAC,EAAA3G,EAAA4G,GACA,IAAA/B,EAAArI,KACA4O,EAAA1E,EAAAM,YAAA3B,oBACAxB,EAAAuH,EAAAvH,aAAA9H,EAAAW,OAAAmH,YACAwH,EAAAD,EAAAC,kBAAA,SAAAC,GAAA,OAAAA,GACA9O,KAAAiM,MAAA5E,GACArH,KAAAsM,iBAAAjF,EAAA6C,GACA,IAAA4C,EAAA5C,EAAA6C,cACA,GAAA,UAAAlK,KAAAsH,GAAA,CACA,IAAAmB,EAAAnB,EAAAoB,MAAA,KACAwD,EAAA,KACA,IACAA,EAAA1H,EAAAiE,EAAA,IAEA,MAAA3G,GAEA,YADAyF,EAAAzF,GAGAuF,EAAAuB,6BAAA,IAAA,WAAA,OAAAsD,KACAvL,QAEA,CACA2G,EAAA5K,EAAA4C,UAAAK,kBAAAxC,KAAAiH,KAAAxE,UAAA0H;CACA,IAAA6E,EAAAhP,KAAAoM,MAAA6C,UAAA9E,GACA+E,EAAAlP,KAAAmP,oCAAAH,GACAI,EAAAC,QAAAT,EAAAxI,gBACAkJ,EAAAF,EAAApP,KAAAiN,mBAAA2B,EAAAxI,eAAA+D,QAAA3D,EACAxG,KAAAuP,yBAAAP,EAAAM,EAAAxC,GAAA,SAAAnI,EAAAuI,EAAAG,EAAAV,GACA,GAAAhI,EACAyF,EAAAzF,OADA,CAIA,IAAAiI,EAEAA,EADAM,EAAAsC,WAAA,KAAA9E,EAAA+E,KACA/E,EAAAgF,QAAAxC,EAAApF,UAAA,GAAA4C,EAAAiF,QAGAjF,EAAAgF,QAAAxC,EAAAxC,EAAAiF,QAEA/C,EAAAiC,EAAAjC,EAAAoC,GACA,IAAAY,EAAA,CAAArI,SAAA2H,EAAA7B,WAAAA,GACAtC,EAAA1C,EAAAwH,qBAAA3F,EAAA0C,EAAAgD,EAAApM,EAAA4G,GACA/B,EAAAqG,kBAAA3D,EAAA6B,EAAA0C,EAAAF,IAAA/B,EAAAnD,GACA7B,EAAAsG,kBAAA5D,EAAA6B,EAAA0C,EAAA3C,EAAAzC,SAIAQ,EAAA/J,UAAAkP,qBAAA,SAAA3F,EAAA4F,EAAA5K,EAAA1B,EAAA4G,GACA,IAAA0C,EAAA5C,EAAA6C,cACAD,EAAA7K,OAAA,GAAAiD,EAAAqC,UACA,IAAAwD,EAAA,IAAA/K,KAAAmM,IAAAoB,OAAAuC,EAAA5K,GACA6K,EAAAhF,EAAA0C,iBAAAvI,GACA8K,EAAA9F,EAAA+F,yBACAC,GAAA,EACAC,EAAA,WAEA,OADAD,GAAA,EACAF,EAAAvB,MAAA,KAAA2B,YAWA,OATAD,EAAAE,IAAAL,EAAAK,IACAN,EAAAO,KAAA/Q,EAAAW,OAAAgK,EAAAqG,0BAAAJ,EAAAjL,EAAAqC,SAAAvH,KAAAoM,MAAAsB,QAAAxI,EAAAqC,WACAuF,EAAA7K,OAAA,GAAAiD,EAAAqC,UACA2I,EACA1M,IAGA4G,EAAA,IAAAxF,MAAA,iCAAAM,EAAAqC,SAAA,MAEAwD,GAEAL,EAAA/J,UAAAwO,oCAAA,SAAA5I,GACA,IAAAvG,KAAAiH,KAAAsD,mBACA,OAAAhE;CAEA,IAAAiK,EAAAjK,EAAAkK,MAAA,mBACA,OAAAD,EAEA,YAAAA,EAAA,GAAAE,cAAA,IAAAF,EAAA,IAAA5N,QAAA,MAAA,KAIA,UAAA2D,GAGAmE,EAAA/J,UAAAsM,mBAAA,SAAA3H,EAAAiC,GACA,IAAAoJ,EAAA3Q,KAAAqM,QAAAuE,WAAA,OAAAC,OAAAtJ,EAAA,QAAAsJ,OAAAvL,EAAAe,KAAA,QAAAyK,OAAA,OACAC,EAAA/Q,KAAAoM,MAAA2E,SAAAxJ,GAAA3E,QAAA,QAAA,IACA,OAAA5C,KAAAoM,MAAA4E,KAAA1L,EAAAiB,KAAAwK,EAAA,IAAAJ,EAAA,UAEAjG,EAAA/J,UAAA+N,kBAAA,SAAA3D,EAAA6B,EAAAI,EAAAiE,EAAA/G,GACA,IAAA7B,EAAArI,KACA+K,EAAAmG,mBAEAlR,KAAAkM,IAAAiF,OAAAnE,GAAA,SAAArI,GACAuF,EAAA6C,cAAA9K,OAAA,GAAA+K,GACA3E,EAAA+I,0BAAArG,EAAA6B,EAAAI,EAAA9C,GACAvF,GACAuF,EAAAM,YAAA9E,QAAAf,MAIAsM,GAEAjR,KAAAoR,0BAAArG,EAAA6B,EAAAI,EAAA9C,IAMAQ,EAAA/J,UAAAyQ,0BAAA,SAAArG,EAAA6B,EAAAI,EAAA9C,GACA,IAAA7B,EAAArI,KACAqR,EAAA1J,KAAA2J,KAAApH,EAAAM,YAAA3B,oBAAAzC,eAAAE,YAAA,EAAAqB,KAAA4J,WACAC,GAAA,EACAC,EAAA,EACA9E,OAAAnG,EACAkL,EAAA,WACAC,YAAA,WACAhF,IACAA,EAAAtE,EAAAgE,QAAAuE,WAAA,OAAAC,OAAAjE,EAAA,QAAAkE,UAEA,IAAAzD,EAAAtC,EAAAkG,mBACA,IAAA5D,EAAAvN,QAAAuN,EAAAvN,SAAA0R,GAAAC,GAAA,IAIApE,EAAAvN,OAAA0R,EAEAE,KAGAF,EAAAnE,EAAAvN,OACAuI,EAAA6D,IAAA0F,UAAA5E,EAAAwB,OAAA5H,OAAA,CAAA+F,EAAAU,KAAA,SAAA1I;AACAA,GACAuF,EAAAM,YAAA9E,QAAAf,GAEAuF,EAAA6C,cAAA9K,OAAA,GAAA+K,GACA0E,WAEAL,EAAA1J,KAAAkK,IAAA,EAAAJ,OAKAC,KAEAhH,EAAA/J,UAAA4O,yBAAA,SAAAuC,EAAA9E,EAAAF,EAAAtJ,GACA,GAAAwJ,EAIA,CAEA,IAAA+E,OAAAvL,EACAwL,OAAAxL,EACAyL,OAAAzL,EACA0L,EAAA,EACAC,EAAA,SAAAxN,GACAA,EACAnB,EAAAmB,GAEA,KAAAuN,GACA1O,OAAAgD,EAAAuL,EAAAC,EAAAC,IAGAjS,KAAAkM,IAAAkG,SAAAN,EAAA,CAAAO,SAAA,SAAA,SAAA1N,EAAAuI,GACA6E,EAAA7E,EACAiF,EAAAxN,MAEA3E,KAAAkM,IAAAkG,SAAApF,GAAA,SAAArI,EAAAuI,IACAvI,GAAAuI,GAAAA,EAAApN,OAAA,GACAmS,EAAA/E,EAAAE,MAAA,EAAA,IACA4E,EAAA9E,EAAAE,MAAA,IACAN,EAAA7K,OAAA,GAAA+K,IAGAF,EAAA7K,OAAA,GAAA+K,GAEAmF,YA7BAnS,KAAAkM,IAAAkG,SAAAN,EAAA,CAAAO,SAAA,QAAA7O,IAiCAkH,EAAA/J,UAAAgO,kBAAA,SAAA5D,EAAA6B,EAAAI,EAAAL,EAAAzC,GACA,IAAA7B,EAAArI,KACA2M,IAIA5B,EAAAmG,oBAIAS,YAAA,WAIA,IAAAW,EAAAjK,EAAAgE,QAAAuE,WAAA,OAAAC,OAAAjE,EAAA,QAAAkE,SACAnE,EAAA4F,OAAAD,KACApI,EAAAM,YAAA9E,QAAA,IAAAd,MAAA,iDAAAoI,EAAA,qCACA3E,EAAA6D,IAAAiF,OAAAnE,GAAA,SAAArI,GACAA,GACAuF,EAAAM,YAAA9E,QAAAf,SAIAgD,KAAA2J,KAAA,KAAA,EAAA3J,KAAA4J,cAEA7G,EAAA+E,KAAA,MACA/E,EAAAgF,QAAA,wDACAhF,EAAAiF,QAAA,QACAjF,EAhSA,GAqSAnL,EAAAiT,mBAHA,SAAAxL,GACA,OAAA,IAAA8C,EAAA9C;CAnaA,CAsaAzH,IAAAA,EAAA,KAMA,SAAAA,GAGA,IAAAkT,EAAA,WACA,SAAAA,EAAAC,GACA,IAAAC,EAAAD,EAAA7K,YAAA,KAEA7H,KAAA4S,gBADA,IAAAD,EACAD,EAAA5P,OAAA,EAAA6P,EAAA,GAGA,GAqCA,OA/BAF,EAAAI,mBAAA,SAAA/M,GACA,IAAAgN,EAAAC,EAAAjN,EAGA,IADAgN,EAAA,SACAA,EAAAjQ,KAAAkQ,IACAA,EAAAA,EAAAnQ,QAAAkQ,EAAA,KAMA,IAHAC,EAAAA,EAAAnQ,QAAA,SAAA,IAEAkQ,EAAA,uEACAA,EAAAjQ,KAAAkQ,IACAA,EAAAA,EAAAnQ,QAAAkQ,EAAA,KAIA,OADAC,EAAAA,EAAAnQ,QAAA,sEAAA,KAMA6P,EAAA9R,UAAAqS,cAAA,SAAAlN,GACA,IAAAnG,EAAAmG,EAMA,OALAvG,EAAA4C,UAAAkB,eAAA1D,KACAJ,EAAA4C,UAAAY,WAAApD,EAAA,OAAAJ,EAAA4C,UAAAY,WAAApD,EAAA,UACAA,EAAA8S,EAAAI,mBAAA7S,KAAA4S,eAAAjT,IAGAA,GAEA8S,EAAAQ,KAAA,IAAAR,EAAA,IACAA,EA5CA,GA8CAlT,EAAAkT,iBAAAA,EAGA,IAAAjG,EAAA,WACA,SAAAA,EAAApI,EAAA8O,EAAAC,EAAA3P,EAAA4G,EAAAgJ,GACApT,KAAAoE,GAAAA,EACApE,KAAAkT,MAAAA,EACAlT,KAAAmT,aAAAA,EACAnT,KAAAqT,UAAA7P,EACAxD,KAAAsT,WAAAlJ,EACApK,KAAAoT,iBAAAA,EACApT,KAAAiB,QAAA,GACAjB,KAAA6F,MAAA,KACA7F,KAAAuT,iBAAA,EACAvT,KAAAwT,4BAAAxT,KAAAmT,aAAArT,OACAE,KAAAyT,aAAA,EA8EA,OA5EAjH,EAAAkH,oBAAA,SAAAlQ,EAAA+K,GACA,IACA,MAAA;AACAoF,cAAAnQ,EAAAiL,MAAAlP,EAAAW,OAAAqO,GACAqF,cAAA,MAGA,MAAAxI,GACA,MAAA,CACAuI,cAAA,KACAC,cAAAxI,KAIAoB,EAAAqH,eAAA,SAAAvO,EAAAwO,EAAAtQ,EAAAuQ,GACA,OAAAzO,EAAAF,YAAA7F,EAAA4C,UAAAgC,kBAAA2P,GACA,CACAH,cAAA,KACAC,cAAA,MAGAtO,EAAAsE,mBACA5J,KAAA0T,oBAAAlQ,EAAAuQ,GAEA,CACAJ,cAAAnQ,EAAAiL,MAAAlP,EAAAW,OAAA6T,GACAH,cAAA,OAGApH,EAAA7L,UAAAqT,SAAA,SAAAlH,EAAAxH,EAAAyO,GACA/T,KAAAyT,aAAA,EACA,IAAAG,EAAA,KACA,GAAA5T,KAAAqT,UACA,GAAA,mBAAArT,KAAAqT,UAAA,CACAvG,EAAA7K,OAAA,GAAAjC,KAAAkT,OACA,IAAAH,EAAAvG,EAAAqH,eAAAvO,EAAAtF,KAAAkT,MAAAlT,KAAAqT,UAAAU,GACAH,EAAAb,EAAAa,cACA9G,EAAA7K,OAAA,GAAAjC,KAAAkT,OACAU,QAAA,IAAAb,EAAAY,eAAA3T,KAAAuT,kBAAAhU,EAAA4C,UAAAwB,QAAA3D,KAAAiB,WACAjB,KAAAiB,QAAA8R,EAAAY,oBAIA3T,KAAAiB,QAAAjB,KAAAqT,UAGA,GAAAO,EAAA,CACA,IAAAjP,EAAApF,EAAAmF,YAAAkP,GACAjP,EAAAgB,MAAA,UACAhB,EAAAmB,SAAA9F,KAAAkT,MACAlT,KAAA6F,MAAAlB,EACAW,EAAAI,QAAAf,GAEA3E,KAAAmT,aAAA,KACAnT,KAAAqT,UAAA,KACArT,KAAAsT,WAAA,KACAtT,KAAAoT,iBAAA,MAKA5G,EAAA7L,UAAAsT,kBAAA,SAAAtP,GAGA,OAFA3E,KAAAyT,aAAA,EACAzT,KAAA6F,MAAAlB;EACA3E,KAAAsT,aACAtT,KAAAsT,WAAA3O,IACA,IAOA6H,EAAA7L,UAAAuT,WAAA,WACA,OAAAlU,KAAAyT,aAEAjH,EA1FA,GA4FAjN,EAAAiN,OAAAA,EACA,IAAA2H,EAAA,WACA,SAAAA,IACAnU,KAAAoU,QAAA,EACApU,KAAAqU,0BAAA,IAAAC,IACAtU,KAAAuU,0BAAA,GAEAvU,KAAAwU,YAAA,WACAxU,KAAAwU,YAAA,UACAxU,KAAAwU,YAAA,WAiBA,OAfAL,EAAAxT,UAAA8T,eAAA,WACA,OAAAzU,KAAAoU,SAEAD,EAAAxT,UAAA6T,YAAA,SAAAV,GACA,IAAA1P,EAAApE,KAAAqU,0BAAAzT,IAAAkT,GAMA,YALA,IAAA1P,IACAA,EAAApE,KAAAoU,UACApU,KAAAqU,0BAAAK,IAAAZ,EAAA1P,GACApE,KAAAuU,0BAAAnQ,GAAA0P,GAEA1P,GAEA+P,EAAAxT,UAAAgU,eAAA,SAAA7O,GACA,OAAA9F,KAAAuU,0BAAAzO,IAEAqO,EAzBA,GA2BAS,EAAA,WACA,SAAAA,EAAAxQ,GACApE,KAAAoE,GAAAA,EAKA,OAHAwQ,EAAAC,QAAA,IAAAD,EAAA,GACAA,EAAAE,OAAA,IAAAF,EAAA,GACAA,EAAAG,QAAA,IAAAH,EAAA,GACAA,EAPA,GASArV,EAAAqV,kBAAAA,EACA,IAAAI,EACA,SAAA5Q,EAAA6Q,EAAAC,GACAlV,KAAAoE,GAAAA,EACApE,KAAAiV,SAAAA,EACAjV,KAAAkV,YAAAA,GAIA3V,EAAAyV,iBAAAA,EACA,IAAAG,EAAA,WACA,SAAAA,EAAAnO,EAAAoO,EAAAC,EAAAC,EAAAvT,QACA,IAAAA,IAAAA,EAAA,GACA/B,KAAAiH,KAAAD,EACAhH,KAAA+J,cAAAqL,EACApV,KAAAuV,0BAAAxT;AACA/B,KAAAwV,YAAAH,EACArV,KAAAyV,aAAAH,EACAtV,KAAA0V,kBAAA,IAAAvB,EACAnU,KAAA2V,QAAA,IAAApW,EAAAwH,cAAA/G,KAAAiH,MACAjH,KAAA4V,UAAA,GACA5V,KAAA6V,eAAA,GACA7V,KAAA8V,sBAAA,GACA9V,KAAA+V,4BAAA,IAAAzB,IACAtU,KAAAgW,6BAAA,KACAhW,KAAAiW,UAAA,KACAjW,KAAAkW,eAAA,GACAlW,KAAAmW,sBAAA,GACAnW,KAAAoW,uBAAA,GA4hBA,OA1hBAjB,EAAAxU,UAAA0V,MAAA,WACA,OAAA,IAAAlB,EAAAnV,KAAAiH,KAAAjH,KAAA+J,cAAA/J,KAAAwV,YAAAxV,KAAAyV,aAAAzV,KAAAuV,4BAEAJ,EAAAxU,UAAAsP,uBAAA,WACA,OAAAjQ,KAAAwV,aAEAL,EAAAxU,UAAA4P,wBAAA,WACA,OAAAvQ,KAAAyV,cAEAN,EAAAmB,6BAAA,SAAArT,EAAA8B,GAIA,IAHA,IAAAkK,EAAA,SAAAsH,GAAA,OAAAA,EAAA3T,QAAA,MAAA,MACA4T,EAAAvH,EAAAhM,GACAwT,EAAA1R,EAAAwG,MAAA,MACA3L,EAAA,EAAAA,EAAA6W,EAAA3W,OAAAF,IAAA,CACA,IAAA8W,EAAAD,EAAA7W,GAAA6Q,MAAA,wBACA,GAAAiG,EAAA,CACA,IAAAC,EAAAD,EAAA,GACAE,EAAAF,EAAA,GACAG,EAAAH,EAAA,GACAI,EAAAnP,KAAAC,IAAA+O,EAAA9O,YAAA,KAAA,EAAA8O,EAAA9O,YAAA,KAAA,GAGA,IADA8O,EAAA1H,EADA0H,EAAAA,EAAA7T,OAAAgU,OAEAN,EAAA,CACA,IAAAzD,EAAA,CACAgE,KAAAC,SAAAJ,EAAA,IACAK,IAAAD,SAAAH,EAAA;CAKA,OAHA,IAAA9D,EAAAgE,OACAhE,EAAAkE,KAAA,wDAAAnX,QAEAiT,IAIA,MAAA,IAAAnO,MAAA,mDAAA3B,IAEAkS,EAAAxU,UAAAuW,aAAA,WACA,IAAAlX,KAAA2V,QAAAvQ,UACA,OAAA,KAGA,IADA,IAAAzF,EAAA,GAAAwX,EAAA,EACAvX,EAAA,EAAAC,EAAAG,KAAA4V,UAAA9V,OAAAF,EAAAC,EAAAD,IAAA,CACA,IAAA8W,EAAA1W,KAAA4V,UAAAhW,GACA,GAAA8W,EAAA,CAGA,IAAAU,EAAApX,KAAAkW,eAAAQ,EAAAtS,KAAA,KACAiT,EAAArX,KAAAmW,sBAAAO,EAAAtS,KAAA,KACA+O,EAAAnT,KAAAoW,uBAAAM,EAAAtS,IACAzE,EAAAwX,KAAA,CACA/S,GAAAsS,EAAAxD,MACA3M,KAAA6Q,EACAE,eAAAF,GAAAC,EAAAlC,EAAAmB,6BAAAc,EAAAC,GAAA,KACAlE,aAAAA,EACAoE,KAAA,KACAtW,QAAAyV,EAAAzV,UAGA,OAAAtB,GAEAwV,EAAAxU,UAAAoM,YAAA,WASA,OARA/M,KAAAiW,YACAjW,KAAA2V,QAAA9L,oBACA7J,KAAAiW,UAAA,IAAA1W,EAAAuC,oBAAA9B,KAAAuV,2BAGAvV,KAAAiW,UAAA1W,EAAA+C,wBAAAC,UAGAvC,KAAAiW,WAEAd,EAAAxU,UAAA6W,gBAAA,WACA,OAAAxX,KAAA+M,cAAA1K,aAOA8S,EAAAxU,UAAA8K,6BAAA,SAAA0H,EAAA3P;AACA,GAAA,OAAAxD,KAAAgW,6BACA,MAAA,IAAApR,MAAA,2DAEA,IAAAG,EAAA,KACA/E,KAAA2V,QAAAvQ,YACAL,EAAA,IAAAH,MAAA,iBAAAG,OAAA,MAEA/E,KAAAgW,6BAAA,CACAjR,MAAAA,EACAoO,aAAAA,EACA3P,SAAAA,IASA2R,EAAAxU,UAAA8W,aAAA,SAAA3D,EAAAX,EAAA3P,EAAA4G,EAAArF,EAAAqO,GACA,IAAA/K,EAAArI,UACA,IAAAoT,IAAAA,EAAA,IAAAX,EAAAqB,IACA,IAAAhO,EAAA9F,KAAA0V,kBAAAlB,YAAAV,GACA,GAAA9T,KAAA4V,UAAA9P,GACA9F,KAAA2V,QAAAjM,6BAAAoK,IACAlO,QAAA8R,KAAA,mCAAA5D,EAAA,SAFA,CAOA,IAAA4C,EAAA,IAAAlK,EAAA1G,EAAAgO,EAAA9T,KAAA2X,uBAAAxE,EAAAC,GAAA5P,EAAA4G,EAAAgJ,GACApT,KAAA4V,UAAA9P,GAAA4Q,EACA1W,KAAA2V,QAAAvQ,YACApF,KAAAmW,sBAAArQ,GAAAf,EACA/E,KAAAoW,uBAAAtQ,IAAA4Q,EAAAvD,cAAA,IAAAyE,KAAA,SAAAC,GAAA,OAAAxP,EAAAqN,kBAAAf,eAAAkD,EAAAzT,QAIApE,KAAA8X,SAAApB,KAEAvB,EAAAxU,UAAAoX,qBAAA,SAAAC,EAAA5E,GACA,GAAA,YAAA4E,EACA,OAAApD,EAAAC,QAEA,GAAA,WAAAmD,EACA,OAAApD,EAAAE,OAEA,GAAA,YAAAkD,EACA,OAAApD,EAAAG,QAGA,IAAAkD,EAAAD,EAAAvW,QAAA,KACA,GAAAwW,GAAA,EAAA;AACA,IAAAC,EAAA9E,EAAAJ,cAAAgF,EAAAlV,OAAA,EAAAmV,IACA/C,EAAA9B,EAAAJ,cAAAgF,EAAAlV,OAAAmV,EAAA,IACAE,EAAAnY,KAAA0V,kBAAAlB,YAAA0D,EAAA,IAAAhD,GACAD,EAAAjV,KAAA0V,kBAAAlB,YAAA0D,GACA,OAAA,IAAAlD,EAAAmD,EAAAlD,EAAAC,GAEA,OAAA,IAAAN,EAAA5U,KAAA0V,kBAAAlB,YAAApB,EAAAJ,cAAAgF,MAEA7C,EAAAxU,UAAAgX,uBAAA,SAAAxE,EAAAC,GAEA,IADA,IAAAzT,EAAA,GAAAwX,EAAA,EACAvX,EAAA,EAAAC,EAAAsT,EAAArT,OAAAF,EAAAC,EAAAD,IACAD,EAAAwX,KAAAnX,KAAA+X,qBAAA5E,EAAAvT,GAAAwT,GAEA,OAAAzT,GAEAwV,EAAAxU,UAAAyX,iBAAA,SAAAhF,EAAAD,EAAA3P,EAAA4G,GACA,GAAA,iBAAA+I,EACA,OAAAnT,KAAAqY,mBAAAlF,EAAAC,GAEApT,KAAAyX,aAAAlY,EAAA4C,UAAA8B,0BAAAkP,EAAA3P,EAAA4G,EAAA,KAAAgJ,IAOA+B,EAAAxU,UAAA0X,mBAAA,SAAAC,EAAAlF,QACA,IAAAA,IAAAA,EAAA,IAAAX,EAAA6F,IACA,IAAAN,EAAAhY,KAAA+X,qBAAAO,EAAAlF,GACAsD,EAAA1W,KAAA4V,UAAAoC,EAAA5T,IACA,IAAAsS,EACA,MAAA,IAAA9R,MAAA,qEAAA0T,EAAA,gDAEA,IAAA5B,EAAAxC,aACA,MAAA,IAAAtP,MAAA,qEAAA0T,EAAA,wDAEA,GAAA5B,EAAA7Q,MACA,MAAA6Q,EAAA7Q;CAEA,OAAA6Q,EAAAzV,SAEAkU,EAAAxU,UAAA4X,UAAA,SAAAC,EAAAC,GACA,IAAAC,EAAA1Y,KAAA2V,QAAA9L,oBAEA7J,KAAA2V,QADA8C,EACA,IAAAlZ,EAAAwH,cAAA/G,KAAAiH,KAAAuR,GAGAxY,KAAA2V,QAAA/M,cAAA4P,GAEAxY,KAAA2V,QAAA9L,sBAAA6O,IACA1Y,KAAAiW,UAAA,OAGAd,EAAAxU,UAAA6J,UAAA,WACA,OAAAxK,KAAA2V,SAMAR,EAAAxU,UAAAgY,QAAA,SAAA7S,GACA,GAAA,OAAA9F,KAAAgW,6BAAA,CACA,IAAA4C,EAAA5Y,KAAAgW,6BACAhW,KAAAgW,6BAAA,KAEAhW,KAAAyX,aAAAzX,KAAA0V,kBAAAf,eAAA7O,GAAA8S,EAAAzF,aAAAyF,EAAApV,SAAA,KAAAoV,EAAA7T,SAGAoQ,EAAAxU,UAAAkY,iBAAA,SAAA/S,EAAAgT,GACA,IAAAzQ,EAAArI,KACA8T,EAAA9T,KAAA0V,kBAAAf,eAAA7O,GACAC,GAAA/F,KAAA8V,sBAAAhQ,IAAA,IAAA8R,KAAA,SAAAmB,GAAA,OAAA1Q,EAAAqN,kBAAAf,eAAAoE,MACApU,EAAApF,EAAAmF,YAAAoU,GAIA,OAHAnU,EAAAgB,MAAA,UACAhB,EAAAmB,SAAAgO,EACAnP,EAAAoB,SAAAA,EACApB,GAMAwQ,EAAAxU,UAAAqY,aAAA,SAAAlT,EAAAnB,GACA,IAAAkB,EAAA7F,KAAA6Y,iBAAA/S,EAAAnB,GACA3E,KAAA4V,UAAA9P,KACA9F,KAAA4V,UAAA9P,GAAA,IAAA0G,EAAA1G,EAAA9F,KAAA0V,kBAAAf,eAAA7O,GAAA,IAAA,eAAA,cAAA;CAIA,IADA,IAAAmT,EAAA,GACArZ,EAAA,EAAAC,EAAAG,KAAA0V,kBAAAjB,iBAAA7U,EAAAC,EAAAD,IACAqZ,EAAArZ,IAAA,EAEA,IAAAsZ,GAAA,EACAC,EAAA,GAGA,IAFAA,EAAAjX,KAAA4D,GACAmT,EAAAnT,IAAA,EACAqT,EAAArZ,OAAA,GAAA,CACA,IAAAsZ,EAAAD,EAAAE,QACA3C,EAAA1W,KAAA4V,UAAAwD,GACA1C,IACAwC,EAAAxC,EAAAzC,kBAAApO,IAAAqT,GAEA,IAAAI,EAAAtZ,KAAA8V,sBAAAsD,GACA,GAAAE,EACA,IAAA1Z,EAAA,EAAAC,EAAAyZ,EAAAxZ,OAAAF,EAAAC,EAAAD,IAAA,CACA,IAAA2Z,EAAAD,EAAA1Z,GACAqZ,EAAAM,KACAJ,EAAAjX,KAAAqX,GACAN,EAAAM,IAAA,IAKAL,GACAlZ,KAAA2V,QAAAjQ,QAAAG,IASAsP,EAAAxU,UAAA6Y,mBAAA,SAAAC,EAAAC,GACA,IAAAnR,EAAAvI,KAAA4V,UAAA6D,GACA,IAAAlR,EACA,OAAA,EAGA,IADA,IAAAoR,EAAA,GACA/Z,EAAA,EAAAC,EAAAG,KAAA0V,kBAAAjB,iBAAA7U,EAAAC,EAAAD,IACA+Z,EAAA/Z,IAAA,EAEA,IAAAuZ,EAAA,GAIA,IAFAA,EAAAjX,KAAAqG,GACAoR,EAAAF,IAAA,EACAN,EAAArZ,OAAA,GAAA,CAEA,IACAqT,EADAgG,EAAAE,QACAlG,aACA,GAAAA,EAEA,IAAAvT,EAAA,EAAAC,EAAAsT,EAAArT,OAAAF,EAAAC,EAAAD,IAAA,CACA,IAAAoY,EAAA7E,EAAAvT,GACA,GAAAoY,EAAA5T,KAAAsV,EAEA,OAAA,EAEA,IAAAE,EAAA5Z,KAAA4V,UAAAoC,EAAA5T,IACAwV,IAAAD,EAAA3B,EAAA5T,MAEAuV,EAAA3B,EAAA5T,KAAA,EACA+U,EAAAjX,KAAA0X,KAMA,OAAA,GAQAzE,EAAAxU,UAAAkZ,eAAA,SAAAJ,EAAAC,EAAAI,GACA,GAAAL,IAAAC,GAAA,KAAAI,EACA,MAAA,CAAAL,GAEA,IAAAlR,EAAAvI,KAAA4V,UAAA6D,GACA,IAAAlR,EACA,OAAA,KAGA,IAAA4K,EAAA5K,EAAA4K,aACA,GAAAA,EACA,IAAA,IAAAvT,EAAA,EAAAC,EAAAsT,EAAArT,OAAAF,EAAAC,EAAAD,IAAA,CACA,IAAA2G,EAAAvG,KAAA6Z,eAAA1G,EAAAvT,GAAAwE,GAAAsV,EAAAI,EAAA,GACA,GAAA,OAAAvT,EAEA,OADAA,EAAArE,KAAAuX,GACAlT,EAIA,OAAA,MAKA4O,EAAAxU,UAAAoZ,eAAA,SAAA3G,GACA,IAAA/K,EAAArI,KACAL,EAAA,SAAAwT,EAAA3P,EAAA4G;AACA,OAAA/B,EAAA+P,iBAAAhF,EAAAD,EAAA3P,EAAA4G,IAaA,OAXAzK,EAAAqa,MAAA,SAAA5V,GACA,OAAAiE,EAAAsN,QAAAlM,aAAA2J,EAAAJ,cAAA5O,KAEAzE,EAAAsa,SAAA,WACA,OAAA5R,EAAAmP,mBAEA7X,EAAA2F,OAAA,SAAAkT,EAAAC,QACA,IAAAA,IAAAA,GAAA,GACApQ,EAAAkQ,UAAAC,EAAAC,IAEA9Y,EAAAua,iBAAA3a,EAAAW,OAAAmH,YACA1H,GAEAwV,EAAAxU,UAAAwZ,YAAA,SAAArU,GACA,IAAAuC,EAAArI,KACA,IAAAA,KAAA4V,UAAA9P,KAAA9F,KAAA6V,eAAA/P,GAAA,CAIA9F,KAAA6V,eAAA/P,IAAA,EACA,IAAAgO,EAAA9T,KAAA0V,kBAAAf,eAAA7O,GACAT,EAAArF,KAAA2V,QAAArM,gBAAAwK,GAEA9T,KAAAiH,KAAAO,UAAA,IAAAsM,EAAArS,QAAA,MADA,oBACAoB,KAAAiR,KACAzO,EAAAnD,KAAA,QAAA4R,GAEA,IAAAsG,GAAA,EACAC,EAAA,SAAA1V,GAEA,KADAyV,GACA/U,EAAAvF,OAEAuI,EAAA2Q,aAAAlT,EAAAnB,OAEA,CACA,IAAA2V,EAAAjV,EAAA+U,GACAG,EAAAlS,EAAA0E,cACA,GAAA1E,EAAAsN,QAAAvQ,WAAA,WAAAkV,EAIA,OAHAjS,EAAA6N,eAAApQ,GAAAwU,EACAjS,EAAAoP,aAAApP,EAAAqN,kBAAAf,eAAA7O,GAAA,GAAA,KAAA,KAAA,WACAuC,EAAAsQ,QAAA7S,GAGAyU,EAAAtY,OAAA,GAAAqY,GACAjS,EAAA0B,cAAAE,KAAA5B,EAAAiS,GAAA,WACAjS,EAAAsN,QAAAvQ,YACAiD,EAAA6N,eAAApQ,GAAAwU,GAEAC,EAAAtY,OAAA,GAAAqY,GACAjS,EAAAsQ,QAAA7S,MACA,SAAAnB,GACA4V,EAAAtY,OAAA,GAAAqY,GACAD,EAAA1V,QAIA0V,EAAA;AAQAlF,EAAAxU,UAAA6Z,sBAAA,SAAAC,EAAAC,GACA,IAAArS,EAAArI,KACA,IAAAA,KAAA4V,UAAA8E,EAAAtW,MAAApE,KAAA6V,eAAA6E,EAAAtW,IAAA,CAIApE,KAAA6V,eAAA6E,EAAAtW,KAAA,EAEA,IAAA6F,EAAA,SAAAjG,GACAqE,EAAAoP,aAAApP,EAAAqN,kBAAAf,eAAA+F,EAAAtW,IAAA,GAAAJ,EAAA,KAAA,OAEAiG,EAAApE,MAAA,SAAAlB,GACA0D,EAAAsN,QAAAjQ,QAAA2C,EAAAwQ,iBAAA6B,EAAAtW,GAAAO,KAEA8V,EAAAxQ,KAAAyQ,EAAAxF,YAAAlV,KAAA+Z,eAAAtH,EAAAQ,MAAAhJ,EAAAjK,KAAA2V,QAAA9M,uBAKAsM,EAAAxU,UAAAmX,SAAA,SAAA9W,GACA,IAAAqH,EAAArI,KACAmT,EAAAnS,EAAAmS,aACA,GAAAA,EACA,IAAA,IAAAvT,EAAA,EAAAC,EAAAsT,EAAArT,OAAAF,EAAAC,EAAAD,IAAA,CACA,IAAAoY,EAAA7E,EAAAvT,GACA,GAAAoY,IAAApD,EAAAC,QAKA,GAAAmD,IAAApD,EAAAE,OAIA,GAAAkD,IAAApD,EAAAG,QAAA,CAIA,IAAA6E,EAAA5Z,KAAA4V,UAAAoC,EAAA5T,IACA,GAAAwV,GAAAA,EAAA1F,aAAA,CACA,GAAA0F,EAAA/T,MAEA,YADA7E,EAAAiT,kBAAA2F,EAAA/T,OAGA7E,EAAAwS,mCAGA,GAAAxT,KAAAwZ,mBAAAxB,EAAA5T,GAAApD,EAAAoD,IAAA,CACAwB,QAAA8R,KAAA,wCAAA1X,KAAA0V,kBAAAf,eAAAqD,EAAA5T,IAAA,UAAApE,KAAA0V,kBAAAf,eAAA3T,EAAAoD,IAAA,+BACA,IAAAuW,EAAA3a,KAAA6Z,eAAA7B,EAAA5T,GAAApD,EAAAoD,GAAA,IAAA,GACAuW,EAAAC,UACAD,EAAAzY,KAAA8V,EAAA5T,IACAwB,QAAA8R,KAAAiD,EAAA/C,KAAA,SAAAxT;AAAA,OAAAiE,EAAAqN,kBAAAf,eAAAvQ,MAAA4M,KAAA,WAEAhQ,EAAAwS,mCAMA,GAFAxT,KAAA8V,sBAAAkC,EAAA5T,IAAApE,KAAA8V,sBAAAkC,EAAA5T,KAAA,GACApE,KAAA8V,sBAAAkC,EAAA5T,IAAAlC,KAAAlB,EAAAoD,IACA4T,aAAAhD,EAAA,CACA,IAAAyF,EAAAza,KAAA4V,UAAAoC,EAAA/C,UACA,GAAAwF,GAAAA,EAAAvG,aAAA,CACAlU,KAAAwa,sBAAAC,EAAAxZ,QAAA+W,GACA,SAGA,IAAA6C,EAAA7a,KAAA+V,4BAAAnV,IAAAoX,EAAA/C,UACA4F,IACAA,EAAA,GACA7a,KAAA+V,4BAAArB,IAAAsD,EAAA/C,SAAA4F,IAEAA,EAAA3Y,KAAA8V,GACAhY,KAAAma,YAAAnC,EAAA/C,eAGAjV,KAAAma,YAAAnC,EAAA5T,SAzCApD,EAAAwS,mCAJAxS,EAAAwS,mCALAxS,EAAAuS,iBAAA,EACAvS,EAAAwS,8BAoDA,IAAAxS,EAAAwS,6BACAxT,KAAA8a,kBAAA9Z,IAGAmU,EAAAxU,UAAAma,kBAAA,SAAA9Z,GACA,IAAAqH,EAAArI,KACA8M,EAAA9M,KAAA+M,cACA,IAAA/L,EAAAkT,aAAA,CAIA,IAAAf,EAAAnS,EAAAmS,aACAY,EAAA,GACA,GAAAZ,EACA,IAAA,IAAAvT,EAAA,EAAAC,EAAAsT,EAAArT,OAAAF,EAAAC,EAAAD,IAAA,CACA,IAAAoY,EAAA7E,EAAAvT,GACA,GAAAoY,IAAApD,EAAAC,QAIA,GAAAmD,IAAApD,EAAAE,OASA,GAAAkD,IAAApD,EAAAG,QAAA,CAIA,IAAA6E,EAAA5Z,KAAA4V,UAAAoC,EAAA5T,IAEA2P,EAAAnU,GADAga,EACAA,EAAA3Y,QAGA;MARA8S,EAAAnU,GAAAI,KAAA+Z,eAAA/Y,EAAAoS,uBATAW,EAAAnU,GAAA,CACAwE,GAAApD,EAAAkS,MACA5N,OAAA,WACA,OAAA+C,EAAAsN,QAAAhM,mBAAA3I,EAAAkS,cAPAa,EAAAnU,GAAAoB,EAAAC,QAwBAD,EAAAgT,SAAAlH,EAAA9M,KAAA2V,QAAA5B,GAEA,IAAAuF,EAAAtZ,KAAA8V,sBAAA9U,EAAAoD,IAEA,GADApE,KAAA8V,sBAAA9U,EAAAoD,IAAA,KACAkV,EAGA,IAAA1Z,EAAA,EAAAC,EAAAyZ,EAAAxZ,OAAAF,EAAAC,EAAAD,IAAA,CACA,IAAAmb,EAAAzB,EAAA1Z,GACAob,EAAAhb,KAAA4V,UAAAmF,GACAC,EAAAxH,8BACA,IAAAwH,EAAAxH,6BACAxT,KAAA8a,kBAAAE,GAIA,IAAAH,EAAA7a,KAAA+V,4BAAAnV,IAAAI,EAAAoD,IACA,GAAAyW,EAAA,CAGA7a,KAAA+V,4BAAAkF,OAAAja,EAAAoD,IAEA,IAAAxE,EAAA,EAAAC,EAAAgb,EAAA/a,OAAAF,EAAAC,EAAAD,IACAI,KAAAwa,sBAAAxZ,EAAAC,QAAA4Z,EAAAjb,OAIAuV,EA9iBA,GAgjBA5V,EAAA4V,cAAAA,EA/uBA,CAgvBA5V,IAAAA,EAAA,KAGA,SAAAA,GACA,IAAAyH,EAAA,IAAAzH,EAAAY,YACA+J,EAAA,KACAgR,EAAA,SAAA9W,EAAA+O,EAAA3P,GACA,iBAAAY,IACAZ,EAAA2P,EACAA,EAAA/O,EACAA,EAAA,MAEA,iBAAA+O,GAAArP,MAAAC,QAAAoP,KACA3P,EAAA2P,EACAA,EAAA,MAEAA,IACAA,EAAA,CAAA,UAAA,UAAA,WAEA/O,EACA8F,EAAAuN,aAAArT,EAAA+O,EAAA3P,EAAA,KAAA,MAGA0G,EAAAuB,6BAAA0H,EAAA3P,IAGA0X,EAAA7K,IAAA,CACA8K,QAAA,GAEA,IAAAC,EAAA,SAAA5C,EAAAC,QACA,IAAAA,IAAAA,GAAA,GACAvO,EAAAqO,UAAAC,EAAAC,IAEA4C,EAAA,WACA,GAAA,IAAAjL,UAAAtQ,OAAA;AACA,GAAAsQ,UAAA,aAAA3P,SAAAqD,MAAAC,QAAAqM,UAAA,IAEA,YADAgL,EAAAhL,UAAA,IAGA,GAAA,iBAAAA,UAAA,GACA,OAAAlG,EAAAmO,mBAAAjI,UAAA,IAGA,GAAA,IAAAA,UAAAtQ,QAAA,IAAAsQ,UAAAtQ,SACAgE,MAAAC,QAAAqM,UAAA,IAKA,MAAA,IAAAxL,MAAA,6BAJAsF,EAAAuN,aAAAlY,EAAA4C,UAAA8B,0BAAAmM,UAAA,GAAAA,UAAA,GAAAA,UAAA,GAAA,OAsBA,SAAAkL,IACA,QAAA,IAAA/b,EAAAW,OAAAyN,SAAA,oBAAAA,QAAA,CACA,IAAA4N,EAAAhc,EAAAW,OAAAyN,SAAAA,QACA,GAAA,mBAAA4N,GAAA,mBAAAA,EAAAzN,QAAA,CAEA,IAAAzG,EAAA,SAAAmU,GACAtR,EAAA6C,cAAA9K,OAAA,GAAAuZ,GACA,IACA,OAAAD,EAAAC,GAEA,QACAtR,EAAA6C,cAAA9K,OAAA,GAAAuZ,KAGAjc,EAAAW,OAAAmH,YAAAA,EACAgU,EAAAhU,YAAAA,EACAgU,EAAAnB,iBAAA7S,GAGAL,EAAAQ,SAAAR,EAAAuD,oBACAvJ,OAAAC,QAAAoa,EACA1N,QAAA0N,IAGArU,EAAAuD,qBACAhL,EAAAW,OAAAZ,OAAA4b,GAEA3b,EAAAW,OAAAyN,QAAA0N,GA3CAA,EAAA/V,OAAA8V,EACAC,EAAA7Q,UAAA,WACA,OAAAN,EAAAM,YAAA3B,qBAEAwS,EAAAhF,MAAA,WACAnM,EAAAA,EAAAmM,SAEAgF,EAAAnE,aAAA,WACA,OAAAhN,EAAAgN,gBAEAmE,EAAApB,SAAA;AACA,OAAA/P,EAAAsN,mBAEA6D,EAAA/b,OAAA,WACA,OAAA4b,EAAAzM,MAAA,KAAA2B,YAgCA7Q,EAAA+b,KAAAA,EACA,mBAAA/b,EAAAW,OAAAZ,QAAAC,EAAAW,OAAAZ,OAAA+Q,MACAnG,EAAA,IAAA3K,EAAA4V,cAAAnO,EAAAzH,EAAAiT,mBAAAxL,GAAAkU,EAAAG,EAAA9b,EAAA4C,UAAAC,oCAEA,IAAA7C,EAAAW,OAAAyN,SAAA,mBAAApO,EAAAW,OAAAyN,SACA0N,EAAA/V,OAAA/F,EAAAW,OAAAyN,UAGArO,EAAA,WACA,OAAA4b,EAAAzM,MAAA,KAAA2B,aAEAC,IAAA6K,EAAA7K,IACA,oBAAAoL,iBACAH,KA3GA,CA8GA/b,IAAAA,EAAA,kDCxuDA,SAAgBmc,EAAaxO,EAAWyO,GAEvC,OAyBD,SAASC,EAASlT,EAAQiT,EAAqBE,EAAYC,EAAYC,GACtE,GAAID,GAAMD,EACT,OAED,MAAMG,EAAMH,GAAOC,EAAKD,GAAM,EAAK,EACnCD,EAAMlT,EAAGiT,EAASE,EAAIG,EAAKD,GAC3BH,EAAMlT,EAAGiT,EAASK,EAAM,EAAGF,EAAIC,GAC/B,GAAIJ,EAAQjT,EAAEsT,GAAMtT,EAAEsT,EAAM,KAAO,EAIlC,QAjCF,SAAmBtT,EAAQiT,EAAqBE,EAAYG,EAAaF,EAAYC,GACpF,IAAIE,EAAUJ,EAAIK,EAAWF,EAAM,EACnC,IAAK,IAAIpc,EAAIic,EAAIjc,GAAKkc,EAAIlc,IACzBmc,EAAInc,GAAK8I,EAAE9I,GAEZ,IAAK,IAAIA,EAAIic,EAAIjc,GAAKkc,EAAIlc,IACrBqc,EAAUD,EAEbtT,EAAE9I,GAAKmc,EAAIG,KACDA,EAAWJ,EAErBpT,EAAE9I,GAAKmc,EAAIE,KACDN,EAAQI,EAAIG,GAAWH,EAAIE,IAAY,EAEjDvT,EAAE9I,GAAKmc,EAAIG,KAGXxT,EAAE9I,GAAKmc,EAAIE,KAkBbE,CAAOzT,EAAGiT,EAASE,EAAIG,EAAKF,EAAIC,GAvChCH,CAAM1O,EAAMyO,EAAS,EAAGzO,EAAKpN,OAAS,EAAG,IAClCoN,EAsHR,SAAgBkP,EAAcC,EAAyBC,GACtD,IAAK,IAAI1c,EAAI,EAAGA,EAAIyc,EAAMvc,OAAQF,IAAK,CAGtC,GAAI0c,EAFYD,EAAMzc,IAGrB,OAAOA,EAIT,OAAQ;yQAhNTqB,EAAAsb,KAAA,SAAwBF,EAAqBG,EAAY,GACxD,OAAOH,EAAMA,EAAMvc,QAAU,EAAI0c,KAGlCvb,EAAAwb,MAAA,SAAyBC,GACxB,GAAmB,IAAfA,EAAI5c,OACP,MAAM,IAAI8E,MAAM,qBAGjB,MAAO,CAAC8X,EAAItP,MAAM,EAAGsP,EAAI5c,OAAS,GAAI4c,EAAIA,EAAI5c,OAAS,KAGxDmB,EAAAsR,OAAA,SAA0BoK,EAAmCC,EAAqCC,EAAsC,EAACnU,EAAGC,IAAMD,IAAMC,IACvJ,GAAIgU,IAAQC,EACX,OAAO,EAGR,IAAKD,IAAQC,EACZ,OAAO,EAGR,GAAID,EAAI7c,SAAW8c,EAAM9c,OACxB,OAAO,EAGR,IAAK,IAAIF,EAAI,EAAGC,EAAM8c,EAAI7c,OAAQF,EAAIC,EAAKD,IAC1C,IAAKid,EAAWF,EAAI/c,GAAIgd,EAAMhd,IAC7B,OAAO,EAIT,OAAO,GAGRqB,EAAA6b,aAAA,SAAgCT,EAAyB5Y,EAAQsZ,GAChE,IAAIC,EAAM,EACTC,EAAOZ,EAAMvc,OAAS,EAEvB,KAAOkd,GAAOC,GAAM,CACnB,MAAMjB,GAAQgB,EAAMC,GAAQ,EAAK,EAC3BC,EAAOH,EAAWV,EAAML,GAAMvY,GACpC,GAAIyZ,EAAO,EACVF,EAAMhB,EAAM,MACN,CAAA,KAAIkB,EAAO,GAGjB,OAAOlB,EAFPiB,EAAOjB,EAAM,GAKf,QAASgB,EAAM,IAQhB/b,EAAAkc,kBAAA,SAAqCd,EAAyBe,GAC7D,IAAIJ,EAAM,EAAGC,EAAOZ,EAAMvc,OAC1B,GAAa,IAATmd,EACH,OAAO,EAER,KAAOD,EAAMC,GAAM,CAClB,MAAMjB,EAAMrU,KAAK0V,OAAOL,EAAMC,GAAQ,GAClCG,EAAEf,EAAML,IACXiB,EAAOjB,EAEPgB,EAAMhB,EAAM,EAGd,OAAOgB,GASR/b,EAAAya,UAAAA,EA4CAza,EAAAqc,QAAA,SAA2BpQ,EAAwByO,GAClD,MAAMhc,EAAgB,GACtB,IAAI4d,OAAgC/W;CACpC,IAAK,MAAMgX,KAAW9B,EAAUxO,EAAKE,MAAM,GAAIuO,GACzC4B,GAAsD,IAAtC5B,EAAQ4B,EAAa,GAAIC,GAI7CD,EAAarb,KAAKsb,IAHlBD,EAAe,CAACC,GAChB7d,EAAOuC,KAAKqb,IAKd,OAAO5d,GAMRsB,EAAAwc,SAAA,SAA4BpB,GAC3B,OAAYA,EAAMqB,OAAOtS,KAAOA,IAMjCnK,EAAA0c,eAAA,SAA+Bpa,GAC9B,OAAQO,MAAMC,QAAQR,IAAuB,IAAfA,EAAIzD,QAQnCmB,EAAA2c,gBAAA,SAAmCra,GAClC,OAAOO,MAAMC,QAAQR,IAAQA,EAAIzD,OAAS,GAO3CmB,EAAA4c,SAAA,SAA4BxB,EAAyByB,GACpD,IAAKA,EACJ,OAAOzB,EAAMqB,OAAO,CAACF,EAASO,IACtB1B,EAAM5a,QAAQ+b,KAAaO,GAIpC,MAAMC,EAAoCvd,OAAOwH,OAAO,MACxD,OAAOoU,EAAMqB,OAAQO,IACpB,MAAMxa,EAAMqa,EAAMG,GAClB,OAAID,EAAKva,KAITua,EAAKva,IAAO,GAEL,MAITxC,EAAAid,YAAA,SAA+B7B,GAC9B,MAAM2B,EAAO,IAAIG,IACjB,OAAO9B,EAAMqB,OAAOF,IACfQ,EAAKI,IAAIZ,KAIbQ,EAAKK,IAAIb,IACF,KAOTvc,EAAAmb,WAAAA,EAkBAnb,EAAAqd,MAAA,SAAyBjC,EAAyBC,EAA0BiC,GAC3E,MAAMC,EAAQpC,EAAWC,EAAOC,GAChC,OAAOkC,EAAQ,EAAID,EAAgBlC,EAAMmC,IAK1Cvd,EAAAwd,eAAA,SAAgDpC,EAAyBkC,GACxE,OAAOlC,EAAMvc,OAAS,EAAIuc,EAAM,GAAKkC,GAGtCtd,EAAAyd,QAAA,SAA2BhC,GAC1B,MAAa,GAAI9V,UAAU8V,IAK5Bzb,EAAA0d,MAAA,SAAsBC,EAAapW,GAClC,IAAID,EAAqB,iBAAPC,EAAkBoW,EAAM,EAExB,iBAAPpW,EACVD,EAAOqW,GAEPrW,EAAO,EACPC,EAAKoW,GAGN,MAAMjf,EAAmB,GAEzB,GAAI4I,GAAQC,EACX,IAAK,IAAI5I,EAAI2I,EAAM3I,EAAI4I,EAAI5I,IAC1BD,EAAOuC,KAAKtC,QAGb,IAAK,IAAIA,EAAI2I,EAAM3I,EAAI4I,EAAI5I,IAC1BD,EAAOuC,KAAKtC,GAId,OAAOD,GAORsB,EAAA4d,YAAA,SAA+BC,EAAaC,EAAqBC,GAChE,MAAMC,EAASH,EAAO1R,MAAM,EAAG2R,GACzBG,EAAQJ,EAAO1R,MAAM2R,GAC3B,OAAOE,EAAOrY,OAAOoY,EAAWE,IAMjCje,EAAAke,YAAA,SAA+BzC,EAAU1Y,GACxC,MAAMwa,EAAQ9B,EAAIjb,QAAQuC;CAEtBwa,GAAS,IACZ9B,EAAI0C,OAAOZ,EAAO,GAClB9B,EAAI2C,QAAQrb,KAOd/C,EAAAqe,UAAA,SAA6B5C,EAAU1Y,GACtC,MAAMwa,EAAQ9B,EAAIjb,QAAQuC,GAEtBwa,GAAS,IACZ9B,EAAI0C,OAAOZ,EAAO,GAClB9B,EAAIxa,KAAK8B,KAIX/C,EAAAse,QAAA,SAA2BC,GAC1B,OAAO1b,MAAMC,QAAQyb,GAAKA,EAAI,CAACA,yHCrShCve,EAAAwe,WAAA,MA8BCC,YAAYC,EAAuBC,EAAwBC,EAAuBC,GAEjF9f,KAAK2f,cAAgBA,EACrB3f,KAAK4f,eAAiBA,EACtB5f,KAAK6f,cAAgBA,EACrB7f,KAAK8f,eAAiBA,EAMhBJ,iBACN,OAAO1f,KAAK2f,cAAgB3f,KAAK4f,eAM3BF,iBACN,OAAO1f,KAAK6f,cAAgB7f,KAAK8f,4SC/CnC,MAAaC,EAIZL,cAEC1f,KAAKggB,UAAY,GAEjBhgB,KAAKigB,uBAAyB,SAAU7U,GACvCuG,WAAW,KACV,GAAIvG,EAAErG,MACL,MAAM,IAAIH,MAAMwG,EAAEvG,QAAU,OAASuG,EAAErG,OAGxC,MAAMqG,GACJ,IAIGsU,KAAKtU,GACZpL,KAAKggB,UAAUE,QAASC;AACvBA,EAAS/U,KAIXsU,kBAAkBtU,GACjBpL,KAAKigB,uBAAuB7U,GAC5BpL,KAAKogB,KAAKhV,GAIXsU,0BAA0BtU,GACzBpL,KAAKigB,uBAAuB7U,IAhC9BnK,EAAA8e,aAAAA,EAoCa9e,EAAAof,aAAe,IAAIN,EAEhC9e,EAAAqf,kBAAA,SAAkClV,GAE5BmV,EAAuBnV,IAC3BnK,EAAAof,aAAaC,kBAAkBlV,IAKjCnK,EAAAuf,0BAAA,SAA0CpV,GAEpCmV,EAAuBnV,IAC3BnK,EAAAof,aAAaG,0BAA0BpV,IAUzCnK,EAAAwf,+BAAA,SAA+C5a,GAC9C,GAAIA,aAAiBjB,MAAO,CAC3B,IAAI8b,KAAEA,EAAI7b,QAAEA,GAAYgB,EAExB,MAAO,CACN8a,UAAU,EACVD,KAAAA,EACA7b,QAAAA,EACAE,MAL2Bc,EAAO+a,YAAoB/a,EAAOd,OAU/D,OAAOc,GAGR,MAAMgb,EAAe,WAKrB,SAAgBN,EAAuB1a,GACtC,OAAOA,aAAiBjB,OAASiB,EAAM6a,OAASG,GAAgBhb,EAAMhB,UAAYgc,EADnF5f,EAAAsf,uBAAAA,EAOAtf,EAAA6f,SAAA,WACC,MAAMjb,EAAQ,IAAIjB,MAAMic,GAExB,OADAhb,EAAM6a,KAAO7a,EAAMhB,QACZgB,GAGR5E,EAAA8f,gBAAA,SAAgCL,GAC/B,OAAIA,EACI,IAAI9b,MAAM,qBAAqB8b,KAE/B,IAAI9b,MAAM,qBAInB3D,EAAA+f,aAAA,SAA6BN,GAC5B,OAAIA,EACI,IAAI9b,MAAM,kBAAkB8b,KAE5B,IAAI9b,MAAM,qIC9GnB,SAAiBqc;AAEAA,EAAAC,GAAhB,SAA4BC,GAC3B,OAAOA,GAA0B,iBAAVA,GAAwD,mBAA3BA,EAAMC,OAAOC,WAGlE,MAAMC,EAAwB7gB,OAAO8gB,OAAO,IAC5BN,EAAAO,MAAhB,WACC,OAAOF,GAGSL,EAAAQ,OAAjB,UAA2BjE,SACpBA,GAGSyD,EAAA1Y,KAAhB,SAAwBmZ,GACvB,OAAOA,GAAYJ,GAGJL,EAAA3C,MAAhB,SAAyBoD,GACxB,OAAOA,EAASN,OAAOC,YAAYM,OAAO3d,OAG3Bid,EAAAW,KAAhB,SAAwBF,EAAuBG,GAC9C,IAAK,MAAMrE,KAAWkE,EACrB,GAAIG,EAAUrE,GACb,OAAO,EAGT,OAAO,GAGSyD,EAAAvD,OAAjB,UAA2BgE,EAAuBG,GACjD,IAAK,MAAMrE,KAAWkE,EACjBG,EAAUrE,WACPA,IAKQyD,EAAArJ,IAAjB,UAA2B8J,EAAuBpF,GACjD,IAAK,MAAMkB,KAAWkE,QACfpF,EAAGkB,IAIMyD,EAAAra,OAAjB,aAA8Bkb,GAC7B,IAAK,MAAMJ,KAAYI,EACtB,IAAK,MAAMtE,KAAWkE,QACflE,GASOyD,EAAAc,QAAhB,SAA2BL,EAAuBM,EAAiBC,OAAOC,mBACzE,MAAMC,EAAgB,GAEtB,GAAe,IAAXH,EACH,MAAO,CAACG,EAAUT,GAGnB,MAAML,EAAWK,EAASN,OAAOC,YAEjC,IAAK,IAAIzhB,EAAI,EAAGA,EAAIoiB,EAAQpiB,IAAK,CAChC,MAAM+hB,EAAON,EAASM,OAEtB,GAAIA,EAAKS,KACR,MAAO,CAACD,EAAUlB,EAASO,SAG5BW,EAASjgB,KAAKyf,EAAK3d,OAGpB,MAAO,CAACme,EAAU,CAAEzC,CAAC0B,OAAOC,UAAS,IAAYA,KA7EnD,CAAiBpgB,EAAAggB,WAAAhgB,EAAAggB,SAAQ;gKCoMzB,MAAMoB,EAKL3C,cACC1f,KAAKsiB,cAAgB,GACrBtiB,KAAKuiB,cAAgB9hB,OAAOwH,OAAO,MAGpCyX,OAAO8C,EAAkBjM,GACxBvW,KAAKsiB,cAAcE,GAAWjM,EAC9BvW,KAAKuiB,cAAchM,EAAIkM,eAAiBD,EAGzC9C,aAAa8C,GACZ,OAAOxiB,KAAKsiB,cAAcE,GAG3B9C,aAAanJ,GACZ,OAAOvW,KAAKuiB,cAAchM,EAAIkM,gBAAc,GAI9C,MAAMC,EAAQ,IAAIL,EACZM,EAAoB,IAAIN,EACxBO,EAAyB,IAAIP,EAyMnC,SAAgBQ,EAAuBC,EAAoBC,GAE1D,MAAMC,KAAqB,KAAVF,GACXG,KAAqB,IAAVH,GAQjB,OAAO,IAAII,EANQ,IAAFH,EAAmCE,EAAUD,KAClC,KAAVF,MACQ,IAAVA,GACG,IAAFC,EAAmCC,EAAUC,EACnC,IAAVH,IAhNlB,WAEC,SAASxjB,EAAOkjB,EAAkBW,EAAiBC,EAA8BD,EAASE,EAAmCD,GAC5HV,EAAMpjB,OAAOkjB,EAASW,GACtBR,EAAkBrjB,OAAOkjB,EAASY,GAClCR,EAAuBtjB,OAAOkjB,EAASa,GAGxC/jB,EAAM,EAAkB,WAExBA,EAAM,EAAoB,aAC1BA,EAAM,EAAc,OACpBA,EAAM,EAAgB,SACtBA,EAAM,EAAgB,SACtBA,EAAM,EAAe,QACrBA,EAAM,EAAc,OACpBA,EAAM,EAAqB,cAC3BA,EAAM,EAAmB,YACzBA,EAAM,EAAiB,UACvBA,EAAM,GAAgB,SACtBA,EAAM,GAAiB,UACvBA,EAAM,GAAmB,YACzBA,EAAM,GAAc,OACpBA,EAAM,GAAe,QAErBA,EAAM,GAAoB,YAAa,QACvCA,EAAM,GAAkB,UAAW,MACnCA,EAAM,GAAqB,aAAc,SACzCA,EAAM,GAAoB,YAAa,QACvCA,EAAM,GAAiB,UACvBA,EAAM,GAAiB,UAEvBA,EAAM,GAAgB,KACtBA,EAAM,GAAgB,KACtBA,EAAM,GAAgB,KACtBA,EAAM,GAAgB;AACtBA,EAAM,GAAgB,KACtBA,EAAM,GAAgB,KACtBA,EAAM,GAAgB,KACtBA,EAAM,GAAgB,KACtBA,EAAM,GAAgB,KACtBA,EAAM,GAAgB,KAEtBA,EAAM,GAAgB,KACtBA,EAAM,GAAgB,KACtBA,EAAM,GAAgB,KACtBA,EAAM,GAAgB,KACtBA,EAAM,GAAgB,KACtBA,EAAM,GAAgB,KACtBA,EAAM,GAAgB,KACtBA,EAAM,GAAgB,KACtBA,EAAM,GAAgB,KACtBA,EAAM,GAAgB,KACtBA,EAAM,GAAgB,KACtBA,EAAM,GAAgB,KACtBA,EAAM,GAAgB,KACtBA,EAAM,GAAgB,KACtBA,EAAM,GAAgB,KACtBA,EAAM,GAAgB,KACtBA,EAAM,GAAgB,KACtBA,EAAM,GAAgB,KACtBA,EAAM,GAAgB,KACtBA,EAAM,GAAgB,KACtBA,EAAM,GAAgB,KACtBA,EAAM,GAAgB,KACtBA,EAAM,GAAgB,KACtBA,EAAM,GAAgB,KACtBA,EAAM,GAAgB,KACtBA,EAAM,GAAgB,KAEtBA,EAAM,GAAe,QACrBA,EAAM,GAAsB,eAE5BA,EAAM,GAAa,MACnBA,EAAM,GAAa,MACnBA,EAAM,GAAa,MACnBA,EAAM,GAAa,MACnBA,EAAM,GAAa,MACnBA,EAAM,GAAa,MACnBA,EAAM,GAAa,MACnBA,EAAM,GAAa,MACnBA,EAAM,GAAa,MACnBA,EAAM,GAAc,OACpBA,EAAM,GAAc,OACpBA,EAAM,GAAc,OACpBA,EAAM,GAAc,OACpBA,EAAM,GAAc,OACpBA,EAAM,GAAc,OACpBA,EAAM,GAAc,OACpBA,EAAM,GAAc,OACpBA,EAAM,GAAc,OACpBA,EAAM,GAAc,OAEpBA,EAAM,GAAkB,WACxBA,EAAM,GAAqB,cAE3BA,EAAM,GAAuB,IAAK,IAAK,SACvCA,EAAM,GAAmB,IAAK,IAAK,YACnCA,EAAM,GAAmB,IAAK,IAAK,aACnCA,EAAM,GAAmB,IAAK,IAAK,aACnCA,EAAM,GAAiB,IAAK,IAAK,cACjCA,EAAM,GAAmB,IAAK,IAAK,SACnCA,EAAM,GAAsB,IAAK,IAAK,SACtCA,EAAM,IAAkB,WACxBA,EAAM,IAAkB,WACxBA,EAAM,GAAiC,IAAK,IAAK,SACjDA,EAAM,GAAuB,KAAM,KAAM,SACzCA,EAAM,GAAkC,IAAK,IAAK,SAClDA,EAAM,GAAmB,IAAM,IAAM,SACrCA,EAAM,GAAgB,SACtBA,EAAM,GAAkB,WAExBA,EAAM,GAAmB,WACzBA,EAAM,GAAmB,WACzBA,EAAM,GAAmB,WACzBA,EAAM,GAAmB,WACzBA,EAAM,GAAmB;AACzBA,EAAM,GAAmB,WACzBA,EAAM,GAAmB,WACzBA,EAAM,IAAmB,WACzBA,EAAM,IAAmB,WACzBA,EAAM,IAAmB,WAEzBA,EAAM,IAA0B,mBAChCA,EAAM,IAAqB,cAC3BA,EAAM,IAA2B,oBACjCA,EAAM,IAA0B,mBAChCA,EAAM,IAAyB,kBAC/BA,EAAM,IAAwB,iBAhI/B,GAoIA,SAAiBgkB,GACAA,EAAAC,SAAhB,SAAyBf,GACxB,OAAOE,EAAMc,aAAahB,IAEXc,EAAAG,WAAhB,SAA2BhgB,GAC1B,OAAOif,EAAMgB,aAAajgB,IAGX6f,EAAAK,iBAAhB,SAAiCnB,GAChC,OAAOG,EAAkBa,aAAahB,IAEvBc,EAAAM,sBAAhB,SAAsCpB,GACrC,OAAOI,EAAuBY,aAAahB,IAE5Bc,EAAAO,iBAAhB,SAAiCpgB,GAChC,OAAOkf,EAAkBe,aAAajgB,IAAQmf,EAAuBc,aAAajgB,IAfpF,CAAiBxC,EAAAqiB,eAAAriB,EAAAqiB,aAAY,KA+C7BriB,EAAA6iB,SAAA,SAAyBC,EAAmBC,GAE3C,OAAQD,GADyB,MAAbC,IAA4B,KAAQ,KACrB,GAGpC/iB,EAAAgjB,iBAAA,SAAiCnB,EAAoBC,GACpD,GAAmB,IAAfD,EACH,OAAO,KAER,MAAMiB,GAA0B,MAAbjB,KAA6B,EAC1CoB,GAA0B,WAAbpB,KAA6B,GAChD,OACQ,IAAIqB,EADM,IAAdD,EACwB,CAC1BrB,EAAuBkB,EAAWhB,GAClCF,EAAuBqB,EAAWnB,IAGT,CAACF,EAAuBkB,EAAWhB,MAG/D9hB,EAAA4hB,uBAAAA,EAcA,MAAaK,EAOZxD,YAAY0E,EAAkBC,EAAmBC,EAAiBC,EAAkB/B,GACnFxiB,KAAKokB,QAAUA,EACfpkB,KAAKqkB,SAAWA,EAChBrkB,KAAKskB,OAASA,EACdtkB,KAAKukB,QAAUA,EACfvkB,KAAKwiB,QAAUA,EAGT9C,OAAO9C;AACb,OACC5c,KAAKokB,UAAYxH,EAAMwH,SACpBpkB,KAAKqkB,WAAazH,EAAMyH,UACxBrkB,KAAKskB,SAAW1H,EAAM0H,QACtBtkB,KAAKukB,UAAY3H,EAAM2H,SACvBvkB,KAAKwiB,UAAY5F,EAAM4F,QAIrB9C,gBACN,OACa,IAAZ1f,KAAKwiB,SACU,IAAZxiB,KAAKwiB,SACO,KAAZxiB,KAAKwiB,SACO,IAAZxiB,KAAKwiB,SACO,IAAZxiB,KAAKwiB,QAIH9C,UACN,OAAO,IAAIyE,EAAgB,CAACnkB,OAMtB0f,0BACN,OACE1f,KAAKokB,SAAuB,IAAZpkB,KAAKwiB,SAClBxiB,KAAKqkB,UAAwB,IAAZrkB,KAAKwiB,SACtBxiB,KAAKskB,QAAsB,IAAZtkB,KAAKwiB,SACpBxiB,KAAKukB,SAAuB,KAAZvkB,KAAKwiB,SA/C5BvhB,EAAAiiB,iBAAAA,EAoDA,MAAaiB,EAGZzE,YAAY8E,GACX,GAAqB,IAAjBA,EAAM1kB,OACT,MAAM2kB,EAAA1D,gBAAgB,SAEvB/gB,KAAKwkB,MAAQA,GAPfvjB,EAAAkjB,gBAAAA,EAaAljB,EAAAyjB,uBAAA,MASChF,YAAY0E,EAAkBC,EAAmBC,EAAiBC,EAAkBI,EAAwBC,GAC3G5kB,KAAKokB,QAAUA,EACfpkB,KAAKqkB,SAAWA,EAChBrkB,KAAKskB,OAASA,EACdtkB,KAAKukB,QAAUA,EACfvkB,KAAK6kB,SAAWF,EAChB3kB,KAAK8kB,aAAeF,IAOtB3jB,EAAA8jB,mBAAA;CCvgBA,MAAMC,GAAoB,EAEpBC,EAA4B,4BAElC,SAASC,EAAmC1F,GAC3C,GAAKwF,GAIDxF,GAAKA,IAAM2F,EAAWC,KACzB,IACE5F,EAAUyF,IAA6B,EACvC,MAAA9c,KAMJ,SAASkd,EAAuC7F,GAC/C,IAAKwF,EACJ,OAAOxF,EAGR,MAAMza,EAAQ,IAAIH,MAAM,iCAAiCG,MAMzD,OALA4M,WAAW,KACJ6N,EAAUyF,IACfrf,QAAQ0f,IAAIvgB,IAEX,KACIya,EAGR,MAAa+F,UAA0B3gB,MACtC8a,YACiB8F,GAEhBC,MAAM,uDAAuDD,EAAOxU,KAAK,UAFzDhR,KAAAwlB,OAAAA,GAmBlB,SAAgBE,EAA+B9G,GAC9C,GAAI+G,EAAA1E,SAASC,GAAGtC,GAAM,CACrB,IAAI4G,EAAgB,GAEpB,IAAK,MAAMI,KAAKhH,EACf,GAAIgH,EAAG,CACNV,EAAYU,GACZ,IACCA,EAAEF,UACD,MAAOta,GACRoa,EAAOtjB,KAAKkJ,IAKf,GAAsB,IAAlBoa,EAAO1lB,OACV,MAAM0lB,EAAO,GACP,GAAIA,EAAO1lB,OAAS,EAC1B,MAAM,IAAIylB,EAAkBC,GAG7B,OAAO1hB,MAAMC,QAAQ6a,GAAO,GAAKA,EAC3B,GAAIA,EAGV,OAFAsG,EAAYtG,GACZA,EAAI8G,UACG9G,EA9CT3d,EAAAskB,kBAAAA,EAYAtkB,EAAA4kB,aAAA,SAA+C1E,GAC9C,MAA+C,mBAAnBA,EAAOuE,SAAkE,IAA1BvE,EAAOuE,QAAQ5lB,QAQ3FmB,EAAAykB,QAAAA,EA8BAzkB,EAAA6kB,mBAAA,YAAsCC,GAErC,OADAA,EAAY7F,QAAQgF,GACbG,EAAgB,CAAEK,QAAS,IAAMA,EAAQK,MAGjD9kB,EAAA+kB,aAAA,SAA6B1J,GAC5B,MAAM2J,EAAOZ,EAAgB,CAC5BK,QAAS,KACRR,EAAYe,GACZ3J,OAGF,OAAO2J,GAGR,MAAaC,EAAbxG,cAIS1f,KAAAmmB,WAAa,IAAIhI,IACjBne,KAAAomB,aAAc,EAOf1G,UACF1f,KAAKomB,cAITlB,EAAYllB,MACZA,KAAKomB,aAAc,EACnBpmB,KAAKqmB,SAMC3G,QACN;AACCgG,EAAQ1lB,KAAKmmB,WAAWG,kBAExBtmB,KAAKmmB,WAAWE,SAIX3G,IAA2B6G,GACjC,IAAKA,EACJ,OAAOA,EAER,GAAKA,IAAqCvmB,KACzC,MAAM,IAAI4E,MAAM,2CAYjB,OATAsgB,EAAYqB,GACRvmB,KAAKomB,YACHF,EAAgBM,0BACpB5gB,QAAQ8R,KAAK,IAAI9S,MAAM,uHAAuHG,OAG/I/E,KAAKmmB,WAAW9H,IAAIkI,GAGdA,GAlDTtlB,EAAAilB,gBAAAA,EAEQA,EAAAM,0BAA2B,EAoDnC,MAAsBrB,EAMrBzF,cAFiB1f,KAAAymB,OAAS,IAAIP,EAG7Bb,EAAgBrlB,MAGV0f,UACNwF,EAAYllB,MAEZA,KAAKymB,OAAOf,UAGHhG,UAAiC6G,GAC1C,GAAKA,IAAgCvmB,KACpC,MAAM,IAAI4E,MAAM,2CAEjB,OAAO5E,KAAKymB,OAAOpI,IAAIkI,IApBzBtlB,EAAAkkB,WAAAA,EAEiBA,EAAAC,KAAO3kB,OAAO8gB,OAAoB,CAAE7B,cA4BrDze,EAAAylB,kBAAA,MAIChH,cAFQ1f,KAAAomB,aAAc,EAGrBf,EAAgBrlB,MAGjBgE,YACC,OAAOhE,KAAKomB,iBAAc5f,EAAYxG,KAAK2mB,OAG5C3iB,UAAUA,GACLhE,KAAKomB,aAAepiB,IAAUhE,KAAK2mB,SAInC3mB,KAAK2mB,QACR3mB,KAAK2mB,OAAOjB,UAET1hB,GACHkhB,EAAYlhB,GAEbhE,KAAK2mB,OAAS3iB,GAGf0b,QACC1f,KAAKgE,WAAQwC,EAGdkZ,UACC1f,KAAKomB,aAAc,EACnBlB,EAAYllB,MACRA,KAAK2mB,QACR3mB,KAAK2mB,OAAOjB;AAEb1lB,KAAK2mB,YAASngB,IAQhBvF,EAAA2lB,kBAAA,MACClH,YAAmBmH,GAAA7mB,KAAA6mB,OAAAA,EACnBnH,kICzOD,MAAMoH,EAQLpH,YAAYlC,GACXxd,KAAKwd,QAAUA,EACfxd,KAAK2hB,KAAOmF,EAAKC,UACjB/mB,KAAKgnB,KAAOF,EAAKC,WATFD,EAAAC,UAAY,IAAID,OAAUtgB,GAa3CvF,EAAAgmB,WAAA,MAAAvH,cAES1f,KAAAknB,OAAkBJ,EAAKC,UACvB/mB,KAAAmnB,MAAiBL,EAAKC,UACtB/mB,KAAAonB,MAAgB,EAExBC,WACC,OAAOrnB,KAAKonB,MAGb1H,UACC,OAAO1f,KAAKknB,SAAWJ,EAAKC,UAG7BrH,QACC1f,KAAKknB,OAASJ,EAAKC,UACnB/mB,KAAKmnB,MAAQL,EAAKC,UAClB/mB,KAAKonB,MAAQ,EAGd1H,QAAQlC,GACP,OAAOxd,KAAKsnB,QAAQ9J,GAAS,GAG9BkC,KAAKlC,GACJ,OAAOxd,KAAKsnB,QAAQ9J,GAAS,GAGtBkC,QAAQlC,EAAY+J,GAC3B,MAAMC,EAAU,IAAIV,EAAKtJ,GACzB,GAAIxd,KAAKknB,SAAWJ,EAAKC,UACxB/mB,KAAKknB,OAASM,EACdxnB,KAAKmnB,MAAQK,OAEP,GAAID,EAAU,CAEpB,MAAME,EAAUznB,KAAKmnB,MACrBnnB,KAAKmnB,MAAQK,EACbA,EAAQR,KAAOS,EACfA,EAAQ9F,KAAO6F,MAET,CAEN,MAAME,EAAW1nB,KAAKknB,OACtBlnB,KAAKknB,OAASM,EACdA,EAAQ7F,KAAO+F,EACfA,EAASV,KAAOQ,EAEjBxnB,KAAKonB,OAAS,EAEd,IAAIO,GAAY,EAChB,MAAO,KACDA,IACJA,GAAY,EACZ3nB,KAAK4nB,QAAQJ,KAKhB9H,QACC,GAAI1f,KAAKknB,SAAWJ,EAAKC,UAElB,CACN,MAAMc,EAAM7nB,KAAKknB,OAAO1J,QAExB,OADAxd,KAAK4nB,QAAQ5nB,KAAKknB,QACXW,GAITnI,MACC,GAAI1f,KAAKmnB,QAAUL,EAAKC,UAEjB;AACN,MAAMc,EAAM7nB,KAAKmnB,MAAM3J,QAEvB,OADAxd,KAAK4nB,QAAQ5nB,KAAKmnB,OACXU,GAIDnI,QAAQoI,GACf,GAAIA,EAAKd,OAASF,EAAKC,WAAae,EAAKnG,OAASmF,EAAKC,UAAW,CAEjE,MAAMgB,EAASD,EAAKd,KACpBe,EAAOpG,KAAOmG,EAAKnG,KACnBmG,EAAKnG,KAAKqF,KAAOe,OAEPD,EAAKd,OAASF,EAAKC,WAAae,EAAKnG,OAASmF,EAAKC,WAE7D/mB,KAAKknB,OAASJ,EAAKC,UACnB/mB,KAAKmnB,MAAQL,EAAKC,WAERe,EAAKnG,OAASmF,EAAKC,WAE7B/mB,KAAKmnB,MAAQnnB,KAAKmnB,MAAOH,KACzBhnB,KAAKmnB,MAAMxF,KAAOmF,EAAKC,WAEbe,EAAKd,OAASF,EAAKC,YAE7B/mB,KAAKknB,OAASlnB,KAAKknB,OAAQvF,KAC3B3hB,KAAKknB,OAAOF,KAAOF,EAAKC,WAIzB/mB,KAAKonB,OAAS,EAGf1H,EAAE0B,OAAOC,YACR,IAAIyG,EAAO9nB,KAAKknB,OAChB,KAAOY,IAAShB,EAAKC,iBACde,EAAKtK,QACXsK,EAAOA,EAAKnG,KAIdjC,UACC,MAAM/f,EAAc,GACpB,IAAK,IAAImoB,EAAO9nB,KAAKknB,OAAQY,IAAShB,EAAKC,UAAWe,EAAOA,EAAKnG,KACjEhiB,EAAOuC,KAAK4lB,EAAKtK,SAElB,OAAO7d,gEC1HT,IAAiBqoB,uHAAjB,SAAiBA,GAMhB,SAAgBC,EAAQC,GACvB,MAAO,CAAC/H,EAAUgI,EAAW,KAAMpC,KAElC,IACIpmB,EADAyoB,GAAU,EAkBd,OAhBAzoB,EAASuoB,EAAM9c,IACd,IAAIgd,EAQJ,OANWzoB,EACVA,EAAO+lB,UAEP0C,GAAU,EAGJjI,EAAS7P,KAAK6X,EAAU/c,IAC7B,KAAM2a,GAELqC,GACHzoB,EAAO+lB,UAGD/lB,GAQT,SAAgBiY,EAAUsQ,EAAiBtQ,GAC1C,OAAOyQ,EAAS,CAAClI,EAAUgI,EAAW,KAAMpC,IAAiBmC,EAAMtoB,GAAKugB,EAAS7P,KAAK6X,EAAUvQ,EAAIhY,IAAK,KAAMmmB;AAOhH,SAAgB7F,EAAWgI,EAAiBI,GAC3C,OAAOD,EAAS,CAAClI,EAAUgI,EAAW,KAAMpC,IAAiBmC,EAAMtoB,IAAO0oB,EAAK1oB,GAAIugB,EAAS7P,KAAK6X,EAAUvoB,IAAO,KAAMmmB,IASzH,SAAgBrI,EAAUwK,EAAiBxK,GAC1C,OAAO2K,EAAS,CAAClI,EAAUgI,EAAW,KAAMpC,IAAiBmC,EAAM9c,GAAKsS,EAAOtS,IAAM+U,EAAS7P,KAAK6X,EAAU/c,GAAI,KAAM2a,IAwBxH,SAAgBwC,EAAaL,EAAiBM,EAA6CC,GAC1F,IAAIC,EAAwBD,EAE5B,OAAO7Q,EAAUsQ,EAAO9c,GACvBsd,EAASF,EAAME,EAAQtd,IAUzB,SAAgBid,EAAYH,GAC3B,IAAI/H,EACJ,MAAMwI,EAAU,IAAIC,EAAW,CAC9BlJ,qBACCS,EAAW+H,EAAMS,EAAQE,KAAMF,IAEhCjJ,uBACCS,EAASuF,aAIX,OAAOiD,EAAQT,MAchB,SAAgBY,EAAeZ,EAAiBM,EAA6CO,EAAgB,IAAKC,GAAU,EAAOC,GAElI,IAAIC,EACAR,OAAwBliB,EACxB2iB,OAAc3iB,EACd4iB,EAAoB,EAExB,MAAMT,EAAU,IAAIC,EAAW,CAC9BK,qBAAAA,EACAvJ,qBACCwJ,EAAehB,EAAMmB,IACpBD,IACAV,EAASF,EAAME,EAAQW,GAEnBL,IAAYG,IACfR,EAAQE,KAAKH,GACbA,OAASliB,GAGV8iB,aAAaH,GACbA,EAASxX,WAAW,KACnB,MAAM4X,EAAUb,EAChBA,OAASliB,EACT2iB,OAAS3iB,IACJwiB,GAAWI,EAAoB,IACnCT,EAAQE,KAAKU,GAGdH,EAAoB,GAClBL,MAGLrJ,uBACCwJ,EAAaxD,aAIf,OAAOiD,EAAQT,MAiBhB,SAAgBsB,EAAStB,GACxB,IACI9Z,EADAqb,GAAY,EAGhB,OAAO/L,EAAOwK,EAAOlkB,IACpB,MAAM0lB,EAAaD,GAAazlB,IAAUoK,EAG1C,OAFAqb,GAAY,EACZrb,EAAQpK,EACD0lB,IAlLI1B,EAAA5C,KAAmB,IAAMuE,EAAAxE,WAAWC,KAKjC4C,EAAAC,KAAIA,EA6BJD,EAAApQ,IAAGA,EAQHoQ,EAAA9H,QAAOA,EAUP8H,EAAAtK,OAAMA,EAONsK,EAAA4B,OAAhB,SAA0B1B,GACzB,OAAOA,GASQF,EAAA6B,IAAhB,YAA0BC,GACzB,MAAO,CAAC3J,EAAUgI,EAAW,KAAMpC,IAAiB4D,EAAA7D,sBAAsBgE,EAAOlS,IAAIsQ,GAASA,EAAM9c,GAAK+U,EAAS7P,KAAK6X,EAAU/c,GAAI,KAAM2a,MAO5HiC,EAAAO,OAAMA,EAcNP,EAAAK,SAAQA,EAyBRL,EAAAc,SAAQA,EA6CRd,EAAA+B,UAAhB,SAA6B7B,GAC5B,MAAM8B,GAAQ,IAAIvlB,MAAOwlB;CACzB,OAAOrS,EAAIqQ,EAAKC,GAAQgC,IAAK,IAAIzlB,MAAOwlB,UAAYD,IAOrChC,EAAAwB,MAAKA,EAkCLxB,EAAAmC,OAAhB,SAA0BjC,EAAiBkC,GAAW,EAAOC,EAAe,IAC3E,IAAIF,EAAqBE,EAAQjd,QAE7B+S,EAA+B+H,EAAM9c,IACpC+e,EACHA,EAAOjoB,KAAKkJ,GAEZud,EAAQE,KAAKzd,KAIf,MAAMkf,EAAQ,KACTH,GACHA,EAAOjK,QAAQ9U,GAAKud,EAAQE,KAAKzd,IAElC+e,EAAS,MAGJxB,EAAU,IAAIC,EAAW,CAC9BlJ,qBACMS,IACJA,EAAW+H,EAAM9c,GAAKud,EAAQE,KAAKzd,MAIrCsU,wBACKyK,IACCC,EACHzY,WAAW2Y,GAEXA,MAKH5K,uBACKS,GACHA,EAASuF,UAEVvF,EAAW,QAIb,OAAOwI,EAAQT,OAiBhB,MAAMqC,EAEL7K,YAAqBwI,GAAAloB,KAAAkoB,MAAAA,EAErBxI,IAAOpD,GACN,OAAO,IAAIiO,EAAe3S,EAAI5X,KAAKkoB,MAAO5L,IAG3CoD,QAAQpD,GACP,OAAO,IAAIiO,EAAerK,EAAQlgB,KAAKkoB,MAAO5L,IAK/CoD,OAAOpD,GACN,OAAO,IAAIiO,EAAe7M,EAAO1d,KAAKkoB,MAAO5L,IAG9CoD,OAAU8I,EAA6CC,GACtD,OAAO,IAAI8B,EAAehC,EAAOvoB,KAAKkoB,MAAOM,EAAOC,IAGrD/I,QACC,OAAO,IAAI6K,EAAef,EAAMxpB,KAAKkoB,QAKtCxI,SAAY8I,EAA6CO,EAAgB,IAAKC,GAAU,EAAOC,GAC9F,OAAO,IAAIsB,EAAezB,EAAS9oB,KAAKkoB,MAAOM,EAAOO,EAAOC,EAASC,IAGvEvJ,GAAGS,EAAyBgI,EAAepC,GAC1C,OAAO/lB,KAAKkoB,MAAM/H,EAAUgI,EAAUpC,GAGvCrG,KAAKS,EAAyBgI,EAAepC,GAC5C,OAAOkC,EAAKjoB,KAAKkoB,MAAVD,CAAiB9H,EAAUgI,EAAUpC,IAI9BiC,EAAAwC,MAAhB,SAAyBtC,GACxB,OAAO,IAAIqC,EAAerC,IAQXF,EAAAyC,qBAAhB,SAAwC9B,EAA2B+B,EAAmB9S,EAA6BxT,CAAAA,GAAMA,IACxH,MAAMkY,EAAK,IAAI/N,IAAgB5O,EAAOkpB,KAAKjR,KAAOrJ,IAG5C5O,EAAS,IAAIipB,EAAW,CAAE+B,mBAFL,IAAMhC,EAAQiC,GAAGF,EAAWpO,GAEHuO,qBADvB,IAAMlC,EAAQmC,eAAeJ,EAAWpO,KAGrE,OAAO3c,EAAOuoB,OAQCF,EAAA+C,oBAAhB,SAAuCpC,EAA0B+B,EAAmB9S,EAA6BxT,CAAAA,GAAMA;AACtH,MAAMkY,EAAK,IAAI/N,IAAgB5O,EAAOkpB,KAAKjR,KAAOrJ,IAG5C5O,EAAS,IAAIipB,EAAW,CAAE+B,mBAFL,IAAMhC,EAAQtd,iBAAiBqf,EAAWpO,GAEjBuO,qBADvB,IAAMlC,EAAQ1d,oBAAoByf,EAAWpO,KAG1E,OAAO3c,EAAOuoB,OAGCF,EAAAgD,YAAhB,SAAqCC,GACpC,MAAMtC,EAAU,IAAIC,EACpB,IAAIc,GAAa,EAajB,OAXAuB,EACEC,UAAK1kB,EAAW,IAAM,MACtB0kB,KAAK,KACAxB,EAGJf,EAAQE,UAAKriB,GAFbmL,WAAW,IAAMgX,EAAQE,UAAKriB,GAAY,KAM7CkjB,GAAa,EACNf,EAAQT,OAGAF,EAAAmD,UAAhB,SAA6BjD,GAC5B,OAAO,IAAIkD,QAAQtc,GAAKmZ,EAAKC,EAALD,CAAYnZ,KArWtC,CAAiBkZ,EAAA/mB,EAAA+mB,QAAA/mB,EAAA+mB,MAAK,KAmXtB,IAAIqD,GAA+B,EAEnC,MAAMC,EAKL5L,YACU6L,EACA7K,EAAe/Y,KAAK4J,SAASgS,SAAS,IAAInW,MAAM,EAAG,IADnDpN,KAAAurB,gBAAAA,EACAvrB,KAAA0gB,KAAAA,EAJF1gB,KAAAwrB,eAAyB,EAOjC9L,UACK1f,KAAKyrB,SACRzrB,KAAKyrB,QAAQpF,QAIf3G,MAAMgM,GAEL,IAAIC,EAAYN,EAKhB,GAJoC,iBAAzBrrB,KAAKurB,kBACfI,EAAY3rB,KAAKurB,iBAGdI,GAAa,GAAKD,EAAgBC,EACrC,OAGI3rB,KAAKyrB,UACTzrB,KAAKyrB,QAAU,IAAInX,KAEpB,MAAMvP,GAAQ,IAAIH,OAAQG,MAAOwG,MAAM,MAAM6B,MAAM,GAAG4D,KAAK,MACrD4a,EAAS5rB,KAAKyrB,QAAQ7qB,IAAImE,IAAU,EAI1C,GAHA/E,KAAKyrB,QAAQ/W,IAAI3P,EAAO6mB,EAAQ,GAChC5rB,KAAKwrB,gBAAkB,EAEnBxrB,KAAKwrB,gBAAkB,EAAG,CAM7B,IAAIK,EAHJ7rB,KAAKwrB,eAA6B,GAAZG,EAItB,IAAIG,EAAmB,EACvB,IAAK,MAAO/mB,EAAO6mB,KAAU5rB,KAAKyrB,UAC5BI,GAAYC,EAAWF,KAC3BC,EAAW9mB,EACX+mB,EAAWF;CAIbhmB,QAAQ8R,KAAK,IAAI1X,KAAK0gB,kDAAkDgL,gDAA4DI,OACpIlmB,QAAQ8R,KAAKmU,GAGd,MAAO,KACN,MAAMD,EAAS5rB,KAAKyrB,QAAS7qB,IAAImE,IAAU,EAC3C/E,KAAKyrB,QAAS/W,IAAI3P,EAAO6mB,EAAQ,KA0BpC,MAAahD,EAWZlJ,YAAYxa,GALJlF,KAAA+rB,WAAqB,EAM5B/rB,KAAKgsB,SAAW9mB,EAChBlF,KAAKisB,YAAcZ,EAA8B,EAC9C,IAAIC,EAAetrB,KAAKgsB,UAAYhsB,KAAKgsB,SAAS/C,2BAClDziB,EAOJ0hB,YAwDC,OAvDKloB,KAAKksB,SACTlsB,KAAKksB,OAAS,CAAC/L,EAAyBgI,EAAgBpC,KAClD/lB,KAAKmsB,aACTnsB,KAAKmsB,WAAa,IAAIC,EAAAnF,YAGvB,MAAMoF,EAAgBrsB,KAAKmsB,WAAWxoB,UAElC0oB,GAAiBrsB,KAAKgsB,UAAYhsB,KAAKgsB,SAASrB,oBACnD3qB,KAAKgsB,SAASrB,mBAAmB3qB,MAGlC,MAAMssB,EAAStsB,KAAKmsB,WAAWjqB,KAAMimB,EAAsB,CAAChI,EAAUgI,GAAtBhI,GAWhD,IAAIoM,EAKA5sB,EAwBJ,OAtCI0sB,GAAiBrsB,KAAKgsB,UAAYhsB,KAAKgsB,SAASQ,uBACnDxsB,KAAKgsB,SAASQ,sBAAsBxsB,MAGjCA,KAAKgsB,UAAYhsB,KAAKgsB,SAASS,kBAClCzsB,KAAKgsB,SAASS,iBAAiBzsB,KAAMmgB,EAAUgI,GAK5CnoB,KAAKisB,cACRM,EAAgBvsB,KAAKisB,YAAYS,MAAM1sB,KAAKmsB,WAAW9E,OAIxD1nB,EAAS,CACR+lB,QAAS,KAKR,GAJI6G,GACHA,IAED5sB,EAAO+lB,QAAUkD,EAAQ+D,OACpB3sB,KAAK+rB,YACTO,IACItsB,KAAKgsB,UAAYhsB,KAAKgsB,SAASnB,sBAAsB;AAClC7qB,KAAKmsB,aAAensB,KAAKmsB,WAAWxoB,WAEzD3D,KAAKgsB,SAASnB,qBAAqB7qB,SAMpC+lB,aAAuB4D,EAAAzD,gBAC1BH,EAAY1H,IAAI1e,GACNmE,MAAMC,QAAQgiB,IACxBA,EAAY7jB,KAAKvC,GAGXA,IAGFK,KAAKksB,OAObxM,KAAKwI,GACJ,GAAIloB,KAAKmsB,WAAY,CAKfnsB,KAAK4sB,iBACT5sB,KAAK4sB,eAAiB,IAAIR,EAAAnF,YAG3B,IAAK,IAAI9G,KAAYngB,KAAKmsB,WACzBnsB,KAAK4sB,eAAe1qB,KAAK,CAACie,EAAU+H,IAGrC,KAAOloB,KAAK4sB,eAAevF,KAAO,GAAG,CACpC,MAAOlH,EAAU+H,GAASloB,KAAK4sB,eAAevT,QAC9C,IACyB,mBAAb8G,EACVA,EAAS7P,UAAK9J,EAAW0hB,GAEzB/H,EAAS,GAAG7P,KAAK6P,EAAS,GAAI+H,GAE9B,MAAO9c,GACRqZ,EAAAnE,kBAAkBlV,MAMtBsU,UACK1f,KAAKmsB,YACRnsB,KAAKmsB,WAAW9F,QAEbrmB,KAAK4sB,gBACR5sB,KAAK4sB,eAAevG,QAEjBrmB,KAAKisB,aACRjsB,KAAKisB,YAAYvG,UAElB1lB,KAAK+rB,WAAY,GA5HnB9qB,EAAA2nB,QAAAA,EAEyBA,EAAA+D,MAAQ,aA8HjC1rB,EAAA4rB,iBAAA,cAAyCjE,EAMxClJ,YAAYxa,GACXugB,MAAMvgB,GALClF,KAAA8sB,UAAY,EACZ9sB,KAAA+sB,YAAc,IAAIX,EAAAnF,WAKzBjnB,KAAKgtB,SAAW9nB,GAAWA,EAAQsjB,MAGpC9I,QACC1f,KAAK8sB,YAGNpN,SACC,GAAuB,IAAnB1f,KAAK8sB,WAAwC,KAAnB9sB,KAAK8sB,UAClC,GAAI9sB,KAAKgtB,SAAU,CAGlB,MAAMlD,EAAS9pB,KAAK+sB,YAAYE,UAChCjtB,KAAK+sB,YAAY1G,QACjBZ,MAAMoD,KAAK7oB,KAAKgtB,SAASlD;MAKzB,MAAQ9pB,KAAK8sB,WAAuC,IAA1B9sB,KAAK+sB,YAAY1F,MAC1C5B,MAAMoD,KAAK7oB,KAAK+sB,YAAY1T,SAMhCqG,KAAKwI,GACAloB,KAAKmsB,aACe,IAAnBnsB,KAAK8sB,UACR9sB,KAAK+sB,YAAY7qB,KAAKgmB,GAEtBzC,MAAMoD,KAAKX,MA0BfjnB,EAAAisB,cAAA,MAAAxN,cAES1f,KAAAmtB,QAAwB,GAEhCzN,UAAawI,GACZ,MAAO,CAAC/H,EAAUgI,EAAWpC,IACrBmC,EAAMtoB,IACZ,MAAMuqB,EAASnqB,KAAKmtB,QAAQntB,KAAKmtB,QAAQrtB,OAAS,GAE9CqqB,EACHA,EAAOjoB,KAAK,IAAMie,EAAS7P,KAAK6X,EAAUvoB,IAE1CugB,EAAS7P,KAAK6X,EAAUvoB,SAEvB4G,EAAWuf,GAIhBrG,aAAuBpD,GACtB,MAAM6N,EAAyB,GAC/BnqB,KAAKmtB,QAAQjrB,KAAKioB,GAClB,MAAMpX,EAAIuJ,IAGV,OAFAtc,KAAKmtB,QAAQC,MACbjD,EAAOjK,QAAQoK,GAASA,KACjBvX,IAUT9R,EAAAosB,MAAA,MAAA3N,cAES1f,KAAAstB,WAAY,EACZttB,KAAAutB,WAAuBvF,EAAM5C,KAC7BplB,KAAAwtB,mBAAkC7D,EAAAxE,WAAWC,KAEpCplB,KAAA2oB,QAAU,IAAIC,EAAW,CACzC4D,sBAAuB,KACtBxsB,KAAKstB,WAAY,EACjBttB,KAAKwtB,mBAAqBxtB,KAAKutB,WAAWvtB,KAAK2oB,QAAQE,KAAM7oB,KAAK2oB,UAEnEkC,qBAAsB,KACrB7qB,KAAKstB,WAAY,EACjBttB,KAAKwtB,mBAAmB9H,aAIjB1lB,KAAAkoB,MAAkBloB,KAAK2oB,QAAQT,MAExCuF,UAAUvF,GACTloB,KAAKutB,WAAarF,EAEdloB,KAAKstB,YACRttB,KAAKwtB,mBAAmB9H,UACxB1lB,KAAKwtB,mBAAqBtF,EAAMloB,KAAK2oB,QAAQE,KAAM7oB,KAAK2oB,UAI1DjJ,UACC1f,KAAKwtB,mBAAmB9H;AACxB1lB,KAAK2oB,QAAQjD,sKC/rBf,MAAMgI,EAA4BjtB,OAAO8gB,QAAO,SAAU/d,EAAUmqB,GACnE,MAAMxE,EAASxX,WAAWnO,EAASoqB,KAAKD,GAAU,GAClD,MAAO,CAAEjO,UAAY4J,aAAaH,QAGnC,IAAiB0E,GAAjB,SAAiBA,GAEAA,EAAAC,oBAAhB,SAAoC3M,GACnC,OAAIA,IAAU0M,EAAkBzI,MAAQjE,IAAU0M,EAAkBE,YAGhE5M,aAAiB6M,MAGhB7M,GAA0B,iBAAVA,KAGkD,kBAAxDA,EAA4B8M,yBACyB,mBAAxD9M,EAA4B+M,2BAI5BL,EAAAzI,KAA0B3kB,OAAO8gB,OAAO,CACpD0M,yBAAyB,EACzBC,wBAAyBC,EAAAnG,MAAM5C,OAGnByI,EAAAE,UAA+BttB,OAAO8gB,OAAO,CACzD0M,yBAAyB,EACzBC,wBAAyBR,IAxB3B,CAAiBG,EAAA5sB,EAAA4sB,oBAAA5sB,EAAA4sB,kBAAiB,KA4BlC,MAAMG,EAANtO,cAES1f,KAAAouB,cAAwB,EACxBpuB,KAAAquB,SAAgC,KAEjC3O,SACD1f,KAAKouB,eACTpuB,KAAKouB,cAAe,EAChBpuB,KAAKquB,WACRruB,KAAKquB,SAASxF,UAAKriB,GACnBxG,KAAK0lB,YAKRuI,8BACC,OAAOjuB,KAAKouB,aAGbF;AACC,OAAIluB,KAAKouB,aACDV,GAEH1tB,KAAKquB,WACTruB,KAAKquB,SAAW,IAAIF,EAAAvF,SAEd5oB,KAAKquB,SAASnG,OAGfxI,UACF1f,KAAKquB,WACRruB,KAAKquB,SAAS3I,UACd1lB,KAAKquB,SAAW,OAKnBptB,EAAAqtB,wBAAA,MAKC5O,YAAY6O,GAHJvuB,KAAAwuB,YAA6BhoB,EAC7BxG,KAAAyuB,qBAAgCjoB,EAGvCxG,KAAKyuB,gBAAkBF,GAAUA,EAAOL,wBAAwBluB,KAAK0uB,OAAQ1uB,MAG9E2uB,YAMC,OALK3uB,KAAKwuB,SAGTxuB,KAAKwuB,OAAS,IAAIR,GAEZhuB,KAAKwuB,OAGb9O,SACM1f,KAAKwuB,OAMCxuB,KAAKwuB,kBAAkBR,GAEjChuB,KAAKwuB,OAAOE,SAJZ1uB,KAAKwuB,OAASX,EAAkBE,UAQlCrO,QAAQgP,GAAkB,GACrBA,GACH1uB,KAAK0uB,SAEF1uB,KAAKyuB,iBACRzuB,KAAKyuB,gBAAgB/I,UAEjB1lB,KAAKwuB,OAICxuB,KAAKwuB,kBAAkBR,GAEjChuB,KAAKwuB,OAAO9I,UAJZ1lB,KAAKwuB,OAASX,EAAkBzI,4NCjInC,IAAI/kB,GAAa,EACbuuB,GAAe,EACfC,GAAW,EACXC,GAAY,EACZC,GAAS,EACTC,GAAS,EACTC,OAA8BzoB,EAC9B0oB,EATqB,KAUrBC,OAA8C3oB,EAC9C4oB,OAAiC5oB;CAgCrC,MAAM+D,EAAyC,oBAAZrJ,cAAuD,IAArBA,QAAQC,eAAiE,IAA9BD,QAAQC,SAASC,UAA6C,aAAjBF,QAAQG,KAGrK,GAAyB,iBAAdE,WAA2BgJ,GAS/B,GAAuB,iBAAZrJ,QAAsB,CACvCb,EAAmC,UAArBa,QAAQQ,SACtBktB,EAAqC,WAArB1tB,QAAQQ,SACxBmtB,EAAiC,UAArB3tB,QAAQQ,SACpButB,EA3DwB,KA4DxBC,EA5DwB,KA6DxB,MAAMG,EAAenuB,QAAQ8F,IAAuB,kBACpD,GAAIqoB,EACH,IACC,MAAMC,EAAuBC,KAAKC,MAAMH,GAClCI,EAAWH,EAAUI,mBAAmB,KAC9CT,EAAUK,EAAUK,OAEpBT,EAAYO,GApEU,KAqEtBN,EAA0BG,EAAUH,wBACnC,MAAO/jB,IAGV0jB,GAAY,QAzBZzuB,GADA+uB,EAAa7tB,UAAUC,WACCC,QAAQ,YAAc,EAC9CmtB,EAAeQ,EAAW3tB,QAAQ,cAAgB,EAClDutB,GAAUI,EAAW3tB,QAAQ,cAAgB,GAAK2tB,EAAW3tB,QAAQ,SAAW,GAAK2tB,EAAW3tB,QAAQ,WAAa,MAAQF,UAAUquB,gBAAkBruB,UAAUquB,eAAiB,EACpLf,EAAWO,EAAW3tB,QAAQ,UAAY,EAC1CstB,GAAS,EAETG,EADAD,EAAU1tB,UAAUsuB,SA8BrB,IAAIC,EAAS,EACTlB,EACHkB,EAAS,EACCzvB,EACVyvB,EAAS,EACCjB,IACViB,EAAS,GAGG7uB,EAAAwB,UAAYpC,EACZY,EAAA8uB,YAAcnB,EACd3tB,EAAA+uB,QAAUnB,EACV5tB,EAAAgvB,SAAWnB,EACX7tB,EAAAivB,MAAQnB,EACR9tB,EAAAkvB,MAAQnB,EAErB,MAAMoB,EAA4B,iBAATnK,KAAoBA,KAAyB,iBAAX/lB,OAAsBA,OAAS,GAC7Ee,EAAAovB,QAAeD,EAMfnvB,EAAAqvB,aAA8B,WAC1C,GAAIrvB,EAAAovB,QAAQC,aACX,OAAOrvB,EAAAovB,QAAQC,aAAa1C,KAAK3sB,EAAAovB;CAElC,GAAmC,mBAAxBpvB,EAAAovB,QAAQE,cAA+BtvB,EAAAovB,QAAQ/uB,cAAe,CAKxE,IAAIkvB,EAA2B,GAC/BvvB,EAAAovB,QAAQhlB,iBAAiB,UAAYD,IACpC,GAAIA,EAAE8B,MAAQ9B,EAAE8B,KAAKujB,qBACpB,IAAK,IAAI7wB,EAAI,EAAGC,EAAM2wB,EAAQ1wB,OAAQF,EAAIC,EAAKD,IAAK,CACnD,MAAM8wB,EAAYF,EAAQ5wB,GAC1B,GAAI8wB,EAAUtsB,KAAOgH,EAAE8B,KAAKujB,qBAG3B,OAFAD,EAAQpR,OAAOxf,EAAG,QAClB8wB,EAAUltB,cAMd,IAAImtB,EAAS,EACb,OAAQntB,IACP,MAAMotB,IAASD,EACfH,EAAQtuB,KAAK,CACZkC,GAAIwsB,EACJptB,SAAUA,IAEXvC,EAAAovB,QAAQE,YAAY,CAAEE,qBAAsBG,GAAQ,MAGtD,GAAuB,oBAAZ1vB,SAAuD,mBAArBA,QAAQkpB,SACpD,OAAOlpB,QAAQkpB,SAASwD,KAAK1sB,SAE9B,MAAM2vB,EAAWzF,QAAQtd,UACzB,OAAQtK,GAAuCqtB,EAAS3F,KAAK1nB,GApCnB,GA4C9BvC,EAAA8hB,GAAM6L,GAAgBI,EAAQ,EAA8B3uB,EAAY,EAA0B,EAE/G,IAAIywB,GAAkB,EAClBC,GAA0B,EAC9B9vB,EAAA+vB,eAAA,WACC,IAAKD,EAAyB,CAC7BA,GAA0B,EAC1B,MAAMluB,EAAO,IAAIouB,WAAW,GAC5BpuB,EAAK,GAAK,EACVA,EAAK,GAAK,EACV,MAAMquB,EAAO,IAAIC,YAAYtuB,EAAKsnB,QAClC2G,EAA+B,MAAZI,EAAK,GAEzB,OAAOJ,sICxJR,MAAMM,EAA4C,oBAAZlwB,QAA2B,CAChEmwB,IAAG,IAAoB,IACvBrqB,IAAKvG,OAAOwH,OAAO,MACnBvG,eAAyB,OAAO4vB,EAAA7uB,UAAY,QAAU6uB,EAAAvB,YAAc,SAAW;AAC/E3F,SAAS5mB,GAAmD8tB,EAAAhB,aAAa9sB,IACtEtC,QAESD,EAAAowB,IAAMD,EAAYC,IAClBpwB,EAAA+F,IAAMoqB,EAAYpqB,IAClB/F,EAAAS,SAAW0vB,EAAY1vB,4MCQpC,MAAM6vB,EAAmB,GACnBC,EAAmB,GACnBC,EAAmB,GACnBC,EAAmB,IACnBC,EAAW,GACXC,EAAqB,GACrBC,EAAsB,GAI5B,MAAMC,UAA4BltB,MAEjC8a,YAAYgB,EAAcqR,EAAkBC,GAE3C,IAAIC,EACoB,iBAAbF,GAAsD,IAA7BA,EAAStwB,QAAQ,SACpDwwB,EAAa,cACbF,EAAWA,EAASnvB,QAAQ,QAAS,KAErCqvB,EAAa,UAGd,MAAM5wB,GAA8B,IAAvBqf,EAAKjf,QAAQ,KAAc,WAAa,WACrD,IAAIywB,EAAM,QAAQxR,MAASrf,KAAQ4wB,aAAsBF,IAGzDtM,MADAyM,GAAO,0BAA0BF,KAGjChyB,KAAKmyB,KAAO,wBAId,SAASC,EAAepuB,EAAe0c,GACtC,GAAqB,iBAAV1c,EACV,MAAM,IAAI8tB,EAAoBpR,EAAM,SAAU1c,GAIhD,SAASquB,EAAgBF,GACxB,OAAOA,IAASP,GAAsBO,IAASN,EAGhD,SAASS,EAAqBH,GAC7B,OAAOA,IAASP,EAGjB,SAASW,EAAoBJ,GAC5B,OAAOA,GAAQZ,GAAoBY,GAAQV,GAC1CU,GAAQX,GAAoBW,GAAQT,EAItC,SAASc,EAAgBjsB,EAAcksB,EAAyBC,EAAmBL,GAClF,IAAIxK,EAAM,GACN8K,EAAoB,EACpBhgB,GAAa,EACbigB,EAAO,EACPT,EAAO,EACX,IAAK,IAAIvyB,EAAI,EAAGA,GAAK2G,EAAKzG,SAAUF,EAAG,CACtC,GAAIA,EAAI2G,EAAKzG,OACZqyB,EAAO5rB,EAAKiJ,WAAW5P,OAEnB,CAAA,GAAIyyB,EAAgBF,GACxB,MAGAA,EAAOP,EAGR,GAAIS,EAAgBF,GAAO,CAC1B,GAAIxf,IAAc/S,EAAI,GAAc,IAATgzB,QAEpB,GAAa,IAATA,EAAY;AACtB,GAAI/K,EAAI/nB,OAAS,GAA2B,IAAtB6yB,GACrB9K,EAAIrY,WAAWqY,EAAI/nB,OAAS,KAAO6xB,GACnC9J,EAAIrY,WAAWqY,EAAI/nB,OAAS,KAAO6xB,EAAU,CAC7C,GAAI9J,EAAI/nB,OAAS,EAAG,CACnB,MAAM+yB,EAAiBhL,EAAIhgB,YAAY6qB,IACf,IAApBG,GACHhL,EAAM,GACN8K,EAAoB,GAGpBA,GADA9K,EAAMA,EAAIza,MAAM,EAAGylB,IACK/yB,OAAS,EAAI+nB,EAAIhgB,YAAY6qB,GAEtD/f,EAAY/S,EACZgzB,EAAO,EACP,SACM,GAAmB,IAAf/K,EAAI/nB,OAAc,CAC5B+nB,EAAM,GACN8K,EAAoB,EACpBhgB,EAAY/S,EACZgzB,EAAO,EACP,UAGEH,IACH5K,GAAOA,EAAI/nB,OAAS,EAAI,GAAG4yB,MAAgB,KAC3CC,EAAoB,QAGjB9K,EAAI/nB,OAAS,EAChB+nB,GAAO,GAAG6K,IAAYnsB,EAAK6G,MAAMuF,EAAY,EAAG/S,KAGhDioB,EAAMthB,EAAK6G,MAAMuF,EAAY,EAAG/S,GAEjC+yB,EAAoB/yB,EAAI+S,EAAY,EAErCA,EAAY/S,EACZgzB,EAAO,OACGT,IAASR,IAAsB,IAAViB,IAC7BA,EAEFA,GAAQ,EAGV,OAAO/K,EAGR,SAASiL,EAAQC,EAAaC,GAC7B,GAAmB,OAAfA,GAA6C,iBAAfA,EACjC,MAAM,IAAIlB,EAAoB,aAAc,SAAUkB,GAEvD,MAAMC,EAAMD,EAAWC,KAAOD,EAAWE,KACnCvsB,EAAOqsB,EAAWrsB,MACvB,GAAGqsB,EAAWtS,MAAQ,KAAKsS,EAAWG,KAAO,KAC9C,OAAKF,EAGEA,IAAQD,EAAWE,KAAO,GAAGD,IAAMtsB,IAAS,GAAGssB,IAAMF,IAAMpsB,IAF1DA,EA+BI1F,EAAAmyB,MAAe,CAE3B1T,WAAW2T,GACV,IAAIC,EAAiB,GACjBC,EAAe,GACfC,GAAmB,EAEvB,IAAK,IAAI5zB,EAAIyzB,EAAavzB,OAAS,EAAGF,IAAM,EAAGA,IAAK,CACnD,IAAI2G,EACJ,GAAI3G,GAAK,GAKR,GAHAwyB,EADA7rB,EAAO8sB,EAAazzB,GACC,QAGD,IAAhB2G,EAAKzG,OACR,cAEmC,IAA1BwzB,EAAexzB,OACzByG,EAAOrF,EAAQmwB,YAWF7qB,KAJbD,EAAQrF,EAAQ8F,IAAY,IAAIssB,MAAqBpyB,EAAQmwB,QAK5D9qB,EAAK6G,MAAM,EAAG,GAAGqV,gBAAkB6Q,EAAe7Q,eAClDlc,EAAKiJ,WAAW,KAAOqiB,KACvBtrB,EAAO,GAAG+sB,OAIZ,MAAMzzB,EAAM0G,EAAKzG,OACjB,IAAI2zB,EAAU,EACVC,EAAS,GACTC,GAAa,EACjB,MAAMxB,EAAO5rB,EAAKiJ,WAAW,GAG7B,GAAY,IAAR3P,EACCwyB,EAAgBF,KAEnBsB,EAAU,EACVE,GAAa,QAER,GAAItB,EAAgBF,GAO1B,GAFAwB,GAAa,EAETtB,EAAgB9rB,EAAKiJ,WAAW,IAAK,CAExC,IAAIxG,EAAI,EACJ4qB,EAAO5qB;CAEX,KAAOA,EAAInJ,IAAQwyB,EAAgB9rB,EAAKiJ,WAAWxG,KAClDA,IAED,GAAIA,EAAInJ,GAAOmJ,IAAM4qB,EAAM,CAC1B,MAAM7P,EAAYxd,EAAK6G,MAAMwmB,EAAM5qB,GAInC,IAFA4qB,EAAO5qB,EAEAA,EAAInJ,GAAOwyB,EAAgB9rB,EAAKiJ,WAAWxG,KACjDA,IAED,GAAIA,EAAInJ,GAAOmJ,IAAM4qB,EAAM,CAI1B,IAFAA,EAAO5qB,EAEAA,EAAInJ,IAAQwyB,EAAgB9rB,EAAKiJ,WAAWxG,KAClDA,IAEGA,IAAMnJ,GAAOmJ,IAAM4qB,IAEtBF,EAAS,OAAO3P,MAAcxd,EAAK6G,MAAMwmB,EAAM5qB,KAC/CyqB,EAAUzqB,UAKbyqB,EAAU,OAEDlB,EAAoBJ,IAjPf,KAkPf5rB,EAAKiJ,WAAW,KAEhBkkB,EAASntB,EAAK6G,MAAM,EAAG,GACvBqmB,EAAU,EACN5zB,EAAM,GAAKwyB,EAAgB9rB,EAAKiJ,WAAW,MAG9CmkB,GAAa,EACbF,EAAU,IAIZ,GAAIC,EAAO5zB,OAAS,EACnB,GAAIwzB,EAAexzB,OAAS,GAC3B,GAAI4zB,EAAOjR,gBAAkB6Q,EAAe7Q,cAE3C,cAGD6Q,EAAiBI,EAInB,GAAIF,GACH,GAAIF,EAAexzB,OAAS,EAC3B,WAKD,GAFAyzB,EAAe,GAAGhtB,EAAK6G,MAAMqmB,OAAaF,IAC1CC,EAAmBG,EACfA,GAAcL,EAAexzB,OAAS,EACzC,MAaH,OAHAyzB,EAAef,EAAgBe,GAAeC,EAAkB,KAC/DnB,GAEMmB,EACN,GAAGF,MAAmBC,IACtB,GAAGD,IAAiBC,KAAkB,KAGxC7T,UAAUnZ,GACT6rB,EAAe7rB,EAAM,QACrB,MAAM1G,EAAM0G,EAAKzG,OACjB,GAAY,IAARD,EACH,MAAO,IAER,IACI6zB,EADAD,EAAU,EAEVE,GAAa,EACjB,MAAMxB,EAAO5rB,EAAKiJ,WAAW,GAG7B,GAAY,IAAR3P,EAGH,OAAOyyB,EAAqBH,GAAQ,KAAO5rB,EAE5C,GAAI8rB,EAAgBF,GAOnB,GAFAwB,GAAa,EAETtB,EAAgB9rB,EAAKiJ,WAAW,IAAK,CAExC,IAAIxG,EAAI,EACJ4qB,EAAO5qB,EAEX,KAAOA,EAAInJ,IAAQwyB,EAAgB9rB,EAAKiJ,WAAWxG,KAClDA,IAED,GAAIA,EAAInJ,GAAOmJ,IAAM4qB,EAAM,CAC1B,MAAM7P,EAAYxd,EAAK6G,MAAMwmB,EAAM5qB,GAInC,IAFA4qB,EAAO5qB,EAEAA,EAAInJ,GAAOwyB,EAAgB9rB,EAAKiJ,WAAWxG,KACjDA,IAED,GAAIA,EAAInJ,GAAOmJ,IAAM4qB,EAAM,CAI1B,IAFAA,EAAO5qB,EAEAA,EAAInJ,IAAQwyB,EAAgB9rB,EAAKiJ,WAAWxG,KAClDA,IAED,GAAIA,IAAMnJ,EAIT,MAAO,OAAOkkB,MAAcxd,EAAK6G,MAAMwmB,OAEpC5qB,IAAM4qB,IAETF,EAAS,OAAO3P,MAAcxd,EAAK6G,MAAMwmB,EAAM5qB,KAC/CyqB,EAAUzqB,UAKbyqB,EAAU,OAEDlB,EAAoBJ,IAlWd,KAkWuB5rB,EAAKiJ,WAAW,KAEvDkkB,EAASntB,EAAK6G,MAAM,EAAG,GACvBqmB,EAAU;AACN5zB,EAAM,GAAKwyB,EAAgB9rB,EAAKiJ,WAAW,MAG9CmkB,GAAa,EACbF,EAAU,IAIZ,IAAIlX,EAAOkX,EAAU5zB,EACpB2yB,EAAgBjsB,EAAK6G,MAAMqmB,IAAWE,EAAY,KAAMtB,GACxD,GAOD,OANoB,IAAhB9V,EAAKzc,QAAiB6zB,IACzBpX,EAAO,KAEJA,EAAKzc,OAAS,GAAKuyB,EAAgB9rB,EAAKiJ,WAAW3P,EAAM,MAC5D0c,GAAQ,WAEM/V,IAAXktB,EACIC,EAAa,KAAKpX,IAASA,EAE5BoX,EAAa,GAAGD,MAAWnX,IAAS,GAAGmX,IAASnX,KAGxDmD,WAAWnZ,GACV6rB,EAAe7rB,EAAM,QACrB,MAAM1G,EAAM0G,EAAKzG,OACjB,GAAY,IAARD,EACH,OAAO,EAGR,MAAMsyB,EAAO5rB,EAAKiJ,WAAW,GAC7B,OAAO6iB,EAAgBF,IAEtBtyB,EAAM,GACN0yB,EAAoBJ,IAxYJ,KAyYhB5rB,EAAKiJ,WAAW,IAChB6iB,EAAgB9rB,EAAKiJ,WAAW,KAGlCkQ,QAAQra,GACP,GAAqB,IAAjBA,EAAMvF,OACT,MAAO,IAGR,IAAI+zB,EACA9P,EACJ,IAAK,IAAInkB,EAAI,EAAGA,EAAIyF,EAAMvF,SAAUF,EAAG,CACtC,MAAMgf,EAAMvZ,EAAMzF,GAClBwyB,EAAexT,EAAK,QAChBA,EAAI9e,OAAS,SACD0G,IAAXqtB,EACHA,EAAS9P,EAAYnF,EAGrBiV,GAAU,KAAKjV,KAKlB,QAAepY,IAAXqtB,EACH,MAAO,IAgBR,IAAIC,GAAe,EACfC,EAAa,EACjB,GAAyB,iBAAdhQ,GAA0BsO,EAAgBtO,EAAUvU,WAAW,IAAK,GAC5EukB,EACF,MAAMC,EAAWjQ,EAAUjkB,OACvBk0B,EAAW,GAAK3B,EAAgBtO,EAAUvU,WAAW,QACtDukB,EACEC,EAAW,IACV3B,EAAgBtO,EAAUvU,WAAW,MACtCukB,EAGFD,GAAe,IAKnB,GAAIA,EAAc,CAEjB,KAAOC,EAAaF,EAAO/zB,QAC1BuyB,EAAgBwB,EAAOrkB,WAAWukB,KAClCA,IAIGA,GAAc,IACjBF,EAAS,KAAKA,EAAOzmB,MAAM2mB,MAI7B,OAAO9yB,EAAAmyB,MAAMnkB,UAAU4kB,IAQxBnU,SAASnX,EAAcC,GAItB,GAHA4pB,EAAe7pB,EAAM,QACrB6pB,EAAe5pB,EAAI,MAEfD,IAASC,EACZ,MAAO,GAGR,MAAMyrB,EAAWhzB,EAAAmyB,MAAMtlB,QAAQvF,GACzB2rB,EAASjzB,EAAAmyB,MAAMtlB,QAAQtF,GAE7B,GAAIyrB,IAAaC,EAChB,MAAO,GAMR,IAHA3rB,EAAO0rB,EAASxR,kBAChBja,EAAK0rB,EAAOzR,eAGX,MAAO,GAIR,IAAI0R,EAAY,EAChB,KAAOA,EAAY5rB,EAAKzI,QACvByI,EAAKiH,WAAW2kB,KAAetC,GAC/BsC,IAGD,IAAIC,EAAU7rB,EAAKzI;CACnB,KAAOs0B,EAAU,EAAID,GACpB5rB,EAAKiH,WAAW4kB,EAAU,KAAOvC,GACjCuC,IAED,MAAMC,EAAUD,EAAUD,EAG1B,IAAIG,EAAU,EACd,KAAOA,EAAU9rB,EAAG1I,QACnB0I,EAAGgH,WAAW8kB,KAAazC,GAC3ByC,IAGD,IAAIC,EAAQ/rB,EAAG1I,OACf,KAAOy0B,EAAQ,EAAID,GAClB9rB,EAAGgH,WAAW+kB,EAAQ,KAAO1C,GAC7B0C,IAED,MAAMC,EAAQD,EAAQD,EAGhBx0B,EAASu0B,EAAUG,EAAQH,EAAUG,EAC3C,IAAIC,GAAiB,EACjB70B,EAAI,EACR,KAAOA,EAAIE,EAAQF,IAAK,CACvB,MAAM80B,EAAWnsB,EAAKiH,WAAW2kB,EAAYv0B,GAC7C,GAAI80B,IAAalsB,EAAGgH,WAAW8kB,EAAU10B,GACxC,MACU80B,IAAa7C,IACvB4C,EAAgB70B,GAMlB,GAAIA,IAAME,GACT,IAAuB,IAAnB20B,EACH,OAAOP,MAEF,CACN,GAAIM,EAAQ10B,EAAQ,CACnB,GAAI0I,EAAGgH,WAAW8kB,EAAU10B,KAAOiyB,EAGlC,OAAOqC,EAAO9mB,MAAMknB,EAAU10B,EAAI,GAEnC,GAAU,IAANA,EAGH,OAAOs0B,EAAO9mB,MAAMknB,EAAU10B,GAG5By0B,EAAUv0B,IACTyI,EAAKiH,WAAW2kB,EAAYv0B,KAAOiyB,EAGtC4C,EAAgB70B,EACA,IAANA,IAGV60B,EAAgB,KAGK,IAAnBA,IACHA,EAAgB,GAIlB,IAAIE,EAAM,GAGV,IAAK/0B,EAAIu0B,EAAYM,EAAgB,EAAG70B,GAAKw0B,IAAWx0B,EACnDA,IAAMw0B,GAAW7rB,EAAKiH,WAAW5P,KAAOiyB,IAC3C8C,GAAsB,IAAfA,EAAI70B,OAAe,KAAO,QAQnC,OAJAw0B,GAAWG,EAIPE,EAAI70B,OAAS,EACT,GAAG60B,IAAMT,EAAO9mB,MAAMknB,EAASC,MAGnCL,EAAO1kB,WAAW8kB,KAAazC,KAChCyC,EAGIJ,EAAO9mB,MAAMknB,EAASC,KAG9B7U,iBAAiBnZ,GAEhB,GAAoB,iBAATA,EACV,OAAOA,EAGR,GAAoB,IAAhBA,EAAKzG,OACR,MAAO,GAGR,MAAM80B,EAAe3zB,EAAAmyB,MAAMtlB,QAAQvH,GAEnC,GAAIquB,EAAa90B,QAAU,EAC1B,OAAOyG,EAGR,GAAIquB,EAAaplB,WAAW,KAAOqiB,GAElC,GAAI+C,EAAaplB,WAAW,KAAOqiB,EAAqB,CACvD,MAAMM,EAAOyC,EAAaplB,WAAW,GACrC,GArmBuB,KAqmBnB2iB,GAA+BA,IAASR,EAE3C,MAAO,eAAeiD,EAAaxnB,MAAM,WAGrC,GAAImlB,EAAoBqC,EAAaplB,WAAW,KA3mBtC,KA4mBhBolB,EAAaplB,WAAW,IACxBolB,EAAaplB,WAAW,KAAOqiB,EAE/B,MAAO,UAAU+C,IAGlB,OAAOruB,GAGRmZ,QAAQnZ,GACP6rB,EAAe7rB,EAAM,QACrB,MAAM1G,EAAM0G,EAAKzG;CACjB,GAAY,IAARD,EACH,MAAO,IAER,IAAI4zB,GAAW,EACXoB,EAAS,EACb,MAAM1C,EAAO5rB,EAAKiJ,WAAW,GAE7B,GAAY,IAAR3P,EAGH,OAAOwyB,EAAgBF,GAAQ5rB,EAAO,IAIvC,GAAI8rB,EAAgBF,IAKnB,GAFAsB,EAAUoB,EAAS,EAEfxC,EAAgB9rB,EAAKiJ,WAAW,IAAK,CAExC,IAAIxG,EAAI,EACJ4qB,EAAO5qB,EAEX,KAAOA,EAAInJ,IAAQwyB,EAAgB9rB,EAAKiJ,WAAWxG,KAClDA,IAED,GAAIA,EAAInJ,GAAOmJ,IAAM4qB,EAAM,CAI1B,IAFAA,EAAO5qB,EAEAA,EAAInJ,GAAOwyB,EAAgB9rB,EAAKiJ,WAAWxG,KACjDA,IAED,GAAIA,EAAInJ,GAAOmJ,IAAM4qB,EAAM,CAI1B,IAFAA,EAAO5qB,EAEAA,EAAInJ,IAAQwyB,EAAgB9rB,EAAKiJ,WAAWxG,KAClDA,IAED,GAAIA,IAAMnJ,EAET,OAAO0G,EAEJyC,IAAM4qB,IAKTH,EAAUoB,EAAS7rB,EAAI,WAMjBupB,EAAoBJ,IAhrBd,KAgrBuB5rB,EAAKiJ,WAAW,KAEvDqlB,EADApB,EAAU5zB,EAAM,GAAKwyB,EAAgB9rB,EAAKiJ,WAAW,IAAM,EAAI,GAIhE,IAAIslB,GAAO,EACPC,GAAe,EACnB,IAAK,IAAIn1B,EAAIC,EAAM,EAAGD,GAAKi1B,IAAUj1B,EACpC,GAAIyyB,EAAgB9rB,EAAKiJ,WAAW5P,KACnC,IAAKm1B,EAAc,CAClBD,EAAMl1B,EACN,YAIDm1B,GAAe,EAIjB,IAAa,IAATD,EAAY,CACf,IAAiB,IAAbrB,EACH,MAAO,IAGRqB,EAAMrB,EAEP,OAAOltB,EAAK6G,MAAM,EAAG0nB,IAGtBpV,SAASnZ,EAAc4sB,QACV3sB,IAAR2sB,GACHf,EAAee,EAAK,OAErBf,EAAe7rB,EAAM,QACrB,IAGI3G,EAHAoqB,EAAQ,EACR8K,GAAO,EACPC,GAAe,EAYnB,GANIxuB,EAAKzG,QAAU,GAClByyB,EAAoBhsB,EAAKiJ,WAAW,KA3tBpB,KA4tBhBjJ,EAAKiJ,WAAW,KAChBwa,EAAQ,QAGGxjB,IAAR2sB,GAAqBA,EAAIrzB,OAAS,GAAKqzB,EAAIrzB,QAAUyG,EAAKzG,OAAQ,CACrE,GAAIqzB,IAAQ5sB,EACX,MAAO,GAER,IAAIyuB,EAAS7B,EAAIrzB,OAAS,EACtBm1B,GAAoB,EACxB,IAAKr1B,EAAI2G,EAAKzG,OAAS,EAAGF,GAAKoqB,IAASpqB,EAAG,CAC1C,MAAMuyB,EAAO5rB,EAAKiJ,WAAW5P,GAC7B,GAAIyyB,EAAgBF,IAGnB,IAAK4C,EAAc,CAClB/K,EAAQpqB,EAAI,EACZ,YAGyB,IAAtBq1B,IAGHF,GAAe,EACfE,EAAmBr1B,EAAI,GAEpBo1B,GAAU,IAET7C,IAASgB,EAAI3jB,WAAWwlB,IACT,KAAZA,IAGLF,EAAMl1B,IAKPo1B,GAAU,EACVF,EAAMG,IAWV,OALIjL,IAAU8K,EACbA,EAAMG,GACa,IAATH,IACVA,EAAMvuB,EAAKzG,QAELyG,EAAK6G,MAAM4c,EAAO8K,GAE1B,IAAKl1B,EAAI2G,EAAKzG,OAAS,EAAGF,GAAKoqB,IAASpqB,EACvC,GAAIyyB,EAAgB9rB,EAAKiJ,WAAW5P,KAGnC,IAAKm1B,EAAc,CAClB/K,EAAQpqB,EAAI,EACZ;MAEkB,IAATk1B,IAGVC,GAAe,EACfD,EAAMl1B,EAAI,GAIZ,OAAa,IAATk1B,EACI,GAEDvuB,EAAK6G,MAAM4c,EAAO8K,IAG1BpV,QAAQnZ,GACP6rB,EAAe7rB,EAAM,QACrB,IAAIyjB,EAAQ,EACRkL,GAAY,EACZC,EAAY,EACZL,GAAO,EACPC,GAAe,EAGfK,EAAc,EAMd7uB,EAAKzG,QAAU,GApzBF,KAqzBhByG,EAAKiJ,WAAW,IAChB+iB,EAAoBhsB,EAAKiJ,WAAW,MACpCwa,EAAQmL,EAAY,GAGrB,IAAK,IAAIv1B,EAAI2G,EAAKzG,OAAS,EAAGF,GAAKoqB,IAASpqB,EAAG,CAC9C,MAAMuyB,EAAO5rB,EAAKiJ,WAAW5P,GAC7B,GAAIyyB,EAAgBF,IAGnB,IAAK4C,EAAc,CAClBI,EAAYv1B,EAAI,EAChB,YAIW,IAATk1B,IAGHC,GAAe,EACfD,EAAMl1B,EAAI,GAEPuyB,IAASR,GAEM,IAAduD,EACHA,EAAWt1B,EAEa,IAAhBw1B,IACRA,EAAc,IAES,IAAdF,IAGVE,GAAe,GAIjB,OAAkB,IAAdF,IACM,IAATJ,GAEgB,IAAhBM,GAEiB,IAAhBA,GACAF,IAAaJ,EAAM,GACnBI,IAAaC,EAAY,EACnB,GAED5uB,EAAK6G,MAAM8nB,EAAUJ,IAG7BO,OAAQvC,EAAQlF,KAAK,KAAM,MAE3BlO,MAAMnZ,GACL6rB,EAAe7rB,EAAM,QAErB,MAAMwJ,EAAM,CAAEmjB,KAAM,GAAID,IAAK,GAAItsB,KAAM,GAAIwsB,IAAK,GAAIzS,KAAM,IAC1D,GAAoB,IAAhBna,EAAKzG,OACR,OAAOiQ,EAGR,MAAMlQ,EAAM0G,EAAKzG,OACjB,IAAI2zB,EAAU,EACVtB,EAAO5rB,EAAKiJ,WAAW,GAE3B,GAAY,IAAR3P,EACH,OAAIwyB,EAAgBF,IAGnBpiB,EAAImjB,KAAOnjB,EAAIkjB,IAAM1sB,EACdwJ,IAERA,EAAIpJ,KAAOoJ,EAAI2Q,KAAOna,EACfwJ,GAGR,GAAIsiB,EAAgBF,IAInB,GADAsB,EAAU,EACNpB,EAAgB9rB,EAAKiJ,WAAW,IAAK,CAExC,IAAIxG,EAAI,EACJ4qB,EAAO5qB,EAEX,KAAOA,EAAInJ,IAAQwyB,EAAgB9rB,EAAKiJ,WAAWxG,KAClDA,IAED,GAAIA,EAAInJ,GAAOmJ,IAAM4qB,EAAM,CAI1B,IAFAA,EAAO5qB,EAEAA,EAAInJ,GAAOwyB,EAAgB9rB,EAAKiJ,WAAWxG,KACjDA,IAED,GAAIA,EAAInJ,GAAOmJ,IAAM4qB,EAAM,CAI1B,IAFAA,EAAO5qB,EAEAA,EAAInJ,IAAQwyB,EAAgB9rB,EAAKiJ,WAAWxG,KAClDA,IAEGA,IAAMnJ,EAET4zB,EAAUzqB,EACAA,IAAM4qB,IAEhBH,EAAUzqB,EAAI,WAKZ,GAAIupB,EAAoBJ,IAp6Bd,KAo6BuB5rB,EAAKiJ,WAAW,GAAmB,CAE1E,GAAI3P,GAAO,EAIV,OADAkQ,EAAImjB,KAAOnjB,EAAIkjB,IAAM1sB,EACdwJ,EAGR,GADA0jB,EAAU,EACNpB,EAAgB9rB,EAAKiJ,WAAW,IAAK,CACxC,GAAY,IAAR3P,EAIH,OADAkQ,EAAImjB,KAAOnjB,EAAIkjB,IAAM1sB,EACdwJ,EAER0jB,EAAU,GAGRA,EAAU,IACb1jB,EAAImjB,KAAO3sB,EAAK6G,MAAM,EAAGqmB;CAG1B,IAAIyB,GAAY,EACZC,EAAY1B,EACZqB,GAAO,EACPC,GAAe,EACfn1B,EAAI2G,EAAKzG,OAAS,EAIlBs1B,EAAc,EAGlB,KAAOx1B,GAAK6zB,IAAW7zB,EAEtB,GAAIyyB,EADJF,EAAO5rB,EAAKiJ,WAAW5P,KAItB,IAAKm1B,EAAc,CAClBI,EAAYv1B,EAAI,EAChB,YAIW,IAATk1B,IAGHC,GAAe,EACfD,EAAMl1B,EAAI,GAEPuyB,IAASR,GAEM,IAAduD,EACHA,EAAWt1B,EACe,IAAhBw1B,IACVA,EAAc,IAES,IAAdF,IAGVE,GAAe,GA6BjB,OAzBa,IAATN,KACe,IAAdI,GAEa,IAAhBE,GAEiB,IAAhBA,GACAF,IAAaJ,EAAM,GACnBI,IAAaC,EAAY,EAC1BplB,EAAIpJ,KAAOoJ,EAAI2Q,KAAOna,EAAK6G,MAAM+nB,EAAWL,IAE5C/kB,EAAI2Q,KAAOna,EAAK6G,MAAM+nB,EAAWD,GACjCnlB,EAAIpJ,KAAOJ,EAAK6G,MAAM+nB,EAAWL,GACjC/kB,EAAIojB,IAAM5sB,EAAK6G,MAAM8nB,EAAUJ,KAQhC/kB,EAAIkjB,IADDkC,EAAY,GAAKA,IAAc1B,EACxBltB,EAAK6G,MAAM,EAAG+nB,EAAY,GAE1BplB,EAAImjB,KAGRnjB,GAGRgjB,IAAK,KACLuC,UAAW,IACXlC,MAAO,KACPmC,MAAO,MAGKt0B,EAAAs0B,MAAe,CAE3B7V,WAAW2T,GACV,IAAIuB,EAAe,GACfpB,GAAmB,EAEvB,IAAK,IAAI5zB,EAAIyzB,EAAavzB,OAAS,EAAGF,IAAM,IAAM4zB,EAAkB5zB,IAAK,CACxE,MAAM2G,EAAO3G,GAAK,EAAIyzB,EAAazzB,GAAKsB,EAAQmwB,MAEhDe,EAAe7rB,EAAM,QAGD,IAAhBA,EAAKzG,SAIT80B,EAAe,GAAGruB,KAAQquB,IAC1BpB,EAAmBjtB,EAAKiJ,WAAW,KAAOoiB,GAU3C,OAHAgD,EAAepC,EAAgBoC,GAAepB,EAAkB,IAC/DlB,GAEGkB,EACI,IAAIoB,IAELA,EAAa90B,OAAS,EAAI80B,EAAe,KAGjDlV,UAAUnZ,GAGT,GAFA6rB,EAAe7rB,EAAM,QAED,IAAhBA,EAAKzG,OACR,MAAO,IAGR,MAAM6zB,EAAaptB,EAAKiJ,WAAW,KAAOoiB,EACpC4D,EACLjvB,EAAKiJ,WAAWjJ,EAAKzG,OAAS,KAAO8xB,EAKtC,OAAoB,KAFpBrrB,EAAOisB,EAAgBjsB,GAAOotB,EAAY,IAAKrB,IAEtCxyB,OACJ6zB,EACI,IAED6B,EAAoB,KAAO,KAE/BA,IACHjvB,GAAQ,KAGFotB,EAAa,IAAIptB,IAASA,IAGlCotB,WAAWptB,IACV6rB,EAAe7rB,EAAM,QACdA,EAAKzG,OAAS,GAAKyG,EAAKiJ,WAAW,KAAOoiB,GAGlDlS,QAAQra,GACP,GAAqB,IAAjBA,EAAMvF,OACT,MAAO,IAER,IAAI+zB,EACJ,IAAK,IAAIj0B,EAAI,EAAGA,EAAIyF,EAAMvF,SAAUF,EAAG,CACtC,MAAMgf,EAAMvZ,EAAMzF,GAClBwyB,EAAexT,EAAK,QAChBA,EAAI9e,OAAS,SACD0G,IAAXqtB,EACHA,EAASjV,EAETiV,GAAU,IAAIjV;AAIjB,YAAepY,IAAXqtB,EACI,IAED5yB,EAAAs0B,MAAMtmB,UAAU4kB,IAGxBnU,SAASnX,EAAcC,GAItB,GAHA4pB,EAAe7pB,EAAM,QACrB6pB,EAAe5pB,EAAI,MAEfD,IAASC,EACZ,MAAO,GAOR,IAHAD,EAAOtH,EAAAs0B,MAAMznB,QAAQvF,OACrBC,EAAKvH,EAAAs0B,MAAMznB,QAAQtF,IAGlB,MAAO,GAGR,MACM4rB,EAAU7rB,EAAKzI,OACfu0B,EAAUD,EAFE,EAIZI,EAAQhsB,EAAG1I,OADD,EAIVA,EAAUu0B,EAAUG,EAAQH,EAAUG,EAC5C,IAAIC,GAAiB,EACjB70B,EAAI,EACR,KAAOA,EAAIE,EAAQF,IAAK,CACvB,MAAM80B,EAAWnsB,EAAKiH,WAXL,EAW4B5P,GAC7C,GAAI80B,IAAalsB,EAAGgH,WATL,EAS0B5P,GACxC,MACU80B,IAAa9C,IACvB6C,EAAgB70B,GAGlB,GAAIA,IAAME,EACT,GAAI00B,EAAQ10B,EAAQ,CACnB,GAAI0I,EAAGgH,WAjBO,EAiBc5P,KAAOgyB,EAGlC,OAAOppB,EAAG4E,MApBG,EAoBaxN,EAAI,GAE/B,GAAU,IAANA,EAGH,OAAO4I,EAAG4E,MAzBG,EAyBaxN,QAEjBy0B,EAAUv0B,IAChByI,EAAKiH,WA/BO,EA+BgB5P,KAAOgyB,EAGtC6C,EAAgB70B,EACA,IAANA,IAGV60B,EAAgB,IAKnB,IAAIE,EAAM,GAGV,IAAK/0B,EA9Ca,EA8CG60B,EAAgB,EAAG70B,GAAKw0B,IAAWx0B,EACnDA,IAAMw0B,GAAW7rB,EAAKiH,WAAW5P,KAAOgyB,IAC3C+C,GAAsB,IAAfA,EAAI70B,OAAe,KAAO,OAMnC,MAAO,GAAG60B,IAAMnsB,EAAG4E,MAnDH,EAmDmBqnB,MAGpCgB,iBAAiBlvB,GAETA,EAGRmZ,QAAQnZ,GAEP,GADA6rB,EAAe7rB,EAAM,QACD,IAAhBA,EAAKzG,OACR,MAAO,IAER,MAAM41B,EAAUnvB,EAAKiJ,WAAW,KAAOoiB,EACvC,IAAIkD,GAAO,EACPC,GAAe,EACnB,IAAK,IAAIn1B,EAAI2G,EAAKzG,OAAS,EAAGF,GAAK,IAAKA,EACvC,GAAI2G,EAAKiJ,WAAW5P,KAAOgyB,GAC1B,IAAKmD,EAAc,CAClBD,EAAMl1B,EACN,YAIDm1B,GAAe,EAIjB,OAAa,IAATD,EACIY,EAAU,IAAM,IAEpBA,GAAmB,IAARZ,EACP,KAEDvuB,EAAK6G,MAAM,EAAG0nB,IAGtBpV,SAASnZ,EAAc4sB,QACV3sB,IAAR2sB,GACHf,EAAee,EAAK,OAErBf,EAAe7rB,EAAM,QAErB,IAGI3G,EAHAoqB,EAAQ,EACR8K,GAAO,EACPC,GAAe,EAGnB,QAAYvuB,IAAR2sB,GAAqBA,EAAIrzB,OAAS,GAAKqzB,EAAIrzB,QAAUyG,EAAKzG,OAAQ,CACrE,GAAIqzB,IAAQ5sB,EACX,MAAO,GAER,IAAIyuB,EAAS7B,EAAIrzB,OAAS,EACtBm1B,GAAoB,EACxB,IAAKr1B,EAAI2G,EAAKzG,OAAS,EAAGF,GAAK,IAAKA,EAAG,CACtC,MAAMuyB,EAAO5rB,EAAKiJ,WAAW5P,GAC7B,GAAIuyB,IAASP;AAGZ,IAAKmD,EAAc,CAClB/K,EAAQpqB,EAAI,EACZ,YAGyB,IAAtBq1B,IAGHF,GAAe,EACfE,EAAmBr1B,EAAI,GAEpBo1B,GAAU,IAET7C,IAASgB,EAAI3jB,WAAWwlB,IACT,KAAZA,IAGLF,EAAMl1B,IAKPo1B,GAAU,EACVF,EAAMG,IAWV,OALIjL,IAAU8K,EACbA,EAAMG,GACa,IAATH,IACVA,EAAMvuB,EAAKzG,QAELyG,EAAK6G,MAAM4c,EAAO8K,GAE1B,IAAKl1B,EAAI2G,EAAKzG,OAAS,EAAGF,GAAK,IAAKA,EACnC,GAAI2G,EAAKiJ,WAAW5P,KAAOgyB,GAG1B,IAAKmD,EAAc,CAClB/K,EAAQpqB,EAAI,EACZ,YAEkB,IAATk1B,IAGVC,GAAe,EACfD,EAAMl1B,EAAI,GAIZ,OAAa,IAATk1B,EACI,GAEDvuB,EAAK6G,MAAM4c,EAAO8K,IAG1BpV,QAAQnZ,GACP6rB,EAAe7rB,EAAM,QACrB,IAAI2uB,GAAY,EACZC,EAAY,EACZL,GAAO,EACPC,GAAe,EAGfK,EAAc,EAClB,IAAK,IAAIx1B,EAAI2G,EAAKzG,OAAS,EAAGF,GAAK,IAAKA,EAAG,CAC1C,MAAMuyB,EAAO5rB,EAAKiJ,WAAW5P,GAC7B,GAAIuyB,IAASP,GASA,IAATkD,IAGHC,GAAe,EACfD,EAAMl1B,EAAI,GAEPuyB,IAASR,GAEM,IAAduD,EACHA,EAAWt1B,EAEa,IAAhBw1B,IACRA,EAAc,IAES,IAAdF,IAGVE,GAAe,QAvBf,IAAKL,EAAc,CAClBI,EAAYv1B,EAAI,EAChB,OAyBH,OAAkB,IAAds1B,IACM,IAATJ,GAEgB,IAAhBM,GAEiB,IAAhBA,GACAF,IAAaJ,EAAM,GACnBI,IAAaC,EAAY,EACnB,GAED5uB,EAAK6G,MAAM8nB,EAAUJ,IAG7BO,OAAQvC,EAAQlF,KAAK,KAAM,KAE3BlO,MAAMnZ,GACL6rB,EAAe7rB,EAAM,QAErB,MAAMwJ,EAAM,CAAEmjB,KAAM,GAAID,IAAK,GAAItsB,KAAM,GAAIwsB,IAAK,GAAIzS,KAAM,IAC1D,GAAoB,IAAhBna,EAAKzG,OACR,OAAOiQ,EAER,MAAM4jB,EAAaptB,EAAKiJ,WAAW,KAAOoiB,EAC1C,IAAI5H,EACA2J,GACH5jB,EAAImjB,KAAO,IACXlJ,EAAQ,GAERA,EAAQ,EAET,IAAIkL,GAAY,EACZC,EAAY,EACZL,GAAO,EACPC,GAAe,EACfn1B,EAAI2G,EAAKzG,OAAS,EAIlBs1B,EAAc,EAGlB,KAAOx1B,GAAKoqB,IAASpqB,EAAG,CACvB,MAAMuyB,EAAO5rB,EAAKiJ,WAAW5P,GAC7B,GAAIuyB,IAASP,GASA,IAATkD,IAGHC,GAAe,EACfD,EAAMl1B,EAAI,GAEPuyB,IAASR,GAEM,IAAduD,EACHA,EAAWt1B,EACe,IAAhBw1B,IACVA,EAAc,IAES,IAAdF,IAGVE,GAAe,QAtBf,IAAKL,EAAc,CAClBI,EAAYv1B,EAAI,EAChB,OAwBH,IAAa,IAATk1B,EAAY,CACf,MAAM9K,EAAsB,IAAdmL,GAAmBxB,EAAa,EAAIwB,GAChC,IAAdD,GAEa,IAAhBE,GAEiB,IAAhBA,GACAF,IAAaJ,EAAM,GACnBI,IAAaC,EAAY,EAC1BplB,EAAIpJ,KAAOoJ,EAAI2Q,KAAOna,EAAK6G,MAAM4c,EAAO8K,IAExC/kB,EAAI2Q,KAAOna,EAAK6G,MAAM4c,EAAOkL;AAC7BnlB,EAAIpJ,KAAOJ,EAAK6G,MAAM4c,EAAO8K,GAC7B/kB,EAAIojB,IAAM5sB,EAAK6G,MAAM8nB,EAAUJ,IAUjC,OANIK,EAAY,EACfplB,EAAIkjB,IAAM1sB,EAAK6G,MAAM,EAAG+nB,EAAY,GAC1BxB,IACV5jB,EAAIkjB,IAAM,KAGJljB,GAGRgjB,IAAK,IACLuC,UAAW,IACXlC,MAAO,KACPmC,MAAO,MAGRt0B,EAAAs0B,MAAMnC,MAAQnyB,EAAAmyB,MAAMA,MAAQnyB,EAAAmyB,MAC5BnyB,EAAAs0B,MAAMA,MAAQt0B,EAAAmyB,MAAMmC,MAAQt0B,EAAAs0B,MAEft0B,EAAAgO,UAAkC,UAArB/N,EAAQQ,SAAuBT,EAAAmyB,MAAMnkB,UAAYhO,EAAAs0B,MAAMtmB,UACpEhO,EAAA6M,QAAgC,UAArB5M,EAAQQ,SAAuBT,EAAAmyB,MAAMtlB,QAAU7M,EAAAs0B,MAAMznB,QAChE7M,EAAA00B,SAAiC,UAArBz0B,EAAQQ,SAAuBT,EAAAmyB,MAAMuC,SAAW10B,EAAAs0B,MAAMI,SAClE10B,EAAAyM,QAAgC,UAArBxM,EAAQQ,SAAuBT,EAAAmyB,MAAM1lB,QAAUzM,EAAAs0B,MAAM7nB,QAChEzM,EAAA8P,SAAiC,UAArB7P,EAAQQ,SAAuBT,EAAAmyB,MAAMriB,SAAW9P,EAAAs0B,MAAMxkB,SAClE9P,EAAA20B,QAAgC,UAArB10B,EAAQQ,SAAuBT,EAAAmyB,MAAMwC,QAAU30B,EAAAs0B,MAAMK,QAChE30B,EAAA8xB,IAA4B,UAArB7xB,EAAQQ,SAAuBT,EAAAmyB,MAAML,IAAM9xB,EAAAs0B,MAAMxC;k7BCn9CrE9xB,EAAA40B,oBAAA,SAAoCtf;AACnC,OAAKA,GAAsB,iBAARA,GAGU,IAAtBA,EAAIuf,OAAOh2B,QAMnBmB,EAAA80B,IAAA,SAAoBvZ,EAAWwZ,EAAWC,EAAe,KACxD,MAAM1f,EAAM,GAAKiG,EACXzJ,EAAI,CAACwD,GAEX,IAAK,IAAI3W,EAAI2W,EAAIzW,OAAQF,EAAIo2B,EAAGp2B,IAC/BmT,EAAE7Q,KAAK+zB,GAGR,OAAOljB,EAAE6H,UAAU5J,KAAK,KAGzB,MAAMklB,EAAgB,WAsCtB,SAAgBC,EAAuBnyB,GACtC,OAAOA,EAAMpB,QAAQ,kCAAmC,QAkBzD,SAAgBwzB,EAAMpzB,EAAkBC,GACvC,IAAKD,IAAaC,EACjB,OAAOD,EAGR,MAAMqzB,EAAYpzB,EAAOnD,OACzB,GAAkB,IAAdu2B,GAAuC,IAApBrzB,EAASlD,OAC/B,OAAOkD,EAGR,IAAI6xB,EAAS,EAEb,KAAO7xB,EAASvB,QAAQwB,EAAQ4xB,KAAYA,GAC3CA,GAAkBwB,EAEnB,OAAOrzB,EAAS8E,UAAU+sB,GAQ3B,SAAgByB,EAAMtzB,EAAkBC,GACvC,IAAKD,IAAaC,EACjB,OAAOD,EAGR,MAAMqzB,EAAYpzB,EAAOnD,OACxBy2B,EAAcvzB,EAASlD,OAExB,GAAkB,IAAdu2B,GAAmC,IAAhBE,EACtB,OAAOvzB,EAGR,IAAI6xB,EAAS0B,EACZC,GAAO,EAER,MAEc,KADbA,EAAMxzB,EAAS6E,YAAY5E,EAAQ4xB,EAAS,KAC1B2B,EAAMH,IAAcxB,GAF1B,CAKZ,GAAY,IAAR2B,EACH,MAAO,GAER3B,EAAS2B,EAGV,OAAOxzB,EAAS8E,UAAU,EAAG+sB,GA8J9B,SAAgB4B,EAAiB/tB,EAAWC,EAAW+tB,EAAiB,EAAGC,EAAejuB,EAAE5I,OAAQ82B,EAAiB,EAAGC,EAAeluB,EAAE7I,QACxI,KAAO42B,EAASC,GAAQC,EAASC,EAAMH,IAAUE,IAAU,CAC1D,IAAIE,EAAQpuB,EAAE8G,WAAWknB,GACrBK,EAAQpuB,EAAE6G,WAAWonB,GACzB,GAAIE,EAAQC,EACX,OAAQ,EACF,GAAID,EAAQC,EAClB,OAAO,EAGT,MAAMC,EAAOL,EAAOD,EACdO,EAAOJ,EAAOD,EACpB,OAAII,EAAOC,GACF,EACED,EAAOC,EACV,EAED,EAOR,SAAgBC,EAA2BxuB,EAAWC,EAAW+tB,EAAiB,EAAGC,EAAejuB,EAAE5I,OAAQ82B,EAAiB,EAAGC,EAAeluB,EAAE7I,QAElJ,KAAO42B,EAASC,GAAQC,EAASC,EAAMH,IAAUE,IAAU,CAE1D,IAAIE,EAAQpuB,EAAE8G,WAAWknB,GACrBK,EAAQpuB,EAAE6G,WAAWonB,GAEzB,GAAIE,IAAUC,EAEb,SAGD,MAAMI,EAAOL,EAAQC,EACrB,IAAa,KAATI,IAAeC,EAAmBL,OAGjB,KAAVI,IAAgBC,EAAmBN,IAI9C,OAAIO,EAAmBP,IAAUO,EAAmBN,GAE5CI,EAGAV,EAAiB/tB,EAAE+Z,cAAe9Z,EAAE8Z,cAAeiU,EAAQC,EAAMC,EAAQC;AAIlF,MAAMG,EAAOL,EAAOD,EACdO,EAAOJ,EAAOD,EAEpB,OAAII,EAAOC,GACF,EACED,EAAOC,EACV,EAGD,EAGR,SAAgBI,EAAmBlF,GAClC,OAAOA,GAAI,IAAkBA,GAAI,IAGlC,SAAgBiF,EAAmBjF,GAClC,OAAOA,GAAI,IAAkBA,GAAI,GAGlC,SAASmF,EAAcnF,GACtB,OAAOkF,EAAmBlF,IAASiF,EAAmBjF,GAOvD,SAASoF,EAAmB7uB,EAAWC,EAAW6uB,EAAS9uB,EAAE5I,QAC5D,IAAK,IAAIF,EAAI,EAAGA,EAAI43B,EAAQ53B,IAAK,CAChC,MAAMk3B,EAAQpuB,EAAE8G,WAAW5P,GACrBm3B,EAAQpuB,EAAE6G,WAAW5P,GAE3B,GAAIk3B,IAAUC,EAKd,GAAIO,EAAcR,IAAUQ,EAAcP,GAAQ,CACjD,MAAMI,EAAOxvB,KAAK8vB,IAAIX,EAAQC,GAC9B,GAAa,IAATI,GAAuB,KAATA,EACjB,OAAO,OAMR,GAAIryB,OAAO4yB,aAAaZ,GAAOrU,gBAAkB3d,OAAO4yB,aAAaX,GAAOtU,cAC3E,OAAO,EAKV,OAAO,EAoDR,SAAgBkV,EAAgBC,GAC/B,OAAQ,OAAUA,GAAYA,GAAY,MAM3C,SAAgBC,EAAeD,GAC9B,OAAQ,OAAUA,GAAYA,GAAY,MAM3C,SAAgBE,EAAiBC,EAAuBC,GACvD,OAA2CA,EAAe,OAAjDD,EAAgB,OAAW,IAAgC,MAMrE,SAAgBE,EAAiB1hB,EAAa1W,EAAag1B,GAC1D,MAAM+C,EAAWrhB,EAAI/G,WAAWqlB,GAChC,GAAI8C,EAAgBC,IAAa/C,EAAS,EAAIh1B,EAAK,CAClD,MAAMq4B,EAAe3hB,EAAI/G,WAAWqlB,EAAS,GAC7C,GAAIgD,EAAeK,GAClB,OAAOJ,EAAiBF,EAAUM,GAGpC,OAAON,EAMR,SAASO,EAAiB5hB,EAAase,GACtC,MAAM+C,EAAWrhB,EAAI/G,WAAWqlB,EAAS,GACzC,GAAIgD,EAAeD,IAAa/C,EAAS,EAAG,CAC3C,MAAMuD,EAAe7hB,EAAI/G,WAAWqlB,EAAS,GAC7C,GAAI8C,EAAgBS,GACnB,OAAON,EAAiBM,EAAcR,GAGxC,OAAOA,EAzcR32B,EAAAo0B,OAAA,SAAuBrxB,KAAkBuK,GACxC,OAAoB,IAAhBA,EAAKzO,OACDkE,EAEDA,EAAMpB,QAAQszB,GAAe,SAAUzlB,EAAO4nB,GACpD,MAAM7B,EAAMxf,SAASqhB,EAAO,IAC5B,OAAOC,MAAM9B,IAAQA,EAAM,GAAKA,GAAOjoB,EAAKzO,OAC3C2Q,EACAlC,EAAKioB,OAQRv1B,EAAAs3B,OAAA,SAAuBC,GACtB,OAAOA,EAAK51B,QAAQ,UAAU,SAAU6N,GACvC,OAAQA,GACP,IAAK,IAAK,MAAO,OACjB,IAAK,IAAK,MAAO;CACjB,IAAK,IAAK,MAAO,QACjB,QAAS,OAAOA,OAQnBxP,EAAAk1B,uBAAAA,EASAl1B,EAAA60B,KAAA,SAAqB9yB,EAAkBC,EAAiB,KAEvD,OAAOqzB,EADSF,EAAMpzB,EAAUC,GACVA,IAQvBhC,EAAAm1B,MAAAA,EAuBAn1B,EAAAq1B,MAAAA,EA6BAr1B,EAAAw3B,4BAAA,SAA4C3lB,GAC3C,OAAOA,EAAQlQ,QAAQ,wCAAyC,QAAQA,QAAQ,QAAS,OAG1F3B,EAAAy3B,eAAA,SAA+B5lB,GAC9B,OAAOA,EAAQlQ,QAAQ,MAAO,KAM/B3B,EAAA8B,WAAA,SAA2BC,EAAkBC,GAC5C,GAAID,EAASlD,OAASmD,EAAOnD,OAC5B,OAAO,EAGR,GAAIkD,IAAaC,EAChB,OAAO,EAGR,IAAK,IAAIrD,EAAI,EAAGA,EAAIqD,EAAOnD,OAAQF,IAClC,GAAIoD,EAASpD,KAAOqD,EAAOrD,GAC1B,OAAO,EAIT,OAAO,GAMRqB,EAAAiC,SAAA,SAAyBF,EAAkBC,GAC1C,MAAMk0B,EAAOn0B,EAASlD,OAASmD,EAAOnD,OACtC,OAAIq3B,EAAO,EACHn0B,EAASvB,QAAQwB,EAAQk0B,KAAUA,EACvB,IAATA,GACHn0B,IAAaC,GActBhC,EAAA03B,aAAA,SAA6BC,EAAsBC,EAAkB3zB,EAAyB,IAC7F,IAAK0zB,EACJ,MAAM,IAAIh0B,MAAM,yCAEZi0B,IACJD,EAAezC,EAAuByC,IAEnC1zB,EAAQ4zB,YACN,KAAKj2B,KAAK+1B,EAAaG,OAAO,MAClCH,EAAe,MAAQA,GAEnB,KAAK/1B,KAAK+1B,EAAaG,OAAOH,EAAa94B,OAAS,MACxD84B,GAA8B,QAGhC,IAAII,EAAY,GAchB,OAbI9zB,EAAQhF,SACX84B,GAAa,KAET9zB,EAAQ+zB,YACZD,GAAa,KAEV9zB,EAAQg0B,YACXF,GAAa,KAEV9zB,EAAQi0B,UACXH,GAAa,KAGP,IAAIn1B,OAAO+0B,EAAcI,IAGjC/3B,EAAAm4B,yBAAA,SAAyCC,GAGxC,MAAsB,MAAlBA,EAAOC,QAAoC,OAAlBD,EAAOC,QAAqC,MAAlBD,EAAOC,QAAoC,WAAlBD,EAAOC,WAMzED,EAAOE,KAAK,KACc,IAArBF,EAAOG;AAG3Bv4B,EAAAw4B,YAAA,SAA4BJ,GAC3B,OAAQA,EAAOn5B,OAAS,IAAM,KAC1Bm5B,EAAOK,WAAa,IAAM,KAC1BL,EAAOH,UAAY,IAAM,KACxBG,EAAmDF,QAAU,IAAM,KAOzEl4B,EAAA04B,wBAAA,SAAwCpjB,GACvC,IAAK,IAAI3W,EAAI,EAAGC,EAAM0W,EAAIzW,OAAQF,EAAIC,EAAKD,IAAK,CAC/C,MAAMg6B,EAASrjB,EAAI/G,WAAW5P,GAC9B,GAAU,KAANg6B,GAAmC,IAANA,EAChC,OAAOh6B,EAGT,OAAQ,GAOTqB,EAAA44B,qBAAA,SAAqCtjB,EAAayT,EAAgB,EAAG8K,EAAcve,EAAIzW,QACtF,IAAK,IAAIF,EAAIoqB,EAAOpqB,EAAIk1B,EAAKl1B,IAAK,CACjC,MAAMg6B,EAASrjB,EAAI/G,WAAW5P,GAC9B,GAAU,KAANg6B,GAAmC,IAANA,EAChC,OAAOrjB,EAAIzO,UAAUkiB,EAAOpqB,GAG9B,OAAO2W,EAAIzO,UAAUkiB,EAAO8K,IAO7B7zB,EAAA64B,uBAAA,SAAuCvjB,EAAawjB,EAAqBxjB,EAAIzW,OAAS,GACrF,IAAK,IAAIF,EAAIm6B,EAAYn6B,GAAK,EAAGA,IAAK,CACrC,MAAMg6B,EAASrjB,EAAI/G,WAAW5P,GAC9B,GAAU,KAANg6B,GAAmC,IAANA,EAChC,OAAOh6B,EAGT,OAAQ,GAGTqB,EAAA0a,QAAA,SAAwBjT,EAAWC,GAClC,OAAID,EAAIC,GACC,EACED,EAAIC,EACP,EAEA,GAIT1H,EAAAw1B,iBAAAA,EAoBAx1B,EAAA+4B,kBAAA,SAAkCtxB,EAAWC,GAC5C,OAAOuuB,EAA2BxuB,EAAGC,EAAG,EAAGD,EAAE5I,OAAQ,EAAG6I,EAAE7I,SAG3DmB,EAAAi2B,2BAAAA,EAyCAj2B,EAAAo2B,mBAAAA,EAIAp2B,EAAAm2B,mBAAAA,EAQAn2B,EAAAg5B,iBAAA,SAAiCvxB,EAAWC,GAC3C,OAAOD,EAAE5I,SAAW6I,EAAE7I,QAAUy3B,EAAmB7uB,EAAGC,IA+BvD1H,EAAAi5B,qBAAA,SAAqC3jB,EAAama,GACjD,MAAMyJ,EAAkBzJ,EAAU5wB,OAClC,QAAI4wB,EAAU5wB,OAASyW,EAAIzW,SAIpBy3B,EAAmBhhB,EAAKma,EAAWyJ,IAM3Cl5B,EAAAm5B,mBAAA,SAAmC1xB,EAAWC,GAE7C,IAAI/I,EACHC,EAAM8H,KAAK0yB,IAAI3xB,EAAE5I,OAAQ6I,EAAE7I;CAE5B,IAAKF,EAAI,EAAGA,EAAIC,EAAKD,IACpB,GAAI8I,EAAE8G,WAAW5P,KAAO+I,EAAE6G,WAAW5P,GACpC,OAAOA,EAIT,OAAOC,GAMRoB,EAAAq5B,mBAAA,SAAmC5xB,EAAWC,GAE7C,IAAI/I,EACHC,EAAM8H,KAAK0yB,IAAI3xB,EAAE5I,OAAQ6I,EAAE7I,QAE5B,MAAMy6B,EAAa7xB,EAAE5I,OAAS,EACxB06B,EAAa7xB,EAAE7I,OAAS,EAE9B,IAAKF,EAAI,EAAGA,EAAIC,EAAKD,IACpB,GAAI8I,EAAE8G,WAAW+qB,EAAa36B,KAAO+I,EAAE6G,WAAWgrB,EAAa56B,GAC9D,OAAOA,EAIT,OAAOC,GAMRoB,EAAA02B,gBAAAA,EAOA12B,EAAA42B,eAAAA,EAOA52B,EAAA62B,iBAAAA,EAOA72B,EAAAg3B,iBAAAA,EAyBAh3B,EAAAw5B,eAAA,SAA+BlkB,EAAase,GAC3C,MAAM6F,EAAoBC,EAAkBC,cACtCC,EAAgBhG,EAChBh1B,EAAM0W,EAAIzW,OAEVg7B,EAAmB7C,EAAiB1hB,EAAK1W,EAAKg1B,GACpDA,GAAWiG,GAAgB,MAAkD,EAAI,EAEjF,IAAIC,EAAoBL,EAAkBM,qBAAqBF,GAC/D,KAAOjG,EAASh1B,GAAK,CACpB,MAAMo7B,EAAgBhD,EAAiB1hB,EAAK1W,EAAKg1B,GAC3CqG,EAAwBR,EAAkBM,qBAAqBC,GACrE,GAAIE,EAA8BJ,EAAmBG,GACpD,MAEDrG,GAAWoG,GAAa,MAAkD,EAAI,EAC9EF,EAAoBG,EAGrB,OAAQrG,EAASgG,GAGlB55B,EAAAm6B,eAAA,SAA+B7kB,EAAase,GAC3C,MAAM6F,EAAoBC,EAAkBC,cACtCC,EAAgBhG,EAEhBiG,EAAmB3C,EAAiB5hB,EAAKse,GAC/CA,GAAWiG,GAAgB,MAAkD,EAAI,EAEjF,IAAIC,EAAoBL,EAAkBM,qBAAqBF,GAC/D,KAAOjG,EAAS,GAAG,CAClB,MAAMwG,EAAgBlD,EAAiB5hB,EAAKse,GACtCyG,EAAwBZ,EAAkBM,qBAAqBK,GACrE,GAAIF,EAA8BG,EAAuBP,GACxD,MAEDlG,GAAWwG,GAAa,MAAkD,EAAI,EAC9EN,EAAoBO,EAGrB,OAAQT,EAAgBhG,GAOzB5zB,EAAAs6B,WAAA,SAA2BpR,GAG1B,MAAMtqB,EAAMsqB,EAAOqR,WACb77B,EAAmB,GACzB,IAAIk1B,EAAS,EACb,KAAOA,EAASh1B,GAAK,CACpB,MAAM47B,EAAKtR,EAAO0K,GAClB,IAAI6G;CA2BJ,IAxBCA,EAFGD,GAAM,KAAc5G,EAAS,EAAIh1B,GAGb,EAAnBsqB,EAAO0K,OAA2B,KAAQ,GACrB,GAAnB1K,EAAO0K,OAA2B,KAAQ,GACvB,GAAnB1K,EAAO0K,OAA2B,IAAO,GACtB,GAAnB1K,EAAO0K,OAA2B,IAAO,EAErC4G,GAAM,KAAc5G,EAAS,EAAIh1B,GAGpB,GAAnBsqB,EAAO0K,OAA2B,KAAQ,GACrB,GAAnB1K,EAAO0K,OAA2B,IAAO,GACtB,GAAnB1K,EAAO0K,OAA2B,IAAO,EAErC4G,GAAM,KAAc5G,EAAS,EAAIh1B,GAGpB,GAAnBsqB,EAAO0K,OAA2B,IAAO,GACpB,GAAnB1K,EAAO0K,OAA2B,IAAO,EAInC1K,EAAO0K,OAGF,GAAK6G,GAAa,OAAYA,GAAa,OAAUA,GAAa,MAEnF/7B,EAAOuC,KAAK4C,OAAO4yB,aAAagE,SAC1B,GAAIA,GAAa,OAAYA,GAAa,QAAU,CAE1D,MAAMC,EAASD,EAAY,MACrBE,EAAK,QAAoB,QAATD,KAAqC,IACrDE,EAAK,QAAoB,KAATF,KAAqC,GAC3Dh8B,EAAOuC,KAAK4C,OAAO4yB,aAAakE,IAChCj8B,EAAOuC,KAAK4C,OAAO4yB,aAAamE,SAGhCl8B,EAAOuC,KAAK4C,OAAO4yB,aAAa,QAIlC,OAAO/3B,EAAOqR,KAAK,KAMpB,MAAM8qB,EAAe;CAKrB76B,EAAA86B,YAAA,SAA4BxlB,GAC3B,OAAOulB,EAAaj5B,KAAK0T,IAM1B,MAAMylB,EAAiB,0MAEvB/6B,EAAAg7B,cAAA,SAA8B1lB,GAC7B,OAAOylB,EAAen5B,KAAK0T,IAG5B,MAAM2lB,EAAiB,uBAyBvB,SAAgBC,EAAqBvE,GAwCpC,OADAA,GAAYA,IAEE,OAAUA,GAAY,OAC/BA,GAAY,OAAUA,GAAY,OAClCA,GAAY,OAAUA,GAAY,MA0DxC,SAAgBuD,EAA8BiB,EAA+BC,GAI5E,OAAc,IAAVD,EAEe,IAAVC,GAAqD,IAAVA,GAOtC,IAAVD,GACW,IAAVC,KAIS,IAAVD,GAAsD,IAAVA,GAAiD,IAAVA,IAGzE,IAAVC,GAAsD,IAAVA,GAAiD,IAAVA,IAQzE,IAAVD,GACW,IAAVC,GAAgD,IAAVA,GAAgD,KAAVA,GAAiD,KAAVA,MAI1G,KAAVD,GAAiD,IAAVA,GAC5B,IAAVC,GAAgD,KAAVA,MAI7B,KAAVD,GAAkD,KAAVA,GAC7B,KAAVC,KAOS,IAAVA,GAAqD,KAAVA,IAQjC,IAAVA,IAGU,IAAVD,KAMU,KAAVA,GAAkD,KAAVC,KAO9B,IAAVD,GAAiE,IAAVC,WAjM5Dp7B,EAAAq7B,aAAA,SAA6B/lB,GAC5B,OAAO2lB,EAAer5B,KAAK0T,IAGftV,EAAAs7B,yBAA2B,iBAIxCt7B,EAAAu7B,+BAAA,SAA+CjmB,GAC9C,OAAOtV,EAAAs7B,yBAAyB15B,KAAK0T,IAGtCtV,EAAAw7B,2BAAA,SAA2ClmB,GAC1C,IAAK,IAAI3W,EAAI,EAAGC,EAAM0W,EAAIzW,OAAQF,EAAIC,EAAKD,IAC1C,GAAIu8B,EAAqB5lB,EAAI/G,WAAW5P,IACvC,OAAO,EAGT,OAAO,GAGRqB,EAAAk7B,qBAAAA;AAmDAl7B,EAAAy7B,iBAAA,SAAiCld,GAChC,OACEA,GAAK,QAAWA,GAAK,QAAaA,GAAK,MAAQA,GAAK,OAAWA,GAAK,QAAUA,GAAK,QAChFA,GAAK,QAAUA,GAAK,QAAYA,GAAK,QAAUA,GAAK,QAAYA,GAAK,QAAUA,GAAK,QACpFA,GAAK,QAAUA,GAAK,QAAYA,GAAK,QAAUA,GAAK,QAAYA,GAAK,QAAUA,GAAK,QAM7Eve,EAAA07B,mBAAqB73B,OAAO4yB,aAAY,OAErDz2B,EAAA27B,kBAAA,SAAkCrmB,GACjC,SAAUA,GAAOA,EAAIzW,OAAS,GAAsB,QAAjByW,EAAI/G,WAAW,KAGnDvO,EAAA47B,2BAAA,SAA2C/d,EAAgBge,GAAqB,GAC/E,QAAKhe,IAIDge,IACHhe,EAASA,EAAOlc,QAAQ,OAAQ,KAG1Bkc,EAAO2D,gBAAkB3D,IAMjC7d,EAAA87B,iBAAA,SAAiCvgB,GAKhC,OAFAA,GAAQ,IAFY,GAKZ1X,OAAO4yB,aAAa,GAAalb,GAGlC1X,OAAO4yB,aAAa,GAAalb,EARpB,KAarBvb,EAAA+5B,qBAAA,SAAqCU,GAEpC,OAD0Bf,EAAkBC,cACnBI,qBAAqBU,IAG/Cz6B,EAAAk6B,8BAAAA,EAkGA,MAAMR,EAYLjb;AACC1f,KAAKg9B,MAyCCzN,KAAKC,MAAM;CAnDX9P,qBAIN,OAHKib,EAAkBsC,YACtBtC,EAAkBsC,UAAY,IAAItC,GAE5BA,EAAkBsC,UASnBvd,qBAAqBgc,GAE3B,GAAIA,EAAY,GACf,OAAa,KAATA,EACH,EAEY,KAATA,EACH,EAED,EAGD,GAAIA,EAAY,IACf,OAAA,EAGD,MAAMxuB,EAAOlN,KAAKg9B,MACZE,EAAYhwB,EAAKpN,OAAS,EAChC,IAAIq9B,EAAY,EAChB,KAAOA,GAAaD,GACnB,GAAIxB,EAAYxuB,EAAK,EAAIiwB,GAExBA,GAAY,MACN,CAAA,KAAIzB,EAAYxuB,EAAK,EAAIiwB,EAAY,IAK3C,OAAOjwB,EAAK,EAAIiwB,EAAY,GAH5BA,EAAY,EAAIA,EAAY,EAO9B,OAAA,GA9CcxC,EAAAsC,UAAsC,yDC9zBtD,SAAgBG,EAAO75B,EAAU85B,GAChC,cAAe95B,GACd,IAAK,SACJ,OAAY,OAARA,EACI+5B,EAAW,IAAKD,GACbv5B,MAAMC,QAAQR,IAiCTmZ,EAhCEnZ,EAiCpBg6B,EAAiBD,EAAW,OADEC,EAhCLF,GAkClB3gB,EAAI6L,OAAO,CAAC8U,EAASG,IAASJ,EAAOI,EAAMH,GAAUE,IAG7D,SAAoBh6B,EAAUg6B,GAE7B,OADAA,EAAiBD,EAAW,OAAQC,GAC7B98B,OAAOg9B,KAAKl6B,GAAKkF,OAAO8f,OAAO,CAAC8U,EAAS55B,KAC/C45B,EAAUK,EAAWj6B,EAAK45B,GACnBD,EAAO75B,EAAIE,GAAM45B,IACtBE,GAxCMI,CAAWp6B,EAAK85B,GACxB,IAAK,SACJ,OAAOK,EAAWn6B,EAAK85B,GACxB,IAAK,UACJ,OAcH,SAAqB10B,EAAY40B,GAChC,OAAOD,EAAW30B,EAAI,IAAM,IAAK40B,GAfxBK,CAAYr6B,EAAK85B,GACzB,IAAK,SACJ,OAAOC,EAAW/5B,EAAK85B,GACxB,IAAK,YACJ,OAAOC,EAAW,IAAKD,GACxB,QACC,OAAOC,EAAW,IAAKD,GAoB1B,IAAmB3gB,EAAY6gB,EAhB/B,SAASD,EAAWO,EAAaN,GAChC,OAAUA,GAAkB,GAAKA,EAAkBM,EAAO,EAO3D,SAAgBH,EAAWI,EAAWT,GACrCA,EAAUC,EAAW,OAAQD,GAC7B,IAAK,IAAIz9B,EAAI,EAAGE,EAASg+B,EAAEh+B,OAAQF,EAAIE,EAAQF,IAC9Cy9B,EAAUC,EAAWQ,EAAEtuB,WAAW5P,GAAIy9B,GAEvC,OAAOA,EAqBR,SAASU,EAAW/5B,EAAeg6B,EAAcC,EAAoB,IAEpE,MAAMC,EAAQD,EAAYD,EAM1B,OAASh6B,GAASg6B,MAHF,GAAKE,GAAS,GAGKl6B,KAAWk6B,KAAY,EAG3D,SAASC,EAAKC,EAAkB5f,EAAgB,EAAGoN,EAAgBwS,EAAK5C,WAAYx3B,EAAgB;AACnG,IAAK,IAAIpE,EAAI,EAAGA,EAAIgsB,EAAOhsB,IAC1Bw+B,EAAK5f,EAAQ5e,GAAKoE,EAWpB,SAASq6B,EAAYr6B,EAAes6B,EAAkB,IACrD,OARD,SAAiBt6B,EAAelE,EAAgBm2B,EAAe,KAC9D,KAAOjyB,EAAMlE,OAASA,GACrBkE,EAAQiyB,EAAOjyB,EAEhB,OAAOA,EAIAu6B,EAASv6B,IAAU,GAAGuf,SAAS,IAAK+a,EAAU,qGAtFtDr9B,EAAA0P,KAAA,SAAqBpN,GACpB,OAAO65B,EAAO75B,EAAK,IAIpBtC,EAAAm8B,OAAAA,EA8BAn8B,EAAAy8B,WAAAA,EAyDA,MAAac,EAgBZ9e,cAbQ1f,KAAAy+B,IAAM,WACNz+B,KAAA0+B,IAAM,WACN1+B,KAAA2+B,IAAM,WACN3+B,KAAA4+B,IAAM,UACN5+B,KAAA6+B,IAAM,WAUb7+B,KAAK8+B,MAAQ,IAAI7N,WAAW,IAC5BjxB,KAAK++B,QAAU,IAAIC,SAASh/B,KAAK8+B,MAAM3U,QACvCnqB,KAAKi/B,SAAW,EAChBj/B,KAAKk/B,UAAY,EACjBl/B,KAAKm/B,uBAAyB,EAC9Bn/B,KAAKo/B,WAAY,EAGX1f,OAAOnJ,GACb,MAAM8oB,EAAS9oB,EAAIzW,OACnB,GAAe,IAAXu/B,EACH,OAGD,MAAMC,EAAOt/B,KAAK8+B,MAClB,IAEIlH,EACA/C,EAHA0K,EAAUv/B,KAAKi/B,SACfO,EAAwBx/B,KAAKm/B,uBAajC,IAT8B,IAA1BK,GACH5H,EAAW4H,EACX3K,GAAU,EACV2K,EAAwB,IAExB5H,EAAWrhB,EAAI/G,WAAW,GAC1BqlB,EAAS,KAGG,CACZ,IAAI6G,EAAY9D,EAChB,GAAI6H,EAAQ9H,gBAAgBC,GAAW,CACtC,KAAI/C,EAAS,EAAIwK,GASV,CAENG,EAAwB5H,EACxB,MAZwB,CACxB,MAAMM,EAAe3hB,EAAI/G,WAAWqlB,EAAS,GACzC4K,EAAQ5H,eAAeK,IAC1BrD,IACA6G,EAAY+D,EAAQ3H,iBAAiBF,EAAUM,IAG/CwD,EAAS,YAOD+D,EAAQ5H,eAAeD,KAEjC8D,EAAS,OAKV,GAFA6D,EAAUv/B,KAAK0/B,MAAMJ,EAAMC,EAAS7D,OACpC7G,EACawK,GAGZ,MAFAzH,EAAWrhB,EAAI/G,WAAWqlB,GAM5B70B,KAAKi/B,SAAWM,EAChBv/B,KAAKm/B,uBAAyBK;AAGvB9f,MAAM4f,EAAkBC,EAAiB7D,GA2BhD,OA1BIA,EAAY,IACf4D,EAAKC,KAAa7D,EACRA,EAAY,MACtB4D,EAAKC,KAAa,KAA2B,KAAZ7D,KAAoD,EACrF4D,EAAKC,KAAa,KAA2B,GAAZ7D,KAAoD,GAC3EA,EAAY,OACtB4D,EAAKC,KAAa,KAA2B,MAAZ7D,KAAoD,GACrF4D,EAAKC,KAAa,KAA2B,KAAZ7D,KAAoD,EACrF4D,EAAKC,KAAa,KAA2B,GAAZ7D,KAAoD,IAErF4D,EAAKC,KAAa,KAA2B,QAAZ7D,KAAoD,GACrF4D,EAAKC,KAAa,KAA2B,OAAZ7D,KAAoD,GACrF4D,EAAKC,KAAa,KAA2B,KAAZ7D,KAAoD,EACrF4D,EAAKC,KAAa,KAA2B,GAAZ7D,KAAoD,GAGlF6D,GAAO,KACVv/B,KAAK2/B,QACLJ,GAAO,GACPv/B,KAAKk/B,WAAS,GAEdI,EAAK,GAAKA,EAAK,IACfA,EAAK,GAAKA,EAAK,IACfA,EAAK,GAAKA,EAAK,KAGTC,EAGD7f,SAYN,OAXK1f,KAAKo/B,YACTp/B,KAAKo/B,WAAY,EACbp/B,KAAKm/B,yBAERn/B,KAAKm/B,uBAAyB,EAC9Bn/B,KAAKi/B,SAAWj/B,KAAK0/B,MAAM1/B,KAAK8+B,MAAO9+B,KAAKi/B,SAAQ,QAErDj/B,KAAKk/B,WAAal/B,KAAKi/B,SACvBj/B,KAAK4/B,WAGCvB,EAAYr+B,KAAKy+B,KAAOJ,EAAYr+B,KAAK0+B,KAAOL,EAAYr+B,KAAK2+B,KAAON,EAAYr+B,KAAK4+B,KAAOP,EAAYr+B,KAAK6+B,KAGjHnf,UACP1f,KAAK8+B,MAAM9+B,KAAKi/B,YAAc,IAC9Bd,EAAKn+B,KAAK8+B,MAAO9+B,KAAKi/B,UAElBj/B,KAAKi/B,SAAW,KACnBj/B,KAAK2/B,QACLxB,EAAKn+B,KAAK8+B,QAIX,MAAMe,EAAK,EAAI7/B,KAAKk/B,UAEpBl/B,KAAK++B,QAAQe,UAAU,GAAIn4B,KAAK0V,MAAMwiB,EAAK,aAAa,GACxD7/B,KAAK++B,QAAQe,UAAU,GAAID,EAAK,YAAY,GAE5C7/B,KAAK2/B,QAGEjgB,QACP,MAAMqgB,EAAavB,EAAWwB,YACxB9yB,EAAOlN,KAAK++B,QAElB,IAAK,IAAI/1B,EAAI,EAAGA,EAAI,GAAeA,GAAK,EACvC+2B,EAAWD,UAAU92B,EAAGkE,EAAK+yB,UAAUj3B,GAAG,IAAQ;CAGnD,IAAK,IAAIA,EAAI,GAAIA,EAAI,IAAgBA,GAAK,EACzC+2B,EAAWD,UAAU92B,EAAG+0B,EAAYgC,EAAWE,UAAUj3B,EAAI,IAAI,GAAS+2B,EAAWE,UAAUj3B,EAAI,IAAI,GAAS+2B,EAAWE,UAAUj3B,EAAI,IAAI,GAAS+2B,EAAWE,UAAUj3B,EAAI,IAAI,GAAS,IAAI,GAGjM,IAMIk3B,EAAWC,EACXC,EAPA13B,EAAI1I,KAAKy+B,IACT91B,EAAI3I,KAAK0+B,IACT5vB,EAAI9O,KAAK2+B,IACT/Y,EAAI5lB,KAAK4+B,IACTxzB,EAAIpL,KAAK6+B,IAKb,IAAK,IAAI71B,EAAI,EAAGA,EAAI,GAAIA,IACnBA,EAAI,IACPk3B,EAAKv3B,EAAImG,GAAQnG,EAAKid,EACtBua,EAAI,YACMn3B,EAAI,IACdk3B,EAAIv3B,EAAImG,EAAI8W,EACZua,EAAI,YACMn3B,EAAI,IACdk3B,EAAKv3B,EAAImG,EAAMnG,EAAIid,EAAM9W,EAAI8W,EAC7Bua,EAAI,aAEJD,EAAIv3B,EAAImG,EAAI8W,EACZua,EAAI,YAGLC,EAAQrC,EAAWr1B,EAAG,GAAKw3B,EAAI90B,EAAI+0B,EAAIJ,EAAWE,UAAc,EAAJj3B,GAAO,GAAU,WAC7EoC,EAAIwa,EACJA,EAAI9W,EACJA,EAAIivB,EAAWp1B,EAAG,IAClBA,EAAID,EACJA,EAAI03B,EAGLpgC,KAAKy+B,IAAOz+B,KAAKy+B,IAAM/1B,EAAK,WAC5B1I,KAAK0+B,IAAO1+B,KAAK0+B,IAAM/1B,EAAK,WAC5B3I,KAAK2+B,IAAO3+B,KAAK2+B,IAAM7vB,EAAK,WAC5B9O,KAAK4+B,IAAO5+B,KAAK4+B,IAAMhZ,EAAK,WAC5B5lB,KAAK6+B,IAAO7+B,KAAK6+B,IAAMzzB,EAAK,YAhM9BnK,EAAAu9B,WAAAA,EACgBA,EAAAwB,YAAc,IAAIhB,SAAS,IAAIqB,YAAY,qLC9F3D,MAAaC,EAEZ5gB,YAAoB4Z,GAAAt5B,KAAAs5B,OAAAA,EAEpB5Z,cACC,MAAM4Z,EAASt5B,KAAKs5B,OACdiH,EAAa,IAAIC,WAAWlH,EAAOx5B,QACzC,IAAK,IAAIF,EAAI,EAAGC,EAAMy5B,EAAOx5B,OAAQF,EAAIC,EAAKD,IAC7C2gC,EAAW3gC,GAAK05B,EAAO9pB,WAAW5P,GAEnC,OAAO2gC,GAVTt/B,EAAAq/B,mBAAAA,EAcAr/B,EAAAw/B,WAAA,SAA2BC,EAAkBC,EAAkBC;AAC9D,OAAO,IAAIC,EAAQ,IAAIP,EAAmBI,GAAW,IAAIJ,EAAmBK,IAAWG,YAAYF,GAAQG,SA8C5G,MAAaC,EAELthB,cAAcuhB,EAAoBp8B,GACxC,IAAKo8B,EACJ,MAAM,IAAIr8B,MAAMC,IAJnB5D,EAAA+/B,MAAAA,EASA,MAAaE,EAgBLxhB,YAAYyhB,EAAoBC,EAAqBC,EAAyBC,EAA0BxhC,GAC9G,IAAK,IAAIF,EAAI,EAAGA,EAAIE,EAAQF,IAC3ByhC,EAAiBC,EAAmB1hC,GAAKuhC,EAAYC,EAAcxhC,GAG9D8f,aAAayhB,EAAyBC,EAAqBC,EAA8BC,EAA0BxhC,GACzH,IAAK,IAAIF,EAAI,EAAGA,EAAIE,EAAQF,IAC3ByhC,EAAiBC,EAAmB1hC,GAAKuhC,EAAYC,EAAcxhC,IAvBtEqB,EAAAigC,QAAAA,EAoDA,MAAMK,EAWL7hB,cACC1f,KAAKwhC,UAAY,GACjBxhC,KAAKyhC,gBAAe,WACpBzhC,KAAK0hC,gBAAe,WACpB1hC,KAAK2hC,gBAAkB,EACvB3hC,KAAK4hC,gBAAkB,EAMjBliB,kBAEF1f,KAAK2hC,gBAAkB,GAAK3hC,KAAK4hC,gBAAkB,IAEtD5hC,KAAKwhC,UAAUt/B,KAAK,IAAI2/B,EAAApiB,WAAWzf,KAAKyhC,gBAAiBzhC,KAAK2hC,gBAC7D3hC,KAAK0hC,gBAAiB1hC,KAAK4hC,kBAI7B5hC,KAAK2hC,gBAAkB,EACvB3hC,KAAK4hC,gBAAkB,EACvB5hC,KAAKyhC,gBAAe,WACpBzhC,KAAK0hC,gBAAe,WAUdhiB,mBAAmBoiB,EAAuBC,GAEhD/hC,KAAKyhC,gBAAkB95B,KAAK0yB,IAAIr6B,KAAKyhC,gBAAiBK,GACtD9hC,KAAK0hC,gBAAkB/5B,KAAK0yB,IAAIr6B,KAAK0hC,gBAAiBK,GAEtD/hC,KAAK2hC,kBAUCjiB,mBAAmBoiB,EAAuBC,GAEhD/hC,KAAKyhC,gBAAkB95B,KAAK0yB,IAAIr6B,KAAKyhC,gBAAiBK,GACtD9hC,KAAK0hC,gBAAkB/5B,KAAK0yB,IAAIr6B,KAAK0hC,gBAAiBK,GAEtD/hC,KAAK4hC;AAMCliB,aAMN,OALI1f,KAAK2hC,gBAAkB,GAAK3hC,KAAK4hC,gBAAkB,IAEtD5hC,KAAKgiC,iBAGChiC,KAAKwhC,UAMN9hB,oBAON,OANI1f,KAAK2hC,gBAAkB,GAAK3hC,KAAK4hC,gBAAkB,IAEtD5hC,KAAKgiC,iBAGNhiC,KAAKwhC,UAAU5mB,UACR5a,KAAKwhC,WASd,MAAaX,EAgBZnhB,YAAYuiB,EAA6BC,EAA6BC,EAAmE,MACxIniC,KAAKoiC,4BAA8BD,EAEnC,MAAOE,EAAwBC,EAAwBC,GAAsB1B,EAAQ2B,aAAaP,IAC3FQ,EAAwBC,EAAwBC,GAAsB9B,EAAQ2B,aAAaN,GAElGliC,KAAK4iC,YAAeL,GAAsBI,EAC1C3iC,KAAK6iC,wBAA0BR,EAC/BriC,KAAK8iC,wBAA0BR,EAC/BtiC,KAAK+iC,wBAA0BN,EAC/BziC,KAAKgjC,wBAA0BN,EAE/B1iC,KAAKijC,iBAAmB,GACxBjjC,KAAKkjC,iBAAmB,GAGjBxjB,sBAAsBhD,GAC7B,OAAQA,EAAI5c,OAAS,GAAuB,iBAAX4c,EAAI,GAG9BgD,oBAAoByjB,GAC3B,MAAMC,EAAWD,EAASE,cAE1B,GAAIxC,EAAQyC,eAAeF,GAAW,CACrC,MAAMG,EAAS,IAAI/C,WAAW4C,EAAStjC,QACvC,IAAK,IAAIF,EAAI,EAAGC,EAAMujC,EAAStjC,OAAQF,EAAIC,EAAKD,IAC/C2jC,EAAO3jC,GAAK4jC,EAAA9F,WAAW0F,EAASxjC,GAAI,GAErC,MAAO,CAACwjC,EAAUG,GAAQ,GAG3B,OAAIH,aAAoB5C,WAChB,CAAC,GAAI4C,GAAU,GAGhB,CAAC,GAAI,IAAI5C,WAAW4C,IAAW,GAG/B1jB,iBAAiBoiB,EAAuB2B;AAC/C,OAAIzjC,KAAK8iC,wBAAwBhB,KAAmB9hC,KAAKgjC,wBAAwBS,MAGzEzjC,KAAK4iC,aAAc5iC,KAAK6iC,wBAAwBf,KAAmB9hC,KAAK+iC,wBAAwBU,IAGjG/jB,yBAAyBgkB,EAAgBC,GAChD,OAAI3jC,KAAK8iC,wBAAwBY,KAAY1jC,KAAK8iC,wBAAwBa,MAGlE3jC,KAAK4iC,aAAc5iC,KAAK6iC,wBAAwBa,KAAY1jC,KAAK6iC,wBAAwBc,IAG1FjkB,yBAAyBgkB,EAAgBC,GAChD,OAAI3jC,KAAKgjC,wBAAwBU,KAAY1jC,KAAKgjC,wBAAwBW,MAGlE3jC,KAAK4iC,aAAc5iC,KAAK+iC,wBAAwBW,KAAY1jC,KAAK+iC,wBAAwBY,IAG3FjkB,YAAYkhB,GAClB,OAAO5gC,KAAK4jC,aAAa,EAAG5jC,KAAK8iC,wBAAwBhjC,OAAS,EAAG,EAAGE,KAAKgjC,wBAAwBljC,OAAS,EAAG8gC,GAQ1GlhB,aAAaC,EAAuBkkB,EAAqBhkB,EAAuBikB,EAAqBlD,GAC5G,MAAMmD,EAAe,EAAC,GACtB,IAAIhD,EAAU/gC,KAAKgkC,qBAAqBrkB,EAAekkB,EAAahkB,EAAeikB,EAAaC,GAShG,OAPInD,IAIHG,EAAU/gC,KAAKikC,gBAAgBlD,IAGzB,CACNmD,UAAWH,EAAa,GACxBhD,QAASA,GASHrhB,qBAAqBC,EAAuBkkB,EAAqBhkB,EAAuBikB,EAAqBC,GAIpH,IAHAA,EAAa,IAAK,EAGXpkB,GAAiBkkB,GAAehkB,GAAiBikB,GAAe9jC,KAAKmkC,iBAAiBxkB,EAAeE,IAC3GF,IACAE,IAID,KAAOgkB,GAAelkB,GAAiBmkB,GAAejkB,GAAiB7f,KAAKmkC,iBAAiBN,EAAaC,IACzGD,IACAC,IAID,GAAInkB,EAAgBkkB,GAAehkB,EAAgBikB,EAAa,CAC/D,IAAI/C;CAwBJ,OAtBIlhB,GAAiBikB,GACpB9C,EAAMoD,OAAOzkB,IAAkBkkB,EAAc,EAAG,0DAGhD9C,EAAU,CACT,IAAIc,EAAApiB,WAAWE,EAAe,EAAGE,EAAeikB,EAAcjkB,EAAgB,KAErEF,GAAiBkkB,GAC3B7C,EAAMoD,OAAOvkB,IAAkBikB,EAAc,EAAG,0DAGhD/C,EAAU,CACT,IAAIc,EAAApiB,WAAWE,EAAekkB,EAAclkB,EAAgB,EAAGE,EAAe,MAG/EmhB,EAAMoD,OAAOzkB,IAAkBkkB,EAAc,EAAG,0DAChD7C,EAAMoD,OAAOvkB,IAAkBikB,EAAc,EAAG,0DAGhD/C,EAAU,IAGJA,EAIR,MAAMsD,EAAiB,CAAC,GAClBC,EAAiB,CAAC,GAClB3kC,EAASK,KAAKukC,sBAAsB5kB,EAAekkB,EAAahkB,EAAeikB,EAAaO,EAAgBC,EAAgBP,GAE5HS,EAAcH,EAAe,GAC7BI,EAAcH,EAAe,GAEnC,GAAe,OAAX3kC,EAGH,OAAOA,EACD,IAAKokC,EAAa,GAAI,CAM5B,MAAMW,EAAc1kC,KAAKgkC,qBAAqBrkB,EAAe6kB,EAAa3kB,EAAe4kB,EAAaV,GACtG,IAAIY,EAA6B,GAYjC,OALCA,EALIZ,EAAa,GAKF,CACd,IAAIlC,EAAApiB,WAAW+kB,EAAc,EAAGX,GAAeW,EAAc,GAAK,EAAGC,EAAc,EAAGX,GAAeW,EAAc,GAAK,IAL1GzkC,KAAKgkC,qBAAqBQ,EAAc,EAAGX,EAAaY,EAAc,EAAGX,EAAaC,GAS/F/jC,KAAK4kC,mBAAmBF,EAAaC,GAI7C,MAAO,CACN,IAAI9C,EAAApiB,WAAWE,EAAekkB,EAAclkB,EAAgB,EAAGE,EAAeikB,EAAcjkB,EAAgB,IAItGH,UAAUmlB,EAA6BC,EAA8BC,EAA4BC,EACxGC,EAA6BC,EAA8BC,EAA4BC,EACvFC,EAA2BC,EAC3BxD,EAAuB+B,EAAqBQ,EAC5CtC,EAAuB+B,EAAqBQ,EAC5CiB,EAAsBxB,GAEtB,IAAIyB,EAAsC,KACtCC,EAAsC,KAGtCC,EAAe,IAAInE,EACnBoE,EAAcb,EACdc,EAAcb,EACdc,EAAoBxB,EAAe,GAAKC,EAAe,GAAMU,EAC7Dc,GAAiB,WACjBC,EAAe/lC,KAAKijC,iBAAiBnjC,OAAS,EAElD,EAAG,CAEF,MAAMkmC,EAAWH,EAAmBhB,EAGhCmB,IAAaL,GAAgBK,EAAWJ,GAAeP,EAAcW,EAAW,GAAKX,EAAcW,EAAW,IAGjHjE,GADAD,EAAgBuD,EAAcW,EAAW,IACTH,EAAmBb,EAC/ClD,EAAgBgE,GACnBJ,EAAa1D,iBAEd8D,EAAoBhE,EACpB4D,EAAaO,mBAAmBnE,EAAgB,EAAGC,GACnD8D,EAAoBG,EAAW,EAAKnB,IAIpC9C,GADAD,EAAgBuD,EAAcW,EAAW,GAAK,GACdH,EAAmBb;AAC/ClD,EAAgBgE,GACnBJ,EAAa1D,iBAEd8D,EAAoBhE,EAAgB,EACpC4D,EAAaQ,mBAAmBpE,EAAeC,EAAgB,GAC/D8D,EAAoBG,EAAW,EAAKnB,GAGjCkB,GAAgB,IAEnBlB,GADAQ,EAAgBrlC,KAAKijC,iBAAiB8C,IACF,GACpCJ,EAAc,EACdC,EAAcP,EAAcvlC,OAAS,WAE5BimC,IAAiB,GAM5B,GAFAP,EAAiBE,EAAaS,oBAE1BpC,EAAa,GAAI,CAIpB,IAAIqC,EAAqB/B,EAAe,GAAK,EACzCgC,EAAqB/B,EAAe,GAAK,EAE7C,GAAuB,OAAnBkB,GAA2BA,EAAe1lC,OAAS,EAAG,CACzD,MAAMwmC,EAAoBd,EAAeA,EAAe1lC,OAAS,GACjEsmC,EAAqBz+B,KAAKC,IAAIw+B,EAAoBE,EAAkBC,kBACpEF,EAAqB1+B,KAAKC,IAAIy+B,EAAoBC,EAAkBE,kBAGrEf,EAAiB,CAChB,IAAI5D,EAAApiB,WAAW2mB,EAAoBvC,EAAcuC,EAAqB,EACrEC,EAAoBvC,EAAcuC,EAAqB,QAEnD,CAENX,EAAe,IAAInE,EACnBoE,EAAcT,EACdU,EAAcT,EACdU,EAAoBxB,EAAe,GAAKC,EAAe,GAAMc,EAC7DU,EAAiB,WACjBC,EAAe,EAAgB/lC,KAAKkjC,iBAAiBpjC,OAAS,EAAIE,KAAKkjC,iBAAiBpjC,OAAS,EAEjG,EAAG,CAEF,MAAMkmC,EAAWH,EAAmBZ,EAGhCe,IAAaL,GAAgBK,EAAWJ,GAAeN,EAAcU,EAAW,IAAMV,EAAcU,EAAW,IAGlHjE,GADAD,EAAgBwD,EAAcU,EAAW,GAAK,GACdH,EAAmBT,EAC/CtD,EAAgBgE,GACnBJ,EAAa1D,iBAEd8D,EAAoBhE,EAAgB,EACpC4D,EAAaQ,mBAAmBpE,EAAgB,EAAGC,EAAgB,GACnE8D,EAAoBG,EAAW,EAAKf,IAIpClD,GADAD,EAAgBwD,EAAcU,EAAW,IACTH,EAAmBT,EAC/CtD,EAAgBgE,GACnBJ,EAAa1D,iBAEd8D,EAAoBhE,EACpB4D,EAAaO,mBAAmBnE,EAAgB,EAAGC,EAAgB,GACnE8D,EAAoBG,EAAW,EAAKf,GAGjCc,GAAgB,IAEnBd,GADAK,EAAgBtlC,KAAKkjC,iBAAiB6C,IACF,GACpCJ,EAAc,EACdC,EAAcN,EAAcxlC,OAAS,WAE5BimC,IAAiB,GAI5BN,EAAiBC,EAAae,aAG/B,OAAOzmC,KAAK4kC,mBAAmBY,EAAgBC,GAmBxC/lB,sBAAsBC,EAAuBkkB,EAAqBhkB,EAAuBikB,EAAqBO,EAA0BC,EAA0BP,GACzK,IAAIjC,EAAgB,EAAGC,EAAgB,EACnC+C,EAAuB,EAAGC,EAAqB,EAC/CG,EAAuB,EAAGC,EAAqB,EAInDxlB,IACAE,IAIAwkB,EAAe,GAAK,EACpBC,EAAe,GAAK,EAGpBtkC,KAAKijC,iBAAmB,GACxBjjC,KAAKkjC,iBAAmB;CAMxB,MAAMwD,EAAkB7C,EAAclkB,GAAkBmkB,EAAcjkB,GAChE8mB,EAAeD,EAAiB,EAChCrB,EAAgB,IAAI7E,WAAWmG,GAC/BrB,EAAgB,IAAI9E,WAAWmG,GAG/B9B,EAAuBf,EAAcjkB,EACrColB,EAAuBpB,EAAclkB,EAKrCqlB,EAAyBrlB,EAAgBE,EACzCulB,EAAyBvB,EAAcC,EAMvCyB,GADQN,EAAsBJ,GACP,GAAM,EAInCQ,EAAcR,GAAuBllB,EACrC2lB,EAAcL,GAAuBpB,EAGrCE,EAAa,IAAK,EAWlB,IAAK,IAAI6C,EAAiB,EAAGA,GAAmBF,EAAiB,EAAK,EAAGE,IAAkB,CAC1F,IAAIC,EAAwB,EACxBC,EAAwB,EAG5BhC,EAAuB9kC,KAAK+mC,kBAAkBlC,EAAsB+B,EAAgBA,EAAgB/B,EAAqB8B,GACzH5B,EAAqB/kC,KAAK+mC,kBAAkBlC,EAAsB+B,EAAgBA,EAAgB/B,EAAqB8B,GACvH,IAAK,IAAIX,EAAWlB,EAAsBkB,GAAYjB,EAAoBiB,GAAY,EAAG,CASxFjE,GAJCD,EADGkE,IAAalB,GAAyBkB,EAAWjB,GAAsBM,EAAcW,EAAW,GAAKX,EAAcW,EAAW,GACjHX,EAAcW,EAAW,GAEzBX,EAAcW,EAAW,GAAK,IAEdA,EAAWnB,GAAuBG,EAGnE,MAAMgC,EAAoBlF,EAI1B,KAAOA,EAAgB+B,GAAe9B,EAAgB+B,GAAe9jC,KAAKmkC,iBAAiBrC,EAAgB,EAAGC,EAAgB,IAC7HD,IACAC,IAaD,GAXAsD,EAAcW,GAAYlE,EAEtBA,EAAgBC,EAAgB8E,EAAwBC,IAC3DD,EAAwB/E,EACxBgF,EAAwB/E,IAOpBwD,GAAe59B,KAAK8vB,IAAIuO,EAAWf,IAAyB2B,EAAiB,GAC7E9E,GAAiBwD,EAAcU,GAIlC,OAHA3B,EAAe,GAAKvC,EACpBwC,EAAe,GAAKvC,EAEhBiF,GAAqB1B,EAAcU,IAAyDY,GAAkB,KAE1G5mC,KAAKinC,UAAUpC,EAAqBC,EAAsBC,EAAoBC,EACpFC,EAAqBC,EAAsBC,EAAoBC,EAC/DC,EAAeC,EACfxD,EAAe+B,EAAaQ,EAC5BtC,EAAe+B,EAAaQ,EAC5BiB,EAAaxB,GAKP,KAOX,MAAMmD,GAAyBL,EAAwBlnB,GAAkBmnB,EAAwBjnB,GAAiB+mB,GAAkB,EAEpI,GAAyC,OAArC5mC,KAAKoiC,8BAAyCpiC,KAAKoiC,4BAA4ByE,EAAuBK,GAQzG,OANAnD,EAAa,IAAK,EAGlBM,EAAe,GAAKwC,EACpBvC,EAAe,GAAKwC,EAEhBI,EAAuB,GAAiDN,GAAkB,KAEtF5mC,KAAKinC,UAAUpC,EAAqBC,EAAsBC,EAAoBC,EACpFC,EAAqBC,EAAsBC,EAAoBC,EAC/DC,EAAeC,EACfxD,EAAe+B,EAAaQ,EAC5BtC,EAAe+B,EAAaQ,EAC5BiB,EAAaxB,IAOdpkB,IACAE,IAEO,CACN,IAAIgiB,EAAApiB,WAAWE,EAAekkB,EAAclkB,EAAgB,EAC3DE,EAAeikB,EAAcjkB,EAAgB,KAMjDqlB,EAAuBllC,KAAK+mC,kBAAkB9B,EAAsB2B,EAAgBA,EAAgB3B,EAAqB0B,GACzHxB,EAAqBnlC,KAAK+mC,kBAAkB9B,EAAsB2B,EAAgBA,EAAgB3B,EAAqB0B,GACvH,IAAK,IAAIX,EAAWd,EAAsBc,GAAYb,EAAoBa,GAAY,EAAG,CASxFjE,GAJCD,EADGkE,IAAad,GAAyBc,EAAWb,GAAsBG,EAAcU,EAAW,IAAMV,EAAcU,EAAW,GAClHV,EAAcU,EAAW,GAAK,EAE9BV,EAAcU,EAAW,KAETA,EAAWf,GAAuBG,EAGnE,MAAM4B,EAAoBlF,EAI1B,KAAOA,EAAgBniB,GAAiBoiB,EAAgBliB,GAAiB7f,KAAKmkC,iBAAiBrC,EAAeC,IAC7GD,IACAC,IAOD,GALAuD,EAAcU,GAAYlE;AAKtByD,GAAe59B,KAAK8vB,IAAIuO,EAAWnB,IAAwB+B,GAC1D9E,GAAiBuD,EAAcW,GAIlC,OAHA3B,EAAe,GAAKvC,EACpBwC,EAAe,GAAKvC,EAEhBiF,GAAqB3B,EAAcW,IAAyDY,GAAkB,KAE1G5mC,KAAKinC,UAAUpC,EAAqBC,EAAsBC,EAAoBC,EACpFC,EAAqBC,EAAsBC,EAAoBC,EAC/DC,EAAeC,EACfxD,EAAe+B,EAAaQ,EAC5BtC,EAAe+B,EAAaQ,EAC5BiB,EAAaxB,GAKP,KAOX,GAAI6C,GAAc,KAA0C,CAG3D,IAAIxG,EAAO,IAAII,WAAWuE,EAAqBD,EAAuB,GACtE1E,EAAK,GAAKyE,EAAsBC,EAAuB,EACvD5D,EAAQiG,MAAM9B,EAAeP,EAAsB1E,EAAM,EAAG2E,EAAqBD,EAAuB,GACxG9kC,KAAKijC,iBAAiB/gC,KAAKk+B,IAE3BA,EAAO,IAAII,WAAW2E,EAAqBD,EAAuB,IAC7D,GAAKD,EAAsBC,EAAuB,EACvDhE,EAAQiG,MAAM7B,EAAeJ,EAAsB9E,EAAM,EAAG+E,EAAqBD,EAAuB,GACxGllC,KAAKkjC,iBAAiBhhC,KAAKk+B,IAO7B,OAAOpgC,KAAKinC,UAAUpC,EAAqBC,EAAsBC,EAAoBC,EACpFC,EAAqBC,EAAsBC,EAAoBC,EAC/DC,EAAeC,EACfxD,EAAe+B,EAAaQ,EAC5BtC,EAAe+B,EAAaQ,EAC5BiB,EAAaxB,GAYPrkB,gBAAgBqhB,GAGvB,IAAK,IAAInhC,EAAI,EAAGA,EAAImhC,EAAQjhC,OAAQF,IAAK,CACxC,MAAMwnC,EAASrG,EAAQnhC,GACjBynC,EAAgBznC,EAAImhC,EAAQjhC,OAAS,EAAKihC,EAAQnhC,EAAI,GAAG+f,cAAgB3f,KAAK8iC,wBAAwBhjC,OACtGwnC,EAAgB1nC,EAAImhC,EAAQjhC,OAAS,EAAKihC,EAAQnhC,EAAI,GAAGigB,cAAgB7f,KAAKgjC,wBAAwBljC,OACtGynC,EAAgBH,EAAOxnB,eAAiB,EACxC4nB,EAAgBJ,EAAOtnB,eAAiB,EAE9C,KAAOsnB,EAAOznB,cAAgBynB,EAAOxnB,eAAiBynB,GACrDD,EAAOvnB,cAAgBunB,EAAOtnB,eAAiBwnB,KAC7CC,GAAiBvnC,KAAKynC,yBAAyBL,EAAOznB,cAAeynB,EAAOznB,cAAgBynB,EAAOxnB,oBACnG4nB,GAAiBxnC,KAAK0nC,yBAAyBN,EAAOvnB,cAAeunB,EAAOvnB,cAAgBunB,EAAOtnB,kBACrGsnB,EAAOznB,gBACPynB,EAAOvnB,gBAGR,IAAI8nB,EAA4C,CAAC,MAC7C/nC,EAAImhC,EAAQjhC,OAAS,GAAKE,KAAK4nC,eAAe7G,EAAQnhC,GAAImhC,EAAQnhC,EAAI,GAAI+nC,KAC7E5G,EAAQnhC,GAAK+nC,EAAgB,GAC7B5G,EAAQ3hB,OAAOxf,EAAI,EAAG,GACtBA;AAMF,IAAK,IAAIA,EAAImhC,EAAQjhC,OAAS,EAAGF,GAAK,EAAGA,IAAK,CAC7C,MAAMwnC,EAASrG,EAAQnhC,GAEvB,IAAIynC,EAAe,EACfC,EAAe,EACnB,GAAI1nC,EAAI,EAAG,CACV,MAAMioC,EAAa9G,EAAQnhC,EAAI,GAC3BioC,EAAWjoB,eAAiB,IAC/BynB,EAAeQ,EAAWloB,cAAgBkoB,EAAWjoB,gBAElDioB,EAAW/nB,eAAiB,IAC/BwnB,EAAeO,EAAWhoB,cAAgBgoB,EAAW/nB,gBAIvD,MAAMynB,EAAgBH,EAAOxnB,eAAiB,EACxC4nB,EAAgBJ,EAAOtnB,eAAiB,EAE9C,IAAIgoB,EAAY,EACZC,EAAY/nC,KAAKgoC,eAAeZ,EAAOznB,cAAeynB,EAAOxnB,eAAgBwnB,EAAOvnB,cAAeunB,EAAOtnB,gBAE9G,IAAK,IAAIoe,EAAQ,GAAKA,IAAS,CAC9B,MAAMve,EAAgBynB,EAAOznB,cAAgBue,EACvCre,EAAgBunB,EAAOvnB,cAAgBqe,EAE7C,GAAIve,EAAgB0nB,GAAgBxnB,EAAgBynB,EACnD,MAGD,GAAIC,IAAkBvnC,KAAKynC,yBAAyB9nB,EAAeA,EAAgBynB,EAAOxnB,gBACzF,MAGD,GAAI4nB,IAAkBxnC,KAAK0nC,yBAAyB7nB,EAAeA,EAAgBunB,EAAOtnB,gBACzF,MAGD,MAAMmoB,EAAQjoC,KAAKgoC,eAAeroB,EAAeynB,EAAOxnB,eAAgBC,EAAeunB,EAAOtnB,gBAE1FmoB,EAAQF,IACXA,EAAYE,EACZH,EAAY5J,GAIdkJ,EAAOznB,eAAiBmoB,EACxBV,EAAOvnB,eAAiBioB,EAGzB,OAAO/G,EAGArhB,oBAAoBlB,GAC3B,OAAIA,GAAS,GAAKA,GAASxe,KAAK8iC,wBAAwBhjC,OAAS,GAGzDE,KAAK4iC,aAAe,QAAQ//B,KAAK7C,KAAK6iC,wBAAwBrkB,IAG/DkB,0BAA0BC,EAAuBC,GACxD,GAAI5f,KAAKkoC,oBAAoBvoB,IAAkB3f,KAAKkoC,oBAAoBvoB,EAAgB,GACvF,OAAO,EAER,GAAIC,EAAiB,EAAG,CACvB,MAAMikB,EAAclkB,EAAgBC,EACpC,GAAI5f,KAAKkoC,oBAAoBrE,EAAc,IAAM7jC,KAAKkoC,oBAAoBrE,GACzE,OAAO,EAGT,OAAO;AAGAnkB,oBAAoBlB,GAC3B,OAAIA,GAAS,GAAKA,GAASxe,KAAKgjC,wBAAwBljC,OAAS,GAGzDE,KAAK4iC,aAAe,QAAQ//B,KAAK7C,KAAK+iC,wBAAwBvkB,IAG/DkB,0BAA0BG,EAAuBC,GACxD,GAAI9f,KAAKmoC,oBAAoBtoB,IAAkB7f,KAAKmoC,oBAAoBtoB,EAAgB,GACvF,OAAO,EAER,GAAIC,EAAiB,EAAG,CACvB,MAAMgkB,EAAcjkB,EAAgBC,EACpC,GAAI9f,KAAKmoC,oBAAoBrE,EAAc,IAAM9jC,KAAKmoC,oBAAoBrE,GACzE,OAAO,EAGT,OAAO,EAGApkB,eAAeC,EAAuBC,EAAwBC,EAAuBC,GAG5F,OAFuB9f,KAAKooC,0BAA0BzoB,EAAeC,GAAkB,EAAI,IACpE5f,KAAKqoC,0BAA0BxoB,EAAeC,GAAkB,EAAI,GAWpFJ,mBAAmB4oB,EAAoBC,GAC9C,IAAIZ,EAAgC,GAEpC,GAAoB,IAAhBW,EAAKxoC,QAAiC,IAAjByoC,EAAMzoC,OAC9B,OAAQyoC,EAAMzoC,OAAS,EAAKyoC,EAAQD,EAC9B,GAAItoC,KAAK4nC,eAAeU,EAAKA,EAAKxoC,OAAS,GAAIyoC,EAAM,GAAIZ,GAAkB,CAKjF,MAAMhoC,EAAS,IAAImE,MAAkBwkC,EAAKxoC,OAASyoC,EAAMzoC,OAAS,GAKlE,OAJAohC,EAAQsH,KAAKF,EAAM,EAAG3oC,EAAQ,EAAG2oC,EAAKxoC,OAAS,GAC/CH,EAAO2oC,EAAKxoC,OAAS,GAAK6nC,EAAgB,GAC1CzG,EAAQsH,KAAKD,EAAO,EAAG5oC,EAAQ2oC,EAAKxoC,OAAQyoC,EAAMzoC,OAAS,GAEpDH,EACD,CACN,MAAMA,EAAS,IAAImE,MAAkBwkC,EAAKxoC,OAASyoC,EAAMzoC,QAIzD,OAHAohC,EAAQsH,KAAKF,EAAM,EAAG3oC,EAAQ,EAAG2oC,EAAKxoC,QACtCohC,EAAQsH,KAAKD,EAAO,EAAG5oC,EAAQ2oC,EAAKxoC,OAAQyoC,EAAMzoC,QAE3CH,GAYD+f,eAAe4oB,EAAkBC,EAAmBZ,GAI3D,GAHA3G,EAAMoD,OAAOkE,EAAK3oB,eAAiB4oB,EAAM5oB,cAAe;AACxDqhB,EAAMoD,OAAOkE,EAAKzoB,eAAiB0oB,EAAM1oB,cAAe,yDAEpDyoB,EAAK3oB,cAAgB2oB,EAAK1oB,gBAAkB2oB,EAAM5oB,eAAiB2oB,EAAKzoB,cAAgByoB,EAAKxoB,gBAAkByoB,EAAM1oB,cAAe,CACvI,MAAMF,EAAgB2oB,EAAK3oB,cAC3B,IAAIC,EAAiB0oB,EAAK1oB,eAC1B,MAAMC,EAAgByoB,EAAKzoB,cAC3B,IAAIC,EAAiBwoB,EAAKxoB,eAU1B,OARIwoB,EAAK3oB,cAAgB2oB,EAAK1oB,gBAAkB2oB,EAAM5oB,gBACrDC,EAAiB2oB,EAAM5oB,cAAgB4oB,EAAM3oB,eAAiB0oB,EAAK3oB,eAEhE2oB,EAAKzoB,cAAgByoB,EAAKxoB,gBAAkByoB,EAAM1oB,gBACrDC,EAAiByoB,EAAM1oB,cAAgB0oB,EAAMzoB,eAAiBwoB,EAAKzoB,eAGpE8nB,EAAgB,GAAK,IAAI9F,EAAApiB,WAAWE,EAAeC,EAAgBC,EAAeC,IAC3E,EAGP,OADA6nB,EAAgB,GAAK,MACd,EAgBDjoB,kBAAkBsmB,EAAkBY,EAAwB6B,EAA2B9B,GAC9F,GAAIX,GAAY,GAAKA,EAAWW,EAE/B,OAAOX,EAKR,MAEM0C,EAAY9B,EAAiB,GAAM,EAEzC,GAAIZ,EAAW,EAAG,CAEjB,OAAQ0C,KANcD,EAKmB,GAAM,GACR,EAAI,EAG3C,OAAQC,MARc/B,EAAe8B,EAAoB,GAOhB,GAAM,GACR9B,EAAe,EAAIA,EAAe,GA5xB5E1lC,EAAA4/B,QAAAA,kDCzNA,SAAgB8H,EAASpyB,GACxB,MAAuB,iBAARA,EAqChB,SAAgBqyB,EAAYrlC,GAC3B,YAAuB,IAARA,EAMhB,SAAgBslC,EAAkBtlC,GACjC,OAAQqlC,EAAYrlC,IAAgB,OAARA,EAwB7B,SAAgBulC,EAAWvlC,GAC1B,MAAuB,mBAARA,EAYhB,SAAgBwlC,EAAmBnqB,EAAUoqB,GAE5C,GAAIL,EAASK,IACZ,UAAWpqB,IAAQoqB,EAClB,MAAM,IAAIpkC,MAAM,8CAA8CokC;MAEzD,GAAIF,EAAWE,GAAa,CAClC,IACC,GAAIpqB,aAAeoqB,EAClB,OAEA,MAAA7gC,IAGF,IAAK0gC,EAAkBjqB,IAAQA,EAAI/Q,cAAgBm7B,EAClD,OAED,GAA0B,IAAtBA,EAAWlpC,SAAoD,IAApCkpC,EAAW14B,UAAK9J,EAAWoY,GACzD,OAED,MAAM,IAAIha,MAAM,8IAIlB,SAAgBqkC,EAAoB1lC,GACnC,IAAIskB,EAAgB,GAChBqhB,EAAQzoC,OAAO0oC,eAAe5lC,GAClC,KAAO9C,OAAOE,YAAcuoC,GAC3BrhB,EAAMA,EAAIjhB,OAAOnG,OAAO2oC,oBAAoBF,IAC5CA,EAAQzoC,OAAO0oC,eAAeD,GAE/B,OAAOrhB,8TAzHR5mB,EAAA8C,QAAA,SAA2BsY,GAC1B,OAAOvY,MAAMC,QAAQsY,IAMtBpb,EAAA0nC,SAAAA,EASA1nC,EAAAooC,SAAA,SAAyB9lC,GAIxB,QAAsB,iBAARA,GACF,OAARA,GACCO,MAAMC,QAAQR,IACbA,aAAeM,QACfN,aAAekB,OAOtBxD,EAAAqoC,SAAA,SAAyB/lC,GACxB,MAAuB,iBAARA,IAAqB+0B,MAAM/0B;AAM3CtC,EAAAsoC,UAAA,SAA0BhmC,GACzB,OAAgB,IAARA,IAAwB,IAARA,GAMzBtC,EAAA2nC,YAAAA,EAOA3nC,EAAA4nC,kBAAAA,EAKA5nC,EAAAuoC,WAAA,SAA2BvI,EAAgB5/B,GAC1C,IAAK4/B,EACJ,MAAM,IAAIr8B,MAAMvD,EAAO,8BAA8BA,KAAU,oBAOjEJ,EAAAwoC,gBAAA,SAAmC7qB,GAClC,GAAIiqB,EAAkBjqB,GACrB,MAAM,IAAIha,MAAM,mDAGjB,OAAOga,GAMR3d,EAAA6nC,WAAAA,EAMA7nC,EAAAyoC,oBAAA,SAAoCn7B,EAAao7B,GAChD,MAAM9pC,EAAM8H,KAAK0yB,IAAI9rB,EAAKzO,OAAQ6pC,EAAY7pC,QAC9C,IAAK,IAAIF,EAAI,EAAGA,EAAIC,EAAKD,IACxBmpC,EAAmBx6B,EAAK3O,GAAI+pC,EAAY/pC,KAI1CqB,EAAA8nC,mBAAAA,EAwBA9nC,EAAAgoC,oBAAAA,EAUAhoC,EAAA2oC,kBAAA,SAAkCrmC,GACjC,MAAMsmC,EAAoB,GAC1B,IAAK,MAAMC,KAAQb,EAAoB1lC,GACJ,mBAAtBA,EAAYumC,IACvBD,EAAQ3nC,KAAK4nC,GAGf,OAAOD,GAGR5oC,EAAA8oC,kBAAA,SAAoDC,EAAuBC,GAC1E,MAAMC,EAAqBC,IACnB,WACN,MAAM57B,EAAOzK,MAAMnD,UAAUyM,MAAMkD,KAAKF,UAAW,GACnD,OAAO65B,EAAOE,EAAQ57B,KAIxB,IAAI5O,EAAS,GACb,IAAK,MAAMyqC,KAAcJ,EAClBrqC,EAAQyqC,GAAcF,EAAkBE,GAE/C,OAAOzqC,GAMRsB,EAAAopC,oBAAA,SAAuC7qB,GACtC,OAAa,OAANA,OAAahZ,EAAYgZ,gICtHjCve,EAAAqpC,QAAA,SAAwBC,GACvB,OAAIA,EAAI,EACA,EAEJA,EAAC,IACJ,IAEU,EAAJA,GAGRtpC,EAAAupC,SAAA,SAAyBD;AACxB,OAAIA,EAAI,EACA,EAEJA,EAAC,WACJ,WAEU,EAAJA,wIChDR,MAAME,EAAiB,iBACjBC,EAAoB,MACpBC,EAAoB,QAiE1B,MAAMrpB,EAAS,GACTspB,EAAS,IACTC,EAAU,+DAkBhB,MAAaC,EA2DZprB,YAAsBqrB,EAAsCC,EAAoBzkC,EAAe0kC,EAAgBC,EAAmBC,GAAmB,GAExH,iBAAjBJ,GACV/qC,KAAKorC,OAASL,EAAaK,QAAU9pB,EACrCthB,KAAKgrC,UAAYD,EAAaC,WAAa1pB,EAC3CthB,KAAKuG,KAAOwkC,EAAaxkC,MAAQ+a,EACjCthB,KAAKirC,MAAQF,EAAaE,OAAS3pB,EACnCthB,KAAKkrC,SAAWH,EAAaG,UAAY5pB,IAKzCthB,KAAKorC,OAvHR,SAAoBA,EAAgBD,GACnC,OAAKC,GAAWD,EAGTC,EAFC,OAqHQC,CAAWN,EAAcI,GACvCnrC,KAAKgrC,UAAYA,GAAa1pB,EAC9BthB,KAAKuG,KAjHR,SAA8B6kC,EAAgB7kC,GAM7C,OAAQ6kC,GACP,IAAK,QACL,IAAK,OACL,IAAK,OACC7kC,EAEMA,EAAK,KAAOqkC,IACtBrkC,EAAOqkC,EAASrkC,GAFhBA,EAAOqkC,EAMV,OAAOrkC,EAgGO+kC,CAAqBtrC,KAAKorC,OAAQ7kC,GAAQ+a,GACtDthB,KAAKirC,MAAQA,GAAS3pB,EACtBthB,KAAKkrC,SAAWA,GAAY5pB,EA9J/B,SAAsBvR,EAAUo7B,GAG/B,IAAKp7B,EAAIq7B,QAAUD,EAClB,MAAM,IAAIvmC,MAAM,2DAA2DmL,EAAIi7B,sBAAsBj7B,EAAIxJ,kBAAkBwJ,EAAIk7B,sBAAsBl7B,EAAIm7B,cAK1J,GAAIn7B,EAAIq7B,SAAWX,EAAe5nC,KAAKkN,EAAIq7B,QAC1C,MAAM,IAAIxmC,MAAM,mDAQjB,GAAImL,EAAIxJ,KACP,GAAIwJ,EAAIi7B;AACP,IAAKN,EAAkB7nC,KAAKkN,EAAIxJ,MAC/B,MAAM,IAAI3B,MAAM,iJAGjB,GAAI+lC,EAAkB9nC,KAAKkN,EAAIxJ,MAC9B,MAAM,IAAI3B,MAAM,6HAuIjB2mC,CAAavrC,KAAMmrC,IA3ErBzrB,aAAayB,GACZ,OAAIA,aAAiB2pB,KAGhB3pB,IAGoC,iBAArBA,EAAO6pB,WACU,iBAApB7pB,EAAO+pB,UACS,iBAAhB/pB,EAAO5a,MACU,iBAAjB4a,EAAO8pB,OACW,iBAAlB9pB,EAAOiqB,QACW,mBAAlBjqB,EAAOqqB,QACS,mBAAhBrqB,EAAOsqB,MACa,mBAApBtqB,EAAOoC,UA2FzBioB,aAIC,OAAOE,EAAY1rC,MAAM,GAK1B0f,KAAK0nB,GAEJ,IAAKA,EACJ,OAAOpnC,KAGR,IAAIorC,OAAEA,EAAMJ,UAAEA,EAASzkC,KAAEA,EAAI0kC,MAAEA,EAAKC,SAAEA,GAAa9D,EA2BnD,YA1Be5gC,IAAX4kC,EACHA,EAASprC,KAAKorC,OACO,OAAXA,IACVA,EAAS9pB,QAEQ9a,IAAdwkC,EACHA,EAAYhrC,KAAKgrC,UACO,OAAdA,IACVA,EAAY1pB,QAEA9a,IAATD,EACHA,EAAOvG,KAAKuG,KACO,OAATA,IACVA,EAAO+a,QAEM9a,IAAVykC,EACHA,EAAQjrC,KAAKirC,MACO,OAAVA,IACVA,EAAQ3pB,QAEQ9a,IAAb0kC,EACHA,EAAWlrC,KAAKkrC,SACO,OAAbA,IACVA,EAAW5pB;AAGR8pB,IAAWprC,KAAKorC,QAChBJ,IAAchrC,KAAKgrC,WACnBzkC,IAASvG,KAAKuG,MACd0kC,IAAUjrC,KAAKirC,OACfC,IAAalrC,KAAKkrC,SAEdlrC,KAGD,IAAI2rC,EAAIP,EAAQJ,EAAWzkC,EAAM0kC,EAAOC,GAWhDxrB,aAAa1b,EAAemnC,GAAmB,GAC9C,MAAM16B,EAAQo6B,EAAQtR,KAAKv1B,GAC3B,OAAKyM,EAGE,IAAIk7B,EACVl7B,EAAM,IAAM6Q,EACZsqB,EAAcn7B,EAAM,IAAM6Q,GAC1BsqB,EAAcn7B,EAAM,IAAM6Q,GAC1BsqB,EAAcn7B,EAAM,IAAM6Q,GAC1BsqB,EAAcn7B,EAAM,IAAM6Q,GAC1B6pB,GARO,IAAIQ,EAAIrqB,EAAQA,EAAQA,EAAQA,EAAQA,GAiCjD5B,YAAYnZ,GAEX,IAAIykC,EAAY1pB,EAWhB,GANIgQ,EAAA7uB,YACH8D,EAAOA,EAAK3D,QAAQ,MAAOgoC,IAKxBrkC,EAAK,KAAOqkC,GAAUrkC,EAAK,KAAOqkC,EAAQ,CAC7C,MAAMpU,EAAMjwB,EAAK9E,QAAQmpC,EAAQ,IACpB,IAATpU,GACHwU,EAAYzkC,EAAKuB,UAAU,GAC3BvB,EAAOqkC,IAEPI,EAAYzkC,EAAKuB,UAAU,EAAG0uB,GAC9BjwB,EAAOA,EAAKuB,UAAU0uB,IAAQoU,GAIhC,OAAO,IAAIe,EAAI,OAAQX,EAAWzkC,EAAM+a,EAAQA,GAGjD5B,YAAYmsB,GACX,OAAO,IAAIF,EACVE,EAAWT,OACXS,EAAWb,UACXa,EAAWtlC,KACXslC,EAAWZ,MACXY,EAAWX,UAWbxrB,gBAAgBhd,KAAaopC,GAC5B,IAAKppC,EAAI6D,KACR,MAAM,IAAI3B,MAAM,yDAEjB,IAAImnC,EAMJ,OAJCA,EADGza,EAAA7uB,WAA4B,SAAfC,EAAI0oC,OACVN,EAAIkB,KAAK3mC,EAAM+tB,MAAMpiB,KAAK06B,EAAYhpC,GAAK,MAAUopC,IAAevlC,KAEpElB,EAAMkwB,MAAMvkB,KAAKtO,EAAI6D,QAASulC,GAElCppC,EAAI+oC,KAAK,CAAEllC,KAAMwlC,IAgBzBrsB,SAASusB,GAAwB,GAChC,OAAOC,EAAalsC,KAAMisC,GAG3BvsB,SACC,OAAO1f,KAOR0f,cAAcxS,GACb,GAAKA,EAEE,CAAA,GAAIA,aAAgB49B,EAC1B,OAAO59B,EACD,CACN,MAAMvN,EAAS,IAAIgsC,EAAIz+B,GAGvB,OAFAvN,EAAOwsC,WAAwBj/B,EAAMk/B,SACrCzsC,EAAO0sC,QAAqBn/B,EAAMo/B,OAASC,EAA4Br/B,EAAMs+B,OAAS,KAC/E7rC,GAPP,OAAOuN,GAjSVjM,EAAA6pC,IAAAA,EA4TA,MAAMyB,EAAiBjb,EAAA7uB,UAAY,OAAI+D,EAGvC,MAAMmlC,UAAYb,EAAlBprB;oBAEC1f,KAAAmsC,WAA4B,KAC5BnsC,KAAAqsC,QAAyB,KAEzBb,aAIC,OAHKxrC,KAAKqsC,UACTrsC,KAAKqsC,QAAUX,EAAY1rC,MAAM,IAE3BA,KAAKqsC,QAGb3sB,SAASusB,GAAwB,GAChC,OAAKA,EAOGC,EAAalsC,MAAM,IANrBA,KAAKmsC,aACTnsC,KAAKmsC,WAAaD,EAAalsC,MAAM,IAE/BA,KAAKmsC,YAOdzsB,SACC,MAAMmI,EAAgB,CACrB2kB,KAAM,GA0BP,OAvBIxsC,KAAKqsC,UACRxkB,EAAI2jB,OAASxrC,KAAKqsC,QAClBxkB,EAAIykB,KAAOC,GAERvsC,KAAKmsC,aACRtkB,EAAIukB,SAAWpsC,KAAKmsC,YAGjBnsC,KAAKuG,OACRshB,EAAIthB,KAAOvG,KAAKuG,MAEbvG,KAAKorC,SACRvjB,EAAIujB,OAASprC,KAAKorC,QAEfprC,KAAKgrC,YACRnjB,EAAImjB,UAAYhrC,KAAKgrC,WAElBhrC,KAAKirC,QACRpjB,EAAIojB,MAAQjrC,KAAKirC,OAEdjrC,KAAKkrC,WACRrjB,EAAIqjB,SAAWlrC,KAAKkrC,UAEdrjB,GAKT,MAAM4kB,EAAwC,CAC7CC,GAAkB,MAClBC,GAAkB,MAClBC,GAAyB,MACzBC,GAAiB,MACjBC,GAA8B,MAC9BC,GAA+B,MAC/BC,GAAmB,MAEnBC,GAA4B,MAC5BC,GAAuB,MACvBC,GAAsB,MACtBC,GAAwB,MACxBC,GAAsB,MACtBC,GAAuB,MACvBC,GAAqB,MACrBC,GAAiB,MACjBC,GAAkB,MAClBC,GAAsB,MACtBC,GAAmB,MAEnBC,GAAkB,OAGnB,SAASC,EAAuBC,EAAsBC,GACrD,IAAIlmB,OAA0BrhB,EAC1BwnC,GAAmB,EAEvB,IAAK,IAAIC,EAAM,EAAGA,EAAMH,EAAahuC,OAAQmuC,IAAO,CACnD,MAAM9b,EAAO2b,EAAat+B,WAAWy+B,GAGrC,GACE9b,GAAI,IAAkBA,GAAI,KACvBA,GAAI,IAAkBA,GAAI,IAC1BA,GAAI,IAAuBA,GAAI,IAC5B,KAAJA,GACI,KAAJA,GACI,KAAJA,GACI,MAAJA,GACC4b,GAAkB,KAAJ5b,GAGO,IAArB6b,IACHnmB,GAAOqmB,mBAAmBJ,EAAahmC,UAAUkmC,EAAiBC,IAClED,GAAmB,QAGRxnC,IAARqhB,IACHA,GAAOimB,EAAa/U,OAAOkV,QAGtB,MAEMznC,IAARqhB,IACHA,EAAMimB,EAAahrC,OAAO,EAAGmrC;CAI9B,MAAME,EAAU1B,EAAYta,QACZ3rB,IAAZ2nC,IAGsB,IAArBH,IACHnmB,GAAOqmB,mBAAmBJ,EAAahmC,UAAUkmC,EAAiBC,IAClED,GAAmB,GAIpBnmB,GAAOsmB,IAEwB,IAArBH,IAEVA,EAAkBC,IASrB,OAJyB,IAArBD,IACHnmB,GAAOqmB,mBAAmBJ,EAAahmC,UAAUkmC,UAGnCxnC,IAARqhB,EAAoBA,EAAMimB,EAGlC,SAASM,EAA0B7nC,GAClC,IAAIshB,OAA0BrhB,EAC9B,IAAK,IAAIynC,EAAM,EAAGA,EAAM1nC,EAAKzG,OAAQmuC,IAAO,CAC3C,MAAM9b,EAAO5rB,EAAKiJ,WAAWy+B,GACrB,KAAJ9b,GAA8B,KAAJA,QACjB3rB,IAARqhB,IACHA,EAAMthB,EAAKzD,OAAO,EAAGmrC,IAEtBpmB,GAAO4kB,EAAYta,SAEP3rB,IAARqhB,IACHA,GAAOthB,EAAK0nC,IAIf,YAAeznC,IAARqhB,EAAoBA,EAAMthB,EAMlC,SAAgBmlC,EAAYhpC,EAAU2rC,GAErC,IAAIrqC,EAsBJ,OAnBCA,EAFGtB,EAAIsoC,WAAatoC,EAAI6D,KAAKzG,OAAS,GAAoB,SAAf4C,EAAI0oC,OAEvC,KAAK1oC,EAAIsoC,YAAYtoC,EAAI6D,OAEX,KAAtB7D,EAAI6D,KAAKiJ,WAAW,KAChB9M,EAAI6D,KAAKiJ,WAAW,IAAE,IAAkB9M,EAAI6D,KAAKiJ,WAAW,IAAE,IAAkB9M,EAAI6D,KAAKiJ,WAAW,IAAE,IAAkB9M,EAAI6D,KAAKiJ,WAAW,IAAE,MACzH,KAAtB9M,EAAI6D,KAAKiJ,WAAW,GAElB6+B,EAII3rC,EAAI6D,KAAKzD,OAAO,GAFhBJ,EAAI6D,KAAK,GAAGkc,cAAgB/f,EAAI6D,KAAKzD,OAAO,GAM7CJ,EAAI6D,KAET+qB,EAAA7uB,YACHuB,EAAQA,EAAMpB,QAAQ,MAAO,OAEvBoB,EAMR,SAASkoC,EAAaxpC,EAAUupC,GAE/B,MAAMqC,EAAWrC,EAEdmC,EADAP,EAGH,IAAIhmB,EAAM,IACNujB,OAAEA,EAAMJ,UAAEA,EAASzkC,KAAEA,EAAI0kC,MAAEA,EAAKC,SAAEA,GAAaxoC,EASnD,GARI0oC,IACHvjB,GAAOujB,EACPvjB,GAAO,MAEJmjB,GAAwB,SAAXI,KAChBvjB,GAAO+iB,EACP/iB,GAAO+iB,GAEJI,EAAW,CACd,IAAIxU,EAAMwU,EAAUvpC,QAAQ,KAC5B,IAAa,IAAT+0B,EAAY,CAEf,MAAM+X,EAAWvD,EAAUloC,OAAO,EAAG0zB,GACrCwU,EAAYA,EAAUloC,OAAO0zB,EAAM,IAEtB,KADbA,EAAM+X,EAAS9sC,QAAQ,MAEtBomB,GAAOymB,EAAQC,GAAU,IAGzB1mB,GAAOymB,EAAQC,EAASzrC,OAAO,EAAG0zB,IAAM,GACxC3O,GAAO;AACPA,GAAOymB,EAAQC,EAASzrC,OAAO0zB,EAAM,IAAI,IAE1C3O,GAAO,KAIK,KADb2O,GADAwU,EAAYA,EAAUvoB,eACNhhB,QAAQ,MAEvBomB,GAAOymB,EAAQtD,GAAW,IAG1BnjB,GAAOymB,EAAQtD,EAAUloC,OAAO,EAAG0zB,IAAM,GACzC3O,GAAOmjB,EAAUloC,OAAO0zB,IAG1B,GAAIjwB,EAAM,CAET,GAAIA,EAAKzG,QAAU,GAAuB,KAAlByG,EAAKiJ,WAAW,IAA2C,KAAlBjJ,EAAKiJ,WAAW,GAAuB,CACvG,MAAM2iB,EAAO5rB,EAAKiJ,WAAW,GACzB2iB,GAAI,IAAkBA,GAAI,KAC7B5rB,EAAO,IAAIzB,OAAO4yB,aAAavF,EAAO,OAAO5rB,EAAKzD,OAAO,WAEpD,GAAIyD,EAAKzG,QAAU,GAAuB,KAAlByG,EAAKiJ,WAAW,GAAuB,CACrE,MAAM2iB,EAAO5rB,EAAKiJ,WAAW,GACzB2iB,GAAI,IAAkBA,GAAI,KAC7B5rB,EAAO,GAAGzB,OAAO4yB,aAAavF,EAAO,OAAO5rB,EAAKzD,OAAO,MAI1D+kB,GAAOymB,EAAQ/nC,GAAM,GAUtB,OARI0kC,IACHpjB,GAAO,IACPA,GAAOymB,EAAQrD,GAAO,IAEnBC,IACHrjB,GAAO,IACPA,GAAQokB,EAAyDf,EAA1C2C,EAAuB3C,GAAU,IAElDrjB,EAjGR5mB,EAAAyqC,YAAAA,EAkHA,MAAM8C,EAAiB,8BAEvB,SAAS5C,EAAcr1B,GACtB,OAAKA,EAAI9F,MAAM+9B,GAGRj4B,EAAI3T,QAAQ4rC,EAAiB/9B,IAlBrC,SAASg+B,EAA2Bl4B,GACnC,IACC,OAAOm4B,mBAAmBn4B,GACzB,MAAApO,GACD,OAAIoO,EAAIzW,OAAS,EACTyW,EAAIzT,OAAO,EAAG,GAAK2rC,EAA2Bl4B,EAAIzT,OAAO,IAEzDyT,IAWqCk4B,CAA2Bh+B,IAFjE8F,yMC9qBT,MAAMo4B,EAAa,cAenB,IAAIC,GAAyB,EAC7B3tC,EAAA4tC,wBAAA,SAAwClqC,GAClC2sB,EAAApB,QAIA0e,IACJA,GAAyB;AACzBhpC,QAAQ8R,KAAK,oLAEd9R,QAAQ8R,KAAK/S,EAAIE,WA+BlB,MAAMiqC,EAOLpvB,YAAYqvB,GACX/uC,KAAKgvC,WAAa,EAClBhvC,KAAKivC,SAAWF,EAChB/uC,KAAKkvC,aAAe,EACpBlvC,KAAKmvC,gBAAkB1uC,OAAOwH,OAAO,MAG/ByX,YAAY0vB,GAClBpvC,KAAKgvC,UAAYI,EAGX1vB,YAAYyqB,EAAgB57B,GAClC,IAAI8gC,EAAMvqC,SAAS9E,KAAKkvC,cACxB,OAAO,IAAI9jB,QAAa,CAACtd,EAASwhC,KACjCtvC,KAAKmvC,gBAAgBE,GAAO,CAC3BvhC,QAASA,EACTwhC,OAAQA,GAETtvC,KAAKuvC,MAAM,CACVC,SAAUxvC,KAAKgvC,UACfK,IAAKA,EACLlF,OAAQA,EACR57B,KAAMA,MAKFmR,cAAc7a,GACfA,GAAYA,EAAQ2qC,YAGD,IAApBxvC,KAAKgvC,WAAoBnqC,EAAQ2qC,WAAaxvC,KAAKgvC,WAGvDhvC,KAAKyvC,eAAe5qC,IAGb6a,eAAewS,GACtB,GAAIA,EAAIwd,IAAK,CACZ,IAAIC,EAA8Bzd,EAClC,IAAKlyB,KAAKmvC,gBAAgBQ,EAAaD,KAEtC,YADA9pC,QAAQ8R,KAAK,4BAId,IAAIk4B,EAAQ5vC,KAAKmvC,gBAAgBQ,EAAaD,KAG9C,UAFO1vC,KAAKmvC,gBAAgBQ,EAAaD,KAErCC,EAAahrC,IAAK,CACrB,IAAIA,EAAMgrC,EAAahrC,IAQvB,OAPIgrC,EAAahrC,IAAIgc,YACpBhc,EAAM,IAAIC,OACN8b,KAAOivB,EAAahrC,IAAI+b,KAC5B/b,EAAIE,QAAU8qC,EAAahrC,IAAIE,QAC/BF,EAAII,MAAQ4qC,EAAahrC,IAAII,YAE9B6qC,EAAMN,OAAO3qC,GAKd,YADAirC,EAAM9hC,QAAQ6hC,EAAa9nB;AAI5B,IAAIgoB,EAAkC3d,EAClCmd,EAAMQ,EAAeR,IACZrvC,KAAKivC,SAASa,cAAcD,EAAe1F,OAAQ0F,EAAethC,MACxE2c,KAAMnY,IACZ/S,KAAKuvC,MAAM,CACVC,SAAUxvC,KAAKgvC,UACfU,IAAKL,EACLxnB,IAAK9U,EACLpO,SAAK6B,KAEH4E,IACCA,EAAExJ,kBAAkBgD,QAEvBwG,EAAExJ,OAAS6iB,EAAAhE,+BAA+BrV,EAAExJ,SAE7C5B,KAAKuvC,MAAM,CACVC,SAAUxvC,KAAKgvC,UACfU,IAAKL,EACLxnB,SAAKrhB,EACL7B,IAAK8f,EAAAhE,+BAA+BrV,OAK/BsU,MAAMwS,GACb,IAAI6d,EAA0B,GAC9B,GAAI7d,EAAImd,IAAK,CACZ,MAAM34B,EAAqBwb,EAC3B,IAAK,IAAItyB,EAAI,EAAGA,EAAI8W,EAAEnI,KAAKzO,OAAQF,IAC9B8W,EAAEnI,KAAK3O,aAAcygC,aACxB0P,EAAS7tC,KAAKwU,EAAEnI,KAAK3O,QAGjB,CACN,MAAM8W,EAAmBwb,EACrBxb,EAAEmR,eAAewY,aACpB0P,EAAS7tC,KAAKwU,EAAEmR,KAGlB7nB,KAAKivC,SAASe,YAAY9d,EAAK6d,IAYjC,MAAaE,UAA+DtmB,EAAAxE,WAO3EzF,YAAYwwB,EAA+BpqC,EAAkBqqC,GAC5D1qB,QAEA,IAAI2qB,EAA+C,KAEnDpwC,KAAKqwC,QAAUrwC,KAAKswC,UAAUJ,EAAcjoC,OAC3C,qCACCiqB,IACAlyB,KAAKuwC,UAAUT,cAAc5d,IAE7BvtB,IAGIyrC,GACHA,EAAgBzrC,MAKnB3E,KAAKuwC,UAAY,IAAIzB,EAAqB,CACzCkB,YAAa,CAAC9d,EAAU6d,KACvB/vC,KAAKqwC,QAAQ9f,YAAY2B,EAAK6d,IAE/BD,cAAe,CAAC3F,EAAgB57B,KAC/B,GAAqC,mBAAzB4hC,EAAahG,GACxB,OAAO/e,QAAQkkB,OAAO,IAAI1qC,MAAM,kBAAoBulC,EAAS,0BAG9D,IACC,OAAO/e,QAAQtd,QAASqiC,EAAahG,GAAQ17B,MAAM0hC,EAAM5hC,IACxD,MAAOnD,GACR,OAAOggB,QAAQkkB,OAAOlkC;AAIzBpL,KAAKuwC,UAAUC,YAAYxwC,KAAKqwC,QAAQI,SAGxC,IAAIC,EAA2B,UACI,IAAlBzqB,KAAMtY,SAAoE,mBAA5BsY,KAAMtY,QAAQnD,UAE5EkmC,EAA4BzqB,KAAMtY,QAAQnD,iBACC,IAApByb,KAAM0qB,YAE7BD,EAA4BzqB,KAAM0qB,UAAU7S,EAAE8S,SAAS1mB,EAAE5kB,QAG1D,MAAMurC,EAAcC,EAAMlH,kBAAkBuG,GAG5CnwC,KAAK+wC,gBAAkB/wC,KAAKuwC,UAAUP,YAAYrB,EAAY,CAC7D3uC,KAAKqwC,QAAQI,QACblhB,KAAKC,MAAMD,KAAKyhB,UAAUN,IAC1B5qC,EACA+qC,IAID,MAAMI,EAAqB,CAAC9G,EAAgB57B,IACpCvO,KAAKkxC,SAAS/G,EAAQ57B,GAG9BvO,KAAKmxC,WAAa,IAAI/lB,QAAW,CAACtd,EAASwhC,KAC1Cc,EAAkBd,EAClBtvC,KAAK+wC,gBAAgB7lB,KAAMkmB,IAC1BtjC,EAAQgjC,EAAM/G,kBAAqBqH,EAAkBH,KAClD7lC,IACHkkC,EAAOlkC,GACPpL,KAAKqxC,SAAS,yBAA2BvrC,EAAUsF,OAK/CsU,iBACN,OAAO1f,KAAKmxC,WAGLzxB,SAASyqB,EAAgB57B,GAChC,OAAO,IAAI6c,QAAa,CAACtd,EAASwhC,KACjCtvC,KAAK+wC,gBAAgB7lB,KAAK,KACzBlrB,KAAKuwC,UAAUP,YAAY7F,EAAQ57B,GAAM2c,KAAKpd,EAASwhC,IACrDA,KAIG5vB,SAAS7a,EAAiBgB,GACjCD,QAAQC,MAAMhB,GACde,QAAQ0rC,KAAKzrC,IA9Ff5E,EAAAgvC,mBAAAA,EA8GA,MAAasB,EAMZ7xB,YAAY6Q,EAA2DihB,GACtExxC,KAAKyxC,uBAAyBD,EAC9BxxC,KAAK0xC,gBAAkB,KACvB1xC,KAAKuwC,UAAY,IAAIzB,EAAqB,CACzCkB,YAAa,CAAC9d,EAAU6d,KACvBxf,EAAY2B,EAAK6d,IAElBD,cAAe,CAAC3F,EAAgB57B,IAA8BvO,KAAKyvC,eAAetF,EAAQ57B,KAIrFmR,UAAUwS,GAChBlyB,KAAKuwC,UAAUT,cAAc5d,GAGtBxS,eAAeyqB,EAAgB57B;AACtC,GAAI47B,IAAWwE,EACd,OAAO3uC,KAAK2xC,WAAmBpjC,EAAK,GAASA,EAAK,GAAYA,EAAK,GAAcA,EAAK,IAGvF,IAAKvO,KAAK0xC,iBAA2D,mBAAjC1xC,KAAK0xC,gBAAgBvH,GACxD,OAAO/e,QAAQkkB,OAAO,IAAI1qC,MAAM,qCAAuCulC,IAGxE,IACC,OAAO/e,QAAQtd,QAAQ9N,KAAK0xC,gBAAgBvH,GAAQ17B,MAAMzO,KAAK0xC,gBAAiBnjC,IAC/E,MAAOnD,GACR,OAAOggB,QAAQkkB,OAAOlkC,IAIhBsU,WAAW0vB,EAAkBwC,EAAmB9rC,EAAkB+qC,GACzE7wC,KAAKuwC,UAAUC,YAAYpB,GAE3B,MAIMyC,EAAYf,EAAM/G,kBAAqB8G,EAJlB,CAAC1G,EAAgB57B,IACpCvO,KAAKuwC,UAAUP,YAAY7F,EAAQ57B,IAK3C,OAAIvO,KAAKyxC,wBAERzxC,KAAK0xC,gBAAkB1xC,KAAKyxC,uBAAuBI,GAC5CzmB,QAAQtd,QAAQgjC,EAAMlH,kBAAkB5pC,KAAK0xC,oBAGjDE,SAEiC,IAAzBA,EAAazsC,gBAChBysC,EAAsB,aAEI,IAAvBA,EAAavsC,YACc,IAA1BusC,EAAavsC,MAAMysC,WACtBF,EAAavsC,MAAU,GAKhCusC,EAAarsC,YAAa,EACpB0gB,KAAMtY,QAAQrI,OAAOssC,IAGrB,IAAIxmB,QAAkB,CAACtd,EAASwhC,KAEhCrpB,KAAMtY,QAAQ,CAAC7H,GAAY9E,IAChChB,KAAK0xC,gBAAkB1wC,EAAOiH,OAAO4pC,GAEhC7xC,KAAK0xC,gBAKV5jC,EAAQgjC,EAAMlH,kBAAkB5pC,KAAK0xC,kBAJpCpC,EAAO,IAAI1qC,MAAM,wBAKhB0qC,OA/ENruC,EAAAswC,mBAAAA,EAuFAtwC,EAAAgH,OAAA,SAAuBsoB,GACtB,OAAO,IAAIghB,EAAmBhhB,EAAa;8FCxX5C,MAAawhB,EAaZryB,YAAYsyB,GACX,IAAIC,EAAeC,EAAA5H,QAAQ0H,GAE3BhyC,KAAKgyC,cAAgBC,EACrBjyC,KAAKmyC,UAAYJ,EAAoBK,gBAAgBH,GACrDjyC,KAAKqyC,KAAO,IAAI/9B,IAGToL,uBAAuBuyB,GAC9B,IAAIK,EAAuB,IAAIrhB,WAAW,KAC1C,IAAK,IAAIrxB,EAAI,EAAGA,EAAI,IAAKA,IACxB0yC,EAAS1yC,GAAKqyC,EAEf,OAAOK,EAGD5yB,IAAIkY,EAAkBjR,GAC5B,IAAI3iB,EAAQkuC,EAAA5H,QAAQ3jB,GAEhBiR,GAAY,GAAKA,EAAW,IAC/B53B,KAAKmyC,UAAUva,GAAY5zB,EAE3BhE,KAAKqyC,KAAK39B,IAAIkjB,EAAU5zB,GAInB0b,IAAIkY,GACV,OAAIA,GAAY,GAAKA,EAAW,IACrB53B,KAAKmyC,UAAUva,GAEd53B,KAAKqyC,KAAKzxC,IAAIg3B,IAAa53B,KAAKgyC,eA3C9C/wC,EAAA8wC,oBAAAA,EAqDA9wC,EAAAsxC,aAAA,MAIC7yB,cACC1f,KAAKwyC,QAAU,IAAIT,EAAmB,GAGhCryB,IAAIkY,GACV53B,KAAKwyC,QAAQ99B,IAAIkjB,EAAQ,GAGnBlY,IAAIkY,GACV,OAAkC,IAA1B53B,KAAKwyC,QAAQ5xC,IAAIg3B,uHCtD3B,MAAa6a,EAUZ/yB,YAAYgzB,EAAoBC,GAC/B3yC,KAAK0yC,WAAaA,EAClB1yC,KAAK2yC,OAASA,EASfjzB,KAAKkzB,EAAwB5yC,KAAK0yC,WAAYG,EAAoB7yC,KAAK2yC,QACtE,OAAIC,IAAkB5yC,KAAK0yC,YAAcG,IAAc7yC,KAAK2yC,OACpD3yC,KAEA,IAAIyyC,EAASG,EAAeC,GAUrCnzB,MAAMozB,EAA0B,EAAGC,EAAsB,GACxD,OAAO/yC,KAAKyrC,KAAKzrC,KAAK0yC,WAAaI,EAAiB9yC,KAAK2yC,OAASI,GAM5DrzB,OAAO9C,GACb,OAAO61B,EAASlgC,OAAOvS,KAAM4c,GAMvB8C,cAAchX,EAAqBC;AACzC,OAAKD,IAAMC,KAIRD,KACAC,GACFD,EAAEgqC,aAAe/pC,EAAE+pC,YACnBhqC,EAAEiqC,SAAWhqC,EAAEgqC,OAQVjzB,SAAS9C,GACf,OAAO61B,EAASO,SAAShzC,KAAM4c,GAOzB8C,gBAAgBhX,EAAcC,GACpC,OAAID,EAAEgqC,WAAa/pC,EAAE+pC,cAGjB/pC,EAAE+pC,WAAahqC,EAAEgqC,aAGdhqC,EAAEiqC,OAAShqC,EAAEgqC,OAOdjzB,gBAAgB9C,GACtB,OAAO61B,EAASQ,gBAAgBjzC,KAAM4c,GAOhC8C,uBAAuBhX,EAAcC,GAC3C,OAAID,EAAEgqC,WAAa/pC,EAAE+pC,cAGjB/pC,EAAE+pC,WAAahqC,EAAEgqC,aAGdhqC,EAAEiqC,QAAUhqC,EAAEgqC,OAMfjzB,eAAehX,EAAcC,GACnC,IAAIuqC,EAA6B,EAAfxqC,EAAEgqC,WAChBS,EAA6B,EAAfxqC,EAAE+pC,WAEpB,GAAIQ,IAAgBC,EAAa,CAGhC,OAFyB,EAAXzqC,EAAEiqC,SACS,EAAXhqC,EAAEgqC,QAIjB,OAAOO,EAAcC,EAMfzzB,QACN,OAAO,IAAI+yB,EAASzyC,KAAK0yC,WAAY1yC,KAAK2yC,QAMpCjzB,WACN,MAAO,IAAM1f,KAAK0yC,WAAa,IAAM1yC,KAAK2yC,OAAS,IAQ7CjzB,YAAYuuB,GAClB,OAAO,IAAIwE,EAASxE,EAAIyE,WAAYzE,EAAI0E,QAMlCjzB,mBAAmBnc,GACzB,OACCA,GAC8B,iBAAnBA,EAAImvC,YACW,iBAAfnvC,EAAIovC,QAvJlB1xC,EAAAwxC,SAAAA,qHCUA,MAAaW,EAmBZ1zB,YAAY2zB,EAAyBC,EAAqBC,EAAuBC,GAC3EH,EAAkBE,GAAmBF,IAAoBE,GAAiBD,EAAcE,GAC5FxzC,KAAKqzC,gBAAkBE,EACvBvzC,KAAKszC,YAAcE,EACnBxzC,KAAKuzC,cAAgBF,EACrBrzC,KAAKwzC,UAAYF,IAEjBtzC,KAAKqzC,gBAAkBA;AACvBrzC,KAAKszC,YAAcA,EACnBtzC,KAAKuzC,cAAgBA,EACrBvzC,KAAKwzC,UAAYA,GAOZ9zB,UACN,OAAO0zB,EAAMzvC,QAAQ3D,MAMf0f,eAAef,GACrB,OAAQA,EAAM00B,kBAAoB10B,EAAM40B,eAAiB50B,EAAM20B,cAAgB30B,EAAM60B,UAM/E9zB,iBAAiB3B,GACvB,OAAOq1B,EAAMK,iBAAiBzzC,KAAM+d,GAM9B2B,wBAAwBf,EAAeZ,GAC7C,QAAIA,EAAS20B,WAAa/zB,EAAM00B,iBAAmBt1B,EAAS20B,WAAa/zB,EAAM40B,mBAG3Ex1B,EAAS20B,aAAe/zB,EAAM00B,iBAAmBt1B,EAAS40B,OAASh0B,EAAM20B,gBAGzEv1B,EAAS20B,aAAe/zB,EAAM40B,eAAiBx1B,EAAS40B,OAASh0B,EAAM60B,YASrE9zB,cAAcf,GACpB,OAAOy0B,EAAMM,cAAc1zC,KAAM2e,GAM3Be,qBAAqBf,EAAeg1B,GAC1C,QAAIA,EAAWN,gBAAkB10B,EAAM00B,iBAAmBM,EAAWJ,cAAgB50B,EAAM00B,qBAGvFM,EAAWN,gBAAkB10B,EAAM40B,eAAiBI,EAAWJ,cAAgB50B,EAAM40B,mBAGrFI,EAAWN,kBAAoB10B,EAAM00B,iBAAmBM,EAAWL,YAAc30B,EAAM20B,gBAGvFK,EAAWJ,gBAAkB50B,EAAM40B,eAAiBI,EAAWH,UAAY70B,EAAM60B,aAS/E9zB,oBAAoBf,GAC1B,OAAOy0B,EAAMQ,oBAAoB5zC,KAAM2e,GAMjCe,2BAA2Bf,EAAeg1B;AAChD,QAAIA,EAAWN,gBAAkB10B,EAAM00B,iBAAmBM,EAAWJ,cAAgB50B,EAAM00B,qBAGvFM,EAAWN,gBAAkB10B,EAAM40B,eAAiBI,EAAWJ,cAAgB50B,EAAM40B,mBAGrFI,EAAWN,kBAAoB10B,EAAM00B,iBAAmBM,EAAWL,aAAe30B,EAAM20B,gBAGxFK,EAAWJ,gBAAkB50B,EAAM40B,eAAiBI,EAAWH,WAAa70B,EAAM60B,aAUhF9zB,UAAUf,GAChB,OAAOy0B,EAAMS,UAAU7zC,KAAM2e,GAOvBe,iBAAiBhX,EAAWC,GAClC,IAAI0qC,EACAC,EACAC,EACAC,EAwBJ,OAtBI7qC,EAAE0qC,gBAAkB3qC,EAAE2qC,iBACzBA,EAAkB1qC,EAAE0qC,gBACpBC,EAAc3qC,EAAE2qC,aACN3qC,EAAE0qC,kBAAoB3qC,EAAE2qC,iBAClCA,EAAkB1qC,EAAE0qC,gBACpBC,EAAc3rC,KAAK0yB,IAAI1xB,EAAE2qC,YAAa5qC,EAAE4qC,eAExCD,EAAkB3qC,EAAE2qC,gBACpBC,EAAc5qC,EAAE4qC,aAGb3qC,EAAE4qC,cAAgB7qC,EAAE6qC,eACvBA,EAAgB5qC,EAAE4qC,cAClBC,EAAY7qC,EAAE6qC,WACJ7qC,EAAE4qC,gBAAkB7qC,EAAE6qC,eAChCA,EAAgB5qC,EAAE4qC,cAClBC,EAAY7rC,KAAKC,IAAIe,EAAE6qC,UAAW9qC,EAAE8qC,aAEpCD,EAAgB7qC,EAAE6qC,cAClBC,EAAY9qC,EAAE8qC,WAGR,IAAIJ,EAAMC,EAAiBC,EAAaC,EAAeC,GAMxD9zB,gBAAgBf,GACtB,OAAOy0B,EAAMU,gBAAgB9zC,KAAM2e,GAM7Be,uBAAuBhX,EAAWC,GACxC,IAAIorC,EAAwBrrC,EAAE2qC,gBAC1BW,EAAoBtrC,EAAE4qC,YACtBW,EAAsBvrC,EAAE6qC,cACxBW,EAAkBxrC,EAAE8qC,UACpBW,EAAuBxrC,EAAE0qC,gBACzBe,EAAmBzrC,EAAE2qC,YACrBe,EAAqB1rC,EAAE4qC,cACvBe,EAAiB3rC,EAAE6qC;CAiBvB,OAfIO,EAAwBI,GAC3BJ,EAAwBI,EACxBH,EAAoBI,GACVL,IAA0BI,IACpCH,EAAoBrsC,KAAKC,IAAIosC,EAAmBI,IAG7CH,EAAsBI,GACzBJ,EAAsBI,EACtBH,EAAkBI,GACRL,IAAwBI,IAClCH,EAAkBvsC,KAAK0yB,IAAI6Z,EAAiBI,IAIzCP,EAAwBE,EACpB,KAEJF,IAA0BE,GAAuBD,EAAoBE,EACjE,KAED,IAAId,EAAMW,EAAuBC,EAAmBC,EAAqBC,GAM1Ex0B,YAAY9C,GAClB,OAAOw2B,EAAMmB,YAAYv0C,KAAM4c,GAMzB8C,mBAAmBhX,EAAkBC,GAC3C,QACGD,KACAC,GACFD,EAAE2qC,kBAAoB1qC,EAAE0qC,iBACxB3qC,EAAE4qC,cAAgB3qC,EAAE2qC,aACpB5qC,EAAE6qC,gBAAkB5qC,EAAE4qC,eACtB7qC,EAAE8qC,YAAc7qC,EAAE6qC,UAOb9zB,iBACN,OAAO0zB,EAAMoB,eAAex0C,MAMtB0f,sBAAsBf,GAC5B,OAAO,IAAI81B,EAAAhC,SAAS9zB,EAAM40B,cAAe50B,EAAM60B,WAMzC9zB,mBACN,OAAO0zB,EAAMsB,iBAAiB10C,MAMxB0f,wBAAwBf,GAC9B,OAAO,IAAI81B,EAAAhC,SAAS9zB,EAAM00B,gBAAiB10B,EAAM20B,aAM3C5zB,WACN,MAAO,IAAM1f,KAAKqzC,gBAAkB,IAAMrzC,KAAKszC,YAAc,OAAStzC,KAAKuzC,cAAgB,IAAMvzC,KAAKwzC,UAAY,IAM5G9zB,eAAe6zB,EAAuBC,GAC5C,OAAO,IAAIJ,EAAMpzC,KAAKqzC,gBAAiBrzC,KAAKszC,YAAaC,EAAeC,GAMlE9zB,iBAAiB2zB,EAAyBC,GAChD,OAAO,IAAIF,EAAMC,EAAiBC,EAAatzC,KAAKuzC,cAAevzC,KAAKwzC,WAMlE9zB,kBACN,OAAO0zB,EAAMuB,gBAAgB30C,MAMvB0f,uBAAuBf,GAC7B,OAAO,IAAIy0B,EAAMz0B,EAAM00B,gBAAiB10B,EAAM20B,YAAa30B,EAAM00B,gBAAiB10B,EAAM20B;AAKlF5zB,qBAAqBsK,EAAkB8K,EAAiB9K,GAC9D,OAAO,IAAIopB,EAAMppB,EAAM0oB,WAAY1oB,EAAM2oB,OAAQ7d,EAAI4d,WAAY5d,EAAI6d,QAQ/DjzB,YAAYf,GAClB,OAAKA,EAGE,IAAIy0B,EAAMz0B,EAAM00B,gBAAiB10B,EAAM20B,YAAa30B,EAAM40B,cAAe50B,EAAM60B,WAF9E,KAQF9zB,gBAAgBnc,GACtB,OACCA,GACmC,iBAAxBA,EAAI8vC,iBACgB,iBAApB9vC,EAAI+vC,aACkB,iBAAtB/vC,EAAIgwC,eACc,iBAAlBhwC,EAAIiwC,UAOV9zB,iCAAiChX,EAAWC,GAElD,QAAID,EAAE6qC,cAAgB5qC,EAAE0qC,iBAAoB3qC,EAAE6qC,gBAAkB5qC,EAAE0qC,iBAAmB3qC,EAAE8qC,UAAY7qC,EAAE2qC,gBAKjG3qC,EAAE4qC,cAAgB7qC,EAAE2qC,iBAAoB1qC,EAAE4qC,gBAAkB7qC,EAAE2qC,iBAAmB1qC,EAAE6qC,UAAY9qC,EAAE4qC,aAW/F5zB,uBAAuBhX,EAAWC,GAExC,QAAID,EAAE6qC,cAAgB5qC,EAAE0qC,iBAAoB3qC,EAAE6qC,gBAAkB5qC,EAAE0qC,iBAAmB3qC,EAAE8qC,WAAa7qC,EAAE2qC,gBAKlG3qC,EAAE4qC,cAAgB7qC,EAAE2qC,iBAAoB1qC,EAAE4qC,gBAAkB7qC,EAAE2qC,iBAAmB1qC,EAAE6qC,WAAa9qC,EAAE4qC,aAYhG5zB,gCAAgChX,EAA8BC,GACpE,GAAID,GAAKC,EAAG,CACX,MAAMisC,EAAuC,EAApBlsC,EAAE2qC,gBACrBwB,EAAuC,EAApBlsC,EAAE0qC,gBAE3B,GAAIuB,IAAqBC,EAAkB,CAC1C,MAAMC,EAA+B,EAAhBpsC,EAAE4qC,YACjByB,EAA+B,EAAhBpsC,EAAE2qC,YAEvB,GAAIwB,IAAiBC,EAAc;AAClC,MAAMC,EAAmC,EAAlBtsC,EAAE6qC,cACnB0B,EAAmC,EAAlBtsC,EAAE4qC,cAEzB,GAAIyB,IAAmBC,EAAgB,CAGtC,OAFiC,EAAdvsC,EAAE8qC,YACY,EAAd7qC,EAAE6qC,WAGtB,OAAOwB,EAAiBC,EAEzB,OAAOH,EAAeC,EAEvB,OAAOH,EAAmBC,EAI3B,OAFiBnsC,EAAI,EAAI,IACRC,EAAI,EAAI,GAQnB+W,8BAA8BhX,EAAWC,GAC/C,OAAID,EAAE6qC,gBAAkB5qC,EAAE4qC,cACrB7qC,EAAE8qC,YAAc7qC,EAAE6qC,UACjB9qC,EAAE2qC,kBAAoB1qC,EAAE0qC,gBACpB3qC,EAAE4qC,YAAc3qC,EAAE2qC,YAEnB5qC,EAAE2qC,gBAAkB1qC,EAAE0qC,gBAEvB3qC,EAAE8qC,UAAY7qC,EAAE6qC,UAEjB9qC,EAAE6qC,cAAgB5qC,EAAE4qC,cAMrB7zB,0BAA0Bf,GAChC,OAAOA,EAAM40B,cAAgB50B,EAAM00B,iBA9ZrCpyC,EAAAmyC,MAAAA,8HCiBA,MAAa8B,UAAkBC,EAAA/B,MAkB9B1zB,YAAY01B,EAAkCC,EAA8BC,EAA4BC,GACvG9vB,MAAM2vB,EAA0BC,EAAsBC,EAAoBC,GAC1Ev1C,KAAKo1C,yBAA2BA,EAChCp1C,KAAKq1C,qBAAuBA,EAC5Br1C,KAAKs1C,mBAAqBA,EAC1Bt1C,KAAKu1C,eAAiBA,EAMhB71B,WACN,MAAO,IAAM1f,KAAKo1C,yBAA2B,IAAMp1C,KAAKq1C,qBAAuB,OAASr1C,KAAKs1C,mBAAqB,IAAMt1C,KAAKu1C,eAAiB,IAMxI71B,gBAAgB9C,GACtB,OACCs4B,EAAUM,gBAAgBx1C,KAAM4c,GAO3B8C,uBAAuBhX,EAAeC;AAC5C,OACCD,EAAE0sC,2BAA6BzsC,EAAEysC,0BACjC1sC,EAAE2sC,uBAAyB1sC,EAAE0sC,sBAC7B3sC,EAAE4sC,qBAAuB3sC,EAAE2sC,oBAC3B5sC,EAAE6sC,iBAAmB5sC,EAAE4sC,eAOlB71B,eACN,OAAI1f,KAAKo1C,2BAA6Bp1C,KAAKqzC,iBAAmBrzC,KAAKq1C,uBAAyBr1C,KAAKszC,YAChG,EAED,EAMM5zB,eAAe6zB,EAAuBC,GAC5C,OAAuB,IAAnBxzC,KAAKy1C,eACD,IAAIP,EAAUl1C,KAAKqzC,gBAAiBrzC,KAAKszC,YAAaC,EAAeC,GAEtE,IAAI0B,EAAU3B,EAAeC,EAAWxzC,KAAKqzC,gBAAiBrzC,KAAKszC,aAMpE5zB,cACN,OAAO,IAAI+0B,EAAAhC,SAASzyC,KAAKs1C,mBAAoBt1C,KAAKu1C,gBAM5C71B,iBAAiB2zB,EAAyBC,GAChD,OAAuB,IAAnBtzC,KAAKy1C,eACD,IAAIP,EAAU7B,EAAiBC,EAAatzC,KAAKuzC,cAAevzC,KAAKwzC,WAEtE,IAAI0B,EAAUl1C,KAAKuzC,cAAevzC,KAAKwzC,UAAWH,EAAiBC,GAQpE5zB,qBAAqBsK,EAAkB8K,EAAiB9K,GAC9D,OAAO,IAAIkrB,EAAUlrB,EAAM0oB,WAAY1oB,EAAM2oB,OAAQ7d,EAAI4d,WAAY5d,EAAI6d,QAMnEjzB,qBAAqBg2B,GAC3B,OAAO,IAAIR,EAAUQ,EAAIN,yBAA0BM,EAAIL,qBAAsBK,EAAIJ,mBAAoBI,EAAIH,gBAMnG71B,0BAA0BhX,EAAiBC,GACjD,GAAID,IAAMC,IAAMD,GAAKC,EACpB,OAAO,EAER,IAAKD,IAAMC,EACV,OAAO,EAER,GAAID,EAAE5I,SAAW6I,EAAE7I,OAClB,OAAO;CAER,IAAK,IAAIF,EAAI,EAAGC,EAAM6I,EAAE5I,OAAQF,EAAIC,EAAKD,IACxC,IAAKI,KAAKw1C,gBAAgB9sC,EAAE9I,GAAI+I,EAAE/I,IACjC,OAAO,EAGT,OAAO,EAMD8f,oBAAoBnc,GAC1B,OACCA,GAC4C,iBAAjCA,EAAI6xC,0BACyB,iBAA7B7xC,EAAI8xC,sBACuB,iBAA3B9xC,EAAI+xC,oBACmB,iBAAvB/xC,EAAIgyC,eAOV71B,2BAA2B2zB,EAAyBC,EAAqBC,EAAuBC,EAAmBmC,GAEzH,OAAa,IAATA,EACI,IAAIT,EAAU7B,EAAiBC,EAAaC,EAAeC,GAG5D,IAAI0B,EAAU3B,EAAeC,EAAWH,EAAiBC,IAtJlEryC,EAAAi0C,UAAAA,6JC1CAj0C,EAAA20C,MAAA,MAOCl2B,YAAYmV,EAAgBxzB,EAAcwuB,GACzC7vB,KAAK60B,OAAkB,EAATA,EACd70B,KAAKqB,KAAOA,EACZrB,KAAK6vB,SAAWA,EAGVnQ,WACN,MAAO,IAAM1f,KAAK60B,OAAS,KAAO70B,KAAKqB,KAAO,MAIhDJ,EAAA40C,mBAAA,MAMCn2B,YAAYo2B,EAAiBC,GAC5B/1C,KAAK81C,OAASA,EACd91C,KAAK+1C,SAAWA,IAIlB90C,EAAA+0C,oBAAA,MAYCt2B,YAAYo2B,EAAqBC,GAChC/1C,KAAK81C,OAASA,EACd91C,KAAK+1C,SAAWA,mIC1ClB,MAAME,EAAoC,EAO1C,SAASC,EAAYjU,EAA6BC,EAA6BC,EAA4CvB,GAE1H,OADiB,IAAIuV,EAAAtV,QAAQoB,EAAkBC,EAAkBC,GACjDrB,YAAYF,GAG7B,MAAMwV;AAML12B,YAAY22B,GACX,MAAMC,EAAyB,GACzBC,EAAuB,GAC7B,IAAK,IAAI32C,EAAI,EAAGE,EAASu2C,EAAMv2C,OAAQF,EAAIE,EAAQF,IAClD02C,EAAa12C,GAAK42C,EAAuBH,EAAMz2C,GAAI,GACnD22C,EAAW32C,GAAK62C,EAAsBJ,EAAMz2C,GAAI,GAEjDI,KAAKq2C,MAAQA,EACbr2C,KAAK02C,cAAgBJ,EACrBt2C,KAAK22C,YAAcJ,EAGb72B,cACN,MAAM0jB,EAAqB,GAC3B,IAAK,IAAIxjC,EAAI,EAAGC,EAAMG,KAAKq2C,MAAMv2C,OAAQF,EAAIC,EAAKD,IACjDwjC,EAASxjC,GAAKI,KAAKq2C,MAAMz2C,GAAGkI,UAAU9H,KAAK02C,cAAc92C,GAAK,EAAGI,KAAK22C,YAAY/2C,GAAK,GAExF,OAAOwjC,EAGD1jB,mBAAmB9f,GACzB,OAAOA,EAAI,EAGL8f,iBAAiB9f,GACvB,OAAOA,EAAI,EAGL8f,mBAAmBk3B,EAAqC7c,EAAoB8c,GAClF,MAAMC,EAAsB,GACtBC,EAAwB,GACxBC,EAAoB,GAC1B,IAAIn3C,EAAM,EACV,IAAK,IAAI2e,EAAQub,EAAYvb,GAASq4B,EAAUr4B,IAAS,CACxD,MAAMy4B,EAAcj3C,KAAKq2C,MAAM73B,GACzB80B,EAAesD,EAA6B52C,KAAK02C,cAAcl4B,GAAS,EACxEg1B,EAAaoD,EAA6B52C,KAAK22C,YAAYn4B,GAASy4B,EAAYn3C,OAAS,EAC/F,IAAK,IAAImX,EAAMq8B,EAAar8B,EAAMu8B,EAAWv8B,IAC5C6/B,EAAUj3C,GAAOo3C,EAAYznC,WAAWyH,EAAM,GAC9C8/B,EAAYl3C,GAAO2e,EAAQ,EAC3Bw4B,EAAQn3C,GAAOoX,EACfpX,IAGF,OAAO,IAAIq3C,EAAaJ,EAAWC,EAAaC,IAIlD,MAAME,EAMLx3B,YAAYo3B,EAAqBC,EAAuBC,GACvDh3C,KAAKm3C,WAAaL,EAClB92C,KAAKo3C,aAAeL,EACpB/2C,KAAKq3C,SAAWL,EAGVt3B,cACN,OAAO1f,KAAKm3C,WAGNz3B,mBAAmB9f,GACzB,OAAOI,KAAKo3C,aAAax3C,GAGnB8f,eAAe9f,GACrB,OAAOI,KAAKq3C,SAASz3C,GAGf8f,iBAAiB9f,GACvB,OAAOI,KAAKo3C,aAAax3C,GAGnB8f,aAAa9f,GACnB,OAAOI,KAAKq3C,SAASz3C,GAAK,GAI5B,MAAM03C,EAYL53B,YACC63B,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,GAEA93C,KAAKu3C,wBAA0BA,EAC/Bv3C,KAAKw3C,oBAAsBA;AAC3Bx3C,KAAKy3C,sBAAwBA,EAC7Bz3C,KAAK03C,kBAAoBA,EACzB13C,KAAK23C,wBAA0BA,EAC/B33C,KAAK43C,oBAAsBA,EAC3B53C,KAAK63C,sBAAwBA,EAC7B73C,KAAK83C,kBAAoBA,EAGnBp4B,4BAA4Bq4B,EAAyBC,EAAoCC,GAC/F,IAAIV,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EA0BJ,OAxBkC,IAA9BC,EAAWn4B,gBACd23B,EAA0B,EAC1BC,EAAsB,EACtBC,EAAwB,EACxBC,EAAoB,IAEpBH,EAA0BS,EAAqBE,mBAAmBH,EAAWp4B,eAC7E63B,EAAsBQ,EAAqBG,eAAeJ,EAAWp4B,eACrE83B,EAAwBO,EAAqBI,iBAAiBL,EAAWp4B,cAAgBo4B,EAAWn4B,eAAiB,GACrH83B,EAAoBM,EAAqBK,aAAaN,EAAWp4B,cAAgBo4B,EAAWn4B,eAAiB,IAG5E,IAA9Bm4B,EAAWj4B,gBACd63B,EAA0B,EAC1BC,EAAsB,EACtBC,EAAwB,EACxBC,EAAoB,IAEpBH,EAA0BM,EAAqBC,mBAAmBH,EAAWl4B,eAC7E+3B,EAAsBK,EAAqBE,eAAeJ,EAAWl4B,eACrEg4B,EAAwBI,EAAqBG,iBAAiBL,EAAWl4B,cAAgBk4B,EAAWj4B,eAAiB,GACrHg4B,EAAoBG,EAAqBI,aAAaN,EAAWl4B,cAAgBk4B,EAAWj4B,eAAiB,IAGvG,IAAIw3B,EACVC,EAAyBC,EAAqBC,EAAuBC,EACrEC,EAAyBC,EAAqBC,EAAuBC,IAmCxE,MAAMQ,EAOL54B,YACC63B,EACAE,EACAE,EACAE,EACAU,GAEAv4C,KAAKu3C,wBAA0BA,EAC/Bv3C,KAAKy3C,sBAAwBA,EAC7Bz3C,KAAK23C,wBAA0BA,EAC/B33C,KAAK63C,sBAAwBA,EAC7B73C,KAAKu4C,YAAcA,EAGb74B,4BAA4Bk3B,EAAqCmB,EAAyBS,EAAoCC,EAAoCC,EAAiCC,EAAmCC,GAC5O,IAAIrB,EACAE,EACAE,EACAE,EACAU,OAAwC/xC,EAkB5C,GAhBkC,IAA9BuxC,EAAWn4B,gBACd23B,EAA0BiB,EAAqBN,mBAAmBH,EAAWp4B,eAAiB;AAC9F83B,EAAwB,IAExBF,EAA0BiB,EAAqBN,mBAAmBH,EAAWp4B,eAC7E83B,EAAwBe,EAAqBJ,iBAAiBL,EAAWp4B,cAAgBo4B,EAAWn4B,eAAiB,IAGpF,IAA9Bm4B,EAAWj4B,gBACd63B,EAA0Bc,EAAqBP,mBAAmBH,EAAWl4B,eAAiB,EAC9Fg4B,EAAwB,IAExBF,EAA0Bc,EAAqBP,mBAAmBH,EAAWl4B,eAC7Eg4B,EAAwBY,EAAqBL,iBAAiBL,EAAWl4B,cAAgBk4B,EAAWj4B,eAAiB,IAGlH64B,GAA4BZ,EAAWn4B,eAAiB,GAAKm4B,EAAWn4B,eAAiB,IAAMm4B,EAAWj4B,eAAiB,GAAKi4B,EAAWj4B,eAAiB,IAAM44B,IAAoB,CAEzL,MAAMV,EAAuBQ,EAAqBK,mBAAmBjC,EAA4BmB,EAAWp4B,cAAeo4B,EAAWp4B,cAAgBo4B,EAAWn4B,eAAiB,GAC5Kq4B,EAAuBQ,EAAqBI,mBAAmBjC,EAA4BmB,EAAWl4B,cAAek4B,EAAWl4B,cAAgBk4B,EAAWj4B,eAAiB,GAElL,IAAIg5B,EAAa5C,EAAY8B,EAAsBC,EAAsBS,GAAkB,GAAM3X,QAE7F6X,IACHE,EAlFJ,SAAgCA,GAC/B,GAAIA,EAAWh5C,QAAU,EACxB,OAAOg5C,EAGR,MAAMn5C,EAAS,CAACm5C,EAAW,IAC3B,IAAIjR,EAAaloC,EAAO,GAExB,IAAK,IAAIC,EAAI,EAAGC,EAAMi5C,EAAWh5C,OAAQF,EAAIC,EAAKD,IAAK,CACtD,MAAMm5C,EAAaD,EAAWl5C,GAExBo5C,EAAyBD,EAAWp5B,eAAiBkoB,EAAWloB,cAAgBkoB,EAAWjoB,gBAC3Fq5B,EAAyBF,EAAWl5B,eAAiBgoB,EAAWhoB,cAAgBgoB,EAAW/nB,gBAE1EnY,KAAK0yB,IAAI2e,EAAwBC,GAEnChD,GAEpBpO,EAAWjoB,eAAkBm5B,EAAWp5B,cAAgBo5B,EAAWn5B,eAAkBioB,EAAWloB,cAChGkoB,EAAW/nB,eAAkBi5B,EAAWl5B,cAAgBk5B,EAAWj5B,eAAkB+nB,EAAWhoB,gBAGhGlgB,EAAOuC,KAAK62C,GACZlR,EAAakR,GAIf,OAAOp5C,EAuDSu5C,CAAuBJ,IAGrCP,EAAc,GACd,IAAK,IAAI34C,EAAI,EAAGE,EAASg5C,EAAWh5C,OAAQF,EAAIE,EAAQF,IACvD24C,EAAYr2C,KAAKo1C,EAAW6B,qBAAqBL,EAAWl5C,GAAIo4C,EAAsBC;AAIxF,OAAO,IAAIK,EAAWf,EAAyBE,EAAuBE,EAAyBE,EAAuBU,IAqPxH,SAAS/B,EAAuB4C,EAAanH,GAC5C,MAAMl/B,EAAI0sB,EAAQ9F,wBAAwByf,GAC1C,OAAW,IAAPrmC,EACIk/B,EAEDl/B,EAAI,EAGZ,SAAS0jC,EAAsB2C,EAAanH,GAC3C,MAAMl/B,EAAI0sB,EAAQ3F,uBAAuBsf,GACzC,OAAW,IAAPrmC,EACIk/B,EAEDl/B,EAAI,EAGZ,SAASsmC,EAAkCC,GAC1C,GAAuB,IAAnBA,EACH,MAAO,KAAM,EAGd,MAAMC,EAAY90C,KAAKD,MACvB,MAAO,IACCC,KAAKD,MAAQ+0C,EAAYD,EAhQlCr4C,EAAAu4C,aAAA,MAaC95B,YAAY+5B,EAAyBC,EAAyB9qC,GAC7D5O,KAAK24C,yBAA2B/pC,EAAK+pC,yBACrC34C,KAAK44C,6BAA+BhqC,EAAKgqC,6BACzC54C,KAAK42C,2BAA6BhoC,EAAKgoC,2BACvC52C,KAAK25C,qBAAuB/qC,EAAK+qC,qBACjC35C,KAAKy5C,cAAgBA,EACrBz5C,KAAK05C,cAAgBA,EACrB15C,KAAK0gC,SAAW,IAAI0V,EAAaqD,GACjCz5C,KAAK2gC,SAAW,IAAIyV,EAAasD,GAEjC15C,KAAK45C,iBAAmBP,EAAkCzqC,EAAKirC,oBAC/D75C,KAAK04C,iBAAmBW,EAA8D,IAA5BzqC,EAAKirC,mBAA2B,EAAIlyC,KAAK0yB,IAAIzrB,EAAKirC,mBAAoB,MAG1Hn6B,cAEN,GAAmC,IAA/B1f,KAAK0gC,SAAS2V,MAAMv2C,QAAkD,IAAlCE,KAAK0gC,SAAS2V,MAAM,GAAGv2C,OAE9D,MAAO,CACNokC,WAAW,EACXnD,QAAS,CAAC,CACTwW,wBAAyB,EACzBE,sBAAuB,EACvBE,wBAAyB,EACzBE,sBAAuB73C,KAAK2gC,SAAS0V,MAAMv2C,OAC3Cy4C,YAAa,CAAC,CACbT,kBAAmB;AACnBD,sBAAuB,EACvBD,oBAAqB,EACrBD,wBAAyB,EACzBD,kBAAmB,EACnBD,sBAAuB,EACvBD,oBAAqB,EACrBD,wBAAyB,OAM7B,GAAmC,IAA/Bv3C,KAAK2gC,SAAS0V,MAAMv2C,QAAkD,IAAlCE,KAAK2gC,SAAS0V,MAAM,GAAGv2C,OAE9D,MAAO,CACNokC,WAAW,EACXnD,QAAS,CAAC,CACTwW,wBAAyB,EACzBE,sBAAuBz3C,KAAK0gC,SAAS2V,MAAMv2C,OAC3C63C,wBAAyB,EACzBE,sBAAuB,EACvBU,YAAa,CAAC,CACbT,kBAAmB,EACnBD,sBAAuB,EACvBD,oBAAqB,EACrBD,wBAAyB,EACzBD,kBAAmB,EACnBD,sBAAuB,EACvBD,oBAAqB,EACrBD,wBAAyB,OAM7B,MAAMuC,EAAa5D,EAAYl2C,KAAK0gC,SAAU1gC,KAAK2gC,SAAU3gC,KAAK45C,iBAAkB55C,KAAK25C,sBACnFb,EAAagB,EAAW/Y,QACxBmD,EAAY4V,EAAW5V,UAK7B,GAAIlkC,KAAK42C,2BAA4B,CACpC,MAAMmD,EAA4B,GAClC,IAAK,IAAIn6C,EAAI,EAAGE,EAASg5C,EAAWh5C,OAAQF,EAAIE,EAAQF,IACvDm6C,EAAY73C,KAAKo2C,EAAW0B,qBAAqBh6C,KAAK42C,2BAA4BkC,EAAWl5C,GAAII,KAAK0gC,SAAU1gC,KAAK2gC,SAAU3gC,KAAK04C,iBAAkB14C,KAAK24C,yBAA0B34C,KAAK44C,+BAE3L,MAAO,CACN1U,UAAWA,EACXnD,QAASgZ,GAMX,MAAMp6C,EAAuB,GAE7B,IAAIs6C,EAAoB,EACpBC,EAAoB;CACxB,IAAK,IAAIt6C,GAAK,EAAcC,EAAMi5C,EAAWh5C,OAAQF,EAAIC,EAAKD,IAAK,CAClE,MAAMu6C,EAAcv6C,EAAI,EAAIC,EAAMi5C,EAAWl5C,EAAI,GAAK,KAChDynC,EAAgB8S,EAAaA,EAAWx6B,cAAgB3f,KAAKy5C,cAAc35C,OAC3EwnC,EAAgB6S,EAAaA,EAAWt6B,cAAgB7f,KAAK05C,cAAc55C,OAEjF,KAAOm6C,EAAoB5S,GAAgB6S,EAAoB5S,GAAc,CAC5E,MAAM8S,EAAep6C,KAAKy5C,cAAcQ,GAClCI,EAAer6C,KAAK05C,cAAcQ,GAExC,GAAIE,IAAiBC,EAAc,CAIlC,CACC,IAAI7C,EAAsBhB,EAAuB4D,EAAc,GAC3DxC,EAAsBpB,EAAuB6D,EAAc,GAC/D,KAAO7C,EAAsB,GAAKI,EAAsB,GAAG,CAG1D,GAFqBwC,EAAa5qC,WAAWgoC,EAAsB,KAC9C6C,EAAa7qC,WAAWooC,EAAsB,GAElE,MAEDJ,IACAI,KAGGJ,EAAsB,GAAKI,EAAsB,IACpD53C,KAAKs6C,8BAA8B36C,EAClCs6C,EAAoB,EAAG,EAAGzC,EAC1B0C,EAAoB,EAAG,EAAGtC,GAM7B,CACC,IAAIF,EAAoBjB,EAAsB2D,EAAc,GACxDtC,EAAoBrB,EAAsB4D,EAAc,GAC5D,MAAME,EAAoBH,EAAat6C,OAAS,EAC1C06C,EAAoBH,EAAav6C,OAAS,EAChD,KAAO43C,EAAoB6C,GAAqBzC,EAAoB0C,GAAmB,CAGtF,GAFqBJ,EAAa5qC,WAAWkoC,EAAoB,KAC5C0C,EAAa5qC,WAAWsoC,EAAoB,GAEhE,MAEDJ,IACAI,KAGGJ,EAAoB6C,GAAqBzC,EAAoB0C,IAChEx6C,KAAKs6C,8BAA8B36C,EAClCs6C,EAAoB,EAAGvC,EAAmB6C,EAC1CL,EAAoB,EAAGpC,EAAmB0C,IAK9CP,IACAC,IAGGC,IAEHx6C,EAAOuC,KAAKo2C,EAAW0B,qBAAqBh6C,KAAK42C,2BAA4BuD,EAAYn6C,KAAK0gC,SAAU1gC,KAAK2gC,SAAU3gC,KAAK04C,iBAAkB14C,KAAK24C,yBAA0B34C,KAAK44C,+BAElLqB,GAAqBE,EAAWv6B,eAChCs6B,GAAqBC,EAAWr6B,gBAIlC,MAAO,CACNokB,UAAWA,EACXnD,QAASphC,GAIH+f,8BACP/f,EACA86C,EAA4BjD,EAA6BE,EACzDgD,EAA4B9C,EAA6BE,GAEzD,GAAI93C,KAAK26C,+BAA+Bh7C,EAAQ86C,EAAoBjD,EAAqBE,EAAmBgD,EAAoB9C,EAAqBE,GAEpJ,OAGD,IAAIS,OAAwC/xC;CACxCxG,KAAK24C,2BACRJ,EAAc,CAAC,IAAIjB,EAClBmD,EAAoBjD,EAAqBiD,EAAoB/C,EAC7DgD,EAAoB9C,EAAqB8C,EAAoB5C,KAG/Dn4C,EAAOuC,KAAK,IAAIo2C,EACfmC,EAAoBA,EACpBC,EAAoBA,EACpBnC,IAIM74B,+BACP/f,EACA86C,EAA4BjD,EAA6BE,EACzDgD,EAA4B9C,EAA6BE,GAEzD,MAAMj4C,EAAMF,EAAOG,OACnB,GAAY,IAARD,EACH,OAAO,EAGR,MAAMgoC,EAAaloC,EAAOE,EAAM,GAEhC,OAAyC,IAArCgoC,EAAW4P,uBAAoE,IAArC5P,EAAWgQ,wBAKrDhQ,EAAW4P,sBAAwB,IAAMgD,GAAsB5S,EAAWgQ,sBAAwB,IAAM6C,IAC3G7S,EAAW4P,sBAAwBgD,EACnC5S,EAAWgQ,sBAAwB6C,EAC/B16C,KAAK24C,0BAA4B9Q,EAAW0Q,aAC/C1Q,EAAW0Q,YAAYr2C,KAAK,IAAIo1C,EAC/BmD,EAAoBjD,EAAqBiD,EAAoB/C,EAC7DgD,EAAoB9C,EAAqB8C,EAAoB5C,KAGxD,wMCvfG72C,EAAA25C,sBAAwB,oCAsBxB35C,EAAA45C,oBAbb,SAA0BC,EAAuB,IAChD,IAAIxhB,EAAS,yBACb,IAAK,MAAMvG,KAAO9xB,EAAA25C,sBACbE,EAAar5C,QAAQsxB,IAAQ,IAGjCuG,GAAU,KAAOvG,GAGlB,OADAuG,GAAU,SACH,IAAIz1B,OAAOy1B,EAAQ,KAIQyhB,GAEnC95C,EAAA+5C,0BAAA,SAA0CC,GACzC,IAAIt7C,EAAiBsB,EAAA45C,oBAErB,GAAII,GAAmBA,aAA0Bp3C,OAChD,GAAKo3C,EAAe/6C,OAanBP,EAASs7C,MAbkB,CAC3B,IAAIC,EAAQ;CACRD,EAAevhB,aAClBwhB,GAAS,KAEND,EAAe/hB,YAClBgiB,GAAS,KAELD,EAAuB9hB,UAC3B+hB,GAAS,KAEVv7C,EAAS,IAAIkE,OAAOo3C,EAAe3hB,OAAQ4hB,GAQ7C,OAFAv7C,EAAO65B,UAAY,EAEZ75B,GAGR,MAAMw7C,EAAiB,CACtBC,OAAQ,IACRC,WAAY,GACZC,WAAY,KAgEb,SAASC,EAAiCN,EAAwBO,EAAcvN,EAAawN,GAC5F,IAAIhrC,EACJ,KAAOA,EAAQwqC,EAAe1hB,KAAKiiB,IAAO,CACzC,MAAME,EAAajrC,EAAM+N,OAAS,EAClC,GAAIk9B,GAAczN,GAAOgN,EAAezhB,WAAayU,EACpD,OAAOx9B,EACD,GAAIgrC,EAAU,GAAKC,EAAaD,EACtC,OAAO,KAGT,OAAO,KAvERx6C,EAAA06C,cAAA,SAAgBA,EAAchJ,EAAgBsI,EAAwBO,EAAcI,EAAoBt2C,EAAS61C,GAEhH,GAAIK,EAAK17C,OAASwF,EAAO81C,OAAQ,CAGhC,IAAIpxB,EAAQ2oB,EAASrtC,EAAO81C,OAAS,EAQrC,OAPIpxB,EAAQ,GACX4xB,GAAcjJ,EACd3oB,EAAQ,GAER4xB,GAAc5xB,EAGR2xB,EAAchJ,EAAQsI,EAD7BO,EAAOA,EAAK1zC,UAAUkiB,EAAO2oB,EAASrtC,EAAO81C,OAAS,GACHQ,EAAYt2C,GAGrDb,KAAKD,MAAhB,MACMypC,EAAM0E,EAAS,EAAIiJ,EAEzB,IAAIC,GAAkB,EAClBprC,EAAiC,KAErC,IAAK,IAAI7Q,EAAI,GAAKA,IAAK,CAElB6E,KAAKD,MAAcc,EAAOg2C,WAM9B,MAAMQ,EAAa7N,EAAM3oC,EAAO+1C,WAAaz7C,EAC7Cq7C,EAAezhB,UAAY7xB,KAAKC,IAAI,EAAGk0C,GACvC,MAAMC,EAAYR,EAAiCN,EAAgBO,EAAMvN,EAAK4N,GAE9E,IAAKE,GAAatrC,EAEjB,MAMD,GAHAA,EAAQsrC,EAGJD,GAAc,EACjB,MAEDD,EAAiBC,EAGlB,GAAIrrC,EAAO,CACV,IAAI9Q,EAAS,CACZq8C,KAAMvrC,EAAM,GACZ6iC,YAAasI,EAAa,EAAInrC,EAAM+N,MACpCg1B,UAAWoI,EAAa,EAAInrC,EAAM+N,MAAS/N,EAAM,GAAG3Q,QAGrD,OADAm7C,EAAezhB,UAAY,EACpB75B,EAGR,OAAO,8KCvFR,MAAas8C,EAMZv8B,YAAYw8B,EAAcC,EAAclK,GACvC,MAAM/kC,EAAO,IAAI+jB,WAAWirB,EAAOC,GACnC,IAAK,IAAIv8C,EAAI,EAAGC,EAAMq8C,EAAOC,EAAMv8C,EAAIC,EAAKD,IAC3CsN,EAAKtN,GAAKqyC,EAGXjyC,KAAKg9B,MAAQ9vB;AACblN,KAAKk8C,KAAOA,EACZl8C,KAAKm8C,KAAOA,EAGNz8B,IAAI08B,EAAanlC,GACvB,OAAOjX,KAAKg9B,MAAMof,EAAMp8C,KAAKm8C,KAAOllC,GAG9ByI,IAAI08B,EAAanlC,EAAajT,GACpChE,KAAKg9B,MAAMof,EAAMp8C,KAAKm8C,KAAOllC,GAAOjT,GAtBtC/C,EAAAg7C,YAAAA,EA0BA,MAAaI,EAKZ38B,YAAY48B,GACX,IAAIC,EAAc,EACdC,EAAQ,EACZ,IAAK,IAAI58C,EAAI,EAAGC,EAAMy8C,EAAMx8C,OAAQF,EAAIC,EAAKD,IAAK,CACjD,IAAK2I,EAAMqxB,EAAQpxB,GAAM8zC,EAAM18C,GAC3Bg6B,EAAS2iB,IACZA,EAAc3iB,GAEXrxB,EAAOi0C,IACVA,EAAWj0C,GAERC,EAAKg0C,IACRA,EAAWh0C,GAOb,IAAIi0C,EAAS,IAAIR,IAFjBO,IADAD,EAGkD,GAClD,IAAK,IAAI38C,EAAI,EAAGC,EAAMy8C,EAAMx8C,OAAQF,EAAIC,EAAKD,IAAK,CACjD,IAAK2I,EAAMqxB,EAAQpxB,GAAM8zC,EAAM18C,GAC/B68C,EAAO/nC,IAAInM,EAAMqxB,EAAQpxB,GAG1BxI,KAAK08C,QAAUD,EACfz8C,KAAK28C,aAAeJ,EAGd78B,UAAUk9B,EAAqBhjB,GACrC,OAAIA,EAAS,GAAKA,GAAU55B,KAAK28C,aAChC,EAEM38C,KAAK08C,QAAQ97C,IAAIg8C,EAAchjB,IAtCxC34B,EAAAo7C,aAAAA,EA2CA,IAAIQ,EAAqC,KAgDzC,IAAIC,EAA0D,KAkB9D,MAAaC,EAEJr9B,mBAAmBs9B,EAAiDjmC,EAAc27B,EAAoBuK,EAAwBC,GAErI,IAAIC,EAAwBD,EAAe,EAC3C,EAAG,CACF,MAAMtjB,EAAS7iB,EAAKvH,WAAW2tC,GAE/B,GAAW,IADKH,EAAWp8C,IAAIg5B,GAE9B,MAEDujB,UACQA,EAAwBF,GAGjC,GAAIA,EAAiB,EAAG,CACvB,MAAMG,EAAqBrmC,EAAKvH,WAAWytC,EAAiB,GACtDI,EAAqBtmC,EAAKvH,WAAW2tC,IAGvB,KAAlBC,GAA+D,KAAlBC,GACxB,KAAlBD,GAAuE,KAAlBC,GACnC,MAAlBD,GAAoE,MAAlBC,IAKtDF,IAIF,MAAO,CACNx+B,MAAO,CACN00B,gBAAiBX,EACjBY,YAAa2J,EAAiB,EAC9B1J,cAAeb,EACfc,UAAW2J,EAAwB,GAEpC/5C,IAAK2T,EAAKjP,UAAUm1C,EAAgBE,EAAwB;AAIvDz9B,oBAAoB49B,EAA4BC,GA1GjC,OAAlBV,IACHA,EAAgB,IAAIR,EAAa,CAChC,CAAA,EAAA,IAAA,GACA,CAAA,EAAA,GAAA,GACA,CAAA,EAAA,IAAA,GACA,CAAA,EAAA,GAAA,GAEA,CAAA,EAAA,IAAA,GACA,CAAA,EAAA,GAAA,GAEA,CAAA,EAAA,IAAA,GACA,CAAA,EAAA,GAAA,GAEA,CAAA,EAAA,IAAA,GACA,CAAA,EAAA,GAAA,GAEA,CAAA,EAAA,IAAA,GACA,CAAA,EAAA,GAAA,GACA,CAAA,EAAA,GAAA,IAEA,CAAA,EAAA,IAAA,GACA,CAAA,EAAA,GAAA,GAEA,CAAA,EAAA,IAAA,GACA,CAAA,EAAA,GAAA,GAEA,CAAA,EAAA,IAAA,GACA,CAAA,EAAA,GAAA,GAEA,CAAA,EAAA,GAAA,IAEA,CAAA,GAAA,GAAA,IAEA,CAAA,GAAA,GAAA,OAGKQ,IAuEN,MAAMG,EA5DR,WACC,GAAoB,OAAhBF,EAAsB,CACzBA,EAAc,IAAIU,EAAAzL,oBAAmB,GAErC,MAAM0L,EAA+B,8CACrC,IAAK,IAAI79C,EAAI,EAAGA,EAAI69C,EAA6B39C,OAAQF,IACxDk9C,EAAYpoC,IAAI+oC,EAA6BjuC,WAAW5P,GAAE,GAG3D,MAAM89C,EAA6B,MACnC,IAAK,IAAI99C,EAAI,EAAGA,EAAI89C,EAA2B59C,OAAQF,IACtDk9C,EAAYpoC,IAAIgpC,EAA2BluC,WAAW5P,GAAE,GAG1D,OAAOk9C,EA8Caa,GAEnB,IAAIh+C,EAAkB,GACtB,IAAK,IAAIC,EAAI,EAAGg+C,EAAYN,EAAMO,eAAgBj+C,GAAKg+C,EAAWh+C,IAAK,CACtE,MAAMmX,EAAOumC,EAAMQ,eAAel+C,GAC5BC,EAAMkX,EAAKjX,OAEjB,IAAIkJ,EAAI,EACJi0C,EAAiB,EACjBc,EAAkB,EAClBC,EAAK,EACLC,GAAgB,EAChBC,GAAuB,EACvBC,GAAmB,EACnBC,GAAsB,EAE1B,KAAOp1C,EAAInJ,GAAK,CAEf,IAAIw+C,GAAoB,EACxB,MAAMzkB,EAAS7iB,EAAKvH,WAAWxG,GAE/B,GAAS,KAALg1C,EAAwB,CAC3B,IAAIM,EACJ,OAAQ1kB,GACP,KAAA,GACCqkB,GAAgB,EAChBK,EAAO,EACP,MACD,KAAA,GACCA,EAAWL,EAAe,EAAsB,EAChD,MACD,KAAA,GACCE,GAAmB,EACnBD,GAAuB,EACvBI,EAAO,EACP,MACD,KAAA,GACCH,GAAmB,EACnBG,EAAWJ,EAAsB,EAAsB,EACvD,MACD,KAAA,IACCE,GAAsB,EACtBE,EAAO,EACP,MACD,KAAA,IACCA,EAAWF,EAAqB,EAAsB,EACtD,MAED,KAAA,GACCE,EAA0B,KAAfP,GAA2D,KAAfA,EAAwC,EAAsB,EACrH,MACD,KAAA,GACCO,EAA0B,KAAfP,GAA2D,KAAfA,EAAwC,EAAsB,EACrH,MACD,KAAA,GACCO,EAA0B,KAAfP,GAA2D,KAAfA,EAA2C,EAAsB,EACxH,MACD,KAAA,GAECO,EAA0B,KAAfP,EAAwC,EAAkC,EACrF,MACD,KAAA,IAECO,EAA0B,MAAfP,EAAoC,EAAkC,EACjF;CACD,KAAA,GAECO,EAAWH,EAAkB,EAAsB,EACnD,MACD,QACCG,EAAUtB,EAAWp8C,IAAIg5B,GAIhB,IAAP0kB,IACH3+C,EAAOuC,KAAK66C,EAAawB,YAAYvB,EAAYjmC,EAAMnX,EAAGq9C,EAAgBj0C,IAC1Eq1C,GAAoB,QAEf,GAAS,KAALL,EAAqB,CAE/B,IAAIM,EACM,KAAN1kB,GAEHskB,GAAuB,EACvBI,EAAO,GAEPA,EAAUtB,EAAWp8C,IAAIg5B,GAIf,IAAP0kB,EACHD,GAAoB,EAEpBL,EAAK,QAIG,KADTA,EAAQT,EAAaiB,UAAUR,EAAOpkB,MAErCykB,GAAoB,GAIlBA,IACHL,EAAK,EACLC,GAAgB,EAChBC,GAAuB,EACvBE,GAAsB,EAGtBnB,EAAiBj0C,EAAI,EACrB+0C,EAAkBnkB,GAGnB5wB,IAGQ,KAALg1C,GACHr+C,EAAOuC,KAAK66C,EAAawB,YAAYvB,EAAYjmC,EAAMnX,EAAGq9C,EAAgBp9C,IAK5E,OAAOF,GArKTsB,EAAA87C,aAAAA,EA8KA97C,EAAAw9C,aAAA,SAA6BnB,GAC5B,OAAKA,GAAuC,mBAAvBA,EAAMO,cAA+D,mBAAzBP,EAAMQ,eAIhEf,EAAa0B,aAAanB,GAFzB,kIClVT,MAAaoB,EAAbh/B,cA0DkB1f,KAAA2+C,iBAA+B,CAC/C,CAAC,OAAQ,SACT,CAAC,OAAQ,SACT,CAAC,UAAW,SAAU,SAAU,WAAY,UAAW,YAAa,aACpE,CAAC,SAAU,YAAa,YA1DlBj/B,iBAAiBk/B,EAAgBC,EAAeC,EAAgBC,EAAsBC,GAE5F,GAAIJ,GAAUC,EAAO,CACpB,IAAIl/C,EAASK,KAAKi/C,mBAAmBJ,EAAOG,GAC5C,GAAIr/C,EACH,MAAO,CACNgf,MAAOigC,EACP56C,MAAOrE,GAKV,GAAIm/C,GAAUC,EAAO,CACpB,IAAIp/C,EAASK,KAAKi/C,mBAAmBF,EAAOC,GAC5C,GAAIr/C,EACH,MAAO,CACNgf,MAAOmgC,EACP96C,MAAOrE,GAKV,OAAO,KAGA+f,mBAAmB87B,EAAcwD,GACxC,IAAIE,EAAel/C,KAAKm/C,cAAc3D,EAAMwD,GAC5C,OAAqB,OAAjBE,EACIA,EAEDl/C,KAAKo/C,YAAY5D,EAAMwD;AAGvBt/B,cAAc1b,EAAeg7C,GACpC,IAAIK,EAAY13C,KAAKkK,IAAI,GAAI7N,EAAMlE,QAAUkE,EAAM6D,YAAY,KAAO,IAClEy3C,EAAKr9B,OAAOje,GACZu7C,EAAKC,WAAWx7C,GAEpB,OAAKs0B,MAAMgnB,IAAQhnB,MAAMinB,IAAOD,IAAOC,EAahC,KAXK,IAAPD,GAAaN,GAKhBM,EAAK33C,KAAK0V,MAAMiiC,EAAKD,GACrBC,GAAMN,EAAKK,GAAaA,EACjBv6C,OAAOw6C,EAAKD,IANZ,KAoBF3/B,YAAY1b,EAAeg7C,GAClC,OAAOh/C,KAAKy/C,iBAAiBz/C,KAAK2+C,iBAAkB36C,EAAOg7C,GAGpDt/B,iBAAiBggC,EAAuB17C,EAAeg7C,GAC9D,IAAIr/C,EAAwB,KAC5B,IAAK,IAAIC,EAAI,EAAGC,EAAM6/C,EAAU5/C,OAAmB,OAAXH,GAAmBC,EAAIC,EAAKD,IACnED,EAASK,KAAK2/C,gBAAgBD,EAAU9/C,GAAIoE,EAAOg7C,GAEpD,OAAOr/C,EAGA+f,gBAAgBkgC,EAAoB57C,EAAeg7C,GAC1D,IAAIxoB,EAAMopB,EAASn+C,QAAQuC,GAC3B,OAAIwyB,GAAO,IACVA,GAAOwoB,EAAK,GAAM,GACR,EACTxoB,EAAMopB,EAAS9/C,OAAS,EAExB02B,GAAOopB,EAAS9/C,OAEV8/C,EAASppB,IAEV,MAxFTv1B,EAAAy9C,oBAAAA,EAEwBA,EAAAn8C,SAAW,IAAIm8C;0rBCFvC,SAAYmB,GAIXA,EAAAA,EAAA,QAAA,GAAA,UACAA,EAAAA,EAAA,SAAA,GAAA,WACAA,EAAAA,EAAA,QAAA,GAAA,UAND,CAAY5+C,EAAA4+C,uBAAA5+C,EAAA4+C,qBAAoB,KAShC,SAAYC,GAKXA,EAAAA,EAAA,eAAA,GAAA,iBAIAA,EAAAA,EAAA,gBAAA,GAAA,kBATD,CAAY7+C,EAAA6+C,+BAAA7+C,EAAA6+C,6BAA4B,KAYxC,SAAYC;AACXA,EAAAA,EAAA,OAAA,GAAA,SACAA,EAAAA,EAAA,SAAA,GAAA,WACAA,EAAAA,EAAA,YAAA,GAAA,cACAA,EAAAA,EAAA,MAAA,GAAA,QACAA,EAAAA,EAAA,SAAA,GAAA,WACAA,EAAAA,EAAA,MAAA,GAAA,QACAA,EAAAA,EAAA,OAAA,GAAA,SACAA,EAAAA,EAAA,UAAA,GAAA,YACAA,EAAAA,EAAA,OAAA,GAAA,SACAA,EAAAA,EAAA,SAAA,GAAA,WACAA,EAAAA,EAAA,MAAA,IAAA,QACAA,EAAAA,EAAA,SAAA,IAAA,WACAA,EAAAA,EAAA,KAAA,IAAA,OACAA,EAAAA,EAAA,MAAA,IAAA,QACAA,EAAAA,EAAA,SAAA,IAAA,WACAA,EAAAA,EAAA,KAAA,IAAA,OACAA,EAAAA,EAAA,WAAA,IAAA,aACAA,EAAAA,EAAA,QAAA,IAAA,UACAA,EAAAA,EAAA,KAAA,IAAA,OACAA,EAAAA,EAAA,MAAA,IAAA,QACAA,EAAAA,EAAA,KAAA,IAAA,OACAA,EAAAA,EAAA,UAAA,IAAA,YACAA,EAAAA,EAAA,YAAA,IAAA,cACAA,EAAAA,EAAA,OAAA,IAAA,SACAA,EAAAA,EAAA,cAAA,IAAA,gBACAA,EAAAA,EAAA,KAAA,IAAA,OACAA,EAAAA,EAAA,MAAA,IAAA,QACAA,EAAAA,EAAA,QAAA,IAAA,UA5BD,CAAY9+C,EAAA8+C,qBAAA9+C,EAAA8+C,mBAAkB,KA+B9B,SAAYC,GACXA,EAAAA,EAAA,WAAA,GAAA,aADD,CAAY/+C,EAAA++C,oBAAA/+C,EAAA++C,kBAAiB,KAO7B,SAAYC,GACXA,EAAAA,EAAA,OAAA,GAAA,SACAA,EAAAA,EAAA,iBAAA,GAAA,mBACAA,EAAAA,EAAA,gCAAA,GAAA;CAHD,CAAYh/C,EAAAg/C,wBAAAh/C,EAAAg/C,sBAAqB,KASjC,SAAYC,GAIXA,EAAAA,EAAA,MAAA,GAAA,QAIAA,EAAAA,EAAA,MAAA,GAAA,QAIAA,EAAAA,EAAA,MAAA,GAAA,QAZD,CAAYj/C,EAAAi/C,kCAAAj/C,EAAAi/C,gCAA+B,KAkB3C,SAAYC,GAIXA,EAAAA,EAAA,OAAA,GAAA,SAIAA,EAAAA,EAAA,aAAA,GAAA,eAIAA,EAAAA,EAAA,mBAAA,GAAA,qBAIAA,EAAAA,EAAA,SAAA,GAAA,WAIAA,EAAAA,EAAA,MAAA,GAAA,QAIAA,EAAAA,EAAA,KAAA,GAAA,OAIAA,EAAAA,EAAA,KAAA,GAAA,OA5BD,CAAYl/C,EAAAk/C,qBAAAl/C,EAAAk/C,mBAAkB,KAkC9B,SAAYC,GAIXA,EAAAA,EAAA,GAAA,GAAA,KAIAA,EAAAA,EAAA,KAAA,GAAA,OARD,CAAYn/C,EAAAm/C,mBAAAn/C,EAAAm/C,iBAAgB,KAc5B,SAAYC,GAIXA,EAAAA,EAAA,KAAA,GAAA,OAIAA,EAAAA,EAAA,KAAA,GAAA,OAIAA,EAAAA,EAAA,MAAA,GAAA,QAZD,CAAYp/C,EAAAo/C,wBAAAp/C,EAAAo/C,sBAAqB,KAkBjC,SAAYC,GACXA,EAAAA,EAAA,KAAA,GAAA,OACAA,EAAAA,EAAA,KAAA,GAAA,OACAA,EAAAA,EAAA,SAAA,GAAA,WACAA,EAAAA,EAAA,SAAA,GAAA,WACAA,EAAAA,EAAA,KAAA,GAAA,OALD,CAAYr/C,EAAAq/C,2BAAAr/C,EAAAq/C,yBAAwB,KAQpC,SAAYC,GACXA,EAAAA,EAAA,kCAAA,GAAA,oCACAA,EAAAA,EAAA,wBAAA,GAAA;AACAA,EAAAA,EAAA,qBAAA,GAAA,uBACAA,EAAAA,EAAA,sBAAA,GAAA,wBACAA,EAAAA,EAAA,UAAA,GAAA,YACAA,EAAAA,EAAA,oBAAA,GAAA,sBACAA,EAAAA,EAAA,oBAAA,GAAA,sBACAA,EAAAA,EAAA,kBAAA,GAAA,oBACAA,EAAAA,EAAA,WAAA,GAAA,aACAA,EAAAA,EAAA,gBAAA,GAAA,kBACAA,EAAAA,EAAA,aAAA,IAAA,eACAA,EAAAA,EAAA,SAAA,IAAA,WACAA,EAAAA,EAAA,gBAAA,IAAA,kBACAA,EAAAA,EAAA,gBAAA,IAAA,kBACAA,EAAAA,EAAA,SAAA,IAAA,WACAA,EAAAA,EAAA,YAAA,IAAA,cACAA,EAAAA,EAAA,2BAAA,IAAA,6BACAA,EAAAA,EAAA,eAAA,IAAA,iBACAA,EAAAA,EAAA,2BAAA,IAAA,6BACAA,EAAAA,EAAA,YAAA,IAAA,cACAA,EAAAA,EAAA,uBAAA,IAAA,yBACAA,EAAAA,EAAA,4BAAA,IAAA,8BACAA,EAAAA,EAAA,YAAA,IAAA,cACAA,EAAAA,EAAA,oBAAA,IAAA;AACAA,EAAAA,EAAA,8BAAA,IAAA,gCACAA,EAAAA,EAAA,YAAA,IAAA,cACAA,EAAAA,EAAA,wBAAA,IAAA,0BACAA,EAAAA,EAAA,qBAAA,IAAA,uBACAA,EAAAA,EAAA,sBAAA,IAAA,wBACAA,EAAAA,EAAA,KAAA,IAAA,OACAA,EAAAA,EAAA,qBAAA,IAAA,uBACAA,EAAAA,EAAA,QAAA,IAAA,UACAA,EAAAA,EAAA,gBAAA,IAAA,kBACAA,EAAAA,EAAA,iBAAA,IAAA,mBACAA,EAAAA,EAAA,4BAAA,IAAA,8BACAA,EAAAA,EAAA,WAAA,IAAA,aACAA,EAAAA,EAAA,SAAA,IAAA,WACAA,EAAAA,EAAA,cAAA,IAAA,gBACAA,EAAAA,EAAA,SAAA,IAAA,WACAA,EAAAA,EAAA,WAAA,IAAA,aACAA,EAAAA,EAAA,cAAA,IAAA,gBACAA,EAAAA,EAAA,aAAA,IAAA,eACAA,EAAAA,EAAA,YAAA,IAAA,cACAA,EAAAA,EAAA,aAAA,IAAA,eACAA,EAAAA,EAAA,0BAAA,IAAA,4BACAA,EAAAA,EAAA,2BAAA,IAAA,6BACAA,EAAAA,EAAA,MAAA,IAAA,QACAA,EAAAA,EAAA,aAAA,IAAA;AACAA,EAAAA,EAAA,cAAA,IAAA,gBACAA,EAAAA,EAAA,UAAA,IAAA,YACAA,EAAAA,EAAA,qBAAA,IAAA,uBACAA,EAAAA,EAAA,WAAA,IAAA,aACAA,EAAAA,EAAA,YAAA,IAAA,cACAA,EAAAA,EAAA,oBAAA,IAAA,sBACAA,EAAAA,EAAA,MAAA,IAAA,QACAA,EAAAA,EAAA,cAAA,IAAA,gBACAA,EAAAA,EAAA,QAAA,IAAA,UACAA,EAAAA,EAAA,WAAA,IAAA,aACAA,EAAAA,EAAA,4BAAA,IAAA,8BACAA,EAAAA,EAAA,eAAA,IAAA,iBACAA,EAAAA,EAAA,4BAAA,IAAA,8BACAA,EAAAA,EAAA,oBAAA,IAAA,sBACAA,EAAAA,EAAA,iBAAA,IAAA,mBACAA,EAAAA,EAAA,qBAAA,IAAA,uBACAA,EAAAA,EAAA,oBAAA,IAAA,sBACAA,EAAAA,EAAA,mBAAA,IAAA,qBACAA,EAAAA,EAAA,QAAA,IAAA,UACAA,EAAAA,EAAA,eAAA,IAAA,iBACAA,EAAAA,EAAA,uBAAA,IAAA,yBACAA,EAAAA,EAAA,0BAAA,IAAA,4BACAA,EAAAA,EAAA,iBAAA,IAAA;AACAA,EAAAA,EAAA,sBAAA,IAAA,wBACAA,EAAAA,EAAA,SAAA,IAAA,WACAA,EAAAA,EAAA,aAAA,IAAA,eACAA,EAAAA,EAAA,wBAAA,IAAA,0BACAA,EAAAA,EAAA,mBAAA,IAAA,qBACAA,EAAAA,EAAA,mBAAA,IAAA,qBACAA,EAAAA,EAAA,oBAAA,IAAA,sBACAA,EAAAA,EAAA,iCAAA,IAAA,mCACAA,EAAAA,EAAA,4BAAA,IAAA,8BACAA,EAAAA,EAAA,iBAAA,IAAA,mBACAA,EAAAA,EAAA,6BAAA,IAAA,+BACAA,EAAAA,EAAA,iBAAA,IAAA,mBACAA,EAAAA,EAAA,OAAA,IAAA,SACAA,EAAAA,EAAA,UAAA,IAAA,YACAA,EAAAA,EAAA,uBAAA,IAAA,yBACAA,EAAAA,EAAA,qBAAA,IAAA,uBACAA,EAAAA,EAAA,sBAAA,IAAA,wBACAA,EAAAA,EAAA,mBAAA,IAAA,qBACAA,EAAAA,EAAA,mBAAA,IAAA,qBACAA,EAAAA,EAAA,oBAAA,IAAA;AACAA,EAAAA,EAAA,oBAAA,IAAA,sBACAA,EAAAA,EAAA,WAAA,IAAA,aACAA,EAAAA,EAAA,mBAAA,IAAA,qBACAA,EAAAA,EAAA,gBAAA,IAAA,kBACAA,EAAAA,EAAA,uBAAA,IAAA,yBACAA,EAAAA,EAAA,QAAA,IAAA,UACAA,EAAAA,EAAA,gBAAA,IAAA,kBACAA,EAAAA,EAAA,kBAAA,IAAA,oBACAA,EAAAA,EAAA,2BAAA,IAAA,6BACAA,EAAAA,EAAA,iBAAA,KAAA,mBACAA,EAAAA,EAAA,cAAA,KAAA,gBACAA,EAAAA,EAAA,SAAA,KAAA,WACAA,EAAAA,EAAA,uBAAA,KAAA,yBACAA,EAAAA,EAAA,YAAA,KAAA,cACAA,EAAAA,EAAA,eAAA,KAAA,iBACAA,EAAAA,EAAA,SAAA,KAAA,WACAA,EAAAA,EAAA,6BAAA,KAAA,+BACAA,EAAAA,EAAA,8BAAA,KAAA,gCACAA,EAAAA,EAAA,eAAA,KAAA,iBACAA,EAAAA,EAAA,iBAAA,KAAA,mBACAA,EAAAA,EAAA,eAAA,KAAA,iBACAA,EAAAA,EAAA,iBAAA,KAAA;AACAA,EAAAA,EAAA,eAAA,KAAA,iBACAA,EAAAA,EAAA,gBAAA,KAAA,kBACAA,EAAAA,EAAA,WAAA,KAAA,aACAA,EAAAA,EAAA,aAAA,KAAA,eACAA,EAAAA,EAAA,WAAA,KAAA,aACAA,EAAAA,EAAA,aAAA,KAAA,eAvHD,CAAYt/C,EAAAs/C,eAAAt/C,EAAAs/C,aAAY,KA6HxB,SAAYC,GAIXA,EAAAA,EAAA,YAAA,GAAA,cAIAA,EAAAA,EAAA,GAAA,GAAA,KAIAA,EAAAA,EAAA,KAAA,GAAA,OAZD,CAAYv/C,EAAAu/C,sBAAAv/C,EAAAu/C,oBAAmB,KAkB/B,SAAYC,GAIXA,EAAAA,EAAA,GAAA,GAAA,KAIAA,EAAAA,EAAA,KAAA,GAAA,OARD,CAAYx/C,EAAAw/C,oBAAAx/C,EAAAw/C,kBAAiB,KAc7B,SAAYC,GAIXA,EAAAA,EAAA,KAAA,GAAA,OAIAA,EAAAA,EAAA,OAAA,GAAA,SAMAA,EAAAA,EAAA,cAAA,GAAA,gBAIAA,EAAAA,EAAA,QAAA,GAAA,UAlBD,CAAYz/C,EAAAy/C,eAAAz/C,EAAAy/C,aAAY,KA0BxB,SAAYC,GAIXA,EAAAA,EAAA,QAAA,GAAA,UACAA,EAAAA,EAAA,UAAA,GAAA,YACAA,EAAAA,EAAA,IAAA,GAAA,MACAA,EAAAA,EAAA,MAAA,GAAA,QACAA,EAAAA,EAAA,MAAA,GAAA,QACAA,EAAAA,EAAA,KAAA,GAAA,OACAA,EAAAA,EAAA,IAAA,GAAA,MACAA,EAAAA,EAAA,WAAA,GAAA,aACAA,EAAAA,EAAA,SAAA,GAAA,WACAA,EAAAA,EAAA,OAAA,GAAA,SACAA,EAAAA,EAAA,MAAA,IAAA,QACAA,EAAAA,EAAA,OAAA,IAAA,SACAA,EAAAA,EAAA,SAAA,IAAA,WACAA,EAAAA,EAAA,IAAA,IAAA,MACAA,EAAAA,EAAA,KAAA,IAAA;AACAA,EAAAA,EAAA,UAAA,IAAA,YACAA,EAAAA,EAAA,QAAA,IAAA,UACAA,EAAAA,EAAA,WAAA,IAAA,aACAA,EAAAA,EAAA,UAAA,IAAA,YACAA,EAAAA,EAAA,OAAA,IAAA,SACAA,EAAAA,EAAA,OAAA,IAAA,SACAA,EAAAA,EAAA,MAAA,IAAA,QACAA,EAAAA,EAAA,MAAA,IAAA,QACAA,EAAAA,EAAA,MAAA,IAAA,QACAA,EAAAA,EAAA,MAAA,IAAA,QACAA,EAAAA,EAAA,MAAA,IAAA,QACAA,EAAAA,EAAA,MAAA,IAAA,QACAA,EAAAA,EAAA,MAAA,IAAA,QACAA,EAAAA,EAAA,MAAA,IAAA,QACAA,EAAAA,EAAA,MAAA,IAAA,QACAA,EAAAA,EAAA,MAAA,IAAA,QACAA,EAAAA,EAAA,MAAA,IAAA,QACAA,EAAAA,EAAA,MAAA,IAAA,QACAA,EAAAA,EAAA,MAAA,IAAA,QACAA,EAAAA,EAAA,MAAA,IAAA,QACAA,EAAAA,EAAA,MAAA,IAAA,QACAA,EAAAA,EAAA,MAAA,IAAA,QACAA,EAAAA,EAAA,MAAA,IAAA,QACAA,EAAAA,EAAA,MAAA,IAAA,QACAA,EAAAA,EAAA,MAAA,IAAA,QACAA,EAAAA,EAAA,MAAA,IAAA,QACAA,EAAAA,EAAA,MAAA,IAAA,QACAA,EAAAA,EAAA,MAAA,IAAA,QACAA,EAAAA,EAAA,MAAA,IAAA,QACAA,EAAAA,EAAA,MAAA,IAAA,QACAA,EAAAA,EAAA,MAAA,IAAA,QACAA,EAAAA,EAAA,MAAA,IAAA,QACAA,EAAAA,EAAA,MAAA,IAAA,QACAA,EAAAA,EAAA,MAAA,IAAA,QACAA,EAAAA,EAAA,MAAA,IAAA,QACAA,EAAAA,EAAA,MAAA,IAAA,QACAA,EAAAA,EAAA,MAAA,IAAA,QACAA,EAAAA,EAAA,MAAA,IAAA,QACAA,EAAAA,EAAA,MAAA,IAAA,QACAA,EAAAA,EAAA,MAAA,IAAA,QACAA,EAAAA,EAAA,MAAA,IAAA,QACAA,EAAAA,EAAA,MAAA,IAAA,QACAA,EAAAA,EAAA,KAAA,IAAA,OACAA,EAAAA,EAAA,YAAA,IAAA;AACAA,EAAAA,EAAA,GAAA,IAAA,KACAA,EAAAA,EAAA,GAAA,IAAA,KACAA,EAAAA,EAAA,GAAA,IAAA,KACAA,EAAAA,EAAA,GAAA,IAAA,KACAA,EAAAA,EAAA,GAAA,IAAA,KACAA,EAAAA,EAAA,GAAA,IAAA,KACAA,EAAAA,EAAA,GAAA,IAAA,KACAA,EAAAA,EAAA,GAAA,IAAA,KACAA,EAAAA,EAAA,GAAA,IAAA,KACAA,EAAAA,EAAA,IAAA,IAAA,MACAA,EAAAA,EAAA,IAAA,IAAA,MACAA,EAAAA,EAAA,IAAA,IAAA,MACAA,EAAAA,EAAA,IAAA,IAAA,MACAA,EAAAA,EAAA,IAAA,IAAA,MACAA,EAAAA,EAAA,IAAA,IAAA,MACAA,EAAAA,EAAA,IAAA,IAAA,MACAA,EAAAA,EAAA,IAAA,IAAA,MACAA,EAAAA,EAAA,IAAA,IAAA,MACAA,EAAAA,EAAA,IAAA,IAAA,MACAA,EAAAA,EAAA,QAAA,IAAA,UACAA,EAAAA,EAAA,WAAA,IAAA,aAKAA,EAAAA,EAAA,aAAA,IAAA,eAKAA,EAAAA,EAAA,SAAA,IAAA,WAKAA,EAAAA,EAAA,SAAA,IAAA,WAKAA,EAAAA,EAAA,SAAA,IAAA,WAKAA,EAAAA,EAAA,OAAA,IAAA,SAKAA,EAAAA,EAAA,SAAA,IAAA,WAKAA,EAAAA,EAAA,YAAA,IAAA,cAKAA,EAAAA,EAAA,uBAAA,IAAA,yBAKAA,EAAAA,EAAA,aAAA,IAAA,eAKAA,EAAAA,EAAA,wBAAA,IAAA,0BAKAA,EAAAA,EAAA,SAAA,IAAA,WAIAA,EAAAA,EAAA,MAAA,IAAA,QAIAA,EAAAA,EAAA,QAAA,IAAA,UACAA,EAAAA,EAAA,SAAA,IAAA,WACAA,EAAAA,EAAA,SAAA,IAAA,WACAA,EAAAA,EAAA,SAAA,IAAA,WACAA,EAAAA,EAAA,SAAA,IAAA,WACAA,EAAAA,EAAA,SAAA,IAAA,WACAA,EAAAA,EAAA,SAAA,IAAA,WACAA,EAAAA,EAAA,SAAA,IAAA;AACAA,EAAAA,EAAA,SAAA,KAAA,WACAA,EAAAA,EAAA,SAAA,KAAA,WACAA,EAAAA,EAAA,SAAA,KAAA,WACAA,EAAAA,EAAA,gBAAA,KAAA,kBACAA,EAAAA,EAAA,WAAA,KAAA,aACAA,EAAAA,EAAA,iBAAA,KAAA,mBACAA,EAAAA,EAAA,gBAAA,KAAA,kBACAA,EAAAA,EAAA,eAAA,KAAA,iBACAA,EAAAA,EAAA,cAAA,KAAA,gBAIAA,EAAAA,EAAA,mBAAA,KAAA,qBACAA,EAAAA,EAAA,QAAA,KAAA,UACAA,EAAAA,EAAA,QAAA,KAAA,UAKAA,EAAAA,EAAA,UAAA,KAAA,YA7KD,CAAY1/C,EAAA0/C,UAAA1/C,EAAA0/C,QAAO,KAgLnB,SAAYC,GACXA,EAAAA,EAAA,KAAA,GAAA,OACAA,EAAAA,EAAA,KAAA,GAAA,OACAA,EAAAA,EAAA,QAAA,GAAA,UACAA,EAAAA,EAAA,MAAA,GAAA,QAJD,CAAY3/C,EAAA2/C,iBAAA3/C,EAAA2/C,eAAc,KAO1B,SAAYC,GACXA,EAAAA,EAAA,YAAA,GAAA,cACAA,EAAAA,EAAA,WAAA,GAAA,aAFD,CAAY5/C,EAAA4/C,YAAA5/C,EAAA4/C,UAAS,KAQrB,SAAYC,GACXA,EAAAA,EAAA,OAAA,GAAA,SACAA,EAAAA,EAAA,OAAA,GAAA,SAFD,CAAY7/C,EAAA6/C,kBAAA7/C,EAAA6/C,gBAAe,KAQ3B,SAAYC,GAIXA,EAAAA,EAAA,QAAA,GAAA,UAIAA,EAAAA,EAAA,SAAA,GAAA,WAIAA,EAAAA,EAAA,oBAAA,GAAA,sBAIAA,EAAAA,EAAA,oBAAA,GAAA;AAIAA,EAAAA,EAAA,wBAAA,GAAA,0BAIAA,EAAAA,EAAA,iBAAA,GAAA,mBAIAA,EAAAA,EAAA,aAAA,GAAA,eAIAA,EAAAA,EAAA,cAAA,GAAA,gBAIAA,EAAAA,EAAA,kBAAA,GAAA,oBAIAA,EAAAA,EAAA,eAAA,GAAA,iBAIAA,EAAAA,EAAA,eAAA,IAAA,iBAIAA,EAAAA,EAAA,UAAA,IAAA,YAIAA,EAAAA,EAAA,eAAA,IAAA,iBAIAA,EAAAA,EAAA,eAAA,IAAA,iBAxDD,CAAY9/C,EAAA8/C,kBAAA9/C,EAAA8/C,gBAAe,KA8D3B,SAAYC,GAIXA,EAAAA,EAAA,iBAAA,GAAA,mBAIAA,EAAAA,EAAA,oBAAA,GAAA,sBAIAA,EAAAA,EAAA,WAAA,GAAA,aAZD,CAAY//C,EAAA+/C,kCAAA//C,EAAA+/C,gCAA+B,KAkB3C,SAAYC,GACXA,EAAAA,EAAA,KAAA,GAAA,OACAA,EAAAA,EAAA,OAAA,GAAA,SACAA,EAAAA,EAAA,MAAA,GAAA,QACAA,EAAAA,EAAA,KAAA,GAAA,OAJD,CAAYhgD,EAAAggD,oBAAAhgD,EAAAggD,kBAAiB,KAO7B,SAAYC,GACXA,EAAAA,EAAA,IAAA,GAAA,MACAA,EAAAA,EAAA,GAAA,GAAA,KACAA,EAAAA,EAAA,SAAA,GAAA,WACAA,EAAAA,EAAA,SAAA,GAAA,WACAA,EAAAA,EAAA,OAAA,GAAA,SALD,CAAYjgD,EAAAigD,wBAAAjgD,EAAAigD,sBAAqB,KAQjC,SAAYC,GACXA,EAAAA,EAAA,KAAA,GAAA;AACAA,EAAAA,EAAA,KAAA,GAAA,OACAA,EAAAA,EAAA,OAAA,GAAA,SAHD,CAAYlgD,EAAAkgD,gBAAAlgD,EAAAkgD,cAAa,KAMzB,SAAYC,GACXA,EAAAA,EAAA,OAAA,GAAA,SACAA,EAAAA,EAAA,UAAA,GAAA,YAFD,CAAYngD,EAAAmgD,aAAAngD,EAAAmgD,WAAU,KAKtB,SAAYC,GACXA,EAAAA,EAAA,KAAA,GAAA,OACAA,EAAAA,EAAA,OAAA,GAAA,SACAA,EAAAA,EAAA,QAAA,GAAA,UAHD,CAAYpgD,EAAAogD,sBAAApgD,EAAAogD,oBAAmB,KAS/B,SAAYC,GAIXA,EAAAA,EAAA,IAAA,GAAA,MAIAA,EAAAA,EAAA,IAAA,GAAA,MARD,CAAYrgD,EAAAqgD,qBAAArgD,EAAAqgD,mBAAkB,KAW9B,SAAYC,GACXA,EAAAA,EAAA,OAAA,GAAA,SACAA,EAAAA,EAAA,iBAAA,GAAA,mBACAA,EAAAA,EAAA,cAAA,GAAA,gBAHD,CAAYtgD,EAAAsgD,2BAAAtgD,EAAAsgD,yBAAwB,KASpC,SAAYC,GACXA,EAAAA,EAAA,KAAA,GAAA,OACAA,EAAAA,EAAA,OAAA,GAAA,SACAA,EAAAA,EAAA,UAAA,GAAA,YACAA,EAAAA,EAAA,QAAA,GAAA,UACAA,EAAAA,EAAA,MAAA,GAAA,QACAA,EAAAA,EAAA,OAAA,GAAA,SACAA,EAAAA,EAAA,SAAA,GAAA,WACAA,EAAAA,EAAA,MAAA,GAAA,QACAA,EAAAA,EAAA,YAAA,GAAA,cACAA,EAAAA,EAAA,KAAA,GAAA,OACAA,EAAAA,EAAA,UAAA,IAAA,YACAA,EAAAA,EAAA,SAAA,IAAA,WACAA,EAAAA,EAAA,SAAA,IAAA,WACAA,EAAAA,EAAA,SAAA,IAAA,WACAA,EAAAA,EAAA,OAAA,IAAA,SACAA,EAAAA,EAAA,OAAA,IAAA,SACAA,EAAAA,EAAA,QAAA,IAAA;AACAA,EAAAA,EAAA,MAAA,IAAA,QACAA,EAAAA,EAAA,OAAA,IAAA,SACAA,EAAAA,EAAA,IAAA,IAAA,MACAA,EAAAA,EAAA,KAAA,IAAA,OACAA,EAAAA,EAAA,WAAA,IAAA,aACAA,EAAAA,EAAA,OAAA,IAAA,SACAA,EAAAA,EAAA,MAAA,IAAA,QACAA,EAAAA,EAAA,SAAA,IAAA,WACAA,EAAAA,EAAA,cAAA,IAAA,gBA1BD,CAAYvgD,EAAAugD,aAAAvgD,EAAAugD,WAAU,KA6BtB,SAAYC,GACXA,EAAAA,EAAA,WAAA,GAAA,aADD,CAAYxgD,EAAAwgD,YAAAxgD,EAAAwgD,UAAS,KAOrB,SAAYC,GAIXA,EAAAA,EAAA,OAAA,GAAA,SAIAA,EAAAA,EAAA,MAAA,GAAA,QAIAA,EAAAA,EAAA,OAAA,GAAA,SAIAA,EAAAA,EAAA,MAAA,GAAA,QAIAA,EAAAA,EAAA,OAAA,GAAA,SAIAA,EAAAA,EAAA,MAAA,GAAA,QAxBD,CAAYzgD,EAAAygD,gCAAAzgD,EAAAygD,8BAA6B,KA8BzC,SAAYC,GAIXA,EAAAA,EAAA,KAAA,GAAA,OAIAA,EAAAA,EAAA,MAAA,GAAA,QAIAA,EAAAA,EAAA,UAAA,GAAA,YAIAA,EAAAA,EAAA,SAAA,GAAA,WAIAA,EAAAA,EAAA,aAAA,GAAA,eAIAA,EAAAA,EAAA,cAAA,GAAA,gBAxBD,CAAY1gD,EAAA0gD,wBAAA1gD,EAAA0gD,sBAAqB,KA+BjC,SAAYC,GACXA,EAAAA,EAAA,6BAAA,GAAA,+BACAA,EAAAA,EAAA,4BAAA,GAAA,8BACAA,EAAAA,EAAA,0BAAA,GAAA;AACAA,EAAAA,EAAA,yBAAA,GAAA,2BAJD,CAAY3gD,EAAA2gD,yBAAA3gD,EAAA2gD,uBAAsB,KAUlC,SAAYC,GAIXA,EAAAA,EAAA,KAAA,GAAA,OAIAA,EAAAA,EAAA,KAAA,GAAA,OAIAA,EAAAA,EAAA,OAAA,GAAA,SAIAA,EAAAA,EAAA,WAAA,GAAA,aAhBD,CAAY5gD,EAAA4gD,iBAAA5gD,EAAA4gD,eAAc,sLCzwB1B,MAAaC,EAMLpiC,aAAaqE,EAAmBC,GACtC,OAAO+9B,EAAAj+B,SAASC,EAAWC,IAP7B/iB,EAAA6gD,OAAAA,EACwBA,EAAAE,QAAO,KACPF,EAAAG,MAAK,KACLH,EAAAI,IAAG,IACHJ,EAAAK,QAAO,IAO/BlhD,EAAAmhD,oBAAA,WACC,MAAO,CACNC,YAAQ77C,EACR87C,eAAW97C,EACX8nB,wBAAyBi0B,EAAAj0B,wBACzB1F,QAASuF,EAAAvF,QACT+3B,QAAS6B,EAAgB7B,QACzBmB,OAAQA,EACRrP,SAAUgC,EAAAhC,SACVW,MAAO+B,EAAA/B,MACP8B,UAAgBuN,EAAAvN,UAChBoM,mBAAoBkB,EAAgBlB,mBACpCV,eAAgB4B,EAAgB5B,eAChCC,UAAW2B,EAAgB3B,UAC3BlV,IAAU+W,EAAA5X,IACV8K,MAAO+M,EAAA/M;oDClCT,MAAagN,EAMZljC,YAAYlB,EAAeqkC,GAC1B7iD,KAAKwe,MAAQA,EACbxe,KAAK6iD,UAAYA,GARnB5hD,EAAA2hD,uBAAAA,EAYA3hD,EAAA6hD,kBAAA,MAiBCpjC,YAAY4G,GACXtmB,KAAKsmB,OAASA,EACdtmB,KAAK+iD,UAAY,IAAIC,YAAY18B,EAAOxmB,QACxCE,KAAKijD,oBAAsB,IAAIziB,WAAW,GAC1CxgC,KAAKijD,oBAAoB,IAAM,EAGzBvjC,aAAaX,EAAqBmkC,GACxCnkC,EAAcmzB,EAAA1H,SAASzrB,GACvB,MAAMokC,EAAYnjD,KAAKsmB,OACjB88B,EAAepjD,KAAK+iD,UACpBM,EAAkBH,EAAapjD,OAErC,OAAwB,IAApBujD,IAIJrjD,KAAKsmB,OAAS,IAAI08B,YAAYG,EAAUrjD,OAASujD,GACjDrjD,KAAKsmB,OAAO5R,IAAIyuC,EAAUG,SAAS,EAAGvkC,GAAc,GACpD/e,KAAKsmB,OAAO5R,IAAIyuC,EAAUG,SAASvkC,GAAcA,EAAcskC,GAC/DrjD,KAAKsmB,OAAO5R,IAAIwuC,EAAcnkC,GAE1BA,EAAc,EAAI/e,KAAKijD,oBAAoB,KAC9CjjD,KAAKijD,oBAAoB,GAAKlkC,EAAc,GAG7C/e,KAAK+iD,UAAY,IAAIC,YAAYhjD,KAAKsmB,OAAOxmB,QACzCE,KAAKijD,oBAAoB,IAAM,GAClCjjD,KAAK+iD,UAAUruC,IAAI0uC,EAAaE,SAAS,EAAGtjD,KAAKijD,oBAAoB,GAAK,KAEpE,GAGDvjC,YAAYlB,EAAexa,GAIjC,OAHAwa,EAAQ0zB,EAAA1H,SAAShsB,GACjBxa,EAAQkuC,EAAA1H,SAASxmC,GAEbhE,KAAKsmB,OAAO9H,KAAWxa,IAG3BhE,KAAKsmB,OAAO9H,GAASxa,EACjBwa,EAAQ,EAAIxe,KAAKijD,oBAAoB,KACxCjjD,KAAKijD,oBAAoB,GAAKzkC,EAAQ,IAEhC,GAGDkB,aAAaqa,EAAoBwpB,GACvCxpB,EAAamY,EAAA1H,SAASzQ,GACtBwpB,EAAMrR,EAAA1H,SAAS+Y,GAEf,MAAMJ,EAAYnjD,KAAKsmB,OACjB88B,EAAepjD,KAAK+iD;CAE1B,GAAIhpB,GAAcopB,EAAUrjD,OAC3B,OAAO,EAGR,IAAI0jD,EAASL,EAAUrjD,OAASi6B,EAKhC,OAJIwpB,GAAOC,IACVD,EAAMC,GAGK,IAARD,IAIJvjD,KAAKsmB,OAAS,IAAI08B,YAAYG,EAAUrjD,OAASyjD,GACjDvjD,KAAKsmB,OAAO5R,IAAIyuC,EAAUG,SAAS,EAAGvpB,GAAa,GACnD/5B,KAAKsmB,OAAO5R,IAAIyuC,EAAUG,SAASvpB,EAAawpB,GAAMxpB,GAEtD/5B,KAAK+iD,UAAY,IAAIC,YAAYhjD,KAAKsmB,OAAOxmB,QACzCi6B,EAAa,EAAI/5B,KAAKijD,oBAAoB,KAC7CjjD,KAAKijD,oBAAoB,GAAKlpB,EAAa,GAExC/5B,KAAKijD,oBAAoB,IAAM,GAClCjjD,KAAK+iD,UAAUruC,IAAI0uC,EAAaE,SAAS,EAAGtjD,KAAKijD,oBAAoB,GAAK,KAEpE,GAGDvjC,gBACN,OAA2B,IAAvB1f,KAAKsmB,OAAOxmB,OACR,EAEDE,KAAKyjD,qBAAqBzjD,KAAKsmB,OAAOxmB,OAAS,GAGhD4f,oBAAoBlB,GAC1B,OAAIA,EAAQ,EACJ,GAGRA,EAAQ0zB,EAAA1H,SAAShsB,GACVxe,KAAKyjD,qBAAqBjlC,IAG1BkB,qBAAqBlB,GAC5B,GAAIA,GAASxe,KAAKijD,oBAAoB,GACrC,OAAOjjD,KAAK+iD,UAAUvkC,GAGvB,IAAIub,EAAa/5B,KAAKijD,oBAAoB,GAAK,EAC5B,IAAflpB,IACH/5B,KAAK+iD,UAAU,GAAK/iD,KAAKsmB,OAAO,GAChCyT,KAGGvb,GAASxe,KAAKsmB,OAAOxmB,SACxB0e,EAAQxe,KAAKsmB,OAAOxmB,OAAS,GAG9B,IAAK,IAAIF,EAAIm6B,EAAYn6B,GAAK4e,EAAO5e,IACpCI,KAAK+iD,UAAUnjD,GAAKI,KAAK+iD,UAAUnjD,EAAI,GAAKI,KAAKsmB,OAAO1mB,GAGzD,OADAI,KAAKijD,oBAAoB,GAAKt7C,KAAKC,IAAI5H,KAAKijD,oBAAoB,GAAIzkC,GAC7Dxe,KAAK+iD,UAAUvkC,GAGhBkB,WAAWgkC,GACjBA,EAAmB/7C,KAAK0V,MAAMqmC,GAG9B1jD,KAAK2jD;CAEL,IAAI3mC,EAAM,EACNC,EAAOjd,KAAKsmB,OAAOxmB,OAAS,EAC5Bkc,EAAM,EACN4nC,EAAU,EACVC,EAAW,EAEf,KAAO7mC,GAAOC,GAMb,GALAjB,EAAMgB,GAAQC,EAAOD,GAAO,EAAK,EAK7B0mC,GAFJG,GADAD,EAAU5jD,KAAK+iD,UAAU/mC,IACJhc,KAAKsmB,OAAOtK,IAGhCiB,EAAOjB,EAAM,MACP,CAAA,KAAI0nC,GAAoBE,GAG9B,MAFA5mC,EAAMhB,EAAM,EAMd,OAAO,IAAI4mC,EAAuB5mC,EAAK0nC,EAAmBG,wIC5J5D5iD,EAAA6iD,gBAAA,MASCpkC,YAAYhd,EAAU2zC,EAAiB0N,EAAaC,GACnDhkD,KAAKikD,KAAOvhD,EACZ1C,KAAKkkD,OAAS7N,EACdr2C,KAAKmkD,KAAOJ,EACZ/jD,KAAKokD,WAAaJ,EAClBhkD,KAAKqkD,YAAc,KACnBrkD,KAAKskD,iBAAmB,KAGzB5kC,UACC1f,KAAKkkD,OAAOpkD,OAAS,EAGtB4f,UAIC,OAH8B,OAA1B1f,KAAKskD,mBACRtkD,KAAKskD,iBAAmBtkD,KAAKkkD,OAAOlzC,KAAKhR,KAAKmkD,OAExCnkD,KAAKskD,iBAGb5kC,SAAStU,GACJA,EAAE24C,KAAO34C,EAAE24C,MAAQ/jD,KAAKmkD,OAC3BnkD,KAAKmkD,KAAO/4C,EAAE24C,IACd/jD,KAAKqkD,YAAc,MAIpB,MAAMtjB,EAAU31B,EAAE21B,QAClB,IAAK,MAAMqG,KAAUrG,EACpB/gC,KAAKukD,mBAAmBnd,EAAOzoB,OAC/B3e,KAAKwkD,kBAAkB,IAAI/P,EAAAhC,SAASrL,EAAOzoB,MAAM00B,gBAAiBjM,EAAOzoB,MAAM20B,aAAclM,EAAOoU,MAGrGx7C,KAAKokD,WAAah5C,EAAE44C,UACpBhkD,KAAKskD,iBAAmB,KAGf5kC,oBACT,IAAK1f,KAAKqkD,YAAa,CACtB,MAAMI,EAAYzkD,KAAKmkD,KAAKrkD,OACtB4kD,EAAc1kD,KAAKkkD,OAAOpkD,OAC1B6kD,EAAkB,IAAI3B,YAAY0B;CACxC,IAAK,IAAI9kD,EAAI,EAAGA,EAAI8kD,EAAa9kD,IAChC+kD,EAAgB/kD,GAAKI,KAAKkkD,OAAOtkD,GAAGE,OAAS2kD,EAE9CzkD,KAAKqkD,YAAc,IAAIO,EAAA9B,kBAAkB6B,IAOnCjlC,aAAamlC,EAAmBC,GACvC9kD,KAAKkkD,OAAOW,GAAaC,EACrB9kD,KAAKqkD,aAERrkD,KAAKqkD,YAAYU,YAAYF,EAAW7kD,KAAKkkD,OAAOW,GAAW/kD,OAASE,KAAKmkD,KAAKrkD,QAI5E4f,mBAAmBf,GAE1B,GAAIA,EAAM00B,kBAAoB10B,EAAM40B,cAcpCvzC,KAAKglD,aAAarmC,EAAM00B,gBAAkB,EACzCrzC,KAAKkkD,OAAOvlC,EAAM00B,gBAAkB,GAAGvrC,UAAU,EAAG6W,EAAM20B,YAAc,GACtEtzC,KAAKkkD,OAAOvlC,EAAM40B,cAAgB,GAAGzrC,UAAU6W,EAAM60B,UAAY,IAIpExzC,KAAKkkD,OAAO9kC,OAAOT,EAAM00B,gBAAiB10B,EAAM40B,cAAgB50B,EAAM00B,iBAClErzC,KAAKqkD,aAERrkD,KAAKqkD,YAAYY,aAAatmC,EAAM00B,gBAAiB10B,EAAM40B,cAAgB50B,EAAM00B,qBAvBlF,CACC,GAAI10B,EAAM20B,cAAgB30B,EAAM60B,UAE/B,OAGDxzC,KAAKglD,aAAarmC,EAAM00B,gBAAkB,EACzCrzC,KAAKkkD,OAAOvlC,EAAM00B,gBAAkB,GAAGvrC,UAAU,EAAG6W,EAAM20B,YAAc,GACtEtzC,KAAKkkD,OAAOvlC,EAAM00B,gBAAkB,GAAGvrC,UAAU6W,EAAM60B,UAAY,KAmBhE9zB,kBAAkB3B,EAAoBmnC,GAC7C,GAA0B,IAAtBA,EAAWplD,OAEd,OAED,IAAIqlD,EAAcD,EAAW35C,MAAM;CACnC,GAA2B,IAAvB45C,EAAYrlD,OAOf,YALAE,KAAKglD,aAAajnC,EAAS20B,WAAa,EACvC1yC,KAAKkkD,OAAOnmC,EAAS20B,WAAa,GAAG5qC,UAAU,EAAGiW,EAAS40B,OAAS,GAClEwS,EAAY,GACZnlD,KAAKkkD,OAAOnmC,EAAS20B,WAAa,GAAG5qC,UAAUiW,EAAS40B,OAAS,IAMrEwS,EAAYA,EAAYrlD,OAAS,IAAME,KAAKkkD,OAAOnmC,EAAS20B,WAAa,GAAG5qC,UAAUiW,EAAS40B,OAAS,GAGxG3yC,KAAKglD,aAAajnC,EAAS20B,WAAa,EACvC1yC,KAAKkkD,OAAOnmC,EAAS20B,WAAa,GAAG5qC,UAAU,EAAGiW,EAAS40B,OAAS,GAClEwS,EAAY,IAIf,IAAIC,EAAa,IAAIpC,YAAYmC,EAAYrlD,OAAS,GACtD,IAAK,IAAIF,EAAI,EAAGA,EAAIulD,EAAYrlD,OAAQF,IACvCI,KAAKkkD,OAAO9kC,OAAOrB,EAAS20B,WAAa9yC,EAAI,EAAG,EAAGulD,EAAYvlD,IAC/DwlD,EAAWxlD,EAAI,GAAKulD,EAAYvlD,GAAGE,OAASE,KAAKmkD,KAAKrkD,OAGnDE,KAAKqkD,aAERrkD,KAAKqkD,YAAYnB,aAAanlC,EAAS20B,WAAY0S;qCCvEtD,MAAMC,UAAoBC,EAAAxB,gBAEzBphD,UACC,OAAO1C,KAAKikD,KAGbsB,cACC,OAAOvlD,KAAKokD,WAGbL,UACC,OAAO/jD,KAAKmkD,KAGNzkC,WACN,OAAO1f,KAAKwlD,UAGN9lC,kBACN,OAAO1f,KAAKkkD,OAAO92C,MAAM,GAGnBsS,eACN,OAAO1f,KAAKkkD,OAAOpkD,OAGb4f,eAAegzB,GACrB,OAAO1yC,KAAKkkD,OAAOxR,EAAa,GAG1BhzB,kBAAkB3B,EAAqBk9B,GAE7C,IAAIwK,EAAaC,EAAA/J,cAChB59B,EAAS40B,OACT+S,EAAA1K,0BAA0BC,GAC1Bj7C,KAAKkkD,OAAOnmC,EAAS20B,WAAa,GAClC,GAGD,OAAI+S,EACI,IAAItQ,EAAA/B,MAAMr1B,EAAS20B,WAAY+S,EAAWnS,YAAav1B,EAAS20B,WAAY+S,EAAWjS,WAGxF,KAID9zB,MAAMu7B,GAEZ,MAAM5E,EAAQr2C,KAAKkkD,OACbyB,EAAY3lD,KAAK4lD,WAAWh4B,KAAK5tB,MAEvC,IAAI0yC,EAAa,EACbmT,EAAW,GACXC,EAAgB,EAChBC,EAA2B,GAE/B,MAAO,CACNrmC,EAAE0B,OAAOC,YACR,OACC,GAAIykC,EAAgBC,EAAWjmD,OAAQ,CACtC,MAAMkE,EAAQ6hD,EAAS/9C,UAAUi+C,EAAWD,GAAe97B,MAAO+7B,EAAWD,GAAehxB,KAC5FgxB,GAAiB,QACX9hD,MACA,CACN,KAAI0uC,EAAa2D,EAAMv2C,QAMtB,MALA+lD,EAAWxP,EAAM3D,GACjBqT,EAAaJ,EAAUE,EAAU5K,GACjC6K,EAAgB,EAChBpT,GAAc,KAUbhzB,aAAagzB,EAAoBuI,GACvC,IAAIvuC,EAAU1M,KAAKkkD,OAAOxR,EAAa,GACnCsT,EAAShmD,KAAK4lD,WAAWl5C,EAASuuC,GAClCgL,EAA2B,GAC/B,IAAK,MAAMtnC,KAASqnC,EACnBC,EAAM/jD,KAAK,CACV85C,KAAMtvC,EAAQ5E,UAAU6W,EAAMqL,MAAOrL,EAAMmW,KAC3Cwe,YAAa30B,EAAMqL,MAAQ,EAC3BwpB,UAAW70B,EAAMmW,IAAM,IAGzB,OAAOmxB,EAGAvmC,WAAWhT,EAAiBuuC,GACnC,MAAMt7C,EAAuB,GAC7B,IAAI8Q;CAIJ,IAFAwqC,EAAezhB,UAAY,GAEpB/oB,EAAQwqC,EAAe1hB,KAAK7sB,KACV,IAApB+D,EAAM,GAAG3Q,QAIbH,EAAOuC,KAAK,CAAE8nB,MAAOvZ,EAAM+N,MAAOsW,IAAKrkB,EAAM+N,MAAQ/N,EAAM,GAAG3Q,SAE/D,OAAOH,EAGD+f,gBAAgBf,GAGtB,IAFAA,EAAQ3e,KAAKkmD,eAAevnC,IAElB00B,kBAAoB10B,EAAM40B,cACnC,OAAOvzC,KAAKkkD,OAAOvlC,EAAM00B,gBAAkB,GAAGvrC,UAAU6W,EAAM20B,YAAc,EAAG30B,EAAM60B,UAAY,GAGlG,IAAI2S,EAAanmD,KAAKmkD,KAClBiC,EAAiBznC,EAAM00B,gBAAkB,EACzCgT,EAAe1nC,EAAM40B,cAAgB,EACrC+S,EAAwB,GAE5BA,EAAYpkD,KAAKlC,KAAKkkD,OAAOkC,GAAgBt+C,UAAU6W,EAAM20B,YAAc,IAC3E,IAAK,IAAI1zC,EAAIwmD,EAAiB,EAAGxmD,EAAIymD,EAAczmD,IAClD0mD,EAAYpkD,KAAKlC,KAAKkkD,OAAOtkD,IAI9B,OAFA0mD,EAAYpkD,KAAKlC,KAAKkkD,OAAOmC,GAAcv+C,UAAU,EAAG6W,EAAM60B,UAAY,IAEnE8S,EAAYt1C,KAAKm1C,GAGlBzmC,SAAS3B,GAGf,OAFAA,EAAW/d,KAAKumD,kBAAkBxoC,GAClC/d,KAAKwmD,oBACExmD,KAAKqkD,YAAaoC,oBAAoB1oC,EAAS20B,WAAa,IAAM30B,EAAS40B,OAAS,GAGrFjzB,WAAWmV,GACjBA,EAASltB,KAAK0V,MAAMwX,GACpBA,EAASltB,KAAKC,IAAI,EAAGitB,GAErB70B,KAAKwmD,oBACL,IAAI7xB,EAAM30B,KAAKqkD,YAAaqC,WAAW7xB,GACnC8xB,EAAa3mD,KAAKkkD,OAAOvvB,EAAInW,OAAO1e,OAGxC,MAAO,CACN4yC,WAAY,EAAI/d,EAAInW,MACpBm0B,OAAQ,EAAIhrC,KAAK0yB,IAAI1F,EAAIkuB,UAAW8D,IAI9BjnC,eAAef,GAEtB,MAAMqL,EAAQhqB,KAAKumD,kBAAkB,CAAE7T,WAAY/zB,EAAM00B,gBAAiBV,OAAQh0B,EAAM20B,cAClFxe,EAAM90B,KAAKumD,kBAAkB,CAAE7T,WAAY/zB,EAAM40B,cAAeZ,OAAQh0B,EAAM60B;CAEpF,OAAIxpB,EAAM0oB,aAAe/zB,EAAM00B,iBAC3BrpB,EAAM2oB,SAAWh0B,EAAM20B,aACvBxe,EAAI4d,aAAe/zB,EAAM40B,eACzBze,EAAI6d,SAAWh0B,EAAM60B,UAEjB,CACNH,gBAAiBrpB,EAAM0oB,WACvBY,YAAatpB,EAAM2oB,OACnBY,cAAeze,EAAI4d,WACnBc,UAAW1e,EAAI6d,QAIVh0B,EAGAe,kBAAkB3B,GACzB,IAAK02B,EAAAhC,SAASmU,YAAY7oC,GACzB,MAAM,IAAInZ,MAAM,gBAEjB,IAAI8tC,WAAEA,EAAUC,OAAEA,GAAW50B,EACzB8oC,GAAa,EAEjB,GAAInU,EAAa,EAChBA,EAAa,EACbC,EAAS,EACTkU,GAAa,OAEP,GAAInU,EAAa1yC,KAAKkkD,OAAOpkD,OACnC4yC,EAAa1yC,KAAKkkD,OAAOpkD,OACzB6yC,EAAS3yC,KAAKkkD,OAAOxR,EAAa,GAAG5yC,OAAS,EAC9C+mD,GAAa,MAEP,CACN,IAAIC,EAAe9mD,KAAKkkD,OAAOxR,EAAa,GAAG5yC,OAAS,EACpD6yC,EAAS,GACZA,EAAS,EACTkU,GAAa,GAELlU,EAASmU,IACjBnU,EAASmU,EACTD,GAAa,GAIf,OAAKA,EAGG,CAAEnU,WAAAA,EAAYC,OAAAA,GAFd50B,GAmBV,MAAagpC,EAQZrnC,YAAYywB,EAAwB6W,GACnChnD,KAAKinD,MAAQ9W,EACbnwC,KAAKknD,QAAUzmD,OAAOwH,OAAO,MAC7BjI,KAAKmnD,sBAAwBH,EAC7BhnD,KAAKonD,eAAiB,KAGhB1nC,UACN1f,KAAKknD,QAAUzmD,OAAOwH,OAAO,MAGpByX,UAAUhd,GACnB,OAAO1C,KAAKknD,QAAQxkD,GAGbgd,aACP,IAAI2nC,EAAqB,GAEzB,OADA5mD,OAAOg9B,KAAKz9B,KAAKknD,SAAShnC,QAASzc,GAAQ4jD,EAAInlD,KAAKlC,KAAKknD,QAAQzjD,KAC1D4jD,EAGD3nC,eAAexS,GACrBlN,KAAKknD,QAAQh6C,EAAK9J,KAAO,IAAIiiD,EAAY3C,EAAA5X,IAAItb,MAAMtiB,EAAK9J,KAAM8J,EAAKmpC,MAAOnpC,EAAKo6C,IAAKp6C,EAAK82C,WAGnFtkC,mBAAmB6nC,EAAgBn8C,GACzC,IAAKpL,KAAKknD,QAAQK,GACjB,OAEWvnD,KAAKknD,QAAQK,GACnBC,SAASp8C;AAGTsU,mBAAmB6nC,GACpBvnD,KAAKknD,QAAQK,WAGXvnD,KAAKknD,QAAQK,GAKR7nC,YAAY+nC,EAAqBC,EAAqBC,EAA+B9N,4CACjG,MAAMnZ,EAAW1gC,KAAK4nD,UAAUH,GAC1B9mB,EAAW3gC,KAAK4nD,UAAUF,GAChC,IAAKhnB,IAAaC,EACjB,OAAO,KAGR,MAAM8Y,EAAgB/Y,EAASmnB,kBACzBnO,EAAgB/Y,EAASknB,kBASzB/N,EARe,IAAIgO,EAAAtO,aAAaC,EAAeC,EAAe,CACnEf,0BAA0B,EAC1BC,8BAA8B,EAC9BhC,2BAA4B+Q,EAC5BhO,sBAAsB,EACtBE,mBAAoBA,IAGW3D,cAC1B6R,IAAajO,EAAW/Y,QAAQjhC,OAAS,IAAYE,KAAKgoD,oBAAoBtnB,EAAUC,GAC9F,MAAO,CACNuD,UAAW4V,EAAW5V,UACtB6jB,UAAWA,EACXhnB,QAAS+Y,EAAW/Y,YAIdrhB,oBAAoBghB,EAAwBC,GACnD,MAAMsnB,EAAoBvnB,EAASmd,eAEnC,GAAIoK,IADsBtnB,EAASkd,eAElC,OAAO,EAER,IAAK,IAAI9mC,EAAO,EAAGA,GAAQkxC,EAAmBlxC,IAAQ,CAGrD,GAFqB2pB,EAASod,eAAe/mC,KACxB4pB,EAASmd,eAAe/mC,GAE5C,OAAO,EAGT,OAAO,EAUK2I,wBAAwBwoC,EAAkBC,4CACtD,MAAM7K,EAAQt9C,KAAK4nD,UAAUM,GAC7B,IAAK5K,EACJ,OAAO6K,EAGR,MAAMxoD,EAAqB,GAC3B,IAAIyoD,OAAyC5hD,EAE7C2hD,EAAQE,EAAA3sC,UAAUysC,EAAO,CAACz/C,EAAGC,KAC5B,GAAID,EAAEiW,OAAShW,EAAEgW,MAChB,OAAOw2B,EAAA/B,MAAMkV,yBAAyB5/C,EAAEiW,MAAOhW,EAAEgW,OAKlD,OAFWjW,EAAEiW,MAAQ,EAAI,IACdhW,EAAEgW,MAAQ,EAAI,KAI1B,IAAK,IAAIA,MAAEA,EAAK68B,KAAEA,EAAIuI,IAAEA,KAASoE,EAAO;AAMvC,GAJmB,iBAARpE,IACVqE,EAAUrE,GAGP5O,EAAA/B,MAAMzvC,QAAQgb,KAAW68B,EAE5B,SAGD,MAAM9a,EAAW4c,EAAMiL,gBAAgB5pC,GAGvC,GAAI+hB,KAFJ8a,EAAOA,EAAK54C,QAAQ,cAAe06C,EAAMyG,MAIxC,SAID,GAAIp8C,KAAKC,IAAI4zC,EAAK17C,OAAQ4gC,EAAS5gC,QAAUinD,EAAmByB,WAAY,CAC3E7oD,EAAOuC,KAAK,CAAEyc,MAAAA,EAAO68B,KAAAA,IACrB,SAID,MAAMza,EAAUoV,EAAA1V,WAAWC,EAAU8a,GAAM,GACrCiN,EAAanL,EAAMoL,SAASvT,EAAA/B,MAAMuV,KAAKhqC,GAAO+1B,oBAEpD,IAAK,MAAMtN,KAAUrG,EAAS,CAC7B,MAAM/W,EAAQszB,EAAMsL,WAAWH,EAAarhB,EAAOznB,eAC7CmV,EAAMwoB,EAAMsL,WAAWH,EAAarhB,EAAOznB,cAAgBynB,EAAOxnB,gBAClEipC,EAAoB,CACzBrN,KAAMA,EAAK14C,OAAOskC,EAAOvnB,cAAeunB,EAAOtnB,gBAC/CnB,MAAO,CAAE00B,gBAAiBrpB,EAAM0oB,WAAYY,YAAatpB,EAAM2oB,OAAQY,cAAeze,EAAI4d,WAAYc,UAAW1e,EAAI6d,SAGlH2K,EAAMiL,gBAAgBM,EAAQlqC,SAAWkqC,EAAQrN,MACpD77C,EAAOuC,KAAK2mD,IASf,MAJuB,iBAAZT,GACVzoD,EAAOuC,KAAK,CAAE6hD,IAAKqE,EAAS5M,KAAM,GAAI78B,MAAO,CAAE00B,gBAAiB,EAAGC,YAAa,EAAGC,cAAe,EAAGC,UAAW,KAG1G7zC,KAKK+f,aAAawoC,4CACzB,IAAI5K,EAAQt9C,KAAK4nD,UAAUM,GAC3B,OAAK5K,EAIEwL,EAAArK,aAAanB,GAHZ,QAUI59B,eAAewoC,EAAkBnqC,EAAqBgrC,EAAiBC,4CACnF,MAAM1L,EAAQt9C,KAAK4nD,UAAUM,GAC7B,IAAK5K,EACJ,OAAO,KAIR,MAAM2I,EAAkB,GAClBjoC,EAAO,IAAIG,IACX8qC,EAAgB,IAAIplD,OAAOklD,EAASC,GAEpCE,EAAS5L,EAAM6L,kBAAkBprC,EAAUkrC;CAC7CC,GACHlrC,EAAKK,IAAIi/B,EAAMiL,gBAAgBW,IAGhC,IAAK,IAAIlN,KAAQsB,EAAM2I,MAAMgD,GAC5B,IAAIjrC,EAAKI,IAAI49B,KAGbh+B,EAAKK,IAAI29B,GACJ1jB,MAAMrW,OAAO+5B,MAGlBiK,EAAM/jD,KAAK85C,GACPh+B,EAAKqJ,KAAO0/B,EAAmBqC,oBAClC,MAGF,OAAOnD,KAQKvmC,kBAAkBwoC,EAAkBvpC,EAAeoqC,EAAiBC,4CAChF,IAAI1L,EAAQt9C,KAAK4nD,UAAUM,GAC3B,IAAK5K,EACJ,OAAO78C,OAAOwH,OAAO,MAEtB,MAAMghD,EAAgB,IAAIplD,OAAOklD,EAASC,GACpCrpD,EAAuCc,OAAOwH,OAAO,MAC3D,IAAK,IAAI8O,EAAO4H,EAAM00B,gBAAiBt8B,EAAO4H,EAAM40B,cAAex8B,IAAQ,CAC1E,IAAIkvC,EAAQ3I,EAAM+L,aAAatyC,EAAMkyC,GACrC,IAAK,MAAMjN,KAAQiK,EAAO,CACzB,IAAK3tB,MAAMrW,OAAO+5B,EAAKA,OACtB,SAED,IAAI3/B,EAAQ1c,EAAOq8C,EAAKA,MACnB3/B,IACJA,EAAQ,GACR1c,EAAOq8C,EAAKA,MAAQ3/B,GAErBA,EAAMna,KAAK,CACVmxC,gBAAiBt8B,EACjBu8B,YAAa0I,EAAK1I,YAClBC,cAAex8B,EACfy8B,UAAWwI,EAAKxI,aAInB,OAAO7zC,KAKK+f,iBAAiBwoC,EAAkBvpC,EAAeqgC,EAAa+J,EAAiBC,4CAC5F,IAAI1L,EAAQt9C,KAAK4nD,UAAUM,GAC3B,IAAK5K,EACJ,OAAO,KAGR,IAAI2L,EAAgB,IAAIplD,OAAOklD,EAASC,GAEpCrqC,EAAM20B,cAAgB30B,EAAM60B,YAC/B70B,EAAQ,CACP00B,gBAAiB10B,EAAM00B,gBACvBC,YAAa30B,EAAM20B,YACnBC,cAAe50B,EAAM40B,cACrBC,UAAW70B,EAAM60B,UAAY,IAI/B,IAAI8V,EAAgBhM,EAAMiL,gBAAgB5pC,GAEtC4qC,EAAYjM,EAAM6L,kBAAkB,CAAEzW,WAAY/zB,EAAM00B,gBAAiBV,OAAQh0B,EAAM20B,aAAe2V,GAC1G,IAAKM,EACJ,OAAO;CAER,IAAIvN,EAAOsB,EAAMiL,gBAAgBgB,GAEjC,OADaC,EAAA9K,oBAAoBn8C,SAASknD,iBAAiB9qC,EAAO2qC,EAAeC,EAAWvN,EAAMgD,MAM5Ft/B,kBAAkB5Z,EAAkB4jD,EAAiBC,GAO3D,IAAIC,EAA2B,CAC9BzZ,KAHmBW,EAAM/G,kBAAkB4f,EAJjB,CAACxf,EAAgB57B,IACpCvO,KAAKinD,MAAM4C,IAAI1f,EAAQ57B,IAO9Bu7C,gBAAiB,IACT9pD,KAAK+pD,cAId,OAAI/pD,KAAKmnD,uBACRnnD,KAAKonD,eAAiBpnD,KAAKmnD,sBAAsByC,EAAKF,GAE/Ct+B,QAAQtd,QAAQgjC,EAAMlH,kBAAkB5pC,KAAKonD,kBAG9C,IAAIh8B,QAAa,CAACtd,EAASwhC,KACjC3hC,EAAQ,CAAC7H,GAAYkkD,IACpBhqD,KAAKonD,eAAiB4C,EAAc/hD,OAAO2hD,EAAKF,GAEhD57C,EAAQgjC,EAAMlH,kBAAkB5pC,KAAKonD,kBAEnC9X,KAUE5vB,IAAIyqB,EAAgB57B,GAC1B,IAAKvO,KAAKonD,gBAAyD,mBAAhCpnD,KAAKonD,eAAejd,GACtD,OAAO/e,QAAQkkB,OAAO,IAAI1qC,MAAM,qCAAuCulC,IAGxE,IACC,OAAO/e,QAAQtd,QAAQ9N,KAAKonD,eAAejd,GAAQ17B,MAAMzO,KAAKonD,eAAgB74C,IAC7E,MAAOnD,GACR,OAAOggB,QAAQkkB,OAAOlkC,KArUzBnK,EAAA8lD,mBAAAA,EAiGyBA,EAAAyB,WAAa,IAoFbzB,EAAAqC,kBAAoB,IA2J7CnoD,EAAAgH,OAAA,SAAuBkoC,GACtB,OAAO,IAAI4W,EAAmB5W,EAAM,OAMR,mBAAlB7uC,gBAEVgwB,EAAAjB,QAAQ45B,OAASC,EAAA9H,0BCxoBlB,WAEC,IAAI+H,EAA0BlkC,KAAMkkC,kBAChCC,EAAgBD,GAAqBA,EAAkBhlD,QAAUglD,EAAkBhlD,QAAU;CAE/D,mBAAjB8gB,KAAM3mB,QAAgC2mB,KAAM3mB,OAAO+Q,KACnE/O,cAAc8oD,EAAgB,gBAG/Bz8C,QAAQrI,OAAO,CACdH,QAASilD,EACT7kD,YAAY,IAGb,IAeI8kD,GAAiB,EACjBC,EAAsC,GAC1CrkC,KAAKskC,UAAa1lD,IACZwlD,GAKLA,GAAiB,EAvBH,SAAUvkD,GACxB6H,QAAQ,CAAC7H,IAAW,SAAU0kD,GAC7B74C,YAAW,WACV,IAAI84C,EAAiBD,EAAGviD,OAAO,CAACiqB,EAAU6d,KACnC9pB,KAAMsK,YAAY2B,EAAK6d,IAC3B,MAGH,IADA9pB,KAAKskC,UAAan/C,GAAoBq/C,EAAeF,UAAUn/C,EAAE8B,MAC1Do9C,EAAoBxqD,OAAS,GACnCmmB,KAAKskC,UAAUD,EAAoBjxC,WAElC,MAaJqxC,CAAS7lD,EAAQqI,OALhBo9C,EAAoBpoD,KAAK2C,IAjC5B,KnCLAyL,KAAAtQ","file":"workerMain.js","sourcesContent":["}).call(this);","/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\n'use strict';\n/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\n/*---------------------------------------------------------------------------------------------\n *---------------------------------------------------------------------------------------------\n *---------------------------------------------------------------------------------------------\n *---------------------------------------------------------------------------------------------\n *---------------------------------------------------------------------------------------------\n * Please make sure to make edits in the .ts file at https://github.com/Microsoft/vscode-loader/\n *---------------------------------------------------------------------------------------------\n *---------------------------------------------------------------------------------------------\n *---------------------------------------------------------------------------------------------\n *---------------------------------------------------------------------------------------------\n *--------------------------------------------------------------------------------------------*/\nvar _amdLoaderGlobal = this;\nvar _commonjsGlobal = typeof global === 'object' ? global : {};\nvar AMDLoader;\n(function (AMDLoader) {\n AMDLoader.global = _amdLoaderGlobal;\n var Environment = /** @class */ (function () {\n function Environment() {\n this._detected = false;\n this._isWindows = false;\n this._isNode = false;\n this._isElectronRenderer = false;\n this._isWebWorker = false;\n }\n Object.defineProperty(Environment.prototype, \"isWindows\", {\n get: function () {\n this._detect();\n return this._isWindows;\n },\n enumerable: true,\n configurable: true\n });\n Object.defineProperty(Environment.prototype, \"isNode\", {\n get: function () {\n this._detect();\n return this._isNode;\n },\n enumerable: true,\n configurable: true\n });\n Object.defineProperty(Environment.prototype, \"isElectronRenderer\", {\n get: function () {\n this._detect();\n return this._isElectronRenderer;\n },\n enumerable: true,\n configurable: true\n });\n Object.defineProperty(Environment.prototype, \"isWebWorker\", {\n get: function () {\n this._detect();\n return this._isWebWorker;\n },\n enumerable: true,\n configurable: true\n });\n Environment.prototype._detect = function () {\n if (this._detected) {\n return;\n }\n this._detected = true;\n this._isWindows = Environment._isWindows();\n this._isNode = (typeof module !== 'undefined' && !!module.exports);\n this._isElectronRenderer = (typeof process !== 'undefined' && typeof process.versions !== 'undefined' && typeof process.versions.electron !== 'undefined' && process.type === 'renderer');\n this._isWebWorker = (typeof AMDLoader.global.importScripts === 'function');\n };\n Environment._isWindows = function () {\n if (typeof navigator !== 'undefined') {\n if (navigator.userAgent && navigator.userAgent.indexOf('Windows') >= 0) {\n return true;\n }\n }\n if (typeof process !== 'undefined') {\n return (process.platform === 'win32');\n }\n return false;\n };\n return Environment;\n }());\n AMDLoader.Environment = Environment;\n})(AMDLoader || (AMDLoader = {}));\n/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nvar AMDLoader;\n(function (AMDLoader) {\n var LoaderEvent = /** @class */ (function () {\n function LoaderEvent(type, detail, timestamp) {\n this.type = type;\n this.detail = detail;\n this.timestamp = timestamp;\n }\n return LoaderEvent;\n }());\n AMDLoader.LoaderEvent = LoaderEvent;\n var LoaderEventRecorder = /** @class */ (function () {\n function LoaderEventRecorder(loaderAvailableTimestamp) {\n this._events = [new LoaderEvent(1 /* LoaderAvailable */, '', loaderAvailableTimestamp)];\n }\n LoaderEventRecorder.prototype.record = function (type, detail) {\n this._events.push(new LoaderEvent(type, detail, AMDLoader.Utilities.getHighPerformanceTimestamp()));\n };\n LoaderEventRecorder.prototype.getEvents = function () {\n return this._events;\n };\n return LoaderEventRecorder;\n }());\n AMDLoader.LoaderEventRecorder = LoaderEventRecorder;\n var NullLoaderEventRecorder = /** @class */ (function () {\n function NullLoaderEventRecorder() {\n }\n NullLoaderEventRecorder.prototype.record = function (type, detail) {\n // Nothing to do\n };\n NullLoaderEventRecorder.prototype.getEvents = function () {\n return [];\n };\n NullLoaderEventRecorder.INSTANCE = new NullLoaderEventRecorder();\n return NullLoaderEventRecorder;\n }());\n AMDLoader.NullLoaderEventRecorder = NullLoaderEventRecorder;\n})(AMDLoader || (AMDLoader = {}));\n/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nvar AMDLoader;\n(function (AMDLoader) {\n var Utilities = /** @class */ (function () {\n function Utilities() {\n }\n /**\n * This method does not take care of / vs \\\n */\n Utilities.fileUriToFilePath = function (isWindows, uri) {\n uri = decodeURI(uri).replace(/%23/g, '#');\n if (isWindows) {\n if (/^file:\\/\\/\\//.test(uri)) {\n // This is a URI without a hostname => return only the path segment\n return uri.substr(8);\n }\n if (/^file:\\/\\//.test(uri)) {\n return uri.substr(5);\n }\n }\n else {\n if (/^file:\\/\\//.test(uri)) {\n return uri.substr(7);\n }\n }\n // Not sure...\n return uri;\n };\n Utilities.startsWith = function (haystack, needle) {\n return haystack.length >= needle.length && haystack.substr(0, needle.length) === needle;\n };\n Utilities.endsWith = function (haystack, needle) {\n return haystack.length >= needle.length && haystack.substr(haystack.length - needle.length) === needle;\n };\n // only check for \"?\" before \"#\" to ensure that there is a real Query-String\n Utilities.containsQueryString = function (url) {\n return /^[^\\#]*\\?/gi.test(url);\n };\n /**\n * Does `url` start with http:// or https:// or file:// or / ?\n */\n Utilities.isAbsolutePath = function (url) {\n return /^((http:\\/\\/)|(https:\\/\\/)|(file:\\/\\/)|(\\/))/.test(url);\n };\n Utilities.forEachProperty = function (obj, callback) {\n if (obj) {\n var key = void 0;\n for (key in obj) {\n if (obj.hasOwnProperty(key)) {\n callback(key, obj[key]);\n }\n }\n }\n };\n Utilities.isEmpty = function (obj) {\n var isEmpty = true;\n Utilities.forEachProperty(obj, function () {\n isEmpty = false;\n });\n return isEmpty;\n };\n Utilities.recursiveClone = function (obj) {\n if (!obj || typeof obj !== 'object' || obj instanceof RegExp) {\n return obj;\n }\n var result = Array.isArray(obj) ? [] : {};\n Utilities.forEachProperty(obj, function (key, value) {\n if (value && typeof value === 'object') {\n result[key] = Utilities.recursiveClone(value);\n }\n else {\n result[key] = value;\n }\n });\n return result;\n };\n Utilities.generateAnonymousModule = function () {\n return '===anonymous' + (Utilities.NEXT_ANONYMOUS_ID++) + '===';\n };\n Utilities.isAnonymousModule = function (id) {\n return Utilities.startsWith(id, '===anonymous');\n };\n Utilities.getHighPerformanceTimestamp = function () {\n if (!this.PERFORMANCE_NOW_PROBED) {\n this.PERFORMANCE_NOW_PROBED = true;\n this.HAS_PERFORMANCE_NOW = (AMDLoader.global.performance && typeof AMDLoader.global.performance.now === 'function');\n }\n return (this.HAS_PERFORMANCE_NOW ? AMDLoader.global.performance.now() : Date.now());\n };\n Utilities.NEXT_ANONYMOUS_ID = 1;\n Utilities.PERFORMANCE_NOW_PROBED = false;\n Utilities.HAS_PERFORMANCE_NOW = false;\n return Utilities;\n }());\n AMDLoader.Utilities = Utilities;\n})(AMDLoader || (AMDLoader = {}));\n/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nvar AMDLoader;\n(function (AMDLoader) {\n function ensureError(err) {\n if (err instanceof Error) {\n return err;\n }\n var result = new Error(err.message || String(err) || 'Unknown Error');\n if (err.stack) {\n result.stack = err.stack;\n }\n return result;\n }\n AMDLoader.ensureError = ensureError;\n ;\n var ConfigurationOptionsUtil = /** @class */ (function () {\n function ConfigurationOptionsUtil() {\n }\n /**\n * Ensure configuration options make sense\n */\n ConfigurationOptionsUtil.validateConfigurationOptions = function (options) {\n function defaultOnError(err) {\n if (err.phase === 'loading') {\n console.error('Loading \"' + err.moduleId + '\" failed');\n console.error(err);\n console.error('Here are the modules that depend on it:');\n console.error(err.neededBy);\n return;\n }\n if (err.phase === 'factory') {\n console.error('The factory method of \"' + err.moduleId + '\" has thrown an exception');\n console.error(err);\n return;\n }\n }\n options = options || {};\n if (typeof options.baseUrl !== 'string') {\n options.baseUrl = '';\n }\n if (typeof options.isBuild !== 'boolean') {\n options.isBuild = false;\n }\n if (typeof options.paths !== 'object') {\n options.paths = {};\n }\n if (typeof options.config !== 'object') {\n options.config = {};\n }\n if (typeof options.catchError === 'undefined') {\n options.catchError = false;\n }\n if (typeof options.recordStats === 'undefined') {\n options.recordStats = false;\n }\n if (typeof options.urlArgs !== 'string') {\n options.urlArgs = '';\n }\n if (typeof options.onError !== 'function') {\n options.onError = defaultOnError;\n }\n if (!Array.isArray(options.ignoreDuplicateModules)) {\n options.ignoreDuplicateModules = [];\n }\n if (options.baseUrl.length > 0) {\n if (!AMDLoader.Utilities.endsWith(options.baseUrl, '/')) {\n options.baseUrl += '/';\n }\n }\n if (typeof options.cspNonce !== 'string') {\n options.cspNonce = '';\n }\n if (typeof options.preferScriptTags === 'undefined') {\n options.preferScriptTags = false;\n }\n if (!Array.isArray(options.nodeModules)) {\n options.nodeModules = [];\n }\n if (options.nodeCachedData && typeof options.nodeCachedData === 'object') {\n if (typeof options.nodeCachedData.seed !== 'string') {\n options.nodeCachedData.seed = 'seed';\n }\n if (typeof options.nodeCachedData.writeDelay !== 'number' || options.nodeCachedData.writeDelay < 0) {\n options.nodeCachedData.writeDelay = 1000 * 7;\n }\n if (!options.nodeCachedData.path || typeof options.nodeCachedData.path !== 'string') {\n var err = ensureError(new Error('INVALID cached data configuration, \\'path\\' MUST be set'));\n err.phase = 'configuration';\n options.onError(err);\n options.nodeCachedData = undefined;\n }\n }\n return options;\n };\n ConfigurationOptionsUtil.mergeConfigurationOptions = function (overwrite, base) {\n if (overwrite === void 0) { overwrite = null; }\n if (base === void 0) { base = null; }\n var result = AMDLoader.Utilities.recursiveClone(base || {});\n // Merge known properties and overwrite the unknown ones\n AMDLoader.Utilities.forEachProperty(overwrite, function (key, value) {\n if (key === 'ignoreDuplicateModules' && typeof result.ignoreDuplicateModules !== 'undefined') {\n result.ignoreDuplicateModules = result.ignoreDuplicateModules.concat(value);\n }\n else if (key === 'paths' && typeof result.paths !== 'undefined') {\n AMDLoader.Utilities.forEachProperty(value, function (key2, value2) { return result.paths[key2] = value2; });\n }\n else if (key === 'config' && typeof result.config !== 'undefined') {\n AMDLoader.Utilities.forEachProperty(value, function (key2, value2) { return result.config[key2] = value2; });\n }\n else {\n result[key] = AMDLoader.Utilities.recursiveClone(value);\n }\n });\n return ConfigurationOptionsUtil.validateConfigurationOptions(result);\n };\n return ConfigurationOptionsUtil;\n }());\n AMDLoader.ConfigurationOptionsUtil = ConfigurationOptionsUtil;\n var Configuration = /** @class */ (function () {\n function Configuration(env, options) {\n this._env = env;\n this.options = ConfigurationOptionsUtil.mergeConfigurationOptions(options);\n this._createIgnoreDuplicateModulesMap();\n this._createNodeModulesMap();\n this._createSortedPathsRules();\n if (this.options.baseUrl === '') {\n if (this.options.nodeRequire && this.options.nodeRequire.main && this.options.nodeRequire.main.filename && this._env.isNode) {\n var nodeMain = this.options.nodeRequire.main.filename;\n var dirnameIndex = Math.max(nodeMain.lastIndexOf('/'), nodeMain.lastIndexOf('\\\\'));\n this.options.baseUrl = nodeMain.substring(0, dirnameIndex + 1);\n }\n if (this.options.nodeMain && this._env.isNode) {\n var nodeMain = this.options.nodeMain;\n var dirnameIndex = Math.max(nodeMain.lastIndexOf('/'), nodeMain.lastIndexOf('\\\\'));\n this.options.baseUrl = nodeMain.substring(0, dirnameIndex + 1);\n }\n }\n }\n Configuration.prototype._createIgnoreDuplicateModulesMap = function () {\n // Build a map out of the ignoreDuplicateModules array\n this.ignoreDuplicateModulesMap = {};\n for (var i = 0; i < this.options.ignoreDuplicateModules.length; i++) {\n this.ignoreDuplicateModulesMap[this.options.ignoreDuplicateModules[i]] = true;\n }\n };\n Configuration.prototype._createNodeModulesMap = function () {\n // Build a map out of nodeModules array\n this.nodeModulesMap = Object.create(null);\n for (var _i = 0, _a = this.options.nodeModules; _i < _a.length; _i++) {\n var nodeModule = _a[_i];\n this.nodeModulesMap[nodeModule] = true;\n }\n };\n Configuration.prototype._createSortedPathsRules = function () {\n var _this = this;\n // Create an array our of the paths rules, sorted descending by length to\n // result in a more specific -> less specific order\n this.sortedPathsRules = [];\n AMDLoader.Utilities.forEachProperty(this.options.paths, function (from, to) {\n if (!Array.isArray(to)) {\n _this.sortedPathsRules.push({\n from: from,\n to: [to]\n });\n }\n else {\n _this.sortedPathsRules.push({\n from: from,\n to: to\n });\n }\n });\n this.sortedPathsRules.sort(function (a, b) {\n return b.from.length - a.from.length;\n });\n };\n /**\n * Clone current configuration and overwrite options selectively.\n * @param options The selective options to overwrite with.\n * @result A new configuration\n */\n Configuration.prototype.cloneAndMerge = function (options) {\n return new Configuration(this._env, ConfigurationOptionsUtil.mergeConfigurationOptions(options, this.options));\n };\n /**\n * Get current options bag. Useful for passing it forward to plugins.\n */\n Configuration.prototype.getOptionsLiteral = function () {\n return this.options;\n };\n Configuration.prototype._applyPaths = function (moduleId) {\n var pathRule;\n for (var i = 0, len = this.sortedPathsRules.length; i < len; i++) {\n pathRule = this.sortedPathsRules[i];\n if (AMDLoader.Utilities.startsWith(moduleId, pathRule.from)) {\n var result = [];\n for (var j = 0, lenJ = pathRule.to.length; j < lenJ; j++) {\n result.push(pathRule.to[j] + moduleId.substr(pathRule.from.length));\n }\n return result;\n }\n }\n return [moduleId];\n };\n Configuration.prototype._addUrlArgsToUrl = function (url) {\n if (AMDLoader.Utilities.containsQueryString(url)) {\n return url + '&' + this.options.urlArgs;\n }\n else {\n return url + '?' + this.options.urlArgs;\n }\n };\n Configuration.prototype._addUrlArgsIfNecessaryToUrl = function (url) {\n if (this.options.urlArgs) {\n return this._addUrlArgsToUrl(url);\n }\n return url;\n };\n Configuration.prototype._addUrlArgsIfNecessaryToUrls = function (urls) {\n if (this.options.urlArgs) {\n for (var i = 0, len = urls.length; i < len; i++) {\n urls[i] = this._addUrlArgsToUrl(urls[i]);\n }\n }\n return urls;\n };\n /**\n * Transform a module id to a location. Appends .js to module ids\n */\n Configuration.prototype.moduleIdToPaths = function (moduleId) {\n var isNodeModule = ((this.nodeModulesMap[moduleId] === true)\n || (this.options.amdModulesPattern instanceof RegExp && !this.options.amdModulesPattern.test(moduleId)));\n if (isNodeModule) {\n // This is a node module...\n if (this.isBuild()) {\n // ...and we are at build time, drop it\n return ['empty:'];\n }\n else {\n // ...and at runtime we create a `shortcut`-path\n return ['node|' + moduleId];\n }\n }\n var result = moduleId;\n var results;\n if (!AMDLoader.Utilities.endsWith(result, '.js') && !AMDLoader.Utilities.isAbsolutePath(result)) {\n results = this._applyPaths(result);\n for (var i = 0, len = results.length; i < len; i++) {\n if (this.isBuild() && results[i] === 'empty:') {\n continue;\n }\n if (!AMDLoader.Utilities.isAbsolutePath(results[i])) {\n results[i] = this.options.baseUrl + results[i];\n }\n if (!AMDLoader.Utilities.endsWith(results[i], '.js') && !AMDLoader.Utilities.containsQueryString(results[i])) {\n results[i] = results[i] + '.js';\n }\n }\n }\n else {\n if (!AMDLoader.Utilities.endsWith(result, '.js') && !AMDLoader.Utilities.containsQueryString(result)) {\n result = result + '.js';\n }\n results = [result];\n }\n return this._addUrlArgsIfNecessaryToUrls(results);\n };\n /**\n * Transform a module id or url to a location.\n */\n Configuration.prototype.requireToUrl = function (url) {\n var result = url;\n if (!AMDLoader.Utilities.isAbsolutePath(result)) {\n result = this._applyPaths(result)[0];\n if (!AMDLoader.Utilities.isAbsolutePath(result)) {\n result = this.options.baseUrl + result;\n }\n }\n return this._addUrlArgsIfNecessaryToUrl(result);\n };\n /**\n * Flag to indicate if current execution is as part of a build.\n */\n Configuration.prototype.isBuild = function () {\n return this.options.isBuild;\n };\n /**\n * Test if module `moduleId` is expected to be defined multiple times\n */\n Configuration.prototype.isDuplicateMessageIgnoredFor = function (moduleId) {\n return this.ignoreDuplicateModulesMap.hasOwnProperty(moduleId);\n };\n /**\n * Get the configuration settings for the provided module id\n */\n Configuration.prototype.getConfigForModule = function (moduleId) {\n if (this.options.config) {\n return this.options.config[moduleId];\n }\n };\n /**\n * Should errors be caught when executing module factories?\n */\n Configuration.prototype.shouldCatchError = function () {\n return this.options.catchError;\n };\n /**\n * Should statistics be recorded?\n */\n Configuration.prototype.shouldRecordStats = function () {\n return this.options.recordStats;\n };\n /**\n * Forward an error to the error handler.\n */\n Configuration.prototype.onError = function (err) {\n this.options.onError(err);\n };\n return Configuration;\n }());\n AMDLoader.Configuration = Configuration;\n})(AMDLoader || (AMDLoader = {}));\n/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nvar AMDLoader;\n(function (AMDLoader) {\n /**\n * Load `scriptSrc` only once (avoid multiple <script> tags)\n */\n var OnlyOnceScriptLoader = /** @class */ (function () {\n function OnlyOnceScriptLoader(env) {\n this._env = env;\n this._scriptLoader = null;\n this._callbackMap = {};\n }\n OnlyOnceScriptLoader.prototype.load = function (moduleManager, scriptSrc, callback, errorback) {\n var _this = this;\n if (!this._scriptLoader) {\n if (this._env.isWebWorker) {\n this._scriptLoader = new WorkerScriptLoader();\n }\n else if (this._env.isElectronRenderer) {\n var preferScriptTags = moduleManager.getConfig().getOptionsLiteral().preferScriptTags;\n if (preferScriptTags) {\n this._scriptLoader = new BrowserScriptLoader();\n }\n else {\n this._scriptLoader = new NodeScriptLoader(this._env);\n }\n }\n else if (this._env.isNode) {\n this._scriptLoader = new NodeScriptLoader(this._env);\n }\n else {\n this._scriptLoader = new BrowserScriptLoader();\n }\n }\n var scriptCallbacks = {\n callback: callback,\n errorback: errorback\n };\n if (this._callbackMap.hasOwnProperty(scriptSrc)) {\n this._callbackMap[scriptSrc].push(scriptCallbacks);\n return;\n }\n this._callbackMap[scriptSrc] = [scriptCallbacks];\n this._scriptLoader.load(moduleManager, scriptSrc, function () { return _this.triggerCallback(scriptSrc); }, function (err) { return _this.triggerErrorback(scriptSrc, err); });\n };\n OnlyOnceScriptLoader.prototype.triggerCallback = function (scriptSrc) {\n var scriptCallbacks = this._callbackMap[scriptSrc];\n delete this._callbackMap[scriptSrc];\n for (var i = 0; i < scriptCallbacks.length; i++) {\n scriptCallbacks[i].callback();\n }\n };\n OnlyOnceScriptLoader.prototype.triggerErrorback = function (scriptSrc, err) {\n var scriptCallbacks = this._callbackMap[scriptSrc];\n delete this._callbackMap[scriptSrc];\n for (var i = 0; i < scriptCallbacks.length; i++) {\n scriptCallbacks[i].errorback(err);\n }\n };\n return OnlyOnceScriptLoader;\n }());\n var BrowserScriptLoader = /** @class */ (function () {\n function BrowserScriptLoader() {\n }\n /**\n * Attach load / error listeners to a script element and remove them when either one has fired.\n * Implemented for browssers supporting HTML5 standard 'load' and 'error' events.\n */\n BrowserScriptLoader.prototype.attachListeners = function (script, callback, errorback) {\n var unbind = function () {\n script.removeEventListener('load', loadEventListener);\n script.removeEventListener('error', errorEventListener);\n };\n var loadEventListener = function (e) {\n unbind();\n callback();\n };\n var errorEventListener = function (e) {\n unbind();\n errorback(e);\n };\n script.addEventListener('load', loadEventListener);\n script.addEventListener('error', errorEventListener);\n };\n BrowserScriptLoader.prototype.load = function (moduleManager, scriptSrc, callback, errorback) {\n if (/^node\\|/.test(scriptSrc)) {\n var opts = moduleManager.getConfig().getOptionsLiteral();\n var nodeRequire = (opts.nodeRequire || AMDLoader.global.nodeRequire);\n var pieces = scriptSrc.split('|');\n var moduleExports_1 = null;\n try {\n moduleExports_1 = nodeRequire(pieces[1]);\n }\n catch (err) {\n errorback(err);\n return;\n }\n moduleManager.enqueueDefineAnonymousModule([], function () { return moduleExports_1; });\n callback();\n }\n else {\n var script = document.createElement('script');\n script.setAttribute('async', 'async');\n script.setAttribute('type', 'text/javascript');\n this.attachListeners(script, callback, errorback);\n script.setAttribute('src', scriptSrc);\n // Propagate CSP nonce to dynamically created script tag.\n var cspNonce = moduleManager.getConfig().getOptionsLiteral().cspNonce;\n if (cspNonce) {\n script.setAttribute('nonce', cspNonce);\n }\n document.getElementsByTagName('head')[0].appendChild(script);\n }\n };\n return BrowserScriptLoader;\n }());\n var WorkerScriptLoader = /** @class */ (function () {\n function WorkerScriptLoader() {\n }\n WorkerScriptLoader.prototype.load = function (moduleManager, scriptSrc, callback, errorback) {\n try {\n importScripts(scriptSrc);\n callback();\n }\n catch (e) {\n errorback(e);\n }\n };\n return WorkerScriptLoader;\n }());\n var NodeScriptLoader = /** @class */ (function () {\n function NodeScriptLoader(env) {\n this._env = env;\n this._didInitialize = false;\n this._didPatchNodeRequire = false;\n }\n NodeScriptLoader.prototype._init = function (nodeRequire) {\n if (this._didInitialize) {\n return;\n }\n this._didInitialize = true;\n // capture node modules\n this._fs = nodeRequire('fs');\n this._vm = nodeRequire('vm');\n this._path = nodeRequire('path');\n this._crypto = nodeRequire('crypto');\n };\n // patch require-function of nodejs such that we can manually create a script\n // from cached data. this is done by overriding the `Module._compile` function\n NodeScriptLoader.prototype._initNodeRequire = function (nodeRequire, moduleManager) {\n // It is important to check for `nodeCachedData` first and then set `_didPatchNodeRequire`.\n // That's because `nodeCachedData` is set _after_ calling this for the first time...\n var nodeCachedData = moduleManager.getConfig().getOptionsLiteral().nodeCachedData;\n if (!nodeCachedData) {\n return;\n }\n if (this._didPatchNodeRequire) {\n return;\n }\n this._didPatchNodeRequire = true;\n var that = this;\n var Module = nodeRequire('module');\n function makeRequireFunction(mod) {\n var Module = mod.constructor;\n var require = function require(path) {\n try {\n return mod.require(path);\n }\n finally {\n // nothing\n }\n };\n require.resolve = function resolve(request) {\n return Module._resolveFilename(request, mod);\n };\n require.main = process.mainModule;\n require.extensions = Module._extensions;\n require.cache = Module._cache;\n return require;\n }\n Module.prototype._compile = function (content, filename) {\n // remove shebang and create wrapper function\n var scriptSource = Module.wrap(content.replace(/^#!.*/, ''));\n // create script\n var recorder = moduleManager.getRecorder();\n var cachedDataPath = that._getCachedDataPath(nodeCachedData, filename);\n var options = { filename: filename };\n var hashData;\n try {\n var data = that._fs.readFileSync(cachedDataPath);\n hashData = data.slice(0, 16);\n options.cachedData = data.slice(16);\n recorder.record(60 /* CachedDataFound */, cachedDataPath);\n }\n catch (_e) {\n recorder.record(61 /* CachedDataMissed */, cachedDataPath);\n }\n var script = new that._vm.Script(scriptSource, options);\n var compileWrapper = script.runInThisContext(options);\n // run script\n var dirname = that._path.dirname(filename);\n var require = makeRequireFunction(this);\n var args = [this.exports, require, this, filename, dirname, process, _commonjsGlobal, Buffer];\n var result = compileWrapper.apply(this.exports, args);\n // cached data aftermath\n that._handleCachedData(script, scriptSource, cachedDataPath, !options.cachedData, moduleManager);\n that._verifyCachedData(script, scriptSource, cachedDataPath, hashData, moduleManager);\n return result;\n };\n };\n NodeScriptLoader.prototype.load = function (moduleManager, scriptSrc, callback, errorback) {\n var _this = this;\n var opts = moduleManager.getConfig().getOptionsLiteral();\n var nodeRequire = (opts.nodeRequire || AMDLoader.global.nodeRequire);\n var nodeInstrumenter = (opts.nodeInstrumenter || function (c) { return c; });\n this._init(nodeRequire);\n this._initNodeRequire(nodeRequire, moduleManager);\n var recorder = moduleManager.getRecorder();\n if (/^node\\|/.test(scriptSrc)) {\n var pieces = scriptSrc.split('|');\n var moduleExports_2 = null;\n try {\n moduleExports_2 = nodeRequire(pieces[1]);\n }\n catch (err) {\n errorback(err);\n return;\n }\n moduleManager.enqueueDefineAnonymousModule([], function () { return moduleExports_2; });\n callback();\n }\n else {\n scriptSrc = AMDLoader.Utilities.fileUriToFilePath(this._env.isWindows, scriptSrc);\n var normalizedScriptSrc_1 = this._path.normalize(scriptSrc);\n var vmScriptPathOrUri_1 = this._getElectronRendererScriptPathOrUri(normalizedScriptSrc_1);\n var wantsCachedData_1 = Boolean(opts.nodeCachedData);\n var cachedDataPath_1 = wantsCachedData_1 ? this._getCachedDataPath(opts.nodeCachedData, scriptSrc) : undefined;\n this._readSourceAndCachedData(normalizedScriptSrc_1, cachedDataPath_1, recorder, function (err, data, cachedData, hashData) {\n if (err) {\n errorback(err);\n return;\n }\n var scriptSource;\n if (data.charCodeAt(0) === NodeScriptLoader._BOM) {\n scriptSource = NodeScriptLoader._PREFIX + data.substring(1) + NodeScriptLoader._SUFFIX;\n }\n else {\n scriptSource = NodeScriptLoader._PREFIX + data + NodeScriptLoader._SUFFIX;\n }\n scriptSource = nodeInstrumenter(scriptSource, normalizedScriptSrc_1);\n var scriptOpts = { filename: vmScriptPathOrUri_1, cachedData: cachedData };\n var script = _this._createAndEvalScript(moduleManager, scriptSource, scriptOpts, callback, errorback);\n _this._handleCachedData(script, scriptSource, cachedDataPath_1, wantsCachedData_1 && !cachedData, moduleManager);\n _this._verifyCachedData(script, scriptSource, cachedDataPath_1, hashData, moduleManager);\n });\n }\n };\n NodeScriptLoader.prototype._createAndEvalScript = function (moduleManager, contents, options, callback, errorback) {\n var recorder = moduleManager.getRecorder();\n recorder.record(31 /* NodeBeginEvaluatingScript */, options.filename);\n var script = new this._vm.Script(contents, options);\n var ret = script.runInThisContext(options);\n var globalDefineFunc = moduleManager.getGlobalAMDDefineFunc();\n var receivedDefineCall = false;\n var localDefineFunc = function () {\n receivedDefineCall = true;\n return globalDefineFunc.apply(null, arguments);\n };\n localDefineFunc.amd = globalDefineFunc.amd;\n ret.call(AMDLoader.global, moduleManager.getGlobalAMDRequireFunc(), localDefineFunc, options.filename, this._path.dirname(options.filename));\n recorder.record(32 /* NodeEndEvaluatingScript */, options.filename);\n if (receivedDefineCall) {\n callback();\n }\n else {\n errorback(new Error(\"Didn't receive define call in \" + options.filename + \"!\"));\n }\n return script;\n };\n NodeScriptLoader.prototype._getElectronRendererScriptPathOrUri = function (path) {\n if (!this._env.isElectronRenderer) {\n return path;\n }\n var driveLetterMatch = path.match(/^([a-z])\\:(.*)/i);\n if (driveLetterMatch) {\n // windows\n return \"file:///\" + (driveLetterMatch[1].toUpperCase() + ':' + driveLetterMatch[2]).replace(/\\\\/g, '/');\n }\n else {\n // nix\n return \"file://\" + path;\n }\n };\n NodeScriptLoader.prototype._getCachedDataPath = function (config, filename) {\n var hash = this._crypto.createHash('md5').update(filename, 'utf8').update(config.seed, 'utf8').digest('hex');\n var basename = this._path.basename(filename).replace(/\\.js$/, '');\n return this._path.join(config.path, basename + \"-\" + hash + \".code\");\n };\n NodeScriptLoader.prototype._handleCachedData = function (script, scriptSource, cachedDataPath, createCachedData, moduleManager) {\n var _this = this;\n if (script.cachedDataRejected) {\n // cached data got rejected -> delete and re-create\n this._fs.unlink(cachedDataPath, function (err) {\n moduleManager.getRecorder().record(62 /* CachedDataRejected */, cachedDataPath);\n _this._createAndWriteCachedData(script, scriptSource, cachedDataPath, moduleManager);\n if (err) {\n moduleManager.getConfig().onError(err);\n }\n });\n }\n else if (createCachedData) {\n // no cached data, but wanted\n this._createAndWriteCachedData(script, scriptSource, cachedDataPath, moduleManager);\n }\n };\n // Cached data format: | SOURCE_HASH | V8_CACHED_DATA |\n // -SOURCE_HASH is the md5 hash of the JS source (always 16 bytes)\n // -V8_CACHED_DATA is what v8 produces\n NodeScriptLoader.prototype._createAndWriteCachedData = function (script, scriptSource, cachedDataPath, moduleManager) {\n var _this = this;\n var timeout = Math.ceil(moduleManager.getConfig().getOptionsLiteral().nodeCachedData.writeDelay * (1 + Math.random()));\n var lastSize = -1;\n var iteration = 0;\n var hashData = undefined;\n var createLoop = function () {\n setTimeout(function () {\n if (!hashData) {\n hashData = _this._crypto.createHash('md5').update(scriptSource, 'utf8').digest();\n }\n var cachedData = script.createCachedData();\n if (cachedData.length === 0 || cachedData.length === lastSize || iteration >= 5) {\n // done\n return;\n }\n if (cachedData.length < lastSize) {\n // less data than before: skip, try again next round\n createLoop();\n return;\n }\n lastSize = cachedData.length;\n _this._fs.writeFile(cachedDataPath, Buffer.concat([hashData, cachedData]), function (err) {\n if (err) {\n moduleManager.getConfig().onError(err);\n }\n moduleManager.getRecorder().record(63 /* CachedDataCreated */, cachedDataPath);\n createLoop();\n });\n }, timeout * (Math.pow(4, iteration++)));\n };\n // with some delay (`timeout`) create cached data\n // and repeat that (with backoff delay) until the\n // data seems to be not changing anymore\n createLoop();\n };\n NodeScriptLoader.prototype._readSourceAndCachedData = function (sourcePath, cachedDataPath, recorder, callback) {\n if (!cachedDataPath) {\n // no cached data case\n this._fs.readFile(sourcePath, { encoding: 'utf8' }, callback);\n }\n else {\n // cached data case: read both files in parallel\n var source_1 = undefined;\n var cachedData_1 = undefined;\n var hashData_1 = undefined;\n var steps_1 = 2;\n var step_1 = function (err) {\n if (err) {\n callback(err);\n }\n else if (--steps_1 === 0) {\n callback(undefined, source_1, cachedData_1, hashData_1);\n }\n };\n this._fs.readFile(sourcePath, { encoding: 'utf8' }, function (err, data) {\n source_1 = data;\n step_1(err);\n });\n this._fs.readFile(cachedDataPath, function (err, data) {\n if (!err && data && data.length > 0) {\n hashData_1 = data.slice(0, 16);\n cachedData_1 = data.slice(16);\n recorder.record(60 /* CachedDataFound */, cachedDataPath);\n }\n else {\n recorder.record(61 /* CachedDataMissed */, cachedDataPath);\n }\n step_1(); // ignored: cached data is optional\n });\n }\n };\n NodeScriptLoader.prototype._verifyCachedData = function (script, scriptSource, cachedDataPath, hashData, moduleManager) {\n var _this = this;\n if (!hashData) {\n // nothing to do\n return;\n }\n if (script.cachedDataRejected) {\n // invalid anyways\n return;\n }\n setTimeout(function () {\n // check source hash - the contract is that file paths change when file content\n // change (e.g use the commit or version id as cache path). this check is\n // for violations of this contract.\n var hashDataNow = _this._crypto.createHash('md5').update(scriptSource, 'utf8').digest();\n if (!hashData.equals(hashDataNow)) {\n moduleManager.getConfig().onError(new Error(\"FAILED TO VERIFY CACHED DATA, deleting stale '\" + cachedDataPath + \"' now, but a RESTART IS REQUIRED\"));\n _this._fs.unlink(cachedDataPath, function (err) {\n if (err) {\n moduleManager.getConfig().onError(err);\n }\n });\n }\n }, Math.ceil(5000 * (1 + Math.random())));\n };\n NodeScriptLoader._BOM = 0xFEFF;\n NodeScriptLoader._PREFIX = '(function (require, define, __filename, __dirname) { ';\n NodeScriptLoader._SUFFIX = '\\n});';\n return NodeScriptLoader;\n }());\n function createScriptLoader(env) {\n return new OnlyOnceScriptLoader(env);\n }\n AMDLoader.createScriptLoader = createScriptLoader;\n})(AMDLoader || (AMDLoader = {}));\n/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\nvar AMDLoader;\n(function (AMDLoader) {\n // ------------------------------------------------------------------------\n // ModuleIdResolver\n var ModuleIdResolver = /** @class */ (function () {\n function ModuleIdResolver(fromModuleId) {\n var lastSlash = fromModuleId.lastIndexOf('/');\n if (lastSlash !== -1) {\n this.fromModulePath = fromModuleId.substr(0, lastSlash + 1);\n }\n else {\n this.fromModulePath = '';\n }\n }\n /**\n * Normalize 'a/../name' to 'name', etc.\n */\n ModuleIdResolver._normalizeModuleId = function (moduleId) {\n var r = moduleId, pattern;\n // replace /./ => /\n pattern = /\\/\\.\\//;\n while (pattern.test(r)) {\n r = r.replace(pattern, '/');\n }\n // replace ^./ => nothing\n r = r.replace(/^\\.\\//g, '');\n // replace /aa/../ => / (BUT IGNORE /../../)\n pattern = /\\/(([^\\/])|([^\\/][^\\/\\.])|([^\\/\\.][^\\/])|([^\\/][^\\/][^\\/]+))\\/\\.\\.\\//;\n while (pattern.test(r)) {\n r = r.replace(pattern, '/');\n }\n // replace ^aa/../ => nothing (BUT IGNORE ../../)\n r = r.replace(/^(([^\\/])|([^\\/][^\\/\\.])|([^\\/\\.][^\\/])|([^\\/][^\\/][^\\/]+))\\/\\.\\.\\//, '');\n return r;\n };\n /**\n * Resolve relative module ids\n */\n ModuleIdResolver.prototype.resolveModule = function (moduleId) {\n var result = moduleId;\n if (!AMDLoader.Utilities.isAbsolutePath(result)) {\n if (AMDLoader.Utilities.startsWith(result, './') || AMDLoader.Utilities.startsWith(result, '../')) {\n result = ModuleIdResolver._normalizeModuleId(this.fromModulePath + result);\n }\n }\n return result;\n };\n ModuleIdResolver.ROOT = new ModuleIdResolver('');\n return ModuleIdResolver;\n }());\n AMDLoader.ModuleIdResolver = ModuleIdResolver;\n // ------------------------------------------------------------------------\n // Module\n var Module = /** @class */ (function () {\n function Module(id, strId, dependencies, callback, errorback, moduleIdResolver) {\n this.id = id;\n this.strId = strId;\n this.dependencies = dependencies;\n this._callback = callback;\n this._errorback = errorback;\n this.moduleIdResolver = moduleIdResolver;\n this.exports = {};\n this.error = null;\n this.exportsPassedIn = false;\n this.unresolvedDependenciesCount = this.dependencies.length;\n this._isComplete = false;\n }\n Module._safeInvokeFunction = function (callback, args) {\n try {\n return {\n returnedValue: callback.apply(AMDLoader.global, args),\n producedError: null\n };\n }\n catch (e) {\n return {\n returnedValue: null,\n producedError: e\n };\n }\n };\n Module._invokeFactory = function (config, strModuleId, callback, dependenciesValues) {\n if (config.isBuild() && !AMDLoader.Utilities.isAnonymousModule(strModuleId)) {\n return {\n returnedValue: null,\n producedError: null\n };\n }\n if (config.shouldCatchError()) {\n return this._safeInvokeFunction(callback, dependenciesValues);\n }\n return {\n returnedValue: callback.apply(AMDLoader.global, dependenciesValues),\n producedError: null\n };\n };\n Module.prototype.complete = function (recorder, config, dependenciesValues) {\n this._isComplete = true;\n var producedError = null;\n if (this._callback) {\n if (typeof this._callback === 'function') {\n recorder.record(21 /* BeginInvokeFactory */, this.strId);\n var r = Module._invokeFactory(config, this.strId, this._callback, dependenciesValues);\n producedError = r.producedError;\n recorder.record(22 /* EndInvokeFactory */, this.strId);\n if (!producedError && typeof r.returnedValue !== 'undefined' && (!this.exportsPassedIn || AMDLoader.Utilities.isEmpty(this.exports))) {\n this.exports = r.returnedValue;\n }\n }\n else {\n this.exports = this._callback;\n }\n }\n if (producedError) {\n var err = AMDLoader.ensureError(producedError);\n err.phase = 'factory';\n err.moduleId = this.strId;\n this.error = err;\n config.onError(err);\n }\n this.dependencies = null;\n this._callback = null;\n this._errorback = null;\n this.moduleIdResolver = null;\n };\n /**\n * One of the direct dependencies or a transitive dependency has failed to load.\n */\n Module.prototype.onDependencyError = function (err) {\n this._isComplete = true;\n this.error = err;\n if (this._errorback) {\n this._errorback(err);\n return true;\n }\n return false;\n };\n /**\n * Is the current module complete?\n */\n Module.prototype.isComplete = function () {\n return this._isComplete;\n };\n return Module;\n }());\n AMDLoader.Module = Module;\n var ModuleIdProvider = /** @class */ (function () {\n function ModuleIdProvider() {\n this._nextId = 0;\n this._strModuleIdToIntModuleId = new Map();\n this._intModuleIdToStrModuleId = [];\n // Ensure values 0, 1, 2 are assigned accordingly with ModuleId\n this.getModuleId('exports');\n this.getModuleId('module');\n this.getModuleId('require');\n }\n ModuleIdProvider.prototype.getMaxModuleId = function () {\n return this._nextId;\n };\n ModuleIdProvider.prototype.getModuleId = function (strModuleId) {\n var id = this._strModuleIdToIntModuleId.get(strModuleId);\n if (typeof id === 'undefined') {\n id = this._nextId++;\n this._strModuleIdToIntModuleId.set(strModuleId, id);\n this._intModuleIdToStrModuleId[id] = strModuleId;\n }\n return id;\n };\n ModuleIdProvider.prototype.getStrModuleId = function (moduleId) {\n return this._intModuleIdToStrModuleId[moduleId];\n };\n return ModuleIdProvider;\n }());\n var RegularDependency = /** @class */ (function () {\n function RegularDependency(id) {\n this.id = id;\n }\n RegularDependency.EXPORTS = new RegularDependency(0 /* EXPORTS */);\n RegularDependency.MODULE = new RegularDependency(1 /* MODULE */);\n RegularDependency.REQUIRE = new RegularDependency(2 /* REQUIRE */);\n return RegularDependency;\n }());\n AMDLoader.RegularDependency = RegularDependency;\n var PluginDependency = /** @class */ (function () {\n function PluginDependency(id, pluginId, pluginParam) {\n this.id = id;\n this.pluginId = pluginId;\n this.pluginParam = pluginParam;\n }\n return PluginDependency;\n }());\n AMDLoader.PluginDependency = PluginDependency;\n var ModuleManager = /** @class */ (function () {\n function ModuleManager(env, scriptLoader, defineFunc, requireFunc, loaderAvailableTimestamp) {\n if (loaderAvailableTimestamp === void 0) { loaderAvailableTimestamp = 0; }\n this._env = env;\n this._scriptLoader = scriptLoader;\n this._loaderAvailableTimestamp = loaderAvailableTimestamp;\n this._defineFunc = defineFunc;\n this._requireFunc = requireFunc;\n this._moduleIdProvider = new ModuleIdProvider();\n this._config = new AMDLoader.Configuration(this._env);\n this._modules2 = [];\n this._knownModules2 = [];\n this._inverseDependencies2 = [];\n this._inversePluginDependencies2 = new Map();\n this._currentAnnonymousDefineCall = null;\n this._recorder = null;\n this._buildInfoPath = [];\n this._buildInfoDefineStack = [];\n this._buildInfoDependencies = [];\n }\n ModuleManager.prototype.reset = function () {\n return new ModuleManager(this._env, this._scriptLoader, this._defineFunc, this._requireFunc, this._loaderAvailableTimestamp);\n };\n ModuleManager.prototype.getGlobalAMDDefineFunc = function () {\n return this._defineFunc;\n };\n ModuleManager.prototype.getGlobalAMDRequireFunc = function () {\n return this._requireFunc;\n };\n ModuleManager._findRelevantLocationInStack = function (needle, stack) {\n var normalize = function (str) { return str.replace(/\\\\/g, '/'); };\n var normalizedPath = normalize(needle);\n var stackPieces = stack.split(/\\n/);\n for (var i = 0; i < stackPieces.length; i++) {\n var m = stackPieces[i].match(/(.*):(\\d+):(\\d+)\\)?$/);\n if (m) {\n var stackPath = m[1];\n var stackLine = m[2];\n var stackColumn = m[3];\n var trimPathOffset = Math.max(stackPath.lastIndexOf(' ') + 1, stackPath.lastIndexOf('(') + 1);\n stackPath = stackPath.substr(trimPathOffset);\n stackPath = normalize(stackPath);\n if (stackPath === normalizedPath) {\n var r = {\n line: parseInt(stackLine, 10),\n col: parseInt(stackColumn, 10)\n };\n if (r.line === 1) {\n r.col -= '(function (require, define, __filename, __dirname) { '.length;\n }\n return r;\n }\n }\n }\n throw new Error('Could not correlate define call site for needle ' + needle);\n };\n ModuleManager.prototype.getBuildInfo = function () {\n if (!this._config.isBuild()) {\n return null;\n }\n var result = [], resultLen = 0;\n for (var i = 0, len = this._modules2.length; i < len; i++) {\n var m = this._modules2[i];\n if (!m) {\n continue;\n }\n var location_1 = this._buildInfoPath[m.id] || null;\n var defineStack = this._buildInfoDefineStack[m.id] || null;\n var dependencies = this._buildInfoDependencies[m.id];\n result[resultLen++] = {\n id: m.strId,\n path: location_1,\n defineLocation: (location_1 && defineStack ? ModuleManager._findRelevantLocationInStack(location_1, defineStack) : null),\n dependencies: dependencies,\n shim: null,\n exports: m.exports\n };\n }\n return result;\n };\n ModuleManager.prototype.getRecorder = function () {\n if (!this._recorder) {\n if (this._config.shouldRecordStats()) {\n this._recorder = new AMDLoader.LoaderEventRecorder(this._loaderAvailableTimestamp);\n }\n else {\n this._recorder = AMDLoader.NullLoaderEventRecorder.INSTANCE;\n }\n }\n return this._recorder;\n };\n ModuleManager.prototype.getLoaderEvents = function () {\n return this.getRecorder().getEvents();\n };\n /**\n * Defines an anonymous module (without an id). Its name will be resolved as we receive a callback from the scriptLoader.\n * @param dependecies @see defineModule\n * @param callback @see defineModule\n */\n ModuleManager.prototype.enqueueDefineAnonymousModule = function (dependencies, callback) {\n if (this._currentAnnonymousDefineCall !== null) {\n throw new Error('Can only have one anonymous define call per script file');\n }\n var stack = null;\n if (this._config.isBuild()) {\n stack = new Error('StackLocation').stack || null;\n }\n this._currentAnnonymousDefineCall = {\n stack: stack,\n dependencies: dependencies,\n callback: callback\n };\n };\n /**\n * Creates a module and stores it in _modules. The manager will immediately begin resolving its dependencies.\n * @param strModuleId An unique and absolute id of the module. This must not collide with another module's id\n * @param dependencies An array with the dependencies of the module. Special keys are: \"require\", \"exports\" and \"module\"\n * @param callback if callback is a function, it will be called with the resolved dependencies. if callback is an object, it will be considered as the exports of the module.\n */\n ModuleManager.prototype.defineModule = function (strModuleId, dependencies, callback, errorback, stack, moduleIdResolver) {\n var _this = this;\n if (moduleIdResolver === void 0) { moduleIdResolver = new ModuleIdResolver(strModuleId); }\n var moduleId = this._moduleIdProvider.getModuleId(strModuleId);\n if (this._modules2[moduleId]) {\n if (!this._config.isDuplicateMessageIgnoredFor(strModuleId)) {\n console.warn('Duplicate definition of module \\'' + strModuleId + '\\'');\n }\n // Super important! Completely ignore duplicate module definition\n return;\n }\n var m = new Module(moduleId, strModuleId, this._normalizeDependencies(dependencies, moduleIdResolver), callback, errorback, moduleIdResolver);\n this._modules2[moduleId] = m;\n if (this._config.isBuild()) {\n this._buildInfoDefineStack[moduleId] = stack;\n this._buildInfoDependencies[moduleId] = (m.dependencies || []).map(function (dep) { return _this._moduleIdProvider.getStrModuleId(dep.id); });\n }\n // Resolving of dependencies is immediate (not in a timeout). If there's a need to support a packer that concatenates in an\n // unordered manner, in order to finish processing the file, execute the following method in a timeout\n this._resolve(m);\n };\n ModuleManager.prototype._normalizeDependency = function (dependency, moduleIdResolver) {\n if (dependency === 'exports') {\n return RegularDependency.EXPORTS;\n }\n if (dependency === 'module') {\n return RegularDependency.MODULE;\n }\n if (dependency === 'require') {\n return RegularDependency.REQUIRE;\n }\n // Normalize dependency and then request it from the manager\n var bangIndex = dependency.indexOf('!');\n if (bangIndex >= 0) {\n var strPluginId = moduleIdResolver.resolveModule(dependency.substr(0, bangIndex));\n var pluginParam = moduleIdResolver.resolveModule(dependency.substr(bangIndex + 1));\n var dependencyId = this._moduleIdProvider.getModuleId(strPluginId + '!' + pluginParam);\n var pluginId = this._moduleIdProvider.getModuleId(strPluginId);\n return new PluginDependency(dependencyId, pluginId, pluginParam);\n }\n return new RegularDependency(this._moduleIdProvider.getModuleId(moduleIdResolver.resolveModule(dependency)));\n };\n ModuleManager.prototype._normalizeDependencies = function (dependencies, moduleIdResolver) {\n var result = [], resultLen = 0;\n for (var i = 0, len = dependencies.length; i < len; i++) {\n result[resultLen++] = this._normalizeDependency(dependencies[i], moduleIdResolver);\n }\n return result;\n };\n ModuleManager.prototype._relativeRequire = function (moduleIdResolver, dependencies, callback, errorback) {\n if (typeof dependencies === 'string') {\n return this.synchronousRequire(dependencies, moduleIdResolver);\n }\n this.defineModule(AMDLoader.Utilities.generateAnonymousModule(), dependencies, callback, errorback, null, moduleIdResolver);\n };\n /**\n * Require synchronously a module by its absolute id. If the module is not loaded, an exception will be thrown.\n * @param id The unique and absolute id of the required module\n * @return The exports of module 'id'\n */\n ModuleManager.prototype.synchronousRequire = function (_strModuleId, moduleIdResolver) {\n if (moduleIdResolver === void 0) { moduleIdResolver = new ModuleIdResolver(_strModuleId); }\n var dependency = this._normalizeDependency(_strModuleId, moduleIdResolver);\n var m = this._modules2[dependency.id];\n if (!m) {\n throw new Error('Check dependency list! Synchronous require cannot resolve module \\'' + _strModuleId + '\\'. This is the first mention of this module!');\n }\n if (!m.isComplete()) {\n throw new Error('Check dependency list! Synchronous require cannot resolve module \\'' + _strModuleId + '\\'. This module has not been resolved completely yet.');\n }\n if (m.error) {\n throw m.error;\n }\n return m.exports;\n };\n ModuleManager.prototype.configure = function (params, shouldOverwrite) {\n var oldShouldRecordStats = this._config.shouldRecordStats();\n if (shouldOverwrite) {\n this._config = new AMDLoader.Configuration(this._env, params);\n }\n else {\n this._config = this._config.cloneAndMerge(params);\n }\n if (this._config.shouldRecordStats() && !oldShouldRecordStats) {\n this._recorder = null;\n }\n };\n ModuleManager.prototype.getConfig = function () {\n return this._config;\n };\n /**\n * Callback from the scriptLoader when a module has been loaded.\n * This means its code is available and has been executed.\n */\n ModuleManager.prototype._onLoad = function (moduleId) {\n if (this._currentAnnonymousDefineCall !== null) {\n var defineCall = this._currentAnnonymousDefineCall;\n this._currentAnnonymousDefineCall = null;\n // Hit an anonymous define call\n this.defineModule(this._moduleIdProvider.getStrModuleId(moduleId), defineCall.dependencies, defineCall.callback, null, defineCall.stack);\n }\n };\n ModuleManager.prototype._createLoadError = function (moduleId, _err) {\n var _this = this;\n var strModuleId = this._moduleIdProvider.getStrModuleId(moduleId);\n var neededBy = (this._inverseDependencies2[moduleId] || []).map(function (intModuleId) { return _this._moduleIdProvider.getStrModuleId(intModuleId); });\n var err = AMDLoader.ensureError(_err);\n err.phase = 'loading';\n err.moduleId = strModuleId;\n err.neededBy = neededBy;\n return err;\n };\n /**\n * Callback from the scriptLoader when a module hasn't been loaded.\n * This means that the script was not found (e.g. 404) or there was an error in the script.\n */\n ModuleManager.prototype._onLoadError = function (moduleId, err) {\n var error = this._createLoadError(moduleId, err);\n if (!this._modules2[moduleId]) {\n this._modules2[moduleId] = new Module(moduleId, this._moduleIdProvider.getStrModuleId(moduleId), [], function () { }, function () { }, null);\n }\n // Find any 'local' error handlers, walk the entire chain of inverse dependencies if necessary.\n var seenModuleId = [];\n for (var i = 0, len = this._moduleIdProvider.getMaxModuleId(); i < len; i++) {\n seenModuleId[i] = false;\n }\n var someoneNotified = false;\n var queue = [];\n queue.push(moduleId);\n seenModuleId[moduleId] = true;\n while (queue.length > 0) {\n var queueElement = queue.shift();\n var m = this._modules2[queueElement];\n if (m) {\n someoneNotified = m.onDependencyError(error) || someoneNotified;\n }\n var inverseDeps = this._inverseDependencies2[queueElement];\n if (inverseDeps) {\n for (var i = 0, len = inverseDeps.length; i < len; i++) {\n var inverseDep = inverseDeps[i];\n if (!seenModuleId[inverseDep]) {\n queue.push(inverseDep);\n seenModuleId[inverseDep] = true;\n }\n }\n }\n }\n if (!someoneNotified) {\n this._config.onError(error);\n }\n };\n /**\n * Walks (recursively) the dependencies of 'from' in search of 'to'.\n * Returns true if there is such a path or false otherwise.\n * @param from Module id to start at\n * @param to Module id to look for\n */\n ModuleManager.prototype._hasDependencyPath = function (fromId, toId) {\n var from = this._modules2[fromId];\n if (!from) {\n return false;\n }\n var inQueue = [];\n for (var i = 0, len = this._moduleIdProvider.getMaxModuleId(); i < len; i++) {\n inQueue[i] = false;\n }\n var queue = [];\n // Insert 'from' in queue\n queue.push(from);\n inQueue[fromId] = true;\n while (queue.length > 0) {\n // Pop first inserted element of queue\n var element = queue.shift();\n var dependencies = element.dependencies;\n if (dependencies) {\n // Walk the element's dependencies\n for (var i = 0, len = dependencies.length; i < len; i++) {\n var dependency = dependencies[i];\n if (dependency.id === toId) {\n // There is a path to 'to'\n return true;\n }\n var dependencyModule = this._modules2[dependency.id];\n if (dependencyModule && !inQueue[dependency.id]) {\n // Insert 'dependency' in queue\n inQueue[dependency.id] = true;\n queue.push(dependencyModule);\n }\n }\n }\n }\n // There is no path to 'to'\n return false;\n };\n /**\n * Walks (recursively) the dependencies of 'from' in search of 'to'.\n * Returns cycle as array.\n * @param from Module id to start at\n * @param to Module id to look for\n */\n ModuleManager.prototype._findCyclePath = function (fromId, toId, depth) {\n if (fromId === toId || depth === 50) {\n return [fromId];\n }\n var from = this._modules2[fromId];\n if (!from) {\n return null;\n }\n // Walk the element's dependencies\n var dependencies = from.dependencies;\n if (dependencies) {\n for (var i = 0, len = dependencies.length; i < len; i++) {\n var path = this._findCyclePath(dependencies[i].id, toId, depth + 1);\n if (path !== null) {\n path.push(fromId);\n return path;\n }\n }\n }\n return null;\n };\n /**\n * Create the local 'require' that is passed into modules\n */\n ModuleManager.prototype._createRequire = function (moduleIdResolver) {\n var _this = this;\n var result = (function (dependencies, callback, errorback) {\n return _this._relativeRequire(moduleIdResolver, dependencies, callback, errorback);\n });\n result.toUrl = function (id) {\n return _this._config.requireToUrl(moduleIdResolver.resolveModule(id));\n };\n result.getStats = function () {\n return _this.getLoaderEvents();\n };\n result.config = function (params, shouldOverwrite) {\n if (shouldOverwrite === void 0) { shouldOverwrite = false; }\n _this.configure(params, shouldOverwrite);\n };\n result.__$__nodeRequire = AMDLoader.global.nodeRequire;\n return result;\n };\n ModuleManager.prototype._loadModule = function (moduleId) {\n var _this = this;\n if (this._modules2[moduleId] || this._knownModules2[moduleId]) {\n // known module\n return;\n }\n this._knownModules2[moduleId] = true;\n var strModuleId = this._moduleIdProvider.getStrModuleId(moduleId);\n var paths = this._config.moduleIdToPaths(strModuleId);\n var scopedPackageRegex = /^@[^\\/]+\\/[^\\/]+$/; // matches @scope/package-name\n if (this._env.isNode && (strModuleId.indexOf('/') === -1 || scopedPackageRegex.test(strModuleId))) {\n paths.push('node|' + strModuleId);\n }\n var lastPathIndex = -1;\n var loadNextPath = function (err) {\n lastPathIndex++;\n if (lastPathIndex >= paths.length) {\n // No more paths to try\n _this._onLoadError(moduleId, err);\n }\n else {\n var currentPath_1 = paths[lastPathIndex];\n var recorder_1 = _this.getRecorder();\n if (_this._config.isBuild() && currentPath_1 === 'empty:') {\n _this._buildInfoPath[moduleId] = currentPath_1;\n _this.defineModule(_this._moduleIdProvider.getStrModuleId(moduleId), [], null, null, null);\n _this._onLoad(moduleId);\n return;\n }\n recorder_1.record(10 /* BeginLoadingScript */, currentPath_1);\n _this._scriptLoader.load(_this, currentPath_1, function () {\n if (_this._config.isBuild()) {\n _this._buildInfoPath[moduleId] = currentPath_1;\n }\n recorder_1.record(11 /* EndLoadingScriptOK */, currentPath_1);\n _this._onLoad(moduleId);\n }, function (err) {\n recorder_1.record(12 /* EndLoadingScriptError */, currentPath_1);\n loadNextPath(err);\n });\n }\n };\n loadNextPath(null);\n };\n /**\n * Resolve a plugin dependency with the plugin loaded & complete\n * @param module The module that has this dependency\n * @param pluginDependency The semi-normalized dependency that appears in the module. e.g. 'vs/css!./mycssfile'. Only the plugin part (before !) is normalized\n * @param plugin The plugin (what the plugin exports)\n */\n ModuleManager.prototype._loadPluginDependency = function (plugin, pluginDependency) {\n var _this = this;\n if (this._modules2[pluginDependency.id] || this._knownModules2[pluginDependency.id]) {\n // known module\n return;\n }\n this._knownModules2[pluginDependency.id] = true;\n // Delegate the loading of the resource to the plugin\n var load = (function (value) {\n _this.defineModule(_this._moduleIdProvider.getStrModuleId(pluginDependency.id), [], value, null, null);\n });\n load.error = function (err) {\n _this._config.onError(_this._createLoadError(pluginDependency.id, err));\n };\n plugin.load(pluginDependency.pluginParam, this._createRequire(ModuleIdResolver.ROOT), load, this._config.getOptionsLiteral());\n };\n /**\n * Examine the dependencies of module 'module' and resolve them as needed.\n */\n ModuleManager.prototype._resolve = function (module) {\n var _this = this;\n var dependencies = module.dependencies;\n if (dependencies) {\n for (var i = 0, len = dependencies.length; i < len; i++) {\n var dependency = dependencies[i];\n if (dependency === RegularDependency.EXPORTS) {\n module.exportsPassedIn = true;\n module.unresolvedDependenciesCount--;\n continue;\n }\n if (dependency === RegularDependency.MODULE) {\n module.unresolvedDependenciesCount--;\n continue;\n }\n if (dependency === RegularDependency.REQUIRE) {\n module.unresolvedDependenciesCount--;\n continue;\n }\n var dependencyModule = this._modules2[dependency.id];\n if (dependencyModule && dependencyModule.isComplete()) {\n if (dependencyModule.error) {\n module.onDependencyError(dependencyModule.error);\n return;\n }\n module.unresolvedDependenciesCount--;\n continue;\n }\n if (this._hasDependencyPath(dependency.id, module.id)) {\n console.warn('There is a dependency cycle between \\'' + this._moduleIdProvider.getStrModuleId(dependency.id) + '\\' and \\'' + this._moduleIdProvider.getStrModuleId(module.id) + '\\'. The cyclic path follows:');\n var cyclePath = this._findCyclePath(dependency.id, module.id, 0) || [];\n cyclePath.reverse();\n cyclePath.push(dependency.id);\n console.warn(cyclePath.map(function (id) { return _this._moduleIdProvider.getStrModuleId(id); }).join(' => \\n'));\n // Break the cycle\n module.unresolvedDependenciesCount--;\n continue;\n }\n // record inverse dependency\n this._inverseDependencies2[dependency.id] = this._inverseDependencies2[dependency.id] || [];\n this._inverseDependencies2[dependency.id].push(module.id);\n if (dependency instanceof PluginDependency) {\n var plugin = this._modules2[dependency.pluginId];\n if (plugin && plugin.isComplete()) {\n this._loadPluginDependency(plugin.exports, dependency);\n continue;\n }\n // Record dependency for when the plugin gets loaded\n var inversePluginDeps = this._inversePluginDependencies2.get(dependency.pluginId);\n if (!inversePluginDeps) {\n inversePluginDeps = [];\n this._inversePluginDependencies2.set(dependency.pluginId, inversePluginDeps);\n }\n inversePluginDeps.push(dependency);\n this._loadModule(dependency.pluginId);\n continue;\n }\n this._loadModule(dependency.id);\n }\n }\n if (module.unresolvedDependenciesCount === 0) {\n this._onModuleComplete(module);\n }\n };\n ModuleManager.prototype._onModuleComplete = function (module) {\n var _this = this;\n var recorder = this.getRecorder();\n if (module.isComplete()) {\n // already done\n return;\n }\n var dependencies = module.dependencies;\n var dependenciesValues = [];\n if (dependencies) {\n for (var i = 0, len = dependencies.length; i < len; i++) {\n var dependency = dependencies[i];\n if (dependency === RegularDependency.EXPORTS) {\n dependenciesValues[i] = module.exports;\n continue;\n }\n if (dependency === RegularDependency.MODULE) {\n dependenciesValues[i] = {\n id: module.strId,\n config: function () {\n return _this._config.getConfigForModule(module.strId);\n }\n };\n continue;\n }\n if (dependency === RegularDependency.REQUIRE) {\n dependenciesValues[i] = this._createRequire(module.moduleIdResolver);\n continue;\n }\n var dependencyModule = this._modules2[dependency.id];\n if (dependencyModule) {\n dependenciesValues[i] = dependencyModule.exports;\n continue;\n }\n dependenciesValues[i] = null;\n }\n }\n module.complete(recorder, this._config, dependenciesValues);\n // Fetch and clear inverse dependencies\n var inverseDeps = this._inverseDependencies2[module.id];\n this._inverseDependencies2[module.id] = null;\n if (inverseDeps) {\n // Resolve one inverse dependency at a time, always\n // on the lookout for a completed module.\n for (var i = 0, len = inverseDeps.length; i < len; i++) {\n var inverseDependencyId = inverseDeps[i];\n var inverseDependency = this._modules2[inverseDependencyId];\n inverseDependency.unresolvedDependenciesCount--;\n if (inverseDependency.unresolvedDependenciesCount === 0) {\n this._onModuleComplete(inverseDependency);\n }\n }\n }\n var inversePluginDeps = this._inversePluginDependencies2.get(module.id);\n if (inversePluginDeps) {\n // This module is used as a plugin at least once\n // Fetch and clear these inverse plugin dependencies\n this._inversePluginDependencies2.delete(module.id);\n // Resolve plugin dependencies one at a time\n for (var i = 0, len = inversePluginDeps.length; i < len; i++) {\n this._loadPluginDependency(module.exports, inversePluginDeps[i]);\n }\n }\n };\n return ModuleManager;\n }());\n AMDLoader.ModuleManager = ModuleManager;\n})(AMDLoader || (AMDLoader = {}));\nvar define;\nvar AMDLoader;\n(function (AMDLoader) {\n var env = new AMDLoader.Environment();\n var moduleManager = null;\n var DefineFunc = function (id, dependencies, callback) {\n if (typeof id !== 'string') {\n callback = dependencies;\n dependencies = id;\n id = null;\n }\n if (typeof dependencies !== 'object' || !Array.isArray(dependencies)) {\n callback = dependencies;\n dependencies = null;\n }\n if (!dependencies) {\n dependencies = ['require', 'exports', 'module'];\n }\n if (id) {\n moduleManager.defineModule(id, dependencies, callback, null, null);\n }\n else {\n moduleManager.enqueueDefineAnonymousModule(dependencies, callback);\n }\n };\n DefineFunc.amd = {\n jQuery: true\n };\n var _requireFunc_config = function (params, shouldOverwrite) {\n if (shouldOverwrite === void 0) { shouldOverwrite = false; }\n moduleManager.configure(params, shouldOverwrite);\n };\n var RequireFunc = function () {\n if (arguments.length === 1) {\n if ((arguments[0] instanceof Object) && !Array.isArray(arguments[0])) {\n _requireFunc_config(arguments[0]);\n return;\n }\n if (typeof arguments[0] === 'string') {\n return moduleManager.synchronousRequire(arguments[0]);\n }\n }\n if (arguments.length === 2 || arguments.length === 3) {\n if (Array.isArray(arguments[0])) {\n moduleManager.defineModule(AMDLoader.Utilities.generateAnonymousModule(), arguments[0], arguments[1], arguments[2], null);\n return;\n }\n }\n throw new Error('Unrecognized require call');\n };\n RequireFunc.config = _requireFunc_config;\n RequireFunc.getConfig = function () {\n return moduleManager.getConfig().getOptionsLiteral();\n };\n RequireFunc.reset = function () {\n moduleManager = moduleManager.reset();\n };\n RequireFunc.getBuildInfo = function () {\n return moduleManager.getBuildInfo();\n };\n RequireFunc.getStats = function () {\n return moduleManager.getLoaderEvents();\n };\n RequireFunc.define = function () {\n return DefineFunc.apply(null, arguments);\n };\n function init() {\n if (typeof AMDLoader.global.require !== 'undefined' || typeof require !== 'undefined') {\n var _nodeRequire_1 = (AMDLoader.global.require || require);\n if (typeof _nodeRequire_1 === 'function' && typeof _nodeRequire_1.resolve === 'function') {\n // re-expose node's require function\n var nodeRequire = function (what) {\n moduleManager.getRecorder().record(33 /* NodeBeginNativeRequire */, what);\n try {\n return _nodeRequire_1(what);\n }\n finally {\n moduleManager.getRecorder().record(34 /* NodeEndNativeRequire */, what);\n }\n };\n AMDLoader.global.nodeRequire = nodeRequire;\n RequireFunc.nodeRequire = nodeRequire;\n RequireFunc.__$__nodeRequire = nodeRequire;\n }\n }\n if (env.isNode && !env.isElectronRenderer) {\n module.exports = RequireFunc;\n require = RequireFunc;\n }\n else {\n if (!env.isElectronRenderer) {\n AMDLoader.global.define = DefineFunc;\n }\n AMDLoader.global.require = RequireFunc;\n }\n }\n AMDLoader.init = init;\n if (typeof AMDLoader.global.define !== 'function' || !AMDLoader.global.define.amd) {\n moduleManager = new AMDLoader.ModuleManager(env, AMDLoader.createScriptLoader(env), DefineFunc, RequireFunc, AMDLoader.Utilities.getHighPerformanceTimestamp());\n // The global variable require can configure the loader\n if (typeof AMDLoader.global.require !== 'undefined' && typeof AMDLoader.global.require !== 'function') {\n RequireFunc.config(AMDLoader.global.require);\n }\n // This define is for the local closure defined in node in the case that the loader is concatenated\n define = function () {\n return DefineFunc.apply(null, arguments);\n };\n define.amd = DefineFunc.amd;\n if (typeof doNotInitLoader === 'undefined') {\n init();\n }\n }\n})(AMDLoader || (AMDLoader = {}));\n","\r\n\r\n/**\r\n * Returns the last element of an array.\r\n * @param array The array.\r\n * @param n Which element from the end (default is zero).\r\n */\r\nexport function tail<T>(array: ArrayLike<T>, n: number = 0): T {\r\n\treturn array[array.length - (1 + n)];\r\n}\r\n\r\nexport function tail2<T>(arr: T[]): [T[], T] {\r\n\tif (arr.length === 0) {\r\n\t\tthrow new Error('Invalid tail call');\r\n\t}\r\n\r\n\treturn [arr.slice(0, arr.length - 1), arr[arr.length - 1]];\r\n}\r\n\r\nexport function equals<T>(one: ReadonlyArray<T> | undefined, other: ReadonlyArray<T> | undefined, itemEquals: (a: T, b: T) => boolean = (a, b) => a === b): boolean {\r\n\tif (one === other) {\r\n\t\treturn true;\r\n\t}\r\n\r\n\tif (!one || !other) {\r\n\t\treturn false;\r\n\t}\r\n\r\n\tif (one.length !== other.length) {\r\n\t\treturn false;\r\n\t}\r\n\r\n\tfor (let i = 0, len = one.length; i < len; i++) {\r\n\t\tif (!itemEquals(one[i], other[i])) {\r\n\t\t\treturn false;\r\n\t\t}\r\n\t}\r\n\r\n\treturn true;\r\n}\r\n\r\nexport function binarySearch<T>(array: ReadonlyArray<T>, key: T, comparator: (op1: T, op2: T) => number): number {\r\n\tlet low = 0,\r\n\t\thigh = array.length - 1;\r\n\r\n\twhile (low <= high) {\r\n\t\tconst mid = ((low + high) / 2) | 0;\r\n\t\tconst comp = comparator(array[mid], key);\r\n\t\tif (comp < 0) {\r\n\t\t\tlow = mid + 1;\r\n\t\t} else if (comp > 0) {\r\n\t\t\thigh = mid - 1;\r\n\t\t} else {\r\n\t\t\treturn mid;\r\n\t\t}\r\n\t}\r\n\treturn -(low + 1);\r\n}\r\n\r\n/**\r\n * Takes a sorted array and a function p. The array is sorted in such a way that all elements where p(x) is false\r\n * are located before all elements where p(x) is true.\r\n * @returns the least x for which p(x) is true or array.length if no element fullfills the given function.\r\n */\r\nexport function findFirstInSorted<T>(array: ReadonlyArray<T>, p: (x: T) => boolean): number {\r\n\tlet low = 0, high = array.length;\r\n\tif (high === 0) {\r\n\t\treturn 0; // no children\r\n\t}\r\n\twhile (low < high) {\r\n\t\tconst mid = Math.floor((low + high) / 2);\r\n\t\tif (p(array[mid])) {\r\n\t\t\thigh = mid;\r\n\t\t} else {\r\n\t\t\tlow = mid + 1;\r\n\t\t}\r\n\t}\r\n\treturn low;\r\n}\r\n\r\ntype Compare<T> = (a: T, b: T) => number;\r\n\r\n/**\r\n * Like `Array#sort` but always stable. Usually runs a little slower `than Array#sort`\r\n * so only use this when actually needing stable sort.\r\n */\r\nexport function mergeSort<T>(data: T[], compare: Compare<T>): T[] {\r\n\t_sort(data, compare, 0, data.length - 1, []);\r\n\treturn data;\r\n}\r\n\r\nfunction _merge<T>(a: T[], compare: Compare<T>, lo: number, mid: number, hi: number, aux: T[]): void {\r\n\tlet leftIdx = lo, rightIdx = mid + 1;\r\n\tfor (let i = lo; i <= hi; i++) {\r\n\t\taux[i] = a[i];\r\n\t}\r\n\tfor (let i = lo; i <= hi; i++) {\r\n\t\tif (leftIdx > mid) {\r\n\t\t\t// left side consumed\r\n\t\t\ta[i] = aux[rightIdx++];\r\n\t\t} else if (rightIdx > hi) {\r\n\t\t\t// right side consumed\r\n\t\t\ta[i] = aux[leftIdx++];\r\n\t\t} else if (compare(aux[rightIdx], aux[leftIdx]) < 0) {\r\n\t\t\t// right element is less -> comes first\r\n\t\t\ta[i] = aux[rightIdx++];\r\n\t\t} else {\r\n\t\t\t// left element comes first (less or equal)\r\n\t\t\ta[i] = aux[leftIdx++];\r\n\t\t}\r\n\t}\r\n}\r\n\r\nfunction _sort<T>(a: T[], compare: Compare<T>, lo: number, hi: number, aux: T[]) {\r\n\tif (hi <= lo) {\r\n\t\treturn;\r\n\t}\r\n\tconst mid = lo + ((hi - lo) / 2) | 0;\r\n\t_sort(a, compare, lo, mid, aux);\r\n\t_sort(a, compare, mid + 1, hi, aux);\r\n\tif (compare(a[mid], a[mid + 1]) <= 0) {\r\n\t\t// left and right are sorted and if the last-left element is less\r\n\t\t// or equals than the first-right element there is nothing else\r\n\t\t// to do\r\n\t\treturn;\r\n\t}\r\n\t_merge(a, compare, lo, mid, hi, aux);\r\n}\r\n\r\n\r\nexport function groupBy<T>(data: ReadonlyArray<T>, compare: (a: T, b: T) => number): T[][] {\r\n\tconst result: T[][] = [];\r\n\tlet currentGroup: T[] | undefined = undefined;\r\n\tfor (const element of mergeSort(data.slice(0), compare)) {\r\n\t\tif (!currentGroup || compare(currentGroup[0], element) !== 0) {\r\n\t\t\tcurrentGroup = [element];\r\n\t\t\tresult.push(currentGroup);\r\n\t\t} else {\r\n\t\t\tcurrentGroup.push(element);\r\n\t\t}\r\n\t}\r\n\treturn result;\r\n}\r\n\r\n/**\r\n * @returns New array with all falsy values removed. The original array IS NOT modified.\r\n */\r\nexport function coalesce<T>(array: ReadonlyArray<T | undefined | null>): T[] {\r\n\treturn <T[]>array.filter(e => !!e);\r\n}\r\n\r\n/**\r\n * @returns false if the provided object is an array and not empty.\r\n */\r\nexport function isFalsyOrEmpty(obj: any): boolean {\r\n\treturn !Array.isArray(obj) || obj.length === 0;\r\n}\r\n\r\n/**\r\n * @returns True if the provided object is an array and has at least one element.\r\n */\r\nexport function isNonEmptyArray<T>(obj: T[] | undefined | null): obj is T[];\r\nexport function isNonEmptyArray<T>(obj: readonly T[] | undefined | null): obj is readonly T[];\r\nexport function isNonEmptyArray<T>(obj: T[] | readonly T[] | undefined | null): obj is T[] | readonly T[] {\r\n\treturn Array.isArray(obj) && obj.length > 0;\r\n}\r\n\r\n/**\r\n * Removes duplicates from the given array. The optional keyFn allows to specify\r\n * how elements are checked for equalness by returning a unique string for each.\r\n */\r\nexport function distinct<T>(array: ReadonlyArray<T>, keyFn?: (t: T) => string): T[] {\r\n\tif (!keyFn) {\r\n\t\treturn array.filter((element, position) => {\r\n\t\t\treturn array.indexOf(element) === position;\r\n\t\t});\r\n\t}\r\n\r\n\tconst seen: { [key: string]: boolean; } = Object.create(null);\r\n\treturn array.filter((elem) => {\r\n\t\tconst key = keyFn(elem);\r\n\t\tif (seen[key]) {\r\n\t\t\treturn false;\r\n\t\t}\r\n\r\n\t\tseen[key] = true;\r\n\r\n\t\treturn true;\r\n\t});\r\n}\r\n\r\nexport function distinctES6<T>(array: ReadonlyArray<T>): T[] {\r\n\tconst seen = new Set<T>();\r\n\treturn array.filter(element => {\r\n\t\tif (seen.has(element)) {\r\n\t\t\treturn false;\r\n\t\t}\r\n\r\n\t\tseen.add(element);\r\n\t\treturn true;\r\n\t});\r\n}\r\n\r\n/**\r\n * @deprecated ES6: use `Array.findIndex`\r\n */\r\nexport function firstIndex<T>(array: ReadonlyArray<T>, fn: (item: T) => boolean): number {\r\n\tfor (let i = 0; i < array.length; i++) {\r\n\t\tconst element = array[i];\r\n\r\n\t\tif (fn(element)) {\r\n\t\t\treturn i;\r\n\t\t}\r\n\t}\r\n\r\n\treturn -1;\r\n}\r\n\r\n\r\n/**\r\n * @deprecated ES6: use `Array.find`\r\n */\r\nexport function first<T>(array: ReadonlyArray<T>, fn: (item: T) => boolean, notFoundValue: T): T;\r\nexport function first<T>(array: ReadonlyArray<T>, fn: (item: T) => boolean): T | undefined;\r\nexport function first<T>(array: ReadonlyArray<T>, fn: (item: T) => boolean, notFoundValue: T | undefined = undefined): T | undefined {\r\n\tconst index = firstIndex(array, fn);\r\n\treturn index < 0 ? notFoundValue : array[index];\r\n}\r\n\r\nexport function firstOrDefault<T, NotFound = T>(array: ReadonlyArray<T>, notFoundValue: NotFound): T | NotFound;\r\nexport function firstOrDefault<T>(array: ReadonlyArray<T>): T | undefined;\r\nexport function firstOrDefault<T, NotFound = T>(array: ReadonlyArray<T>, notFoundValue?: NotFound): T | NotFound | undefined {\r\n\treturn array.length > 0 ? array[0] : notFoundValue;\r\n}\r\n\r\nexport function flatten<T>(arr: T[][]): T[] {\r\n\treturn (<T[]>[]).concat(...arr);\r\n}\r\n\r\nexport function range(to: number): number[];\r\nexport function range(from: number, to: number): number[];\r\nexport function range(arg: number, to?: number): number[] {\r\n\tlet from = typeof to === 'number' ? arg : 0;\r\n\r\n\tif (typeof to === 'number') {\r\n\t\tfrom = arg;\r\n\t} else {\r\n\t\tfrom = 0;\r\n\t\tto = arg;\r\n\t}\r\n\r\n\tconst result: number[] = [];\r\n\r\n\tif (from <= to) {\r\n\t\tfor (let i = from; i < to; i++) {\r\n\t\t\tresult.push(i);\r\n\t\t}\r\n\t} else {\r\n\t\tfor (let i = from; i > to; i--) {\r\n\t\t\tresult.push(i);\r\n\t\t}\r\n\t}\r\n\r\n\treturn result;\r\n}\r\n\r\n/**\r\n * Insert `insertArr` inside `target` at `insertIndex`.\r\n * Please don't touch unless you understand https://jsperf.com/inserting-an-array-within-an-array\r\n */\r\nexport function arrayInsert<T>(target: T[], insertIndex: number, insertArr: T[]): T[] {\r\n\tconst before = target.slice(0, insertIndex);\r\n\tconst after = target.slice(insertIndex);\r\n\treturn before.concat(insertArr, after);\r\n}\r\n\r\n/**\r\n * Pushes an element to the start of the array, if found.\r\n */\r\nexport function pushToStart<T>(arr: T[], value: T): void {\r\n\tconst index = arr.indexOf(value);\r\n\r\n\tif (index > -1) {\r\n\t\tarr.splice(index, 1);\r\n\t\tarr.unshift(value);\r\n\t}\r\n}\r\n\r\n/**\r\n * Pushes an element to the end of the array, if found.\r\n */\r\nexport function pushToEnd<T>(arr: T[], value: T): void {\r\n\tconst index = arr.indexOf(value);\r\n\r\n\tif (index > -1) {\r\n\t\tarr.splice(index, 1);\r\n\t\tarr.push(value);\r\n\t}\r\n}\r\n\r\nexport function asArray<T>(x: T | T[]): T[] {\r\n\treturn Array.isArray(x) ? x : [x];\r\n}\r\n","/*---------------------------------------------------------------------------------------------\r\n * Copyright (c) Microsoft Corporation. All rights reserved.\r\n * Licensed under the MIT License. See License.txt in the project root for license information.\r\n *--------------------------------------------------------------------------------------------*/\r\n\r\n/**\r\n * Represents information about a specific difference between two sequences.\r\n */\r\nexport class DiffChange {\r\n\r\n\t/**\r\n\t * The position of the first element in the original sequence which\r\n\t * this change affects.\r\n\t */\r\n\tpublic originalStart: number;\r\n\r\n\t/**\r\n\t * The number of elements from the original sequence which were\r\n\t * affected.\r\n\t */\r\n\tpublic originalLength: number;\r\n\r\n\t/**\r\n\t * The position of the first element in the modified sequence which\r\n\t * this change affects.\r\n\t */\r\n\tpublic modifiedStart: number;\r\n\r\n\t/**\r\n\t * The number of elements from the modified sequence which were\r\n\t * affected (added).\r\n\t */\r\n\tpublic modifiedLength: number;\r\n\r\n\t/**\r\n\t * Constructs a new DiffChange with the given sequence information\r\n\t * and content.\r\n\t */\r\n\tconstructor(originalStart: number, originalLength: number, modifiedStart: number, modifiedLength: number) {\r\n\t\t//Debug.Assert(originalLength > 0 || modifiedLength > 0, \"originalLength and modifiedLength cannot both be <= 0\");\r\n\t\tthis.originalStart = originalStart;\r\n\t\tthis.originalLength = originalLength;\r\n\t\tthis.modifiedStart = modifiedStart;\r\n\t\tthis.modifiedLength = modifiedLength;\r\n\t}\r\n\r\n\t/**\r\n\t * The end point (exclusive) of the change in the original sequence.\r\n\t */\r\n\tpublic getOriginalEnd() {\r\n\t\treturn this.originalStart + this.originalLength;\r\n\t}\r\n\r\n\t/**\r\n\t * The end point (exclusive) of the change in the modified sequence.\r\n\t */\r\n\tpublic getModifiedEnd() {\r\n\t\treturn this.modifiedStart + this.modifiedLength;\r\n\t}\r\n}\r\n","/*---------------------------------------------------------------------------------------------\r\n * Copyright (c) Microsoft Corporation. All rights reserved.\r\n * Licensed under the MIT License. See License.txt in the project root for license information.\r\n *--------------------------------------------------------------------------------------------*/\r\n\r\nexport interface ErrorListenerCallback {\r\n\t(error: any): void;\r\n}\r\n\r\n// Avoid circular dependency on EventEmitter by implementing a subset of the interface.\r\nexport class ErrorHandler {\r\n\tprivate unexpectedErrorHandler: (e: any) => void;\r\n\tprivate listeners: ErrorListenerCallback[];\r\n\r\n\tconstructor() {\r\n\r\n\t\tthis.listeners = [];\r\n\r\n\t\tthis.unexpectedErrorHandler = function (e: any) {\r\n\t\t\tsetTimeout(() => {\r\n\t\t\t\tif (e.stack) {\r\n\t\t\t\t\tthrow new Error(e.message + '\\n\\n' + e.stack);\r\n\t\t\t\t}\r\n\r\n\t\t\t\tthrow e;\r\n\t\t\t}, 0);\r\n\t\t};\r\n\t}\r\n\r\n\tprivate emit(e: any): void {\r\n\t\tthis.listeners.forEach((listener) => {\r\n\t\t\tlistener(e);\r\n\t\t});\r\n\t}\r\n\r\n\tonUnexpectedError(e: any): void {\r\n\t\tthis.unexpectedErrorHandler(e);\r\n\t\tthis.emit(e);\r\n\t}\r\n\r\n\t// For external errors, we don't want the listeners to be called\r\n\tonUnexpectedExternalError(e: any): void {\r\n\t\tthis.unexpectedErrorHandler(e);\r\n\t}\r\n}\r\n\r\nexport const errorHandler = new ErrorHandler();\r\n\r\nexport function onUnexpectedError(e: any): undefined {\r\n\t// ignore errors from cancelled promises\r\n\tif (!isPromiseCanceledError(e)) {\r\n\t\terrorHandler.onUnexpectedError(e);\r\n\t}\r\n\treturn undefined;\r\n}\r\n\r\nexport function onUnexpectedExternalError(e: any): undefined {\r\n\t// ignore errors from cancelled promises\r\n\tif (!isPromiseCanceledError(e)) {\r\n\t\terrorHandler.onUnexpectedExternalError(e);\r\n\t}\r\n\treturn undefined;\r\n}\r\n\r\nexport interface SerializedError {\r\n}\r\n\r\nexport function transformErrorForSerialization(error: Error): SerializedError;\r\nexport function transformErrorForSerialization(error: any): any;\r\nexport function transformErrorForSerialization(error: any): any {\r\n\tif (error instanceof Error) {\r\n\t\tlet { name, message } = error;\r\n\t\tconst stack: string = (<any>error).stacktrace || (<any>error).stack;\r\n\t\treturn {\r\n\t\t\t$isError: true,\r\n\t\t\tname,\r\n\t\t\tmessage,\r\n\t\t\tstack\r\n\t\t};\r\n\t}\r\n\r\n\t// return as is\r\n\treturn error;\r\n}\r\n\r\nconst canceledName = 'Canceled';\r\n\r\n/**\r\n * Checks if the given error is a promise in canceled state\r\n */\r\nexport function isPromiseCanceledError(error: any): boolean {\r\n\treturn error instanceof Error && error.name === canceledName && error.message === canceledName;\r\n}\r\n\r\n/**\r\n * Returns an error that signals cancellation.\r\n */\r\nexport function canceled(): Error {\r\n\tconst error = new Error(canceledName);\r\n\terror.name = error.message;\r\n\treturn error;\r\n}\r\n\r\nexport function illegalArgument(name?: string): Error {\r\n\tif (name) {\r\n\t\treturn new Error(`Illegal argument: ${name}`);\r\n\t} else {\r\n\t\treturn new Error('Illegal argument');\r\n\t}\r\n}\r\n\r\nexport function illegalState(name?: string): Error {\r\n\tif (name) {\r\n\t\treturn new Error(`Illegal state: ${name}`);\r\n\t} else {\r\n\t\treturn new Error('Illegal state');\r\n\t}\r\n}\r\n","/*---------------------------------------------------------------------------------------------\r\n * Copyright (c) Microsoft Corporation. All rights reserved.\r\n * Licensed under the MIT License. See License.txt in the project root for license information.\r\n *--------------------------------------------------------------------------------------------*/\r\n\r\nexport namespace Iterable {\r\n\r\n\texport function is<T = any>(thing: any): thing is IterableIterator<T> {\r\n\t\treturn thing && typeof thing === 'object' && typeof thing[Symbol.iterator] === 'function';\r\n\t}\r\n\r\n\tconst _empty: Iterable<any> = Object.freeze([]);\r\n\texport function empty<T = any>(): Iterable<T> {\r\n\t\treturn _empty;\r\n\t}\r\n\r\n\texport function* single<T>(element: T): Iterable<T> {\r\n\t\tyield element;\r\n\t}\r\n\r\n\texport function from<T>(iterable: Iterable<T> | undefined | null): Iterable<T> {\r\n\t\treturn iterable || _empty;\r\n\t}\r\n\r\n\texport function first<T>(iterable: Iterable<T>): T | undefined {\r\n\t\treturn iterable[Symbol.iterator]().next().value;\r\n\t}\r\n\r\n\texport function some<T>(iterable: Iterable<T>, predicate: (t: T) => boolean): boolean {\r\n\t\tfor (const element of iterable) {\r\n\t\t\tif (predicate(element)) {\r\n\t\t\t\treturn true;\r\n\t\t\t}\r\n\t\t}\r\n\t\treturn false;\r\n\t}\r\n\r\n\texport function* filter<T>(iterable: Iterable<T>, predicate: (t: T) => boolean): Iterable<T> {\r\n\t\tfor (const element of iterable) {\r\n\t\t\tif (predicate(element)) {\r\n\t\t\t\tyield element;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\texport function* map<T, R>(iterable: Iterable<T>, fn: (t: T) => R): Iterable<R> {\r\n\t\tfor (const element of iterable) {\r\n\t\t\tyield fn(element);\r\n\t\t}\r\n\t}\r\n\r\n\texport function* concat<T>(...iterables: Iterable<T>[]): Iterable<T> {\r\n\t\tfor (const iterable of iterables) {\r\n\t\t\tfor (const element of iterable) {\r\n\t\t\t\tyield element;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\t/**\r\n\t * Consumes `atMost` elements from iterable and returns the consumed elements,\r\n\t * and an iterable for the rest of the elements.\r\n\t */\r\n\texport function consume<T>(iterable: Iterable<T>, atMost: number = Number.POSITIVE_INFINITY): [T[], Iterable<T>] {\r\n\t\tconst consumed: T[] = [];\r\n\r\n\t\tif (atMost === 0) {\r\n\t\t\treturn [consumed, iterable];\r\n\t\t}\r\n\r\n\t\tconst iterator = iterable[Symbol.iterator]();\r\n\r\n\t\tfor (let i = 0; i < atMost; i++) {\r\n\t\t\tconst next = iterator.next();\r\n\r\n\t\t\tif (next.done) {\r\n\t\t\t\treturn [consumed, Iterable.empty()];\r\n\t\t\t}\r\n\r\n\t\t\tconsumed.push(next.value);\r\n\t\t}\r\n\r\n\t\treturn [consumed, { [Symbol.iterator]() { return iterator; } }];\r\n\t}\r\n}\r\n","/*---------------------------------------------------------------------------------------------\r\n * Copyright (c) Microsoft Corporation. All rights reserved.\r\n * Licensed under the MIT License. See License.txt in the project root for license information.\r\n *--------------------------------------------------------------------------------------------*/\r\n\r\nimport { OperatingSystem } from 'vs/base/common/platform';\r\nimport { illegalArgument } from 'vs/base/common/errors';\r\n\r\n/**\r\n * Virtual Key Codes, the value does not hold any inherent meaning.\r\n * Inspired somewhat from https://msdn.microsoft.com/en-us/library/windows/desktop/dd375731(v=vs.85).aspx\r\n * But these are \"more general\", as they should work across browsers & OS`s.\r\n */\r\nexport const enum KeyCode {\r\n\t/**\r\n\t * Placed first to cover the 0 value of the enum.\r\n\t */\r\n\tUnknown = 0,\r\n\r\n\tBackspace = 1,\r\n\tTab = 2,\r\n\tEnter = 3,\r\n\tShift = 4,\r\n\tCtrl = 5,\r\n\tAlt = 6,\r\n\tPauseBreak = 7,\r\n\tCapsLock = 8,\r\n\tEscape = 9,\r\n\tSpace = 10,\r\n\tPageUp = 11,\r\n\tPageDown = 12,\r\n\tEnd = 13,\r\n\tHome = 14,\r\n\tLeftArrow = 15,\r\n\tUpArrow = 16,\r\n\tRightArrow = 17,\r\n\tDownArrow = 18,\r\n\tInsert = 19,\r\n\tDelete = 20,\r\n\r\n\tKEY_0 = 21,\r\n\tKEY_1 = 22,\r\n\tKEY_2 = 23,\r\n\tKEY_3 = 24,\r\n\tKEY_4 = 25,\r\n\tKEY_5 = 26,\r\n\tKEY_6 = 27,\r\n\tKEY_7 = 28,\r\n\tKEY_8 = 29,\r\n\tKEY_9 = 30,\r\n\r\n\tKEY_A = 31,\r\n\tKEY_B = 32,\r\n\tKEY_C = 33,\r\n\tKEY_D = 34,\r\n\tKEY_E = 35,\r\n\tKEY_F = 36,\r\n\tKEY_G = 37,\r\n\tKEY_H = 38,\r\n\tKEY_I = 39,\r\n\tKEY_J = 40,\r\n\tKEY_K = 41,\r\n\tKEY_L = 42,\r\n\tKEY_M = 43,\r\n\tKEY_N = 44,\r\n\tKEY_O = 45,\r\n\tKEY_P = 46,\r\n\tKEY_Q = 47,\r\n\tKEY_R = 48,\r\n\tKEY_S = 49,\r\n\tKEY_T = 50,\r\n\tKEY_U = 51,\r\n\tKEY_V = 52,\r\n\tKEY_W = 53,\r\n\tKEY_X = 54,\r\n\tKEY_Y = 55,\r\n\tKEY_Z = 56,\r\n\r\n\tMeta = 57,\r\n\tContextMenu = 58,\r\n\r\n\tF1 = 59,\r\n\tF2 = 60,\r\n\tF3 = 61,\r\n\tF4 = 62,\r\n\tF5 = 63,\r\n\tF6 = 64,\r\n\tF7 = 65,\r\n\tF8 = 66,\r\n\tF9 = 67,\r\n\tF10 = 68,\r\n\tF11 = 69,\r\n\tF12 = 70,\r\n\tF13 = 71,\r\n\tF14 = 72,\r\n\tF15 = 73,\r\n\tF16 = 74,\r\n\tF17 = 75,\r\n\tF18 = 76,\r\n\tF19 = 77,\r\n\r\n\tNumLock = 78,\r\n\tScrollLock = 79,\r\n\r\n\t/**\r\n\t * Used for miscellaneous characters; it can vary by keyboard.\r\n\t * For the US standard keyboard, the ';:' key\r\n\t */\r\n\tUS_SEMICOLON = 80,\r\n\t/**\r\n\t * For any country/region, the '+' key\r\n\t * For the US standard keyboard, the '=+' key\r\n\t */\r\n\tUS_EQUAL = 81,\r\n\t/**\r\n\t * For any country/region, the ',' key\r\n\t * For the US standard keyboard, the ',<' key\r\n\t */\r\n\tUS_COMMA = 82,\r\n\t/**\r\n\t * For any country/region, the '-' key\r\n\t * For the US standard keyboard, the '-_' key\r\n\t */\r\n\tUS_MINUS = 83,\r\n\t/**\r\n\t * For any country/region, the '.' key\r\n\t * For the US standard keyboard, the '.>' key\r\n\t */\r\n\tUS_DOT = 84,\r\n\t/**\r\n\t * Used for miscellaneous characters; it can vary by keyboard.\r\n\t * For the US standard keyboard, the '/?' key\r\n\t */\r\n\tUS_SLASH = 85,\r\n\t/**\r\n\t * Used for miscellaneous characters; it can vary by keyboard.\r\n\t * For the US standard keyboard, the '`~' key\r\n\t */\r\n\tUS_BACKTICK = 86,\r\n\t/**\r\n\t * Used for miscellaneous characters; it can vary by keyboard.\r\n\t * For the US standard keyboard, the '[{' key\r\n\t */\r\n\tUS_OPEN_SQUARE_BRACKET = 87,\r\n\t/**\r\n\t * Used for miscellaneous characters; it can vary by keyboard.\r\n\t * For the US standard keyboard, the '\\|' key\r\n\t */\r\n\tUS_BACKSLASH = 88,\r\n\t/**\r\n\t * Used for miscellaneous characters; it can vary by keyboard.\r\n\t * For the US standard keyboard, the ']}' key\r\n\t */\r\n\tUS_CLOSE_SQUARE_BRACKET = 89,\r\n\t/**\r\n\t * Used for miscellaneous characters; it can vary by keyboard.\r\n\t * For the US standard keyboard, the ''\"' key\r\n\t */\r\n\tUS_QUOTE = 90,\r\n\t/**\r\n\t * Used for miscellaneous characters; it can vary by keyboard.\r\n\t */\r\n\tOEM_8 = 91,\r\n\t/**\r\n\t * Either the angle bracket key or the backslash key on the RT 102-key keyboard.\r\n\t */\r\n\tOEM_102 = 92,\r\n\r\n\tNUMPAD_0 = 93, // VK_NUMPAD0, 0x60, Numeric keypad 0 key\r\n\tNUMPAD_1 = 94, // VK_NUMPAD1, 0x61, Numeric keypad 1 key\r\n\tNUMPAD_2 = 95, // VK_NUMPAD2, 0x62, Numeric keypad 2 key\r\n\tNUMPAD_3 = 96, // VK_NUMPAD3, 0x63, Numeric keypad 3 key\r\n\tNUMPAD_4 = 97, // VK_NUMPAD4, 0x64, Numeric keypad 4 key\r\n\tNUMPAD_5 = 98, // VK_NUMPAD5, 0x65, Numeric keypad 5 key\r\n\tNUMPAD_6 = 99, // VK_NUMPAD6, 0x66, Numeric keypad 6 key\r\n\tNUMPAD_7 = 100, // VK_NUMPAD7, 0x67, Numeric keypad 7 key\r\n\tNUMPAD_8 = 101, // VK_NUMPAD8, 0x68, Numeric keypad 8 key\r\n\tNUMPAD_9 = 102, // VK_NUMPAD9, 0x69, Numeric keypad 9 key\r\n\r\n\tNUMPAD_MULTIPLY = 103,\t// VK_MULTIPLY, 0x6A, Multiply key\r\n\tNUMPAD_ADD = 104,\t\t// VK_ADD, 0x6B, Add key\r\n\tNUMPAD_SEPARATOR = 105,\t// VK_SEPARATOR, 0x6C, Separator key\r\n\tNUMPAD_SUBTRACT = 106,\t// VK_SUBTRACT, 0x6D, Subtract key\r\n\tNUMPAD_DECIMAL = 107,\t// VK_DECIMAL, 0x6E, Decimal key\r\n\tNUMPAD_DIVIDE = 108,\t// VK_DIVIDE, 0x6F,\r\n\r\n\t/**\r\n\t * Cover all key codes when IME is processing input.\r\n\t */\r\n\tKEY_IN_COMPOSITION = 109,\r\n\r\n\tABNT_C1 = 110, // Brazilian (ABNT) Keyboard\r\n\tABNT_C2 = 111, // Brazilian (ABNT) Keyboard\r\n\r\n\t/**\r\n\t * Placed last to cover the length of the enum.\r\n\t * Please do not depend on this value!\r\n\t */\r\n\tMAX_VALUE\r\n}\r\n\r\nclass KeyCodeStrMap {\r\n\r\n\tprivate _keyCodeToStr: string[];\r\n\tprivate _strToKeyCode: { [str: string]: KeyCode; };\r\n\r\n\tconstructor() {\r\n\t\tthis._keyCodeToStr = [];\r\n\t\tthis._strToKeyCode = Object.create(null);\r\n\t}\r\n\r\n\tdefine(keyCode: KeyCode, str: string): void {\r\n\t\tthis._keyCodeToStr[keyCode] = str;\r\n\t\tthis._strToKeyCode[str.toLowerCase()] = keyCode;\r\n\t}\r\n\r\n\tkeyCodeToStr(keyCode: KeyCode): string {\r\n\t\treturn this._keyCodeToStr[keyCode];\r\n\t}\r\n\r\n\tstrToKeyCode(str: string): KeyCode {\r\n\t\treturn this._strToKeyCode[str.toLowerCase()] || KeyCode.Unknown;\r\n\t}\r\n}\r\n\r\nconst uiMap = new KeyCodeStrMap();\r\nconst userSettingsUSMap = new KeyCodeStrMap();\r\nconst userSettingsGeneralMap = new KeyCodeStrMap();\r\n\r\n(function () {\r\n\r\n\tfunction define(keyCode: KeyCode, uiLabel: string, usUserSettingsLabel: string = uiLabel, generalUserSettingsLabel: string = usUserSettingsLabel): void {\r\n\t\tuiMap.define(keyCode, uiLabel);\r\n\t\tuserSettingsUSMap.define(keyCode, usUserSettingsLabel);\r\n\t\tuserSettingsGeneralMap.define(keyCode, generalUserSettingsLabel);\r\n\t}\r\n\r\n\tdefine(KeyCode.Unknown, 'unknown');\r\n\r\n\tdefine(KeyCode.Backspace, 'Backspace');\r\n\tdefine(KeyCode.Tab, 'Tab');\r\n\tdefine(KeyCode.Enter, 'Enter');\r\n\tdefine(KeyCode.Shift, 'Shift');\r\n\tdefine(KeyCode.Ctrl, 'Ctrl');\r\n\tdefine(KeyCode.Alt, 'Alt');\r\n\tdefine(KeyCode.PauseBreak, 'PauseBreak');\r\n\tdefine(KeyCode.CapsLock, 'CapsLock');\r\n\tdefine(KeyCode.Escape, 'Escape');\r\n\tdefine(KeyCode.Space, 'Space');\r\n\tdefine(KeyCode.PageUp, 'PageUp');\r\n\tdefine(KeyCode.PageDown, 'PageDown');\r\n\tdefine(KeyCode.End, 'End');\r\n\tdefine(KeyCode.Home, 'Home');\r\n\r\n\tdefine(KeyCode.LeftArrow, 'LeftArrow', 'Left');\r\n\tdefine(KeyCode.UpArrow, 'UpArrow', 'Up');\r\n\tdefine(KeyCode.RightArrow, 'RightArrow', 'Right');\r\n\tdefine(KeyCode.DownArrow, 'DownArrow', 'Down');\r\n\tdefine(KeyCode.Insert, 'Insert');\r\n\tdefine(KeyCode.Delete, 'Delete');\r\n\r\n\tdefine(KeyCode.KEY_0, '0');\r\n\tdefine(KeyCode.KEY_1, '1');\r\n\tdefine(KeyCode.KEY_2, '2');\r\n\tdefine(KeyCode.KEY_3, '3');\r\n\tdefine(KeyCode.KEY_4, '4');\r\n\tdefine(KeyCode.KEY_5, '5');\r\n\tdefine(KeyCode.KEY_6, '6');\r\n\tdefine(KeyCode.KEY_7, '7');\r\n\tdefine(KeyCode.KEY_8, '8');\r\n\tdefine(KeyCode.KEY_9, '9');\r\n\r\n\tdefine(KeyCode.KEY_A, 'A');\r\n\tdefine(KeyCode.KEY_B, 'B');\r\n\tdefine(KeyCode.KEY_C, 'C');\r\n\tdefine(KeyCode.KEY_D, 'D');\r\n\tdefine(KeyCode.KEY_E, 'E');\r\n\tdefine(KeyCode.KEY_F, 'F');\r\n\tdefine(KeyCode.KEY_G, 'G');\r\n\tdefine(KeyCode.KEY_H, 'H');\r\n\tdefine(KeyCode.KEY_I, 'I');\r\n\tdefine(KeyCode.KEY_J, 'J');\r\n\tdefine(KeyCode.KEY_K, 'K');\r\n\tdefine(KeyCode.KEY_L, 'L');\r\n\tdefine(KeyCode.KEY_M, 'M');\r\n\tdefine(KeyCode.KEY_N, 'N');\r\n\tdefine(KeyCode.KEY_O, 'O');\r\n\tdefine(KeyCode.KEY_P, 'P');\r\n\tdefine(KeyCode.KEY_Q, 'Q');\r\n\tdefine(KeyCode.KEY_R, 'R');\r\n\tdefine(KeyCode.KEY_S, 'S');\r\n\tdefine(KeyCode.KEY_T, 'T');\r\n\tdefine(KeyCode.KEY_U, 'U');\r\n\tdefine(KeyCode.KEY_V, 'V');\r\n\tdefine(KeyCode.KEY_W, 'W');\r\n\tdefine(KeyCode.KEY_X, 'X');\r\n\tdefine(KeyCode.KEY_Y, 'Y');\r\n\tdefine(KeyCode.KEY_Z, 'Z');\r\n\r\n\tdefine(KeyCode.Meta, 'Meta');\r\n\tdefine(KeyCode.ContextMenu, 'ContextMenu');\r\n\r\n\tdefine(KeyCode.F1, 'F1');\r\n\tdefine(KeyCode.F2, 'F2');\r\n\tdefine(KeyCode.F3, 'F3');\r\n\tdefine(KeyCode.F4, 'F4');\r\n\tdefine(KeyCode.F5, 'F5');\r\n\tdefine(KeyCode.F6, 'F6');\r\n\tdefine(KeyCode.F7, 'F7');\r\n\tdefine(KeyCode.F8, 'F8');\r\n\tdefine(KeyCode.F9, 'F9');\r\n\tdefine(KeyCode.F10, 'F10');\r\n\tdefine(KeyCode.F11, 'F11');\r\n\tdefine(KeyCode.F12, 'F12');\r\n\tdefine(KeyCode.F13, 'F13');\r\n\tdefine(KeyCode.F14, 'F14');\r\n\tdefine(KeyCode.F15, 'F15');\r\n\tdefine(KeyCode.F16, 'F16');\r\n\tdefine(KeyCode.F17, 'F17');\r\n\tdefine(KeyCode.F18, 'F18');\r\n\tdefine(KeyCode.F19, 'F19');\r\n\r\n\tdefine(KeyCode.NumLock, 'NumLock');\r\n\tdefine(KeyCode.ScrollLock, 'ScrollLock');\r\n\r\n\tdefine(KeyCode.US_SEMICOLON, ';', ';', 'OEM_1');\r\n\tdefine(KeyCode.US_EQUAL, '=', '=', 'OEM_PLUS');\r\n\tdefine(KeyCode.US_COMMA, ',', ',', 'OEM_COMMA');\r\n\tdefine(KeyCode.US_MINUS, '-', '-', 'OEM_MINUS');\r\n\tdefine(KeyCode.US_DOT, '.', '.', 'OEM_PERIOD');\r\n\tdefine(KeyCode.US_SLASH, '/', '/', 'OEM_2');\r\n\tdefine(KeyCode.US_BACKTICK, '`', '`', 'OEM_3');\r\n\tdefine(KeyCode.ABNT_C1, 'ABNT_C1');\r\n\tdefine(KeyCode.ABNT_C2, 'ABNT_C2');\r\n\tdefine(KeyCode.US_OPEN_SQUARE_BRACKET, '[', '[', 'OEM_4');\r\n\tdefine(KeyCode.US_BACKSLASH, '\\\\', '\\\\', 'OEM_5');\r\n\tdefine(KeyCode.US_CLOSE_SQUARE_BRACKET, ']', ']', 'OEM_6');\r\n\tdefine(KeyCode.US_QUOTE, '\\'', '\\'', 'OEM_7');\r\n\tdefine(KeyCode.OEM_8, 'OEM_8');\r\n\tdefine(KeyCode.OEM_102, 'OEM_102');\r\n\r\n\tdefine(KeyCode.NUMPAD_0, 'NumPad0');\r\n\tdefine(KeyCode.NUMPAD_1, 'NumPad1');\r\n\tdefine(KeyCode.NUMPAD_2, 'NumPad2');\r\n\tdefine(KeyCode.NUMPAD_3, 'NumPad3');\r\n\tdefine(KeyCode.NUMPAD_4, 'NumPad4');\r\n\tdefine(KeyCode.NUMPAD_5, 'NumPad5');\r\n\tdefine(KeyCode.NUMPAD_6, 'NumPad6');\r\n\tdefine(KeyCode.NUMPAD_7, 'NumPad7');\r\n\tdefine(KeyCode.NUMPAD_8, 'NumPad8');\r\n\tdefine(KeyCode.NUMPAD_9, 'NumPad9');\r\n\r\n\tdefine(KeyCode.NUMPAD_MULTIPLY, 'NumPad_Multiply');\r\n\tdefine(KeyCode.NUMPAD_ADD, 'NumPad_Add');\r\n\tdefine(KeyCode.NUMPAD_SEPARATOR, 'NumPad_Separator');\r\n\tdefine(KeyCode.NUMPAD_SUBTRACT, 'NumPad_Subtract');\r\n\tdefine(KeyCode.NUMPAD_DECIMAL, 'NumPad_Decimal');\r\n\tdefine(KeyCode.NUMPAD_DIVIDE, 'NumPad_Divide');\r\n\r\n})();\r\n\r\nexport namespace KeyCodeUtils {\r\n\texport function toString(keyCode: KeyCode): string {\r\n\t\treturn uiMap.keyCodeToStr(keyCode);\r\n\t}\r\n\texport function fromString(key: string): KeyCode {\r\n\t\treturn uiMap.strToKeyCode(key);\r\n\t}\r\n\r\n\texport function toUserSettingsUS(keyCode: KeyCode): string {\r\n\t\treturn userSettingsUSMap.keyCodeToStr(keyCode);\r\n\t}\r\n\texport function toUserSettingsGeneral(keyCode: KeyCode): string {\r\n\t\treturn userSettingsGeneralMap.keyCodeToStr(keyCode);\r\n\t}\r\n\texport function fromUserSettings(key: string): KeyCode {\r\n\t\treturn userSettingsUSMap.strToKeyCode(key) || userSettingsGeneralMap.strToKeyCode(key);\r\n\t}\r\n}\r\n\r\n/**\r\n * Binary encoding strategy:\r\n * ```\r\n * 1111 11\r\n * 5432 1098 7654 3210\r\n * ---- CSAW KKKK KKKK\r\n * C = bit 11 = ctrlCmd flag\r\n * S = bit 10 = shift flag\r\n * A = bit 9 = alt flag\r\n * W = bit 8 = winCtrl flag\r\n * K = bits 0-7 = key code\r\n * ```\r\n */\r\nconst enum BinaryKeybindingsMask {\r\n\tCtrlCmd = (1 << 11) >>> 0,\r\n\tShift = (1 << 10) >>> 0,\r\n\tAlt = (1 << 9) >>> 0,\r\n\tWinCtrl = (1 << 8) >>> 0,\r\n\tKeyCode = 0x000000FF\r\n}\r\n\r\nexport const enum KeyMod {\r\n\tCtrlCmd = (1 << 11) >>> 0,\r\n\tShift = (1 << 10) >>> 0,\r\n\tAlt = (1 << 9) >>> 0,\r\n\tWinCtrl = (1 << 8) >>> 0,\r\n}\r\n\r\nexport function KeyChord(firstPart: number, secondPart: number): number {\r\n\tconst chordPart = ((secondPart & 0x0000FFFF) << 16) >>> 0;\r\n\treturn (firstPart | chordPart) >>> 0;\r\n}\r\n\r\nexport function createKeybinding(keybinding: number, OS: OperatingSystem): Keybinding | null {\r\n\tif (keybinding === 0) {\r\n\t\treturn null;\r\n\t}\r\n\tconst firstPart = (keybinding & 0x0000FFFF) >>> 0;\r\n\tconst chordPart = (keybinding & 0xFFFF0000) >>> 16;\r\n\tif (chordPart !== 0) {\r\n\t\treturn new ChordKeybinding([\r\n\t\t\tcreateSimpleKeybinding(firstPart, OS),\r\n\t\t\tcreateSimpleKeybinding(chordPart, OS)\r\n\t\t]);\r\n\t}\r\n\treturn new ChordKeybinding([createSimpleKeybinding(firstPart, OS)]);\r\n}\r\n\r\nexport function createSimpleKeybinding(keybinding: number, OS: OperatingSystem): SimpleKeybinding {\r\n\r\n\tconst ctrlCmd = (keybinding & BinaryKeybindingsMask.CtrlCmd ? true : false);\r\n\tconst winCtrl = (keybinding & BinaryKeybindingsMask.WinCtrl ? true : false);\r\n\r\n\tconst ctrlKey = (OS === OperatingSystem.Macintosh ? winCtrl : ctrlCmd);\r\n\tconst shiftKey = (keybinding & BinaryKeybindingsMask.Shift ? true : false);\r\n\tconst altKey = (keybinding & BinaryKeybindingsMask.Alt ? true : false);\r\n\tconst metaKey = (OS === OperatingSystem.Macintosh ? ctrlCmd : winCtrl);\r\n\tconst keyCode = (keybinding & BinaryKeybindingsMask.KeyCode);\r\n\r\n\treturn new SimpleKeybinding(ctrlKey, shiftKey, altKey, metaKey, keyCode);\r\n}\r\n\r\nexport class SimpleKeybinding {\r\n\tpublic readonly ctrlKey: boolean;\r\n\tpublic readonly shiftKey: boolean;\r\n\tpublic readonly altKey: boolean;\r\n\tpublic readonly metaKey: boolean;\r\n\tpublic readonly keyCode: KeyCode;\r\n\r\n\tconstructor(ctrlKey: boolean, shiftKey: boolean, altKey: boolean, metaKey: boolean, keyCode: KeyCode) {\r\n\t\tthis.ctrlKey = ctrlKey;\r\n\t\tthis.shiftKey = shiftKey;\r\n\t\tthis.altKey = altKey;\r\n\t\tthis.metaKey = metaKey;\r\n\t\tthis.keyCode = keyCode;\r\n\t}\r\n\r\n\tpublic equals(other: SimpleKeybinding): boolean {\r\n\t\treturn (\r\n\t\t\tthis.ctrlKey === other.ctrlKey\r\n\t\t\t&& this.shiftKey === other.shiftKey\r\n\t\t\t&& this.altKey === other.altKey\r\n\t\t\t&& this.metaKey === other.metaKey\r\n\t\t\t&& this.keyCode === other.keyCode\r\n\t\t);\r\n\t}\r\n\r\n\tpublic isModifierKey(): boolean {\r\n\t\treturn (\r\n\t\t\tthis.keyCode === KeyCode.Unknown\r\n\t\t\t|| this.keyCode === KeyCode.Ctrl\r\n\t\t\t|| this.keyCode === KeyCode.Meta\r\n\t\t\t|| this.keyCode === KeyCode.Alt\r\n\t\t\t|| this.keyCode === KeyCode.Shift\r\n\t\t);\r\n\t}\r\n\r\n\tpublic toChord(): ChordKeybinding {\r\n\t\treturn new ChordKeybinding([this]);\r\n\t}\r\n\r\n\t/**\r\n\t * Does this keybinding refer to the key code of a modifier and it also has the modifier flag?\r\n\t */\r\n\tpublic isDuplicateModifierCase(): boolean {\r\n\t\treturn (\r\n\t\t\t(this.ctrlKey && this.keyCode === KeyCode.Ctrl)\r\n\t\t\t|| (this.shiftKey && this.keyCode === KeyCode.Shift)\r\n\t\t\t|| (this.altKey && this.keyCode === KeyCode.Alt)\r\n\t\t\t|| (this.metaKey && this.keyCode === KeyCode.Meta)\r\n\t\t);\r\n\t}\r\n}\r\n\r\nexport class ChordKeybinding {\r\n\tpublic readonly parts: SimpleKeybinding[];\r\n\r\n\tconstructor(parts: SimpleKeybinding[]) {\r\n\t\tif (parts.length === 0) {\r\n\t\t\tthrow illegalArgument(`parts`);\r\n\t\t}\r\n\t\tthis.parts = parts;\r\n\t}\r\n}\r\n\r\nexport type Keybinding = ChordKeybinding;\r\n\r\nexport class ResolvedKeybindingPart {\r\n\treadonly ctrlKey: boolean;\r\n\treadonly shiftKey: boolean;\r\n\treadonly altKey: boolean;\r\n\treadonly metaKey: boolean;\r\n\r\n\treadonly keyLabel: string | null;\r\n\treadonly keyAriaLabel: string | null;\r\n\r\n\tconstructor(ctrlKey: boolean, shiftKey: boolean, altKey: boolean, metaKey: boolean, kbLabel: string | null, kbAriaLabel: string | null) {\r\n\t\tthis.ctrlKey = ctrlKey;\r\n\t\tthis.shiftKey = shiftKey;\r\n\t\tthis.altKey = altKey;\r\n\t\tthis.metaKey = metaKey;\r\n\t\tthis.keyLabel = kbLabel;\r\n\t\tthis.keyAriaLabel = kbAriaLabel;\r\n\t}\r\n}\r\n\r\n/**\r\n * A resolved keybinding. Can be a simple keybinding or a chord keybinding.\r\n */\r\nexport abstract class ResolvedKeybinding {\r\n\t/**\r\n\t * This prints the binding in a format suitable for displaying in the UI.\r\n\t */\r\n\tpublic abstract getLabel(): string | null;\r\n\t/**\r\n\t * This prints the binding in a format suitable for ARIA.\r\n\t */\r\n\tpublic abstract getAriaLabel(): string | null;\r\n\r\n\t/**\r\n\t * Is the binding a chord?\r\n\t */\r\n\tpublic abstract isChord(): boolean;\r\n\r\n\t/**\r\n\t * Returns the parts that comprise of the keybinding.\r\n\t * Simple keybindings return one element.\r\n\t */\r\n\tpublic abstract getParts(): ResolvedKeybindingPart[];\r\n\r\n\t/**\r\n\t * Returns the parts that should be used for dispatching.\r\n\t */\r\n\tpublic abstract getDispatchParts(): (string | null)[];\r\n}\r\n","\r\nimport { Iterable } from 'vs/base/common/iterator';\r\n\r\n/**\r\n * Enables logging of potentially leaked disposables.\r\n *\r\n * A disposable is considered leaked if it is not disposed or not registered as the child of\r\n * another disposable. This tracking is very simple an only works for classes that either\r\n * extend Disposable or use a DisposableStore. This means there are a lot of false positives.\r\n */\r\nconst TRACK_DISPOSABLES = false;\r\n\r\nconst __is_disposable_tracked__ = '__is_disposable_tracked__';\r\n\r\nfunction markTracked<T extends IDisposable>(x: T): void {\r\n\tif (!TRACK_DISPOSABLES) {\r\n\t\treturn;\r\n\t}\r\n\r\n\tif (x && x !== Disposable.None) {\r\n\t\ttry {\r\n\t\t\t(x as any)[__is_disposable_tracked__] = true;\r\n\t\t} catch {\r\n\t\t\t// noop\r\n\t\t}\r\n\t}\r\n}\r\n\r\nfunction trackDisposable<T extends IDisposable>(x: T): T {\r\n\tif (!TRACK_DISPOSABLES) {\r\n\t\treturn x;\r\n\t}\r\n\r\n\tconst stack = new Error('Potentially leaked disposable').stack!;\r\n\tsetTimeout(() => {\r\n\t\tif (!(x as any)[__is_disposable_tracked__]) {\r\n\t\t\tconsole.log(stack);\r\n\t\t}\r\n\t}, 3000);\r\n\treturn x;\r\n}\r\n\r\nexport class MultiDisposeError extends Error {\r\n\tconstructor(\r\n\t\tpublic readonly errors: any[]\r\n\t) {\r\n\t\tsuper(`Encounter errors while disposing of store. Errors: [${errors.join(', ')}]`);\r\n\t}\r\n}\r\n\r\nexport interface IDisposable {\r\n\tdispose(): void;\r\n}\r\n\r\nexport function isDisposable<E extends object>(thing: E): thing is E & IDisposable {\r\n\treturn typeof (<IDisposable>thing).dispose === 'function' && (<IDisposable>thing).dispose.length === 0;\r\n}\r\n\r\nexport function dispose<T extends IDisposable>(disposable: T): T;\r\nexport function dispose<T extends IDisposable>(disposable: T | undefined): T | undefined;\r\nexport function dispose<T extends IDisposable, A extends IterableIterator<T> = IterableIterator<T>>(disposables: IterableIterator<T>): A;\r\nexport function dispose<T extends IDisposable>(disposables: Array<T>): Array<T>;\r\nexport function dispose<T extends IDisposable>(disposables: ReadonlyArray<T>): ReadonlyArray<T>;\r\nexport function dispose<T extends IDisposable>(arg: T | IterableIterator<T> | undefined): any {\r\n\tif (Iterable.is(arg)) {\r\n\t\tlet errors: any[] = [];\r\n\r\n\t\tfor (const d of arg) {\r\n\t\t\tif (d) {\r\n\t\t\t\tmarkTracked(d);\r\n\t\t\t\ttry {\r\n\t\t\t\t\td.dispose();\r\n\t\t\t\t} catch (e) {\r\n\t\t\t\t\terrors.push(e);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tif (errors.length === 1) {\r\n\t\t\tthrow errors[0];\r\n\t\t} else if (errors.length > 1) {\r\n\t\t\tthrow new MultiDisposeError(errors);\r\n\t\t}\r\n\r\n\t\treturn Array.isArray(arg) ? [] : arg;\r\n\t} else if (arg) {\r\n\t\tmarkTracked(arg);\r\n\t\targ.dispose();\r\n\t\treturn arg;\r\n\t}\r\n}\r\n\r\n\r\nexport function combinedDisposable(...disposables: IDisposable[]): IDisposable {\r\n\tdisposables.forEach(markTracked);\r\n\treturn trackDisposable({ dispose: () => dispose(disposables) });\r\n}\r\n\r\nexport function toDisposable(fn: () => void): IDisposable {\r\n\tconst self = trackDisposable({\r\n\t\tdispose: () => {\r\n\t\t\tmarkTracked(self);\r\n\t\t\tfn();\r\n\t\t}\r\n\t});\r\n\treturn self;\r\n}\r\n\r\nexport class DisposableStore implements IDisposable {\r\n\r\n\tstatic DISABLE_DISPOSED_WARNING = false;\r\n\r\n\tprivate _toDispose = new Set<IDisposable>();\r\n\tprivate _isDisposed = false;\r\n\r\n\t/**\r\n\t * Dispose of all registered disposables and mark this object as disposed.\r\n\t *\r\n\t * Any future disposables added to this object will be disposed of on `add`.\r\n\t */\r\n\tpublic dispose(): void {\r\n\t\tif (this._isDisposed) {\r\n\t\t\treturn;\r\n\t\t}\r\n\r\n\t\tmarkTracked(this);\r\n\t\tthis._isDisposed = true;\r\n\t\tthis.clear();\r\n\t}\r\n\r\n\t/**\r\n\t * Dispose of all registered disposables but do not mark this object as disposed.\r\n\t */\r\n\tpublic clear(): void {\r\n\t\ttry {\r\n\t\t\tdispose(this._toDispose.values());\r\n\t\t} finally {\r\n\t\t\tthis._toDispose.clear();\r\n\t\t}\r\n\t}\r\n\r\n\tpublic add<T extends IDisposable>(t: T): T {\r\n\t\tif (!t) {\r\n\t\t\treturn t;\r\n\t\t}\r\n\t\tif ((t as unknown as DisposableStore) === this) {\r\n\t\t\tthrow new Error('Cannot register a disposable on itself!');\r\n\t\t}\r\n\r\n\t\tmarkTracked(t);\r\n\t\tif (this._isDisposed) {\r\n\t\t\tif (!DisposableStore.DISABLE_DISPOSED_WARNING) {\r\n\t\t\t\tconsole.warn(new Error('Trying to add a disposable to a DisposableStore that has already been disposed of. The added object will be leaked!').stack);\r\n\t\t\t}\r\n\t\t} else {\r\n\t\t\tthis._toDispose.add(t);\r\n\t\t}\r\n\r\n\t\treturn t;\r\n\t}\r\n}\r\n\r\nexport abstract class Disposable implements IDisposable {\r\n\r\n\tstatic readonly None = Object.freeze<IDisposable>({ dispose() { } });\r\n\r\n\tprivate readonly _store = new DisposableStore();\r\n\r\n\tconstructor() {\r\n\t\ttrackDisposable(this);\r\n\t}\r\n\r\n\tpublic dispose(): void {\r\n\t\tmarkTracked(this);\r\n\r\n\t\tthis._store.dispose();\r\n\t}\r\n\r\n\tprotected _register<T extends IDisposable>(t: T): T {\r\n\t\tif ((t as unknown as Disposable) === this) {\r\n\t\t\tthrow new Error('Cannot register a disposable on itself!');\r\n\t\t}\r\n\t\treturn this._store.add(t);\r\n\t}\r\n}\r\n\r\n/**\r\n * Manages the lifecycle of a disposable value that may be changed.\r\n *\r\n * This ensures that when the disposable value is changed, the previously held disposable is disposed of. You can\r\n * also register a `MutableDisposable` on a `Disposable` to ensure it is automatically cleaned up.\r\n */\r\nexport class MutableDisposable<T extends IDisposable> implements IDisposable {\r\n\tprivate _value?: T;\r\n\tprivate _isDisposed = false;\r\n\r\n\tconstructor() {\r\n\t\ttrackDisposable(this);\r\n\t}\r\n\r\n\tget value(): T | undefined {\r\n\t\treturn this._isDisposed ? undefined : this._value;\r\n\t}\r\n\r\n\tset value(value: T | undefined) {\r\n\t\tif (this._isDisposed || value === this._value) {\r\n\t\t\treturn;\r\n\t\t}\r\n\r\n\t\tif (this._value) {\r\n\t\t\tthis._value.dispose();\r\n\t\t}\r\n\t\tif (value) {\r\n\t\t\tmarkTracked(value);\r\n\t\t}\r\n\t\tthis._value = value;\r\n\t}\r\n\r\n\tclear() {\r\n\t\tthis.value = undefined;\r\n\t}\r\n\r\n\tdispose(): void {\r\n\t\tthis._isDisposed = true;\r\n\t\tmarkTracked(this);\r\n\t\tif (this._value) {\r\n\t\t\tthis._value.dispose();\r\n\t\t}\r\n\t\tthis._value = undefined;\r\n\t}\r\n}\r\n\r\nexport interface IReference<T> extends IDisposable {\r\n\treadonly object: T;\r\n}\r\n\r\nexport class ImmortalReference<T> implements IReference<T> {\r\n\tconstructor(public object: T) { }\r\n\tdispose(): void { /* noop */ }\r\n}\r\n","/*---------------------------------------------------------------------------------------------\r\n * Copyright (c) Microsoft Corporation. All rights reserved.\r\n * Licensed under the MIT License. See License.txt in the project root for license information.\r\n *--------------------------------------------------------------------------------------------*/\r\n\r\nclass Node<E> {\r\n\r\n\tstatic readonly Undefined = new Node<any>(undefined);\r\n\r\n\telement: E;\r\n\tnext: Node<E>;\r\n\tprev: Node<E>;\r\n\r\n\tconstructor(element: E) {\r\n\t\tthis.element = element;\r\n\t\tthis.next = Node.Undefined;\r\n\t\tthis.prev = Node.Undefined;\r\n\t}\r\n}\r\n\r\nexport class LinkedList<E> {\r\n\r\n\tprivate _first: Node<E> = Node.Undefined;\r\n\tprivate _last: Node<E> = Node.Undefined;\r\n\tprivate _size: number = 0;\r\n\r\n\tget size(): number {\r\n\t\treturn this._size;\r\n\t}\r\n\r\n\tisEmpty(): boolean {\r\n\t\treturn this._first === Node.Undefined;\r\n\t}\r\n\r\n\tclear(): void {\r\n\t\tthis._first = Node.Undefined;\r\n\t\tthis._last = Node.Undefined;\r\n\t\tthis._size = 0;\r\n\t}\r\n\r\n\tunshift(element: E): () => void {\r\n\t\treturn this._insert(element, false);\r\n\t}\r\n\r\n\tpush(element: E): () => void {\r\n\t\treturn this._insert(element, true);\r\n\t}\r\n\r\n\tprivate _insert(element: E, atTheEnd: boolean): () => void {\r\n\t\tconst newNode = new Node(element);\r\n\t\tif (this._first === Node.Undefined) {\r\n\t\t\tthis._first = newNode;\r\n\t\t\tthis._last = newNode;\r\n\r\n\t\t} else if (atTheEnd) {\r\n\t\t\t// push\r\n\t\t\tconst oldLast = this._last!;\r\n\t\t\tthis._last = newNode;\r\n\t\t\tnewNode.prev = oldLast;\r\n\t\t\toldLast.next = newNode;\r\n\r\n\t\t} else {\r\n\t\t\t// unshift\r\n\t\t\tconst oldFirst = this._first;\r\n\t\t\tthis._first = newNode;\r\n\t\t\tnewNode.next = oldFirst;\r\n\t\t\toldFirst.prev = newNode;\r\n\t\t}\r\n\t\tthis._size += 1;\r\n\r\n\t\tlet didRemove = false;\r\n\t\treturn () => {\r\n\t\t\tif (!didRemove) {\r\n\t\t\t\tdidRemove = true;\r\n\t\t\t\tthis._remove(newNode);\r\n\t\t\t}\r\n\t\t};\r\n\t}\r\n\r\n\tshift(): E | undefined {\r\n\t\tif (this._first === Node.Undefined) {\r\n\t\t\treturn undefined;\r\n\t\t} else {\r\n\t\t\tconst res = this._first.element;\r\n\t\t\tthis._remove(this._first);\r\n\t\t\treturn res;\r\n\t\t}\r\n\t}\r\n\r\n\tpop(): E | undefined {\r\n\t\tif (this._last === Node.Undefined) {\r\n\t\t\treturn undefined;\r\n\t\t} else {\r\n\t\t\tconst res = this._last.element;\r\n\t\t\tthis._remove(this._last);\r\n\t\t\treturn res;\r\n\t\t}\r\n\t}\r\n\r\n\tprivate _remove(node: Node<E>): void {\r\n\t\tif (node.prev !== Node.Undefined && node.next !== Node.Undefined) {\r\n\t\t\t// middle\r\n\t\t\tconst anchor = node.prev;\r\n\t\t\tanchor.next = node.next;\r\n\t\t\tnode.next.prev = anchor;\r\n\r\n\t\t} else if (node.prev === Node.Undefined && node.next === Node.Undefined) {\r\n\t\t\t// only node\r\n\t\t\tthis._first = Node.Undefined;\r\n\t\t\tthis._last = Node.Undefined;\r\n\r\n\t\t} else if (node.next === Node.Undefined) {\r\n\t\t\t// last\r\n\t\t\tthis._last = this._last!.prev!;\r\n\t\t\tthis._last.next = Node.Undefined;\r\n\r\n\t\t} else if (node.prev === Node.Undefined) {\r\n\t\t\t// first\r\n\t\t\tthis._first = this._first!.next!;\r\n\t\t\tthis._first.prev = Node.Undefined;\r\n\t\t}\r\n\r\n\t\t// done\r\n\t\tthis._size -= 1;\r\n\t}\r\n\r\n\t*[Symbol.iterator](): Iterator<E> {\r\n\t\tlet node = this._first;\r\n\t\twhile (node !== Node.Undefined) {\r\n\t\t\tyield node.element;\r\n\t\t\tnode = node.next;\r\n\t\t}\r\n\t}\r\n\r\n\ttoArray(): E[] {\r\n\t\tconst result: E[] = [];\r\n\t\tfor (let node = this._first; node !== Node.Undefined; node = node.next) {\r\n\t\t\tresult.push(node.element);\r\n\t\t}\r\n\t\treturn result;\r\n\t}\r\n}\r\n","/*---------------------------------------------------------------------------------------------\r\n * Copyright (c) Microsoft Corporation. All rights reserved.\r\n * Licensed under the MIT License. See License.txt in the project root for license information.\r\n *--------------------------------------------------------------------------------------------*/\r\n\r\nimport { onUnexpectedError } from 'vs/base/common/errors';\r\nimport { Disposable, IDisposable, combinedDisposable, DisposableStore } from 'vs/base/common/lifecycle';\r\nimport { LinkedList } from 'vs/base/common/linkedList';\r\n\r\n/**\r\n * To an event a function with one or zero parameters\r\n * can be subscribed. The event is the subscriber function itself.\r\n */\r\nexport interface Event<T> {\r\n\t(listener: (e: T) => any, thisArgs?: any, disposables?: IDisposable[] | DisposableStore): IDisposable;\r\n}\r\n\r\nexport namespace Event {\r\n\texport const None: Event<any> = () => Disposable.None;\r\n\r\n\t/**\r\n\t * Given an event, returns another event which only fires once.\r\n\t */\r\n\texport function once<T>(event: Event<T>): Event<T> {\r\n\t\treturn (listener, thisArgs = null, disposables?) => {\r\n\t\t\t// we need this, in case the event fires during the listener call\r\n\t\t\tlet didFire = false;\r\n\t\t\tlet result: IDisposable;\r\n\t\t\tresult = event(e => {\r\n\t\t\t\tif (didFire) {\r\n\t\t\t\t\treturn;\r\n\t\t\t\t} else if (result) {\r\n\t\t\t\t\tresult.dispose();\r\n\t\t\t\t} else {\r\n\t\t\t\t\tdidFire = true;\r\n\t\t\t\t}\r\n\r\n\t\t\t\treturn listener.call(thisArgs, e);\r\n\t\t\t}, null, disposables);\r\n\r\n\t\t\tif (didFire) {\r\n\t\t\t\tresult.dispose();\r\n\t\t\t}\r\n\r\n\t\t\treturn result;\r\n\t\t};\r\n\t}\r\n\r\n\t/**\r\n\t * Given an event and a `map` function, returns another event which maps each element\r\n\t * through the mapping function.\r\n\t */\r\n\texport function map<I, O>(event: Event, map: (i: I) => O): Event<O> {\r\n\t\treturn snapshot((listener, thisArgs = null, disposables?) => event(i => listener.call(thisArgs, map(i)), null, disposables));\r\n\t}\r\n\r\n\t/**\r\n\t * Given an event and an `each` function, returns another identical event and calls\r\n\t * the `each` function per each element.\r\n\t */\r\n\texport function forEach(event: Event, each: (i: I) => void): Event {\r\n\t\treturn snapshot((listener, thisArgs = null, disposables?) => event(i => { each(i); listener.call(thisArgs, i); }, null, disposables));\r\n\t}\r\n\r\n\t/**\r\n\t * Given an event and a `filter` function, returns another event which emits those\r\n\t * elements for which the `filter` function returns `true`.\r\n\t */\r\n\texport function filter<T>(event: Event<T>, filter: (e: T) => boolean): Event<T>;\r\n\texport function filter<T, R>(event: Event<T | R>, filter: (e: T | R) => e is R): Event<R>;\r\n\texport function filter<T>(event: Event<T>, filter: (e: T) => boolean): Event<T> {\r\n\t\treturn snapshot((listener, thisArgs = null, disposables?) => event(e => filter(e) && listener.call(thisArgs, e), null, disposables));\r\n\t}\r\n\r\n\t/**\r\n\t * Given an event, returns the same event but typed as `Event<void>`.\r\n\t */\r\n\texport function signal<T>(event: Event<T>): Event<void> {\r\n\t\treturn event as Event<any> as Event<void>;\r\n\t}\r\n\r\n\t/**\r\n\t * Given a collection of events, returns a single event which emits\r\n\t * whenever any of the provided events emit.\r\n\t */\r\n\texport function any<T>(...events: Event<T>[]): Event<T>;\r\n\texport function any(...events: Event<any>[]): Event<void>;\r\n\texport function any<T>(...events: Event<T>[]): Event<T> {\r\n\t\treturn (listener, thisArgs = null, disposables?) => combinedDisposable(...events.map(event => event(e => listener.call(thisArgs, e), null, disposables)));\r\n\t}\r\n\r\n\t/**\r\n\t * Given an event and a `merge` function, returns another event which maps each element\r\n\t * and the cumulative result through the `merge` function. Similar to `map`, but with memory.\r\n\t */\r\n\texport function reduce<I, O>(event: Event, merge: (last: O | undefined, event: I) => O, initial?: O): Event<O> {\r\n\t\tlet output: O | undefined = initial;\r\n\r\n\t\treturn map<I, O>(event, e => {\r\n\t\t\toutput = merge(output, e);\r\n\t\t\treturn output;\r\n\t\t});\r\n\t}\r\n\r\n\t/**\r\n\t * Given a chain of event processing functions (filter, map, etc), each\r\n\t * function will be invoked per event & per listener. Snapshotting an event\r\n\t * chain allows each function to be invoked just once per event.\r\n\t */\r\n\texport function snapshot<T>(event: Event<T>): Event<T> {\r\n\t\tlet listener: IDisposable;\r\n\t\tconst emitter = new Emitter<T>({\r\n\t\t\tonFirstListenerAdd() {\r\n\t\t\t\tlistener = event(emitter.fire, emitter);\r\n\t\t\t},\r\n\t\t\tonLastListenerRemove() {\r\n\t\t\t\tlistener.dispose();\r\n\t\t\t}\r\n\t\t});\r\n\r\n\t\treturn emitter.event;\r\n\t}\r\n\r\n\t/**\r\n\t * Debounces the provided event, given a `merge` function.\r\n\t *\r\n\t * @param event The input event.\r\n\t * @param merge The reducing function.\r\n\t * @param delay The debouncing delay in millis.\r\n\t * @param leading Whether the event should fire in the leading phase of the timeout.\r\n\t * @param leakWarningThreshold The leak warning threshold override.\r\n\t */\r\n\texport function debounce<T>(event: Event<T>, merge: (last: T | undefined, event: T) => T, delay?: number, leading?: boolean, leakWarningThreshold?: number): Event<T>;\r\n\texport function debounce<I, O>(event: Event, merge: (last: O | undefined, event: I) => O, delay?: number, leading?: boolean, leakWarningThreshold?: number): Event<O>;\r\n\texport function debounce<I, O>(event: Event, merge: (last: O | undefined, event: I) => O, delay: number = 100, leading = false, leakWarningThreshold?: number): Event<O> {\r\n\r\n\t\tlet subscription: IDisposable;\r\n\t\tlet output: O | undefined = undefined;\r\n\t\tlet handle: any = undefined;\r\n\t\tlet numDebouncedCalls = 0;\r\n\r\n\t\tconst emitter = new Emitter<O>({\r\n\t\t\tleakWarningThreshold,\r\n\t\t\tonFirstListenerAdd() {\r\n\t\t\t\tsubscription = event(cur => {\r\n\t\t\t\t\tnumDebouncedCalls++;\r\n\t\t\t\t\toutput = merge(output, cur);\r\n\r\n\t\t\t\t\tif (leading && !handle) {\r\n\t\t\t\t\t\temitter.fire(output);\r\n\t\t\t\t\t\toutput = undefined;\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\tclearTimeout(handle);\r\n\t\t\t\t\thandle = setTimeout(() => {\r\n\t\t\t\t\t\tconst _output = output;\r\n\t\t\t\t\t\toutput = undefined;\r\n\t\t\t\t\t\thandle = undefined;\r\n\t\t\t\t\t\tif (!leading || numDebouncedCalls > 1) {\r\n\t\t\t\t\t\t\temitter.fire(_output!);\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\tnumDebouncedCalls = 0;\r\n\t\t\t\t\t}, delay);\r\n\t\t\t\t});\r\n\t\t\t},\r\n\t\t\tonLastListenerRemove() {\r\n\t\t\t\tsubscription.dispose();\r\n\t\t\t}\r\n\t\t});\r\n\r\n\t\treturn emitter.event;\r\n\t}\r\n\r\n\t/**\r\n\t * Given an event, it returns another event which fires only once and as soon as\r\n\t * the input event emits. The event data is the number of millis it took for the\r\n\t * event to fire.\r\n\t */\r\n\texport function stopwatch<T>(event: Event<T>): Event<number> {\r\n\t\tconst start = new Date().getTime();\r\n\t\treturn map(once(event), _ => new Date().getTime() - start);\r\n\t}\r\n\r\n\t/**\r\n\t * Given an event, it returns another event which fires only when the event\r\n\t * element changes.\r\n\t */\r\n\texport function latch<T>(event: Event<T>): Event<T> {\r\n\t\tlet firstCall = true;\r\n\t\tlet cache: T;\r\n\r\n\t\treturn filter(event, value => {\r\n\t\t\tconst shouldEmit = firstCall || value !== cache;\r\n\t\t\tfirstCall = false;\r\n\t\t\tcache = value;\r\n\t\t\treturn shouldEmit;\r\n\t\t});\r\n\t}\r\n\r\n\t/**\r\n\t * Buffers the provided event until a first listener comes\r\n\t * along, at which point fire all the events at once and\r\n\t * pipe the event from then on.\r\n\t *\r\n\t * ```typescript\r\n\t * const emitter = new Emitter<number>();\r\n\t * const event = emitter.event;\r\n\t * const bufferedEvent = buffer(event);\r\n\t *\r\n\t * emitter.fire(1);\r\n\t * emitter.fire(2);\r\n\t * emitter.fire(3);\r\n\t * // nothing...\r\n\t *\r\n\t * const listener = bufferedEvent(num => console.log(num));\r\n\t * // 1, 2, 3\r\n\t *\r\n\t * emitter.fire(4);\r\n\t * // 4\r\n\t * ```\r\n\t */\r\n\texport function buffer<T>(event: Event<T>, nextTick = false, _buffer: T[] = []): Event<T> {\r\n\t\tlet buffer: T[] | null = _buffer.slice();\r\n\r\n\t\tlet listener: IDisposable | null = event(e => {\r\n\t\t\tif (buffer) {\r\n\t\t\t\tbuffer.push(e);\r\n\t\t\t} else {\r\n\t\t\t\temitter.fire(e);\r\n\t\t\t}\r\n\t\t});\r\n\r\n\t\tconst flush = () => {\r\n\t\t\tif (buffer) {\r\n\t\t\t\tbuffer.forEach(e => emitter.fire(e));\r\n\t\t\t}\r\n\t\t\tbuffer = null;\r\n\t\t};\r\n\r\n\t\tconst emitter = new Emitter<T>({\r\n\t\t\tonFirstListenerAdd() {\r\n\t\t\t\tif (!listener) {\r\n\t\t\t\t\tlistener = event(e => emitter.fire(e));\r\n\t\t\t\t}\r\n\t\t\t},\r\n\r\n\t\t\tonFirstListenerDidAdd() {\r\n\t\t\t\tif (buffer) {\r\n\t\t\t\t\tif (nextTick) {\r\n\t\t\t\t\t\tsetTimeout(flush);\r\n\t\t\t\t\t} else {\r\n\t\t\t\t\t\tflush();\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t},\r\n\r\n\t\t\tonLastListenerRemove() {\r\n\t\t\t\tif (listener) {\r\n\t\t\t\t\tlistener.dispose();\r\n\t\t\t\t}\r\n\t\t\t\tlistener = null;\r\n\t\t\t}\r\n\t\t});\r\n\r\n\t\treturn emitter.event;\r\n\t}\r\n\r\n\texport interface IChainableEvent<T> {\r\n\t\tevent: Event<T>;\r\n\t\tmap<O>(fn: (i: T) => O): IChainableEvent<O>;\r\n\t\tforEach(fn: (i: T) => void): IChainableEvent<T>;\r\n\t\tfilter(fn: (e: T) => boolean): IChainableEvent<T>;\r\n\t\tfilter<R>(fn: (e: T | R) => e is R): IChainableEvent<R>;\r\n\t\treduce<R>(merge: (last: R | undefined, event: T) => R, initial?: R): IChainableEvent<R>;\r\n\t\tlatch(): IChainableEvent<T>;\r\n\t\tdebounce(merge: (last: T | undefined, event: T) => T, delay?: number, leading?: boolean, leakWarningThreshold?: number): IChainableEvent<T>;\r\n\t\tdebounce<R>(merge: (last: R | undefined, event: T) => R, delay?: number, leading?: boolean, leakWarningThreshold?: number): IChainableEvent<R>;\r\n\t\ton(listener: (e: T) => any, thisArgs?: any, disposables?: IDisposable[] | DisposableStore): IDisposable;\r\n\t\tonce(listener: (e: T) => any, thisArgs?: any, disposables?: IDisposable[]): IDisposable;\r\n\t}\r\n\r\n\tclass ChainableEvent<T> implements IChainableEvent<T> {\r\n\r\n\t\tconstructor(readonly event: Event<T>) { }\r\n\r\n\t\tmap<O>(fn: (i: T) => O): IChainableEvent<O> {\r\n\t\t\treturn new ChainableEvent(map(this.event, fn));\r\n\t\t}\r\n\r\n\t\tforEach(fn: (i: T) => void): IChainableEvent<T> {\r\n\t\t\treturn new ChainableEvent(forEach(this.event, fn));\r\n\t\t}\r\n\r\n\t\tfilter(fn: (e: T) => boolean): IChainableEvent<T>;\r\n\t\tfilter<R>(fn: (e: T | R) => e is R): IChainableEvent<R>;\r\n\t\tfilter(fn: (e: T) => boolean): IChainableEvent<T> {\r\n\t\t\treturn new ChainableEvent(filter(this.event, fn));\r\n\t\t}\r\n\r\n\t\treduce<R>(merge: (last: R | undefined, event: T) => R, initial?: R): IChainableEvent<R> {\r\n\t\t\treturn new ChainableEvent(reduce(this.event, merge, initial));\r\n\t\t}\r\n\r\n\t\tlatch(): IChainableEvent<T> {\r\n\t\t\treturn new ChainableEvent(latch(this.event));\r\n\t\t}\r\n\r\n\t\tdebounce(merge: (last: T | undefined, event: T) => T, delay?: number, leading?: boolean, leakWarningThreshold?: number): IChainableEvent<T>;\r\n\t\tdebounce<R>(merge: (last: R | undefined, event: T) => R, delay?: number, leading?: boolean, leakWarningThreshold?: number): IChainableEvent<R>;\r\n\t\tdebounce<R>(merge: (last: R | undefined, event: T) => R, delay: number = 100, leading = false, leakWarningThreshold?: number): IChainableEvent<R> {\r\n\t\t\treturn new ChainableEvent(debounce(this.event, merge, delay, leading, leakWarningThreshold));\r\n\t\t}\r\n\r\n\t\ton(listener: (e: T) => any, thisArgs: any, disposables: IDisposable[] | DisposableStore) {\r\n\t\t\treturn this.event(listener, thisArgs, disposables);\r\n\t\t}\r\n\r\n\t\tonce(listener: (e: T) => any, thisArgs: any, disposables: IDisposable[]) {\r\n\t\t\treturn once(this.event)(listener, thisArgs, disposables);\r\n\t\t}\r\n\t}\r\n\r\n\texport function chain<T>(event: Event<T>): IChainableEvent<T> {\r\n\t\treturn new ChainableEvent(event);\r\n\t}\r\n\r\n\texport interface NodeEventEmitter {\r\n\t\ton(event: string | symbol, listener: Function): unknown;\r\n\t\tremoveListener(event: string | symbol, listener: Function): unknown;\r\n\t}\r\n\r\n\texport function fromNodeEventEmitter<T>(emitter: NodeEventEmitter, eventName: string, map: (...args: any[]) => T = id => id): Event<T> {\r\n\t\tconst fn = (...args: any[]) => result.fire(map(...args));\r\n\t\tconst onFirstListenerAdd = () => emitter.on(eventName, fn);\r\n\t\tconst onLastListenerRemove = () => emitter.removeListener(eventName, fn);\r\n\t\tconst result = new Emitter<T>({ onFirstListenerAdd, onLastListenerRemove });\r\n\r\n\t\treturn result.event;\r\n\t}\r\n\r\n\texport interface DOMEventEmitter {\r\n\t\taddEventListener(event: string | symbol, listener: Function): void;\r\n\t\tremoveEventListener(event: string | symbol, listener: Function): void;\r\n\t}\r\n\r\n\texport function fromDOMEventEmitter<T>(emitter: DOMEventEmitter, eventName: string, map: (...args: any[]) => T = id => id): Event<T> {\r\n\t\tconst fn = (...args: any[]) => result.fire(map(...args));\r\n\t\tconst onFirstListenerAdd = () => emitter.addEventListener(eventName, fn);\r\n\t\tconst onLastListenerRemove = () => emitter.removeEventListener(eventName, fn);\r\n\t\tconst result = new Emitter<T>({ onFirstListenerAdd, onLastListenerRemove });\r\n\r\n\t\treturn result.event;\r\n\t}\r\n\r\n\texport function fromPromise<T = any>(promise: Promise<T>): Event<undefined> {\r\n\t\tconst emitter = new Emitter<undefined>();\r\n\t\tlet shouldEmit = false;\r\n\r\n\t\tpromise\r\n\t\t\t.then(undefined, () => null)\r\n\t\t\t.then(() => {\r\n\t\t\t\tif (!shouldEmit) {\r\n\t\t\t\t\tsetTimeout(() => emitter.fire(undefined), 0);\r\n\t\t\t\t} else {\r\n\t\t\t\t\temitter.fire(undefined);\r\n\t\t\t\t}\r\n\t\t\t});\r\n\r\n\t\tshouldEmit = true;\r\n\t\treturn emitter.event;\r\n\t}\r\n\r\n\texport function toPromise<T>(event: Event<T>): Promise<T> {\r\n\t\treturn new Promise(c => once(event)(c));\r\n\t}\r\n}\r\n\r\ntype Listener<T> = [(e: T) => void, any] | ((e: T) => void);\r\n\r\nexport interface EmitterOptions {\r\n\tonFirstListenerAdd?: Function;\r\n\tonFirstListenerDidAdd?: Function;\r\n\tonListenerDidAdd?: Function;\r\n\tonLastListenerRemove?: Function;\r\n\tleakWarningThreshold?: number;\r\n}\r\n\r\nlet _globalLeakWarningThreshold = -1;\r\n\r\nclass LeakageMonitor {\r\n\r\n\tprivate _stacks: Map<string, number> | undefined;\r\n\tprivate _warnCountdown: number = 0;\r\n\r\n\tconstructor(\r\n\t\treadonly customThreshold?: number,\r\n\t\treadonly name: string = Math.random().toString(18).slice(2, 5),\r\n\t) { }\r\n\r\n\tdispose(): void {\r\n\t\tif (this._stacks) {\r\n\t\t\tthis._stacks.clear();\r\n\t\t}\r\n\t}\r\n\r\n\tcheck(listenerCount: number): undefined | (() => void) {\r\n\r\n\t\tlet threshold = _globalLeakWarningThreshold;\r\n\t\tif (typeof this.customThreshold === 'number') {\r\n\t\t\tthreshold = this.customThreshold;\r\n\t\t}\r\n\r\n\t\tif (threshold <= 0 || listenerCount < threshold) {\r\n\t\t\treturn undefined;\r\n\t\t}\r\n\r\n\t\tif (!this._stacks) {\r\n\t\t\tthis._stacks = new Map();\r\n\t\t}\r\n\t\tconst stack = new Error().stack!.split('\\n').slice(3).join('\\n');\r\n\t\tconst count = (this._stacks.get(stack) || 0);\r\n\t\tthis._stacks.set(stack, count + 1);\r\n\t\tthis._warnCountdown -= 1;\r\n\r\n\t\tif (this._warnCountdown <= 0) {\r\n\t\t\t// only warn on first exceed and then every time the limit\r\n\t\t\t// is exceeded by 50% again\r\n\t\t\tthis._warnCountdown = threshold * 0.5;\r\n\r\n\t\t\t// find most frequent listener and print warning\r\n\t\t\tlet topStack: string | undefined;\r\n\t\t\tlet topCount: number = 0;\r\n\t\t\tfor (const [stack, count] of this._stacks) {\r\n\t\t\t\tif (!topStack || topCount < count) {\r\n\t\t\t\t\ttopStack = stack;\r\n\t\t\t\t\ttopCount = count;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\tconsole.warn(`[${this.name}] potential listener LEAK detected, having ${listenerCount} listeners already. MOST frequent listener (${topCount}):`);\r\n\t\t\tconsole.warn(topStack!);\r\n\t\t}\r\n\r\n\t\treturn () => {\r\n\t\t\tconst count = (this._stacks!.get(stack) || 0);\r\n\t\t\tthis._stacks!.set(stack, count - 1);\r\n\t\t};\r\n\t}\r\n}\r\n\r\n/**\r\n * The Emitter can be used to expose an Event to the public\r\n * to fire it from the insides.\r\n * Sample:\r\n\tclass Document {\r\n\r\n\t\tprivate readonly _onDidChange = new Emitter<(value:string)=>any>();\r\n\r\n\t\tpublic onDidChange = this._onDidChange.event;\r\n\r\n\t\t// getter-style\r\n\t\t// get onDidChange(): Event<(value:string)=>any> {\r\n\t\t// \treturn this._onDidChange.event;\r\n\t\t// }\r\n\r\n\t\tprivate _doIt() {\r\n\t\t\t//...\r\n\t\t\tthis._onDidChange.fire(value);\r\n\t\t}\r\n\t}\r\n */\r\nexport class Emitter<T> {\r\n\r\n\tprivate static readonly _noop = function () { };\r\n\r\n\tprivate readonly _options?: EmitterOptions;\r\n\tprivate readonly _leakageMon?: LeakageMonitor;\r\n\tprivate _disposed: boolean = false;\r\n\tprivate _event?: Event<T>;\r\n\tprivate _deliveryQueue?: LinkedList<[Listener<T>, T]>;\r\n\tprotected _listeners?: LinkedList<Listener<T>>;\r\n\r\n\tconstructor(options?: EmitterOptions) {\r\n\t\tthis._options = options;\r\n\t\tthis._leakageMon = _globalLeakWarningThreshold > 0\r\n\t\t\t? new LeakageMonitor(this._options && this._options.leakWarningThreshold)\r\n\t\t\t: undefined;\r\n\t}\r\n\r\n\t/**\r\n\t * For the public to allow to subscribe\r\n\t * to events from this Emitter\r\n\t */\r\n\tget event(): Event<T> {\r\n\t\tif (!this._event) {\r\n\t\t\tthis._event = (listener: (e: T) => any, thisArgs?: any, disposables?: IDisposable[] | DisposableStore) => {\r\n\t\t\t\tif (!this._listeners) {\r\n\t\t\t\t\tthis._listeners = new LinkedList();\r\n\t\t\t\t}\r\n\r\n\t\t\t\tconst firstListener = this._listeners.isEmpty();\r\n\r\n\t\t\t\tif (firstListener && this._options && this._options.onFirstListenerAdd) {\r\n\t\t\t\t\tthis._options.onFirstListenerAdd(this);\r\n\t\t\t\t}\r\n\r\n\t\t\t\tconst remove = this._listeners.push(!thisArgs ? listener : [listener, thisArgs]);\r\n\r\n\t\t\t\tif (firstListener && this._options && this._options.onFirstListenerDidAdd) {\r\n\t\t\t\t\tthis._options.onFirstListenerDidAdd(this);\r\n\t\t\t\t}\r\n\r\n\t\t\t\tif (this._options && this._options.onListenerDidAdd) {\r\n\t\t\t\t\tthis._options.onListenerDidAdd(this, listener, thisArgs);\r\n\t\t\t\t}\r\n\r\n\t\t\t\t// check and record this emitter for potential leakage\r\n\t\t\t\tlet removeMonitor: (() => void) | undefined;\r\n\t\t\t\tif (this._leakageMon) {\r\n\t\t\t\t\tremoveMonitor = this._leakageMon.check(this._listeners.size);\r\n\t\t\t\t}\r\n\r\n\t\t\t\tlet result: IDisposable;\r\n\t\t\t\tresult = {\r\n\t\t\t\t\tdispose: () => {\r\n\t\t\t\t\t\tif (removeMonitor) {\r\n\t\t\t\t\t\t\tremoveMonitor();\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\tresult.dispose = Emitter._noop;\r\n\t\t\t\t\t\tif (!this._disposed) {\r\n\t\t\t\t\t\t\tremove();\r\n\t\t\t\t\t\t\tif (this._options && this._options.onLastListenerRemove) {\r\n\t\t\t\t\t\t\t\tconst hasListeners = (this._listeners && !this._listeners.isEmpty());\r\n\t\t\t\t\t\t\t\tif (!hasListeners) {\r\n\t\t\t\t\t\t\t\t\tthis._options.onLastListenerRemove(this);\r\n\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t};\r\n\t\t\t\tif (disposables instanceof DisposableStore) {\r\n\t\t\t\t\tdisposables.add(result);\r\n\t\t\t\t} else if (Array.isArray(disposables)) {\r\n\t\t\t\t\tdisposables.push(result);\r\n\t\t\t\t}\r\n\r\n\t\t\t\treturn result;\r\n\t\t\t};\r\n\t\t}\r\n\t\treturn this._event;\r\n\t}\r\n\r\n\t/**\r\n\t * To be kept private to fire an event to\r\n\t * subscribers\r\n\t */\r\n\tfire(event: T): void {\r\n\t\tif (this._listeners) {\r\n\t\t\t// put all [listener,event]-pairs into delivery queue\r\n\t\t\t// then emit all event. an inner/nested event might be\r\n\t\t\t// the driver of this\r\n\r\n\t\t\tif (!this._deliveryQueue) {\r\n\t\t\t\tthis._deliveryQueue = new LinkedList();\r\n\t\t\t}\r\n\r\n\t\t\tfor (let listener of this._listeners) {\r\n\t\t\t\tthis._deliveryQueue.push([listener, event]);\r\n\t\t\t}\r\n\r\n\t\t\twhile (this._deliveryQueue.size > 0) {\r\n\t\t\t\tconst [listener, event] = this._deliveryQueue.shift()!;\r\n\t\t\t\ttry {\r\n\t\t\t\t\tif (typeof listener === 'function') {\r\n\t\t\t\t\t\tlistener.call(undefined, event);\r\n\t\t\t\t\t} else {\r\n\t\t\t\t\t\tlistener[0].call(listener[1], event);\r\n\t\t\t\t\t}\r\n\t\t\t\t} catch (e) {\r\n\t\t\t\t\tonUnexpectedError(e);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\tdispose() {\r\n\t\tif (this._listeners) {\r\n\t\t\tthis._listeners.clear();\r\n\t\t}\r\n\t\tif (this._deliveryQueue) {\r\n\t\t\tthis._deliveryQueue.clear();\r\n\t\t}\r\n\t\tif (this._leakageMon) {\r\n\t\t\tthis._leakageMon.dispose();\r\n\t\t}\r\n\t\tthis._disposed = true;\r\n\t}\r\n}\r\n\r\nexport class PauseableEmitter<T> extends Emitter<T> {\r\n\r\n\tprivate _isPaused = 0;\r\n\tprivate _eventQueue = new LinkedList<T>();\r\n\tprivate _mergeFn?: (input: T[]) => T;\r\n\r\n\tconstructor(options?: EmitterOptions & { merge?: (input: T[]) => T }) {\r\n\t\tsuper(options);\r\n\t\tthis._mergeFn = options && options.merge;\r\n\t}\r\n\r\n\tpause(): void {\r\n\t\tthis._isPaused++;\r\n\t}\r\n\r\n\tresume(): void {\r\n\t\tif (this._isPaused !== 0 && --this._isPaused === 0) {\r\n\t\t\tif (this._mergeFn) {\r\n\t\t\t\t// use the merge function to create a single composite\r\n\t\t\t\t// event. make a copy in case firing pauses this emitter\r\n\t\t\t\tconst events = this._eventQueue.toArray();\r\n\t\t\t\tthis._eventQueue.clear();\r\n\t\t\t\tsuper.fire(this._mergeFn(events));\r\n\r\n\t\t\t} else {\r\n\t\t\t\t// no merging, fire each event individually and test\r\n\t\t\t\t// that this emitter isn't paused halfway through\r\n\t\t\t\twhile (!this._isPaused && this._eventQueue.size !== 0) {\r\n\t\t\t\t\tsuper.fire(this._eventQueue.shift()!);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\tfire(event: T): void {\r\n\t\tif (this._listeners) {\r\n\t\t\tif (this._isPaused !== 0) {\r\n\t\t\t\tthis._eventQueue.push(event);\r\n\t\t\t} else {\r\n\t\t\t\tsuper.fire(event);\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n}\r\n\r\n/**\r\n * The EventBufferer is useful in situations in which you want\r\n * to delay firing your events during some code.\r\n * You can wrap that code and be sure that the event will not\r\n * be fired during that wrap.\r\n *\r\n * ```\r\n * const emitter: Emitter;\r\n * const delayer = new EventDelayer();\r\n * const delayedEvent = delayer.wrapEvent(emitter.event);\r\n *\r\n * delayedEvent(console.log);\r\n *\r\n * delayer.bufferEvents(() => {\r\n * emitter.fire(); // event will not be fired yet\r\n * });\r\n *\r\n * // event will only be fired at this point\r\n * ```\r\n */\r\nexport class EventBufferer {\r\n\r\n\tprivate buffers: Function[][] = [];\r\n\r\n\twrapEvent<T>(event: Event<T>): Event<T> {\r\n\t\treturn (listener, thisArgs?, disposables?) => {\r\n\t\t\treturn event(i => {\r\n\t\t\t\tconst buffer = this.buffers[this.buffers.length - 1];\r\n\r\n\t\t\t\tif (buffer) {\r\n\t\t\t\t\tbuffer.push(() => listener.call(thisArgs, i));\r\n\t\t\t\t} else {\r\n\t\t\t\t\tlistener.call(thisArgs, i);\r\n\t\t\t\t}\r\n\t\t\t}, undefined, disposables);\r\n\t\t};\r\n\t}\r\n\r\n\tbufferEvents<R = void>(fn: () => R): R {\r\n\t\tconst buffer: Array<() => R> = [];\r\n\t\tthis.buffers.push(buffer);\r\n\t\tconst r = fn();\r\n\t\tthis.buffers.pop();\r\n\t\tbuffer.forEach(flush => flush());\r\n\t\treturn r;\r\n\t}\r\n}\r\n\r\n/**\r\n * A Relay is an event forwarder which functions as a replugabble event pipe.\r\n * Once created, you can connect an input event to it and it will simply forward\r\n * events from that input event through its own `event` property. The `input`\r\n * can be changed at any point in time.\r\n */\r\nexport class Relay<T> implements IDisposable {\r\n\r\n\tprivate listening = false;\r\n\tprivate inputEvent: Event<T> = Event.None;\r\n\tprivate inputEventListener: IDisposable = Disposable.None;\r\n\r\n\tprivate readonly emitter = new Emitter<T>({\r\n\t\tonFirstListenerDidAdd: () => {\r\n\t\t\tthis.listening = true;\r\n\t\t\tthis.inputEventListener = this.inputEvent(this.emitter.fire, this.emitter);\r\n\t\t},\r\n\t\tonLastListenerRemove: () => {\r\n\t\t\tthis.listening = false;\r\n\t\t\tthis.inputEventListener.dispose();\r\n\t\t}\r\n\t});\r\n\r\n\treadonly event: Event<T> = this.emitter.event;\r\n\r\n\tset input(event: Event<T>) {\r\n\t\tthis.inputEvent = event;\r\n\r\n\t\tif (this.listening) {\r\n\t\t\tthis.inputEventListener.dispose();\r\n\t\t\tthis.inputEventListener = event(this.emitter.fire, this.emitter);\r\n\t\t}\r\n\t}\r\n\r\n\tdispose() {\r\n\t\tthis.inputEventListener.dispose();\r\n\t\tthis.emitter.dispose();\r\n\t}\r\n}\r\n","/*---------------------------------------------------------------------------------------------\r\n * Copyright (c) Microsoft Corporation. All rights reserved.\r\n * Licensed under the MIT License. See License.txt in the project root for license information.\r\n *--------------------------------------------------------------------------------------------*/\r\n\r\nimport { Emitter, Event } from 'vs/base/common/event';\r\nimport { IDisposable } from 'vs/base/common/lifecycle';\r\n\r\nexport interface CancellationToken {\r\n\r\n\t/**\r\n\t * A flag signalling is cancellation has been requested.\r\n\t */\r\n\treadonly isCancellationRequested: boolean;\r\n\r\n\t/**\r\n\t * An event which fires when cancellation is requested. This event\r\n\t * only ever fires `once` as cancellation can only happen once. Listeners\r\n\t * that are registered after cancellation will be called (next event loop run),\r\n\t * but also only once.\r\n\t *\r\n\t * @event\r\n\t */\r\n\treadonly onCancellationRequested: (listener: (e: any) => any, thisArgs?: any, disposables?: IDisposable[]) => IDisposable;\r\n}\r\n\r\nconst shortcutEvent: Event<any> = Object.freeze(function (callback, context?): IDisposable {\r\n\tconst handle = setTimeout(callback.bind(context), 0);\r\n\treturn { dispose() { clearTimeout(handle); } };\r\n});\r\n\r\nexport namespace CancellationToken {\r\n\r\n\texport function isCancellationToken(thing: unknown): thing is CancellationToken {\r\n\t\tif (thing === CancellationToken.None || thing === CancellationToken.Cancelled) {\r\n\t\t\treturn true;\r\n\t\t}\r\n\t\tif (thing instanceof MutableToken) {\r\n\t\t\treturn true;\r\n\t\t}\r\n\t\tif (!thing || typeof thing !== 'object') {\r\n\t\t\treturn false;\r\n\t\t}\r\n\t\treturn typeof (thing as CancellationToken).isCancellationRequested === 'boolean'\r\n\t\t\t&& typeof (thing as CancellationToken).onCancellationRequested === 'function';\r\n\t}\r\n\r\n\r\n\texport const None: CancellationToken = Object.freeze({\r\n\t\tisCancellationRequested: false,\r\n\t\tonCancellationRequested: Event.None\r\n\t});\r\n\r\n\texport const Cancelled: CancellationToken = Object.freeze({\r\n\t\tisCancellationRequested: true,\r\n\t\tonCancellationRequested: shortcutEvent\r\n\t});\r\n}\r\n\r\nclass MutableToken implements CancellationToken {\r\n\r\n\tprivate _isCancelled: boolean = false;\r\n\tprivate _emitter: Emitter<any> | null = null;\r\n\r\n\tpublic cancel() {\r\n\t\tif (!this._isCancelled) {\r\n\t\t\tthis._isCancelled = true;\r\n\t\t\tif (this._emitter) {\r\n\t\t\t\tthis._emitter.fire(undefined);\r\n\t\t\t\tthis.dispose();\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\tget isCancellationRequested(): boolean {\r\n\t\treturn this._isCancelled;\r\n\t}\r\n\r\n\tget onCancellationRequested(): Event<any> {\r\n\t\tif (this._isCancelled) {\r\n\t\t\treturn shortcutEvent;\r\n\t\t}\r\n\t\tif (!this._emitter) {\r\n\t\t\tthis._emitter = new Emitter<any>();\r\n\t\t}\r\n\t\treturn this._emitter.event;\r\n\t}\r\n\r\n\tpublic dispose(): void {\r\n\t\tif (this._emitter) {\r\n\t\t\tthis._emitter.dispose();\r\n\t\t\tthis._emitter = null;\r\n\t\t}\r\n\t}\r\n}\r\n\r\nexport class CancellationTokenSource {\r\n\r\n\tprivate _token?: CancellationToken = undefined;\r\n\tprivate _parentListener?: IDisposable = undefined;\r\n\r\n\tconstructor(parent?: CancellationToken) {\r\n\t\tthis._parentListener = parent && parent.onCancellationRequested(this.cancel, this);\r\n\t}\r\n\r\n\tget token(): CancellationToken {\r\n\t\tif (!this._token) {\r\n\t\t\t// be lazy and create the token only when\r\n\t\t\t// actually needed\r\n\t\t\tthis._token = new MutableToken();\r\n\t\t}\r\n\t\treturn this._token;\r\n\t}\r\n\r\n\tcancel(): void {\r\n\t\tif (!this._token) {\r\n\t\t\t// save an object by returning the default\r\n\t\t\t// cancelled token when cancellation happens\r\n\t\t\t// before someone asks for the token\r\n\t\t\tthis._token = CancellationToken.Cancelled;\r\n\r\n\t\t} else if (this._token instanceof MutableToken) {\r\n\t\t\t// actually cancel\r\n\t\t\tthis._token.cancel();\r\n\t\t}\r\n\t}\r\n\r\n\tdispose(cancel: boolean = false): void {\r\n\t\tif (cancel) {\r\n\t\t\tthis.cancel();\r\n\t\t}\r\n\t\tif (this._parentListener) {\r\n\t\t\tthis._parentListener.dispose();\r\n\t\t}\r\n\t\tif (!this._token) {\r\n\t\t\t// ensure to initialize with an empty token if we had none\r\n\t\t\tthis._token = CancellationToken.None;\r\n\r\n\t\t} else if (this._token instanceof MutableToken) {\r\n\t\t\t// actually dispose\r\n\t\t\tthis._token.dispose();\r\n\t\t}\r\n\t}\r\n}\r\n","/*---------------------------------------------------------------------------------------------\r\n * Copyright (c) Microsoft Corporation. All rights reserved.\r\n * Licensed under the MIT License. See License.txt in the project root for license information.\r\n *--------------------------------------------------------------------------------------------*/\r\n\r\nconst LANGUAGE_DEFAULT = 'en';\r\n\r\nlet _isWindows = false;\r\nlet _isMacintosh = false;\r\nlet _isLinux = false;\r\nlet _isNative = false;\r\nlet _isWeb = false;\r\nlet _isIOS = false;\r\nlet _locale: string | undefined = undefined;\r\nlet _language: string = LANGUAGE_DEFAULT;\r\nlet _translationsConfigFile: string | undefined = undefined;\r\nlet _userAgent: string | undefined = undefined;\r\n\r\ninterface NLSConfig {\r\n\tlocale: string;\r\n\tavailableLanguages: { [key: string]: string; };\r\n\t_translationsConfigFile: string;\r\n}\r\n\r\nexport interface IProcessEnvironment {\r\n\t[key: string]: string;\r\n}\r\n\r\ninterface INodeProcess {\r\n\tplatform: string;\r\n\tenv: IProcessEnvironment;\r\n\tnextTick: Function;\r\n\tversions?: {\r\n\t\telectron?: string;\r\n\t};\r\n\ttype?: string;\r\n}\r\ndeclare const process: INodeProcess;\r\ndeclare const global: any;\r\n\r\ninterface INavigator {\r\n\tuserAgent: string;\r\n\tlanguage: string;\r\n\tmaxTouchPoints?: number;\r\n}\r\ndeclare const navigator: INavigator;\r\ndeclare const self: any;\r\n\r\nconst isElectronRenderer = (typeof process !== 'undefined' && typeof process.versions !== 'undefined' && typeof process.versions.electron !== 'undefined' && process.type === 'renderer');\r\n\r\n// OS detection\r\nif (typeof navigator === 'object' && !isElectronRenderer) {\r\n\t_userAgent = navigator.userAgent;\r\n\t_isWindows = _userAgent.indexOf('Windows') >= 0;\r\n\t_isMacintosh = _userAgent.indexOf('Macintosh') >= 0;\r\n\t_isIOS = (_userAgent.indexOf('Macintosh') >= 0 || _userAgent.indexOf('iPad') >= 0 || _userAgent.indexOf('iPhone') >= 0) && !!navigator.maxTouchPoints && navigator.maxTouchPoints > 0;\r\n\t_isLinux = _userAgent.indexOf('Linux') >= 0;\r\n\t_isWeb = true;\r\n\t_locale = navigator.language;\r\n\t_language = _locale;\r\n} else if (typeof process === 'object') {\r\n\t_isWindows = (process.platform === 'win32');\r\n\t_isMacintosh = (process.platform === 'darwin');\r\n\t_isLinux = (process.platform === 'linux');\r\n\t_locale = LANGUAGE_DEFAULT;\r\n\t_language = LANGUAGE_DEFAULT;\r\n\tconst rawNlsConfig = process.env['VSCODE_NLS_CONFIG'];\r\n\tif (rawNlsConfig) {\r\n\t\ttry {\r\n\t\t\tconst nlsConfig: NLSConfig = JSON.parse(rawNlsConfig);\r\n\t\t\tconst resolved = nlsConfig.availableLanguages['*'];\r\n\t\t\t_locale = nlsConfig.locale;\r\n\t\t\t// VSCode's default language is 'en'\r\n\t\t\t_language = resolved ? resolved : LANGUAGE_DEFAULT;\r\n\t\t\t_translationsConfigFile = nlsConfig._translationsConfigFile;\r\n\t\t} catch (e) {\r\n\t\t}\r\n\t}\r\n\t_isNative = true;\r\n}\r\n\r\nexport const enum Platform {\r\n\tWeb,\r\n\tMac,\r\n\tLinux,\r\n\tWindows\r\n}\r\n\r\nlet _platform: Platform = Platform.Web;\r\nif (_isMacintosh) {\r\n\t_platform = Platform.Mac;\r\n} else if (_isWindows) {\r\n\t_platform = Platform.Windows;\r\n} else if (_isLinux) {\r\n\t_platform = Platform.Linux;\r\n}\r\n\r\nexport const isWindows = _isWindows;\r\nexport const isMacintosh = _isMacintosh;\r\nexport const isLinux = _isLinux;\r\nexport const isNative = _isNative;\r\nexport const isWeb = _isWeb;\r\nexport const isIOS = _isIOS;\r\n\r\nconst _globals = (typeof self === 'object' ? self : typeof global === 'object' ? global : {} as any);\r\nexport const globals: any = _globals;\r\n\r\ninterface ISetImmediate {\r\n\t(callback: (...args: any[]) => void): void;\r\n}\r\n\r\nexport const setImmediate: ISetImmediate = (function defineSetImmediate() {\r\n\tif (globals.setImmediate) {\r\n\t\treturn globals.setImmediate.bind(globals);\r\n\t}\r\n\tif (typeof globals.postMessage === 'function' && !globals.importScripts) {\r\n\t\tinterface IQueueElement {\r\n\t\t\tid: number;\r\n\t\t\tcallback: () => void;\r\n\t\t}\r\n\t\tlet pending: IQueueElement[] = [];\r\n\t\tglobals.addEventListener('message', (e: MessageEvent) => {\r\n\t\t\tif (e.data && e.data.vscodeSetImmediateId) {\r\n\t\t\t\tfor (let i = 0, len = pending.length; i < len; i++) {\r\n\t\t\t\t\tconst candidate = pending[i];\r\n\t\t\t\t\tif (candidate.id === e.data.vscodeSetImmediateId) {\r\n\t\t\t\t\t\tpending.splice(i, 1);\r\n\t\t\t\t\t\tcandidate.callback();\r\n\t\t\t\t\t\treturn;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t});\r\n\t\tlet lastId = 0;\r\n\t\treturn (callback: () => void) => {\r\n\t\t\tconst myId = ++lastId;\r\n\t\t\tpending.push({\r\n\t\t\t\tid: myId,\r\n\t\t\t\tcallback: callback\r\n\t\t\t});\r\n\t\t\tglobals.postMessage({ vscodeSetImmediateId: myId }, '*');\r\n\t\t};\r\n\t}\r\n\tif (typeof process !== 'undefined' && typeof process.nextTick === 'function') {\r\n\t\treturn process.nextTick.bind(process);\r\n\t}\r\n\tconst _promise = Promise.resolve();\r\n\treturn (callback: (...args: any[]) => void) => _promise.then(callback);\r\n})();\r\n\r\nexport const enum OperatingSystem {\r\n\tWindows = 1,\r\n\tMacintosh = 2,\r\n\tLinux = 3\r\n}\r\nexport const OS = (_isMacintosh || _isIOS ? OperatingSystem.Macintosh : (_isWindows ? OperatingSystem.Windows : OperatingSystem.Linux));\r\n\r\nlet _isLittleEndian = true;\r\nlet _isLittleEndianComputed = false;\r\nexport function isLittleEndian(): boolean {\r\n\tif (!_isLittleEndianComputed) {\r\n\t\t_isLittleEndianComputed = true;\r\n\t\tconst test = new Uint8Array(2);\r\n\t\ttest[0] = 1;\r\n\t\ttest[1] = 2;\r\n\t\tconst view = new Uint16Array(test.buffer);\r\n\t\t_isLittleEndian = (view[0] === (2 << 8) + 1);\r\n\t}\r\n\treturn _isLittleEndian;\r\n}\r\n","/*---------------------------------------------------------------------------------------------\r\n * Copyright (c) Microsoft Corporation. All rights reserved.\r\n * Licensed under the MIT License. See License.txt in the project root for license information.\r\n *--------------------------------------------------------------------------------------------*/\r\n\r\nimport { isWindows, isMacintosh, setImmediate, IProcessEnvironment } from 'vs/base/common/platform';\r\n\r\ninterface IProcess {\r\n\tplatform: string;\r\n\tenv: IProcessEnvironment;\r\n\r\n\tcwd(): string;\r\n\tnextTick(callback: (...args: any[]) => void): void;\r\n}\r\n\r\ndeclare const process: IProcess;\r\nconst safeProcess: IProcess = (typeof process === 'undefined') ? {\r\n\tcwd(): string { return '/'; },\r\n\tenv: Object.create(null),\r\n\tget platform(): string { return isWindows ? 'win32' : isMacintosh ? 'darwin' : 'linux'; },\r\n\tnextTick(callback: (...args: any[]) => void): void { return setImmediate(callback); }\r\n} : process;\r\n\r\nexport const cwd = safeProcess.cwd;\r\nexport const env = safeProcess.env;\r\nexport const platform = safeProcess.platform;\r\n","/*---------------------------------------------------------------------------------------------\r\n * Copyright (c) Microsoft Corporation. All rights reserved.\r\n * Licensed under the MIT License. See License.txt in the project root for license information.\r\n *--------------------------------------------------------------------------------------------*/\r\n\r\n// NOTE: VSCode's copy of nodejs path library to be usable in common (non-node) namespace\r\n// Copied from: https://github.com/nodejs/node/blob/v12.8.1/lib/path.js\r\n\r\n/**\r\n * Copyright Joyent, Inc. and other Node contributors.\r\n *\r\n * Permission is hereby granted, free of charge, to any person obtaining a\r\n * copy of this software and associated documentation files (the\r\n * \"Software\"), to deal in the Software without restriction, including\r\n * without limitation the rights to use, copy, modify, merge, publish,\r\n * distribute, sublicense, and/or sell copies of the Software, and to permit\r\n * persons to whom the Software is furnished to do so, subject to the\r\n * following conditions:\r\n *\r\n * The above copyright notice and this permission notice shall be included\r\n * in all copies or substantial portions of the Software.\r\n *\r\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\r\n * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\r\n * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\r\n * NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\r\n * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\r\n * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\r\n * USE OR OTHER DEALINGS IN THE SOFTWARE.\r\n */\r\n\r\nimport * as process from 'vs/base/common/process';\r\n\r\nconst CHAR_UPPERCASE_A = 65;/* A */\r\nconst CHAR_LOWERCASE_A = 97; /* a */\r\nconst CHAR_UPPERCASE_Z = 90; /* Z */\r\nconst CHAR_LOWERCASE_Z = 122; /* z */\r\nconst CHAR_DOT = 46; /* . */\r\nconst CHAR_FORWARD_SLASH = 47; /* / */\r\nconst CHAR_BACKWARD_SLASH = 92; /* \\ */\r\nconst CHAR_COLON = 58; /* : */\r\nconst CHAR_QUESTION_MARK = 63; /* ? */\r\n\r\nclass ErrorInvalidArgType extends Error {\r\n\tcode: 'ERR_INVALID_ARG_TYPE';\r\n\tconstructor(name: string, expected: string, actual: any) {\r\n\t\t// determiner: 'must be' or 'must not be'\r\n\t\tlet determiner;\r\n\t\tif (typeof expected === 'string' && expected.indexOf('not ') === 0) {\r\n\t\t\tdeterminer = 'must not be';\r\n\t\t\texpected = expected.replace(/^not /, '');\r\n\t\t} else {\r\n\t\t\tdeterminer = 'must be';\r\n\t\t}\r\n\r\n\t\tconst type = name.indexOf('.') !== -1 ? 'property' : 'argument';\r\n\t\tlet msg = `The \"${name}\" ${type} ${determiner} of type ${expected}`;\r\n\r\n\t\tmsg += `. Received type ${typeof actual}`;\r\n\t\tsuper(msg);\r\n\r\n\t\tthis.code = 'ERR_INVALID_ARG_TYPE';\r\n\t}\r\n}\r\n\r\nfunction validateString(value: string, name: string) {\r\n\tif (typeof value !== 'string') {\r\n\t\tthrow new ErrorInvalidArgType(name, 'string', value);\r\n\t}\r\n}\r\n\r\nfunction isPathSeparator(code: number | undefined) {\r\n\treturn code === CHAR_FORWARD_SLASH || code === CHAR_BACKWARD_SLASH;\r\n}\r\n\r\nfunction isPosixPathSeparator(code: number | undefined) {\r\n\treturn code === CHAR_FORWARD_SLASH;\r\n}\r\n\r\nfunction isWindowsDeviceRoot(code: number) {\r\n\treturn code >= CHAR_UPPERCASE_A && code <= CHAR_UPPERCASE_Z ||\r\n\t\tcode >= CHAR_LOWERCASE_A && code <= CHAR_LOWERCASE_Z;\r\n}\r\n\r\n// Resolves . and .. elements in a path with directory names\r\nfunction normalizeString(path: string, allowAboveRoot: boolean, separator: string, isPathSeparator: (code?: number) => boolean) {\r\n\tlet res = '';\r\n\tlet lastSegmentLength = 0;\r\n\tlet lastSlash = -1;\r\n\tlet dots = 0;\r\n\tlet code = 0;\r\n\tfor (let i = 0; i <= path.length; ++i) {\r\n\t\tif (i < path.length) {\r\n\t\t\tcode = path.charCodeAt(i);\r\n\t\t}\r\n\t\telse if (isPathSeparator(code)) {\r\n\t\t\tbreak;\r\n\t\t}\r\n\t\telse {\r\n\t\t\tcode = CHAR_FORWARD_SLASH;\r\n\t\t}\r\n\r\n\t\tif (isPathSeparator(code)) {\r\n\t\t\tif (lastSlash === i - 1 || dots === 1) {\r\n\t\t\t\t// NOOP\r\n\t\t\t} else if (dots === 2) {\r\n\t\t\t\tif (res.length < 2 || lastSegmentLength !== 2 ||\r\n\t\t\t\t\tres.charCodeAt(res.length - 1) !== CHAR_DOT ||\r\n\t\t\t\t\tres.charCodeAt(res.length - 2) !== CHAR_DOT) {\r\n\t\t\t\t\tif (res.length > 2) {\r\n\t\t\t\t\t\tconst lastSlashIndex = res.lastIndexOf(separator);\r\n\t\t\t\t\t\tif (lastSlashIndex === -1) {\r\n\t\t\t\t\t\t\tres = '';\r\n\t\t\t\t\t\t\tlastSegmentLength = 0;\r\n\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\tres = res.slice(0, lastSlashIndex);\r\n\t\t\t\t\t\t\tlastSegmentLength = res.length - 1 - res.lastIndexOf(separator);\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\tlastSlash = i;\r\n\t\t\t\t\t\tdots = 0;\r\n\t\t\t\t\t\tcontinue;\r\n\t\t\t\t\t} else if (res.length !== 0) {\r\n\t\t\t\t\t\tres = '';\r\n\t\t\t\t\t\tlastSegmentLength = 0;\r\n\t\t\t\t\t\tlastSlash = i;\r\n\t\t\t\t\t\tdots = 0;\r\n\t\t\t\t\t\tcontinue;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t\tif (allowAboveRoot) {\r\n\t\t\t\t\tres += res.length > 0 ? `${separator}..` : '..';\r\n\t\t\t\t\tlastSegmentLength = 2;\r\n\t\t\t\t}\r\n\t\t\t} else {\r\n\t\t\t\tif (res.length > 0) {\r\n\t\t\t\t\tres += `${separator}${path.slice(lastSlash + 1, i)}`;\r\n\t\t\t\t}\r\n\t\t\t\telse {\r\n\t\t\t\t\tres = path.slice(lastSlash + 1, i);\r\n\t\t\t\t}\r\n\t\t\t\tlastSegmentLength = i - lastSlash - 1;\r\n\t\t\t}\r\n\t\t\tlastSlash = i;\r\n\t\t\tdots = 0;\r\n\t\t} else if (code === CHAR_DOT && dots !== -1) {\r\n\t\t\t++dots;\r\n\t\t} else {\r\n\t\t\tdots = -1;\r\n\t\t}\r\n\t}\r\n\treturn res;\r\n}\r\n\r\nfunction _format(sep: string, pathObject: ParsedPath) {\r\n\tif (pathObject === null || typeof pathObject !== 'object') {\r\n\t\tthrow new ErrorInvalidArgType('pathObject', 'Object', pathObject);\r\n\t}\r\n\tconst dir = pathObject.dir || pathObject.root;\r\n\tconst base = pathObject.base ||\r\n\t\t`${pathObject.name || ''}${pathObject.ext || ''}`;\r\n\tif (!dir) {\r\n\t\treturn base;\r\n\t}\r\n\treturn dir === pathObject.root ? `${dir}${base}` : `${dir}${sep}${base}`;\r\n}\r\n\r\nexport interface ParsedPath {\r\n\troot: string;\r\n\tdir: string;\r\n\tbase: string;\r\n\text: string;\r\n\tname: string;\r\n}\r\n\r\nexport interface IPath {\r\n\tnormalize(path: string): string;\r\n\tisAbsolute(path: string): boolean;\r\n\tjoin(...paths: string[]): string;\r\n\tresolve(...pathSegments: string[]): string;\r\n\trelative(from: string, to: string): string;\r\n\tdirname(path: string): string;\r\n\tbasename(path: string, ext?: string): string;\r\n\textname(path: string): string;\r\n\tformat(pathObject: ParsedPath): string;\r\n\tparse(path: string): ParsedPath;\r\n\ttoNamespacedPath(path: string): string;\r\n\tsep: '\\\\' | '/';\r\n\tdelimiter: string;\r\n\twin32: IPath | null;\r\n\tposix: IPath | null;\r\n}\r\n\r\nexport const win32: IPath = {\r\n\t// path.resolve([from ...], to)\r\n\tresolve(...pathSegments: string[]): string {\r\n\t\tlet resolvedDevice = '';\r\n\t\tlet resolvedTail = '';\r\n\t\tlet resolvedAbsolute = false;\r\n\r\n\t\tfor (let i = pathSegments.length - 1; i >= -1; i--) {\r\n\t\t\tlet path;\r\n\t\t\tif (i >= 0) {\r\n\t\t\t\tpath = pathSegments[i];\r\n\t\t\t\tvalidateString(path, 'path');\r\n\r\n\t\t\t\t// Skip empty entries\r\n\t\t\t\tif (path.length === 0) {\r\n\t\t\t\t\tcontinue;\r\n\t\t\t\t}\r\n\t\t\t} else if (resolvedDevice.length === 0) {\r\n\t\t\t\tpath = process.cwd();\r\n\t\t\t} else {\r\n\t\t\t\t// Windows has the concept of drive-specific current working\r\n\t\t\t\t// directories. If we've resolved a drive letter but not yet an\r\n\t\t\t\t// absolute path, get cwd for that drive, or the process cwd if\r\n\t\t\t\t// the drive cwd is not available. We're sure the device is not\r\n\t\t\t\t// a UNC path at this points, because UNC paths are always absolute.\r\n\t\t\t\tpath = (process.env as any)[`=${resolvedDevice}`] || process.cwd();\r\n\r\n\t\t\t\t// Verify that a cwd was found and that it actually points\r\n\t\t\t\t// to our drive. If not, default to the drive's root.\r\n\t\t\t\tif (path === undefined ||\r\n\t\t\t\t\tpath.slice(0, 2).toLowerCase() !== resolvedDevice.toLowerCase() &&\r\n\t\t\t\t\tpath.charCodeAt(2) === CHAR_BACKWARD_SLASH) {\r\n\t\t\t\t\tpath = `${resolvedDevice}\\\\`;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\tconst len = path.length;\r\n\t\t\tlet rootEnd = 0;\r\n\t\t\tlet device = '';\r\n\t\t\tlet isAbsolute = false;\r\n\t\t\tconst code = path.charCodeAt(0);\r\n\r\n\t\t\t// Try to match a root\r\n\t\t\tif (len === 1) {\r\n\t\t\t\tif (isPathSeparator(code)) {\r\n\t\t\t\t\t// `path` contains just a path separator\r\n\t\t\t\t\trootEnd = 1;\r\n\t\t\t\t\tisAbsolute = true;\r\n\t\t\t\t}\r\n\t\t\t} else if (isPathSeparator(code)) {\r\n\t\t\t\t// Possible UNC root\r\n\r\n\t\t\t\t// If we started with a separator, we know we at least have an\r\n\t\t\t\t// absolute path of some kind (UNC or otherwise)\r\n\t\t\t\tisAbsolute = true;\r\n\r\n\t\t\t\tif (isPathSeparator(path.charCodeAt(1))) {\r\n\t\t\t\t\t// Matched double path separator at beginning\r\n\t\t\t\t\tlet j = 2;\r\n\t\t\t\t\tlet last = j;\r\n\t\t\t\t\t// Match 1 or more non-path separators\r\n\t\t\t\t\twhile (j < len && !isPathSeparator(path.charCodeAt(j))) {\r\n\t\t\t\t\t\tj++;\r\n\t\t\t\t\t}\r\n\t\t\t\t\tif (j < len && j !== last) {\r\n\t\t\t\t\t\tconst firstPart = path.slice(last, j);\r\n\t\t\t\t\t\t// Matched!\r\n\t\t\t\t\t\tlast = j;\r\n\t\t\t\t\t\t// Match 1 or more path separators\r\n\t\t\t\t\t\twhile (j < len && isPathSeparator(path.charCodeAt(j))) {\r\n\t\t\t\t\t\t\tj++;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\tif (j < len && j !== last) {\r\n\t\t\t\t\t\t\t// Matched!\r\n\t\t\t\t\t\t\tlast = j;\r\n\t\t\t\t\t\t\t// Match 1 or more non-path separators\r\n\t\t\t\t\t\t\twhile (j < len && !isPathSeparator(path.charCodeAt(j))) {\r\n\t\t\t\t\t\t\t\tj++;\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\tif (j === len || j !== last) {\r\n\t\t\t\t\t\t\t\t// We matched a UNC root\r\n\t\t\t\t\t\t\t\tdevice = `\\\\\\\\${firstPart}\\\\${path.slice(last, j)}`;\r\n\t\t\t\t\t\t\t\trootEnd = j;\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t} else {\r\n\t\t\t\t\trootEnd = 1;\r\n\t\t\t\t}\r\n\t\t\t} else if (isWindowsDeviceRoot(code) &&\r\n\t\t\t\tpath.charCodeAt(1) === CHAR_COLON) {\r\n\t\t\t\t// Possible device root\r\n\t\t\t\tdevice = path.slice(0, 2);\r\n\t\t\t\trootEnd = 2;\r\n\t\t\t\tif (len > 2 && isPathSeparator(path.charCodeAt(2))) {\r\n\t\t\t\t\t// Treat separator following drive name as an absolute path\r\n\t\t\t\t\t// indicator\r\n\t\t\t\t\tisAbsolute = true;\r\n\t\t\t\t\trootEnd = 3;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\tif (device.length > 0) {\r\n\t\t\t\tif (resolvedDevice.length > 0) {\r\n\t\t\t\t\tif (device.toLowerCase() !== resolvedDevice.toLowerCase()) {\r\n\t\t\t\t\t\t// This path points to another device so it is not applicable\r\n\t\t\t\t\t\tcontinue;\r\n\t\t\t\t\t}\r\n\t\t\t\t} else {\r\n\t\t\t\t\tresolvedDevice = device;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\tif (resolvedAbsolute) {\r\n\t\t\t\tif (resolvedDevice.length > 0) {\r\n\t\t\t\t\tbreak;\r\n\t\t\t\t}\r\n\t\t\t} else {\r\n\t\t\t\tresolvedTail = `${path.slice(rootEnd)}\\\\${resolvedTail}`;\r\n\t\t\t\tresolvedAbsolute = isAbsolute;\r\n\t\t\t\tif (isAbsolute && resolvedDevice.length > 0) {\r\n\t\t\t\t\tbreak;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\t// At this point the path should be resolved to a full absolute path,\r\n\t\t// but handle relative paths to be safe (might happen when process.cwd()\r\n\t\t// fails)\r\n\r\n\t\t// Normalize the tail path\r\n\t\tresolvedTail = normalizeString(resolvedTail, !resolvedAbsolute, '\\\\',\r\n\t\t\tisPathSeparator);\r\n\r\n\t\treturn resolvedAbsolute ?\r\n\t\t\t`${resolvedDevice}\\\\${resolvedTail}` :\r\n\t\t\t`${resolvedDevice}${resolvedTail}` || '.';\r\n\t},\r\n\r\n\tnormalize(path: string): string {\r\n\t\tvalidateString(path, 'path');\r\n\t\tconst len = path.length;\r\n\t\tif (len === 0) {\r\n\t\t\treturn '.';\r\n\t\t}\r\n\t\tlet rootEnd = 0;\r\n\t\tlet device;\r\n\t\tlet isAbsolute = false;\r\n\t\tconst code = path.charCodeAt(0);\r\n\r\n\t\t// Try to match a root\r\n\t\tif (len === 1) {\r\n\t\t\t// `path` contains just a single char, exit early to avoid\r\n\t\t\t// unnecessary work\r\n\t\t\treturn isPosixPathSeparator(code) ? '\\\\' : path;\r\n\t\t}\r\n\t\tif (isPathSeparator(code)) {\r\n\t\t\t// Possible UNC root\r\n\r\n\t\t\t// If we started with a separator, we know we at least have an absolute\r\n\t\t\t// path of some kind (UNC or otherwise)\r\n\t\t\tisAbsolute = true;\r\n\r\n\t\t\tif (isPathSeparator(path.charCodeAt(1))) {\r\n\t\t\t\t// Matched double path separator at beginning\r\n\t\t\t\tlet j = 2;\r\n\t\t\t\tlet last = j;\r\n\t\t\t\t// Match 1 or more non-path separators\r\n\t\t\t\twhile (j < len && !isPathSeparator(path.charCodeAt(j))) {\r\n\t\t\t\t\tj++;\r\n\t\t\t\t}\r\n\t\t\t\tif (j < len && j !== last) {\r\n\t\t\t\t\tconst firstPart = path.slice(last, j);\r\n\t\t\t\t\t// Matched!\r\n\t\t\t\t\tlast = j;\r\n\t\t\t\t\t// Match 1 or more path separators\r\n\t\t\t\t\twhile (j < len && isPathSeparator(path.charCodeAt(j))) {\r\n\t\t\t\t\t\tj++;\r\n\t\t\t\t\t}\r\n\t\t\t\t\tif (j < len && j !== last) {\r\n\t\t\t\t\t\t// Matched!\r\n\t\t\t\t\t\tlast = j;\r\n\t\t\t\t\t\t// Match 1 or more non-path separators\r\n\t\t\t\t\t\twhile (j < len && !isPathSeparator(path.charCodeAt(j))) {\r\n\t\t\t\t\t\t\tj++;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\tif (j === len) {\r\n\t\t\t\t\t\t\t// We matched a UNC root only\r\n\t\t\t\t\t\t\t// Return the normalized version of the UNC root since there\r\n\t\t\t\t\t\t\t// is nothing left to process\r\n\t\t\t\t\t\t\treturn `\\\\\\\\${firstPart}\\\\${path.slice(last)}\\\\`;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\tif (j !== last) {\r\n\t\t\t\t\t\t\t// We matched a UNC root with leftovers\r\n\t\t\t\t\t\t\tdevice = `\\\\\\\\${firstPart}\\\\${path.slice(last, j)}`;\r\n\t\t\t\t\t\t\trootEnd = j;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t} else {\r\n\t\t\t\trootEnd = 1;\r\n\t\t\t}\r\n\t\t} else if (isWindowsDeviceRoot(code) && path.charCodeAt(1) === CHAR_COLON) {\r\n\t\t\t// Possible device root\r\n\t\t\tdevice = path.slice(0, 2);\r\n\t\t\trootEnd = 2;\r\n\t\t\tif (len > 2 && isPathSeparator(path.charCodeAt(2))) {\r\n\t\t\t\t// Treat separator following drive name as an absolute path\r\n\t\t\t\t// indicator\r\n\t\t\t\tisAbsolute = true;\r\n\t\t\t\trootEnd = 3;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tlet tail = rootEnd < len ?\r\n\t\t\tnormalizeString(path.slice(rootEnd), !isAbsolute, '\\\\', isPathSeparator) :\r\n\t\t\t'';\r\n\t\tif (tail.length === 0 && !isAbsolute) {\r\n\t\t\ttail = '.';\r\n\t\t}\r\n\t\tif (tail.length > 0 && isPathSeparator(path.charCodeAt(len - 1))) {\r\n\t\t\ttail += '\\\\';\r\n\t\t}\r\n\t\tif (device === undefined) {\r\n\t\t\treturn isAbsolute ? `\\\\${tail}` : tail;\r\n\t\t}\r\n\t\treturn isAbsolute ? `${device}\\\\${tail}` : `${device}${tail}`;\r\n\t},\r\n\r\n\tisAbsolute(path: string): boolean {\r\n\t\tvalidateString(path, 'path');\r\n\t\tconst len = path.length;\r\n\t\tif (len === 0) {\r\n\t\t\treturn false;\r\n\t\t}\r\n\r\n\t\tconst code = path.charCodeAt(0);\r\n\t\treturn isPathSeparator(code) ||\r\n\t\t\t// Possible device root\r\n\t\t\tlen > 2 &&\r\n\t\t\tisWindowsDeviceRoot(code) &&\r\n\t\t\tpath.charCodeAt(1) === CHAR_COLON &&\r\n\t\t\tisPathSeparator(path.charCodeAt(2));\r\n\t},\r\n\r\n\tjoin(...paths: string[]): string {\r\n\t\tif (paths.length === 0) {\r\n\t\t\treturn '.';\r\n\t\t}\r\n\r\n\t\tlet joined;\r\n\t\tlet firstPart: string | undefined;\r\n\t\tfor (let i = 0; i < paths.length; ++i) {\r\n\t\t\tconst arg = paths[i];\r\n\t\t\tvalidateString(arg, 'path');\r\n\t\t\tif (arg.length > 0) {\r\n\t\t\t\tif (joined === undefined) {\r\n\t\t\t\t\tjoined = firstPart = arg;\r\n\t\t\t\t}\r\n\t\t\t\telse {\r\n\t\t\t\t\tjoined += `\\\\${arg}`;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tif (joined === undefined) {\r\n\t\t\treturn '.';\r\n\t\t}\r\n\r\n\t\t// Make sure that the joined path doesn't start with two slashes, because\r\n\t\t// normalize() will mistake it for an UNC path then.\r\n\t\t//\r\n\t\t// This step is skipped when it is very clear that the user actually\r\n\t\t// intended to point at an UNC path. This is assumed when the first\r\n\t\t// non-empty string arguments starts with exactly two slashes followed by\r\n\t\t// at least one more non-slash character.\r\n\t\t//\r\n\t\t// Note that for normalize() to treat a path as an UNC path it needs to\r\n\t\t// have at least 2 components, so we don't filter for that here.\r\n\t\t// This means that the user can use join to construct UNC paths from\r\n\t\t// a server name and a share name; for example:\r\n\t\t// path.join('//server', 'share') -> '\\\\\\\\server\\\\share\\\\')\r\n\t\tlet needsReplace = true;\r\n\t\tlet slashCount = 0;\r\n\t\tif (typeof firstPart === 'string' && isPathSeparator(firstPart.charCodeAt(0))) {\r\n\t\t\t++slashCount;\r\n\t\t\tconst firstLen = firstPart.length;\r\n\t\t\tif (firstLen > 1 && isPathSeparator(firstPart.charCodeAt(1))) {\r\n\t\t\t\t++slashCount;\r\n\t\t\t\tif (firstLen > 2) {\r\n\t\t\t\t\tif (isPathSeparator(firstPart.charCodeAt(2))) {\r\n\t\t\t\t\t\t++slashCount;\r\n\t\t\t\t\t} else {\r\n\t\t\t\t\t\t// We matched a UNC path in the first part\r\n\t\t\t\t\t\tneedsReplace = false;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\tif (needsReplace) {\r\n\t\t\t// Find any more consecutive slashes we need to replace\r\n\t\t\twhile (slashCount < joined.length &&\r\n\t\t\t\tisPathSeparator(joined.charCodeAt(slashCount))) {\r\n\t\t\t\tslashCount++;\r\n\t\t\t}\r\n\r\n\t\t\t// Replace the slashes if needed\r\n\t\t\tif (slashCount >= 2) {\r\n\t\t\t\tjoined = `\\\\${joined.slice(slashCount)}`;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\treturn win32.normalize(joined);\r\n\t},\r\n\r\n\r\n\t// It will solve the relative path from `from` to `to`, for instance:\r\n\t// from = 'C:\\\\orandea\\\\test\\\\aaa'\r\n\t// to = 'C:\\\\orandea\\\\impl\\\\bbb'\r\n\t// The output of the function should be: '..\\\\..\\\\impl\\\\bbb'\r\n\trelative(from: string, to: string): string {\r\n\t\tvalidateString(from, 'from');\r\n\t\tvalidateString(to, 'to');\r\n\r\n\t\tif (from === to) {\r\n\t\t\treturn '';\r\n\t\t}\r\n\r\n\t\tconst fromOrig = win32.resolve(from);\r\n\t\tconst toOrig = win32.resolve(to);\r\n\r\n\t\tif (fromOrig === toOrig) {\r\n\t\t\treturn '';\r\n\t\t}\r\n\r\n\t\tfrom = fromOrig.toLowerCase();\r\n\t\tto = toOrig.toLowerCase();\r\n\r\n\t\tif (from === to) {\r\n\t\t\treturn '';\r\n\t\t}\r\n\r\n\t\t// Trim any leading backslashes\r\n\t\tlet fromStart = 0;\r\n\t\twhile (fromStart < from.length &&\r\n\t\t\tfrom.charCodeAt(fromStart) === CHAR_BACKWARD_SLASH) {\r\n\t\t\tfromStart++;\r\n\t\t}\r\n\t\t// Trim trailing backslashes (applicable to UNC paths only)\r\n\t\tlet fromEnd = from.length;\r\n\t\twhile (fromEnd - 1 > fromStart &&\r\n\t\t\tfrom.charCodeAt(fromEnd - 1) === CHAR_BACKWARD_SLASH) {\r\n\t\t\tfromEnd--;\r\n\t\t}\r\n\t\tconst fromLen = fromEnd - fromStart;\r\n\r\n\t\t// Trim any leading backslashes\r\n\t\tlet toStart = 0;\r\n\t\twhile (toStart < to.length &&\r\n\t\t\tto.charCodeAt(toStart) === CHAR_BACKWARD_SLASH) {\r\n\t\t\ttoStart++;\r\n\t\t}\r\n\t\t// Trim trailing backslashes (applicable to UNC paths only)\r\n\t\tlet toEnd = to.length;\r\n\t\twhile (toEnd - 1 > toStart &&\r\n\t\t\tto.charCodeAt(toEnd - 1) === CHAR_BACKWARD_SLASH) {\r\n\t\t\ttoEnd--;\r\n\t\t}\r\n\t\tconst toLen = toEnd - toStart;\r\n\r\n\t\t// Compare paths to find the longest common path from root\r\n\t\tconst length = fromLen < toLen ? fromLen : toLen;\r\n\t\tlet lastCommonSep = -1;\r\n\t\tlet i = 0;\r\n\t\tfor (; i < length; i++) {\r\n\t\t\tconst fromCode = from.charCodeAt(fromStart + i);\r\n\t\t\tif (fromCode !== to.charCodeAt(toStart + i)) {\r\n\t\t\t\tbreak;\r\n\t\t\t} else if (fromCode === CHAR_BACKWARD_SLASH) {\r\n\t\t\t\tlastCommonSep = i;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\t// We found a mismatch before the first common path separator was seen, so\r\n\t\t// return the original `to`.\r\n\t\tif (i !== length) {\r\n\t\t\tif (lastCommonSep === -1) {\r\n\t\t\t\treturn toOrig;\r\n\t\t\t}\r\n\t\t} else {\r\n\t\t\tif (toLen > length) {\r\n\t\t\t\tif (to.charCodeAt(toStart + i) === CHAR_BACKWARD_SLASH) {\r\n\t\t\t\t\t// We get here if `from` is the exact base path for `to`.\r\n\t\t\t\t\t// For example: from='C:\\\\foo\\\\bar'; to='C:\\\\foo\\\\bar\\\\baz'\r\n\t\t\t\t\treturn toOrig.slice(toStart + i + 1);\r\n\t\t\t\t}\r\n\t\t\t\tif (i === 2) {\r\n\t\t\t\t\t// We get here if `from` is the device root.\r\n\t\t\t\t\t// For example: from='C:\\\\'; to='C:\\\\foo'\r\n\t\t\t\t\treturn toOrig.slice(toStart + i);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tif (fromLen > length) {\r\n\t\t\t\tif (from.charCodeAt(fromStart + i) === CHAR_BACKWARD_SLASH) {\r\n\t\t\t\t\t// We get here if `to` is the exact base path for `from`.\r\n\t\t\t\t\t// For example: from='C:\\\\foo\\\\bar'; to='C:\\\\foo'\r\n\t\t\t\t\tlastCommonSep = i;\r\n\t\t\t\t} else if (i === 2) {\r\n\t\t\t\t\t// We get here if `to` is the device root.\r\n\t\t\t\t\t// For example: from='C:\\\\foo\\\\bar'; to='C:\\\\'\r\n\t\t\t\t\tlastCommonSep = 3;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tif (lastCommonSep === -1) {\r\n\t\t\t\tlastCommonSep = 0;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tlet out = '';\r\n\t\t// Generate the relative path based on the path difference between `to` and\r\n\t\t// `from`\r\n\t\tfor (i = fromStart + lastCommonSep + 1; i <= fromEnd; ++i) {\r\n\t\t\tif (i === fromEnd || from.charCodeAt(i) === CHAR_BACKWARD_SLASH) {\r\n\t\t\t\tout += out.length === 0 ? '..' : '\\\\..';\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\ttoStart += lastCommonSep;\r\n\r\n\t\t// Lastly, append the rest of the destination (`to`) path that comes after\r\n\t\t// the common path parts\r\n\t\tif (out.length > 0) {\r\n\t\t\treturn `${out}${toOrig.slice(toStart, toEnd)}`;\r\n\t\t}\r\n\r\n\t\tif (toOrig.charCodeAt(toStart) === CHAR_BACKWARD_SLASH) {\r\n\t\t\t++toStart;\r\n\t\t}\r\n\r\n\t\treturn toOrig.slice(toStart, toEnd);\r\n\t},\r\n\r\n\ttoNamespacedPath(path: string): string {\r\n\t\t// Note: this will *probably* throw somewhere.\r\n\t\tif (typeof path !== 'string') {\r\n\t\t\treturn path;\r\n\t\t}\r\n\r\n\t\tif (path.length === 0) {\r\n\t\t\treturn '';\r\n\t\t}\r\n\r\n\t\tconst resolvedPath = win32.resolve(path);\r\n\r\n\t\tif (resolvedPath.length <= 2) {\r\n\t\t\treturn path;\r\n\t\t}\r\n\r\n\t\tif (resolvedPath.charCodeAt(0) === CHAR_BACKWARD_SLASH) {\r\n\t\t\t// Possible UNC root\r\n\t\t\tif (resolvedPath.charCodeAt(1) === CHAR_BACKWARD_SLASH) {\r\n\t\t\t\tconst code = resolvedPath.charCodeAt(2);\r\n\t\t\t\tif (code !== CHAR_QUESTION_MARK && code !== CHAR_DOT) {\r\n\t\t\t\t\t// Matched non-long UNC root, convert the path to a long UNC path\r\n\t\t\t\t\treturn `\\\\\\\\?\\\\UNC\\\\${resolvedPath.slice(2)}`;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t} else if (isWindowsDeviceRoot(resolvedPath.charCodeAt(0)) &&\r\n\t\t\tresolvedPath.charCodeAt(1) === CHAR_COLON &&\r\n\t\t\tresolvedPath.charCodeAt(2) === CHAR_BACKWARD_SLASH) {\r\n\t\t\t// Matched device root, convert the path to a long UNC path\r\n\t\t\treturn `\\\\\\\\?\\\\${resolvedPath}`;\r\n\t\t}\r\n\r\n\t\treturn path;\r\n\t},\r\n\r\n\tdirname(path: string): string {\r\n\t\tvalidateString(path, 'path');\r\n\t\tconst len = path.length;\r\n\t\tif (len === 0) {\r\n\t\t\treturn '.';\r\n\t\t}\r\n\t\tlet rootEnd = -1;\r\n\t\tlet offset = 0;\r\n\t\tconst code = path.charCodeAt(0);\r\n\r\n\t\tif (len === 1) {\r\n\t\t\t// `path` contains just a path separator, exit early to avoid\r\n\t\t\t// unnecessary work or a dot.\r\n\t\t\treturn isPathSeparator(code) ? path : '.';\r\n\t\t}\r\n\r\n\t\t// Try to match a root\r\n\t\tif (isPathSeparator(code)) {\r\n\t\t\t// Possible UNC root\r\n\r\n\t\t\trootEnd = offset = 1;\r\n\r\n\t\t\tif (isPathSeparator(path.charCodeAt(1))) {\r\n\t\t\t\t// Matched double path separator at beginning\r\n\t\t\t\tlet j = 2;\r\n\t\t\t\tlet last = j;\r\n\t\t\t\t// Match 1 or more non-path separators\r\n\t\t\t\twhile (j < len && !isPathSeparator(path.charCodeAt(j))) {\r\n\t\t\t\t\tj++;\r\n\t\t\t\t}\r\n\t\t\t\tif (j < len && j !== last) {\r\n\t\t\t\t\t// Matched!\r\n\t\t\t\t\tlast = j;\r\n\t\t\t\t\t// Match 1 or more path separators\r\n\t\t\t\t\twhile (j < len && isPathSeparator(path.charCodeAt(j))) {\r\n\t\t\t\t\t\tj++;\r\n\t\t\t\t\t}\r\n\t\t\t\t\tif (j < len && j !== last) {\r\n\t\t\t\t\t\t// Matched!\r\n\t\t\t\t\t\tlast = j;\r\n\t\t\t\t\t\t// Match 1 or more non-path separators\r\n\t\t\t\t\t\twhile (j < len && !isPathSeparator(path.charCodeAt(j))) {\r\n\t\t\t\t\t\t\tj++;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\tif (j === len) {\r\n\t\t\t\t\t\t\t// We matched a UNC root only\r\n\t\t\t\t\t\t\treturn path;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\tif (j !== last) {\r\n\t\t\t\t\t\t\t// We matched a UNC root with leftovers\r\n\r\n\t\t\t\t\t\t\t// Offset by 1 to include the separator after the UNC root to\r\n\t\t\t\t\t\t\t// treat it as a \"normal root\" on top of a (UNC) root\r\n\t\t\t\t\t\t\trootEnd = offset = j + 1;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\t// Possible device root\r\n\t\t} else if (isWindowsDeviceRoot(code) && path.charCodeAt(1) === CHAR_COLON) {\r\n\t\t\trootEnd = len > 2 && isPathSeparator(path.charCodeAt(2)) ? 3 : 2;\r\n\t\t\toffset = rootEnd;\r\n\t\t}\r\n\r\n\t\tlet end = -1;\r\n\t\tlet matchedSlash = true;\r\n\t\tfor (let i = len - 1; i >= offset; --i) {\r\n\t\t\tif (isPathSeparator(path.charCodeAt(i))) {\r\n\t\t\t\tif (!matchedSlash) {\r\n\t\t\t\t\tend = i;\r\n\t\t\t\t\tbreak;\r\n\t\t\t\t}\r\n\t\t\t} else {\r\n\t\t\t\t// We saw the first non-path separator\r\n\t\t\t\tmatchedSlash = false;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tif (end === -1) {\r\n\t\t\tif (rootEnd === -1) {\r\n\t\t\t\treturn '.';\r\n\t\t\t}\r\n\r\n\t\t\tend = rootEnd;\r\n\t\t}\r\n\t\treturn path.slice(0, end);\r\n\t},\r\n\r\n\tbasename(path: string, ext?: string): string {\r\n\t\tif (ext !== undefined) {\r\n\t\t\tvalidateString(ext, 'ext');\r\n\t\t}\r\n\t\tvalidateString(path, 'path');\r\n\t\tlet start = 0;\r\n\t\tlet end = -1;\r\n\t\tlet matchedSlash = true;\r\n\t\tlet i;\r\n\r\n\t\t// Check for a drive letter prefix so as not to mistake the following\r\n\t\t// path separator as an extra separator at the end of the path that can be\r\n\t\t// disregarded\r\n\t\tif (path.length >= 2 &&\r\n\t\t\tisWindowsDeviceRoot(path.charCodeAt(0)) &&\r\n\t\t\tpath.charCodeAt(1) === CHAR_COLON) {\r\n\t\t\tstart = 2;\r\n\t\t}\r\n\r\n\t\tif (ext !== undefined && ext.length > 0 && ext.length <= path.length) {\r\n\t\t\tif (ext === path) {\r\n\t\t\t\treturn '';\r\n\t\t\t}\r\n\t\t\tlet extIdx = ext.length - 1;\r\n\t\t\tlet firstNonSlashEnd = -1;\r\n\t\t\tfor (i = path.length - 1; i >= start; --i) {\r\n\t\t\t\tconst code = path.charCodeAt(i);\r\n\t\t\t\tif (isPathSeparator(code)) {\r\n\t\t\t\t\t// If we reached a path separator that was not part of a set of path\r\n\t\t\t\t\t// separators at the end of the string, stop now\r\n\t\t\t\t\tif (!matchedSlash) {\r\n\t\t\t\t\t\tstart = i + 1;\r\n\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t}\r\n\t\t\t\t} else {\r\n\t\t\t\t\tif (firstNonSlashEnd === -1) {\r\n\t\t\t\t\t\t// We saw the first non-path separator, remember this index in case\r\n\t\t\t\t\t\t// we need it if the extension ends up not matching\r\n\t\t\t\t\t\tmatchedSlash = false;\r\n\t\t\t\t\t\tfirstNonSlashEnd = i + 1;\r\n\t\t\t\t\t}\r\n\t\t\t\t\tif (extIdx >= 0) {\r\n\t\t\t\t\t\t// Try to match the explicit extension\r\n\t\t\t\t\t\tif (code === ext.charCodeAt(extIdx)) {\r\n\t\t\t\t\t\t\tif (--extIdx === -1) {\r\n\t\t\t\t\t\t\t\t// We matched the extension, so mark this as the end of our path\r\n\t\t\t\t\t\t\t\t// component\r\n\t\t\t\t\t\t\t\tend = i;\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\t// Extension does not match, so our result is the entire path\r\n\t\t\t\t\t\t\t// component\r\n\t\t\t\t\t\t\textIdx = -1;\r\n\t\t\t\t\t\t\tend = firstNonSlashEnd;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\tif (start === end) {\r\n\t\t\t\tend = firstNonSlashEnd;\r\n\t\t\t} else if (end === -1) {\r\n\t\t\t\tend = path.length;\r\n\t\t\t}\r\n\t\t\treturn path.slice(start, end);\r\n\t\t}\r\n\t\tfor (i = path.length - 1; i >= start; --i) {\r\n\t\t\tif (isPathSeparator(path.charCodeAt(i))) {\r\n\t\t\t\t// If we reached a path separator that was not part of a set of path\r\n\t\t\t\t// separators at the end of the string, stop now\r\n\t\t\t\tif (!matchedSlash) {\r\n\t\t\t\t\tstart = i + 1;\r\n\t\t\t\t\tbreak;\r\n\t\t\t\t}\r\n\t\t\t} else if (end === -1) {\r\n\t\t\t\t// We saw the first non-path separator, mark this as the end of our\r\n\t\t\t\t// path component\r\n\t\t\t\tmatchedSlash = false;\r\n\t\t\t\tend = i + 1;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tif (end === -1) {\r\n\t\t\treturn '';\r\n\t\t}\r\n\t\treturn path.slice(start, end);\r\n\t},\r\n\r\n\textname(path: string): string {\r\n\t\tvalidateString(path, 'path');\r\n\t\tlet start = 0;\r\n\t\tlet startDot = -1;\r\n\t\tlet startPart = 0;\r\n\t\tlet end = -1;\r\n\t\tlet matchedSlash = true;\r\n\t\t// Track the state of characters (if any) we see before our first dot and\r\n\t\t// after any path separator we find\r\n\t\tlet preDotState = 0;\r\n\r\n\t\t// Check for a drive letter prefix so as not to mistake the following\r\n\t\t// path separator as an extra separator at the end of the path that can be\r\n\t\t// disregarded\r\n\r\n\t\tif (path.length >= 2 &&\r\n\t\t\tpath.charCodeAt(1) === CHAR_COLON &&\r\n\t\t\tisWindowsDeviceRoot(path.charCodeAt(0))) {\r\n\t\t\tstart = startPart = 2;\r\n\t\t}\r\n\r\n\t\tfor (let i = path.length - 1; i >= start; --i) {\r\n\t\t\tconst code = path.charCodeAt(i);\r\n\t\t\tif (isPathSeparator(code)) {\r\n\t\t\t\t// If we reached a path separator that was not part of a set of path\r\n\t\t\t\t// separators at the end of the string, stop now\r\n\t\t\t\tif (!matchedSlash) {\r\n\t\t\t\t\tstartPart = i + 1;\r\n\t\t\t\t\tbreak;\r\n\t\t\t\t}\r\n\t\t\t\tcontinue;\r\n\t\t\t}\r\n\t\t\tif (end === -1) {\r\n\t\t\t\t// We saw the first non-path separator, mark this as the end of our\r\n\t\t\t\t// extension\r\n\t\t\t\tmatchedSlash = false;\r\n\t\t\t\tend = i + 1;\r\n\t\t\t}\r\n\t\t\tif (code === CHAR_DOT) {\r\n\t\t\t\t// If this is our first dot, mark it as the start of our extension\r\n\t\t\t\tif (startDot === -1) {\r\n\t\t\t\t\tstartDot = i;\r\n\t\t\t\t}\r\n\t\t\t\telse if (preDotState !== 1) {\r\n\t\t\t\t\tpreDotState = 1;\r\n\t\t\t\t}\r\n\t\t\t} else if (startDot !== -1) {\r\n\t\t\t\t// We saw a non-dot and non-path separator before our dot, so we should\r\n\t\t\t\t// have a good chance at having a non-empty extension\r\n\t\t\t\tpreDotState = -1;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tif (startDot === -1 ||\r\n\t\t\tend === -1 ||\r\n\t\t\t// We saw a non-dot character immediately before the dot\r\n\t\t\tpreDotState === 0 ||\r\n\t\t\t// The (right-most) trimmed path component is exactly '..'\r\n\t\t\t(preDotState === 1 &&\r\n\t\t\t\tstartDot === end - 1 &&\r\n\t\t\t\tstartDot === startPart + 1)) {\r\n\t\t\treturn '';\r\n\t\t}\r\n\t\treturn path.slice(startDot, end);\r\n\t},\r\n\r\n\tformat: _format.bind(null, '\\\\'),\r\n\r\n\tparse(path) {\r\n\t\tvalidateString(path, 'path');\r\n\r\n\t\tconst ret = { root: '', dir: '', base: '', ext: '', name: '' };\r\n\t\tif (path.length === 0) {\r\n\t\t\treturn ret;\r\n\t\t}\r\n\r\n\t\tconst len = path.length;\r\n\t\tlet rootEnd = 0;\r\n\t\tlet code = path.charCodeAt(0);\r\n\r\n\t\tif (len === 1) {\r\n\t\t\tif (isPathSeparator(code)) {\r\n\t\t\t\t// `path` contains just a path separator, exit early to avoid\r\n\t\t\t\t// unnecessary work\r\n\t\t\t\tret.root = ret.dir = path;\r\n\t\t\t\treturn ret;\r\n\t\t\t}\r\n\t\t\tret.base = ret.name = path;\r\n\t\t\treturn ret;\r\n\t\t}\r\n\t\t// Try to match a root\r\n\t\tif (isPathSeparator(code)) {\r\n\t\t\t// Possible UNC root\r\n\r\n\t\t\trootEnd = 1;\r\n\t\t\tif (isPathSeparator(path.charCodeAt(1))) {\r\n\t\t\t\t// Matched double path separator at beginning\r\n\t\t\t\tlet j = 2;\r\n\t\t\t\tlet last = j;\r\n\t\t\t\t// Match 1 or more non-path separators\r\n\t\t\t\twhile (j < len && !isPathSeparator(path.charCodeAt(j))) {\r\n\t\t\t\t\tj++;\r\n\t\t\t\t}\r\n\t\t\t\tif (j < len && j !== last) {\r\n\t\t\t\t\t// Matched!\r\n\t\t\t\t\tlast = j;\r\n\t\t\t\t\t// Match 1 or more path separators\r\n\t\t\t\t\twhile (j < len && isPathSeparator(path.charCodeAt(j))) {\r\n\t\t\t\t\t\tj++;\r\n\t\t\t\t\t}\r\n\t\t\t\t\tif (j < len && j !== last) {\r\n\t\t\t\t\t\t// Matched!\r\n\t\t\t\t\t\tlast = j;\r\n\t\t\t\t\t\t// Match 1 or more non-path separators\r\n\t\t\t\t\t\twhile (j < len && !isPathSeparator(path.charCodeAt(j))) {\r\n\t\t\t\t\t\t\tj++;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\tif (j === len) {\r\n\t\t\t\t\t\t\t// We matched a UNC root only\r\n\t\t\t\t\t\t\trootEnd = j;\r\n\t\t\t\t\t\t} else if (j !== last) {\r\n\t\t\t\t\t\t\t// We matched a UNC root with leftovers\r\n\t\t\t\t\t\t\trootEnd = j + 1;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t} else if (isWindowsDeviceRoot(code) && path.charCodeAt(1) === CHAR_COLON) {\r\n\t\t\t// Possible device root\r\n\t\t\tif (len <= 2) {\r\n\t\t\t\t// `path` contains just a drive root, exit early to avoid\r\n\t\t\t\t// unnecessary work\r\n\t\t\t\tret.root = ret.dir = path;\r\n\t\t\t\treturn ret;\r\n\t\t\t}\r\n\t\t\trootEnd = 2;\r\n\t\t\tif (isPathSeparator(path.charCodeAt(2))) {\r\n\t\t\t\tif (len === 3) {\r\n\t\t\t\t\t// `path` contains just a drive root, exit early to avoid\r\n\t\t\t\t\t// unnecessary work\r\n\t\t\t\t\tret.root = ret.dir = path;\r\n\t\t\t\t\treturn ret;\r\n\t\t\t\t}\r\n\t\t\t\trootEnd = 3;\r\n\t\t\t}\r\n\t\t}\r\n\t\tif (rootEnd > 0) {\r\n\t\t\tret.root = path.slice(0, rootEnd);\r\n\t\t}\r\n\r\n\t\tlet startDot = -1;\r\n\t\tlet startPart = rootEnd;\r\n\t\tlet end = -1;\r\n\t\tlet matchedSlash = true;\r\n\t\tlet i = path.length - 1;\r\n\r\n\t\t// Track the state of characters (if any) we see before our first dot and\r\n\t\t// after any path separator we find\r\n\t\tlet preDotState = 0;\r\n\r\n\t\t// Get non-dir info\r\n\t\tfor (; i >= rootEnd; --i) {\r\n\t\t\tcode = path.charCodeAt(i);\r\n\t\t\tif (isPathSeparator(code)) {\r\n\t\t\t\t// If we reached a path separator that was not part of a set of path\r\n\t\t\t\t// separators at the end of the string, stop now\r\n\t\t\t\tif (!matchedSlash) {\r\n\t\t\t\t\tstartPart = i + 1;\r\n\t\t\t\t\tbreak;\r\n\t\t\t\t}\r\n\t\t\t\tcontinue;\r\n\t\t\t}\r\n\t\t\tif (end === -1) {\r\n\t\t\t\t// We saw the first non-path separator, mark this as the end of our\r\n\t\t\t\t// extension\r\n\t\t\t\tmatchedSlash = false;\r\n\t\t\t\tend = i + 1;\r\n\t\t\t}\r\n\t\t\tif (code === CHAR_DOT) {\r\n\t\t\t\t// If this is our first dot, mark it as the start of our extension\r\n\t\t\t\tif (startDot === -1) {\r\n\t\t\t\t\tstartDot = i;\r\n\t\t\t\t} else if (preDotState !== 1) {\r\n\t\t\t\t\tpreDotState = 1;\r\n\t\t\t\t}\r\n\t\t\t} else if (startDot !== -1) {\r\n\t\t\t\t// We saw a non-dot and non-path separator before our dot, so we should\r\n\t\t\t\t// have a good chance at having a non-empty extension\r\n\t\t\t\tpreDotState = -1;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tif (end !== -1) {\r\n\t\t\tif (startDot === -1 ||\r\n\t\t\t\t// We saw a non-dot character immediately before the dot\r\n\t\t\t\tpreDotState === 0 ||\r\n\t\t\t\t// The (right-most) trimmed path component is exactly '..'\r\n\t\t\t\t(preDotState === 1 &&\r\n\t\t\t\t\tstartDot === end - 1 &&\r\n\t\t\t\t\tstartDot === startPart + 1)) {\r\n\t\t\t\tret.base = ret.name = path.slice(startPart, end);\r\n\t\t\t} else {\r\n\t\t\t\tret.name = path.slice(startPart, startDot);\r\n\t\t\t\tret.base = path.slice(startPart, end);\r\n\t\t\t\tret.ext = path.slice(startDot, end);\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\t// If the directory is the root, use the entire root as the `dir` including\r\n\t\t// the trailing slash if any (`C:\\abc` -> `C:\\`). Otherwise, strip out the\r\n\t\t// trailing slash (`C:\\abc\\def` -> `C:\\abc`).\r\n\t\tif (startPart > 0 && startPart !== rootEnd) {\r\n\t\t\tret.dir = path.slice(0, startPart - 1);\r\n\t\t} else {\r\n\t\t\tret.dir = ret.root;\r\n\t\t}\r\n\r\n\t\treturn ret;\r\n\t},\r\n\r\n\tsep: '\\\\',\r\n\tdelimiter: ';',\r\n\twin32: null,\r\n\tposix: null\r\n};\r\n\r\nexport const posix: IPath = {\r\n\t// path.resolve([from ...], to)\r\n\tresolve(...pathSegments: string[]): string {\r\n\t\tlet resolvedPath = '';\r\n\t\tlet resolvedAbsolute = false;\r\n\r\n\t\tfor (let i = pathSegments.length - 1; i >= -1 && !resolvedAbsolute; i--) {\r\n\t\t\tconst path = i >= 0 ? pathSegments[i] : process.cwd();\r\n\r\n\t\t\tvalidateString(path, 'path');\r\n\r\n\t\t\t// Skip empty entries\r\n\t\t\tif (path.length === 0) {\r\n\t\t\t\tcontinue;\r\n\t\t\t}\r\n\r\n\t\t\tresolvedPath = `${path}/${resolvedPath}`;\r\n\t\t\tresolvedAbsolute = path.charCodeAt(0) === CHAR_FORWARD_SLASH;\r\n\t\t}\r\n\r\n\t\t// At this point the path should be resolved to a full absolute path, but\r\n\t\t// handle relative paths to be safe (might happen when process.cwd() fails)\r\n\r\n\t\t// Normalize the path\r\n\t\tresolvedPath = normalizeString(resolvedPath, !resolvedAbsolute, '/',\r\n\t\t\tisPosixPathSeparator);\r\n\r\n\t\tif (resolvedAbsolute) {\r\n\t\t\treturn `/${resolvedPath}`;\r\n\t\t}\r\n\t\treturn resolvedPath.length > 0 ? resolvedPath : '.';\r\n\t},\r\n\r\n\tnormalize(path: string): string {\r\n\t\tvalidateString(path, 'path');\r\n\r\n\t\tif (path.length === 0) {\r\n\t\t\treturn '.';\r\n\t\t}\r\n\r\n\t\tconst isAbsolute = path.charCodeAt(0) === CHAR_FORWARD_SLASH;\r\n\t\tconst trailingSeparator =\r\n\t\t\tpath.charCodeAt(path.length - 1) === CHAR_FORWARD_SLASH;\r\n\r\n\t\t// Normalize the path\r\n\t\tpath = normalizeString(path, !isAbsolute, '/', isPosixPathSeparator);\r\n\r\n\t\tif (path.length === 0) {\r\n\t\t\tif (isAbsolute) {\r\n\t\t\t\treturn '/';\r\n\t\t\t}\r\n\t\t\treturn trailingSeparator ? './' : '.';\r\n\t\t}\r\n\t\tif (trailingSeparator) {\r\n\t\t\tpath += '/';\r\n\t\t}\r\n\r\n\t\treturn isAbsolute ? `/${path}` : path;\r\n\t},\r\n\r\n\tisAbsolute(path: string): boolean {\r\n\t\tvalidateString(path, 'path');\r\n\t\treturn path.length > 0 && path.charCodeAt(0) === CHAR_FORWARD_SLASH;\r\n\t},\r\n\r\n\tjoin(...paths: string[]): string {\r\n\t\tif (paths.length === 0) {\r\n\t\t\treturn '.';\r\n\t\t}\r\n\t\tlet joined;\r\n\t\tfor (let i = 0; i < paths.length; ++i) {\r\n\t\t\tconst arg = paths[i];\r\n\t\t\tvalidateString(arg, 'path');\r\n\t\t\tif (arg.length > 0) {\r\n\t\t\t\tif (joined === undefined) {\r\n\t\t\t\t\tjoined = arg;\r\n\t\t\t\t} else {\r\n\t\t\t\t\tjoined += `/${arg}`;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\tif (joined === undefined) {\r\n\t\t\treturn '.';\r\n\t\t}\r\n\t\treturn posix.normalize(joined);\r\n\t},\r\n\r\n\trelative(from: string, to: string): string {\r\n\t\tvalidateString(from, 'from');\r\n\t\tvalidateString(to, 'to');\r\n\r\n\t\tif (from === to) {\r\n\t\t\treturn '';\r\n\t\t}\r\n\r\n\t\t// Trim leading forward slashes.\r\n\t\tfrom = posix.resolve(from);\r\n\t\tto = posix.resolve(to);\r\n\r\n\t\tif (from === to) {\r\n\t\t\treturn '';\r\n\t\t}\r\n\r\n\t\tconst fromStart = 1;\r\n\t\tconst fromEnd = from.length;\r\n\t\tconst fromLen = fromEnd - fromStart;\r\n\t\tconst toStart = 1;\r\n\t\tconst toLen = to.length - toStart;\r\n\r\n\t\t// Compare paths to find the longest common path from root\r\n\t\tconst length = (fromLen < toLen ? fromLen : toLen);\r\n\t\tlet lastCommonSep = -1;\r\n\t\tlet i = 0;\r\n\t\tfor (; i < length; i++) {\r\n\t\t\tconst fromCode = from.charCodeAt(fromStart + i);\r\n\t\t\tif (fromCode !== to.charCodeAt(toStart + i)) {\r\n\t\t\t\tbreak;\r\n\t\t\t} else if (fromCode === CHAR_FORWARD_SLASH) {\r\n\t\t\t\tlastCommonSep = i;\r\n\t\t\t}\r\n\t\t}\r\n\t\tif (i === length) {\r\n\t\t\tif (toLen > length) {\r\n\t\t\t\tif (to.charCodeAt(toStart + i) === CHAR_FORWARD_SLASH) {\r\n\t\t\t\t\t// We get here if `from` is the exact base path for `to`.\r\n\t\t\t\t\t// For example: from='/foo/bar'; to='/foo/bar/baz'\r\n\t\t\t\t\treturn to.slice(toStart + i + 1);\r\n\t\t\t\t}\r\n\t\t\t\tif (i === 0) {\r\n\t\t\t\t\t// We get here if `from` is the root\r\n\t\t\t\t\t// For example: from='/'; to='/foo'\r\n\t\t\t\t\treturn to.slice(toStart + i);\r\n\t\t\t\t}\r\n\t\t\t} else if (fromLen > length) {\r\n\t\t\t\tif (from.charCodeAt(fromStart + i) === CHAR_FORWARD_SLASH) {\r\n\t\t\t\t\t// We get here if `to` is the exact base path for `from`.\r\n\t\t\t\t\t// For example: from='/foo/bar/baz'; to='/foo/bar'\r\n\t\t\t\t\tlastCommonSep = i;\r\n\t\t\t\t} else if (i === 0) {\r\n\t\t\t\t\t// We get here if `to` is the root.\r\n\t\t\t\t\t// For example: from='/foo/bar'; to='/'\r\n\t\t\t\t\tlastCommonSep = 0;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tlet out = '';\r\n\t\t// Generate the relative path based on the path difference between `to`\r\n\t\t// and `from`.\r\n\t\tfor (i = fromStart + lastCommonSep + 1; i <= fromEnd; ++i) {\r\n\t\t\tif (i === fromEnd || from.charCodeAt(i) === CHAR_FORWARD_SLASH) {\r\n\t\t\t\tout += out.length === 0 ? '..' : '/..';\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\t// Lastly, append the rest of the destination (`to`) path that comes after\r\n\t\t// the common path parts.\r\n\t\treturn `${out}${to.slice(toStart + lastCommonSep)}`;\r\n\t},\r\n\r\n\ttoNamespacedPath(path: string): string {\r\n\t\t// Non-op on posix systems\r\n\t\treturn path;\r\n\t},\r\n\r\n\tdirname(path: string): string {\r\n\t\tvalidateString(path, 'path');\r\n\t\tif (path.length === 0) {\r\n\t\t\treturn '.';\r\n\t\t}\r\n\t\tconst hasRoot = path.charCodeAt(0) === CHAR_FORWARD_SLASH;\r\n\t\tlet end = -1;\r\n\t\tlet matchedSlash = true;\r\n\t\tfor (let i = path.length - 1; i >= 1; --i) {\r\n\t\t\tif (path.charCodeAt(i) === CHAR_FORWARD_SLASH) {\r\n\t\t\t\tif (!matchedSlash) {\r\n\t\t\t\t\tend = i;\r\n\t\t\t\t\tbreak;\r\n\t\t\t\t}\r\n\t\t\t} else {\r\n\t\t\t\t// We saw the first non-path separator\r\n\t\t\t\tmatchedSlash = false;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tif (end === -1) {\r\n\t\t\treturn hasRoot ? '/' : '.';\r\n\t\t}\r\n\t\tif (hasRoot && end === 1) {\r\n\t\t\treturn '//';\r\n\t\t}\r\n\t\treturn path.slice(0, end);\r\n\t},\r\n\r\n\tbasename(path: string, ext?: string): string {\r\n\t\tif (ext !== undefined) {\r\n\t\t\tvalidateString(ext, 'ext');\r\n\t\t}\r\n\t\tvalidateString(path, 'path');\r\n\r\n\t\tlet start = 0;\r\n\t\tlet end = -1;\r\n\t\tlet matchedSlash = true;\r\n\t\tlet i;\r\n\r\n\t\tif (ext !== undefined && ext.length > 0 && ext.length <= path.length) {\r\n\t\t\tif (ext === path) {\r\n\t\t\t\treturn '';\r\n\t\t\t}\r\n\t\t\tlet extIdx = ext.length - 1;\r\n\t\t\tlet firstNonSlashEnd = -1;\r\n\t\t\tfor (i = path.length - 1; i >= 0; --i) {\r\n\t\t\t\tconst code = path.charCodeAt(i);\r\n\t\t\t\tif (code === CHAR_FORWARD_SLASH) {\r\n\t\t\t\t\t// If we reached a path separator that was not part of a set of path\r\n\t\t\t\t\t// separators at the end of the string, stop now\r\n\t\t\t\t\tif (!matchedSlash) {\r\n\t\t\t\t\t\tstart = i + 1;\r\n\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t}\r\n\t\t\t\t} else {\r\n\t\t\t\t\tif (firstNonSlashEnd === -1) {\r\n\t\t\t\t\t\t// We saw the first non-path separator, remember this index in case\r\n\t\t\t\t\t\t// we need it if the extension ends up not matching\r\n\t\t\t\t\t\tmatchedSlash = false;\r\n\t\t\t\t\t\tfirstNonSlashEnd = i + 1;\r\n\t\t\t\t\t}\r\n\t\t\t\t\tif (extIdx >= 0) {\r\n\t\t\t\t\t\t// Try to match the explicit extension\r\n\t\t\t\t\t\tif (code === ext.charCodeAt(extIdx)) {\r\n\t\t\t\t\t\t\tif (--extIdx === -1) {\r\n\t\t\t\t\t\t\t\t// We matched the extension, so mark this as the end of our path\r\n\t\t\t\t\t\t\t\t// component\r\n\t\t\t\t\t\t\t\tend = i;\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\t// Extension does not match, so our result is the entire path\r\n\t\t\t\t\t\t\t// component\r\n\t\t\t\t\t\t\textIdx = -1;\r\n\t\t\t\t\t\t\tend = firstNonSlashEnd;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\tif (start === end) {\r\n\t\t\t\tend = firstNonSlashEnd;\r\n\t\t\t} else if (end === -1) {\r\n\t\t\t\tend = path.length;\r\n\t\t\t}\r\n\t\t\treturn path.slice(start, end);\r\n\t\t}\r\n\t\tfor (i = path.length - 1; i >= 0; --i) {\r\n\t\t\tif (path.charCodeAt(i) === CHAR_FORWARD_SLASH) {\r\n\t\t\t\t// If we reached a path separator that was not part of a set of path\r\n\t\t\t\t// separators at the end of the string, stop now\r\n\t\t\t\tif (!matchedSlash) {\r\n\t\t\t\t\tstart = i + 1;\r\n\t\t\t\t\tbreak;\r\n\t\t\t\t}\r\n\t\t\t} else if (end === -1) {\r\n\t\t\t\t// We saw the first non-path separator, mark this as the end of our\r\n\t\t\t\t// path component\r\n\t\t\t\tmatchedSlash = false;\r\n\t\t\t\tend = i + 1;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tif (end === -1) {\r\n\t\t\treturn '';\r\n\t\t}\r\n\t\treturn path.slice(start, end);\r\n\t},\r\n\r\n\textname(path: string): string {\r\n\t\tvalidateString(path, 'path');\r\n\t\tlet startDot = -1;\r\n\t\tlet startPart = 0;\r\n\t\tlet end = -1;\r\n\t\tlet matchedSlash = true;\r\n\t\t// Track the state of characters (if any) we see before our first dot and\r\n\t\t// after any path separator we find\r\n\t\tlet preDotState = 0;\r\n\t\tfor (let i = path.length - 1; i >= 0; --i) {\r\n\t\t\tconst code = path.charCodeAt(i);\r\n\t\t\tif (code === CHAR_FORWARD_SLASH) {\r\n\t\t\t\t// If we reached a path separator that was not part of a set of path\r\n\t\t\t\t// separators at the end of the string, stop now\r\n\t\t\t\tif (!matchedSlash) {\r\n\t\t\t\t\tstartPart = i + 1;\r\n\t\t\t\t\tbreak;\r\n\t\t\t\t}\r\n\t\t\t\tcontinue;\r\n\t\t\t}\r\n\t\t\tif (end === -1) {\r\n\t\t\t\t// We saw the first non-path separator, mark this as the end of our\r\n\t\t\t\t// extension\r\n\t\t\t\tmatchedSlash = false;\r\n\t\t\t\tend = i + 1;\r\n\t\t\t}\r\n\t\t\tif (code === CHAR_DOT) {\r\n\t\t\t\t// If this is our first dot, mark it as the start of our extension\r\n\t\t\t\tif (startDot === -1) {\r\n\t\t\t\t\tstartDot = i;\r\n\t\t\t\t}\r\n\t\t\t\telse if (preDotState !== 1) {\r\n\t\t\t\t\tpreDotState = 1;\r\n\t\t\t\t}\r\n\t\t\t} else if (startDot !== -1) {\r\n\t\t\t\t// We saw a non-dot and non-path separator before our dot, so we should\r\n\t\t\t\t// have a good chance at having a non-empty extension\r\n\t\t\t\tpreDotState = -1;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tif (startDot === -1 ||\r\n\t\t\tend === -1 ||\r\n\t\t\t// We saw a non-dot character immediately before the dot\r\n\t\t\tpreDotState === 0 ||\r\n\t\t\t// The (right-most) trimmed path component is exactly '..'\r\n\t\t\t(preDotState === 1 &&\r\n\t\t\t\tstartDot === end - 1 &&\r\n\t\t\t\tstartDot === startPart + 1)) {\r\n\t\t\treturn '';\r\n\t\t}\r\n\t\treturn path.slice(startDot, end);\r\n\t},\r\n\r\n\tformat: _format.bind(null, '/'),\r\n\r\n\tparse(path: string): ParsedPath {\r\n\t\tvalidateString(path, 'path');\r\n\r\n\t\tconst ret = { root: '', dir: '', base: '', ext: '', name: '' };\r\n\t\tif (path.length === 0) {\r\n\t\t\treturn ret;\r\n\t\t}\r\n\t\tconst isAbsolute = path.charCodeAt(0) === CHAR_FORWARD_SLASH;\r\n\t\tlet start;\r\n\t\tif (isAbsolute) {\r\n\t\t\tret.root = '/';\r\n\t\t\tstart = 1;\r\n\t\t} else {\r\n\t\t\tstart = 0;\r\n\t\t}\r\n\t\tlet startDot = -1;\r\n\t\tlet startPart = 0;\r\n\t\tlet end = -1;\r\n\t\tlet matchedSlash = true;\r\n\t\tlet i = path.length - 1;\r\n\r\n\t\t// Track the state of characters (if any) we see before our first dot and\r\n\t\t// after any path separator we find\r\n\t\tlet preDotState = 0;\r\n\r\n\t\t// Get non-dir info\r\n\t\tfor (; i >= start; --i) {\r\n\t\t\tconst code = path.charCodeAt(i);\r\n\t\t\tif (code === CHAR_FORWARD_SLASH) {\r\n\t\t\t\t// If we reached a path separator that was not part of a set of path\r\n\t\t\t\t// separators at the end of the string, stop now\r\n\t\t\t\tif (!matchedSlash) {\r\n\t\t\t\t\tstartPart = i + 1;\r\n\t\t\t\t\tbreak;\r\n\t\t\t\t}\r\n\t\t\t\tcontinue;\r\n\t\t\t}\r\n\t\t\tif (end === -1) {\r\n\t\t\t\t// We saw the first non-path separator, mark this as the end of our\r\n\t\t\t\t// extension\r\n\t\t\t\tmatchedSlash = false;\r\n\t\t\t\tend = i + 1;\r\n\t\t\t}\r\n\t\t\tif (code === CHAR_DOT) {\r\n\t\t\t\t// If this is our first dot, mark it as the start of our extension\r\n\t\t\t\tif (startDot === -1) {\r\n\t\t\t\t\tstartDot = i;\r\n\t\t\t\t} else if (preDotState !== 1) {\r\n\t\t\t\t\tpreDotState = 1;\r\n\t\t\t\t}\r\n\t\t\t} else if (startDot !== -1) {\r\n\t\t\t\t// We saw a non-dot and non-path separator before our dot, so we should\r\n\t\t\t\t// have a good chance at having a non-empty extension\r\n\t\t\t\tpreDotState = -1;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tif (end !== -1) {\r\n\t\t\tconst start = startPart === 0 && isAbsolute ? 1 : startPart;\r\n\t\t\tif (startDot === -1 ||\r\n\t\t\t\t// We saw a non-dot character immediately before the dot\r\n\t\t\t\tpreDotState === 0 ||\r\n\t\t\t\t// The (right-most) trimmed path component is exactly '..'\r\n\t\t\t\t(preDotState === 1 &&\r\n\t\t\t\t\tstartDot === end - 1 &&\r\n\t\t\t\t\tstartDot === startPart + 1)) {\r\n\t\t\t\tret.base = ret.name = path.slice(start, end);\r\n\t\t\t} else {\r\n\t\t\t\tret.name = path.slice(start, startDot);\r\n\t\t\t\tret.base = path.slice(start, end);\r\n\t\t\t\tret.ext = path.slice(startDot, end);\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tif (startPart > 0) {\r\n\t\t\tret.dir = path.slice(0, startPart - 1);\r\n\t\t} else if (isAbsolute) {\r\n\t\t\tret.dir = '/';\r\n\t\t}\r\n\r\n\t\treturn ret;\r\n\t},\r\n\r\n\tsep: '/',\r\n\tdelimiter: ':',\r\n\twin32: null,\r\n\tposix: null\r\n};\r\n\r\nposix.win32 = win32.win32 = win32;\r\nposix.posix = win32.posix = posix;\r\n\r\nexport const normalize = (process.platform === 'win32' ? win32.normalize : posix.normalize);\r\nexport const resolve = (process.platform === 'win32' ? win32.resolve : posix.resolve);\r\nexport const relative = (process.platform === 'win32' ? win32.relative : posix.relative);\r\nexport const dirname = (process.platform === 'win32' ? win32.dirname : posix.dirname);\r\nexport const basename = (process.platform === 'win32' ? win32.basename : posix.basename);\r\nexport const extname = (process.platform === 'win32' ? win32.extname : posix.extname);\r\nexport const sep = (process.platform === 'win32' ? win32.sep : posix.sep);\r\n","/*---------------------------------------------------------------------------------------------\r\n * Copyright (c) Microsoft Corporation. All rights reserved.\r\n * Licensed under the MIT License. See License.txt in the project root for license information.\r\n *--------------------------------------------------------------------------------------------*/\r\n\r\nimport { CharCode } from 'vs/base/common/charCode';\r\nimport { Constants } from 'vs/base/common/uint';\r\n\r\nexport function isFalsyOrWhitespace(str: string | undefined): boolean {\r\n\tif (!str || typeof str !== 'string') {\r\n\t\treturn true;\r\n\t}\r\n\treturn str.trim().length === 0;\r\n}\r\n\r\n/**\r\n * @deprecated ES6: use `String.padStart`\r\n */\r\nexport function pad(n: number, l: number, char: string = '0'): string {\r\n\tconst str = '' + n;\r\n\tconst r = [str];\r\n\r\n\tfor (let i = str.length; i < l; i++) {\r\n\t\tr.push(char);\r\n\t}\r\n\r\n\treturn r.reverse().join('');\r\n}\r\n\r\nconst _formatRegexp = /{(\\d+)}/g;\r\n\r\n/**\r\n * Helper to produce a string with a variable number of arguments. Insert variable segments\r\n * into the string using the {n} notation where N is the index of the argument following the string.\r\n * @param value string to which formatting is applied\r\n * @param args replacements for {n}-entries\r\n */\r\nexport function format(value: string, ...args: any[]): string {\r\n\tif (args.length === 0) {\r\n\t\treturn value;\r\n\t}\r\n\treturn value.replace(_formatRegexp, function (match, group) {\r\n\t\tconst idx = parseInt(group, 10);\r\n\t\treturn isNaN(idx) || idx < 0 || idx >= args.length ?\r\n\t\t\tmatch :\r\n\t\t\targs[idx];\r\n\t});\r\n}\r\n\r\n/**\r\n * Converts HTML characters inside the string to use entities instead. Makes the string safe from\r\n * being used e.g. in HTMLElement.innerHTML.\r\n */\r\nexport function escape(html: string): string {\r\n\treturn html.replace(/[<>&]/g, function (match) {\r\n\t\tswitch (match) {\r\n\t\t\tcase '<': return '<';\r\n\t\t\tcase '>': return '>';\r\n\t\t\tcase '&': return '&';\r\n\t\t\tdefault: return match;\r\n\t\t}\r\n\t});\r\n}\r\n\r\n/**\r\n * Escapes regular expression characters in a given string\r\n */\r\nexport function escapeRegExpCharacters(value: string): string {\r\n\treturn value.replace(/[\\\\\\{\\}\\*\\+\\?\\|\\^\\$\\.\\[\\]\$\$]/g, '\\\\$&');\r\n}\r\n\r\n/**\r\n * Removes all occurrences of needle from the beginning and end of haystack.\r\n * @param haystack string to trim\r\n * @param needle the thing to trim (default is a blank)\r\n */\r\nexport function trim(haystack: string, needle: string = ' '): string {\r\n\tconst trimmed = ltrim(haystack, needle);\r\n\treturn rtrim(trimmed, needle);\r\n}\r\n\r\n/**\r\n * Removes all occurrences of needle from the beginning of haystack.\r\n * @param haystack string to trim\r\n * @param needle the thing to trim\r\n */\r\nexport function ltrim(haystack: string, needle: string): string {\r\n\tif (!haystack || !needle) {\r\n\t\treturn haystack;\r\n\t}\r\n\r\n\tconst needleLen = needle.length;\r\n\tif (needleLen === 0 || haystack.length === 0) {\r\n\t\treturn haystack;\r\n\t}\r\n\r\n\tlet offset = 0;\r\n\r\n\twhile (haystack.indexOf(needle, offset) === offset) {\r\n\t\toffset = offset + needleLen;\r\n\t}\r\n\treturn haystack.substring(offset);\r\n}\r\n\r\n/**\r\n * Removes all occurrences of needle from the end of haystack.\r\n * @param haystack string to trim\r\n * @param needle the thing to trim\r\n */\r\nexport function rtrim(haystack: string, needle: string): string {\r\n\tif (!haystack || !needle) {\r\n\t\treturn haystack;\r\n\t}\r\n\r\n\tconst needleLen = needle.length,\r\n\t\thaystackLen = haystack.length;\r\n\r\n\tif (needleLen === 0 || haystackLen === 0) {\r\n\t\treturn haystack;\r\n\t}\r\n\r\n\tlet offset = haystackLen,\r\n\t\tidx = -1;\r\n\r\n\twhile (true) {\r\n\t\tidx = haystack.lastIndexOf(needle, offset - 1);\r\n\t\tif (idx === -1 || idx + needleLen !== offset) {\r\n\t\t\tbreak;\r\n\t\t}\r\n\t\tif (idx === 0) {\r\n\t\t\treturn '';\r\n\t\t}\r\n\t\toffset = idx;\r\n\t}\r\n\r\n\treturn haystack.substring(0, offset);\r\n}\r\n\r\nexport function convertSimple2RegExpPattern(pattern: string): string {\r\n\treturn pattern.replace(/[\\-\\\\\\{\\}\\+\\?\\|\\^\\$\\.\\,\\[\\]\$\$\\#\\s]/g, '\\\\$&').replace(/[\\*]/g, '.*');\r\n}\r\n\r\nexport function stripWildcards(pattern: string): string {\r\n\treturn pattern.replace(/\\*/g, '');\r\n}\r\n\r\n/**\r\n * @deprecated ES6: use `String.startsWith`\r\n */\r\nexport function startsWith(haystack: string, needle: string): boolean {\r\n\tif (haystack.length < needle.length) {\r\n\t\treturn false;\r\n\t}\r\n\r\n\tif (haystack === needle) {\r\n\t\treturn true;\r\n\t}\r\n\r\n\tfor (let i = 0; i < needle.length; i++) {\r\n\t\tif (haystack[i] !== needle[i]) {\r\n\t\t\treturn false;\r\n\t\t}\r\n\t}\r\n\r\n\treturn true;\r\n}\r\n\r\n/**\r\n * @deprecated ES6: use `String.endsWith`\r\n */\r\nexport function endsWith(haystack: string, needle: string): boolean {\r\n\tconst diff = haystack.length - needle.length;\r\n\tif (diff > 0) {\r\n\t\treturn haystack.indexOf(needle, diff) === diff;\r\n\t} else if (diff === 0) {\r\n\t\treturn haystack === needle;\r\n\t} else {\r\n\t\treturn false;\r\n\t}\r\n}\r\n\r\nexport interface RegExpOptions {\r\n\tmatchCase?: boolean;\r\n\twholeWord?: boolean;\r\n\tmultiline?: boolean;\r\n\tglobal?: boolean;\r\n\tunicode?: boolean;\r\n}\r\n\r\nexport function createRegExp(searchString: string, isRegex: boolean, options: RegExpOptions = {}): RegExp {\r\n\tif (!searchString) {\r\n\t\tthrow new Error('Cannot create regex from empty string');\r\n\t}\r\n\tif (!isRegex) {\r\n\t\tsearchString = escapeRegExpCharacters(searchString);\r\n\t}\r\n\tif (options.wholeWord) {\r\n\t\tif (!/\\B/.test(searchString.charAt(0))) {\r\n\t\t\tsearchString = '\\\\b' + searchString;\r\n\t\t}\r\n\t\tif (!/\\B/.test(searchString.charAt(searchString.length - 1))) {\r\n\t\t\tsearchString = searchString + '\\\\b';\r\n\t\t}\r\n\t}\r\n\tlet modifiers = '';\r\n\tif (options.global) {\r\n\t\tmodifiers += 'g';\r\n\t}\r\n\tif (!options.matchCase) {\r\n\t\tmodifiers += 'i';\r\n\t}\r\n\tif (options.multiline) {\r\n\t\tmodifiers += 'm';\r\n\t}\r\n\tif (options.unicode) {\r\n\t\tmodifiers += 'u';\r\n\t}\r\n\r\n\treturn new RegExp(searchString, modifiers);\r\n}\r\n\r\nexport function regExpLeadsToEndlessLoop(regexp: RegExp): boolean {\r\n\t// Exit early if it's one of these special cases which are meant to match\r\n\t// against an empty string\r\n\tif (regexp.source === '^' || regexp.source === '^$' || regexp.source === '$' || regexp.source === '^\\\\s*$') {\r\n\t\treturn false;\r\n\t}\r\n\r\n\t// We check against an empty string. If the regular expression doesn't advance\r\n\t// (e.g. ends in an endless loop) it will match an empty string.\r\n\tconst match = regexp.exec('');\r\n\treturn !!(match && regexp.lastIndex === 0);\r\n}\r\n\r\nexport function regExpFlags(regexp: RegExp): string {\r\n\treturn (regexp.global ? 'g' : '')\r\n\t\t+ (regexp.ignoreCase ? 'i' : '')\r\n\t\t+ (regexp.multiline ? 'm' : '')\r\n\t\t+ ((regexp as any /* standalone editor compilation */).unicode ? 'u' : '');\r\n}\r\n\r\n/**\r\n * Returns first index of the string that is not whitespace.\r\n * If string is empty or contains only whitespaces, returns -1\r\n */\r\nexport function firstNonWhitespaceIndex(str: string): number {\r\n\tfor (let i = 0, len = str.length; i < len; i++) {\r\n\t\tconst chCode = str.charCodeAt(i);\r\n\t\tif (chCode !== CharCode.Space && chCode !== CharCode.Tab) {\r\n\t\t\treturn i;\r\n\t\t}\r\n\t}\r\n\treturn -1;\r\n}\r\n\r\n/**\r\n * Returns the leading whitespace of the string.\r\n * If the string contains only whitespaces, returns entire string\r\n */\r\nexport function getLeadingWhitespace(str: string, start: number = 0, end: number = str.length): string {\r\n\tfor (let i = start; i < end; i++) {\r\n\t\tconst chCode = str.charCodeAt(i);\r\n\t\tif (chCode !== CharCode.Space && chCode !== CharCode.Tab) {\r\n\t\t\treturn str.substring(start, i);\r\n\t\t}\r\n\t}\r\n\treturn str.substring(start, end);\r\n}\r\n\r\n/**\r\n * Returns last index of the string that is not whitespace.\r\n * If string is empty or contains only whitespaces, returns -1\r\n */\r\nexport function lastNonWhitespaceIndex(str: string, startIndex: number = str.length - 1): number {\r\n\tfor (let i = startIndex; i >= 0; i--) {\r\n\t\tconst chCode = str.charCodeAt(i);\r\n\t\tif (chCode !== CharCode.Space && chCode !== CharCode.Tab) {\r\n\t\t\treturn i;\r\n\t\t}\r\n\t}\r\n\treturn -1;\r\n}\r\n\r\nexport function compare(a: string, b: string): number {\r\n\tif (a < b) {\r\n\t\treturn -1;\r\n\t} else if (a > b) {\r\n\t\treturn 1;\r\n\t} else {\r\n\t\treturn 0;\r\n\t}\r\n}\r\n\r\nexport function compareSubstring(a: string, b: string, aStart: number = 0, aEnd: number = a.length, bStart: number = 0, bEnd: number = b.length): number {\r\n\tfor (; aStart < aEnd && bStart < bEnd; aStart++, bStart++) {\r\n\t\tlet codeA = a.charCodeAt(aStart);\r\n\t\tlet codeB = b.charCodeAt(bStart);\r\n\t\tif (codeA < codeB) {\r\n\t\t\treturn -1;\r\n\t\t} else if (codeA > codeB) {\r\n\t\t\treturn 1;\r\n\t\t}\r\n\t}\r\n\tconst aLen = aEnd - aStart;\r\n\tconst bLen = bEnd - bStart;\r\n\tif (aLen < bLen) {\r\n\t\treturn -1;\r\n\t} else if (aLen > bLen) {\r\n\t\treturn 1;\r\n\t}\r\n\treturn 0;\r\n}\r\n\r\nexport function compareIgnoreCase(a: string, b: string): number {\r\n\treturn compareSubstringIgnoreCase(a, b, 0, a.length, 0, b.length);\r\n}\r\n\r\nexport function compareSubstringIgnoreCase(a: string, b: string, aStart: number = 0, aEnd: number = a.length, bStart: number = 0, bEnd: number = b.length): number {\r\n\r\n\tfor (; aStart < aEnd && bStart < bEnd; aStart++, bStart++) {\r\n\r\n\t\tlet codeA = a.charCodeAt(aStart);\r\n\t\tlet codeB = b.charCodeAt(bStart);\r\n\r\n\t\tif (codeA === codeB) {\r\n\t\t\t// equal\r\n\t\t\tcontinue;\r\n\t\t}\r\n\r\n\t\tconst diff = codeA - codeB;\r\n\t\tif (diff === 32 && isUpperAsciiLetter(codeB)) { //codeB =[65-90] && codeA =[97-122]\r\n\t\t\tcontinue;\r\n\r\n\t\t} else if (diff === -32 && isUpperAsciiLetter(codeA)) { //codeB =[97-122] && codeA =[65-90]\r\n\t\t\tcontinue;\r\n\t\t}\r\n\r\n\t\tif (isLowerAsciiLetter(codeA) && isLowerAsciiLetter(codeB)) {\r\n\t\t\t//\r\n\t\t\treturn diff;\r\n\r\n\t\t} else {\r\n\t\t\treturn compareSubstring(a.toLowerCase(), b.toLowerCase(), aStart, aEnd, bStart, bEnd);\r\n\t\t}\r\n\t}\r\n\r\n\tconst aLen = aEnd - aStart;\r\n\tconst bLen = bEnd - bStart;\r\n\r\n\tif (aLen < bLen) {\r\n\t\treturn -1;\r\n\t} else if (aLen > bLen) {\r\n\t\treturn 1;\r\n\t}\r\n\r\n\treturn 0;\r\n}\r\n\r\nexport function isLowerAsciiLetter(code: number): boolean {\r\n\treturn code >= CharCode.a && code <= CharCode.z;\r\n}\r\n\r\nexport function isUpperAsciiLetter(code: number): boolean {\r\n\treturn code >= CharCode.A && code <= CharCode.Z;\r\n}\r\n\r\nfunction isAsciiLetter(code: number): boolean {\r\n\treturn isLowerAsciiLetter(code) || isUpperAsciiLetter(code);\r\n}\r\n\r\nexport function equalsIgnoreCase(a: string, b: string): boolean {\r\n\treturn a.length === b.length && doEqualsIgnoreCase(a, b);\r\n}\r\n\r\nfunction doEqualsIgnoreCase(a: string, b: string, stopAt = a.length): boolean {\r\n\tfor (let i = 0; i < stopAt; i++) {\r\n\t\tconst codeA = a.charCodeAt(i);\r\n\t\tconst codeB = b.charCodeAt(i);\r\n\r\n\t\tif (codeA === codeB) {\r\n\t\t\tcontinue;\r\n\t\t}\r\n\r\n\t\t// a-z A-Z\r\n\t\tif (isAsciiLetter(codeA) && isAsciiLetter(codeB)) {\r\n\t\t\tconst diff = Math.abs(codeA - codeB);\r\n\t\t\tif (diff !== 0 && diff !== 32) {\r\n\t\t\t\treturn false;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\t// Any other charcode\r\n\t\telse {\r\n\t\t\tif (String.fromCharCode(codeA).toLowerCase() !== String.fromCharCode(codeB).toLowerCase()) {\r\n\t\t\t\treturn false;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\treturn true;\r\n}\r\n\r\nexport function startsWithIgnoreCase(str: string, candidate: string): boolean {\r\n\tconst candidateLength = candidate.length;\r\n\tif (candidate.length > str.length) {\r\n\t\treturn false;\r\n\t}\r\n\r\n\treturn doEqualsIgnoreCase(str, candidate, candidateLength);\r\n}\r\n\r\n/**\r\n * @returns the length of the common prefix of the two strings.\r\n */\r\nexport function commonPrefixLength(a: string, b: string): number {\r\n\r\n\tlet i: number,\r\n\t\tlen = Math.min(a.length, b.length);\r\n\r\n\tfor (i = 0; i < len; i++) {\r\n\t\tif (a.charCodeAt(i) !== b.charCodeAt(i)) {\r\n\t\t\treturn i;\r\n\t\t}\r\n\t}\r\n\r\n\treturn len;\r\n}\r\n\r\n/**\r\n * @returns the length of the common suffix of the two strings.\r\n */\r\nexport function commonSuffixLength(a: string, b: string): number {\r\n\r\n\tlet i: number,\r\n\t\tlen = Math.min(a.length, b.length);\r\n\r\n\tconst aLastIndex = a.length - 1;\r\n\tconst bLastIndex = b.length - 1;\r\n\r\n\tfor (i = 0; i < len; i++) {\r\n\t\tif (a.charCodeAt(aLastIndex - i) !== b.charCodeAt(bLastIndex - i)) {\r\n\t\t\treturn i;\r\n\t\t}\r\n\t}\r\n\r\n\treturn len;\r\n}\r\n\r\n/**\r\n * See http://en.wikipedia.org/wiki/Surrogate_pair\r\n */\r\nexport function isHighSurrogate(charCode: number): boolean {\r\n\treturn (0xD800 <= charCode && charCode <= 0xDBFF);\r\n}\r\n\r\n/**\r\n * See http://en.wikipedia.org/wiki/Surrogate_pair\r\n */\r\nexport function isLowSurrogate(charCode: number): boolean {\r\n\treturn (0xDC00 <= charCode && charCode <= 0xDFFF);\r\n}\r\n\r\n/**\r\n * See http://en.wikipedia.org/wiki/Surrogate_pair\r\n */\r\nexport function computeCodePoint(highSurrogate: number, lowSurrogate: number): number {\r\n\treturn ((highSurrogate - 0xD800) << 10) + (lowSurrogate - 0xDC00) + 0x10000;\r\n}\r\n\r\n/**\r\n * get the code point that begins at offset `offset`\r\n */\r\nexport function getNextCodePoint(str: string, len: number, offset: number): number {\r\n\tconst charCode = str.charCodeAt(offset);\r\n\tif (isHighSurrogate(charCode) && offset + 1 < len) {\r\n\t\tconst nextCharCode = str.charCodeAt(offset + 1);\r\n\t\tif (isLowSurrogate(nextCharCode)) {\r\n\t\t\treturn computeCodePoint(charCode, nextCharCode);\r\n\t\t}\r\n\t}\r\n\treturn charCode;\r\n}\r\n\r\n/**\r\n * get the code point that ends right before offset `offset`\r\n */\r\nfunction getPrevCodePoint(str: string, offset: number): number {\r\n\tconst charCode = str.charCodeAt(offset - 1);\r\n\tif (isLowSurrogate(charCode) && offset > 1) {\r\n\t\tconst prevCharCode = str.charCodeAt(offset - 2);\r\n\t\tif (isHighSurrogate(prevCharCode)) {\r\n\t\t\treturn computeCodePoint(prevCharCode, charCode);\r\n\t\t}\r\n\t}\r\n\treturn charCode;\r\n}\r\n\r\nexport function nextCharLength(str: string, offset: number): number {\r\n\tconst graphemeBreakTree = GraphemeBreakTree.getInstance();\r\n\tconst initialOffset = offset;\r\n\tconst len = str.length;\r\n\r\n\tconst initialCodePoint = getNextCodePoint(str, len, offset);\r\n\toffset += (initialCodePoint >= Constants.UNICODE_SUPPLEMENTARY_PLANE_BEGIN ? 2 : 1);\r\n\r\n\tlet graphemeBreakType = graphemeBreakTree.getGraphemeBreakType(initialCodePoint);\r\n\twhile (offset < len) {\r\n\t\tconst nextCodePoint = getNextCodePoint(str, len, offset);\r\n\t\tconst nextGraphemeBreakType = graphemeBreakTree.getGraphemeBreakType(nextCodePoint);\r\n\t\tif (breakBetweenGraphemeBreakType(graphemeBreakType, nextGraphemeBreakType)) {\r\n\t\t\tbreak;\r\n\t\t}\r\n\t\toffset += (nextCodePoint >= Constants.UNICODE_SUPPLEMENTARY_PLANE_BEGIN ? 2 : 1);\r\n\t\tgraphemeBreakType = nextGraphemeBreakType;\r\n\t}\r\n\r\n\treturn (offset - initialOffset);\r\n}\r\n\r\nexport function prevCharLength(str: string, offset: number): number {\r\n\tconst graphemeBreakTree = GraphemeBreakTree.getInstance();\r\n\tconst initialOffset = offset;\r\n\r\n\tconst initialCodePoint = getPrevCodePoint(str, offset);\r\n\toffset -= (initialCodePoint >= Constants.UNICODE_SUPPLEMENTARY_PLANE_BEGIN ? 2 : 1);\r\n\r\n\tlet graphemeBreakType = graphemeBreakTree.getGraphemeBreakType(initialCodePoint);\r\n\twhile (offset > 0) {\r\n\t\tconst prevCodePoint = getPrevCodePoint(str, offset);\r\n\t\tconst prevGraphemeBreakType = graphemeBreakTree.getGraphemeBreakType(prevCodePoint);\r\n\t\tif (breakBetweenGraphemeBreakType(prevGraphemeBreakType, graphemeBreakType)) {\r\n\t\t\tbreak;\r\n\t\t}\r\n\t\toffset -= (prevCodePoint >= Constants.UNICODE_SUPPLEMENTARY_PLANE_BEGIN ? 2 : 1);\r\n\t\tgraphemeBreakType = prevGraphemeBreakType;\r\n\t}\r\n\r\n\treturn (initialOffset - offset);\r\n}\r\n\r\n/**\r\n * A manual decoding of a UTF8 string.\r\n * Use only in environments which do not offer native conversion methods!\r\n */\r\nexport function decodeUTF8(buffer: Uint8Array): string {\r\n\t// https://en.wikipedia.org/wiki/UTF-8\r\n\r\n\tconst len = buffer.byteLength;\r\n\tconst result: string[] = [];\r\n\tlet offset = 0;\r\n\twhile (offset < len) {\r\n\t\tconst v0 = buffer[offset];\r\n\t\tlet codePoint: number;\r\n\t\tif (v0 >= 0b11110000 && offset + 3 < len) {\r\n\t\t\t// 4 bytes\r\n\t\t\tcodePoint = (\r\n\t\t\t\t(((buffer[offset++] & 0b00000111) << 18) >>> 0)\r\n\t\t\t\t| (((buffer[offset++] & 0b00111111) << 12) >>> 0)\r\n\t\t\t\t| (((buffer[offset++] & 0b00111111) << 6) >>> 0)\r\n\t\t\t\t| (((buffer[offset++] & 0b00111111) << 0) >>> 0)\r\n\t\t\t);\r\n\t\t} else if (v0 >= 0b11100000 && offset + 2 < len) {\r\n\t\t\t// 3 bytes\r\n\t\t\tcodePoint = (\r\n\t\t\t\t(((buffer[offset++] & 0b00001111) << 12) >>> 0)\r\n\t\t\t\t| (((buffer[offset++] & 0b00111111) << 6) >>> 0)\r\n\t\t\t\t| (((buffer[offset++] & 0b00111111) << 0) >>> 0)\r\n\t\t\t);\r\n\t\t} else if (v0 >= 0b11000000 && offset + 1 < len) {\r\n\t\t\t// 2 bytes\r\n\t\t\tcodePoint = (\r\n\t\t\t\t(((buffer[offset++] & 0b00011111) << 6) >>> 0)\r\n\t\t\t\t| (((buffer[offset++] & 0b00111111) << 0) >>> 0)\r\n\t\t\t);\r\n\t\t} else {\r\n\t\t\t// 1 byte\r\n\t\t\tcodePoint = buffer[offset++];\r\n\t\t}\r\n\r\n\t\tif ((codePoint >= 0 && codePoint <= 0xD7FF) || (codePoint >= 0xE000 && codePoint <= 0xFFFF)) {\r\n\t\t\t// Basic Multilingual Plane\r\n\t\t\tresult.push(String.fromCharCode(codePoint));\r\n\t\t} else if (codePoint >= 0x010000 && codePoint <= 0x10FFFF) {\r\n\t\t\t// Supplementary Planes\r\n\t\t\tconst uPrime = codePoint - 0x10000;\r\n\t\t\tconst w1 = 0xD800 + ((uPrime & 0b11111111110000000000) >>> 10);\r\n\t\t\tconst w2 = 0xDC00 + ((uPrime & 0b00000000001111111111) >>> 0);\r\n\t\t\tresult.push(String.fromCharCode(w1));\r\n\t\t\tresult.push(String.fromCharCode(w2));\r\n\t\t} else {\r\n\t\t\t// illegal code point\r\n\t\t\tresult.push(String.fromCharCode(0xFFFD));\r\n\t\t}\r\n\t}\r\n\r\n\treturn result.join('');\r\n}\r\n\r\n/**\r\n * Generated using https://github.com/alexandrudima/unicode-utils/blob/master/generate-rtl-test.js\r\n */\r\nconst CONTAINS_RTL = /(?:[\\u05BE\\u05C0\\u05C3\\u05C6\\u05D0-\\u05F4\\u0608\\u060B\\u060D\\u061B-\\u064A\\u066D-\\u066F\\u0671-\\u06D5\\u06E5\\u06E6\\u06EE\\u06EF\\u06FA-\\u0710\\u0712-\\u072F\\u074D-\\u07A5\\u07B1-\\u07EA\\u07F4\\u07F5\\u07FA-\\u0815\\u081A\\u0824\\u0828\\u0830-\\u0858\\u085E-\\u08BD\\u200F\\uFB1D\\uFB1F-\\uFB28\\uFB2A-\\uFD3D\\uFD50-\\uFDFC\\uFE70-\\uFEFC]|\\uD802[\\uDC00-\\uDD1B\\uDD20-\\uDE00\\uDE10-\\uDE33\\uDE40-\\uDEE4\\uDEEB-\\uDF35\\uDF40-\\uDFFF]|\\uD803[\\uDC00-\\uDCFF]|\\uD83A[\\uDC00-\\uDCCF\\uDD00-\\uDD43\\uDD50-\\uDFFF]|\\uD83B[\\uDC00-\\uDEBB])/;\r\n\r\n/**\r\n * Returns true if `str` contains any Unicode character that is classified as \"R\" or \"AL\".\r\n */\r\nexport function containsRTL(str: string): boolean {\r\n\treturn CONTAINS_RTL.test(str);\r\n}\r\n\r\n/**\r\n * Generated using https://github.com/alexandrudima/unicode-utils/blob/master/generate-emoji-test.js\r\n */\r\nconst CONTAINS_EMOJI = /(?:[\\u231A\\u231B\\u23F0\\u23F3\\u2600-\\u27BF\\u2B50\\u2B55]|\\uD83C[\\uDDE6-\\uDDFF\\uDF00-\\uDFFF]|\\uD83D[\\uDC00-\\uDE4F\\uDE80-\\uDEFC\\uDFE0-\\uDFEB]|\\uD83E[\\uDD00-\\uDDFF\\uDE70-\\uDE73\\uDE78-\\uDE82\\uDE90-\\uDE95])/;\r\n\r\nexport function containsEmoji(str: string): boolean {\r\n\treturn CONTAINS_EMOJI.test(str);\r\n}\r\n\r\nconst IS_BASIC_ASCII = /^[\\t\\n\\r\\x20-\\x7E]*$/;\r\n/**\r\n * Returns true if `str` contains only basic ASCII characters in the range 32 - 126 (including 32 and 126) or \\n, \\r, \\t\r\n */\r\nexport function isBasicASCII(str: string): boolean {\r\n\treturn IS_BASIC_ASCII.test(str);\r\n}\r\n\r\nexport const UNUSUAL_LINE_TERMINATORS = /[\\u2028\\u2029]/; // LINE SEPARATOR (LS) or PARAGRAPH SEPARATOR (PS)\r\n/**\r\n * Returns true if `str` contains unusual line terminators, like LS or PS\r\n */\r\nexport function containsUnusualLineTerminators(str: string): boolean {\r\n\treturn UNUSUAL_LINE_TERMINATORS.test(str);\r\n}\r\n\r\nexport function containsFullWidthCharacter(str: string): boolean {\r\n\tfor (let i = 0, len = str.length; i < len; i++) {\r\n\t\tif (isFullWidthCharacter(str.charCodeAt(i))) {\r\n\t\t\treturn true;\r\n\t\t}\r\n\t}\r\n\treturn false;\r\n}\r\n\r\nexport function isFullWidthCharacter(charCode: number): boolean {\r\n\t// Do a cheap trick to better support wrapping of wide characters, treat them as 2 columns\r\n\t// http://jrgraphix.net/research/unicode_blocks.php\r\n\t// 2E80 — 2EFF CJK Radicals Supplement\r\n\t// 2F00 — 2FDF Kangxi Radicals\r\n\t// 2FF0 — 2FFF Ideographic Description Characters\r\n\t// 3000 — 303F CJK Symbols and Punctuation\r\n\t// 3040 — 309F Hiragana\r\n\t// 30A0 — 30FF Katakana\r\n\t// 3100 — 312F Bopomofo\r\n\t// 3130 — 318F Hangul Compatibility Jamo\r\n\t// 3190 — 319F Kanbun\r\n\t// 31A0 — 31BF Bopomofo Extended\r\n\t// 31F0 — 31FF Katakana Phonetic Extensions\r\n\t// 3200 — 32FF Enclosed CJK Letters and Months\r\n\t// 3300 — 33FF CJK Compatibility\r\n\t// 3400 — 4DBF CJK Unified Ideographs Extension A\r\n\t// 4DC0 — 4DFF Yijing Hexagram Symbols\r\n\t// 4E00 — 9FFF CJK Unified Ideographs\r\n\t// A000 — A48F Yi Syllables\r\n\t// A490 — A4CF Yi Radicals\r\n\t// AC00 — D7AF Hangul Syllables\r\n\t// [IGNORE] D800 — DB7F High Surrogates\r\n\t// [IGNORE] DB80 — DBFF High Private Use Surrogates\r\n\t// [IGNORE] DC00 — DFFF Low Surrogates\r\n\t// [IGNORE] E000 — F8FF Private Use Area\r\n\t// F900 — FAFF CJK Compatibility Ideographs\r\n\t// [IGNORE] FB00 — FB4F Alphabetic Presentation Forms\r\n\t// [IGNORE] FB50 — FDFF Arabic Presentation Forms-A\r\n\t// [IGNORE] FE00 — FE0F Variation Selectors\r\n\t// [IGNORE] FE20 — FE2F Combining Half Marks\r\n\t// [IGNORE] FE30 — FE4F CJK Compatibility Forms\r\n\t// [IGNORE] FE50 — FE6F Small Form Variants\r\n\t// [IGNORE] FE70 — FEFF Arabic Presentation Forms-B\r\n\t// FF00 — FFEF Halfwidth and Fullwidth Forms\r\n\t// [https://en.wikipedia.org/wiki/Halfwidth_and_fullwidth_forms]\r\n\t// of which FF01 - FF5E fullwidth ASCII of 21 to 7E\r\n\t// [IGNORE] and FF65 - FFDC halfwidth of Katakana and Hangul\r\n\t// [IGNORE] FFF0 — FFFF Specials\r\n\tcharCode = +charCode; // @perf\r\n\treturn (\r\n\t\t(charCode >= 0x2E80 && charCode <= 0xD7AF)\r\n\t\t|| (charCode >= 0xF900 && charCode <= 0xFAFF)\r\n\t\t|| (charCode >= 0xFF01 && charCode <= 0xFF5E)\r\n\t);\r\n}\r\n\r\n/**\r\n * A fast function (therefore imprecise) to check if code points are emojis.\r\n * Generated using https://github.com/alexandrudima/unicode-utils/blob/master/generate-emoji-test.js\r\n */\r\nexport function isEmojiImprecise(x: number): boolean {\r\n\treturn (\r\n\t\t(x >= 0x1F1E6 && x <= 0x1F1FF) || (x >= 9728 && x <= 10175) || (x >= 127744 && x <= 128591)\r\n\t\t|| (x >= 128640 && x <= 128764) || (x >= 128992 && x <= 129003) || (x >= 129280 && x <= 129535)\r\n\t\t|| (x >= 129648 && x <= 129651) || (x >= 129656 && x <= 129666) || (x >= 129680 && x <= 129685)\r\n\t);\r\n}\r\n\r\n// -- UTF-8 BOM\r\n\r\nexport const UTF8_BOM_CHARACTER = String.fromCharCode(CharCode.UTF8_BOM);\r\n\r\nexport function startsWithUTF8BOM(str: string): boolean {\r\n\treturn !!(str && str.length > 0 && str.charCodeAt(0) === CharCode.UTF8_BOM);\r\n}\r\n\r\nexport function containsUppercaseCharacter(target: string, ignoreEscapedChars = false): boolean {\r\n\tif (!target) {\r\n\t\treturn false;\r\n\t}\r\n\r\n\tif (ignoreEscapedChars) {\r\n\t\ttarget = target.replace(/\\\\./g, '');\r\n\t}\r\n\r\n\treturn target.toLowerCase() !== target;\r\n}\r\n\r\n/**\r\n * Produces 'a'-'z', followed by 'A'-'Z'... followed by 'a'-'z', etc.\r\n */\r\nexport function singleLetterHash(n: number): string {\r\n\tconst LETTERS_CNT = (CharCode.Z - CharCode.A + 1);\r\n\r\n\tn = n % (2 * LETTERS_CNT);\r\n\r\n\tif (n < LETTERS_CNT) {\r\n\t\treturn String.fromCharCode(CharCode.a + n);\r\n\t}\r\n\r\n\treturn String.fromCharCode(CharCode.A + n - LETTERS_CNT);\r\n}\r\n\r\n//#region Unicode Grapheme Break\r\n\r\nexport function getGraphemeBreakType(codePoint: number): GraphemeBreakType {\r\n\tconst graphemeBreakTree = GraphemeBreakTree.getInstance();\r\n\treturn graphemeBreakTree.getGraphemeBreakType(codePoint);\r\n}\r\n\r\nexport function breakBetweenGraphemeBreakType(breakTypeA: GraphemeBreakType, breakTypeB: GraphemeBreakType): boolean {\r\n\t// http://www.unicode.org/reports/tr29/#Grapheme_Cluster_Boundary_Rules\r\n\r\n\t// !!! Let's make the common case a bit faster\r\n\tif (breakTypeA === GraphemeBreakType.Other) {\r\n\t\t// see https://www.unicode.org/Public/13.0.0/ucd/auxiliary/GraphemeBreakTest-13.0.0d10.html#table\r\n\t\treturn (breakTypeB !== GraphemeBreakType.Extend && breakTypeB !== GraphemeBreakType.SpacingMark);\r\n\t}\r\n\r\n\t// Do not break between a CR and LF. Otherwise, break before and after controls.\r\n\t// GB3 CR × LF\r\n\t// GB4 (Control | CR | LF) ÷\r\n\t// GB5 ÷ (Control | CR | LF)\r\n\tif (breakTypeA === GraphemeBreakType.CR) {\r\n\t\tif (breakTypeB === GraphemeBreakType.LF) {\r\n\t\t\treturn false; // GB3\r\n\t\t}\r\n\t}\r\n\tif (breakTypeA === GraphemeBreakType.Control || breakTypeA === GraphemeBreakType.CR || breakTypeA === GraphemeBreakType.LF) {\r\n\t\treturn true; // GB4\r\n\t}\r\n\tif (breakTypeB === GraphemeBreakType.Control || breakTypeB === GraphemeBreakType.CR || breakTypeB === GraphemeBreakType.LF) {\r\n\t\treturn true; // GB5\r\n\t}\r\n\r\n\t// Do not break Hangul syllable sequences.\r\n\t// GB6 L × (L | V | LV | LVT)\r\n\t// GB7 (LV | V) × (V | T)\r\n\t// GB8 (LVT | T) × T\r\n\tif (breakTypeA === GraphemeBreakType.L) {\r\n\t\tif (breakTypeB === GraphemeBreakType.L || breakTypeB === GraphemeBreakType.V || breakTypeB === GraphemeBreakType.LV || breakTypeB === GraphemeBreakType.LVT) {\r\n\t\t\treturn false; // GB6\r\n\t\t}\r\n\t}\r\n\tif (breakTypeA === GraphemeBreakType.LV || breakTypeA === GraphemeBreakType.V) {\r\n\t\tif (breakTypeB === GraphemeBreakType.V || breakTypeB === GraphemeBreakType.T) {\r\n\t\t\treturn false; // GB7\r\n\t\t}\r\n\t}\r\n\tif (breakTypeA === GraphemeBreakType.LVT || breakTypeA === GraphemeBreakType.T) {\r\n\t\tif (breakTypeB === GraphemeBreakType.T) {\r\n\t\t\treturn false; // GB8\r\n\t\t}\r\n\t}\r\n\r\n\t// Do not break before extending characters or ZWJ.\r\n\t// GB9 × (Extend | ZWJ)\r\n\tif (breakTypeB === GraphemeBreakType.Extend || breakTypeB === GraphemeBreakType.ZWJ) {\r\n\t\treturn false; // GB9\r\n\t}\r\n\r\n\t// The GB9a and GB9b rules only apply to extended grapheme clusters:\r\n\t// Do not break before SpacingMarks, or after Prepend characters.\r\n\t// GB9a × SpacingMark\r\n\t// GB9b Prepend ×\r\n\tif (breakTypeB === GraphemeBreakType.SpacingMark) {\r\n\t\treturn false; // GB9a\r\n\t}\r\n\tif (breakTypeA === GraphemeBreakType.Prepend) {\r\n\t\treturn false; // GB9b\r\n\t}\r\n\r\n\t// Do not break within emoji modifier sequences or emoji zwj sequences.\r\n\t// GB11 \\p{Extended_Pictographic} Extend* ZWJ × \\p{Extended_Pictographic}\r\n\tif (breakTypeA === GraphemeBreakType.ZWJ && breakTypeB === GraphemeBreakType.Extended_Pictographic) {\r\n\t\t// Note: we are not implementing the rule entirely here to avoid introducing states\r\n\t\treturn false; // GB11\r\n\t}\r\n\r\n\t// GB12 sot (RI RI)* RI × RI\r\n\t// GB13 [^RI] (RI RI)* RI × RI\r\n\tif (breakTypeA === GraphemeBreakType.Regional_Indicator && breakTypeB === GraphemeBreakType.Regional_Indicator) {\r\n\t\t// Note: we are not implementing the rule entirely here to avoid introducing states\r\n\t\treturn false; // GB12 & GB13\r\n\t}\r\n\r\n\t// GB999 Any ÷ Any\r\n\treturn true;\r\n}\r\n\r\nexport const enum GraphemeBreakType {\r\n\tOther = 0,\r\n\tPrepend = 1,\r\n\tCR = 2,\r\n\tLF = 3,\r\n\tControl = 4,\r\n\tExtend = 5,\r\n\tRegional_Indicator = 6,\r\n\tSpacingMark = 7,\r\n\tL = 8,\r\n\tV = 9,\r\n\tT = 10,\r\n\tLV = 11,\r\n\tLVT = 12,\r\n\tZWJ = 13,\r\n\tExtended_Pictographic = 14\r\n}\r\n\r\nclass GraphemeBreakTree {\r\n\r\n\tprivate static _INSTANCE: GraphemeBreakTree | null = null;\r\n\tpublic static getInstance(): GraphemeBreakTree {\r\n\t\tif (!GraphemeBreakTree._INSTANCE) {\r\n\t\t\tGraphemeBreakTree._INSTANCE = new GraphemeBreakTree();\r\n\t\t}\r\n\t\treturn GraphemeBreakTree._INSTANCE;\r\n\t}\r\n\r\n\tprivate readonly _data: number[];\r\n\r\n\tconstructor() {\r\n\t\tthis._data = getGraphemeBreakRawData();\r\n\t}\r\n\r\n\tpublic getGraphemeBreakType(codePoint: number): GraphemeBreakType {\r\n\t\t// !!! Let's make 7bit ASCII a bit faster: 0..31\r\n\t\tif (codePoint < 32) {\r\n\t\t\tif (codePoint === CharCode.LineFeed) {\r\n\t\t\t\treturn GraphemeBreakType.LF;\r\n\t\t\t}\r\n\t\t\tif (codePoint === CharCode.CarriageReturn) {\r\n\t\t\t\treturn GraphemeBreakType.CR;\r\n\t\t\t}\r\n\t\t\treturn GraphemeBreakType.Control;\r\n\t\t}\r\n\t\t// !!! Let's make 7bit ASCII a bit faster: 32..126\r\n\t\tif (codePoint < 127) {\r\n\t\t\treturn GraphemeBreakType.Other;\r\n\t\t}\r\n\r\n\t\tconst data = this._data;\r\n\t\tconst nodeCount = data.length / 3;\r\n\t\tlet nodeIndex = 1;\r\n\t\twhile (nodeIndex <= nodeCount) {\r\n\t\t\tif (codePoint < data[3 * nodeIndex]) {\r\n\t\t\t\t// go left\r\n\t\t\t\tnodeIndex = 2 * nodeIndex;\r\n\t\t\t} else if (codePoint > data[3 * nodeIndex + 1]) {\r\n\t\t\t\t// go right\r\n\t\t\t\tnodeIndex = 2 * nodeIndex + 1;\r\n\t\t\t} else {\r\n\t\t\t\t// hit\r\n\t\t\t\treturn data[3 * nodeIndex + 2];\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\treturn GraphemeBreakType.Other;\r\n\t}\r\n}\r\n\r\nfunction getGraphemeBreakRawData(): number[] {\r\n\t// generated using https://github.com/alexandrudima/unicode-utils/blob/master/generate-grapheme-break.js\r\n\treturn JSON.parse('[0,0,0,51592,51592,11,44424,44424,11,72251,72254,5,7150,7150,7,48008,48008,11,55176,55176,11,128420,128420,14,3276,3277,5,9979,9980,14,46216,46216,11,49800,49800,11,53384,53384,11,70726,70726,5,122915,122916,5,129320,129327,14,2558,2558,5,5906,5908,5,9762,9763,14,43360,43388,8,45320,45320,11,47112,47112,11,48904,48904,11,50696,50696,11,52488,52488,11,54280,54280,11,70082,70083,1,71350,71350,7,73111,73111,5,127892,127893,14,128726,128727,14,129473,129474,14,2027,2035,5,2901,2902,5,3784,3789,5,6754,6754,5,8418,8420,5,9877,9877,14,11088,11088,14,44008,44008,5,44872,44872,11,45768,45768,11,46664,46664,11,47560,47560,11,48456,48456,11,49352,49352,11,50248,50248,11,51144,51144,11,52040,52040,11,52936,52936,11,53832,53832,11,54728,54728,11,69811,69814,5,70459,70460,5,71096,71099,7,71998,71998,5,72874,72880,5,119149,119149,7,127374,127374,14,128335,128335,14,128482,128482,14,128765,128767,14,129399,129400,14,129680,129685,14,1476,1477,5,2377,2380,7,2759,2760,5,3137,3140,7,3458,3459,7,4153,4154,5,6432,6434,5,6978,6978,5,7675,7679,5,9723,9726,14,9823,9823,14,9919,9923,14,10035,10036,14,42736,42737,5,43596,43596,5,44200,44200,11,44648,44648,11,45096,45096,11,45544,45544,11,45992,45992,11,46440,46440,11,46888,46888,11,47336,47336,11,47784,47784,11,48232,48232,11,48680,48680,11,49128,49128,11,49576,49576,11,50024,50024,11,50472,50472,11,50920,50920,11,51368,51368,11,51816,51816,11,52264,52264,11,52712,52712,11,53160,53160,11,53608,53608,11,54056,54056,11,54504,54504,11,54952,54952,11,68108,68111,5,69933,69940,5,70197,70197,7,70498,70499,7,70845,70845,5,71229,71229,5,71727,71735,5,72154,72155,5,72344,72345,5,73023,73029,5,94095,94098,5,121403,121452,5,126981,127182,14,127538,127546,14,127990,127990,14,128391,128391,14,128445,128449,14,128500,128505,14,128752,128752,14,129160,129167,14,129356,129356,14,129432,129442,14,129648,129651,14,129751,131069,14,173,173,4,1757,1757,1,2274,2274,1,2494,2494,5,2641,2641,5,2876,2876,5,3014,3016,7,3262,3262,7,3393,3396,5,3570,3571,7,3968,3972,5,4228,4228,7,6086,6086,5,6679,6680,5,6912,6915,5,7080,7081,5,7380,7392,5,8252,8252,14,9096,9096,14,9748,9749,14,9784,9786,14,9833,9850,14,9890,9894,14,9938,9938,14,9999,9999,14,10085,10087,14,12349,12349,14,43136,43137,7,43454,43456,7,43755,43755,7,44088,44088,11,44312,44312,11,44536,44536,11,44760,44760,11,44984,44984,11,45208,45208,11,45432,45432,11,45656,45656,11,45880,45880,11,46104,46104,11,46328,46328,11,46552,46552,11,46776,46776,11,47000,47000,11,47224,47224,11,47448,47448,11,47672,47672,11,47896,47896,11,48120,48120,11,48344,48344,11,48568,48568,11,48792,48792,11,49016,49016,11,49240,49240,11,49464,49464,11,49688,49688,11,49912,49912,11,50136,50136,11,50360,50360,11,50584,50584,11,50808,50808,11,51032,51032,11,51256,51256,11,51480,51480,11,51704,51704,11,51928,51928,11,52152,52152,11,52376,52376,11,52600,52600,11,52824,52824,11,53048,53048,11,53272,53272,11,53496,53496,11,53720,53720,11,53944,53944,11,54168,54168,11,54392,54392,11,54616,54616,11,54840,54840,11,55064,55064,11,65438,65439,5,69633,69633,5,69837,69837,1,70018,70018,7,70188,70190,7,70368,70370,7,70465,70468,7,70712,70719,5,70835,70840,5,70850,70851,5,71132,71133,5,71340,71340,7,71458,71461,5,71985,71989,7,72002,72002,7,72193,72202,5,72281,72283,5,72766,72766,7,72885,72886,5,73104,73105,5,92912,92916,5,113824,113827,4,119173,119179,5,121505,121519,5,125136,125142,5,127279,127279,14,127489,127490,14,127570,127743,14,127900,127901,14,128254,128254,14,128369,128370,14,128400,128400,14,128425,128432,14,128468,128475,14,128489,128494,14,128715,128720,14,128745,128745,14,128759,128760,14,129004,129023,14,129296,129304,14,129340,129342,14,129388,129392,14,129404,129407,14,129454,129455,14,129485,129487,14,129659,129663,14,129719,129727,14,917536,917631,5,13,13,2,1160,1161,5,1564,1564,4,1807,1807,1,2085,2087,5,2363,2363,7,2402,2403,5,2507,2508,7,2622,2624,7,2691,2691,7,2786,2787,5,2881,2884,5,3006,3006,5,3072,3072,5,3170,3171,5,3267,3268,7,3330,3331,7,3406,3406,1,3538,3540,5,3655,3662,5,3897,3897,5,4038,4038,5,4184,4185,5,4352,4447,8,6068,6069,5,6155,6157,5,6448,6449,7,6742,6742,5,6783,6783,5,6966,6970,5,7042,7042,7,7143,7143,7,7212,7219,5,7412,7412,5,8206,8207,4,8294,8303,4,8596,8601,14,9410,9410,14,9742,9742,14,9757,9757,14,9770,9770,14,9794,9794,14,9828,9828,14,9855,9855,14,9882,9882,14,9900,9903,14,9929,9933,14,9963,9967,14,9987,9988,14,10006,10006,14,10062,10062,14,10175,10175,14,11744,11775,5,42607,42607,5,43043,43044,7,43263,43263,5,43444,43445,7,43569,43570,5,43698,43700,5,43766,43766,5,44032,44032,11,44144,44144,11,44256,44256,11,44368,44368,11,44480,44480,11,44592,44592,11,44704,44704,11,44816,44816,11,44928,44928,11,45040,45040,11,45152,45152,11,45264,45264,11,45376,45376,11,45488,45488,11,45600,45600,11,45712,45712,11,45824,45824,11,45936,45936,11,46048,46048,11,46160,46160,11,46272,46272,11,46384,46384,11,46496,46496,11,46608,46608,11,46720,46720,11,46832,46832,11,46944,46944,11,47056,47056,11,47168,47168,11,47280,47280,11,47392,47392,11,47504,47504,11,47616,47616,11,47728,47728,11,47840,47840,11,47952,47952,11,48064,48064,11,48176,48176,11,48288,48288,11,48400,48400,11,48512,48512,11,48624,48624,11,48736,48736,11,48848,48848,11,48960,48960,11,49072,49072,11,49184,49184,11,49296,49296,11,49408,49408,11,49520,49520,11,49632,49632,11,49744,49744,11,49856,49856,11,49968,49968,11,50080,50080,11,50192,50192,11,50304,50304,11,50416,50416,11,50528,50528,11,50640,50640,11,50752,50752,11,50864,50864,11,50976,50976,11,51088,51088,11,51200,51200,11,51312,51312,11,51424,51424,11,51536,51536,11,51648,51648,11,51760,51760,11,51872,51872,11,51984,51984,11,52096,52096,11,52208,52208,11,52320,52320,11,52432,52432,11,52544,52544,11,52656,52656,11,52768,52768,11,52880,52880,11,52992,52992,11,53104,53104,11,53216,53216,11,53328,53328,11,53440,53440,11,53552,53552,11,53664,53664,11,53776,53776,11,53888,53888,11,54000,54000,11,54112,54112,11,54224,54224,11,54336,54336,11,54448,54448,11,54560,54560,11,54672,54672,11,54784,54784,11,54896,54896,11,55008,55008,11,55120,55120,11,64286,64286,5,66272,66272,5,68900,68903,5,69762,69762,7,69817,69818,5,69927,69931,5,70003,70003,5,70070,70078,5,70094,70094,7,70194,70195,7,70206,70206,5,70400,70401,5,70463,70463,7,70475,70477,7,70512,70516,5,70722,70724,5,70832,70832,5,70842,70842,5,70847,70848,5,71088,71089,7,71102,71102,7,71219,71226,5,71231,71232,5,71342,71343,7,71453,71455,5,71463,71467,5,71737,71738,5,71995,71996,5,72000,72000,7,72145,72147,7,72160,72160,5,72249,72249,7,72273,72278,5,72330,72342,5,72752,72758,5,72850,72871,5,72882,72883,5,73018,73018,5,73031,73031,5,73109,73109,5,73461,73462,7,94031,94031,5,94192,94193,7,119142,119142,7,119155,119162,4,119362,119364,5,121476,121476,5,122888,122904,5,123184,123190,5,126976,126979,14,127184,127231,14,127344,127345,14,127405,127461,14,127514,127514,14,127561,127567,14,127778,127779,14,127896,127896,14,127985,127986,14,127995,127999,5,128326,128328,14,128360,128366,14,128378,128378,14,128394,128397,14,128405,128406,14,128422,128423,14,128435,128443,14,128453,128464,14,128479,128480,14,128484,128487,14,128496,128498,14,128640,128709,14,128723,128724,14,128736,128741,14,128747,128748,14,128755,128755,14,128762,128762,14,128981,128991,14,129096,129103,14,129292,129292,14,129311,129311,14,129329,129330,14,129344,129349,14,129360,129374,14,129394,129394,14,129402,129402,14,129413,129425,14,129445,129450,14,129466,129471,14,129483,129483,14,129511,129535,14,129653,129655,14,129667,129670,14,129705,129711,14,129731,129743,14,917505,917505,4,917760,917999,5,10,10,3,127,159,4,768,879,5,1471,1471,5,1536,1541,1,1648,1648,5,1767,1768,5,1840,1866,5,2070,2073,5,2137,2139,5,2307,2307,7,2366,2368,7,2382,2383,7,2434,2435,7,2497,2500,5,2519,2519,5,2563,2563,7,2631,2632,5,2677,2677,5,2750,2752,7,2763,2764,7,2817,2817,5,2879,2879,5,2891,2892,7,2914,2915,5,3008,3008,5,3021,3021,5,3076,3076,5,3146,3149,5,3202,3203,7,3264,3265,7,3271,3272,7,3298,3299,5,3390,3390,5,3402,3404,7,3426,3427,5,3535,3535,5,3544,3550,7,3635,3635,7,3763,3763,7,3893,3893,5,3953,3966,5,3981,3991,5,4145,4145,7,4157,4158,5,4209,4212,5,4237,4237,5,4520,4607,10,5970,5971,5,6071,6077,5,6089,6099,5,6277,6278,5,6439,6440,5,6451,6456,7,6683,6683,5,6744,6750,5,6765,6770,7,6846,6846,5,6964,6964,5,6972,6972,5,7019,7027,5,7074,7077,5,7083,7085,5,7146,7148,7,7154,7155,7,7222,7223,5,7394,7400,5,7416,7417,5,8204,8204,5,8233,8233,4,8288,8292,4,8413,8416,5,8482,8482,14,8986,8987,14,9193,9203,14,9654,9654,14,9733,9733,14,9745,9745,14,9752,9752,14,9760,9760,14,9766,9766,14,9774,9775,14,9792,9792,14,9800,9811,14,9825,9826,14,9831,9831,14,9852,9853,14,9872,9873,14,9880,9880,14,9885,9887,14,9896,9897,14,9906,9916,14,9926,9927,14,9936,9936,14,9941,9960,14,9974,9974,14,9982,9985,14,9992,9997,14,10002,10002,14,10017,10017,14,10055,10055,14,10071,10071,14,10145,10145,14,11013,11015,14,11503,11505,5,12334,12335,5,12951,12951,14,42612,42621,5,43014,43014,5,43047,43047,7,43204,43205,5,43335,43345,5,43395,43395,7,43450,43451,7,43561,43566,5,43573,43574,5,43644,43644,5,43710,43711,5,43758,43759,7,44005,44005,5,44012,44012,7,44060,44060,11,44116,44116,11,44172,44172,11,44228,44228,11,44284,44284,11,44340,44340,11,44396,44396,11,44452,44452,11,44508,44508,11,44564,44564,11,44620,44620,11,44676,44676,11,44732,44732,11,44788,44788,11,44844,44844,11,44900,44900,11,44956,44956,11,45012,45012,11,45068,45068,11,45124,45124,11,45180,45180,11,45236,45236,11,45292,45292,11,45348,45348,11,45404,45404,11,45460,45460,11,45516,45516,11,45572,45572,11,45628,45628,11,45684,45684,11,45740,45740,11,45796,45796,11,45852,45852,11,45908,45908,11,45964,45964,11,46020,46020,11,46076,46076,11,46132,46132,11,46188,46188,11,46244,46244,11,46300,46300,11,46356,46356,11,46412,46412,11,46468,46468,11,46524,46524,11,46580,46580,11,46636,46636,11,46692,46692,11,46748,46748,11,46804,46804,11,46860,46860,11,46916,46916,11,46972,46972,11,47028,47028,11,47084,47084,11,47140,47140,11,47196,47196,11,47252,47252,11,47308,47308,11,47364,47364,11,47420,47420,11,47476,47476,11,47532,47532,11,47588,47588,11,47644,47644,11,47700,47700,11,47756,47756,11,47812,47812,11,47868,47868,11,47924,47924,11,47980,47980,11,48036,48036,11,48092,48092,11,48148,48148,11,48204,48204,11,48260,48260,11,48316,48316,11,48372,48372,11,48428,48428,11,48484,48484,11,48540,48540,11,48596,48596,11,48652,48652,11,48708,48708,11,48764,48764,11,48820,48820,11,48876,48876,11,48932,48932,11,48988,48988,11,49044,49044,11,49100,49100,11,49156,49156,11,49212,49212,11,49268,49268,11,49324,49324,11,49380,49380,11,49436,49436,11,49492,49492,11,49548,49548,11,49604,49604,11,49660,49660,11,49716,49716,11,49772,49772,11,49828,49828,11,49884,49884,11,49940,49940,11,49996,49996,11,50052,50052,11,50108,50108,11,50164,50164,11,50220,50220,11,50276,50276,11,50332,50332,11,50388,50388,11,50444,50444,11,50500,50500,11,50556,50556,11,50612,50612,11,50668,50668,11,50724,50724,11,50780,50780,11,50836,50836,11,50892,50892,11,50948,50948,11,51004,51004,11,51060,51060,11,51116,51116,11,51172,51172,11,51228,51228,11,51284,51284,11,51340,51340,11,51396,51396,11,51452,51452,11,51508,51508,11,51564,51564,11,51620,51620,11,51676,51676,11,51732,51732,11,51788,51788,11,51844,51844,11,51900,51900,11,51956,51956,11,52012,52012,11,52068,52068,11,52124,52124,11,52180,52180,11,52236,52236,11,52292,52292,11,52348,52348,11,52404,52404,11,52460,52460,11,52516,52516,11,52572,52572,11,52628,52628,11,52684,52684,11,52740,52740,11,52796,52796,11,52852,52852,11,52908,52908,11,52964,52964,11,53020,53020,11,53076,53076,11,53132,53132,11,53188,53188,11,53244,53244,11,53300,53300,11,53356,53356,11,53412,53412,11,53468,53468,11,53524,53524,11,53580,53580,11,53636,53636,11,53692,53692,11,53748,53748,11,53804,53804,11,53860,53860,11,53916,53916,11,53972,53972,11,54028,54028,11,54084,54084,11,54140,54140,11,54196,54196,11,54252,54252,11,54308,54308,11,54364,54364,11,54420,54420,11,54476,54476,11,54532,54532,11,54588,54588,11,54644,54644,11,54700,54700,11,54756,54756,11,54812,54812,11,54868,54868,11,54924,54924,11,54980,54980,11,55036,55036,11,55092,55092,11,55148,55148,11,55216,55238,9,65056,65071,5,65529,65531,4,68097,68099,5,68159,68159,5,69446,69456,5,69688,69702,5,69808,69810,7,69815,69816,7,69821,69821,1,69888,69890,5,69932,69932,7,69957,69958,7,70016,70017,5,70067,70069,7,70079,70080,7,70089,70092,5,70095,70095,5,70191,70193,5,70196,70196,5,70198,70199,5,70367,70367,5,70371,70378,5,70402,70403,7,70462,70462,5,70464,70464,5,70471,70472,7,70487,70487,5,70502,70508,5,70709,70711,7,70720,70721,7,70725,70725,7,70750,70750,5,70833,70834,7,70841,70841,7,70843,70844,7,70846,70846,7,70849,70849,7,71087,71087,5,71090,71093,5,71100,71101,5,71103,71104,5,71216,71218,7,71227,71228,7,71230,71230,7,71339,71339,5,71341,71341,5,71344,71349,5,71351,71351,5,71456,71457,7,71462,71462,7,71724,71726,7,71736,71736,7,71984,71984,5,71991,71992,7,71997,71997,7,71999,71999,1,72001,72001,1,72003,72003,5,72148,72151,5,72156,72159,7,72164,72164,7,72243,72248,5,72250,72250,1,72263,72263,5,72279,72280,7,72324,72329,1,72343,72343,7,72751,72751,7,72760,72765,5,72767,72767,5,72873,72873,7,72881,72881,7,72884,72884,7,73009,73014,5,73020,73021,5,73030,73030,1,73098,73102,7,73107,73108,7,73110,73110,7,73459,73460,5,78896,78904,4,92976,92982,5,94033,94087,7,94180,94180,5,113821,113822,5,119141,119141,5,119143,119145,5,119150,119154,5,119163,119170,5,119210,119213,5,121344,121398,5,121461,121461,5,121499,121503,5,122880,122886,5,122907,122913,5,122918,122922,5,123628,123631,5,125252,125258,5,126980,126980,14,127183,127183,14,127245,127247,14,127340,127343,14,127358,127359,14,127377,127386,14,127462,127487,6,127491,127503,14,127535,127535,14,127548,127551,14,127568,127569,14,127744,127777,14,127780,127891,14,127894,127895,14,127897,127899,14,127902,127984,14,127987,127989,14,127991,127994,14,128000,128253,14,128255,128317,14,128329,128334,14,128336,128359,14,128367,128368,14,128371,128377,14,128379,128390,14,128392,128393,14,128398,128399,14,128401,128404,14,128407,128419,14,128421,128421,14,128424,128424,14,128433,128434,14,128444,128444,14,128450,128452,14,128465,128467,14,128476,128478,14,128481,128481,14,128483,128483,14,128488,128488,14,128495,128495,14,128499,128499,14,128506,128591,14,128710,128714,14,128721,128722,14,128725,128725,14,128728,128735,14,128742,128744,14,128746,128746,14,128749,128751,14,128753,128754,14,128756,128758,14,128761,128761,14,128763,128764,14,128884,128895,14,128992,129003,14,129036,129039,14,129114,129119,14,129198,129279,14,129293,129295,14,129305,129310,14,129312,129319,14,129328,129328,14,129331,129338,14,129343,129343,14,129351,129355,14,129357,129359,14,129375,129387,14,129393,129393,14,129395,129398,14,129401,129401,14,129403,129403,14,129408,129412,14,129426,129431,14,129443,129444,14,129451,129453,14,129456,129465,14,129472,129472,14,129475,129482,14,129484,129484,14,129488,129510,14,129536,129647,14,129652,129652,14,129656,129658,14,129664,129666,14,129671,129679,14,129686,129704,14,129712,129718,14,129728,129730,14,129744,129750,14,917504,917504,4,917506,917535,4,917632,917759,4,918000,921599,4,0,9,4,11,12,4,14,31,4,169,169,14,174,174,14,1155,1159,5,1425,1469,5,1473,1474,5,1479,1479,5,1552,1562,5,1611,1631,5,1750,1756,5,1759,1764,5,1770,1773,5,1809,1809,5,1958,1968,5,2045,2045,5,2075,2083,5,2089,2093,5,2259,2273,5,2275,2306,5,2362,2362,5,2364,2364,5,2369,2376,5,2381,2381,5,2385,2391,5,2433,2433,5,2492,2492,5,2495,2496,7,2503,2504,7,2509,2509,5,2530,2531,5,2561,2562,5,2620,2620,5,2625,2626,5,2635,2637,5,2672,2673,5,2689,2690,5,2748,2748,5,2753,2757,5,2761,2761,7,2765,2765,5,2810,2815,5,2818,2819,7,2878,2878,5,2880,2880,7,2887,2888,7,2893,2893,5,2903,2903,5,2946,2946,5,3007,3007,7,3009,3010,7,3018,3020,7,3031,3031,5,3073,3075,7,3134,3136,5,3142,3144,5,3157,3158,5,3201,3201,5,3260,3260,5,3263,3263,5,3266,3266,5,3270,3270,5,3274,3275,7,3285,3286,5,3328,3329,5,3387,3388,5,3391,3392,7,3398,3400,7,3405,3405,5,3415,3415,5,3457,3457,5,3530,3530,5,3536,3537,7,3542,3542,5,3551,3551,5,3633,3633,5,3636,3642,5,3761,3761,5,3764,3772,5,3864,3865,5,3895,3895,5,3902,3903,7,3967,3967,7,3974,3975,5,3993,4028,5,4141,4144,5,4146,4151,5,4155,4156,7,4182,4183,7,4190,4192,5,4226,4226,5,4229,4230,5,4253,4253,5,4448,4519,9,4957,4959,5,5938,5940,5,6002,6003,5,6070,6070,7,6078,6085,7,6087,6088,7,6109,6109,5,6158,6158,4,6313,6313,5,6435,6438,7,6441,6443,7,6450,6450,5,6457,6459,5,6681,6682,7,6741,6741,7,6743,6743,7,6752,6752,5,6757,6764,5,6771,6780,5,6832,6845,5,6847,6848,5,6916,6916,7,6965,6965,5,6971,6971,7,6973,6977,7,6979,6980,7,7040,7041,5,7073,7073,7,7078,7079,7,7082,7082,7,7142,7142,5,7144,7145,5,7149,7149,5,7151,7153,5,7204,7211,7,7220,7221,7,7376,7378,5,7393,7393,7,7405,7405,5,7415,7415,7,7616,7673,5,8203,8203,4,8205,8205,13,8232,8232,4,8234,8238,4,8265,8265,14,8293,8293,4,8400,8412,5,8417,8417,5,8421,8432,5,8505,8505,14,8617,8618,14,9000,9000,14,9167,9167,14,9208,9210,14,9642,9643,14,9664,9664,14,9728,9732,14,9735,9741,14,9743,9744,14,9746,9746,14,9750,9751,14,9753,9756,14,9758,9759,14,9761,9761,14,9764,9765,14,9767,9769,14,9771,9773,14,9776,9783,14,9787,9791,14,9793,9793,14,9795,9799,14,9812,9822,14,9824,9824,14,9827,9827,14,9829,9830,14,9832,9832,14,9851,9851,14,9854,9854,14,9856,9861,14,9874,9876,14,9878,9879,14,9881,9881,14,9883,9884,14,9888,9889,14,9895,9895,14,9898,9899,14,9904,9905,14,9917,9918,14,9924,9925,14,9928,9928,14,9934,9935,14,9937,9937,14,9939,9940,14,9961,9962,14,9968,9973,14,9975,9978,14,9981,9981,14,9986,9986,14,9989,9989,14,9998,9998,14,10000,10001,14,10004,10004,14,10013,10013,14,10024,10024,14,10052,10052,14,10060,10060,14,10067,10069,14,10083,10084,14,10133,10135,14,10160,10160,14,10548,10549,14,11035,11036,14,11093,11093,14,11647,11647,5,12330,12333,5,12336,12336,14,12441,12442,5,12953,12953,14,42608,42610,5,42654,42655,5,43010,43010,5,43019,43019,5,43045,43046,5,43052,43052,5,43188,43203,7,43232,43249,5,43302,43309,5,43346,43347,7,43392,43394,5,43443,43443,5,43446,43449,5,43452,43453,5,43493,43493,5,43567,43568,7,43571,43572,7,43587,43587,5,43597,43597,7,43696,43696,5,43703,43704,5,43713,43713,5,43756,43757,5,43765,43765,7,44003,44004,7,44006,44007,7,44009,44010,7,44013,44013,5,44033,44059,12,44061,44087,12,44089,44115,12,44117,44143,12,44145,44171,12,44173,44199,12,44201,44227,12,44229,44255,12,44257,44283,12,44285,44311,12,44313,44339,12,44341,44367,12,44369,44395,12,44397,44423,12,44425,44451,12,44453,44479,12,44481,44507,12,44509,44535,12,44537,44563,12,44565,44591,12,44593,44619,12,44621,44647,12,44649,44675,12,44677,44703,12,44705,44731,12,44733,44759,12,44761,44787,12,44789,44815,12,44817,44843,12,44845,44871,12,44873,44899,12,44901,44927,12,44929,44955,12,44957,44983,12,44985,45011,12,45013,45039,12,45041,45067,12,45069,45095,12,45097,45123,12,45125,45151,12,45153,45179,12,45181,45207,12,45209,45235,12,45237,45263,12,45265,45291,12,45293,45319,12,45321,45347,12,45349,45375,12,45377,45403,12,45405,45431,12,45433,45459,12,45461,45487,12,45489,45515,12,45517,45543,12,45545,45571,12,45573,45599,12,45601,45627,12,45629,45655,12,45657,45683,12,45685,45711,12,45713,45739,12,45741,45767,12,45769,45795,12,45797,45823,12,45825,45851,12,45853,45879,12,45881,45907,12,45909,45935,12,45937,45963,12,45965,45991,12,45993,46019,12,46021,46047,12,46049,46075,12,46077,46103,12,46105,46131,12,46133,46159,12,46161,46187,12,46189,46215,12,46217,46243,12,46245,46271,12,46273,46299,12,46301,46327,12,46329,46355,12,46357,46383,12,46385,46411,12,46413,46439,12,46441,46467,12,46469,46495,12,46497,46523,12,46525,46551,12,46553,46579,12,46581,46607,12,46609,46635,12,46637,46663,12,46665,46691,12,46693,46719,12,46721,46747,12,46749,46775,12,46777,46803,12,46805,46831,12,46833,46859,12,46861,46887,12,46889,46915,12,46917,46943,12,46945,46971,12,46973,46999,12,47001,47027,12,47029,47055,12,47057,47083,12,47085,47111,12,47113,47139,12,47141,47167,12,47169,47195,12,47197,47223,12,47225,47251,12,47253,47279,12,47281,47307,12,47309,47335,12,47337,47363,12,47365,47391,12,47393,47419,12,47421,47447,12,47449,47475,12,47477,47503,12,47505,47531,12,47533,47559,12,47561,47587,12,47589,47615,12,47617,47643,12,47645,47671,12,47673,47699,12,47701,47727,12,47729,47755,12,47757,47783,12,47785,47811,12,47813,47839,12,47841,47867,12,47869,47895,12,47897,47923,12,47925,47951,12,47953,47979,12,47981,48007,12,48009,48035,12,48037,48063,12,48065,48091,12,48093,48119,12,48121,48147,12,48149,48175,12,48177,48203,12,48205,48231,12,48233,48259,12,48261,48287,12,48289,48315,12,48317,48343,12,48345,48371,12,48373,48399,12,48401,48427,12,48429,48455,12,48457,48483,12,48485,48511,12,48513,48539,12,48541,48567,12,48569,48595,12,48597,48623,12,48625,48651,12,48653,48679,12,48681,48707,12,48709,48735,12,48737,48763,12,48765,48791,12,48793,48819,12,48821,48847,12,48849,48875,12,48877,48903,12,48905,48931,12,48933,48959,12,48961,48987,12,48989,49015,12,49017,49043,12,49045,49071,12,49073,49099,12,49101,49127,12,49129,49155,12,49157,49183,12,49185,49211,12,49213,49239,12,49241,49267,12,49269,49295,12,49297,49323,12,49325,49351,12,49353,49379,12,49381,49407,12,49409,49435,12,49437,49463,12,49465,49491,12,49493,49519,12,49521,49547,12,49549,49575,12,49577,49603,12,49605,49631,12,49633,49659,12,49661,49687,12,49689,49715,12,49717,49743,12,49745,49771,12,49773,49799,12,49801,49827,12,49829,49855,12,49857,49883,12,49885,49911,12,49913,49939,12,49941,49967,12,49969,49995,12,49997,50023,12,50025,50051,12,50053,50079,12,50081,50107,12,50109,50135,12,50137,50163,12,50165,50191,12,50193,50219,12,50221,50247,12,50249,50275,12,50277,50303,12,50305,50331,12,50333,50359,12,50361,50387,12,50389,50415,12,50417,50443,12,50445,50471,12,50473,50499,12,50501,50527,12,50529,50555,12,50557,50583,12,50585,50611,12,50613,50639,12,50641,50667,12,50669,50695,12,50697,50723,12,50725,50751,12,50753,50779,12,50781,50807,12,50809,50835,12,50837,50863,12,50865,50891,12,50893,50919,12,50921,50947,12,50949,50975,12,50977,51003,12,51005,51031,12,51033,51059,12,51061,51087,12,51089,51115,12,51117,51143,12,51145,51171,12,51173,51199,12,51201,51227,12,51229,51255,12,51257,51283,12,51285,51311,12,51313,51339,12,51341,51367,12,51369,51395,12,51397,51423,12,51425,51451,12,51453,51479,12,51481,51507,12,51509,51535,12,51537,51563,12,51565,51591,12,51593,51619,12,51621,51647,12,51649,51675,12,51677,51703,12,51705,51731,12,51733,51759,12,51761,51787,12,51789,51815,12,51817,51843,12,51845,51871,12,51873,51899,12,51901,51927,12,51929,51955,12,51957,51983,12,51985,52011,12,52013,52039,12,52041,52067,12,52069,52095,12,52097,52123,12,52125,52151,12,52153,52179,12,52181,52207,12,52209,52235,12,52237,52263,12,52265,52291,12,52293,52319,12,52321,52347,12,52349,52375,12,52377,52403,12,52405,52431,12,52433,52459,12,52461,52487,12,52489,52515,12,52517,52543,12,52545,52571,12,52573,52599,12,52601,52627,12,52629,52655,12,52657,52683,12,52685,52711,12,52713,52739,12,52741,52767,12,52769,52795,12,52797,52823,12,52825,52851,12,52853,52879,12,52881,52907,12,52909,52935,12,52937,52963,12,52965,52991,12,52993,53019,12,53021,53047,12,53049,53075,12,53077,53103,12,53105,53131,12,53133,53159,12,53161,53187,12,53189,53215,12,53217,53243,12,53245,53271,12,53273,53299,12,53301,53327,12,53329,53355,12,53357,53383,12,53385,53411,12,53413,53439,12,53441,53467,12,53469,53495,12,53497,53523,12,53525,53551,12,53553,53579,12,53581,53607,12,53609,53635,12,53637,53663,12,53665,53691,12,53693,53719,12,53721,53747,12,53749,53775,12,53777,53803,12,53805,53831,12,53833,53859,12,53861,53887,12,53889,53915,12,53917,53943,12,53945,53971,12,53973,53999,12,54001,54027,12,54029,54055,12,54057,54083,12,54085,54111,12,54113,54139,12,54141,54167,12,54169,54195,12,54197,54223,12,54225,54251,12,54253,54279,12,54281,54307,12,54309,54335,12,54337,54363,12,54365,54391,12,54393,54419,12,54421,54447,12,54449,54475,12,54477,54503,12,54505,54531,12,54533,54559,12,54561,54587,12,54589,54615,12,54617,54643,12,54645,54671,12,54673,54699,12,54701,54727,12,54729,54755,12,54757,54783,12,54785,54811,12,54813,54839,12,54841,54867,12,54869,54895,12,54897,54923,12,54925,54951,12,54953,54979,12,54981,55007,12,55009,55035,12,55037,55063,12,55065,55091,12,55093,55119,12,55121,55147,12,55149,55175,12,55177,55203,12,55243,55291,10,65024,65039,5,65279,65279,4,65520,65528,4,66045,66045,5,66422,66426,5,68101,68102,5,68152,68154,5,68325,68326,5,69291,69292,5,69632,69632,7,69634,69634,7,69759,69761,5]');\r\n}\r\n\r\n//#endregion\r\n","/*---------------------------------------------------------------------------------------------\r\n * Copyright (c) Microsoft Corporation. All rights reserved.\r\n * Licensed under the MIT License. See License.txt in the project root for license information.\r\n *--------------------------------------------------------------------------------------------*/\r\n\r\nimport * as strings from 'vs/base/common/strings';\r\n\r\n/**\r\n * Return a hash value for an object.\r\n */\r\nexport function hash(obj: any): number {\r\n\treturn doHash(obj, 0);\r\n}\r\n\r\n\r\nexport function doHash(obj: any, hashVal: number): number {\r\n\tswitch (typeof obj) {\r\n\t\tcase 'object':\r\n\t\t\tif (obj === null) {\r\n\t\t\t\treturn numberHash(349, hashVal);\r\n\t\t\t} else if (Array.isArray(obj)) {\r\n\t\t\t\treturn arrayHash(obj, hashVal);\r\n\t\t\t}\r\n\t\t\treturn objectHash(obj, hashVal);\r\n\t\tcase 'string':\r\n\t\t\treturn stringHash(obj, hashVal);\r\n\t\tcase 'boolean':\r\n\t\t\treturn booleanHash(obj, hashVal);\r\n\t\tcase 'number':\r\n\t\t\treturn numberHash(obj, hashVal);\r\n\t\tcase 'undefined':\r\n\t\t\treturn numberHash(937, hashVal);\r\n\t\tdefault:\r\n\t\t\treturn numberHash(617, hashVal);\r\n\t}\r\n}\r\n\r\nfunction numberHash(val: number, initialHashVal: number): number {\r\n\treturn (((initialHashVal << 5) - initialHashVal) + val) | 0; // hashVal * 31 + ch, keep as int32\r\n}\r\n\r\nfunction booleanHash(b: boolean, initialHashVal: number): number {\r\n\treturn numberHash(b ? 433 : 863, initialHashVal);\r\n}\r\n\r\nexport function stringHash(s: string, hashVal: number) {\r\n\thashVal = numberHash(149417, hashVal);\r\n\tfor (let i = 0, length = s.length; i < length; i++) {\r\n\t\thashVal = numberHash(s.charCodeAt(i), hashVal);\r\n\t}\r\n\treturn hashVal;\r\n}\r\n\r\nfunction arrayHash(arr: any[], initialHashVal: number): number {\r\n\tinitialHashVal = numberHash(104579, initialHashVal);\r\n\treturn arr.reduce((hashVal, item) => doHash(item, hashVal), initialHashVal);\r\n}\r\n\r\nfunction objectHash(obj: any, initialHashVal: number): number {\r\n\tinitialHashVal = numberHash(181387, initialHashVal);\r\n\treturn Object.keys(obj).sort().reduce((hashVal, key) => {\r\n\t\thashVal = stringHash(key, hashVal);\r\n\t\treturn doHash(obj[key], hashVal);\r\n\t}, initialHashVal);\r\n}\r\n\r\nconst enum SHA1Constant {\r\n\tBLOCK_SIZE = 64, // 512 / 8\r\n\tUNICODE_REPLACEMENT = 0xFFFD,\r\n}\r\n\r\nfunction leftRotate(value: number, bits: number, totalBits: number = 32): number {\r\n\t// delta + bits = totalBits\r\n\tconst delta = totalBits - bits;\r\n\r\n\t// All ones, expect `delta` zeros aligned to the right\r\n\tconst mask = ~((1 << delta) - 1);\r\n\r\n\t// Join (value left-shifted `bits` bits) with (masked value right-shifted `delta` bits)\r\n\treturn ((value << bits) | ((mask & value) >>> delta)) >>> 0;\r\n}\r\n\r\nfunction fill(dest: Uint8Array, index: number = 0, count: number = dest.byteLength, value: number = 0): void {\r\n\tfor (let i = 0; i < count; i++) {\r\n\t\tdest[index + i] = value;\r\n\t}\r\n}\r\n\r\nfunction leftPad(value: string, length: number, char: string = '0'): string {\r\n\twhile (value.length < length) {\r\n\t\tvalue = char + value;\r\n\t}\r\n\treturn value;\r\n}\r\n\r\nfunction toHexString(value: number, bitsize: number = 32): string {\r\n\treturn leftPad((value >>> 0).toString(16), bitsize / 4);\r\n}\r\n\r\n/**\r\n * A SHA1 implementation that works with strings and does not allocate.\r\n */\r\nexport class StringSHA1 {\r\n\tprivate static _bigBlock32 = new DataView(new ArrayBuffer(320)); // 80 * 4 = 320\r\n\r\n\tprivate _h0 = 0x67452301;\r\n\tprivate _h1 = 0xEFCDAB89;\r\n\tprivate _h2 = 0x98BADCFE;\r\n\tprivate _h3 = 0x10325476;\r\n\tprivate _h4 = 0xC3D2E1F0;\r\n\r\n\tprivate readonly _buff: Uint8Array;\r\n\tprivate readonly _buffDV: DataView;\r\n\tprivate _buffLen: number;\r\n\tprivate _totalLen: number;\r\n\tprivate _leftoverHighSurrogate: number;\r\n\tprivate _finished: boolean;\r\n\r\n\tconstructor() {\r\n\t\tthis._buff = new Uint8Array(SHA1Constant.BLOCK_SIZE + 3 /* to fit any utf-8 */);\r\n\t\tthis._buffDV = new DataView(this._buff.buffer);\r\n\t\tthis._buffLen = 0;\r\n\t\tthis._totalLen = 0;\r\n\t\tthis._leftoverHighSurrogate = 0;\r\n\t\tthis._finished = false;\r\n\t}\r\n\r\n\tpublic update(str: string): void {\r\n\t\tconst strLen = str.length;\r\n\t\tif (strLen === 0) {\r\n\t\t\treturn;\r\n\t\t}\r\n\r\n\t\tconst buff = this._buff;\r\n\t\tlet buffLen = this._buffLen;\r\n\t\tlet leftoverHighSurrogate = this._leftoverHighSurrogate;\r\n\t\tlet charCode: number;\r\n\t\tlet offset: number;\r\n\r\n\t\tif (leftoverHighSurrogate !== 0) {\r\n\t\t\tcharCode = leftoverHighSurrogate;\r\n\t\t\toffset = -1;\r\n\t\t\tleftoverHighSurrogate = 0;\r\n\t\t} else {\r\n\t\t\tcharCode = str.charCodeAt(0);\r\n\t\t\toffset = 0;\r\n\t\t}\r\n\r\n\t\twhile (true) {\r\n\t\t\tlet codePoint = charCode;\r\n\t\t\tif (strings.isHighSurrogate(charCode)) {\r\n\t\t\t\tif (offset + 1 < strLen) {\r\n\t\t\t\t\tconst nextCharCode = str.charCodeAt(offset + 1);\r\n\t\t\t\t\tif (strings.isLowSurrogate(nextCharCode)) {\r\n\t\t\t\t\t\toffset++;\r\n\t\t\t\t\t\tcodePoint = strings.computeCodePoint(charCode, nextCharCode);\r\n\t\t\t\t\t} else {\r\n\t\t\t\t\t\t// illegal => unicode replacement character\r\n\t\t\t\t\t\tcodePoint = SHA1Constant.UNICODE_REPLACEMENT;\r\n\t\t\t\t\t}\r\n\t\t\t\t} else {\r\n\t\t\t\t\t// last character is a surrogate pair\r\n\t\t\t\t\tleftoverHighSurrogate = charCode;\r\n\t\t\t\t\tbreak;\r\n\t\t\t\t}\r\n\t\t\t} else if (strings.isLowSurrogate(charCode)) {\r\n\t\t\t\t// illegal => unicode replacement character\r\n\t\t\t\tcodePoint = SHA1Constant.UNICODE_REPLACEMENT;\r\n\t\t\t}\r\n\r\n\t\t\tbuffLen = this._push(buff, buffLen, codePoint);\r\n\t\t\toffset++;\r\n\t\t\tif (offset < strLen) {\r\n\t\t\t\tcharCode = str.charCodeAt(offset);\r\n\t\t\t} else {\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tthis._buffLen = buffLen;\r\n\t\tthis._leftoverHighSurrogate = leftoverHighSurrogate;\r\n\t}\r\n\r\n\tprivate _push(buff: Uint8Array, buffLen: number, codePoint: number): number {\r\n\t\tif (codePoint < 0x0080) {\r\n\t\t\tbuff[buffLen++] = codePoint;\r\n\t\t} else if (codePoint < 0x0800) {\r\n\t\t\tbuff[buffLen++] = 0b11000000 | ((codePoint & 0b00000000000000000000011111000000) >>> 6);\r\n\t\t\tbuff[buffLen++] = 0b10000000 | ((codePoint & 0b00000000000000000000000000111111) >>> 0);\r\n\t\t} else if (codePoint < 0x10000) {\r\n\t\t\tbuff[buffLen++] = 0b11100000 | ((codePoint & 0b00000000000000001111000000000000) >>> 12);\r\n\t\t\tbuff[buffLen++] = 0b10000000 | ((codePoint & 0b00000000000000000000111111000000) >>> 6);\r\n\t\t\tbuff[buffLen++] = 0b10000000 | ((codePoint & 0b00000000000000000000000000111111) >>> 0);\r\n\t\t} else {\r\n\t\t\tbuff[buffLen++] = 0b11110000 | ((codePoint & 0b00000000000111000000000000000000) >>> 18);\r\n\t\t\tbuff[buffLen++] = 0b10000000 | ((codePoint & 0b00000000000000111111000000000000) >>> 12);\r\n\t\t\tbuff[buffLen++] = 0b10000000 | ((codePoint & 0b00000000000000000000111111000000) >>> 6);\r\n\t\t\tbuff[buffLen++] = 0b10000000 | ((codePoint & 0b00000000000000000000000000111111) >>> 0);\r\n\t\t}\r\n\r\n\t\tif (buffLen >= SHA1Constant.BLOCK_SIZE) {\r\n\t\t\tthis._step();\r\n\t\t\tbuffLen -= SHA1Constant.BLOCK_SIZE;\r\n\t\t\tthis._totalLen += SHA1Constant.BLOCK_SIZE;\r\n\t\t\t// take last 3 in case of UTF8 overflow\r\n\t\t\tbuff[0] = buff[SHA1Constant.BLOCK_SIZE + 0];\r\n\t\t\tbuff[1] = buff[SHA1Constant.BLOCK_SIZE + 1];\r\n\t\t\tbuff[2] = buff[SHA1Constant.BLOCK_SIZE + 2];\r\n\t\t}\r\n\r\n\t\treturn buffLen;\r\n\t}\r\n\r\n\tpublic digest(): string {\r\n\t\tif (!this._finished) {\r\n\t\t\tthis._finished = true;\r\n\t\t\tif (this._leftoverHighSurrogate) {\r\n\t\t\t\t// illegal => unicode replacement character\r\n\t\t\t\tthis._leftoverHighSurrogate = 0;\r\n\t\t\t\tthis._buffLen = this._push(this._buff, this._buffLen, SHA1Constant.UNICODE_REPLACEMENT);\r\n\t\t\t}\r\n\t\t\tthis._totalLen += this._buffLen;\r\n\t\t\tthis._wrapUp();\r\n\t\t}\r\n\r\n\t\treturn toHexString(this._h0) + toHexString(this._h1) + toHexString(this._h2) + toHexString(this._h3) + toHexString(this._h4);\r\n\t}\r\n\r\n\tprivate _wrapUp(): void {\r\n\t\tthis._buff[this._buffLen++] = 0x80;\r\n\t\tfill(this._buff, this._buffLen);\r\n\r\n\t\tif (this._buffLen > 56) {\r\n\t\t\tthis._step();\r\n\t\t\tfill(this._buff);\r\n\t\t}\r\n\r\n\t\t// this will fit because the mantissa can cover up to 52 bits\r\n\t\tconst ml = 8 * this._totalLen;\r\n\r\n\t\tthis._buffDV.setUint32(56, Math.floor(ml / 4294967296), false);\r\n\t\tthis._buffDV.setUint32(60, ml % 4294967296, false);\r\n\r\n\t\tthis._step();\r\n\t}\r\n\r\n\tprivate _step(): void {\r\n\t\tconst bigBlock32 = StringSHA1._bigBlock32;\r\n\t\tconst data = this._buffDV;\r\n\r\n\t\tfor (let j = 0; j < 64 /* 16*4 */; j += 4) {\r\n\t\t\tbigBlock32.setUint32(j, data.getUint32(j, false), false);\r\n\t\t}\r\n\r\n\t\tfor (let j = 64; j < 320 /* 80*4 */; j += 4) {\r\n\t\t\tbigBlock32.setUint32(j, leftRotate((bigBlock32.getUint32(j - 12, false) ^ bigBlock32.getUint32(j - 32, false) ^ bigBlock32.getUint32(j - 56, false) ^ bigBlock32.getUint32(j - 64, false)), 1), false);\r\n\t\t}\r\n\r\n\t\tlet a = this._h0;\r\n\t\tlet b = this._h1;\r\n\t\tlet c = this._h2;\r\n\t\tlet d = this._h3;\r\n\t\tlet e = this._h4;\r\n\r\n\t\tlet f: number, k: number;\r\n\t\tlet temp: number;\r\n\r\n\t\tfor (let j = 0; j < 80; j++) {\r\n\t\t\tif (j < 20) {\r\n\t\t\t\tf = (b & c) | ((~b) & d);\r\n\t\t\t\tk = 0x5A827999;\r\n\t\t\t} else if (j < 40) {\r\n\t\t\t\tf = b ^ c ^ d;\r\n\t\t\t\tk = 0x6ED9EBA1;\r\n\t\t\t} else if (j < 60) {\r\n\t\t\t\tf = (b & c) | (b & d) | (c & d);\r\n\t\t\t\tk = 0x8F1BBCDC;\r\n\t\t\t} else {\r\n\t\t\t\tf = b ^ c ^ d;\r\n\t\t\t\tk = 0xCA62C1D6;\r\n\t\t\t}\r\n\r\n\t\t\ttemp = (leftRotate(a, 5) + f + e + k + bigBlock32.getUint32(j * 4, false)) & 0xffffffff;\r\n\t\t\te = d;\r\n\t\t\td = c;\r\n\t\t\tc = leftRotate(b, 30);\r\n\t\t\tb = a;\r\n\t\t\ta = temp;\r\n\t\t}\r\n\r\n\t\tthis._h0 = (this._h0 + a) & 0xffffffff;\r\n\t\tthis._h1 = (this._h1 + b) & 0xffffffff;\r\n\t\tthis._h2 = (this._h2 + c) & 0xffffffff;\r\n\t\tthis._h3 = (this._h3 + d) & 0xffffffff;\r\n\t\tthis._h4 = (this._h4 + e) & 0xffffffff;\r\n\t}\r\n}\r\n","/*---------------------------------------------------------------------------------------------\r\n * Copyright (c) Microsoft Corporation. All rights reserved.\r\n * Licensed under the MIT License. See License.txt in the project root for license information.\r\n *--------------------------------------------------------------------------------------------*/\r\n\r\nimport { DiffChange } from 'vs/base/common/diff/diffChange';\r\nimport { stringHash } from 'vs/base/common/hash';\r\nimport { Constants } from 'vs/base/common/uint';\r\n\r\nexport class StringDiffSequence implements ISequence {\r\n\r\n\tconstructor(private source: string) { }\r\n\r\n\tgetElements(): Int32Array | number[] | string[] {\r\n\t\tconst source = this.source;\r\n\t\tconst characters = new Int32Array(source.length);\r\n\t\tfor (let i = 0, len = source.length; i < len; i++) {\r\n\t\t\tcharacters[i] = source.charCodeAt(i);\r\n\t\t}\r\n\t\treturn characters;\r\n\t}\r\n}\r\n\r\nexport function stringDiff(original: string, modified: string, pretty: boolean): IDiffChange[] {\r\n\treturn new LcsDiff(new StringDiffSequence(original), new StringDiffSequence(modified)).ComputeDiff(pretty).changes;\r\n}\r\n\r\nexport interface ISequence {\r\n\tgetElements(): Int32Array | number[] | string[];\r\n}\r\n\r\nexport interface IDiffChange {\r\n\t/**\r\n\t * The position of the first element in the original sequence which\r\n\t * this change affects.\r\n\t */\r\n\toriginalStart: number;\r\n\r\n\t/**\r\n\t * The number of elements from the original sequence which were\r\n\t * affected.\r\n\t */\r\n\toriginalLength: number;\r\n\r\n\t/**\r\n\t * The position of the first element in the modified sequence which\r\n\t * this change affects.\r\n\t */\r\n\tmodifiedStart: number;\r\n\r\n\t/**\r\n\t * The number of elements from the modified sequence which were\r\n\t * affected (added).\r\n\t */\r\n\tmodifiedLength: number;\r\n}\r\n\r\nexport interface IContinueProcessingPredicate {\r\n\t(furthestOriginalIndex: number, matchLengthOfLongest: number): boolean;\r\n}\r\n\r\nexport interface IDiffResult {\r\n\tquitEarly: boolean;\r\n\tchanges: IDiffChange[];\r\n}\r\n\r\n//\r\n// The code below has been ported from a C# implementation in VS\r\n//\r\n\r\nexport class Debug {\r\n\r\n\tpublic static Assert(condition: boolean, message: string): void {\r\n\t\tif (!condition) {\r\n\t\t\tthrow new Error(message);\r\n\t\t}\r\n\t}\r\n}\r\n\r\nexport class MyArray {\r\n\t/**\r\n\t * Copies a range of elements from an Array starting at the specified source index and pastes\r\n\t * them to another Array starting at the specified destination index. The length and the indexes\r\n\t * are specified as 64-bit integers.\r\n\t * sourceArray:\r\n\t *\t\tThe Array that contains the data to copy.\r\n\t * sourceIndex:\r\n\t *\t\tA 64-bit integer that represents the index in the sourceArray at which copying begins.\r\n\t * destinationArray:\r\n\t *\t\tThe Array that receives the data.\r\n\t * destinationIndex:\r\n\t *\t\tA 64-bit integer that represents the index in the destinationArray at which storing begins.\r\n\t * length:\r\n\t *\t\tA 64-bit integer that represents the number of elements to copy.\r\n\t */\r\n\tpublic static Copy(sourceArray: any[], sourceIndex: number, destinationArray: any[], destinationIndex: number, length: number) {\r\n\t\tfor (let i = 0; i < length; i++) {\r\n\t\t\tdestinationArray[destinationIndex + i] = sourceArray[sourceIndex + i];\r\n\t\t}\r\n\t}\r\n\tpublic static Copy2(sourceArray: Int32Array, sourceIndex: number, destinationArray: Int32Array, destinationIndex: number, length: number) {\r\n\t\tfor (let i = 0; i < length; i++) {\r\n\t\t\tdestinationArray[destinationIndex + i] = sourceArray[sourceIndex + i];\r\n\t\t}\r\n\t}\r\n}\r\n\r\n//*****************************************************************************\r\n// LcsDiff.cs\r\n//\r\n// An implementation of the difference algorithm described in\r\n// \"An O(ND) Difference Algorithm and its variations\" by Eugene W. Myers\r\n//\r\n// Copyright (C) 2008 Microsoft Corporation @minifier_do_not_preserve\r\n//*****************************************************************************\r\n\r\n// Our total memory usage for storing history is (worst-case):\r\n// 2 * [(MaxDifferencesHistory + 1) * (MaxDifferencesHistory + 1) - 1] * sizeof(int)\r\n// 2 * [1448*1448 - 1] * 4 = 16773624 = 16MB\r\nconst enum LocalConstants {\r\n\tMaxDifferencesHistory = 1447\r\n}\r\n\r\n/**\r\n * A utility class which helps to create the set of DiffChanges from\r\n * a difference operation. This class accepts original DiffElements and\r\n * modified DiffElements that are involved in a particular change. The\r\n * MarktNextChange() method can be called to mark the separation between\r\n * distinct changes. At the end, the Changes property can be called to retrieve\r\n * the constructed changes.\r\n */\r\nclass DiffChangeHelper {\r\n\r\n\tprivate m_changes: DiffChange[];\r\n\tprivate m_originalStart: number;\r\n\tprivate m_modifiedStart: number;\r\n\tprivate m_originalCount: number;\r\n\tprivate m_modifiedCount: number;\r\n\r\n\t/**\r\n\t * Constructs a new DiffChangeHelper for the given DiffSequences.\r\n\t */\r\n\tconstructor() {\r\n\t\tthis.m_changes = [];\r\n\t\tthis.m_originalStart = Constants.MAX_SAFE_SMALL_INTEGER;\r\n\t\tthis.m_modifiedStart = Constants.MAX_SAFE_SMALL_INTEGER;\r\n\t\tthis.m_originalCount = 0;\r\n\t\tthis.m_modifiedCount = 0;\r\n\t}\r\n\r\n\t/**\r\n\t * Marks the beginning of the next change in the set of differences.\r\n\t */\r\n\tpublic MarkNextChange(): void {\r\n\t\t// Only add to the list if there is something to add\r\n\t\tif (this.m_originalCount > 0 || this.m_modifiedCount > 0) {\r\n\t\t\t// Add the new change to our list\r\n\t\t\tthis.m_changes.push(new DiffChange(this.m_originalStart, this.m_originalCount,\r\n\t\t\t\tthis.m_modifiedStart, this.m_modifiedCount));\r\n\t\t}\r\n\r\n\t\t// Reset for the next change\r\n\t\tthis.m_originalCount = 0;\r\n\t\tthis.m_modifiedCount = 0;\r\n\t\tthis.m_originalStart = Constants.MAX_SAFE_SMALL_INTEGER;\r\n\t\tthis.m_modifiedStart = Constants.MAX_SAFE_SMALL_INTEGER;\r\n\t}\r\n\r\n\t/**\r\n\t * Adds the original element at the given position to the elements\r\n\t * affected by the current change. The modified index gives context\r\n\t * to the change position with respect to the original sequence.\r\n\t * @param originalIndex The index of the original element to add.\r\n\t * @param modifiedIndex The index of the modified element that provides corresponding position in the modified sequence.\r\n\t */\r\n\tpublic AddOriginalElement(originalIndex: number, modifiedIndex: number) {\r\n\t\t// The 'true' start index is the smallest of the ones we've seen\r\n\t\tthis.m_originalStart = Math.min(this.m_originalStart, originalIndex);\r\n\t\tthis.m_modifiedStart = Math.min(this.m_modifiedStart, modifiedIndex);\r\n\r\n\t\tthis.m_originalCount++;\r\n\t}\r\n\r\n\t/**\r\n\t * Adds the modified element at the given position to the elements\r\n\t * affected by the current change. The original index gives context\r\n\t * to the change position with respect to the modified sequence.\r\n\t * @param originalIndex The index of the original element that provides corresponding position in the original sequence.\r\n\t * @param modifiedIndex The index of the modified element to add.\r\n\t */\r\n\tpublic AddModifiedElement(originalIndex: number, modifiedIndex: number): void {\r\n\t\t// The 'true' start index is the smallest of the ones we've seen\r\n\t\tthis.m_originalStart = Math.min(this.m_originalStart, originalIndex);\r\n\t\tthis.m_modifiedStart = Math.min(this.m_modifiedStart, modifiedIndex);\r\n\r\n\t\tthis.m_modifiedCount++;\r\n\t}\r\n\r\n\t/**\r\n\t * Retrieves all of the changes marked by the class.\r\n\t */\r\n\tpublic getChanges(): DiffChange[] {\r\n\t\tif (this.m_originalCount > 0 || this.m_modifiedCount > 0) {\r\n\t\t\t// Finish up on whatever is left\r\n\t\t\tthis.MarkNextChange();\r\n\t\t}\r\n\r\n\t\treturn this.m_changes;\r\n\t}\r\n\r\n\t/**\r\n\t * Retrieves all of the changes marked by the class in the reverse order\r\n\t */\r\n\tpublic getReverseChanges(): DiffChange[] {\r\n\t\tif (this.m_originalCount > 0 || this.m_modifiedCount > 0) {\r\n\t\t\t// Finish up on whatever is left\r\n\t\t\tthis.MarkNextChange();\r\n\t\t}\r\n\r\n\t\tthis.m_changes.reverse();\r\n\t\treturn this.m_changes;\r\n\t}\r\n\r\n}\r\n\r\n/**\r\n * An implementation of the difference algorithm described in\r\n * \"An O(ND) Difference Algorithm and its variations\" by Eugene W. Myers\r\n */\r\nexport class LcsDiff {\r\n\r\n\tprivate readonly ContinueProcessingPredicate: IContinueProcessingPredicate | null;\r\n\r\n\tprivate readonly _hasStrings: boolean;\r\n\tprivate readonly _originalStringElements: string[];\r\n\tprivate readonly _originalElementsOrHash: Int32Array;\r\n\tprivate readonly _modifiedStringElements: string[];\r\n\tprivate readonly _modifiedElementsOrHash: Int32Array;\r\n\r\n\tprivate m_forwardHistory: Int32Array[];\r\n\tprivate m_reverseHistory: Int32Array[];\r\n\r\n\t/**\r\n\t * Constructs the DiffFinder\r\n\t */\r\n\tconstructor(originalSequence: ISequence, modifiedSequence: ISequence, continueProcessingPredicate: IContinueProcessingPredicate | null = null) {\r\n\t\tthis.ContinueProcessingPredicate = continueProcessingPredicate;\r\n\r\n\t\tconst [originalStringElements, originalElementsOrHash, originalHasStrings] = LcsDiff._getElements(originalSequence);\r\n\t\tconst [modifiedStringElements, modifiedElementsOrHash, modifiedHasStrings] = LcsDiff._getElements(modifiedSequence);\r\n\r\n\t\tthis._hasStrings = (originalHasStrings && modifiedHasStrings);\r\n\t\tthis._originalStringElements = originalStringElements;\r\n\t\tthis._originalElementsOrHash = originalElementsOrHash;\r\n\t\tthis._modifiedStringElements = modifiedStringElements;\r\n\t\tthis._modifiedElementsOrHash = modifiedElementsOrHash;\r\n\r\n\t\tthis.m_forwardHistory = [];\r\n\t\tthis.m_reverseHistory = [];\r\n\t}\r\n\r\n\tprivate static _isStringArray(arr: Int32Array | number[] | string[]): arr is string[] {\r\n\t\treturn (arr.length > 0 && typeof arr[0] === 'string');\r\n\t}\r\n\r\n\tprivate static _getElements(sequence: ISequence): [string[], Int32Array, boolean] {\r\n\t\tconst elements = sequence.getElements();\r\n\r\n\t\tif (LcsDiff._isStringArray(elements)) {\r\n\t\t\tconst hashes = new Int32Array(elements.length);\r\n\t\t\tfor (let i = 0, len = elements.length; i < len; i++) {\r\n\t\t\t\thashes[i] = stringHash(elements[i], 0);\r\n\t\t\t}\r\n\t\t\treturn [elements, hashes, true];\r\n\t\t}\r\n\r\n\t\tif (elements instanceof Int32Array) {\r\n\t\t\treturn [[], elements, false];\r\n\t\t}\r\n\r\n\t\treturn [[], new Int32Array(elements), false];\r\n\t}\r\n\r\n\tprivate ElementsAreEqual(originalIndex: number, newIndex: number): boolean {\r\n\t\tif (this._originalElementsOrHash[originalIndex] !== this._modifiedElementsOrHash[newIndex]) {\r\n\t\t\treturn false;\r\n\t\t}\r\n\t\treturn (this._hasStrings ? this._originalStringElements[originalIndex] === this._modifiedStringElements[newIndex] : true);\r\n\t}\r\n\r\n\tprivate OriginalElementsAreEqual(index1: number, index2: number): boolean {\r\n\t\tif (this._originalElementsOrHash[index1] !== this._originalElementsOrHash[index2]) {\r\n\t\t\treturn false;\r\n\t\t}\r\n\t\treturn (this._hasStrings ? this._originalStringElements[index1] === this._originalStringElements[index2] : true);\r\n\t}\r\n\r\n\tprivate ModifiedElementsAreEqual(index1: number, index2: number): boolean {\r\n\t\tif (this._modifiedElementsOrHash[index1] !== this._modifiedElementsOrHash[index2]) {\r\n\t\t\treturn false;\r\n\t\t}\r\n\t\treturn (this._hasStrings ? this._modifiedStringElements[index1] === this._modifiedStringElements[index2] : true);\r\n\t}\r\n\r\n\tpublic ComputeDiff(pretty: boolean): IDiffResult {\r\n\t\treturn this._ComputeDiff(0, this._originalElementsOrHash.length - 1, 0, this._modifiedElementsOrHash.length - 1, pretty);\r\n\t}\r\n\r\n\t/**\r\n\t * Computes the differences between the original and modified input\r\n\t * sequences on the bounded range.\r\n\t * @returns An array of the differences between the two input sequences.\r\n\t */\r\n\tprivate _ComputeDiff(originalStart: number, originalEnd: number, modifiedStart: number, modifiedEnd: number, pretty: boolean): IDiffResult {\r\n\t\tconst quitEarlyArr = [false];\r\n\t\tlet changes = this.ComputeDiffRecursive(originalStart, originalEnd, modifiedStart, modifiedEnd, quitEarlyArr);\r\n\r\n\t\tif (pretty) {\r\n\t\t\t// We have to clean up the computed diff to be more intuitive\r\n\t\t\t// but it turns out this cannot be done correctly until the entire set\r\n\t\t\t// of diffs have been computed\r\n\t\t\tchanges = this.PrettifyChanges(changes);\r\n\t\t}\r\n\r\n\t\treturn {\r\n\t\t\tquitEarly: quitEarlyArr[0],\r\n\t\t\tchanges: changes\r\n\t\t};\r\n\t}\r\n\r\n\t/**\r\n\t * Private helper method which computes the differences on the bounded range\r\n\t * recursively.\r\n\t * @returns An array of the differences between the two input sequences.\r\n\t */\r\n\tprivate ComputeDiffRecursive(originalStart: number, originalEnd: number, modifiedStart: number, modifiedEnd: number, quitEarlyArr: boolean[]): DiffChange[] {\r\n\t\tquitEarlyArr[0] = false;\r\n\r\n\t\t// Find the start of the differences\r\n\t\twhile (originalStart <= originalEnd && modifiedStart <= modifiedEnd && this.ElementsAreEqual(originalStart, modifiedStart)) {\r\n\t\t\toriginalStart++;\r\n\t\t\tmodifiedStart++;\r\n\t\t}\r\n\r\n\t\t// Find the end of the differences\r\n\t\twhile (originalEnd >= originalStart && modifiedEnd >= modifiedStart && this.ElementsAreEqual(originalEnd, modifiedEnd)) {\r\n\t\t\toriginalEnd--;\r\n\t\t\tmodifiedEnd--;\r\n\t\t}\r\n\r\n\t\t// In the special case where we either have all insertions or all deletions or the sequences are identical\r\n\t\tif (originalStart > originalEnd || modifiedStart > modifiedEnd) {\r\n\t\t\tlet changes: DiffChange[];\r\n\r\n\t\t\tif (modifiedStart <= modifiedEnd) {\r\n\t\t\t\tDebug.Assert(originalStart === originalEnd + 1, 'originalStart should only be one more than originalEnd');\r\n\r\n\t\t\t\t// All insertions\r\n\t\t\t\tchanges = [\r\n\t\t\t\t\tnew DiffChange(originalStart, 0, modifiedStart, modifiedEnd - modifiedStart + 1)\r\n\t\t\t\t];\r\n\t\t\t} else if (originalStart <= originalEnd) {\r\n\t\t\t\tDebug.Assert(modifiedStart === modifiedEnd + 1, 'modifiedStart should only be one more than modifiedEnd');\r\n\r\n\t\t\t\t// All deletions\r\n\t\t\t\tchanges = [\r\n\t\t\t\t\tnew DiffChange(originalStart, originalEnd - originalStart + 1, modifiedStart, 0)\r\n\t\t\t\t];\r\n\t\t\t} else {\r\n\t\t\t\tDebug.Assert(originalStart === originalEnd + 1, 'originalStart should only be one more than originalEnd');\r\n\t\t\t\tDebug.Assert(modifiedStart === modifiedEnd + 1, 'modifiedStart should only be one more than modifiedEnd');\r\n\r\n\t\t\t\t// Identical sequences - No differences\r\n\t\t\t\tchanges = [];\r\n\t\t\t}\r\n\r\n\t\t\treturn changes;\r\n\t\t}\r\n\r\n\t\t// This problem can be solved using the Divide-And-Conquer technique.\r\n\t\tconst midOriginalArr = [0];\r\n\t\tconst midModifiedArr = [0];\r\n\t\tconst result = this.ComputeRecursionPoint(originalStart, originalEnd, modifiedStart, modifiedEnd, midOriginalArr, midModifiedArr, quitEarlyArr);\r\n\r\n\t\tconst midOriginal = midOriginalArr[0];\r\n\t\tconst midModified = midModifiedArr[0];\r\n\r\n\t\tif (result !== null) {\r\n\t\t\t// Result is not-null when there was enough memory to compute the changes while\r\n\t\t\t// searching for the recursion point\r\n\t\t\treturn result;\r\n\t\t} else if (!quitEarlyArr[0]) {\r\n\t\t\t// We can break the problem down recursively by finding the changes in the\r\n\t\t\t// First Half: (originalStart, modifiedStart) to (midOriginal, midModified)\r\n\t\t\t// Second Half: (midOriginal + 1, minModified + 1) to (originalEnd, modifiedEnd)\r\n\t\t\t// NOTE: ComputeDiff() is inclusive, therefore the second range starts on the next point\r\n\r\n\t\t\tconst leftChanges = this.ComputeDiffRecursive(originalStart, midOriginal, modifiedStart, midModified, quitEarlyArr);\r\n\t\t\tlet rightChanges: DiffChange[] = [];\r\n\r\n\t\t\tif (!quitEarlyArr[0]) {\r\n\t\t\t\trightChanges = this.ComputeDiffRecursive(midOriginal + 1, originalEnd, midModified + 1, modifiedEnd, quitEarlyArr);\r\n\t\t\t} else {\r\n\t\t\t\t// We did't have time to finish the first half, so we don't have time to compute this half.\r\n\t\t\t\t// Consider the entire rest of the sequence different.\r\n\t\t\t\trightChanges = [\r\n\t\t\t\t\tnew DiffChange(midOriginal + 1, originalEnd - (midOriginal + 1) + 1, midModified + 1, modifiedEnd - (midModified + 1) + 1)\r\n\t\t\t\t];\r\n\t\t\t}\r\n\r\n\t\t\treturn this.ConcatenateChanges(leftChanges, rightChanges);\r\n\t\t}\r\n\r\n\t\t// If we hit here, we quit early, and so can't return anything meaningful\r\n\t\treturn [\r\n\t\t\tnew DiffChange(originalStart, originalEnd - originalStart + 1, modifiedStart, modifiedEnd - modifiedStart + 1)\r\n\t\t];\r\n\t}\r\n\r\n\tprivate WALKTRACE(diagonalForwardBase: number, diagonalForwardStart: number, diagonalForwardEnd: number, diagonalForwardOffset: number,\r\n\t\tdiagonalReverseBase: number, diagonalReverseStart: number, diagonalReverseEnd: number, diagonalReverseOffset: number,\r\n\t\tforwardPoints: Int32Array, reversePoints: Int32Array,\r\n\t\toriginalIndex: number, originalEnd: number, midOriginalArr: number[],\r\n\t\tmodifiedIndex: number, modifiedEnd: number, midModifiedArr: number[],\r\n\t\tdeltaIsEven: boolean, quitEarlyArr: boolean[]\r\n\t): DiffChange[] {\r\n\t\tlet forwardChanges: DiffChange[] | null = null;\r\n\t\tlet reverseChanges: DiffChange[] | null = null;\r\n\r\n\t\t// First, walk backward through the forward diagonals history\r\n\t\tlet changeHelper = new DiffChangeHelper();\r\n\t\tlet diagonalMin = diagonalForwardStart;\r\n\t\tlet diagonalMax = diagonalForwardEnd;\r\n\t\tlet diagonalRelative = (midOriginalArr[0] - midModifiedArr[0]) - diagonalForwardOffset;\r\n\t\tlet lastOriginalIndex = Constants.MIN_SAFE_SMALL_INTEGER;\r\n\t\tlet historyIndex = this.m_forwardHistory.length - 1;\r\n\r\n\t\tdo {\r\n\t\t\t// Get the diagonal index from the relative diagonal number\r\n\t\t\tconst diagonal = diagonalRelative + diagonalForwardBase;\r\n\r\n\t\t\t// Figure out where we came from\r\n\t\t\tif (diagonal === diagonalMin || (diagonal < diagonalMax && forwardPoints[diagonal - 1] < forwardPoints[diagonal + 1])) {\r\n\t\t\t\t// Vertical line (the element is an insert)\r\n\t\t\t\toriginalIndex = forwardPoints[diagonal + 1];\r\n\t\t\t\tmodifiedIndex = originalIndex - diagonalRelative - diagonalForwardOffset;\r\n\t\t\t\tif (originalIndex < lastOriginalIndex) {\r\n\t\t\t\t\tchangeHelper.MarkNextChange();\r\n\t\t\t\t}\r\n\t\t\t\tlastOriginalIndex = originalIndex;\r\n\t\t\t\tchangeHelper.AddModifiedElement(originalIndex + 1, modifiedIndex);\r\n\t\t\t\tdiagonalRelative = (diagonal + 1) - diagonalForwardBase; //Setup for the next iteration\r\n\t\t\t} else {\r\n\t\t\t\t// Horizontal line (the element is a deletion)\r\n\t\t\t\toriginalIndex = forwardPoints[diagonal - 1] + 1;\r\n\t\t\t\tmodifiedIndex = originalIndex - diagonalRelative - diagonalForwardOffset;\r\n\t\t\t\tif (originalIndex < lastOriginalIndex) {\r\n\t\t\t\t\tchangeHelper.MarkNextChange();\r\n\t\t\t\t}\r\n\t\t\t\tlastOriginalIndex = originalIndex - 1;\r\n\t\t\t\tchangeHelper.AddOriginalElement(originalIndex, modifiedIndex + 1);\r\n\t\t\t\tdiagonalRelative = (diagonal - 1) - diagonalForwardBase; //Setup for the next iteration\r\n\t\t\t}\r\n\r\n\t\t\tif (historyIndex >= 0) {\r\n\t\t\t\tforwardPoints = this.m_forwardHistory[historyIndex];\r\n\t\t\t\tdiagonalForwardBase = forwardPoints[0]; //We stored this in the first spot\r\n\t\t\t\tdiagonalMin = 1;\r\n\t\t\t\tdiagonalMax = forwardPoints.length - 1;\r\n\t\t\t}\r\n\t\t} while (--historyIndex >= -1);\r\n\r\n\t\t// Ironically, we get the forward changes as the reverse of the\r\n\t\t// order we added them since we technically added them backwards\r\n\t\tforwardChanges = changeHelper.getReverseChanges();\r\n\r\n\t\tif (quitEarlyArr[0]) {\r\n\t\t\t// TODO: Calculate a partial from the reverse diagonals.\r\n\t\t\t// For now, just assume everything after the midOriginal/midModified point is a diff\r\n\r\n\t\t\tlet originalStartPoint = midOriginalArr[0] + 1;\r\n\t\t\tlet modifiedStartPoint = midModifiedArr[0] + 1;\r\n\r\n\t\t\tif (forwardChanges !== null && forwardChanges.length > 0) {\r\n\t\t\t\tconst lastForwardChange = forwardChanges[forwardChanges.length - 1];\r\n\t\t\t\toriginalStartPoint = Math.max(originalStartPoint, lastForwardChange.getOriginalEnd());\r\n\t\t\t\tmodifiedStartPoint = Math.max(modifiedStartPoint, lastForwardChange.getModifiedEnd());\r\n\t\t\t}\r\n\r\n\t\t\treverseChanges = [\r\n\t\t\t\tnew DiffChange(originalStartPoint, originalEnd - originalStartPoint + 1,\r\n\t\t\t\t\tmodifiedStartPoint, modifiedEnd - modifiedStartPoint + 1)\r\n\t\t\t];\r\n\t\t} else {\r\n\t\t\t// Now walk backward through the reverse diagonals history\r\n\t\t\tchangeHelper = new DiffChangeHelper();\r\n\t\t\tdiagonalMin = diagonalReverseStart;\r\n\t\t\tdiagonalMax = diagonalReverseEnd;\r\n\t\t\tdiagonalRelative = (midOriginalArr[0] - midModifiedArr[0]) - diagonalReverseOffset;\r\n\t\t\tlastOriginalIndex = Constants.MAX_SAFE_SMALL_INTEGER;\r\n\t\t\thistoryIndex = (deltaIsEven) ? this.m_reverseHistory.length - 1 : this.m_reverseHistory.length - 2;\r\n\r\n\t\t\tdo {\r\n\t\t\t\t// Get the diagonal index from the relative diagonal number\r\n\t\t\t\tconst diagonal = diagonalRelative + diagonalReverseBase;\r\n\r\n\t\t\t\t// Figure out where we came from\r\n\t\t\t\tif (diagonal === diagonalMin || (diagonal < diagonalMax && reversePoints[diagonal - 1] >= reversePoints[diagonal + 1])) {\r\n\t\t\t\t\t// Horizontal line (the element is a deletion))\r\n\t\t\t\t\toriginalIndex = reversePoints[diagonal + 1] - 1;\r\n\t\t\t\t\tmodifiedIndex = originalIndex - diagonalRelative - diagonalReverseOffset;\r\n\t\t\t\t\tif (originalIndex > lastOriginalIndex) {\r\n\t\t\t\t\t\tchangeHelper.MarkNextChange();\r\n\t\t\t\t\t}\r\n\t\t\t\t\tlastOriginalIndex = originalIndex + 1;\r\n\t\t\t\t\tchangeHelper.AddOriginalElement(originalIndex + 1, modifiedIndex + 1);\r\n\t\t\t\t\tdiagonalRelative = (diagonal + 1) - diagonalReverseBase; //Setup for the next iteration\r\n\t\t\t\t} else {\r\n\t\t\t\t\t// Vertical line (the element is an insertion)\r\n\t\t\t\t\toriginalIndex = reversePoints[diagonal - 1];\r\n\t\t\t\t\tmodifiedIndex = originalIndex - diagonalRelative - diagonalReverseOffset;\r\n\t\t\t\t\tif (originalIndex > lastOriginalIndex) {\r\n\t\t\t\t\t\tchangeHelper.MarkNextChange();\r\n\t\t\t\t\t}\r\n\t\t\t\t\tlastOriginalIndex = originalIndex;\r\n\t\t\t\t\tchangeHelper.AddModifiedElement(originalIndex + 1, modifiedIndex + 1);\r\n\t\t\t\t\tdiagonalRelative = (diagonal - 1) - diagonalReverseBase; //Setup for the next iteration\r\n\t\t\t\t}\r\n\r\n\t\t\t\tif (historyIndex >= 0) {\r\n\t\t\t\t\treversePoints = this.m_reverseHistory[historyIndex];\r\n\t\t\t\t\tdiagonalReverseBase = reversePoints[0]; //We stored this in the first spot\r\n\t\t\t\t\tdiagonalMin = 1;\r\n\t\t\t\t\tdiagonalMax = reversePoints.length - 1;\r\n\t\t\t\t}\r\n\t\t\t} while (--historyIndex >= -1);\r\n\r\n\t\t\t// There are cases where the reverse history will find diffs that\r\n\t\t\t// are correct, but not intuitive, so we need shift them.\r\n\t\t\treverseChanges = changeHelper.getChanges();\r\n\t\t}\r\n\r\n\t\treturn this.ConcatenateChanges(forwardChanges, reverseChanges);\r\n\t}\r\n\r\n\t/**\r\n\t * Given the range to compute the diff on, this method finds the point:\r\n\t * (midOriginal, midModified)\r\n\t * that exists in the middle of the LCS of the two sequences and\r\n\t * is the point at which the LCS problem may be broken down recursively.\r\n\t * This method will try to keep the LCS trace in memory. If the LCS recursion\r\n\t * point is calculated and the full trace is available in memory, then this method\r\n\t * will return the change list.\r\n\t * @param originalStart The start bound of the original sequence range\r\n\t * @param originalEnd The end bound of the original sequence range\r\n\t * @param modifiedStart The start bound of the modified sequence range\r\n\t * @param modifiedEnd The end bound of the modified sequence range\r\n\t * @param midOriginal The middle point of the original sequence range\r\n\t * @param midModified The middle point of the modified sequence range\r\n\t * @returns The diff changes, if available, otherwise null\r\n\t */\r\n\tprivate ComputeRecursionPoint(originalStart: number, originalEnd: number, modifiedStart: number, modifiedEnd: number, midOriginalArr: number[], midModifiedArr: number[], quitEarlyArr: boolean[]) {\r\n\t\tlet originalIndex = 0, modifiedIndex = 0;\r\n\t\tlet diagonalForwardStart = 0, diagonalForwardEnd = 0;\r\n\t\tlet diagonalReverseStart = 0, diagonalReverseEnd = 0;\r\n\r\n\t\t// To traverse the edit graph and produce the proper LCS, our actual\r\n\t\t// start position is just outside the given boundary\r\n\t\toriginalStart--;\r\n\t\tmodifiedStart--;\r\n\r\n\t\t// We set these up to make the compiler happy, but they will\r\n\t\t// be replaced before we return with the actual recursion point\r\n\t\tmidOriginalArr[0] = 0;\r\n\t\tmidModifiedArr[0] = 0;\r\n\r\n\t\t// Clear out the history\r\n\t\tthis.m_forwardHistory = [];\r\n\t\tthis.m_reverseHistory = [];\r\n\r\n\t\t// Each cell in the two arrays corresponds to a diagonal in the edit graph.\r\n\t\t// The integer value in the cell represents the originalIndex of the furthest\r\n\t\t// reaching point found so far that ends in that diagonal.\r\n\t\t// The modifiedIndex can be computed mathematically from the originalIndex and the diagonal number.\r\n\t\tconst maxDifferences = (originalEnd - originalStart) + (modifiedEnd - modifiedStart);\r\n\t\tconst numDiagonals = maxDifferences + 1;\r\n\t\tconst forwardPoints = new Int32Array(numDiagonals);\r\n\t\tconst reversePoints = new Int32Array(numDiagonals);\r\n\t\t// diagonalForwardBase: Index into forwardPoints of the diagonal which passes through (originalStart, modifiedStart)\r\n\t\t// diagonalReverseBase: Index into reversePoints of the diagonal which passes through (originalEnd, modifiedEnd)\r\n\t\tconst diagonalForwardBase = (modifiedEnd - modifiedStart);\r\n\t\tconst diagonalReverseBase = (originalEnd - originalStart);\r\n\t\t// diagonalForwardOffset: Geometric offset which allows modifiedIndex to be computed from originalIndex and the\r\n\t\t// diagonal number (relative to diagonalForwardBase)\r\n\t\t// diagonalReverseOffset: Geometric offset which allows modifiedIndex to be computed from originalIndex and the\r\n\t\t// diagonal number (relative to diagonalReverseBase)\r\n\t\tconst diagonalForwardOffset = (originalStart - modifiedStart);\r\n\t\tconst diagonalReverseOffset = (originalEnd - modifiedEnd);\r\n\r\n\t\t// delta: The difference between the end diagonal and the start diagonal. This is used to relate diagonal numbers\r\n\t\t// relative to the start diagonal with diagonal numbers relative to the end diagonal.\r\n\t\t// The Even/Oddn-ness of this delta is important for determining when we should check for overlap\r\n\t\tconst delta = diagonalReverseBase - diagonalForwardBase;\r\n\t\tconst deltaIsEven = (delta % 2 === 0);\r\n\r\n\t\t// Here we set up the start and end points as the furthest points found so far\r\n\t\t// in both the forward and reverse directions, respectively\r\n\t\tforwardPoints[diagonalForwardBase] = originalStart;\r\n\t\treversePoints[diagonalReverseBase] = originalEnd;\r\n\r\n\t\t// Remember if we quit early, and thus need to do a best-effort result instead of a real result.\r\n\t\tquitEarlyArr[0] = false;\r\n\r\n\r\n\r\n\t\t// A couple of points:\r\n\t\t// --With this method, we iterate on the number of differences between the two sequences.\r\n\t\t// The more differences there actually are, the longer this will take.\r\n\t\t// --Also, as the number of differences increases, we have to search on diagonals further\r\n\t\t// away from the reference diagonal (which is diagonalForwardBase for forward, diagonalReverseBase for reverse).\r\n\t\t// --We extend on even diagonals (relative to the reference diagonal) only when numDifferences\r\n\t\t// is even and odd diagonals only when numDifferences is odd.\r\n\t\tfor (let numDifferences = 1; numDifferences <= (maxDifferences / 2) + 1; numDifferences++) {\r\n\t\t\tlet furthestOriginalIndex = 0;\r\n\t\t\tlet furthestModifiedIndex = 0;\r\n\r\n\t\t\t// Run the algorithm in the forward direction\r\n\t\t\tdiagonalForwardStart = this.ClipDiagonalBound(diagonalForwardBase - numDifferences, numDifferences, diagonalForwardBase, numDiagonals);\r\n\t\t\tdiagonalForwardEnd = this.ClipDiagonalBound(diagonalForwardBase + numDifferences, numDifferences, diagonalForwardBase, numDiagonals);\r\n\t\t\tfor (let diagonal = diagonalForwardStart; diagonal <= diagonalForwardEnd; diagonal += 2) {\r\n\t\t\t\t// STEP 1: We extend the furthest reaching point in the present diagonal\r\n\t\t\t\t// by looking at the diagonals above and below and picking the one whose point\r\n\t\t\t\t// is further away from the start point (originalStart, modifiedStart)\r\n\t\t\t\tif (diagonal === diagonalForwardStart || (diagonal < diagonalForwardEnd && forwardPoints[diagonal - 1] < forwardPoints[diagonal + 1])) {\r\n\t\t\t\t\toriginalIndex = forwardPoints[diagonal + 1];\r\n\t\t\t\t} else {\r\n\t\t\t\t\toriginalIndex = forwardPoints[diagonal - 1] + 1;\r\n\t\t\t\t}\r\n\t\t\t\tmodifiedIndex = originalIndex - (diagonal - diagonalForwardBase) - diagonalForwardOffset;\r\n\r\n\t\t\t\t// Save the current originalIndex so we can test for false overlap in step 3\r\n\t\t\t\tconst tempOriginalIndex = originalIndex;\r\n\r\n\t\t\t\t// STEP 2: We can continue to extend the furthest reaching point in the present diagonal\r\n\t\t\t\t// so long as the elements are equal.\r\n\t\t\t\twhile (originalIndex < originalEnd && modifiedIndex < modifiedEnd && this.ElementsAreEqual(originalIndex + 1, modifiedIndex + 1)) {\r\n\t\t\t\t\toriginalIndex++;\r\n\t\t\t\t\tmodifiedIndex++;\r\n\t\t\t\t}\r\n\t\t\t\tforwardPoints[diagonal] = originalIndex;\r\n\r\n\t\t\t\tif (originalIndex + modifiedIndex > furthestOriginalIndex + furthestModifiedIndex) {\r\n\t\t\t\t\tfurthestOriginalIndex = originalIndex;\r\n\t\t\t\t\tfurthestModifiedIndex = modifiedIndex;\r\n\t\t\t\t}\r\n\r\n\t\t\t\t// STEP 3: If delta is odd (overlap first happens on forward when delta is odd)\r\n\t\t\t\t// and diagonal is in the range of reverse diagonals computed for numDifferences-1\r\n\t\t\t\t// (the previous iteration; we haven't computed reverse diagonals for numDifferences yet)\r\n\t\t\t\t// then check for overlap.\r\n\t\t\t\tif (!deltaIsEven && Math.abs(diagonal - diagonalReverseBase) <= (numDifferences - 1)) {\r\n\t\t\t\t\tif (originalIndex >= reversePoints[diagonal]) {\r\n\t\t\t\t\t\tmidOriginalArr[0] = originalIndex;\r\n\t\t\t\t\t\tmidModifiedArr[0] = modifiedIndex;\r\n\r\n\t\t\t\t\t\tif (tempOriginalIndex <= reversePoints[diagonal] && LocalConstants.MaxDifferencesHistory > 0 && numDifferences <= (LocalConstants.MaxDifferencesHistory + 1)) {\r\n\t\t\t\t\t\t\t// BINGO! We overlapped, and we have the full trace in memory!\r\n\t\t\t\t\t\t\treturn this.WALKTRACE(diagonalForwardBase, diagonalForwardStart, diagonalForwardEnd, diagonalForwardOffset,\r\n\t\t\t\t\t\t\t\tdiagonalReverseBase, diagonalReverseStart, diagonalReverseEnd, diagonalReverseOffset,\r\n\t\t\t\t\t\t\t\tforwardPoints, reversePoints,\r\n\t\t\t\t\t\t\t\toriginalIndex, originalEnd, midOriginalArr,\r\n\t\t\t\t\t\t\t\tmodifiedIndex, modifiedEnd, midModifiedArr,\r\n\t\t\t\t\t\t\t\tdeltaIsEven, quitEarlyArr\r\n\t\t\t\t\t\t\t);\r\n\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\t// Either false overlap, or we didn't have enough memory for the full trace\r\n\t\t\t\t\t\t\t// Just return the recursion point\r\n\t\t\t\t\t\t\treturn null;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\t// Check to see if we should be quitting early, before moving on to the next iteration.\r\n\t\t\tconst matchLengthOfLongest = ((furthestOriginalIndex - originalStart) + (furthestModifiedIndex - modifiedStart) - numDifferences) / 2;\r\n\r\n\t\t\tif (this.ContinueProcessingPredicate !== null && !this.ContinueProcessingPredicate(furthestOriginalIndex, matchLengthOfLongest)) {\r\n\t\t\t\t// We can't finish, so skip ahead to generating a result from what we have.\r\n\t\t\t\tquitEarlyArr[0] = true;\r\n\r\n\t\t\t\t// Use the furthest distance we got in the forward direction.\r\n\t\t\t\tmidOriginalArr[0] = furthestOriginalIndex;\r\n\t\t\t\tmidModifiedArr[0] = furthestModifiedIndex;\r\n\r\n\t\t\t\tif (matchLengthOfLongest > 0 && LocalConstants.MaxDifferencesHistory > 0 && numDifferences <= (LocalConstants.MaxDifferencesHistory + 1)) {\r\n\t\t\t\t\t// Enough of the history is in memory to walk it backwards\r\n\t\t\t\t\treturn this.WALKTRACE(diagonalForwardBase, diagonalForwardStart, diagonalForwardEnd, diagonalForwardOffset,\r\n\t\t\t\t\t\tdiagonalReverseBase, diagonalReverseStart, diagonalReverseEnd, diagonalReverseOffset,\r\n\t\t\t\t\t\tforwardPoints, reversePoints,\r\n\t\t\t\t\t\toriginalIndex, originalEnd, midOriginalArr,\r\n\t\t\t\t\t\tmodifiedIndex, modifiedEnd, midModifiedArr,\r\n\t\t\t\t\t\tdeltaIsEven, quitEarlyArr\r\n\t\t\t\t\t);\r\n\t\t\t\t} else {\r\n\t\t\t\t\t// We didn't actually remember enough of the history.\r\n\r\n\t\t\t\t\t//Since we are quiting the diff early, we need to shift back the originalStart and modified start\r\n\t\t\t\t\t//back into the boundary limits since we decremented their value above beyond the boundary limit.\r\n\t\t\t\t\toriginalStart++;\r\n\t\t\t\t\tmodifiedStart++;\r\n\r\n\t\t\t\t\treturn [\r\n\t\t\t\t\t\tnew DiffChange(originalStart, originalEnd - originalStart + 1,\r\n\t\t\t\t\t\t\tmodifiedStart, modifiedEnd - modifiedStart + 1)\r\n\t\t\t\t\t];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\t// Run the algorithm in the reverse direction\r\n\t\t\tdiagonalReverseStart = this.ClipDiagonalBound(diagonalReverseBase - numDifferences, numDifferences, diagonalReverseBase, numDiagonals);\r\n\t\t\tdiagonalReverseEnd = this.ClipDiagonalBound(diagonalReverseBase + numDifferences, numDifferences, diagonalReverseBase, numDiagonals);\r\n\t\t\tfor (let diagonal = diagonalReverseStart; diagonal <= diagonalReverseEnd; diagonal += 2) {\r\n\t\t\t\t// STEP 1: We extend the furthest reaching point in the present diagonal\r\n\t\t\t\t// by looking at the diagonals above and below and picking the one whose point\r\n\t\t\t\t// is further away from the start point (originalEnd, modifiedEnd)\r\n\t\t\t\tif (diagonal === diagonalReverseStart || (diagonal < diagonalReverseEnd && reversePoints[diagonal - 1] >= reversePoints[diagonal + 1])) {\r\n\t\t\t\t\toriginalIndex = reversePoints[diagonal + 1] - 1;\r\n\t\t\t\t} else {\r\n\t\t\t\t\toriginalIndex = reversePoints[diagonal - 1];\r\n\t\t\t\t}\r\n\t\t\t\tmodifiedIndex = originalIndex - (diagonal - diagonalReverseBase) - diagonalReverseOffset;\r\n\r\n\t\t\t\t// Save the current originalIndex so we can test for false overlap\r\n\t\t\t\tconst tempOriginalIndex = originalIndex;\r\n\r\n\t\t\t\t// STEP 2: We can continue to extend the furthest reaching point in the present diagonal\r\n\t\t\t\t// as long as the elements are equal.\r\n\t\t\t\twhile (originalIndex > originalStart && modifiedIndex > modifiedStart && this.ElementsAreEqual(originalIndex, modifiedIndex)) {\r\n\t\t\t\t\toriginalIndex--;\r\n\t\t\t\t\tmodifiedIndex--;\r\n\t\t\t\t}\r\n\t\t\t\treversePoints[diagonal] = originalIndex;\r\n\r\n\t\t\t\t// STEP 4: If delta is even (overlap first happens on reverse when delta is even)\r\n\t\t\t\t// and diagonal is in the range of forward diagonals computed for numDifferences\r\n\t\t\t\t// then check for overlap.\r\n\t\t\t\tif (deltaIsEven && Math.abs(diagonal - diagonalForwardBase) <= numDifferences) {\r\n\t\t\t\t\tif (originalIndex <= forwardPoints[diagonal]) {\r\n\t\t\t\t\t\tmidOriginalArr[0] = originalIndex;\r\n\t\t\t\t\t\tmidModifiedArr[0] = modifiedIndex;\r\n\r\n\t\t\t\t\t\tif (tempOriginalIndex >= forwardPoints[diagonal] && LocalConstants.MaxDifferencesHistory > 0 && numDifferences <= (LocalConstants.MaxDifferencesHistory + 1)) {\r\n\t\t\t\t\t\t\t// BINGO! We overlapped, and we have the full trace in memory!\r\n\t\t\t\t\t\t\treturn this.WALKTRACE(diagonalForwardBase, diagonalForwardStart, diagonalForwardEnd, diagonalForwardOffset,\r\n\t\t\t\t\t\t\t\tdiagonalReverseBase, diagonalReverseStart, diagonalReverseEnd, diagonalReverseOffset,\r\n\t\t\t\t\t\t\t\tforwardPoints, reversePoints,\r\n\t\t\t\t\t\t\t\toriginalIndex, originalEnd, midOriginalArr,\r\n\t\t\t\t\t\t\t\tmodifiedIndex, modifiedEnd, midModifiedArr,\r\n\t\t\t\t\t\t\t\tdeltaIsEven, quitEarlyArr\r\n\t\t\t\t\t\t\t);\r\n\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\t// Either false overlap, or we didn't have enough memory for the full trace\r\n\t\t\t\t\t\t\t// Just return the recursion point\r\n\t\t\t\t\t\t\treturn null;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\t// Save current vectors to history before the next iteration\r\n\t\t\tif (numDifferences <= LocalConstants.MaxDifferencesHistory) {\r\n\t\t\t\t// We are allocating space for one extra int, which we fill with\r\n\t\t\t\t// the index of the diagonal base index\r\n\t\t\t\tlet temp = new Int32Array(diagonalForwardEnd - diagonalForwardStart + 2);\r\n\t\t\t\ttemp[0] = diagonalForwardBase - diagonalForwardStart + 1;\r\n\t\t\t\tMyArray.Copy2(forwardPoints, diagonalForwardStart, temp, 1, diagonalForwardEnd - diagonalForwardStart + 1);\r\n\t\t\t\tthis.m_forwardHistory.push(temp);\r\n\r\n\t\t\t\ttemp = new Int32Array(diagonalReverseEnd - diagonalReverseStart + 2);\r\n\t\t\t\ttemp[0] = diagonalReverseBase - diagonalReverseStart + 1;\r\n\t\t\t\tMyArray.Copy2(reversePoints, diagonalReverseStart, temp, 1, diagonalReverseEnd - diagonalReverseStart + 1);\r\n\t\t\t\tthis.m_reverseHistory.push(temp);\r\n\t\t\t}\r\n\r\n\t\t}\r\n\r\n\t\t// If we got here, then we have the full trace in history. We just have to convert it to a change list\r\n\t\t// NOTE: This part is a bit messy\r\n\t\treturn this.WALKTRACE(diagonalForwardBase, diagonalForwardStart, diagonalForwardEnd, diagonalForwardOffset,\r\n\t\t\tdiagonalReverseBase, diagonalReverseStart, diagonalReverseEnd, diagonalReverseOffset,\r\n\t\t\tforwardPoints, reversePoints,\r\n\t\t\toriginalIndex, originalEnd, midOriginalArr,\r\n\t\t\tmodifiedIndex, modifiedEnd, midModifiedArr,\r\n\t\t\tdeltaIsEven, quitEarlyArr\r\n\t\t);\r\n\t}\r\n\r\n\t/**\r\n\t * Shifts the given changes to provide a more intuitive diff.\r\n\t * While the first element in a diff matches the first element after the diff,\r\n\t * we shift the diff down.\r\n\t *\r\n\t * @param changes The list of changes to shift\r\n\t * @returns The shifted changes\r\n\t */\r\n\tprivate PrettifyChanges(changes: DiffChange[]): DiffChange[] {\r\n\r\n\t\t// Shift all the changes down first\r\n\t\tfor (let i = 0; i < changes.length; i++) {\r\n\t\t\tconst change = changes[i];\r\n\t\t\tconst originalStop = (i < changes.length - 1) ? changes[i + 1].originalStart : this._originalElementsOrHash.length;\r\n\t\t\tconst modifiedStop = (i < changes.length - 1) ? changes[i + 1].modifiedStart : this._modifiedElementsOrHash.length;\r\n\t\t\tconst checkOriginal = change.originalLength > 0;\r\n\t\t\tconst checkModified = change.modifiedLength > 0;\r\n\r\n\t\t\twhile (change.originalStart + change.originalLength < originalStop &&\r\n\t\t\t\tchange.modifiedStart + change.modifiedLength < modifiedStop &&\r\n\t\t\t\t(!checkOriginal || this.OriginalElementsAreEqual(change.originalStart, change.originalStart + change.originalLength)) &&\r\n\t\t\t\t(!checkModified || this.ModifiedElementsAreEqual(change.modifiedStart, change.modifiedStart + change.modifiedLength))) {\r\n\t\t\t\tchange.originalStart++;\r\n\t\t\t\tchange.modifiedStart++;\r\n\t\t\t}\r\n\r\n\t\t\tlet mergedChangeArr: Array<DiffChange | null> = [null];\r\n\t\t\tif (i < changes.length - 1 && this.ChangesOverlap(changes[i], changes[i + 1], mergedChangeArr)) {\r\n\t\t\t\tchanges[i] = mergedChangeArr[0]!;\r\n\t\t\t\tchanges.splice(i + 1, 1);\r\n\t\t\t\ti--;\r\n\t\t\t\tcontinue;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\t// Shift changes back up until we hit empty or whitespace-only lines\r\n\t\tfor (let i = changes.length - 1; i >= 0; i--) {\r\n\t\t\tconst change = changes[i];\r\n\r\n\t\t\tlet originalStop = 0;\r\n\t\t\tlet modifiedStop = 0;\r\n\t\t\tif (i > 0) {\r\n\t\t\t\tconst prevChange = changes[i - 1];\r\n\t\t\t\tif (prevChange.originalLength > 0) {\r\n\t\t\t\t\toriginalStop = prevChange.originalStart + prevChange.originalLength;\r\n\t\t\t\t}\r\n\t\t\t\tif (prevChange.modifiedLength > 0) {\r\n\t\t\t\t\tmodifiedStop = prevChange.modifiedStart + prevChange.modifiedLength;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\tconst checkOriginal = change.originalLength > 0;\r\n\t\t\tconst checkModified = change.modifiedLength > 0;\r\n\r\n\t\t\tlet bestDelta = 0;\r\n\t\t\tlet bestScore = this._boundaryScore(change.originalStart, change.originalLength, change.modifiedStart, change.modifiedLength);\r\n\r\n\t\t\tfor (let delta = 1; ; delta++) {\r\n\t\t\t\tconst originalStart = change.originalStart - delta;\r\n\t\t\t\tconst modifiedStart = change.modifiedStart - delta;\r\n\r\n\t\t\t\tif (originalStart < originalStop || modifiedStart < modifiedStop) {\r\n\t\t\t\t\tbreak;\r\n\t\t\t\t}\r\n\r\n\t\t\t\tif (checkOriginal && !this.OriginalElementsAreEqual(originalStart, originalStart + change.originalLength)) {\r\n\t\t\t\t\tbreak;\r\n\t\t\t\t}\r\n\r\n\t\t\t\tif (checkModified && !this.ModifiedElementsAreEqual(modifiedStart, modifiedStart + change.modifiedLength)) {\r\n\t\t\t\t\tbreak;\r\n\t\t\t\t}\r\n\r\n\t\t\t\tconst score = this._boundaryScore(originalStart, change.originalLength, modifiedStart, change.modifiedLength);\r\n\r\n\t\t\t\tif (score > bestScore) {\r\n\t\t\t\t\tbestScore = score;\r\n\t\t\t\t\tbestDelta = delta;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\tchange.originalStart -= bestDelta;\r\n\t\t\tchange.modifiedStart -= bestDelta;\r\n\t\t}\r\n\r\n\t\treturn changes;\r\n\t}\r\n\r\n\tprivate _OriginalIsBoundary(index: number): boolean {\r\n\t\tif (index <= 0 || index >= this._originalElementsOrHash.length - 1) {\r\n\t\t\treturn true;\r\n\t\t}\r\n\t\treturn (this._hasStrings && /^\\s*$/.test(this._originalStringElements[index]));\r\n\t}\r\n\r\n\tprivate _OriginalRegionIsBoundary(originalStart: number, originalLength: number): boolean {\r\n\t\tif (this._OriginalIsBoundary(originalStart) || this._OriginalIsBoundary(originalStart - 1)) {\r\n\t\t\treturn true;\r\n\t\t}\r\n\t\tif (originalLength > 0) {\r\n\t\t\tconst originalEnd = originalStart + originalLength;\r\n\t\t\tif (this._OriginalIsBoundary(originalEnd - 1) || this._OriginalIsBoundary(originalEnd)) {\r\n\t\t\t\treturn true;\r\n\t\t\t}\r\n\t\t}\r\n\t\treturn false;\r\n\t}\r\n\r\n\tprivate _ModifiedIsBoundary(index: number): boolean {\r\n\t\tif (index <= 0 || index >= this._modifiedElementsOrHash.length - 1) {\r\n\t\t\treturn true;\r\n\t\t}\r\n\t\treturn (this._hasStrings && /^\\s*$/.test(this._modifiedStringElements[index]));\r\n\t}\r\n\r\n\tprivate _ModifiedRegionIsBoundary(modifiedStart: number, modifiedLength: number): boolean {\r\n\t\tif (this._ModifiedIsBoundary(modifiedStart) || this._ModifiedIsBoundary(modifiedStart - 1)) {\r\n\t\t\treturn true;\r\n\t\t}\r\n\t\tif (modifiedLength > 0) {\r\n\t\t\tconst modifiedEnd = modifiedStart + modifiedLength;\r\n\t\t\tif (this._ModifiedIsBoundary(modifiedEnd - 1) || this._ModifiedIsBoundary(modifiedEnd)) {\r\n\t\t\t\treturn true;\r\n\t\t\t}\r\n\t\t}\r\n\t\treturn false;\r\n\t}\r\n\r\n\tprivate _boundaryScore(originalStart: number, originalLength: number, modifiedStart: number, modifiedLength: number): number {\r\n\t\tconst originalScore = (this._OriginalRegionIsBoundary(originalStart, originalLength) ? 1 : 0);\r\n\t\tconst modifiedScore = (this._ModifiedRegionIsBoundary(modifiedStart, modifiedLength) ? 1 : 0);\r\n\t\treturn (originalScore + modifiedScore);\r\n\t}\r\n\r\n\t/**\r\n\t * Concatenates the two input DiffChange lists and returns the resulting\r\n\t * list.\r\n\t * @param The left changes\r\n\t * @param The right changes\r\n\t * @returns The concatenated list\r\n\t */\r\n\tprivate ConcatenateChanges(left: DiffChange[], right: DiffChange[]): DiffChange[] {\r\n\t\tlet mergedChangeArr: DiffChange[] = [];\r\n\r\n\t\tif (left.length === 0 || right.length === 0) {\r\n\t\t\treturn (right.length > 0) ? right : left;\r\n\t\t} else if (this.ChangesOverlap(left[left.length - 1], right[0], mergedChangeArr)) {\r\n\t\t\t// Since we break the problem down recursively, it is possible that we\r\n\t\t\t// might recurse in the middle of a change thereby splitting it into\r\n\t\t\t// two changes. Here in the combining stage, we detect and fuse those\r\n\t\t\t// changes back together\r\n\t\t\tconst result = new Array<DiffChange>(left.length + right.length - 1);\r\n\t\t\tMyArray.Copy(left, 0, result, 0, left.length - 1);\r\n\t\t\tresult[left.length - 1] = mergedChangeArr[0];\r\n\t\t\tMyArray.Copy(right, 1, result, left.length, right.length - 1);\r\n\r\n\t\t\treturn result;\r\n\t\t} else {\r\n\t\t\tconst result = new Array<DiffChange>(left.length + right.length);\r\n\t\t\tMyArray.Copy(left, 0, result, 0, left.length);\r\n\t\t\tMyArray.Copy(right, 0, result, left.length, right.length);\r\n\r\n\t\t\treturn result;\r\n\t\t}\r\n\t}\r\n\r\n\t/**\r\n\t * Returns true if the two changes overlap and can be merged into a single\r\n\t * change\r\n\t * @param left The left change\r\n\t * @param right The right change\r\n\t * @param mergedChange The merged change if the two overlap, null otherwise\r\n\t * @returns True if the two changes overlap\r\n\t */\r\n\tprivate ChangesOverlap(left: DiffChange, right: DiffChange, mergedChangeArr: Array<DiffChange | null>): boolean {\r\n\t\tDebug.Assert(left.originalStart <= right.originalStart, 'Left change is not less than or equal to right change');\r\n\t\tDebug.Assert(left.modifiedStart <= right.modifiedStart, 'Left change is not less than or equal to right change');\r\n\r\n\t\tif (left.originalStart + left.originalLength >= right.originalStart || left.modifiedStart + left.modifiedLength >= right.modifiedStart) {\r\n\t\t\tconst originalStart = left.originalStart;\r\n\t\t\tlet originalLength = left.originalLength;\r\n\t\t\tconst modifiedStart = left.modifiedStart;\r\n\t\t\tlet modifiedLength = left.modifiedLength;\r\n\r\n\t\t\tif (left.originalStart + left.originalLength >= right.originalStart) {\r\n\t\t\t\toriginalLength = right.originalStart + right.originalLength - left.originalStart;\r\n\t\t\t}\r\n\t\t\tif (left.modifiedStart + left.modifiedLength >= right.modifiedStart) {\r\n\t\t\t\tmodifiedLength = right.modifiedStart + right.modifiedLength - left.modifiedStart;\r\n\t\t\t}\r\n\r\n\t\t\tmergedChangeArr[0] = new DiffChange(originalStart, originalLength, modifiedStart, modifiedLength);\r\n\t\t\treturn true;\r\n\t\t} else {\r\n\t\t\tmergedChangeArr[0] = null;\r\n\t\t\treturn false;\r\n\t\t}\r\n\t}\r\n\r\n\t/**\r\n\t * Helper method used to clip a diagonal index to the range of valid\r\n\t * diagonals. This also decides whether or not the diagonal index,\r\n\t * if it exceeds the boundary, should be clipped to the boundary or clipped\r\n\t * one inside the boundary depending on the Even/Odd status of the boundary\r\n\t * and numDifferences.\r\n\t * @param diagonal The index of the diagonal to clip.\r\n\t * @param numDifferences The current number of differences being iterated upon.\r\n\t * @param diagonalBaseIndex The base reference diagonal.\r\n\t * @param numDiagonals The total number of diagonals.\r\n\t * @returns The clipped diagonal index.\r\n\t */\r\n\tprivate ClipDiagonalBound(diagonal: number, numDifferences: number, diagonalBaseIndex: number, numDiagonals: number): number {\r\n\t\tif (diagonal >= 0 && diagonal < numDiagonals) {\r\n\t\t\t// Nothing to clip, its in range\r\n\t\t\treturn diagonal;\r\n\t\t}\r\n\r\n\t\t// diagonalsBelow: The number of diagonals below the reference diagonal\r\n\t\t// diagonalsAbove: The number of diagonals above the reference diagonal\r\n\t\tconst diagonalsBelow = diagonalBaseIndex;\r\n\t\tconst diagonalsAbove = numDiagonals - diagonalBaseIndex - 1;\r\n\t\tconst diffEven = (numDifferences % 2 === 0);\r\n\r\n\t\tif (diagonal < 0) {\r\n\t\t\tconst lowerBoundEven = (diagonalsBelow % 2 === 0);\r\n\t\t\treturn (diffEven === lowerBoundEven) ? 0 : 1;\r\n\t\t} else {\r\n\t\t\tconst upperBoundEven = (diagonalsAbove % 2 === 0);\r\n\t\t\treturn (diffEven === upperBoundEven) ? numDiagonals - 1 : numDiagonals - 2;\r\n\t\t}\r\n\t}\r\n}\r\n","\r\n\r\n/**\r\n * @returns whether the provided parameter is a JavaScript Array or not.\r\n */\r\nexport function isArray<T>(array: T | {}): array is T extends readonly any[] ? (unknown extends T ? never : readonly any[]) : any[] {\r\n\treturn Array.isArray(array);\r\n}\r\n\r\n/**\r\n * @returns whether the provided parameter is a JavaScript String or not.\r\n */\r\nexport function isString(str: any): str is string {\r\n\treturn (typeof str === 'string');\r\n}\r\n\r\n/**\r\n *\r\n * @returns whether the provided parameter is of type `object` but **not**\r\n *\t`null`, an `array`, a `regexp`, nor a `date`.\r\n */\r\nexport function isObject(obj: any): obj is Object {\r\n\t// The method can't do a type cast since there are type (like strings) which\r\n\t// are subclasses of any put not positvely matched by the function. Hence type\r\n\t// narrowing results in wrong results.\r\n\treturn typeof obj === 'object'\r\n\t\t&& obj !== null\r\n\t\t&& !Array.isArray(obj)\r\n\t\t&& !(obj instanceof RegExp)\r\n\t\t&& !(obj instanceof Date);\r\n}\r\n\r\n/**\r\n * In **contrast** to just checking `typeof` this will return `false` for `NaN`.\r\n * @returns whether the provided parameter is a JavaScript Number or not.\r\n */\r\nexport function isNumber(obj: any): obj is number {\r\n\treturn (typeof obj === 'number' && !isNaN(obj));\r\n}\r\n\r\n/**\r\n * @returns whether the provided parameter is a JavaScript Boolean or not.\r\n */\r\nexport function isBoolean(obj: any): obj is boolean {\r\n\treturn (obj === true || obj === false);\r\n}\r\n\r\n/**\r\n * @returns whether the provided parameter is undefined.\r\n */\r\nexport function isUndefined(obj: any): obj is undefined {\r\n\treturn (typeof obj === 'undefined');\r\n}\r\n\r\n/**\r\n * @returns whether the provided parameter is undefined or null.\r\n */\r\nexport function isUndefinedOrNull(obj: any): obj is undefined | null {\r\n\treturn (isUndefined(obj) || obj === null);\r\n}\r\n\r\n\r\nexport function assertType(condition: any, type?: string): asserts condition {\r\n\tif (!condition) {\r\n\t\tthrow new Error(type ? `Unexpected type, expected '${type}'` : 'Unexpected type');\r\n\t}\r\n}\r\n\r\n/**\r\n * Asserts that the argument passed in is neither undefined nor null.\r\n */\r\nexport function assertIsDefined<T>(arg: T | null | undefined): T {\r\n\tif (isUndefinedOrNull(arg)) {\r\n\t\tthrow new Error('Assertion Failed: argument is undefined or null');\r\n\t}\r\n\r\n\treturn arg;\r\n}\r\n\r\n/**\r\n * @returns whether the provided parameter is a JavaScript Function or not.\r\n */\r\nexport function isFunction(obj: any): obj is Function {\r\n\treturn (typeof obj === 'function');\r\n}\r\n\r\nexport type TypeConstraint = string | Function;\r\n\r\nexport function validateConstraints(args: any[], constraints: Array<TypeConstraint | undefined>): void {\r\n\tconst len = Math.min(args.length, constraints.length);\r\n\tfor (let i = 0; i < len; i++) {\r\n\t\tvalidateConstraint(args[i], constraints[i]);\r\n\t}\r\n}\r\n\r\nexport function validateConstraint(arg: any, constraint: TypeConstraint | undefined): void {\r\n\r\n\tif (isString(constraint)) {\r\n\t\tif (typeof arg !== constraint) {\r\n\t\t\tthrow new Error(`argument does not match constraint: typeof ${constraint}`);\r\n\t\t}\r\n\t} else if (isFunction(constraint)) {\r\n\t\ttry {\r\n\t\t\tif (arg instanceof constraint) {\r\n\t\t\t\treturn;\r\n\t\t\t}\r\n\t\t} catch {\r\n\t\t\t// ignore\r\n\t\t}\r\n\t\tif (!isUndefinedOrNull(arg) && arg.constructor === constraint) {\r\n\t\t\treturn;\r\n\t\t}\r\n\t\tif (constraint.length === 1 && constraint.call(undefined, arg) === true) {\r\n\t\t\treturn;\r\n\t\t}\r\n\t\tthrow new Error(`argument does not match one of these constraints: arg instanceof constraint, arg.constructor === constraint, nor constraint(arg) === true`);\r\n\t}\r\n}\r\n\r\nexport function getAllPropertyNames(obj: object): string[] {\r\n\tlet res: string[] = [];\r\n\tlet proto = Object.getPrototypeOf(obj);\r\n\twhile (Object.prototype !== proto) {\r\n\t\tres = res.concat(Object.getOwnPropertyNames(proto));\r\n\t\tproto = Object.getPrototypeOf(proto);\r\n\t}\r\n\treturn res;\r\n}\r\n\r\nexport function getAllMethodNames(obj: object): string[] {\r\n\tconst methods: string[] = [];\r\n\tfor (const prop of getAllPropertyNames(obj)) {\r\n\t\tif (typeof (obj as any)[prop] === 'function') {\r\n\t\t\tmethods.push(prop);\r\n\t\t}\r\n\t}\r\n\treturn methods;\r\n}\r\n\r\nexport function createProxyObject<T extends object>(methodNames: string[], invoke: (method: string, args: any[]) => any): T {\r\n\tconst createProxyMethod = (method: string): () => any => {\r\n\t\treturn function () {\r\n\t\t\tconst args = Array.prototype.slice.call(arguments, 0);\r\n\t\t\treturn invoke(method, args);\r\n\t\t};\r\n\t};\r\n\r\n\tlet result = {} as T;\r\n\tfor (const methodName of methodNames) {\r\n\t\t(<any>result)[methodName] = createProxyMethod(methodName);\r\n\t}\r\n\treturn result;\r\n}\r\n\r\n/**\r\n * Converts null to undefined, passes all other values through.\r\n */\r\nexport function withNullAsUndefined<T>(x: T | null): T | undefined {\r\n\treturn x === null ? undefined : x;\r\n}\r\n","/*---------------------------------------------------------------------------------------------\r\n * Copyright (c) Microsoft Corporation. All rights reserved.\r\n * Licensed under the MIT License. See License.txt in the project root for license information.\r\n *--------------------------------------------------------------------------------------------*/\r\n\r\nexport const enum Constants {\r\n\t/**\r\n\t * MAX SMI (SMall Integer) as defined in v8.\r\n\t * one bit is lost for boxing/unboxing flag.\r\n\t * one bit is lost for sign flag.\r\n\t * See https://thibaultlaurens.github.io/javascript/2013/04/29/how-the-v8-engine-works/#tagged-values\r\n\t */\r\n\tMAX_SAFE_SMALL_INTEGER = 1 << 30,\r\n\r\n\t/**\r\n\t * MIN SMI (SMall Integer) as defined in v8.\r\n\t * one bit is lost for boxing/unboxing flag.\r\n\t * one bit is lost for sign flag.\r\n\t * See https://thibaultlaurens.github.io/javascript/2013/04/29/how-the-v8-engine-works/#tagged-values\r\n\t */\r\n\tMIN_SAFE_SMALL_INTEGER = -(1 << 30),\r\n\r\n\t/**\r\n\t * Max unsigned integer that fits on 8 bits.\r\n\t */\r\n\tMAX_UINT_8 = 255, // 2^8 - 1\r\n\r\n\t/**\r\n\t * Max unsigned integer that fits on 16 bits.\r\n\t */\r\n\tMAX_UINT_16 = 65535, // 2^16 - 1\r\n\r\n\t/**\r\n\t * Max unsigned integer that fits on 32 bits.\r\n\t */\r\n\tMAX_UINT_32 = 4294967295, // 2^32 - 1\r\n\r\n\tUNICODE_SUPPLEMENTARY_PLANE_BEGIN = 0x010000\r\n}\r\n\r\nexport function toUint8(v: number): number {\r\n\tif (v < 0) {\r\n\t\treturn 0;\r\n\t}\r\n\tif (v > Constants.MAX_UINT_8) {\r\n\t\treturn Constants.MAX_UINT_8;\r\n\t}\r\n\treturn v | 0;\r\n}\r\n\r\nexport function toUint32(v: number): number {\r\n\tif (v < 0) {\r\n\t\treturn 0;\r\n\t}\r\n\tif (v > Constants.MAX_UINT_32) {\r\n\t\treturn Constants.MAX_UINT_32;\r\n\t}\r\n\treturn v | 0;\r\n}\r\n","/*---------------------------------------------------------------------------------------------\r\n * Copyright (c) Microsoft Corporation. All rights reserved.\r\n * Licensed under the MIT License. See License.txt in the project root for license information.\r\n *--------------------------------------------------------------------------------------------*/\r\n\r\nimport { isWindows } from 'vs/base/common/platform';\r\nimport { CharCode } from 'vs/base/common/charCode';\r\nimport * as paths from 'vs/base/common/path';\r\n\r\nconst _schemePattern = /^\\w[\\w\\d+.-]*$/;\r\nconst _singleSlashStart = /^\\//;\r\nconst _doubleSlashStart = /^\\/\\//;\r\n\r\nfunction _validateUri(ret: URI, _strict?: boolean): void {\r\n\r\n\t// scheme, must be set\r\n\tif (!ret.scheme && _strict) {\r\n\t\tthrow new Error(`[UriError]: Scheme is missing: {scheme: \"\", authority: \"${ret.authority}\", path: \"${ret.path}\", query: \"${ret.query}\", fragment: \"${ret.fragment}\"}`);\r\n\t}\r\n\r\n\t// scheme, https://tools.ietf.org/html/rfc3986#section-3.1\r\n\t// ALPHA *( ALPHA / DIGIT / \"+\" / \"-\" / \".\" )\r\n\tif (ret.scheme && !_schemePattern.test(ret.scheme)) {\r\n\t\tthrow new Error('[UriError]: Scheme contains illegal characters.');\r\n\t}\r\n\r\n\t// path, http://tools.ietf.org/html/rfc3986#section-3.3\r\n\t// If a URI contains an authority component, then the path component\r\n\t// must either be empty or begin with a slash (\"/\") character. If a URI\r\n\t// does not contain an authority component, then the path cannot begin\r\n\t// with two slash characters (\"//\").\r\n\tif (ret.path) {\r\n\t\tif (ret.authority) {\r\n\t\t\tif (!_singleSlashStart.test(ret.path)) {\r\n\t\t\t\tthrow new Error('[UriError]: If a URI contains an authority component, then the path component must either be empty or begin with a slash (\"/\") character');\r\n\t\t\t}\r\n\t\t} else {\r\n\t\t\tif (_doubleSlashStart.test(ret.path)) {\r\n\t\t\t\tthrow new Error('[UriError]: If a URI does not contain an authority component, then the path cannot begin with two slash characters (\"//\")');\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n}\r\n\r\n// for a while we allowed uris *without* schemes and this is the migration\r\n// for them, e.g. an uri without scheme and without strict-mode warns and falls\r\n// back to the file-scheme. that should cause the least carnage and still be a\r\n// clear warning\r\nfunction _schemeFix(scheme: string, _strict: boolean): string {\r\n\tif (!scheme && !_strict) {\r\n\t\treturn 'file';\r\n\t}\r\n\treturn scheme;\r\n}\r\n\r\n// implements a bit of https://tools.ietf.org/html/rfc3986#section-5\r\nfunction _referenceResolution(scheme: string, path: string): string {\r\n\r\n\t// the slash-character is our 'default base' as we don't\r\n\t// support constructing URIs relative to other URIs. This\r\n\t// also means that we alter and potentially break paths.\r\n\t// see https://tools.ietf.org/html/rfc3986#section-5.1.4\r\n\tswitch (scheme) {\r\n\t\tcase 'https':\r\n\t\tcase 'http':\r\n\t\tcase 'file':\r\n\t\t\tif (!path) {\r\n\t\t\t\tpath = _slash;\r\n\t\t\t} else if (path[0] !== _slash) {\r\n\t\t\t\tpath = _slash + path;\r\n\t\t\t}\r\n\t\t\tbreak;\r\n\t}\r\n\treturn path;\r\n}\r\n\r\nconst _empty = '';\r\nconst _slash = '/';\r\nconst _regexp = /^(([^:/?#]+?):)?(\\/\\/([^/?#]*))?([^?#]*)(\\?([^#]*))?(#(.*))?/;\r\n\r\n/**\r\n * Uniform Resource Identifier (URI) http://tools.ietf.org/html/rfc3986.\r\n * This class is a simple parser which creates the basic component parts\r\n * (http://tools.ietf.org/html/rfc3986#section-3) with minimal validation\r\n * and encoding.\r\n *\r\n * ```txt\r\n * foo://example.com:8042/over/there?name=ferret#nose\r\n * \\_/ \\______________/\\_________/ \\_________/ \\__/\r\n * | | | | |\r\n * scheme authority path query fragment\r\n * | _____________________|__\r\n * / \\ / \\\r\n * urn:example:animal:ferret:nose\r\n * ```\r\n */\r\nexport class URI implements UriComponents {\r\n\r\n\tstatic isUri(thing: any): thing is URI {\r\n\t\tif (thing instanceof URI) {\r\n\t\t\treturn true;\r\n\t\t}\r\n\t\tif (!thing) {\r\n\t\t\treturn false;\r\n\t\t}\r\n\t\treturn typeof (<URI>thing).authority === 'string'\r\n\t\t\t&& typeof (<URI>thing).fragment === 'string'\r\n\t\t\t&& typeof (<URI>thing).path === 'string'\r\n\t\t\t&& typeof (<URI>thing).query === 'string'\r\n\t\t\t&& typeof (<URI>thing).scheme === 'string'\r\n\t\t\t&& typeof (<URI>thing).fsPath === 'function'\r\n\t\t\t&& typeof (<URI>thing).with === 'function'\r\n\t\t\t&& typeof (<URI>thing).toString === 'function';\r\n\t}\r\n\r\n\t/**\r\n\t * scheme is the 'http' part of 'http://www.msft.com/some/path?query#fragment'.\r\n\t * The part before the first colon.\r\n\t */\r\n\treadonly scheme: string;\r\n\r\n\t/**\r\n\t * authority is the 'www.msft.com' part of 'http://www.msft.com/some/path?query#fragment'.\r\n\t * The part between the first double slashes and the next slash.\r\n\t */\r\n\treadonly authority: string;\r\n\r\n\t/**\r\n\t * path is the '/some/path' part of 'http://www.msft.com/some/path?query#fragment'.\r\n\t */\r\n\treadonly path: string;\r\n\r\n\t/**\r\n\t * query is the 'query' part of 'http://www.msft.com/some/path?query#fragment'.\r\n\t */\r\n\treadonly query: string;\r\n\r\n\t/**\r\n\t * fragment is the 'fragment' part of 'http://www.msft.com/some/path?query#fragment'.\r\n\t */\r\n\treadonly fragment: string;\r\n\r\n\t/**\r\n\t * @internal\r\n\t */\r\n\tprotected constructor(scheme: string, authority?: string, path?: string, query?: string, fragment?: string, _strict?: boolean);\r\n\r\n\t/**\r\n\t * @internal\r\n\t */\r\n\tprotected constructor(components: UriComponents);\r\n\r\n\t/**\r\n\t * @internal\r\n\t */\r\n\tprotected constructor(schemeOrData: string | UriComponents, authority?: string, path?: string, query?: string, fragment?: string, _strict: boolean = false) {\r\n\r\n\t\tif (typeof schemeOrData === 'object') {\r\n\t\t\tthis.scheme = schemeOrData.scheme || _empty;\r\n\t\t\tthis.authority = schemeOrData.authority || _empty;\r\n\t\t\tthis.path = schemeOrData.path || _empty;\r\n\t\t\tthis.query = schemeOrData.query || _empty;\r\n\t\t\tthis.fragment = schemeOrData.fragment || _empty;\r\n\t\t\t// no validation because it's this URI\r\n\t\t\t// that creates uri components.\r\n\t\t\t// _validateUri(this);\r\n\t\t} else {\r\n\t\t\tthis.scheme = _schemeFix(schemeOrData, _strict);\r\n\t\t\tthis.authority = authority || _empty;\r\n\t\t\tthis.path = _referenceResolution(this.scheme, path || _empty);\r\n\t\t\tthis.query = query || _empty;\r\n\t\t\tthis.fragment = fragment || _empty;\r\n\r\n\t\t\t_validateUri(this, _strict);\r\n\t\t}\r\n\t}\r\n\r\n\t// ---- filesystem path -----------------------\r\n\r\n\t/**\r\n\t * Returns a string representing the corresponding file system path of this URI.\r\n\t * Will handle UNC paths, normalizes windows drive letters to lower-case, and uses the\r\n\t * platform specific path separator.\r\n\t *\r\n\t * * Will *not* validate the path for invalid characters and semantics.\r\n\t * * Will *not* look at the scheme of this URI.\r\n\t * * The result shall *not* be used for display purposes but for accessing a file on disk.\r\n\t *\r\n\t *\r\n\t * The *difference* to `URI#path` is the use of the platform specific separator and the handling\r\n\t * of UNC paths. See the below sample of a file-uri with an authority (UNC path).\r\n\t *\r\n\t * ```ts\r\n\t\tconst u = URI.parse('file://server/c$/folder/file.txt')\r\n\t\tu.authority === 'server'\r\n\t\tu.path === '/shares/c$/file.txt'\r\n\t\tu.fsPath === '\\\\server\\c$\\folder\\file.txt'\r\n\t```\r\n\t *\r\n\t * Using `URI#path` to read a file (using fs-apis) would not be enough because parts of the path,\r\n\t * namely the server name, would be missing. Therefore `URI#fsPath` exists - it's sugar to ease working\r\n\t * with URIs that represent files on disk (`file` scheme).\r\n\t */\r\n\tget fsPath(): string {\r\n\t\t// if (this.scheme !== 'file') {\r\n\t\t// \tconsole.warn(`[UriError] calling fsPath with scheme ${this.scheme}`);\r\n\t\t// }\r\n\t\treturn uriToFsPath(this, false);\r\n\t}\r\n\r\n\t// ---- modify to new -------------------------\r\n\r\n\twith(change: { scheme?: string; authority?: string | null; path?: string | null; query?: string | null; fragment?: string | null }): URI {\r\n\r\n\t\tif (!change) {\r\n\t\t\treturn this;\r\n\t\t}\r\n\r\n\t\tlet { scheme, authority, path, query, fragment } = change;\r\n\t\tif (scheme === undefined) {\r\n\t\t\tscheme = this.scheme;\r\n\t\t} else if (scheme === null) {\r\n\t\t\tscheme = _empty;\r\n\t\t}\r\n\t\tif (authority === undefined) {\r\n\t\t\tauthority = this.authority;\r\n\t\t} else if (authority === null) {\r\n\t\t\tauthority = _empty;\r\n\t\t}\r\n\t\tif (path === undefined) {\r\n\t\t\tpath = this.path;\r\n\t\t} else if (path === null) {\r\n\t\t\tpath = _empty;\r\n\t\t}\r\n\t\tif (query === undefined) {\r\n\t\t\tquery = this.query;\r\n\t\t} else if (query === null) {\r\n\t\t\tquery = _empty;\r\n\t\t}\r\n\t\tif (fragment === undefined) {\r\n\t\t\tfragment = this.fragment;\r\n\t\t} else if (fragment === null) {\r\n\t\t\tfragment = _empty;\r\n\t\t}\r\n\r\n\t\tif (scheme === this.scheme\r\n\t\t\t&& authority === this.authority\r\n\t\t\t&& path === this.path\r\n\t\t\t&& query === this.query\r\n\t\t\t&& fragment === this.fragment) {\r\n\r\n\t\t\treturn this;\r\n\t\t}\r\n\r\n\t\treturn new Uri(scheme, authority, path, query, fragment);\r\n\t}\r\n\r\n\t// ---- parse & validate ------------------------\r\n\r\n\t/**\r\n\t * Creates a new URI from a string, e.g. `http://www.msft.com/some/path`,\r\n\t * `file:///usr/home`, or `scheme:with/path`.\r\n\t *\r\n\t * @param value A string which represents an URI (see `URI#toString`).\r\n\t */\r\n\tstatic parse(value: string, _strict: boolean = false): URI {\r\n\t\tconst match = _regexp.exec(value);\r\n\t\tif (!match) {\r\n\t\t\treturn new Uri(_empty, _empty, _empty, _empty, _empty);\r\n\t\t}\r\n\t\treturn new Uri(\r\n\t\t\tmatch[2] || _empty,\r\n\t\t\tpercentDecode(match[4] || _empty),\r\n\t\t\tpercentDecode(match[5] || _empty),\r\n\t\t\tpercentDecode(match[7] || _empty),\r\n\t\t\tpercentDecode(match[9] || _empty),\r\n\t\t\t_strict\r\n\t\t);\r\n\t}\r\n\r\n\t/**\r\n\t * Creates a new URI from a file system path, e.g. `c:\\my\\files`,\r\n\t * `/usr/home`, or `\\\\server\\share\\some\\path`.\r\n\t *\r\n\t * The *difference* between `URI#parse` and `URI#file` is that the latter treats the argument\r\n\t * as path, not as stringified-uri. E.g. `URI.file(path)` is **not the same as**\r\n\t * `URI.parse('file://' + path)` because the path might contain characters that are\r\n\t * interpreted (# and ?). See the following sample:\r\n\t * ```ts\r\n\tconst good = URI.file('/coding/c#/project1');\r\n\tgood.scheme === 'file';\r\n\tgood.path === '/coding/c#/project1';\r\n\tgood.fragment === '';\r\n\tconst bad = URI.parse('file://' + '/coding/c#/project1');\r\n\tbad.scheme === 'file';\r\n\tbad.path === '/coding/c'; // path is now broken\r\n\tbad.fragment === '/project1';\r\n\t```\r\n\t *\r\n\t * @param path A file system path (see `URI#fsPath`)\r\n\t */\r\n\tstatic file(path: string): URI {\r\n\r\n\t\tlet authority = _empty;\r\n\r\n\t\t// normalize to fwd-slashes on windows,\r\n\t\t// on other systems bwd-slashes are valid\r\n\t\t// filename character, eg /f\\oo/ba\\r.txt\r\n\t\tif (isWindows) {\r\n\t\t\tpath = path.replace(/\\\\/g, _slash);\r\n\t\t}\r\n\r\n\t\t// check for authority as used in UNC shares\r\n\t\t// or use the path as given\r\n\t\tif (path[0] === _slash && path[1] === _slash) {\r\n\t\t\tconst idx = path.indexOf(_slash, 2);\r\n\t\t\tif (idx === -1) {\r\n\t\t\t\tauthority = path.substring(2);\r\n\t\t\t\tpath = _slash;\r\n\t\t\t} else {\r\n\t\t\t\tauthority = path.substring(2, idx);\r\n\t\t\t\tpath = path.substring(idx) || _slash;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\treturn new Uri('file', authority, path, _empty, _empty);\r\n\t}\r\n\r\n\tstatic from(components: { scheme: string; authority?: string; path?: string; query?: string; fragment?: string }): URI {\r\n\t\treturn new Uri(\r\n\t\t\tcomponents.scheme,\r\n\t\t\tcomponents.authority,\r\n\t\t\tcomponents.path,\r\n\t\t\tcomponents.query,\r\n\t\t\tcomponents.fragment,\r\n\t\t);\r\n\t}\r\n\r\n\t/**\r\n\t * Join a URI path with path fragments and normalizes the resulting path.\r\n\t *\r\n\t * @param uri The input URI.\r\n\t * @param pathFragment The path fragment to add to the URI path.\r\n\t * @returns The resulting URI.\r\n\t */\r\n\tstatic joinPath(uri: URI, ...pathFragment: string[]): URI {\r\n\t\tif (!uri.path) {\r\n\t\t\tthrow new Error(`[UriError]: cannot call joinPaths on URI without path`);\r\n\t\t}\r\n\t\tlet newPath: string;\r\n\t\tif (isWindows && uri.scheme === 'file') {\r\n\t\t\tnewPath = URI.file(paths.win32.join(uriToFsPath(uri, true), ...pathFragment)).path;\r\n\t\t} else {\r\n\t\t\tnewPath = paths.posix.join(uri.path, ...pathFragment);\r\n\t\t}\r\n\t\treturn uri.with({ path: newPath });\r\n\t}\r\n\r\n\t// ---- printing/externalize ---------------------------\r\n\r\n\t/**\r\n\t * Creates a string representation for this URI. It's guaranteed that calling\r\n\t * `URI.parse` with the result of this function creates an URI which is equal\r\n\t * to this URI.\r\n\t *\r\n\t * * The result shall *not* be used for display purposes but for externalization or transport.\r\n\t * * The result will be encoded using the percentage encoding and encoding happens mostly\r\n\t * ignore the scheme-specific encoding rules.\r\n\t *\r\n\t * @param skipEncoding Do not encode the result, default is `false`\r\n\t */\r\n\ttoString(skipEncoding: boolean = false): string {\r\n\t\treturn _asFormatted(this, skipEncoding);\r\n\t}\r\n\r\n\ttoJSON(): UriComponents {\r\n\t\treturn this;\r\n\t}\r\n\r\n\tstatic revive(data: UriComponents | URI): URI;\r\n\tstatic revive(data: UriComponents | URI | undefined): URI | undefined;\r\n\tstatic revive(data: UriComponents | URI | null): URI | null;\r\n\tstatic revive(data: UriComponents | URI | undefined | null): URI | undefined | null;\r\n\tstatic revive(data: UriComponents | URI | undefined | null): URI | undefined | null {\r\n\t\tif (!data) {\r\n\t\t\treturn data;\r\n\t\t} else if (data instanceof URI) {\r\n\t\t\treturn data;\r\n\t\t} else {\r\n\t\t\tconst result = new Uri(data);\r\n\t\t\tresult._formatted = (<UriState>data).external;\r\n\t\t\tresult._fsPath = (<UriState>data)._sep === _pathSepMarker ? (<UriState>data).fsPath : null;\r\n\t\t\treturn result;\r\n\t\t}\r\n\t}\r\n}\r\n\r\nexport interface UriComponents {\r\n\tscheme: string;\r\n\tauthority: string;\r\n\tpath: string;\r\n\tquery: string;\r\n\tfragment: string;\r\n}\r\n\r\ninterface UriState extends UriComponents {\r\n\t$mid: number;\r\n\texternal: string;\r\n\tfsPath: string;\r\n\t_sep: 1 | undefined;\r\n}\r\n\r\nconst _pathSepMarker = isWindows ? 1 : undefined;\r\n\r\n// This class exists so that URI is compatibile with vscode.Uri (API).\r\nclass Uri extends URI {\r\n\r\n\t_formatted: string | null = null;\r\n\t_fsPath: string | null = null;\r\n\r\n\tget fsPath(): string {\r\n\t\tif (!this._fsPath) {\r\n\t\t\tthis._fsPath = uriToFsPath(this, false);\r\n\t\t}\r\n\t\treturn this._fsPath;\r\n\t}\r\n\r\n\ttoString(skipEncoding: boolean = false): string {\r\n\t\tif (!skipEncoding) {\r\n\t\t\tif (!this._formatted) {\r\n\t\t\t\tthis._formatted = _asFormatted(this, false);\r\n\t\t\t}\r\n\t\t\treturn this._formatted;\r\n\t\t} else {\r\n\t\t\t// we don't cache that\r\n\t\t\treturn _asFormatted(this, true);\r\n\t\t}\r\n\t}\r\n\r\n\ttoJSON(): UriComponents {\r\n\t\tconst res = <UriState>{\r\n\t\t\t$mid: 1\r\n\t\t};\r\n\t\t// cached state\r\n\t\tif (this._fsPath) {\r\n\t\t\tres.fsPath = this._fsPath;\r\n\t\t\tres._sep = _pathSepMarker;\r\n\t\t}\r\n\t\tif (this._formatted) {\r\n\t\t\tres.external = this._formatted;\r\n\t\t}\r\n\t\t// uri components\r\n\t\tif (this.path) {\r\n\t\t\tres.path = this.path;\r\n\t\t}\r\n\t\tif (this.scheme) {\r\n\t\t\tres.scheme = this.scheme;\r\n\t\t}\r\n\t\tif (this.authority) {\r\n\t\t\tres.authority = this.authority;\r\n\t\t}\r\n\t\tif (this.query) {\r\n\t\t\tres.query = this.query;\r\n\t\t}\r\n\t\tif (this.fragment) {\r\n\t\t\tres.fragment = this.fragment;\r\n\t\t}\r\n\t\treturn res;\r\n\t}\r\n}\r\n\r\n// reserved characters: https://tools.ietf.org/html/rfc3986#section-2.2\r\nconst encodeTable: { [ch: number]: string } = {\r\n\t[CharCode.Colon]: '%3A', // gen-delims\r\n\t[CharCode.Slash]: '%2F',\r\n\t[CharCode.QuestionMark]: '%3F',\r\n\t[CharCode.Hash]: '%23',\r\n\t[CharCode.OpenSquareBracket]: '%5B',\r\n\t[CharCode.CloseSquareBracket]: '%5D',\r\n\t[CharCode.AtSign]: '%40',\r\n\r\n\t[CharCode.ExclamationMark]: '%21', // sub-delims\r\n\t[CharCode.DollarSign]: '%24',\r\n\t[CharCode.Ampersand]: '%26',\r\n\t[CharCode.SingleQuote]: '%27',\r\n\t[CharCode.OpenParen]: '%28',\r\n\t[CharCode.CloseParen]: '%29',\r\n\t[CharCode.Asterisk]: '%2A',\r\n\t[CharCode.Plus]: '%2B',\r\n\t[CharCode.Comma]: '%2C',\r\n\t[CharCode.Semicolon]: '%3B',\r\n\t[CharCode.Equals]: '%3D',\r\n\r\n\t[CharCode.Space]: '%20',\r\n};\r\n\r\nfunction encodeURIComponentFast(uriComponent: string, allowSlash: boolean): string {\r\n\tlet res: string | undefined = undefined;\r\n\tlet nativeEncodePos = -1;\r\n\r\n\tfor (let pos = 0; pos < uriComponent.length; pos++) {\r\n\t\tconst code = uriComponent.charCodeAt(pos);\r\n\r\n\t\t// unreserved characters: https://tools.ietf.org/html/rfc3986#section-2.3\r\n\t\tif (\r\n\t\t\t(code >= CharCode.a && code <= CharCode.z)\r\n\t\t\t|| (code >= CharCode.A && code <= CharCode.Z)\r\n\t\t\t|| (code >= CharCode.Digit0 && code <= CharCode.Digit9)\r\n\t\t\t|| code === CharCode.Dash\r\n\t\t\t|| code === CharCode.Period\r\n\t\t\t|| code === CharCode.Underline\r\n\t\t\t|| code === CharCode.Tilde\r\n\t\t\t|| (allowSlash && code === CharCode.Slash)\r\n\t\t) {\r\n\t\t\t// check if we are delaying native encode\r\n\t\t\tif (nativeEncodePos !== -1) {\r\n\t\t\t\tres += encodeURIComponent(uriComponent.substring(nativeEncodePos, pos));\r\n\t\t\t\tnativeEncodePos = -1;\r\n\t\t\t}\r\n\t\t\t// check if we write into a new string (by default we try to return the param)\r\n\t\t\tif (res !== undefined) {\r\n\t\t\t\tres += uriComponent.charAt(pos);\r\n\t\t\t}\r\n\r\n\t\t} else {\r\n\t\t\t// encoding needed, we need to allocate a new string\r\n\t\t\tif (res === undefined) {\r\n\t\t\t\tres = uriComponent.substr(0, pos);\r\n\t\t\t}\r\n\r\n\t\t\t// check with default table first\r\n\t\t\tconst escaped = encodeTable[code];\r\n\t\t\tif (escaped !== undefined) {\r\n\r\n\t\t\t\t// check if we are delaying native encode\r\n\t\t\t\tif (nativeEncodePos !== -1) {\r\n\t\t\t\t\tres += encodeURIComponent(uriComponent.substring(nativeEncodePos, pos));\r\n\t\t\t\t\tnativeEncodePos = -1;\r\n\t\t\t\t}\r\n\r\n\t\t\t\t// append escaped variant to result\r\n\t\t\t\tres += escaped;\r\n\r\n\t\t\t} else if (nativeEncodePos === -1) {\r\n\t\t\t\t// use native encode only when needed\r\n\t\t\t\tnativeEncodePos = pos;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\tif (nativeEncodePos !== -1) {\r\n\t\tres += encodeURIComponent(uriComponent.substring(nativeEncodePos));\r\n\t}\r\n\r\n\treturn res !== undefined ? res : uriComponent;\r\n}\r\n\r\nfunction encodeURIComponentMinimal(path: string): string {\r\n\tlet res: string | undefined = undefined;\r\n\tfor (let pos = 0; pos < path.length; pos++) {\r\n\t\tconst code = path.charCodeAt(pos);\r\n\t\tif (code === CharCode.Hash || code === CharCode.QuestionMark) {\r\n\t\t\tif (res === undefined) {\r\n\t\t\t\tres = path.substr(0, pos);\r\n\t\t\t}\r\n\t\t\tres += encodeTable[code];\r\n\t\t} else {\r\n\t\t\tif (res !== undefined) {\r\n\t\t\t\tres += path[pos];\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\treturn res !== undefined ? res : path;\r\n}\r\n\r\n/**\r\n * Compute `fsPath` for the given uri\r\n */\r\nexport function uriToFsPath(uri: URI, keepDriveLetterCasing: boolean): string {\r\n\r\n\tlet value: string;\r\n\tif (uri.authority && uri.path.length > 1 && uri.scheme === 'file') {\r\n\t\t// unc path: file://shares/c$/far/boo\r\n\t\tvalue = `//${uri.authority}${uri.path}`;\r\n\t} else if (\r\n\t\turi.path.charCodeAt(0) === CharCode.Slash\r\n\t\t&& (uri.path.charCodeAt(1) >= CharCode.A && uri.path.charCodeAt(1) <= CharCode.Z || uri.path.charCodeAt(1) >= CharCode.a && uri.path.charCodeAt(1) <= CharCode.z)\r\n\t\t&& uri.path.charCodeAt(2) === CharCode.Colon\r\n\t) {\r\n\t\tif (!keepDriveLetterCasing) {\r\n\t\t\t// windows drive letter: file:///c:/far/boo\r\n\t\t\tvalue = uri.path[1].toLowerCase() + uri.path.substr(2);\r\n\t\t} else {\r\n\t\t\tvalue = uri.path.substr(1);\r\n\t\t}\r\n\t} else {\r\n\t\t// other path\r\n\t\tvalue = uri.path;\r\n\t}\r\n\tif (isWindows) {\r\n\t\tvalue = value.replace(/\\//g, '\\\\');\r\n\t}\r\n\treturn value;\r\n}\r\n\r\n/**\r\n * Create the external version of a uri\r\n */\r\nfunction _asFormatted(uri: URI, skipEncoding: boolean): string {\r\n\r\n\tconst encoder = !skipEncoding\r\n\t\t? encodeURIComponentFast\r\n\t\t: encodeURIComponentMinimal;\r\n\r\n\tlet res = '';\r\n\tlet { scheme, authority, path, query, fragment } = uri;\r\n\tif (scheme) {\r\n\t\tres += scheme;\r\n\t\tres += ':';\r\n\t}\r\n\tif (authority || scheme === 'file') {\r\n\t\tres += _slash;\r\n\t\tres += _slash;\r\n\t}\r\n\tif (authority) {\r\n\t\tlet idx = authority.indexOf('@');\r\n\t\tif (idx !== -1) {\r\n\t\t\t// <user>@<auth>\r\n\t\t\tconst userinfo = authority.substr(0, idx);\r\n\t\t\tauthority = authority.substr(idx + 1);\r\n\t\t\tidx = userinfo.indexOf(':');\r\n\t\t\tif (idx === -1) {\r\n\t\t\t\tres += encoder(userinfo, false);\r\n\t\t\t} else {\r\n\t\t\t\t// <user>:<pass>@<auth>\r\n\t\t\t\tres += encoder(userinfo.substr(0, idx), false);\r\n\t\t\t\tres += ':';\r\n\t\t\t\tres += encoder(userinfo.substr(idx + 1), false);\r\n\t\t\t}\r\n\t\t\tres += '@';\r\n\t\t}\r\n\t\tauthority = authority.toLowerCase();\r\n\t\tidx = authority.indexOf(':');\r\n\t\tif (idx === -1) {\r\n\t\t\tres += encoder(authority, false);\r\n\t\t} else {\r\n\t\t\t// <auth>:<port>\r\n\t\t\tres += encoder(authority.substr(0, idx), false);\r\n\t\t\tres += authority.substr(idx);\r\n\t\t}\r\n\t}\r\n\tif (path) {\r\n\t\t// lower-case windows drive letters in /C:/fff or C:/fff\r\n\t\tif (path.length >= 3 && path.charCodeAt(0) === CharCode.Slash && path.charCodeAt(2) === CharCode.Colon) {\r\n\t\t\tconst code = path.charCodeAt(1);\r\n\t\t\tif (code >= CharCode.A && code <= CharCode.Z) {\r\n\t\t\t\tpath = `/${String.fromCharCode(code + 32)}:${path.substr(3)}`; // \"/c:\".length === 3\r\n\t\t\t}\r\n\t\t} else if (path.length >= 2 && path.charCodeAt(1) === CharCode.Colon) {\r\n\t\t\tconst code = path.charCodeAt(0);\r\n\t\t\tif (code >= CharCode.A && code <= CharCode.Z) {\r\n\t\t\t\tpath = `${String.fromCharCode(code + 32)}:${path.substr(2)}`; // \"/c:\".length === 3\r\n\t\t\t}\r\n\t\t}\r\n\t\t// encode the rest of the path\r\n\t\tres += encoder(path, true);\r\n\t}\r\n\tif (query) {\r\n\t\tres += '?';\r\n\t\tres += encoder(query, false);\r\n\t}\r\n\tif (fragment) {\r\n\t\tres += '#';\r\n\t\tres += !skipEncoding ? encodeURIComponentFast(fragment, false) : fragment;\r\n\t}\r\n\treturn res;\r\n}\r\n\r\n// --- decode\r\n\r\nfunction decodeURIComponentGraceful(str: string): string {\r\n\ttry {\r\n\t\treturn decodeURIComponent(str);\r\n\t} catch {\r\n\t\tif (str.length > 3) {\r\n\t\t\treturn str.substr(0, 3) + decodeURIComponentGraceful(str.substr(3));\r\n\t\t} else {\r\n\t\t\treturn str;\r\n\t\t}\r\n\t}\r\n}\r\n\r\nconst _rEncodedAsHex = /(%[0-9A-Za-z][0-9A-Za-z])+/g;\r\n\r\nfunction percentDecode(str: string): string {\r\n\tif (!str.match(_rEncodedAsHex)) {\r\n\t\treturn str;\r\n\t}\r\n\treturn str.replace(_rEncodedAsHex, (match) => decodeURIComponentGraceful(match));\r\n}\r\n","/*---------------------------------------------------------------------------------------------\r\n * Copyright (c) Microsoft Corporation. All rights reserved.\r\n * Licensed under the MIT License. See License.txt in the project root for license information.\r\n *--------------------------------------------------------------------------------------------*/\r\n\r\nimport { transformErrorForSerialization } from 'vs/base/common/errors';\r\nimport { Disposable, IDisposable } from 'vs/base/common/lifecycle';\r\nimport { isWeb } from 'vs/base/common/platform';\r\nimport * as types from 'vs/base/common/types';\r\n\r\nconst INITIALIZE = '$initialize';\r\n\r\nexport interface IWorker extends IDisposable {\r\n\tgetId(): number;\r\n\tpostMessage(message: any, transfer: ArrayBuffer[]): void;\r\n}\r\n\r\nexport interface IWorkerCallback {\r\n\t(message: any): void;\r\n}\r\n\r\nexport interface IWorkerFactory {\r\n\tcreate(moduleId: string, callback: IWorkerCallback, onErrorCallback: (err: any) => void): IWorker;\r\n}\r\n\r\nlet webWorkerWarningLogged = false;\r\nexport function logOnceWebWorkerWarning(err: any): void {\r\n\tif (!isWeb) {\r\n\t\t// running tests\r\n\t\treturn;\r\n\t}\r\n\tif (!webWorkerWarningLogged) {\r\n\t\twebWorkerWarningLogged = true;\r\n\t\tconsole.warn('Could not create web worker(s). Falling back to loading web worker code in main thread, which might cause UI freezes. Please see https://github.com/Microsoft/monaco-editor#faq');\r\n\t}\r\n\tconsole.warn(err.message);\r\n}\r\n\r\ninterface IMessage {\r\n\tvsWorker: number;\r\n\treq?: string;\r\n\tseq?: string;\r\n}\r\n\r\ninterface IRequestMessage extends IMessage {\r\n\treq: string;\r\n\tmethod: string;\r\n\targs: any[];\r\n}\r\n\r\ninterface IReplyMessage extends IMessage {\r\n\tseq: string;\r\n\terr: any;\r\n\tres: any;\r\n}\r\n\r\ninterface IMessageReply {\r\n\tresolve: (value?: any) => void;\r\n\treject: (error?: any) => void;\r\n}\r\n\r\ninterface IMessageHandler {\r\n\tsendMessage(msg: any, transfer?: ArrayBuffer[]): void;\r\n\thandleMessage(method: string, args: any[]): Promise<any>;\r\n}\r\n\r\nclass SimpleWorkerProtocol {\r\n\r\n\tprivate _workerId: number;\r\n\tprivate _lastSentReq: number;\r\n\tprivate _pendingReplies: { [req: string]: IMessageReply; };\r\n\tprivate _handler: IMessageHandler;\r\n\r\n\tconstructor(handler: IMessageHandler) {\r\n\t\tthis._workerId = -1;\r\n\t\tthis._handler = handler;\r\n\t\tthis._lastSentReq = 0;\r\n\t\tthis._pendingReplies = Object.create(null);\r\n\t}\r\n\r\n\tpublic setWorkerId(workerId: number): void {\r\n\t\tthis._workerId = workerId;\r\n\t}\r\n\r\n\tpublic sendMessage(method: string, args: any[]): Promise<any> {\r\n\t\tlet req = String(++this._lastSentReq);\r\n\t\treturn new Promise<any>((resolve, reject) => {\r\n\t\t\tthis._pendingReplies[req] = {\r\n\t\t\t\tresolve: resolve,\r\n\t\t\t\treject: reject\r\n\t\t\t};\r\n\t\t\tthis._send({\r\n\t\t\t\tvsWorker: this._workerId,\r\n\t\t\t\treq: req,\r\n\t\t\t\tmethod: method,\r\n\t\t\t\targs: args\r\n\t\t\t});\r\n\t\t});\r\n\t}\r\n\r\n\tpublic handleMessage(message: IMessage): void {\r\n\t\tif (!message || !message.vsWorker) {\r\n\t\t\treturn;\r\n\t\t}\r\n\t\tif (this._workerId !== -1 && message.vsWorker !== this._workerId) {\r\n\t\t\treturn;\r\n\t\t}\r\n\t\tthis._handleMessage(message);\r\n\t}\r\n\r\n\tprivate _handleMessage(msg: IMessage): void {\r\n\t\tif (msg.seq) {\r\n\t\t\tlet replyMessage = <IReplyMessage>msg;\r\n\t\t\tif (!this._pendingReplies[replyMessage.seq]) {\r\n\t\t\t\tconsole.warn('Got reply to unknown seq');\r\n\t\t\t\treturn;\r\n\t\t\t}\r\n\r\n\t\t\tlet reply = this._pendingReplies[replyMessage.seq];\r\n\t\t\tdelete this._pendingReplies[replyMessage.seq];\r\n\r\n\t\t\tif (replyMessage.err) {\r\n\t\t\t\tlet err = replyMessage.err;\r\n\t\t\t\tif (replyMessage.err.$isError) {\r\n\t\t\t\t\terr = new Error();\r\n\t\t\t\t\terr.name = replyMessage.err.name;\r\n\t\t\t\t\terr.message = replyMessage.err.message;\r\n\t\t\t\t\terr.stack = replyMessage.err.stack;\r\n\t\t\t\t}\r\n\t\t\t\treply.reject(err);\r\n\t\t\t\treturn;\r\n\t\t\t}\r\n\r\n\t\t\treply.resolve(replyMessage.res);\r\n\t\t\treturn;\r\n\t\t}\r\n\r\n\t\tlet requestMessage = <IRequestMessage>msg;\r\n\t\tlet req = requestMessage.req;\r\n\t\tlet result = this._handler.handleMessage(requestMessage.method, requestMessage.args);\r\n\t\tresult.then((r) => {\r\n\t\t\tthis._send({\r\n\t\t\t\tvsWorker: this._workerId,\r\n\t\t\t\tseq: req,\r\n\t\t\t\tres: r,\r\n\t\t\t\terr: undefined\r\n\t\t\t});\r\n\t\t}, (e) => {\r\n\t\t\tif (e.detail instanceof Error) {\r\n\t\t\t\t// Loading errors have a detail property that points to the actual error\r\n\t\t\t\te.detail = transformErrorForSerialization(e.detail);\r\n\t\t\t}\r\n\t\t\tthis._send({\r\n\t\t\t\tvsWorker: this._workerId,\r\n\t\t\t\tseq: req,\r\n\t\t\t\tres: undefined,\r\n\t\t\t\terr: transformErrorForSerialization(e)\r\n\t\t\t});\r\n\t\t});\r\n\t}\r\n\r\n\tprivate _send(msg: IRequestMessage | IReplyMessage): void {\r\n\t\tlet transfer: ArrayBuffer[] = [];\r\n\t\tif (msg.req) {\r\n\t\t\tconst m = <IRequestMessage>msg;\r\n\t\t\tfor (let i = 0; i < m.args.length; i++) {\r\n\t\t\t\tif (m.args[i] instanceof ArrayBuffer) {\r\n\t\t\t\t\ttransfer.push(m.args[i]);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t} else {\r\n\t\t\tconst m = <IReplyMessage>msg;\r\n\t\t\tif (m.res instanceof ArrayBuffer) {\r\n\t\t\t\ttransfer.push(m.res);\r\n\t\t\t}\r\n\t\t}\r\n\t\tthis._handler.sendMessage(msg, transfer);\r\n\t}\r\n}\r\n\r\nexport interface IWorkerClient<W> {\r\n\tgetProxyObject(): Promise<W>;\r\n\tdispose(): void;\r\n}\r\n\r\n/**\r\n * Main thread side\r\n */\r\nexport class SimpleWorkerClient<W extends object, H extends object> extends Disposable implements IWorkerClient<W> {\r\n\r\n\tprivate readonly _worker: IWorker;\r\n\tprivate readonly _onModuleLoaded: Promise<string[]>;\r\n\tprivate readonly _protocol: SimpleWorkerProtocol;\r\n\tprivate readonly _lazyProxy: Promise<W>;\r\n\r\n\tconstructor(workerFactory: IWorkerFactory, moduleId: string, host: H) {\r\n\t\tsuper();\r\n\r\n\t\tlet lazyProxyReject: ((err: any) => void) | null = null;\r\n\r\n\t\tthis._worker = this._register(workerFactory.create(\r\n\t\t\t'vs/base/common/worker/simpleWorker',\r\n\t\t\t(msg: any) => {\r\n\t\t\t\tthis._protocol.handleMessage(msg);\r\n\t\t\t},\r\n\t\t\t(err: any) => {\r\n\t\t\t\t// in Firefox, web workers fail lazily :(\r\n\t\t\t\t// we will reject the proxy\r\n\t\t\t\tif (lazyProxyReject) {\r\n\t\t\t\t\tlazyProxyReject(err);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t));\r\n\r\n\t\tthis._protocol = new SimpleWorkerProtocol({\r\n\t\t\tsendMessage: (msg: any, transfer: ArrayBuffer[]): void => {\r\n\t\t\t\tthis._worker.postMessage(msg, transfer);\r\n\t\t\t},\r\n\t\t\thandleMessage: (method: string, args: any[]): Promise<any> => {\r\n\t\t\t\tif (typeof (host as any)[method] !== 'function') {\r\n\t\t\t\t\treturn Promise.reject(new Error('Missing method ' + method + ' on main thread host.'));\r\n\t\t\t\t}\r\n\r\n\t\t\t\ttry {\r\n\t\t\t\t\treturn Promise.resolve((host as any)[method].apply(host, args));\r\n\t\t\t\t} catch (e) {\r\n\t\t\t\t\treturn Promise.reject(e);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t});\r\n\t\tthis._protocol.setWorkerId(this._worker.getId());\r\n\r\n\t\t// Gather loader configuration\r\n\t\tlet loaderConfiguration: any = null;\r\n\t\tif (typeof (<any>self).require !== 'undefined' && typeof (<any>self).require.getConfig === 'function') {\r\n\t\t\t// Get the configuration from the Monaco AMD Loader\r\n\t\t\tloaderConfiguration = (<any>self).require.getConfig();\r\n\t\t} else if (typeof (<any>self).requirejs !== 'undefined') {\r\n\t\t\t// Get the configuration from requirejs\r\n\t\t\tloaderConfiguration = (<any>self).requirejs.s.contexts._.config;\r\n\t\t}\r\n\r\n\t\tconst hostMethods = types.getAllMethodNames(host);\r\n\r\n\t\t// Send initialize message\r\n\t\tthis._onModuleLoaded = this._protocol.sendMessage(INITIALIZE, [\r\n\t\t\tthis._worker.getId(),\r\n\t\t\tJSON.parse(JSON.stringify(loaderConfiguration)),\r\n\t\t\tmoduleId,\r\n\t\t\thostMethods,\r\n\t\t]);\r\n\r\n\t\t// Create proxy to loaded code\r\n\t\tconst proxyMethodRequest = (method: string, args: any[]): Promise<any> => {\r\n\t\t\treturn this._request(method, args);\r\n\t\t};\r\n\r\n\t\tthis._lazyProxy = new Promise<W>((resolve, reject) => {\r\n\t\t\tlazyProxyReject = reject;\r\n\t\t\tthis._onModuleLoaded.then((availableMethods: string[]) => {\r\n\t\t\t\tresolve(types.createProxyObject<W>(availableMethods, proxyMethodRequest));\r\n\t\t\t}, (e) => {\r\n\t\t\t\treject(e);\r\n\t\t\t\tthis._onError('Worker failed to load ' + moduleId, e);\r\n\t\t\t});\r\n\t\t});\r\n\t}\r\n\r\n\tpublic getProxyObject(): Promise<W> {\r\n\t\treturn this._lazyProxy;\r\n\t}\r\n\r\n\tprivate _request(method: string, args: any[]): Promise<any> {\r\n\t\treturn new Promise<any>((resolve, reject) => {\r\n\t\t\tthis._onModuleLoaded.then(() => {\r\n\t\t\t\tthis._protocol.sendMessage(method, args).then(resolve, reject);\r\n\t\t\t}, reject);\r\n\t\t});\r\n\t}\r\n\r\n\tprivate _onError(message: string, error?: any): void {\r\n\t\tconsole.error(message);\r\n\t\tconsole.info(error);\r\n\t}\r\n}\r\n\r\nexport interface IRequestHandler {\r\n\t_requestHandlerBrand: any;\r\n\t[prop: string]: any;\r\n}\r\n\r\nexport interface IRequestHandlerFactory<H> {\r\n\t(host: H): IRequestHandler;\r\n}\r\n\r\n/**\r\n * Worker side\r\n */\r\nexport class SimpleWorkerServer<H extends object> {\r\n\r\n\tprivate _requestHandlerFactory: IRequestHandlerFactory<H> | null;\r\n\tprivate _requestHandler: IRequestHandler | null;\r\n\tprivate _protocol: SimpleWorkerProtocol;\r\n\r\n\tconstructor(postMessage: (msg: any, transfer?: ArrayBuffer[]) => void, requestHandlerFactory: IRequestHandlerFactory<H> | null) {\r\n\t\tthis._requestHandlerFactory = requestHandlerFactory;\r\n\t\tthis._requestHandler = null;\r\n\t\tthis._protocol = new SimpleWorkerProtocol({\r\n\t\t\tsendMessage: (msg: any, transfer: ArrayBuffer[]): void => {\r\n\t\t\t\tpostMessage(msg, transfer);\r\n\t\t\t},\r\n\t\t\thandleMessage: (method: string, args: any[]): Promise<any> => this._handleMessage(method, args)\r\n\t\t});\r\n\t}\r\n\r\n\tpublic onmessage(msg: any): void {\r\n\t\tthis._protocol.handleMessage(msg);\r\n\t}\r\n\r\n\tprivate _handleMessage(method: string, args: any[]): Promise<any> {\r\n\t\tif (method === INITIALIZE) {\r\n\t\t\treturn this.initialize(<number>args[0], <any>args[1], <string>args[2], <string[]>args[3]);\r\n\t\t}\r\n\r\n\t\tif (!this._requestHandler || typeof this._requestHandler[method] !== 'function') {\r\n\t\t\treturn Promise.reject(new Error('Missing requestHandler or method: ' + method));\r\n\t\t}\r\n\r\n\t\ttry {\r\n\t\t\treturn Promise.resolve(this._requestHandler[method].apply(this._requestHandler, args));\r\n\t\t} catch (e) {\r\n\t\t\treturn Promise.reject(e);\r\n\t\t}\r\n\t}\r\n\r\n\tprivate initialize(workerId: number, loaderConfig: any, moduleId: string, hostMethods: string[]): Promise<string[]> {\r\n\t\tthis._protocol.setWorkerId(workerId);\r\n\r\n\t\tconst proxyMethodRequest = (method: string, args: any[]): Promise<any> => {\r\n\t\t\treturn this._protocol.sendMessage(method, args);\r\n\t\t};\r\n\r\n\t\tconst hostProxy = types.createProxyObject<H>(hostMethods, proxyMethodRequest);\r\n\r\n\t\tif (this._requestHandlerFactory) {\r\n\t\t\t// static request handler\r\n\t\t\tthis._requestHandler = this._requestHandlerFactory(hostProxy);\r\n\t\t\treturn Promise.resolve(types.getAllMethodNames(this._requestHandler));\r\n\t\t}\r\n\r\n\t\tif (loaderConfig) {\r\n\t\t\t// Remove 'baseUrl', handling it is beyond scope for now\r\n\t\t\tif (typeof loaderConfig.baseUrl !== 'undefined') {\r\n\t\t\t\tdelete loaderConfig['baseUrl'];\r\n\t\t\t}\r\n\t\t\tif (typeof loaderConfig.paths !== 'undefined') {\r\n\t\t\t\tif (typeof loaderConfig.paths.vs !== 'undefined') {\r\n\t\t\t\t\tdelete loaderConfig.paths['vs'];\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\t// Since this is in a web worker, enable catching errors\r\n\t\t\tloaderConfig.catchError = true;\r\n\t\t\t(<any>self).require.config(loaderConfig);\r\n\t\t}\r\n\r\n\t\treturn new Promise<string[]>((resolve, reject) => {\r\n\t\t\t// Use the global require to be sure to get the global config\r\n\t\t\t(<any>self).require([moduleId], (module: { create: IRequestHandlerFactory<H> }) => {\r\n\t\t\t\tthis._requestHandler = module.create(hostProxy);\r\n\r\n\t\t\t\tif (!this._requestHandler) {\r\n\t\t\t\t\treject(new Error(`No RequestHandler!`));\r\n\t\t\t\t\treturn;\r\n\t\t\t\t}\r\n\r\n\t\t\t\tresolve(types.getAllMethodNames(this._requestHandler));\r\n\t\t\t}, reject);\r\n\t\t});\r\n\t}\r\n}\r\n\r\n/**\r\n * Called on the worker side\r\n */\r\nexport function create(postMessage: (msg: string) => void): SimpleWorkerServer<any> {\r\n\treturn new SimpleWorkerServer(postMessage, null);\r\n}\r\n","/*---------------------------------------------------------------------------------------------\r\n * Copyright (c) Microsoft Corporation. All rights reserved.\r\n * Licensed under the MIT License. See License.txt in the project root for license information.\r\n *--------------------------------------------------------------------------------------------*/\r\n\r\nimport { toUint8 } from 'vs/base/common/uint';\r\n\r\n/**\r\n * A fast character classifier that uses a compact array for ASCII values.\r\n */\r\nexport class CharacterClassifier<T extends number> {\r\n\t/**\r\n\t * Maintain a compact (fully initialized ASCII map for quickly classifying ASCII characters - used more often in code).\r\n\t */\r\n\tprotected _asciiMap: Uint8Array;\r\n\r\n\t/**\r\n\t * The entire map (sparse array).\r\n\t */\r\n\tprotected _map: Map<number, number>;\r\n\r\n\tprotected _defaultValue: number;\r\n\r\n\tconstructor(_defaultValue: T) {\r\n\t\tlet defaultValue = toUint8(_defaultValue);\r\n\r\n\t\tthis._defaultValue = defaultValue;\r\n\t\tthis._asciiMap = CharacterClassifier._createAsciiMap(defaultValue);\r\n\t\tthis._map = new Map<number, number>();\r\n\t}\r\n\r\n\tprivate static _createAsciiMap(defaultValue: number): Uint8Array {\r\n\t\tlet asciiMap: Uint8Array = new Uint8Array(256);\r\n\t\tfor (let i = 0; i < 256; i++) {\r\n\t\t\tasciiMap[i] = defaultValue;\r\n\t\t}\r\n\t\treturn asciiMap;\r\n\t}\r\n\r\n\tpublic set(charCode: number, _value: T): void {\r\n\t\tlet value = toUint8(_value);\r\n\r\n\t\tif (charCode >= 0 && charCode < 256) {\r\n\t\t\tthis._asciiMap[charCode] = value;\r\n\t\t} else {\r\n\t\t\tthis._map.set(charCode, value);\r\n\t\t}\r\n\t}\r\n\r\n\tpublic get(charCode: number): T {\r\n\t\tif (charCode >= 0 && charCode < 256) {\r\n\t\t\treturn <T>this._asciiMap[charCode];\r\n\t\t} else {\r\n\t\t\treturn <T>(this._map.get(charCode) || this._defaultValue);\r\n\t\t}\r\n\t}\r\n}\r\n\r\nconst enum Boolean {\r\n\tFalse = 0,\r\n\tTrue = 1\r\n}\r\n\r\nexport class CharacterSet {\r\n\r\n\tprivate readonly _actual: CharacterClassifier<Boolean>;\r\n\r\n\tconstructor() {\r\n\t\tthis._actual = new CharacterClassifier<Boolean>(Boolean.False);\r\n\t}\r\n\r\n\tpublic add(charCode: number): void {\r\n\t\tthis._actual.set(charCode, Boolean.True);\r\n\t}\r\n\r\n\tpublic has(charCode: number): boolean {\r\n\t\treturn (this._actual.get(charCode) === Boolean.True);\r\n\t}\r\n}\r\n","/*---------------------------------------------------------------------------------------------\r\n * Copyright (c) Microsoft Corporation. All rights reserved.\r\n * Licensed under the MIT License. See License.txt in the project root for license information.\r\n *--------------------------------------------------------------------------------------------*/\r\n\r\n/**\r\n * A position in the editor. This interface is suitable for serialization.\r\n */\r\nexport interface IPosition {\r\n\t/**\r\n\t * line number (starts at 1)\r\n\t */\r\n\treadonly lineNumber: number;\r\n\t/**\r\n\t * column (the first character in a line is between column 1 and column 2)\r\n\t */\r\n\treadonly column: number;\r\n}\r\n\r\n/**\r\n * A position in the editor.\r\n */\r\nexport class Position {\r\n\t/**\r\n\t * line number (starts at 1)\r\n\t */\r\n\tpublic readonly lineNumber: number;\r\n\t/**\r\n\t * column (the first character in a line is between column 1 and column 2)\r\n\t */\r\n\tpublic readonly column: number;\r\n\r\n\tconstructor(lineNumber: number, column: number) {\r\n\t\tthis.lineNumber = lineNumber;\r\n\t\tthis.column = column;\r\n\t}\r\n\r\n\t/**\r\n\t * Create a new position from this position.\r\n\t *\r\n\t * @param newLineNumber new line number\r\n\t * @param newColumn new column\r\n\t */\r\n\twith(newLineNumber: number = this.lineNumber, newColumn: number = this.column): Position {\r\n\t\tif (newLineNumber === this.lineNumber && newColumn === this.column) {\r\n\t\t\treturn this;\r\n\t\t} else {\r\n\t\t\treturn new Position(newLineNumber, newColumn);\r\n\t\t}\r\n\t}\r\n\r\n\t/**\r\n\t * Derive a new position from this position.\r\n\t *\r\n\t * @param deltaLineNumber line number delta\r\n\t * @param deltaColumn column delta\r\n\t */\r\n\tdelta(deltaLineNumber: number = 0, deltaColumn: number = 0): Position {\r\n\t\treturn this.with(this.lineNumber + deltaLineNumber, this.column + deltaColumn);\r\n\t}\r\n\r\n\t/**\r\n\t * Test if this position equals other position\r\n\t */\r\n\tpublic equals(other: IPosition): boolean {\r\n\t\treturn Position.equals(this, other);\r\n\t}\r\n\r\n\t/**\r\n\t * Test if position `a` equals position `b`\r\n\t */\r\n\tpublic static equals(a: IPosition | null, b: IPosition | null): boolean {\r\n\t\tif (!a && !b) {\r\n\t\t\treturn true;\r\n\t\t}\r\n\t\treturn (\r\n\t\t\t!!a &&\r\n\t\t\t!!b &&\r\n\t\t\ta.lineNumber === b.lineNumber &&\r\n\t\t\ta.column === b.column\r\n\t\t);\r\n\t}\r\n\r\n\t/**\r\n\t * Test if this position is before other position.\r\n\t * If the two positions are equal, the result will be false.\r\n\t */\r\n\tpublic isBefore(other: IPosition): boolean {\r\n\t\treturn Position.isBefore(this, other);\r\n\t}\r\n\r\n\t/**\r\n\t * Test if position `a` is before position `b`.\r\n\t * If the two positions are equal, the result will be false.\r\n\t */\r\n\tpublic static isBefore(a: IPosition, b: IPosition): boolean {\r\n\t\tif (a.lineNumber < b.lineNumber) {\r\n\t\t\treturn true;\r\n\t\t}\r\n\t\tif (b.lineNumber < a.lineNumber) {\r\n\t\t\treturn false;\r\n\t\t}\r\n\t\treturn a.column < b.column;\r\n\t}\r\n\r\n\t/**\r\n\t * Test if this position is before other position.\r\n\t * If the two positions are equal, the result will be true.\r\n\t */\r\n\tpublic isBeforeOrEqual(other: IPosition): boolean {\r\n\t\treturn Position.isBeforeOrEqual(this, other);\r\n\t}\r\n\r\n\t/**\r\n\t * Test if position `a` is before position `b`.\r\n\t * If the two positions are equal, the result will be true.\r\n\t */\r\n\tpublic static isBeforeOrEqual(a: IPosition, b: IPosition): boolean {\r\n\t\tif (a.lineNumber < b.lineNumber) {\r\n\t\t\treturn true;\r\n\t\t}\r\n\t\tif (b.lineNumber < a.lineNumber) {\r\n\t\t\treturn false;\r\n\t\t}\r\n\t\treturn a.column <= b.column;\r\n\t}\r\n\r\n\t/**\r\n\t * A function that compares positions, useful for sorting\r\n\t */\r\n\tpublic static compare(a: IPosition, b: IPosition): number {\r\n\t\tlet aLineNumber = a.lineNumber | 0;\r\n\t\tlet bLineNumber = b.lineNumber | 0;\r\n\r\n\t\tif (aLineNumber === bLineNumber) {\r\n\t\t\tlet aColumn = a.column | 0;\r\n\t\t\tlet bColumn = b.column | 0;\r\n\t\t\treturn aColumn - bColumn;\r\n\t\t}\r\n\r\n\t\treturn aLineNumber - bLineNumber;\r\n\t}\r\n\r\n\t/**\r\n\t * Clone this position.\r\n\t */\r\n\tpublic clone(): Position {\r\n\t\treturn new Position(this.lineNumber, this.column);\r\n\t}\r\n\r\n\t/**\r\n\t * Convert to a human-readable representation.\r\n\t */\r\n\tpublic toString(): string {\r\n\t\treturn '(' + this.lineNumber + ',' + this.column + ')';\r\n\t}\r\n\r\n\t// ---\r\n\r\n\t/**\r\n\t * Create a `Position` from an `IPosition`.\r\n\t */\r\n\tpublic static lift(pos: IPosition): Position {\r\n\t\treturn new Position(pos.lineNumber, pos.column);\r\n\t}\r\n\r\n\t/**\r\n\t * Test if `obj` is an `IPosition`.\r\n\t */\r\n\tpublic static isIPosition(obj: any): obj is IPosition {\r\n\t\treturn (\r\n\t\t\tobj\r\n\t\t\t&& (typeof obj.lineNumber === 'number')\r\n\t\t\t&& (typeof obj.column === 'number')\r\n\t\t);\r\n\t}\r\n}\r\n","/*---------------------------------------------------------------------------------------------\r\n * Copyright (c) Microsoft Corporation. All rights reserved.\r\n * Licensed under the MIT License. See License.txt in the project root for license information.\r\n *--------------------------------------------------------------------------------------------*/\r\n\r\nimport { IPosition, Position } from 'vs/editor/common/core/position';\r\n\r\n/**\r\n * A range in the editor. This interface is suitable for serialization.\r\n */\r\nexport interface IRange {\r\n\t/**\r\n\t * Line number on which the range starts (starts at 1).\r\n\t */\r\n\treadonly startLineNumber: number;\r\n\t/**\r\n\t * Column on which the range starts in line `startLineNumber` (starts at 1).\r\n\t */\r\n\treadonly startColumn: number;\r\n\t/**\r\n\t * Line number on which the range ends.\r\n\t */\r\n\treadonly endLineNumber: number;\r\n\t/**\r\n\t * Column on which the range ends in line `endLineNumber`.\r\n\t */\r\n\treadonly endColumn: number;\r\n}\r\n\r\n/**\r\n * A range in the editor. (startLineNumber,startColumn) is <= (endLineNumber,endColumn)\r\n */\r\nexport class Range {\r\n\r\n\t/**\r\n\t * Line number on which the range starts (starts at 1).\r\n\t */\r\n\tpublic readonly startLineNumber: number;\r\n\t/**\r\n\t * Column on which the range starts in line `startLineNumber` (starts at 1).\r\n\t */\r\n\tpublic readonly startColumn: number;\r\n\t/**\r\n\t * Line number on which the range ends.\r\n\t */\r\n\tpublic readonly endLineNumber: number;\r\n\t/**\r\n\t * Column on which the range ends in line `endLineNumber`.\r\n\t */\r\n\tpublic readonly endColumn: number;\r\n\r\n\tconstructor(startLineNumber: number, startColumn: number, endLineNumber: number, endColumn: number) {\r\n\t\tif ((startLineNumber > endLineNumber) || (startLineNumber === endLineNumber && startColumn > endColumn)) {\r\n\t\t\tthis.startLineNumber = endLineNumber;\r\n\t\t\tthis.startColumn = endColumn;\r\n\t\t\tthis.endLineNumber = startLineNumber;\r\n\t\t\tthis.endColumn = startColumn;\r\n\t\t} else {\r\n\t\t\tthis.startLineNumber = startLineNumber;\r\n\t\t\tthis.startColumn = startColumn;\r\n\t\t\tthis.endLineNumber = endLineNumber;\r\n\t\t\tthis.endColumn = endColumn;\r\n\t\t}\r\n\t}\r\n\r\n\t/**\r\n\t * Test if this range is empty.\r\n\t */\r\n\tpublic isEmpty(): boolean {\r\n\t\treturn Range.isEmpty(this);\r\n\t}\r\n\r\n\t/**\r\n\t * Test if `range` is empty.\r\n\t */\r\n\tpublic static isEmpty(range: IRange): boolean {\r\n\t\treturn (range.startLineNumber === range.endLineNumber && range.startColumn === range.endColumn);\r\n\t}\r\n\r\n\t/**\r\n\t * Test if position is in this range. If the position is at the edges, will return true.\r\n\t */\r\n\tpublic containsPosition(position: IPosition): boolean {\r\n\t\treturn Range.containsPosition(this, position);\r\n\t}\r\n\r\n\t/**\r\n\t * Test if `position` is in `range`. If the position is at the edges, will return true.\r\n\t */\r\n\tpublic static containsPosition(range: IRange, position: IPosition): boolean {\r\n\t\tif (position.lineNumber < range.startLineNumber || position.lineNumber > range.endLineNumber) {\r\n\t\t\treturn false;\r\n\t\t}\r\n\t\tif (position.lineNumber === range.startLineNumber && position.column < range.startColumn) {\r\n\t\t\treturn false;\r\n\t\t}\r\n\t\tif (position.lineNumber === range.endLineNumber && position.column > range.endColumn) {\r\n\t\t\treturn false;\r\n\t\t}\r\n\t\treturn true;\r\n\t}\r\n\r\n\t/**\r\n\t * Test if range is in this range. If the range is equal to this range, will return true.\r\n\t */\r\n\tpublic containsRange(range: IRange): boolean {\r\n\t\treturn Range.containsRange(this, range);\r\n\t}\r\n\r\n\t/**\r\n\t * Test if `otherRange` is in `range`. If the ranges are equal, will return true.\r\n\t */\r\n\tpublic static containsRange(range: IRange, otherRange: IRange): boolean {\r\n\t\tif (otherRange.startLineNumber < range.startLineNumber || otherRange.endLineNumber < range.startLineNumber) {\r\n\t\t\treturn false;\r\n\t\t}\r\n\t\tif (otherRange.startLineNumber > range.endLineNumber || otherRange.endLineNumber > range.endLineNumber) {\r\n\t\t\treturn false;\r\n\t\t}\r\n\t\tif (otherRange.startLineNumber === range.startLineNumber && otherRange.startColumn < range.startColumn) {\r\n\t\t\treturn false;\r\n\t\t}\r\n\t\tif (otherRange.endLineNumber === range.endLineNumber && otherRange.endColumn > range.endColumn) {\r\n\t\t\treturn false;\r\n\t\t}\r\n\t\treturn true;\r\n\t}\r\n\r\n\t/**\r\n\t * Test if `range` is strictly in this range. `range` must start after and end before this range for the result to be true.\r\n\t */\r\n\tpublic strictContainsRange(range: IRange): boolean {\r\n\t\treturn Range.strictContainsRange(this, range);\r\n\t}\r\n\r\n\t/**\r\n\t * Test if `otherRange` is strinctly in `range` (must start after, and end before). If the ranges are equal, will return false.\r\n\t */\r\n\tpublic static strictContainsRange(range: IRange, otherRange: IRange): boolean {\r\n\t\tif (otherRange.startLineNumber < range.startLineNumber || otherRange.endLineNumber < range.startLineNumber) {\r\n\t\t\treturn false;\r\n\t\t}\r\n\t\tif (otherRange.startLineNumber > range.endLineNumber || otherRange.endLineNumber > range.endLineNumber) {\r\n\t\t\treturn false;\r\n\t\t}\r\n\t\tif (otherRange.startLineNumber === range.startLineNumber && otherRange.startColumn <= range.startColumn) {\r\n\t\t\treturn false;\r\n\t\t}\r\n\t\tif (otherRange.endLineNumber === range.endLineNumber && otherRange.endColumn >= range.endColumn) {\r\n\t\t\treturn false;\r\n\t\t}\r\n\t\treturn true;\r\n\t}\r\n\r\n\t/**\r\n\t * A reunion of the two ranges.\r\n\t * The smallest position will be used as the start point, and the largest one as the end point.\r\n\t */\r\n\tpublic plusRange(range: IRange): Range {\r\n\t\treturn Range.plusRange(this, range);\r\n\t}\r\n\r\n\t/**\r\n\t * A reunion of the two ranges.\r\n\t * The smallest position will be used as the start point, and the largest one as the end point.\r\n\t */\r\n\tpublic static plusRange(a: IRange, b: IRange): Range {\r\n\t\tlet startLineNumber: number;\r\n\t\tlet startColumn: number;\r\n\t\tlet endLineNumber: number;\r\n\t\tlet endColumn: number;\r\n\r\n\t\tif (b.startLineNumber < a.startLineNumber) {\r\n\t\t\tstartLineNumber = b.startLineNumber;\r\n\t\t\tstartColumn = b.startColumn;\r\n\t\t} else if (b.startLineNumber === a.startLineNumber) {\r\n\t\t\tstartLineNumber = b.startLineNumber;\r\n\t\t\tstartColumn = Math.min(b.startColumn, a.startColumn);\r\n\t\t} else {\r\n\t\t\tstartLineNumber = a.startLineNumber;\r\n\t\t\tstartColumn = a.startColumn;\r\n\t\t}\r\n\r\n\t\tif (b.endLineNumber > a.endLineNumber) {\r\n\t\t\tendLineNumber = b.endLineNumber;\r\n\t\t\tendColumn = b.endColumn;\r\n\t\t} else if (b.endLineNumber === a.endLineNumber) {\r\n\t\t\tendLineNumber = b.endLineNumber;\r\n\t\t\tendColumn = Math.max(b.endColumn, a.endColumn);\r\n\t\t} else {\r\n\t\t\tendLineNumber = a.endLineNumber;\r\n\t\t\tendColumn = a.endColumn;\r\n\t\t}\r\n\r\n\t\treturn new Range(startLineNumber, startColumn, endLineNumber, endColumn);\r\n\t}\r\n\r\n\t/**\r\n\t * A intersection of the two ranges.\r\n\t */\r\n\tpublic intersectRanges(range: IRange): Range | null {\r\n\t\treturn Range.intersectRanges(this, range);\r\n\t}\r\n\r\n\t/**\r\n\t * A intersection of the two ranges.\r\n\t */\r\n\tpublic static intersectRanges(a: IRange, b: IRange): Range | null {\r\n\t\tlet resultStartLineNumber = a.startLineNumber;\r\n\t\tlet resultStartColumn = a.startColumn;\r\n\t\tlet resultEndLineNumber = a.endLineNumber;\r\n\t\tlet resultEndColumn = a.endColumn;\r\n\t\tlet otherStartLineNumber = b.startLineNumber;\r\n\t\tlet otherStartColumn = b.startColumn;\r\n\t\tlet otherEndLineNumber = b.endLineNumber;\r\n\t\tlet otherEndColumn = b.endColumn;\r\n\r\n\t\tif (resultStartLineNumber < otherStartLineNumber) {\r\n\t\t\tresultStartLineNumber = otherStartLineNumber;\r\n\t\t\tresultStartColumn = otherStartColumn;\r\n\t\t} else if (resultStartLineNumber === otherStartLineNumber) {\r\n\t\t\tresultStartColumn = Math.max(resultStartColumn, otherStartColumn);\r\n\t\t}\r\n\r\n\t\tif (resultEndLineNumber > otherEndLineNumber) {\r\n\t\t\tresultEndLineNumber = otherEndLineNumber;\r\n\t\t\tresultEndColumn = otherEndColumn;\r\n\t\t} else if (resultEndLineNumber === otherEndLineNumber) {\r\n\t\t\tresultEndColumn = Math.min(resultEndColumn, otherEndColumn);\r\n\t\t}\r\n\r\n\t\t// Check if selection is now empty\r\n\t\tif (resultStartLineNumber > resultEndLineNumber) {\r\n\t\t\treturn null;\r\n\t\t}\r\n\t\tif (resultStartLineNumber === resultEndLineNumber && resultStartColumn > resultEndColumn) {\r\n\t\t\treturn null;\r\n\t\t}\r\n\t\treturn new Range(resultStartLineNumber, resultStartColumn, resultEndLineNumber, resultEndColumn);\r\n\t}\r\n\r\n\t/**\r\n\t * Test if this range equals other.\r\n\t */\r\n\tpublic equalsRange(other: IRange | null): boolean {\r\n\t\treturn Range.equalsRange(this, other);\r\n\t}\r\n\r\n\t/**\r\n\t * Test if range `a` equals `b`.\r\n\t */\r\n\tpublic static equalsRange(a: IRange | null, b: IRange | null): boolean {\r\n\t\treturn (\r\n\t\t\t!!a &&\r\n\t\t\t!!b &&\r\n\t\t\ta.startLineNumber === b.startLineNumber &&\r\n\t\t\ta.startColumn === b.startColumn &&\r\n\t\t\ta.endLineNumber === b.endLineNumber &&\r\n\t\t\ta.endColumn === b.endColumn\r\n\t\t);\r\n\t}\r\n\r\n\t/**\r\n\t * Return the end position (which will be after or equal to the start position)\r\n\t */\r\n\tpublic getEndPosition(): Position {\r\n\t\treturn Range.getEndPosition(this);\r\n\t}\r\n\r\n\t/**\r\n\t * Return the end position (which will be after or equal to the start position)\r\n\t */\r\n\tpublic static getEndPosition(range: IRange): Position {\r\n\t\treturn new Position(range.endLineNumber, range.endColumn);\r\n\t}\r\n\r\n\t/**\r\n\t * Return the start position (which will be before or equal to the end position)\r\n\t */\r\n\tpublic getStartPosition(): Position {\r\n\t\treturn Range.getStartPosition(this);\r\n\t}\r\n\r\n\t/**\r\n\t * Return the start position (which will be before or equal to the end position)\r\n\t */\r\n\tpublic static getStartPosition(range: IRange): Position {\r\n\t\treturn new Position(range.startLineNumber, range.startColumn);\r\n\t}\r\n\r\n\t/**\r\n\t * Transform to a user presentable string representation.\r\n\t */\r\n\tpublic toString(): string {\r\n\t\treturn '[' + this.startLineNumber + ',' + this.startColumn + ' -> ' + this.endLineNumber + ',' + this.endColumn + ']';\r\n\t}\r\n\r\n\t/**\r\n\t * Create a new range using this range's start position, and using endLineNumber and endColumn as the end position.\r\n\t */\r\n\tpublic setEndPosition(endLineNumber: number, endColumn: number): Range {\r\n\t\treturn new Range(this.startLineNumber, this.startColumn, endLineNumber, endColumn);\r\n\t}\r\n\r\n\t/**\r\n\t * Create a new range using this range's end position, and using startLineNumber and startColumn as the start position.\r\n\t */\r\n\tpublic setStartPosition(startLineNumber: number, startColumn: number): Range {\r\n\t\treturn new Range(startLineNumber, startColumn, this.endLineNumber, this.endColumn);\r\n\t}\r\n\r\n\t/**\r\n\t * Create a new empty range using this range's start position.\r\n\t */\r\n\tpublic collapseToStart(): Range {\r\n\t\treturn Range.collapseToStart(this);\r\n\t}\r\n\r\n\t/**\r\n\t * Create a new empty range using this range's start position.\r\n\t */\r\n\tpublic static collapseToStart(range: IRange): Range {\r\n\t\treturn new Range(range.startLineNumber, range.startColumn, range.startLineNumber, range.startColumn);\r\n\t}\r\n\r\n\t// ---\r\n\r\n\tpublic static fromPositions(start: IPosition, end: IPosition = start): Range {\r\n\t\treturn new Range(start.lineNumber, start.column, end.lineNumber, end.column);\r\n\t}\r\n\r\n\t/**\r\n\t * Create a `Range` from an `IRange`.\r\n\t */\r\n\tpublic static lift(range: undefined | null): null;\r\n\tpublic static lift(range: IRange): Range;\r\n\tpublic static lift(range: IRange | undefined | null): Range | null {\r\n\t\tif (!range) {\r\n\t\t\treturn null;\r\n\t\t}\r\n\t\treturn new Range(range.startLineNumber, range.startColumn, range.endLineNumber, range.endColumn);\r\n\t}\r\n\r\n\t/**\r\n\t * Test if `obj` is an `IRange`.\r\n\t */\r\n\tpublic static isIRange(obj: any): obj is IRange {\r\n\t\treturn (\r\n\t\t\tobj\r\n\t\t\t&& (typeof obj.startLineNumber === 'number')\r\n\t\t\t&& (typeof obj.startColumn === 'number')\r\n\t\t\t&& (typeof obj.endLineNumber === 'number')\r\n\t\t\t&& (typeof obj.endColumn === 'number')\r\n\t\t);\r\n\t}\r\n\r\n\t/**\r\n\t * Test if the two ranges are touching in any way.\r\n\t */\r\n\tpublic static areIntersectingOrTouching(a: IRange, b: IRange): boolean {\r\n\t\t// Check if `a` is before `b`\r\n\t\tif (a.endLineNumber < b.startLineNumber || (a.endLineNumber === b.startLineNumber && a.endColumn < b.startColumn)) {\r\n\t\t\treturn false;\r\n\t\t}\r\n\r\n\t\t// Check if `b` is before `a`\r\n\t\tif (b.endLineNumber < a.startLineNumber || (b.endLineNumber === a.startLineNumber && b.endColumn < a.startColumn)) {\r\n\t\t\treturn false;\r\n\t\t}\r\n\r\n\t\t// These ranges must intersect\r\n\t\treturn true;\r\n\t}\r\n\r\n\t/**\r\n\t * Test if the two ranges are intersecting. If the ranges are touching it returns true.\r\n\t */\r\n\tpublic static areIntersecting(a: IRange, b: IRange): boolean {\r\n\t\t// Check if `a` is before `b`\r\n\t\tif (a.endLineNumber < b.startLineNumber || (a.endLineNumber === b.startLineNumber && a.endColumn <= b.startColumn)) {\r\n\t\t\treturn false;\r\n\t\t}\r\n\r\n\t\t// Check if `b` is before `a`\r\n\t\tif (b.endLineNumber < a.startLineNumber || (b.endLineNumber === a.startLineNumber && b.endColumn <= a.startColumn)) {\r\n\t\t\treturn false;\r\n\t\t}\r\n\r\n\t\t// These ranges must intersect\r\n\t\treturn true;\r\n\t}\r\n\r\n\t/**\r\n\t * A function that compares ranges, useful for sorting ranges\r\n\t * It will first compare ranges on the startPosition and then on the endPosition\r\n\t */\r\n\tpublic static compareRangesUsingStarts(a: IRange | null | undefined, b: IRange | null | undefined): number {\r\n\t\tif (a && b) {\r\n\t\t\tconst aStartLineNumber = a.startLineNumber | 0;\r\n\t\t\tconst bStartLineNumber = b.startLineNumber | 0;\r\n\r\n\t\t\tif (aStartLineNumber === bStartLineNumber) {\r\n\t\t\t\tconst aStartColumn = a.startColumn | 0;\r\n\t\t\t\tconst bStartColumn = b.startColumn | 0;\r\n\r\n\t\t\t\tif (aStartColumn === bStartColumn) {\r\n\t\t\t\t\tconst aEndLineNumber = a.endLineNumber | 0;\r\n\t\t\t\t\tconst bEndLineNumber = b.endLineNumber | 0;\r\n\r\n\t\t\t\t\tif (aEndLineNumber === bEndLineNumber) {\r\n\t\t\t\t\t\tconst aEndColumn = a.endColumn | 0;\r\n\t\t\t\t\t\tconst bEndColumn = b.endColumn | 0;\r\n\t\t\t\t\t\treturn aEndColumn - bEndColumn;\r\n\t\t\t\t\t}\r\n\t\t\t\t\treturn aEndLineNumber - bEndLineNumber;\r\n\t\t\t\t}\r\n\t\t\t\treturn aStartColumn - bStartColumn;\r\n\t\t\t}\r\n\t\t\treturn aStartLineNumber - bStartLineNumber;\r\n\t\t}\r\n\t\tconst aExists = (a ? 1 : 0);\r\n\t\tconst bExists = (b ? 1 : 0);\r\n\t\treturn aExists - bExists;\r\n\t}\r\n\r\n\t/**\r\n\t * A function that compares ranges, useful for sorting ranges\r\n\t * It will first compare ranges on the endPosition and then on the startPosition\r\n\t */\r\n\tpublic static compareRangesUsingEnds(a: IRange, b: IRange): number {\r\n\t\tif (a.endLineNumber === b.endLineNumber) {\r\n\t\t\tif (a.endColumn === b.endColumn) {\r\n\t\t\t\tif (a.startLineNumber === b.startLineNumber) {\r\n\t\t\t\t\treturn a.startColumn - b.startColumn;\r\n\t\t\t\t}\r\n\t\t\t\treturn a.startLineNumber - b.startLineNumber;\r\n\t\t\t}\r\n\t\t\treturn a.endColumn - b.endColumn;\r\n\t\t}\r\n\t\treturn a.endLineNumber - b.endLineNumber;\r\n\t}\r\n\r\n\t/**\r\n\t * Test if the range spans multiple lines.\r\n\t */\r\n\tpublic static spansMultipleLines(range: IRange): boolean {\r\n\t\treturn range.endLineNumber > range.startLineNumber;\r\n\t}\r\n}\r\n","/*---------------------------------------------------------------------------------------------\r\n * Copyright (c) Microsoft Corporation. All rights reserved.\r\n * Licensed under the MIT License. See License.txt in the project root for license information.\r\n *--------------------------------------------------------------------------------------------*/\r\n\r\nimport { IPosition, Position } from 'vs/editor/common/core/position';\r\nimport { Range } from 'vs/editor/common/core/range';\r\n\r\n/**\r\n * A selection in the editor.\r\n * The selection is a range that has an orientation.\r\n */\r\nexport interface ISelection {\r\n\t/**\r\n\t * The line number on which the selection has started.\r\n\t */\r\n\treadonly selectionStartLineNumber: number;\r\n\t/**\r\n\t * The column on `selectionStartLineNumber` where the selection has started.\r\n\t */\r\n\treadonly selectionStartColumn: number;\r\n\t/**\r\n\t * The line number on which the selection has ended.\r\n\t */\r\n\treadonly positionLineNumber: number;\r\n\t/**\r\n\t * The column on `positionLineNumber` where the selection has ended.\r\n\t */\r\n\treadonly positionColumn: number;\r\n}\r\n\r\n/**\r\n * The direction of a selection.\r\n */\r\nexport const enum SelectionDirection {\r\n\t/**\r\n\t * The selection starts above where it ends.\r\n\t */\r\n\tLTR,\r\n\t/**\r\n\t * The selection starts below where it ends.\r\n\t */\r\n\tRTL\r\n}\r\n\r\n/**\r\n * A selection in the editor.\r\n * The selection is a range that has an orientation.\r\n */\r\nexport class Selection extends Range {\r\n\t/**\r\n\t * The line number on which the selection has started.\r\n\t */\r\n\tpublic readonly selectionStartLineNumber: number;\r\n\t/**\r\n\t * The column on `selectionStartLineNumber` where the selection has started.\r\n\t */\r\n\tpublic readonly selectionStartColumn: number;\r\n\t/**\r\n\t * The line number on which the selection has ended.\r\n\t */\r\n\tpublic readonly positionLineNumber: number;\r\n\t/**\r\n\t * The column on `positionLineNumber` where the selection has ended.\r\n\t */\r\n\tpublic readonly positionColumn: number;\r\n\r\n\tconstructor(selectionStartLineNumber: number, selectionStartColumn: number, positionLineNumber: number, positionColumn: number) {\r\n\t\tsuper(selectionStartLineNumber, selectionStartColumn, positionLineNumber, positionColumn);\r\n\t\tthis.selectionStartLineNumber = selectionStartLineNumber;\r\n\t\tthis.selectionStartColumn = selectionStartColumn;\r\n\t\tthis.positionLineNumber = positionLineNumber;\r\n\t\tthis.positionColumn = positionColumn;\r\n\t}\r\n\r\n\t/**\r\n\t * Transform to a human-readable representation.\r\n\t */\r\n\tpublic toString(): string {\r\n\t\treturn '[' + this.selectionStartLineNumber + ',' + this.selectionStartColumn + ' -> ' + this.positionLineNumber + ',' + this.positionColumn + ']';\r\n\t}\r\n\r\n\t/**\r\n\t * Test if equals other selection.\r\n\t */\r\n\tpublic equalsSelection(other: ISelection): boolean {\r\n\t\treturn (\r\n\t\t\tSelection.selectionsEqual(this, other)\r\n\t\t);\r\n\t}\r\n\r\n\t/**\r\n\t * Test if the two selections are equal.\r\n\t */\r\n\tpublic static selectionsEqual(a: ISelection, b: ISelection): boolean {\r\n\t\treturn (\r\n\t\t\ta.selectionStartLineNumber === b.selectionStartLineNumber &&\r\n\t\t\ta.selectionStartColumn === b.selectionStartColumn &&\r\n\t\t\ta.positionLineNumber === b.positionLineNumber &&\r\n\t\t\ta.positionColumn === b.positionColumn\r\n\t\t);\r\n\t}\r\n\r\n\t/**\r\n\t * Get directions (LTR or RTL).\r\n\t */\r\n\tpublic getDirection(): SelectionDirection {\r\n\t\tif (this.selectionStartLineNumber === this.startLineNumber && this.selectionStartColumn === this.startColumn) {\r\n\t\t\treturn SelectionDirection.LTR;\r\n\t\t}\r\n\t\treturn SelectionDirection.RTL;\r\n\t}\r\n\r\n\t/**\r\n\t * Create a new selection with a different `positionLineNumber` and `positionColumn`.\r\n\t */\r\n\tpublic setEndPosition(endLineNumber: number, endColumn: number): Selection {\r\n\t\tif (this.getDirection() === SelectionDirection.LTR) {\r\n\t\t\treturn new Selection(this.startLineNumber, this.startColumn, endLineNumber, endColumn);\r\n\t\t}\r\n\t\treturn new Selection(endLineNumber, endColumn, this.startLineNumber, this.startColumn);\r\n\t}\r\n\r\n\t/**\r\n\t * Get the position at `positionLineNumber` and `positionColumn`.\r\n\t */\r\n\tpublic getPosition(): Position {\r\n\t\treturn new Position(this.positionLineNumber, this.positionColumn);\r\n\t}\r\n\r\n\t/**\r\n\t * Create a new selection with a different `selectionStartLineNumber` and `selectionStartColumn`.\r\n\t */\r\n\tpublic setStartPosition(startLineNumber: number, startColumn: number): Selection {\r\n\t\tif (this.getDirection() === SelectionDirection.LTR) {\r\n\t\t\treturn new Selection(startLineNumber, startColumn, this.endLineNumber, this.endColumn);\r\n\t\t}\r\n\t\treturn new Selection(this.endLineNumber, this.endColumn, startLineNumber, startColumn);\r\n\t}\r\n\r\n\t// ----\r\n\r\n\t/**\r\n\t * Create a `Selection` from one or two positions\r\n\t */\r\n\tpublic static fromPositions(start: IPosition, end: IPosition = start): Selection {\r\n\t\treturn new Selection(start.lineNumber, start.column, end.lineNumber, end.column);\r\n\t}\r\n\r\n\t/**\r\n\t * Create a `Selection` from an `ISelection`.\r\n\t */\r\n\tpublic static liftSelection(sel: ISelection): Selection {\r\n\t\treturn new Selection(sel.selectionStartLineNumber, sel.selectionStartColumn, sel.positionLineNumber, sel.positionColumn);\r\n\t}\r\n\r\n\t/**\r\n\t * `a` equals `b`.\r\n\t */\r\n\tpublic static selectionsArrEqual(a: ISelection[], b: ISelection[]): boolean {\r\n\t\tif (a && !b || !a && b) {\r\n\t\t\treturn false;\r\n\t\t}\r\n\t\tif (!a && !b) {\r\n\t\t\treturn true;\r\n\t\t}\r\n\t\tif (a.length !== b.length) {\r\n\t\t\treturn false;\r\n\t\t}\r\n\t\tfor (let i = 0, len = a.length; i < len; i++) {\r\n\t\t\tif (!this.selectionsEqual(a[i], b[i])) {\r\n\t\t\t\treturn false;\r\n\t\t\t}\r\n\t\t}\r\n\t\treturn true;\r\n\t}\r\n\r\n\t/**\r\n\t * Test if `obj` is an `ISelection`.\r\n\t */\r\n\tpublic static isISelection(obj: any): obj is ISelection {\r\n\t\treturn (\r\n\t\t\tobj\r\n\t\t\t&& (typeof obj.selectionStartLineNumber === 'number')\r\n\t\t\t&& (typeof obj.selectionStartColumn === 'number')\r\n\t\t\t&& (typeof obj.positionLineNumber === 'number')\r\n\t\t\t&& (typeof obj.positionColumn === 'number')\r\n\t\t);\r\n\t}\r\n\r\n\t/**\r\n\t * Create with a direction.\r\n\t */\r\n\tpublic static createWithDirection(startLineNumber: number, startColumn: number, endLineNumber: number, endColumn: number, direction: SelectionDirection): Selection {\r\n\r\n\t\tif (direction === SelectionDirection.LTR) {\r\n\t\t\treturn new Selection(startLineNumber, startColumn, endLineNumber, endColumn);\r\n\t\t}\r\n\r\n\t\treturn new Selection(endLineNumber, endColumn, startLineNumber, startColumn);\r\n\t}\r\n}\r\n","/*---------------------------------------------------------------------------------------------\r\n * Copyright (c) Microsoft Corporation. All rights reserved.\r\n * Licensed under the MIT License. See License.txt in the project root for license information.\r\n *--------------------------------------------------------------------------------------------*/\r\n\r\nimport { IState } from 'vs/editor/common/modes';\r\n\r\nexport class Token {\r\n\t_tokenBrand: void;\r\n\r\n\tpublic readonly offset: number;\r\n\tpublic readonly type: string;\r\n\tpublic readonly language: string;\r\n\r\n\tconstructor(offset: number, type: string, language: string) {\r\n\t\tthis.offset = offset | 0;// @perf\r\n\t\tthis.type = type;\r\n\t\tthis.language = language;\r\n\t}\r\n\r\n\tpublic toString(): string {\r\n\t\treturn '(' + this.offset + ', ' + this.type + ')';\r\n\t}\r\n}\r\n\r\nexport class TokenizationResult {\r\n\t_tokenizationResultBrand: void;\r\n\r\n\tpublic readonly tokens: Token[];\r\n\tpublic readonly endState: IState;\r\n\r\n\tconstructor(tokens: Token[], endState: IState) {\r\n\t\tthis.tokens = tokens;\r\n\t\tthis.endState = endState;\r\n\t}\r\n}\r\n\r\nexport class TokenizationResult2 {\r\n\t_tokenizationResult2Brand: void;\r\n\r\n\t/**\r\n\t * The tokens in binary format. Each token occupies two array indices. For token i:\r\n\t * - at offset 2*i => startIndex\r\n\t * - at offset 2*i + 1 => metadata\r\n\t *\r\n\t */\r\n\tpublic readonly tokens: Uint32Array;\r\n\tpublic readonly endState: IState;\r\n\r\n\tconstructor(tokens: Uint32Array, endState: IState) {\r\n\t\tthis.tokens = tokens;\r\n\t\tthis.endState = endState;\r\n\t}\r\n}\r\n","/*---------------------------------------------------------------------------------------------\r\n * Copyright (c) Microsoft Corporation. All rights reserved.\r\n * Licensed under the MIT License. See License.txt in the project root for license information.\r\n *--------------------------------------------------------------------------------------------*/\r\n\r\nimport { IDiffChange, ISequence, LcsDiff, IDiffResult } from 'vs/base/common/diff/diff';\r\nimport * as strings from 'vs/base/common/strings';\r\nimport { ICharChange, ILineChange } from 'vs/editor/common/editorCommon';\r\n\r\nconst MINIMUM_MATCHING_CHARACTER_LENGTH = 3;\r\n\r\nexport interface IDiffComputerResult {\r\n\tquitEarly: boolean;\r\n\tchanges: ILineChange[];\r\n}\r\n\r\nfunction computeDiff(originalSequence: ISequence, modifiedSequence: ISequence, continueProcessingPredicate: () => boolean, pretty: boolean): IDiffResult {\r\n\tconst diffAlgo = new LcsDiff(originalSequence, modifiedSequence, continueProcessingPredicate);\r\n\treturn diffAlgo.ComputeDiff(pretty);\r\n}\r\n\r\nclass LineSequence implements ISequence {\r\n\r\n\tpublic readonly lines: string[];\r\n\tprivate readonly _startColumns: number[];\r\n\tprivate readonly _endColumns: number[];\r\n\r\n\tconstructor(lines: string[]) {\r\n\t\tconst startColumns: number[] = [];\r\n\t\tconst endColumns: number[] = [];\r\n\t\tfor (let i = 0, length = lines.length; i < length; i++) {\r\n\t\t\tstartColumns[i] = getFirstNonBlankColumn(lines[i], 1);\r\n\t\t\tendColumns[i] = getLastNonBlankColumn(lines[i], 1);\r\n\t\t}\r\n\t\tthis.lines = lines;\r\n\t\tthis._startColumns = startColumns;\r\n\t\tthis._endColumns = endColumns;\r\n\t}\r\n\r\n\tpublic getElements(): Int32Array | number[] | string[] {\r\n\t\tconst elements: string[] = [];\r\n\t\tfor (let i = 0, len = this.lines.length; i < len; i++) {\r\n\t\t\telements[i] = this.lines[i].substring(this._startColumns[i] - 1, this._endColumns[i] - 1);\r\n\t\t}\r\n\t\treturn elements;\r\n\t}\r\n\r\n\tpublic getStartLineNumber(i: number): number {\r\n\t\treturn i + 1;\r\n\t}\r\n\r\n\tpublic getEndLineNumber(i: number): number {\r\n\t\treturn i + 1;\r\n\t}\r\n\r\n\tpublic createCharSequence(shouldIgnoreTrimWhitespace: boolean, startIndex: number, endIndex: number): CharSequence {\r\n\t\tconst charCodes: number[] = [];\r\n\t\tconst lineNumbers: number[] = [];\r\n\t\tconst columns: number[] = [];\r\n\t\tlet len = 0;\r\n\t\tfor (let index = startIndex; index <= endIndex; index++) {\r\n\t\t\tconst lineContent = this.lines[index];\r\n\t\t\tconst startColumn = (shouldIgnoreTrimWhitespace ? this._startColumns[index] : 1);\r\n\t\t\tconst endColumn = (shouldIgnoreTrimWhitespace ? this._endColumns[index] : lineContent.length + 1);\r\n\t\t\tfor (let col = startColumn; col < endColumn; col++) {\r\n\t\t\t\tcharCodes[len] = lineContent.charCodeAt(col - 1);\r\n\t\t\t\tlineNumbers[len] = index + 1;\r\n\t\t\t\tcolumns[len] = col;\r\n\t\t\t\tlen++;\r\n\t\t\t}\r\n\t\t}\r\n\t\treturn new CharSequence(charCodes, lineNumbers, columns);\r\n\t}\r\n}\r\n\r\nclass CharSequence implements ISequence {\r\n\r\n\tprivate readonly _charCodes: number[];\r\n\tprivate readonly _lineNumbers: number[];\r\n\tprivate readonly _columns: number[];\r\n\r\n\tconstructor(charCodes: number[], lineNumbers: number[], columns: number[]) {\r\n\t\tthis._charCodes = charCodes;\r\n\t\tthis._lineNumbers = lineNumbers;\r\n\t\tthis._columns = columns;\r\n\t}\r\n\r\n\tpublic getElements(): Int32Array | number[] | string[] {\r\n\t\treturn this._charCodes;\r\n\t}\r\n\r\n\tpublic getStartLineNumber(i: number): number {\r\n\t\treturn this._lineNumbers[i];\r\n\t}\r\n\r\n\tpublic getStartColumn(i: number): number {\r\n\t\treturn this._columns[i];\r\n\t}\r\n\r\n\tpublic getEndLineNumber(i: number): number {\r\n\t\treturn this._lineNumbers[i];\r\n\t}\r\n\r\n\tpublic getEndColumn(i: number): number {\r\n\t\treturn this._columns[i] + 1;\r\n\t}\r\n}\r\n\r\nclass CharChange implements ICharChange {\r\n\r\n\tpublic originalStartLineNumber: number;\r\n\tpublic originalStartColumn: number;\r\n\tpublic originalEndLineNumber: number;\r\n\tpublic originalEndColumn: number;\r\n\r\n\tpublic modifiedStartLineNumber: number;\r\n\tpublic modifiedStartColumn: number;\r\n\tpublic modifiedEndLineNumber: number;\r\n\tpublic modifiedEndColumn: number;\r\n\r\n\tconstructor(\r\n\t\toriginalStartLineNumber: number,\r\n\t\toriginalStartColumn: number,\r\n\t\toriginalEndLineNumber: number,\r\n\t\toriginalEndColumn: number,\r\n\t\tmodifiedStartLineNumber: number,\r\n\t\tmodifiedStartColumn: number,\r\n\t\tmodifiedEndLineNumber: number,\r\n\t\tmodifiedEndColumn: number\r\n\t) {\r\n\t\tthis.originalStartLineNumber = originalStartLineNumber;\r\n\t\tthis.originalStartColumn = originalStartColumn;\r\n\t\tthis.originalEndLineNumber = originalEndLineNumber;\r\n\t\tthis.originalEndColumn = originalEndColumn;\r\n\t\tthis.modifiedStartLineNumber = modifiedStartLineNumber;\r\n\t\tthis.modifiedStartColumn = modifiedStartColumn;\r\n\t\tthis.modifiedEndLineNumber = modifiedEndLineNumber;\r\n\t\tthis.modifiedEndColumn = modifiedEndColumn;\r\n\t}\r\n\r\n\tpublic static createFromDiffChange(diffChange: IDiffChange, originalCharSequence: CharSequence, modifiedCharSequence: CharSequence): CharChange {\r\n\t\tlet originalStartLineNumber: number;\r\n\t\tlet originalStartColumn: number;\r\n\t\tlet originalEndLineNumber: number;\r\n\t\tlet originalEndColumn: number;\r\n\t\tlet modifiedStartLineNumber: number;\r\n\t\tlet modifiedStartColumn: number;\r\n\t\tlet modifiedEndLineNumber: number;\r\n\t\tlet modifiedEndColumn: number;\r\n\r\n\t\tif (diffChange.originalLength === 0) {\r\n\t\t\toriginalStartLineNumber = 0;\r\n\t\t\toriginalStartColumn = 0;\r\n\t\t\toriginalEndLineNumber = 0;\r\n\t\t\toriginalEndColumn = 0;\r\n\t\t} else {\r\n\t\t\toriginalStartLineNumber = originalCharSequence.getStartLineNumber(diffChange.originalStart);\r\n\t\t\toriginalStartColumn = originalCharSequence.getStartColumn(diffChange.originalStart);\r\n\t\t\toriginalEndLineNumber = originalCharSequence.getEndLineNumber(diffChange.originalStart + diffChange.originalLength - 1);\r\n\t\t\toriginalEndColumn = originalCharSequence.getEndColumn(diffChange.originalStart + diffChange.originalLength - 1);\r\n\t\t}\r\n\r\n\t\tif (diffChange.modifiedLength === 0) {\r\n\t\t\tmodifiedStartLineNumber = 0;\r\n\t\t\tmodifiedStartColumn = 0;\r\n\t\t\tmodifiedEndLineNumber = 0;\r\n\t\t\tmodifiedEndColumn = 0;\r\n\t\t} else {\r\n\t\t\tmodifiedStartLineNumber = modifiedCharSequence.getStartLineNumber(diffChange.modifiedStart);\r\n\t\t\tmodifiedStartColumn = modifiedCharSequence.getStartColumn(diffChange.modifiedStart);\r\n\t\t\tmodifiedEndLineNumber = modifiedCharSequence.getEndLineNumber(diffChange.modifiedStart + diffChange.modifiedLength - 1);\r\n\t\t\tmodifiedEndColumn = modifiedCharSequence.getEndColumn(diffChange.modifiedStart + diffChange.modifiedLength - 1);\r\n\t\t}\r\n\r\n\t\treturn new CharChange(\r\n\t\t\toriginalStartLineNumber, originalStartColumn, originalEndLineNumber, originalEndColumn,\r\n\t\t\tmodifiedStartLineNumber, modifiedStartColumn, modifiedEndLineNumber, modifiedEndColumn,\r\n\t\t);\r\n\t}\r\n}\r\n\r\nfunction postProcessCharChanges(rawChanges: IDiffChange[]): IDiffChange[] {\r\n\tif (rawChanges.length <= 1) {\r\n\t\treturn rawChanges;\r\n\t}\r\n\r\n\tconst result = [rawChanges[0]];\r\n\tlet prevChange = result[0];\r\n\r\n\tfor (let i = 1, len = rawChanges.length; i < len; i++) {\r\n\t\tconst currChange = rawChanges[i];\r\n\r\n\t\tconst originalMatchingLength = currChange.originalStart - (prevChange.originalStart + prevChange.originalLength);\r\n\t\tconst modifiedMatchingLength = currChange.modifiedStart - (prevChange.modifiedStart + prevChange.modifiedLength);\r\n\t\t// Both of the above should be equal, but the continueProcessingPredicate may prevent this from being true\r\n\t\tconst matchingLength = Math.min(originalMatchingLength, modifiedMatchingLength);\r\n\r\n\t\tif (matchingLength < MINIMUM_MATCHING_CHARACTER_LENGTH) {\r\n\t\t\t// Merge the current change into the previous one\r\n\t\t\tprevChange.originalLength = (currChange.originalStart + currChange.originalLength) - prevChange.originalStart;\r\n\t\t\tprevChange.modifiedLength = (currChange.modifiedStart + currChange.modifiedLength) - prevChange.modifiedStart;\r\n\t\t} else {\r\n\t\t\t// Add the current change\r\n\t\t\tresult.push(currChange);\r\n\t\t\tprevChange = currChange;\r\n\t\t}\r\n\t}\r\n\r\n\treturn result;\r\n}\r\n\r\nclass LineChange implements ILineChange {\r\n\tpublic originalStartLineNumber: number;\r\n\tpublic originalEndLineNumber: number;\r\n\tpublic modifiedStartLineNumber: number;\r\n\tpublic modifiedEndLineNumber: number;\r\n\tpublic charChanges: CharChange[] | undefined;\r\n\r\n\tconstructor(\r\n\t\toriginalStartLineNumber: number,\r\n\t\toriginalEndLineNumber: number,\r\n\t\tmodifiedStartLineNumber: number,\r\n\t\tmodifiedEndLineNumber: number,\r\n\t\tcharChanges: CharChange[] | undefined\r\n\t) {\r\n\t\tthis.originalStartLineNumber = originalStartLineNumber;\r\n\t\tthis.originalEndLineNumber = originalEndLineNumber;\r\n\t\tthis.modifiedStartLineNumber = modifiedStartLineNumber;\r\n\t\tthis.modifiedEndLineNumber = modifiedEndLineNumber;\r\n\t\tthis.charChanges = charChanges;\r\n\t}\r\n\r\n\tpublic static createFromDiffResult(shouldIgnoreTrimWhitespace: boolean, diffChange: IDiffChange, originalLineSequence: LineSequence, modifiedLineSequence: LineSequence, continueCharDiff: () => boolean, shouldComputeCharChanges: boolean, shouldPostProcessCharChanges: boolean): LineChange {\r\n\t\tlet originalStartLineNumber: number;\r\n\t\tlet originalEndLineNumber: number;\r\n\t\tlet modifiedStartLineNumber: number;\r\n\t\tlet modifiedEndLineNumber: number;\r\n\t\tlet charChanges: CharChange[] | undefined = undefined;\r\n\r\n\t\tif (diffChange.originalLength === 0) {\r\n\t\t\toriginalStartLineNumber = originalLineSequence.getStartLineNumber(diffChange.originalStart) - 1;\r\n\t\t\toriginalEndLineNumber = 0;\r\n\t\t} else {\r\n\t\t\toriginalStartLineNumber = originalLineSequence.getStartLineNumber(diffChange.originalStart);\r\n\t\t\toriginalEndLineNumber = originalLineSequence.getEndLineNumber(diffChange.originalStart + diffChange.originalLength - 1);\r\n\t\t}\r\n\r\n\t\tif (diffChange.modifiedLength === 0) {\r\n\t\t\tmodifiedStartLineNumber = modifiedLineSequence.getStartLineNumber(diffChange.modifiedStart) - 1;\r\n\t\t\tmodifiedEndLineNumber = 0;\r\n\t\t} else {\r\n\t\t\tmodifiedStartLineNumber = modifiedLineSequence.getStartLineNumber(diffChange.modifiedStart);\r\n\t\t\tmodifiedEndLineNumber = modifiedLineSequence.getEndLineNumber(diffChange.modifiedStart + diffChange.modifiedLength - 1);\r\n\t\t}\r\n\r\n\t\tif (shouldComputeCharChanges && diffChange.originalLength > 0 && diffChange.originalLength < 20 && diffChange.modifiedLength > 0 && diffChange.modifiedLength < 20 && continueCharDiff()) {\r\n\t\t\t// Compute character changes for diff chunks of at most 20 lines...\r\n\t\t\tconst originalCharSequence = originalLineSequence.createCharSequence(shouldIgnoreTrimWhitespace, diffChange.originalStart, diffChange.originalStart + diffChange.originalLength - 1);\r\n\t\t\tconst modifiedCharSequence = modifiedLineSequence.createCharSequence(shouldIgnoreTrimWhitespace, diffChange.modifiedStart, diffChange.modifiedStart + diffChange.modifiedLength - 1);\r\n\r\n\t\t\tlet rawChanges = computeDiff(originalCharSequence, modifiedCharSequence, continueCharDiff, true).changes;\r\n\r\n\t\t\tif (shouldPostProcessCharChanges) {\r\n\t\t\t\trawChanges = postProcessCharChanges(rawChanges);\r\n\t\t\t}\r\n\r\n\t\t\tcharChanges = [];\r\n\t\t\tfor (let i = 0, length = rawChanges.length; i < length; i++) {\r\n\t\t\t\tcharChanges.push(CharChange.createFromDiffChange(rawChanges[i], originalCharSequence, modifiedCharSequence));\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\treturn new LineChange(originalStartLineNumber, originalEndLineNumber, modifiedStartLineNumber, modifiedEndLineNumber, charChanges);\r\n\t}\r\n}\r\n\r\nexport interface IDiffComputerOpts {\r\n\tshouldComputeCharChanges: boolean;\r\n\tshouldPostProcessCharChanges: boolean;\r\n\tshouldIgnoreTrimWhitespace: boolean;\r\n\tshouldMakePrettyDiff: boolean;\r\n\tmaxComputationTime: number;\r\n}\r\n\r\nexport class DiffComputer {\r\n\r\n\tprivate readonly shouldComputeCharChanges: boolean;\r\n\tprivate readonly shouldPostProcessCharChanges: boolean;\r\n\tprivate readonly shouldIgnoreTrimWhitespace: boolean;\r\n\tprivate readonly shouldMakePrettyDiff: boolean;\r\n\tprivate readonly originalLines: string[];\r\n\tprivate readonly modifiedLines: string[];\r\n\tprivate readonly original: LineSequence;\r\n\tprivate readonly modified: LineSequence;\r\n\tprivate readonly continueLineDiff: () => boolean;\r\n\tprivate readonly continueCharDiff: () => boolean;\r\n\r\n\tconstructor(originalLines: string[], modifiedLines: string[], opts: IDiffComputerOpts) {\r\n\t\tthis.shouldComputeCharChanges = opts.shouldComputeCharChanges;\r\n\t\tthis.shouldPostProcessCharChanges = opts.shouldPostProcessCharChanges;\r\n\t\tthis.shouldIgnoreTrimWhitespace = opts.shouldIgnoreTrimWhitespace;\r\n\t\tthis.shouldMakePrettyDiff = opts.shouldMakePrettyDiff;\r\n\t\tthis.originalLines = originalLines;\r\n\t\tthis.modifiedLines = modifiedLines;\r\n\t\tthis.original = new LineSequence(originalLines);\r\n\t\tthis.modified = new LineSequence(modifiedLines);\r\n\r\n\t\tthis.continueLineDiff = createContinueProcessingPredicate(opts.maxComputationTime);\r\n\t\tthis.continueCharDiff = createContinueProcessingPredicate(opts.maxComputationTime === 0 ? 0 : Math.min(opts.maxComputationTime, 5000)); // never run after 5s for character changes...\r\n\t}\r\n\r\n\tpublic computeDiff(): IDiffComputerResult {\r\n\r\n\t\tif (this.original.lines.length === 1 && this.original.lines[0].length === 0) {\r\n\t\t\t// empty original => fast path\r\n\t\t\treturn {\r\n\t\t\t\tquitEarly: false,\r\n\t\t\t\tchanges: [{\r\n\t\t\t\t\toriginalStartLineNumber: 1,\r\n\t\t\t\t\toriginalEndLineNumber: 1,\r\n\t\t\t\t\tmodifiedStartLineNumber: 1,\r\n\t\t\t\t\tmodifiedEndLineNumber: this.modified.lines.length,\r\n\t\t\t\t\tcharChanges: [{\r\n\t\t\t\t\t\tmodifiedEndColumn: 0,\r\n\t\t\t\t\t\tmodifiedEndLineNumber: 0,\r\n\t\t\t\t\t\tmodifiedStartColumn: 0,\r\n\t\t\t\t\t\tmodifiedStartLineNumber: 0,\r\n\t\t\t\t\t\toriginalEndColumn: 0,\r\n\t\t\t\t\t\toriginalEndLineNumber: 0,\r\n\t\t\t\t\t\toriginalStartColumn: 0,\r\n\t\t\t\t\t\toriginalStartLineNumber: 0\r\n\t\t\t\t\t}]\r\n\t\t\t\t}]\r\n\t\t\t};\r\n\t\t}\r\n\r\n\t\tif (this.modified.lines.length === 1 && this.modified.lines[0].length === 0) {\r\n\t\t\t// empty modified => fast path\r\n\t\t\treturn {\r\n\t\t\t\tquitEarly: false,\r\n\t\t\t\tchanges: [{\r\n\t\t\t\t\toriginalStartLineNumber: 1,\r\n\t\t\t\t\toriginalEndLineNumber: this.original.lines.length,\r\n\t\t\t\t\tmodifiedStartLineNumber: 1,\r\n\t\t\t\t\tmodifiedEndLineNumber: 1,\r\n\t\t\t\t\tcharChanges: [{\r\n\t\t\t\t\t\tmodifiedEndColumn: 0,\r\n\t\t\t\t\t\tmodifiedEndLineNumber: 0,\r\n\t\t\t\t\t\tmodifiedStartColumn: 0,\r\n\t\t\t\t\t\tmodifiedStartLineNumber: 0,\r\n\t\t\t\t\t\toriginalEndColumn: 0,\r\n\t\t\t\t\t\toriginalEndLineNumber: 0,\r\n\t\t\t\t\t\toriginalStartColumn: 0,\r\n\t\t\t\t\t\toriginalStartLineNumber: 0\r\n\t\t\t\t\t}]\r\n\t\t\t\t}]\r\n\t\t\t};\r\n\t\t}\r\n\r\n\t\tconst diffResult = computeDiff(this.original, this.modified, this.continueLineDiff, this.shouldMakePrettyDiff);\r\n\t\tconst rawChanges = diffResult.changes;\r\n\t\tconst quitEarly = diffResult.quitEarly;\r\n\r\n\t\t// The diff is always computed with ignoring trim whitespace\r\n\t\t// This ensures we get the prettiest diff\r\n\r\n\t\tif (this.shouldIgnoreTrimWhitespace) {\r\n\t\t\tconst lineChanges: LineChange[] = [];\r\n\t\t\tfor (let i = 0, length = rawChanges.length; i < length; i++) {\r\n\t\t\t\tlineChanges.push(LineChange.createFromDiffResult(this.shouldIgnoreTrimWhitespace, rawChanges[i], this.original, this.modified, this.continueCharDiff, this.shouldComputeCharChanges, this.shouldPostProcessCharChanges));\r\n\t\t\t}\r\n\t\t\treturn {\r\n\t\t\t\tquitEarly: quitEarly,\r\n\t\t\t\tchanges: lineChanges\r\n\t\t\t};\r\n\t\t}\r\n\r\n\t\t// Need to post-process and introduce changes where the trim whitespace is different\r\n\t\t// Note that we are looping starting at -1 to also cover the lines before the first change\r\n\t\tconst result: LineChange[] = [];\r\n\r\n\t\tlet originalLineIndex = 0;\r\n\t\tlet modifiedLineIndex = 0;\r\n\t\tfor (let i = -1 /* !!!! */, len = rawChanges.length; i < len; i++) {\r\n\t\t\tconst nextChange = (i + 1 < len ? rawChanges[i + 1] : null);\r\n\t\t\tconst originalStop = (nextChange ? nextChange.originalStart : this.originalLines.length);\r\n\t\t\tconst modifiedStop = (nextChange ? nextChange.modifiedStart : this.modifiedLines.length);\r\n\r\n\t\t\twhile (originalLineIndex < originalStop && modifiedLineIndex < modifiedStop) {\r\n\t\t\t\tconst originalLine = this.originalLines[originalLineIndex];\r\n\t\t\t\tconst modifiedLine = this.modifiedLines[modifiedLineIndex];\r\n\r\n\t\t\t\tif (originalLine !== modifiedLine) {\r\n\t\t\t\t\t// These lines differ only in trim whitespace\r\n\r\n\t\t\t\t\t// Check the leading whitespace\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tlet originalStartColumn = getFirstNonBlankColumn(originalLine, 1);\r\n\t\t\t\t\t\tlet modifiedStartColumn = getFirstNonBlankColumn(modifiedLine, 1);\r\n\t\t\t\t\t\twhile (originalStartColumn > 1 && modifiedStartColumn > 1) {\r\n\t\t\t\t\t\t\tconst originalChar = originalLine.charCodeAt(originalStartColumn - 2);\r\n\t\t\t\t\t\t\tconst modifiedChar = modifiedLine.charCodeAt(modifiedStartColumn - 2);\r\n\t\t\t\t\t\t\tif (originalChar !== modifiedChar) {\r\n\t\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\toriginalStartColumn--;\r\n\t\t\t\t\t\t\tmodifiedStartColumn--;\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\tif (originalStartColumn > 1 || modifiedStartColumn > 1) {\r\n\t\t\t\t\t\t\tthis._pushTrimWhitespaceCharChange(result,\r\n\t\t\t\t\t\t\t\toriginalLineIndex + 1, 1, originalStartColumn,\r\n\t\t\t\t\t\t\t\tmodifiedLineIndex + 1, 1, modifiedStartColumn\r\n\t\t\t\t\t\t\t);\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\t// Check the trailing whitespace\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tlet originalEndColumn = getLastNonBlankColumn(originalLine, 1);\r\n\t\t\t\t\t\tlet modifiedEndColumn = getLastNonBlankColumn(modifiedLine, 1);\r\n\t\t\t\t\t\tconst originalMaxColumn = originalLine.length + 1;\r\n\t\t\t\t\t\tconst modifiedMaxColumn = modifiedLine.length + 1;\r\n\t\t\t\t\t\twhile (originalEndColumn < originalMaxColumn && modifiedEndColumn < modifiedMaxColumn) {\r\n\t\t\t\t\t\t\tconst originalChar = originalLine.charCodeAt(originalEndColumn - 1);\r\n\t\t\t\t\t\t\tconst modifiedChar = originalLine.charCodeAt(modifiedEndColumn - 1);\r\n\t\t\t\t\t\t\tif (originalChar !== modifiedChar) {\r\n\t\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\toriginalEndColumn++;\r\n\t\t\t\t\t\t\tmodifiedEndColumn++;\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\tif (originalEndColumn < originalMaxColumn || modifiedEndColumn < modifiedMaxColumn) {\r\n\t\t\t\t\t\t\tthis._pushTrimWhitespaceCharChange(result,\r\n\t\t\t\t\t\t\t\toriginalLineIndex + 1, originalEndColumn, originalMaxColumn,\r\n\t\t\t\t\t\t\t\tmodifiedLineIndex + 1, modifiedEndColumn, modifiedMaxColumn\r\n\t\t\t\t\t\t\t);\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t\toriginalLineIndex++;\r\n\t\t\t\tmodifiedLineIndex++;\r\n\t\t\t}\r\n\r\n\t\t\tif (nextChange) {\r\n\t\t\t\t// Emit the actual change\r\n\t\t\t\tresult.push(LineChange.createFromDiffResult(this.shouldIgnoreTrimWhitespace, nextChange, this.original, this.modified, this.continueCharDiff, this.shouldComputeCharChanges, this.shouldPostProcessCharChanges));\r\n\r\n\t\t\t\toriginalLineIndex += nextChange.originalLength;\r\n\t\t\t\tmodifiedLineIndex += nextChange.modifiedLength;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\treturn {\r\n\t\t\tquitEarly: quitEarly,\r\n\t\t\tchanges: result\r\n\t\t};\r\n\t}\r\n\r\n\tprivate _pushTrimWhitespaceCharChange(\r\n\t\tresult: LineChange[],\r\n\t\toriginalLineNumber: number, originalStartColumn: number, originalEndColumn: number,\r\n\t\tmodifiedLineNumber: number, modifiedStartColumn: number, modifiedEndColumn: number\r\n\t): void {\r\n\t\tif (this._mergeTrimWhitespaceCharChange(result, originalLineNumber, originalStartColumn, originalEndColumn, modifiedLineNumber, modifiedStartColumn, modifiedEndColumn)) {\r\n\t\t\t// Merged into previous\r\n\t\t\treturn;\r\n\t\t}\r\n\r\n\t\tlet charChanges: CharChange[] | undefined = undefined;\r\n\t\tif (this.shouldComputeCharChanges) {\r\n\t\t\tcharChanges = [new CharChange(\r\n\t\t\t\toriginalLineNumber, originalStartColumn, originalLineNumber, originalEndColumn,\r\n\t\t\t\tmodifiedLineNumber, modifiedStartColumn, modifiedLineNumber, modifiedEndColumn\r\n\t\t\t)];\r\n\t\t}\r\n\t\tresult.push(new LineChange(\r\n\t\t\toriginalLineNumber, originalLineNumber,\r\n\t\t\tmodifiedLineNumber, modifiedLineNumber,\r\n\t\t\tcharChanges\r\n\t\t));\r\n\t}\r\n\r\n\tprivate _mergeTrimWhitespaceCharChange(\r\n\t\tresult: LineChange[],\r\n\t\toriginalLineNumber: number, originalStartColumn: number, originalEndColumn: number,\r\n\t\tmodifiedLineNumber: number, modifiedStartColumn: number, modifiedEndColumn: number\r\n\t): boolean {\r\n\t\tconst len = result.length;\r\n\t\tif (len === 0) {\r\n\t\t\treturn false;\r\n\t\t}\r\n\r\n\t\tconst prevChange = result[len - 1];\r\n\r\n\t\tif (prevChange.originalEndLineNumber === 0 || prevChange.modifiedEndLineNumber === 0) {\r\n\t\t\t// Don't merge with inserts/deletes\r\n\t\t\treturn false;\r\n\t\t}\r\n\r\n\t\tif (prevChange.originalEndLineNumber + 1 === originalLineNumber && prevChange.modifiedEndLineNumber + 1 === modifiedLineNumber) {\r\n\t\t\tprevChange.originalEndLineNumber = originalLineNumber;\r\n\t\t\tprevChange.modifiedEndLineNumber = modifiedLineNumber;\r\n\t\t\tif (this.shouldComputeCharChanges && prevChange.charChanges) {\r\n\t\t\t\tprevChange.charChanges.push(new CharChange(\r\n\t\t\t\t\toriginalLineNumber, originalStartColumn, originalLineNumber, originalEndColumn,\r\n\t\t\t\t\tmodifiedLineNumber, modifiedStartColumn, modifiedLineNumber, modifiedEndColumn\r\n\t\t\t\t));\r\n\t\t\t}\r\n\t\t\treturn true;\r\n\t\t}\r\n\r\n\t\treturn false;\r\n\t}\r\n}\r\n\r\nfunction getFirstNonBlankColumn(txt: string, defaultValue: number): number {\r\n\tconst r = strings.firstNonWhitespaceIndex(txt);\r\n\tif (r === -1) {\r\n\t\treturn defaultValue;\r\n\t}\r\n\treturn r + 1;\r\n}\r\n\r\nfunction getLastNonBlankColumn(txt: string, defaultValue: number): number {\r\n\tconst r = strings.lastNonWhitespaceIndex(txt);\r\n\tif (r === -1) {\r\n\t\treturn defaultValue;\r\n\t}\r\n\treturn r + 2;\r\n}\r\n\r\nfunction createContinueProcessingPredicate(maximumRuntime: number): () => boolean {\r\n\tif (maximumRuntime === 0) {\r\n\t\treturn () => true;\r\n\t}\r\n\r\n\tconst startTime = Date.now();\r\n\treturn () => {\r\n\t\treturn Date.now() - startTime < maximumRuntime;\r\n\t};\r\n}\r\n","/*---------------------------------------------------------------------------------------------\r\n * Copyright (c) Microsoft Corporation. All rights reserved.\r\n * Licensed under the MIT License. See License.txt in the project root for license information.\r\n *--------------------------------------------------------------------------------------------*/\r\n\r\nimport { IWordAtPosition } from 'vs/editor/common/model';\r\n\r\nexport const USUAL_WORD_SEPARATORS = '`~!@#$%^&*()-=+[{]}\\\\|;:\\'\",.<>/?';\r\n\r\n/**\r\n * Create a word definition regular expression based on default word separators.\r\n * Optionally provide allowed separators that should be included in words.\r\n *\r\n * The default would look like this:\r\n * /(-?\\d*\\.\\d\\w*)|([^\\`\\~\\!\\@\\#\\$\\%\\^\\&\\*\$\$\\-\\=\\+\\[\\{\\]\\}\\\\\\|\\;\\:\\'\\\"\\,\\.\\<\\>\\/\\?\\s]+)/g\r\n */\r\nfunction createWordRegExp(allowInWords: string = ''): RegExp {\r\n\tlet source = '(-?\\\\d*\\\\.\\\\d\\\\w*)|([^';\r\n\tfor (const sep of USUAL_WORD_SEPARATORS) {\r\n\t\tif (allowInWords.indexOf(sep) >= 0) {\r\n\t\t\tcontinue;\r\n\t\t}\r\n\t\tsource += '\\\\' + sep;\r\n\t}\r\n\tsource += '\\\\s]+)';\r\n\treturn new RegExp(source, 'g');\r\n}\r\n\r\n// catches numbers (including floating numbers) in the first group, and alphanum in the second\r\nexport const DEFAULT_WORD_REGEXP = createWordRegExp();\r\n\r\nexport function ensureValidWordDefinition(wordDefinition?: RegExp | null): RegExp {\r\n\tlet result: RegExp = DEFAULT_WORD_REGEXP;\r\n\r\n\tif (wordDefinition && (wordDefinition instanceof RegExp)) {\r\n\t\tif (!wordDefinition.global) {\r\n\t\t\tlet flags = 'g';\r\n\t\t\tif (wordDefinition.ignoreCase) {\r\n\t\t\t\tflags += 'i';\r\n\t\t\t}\r\n\t\t\tif (wordDefinition.multiline) {\r\n\t\t\t\tflags += 'm';\r\n\t\t\t}\r\n\t\t\tif ((wordDefinition as any).unicode) {\r\n\t\t\t\tflags += 'u';\r\n\t\t\t}\r\n\t\t\tresult = new RegExp(wordDefinition.source, flags);\r\n\t\t} else {\r\n\t\t\tresult = wordDefinition;\r\n\t\t}\r\n\t}\r\n\r\n\tresult.lastIndex = 0;\r\n\r\n\treturn result;\r\n}\r\n\r\nconst _defaultConfig = {\r\n\tmaxLen: 1000,\r\n\twindowSize: 15,\r\n\ttimeBudget: 150\r\n};\r\n\r\nexport function getWordAtText(column: number, wordDefinition: RegExp, text: string, textOffset: number, config = _defaultConfig): IWordAtPosition | null {\r\n\r\n\tif (text.length > config.maxLen) {\r\n\t\t// don't throw strings that long at the regexp\r\n\t\t// but use a sub-string in which a word must occur\r\n\t\tlet start = column - config.maxLen / 2;\r\n\t\tif (start < 0) {\r\n\t\t\ttextOffset += column;\r\n\t\t\tstart = 0;\r\n\t\t} else {\r\n\t\t\ttextOffset += start;\r\n\t\t}\r\n\t\ttext = text.substring(start, column + config.maxLen / 2);\r\n\t\treturn getWordAtText(column, wordDefinition, text, textOffset, config);\r\n\t}\r\n\r\n\tconst t1 = Date.now();\r\n\tconst pos = column - 1 - textOffset;\r\n\r\n\tlet prevRegexIndex = -1;\r\n\tlet match: RegExpMatchArray | null = null;\r\n\r\n\tfor (let i = 1; ; i++) {\r\n\t\t// check time budget\r\n\t\tif (Date.now() - t1 >= config.timeBudget) {\r\n\t\t\t// break;\r\n\t\t}\r\n\r\n\t\t// reset the index at which the regexp should start matching, also know where it\r\n\t\t// should stop so that subsequent search don't repeat previous searches\r\n\t\tconst regexIndex = pos - config.windowSize * i;\r\n\t\twordDefinition.lastIndex = Math.max(0, regexIndex);\r\n\t\tconst thisMatch = _findRegexMatchEnclosingPosition(wordDefinition, text, pos, prevRegexIndex);\r\n\r\n\t\tif (!thisMatch && match) {\r\n\t\t\t// stop: we have something\r\n\t\t\tbreak;\r\n\t\t}\r\n\r\n\t\tmatch = thisMatch;\r\n\r\n\t\t// stop: searched at start\r\n\t\tif (regexIndex <= 0) {\r\n\t\t\tbreak;\r\n\t\t}\r\n\t\tprevRegexIndex = regexIndex;\r\n\t}\r\n\r\n\tif (match) {\r\n\t\tlet result = {\r\n\t\t\tword: match[0],\r\n\t\t\tstartColumn: textOffset + 1 + match.index!,\r\n\t\t\tendColumn: textOffset + 1 + match.index! + match[0].length\r\n\t\t};\r\n\t\twordDefinition.lastIndex = 0;\r\n\t\treturn result;\r\n\t}\r\n\r\n\treturn null;\r\n}\r\n\r\nfunction _findRegexMatchEnclosingPosition(wordDefinition: RegExp, text: string, pos: number, stopPos: number): RegExpMatchArray | null {\r\n\tlet match: RegExpMatchArray | null;\r\n\twhile (match = wordDefinition.exec(text)) {\r\n\t\tconst matchIndex = match.index || 0;\r\n\t\tif (matchIndex <= pos && wordDefinition.lastIndex >= pos) {\r\n\t\t\treturn match;\r\n\t\t} else if (stopPos > 0 && matchIndex > stopPos) {\r\n\t\t\treturn null;\r\n\t\t}\r\n\t}\r\n\treturn null;\r\n}\r\n","/*---------------------------------------------------------------------------------------------\r\n * Copyright (c) Microsoft Corporation. All rights reserved.\r\n * Licensed under the MIT License. See License.txt in the project root for license information.\r\n *--------------------------------------------------------------------------------------------*/\r\n\r\nimport { CharCode } from 'vs/base/common/charCode';\r\nimport { CharacterClassifier } from 'vs/editor/common/core/characterClassifier';\r\nimport { ILink } from 'vs/editor/common/modes';\r\n\r\nexport interface ILinkComputerTarget {\r\n\tgetLineCount(): number;\r\n\tgetLineContent(lineNumber: number): string;\r\n}\r\n\r\nexport const enum State {\r\n\tInvalid = 0,\r\n\tStart = 1,\r\n\tH = 2,\r\n\tHT = 3,\r\n\tHTT = 4,\r\n\tHTTP = 5,\r\n\tF = 6,\r\n\tFI = 7,\r\n\tFIL = 8,\r\n\tBeforeColon = 9,\r\n\tAfterColon = 10,\r\n\tAlmostThere = 11,\r\n\tEnd = 12,\r\n\tAccept = 13,\r\n\tLastKnownState = 14 // marker, custom states may follow\r\n}\r\n\r\nexport type Edge = [State, number, State];\r\n\r\nexport class Uint8Matrix {\r\n\r\n\tprivate readonly _data: Uint8Array;\r\n\tpublic readonly rows: number;\r\n\tpublic readonly cols: number;\r\n\r\n\tconstructor(rows: number, cols: number, defaultValue: number) {\r\n\t\tconst data = new Uint8Array(rows * cols);\r\n\t\tfor (let i = 0, len = rows * cols; i < len; i++) {\r\n\t\t\tdata[i] = defaultValue;\r\n\t\t}\r\n\r\n\t\tthis._data = data;\r\n\t\tthis.rows = rows;\r\n\t\tthis.cols = cols;\r\n\t}\r\n\r\n\tpublic get(row: number, col: number): number {\r\n\t\treturn this._data[row * this.cols + col];\r\n\t}\r\n\r\n\tpublic set(row: number, col: number, value: number): void {\r\n\t\tthis._data[row * this.cols + col] = value;\r\n\t}\r\n}\r\n\r\nexport class StateMachine {\r\n\r\n\tprivate readonly _states: Uint8Matrix;\r\n\tprivate readonly _maxCharCode: number;\r\n\r\n\tconstructor(edges: Edge[]) {\r\n\t\tlet maxCharCode = 0;\r\n\t\tlet maxState = State.Invalid;\r\n\t\tfor (let i = 0, len = edges.length; i < len; i++) {\r\n\t\t\tlet [from, chCode, to] = edges[i];\r\n\t\t\tif (chCode > maxCharCode) {\r\n\t\t\t\tmaxCharCode = chCode;\r\n\t\t\t}\r\n\t\t\tif (from > maxState) {\r\n\t\t\t\tmaxState = from;\r\n\t\t\t}\r\n\t\t\tif (to > maxState) {\r\n\t\t\t\tmaxState = to;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tmaxCharCode++;\r\n\t\tmaxState++;\r\n\r\n\t\tlet states = new Uint8Matrix(maxState, maxCharCode, State.Invalid);\r\n\t\tfor (let i = 0, len = edges.length; i < len; i++) {\r\n\t\t\tlet [from, chCode, to] = edges[i];\r\n\t\t\tstates.set(from, chCode, to);\r\n\t\t}\r\n\r\n\t\tthis._states = states;\r\n\t\tthis._maxCharCode = maxCharCode;\r\n\t}\r\n\r\n\tpublic nextState(currentState: State, chCode: number): State {\r\n\t\tif (chCode < 0 || chCode >= this._maxCharCode) {\r\n\t\t\treturn State.Invalid;\r\n\t\t}\r\n\t\treturn this._states.get(currentState, chCode);\r\n\t}\r\n}\r\n\r\n// State machine for http:// or https:// or file://\r\nlet _stateMachine: StateMachine | null = null;\r\nfunction getStateMachine(): StateMachine {\r\n\tif (_stateMachine === null) {\r\n\t\t_stateMachine = new StateMachine([\r\n\t\t\t[State.Start, CharCode.h, State.H],\r\n\t\t\t[State.Start, CharCode.H, State.H],\r\n\t\t\t[State.Start, CharCode.f, State.F],\r\n\t\t\t[State.Start, CharCode.F, State.F],\r\n\r\n\t\t\t[State.H, CharCode.t, State.HT],\r\n\t\t\t[State.H, CharCode.T, State.HT],\r\n\r\n\t\t\t[State.HT, CharCode.t, State.HTT],\r\n\t\t\t[State.HT, CharCode.T, State.HTT],\r\n\r\n\t\t\t[State.HTT, CharCode.p, State.HTTP],\r\n\t\t\t[State.HTT, CharCode.P, State.HTTP],\r\n\r\n\t\t\t[State.HTTP, CharCode.s, State.BeforeColon],\r\n\t\t\t[State.HTTP, CharCode.S, State.BeforeColon],\r\n\t\t\t[State.HTTP, CharCode.Colon, State.AfterColon],\r\n\r\n\t\t\t[State.F, CharCode.i, State.FI],\r\n\t\t\t[State.F, CharCode.I, State.FI],\r\n\r\n\t\t\t[State.FI, CharCode.l, State.FIL],\r\n\t\t\t[State.FI, CharCode.L, State.FIL],\r\n\r\n\t\t\t[State.FIL, CharCode.e, State.BeforeColon],\r\n\t\t\t[State.FIL, CharCode.E, State.BeforeColon],\r\n\r\n\t\t\t[State.BeforeColon, CharCode.Colon, State.AfterColon],\r\n\r\n\t\t\t[State.AfterColon, CharCode.Slash, State.AlmostThere],\r\n\r\n\t\t\t[State.AlmostThere, CharCode.Slash, State.End],\r\n\t\t]);\r\n\t}\r\n\treturn _stateMachine;\r\n}\r\n\r\n\r\nconst enum CharacterClass {\r\n\tNone = 0,\r\n\tForceTermination = 1,\r\n\tCannotEndIn = 2\r\n}\r\n\r\nlet _classifier: CharacterClassifier<CharacterClass> | null = null;\r\nfunction getClassifier(): CharacterClassifier<CharacterClass> {\r\n\tif (_classifier === null) {\r\n\t\t_classifier = new CharacterClassifier<CharacterClass>(CharacterClass.None);\r\n\r\n\t\tconst FORCE_TERMINATION_CHARACTERS = ' \\t<>\\'\\\"、。｡､，．：；‘“〈《「『【〔（［｛｢｣｝］）〕】』」》〉”’｀～…';\r\n\t\tfor (let i = 0; i < FORCE_TERMINATION_CHARACTERS.length; i++) {\r\n\t\t\t_classifier.set(FORCE_TERMINATION_CHARACTERS.charCodeAt(i), CharacterClass.ForceTermination);\r\n\t\t}\r\n\r\n\t\tconst CANNOT_END_WITH_CHARACTERS = '.,;';\r\n\t\tfor (let i = 0; i < CANNOT_END_WITH_CHARACTERS.length; i++) {\r\n\t\t\t_classifier.set(CANNOT_END_WITH_CHARACTERS.charCodeAt(i), CharacterClass.CannotEndIn);\r\n\t\t}\r\n\t}\r\n\treturn _classifier;\r\n}\r\n\r\nexport class LinkComputer {\r\n\r\n\tprivate static _createLink(classifier: CharacterClassifier<CharacterClass>, line: string, lineNumber: number, linkBeginIndex: number, linkEndIndex: number): ILink {\r\n\t\t// Do not allow to end link in certain characters...\r\n\t\tlet lastIncludedCharIndex = linkEndIndex - 1;\r\n\t\tdo {\r\n\t\t\tconst chCode = line.charCodeAt(lastIncludedCharIndex);\r\n\t\t\tconst chClass = classifier.get(chCode);\r\n\t\t\tif (chClass !== CharacterClass.CannotEndIn) {\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t\tlastIncludedCharIndex--;\r\n\t\t} while (lastIncludedCharIndex > linkBeginIndex);\r\n\r\n\t\t// Handle links enclosed in parens, square brackets and curlys.\r\n\t\tif (linkBeginIndex > 0) {\r\n\t\t\tconst charCodeBeforeLink = line.charCodeAt(linkBeginIndex - 1);\r\n\t\t\tconst lastCharCodeInLink = line.charCodeAt(lastIncludedCharIndex);\r\n\r\n\t\t\tif (\r\n\t\t\t\t(charCodeBeforeLink === CharCode.OpenParen && lastCharCodeInLink === CharCode.CloseParen)\r\n\t\t\t\t|| (charCodeBeforeLink === CharCode.OpenSquareBracket && lastCharCodeInLink === CharCode.CloseSquareBracket)\r\n\t\t\t\t|| (charCodeBeforeLink === CharCode.OpenCurlyBrace && lastCharCodeInLink === CharCode.CloseCurlyBrace)\r\n\t\t\t) {\r\n\t\t\t\t// Do not end in ) if ( is before the link start\r\n\t\t\t\t// Do not end in ] if [ is before the link start\r\n\t\t\t\t// Do not end in } if { is before the link start\r\n\t\t\t\tlastIncludedCharIndex--;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\treturn {\r\n\t\t\trange: {\r\n\t\t\t\tstartLineNumber: lineNumber,\r\n\t\t\t\tstartColumn: linkBeginIndex + 1,\r\n\t\t\t\tendLineNumber: lineNumber,\r\n\t\t\t\tendColumn: lastIncludedCharIndex + 2\r\n\t\t\t},\r\n\t\t\turl: line.substring(linkBeginIndex, lastIncludedCharIndex + 1)\r\n\t\t};\r\n\t}\r\n\r\n\tpublic static computeLinks(model: ILinkComputerTarget, stateMachine: StateMachine = getStateMachine()): ILink[] {\r\n\t\tconst classifier = getClassifier();\r\n\r\n\t\tlet result: ILink[] = [];\r\n\t\tfor (let i = 1, lineCount = model.getLineCount(); i <= lineCount; i++) {\r\n\t\t\tconst line = model.getLineContent(i);\r\n\t\t\tconst len = line.length;\r\n\r\n\t\t\tlet j = 0;\r\n\t\t\tlet linkBeginIndex = 0;\r\n\t\t\tlet linkBeginChCode = 0;\r\n\t\t\tlet state = State.Start;\r\n\t\t\tlet hasOpenParens = false;\r\n\t\t\tlet hasOpenSquareBracket = false;\r\n\t\t\tlet inSquareBrackets = false;\r\n\t\t\tlet hasOpenCurlyBracket = false;\r\n\r\n\t\t\twhile (j < len) {\r\n\r\n\t\t\t\tlet resetStateMachine = false;\r\n\t\t\t\tconst chCode = line.charCodeAt(j);\r\n\r\n\t\t\t\tif (state === State.Accept) {\r\n\t\t\t\t\tlet chClass: CharacterClass;\r\n\t\t\t\t\tswitch (chCode) {\r\n\t\t\t\t\t\tcase CharCode.OpenParen:\r\n\t\t\t\t\t\t\thasOpenParens = true;\r\n\t\t\t\t\t\t\tchClass = CharacterClass.None;\r\n\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\tcase CharCode.CloseParen:\r\n\t\t\t\t\t\t\tchClass = (hasOpenParens ? CharacterClass.None : CharacterClass.ForceTermination);\r\n\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\tcase CharCode.OpenSquareBracket:\r\n\t\t\t\t\t\t\tinSquareBrackets = true;\r\n\t\t\t\t\t\t\thasOpenSquareBracket = true;\r\n\t\t\t\t\t\t\tchClass = CharacterClass.None;\r\n\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\tcase CharCode.CloseSquareBracket:\r\n\t\t\t\t\t\t\tinSquareBrackets = false;\r\n\t\t\t\t\t\t\tchClass = (hasOpenSquareBracket ? CharacterClass.None : CharacterClass.ForceTermination);\r\n\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\tcase CharCode.OpenCurlyBrace:\r\n\t\t\t\t\t\t\thasOpenCurlyBracket = true;\r\n\t\t\t\t\t\t\tchClass = CharacterClass.None;\r\n\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\tcase CharCode.CloseCurlyBrace:\r\n\t\t\t\t\t\t\tchClass = (hasOpenCurlyBracket ? CharacterClass.None : CharacterClass.ForceTermination);\r\n\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\t/* The following three rules make it that ' or \" or ` are allowed inside links if the link began with a different one */\r\n\t\t\t\t\t\tcase CharCode.SingleQuote:\r\n\t\t\t\t\t\t\tchClass = (linkBeginChCode === CharCode.DoubleQuote || linkBeginChCode === CharCode.BackTick) ? CharacterClass.None : CharacterClass.ForceTermination;\r\n\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\tcase CharCode.DoubleQuote:\r\n\t\t\t\t\t\t\tchClass = (linkBeginChCode === CharCode.SingleQuote || linkBeginChCode === CharCode.BackTick) ? CharacterClass.None : CharacterClass.ForceTermination;\r\n\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\tcase CharCode.BackTick:\r\n\t\t\t\t\t\t\tchClass = (linkBeginChCode === CharCode.SingleQuote || linkBeginChCode === CharCode.DoubleQuote) ? CharacterClass.None : CharacterClass.ForceTermination;\r\n\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\tcase CharCode.Asterisk:\r\n\t\t\t\t\t\t\t// `*` terminates a link if the link began with `*`\r\n\t\t\t\t\t\t\tchClass = (linkBeginChCode === CharCode.Asterisk) ? CharacterClass.ForceTermination : CharacterClass.None;\r\n\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\tcase CharCode.Pipe:\r\n\t\t\t\t\t\t\t// `|` terminates a link if the link began with `|`\r\n\t\t\t\t\t\t\tchClass = (linkBeginChCode === CharCode.Pipe) ? CharacterClass.ForceTermination : CharacterClass.None;\r\n\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\tcase CharCode.Space:\r\n\t\t\t\t\t\t\t// ` ` allow space in between [ and ]\r\n\t\t\t\t\t\t\tchClass = (inSquareBrackets ? CharacterClass.None : CharacterClass.ForceTermination);\r\n\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\tdefault:\r\n\t\t\t\t\t\t\tchClass = classifier.get(chCode);\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\t// Check if character terminates link\r\n\t\t\t\t\tif (chClass === CharacterClass.ForceTermination) {\r\n\t\t\t\t\t\tresult.push(LinkComputer._createLink(classifier, line, i, linkBeginIndex, j));\r\n\t\t\t\t\t\tresetStateMachine = true;\r\n\t\t\t\t\t}\r\n\t\t\t\t} else if (state === State.End) {\r\n\r\n\t\t\t\t\tlet chClass: CharacterClass;\r\n\t\t\t\t\tif (chCode === CharCode.OpenSquareBracket) {\r\n\t\t\t\t\t\t// Allow for the authority part to contain ipv6 addresses which contain [ and ]\r\n\t\t\t\t\t\thasOpenSquareBracket = true;\r\n\t\t\t\t\t\tchClass = CharacterClass.None;\r\n\t\t\t\t\t} else {\r\n\t\t\t\t\t\tchClass = classifier.get(chCode);\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\t// Check if character terminates link\r\n\t\t\t\t\tif (chClass === CharacterClass.ForceTermination) {\r\n\t\t\t\t\t\tresetStateMachine = true;\r\n\t\t\t\t\t} else {\r\n\t\t\t\t\t\tstate = State.Accept;\r\n\t\t\t\t\t}\r\n\t\t\t\t} else {\r\n\t\t\t\t\tstate = stateMachine.nextState(state, chCode);\r\n\t\t\t\t\tif (state === State.Invalid) {\r\n\t\t\t\t\t\tresetStateMachine = true;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\r\n\t\t\t\tif (resetStateMachine) {\r\n\t\t\t\t\tstate = State.Start;\r\n\t\t\t\t\thasOpenParens = false;\r\n\t\t\t\t\thasOpenSquareBracket = false;\r\n\t\t\t\t\thasOpenCurlyBracket = false;\r\n\r\n\t\t\t\t\t// Record where the link started\r\n\t\t\t\t\tlinkBeginIndex = j + 1;\r\n\t\t\t\t\tlinkBeginChCode = chCode;\r\n\t\t\t\t}\r\n\r\n\t\t\t\tj++;\r\n\t\t\t}\r\n\r\n\t\t\tif (state === State.Accept) {\r\n\t\t\t\tresult.push(LinkComputer._createLink(classifier, line, i, linkBeginIndex, len));\r\n\t\t\t}\r\n\r\n\t\t}\r\n\r\n\t\treturn result;\r\n\t}\r\n}\r\n\r\n/**\r\n * Returns an array of all links contains in the provided\r\n * document. *Note* that this operation is computational\r\n * expensive and should not run in the UI thread.\r\n */\r\nexport function computeLinks(model: ILinkComputerTarget | null): ILink[] {\r\n\tif (!model || typeof model.getLineCount !== 'function' || typeof model.getLineContent !== 'function') {\r\n\t\t// Unknown caller!\r\n\t\treturn [];\r\n\t}\r\n\treturn LinkComputer.computeLinks(model);\r\n}\r\n","/*---------------------------------------------------------------------------------------------\r\n * Copyright (c) Microsoft Corporation. All rights reserved.\r\n * Licensed under the MIT License. See License.txt in the project root for license information.\r\n *--------------------------------------------------------------------------------------------*/\r\n\r\nimport { IRange } from 'vs/editor/common/core/range';\r\nimport { IInplaceReplaceSupportResult } from 'vs/editor/common/modes';\r\n\r\nexport class BasicInplaceReplace {\r\n\r\n\tpublic static readonly INSTANCE = new BasicInplaceReplace();\r\n\r\n\tpublic navigateValueSet(range1: IRange, text1: string, range2: IRange, text2: string | null, up: boolean): IInplaceReplaceSupportResult | null {\r\n\r\n\t\tif (range1 && text1) {\r\n\t\t\tlet result = this.doNavigateValueSet(text1, up);\r\n\t\t\tif (result) {\r\n\t\t\t\treturn {\r\n\t\t\t\t\trange: range1,\r\n\t\t\t\t\tvalue: result\r\n\t\t\t\t};\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tif (range2 && text2) {\r\n\t\t\tlet result = this.doNavigateValueSet(text2, up);\r\n\t\t\tif (result) {\r\n\t\t\t\treturn {\r\n\t\t\t\t\trange: range2,\r\n\t\t\t\t\tvalue: result\r\n\t\t\t\t};\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\treturn null;\r\n\t}\r\n\r\n\tprivate doNavigateValueSet(text: string, up: boolean): string | null {\r\n\t\tlet numberResult = this.numberReplace(text, up);\r\n\t\tif (numberResult !== null) {\r\n\t\t\treturn numberResult;\r\n\t\t}\r\n\t\treturn this.textReplace(text, up);\r\n\t}\r\n\r\n\tprivate numberReplace(value: string, up: boolean): string | null {\r\n\t\tlet precision = Math.pow(10, value.length - (value.lastIndexOf('.') + 1));\r\n\t\tlet n1 = Number(value);\r\n\t\tlet n2 = parseFloat(value);\r\n\r\n\t\tif (!isNaN(n1) && !isNaN(n2) && n1 === n2) {\r\n\r\n\t\t\tif (n1 === 0 && !up) {\r\n\t\t\t\treturn null; // don't do negative\r\n\t\t\t\t//\t\t\t} else if(n1 === 9 && up) {\r\n\t\t\t\t//\t\t\t\treturn null; // don't insert 10 into a number\r\n\t\t\t} else {\r\n\t\t\t\tn1 = Math.floor(n1 * precision);\r\n\t\t\t\tn1 += up ? precision : -precision;\r\n\t\t\t\treturn String(n1 / precision);\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\treturn null;\r\n\t}\r\n\r\n\tprivate readonly _defaultValueSet: string[][] = [\r\n\t\t['true', 'false'],\r\n\t\t['True', 'False'],\r\n\t\t['Private', 'Public', 'Friend', 'ReadOnly', 'Partial', 'Protected', 'WriteOnly'],\r\n\t\t['public', 'protected', 'private'],\r\n\t];\r\n\r\n\tprivate textReplace(value: string, up: boolean): string | null {\r\n\t\treturn this.valueSetsReplace(this._defaultValueSet, value, up);\r\n\t}\r\n\r\n\tprivate valueSetsReplace(valueSets: string[][], value: string, up: boolean): string | null {\r\n\t\tlet result: string | null = null;\r\n\t\tfor (let i = 0, len = valueSets.length; result === null && i < len; i++) {\r\n\t\t\tresult = this.valueSetReplace(valueSets[i], value, up);\r\n\t\t}\r\n\t\treturn result;\r\n\t}\r\n\r\n\tprivate valueSetReplace(valueSet: string[], value: string, up: boolean): string | null {\r\n\t\tlet idx = valueSet.indexOf(value);\r\n\t\tif (idx >= 0) {\r\n\t\t\tidx += up ? +1 : -1;\r\n\t\t\tif (idx < 0) {\r\n\t\t\t\tidx = valueSet.length - 1;\r\n\t\t\t} else {\r\n\t\t\t\tidx %= valueSet.length;\r\n\t\t\t}\r\n\t\t\treturn valueSet[idx];\r\n\t\t}\r\n\t\treturn null;\r\n\t}\r\n}\r\n","/*---------------------------------------------------------------------------------------------\r\n * Copyright (c) Microsoft Corporation. All rights reserved.\r\n * Licensed under the MIT License. See License.txt in the project root for license information.\r\n *--------------------------------------------------------------------------------------------*/\r\n\r\n// THIS IS A GENERATED FILE. DO NOT EDIT DIRECTLY.\r\n\r\n\r\nexport enum AccessibilitySupport {\r\n\t/**\r\n\t * This should be the browser case where it is not known if a screen reader is attached or no.\r\n\t */\r\n\tUnknown = 0,\r\n\tDisabled = 1,\r\n\tEnabled = 2\r\n}\r\n\r\nexport enum CompletionItemInsertTextRule {\r\n\t/**\r\n\t * Adjust whitespace/indentation of multiline insert texts to\r\n\t * match the current line indentation.\r\n\t */\r\n\tKeepWhitespace = 1,\r\n\t/**\r\n\t * `insertText` is a snippet.\r\n\t */\r\n\tInsertAsSnippet = 4\r\n}\r\n\r\nexport enum CompletionItemKind {\r\n\tMethod = 0,\r\n\tFunction = 1,\r\n\tConstructor = 2,\r\n\tField = 3,\r\n\tVariable = 4,\r\n\tClass = 5,\r\n\tStruct = 6,\r\n\tInterface = 7,\r\n\tModule = 8,\r\n\tProperty = 9,\r\n\tEvent = 10,\r\n\tOperator = 11,\r\n\tUnit = 12,\r\n\tValue = 13,\r\n\tConstant = 14,\r\n\tEnum = 15,\r\n\tEnumMember = 16,\r\n\tKeyword = 17,\r\n\tText = 18,\r\n\tColor = 19,\r\n\tFile = 20,\r\n\tReference = 21,\r\n\tCustomcolor = 22,\r\n\tFolder = 23,\r\n\tTypeParameter = 24,\r\n\tUser = 25,\r\n\tIssue = 26,\r\n\tSnippet = 27\r\n}\r\n\r\nexport enum CompletionItemTag {\r\n\tDeprecated = 1\r\n}\r\n\r\n/**\r\n * How a suggest provider was triggered.\r\n */\r\nexport enum CompletionTriggerKind {\r\n\tInvoke = 0,\r\n\tTriggerCharacter = 1,\r\n\tTriggerForIncompleteCompletions = 2\r\n}\r\n\r\n/**\r\n * A positioning preference for rendering content widgets.\r\n */\r\nexport enum ContentWidgetPositionPreference {\r\n\t/**\r\n\t * Place the content widget exactly at a position\r\n\t */\r\n\tEXACT = 0,\r\n\t/**\r\n\t * Place the content widget above a position\r\n\t */\r\n\tABOVE = 1,\r\n\t/**\r\n\t * Place the content widget below a position\r\n\t */\r\n\tBELOW = 2\r\n}\r\n\r\n/**\r\n * Describes the reason the cursor has changed its position.\r\n */\r\nexport enum CursorChangeReason {\r\n\t/**\r\n\t * Unknown or not set.\r\n\t */\r\n\tNotSet = 0,\r\n\t/**\r\n\t * A `model.setValue()` was called.\r\n\t */\r\n\tContentFlush = 1,\r\n\t/**\r\n\t * The `model` has been changed outside of this cursor and the cursor recovers its position from associated markers.\r\n\t */\r\n\tRecoverFromMarkers = 2,\r\n\t/**\r\n\t * There was an explicit user gesture.\r\n\t */\r\n\tExplicit = 3,\r\n\t/**\r\n\t * There was a Paste.\r\n\t */\r\n\tPaste = 4,\r\n\t/**\r\n\t * There was an Undo.\r\n\t */\r\n\tUndo = 5,\r\n\t/**\r\n\t * There was a Redo.\r\n\t */\r\n\tRedo = 6\r\n}\r\n\r\n/**\r\n * The default end of line to use when instantiating models.\r\n */\r\nexport enum DefaultEndOfLine {\r\n\t/**\r\n\t * Use line feed (\\n) as the end of line character.\r\n\t */\r\n\tLF = 1,\r\n\t/**\r\n\t * Use carriage return and line feed (\\r\\n) as the end of line character.\r\n\t */\r\n\tCRLF = 2\r\n}\r\n\r\n/**\r\n * A document highlight kind.\r\n */\r\nexport enum DocumentHighlightKind {\r\n\t/**\r\n\t * A textual occurrence.\r\n\t */\r\n\tText = 0,\r\n\t/**\r\n\t * Read-access of a symbol, like reading a variable.\r\n\t */\r\n\tRead = 1,\r\n\t/**\r\n\t * Write-access of a symbol, like writing to a variable.\r\n\t */\r\n\tWrite = 2\r\n}\r\n\r\n/**\r\n * Configuration options for auto indentation in the editor\r\n */\r\nexport enum EditorAutoIndentStrategy {\r\n\tNone = 0,\r\n\tKeep = 1,\r\n\tBrackets = 2,\r\n\tAdvanced = 3,\r\n\tFull = 4\r\n}\r\n\r\nexport enum EditorOption {\r\n\tacceptSuggestionOnCommitCharacter = 0,\r\n\tacceptSuggestionOnEnter = 1,\r\n\taccessibilitySupport = 2,\r\n\taccessibilityPageSize = 3,\r\n\tariaLabel = 4,\r\n\tautoClosingBrackets = 5,\r\n\tautoClosingOvertype = 6,\r\n\tautoClosingQuotes = 7,\r\n\tautoIndent = 8,\r\n\tautomaticLayout = 9,\r\n\tautoSurround = 10,\r\n\tcodeLens = 11,\r\n\tcolorDecorators = 12,\r\n\tcolumnSelection = 13,\r\n\tcomments = 14,\r\n\tcontextmenu = 15,\r\n\tcopyWithSyntaxHighlighting = 16,\r\n\tcursorBlinking = 17,\r\n\tcursorSmoothCaretAnimation = 18,\r\n\tcursorStyle = 19,\r\n\tcursorSurroundingLines = 20,\r\n\tcursorSurroundingLinesStyle = 21,\r\n\tcursorWidth = 22,\r\n\tdisableLayerHinting = 23,\r\n\tdisableMonospaceOptimizations = 24,\r\n\tdragAndDrop = 25,\r\n\temptySelectionClipboard = 26,\r\n\textraEditorClassName = 27,\r\n\tfastScrollSensitivity = 28,\r\n\tfind = 29,\r\n\tfixedOverflowWidgets = 30,\r\n\tfolding = 31,\r\n\tfoldingStrategy = 32,\r\n\tfoldingHighlight = 33,\r\n\tunfoldOnClickAfterEndOfLine = 34,\r\n\tfontFamily = 35,\r\n\tfontInfo = 36,\r\n\tfontLigatures = 37,\r\n\tfontSize = 38,\r\n\tfontWeight = 39,\r\n\tformatOnPaste = 40,\r\n\tformatOnType = 41,\r\n\tglyphMargin = 42,\r\n\tgotoLocation = 43,\r\n\thideCursorInOverviewRuler = 44,\r\n\thighlightActiveIndentGuide = 45,\r\n\thover = 46,\r\n\tinDiffEditor = 47,\r\n\tletterSpacing = 48,\r\n\tlightbulb = 49,\r\n\tlineDecorationsWidth = 50,\r\n\tlineHeight = 51,\r\n\tlineNumbers = 52,\r\n\tlineNumbersMinChars = 53,\r\n\tlinks = 54,\r\n\tmatchBrackets = 55,\r\n\tminimap = 56,\r\n\tmouseStyle = 57,\r\n\tmouseWheelScrollSensitivity = 58,\r\n\tmouseWheelZoom = 59,\r\n\tmultiCursorMergeOverlapping = 60,\r\n\tmultiCursorModifier = 61,\r\n\tmultiCursorPaste = 62,\r\n\toccurrencesHighlight = 63,\r\n\toverviewRulerBorder = 64,\r\n\toverviewRulerLanes = 65,\r\n\tpadding = 66,\r\n\tparameterHints = 67,\r\n\tpeekWidgetDefaultFocus = 68,\r\n\tdefinitionLinkOpensInPeek = 69,\r\n\tquickSuggestions = 70,\r\n\tquickSuggestionsDelay = 71,\r\n\treadOnly = 72,\r\n\trenameOnType = 73,\r\n\trenderControlCharacters = 74,\r\n\trenderIndentGuides = 75,\r\n\trenderFinalNewline = 76,\r\n\trenderLineHighlight = 77,\r\n\trenderLineHighlightOnlyWhenFocus = 78,\r\n\trenderValidationDecorations = 79,\r\n\trenderWhitespace = 80,\r\n\trevealHorizontalRightPadding = 81,\r\n\troundedSelection = 82,\r\n\trulers = 83,\r\n\tscrollbar = 84,\r\n\tscrollBeyondLastColumn = 85,\r\n\tscrollBeyondLastLine = 86,\r\n\tscrollPredominantAxis = 87,\r\n\tselectionClipboard = 88,\r\n\tselectionHighlight = 89,\r\n\tselectOnLineNumbers = 90,\r\n\tshowFoldingControls = 91,\r\n\tshowUnused = 92,\r\n\tsnippetSuggestions = 93,\r\n\tsmoothScrolling = 94,\r\n\tstopRenderingLineAfter = 95,\r\n\tsuggest = 96,\r\n\tsuggestFontSize = 97,\r\n\tsuggestLineHeight = 98,\r\n\tsuggestOnTriggerCharacters = 99,\r\n\tsuggestSelection = 100,\r\n\ttabCompletion = 101,\r\n\ttabIndex = 102,\r\n\tunusualLineTerminators = 103,\r\n\tuseTabStops = 104,\r\n\twordSeparators = 105,\r\n\twordWrap = 106,\r\n\twordWrapBreakAfterCharacters = 107,\r\n\twordWrapBreakBeforeCharacters = 108,\r\n\twordWrapColumn = 109,\r\n\twordWrapMinified = 110,\r\n\twrappingIndent = 111,\r\n\twrappingStrategy = 112,\r\n\tshowDeprecated = 113,\r\n\teditorClassName = 114,\r\n\tpixelRatio = 115,\r\n\ttabFocusMode = 116,\r\n\tlayoutInfo = 117,\r\n\twrappingInfo = 118\r\n}\r\n\r\n/**\r\n * End of line character preference.\r\n */\r\nexport enum EndOfLinePreference {\r\n\t/**\r\n\t * Use the end of line character identified in the text buffer.\r\n\t */\r\n\tTextDefined = 0,\r\n\t/**\r\n\t * Use line feed (\\n) as the end of line character.\r\n\t */\r\n\tLF = 1,\r\n\t/**\r\n\t * Use carriage return and line feed (\\r\\n) as the end of line character.\r\n\t */\r\n\tCRLF = 2\r\n}\r\n\r\n/**\r\n * End of line character preference.\r\n */\r\nexport enum EndOfLineSequence {\r\n\t/**\r\n\t * Use line feed (\\n) as the end of line character.\r\n\t */\r\n\tLF = 0,\r\n\t/**\r\n\t * Use carriage return and line feed (\\r\\n) as the end of line character.\r\n\t */\r\n\tCRLF = 1\r\n}\r\n\r\n/**\r\n * Describes what to do with the indentation when pressing Enter.\r\n */\r\nexport enum IndentAction {\r\n\t/**\r\n\t * Insert new line and copy the previous line's indentation.\r\n\t */\r\n\tNone = 0,\r\n\t/**\r\n\t * Insert new line and indent once (relative to the previous line's indentation).\r\n\t */\r\n\tIndent = 1,\r\n\t/**\r\n\t * Insert two new lines:\r\n\t * - the first one indented which will hold the cursor\r\n\t * - the second one at the same indentation level\r\n\t */\r\n\tIndentOutdent = 2,\r\n\t/**\r\n\t * Insert new line and outdent once (relative to the previous line's indentation).\r\n\t */\r\n\tOutdent = 3\r\n}\r\n\r\n/**\r\n * Virtual Key Codes, the value does not hold any inherent meaning.\r\n * Inspired somewhat from https://msdn.microsoft.com/en-us/library/windows/desktop/dd375731(v=vs.85).aspx\r\n * But these are \"more general\", as they should work across browsers & OS`s.\r\n */\r\nexport enum KeyCode {\r\n\t/**\r\n\t * Placed first to cover the 0 value of the enum.\r\n\t */\r\n\tUnknown = 0,\r\n\tBackspace = 1,\r\n\tTab = 2,\r\n\tEnter = 3,\r\n\tShift = 4,\r\n\tCtrl = 5,\r\n\tAlt = 6,\r\n\tPauseBreak = 7,\r\n\tCapsLock = 8,\r\n\tEscape = 9,\r\n\tSpace = 10,\r\n\tPageUp = 11,\r\n\tPageDown = 12,\r\n\tEnd = 13,\r\n\tHome = 14,\r\n\tLeftArrow = 15,\r\n\tUpArrow = 16,\r\n\tRightArrow = 17,\r\n\tDownArrow = 18,\r\n\tInsert = 19,\r\n\tDelete = 20,\r\n\tKEY_0 = 21,\r\n\tKEY_1 = 22,\r\n\tKEY_2 = 23,\r\n\tKEY_3 = 24,\r\n\tKEY_4 = 25,\r\n\tKEY_5 = 26,\r\n\tKEY_6 = 27,\r\n\tKEY_7 = 28,\r\n\tKEY_8 = 29,\r\n\tKEY_9 = 30,\r\n\tKEY_A = 31,\r\n\tKEY_B = 32,\r\n\tKEY_C = 33,\r\n\tKEY_D = 34,\r\n\tKEY_E = 35,\r\n\tKEY_F = 36,\r\n\tKEY_G = 37,\r\n\tKEY_H = 38,\r\n\tKEY_I = 39,\r\n\tKEY_J = 40,\r\n\tKEY_K = 41,\r\n\tKEY_L = 42,\r\n\tKEY_M = 43,\r\n\tKEY_N = 44,\r\n\tKEY_O = 45,\r\n\tKEY_P = 46,\r\n\tKEY_Q = 47,\r\n\tKEY_R = 48,\r\n\tKEY_S = 49,\r\n\tKEY_T = 50,\r\n\tKEY_U = 51,\r\n\tKEY_V = 52,\r\n\tKEY_W = 53,\r\n\tKEY_X = 54,\r\n\tKEY_Y = 55,\r\n\tKEY_Z = 56,\r\n\tMeta = 57,\r\n\tContextMenu = 58,\r\n\tF1 = 59,\r\n\tF2 = 60,\r\n\tF3 = 61,\r\n\tF4 = 62,\r\n\tF5 = 63,\r\n\tF6 = 64,\r\n\tF7 = 65,\r\n\tF8 = 66,\r\n\tF9 = 67,\r\n\tF10 = 68,\r\n\tF11 = 69,\r\n\tF12 = 70,\r\n\tF13 = 71,\r\n\tF14 = 72,\r\n\tF15 = 73,\r\n\tF16 = 74,\r\n\tF17 = 75,\r\n\tF18 = 76,\r\n\tF19 = 77,\r\n\tNumLock = 78,\r\n\tScrollLock = 79,\r\n\t/**\r\n\t * Used for miscellaneous characters; it can vary by keyboard.\r\n\t * For the US standard keyboard, the ';:' key\r\n\t */\r\n\tUS_SEMICOLON = 80,\r\n\t/**\r\n\t * For any country/region, the '+' key\r\n\t * For the US standard keyboard, the '=+' key\r\n\t */\r\n\tUS_EQUAL = 81,\r\n\t/**\r\n\t * For any country/region, the ',' key\r\n\t * For the US standard keyboard, the ',<' key\r\n\t */\r\n\tUS_COMMA = 82,\r\n\t/**\r\n\t * For any country/region, the '-' key\r\n\t * For the US standard keyboard, the '-_' key\r\n\t */\r\n\tUS_MINUS = 83,\r\n\t/**\r\n\t * For any country/region, the '.' key\r\n\t * For the US standard keyboard, the '.>' key\r\n\t */\r\n\tUS_DOT = 84,\r\n\t/**\r\n\t * Used for miscellaneous characters; it can vary by keyboard.\r\n\t * For the US standard keyboard, the '/?' key\r\n\t */\r\n\tUS_SLASH = 85,\r\n\t/**\r\n\t * Used for miscellaneous characters; it can vary by keyboard.\r\n\t * For the US standard keyboard, the '`~' key\r\n\t */\r\n\tUS_BACKTICK = 86,\r\n\t/**\r\n\t * Used for miscellaneous characters; it can vary by keyboard.\r\n\t * For the US standard keyboard, the '[{' key\r\n\t */\r\n\tUS_OPEN_SQUARE_BRACKET = 87,\r\n\t/**\r\n\t * Used for miscellaneous characters; it can vary by keyboard.\r\n\t * For the US standard keyboard, the '\\|' key\r\n\t */\r\n\tUS_BACKSLASH = 88,\r\n\t/**\r\n\t * Used for miscellaneous characters; it can vary by keyboard.\r\n\t * For the US standard keyboard, the ']}' key\r\n\t */\r\n\tUS_CLOSE_SQUARE_BRACKET = 89,\r\n\t/**\r\n\t * Used for miscellaneous characters; it can vary by keyboard.\r\n\t * For the US standard keyboard, the ''\"' key\r\n\t */\r\n\tUS_QUOTE = 90,\r\n\t/**\r\n\t * Used for miscellaneous characters; it can vary by keyboard.\r\n\t */\r\n\tOEM_8 = 91,\r\n\t/**\r\n\t * Either the angle bracket key or the backslash key on the RT 102-key keyboard.\r\n\t */\r\n\tOEM_102 = 92,\r\n\tNUMPAD_0 = 93,\r\n\tNUMPAD_1 = 94,\r\n\tNUMPAD_2 = 95,\r\n\tNUMPAD_3 = 96,\r\n\tNUMPAD_4 = 97,\r\n\tNUMPAD_5 = 98,\r\n\tNUMPAD_6 = 99,\r\n\tNUMPAD_7 = 100,\r\n\tNUMPAD_8 = 101,\r\n\tNUMPAD_9 = 102,\r\n\tNUMPAD_MULTIPLY = 103,\r\n\tNUMPAD_ADD = 104,\r\n\tNUMPAD_SEPARATOR = 105,\r\n\tNUMPAD_SUBTRACT = 106,\r\n\tNUMPAD_DECIMAL = 107,\r\n\tNUMPAD_DIVIDE = 108,\r\n\t/**\r\n\t * Cover all key codes when IME is processing input.\r\n\t */\r\n\tKEY_IN_COMPOSITION = 109,\r\n\tABNT_C1 = 110,\r\n\tABNT_C2 = 111,\r\n\t/**\r\n\t * Placed last to cover the length of the enum.\r\n\t * Please do not depend on this value!\r\n\t */\r\n\tMAX_VALUE = 112\r\n}\r\n\r\nexport enum MarkerSeverity {\r\n\tHint = 1,\r\n\tInfo = 2,\r\n\tWarning = 4,\r\n\tError = 8\r\n}\r\n\r\nexport enum MarkerTag {\r\n\tUnnecessary = 1,\r\n\tDeprecated = 2\r\n}\r\n\r\n/**\r\n * Position in the minimap to render the decoration.\r\n */\r\nexport enum MinimapPosition {\r\n\tInline = 1,\r\n\tGutter = 2\r\n}\r\n\r\n/**\r\n * Type of hit element with the mouse in the editor.\r\n */\r\nexport enum MouseTargetType {\r\n\t/**\r\n\t * Mouse is on top of an unknown element.\r\n\t */\r\n\tUNKNOWN = 0,\r\n\t/**\r\n\t * Mouse is on top of the textarea used for input.\r\n\t */\r\n\tTEXTAREA = 1,\r\n\t/**\r\n\t * Mouse is on top of the glyph margin\r\n\t */\r\n\tGUTTER_GLYPH_MARGIN = 2,\r\n\t/**\r\n\t * Mouse is on top of the line numbers\r\n\t */\r\n\tGUTTER_LINE_NUMBERS = 3,\r\n\t/**\r\n\t * Mouse is on top of the line decorations\r\n\t */\r\n\tGUTTER_LINE_DECORATIONS = 4,\r\n\t/**\r\n\t * Mouse is on top of the whitespace left in the gutter by a view zone.\r\n\t */\r\n\tGUTTER_VIEW_ZONE = 5,\r\n\t/**\r\n\t * Mouse is on top of text in the content.\r\n\t */\r\n\tCONTENT_TEXT = 6,\r\n\t/**\r\n\t * Mouse is on top of empty space in the content (e.g. after line text or below last line)\r\n\t */\r\n\tCONTENT_EMPTY = 7,\r\n\t/**\r\n\t * Mouse is on top of a view zone in the content.\r\n\t */\r\n\tCONTENT_VIEW_ZONE = 8,\r\n\t/**\r\n\t * Mouse is on top of a content widget.\r\n\t */\r\n\tCONTENT_WIDGET = 9,\r\n\t/**\r\n\t * Mouse is on top of the decorations overview ruler.\r\n\t */\r\n\tOVERVIEW_RULER = 10,\r\n\t/**\r\n\t * Mouse is on top of a scrollbar.\r\n\t */\r\n\tSCROLLBAR = 11,\r\n\t/**\r\n\t * Mouse is on top of an overlay widget.\r\n\t */\r\n\tOVERLAY_WIDGET = 12,\r\n\t/**\r\n\t * Mouse is outside of the editor.\r\n\t */\r\n\tOUTSIDE_EDITOR = 13\r\n}\r\n\r\n/**\r\n * A positioning preference for rendering overlay widgets.\r\n */\r\nexport enum OverlayWidgetPositionPreference {\r\n\t/**\r\n\t * Position the overlay widget in the top right corner\r\n\t */\r\n\tTOP_RIGHT_CORNER = 0,\r\n\t/**\r\n\t * Position the overlay widget in the bottom right corner\r\n\t */\r\n\tBOTTOM_RIGHT_CORNER = 1,\r\n\t/**\r\n\t * Position the overlay widget in the top center\r\n\t */\r\n\tTOP_CENTER = 2\r\n}\r\n\r\n/**\r\n * Vertical Lane in the overview ruler of the editor.\r\n */\r\nexport enum OverviewRulerLane {\r\n\tLeft = 1,\r\n\tCenter = 2,\r\n\tRight = 4,\r\n\tFull = 7\r\n}\r\n\r\nexport enum RenderLineNumbersType {\r\n\tOff = 0,\r\n\tOn = 1,\r\n\tRelative = 2,\r\n\tInterval = 3,\r\n\tCustom = 4\r\n}\r\n\r\nexport enum RenderMinimap {\r\n\tNone = 0,\r\n\tText = 1,\r\n\tBlocks = 2\r\n}\r\n\r\nexport enum ScrollType {\r\n\tSmooth = 0,\r\n\tImmediate = 1\r\n}\r\n\r\nexport enum ScrollbarVisibility {\r\n\tAuto = 1,\r\n\tHidden = 2,\r\n\tVisible = 3\r\n}\r\n\r\n/**\r\n * The direction of a selection.\r\n */\r\nexport enum SelectionDirection {\r\n\t/**\r\n\t * The selection starts above where it ends.\r\n\t */\r\n\tLTR = 0,\r\n\t/**\r\n\t * The selection starts below where it ends.\r\n\t */\r\n\tRTL = 1\r\n}\r\n\r\nexport enum SignatureHelpTriggerKind {\r\n\tInvoke = 1,\r\n\tTriggerCharacter = 2,\r\n\tContentChange = 3\r\n}\r\n\r\n/**\r\n * A symbol kind.\r\n */\r\nexport enum SymbolKind {\r\n\tFile = 0,\r\n\tModule = 1,\r\n\tNamespace = 2,\r\n\tPackage = 3,\r\n\tClass = 4,\r\n\tMethod = 5,\r\n\tProperty = 6,\r\n\tField = 7,\r\n\tConstructor = 8,\r\n\tEnum = 9,\r\n\tInterface = 10,\r\n\tFunction = 11,\r\n\tVariable = 12,\r\n\tConstant = 13,\r\n\tString = 14,\r\n\tNumber = 15,\r\n\tBoolean = 16,\r\n\tArray = 17,\r\n\tObject = 18,\r\n\tKey = 19,\r\n\tNull = 20,\r\n\tEnumMember = 21,\r\n\tStruct = 22,\r\n\tEvent = 23,\r\n\tOperator = 24,\r\n\tTypeParameter = 25\r\n}\r\n\r\nexport enum SymbolTag {\r\n\tDeprecated = 1\r\n}\r\n\r\n/**\r\n * The kind of animation in which the editor's cursor should be rendered.\r\n */\r\nexport enum TextEditorCursorBlinkingStyle {\r\n\t/**\r\n\t * Hidden\r\n\t */\r\n\tHidden = 0,\r\n\t/**\r\n\t * Blinking\r\n\t */\r\n\tBlink = 1,\r\n\t/**\r\n\t * Blinking with smooth fading\r\n\t */\r\n\tSmooth = 2,\r\n\t/**\r\n\t * Blinking with prolonged filled state and smooth fading\r\n\t */\r\n\tPhase = 3,\r\n\t/**\r\n\t * Expand collapse animation on the y axis\r\n\t */\r\n\tExpand = 4,\r\n\t/**\r\n\t * No-Blinking\r\n\t */\r\n\tSolid = 5\r\n}\r\n\r\n/**\r\n * The style in which the editor's cursor should be rendered.\r\n */\r\nexport enum TextEditorCursorStyle {\r\n\t/**\r\n\t * As a vertical line (sitting between two characters).\r\n\t */\r\n\tLine = 1,\r\n\t/**\r\n\t * As a block (sitting on top of a character).\r\n\t */\r\n\tBlock = 2,\r\n\t/**\r\n\t * As a horizontal line (sitting under a character).\r\n\t */\r\n\tUnderline = 3,\r\n\t/**\r\n\t * As a thin vertical line (sitting between two characters).\r\n\t */\r\n\tLineThin = 4,\r\n\t/**\r\n\t * As an outlined block (sitting on top of a character).\r\n\t */\r\n\tBlockOutline = 5,\r\n\t/**\r\n\t * As a thin horizontal line (sitting under a character).\r\n\t */\r\n\tUnderlineThin = 6\r\n}\r\n\r\n/**\r\n * Describes the behavior of decorations when typing/editing near their edges.\r\n * Note: Please do not edit the values, as they very carefully match `DecorationRangeBehavior`\r\n */\r\nexport enum TrackedRangeStickiness {\r\n\tAlwaysGrowsWhenTypingAtEdges = 0,\r\n\tNeverGrowsWhenTypingAtEdges = 1,\r\n\tGrowsOnlyWhenTypingBefore = 2,\r\n\tGrowsOnlyWhenTypingAfter = 3\r\n}\r\n\r\n/**\r\n * Describes how to indent wrapped lines.\r\n */\r\nexport enum WrappingIndent {\r\n\t/**\r\n\t * No indentation => wrapped lines begin at column 1.\r\n\t */\r\n\tNone = 0,\r\n\t/**\r\n\t * Same => wrapped lines get the same indentation as the parent.\r\n\t */\r\n\tSame = 1,\r\n\t/**\r\n\t * Indent => wrapped lines get +1 indentation toward the parent.\r\n\t */\r\n\tIndent = 2,\r\n\t/**\r\n\t * DeepIndent => wrapped lines get +2 indentation toward the parent.\r\n\t */\r\n\tDeepIndent = 3\r\n}","/*---------------------------------------------------------------------------------------------\r\n * Copyright (c) Microsoft Corporation. All rights reserved.\r\n * Licensed under the MIT License. See License.txt in the project root for license information.\r\n *--------------------------------------------------------------------------------------------*/\r\n\r\nimport { CancellationTokenSource } from 'vs/base/common/cancellation';\r\nimport { Emitter } from 'vs/base/common/event';\r\nimport { KeyChord, KeyMod as ConstKeyMod } from 'vs/base/common/keyCodes';\r\nimport { URI } from 'vs/base/common/uri';\r\nimport { Position } from 'vs/editor/common/core/position';\r\nimport { Range } from 'vs/editor/common/core/range';\r\nimport { Selection } from 'vs/editor/common/core/selection';\r\nimport { Token } from 'vs/editor/common/core/token';\r\nimport * as standaloneEnums from 'vs/editor/common/standalone/standaloneEnums';\r\n\r\nexport class KeyMod {\r\n\tpublic static readonly CtrlCmd: number = ConstKeyMod.CtrlCmd;\r\n\tpublic static readonly Shift: number = ConstKeyMod.Shift;\r\n\tpublic static readonly Alt: number = ConstKeyMod.Alt;\r\n\tpublic static readonly WinCtrl: number = ConstKeyMod.WinCtrl;\r\n\r\n\tpublic static chord(firstPart: number, secondPart: number): number {\r\n\t\treturn KeyChord(firstPart, secondPart);\r\n\t}\r\n}\r\n\r\nexport function createMonacoBaseAPI(): typeof monaco {\r\n\treturn {\r\n\t\teditor: undefined!, // undefined override expected here\r\n\t\tlanguages: undefined!, // undefined override expected here\r\n\t\tCancellationTokenSource: CancellationTokenSource,\r\n\t\tEmitter: Emitter,\r\n\t\tKeyCode: standaloneEnums.KeyCode,\r\n\t\tKeyMod: KeyMod,\r\n\t\tPosition: Position,\r\n\t\tRange: Range,\r\n\t\tSelection: <any>Selection,\r\n\t\tSelectionDirection: standaloneEnums.SelectionDirection,\r\n\t\tMarkerSeverity: standaloneEnums.MarkerSeverity,\r\n\t\tMarkerTag: standaloneEnums.MarkerTag,\r\n\t\tUri: <any>URI,\r\n\t\tToken: Token\r\n\t};\r\n}\r\n","/*---------------------------------------------------------------------------------------------\r\n * Copyright (c) Microsoft Corporation. All rights reserved.\r\n * Licensed under the MIT License. See License.txt in the project root for license information.\r\n *--------------------------------------------------------------------------------------------*/\r\n\r\nimport { toUint32 } from 'vs/base/common/uint';\r\n\r\nexport class PrefixSumIndexOfResult {\r\n\t_prefixSumIndexOfResultBrand: void;\r\n\r\n\tindex: number;\r\n\tremainder: number;\r\n\r\n\tconstructor(index: number, remainder: number) {\r\n\t\tthis.index = index;\r\n\t\tthis.remainder = remainder;\r\n\t}\r\n}\r\n\r\nexport class PrefixSumComputer {\r\n\r\n\t/**\r\n\t * values[i] is the value at index i\r\n\t */\r\n\tprivate values: Uint32Array;\r\n\r\n\t/**\r\n\t * prefixSum[i] = SUM(heights[j]), 0 <= j <= i\r\n\t */\r\n\tprivate prefixSum: Uint32Array;\r\n\r\n\t/**\r\n\t * prefixSum[i], 0 <= i <= prefixSumValidIndex can be trusted\r\n\t */\r\n\tprivate readonly prefixSumValidIndex: Int32Array;\r\n\r\n\tconstructor(values: Uint32Array) {\r\n\t\tthis.values = values;\r\n\t\tthis.prefixSum = new Uint32Array(values.length);\r\n\t\tthis.prefixSumValidIndex = new Int32Array(1);\r\n\t\tthis.prefixSumValidIndex[0] = -1;\r\n\t}\r\n\r\n\tpublic insertValues(insertIndex: number, insertValues: Uint32Array): boolean {\r\n\t\tinsertIndex = toUint32(insertIndex);\r\n\t\tconst oldValues = this.values;\r\n\t\tconst oldPrefixSum = this.prefixSum;\r\n\t\tconst insertValuesLen = insertValues.length;\r\n\r\n\t\tif (insertValuesLen === 0) {\r\n\t\t\treturn false;\r\n\t\t}\r\n\r\n\t\tthis.values = new Uint32Array(oldValues.length + insertValuesLen);\r\n\t\tthis.values.set(oldValues.subarray(0, insertIndex), 0);\r\n\t\tthis.values.set(oldValues.subarray(insertIndex), insertIndex + insertValuesLen);\r\n\t\tthis.values.set(insertValues, insertIndex);\r\n\r\n\t\tif (insertIndex - 1 < this.prefixSumValidIndex[0]) {\r\n\t\t\tthis.prefixSumValidIndex[0] = insertIndex - 1;\r\n\t\t}\r\n\r\n\t\tthis.prefixSum = new Uint32Array(this.values.length);\r\n\t\tif (this.prefixSumValidIndex[0] >= 0) {\r\n\t\t\tthis.prefixSum.set(oldPrefixSum.subarray(0, this.prefixSumValidIndex[0] + 1));\r\n\t\t}\r\n\t\treturn true;\r\n\t}\r\n\r\n\tpublic changeValue(index: number, value: number): boolean {\r\n\t\tindex = toUint32(index);\r\n\t\tvalue = toUint32(value);\r\n\r\n\t\tif (this.values[index] === value) {\r\n\t\t\treturn false;\r\n\t\t}\r\n\t\tthis.values[index] = value;\r\n\t\tif (index - 1 < this.prefixSumValidIndex[0]) {\r\n\t\t\tthis.prefixSumValidIndex[0] = index - 1;\r\n\t\t}\r\n\t\treturn true;\r\n\t}\r\n\r\n\tpublic removeValues(startIndex: number, cnt: number): boolean {\r\n\t\tstartIndex = toUint32(startIndex);\r\n\t\tcnt = toUint32(cnt);\r\n\r\n\t\tconst oldValues = this.values;\r\n\t\tconst oldPrefixSum = this.prefixSum;\r\n\r\n\t\tif (startIndex >= oldValues.length) {\r\n\t\t\treturn false;\r\n\t\t}\r\n\r\n\t\tlet maxCnt = oldValues.length - startIndex;\r\n\t\tif (cnt >= maxCnt) {\r\n\t\t\tcnt = maxCnt;\r\n\t\t}\r\n\r\n\t\tif (cnt === 0) {\r\n\t\t\treturn false;\r\n\t\t}\r\n\r\n\t\tthis.values = new Uint32Array(oldValues.length - cnt);\r\n\t\tthis.values.set(oldValues.subarray(0, startIndex), 0);\r\n\t\tthis.values.set(oldValues.subarray(startIndex + cnt), startIndex);\r\n\r\n\t\tthis.prefixSum = new Uint32Array(this.values.length);\r\n\t\tif (startIndex - 1 < this.prefixSumValidIndex[0]) {\r\n\t\t\tthis.prefixSumValidIndex[0] = startIndex - 1;\r\n\t\t}\r\n\t\tif (this.prefixSumValidIndex[0] >= 0) {\r\n\t\t\tthis.prefixSum.set(oldPrefixSum.subarray(0, this.prefixSumValidIndex[0] + 1));\r\n\t\t}\r\n\t\treturn true;\r\n\t}\r\n\r\n\tpublic getTotalValue(): number {\r\n\t\tif (this.values.length === 0) {\r\n\t\t\treturn 0;\r\n\t\t}\r\n\t\treturn this._getAccumulatedValue(this.values.length - 1);\r\n\t}\r\n\r\n\tpublic getAccumulatedValue(index: number): number {\r\n\t\tif (index < 0) {\r\n\t\t\treturn 0;\r\n\t\t}\r\n\r\n\t\tindex = toUint32(index);\r\n\t\treturn this._getAccumulatedValue(index);\r\n\t}\r\n\r\n\tprivate _getAccumulatedValue(index: number): number {\r\n\t\tif (index <= this.prefixSumValidIndex[0]) {\r\n\t\t\treturn this.prefixSum[index];\r\n\t\t}\r\n\r\n\t\tlet startIndex = this.prefixSumValidIndex[0] + 1;\r\n\t\tif (startIndex === 0) {\r\n\t\t\tthis.prefixSum[0] = this.values[0];\r\n\t\t\tstartIndex++;\r\n\t\t}\r\n\r\n\t\tif (index >= this.values.length) {\r\n\t\t\tindex = this.values.length - 1;\r\n\t\t}\r\n\r\n\t\tfor (let i = startIndex; i <= index; i++) {\r\n\t\t\tthis.prefixSum[i] = this.prefixSum[i - 1] + this.values[i];\r\n\t\t}\r\n\t\tthis.prefixSumValidIndex[0] = Math.max(this.prefixSumValidIndex[0], index);\r\n\t\treturn this.prefixSum[index];\r\n\t}\r\n\r\n\tpublic getIndexOf(accumulatedValue: number): PrefixSumIndexOfResult {\r\n\t\taccumulatedValue = Math.floor(accumulatedValue); //@perf\r\n\r\n\t\t// Compute all sums (to get a fully valid prefixSum)\r\n\t\tthis.getTotalValue();\r\n\r\n\t\tlet low = 0;\r\n\t\tlet high = this.values.length - 1;\r\n\t\tlet mid = 0;\r\n\t\tlet midStop = 0;\r\n\t\tlet midStart = 0;\r\n\r\n\t\twhile (low <= high) {\r\n\t\t\tmid = low + ((high - low) / 2) | 0;\r\n\r\n\t\t\tmidStop = this.prefixSum[mid];\r\n\t\t\tmidStart = midStop - this.values[mid];\r\n\r\n\t\t\tif (accumulatedValue < midStart) {\r\n\t\t\t\thigh = mid - 1;\r\n\t\t\t} else if (accumulatedValue >= midStop) {\r\n\t\t\t\tlow = mid + 1;\r\n\t\t\t} else {\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\treturn new PrefixSumIndexOfResult(mid, accumulatedValue - midStart);\r\n\t}\r\n}\r\n","/*---------------------------------------------------------------------------------------------\r\n * Copyright (c) Microsoft Corporation. All rights reserved.\r\n * Licensed under the MIT License. See License.txt in the project root for license information.\r\n *--------------------------------------------------------------------------------------------*/\r\n\r\nimport { URI } from 'vs/base/common/uri';\r\nimport { Position } from 'vs/editor/common/core/position';\r\nimport { IRange } from 'vs/editor/common/core/range';\r\nimport { IModelContentChange } from 'vs/editor/common/model/textModelEvents';\r\nimport { PrefixSumComputer } from 'vs/editor/common/viewModel/prefixSumComputer';\r\n\r\nexport interface IModelChangedEvent {\r\n\t/**\r\n\t * The actual changes.\r\n\t */\r\n\treadonly changes: IModelContentChange[];\r\n\t/**\r\n\t * The (new) end-of-line character.\r\n\t */\r\n\treadonly eol: string;\r\n\t/**\r\n\t * The new version id the model has transitioned to.\r\n\t */\r\n\treadonly versionId: number;\r\n}\r\n\r\nexport class MirrorTextModel {\r\n\r\n\tprotected _uri: URI;\r\n\tprotected _lines: string[];\r\n\tprotected _eol: string;\r\n\tprotected _versionId: number;\r\n\tprotected _lineStarts: PrefixSumComputer | null;\r\n\tprivate _cachedTextValue: string | null;\r\n\r\n\tconstructor(uri: URI, lines: string[], eol: string, versionId: number) {\r\n\t\tthis._uri = uri;\r\n\t\tthis._lines = lines;\r\n\t\tthis._eol = eol;\r\n\t\tthis._versionId = versionId;\r\n\t\tthis._lineStarts = null;\r\n\t\tthis._cachedTextValue = null;\r\n\t}\r\n\r\n\tdispose(): void {\r\n\t\tthis._lines.length = 0;\r\n\t}\r\n\r\n\tgetText(): string {\r\n\t\tif (this._cachedTextValue === null) {\r\n\t\t\tthis._cachedTextValue = this._lines.join(this._eol);\r\n\t\t}\r\n\t\treturn this._cachedTextValue;\r\n\t}\r\n\r\n\tonEvents(e: IModelChangedEvent): void {\r\n\t\tif (e.eol && e.eol !== this._eol) {\r\n\t\t\tthis._eol = e.eol;\r\n\t\t\tthis._lineStarts = null;\r\n\t\t}\r\n\r\n\t\t// Update my lines\r\n\t\tconst changes = e.changes;\r\n\t\tfor (const change of changes) {\r\n\t\t\tthis._acceptDeleteRange(change.range);\r\n\t\t\tthis._acceptInsertText(new Position(change.range.startLineNumber, change.range.startColumn), change.text);\r\n\t\t}\r\n\r\n\t\tthis._versionId = e.versionId;\r\n\t\tthis._cachedTextValue = null;\r\n\t}\r\n\r\n\tprotected _ensureLineStarts(): void {\r\n\t\tif (!this._lineStarts) {\r\n\t\t\tconst eolLength = this._eol.length;\r\n\t\t\tconst linesLength = this._lines.length;\r\n\t\t\tconst lineStartValues = new Uint32Array(linesLength);\r\n\t\t\tfor (let i = 0; i < linesLength; i++) {\r\n\t\t\t\tlineStartValues[i] = this._lines[i].length + eolLength;\r\n\t\t\t}\r\n\t\t\tthis._lineStarts = new PrefixSumComputer(lineStartValues);\r\n\t\t}\r\n\t}\r\n\r\n\t/**\r\n\t * All changes to a line's text go through this method\r\n\t */\r\n\tprivate _setLineText(lineIndex: number, newValue: string): void {\r\n\t\tthis._lines[lineIndex] = newValue;\r\n\t\tif (this._lineStarts) {\r\n\t\t\t// update prefix sum\r\n\t\t\tthis._lineStarts.changeValue(lineIndex, this._lines[lineIndex].length + this._eol.length);\r\n\t\t}\r\n\t}\r\n\r\n\tprivate _acceptDeleteRange(range: IRange): void {\r\n\r\n\t\tif (range.startLineNumber === range.endLineNumber) {\r\n\t\t\tif (range.startColumn === range.endColumn) {\r\n\t\t\t\t// Nothing to delete\r\n\t\t\t\treturn;\r\n\t\t\t}\r\n\t\t\t// Delete text on the affected line\r\n\t\t\tthis._setLineText(range.startLineNumber - 1,\r\n\t\t\t\tthis._lines[range.startLineNumber - 1].substring(0, range.startColumn - 1)\r\n\t\t\t\t+ this._lines[range.startLineNumber - 1].substring(range.endColumn - 1)\r\n\t\t\t);\r\n\t\t\treturn;\r\n\t\t}\r\n\r\n\t\t// Take remaining text on last line and append it to remaining text on first line\r\n\t\tthis._setLineText(range.startLineNumber - 1,\r\n\t\t\tthis._lines[range.startLineNumber - 1].substring(0, range.startColumn - 1)\r\n\t\t\t+ this._lines[range.endLineNumber - 1].substring(range.endColumn - 1)\r\n\t\t);\r\n\r\n\t\t// Delete middle lines\r\n\t\tthis._lines.splice(range.startLineNumber, range.endLineNumber - range.startLineNumber);\r\n\t\tif (this._lineStarts) {\r\n\t\t\t// update prefix sum\r\n\t\t\tthis._lineStarts.removeValues(range.startLineNumber, range.endLineNumber - range.startLineNumber);\r\n\t\t}\r\n\t}\r\n\r\n\tprivate _acceptInsertText(position: Position, insertText: string): void {\r\n\t\tif (insertText.length === 0) {\r\n\t\t\t// Nothing to insert\r\n\t\t\treturn;\r\n\t\t}\r\n\t\tlet insertLines = insertText.split(/\\r\\n|\\r|\\n/);\r\n\t\tif (insertLines.length === 1) {\r\n\t\t\t// Inserting text on one line\r\n\t\t\tthis._setLineText(position.lineNumber - 1,\r\n\t\t\t\tthis._lines[position.lineNumber - 1].substring(0, position.column - 1)\r\n\t\t\t\t+ insertLines[0]\r\n\t\t\t\t+ this._lines[position.lineNumber - 1].substring(position.column - 1)\r\n\t\t\t);\r\n\t\t\treturn;\r\n\t\t}\r\n\r\n\t\t// Append overflowing text from first line to the end of text to insert\r\n\t\tinsertLines[insertLines.length - 1] += this._lines[position.lineNumber - 1].substring(position.column - 1);\r\n\r\n\t\t// Delete overflowing text from first line and insert text on first line\r\n\t\tthis._setLineText(position.lineNumber - 1,\r\n\t\t\tthis._lines[position.lineNumber - 1].substring(0, position.column - 1)\r\n\t\t\t+ insertLines[0]\r\n\t\t);\r\n\r\n\t\t// Insert new lines & store lengths\r\n\t\tlet newLengths = new Uint32Array(insertLines.length - 1);\r\n\t\tfor (let i = 1; i < insertLines.length; i++) {\r\n\t\t\tthis._lines.splice(position.lineNumber + i - 1, 0, insertLines[i]);\r\n\t\t\tnewLengths[i - 1] = insertLines[i].length + this._eol.length;\r\n\t\t}\r\n\r\n\t\tif (this._lineStarts) {\r\n\t\t\t// update prefix sum\r\n\t\t\tthis._lineStarts.insertValues(position.lineNumber, newLengths);\r\n\t\t}\r\n\t}\r\n}\r\n","/*---------------------------------------------------------------------------------------------\r\n * Copyright (c) Microsoft Corporation. All rights reserved.\r\n * Licensed under the MIT License. See License.txt in the project root for license information.\r\n *--------------------------------------------------------------------------------------------*/\r\n\r\nimport { mergeSort } from 'vs/base/common/arrays';\r\nimport { stringDiff } from 'vs/base/common/diff/diff';\r\nimport { IDisposable } from 'vs/base/common/lifecycle';\r\nimport { globals } from 'vs/base/common/platform';\r\nimport { URI } from 'vs/base/common/uri';\r\nimport { IRequestHandler } from 'vs/base/common/worker/simpleWorker';\r\nimport { IPosition, Position } from 'vs/editor/common/core/position';\r\nimport { IRange, Range } from 'vs/editor/common/core/range';\r\nimport { DiffComputer } from 'vs/editor/common/diff/diffComputer';\r\nimport { EndOfLineSequence, IWordAtPosition } from 'vs/editor/common/model';\r\nimport { IModelChangedEvent, MirrorTextModel as BaseMirrorModel } from 'vs/editor/common/model/mirrorTextModel';\r\nimport { ensureValidWordDefinition, getWordAtText } from 'vs/editor/common/model/wordHelper';\r\nimport { IInplaceReplaceSupportResult, ILink, TextEdit } from 'vs/editor/common/modes';\r\nimport { ILinkComputerTarget, computeLinks } from 'vs/editor/common/modes/linkComputer';\r\nimport { BasicInplaceReplace } from 'vs/editor/common/modes/supports/inplaceReplaceSupport';\r\nimport { IDiffComputationResult } from 'vs/editor/common/services/editorWorkerService';\r\nimport { createMonacoBaseAPI } from 'vs/editor/common/standalone/standaloneBase';\r\nimport * as types from 'vs/base/common/types';\r\nimport { EditorWorkerHost } from 'vs/editor/common/services/editorWorkerServiceImpl';\r\n\r\nexport interface IMirrorModel {\r\n\treadonly uri: URI;\r\n\treadonly version: number;\r\n\tgetValue(): string;\r\n}\r\n\r\nexport interface IWorkerContext<H = undefined> {\r\n\t/**\r\n\t * A proxy to the main thread host object.\r\n\t */\r\n\thost: H;\r\n\t/**\r\n\t * Get all available mirror models in this worker.\r\n\t */\r\n\tgetMirrorModels(): IMirrorModel[];\r\n}\r\n\r\n/**\r\n * @internal\r\n */\r\nexport interface IRawModelData {\r\n\turl: string;\r\n\tversionId: number;\r\n\tlines: string[];\r\n\tEOL: string;\r\n}\r\n\r\n/**\r\n * @internal\r\n */\r\nexport interface ICommonModel extends ILinkComputerTarget, IMirrorModel {\r\n\teol: string;\r\n\r\n\tgetLinesContent(): string[];\r\n\tgetLineCount(): number;\r\n\tgetLineContent(lineNumber: number): string;\r\n\tgetLineWords(lineNumber: number, wordDefinition: RegExp): IWordAtPosition[];\r\n\twords(wordDefinition: RegExp): Iterable<string>;\r\n\tgetValueInRange(range: IRange): string;\r\n\tgetWordAtPosition(position: IPosition, wordDefinition: RegExp): Range | null;\r\n\toffsetAt(position: IPosition): number;\r\n\tpositionAt(offset: number): IPosition;\r\n}\r\n\r\n/**\r\n * Range of a word inside a model.\r\n * @internal\r\n */\r\ninterface IWordRange {\r\n\t/**\r\n\t * The index where the word starts.\r\n\t */\r\n\treadonly start: number;\r\n\t/**\r\n\t * The index where the word ends.\r\n\t */\r\n\treadonly end: number;\r\n}\r\n\r\n/**\r\n * @internal\r\n */\r\nclass MirrorModel extends BaseMirrorModel implements ICommonModel {\r\n\r\n\tpublic get uri(): URI {\r\n\t\treturn this._uri;\r\n\t}\r\n\r\n\tpublic get version(): number {\r\n\t\treturn this._versionId;\r\n\t}\r\n\r\n\tpublic get eol(): string {\r\n\t\treturn this._eol;\r\n\t}\r\n\r\n\tpublic getValue(): string {\r\n\t\treturn this.getText();\r\n\t}\r\n\r\n\tpublic getLinesContent(): string[] {\r\n\t\treturn this._lines.slice(0);\r\n\t}\r\n\r\n\tpublic getLineCount(): number {\r\n\t\treturn this._lines.length;\r\n\t}\r\n\r\n\tpublic getLineContent(lineNumber: number): string {\r\n\t\treturn this._lines[lineNumber - 1];\r\n\t}\r\n\r\n\tpublic getWordAtPosition(position: IPosition, wordDefinition: RegExp): Range | null {\r\n\r\n\t\tlet wordAtText = getWordAtText(\r\n\t\t\tposition.column,\r\n\t\t\tensureValidWordDefinition(wordDefinition),\r\n\t\t\tthis._lines[position.lineNumber - 1],\r\n\t\t\t0\r\n\t\t);\r\n\r\n\t\tif (wordAtText) {\r\n\t\t\treturn new Range(position.lineNumber, wordAtText.startColumn, position.lineNumber, wordAtText.endColumn);\r\n\t\t}\r\n\r\n\t\treturn null;\r\n\t}\r\n\r\n\r\n\tpublic words(wordDefinition: RegExp): Iterable<string> {\r\n\r\n\t\tconst lines = this._lines;\r\n\t\tconst wordenize = this._wordenize.bind(this);\r\n\r\n\t\tlet lineNumber = 0;\r\n\t\tlet lineText = '';\r\n\t\tlet wordRangesIdx = 0;\r\n\t\tlet wordRanges: IWordRange[] = [];\r\n\r\n\t\treturn {\r\n\t\t\t*[Symbol.iterator]() {\r\n\t\t\t\twhile (true) {\r\n\t\t\t\t\tif (wordRangesIdx < wordRanges.length) {\r\n\t\t\t\t\t\tconst value = lineText.substring(wordRanges[wordRangesIdx].start, wordRanges[wordRangesIdx].end);\r\n\t\t\t\t\t\twordRangesIdx += 1;\r\n\t\t\t\t\t\tyield value;\r\n\t\t\t\t\t} else {\r\n\t\t\t\t\t\tif (lineNumber < lines.length) {\r\n\t\t\t\t\t\t\tlineText = lines[lineNumber];\r\n\t\t\t\t\t\t\twordRanges = wordenize(lineText, wordDefinition);\r\n\t\t\t\t\t\t\twordRangesIdx = 0;\r\n\t\t\t\t\t\t\tlineNumber += 1;\r\n\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t};\r\n\t}\r\n\r\n\tpublic getLineWords(lineNumber: number, wordDefinition: RegExp): IWordAtPosition[] {\r\n\t\tlet content = this._lines[lineNumber - 1];\r\n\t\tlet ranges = this._wordenize(content, wordDefinition);\r\n\t\tlet words: IWordAtPosition[] = [];\r\n\t\tfor (const range of ranges) {\r\n\t\t\twords.push({\r\n\t\t\t\tword: content.substring(range.start, range.end),\r\n\t\t\t\tstartColumn: range.start + 1,\r\n\t\t\t\tendColumn: range.end + 1\r\n\t\t\t});\r\n\t\t}\r\n\t\treturn words;\r\n\t}\r\n\r\n\tprivate _wordenize(content: string, wordDefinition: RegExp): IWordRange[] {\r\n\t\tconst result: IWordRange[] = [];\r\n\t\tlet match: RegExpExecArray | null;\r\n\r\n\t\twordDefinition.lastIndex = 0; // reset lastIndex just to be sure\r\n\r\n\t\twhile (match = wordDefinition.exec(content)) {\r\n\t\t\tif (match[0].length === 0) {\r\n\t\t\t\t// it did match the empty string\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t\tresult.push({ start: match.index, end: match.index + match[0].length });\r\n\t\t}\r\n\t\treturn result;\r\n\t}\r\n\r\n\tpublic getValueInRange(range: IRange): string {\r\n\t\trange = this._validateRange(range);\r\n\r\n\t\tif (range.startLineNumber === range.endLineNumber) {\r\n\t\t\treturn this._lines[range.startLineNumber - 1].substring(range.startColumn - 1, range.endColumn - 1);\r\n\t\t}\r\n\r\n\t\tlet lineEnding = this._eol;\r\n\t\tlet startLineIndex = range.startLineNumber - 1;\r\n\t\tlet endLineIndex = range.endLineNumber - 1;\r\n\t\tlet resultLines: string[] = [];\r\n\r\n\t\tresultLines.push(this._lines[startLineIndex].substring(range.startColumn - 1));\r\n\t\tfor (let i = startLineIndex + 1; i < endLineIndex; i++) {\r\n\t\t\tresultLines.push(this._lines[i]);\r\n\t\t}\r\n\t\tresultLines.push(this._lines[endLineIndex].substring(0, range.endColumn - 1));\r\n\r\n\t\treturn resultLines.join(lineEnding);\r\n\t}\r\n\r\n\tpublic offsetAt(position: IPosition): number {\r\n\t\tposition = this._validatePosition(position);\r\n\t\tthis._ensureLineStarts();\r\n\t\treturn this._lineStarts!.getAccumulatedValue(position.lineNumber - 2) + (position.column - 1);\r\n\t}\r\n\r\n\tpublic positionAt(offset: number): IPosition {\r\n\t\toffset = Math.floor(offset);\r\n\t\toffset = Math.max(0, offset);\r\n\r\n\t\tthis._ensureLineStarts();\r\n\t\tlet out = this._lineStarts!.getIndexOf(offset);\r\n\t\tlet lineLength = this._lines[out.index].length;\r\n\r\n\t\t// Ensure we return a valid position\r\n\t\treturn {\r\n\t\t\tlineNumber: 1 + out.index,\r\n\t\t\tcolumn: 1 + Math.min(out.remainder, lineLength)\r\n\t\t};\r\n\t}\r\n\r\n\tprivate _validateRange(range: IRange): IRange {\r\n\r\n\t\tconst start = this._validatePosition({ lineNumber: range.startLineNumber, column: range.startColumn });\r\n\t\tconst end = this._validatePosition({ lineNumber: range.endLineNumber, column: range.endColumn });\r\n\r\n\t\tif (start.lineNumber !== range.startLineNumber\r\n\t\t\t|| start.column !== range.startColumn\r\n\t\t\t|| end.lineNumber !== range.endLineNumber\r\n\t\t\t|| end.column !== range.endColumn) {\r\n\r\n\t\t\treturn {\r\n\t\t\t\tstartLineNumber: start.lineNumber,\r\n\t\t\t\tstartColumn: start.column,\r\n\t\t\t\tendLineNumber: end.lineNumber,\r\n\t\t\t\tendColumn: end.column\r\n\t\t\t};\r\n\t\t}\r\n\r\n\t\treturn range;\r\n\t}\r\n\r\n\tprivate _validatePosition(position: IPosition): IPosition {\r\n\t\tif (!Position.isIPosition(position)) {\r\n\t\t\tthrow new Error('bad position');\r\n\t\t}\r\n\t\tlet { lineNumber, column } = position;\r\n\t\tlet hasChanged = false;\r\n\r\n\t\tif (lineNumber < 1) {\r\n\t\t\tlineNumber = 1;\r\n\t\t\tcolumn = 1;\r\n\t\t\thasChanged = true;\r\n\r\n\t\t} else if (lineNumber > this._lines.length) {\r\n\t\t\tlineNumber = this._lines.length;\r\n\t\t\tcolumn = this._lines[lineNumber - 1].length + 1;\r\n\t\t\thasChanged = true;\r\n\r\n\t\t} else {\r\n\t\t\tlet maxCharacter = this._lines[lineNumber - 1].length + 1;\r\n\t\t\tif (column < 1) {\r\n\t\t\t\tcolumn = 1;\r\n\t\t\t\thasChanged = true;\r\n\t\t\t}\r\n\t\t\telse if (column > maxCharacter) {\r\n\t\t\t\tcolumn = maxCharacter;\r\n\t\t\t\thasChanged = true;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tif (!hasChanged) {\r\n\t\t\treturn position;\r\n\t\t} else {\r\n\t\t\treturn { lineNumber, column };\r\n\t\t}\r\n\t}\r\n}\r\n\r\n/**\r\n * @internal\r\n */\r\nexport interface IForeignModuleFactory {\r\n\t(ctx: IWorkerContext, createData: any): any;\r\n}\r\n\r\ndeclare const require: any;\r\n\r\n/**\r\n * @internal\r\n */\r\nexport class EditorSimpleWorker implements IRequestHandler, IDisposable {\r\n\t_requestHandlerBrand: any;\r\n\r\n\tprivate readonly _host: EditorWorkerHost;\r\n\tprivate _models: { [uri: string]: MirrorModel; };\r\n\tprivate readonly _foreignModuleFactory: IForeignModuleFactory | null;\r\n\tprivate _foreignModule: any;\r\n\r\n\tconstructor(host: EditorWorkerHost, foreignModuleFactory: IForeignModuleFactory | null) {\r\n\t\tthis._host = host;\r\n\t\tthis._models = Object.create(null);\r\n\t\tthis._foreignModuleFactory = foreignModuleFactory;\r\n\t\tthis._foreignModule = null;\r\n\t}\r\n\r\n\tpublic dispose(): void {\r\n\t\tthis._models = Object.create(null);\r\n\t}\r\n\r\n\tprotected _getModel(uri: string): ICommonModel {\r\n\t\treturn this._models[uri];\r\n\t}\r\n\r\n\tprivate _getModels(): ICommonModel[] {\r\n\t\tlet all: MirrorModel[] = [];\r\n\t\tObject.keys(this._models).forEach((key) => all.push(this._models[key]));\r\n\t\treturn all;\r\n\t}\r\n\r\n\tpublic acceptNewModel(data: IRawModelData): void {\r\n\t\tthis._models[data.url] = new MirrorModel(URI.parse(data.url), data.lines, data.EOL, data.versionId);\r\n\t}\r\n\r\n\tpublic acceptModelChanged(strURL: string, e: IModelChangedEvent): void {\r\n\t\tif (!this._models[strURL]) {\r\n\t\t\treturn;\r\n\t\t}\r\n\t\tlet model = this._models[strURL];\r\n\t\tmodel.onEvents(e);\r\n\t}\r\n\r\n\tpublic acceptRemovedModel(strURL: string): void {\r\n\t\tif (!this._models[strURL]) {\r\n\t\t\treturn;\r\n\t\t}\r\n\t\tdelete this._models[strURL];\r\n\t}\r\n\r\n\t// ---- BEGIN diff --------------------------------------------------------------------------\r\n\r\n\tpublic async computeDiff(originalUrl: string, modifiedUrl: string, ignoreTrimWhitespace: boolean, maxComputationTime: number): Promise<IDiffComputationResult | null> {\r\n\t\tconst original = this._getModel(originalUrl);\r\n\t\tconst modified = this._getModel(modifiedUrl);\r\n\t\tif (!original || !modified) {\r\n\t\t\treturn null;\r\n\t\t}\r\n\r\n\t\tconst originalLines = original.getLinesContent();\r\n\t\tconst modifiedLines = modified.getLinesContent();\r\n\t\tconst diffComputer = new DiffComputer(originalLines, modifiedLines, {\r\n\t\t\tshouldComputeCharChanges: true,\r\n\t\t\tshouldPostProcessCharChanges: true,\r\n\t\t\tshouldIgnoreTrimWhitespace: ignoreTrimWhitespace,\r\n\t\t\tshouldMakePrettyDiff: true,\r\n\t\t\tmaxComputationTime: maxComputationTime\r\n\t\t});\r\n\r\n\t\tconst diffResult = diffComputer.computeDiff();\r\n\t\tconst identical = (diffResult.changes.length > 0 ? false : this._modelsAreIdentical(original, modified));\r\n\t\treturn {\r\n\t\t\tquitEarly: diffResult.quitEarly,\r\n\t\t\tidentical: identical,\r\n\t\t\tchanges: diffResult.changes\r\n\t\t};\r\n\t}\r\n\r\n\tprivate _modelsAreIdentical(original: ICommonModel, modified: ICommonModel): boolean {\r\n\t\tconst originalLineCount = original.getLineCount();\r\n\t\tconst modifiedLineCount = modified.getLineCount();\r\n\t\tif (originalLineCount !== modifiedLineCount) {\r\n\t\t\treturn false;\r\n\t\t}\r\n\t\tfor (let line = 1; line <= originalLineCount; line++) {\r\n\t\t\tconst originalLine = original.getLineContent(line);\r\n\t\t\tconst modifiedLine = modified.getLineContent(line);\r\n\t\t\tif (originalLine !== modifiedLine) {\r\n\t\t\t\treturn false;\r\n\t\t\t}\r\n\t\t}\r\n\t\treturn true;\r\n\t}\r\n\r\n\t// ---- END diff --------------------------------------------------------------------------\r\n\r\n\r\n\t// ---- BEGIN minimal edits ---------------------------------------------------------------\r\n\r\n\tprivate static readonly _diffLimit = 100000;\r\n\r\n\tpublic async computeMoreMinimalEdits(modelUrl: string, edits: TextEdit[]): Promise<TextEdit[]> {\r\n\t\tconst model = this._getModel(modelUrl);\r\n\t\tif (!model) {\r\n\t\t\treturn edits;\r\n\t\t}\r\n\r\n\t\tconst result: TextEdit[] = [];\r\n\t\tlet lastEol: EndOfLineSequence | undefined = undefined;\r\n\r\n\t\tedits = mergeSort(edits, (a, b) => {\r\n\t\t\tif (a.range && b.range) {\r\n\t\t\t\treturn Range.compareRangesUsingStarts(a.range, b.range);\r\n\t\t\t}\r\n\t\t\t// eol only changes should go to the end\r\n\t\t\tlet aRng = a.range ? 0 : 1;\r\n\t\t\tlet bRng = b.range ? 0 : 1;\r\n\t\t\treturn aRng - bRng;\r\n\t\t});\r\n\r\n\t\tfor (let { range, text, eol } of edits) {\r\n\r\n\t\t\tif (typeof eol === 'number') {\r\n\t\t\t\tlastEol = eol;\r\n\t\t\t}\r\n\r\n\t\t\tif (Range.isEmpty(range) && !text) {\r\n\t\t\t\t// empty change\r\n\t\t\t\tcontinue;\r\n\t\t\t}\r\n\r\n\t\t\tconst original = model.getValueInRange(range);\r\n\t\t\ttext = text.replace(/\\r\\n|\\n|\\r/g, model.eol);\r\n\r\n\t\t\tif (original === text) {\r\n\t\t\t\t// noop\r\n\t\t\t\tcontinue;\r\n\t\t\t}\r\n\r\n\t\t\t// make sure diff won't take too long\r\n\t\t\tif (Math.max(text.length, original.length) > EditorSimpleWorker._diffLimit) {\r\n\t\t\t\tresult.push({ range, text });\r\n\t\t\t\tcontinue;\r\n\t\t\t}\r\n\r\n\t\t\t// compute diff between original and edit.text\r\n\t\t\tconst changes = stringDiff(original, text, false);\r\n\t\t\tconst editOffset = model.offsetAt(Range.lift(range).getStartPosition());\r\n\r\n\t\t\tfor (const change of changes) {\r\n\t\t\t\tconst start = model.positionAt(editOffset + change.originalStart);\r\n\t\t\t\tconst end = model.positionAt(editOffset + change.originalStart + change.originalLength);\r\n\t\t\t\tconst newEdit: TextEdit = {\r\n\t\t\t\t\ttext: text.substr(change.modifiedStart, change.modifiedLength),\r\n\t\t\t\t\trange: { startLineNumber: start.lineNumber, startColumn: start.column, endLineNumber: end.lineNumber, endColumn: end.column }\r\n\t\t\t\t};\r\n\r\n\t\t\t\tif (model.getValueInRange(newEdit.range) !== newEdit.text) {\r\n\t\t\t\t\tresult.push(newEdit);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tif (typeof lastEol === 'number') {\r\n\t\t\tresult.push({ eol: lastEol, text: '', range: { startLineNumber: 0, startColumn: 0, endLineNumber: 0, endColumn: 0 } });\r\n\t\t}\r\n\r\n\t\treturn result;\r\n\t}\r\n\r\n\t// ---- END minimal edits ---------------------------------------------------------------\r\n\r\n\tpublic async computeLinks(modelUrl: string): Promise<ILink[] | null> {\r\n\t\tlet model = this._getModel(modelUrl);\r\n\t\tif (!model) {\r\n\t\t\treturn null;\r\n\t\t}\r\n\r\n\t\treturn computeLinks(model);\r\n\t}\r\n\r\n\t// ---- BEGIN suggest --------------------------------------------------------------------------\r\n\r\n\tprivate static readonly _suggestionsLimit = 10000;\r\n\r\n\tpublic async textualSuggest(modelUrl: string, position: IPosition, wordDef: string, wordDefFlags: string): Promise<string[] | null> {\r\n\t\tconst model = this._getModel(modelUrl);\r\n\t\tif (!model) {\r\n\t\t\treturn null;\r\n\t\t}\r\n\r\n\r\n\t\tconst words: string[] = [];\r\n\t\tconst seen = new Set<string>();\r\n\t\tconst wordDefRegExp = new RegExp(wordDef, wordDefFlags);\r\n\r\n\t\tconst wordAt = model.getWordAtPosition(position, wordDefRegExp);\r\n\t\tif (wordAt) {\r\n\t\t\tseen.add(model.getValueInRange(wordAt));\r\n\t\t}\r\n\r\n\t\tfor (let word of model.words(wordDefRegExp)) {\r\n\t\t\tif (seen.has(word)) {\r\n\t\t\t\tcontinue;\r\n\t\t\t}\r\n\t\t\tseen.add(word);\r\n\t\t\tif (!isNaN(Number(word))) {\r\n\t\t\t\tcontinue;\r\n\t\t\t}\r\n\t\t\twords.push(word);\r\n\t\t\tif (seen.size > EditorSimpleWorker._suggestionsLimit) {\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t}\r\n\t\treturn words;\r\n\t}\r\n\r\n\r\n\t// ---- END suggest --------------------------------------------------------------------------\r\n\r\n\t//#region -- word ranges --\r\n\r\n\tpublic async computeWordRanges(modelUrl: string, range: IRange, wordDef: string, wordDefFlags: string): Promise<{ [word: string]: IRange[] }> {\r\n\t\tlet model = this._getModel(modelUrl);\r\n\t\tif (!model) {\r\n\t\t\treturn Object.create(null);\r\n\t\t}\r\n\t\tconst wordDefRegExp = new RegExp(wordDef, wordDefFlags);\r\n\t\tconst result: { [word: string]: IRange[] } = Object.create(null);\r\n\t\tfor (let line = range.startLineNumber; line < range.endLineNumber; line++) {\r\n\t\t\tlet words = model.getLineWords(line, wordDefRegExp);\r\n\t\t\tfor (const word of words) {\r\n\t\t\t\tif (!isNaN(Number(word.word))) {\r\n\t\t\t\t\tcontinue;\r\n\t\t\t\t}\r\n\t\t\t\tlet array = result[word.word];\r\n\t\t\t\tif (!array) {\r\n\t\t\t\t\tarray = [];\r\n\t\t\t\t\tresult[word.word] = array;\r\n\t\t\t\t}\r\n\t\t\t\tarray.push({\r\n\t\t\t\t\tstartLineNumber: line,\r\n\t\t\t\t\tstartColumn: word.startColumn,\r\n\t\t\t\t\tendLineNumber: line,\r\n\t\t\t\t\tendColumn: word.endColumn\r\n\t\t\t\t});\r\n\t\t\t}\r\n\t\t}\r\n\t\treturn result;\r\n\t}\r\n\r\n\t//#endregion\r\n\r\n\tpublic async navigateValueSet(modelUrl: string, range: IRange, up: boolean, wordDef: string, wordDefFlags: string): Promise<IInplaceReplaceSupportResult | null> {\r\n\t\tlet model = this._getModel(modelUrl);\r\n\t\tif (!model) {\r\n\t\t\treturn null;\r\n\t\t}\r\n\r\n\t\tlet wordDefRegExp = new RegExp(wordDef, wordDefFlags);\r\n\r\n\t\tif (range.startColumn === range.endColumn) {\r\n\t\t\trange = {\r\n\t\t\t\tstartLineNumber: range.startLineNumber,\r\n\t\t\t\tstartColumn: range.startColumn,\r\n\t\t\t\tendLineNumber: range.endLineNumber,\r\n\t\t\t\tendColumn: range.endColumn + 1\r\n\t\t\t};\r\n\t\t}\r\n\r\n\t\tlet selectionText = model.getValueInRange(range);\r\n\r\n\t\tlet wordRange = model.getWordAtPosition({ lineNumber: range.startLineNumber, column: range.startColumn }, wordDefRegExp);\r\n\t\tif (!wordRange) {\r\n\t\t\treturn null;\r\n\t\t}\r\n\t\tlet word = model.getValueInRange(wordRange);\r\n\t\tlet result = BasicInplaceReplace.INSTANCE.navigateValueSet(range, selectionText, wordRange, word, up);\r\n\t\treturn result;\r\n\t}\r\n\r\n\t// ---- BEGIN foreign module support --------------------------------------------------------------------------\r\n\r\n\tpublic loadForeignModule(moduleId: string, createData: any, foreignHostMethods: string[]): Promise<string[]> {\r\n\t\tconst proxyMethodRequest = (method: string, args: any[]): Promise<any> => {\r\n\t\t\treturn this._host.fhr(method, args);\r\n\t\t};\r\n\r\n\t\tconst foreignHost = types.createProxyObject(foreignHostMethods, proxyMethodRequest);\r\n\r\n\t\tlet ctx: IWorkerContext<any> = {\r\n\t\t\thost: foreignHost,\r\n\t\t\tgetMirrorModels: (): IMirrorModel[] => {\r\n\t\t\t\treturn this._getModels();\r\n\t\t\t}\r\n\t\t};\r\n\r\n\t\tif (this._foreignModuleFactory) {\r\n\t\t\tthis._foreignModule = this._foreignModuleFactory(ctx, createData);\r\n\t\t\t// static foreing module\r\n\t\t\treturn Promise.resolve(types.getAllMethodNames(this._foreignModule));\r\n\t\t}\r\n\t\t// ESM-comment-begin\r\n\t\treturn new Promise<any>((resolve, reject) => {\r\n\t\t\trequire([moduleId], (foreignModule: { create: IForeignModuleFactory }) => {\r\n\t\t\t\tthis._foreignModule = foreignModule.create(ctx, createData);\r\n\r\n\t\t\t\tresolve(types.getAllMethodNames(this._foreignModule));\r\n\r\n\t\t\t}, reject);\r\n\t\t});\r\n\t\t// ESM-comment-end\r\n\r\n\t\t// ESM-uncomment-begin\r\n\t\t// return Promise.reject(new Error(`Unexpected usage`));\r\n\t\t// ESM-uncomment-end\r\n\t}\r\n\r\n\t// foreign method request\r\n\tpublic fmr(method: string, args: any[]): Promise<any> {\r\n\t\tif (!this._foreignModule || typeof this._foreignModule[method] !== 'function') {\r\n\t\t\treturn Promise.reject(new Error('Missing requestHandler or method: ' + method));\r\n\t\t}\r\n\r\n\t\ttry {\r\n\t\t\treturn Promise.resolve(this._foreignModule[method].apply(this._foreignModule, args));\r\n\t\t} catch (e) {\r\n\t\t\treturn Promise.reject(e);\r\n\t\t}\r\n\t}\r\n\r\n\t// ---- END foreign module support --------------------------------------------------------------------------\r\n}\r\n\r\n/**\r\n * Called on the worker side\r\n * @internal\r\n */\r\nexport function create(host: EditorWorkerHost): IRequestHandler {\r\n\treturn new EditorSimpleWorker(host, null);\r\n}\r\n\r\n// This is only available in a Web Worker\r\ndeclare function importScripts(...urls: string[]): void;\r\n\r\nif (typeof importScripts === 'function') {\r\n\t// Running in a web worker\r\n\tglobals.monaco = createMonacoBaseAPI();\r\n}\r\n","/*---------------------------------------------------------------------------------------------\r\n * Copyright (c) Microsoft Corporation. All rights reserved.\r\n * Licensed under the MIT License. See License.txt in the project root for license information.\r\n *--------------------------------------------------------------------------------------------*/\r\n\r\n(function () {\r\n\r\n\tlet MonacoEnvironment = (<any>self).MonacoEnvironment;\r\n\tlet monacoBaseUrl = MonacoEnvironment && MonacoEnvironment.baseUrl ? MonacoEnvironment.baseUrl : '../../../';\r\n\r\n\tif (typeof (<any>self).define !== 'function' || !(<any>self).define.amd) {\r\n\t\timportScripts(monacoBaseUrl + 'vs/loader.js');\r\n\t}\r\n\r\n\trequire.config({\r\n\t\tbaseUrl: monacoBaseUrl,\r\n\t\tcatchError: true\r\n\t});\r\n\r\n\tlet loadCode = function (moduleId: string) {\r\n\t\trequire([moduleId], function (ws) {\r\n\t\t\tsetTimeout(function () {\r\n\t\t\t\tlet messageHandler = ws.create((msg: any, transfer?: Transferable[]) => {\r\n\t\t\t\t\t(<any>self).postMessage(msg, transfer);\r\n\t\t\t\t}, null);\r\n\r\n\t\t\t\tself.onmessage = (e: MessageEvent) => messageHandler.onmessage(e.data);\r\n\t\t\t\twhile (beforeReadyMessages.length > 0) {\r\n\t\t\t\t\tself.onmessage(beforeReadyMessages.shift()!);\r\n\t\t\t\t}\r\n\t\t\t}, 0);\r\n\t\t});\r\n\t};\r\n\r\n\tlet isFirstMessage = true;\r\n\tlet beforeReadyMessages: MessageEvent[] = [];\r\n\tself.onmessage = (message: MessageEvent) => {\r\n\t\tif (!isFirstMessage) {\r\n\t\t\tbeforeReadyMessages.push(message);\r\n\t\t\treturn;\r\n\t\t}\r\n\r\n\t\tisFirstMessage = false;\r\n\t\tloadCode(message.data);\r\n\t};\r\n})();\r\n"]}