1 {"version":3,"sources":["webpack:///./node_modules/marked/src/TextRenderer.js","webpack:///./node_modules/w3c-keyname/index.es.js","webpack:///./node_modules/prosemirror-keymap/dist/index.js","webpack:///./node_modules/marked/src/marked.js","webpack:///./node_modules/marked/src/Parser.js","webpack:///./node_modules/prosemirror-tables/dist/index.js","webpack:///./node_modules/prosemirror-collab/dist/index.js","webpack:///./node_modules/rope-sequence/dist/index.es.js","webpack:///./node_modules/prosemirror-history/dist/index.js","webpack:///./node_modules/tiptap-extensions/dist/extensions.esm.js","webpack:///./node_modules/fault/index.js","webpack:///./node_modules/highlight.js/lib/core.js","webpack:///./node_modules/marked/src/Slugger.js","webpack:///./node_modules/orderedmap/dist/index-es.js","webpack:///./node_modules/prosemirror-model/dist/index.es.js","webpack:///./node_modules/lowlight/lib/core.js","webpack:///./node_modules/prosemirror-commands/dist/index.js","webpack:///./node_modules/marked/src/Renderer.js","webpack:///./node_modules/marked/src/Lexer.js","webpack:///./node_modules/format/format.js","webpack:///./node_modules/prosemirror-state/dist/index.js","webpack:///./node_modules/prosemirror-view/dist/index.js","webpack:///./node_modules/prosemirror-inputrules/dist/index.js","webpack:///./node_modules/marked/src/rules.js","webpack:///./node_modules/marked/src/InlineLexer.js","webpack:///./node_modules/tiptap-utils/dist/utils.esm.js","webpack:///./node_modules/prosemirror-schema-list/dist/index.js","webpack:///./node_modules/tiptap-commands/dist/commands.esm.js","webpack:///./node_modules/marked/src/helpers.js","webpack:///./node_modules/prosemirror-transform/dist/index.js","webpack:///./node_modules/marked/src/defaults.js","webpack:///./node_modules/prosemirror-dropcursor/dist/index.js","webpack:///./node_modules/prosemirror-gapcursor/dist/index.js","webpack:///./node_modules/tiptap/dist/tiptap.esm.js"],"names":["module","exports","[object Object]","text","href","title","base","8","9","10","12","13","16","17","18","20","27","32","33","34","35","36","37","38","39","40","44","45","46","59","61","91","92","106","107","108","109","110","111","144","145","160","161","162","163","164","165","173","186","187","188","189","190","191","192","219","220","221","222","shift","48","49","50","51","52","53","54","55","56","57","chrome","navigator","exec","userAgent","mac","test","platform","ie","brokenModifierNames","i","String","fromCharCode","code","hasOwnProperty","dist_mac","normalizeKeyName","name","alt","ctrl","meta","parts","split","result","length","mod","Error","modifiers","event","altKey","ctrlKey","metaKey","shiftKey","keymap","bindings","dist","props","handleKeyDown","keydownHandler","map","copy","Object","create","prop","normalize","view","baseName","key","keyCode","keyName","isChar","direct","state","dispatch","charCodeAt","fromCode","withShift","Lexer","__webpack_require__","Parser","Renderer","TextRenderer","InlineLexer","Slugger","merge","checkSanitizeDeprecation","escape","getDefaults","changeDefaults","defaults","marked","src","opt","callback","prototype","toString","call","highlight","tokens","pending","lex","e","done","err","out","parse","token","type","lang","escaped","message","silent","options","setOptions","parser","lexer","inlineLexer","output","unescape","this","renderer","slugger","inline","links","inlineText","reverse","next","tok","pop","body","peek","hr","heading","depth","row","cell","j","header","tablecell","align","tablerow","cells","table","blockquote","ordered","start","list","loose","checked","task","nextToken","checkbox","push","parseText","listitem","html","paragraph","errMsg","console","log","readFromCache","addToCache","WeakMap","cache","get","value","set","cacheSize","cachePos","Rect","left","top","right","bottom","TableMap","width","height","problems","pos","curPos","RangeError","axis","dir","findCell","a","b","leftA","rightA","topA","bottomA","leftB","rightB","topB","bottomB","Math","min","max","rect","seen","col","index","rowStart","rowEnd","child","nodeSize","rowEndIndex","spec","tableRole","hasRowSpan","childCount","rowNode","rowWidth","prevRow","attrs","rowspan","colspan","findWidth","mapPos","colWidths","cellNode","colwidth","h","n","w","colW","widthIndex","prev","expectedPos","missing","tableMap","badWidths","node","nodeAt","updated","colWidth","freshColWidth","unshift","findBadColWidths","computeMap","slice","getCellAttrs","dom","extraAttrs","widthAttr","getAttribute","widths","s","Number","getter","getFromDOM","setCellAttrs","join","setter","setDOMAttr","tableNodeTypes","schema","cached","nodes","role","prosemirror_state_dist","cellAround","$pos","d","resolve","before","isInTable","$head","selection","selectionCell","sel","$anchorCell","$headCell","$anchor","after","nodeAfter","firstChild","doc","nodeBefore","lastChild","cellNear","pointsAtCell","parent","inSameTable","$a","$b","end","nextCell","moved","setAttr","removeColSpan","splice","some","dist_CellSelection","rectBetween","cellsInRect","filter","p","ranges","from","content","size","super","$from","$to","mapping","tableChanged","isRowSelection","rowSelection","isColSelection","colSelection","between","rows","rowContent","cellRect","extraLeft","extraRight","createAndFill","index_es","fragment","tr","empty","mapFrom","steps","replace","findFrom","to","setSelection","f","anchorTop","headTop","anchorBot","headBot","anchorRect","headRect","anchorLeft","colCount","headLeft","anchorRight","headRight","other","anchor","head","json","anchorCell","headCell","dist_CellBookmark","visible","jsonID","near","prosemirror_keymap_dist","ArrowLeft","arrow","ArrowRight","ArrowUp","ArrowDown","Shift-ArrowLeft","shiftArrow","Shift-ArrowRight","Shift-ArrowUp","Shift-ArrowDown","Backspace","deleteCellSelection","Mod-Backspace","Delete","Mod-Delete","maybeSetSelection","eq","scrollIntoView","atEndOfCell","newSel","$cell","$next","baseContent","forEachCell","docChanged","indexAfter","cellPos","dirStr","endOfTextblock","selectedRect","tableStart","isHeaderEnabledByType","types","cellPositions","header_cell","toggleHeader","useDeprecatedLogic","setNodeMarkup","deprecated_toggleHeader","isHeaderRowEnabled","isHeaderColumnEnabled","selectionStartsAt","cellsRect","newType","forEach","relativeCellPos","RopeSequence","append","leafAppend","leafPrepend","appendInner","prepend","Append","sliceInner","getInner","forEachInner","forEachInvertedInner","elt","values","Leaf","__proto__","constructor","prototypeAccessors","configurable","flatten","concat","defineProperties","leftLen","inner","dist_index_es","max_empty_items","dist_Branch","items","eventCount","preserveItems","remap","remapping","maps","remaining","transform","addAfter","addBefore","item","step","Item","maybeStep","undefined","appendMap","histOptions","newItems","oldItems","lastItem","merged","invert","docs","overflow","DEPTH_OVERFLOW","cutPoint","cutOffEvents","prosemirror_transform_dist","mirrorPos","mirrorOffset","array","rebasedTransform","rebasedCount","rebasedItems","newUntil","iRebased","getMirror","newMaps","branch","emptyItemCount","compress","count","upto","events","getMap","newItem","last","HistoryState","undone","prevRanges","prevTime","rangesFor","_from","_to","mapRanges","histTransaction","history","redo","mustPreserveItems","historyKey","config","popEvent","added","addTransform","getBookmark","newHist","setMeta","historyState","cachedPreserveItems","cachedPreserveItemsPlugins","plugins","historyPreserveItems","closeHistoryKey","dist_history","newGroupDelay","init","apply","hist","rebased","historyTr","getMeta","appended","addMaps","newGroup","time","adjacent","isAdjacentTo","applyTransaction","handleDOMEvents","inputType","command","undo","preventDefault","getState","extensions_esm_Blockquote","tiptap_esm","group","defining","draggable","parseDOM","tag","toDOM","commands_esm","Ctrl->","extensions_esm_BulletList","list_item","Shift-Ctrl-8","extensions_esm_CodeBlock","marks","preserveWhitespace","Shift-Ctrl-\\","extensions_esm_Heading","defaultOptions","levels","level","default","reduce","RegExp","extensions_esm_HorizontalRule","replaceSelectionWith","extensions_esm_ListItem","Enter","Tab","Shift-Tab","extensions_esm_OrderedList","order","getAttrs","hasAttribute","Shift-Ctrl-9","match","cellAttributes","cellAttrs","tableGroup","cellContent","tableNodes","background","style","backgroundColor","assign","extensions_esm_Bold","fontWeight","Mod-b","extensions_esm_Italic","Mod-i","extensions_esm_Link","openOnClick","target","inclusive","rel","url","handleClick","utils_esm","link","HTMLAnchorElement","stopPropagation","window","open","extensions_esm_Underline","Mod-u","extensions_esm_History","Mod-z","Mod-y","Shift-Mod-z","Mod-я","Shift-Mod-я","undoDepth","redoDepth","formatter","fault","EConstructor","FormattedError","displayName","format","arguments","eval","EvalError","range","reference","ReferenceError","syntax","SyntaxError","TypeError","uri","URIError","deepFreeze","obj","Map","clear","delete","Set","add","freeze","getOwnPropertyNames","isFrozen","deepFreezeEs6","_default","Response","mode","data","isMatchIgnored","escapeHTML","inherit","original","objects","SPAN_CLOSE","emitsWrappingTags","kind","HTMLRenderer","parseTree","buffer","classPrefix","walk","className","sublanguage","span","TokenTree","rootNode","children","stack","root","closeNode","JSON","stringify","builder","_walk","addText","openNode","every","el","_collapse","TokenTreeEmitter","emitter","source","re","BACKREF_RE","C_NUMBER_RE","BACKSLASH_ESCAPE","begin","relevance","APOS_STRING_MODE","illegal","contains","QUOTE_STRING_MODE","PHRASAL_WORDS_MODE","COMMENT","modeOptions","C_LINE_COMMENT_MODE","C_BLOCK_COMMENT_MODE","HASH_COMMENT_MODE","NUMBER_MODE","C_NUMBER_MODE","BINARY_NUMBER_MODE","CSS_NUMBER_MODE","NUMBER_RE","REGEXP_MODE","TITLE_MODE","UNDERSCORE_TITLE_MODE","METHOD_GUARD","MODES","MATCH_NOTHING_RE","IDENT_RE","UNDERSCORE_IDENT_RE","BINARY_NUMBER_RE","RE_STARTERS_RE","SHEBANG","opts","beginShebang","binary","args","x","on:begin","m","resp","ignoreMatch","END_SAME_AS_BEGIN","_beginMatch","on:end","skipIfhasPrecedingDot","response","input","compileIllegal","_parent","Array","isArray","either","COMMON_KEYWORDS","DEFAULT_KEYWORD_CLASSNAME","compileKeywords","rawKeywords","caseInsensitive","compiledKeywords","compileList","keys","keywordList","toLowerCase","keyword","pair","providedScore","includes","commonKeyword","scoreForKeyword","compileLanguage","language","langRe","global","case_insensitive","MultiRegex","matchIndexes","regexes","matchAt","position","countMatchGroups","terminators","matcherRe","regexps","separator","numCaptures","regex","offset","substring","lastIndex","findIndex","matchData","ResumableMultiRegex","rules","multiRegexes","regexIndex","matcher","addRule","compile","getMatcher","resumingScanAtSamePosition","m2","considerAll","compilerExtensions","classNameAliases","compileMode","cmode","isCompiled","ext","__beforeBegin","beginKeywords","keywords","keywordPattern","$pattern","lexemes","keywordPatternRe","beginRe","endSameAsBegin","endsWithParent","endRe","terminatorEnd","illegalRe","c","variants","cachedVariants","variant","dependencyOnParent","starts","expandOrCloneMode","mm","term","rule","buildModeRegex","BuildVuePlugin","hljs","Component","detectedLanguage","unknownLanguage","computed","autoDetect","getLanguage","warn","highlightAuto","ignoreIllegals","Boolean","hasValueOrEmptyAttribute","autodetect","createElement","class","domProps","innerHTML","highlighted","VuePlugin","Vue","component","mergeHTMLPlugin","after:highlightElement","originalStream","nodeStream","resultNode","document","processed","nodeStack","selectStream","attributes","attr","nodeName","close","render","stream","substr","mergeStreams","_nodeStream","nextSibling","nodeType","nodeValue","seenDeprecations","error","deprecated","version","escape$1","inherit$1","NO_MATCH","Symbol","languages","aliases","SAFE_MODE","fixMarkupRe","LANGUAGE_NOT_FOUND","PLAINTEXT_LANGUAGE","disableAutodetect","noHighlightRe","languageDetectRe","tabReplace","useBR","__emitter","shouldNotHighlight","languageName","codeOrlanguageName","optionsOrCode","continuation","context","fire","_highlight","codeToHighlight","keywordData","matchText","processBuffer","subLanguage","modeBuffer","continuations","addSublanguage","processSubLanguage","buf","keywordRelevance","startsWith","cssClass","addKeyword","processKeywords","startNewMode","doIgnore","lexeme","resumeScanAtSamePosition","doBeginMatch","newMode","beforeCallbacks","cb","skip","excludeBegin","returnBegin","doEndMatch","matchPlusRemainder","endMode","endOfMode","matched","endsParent","origin","returnEnd","excludeEnd","lastMatch","processLexeme","textBeforeMatch","badRule","iterations","md","current","processContinuations","processedCount","closeAllNodes","finalize","toHTML","floor","illegalBy","msg","sofar","errorRaised","languageSubset","plaintext","justTextHighlightResult","results","autoDetection","sorted","sort","supersetOf","best","secondBest","second_best","brPlugin","before:highlightElement","TAB_REPLACE_RE","tabReplacePlugin","highlightElement","element","block","classes","parentNode","find","_class","blockLanguage","textContent","currentLang","resultLang","classList","updateClassName","relavance","initHighlighting","called","querySelectorAll","wantsHighlight","highlightAll","readyState","registerAliases","aliasList","alias","plugin","addEventListener","fixMarkup","arg","highlightBlock","configure","userOptions","initHighlightingOnLoad","registerLanguage","languageDefinition","error$1","rawDefinition","bind","unregisterLanguage","listLanguages","requireLanguage","addPlugin","upgradePluginAPI","vuePlugin","debugMode","safeMode","versionString","HLJS","slug","trim","originalSlug","OrderedMap","found","update","newKey","self","remove","addToStart","addToEnd","place","without","subtract","Fragment","nodesBetween","nodeStart","descendants","textBetween","blockSeparator","leafText","separated","isText","isLeaf","isBlock","first","sameMarkup","withText","cut","cutByIndex","replaceChild","maybeChild","findDiffStart","childA","childB","findDiffEnd","otherPos","posA","posB","iA","iB","same","minSize","round","retIndex","toStringInner","toJSON","fromJSON","nodeFromJSON","fromArray","joined","compareDeep","p$1","Mark","ReplaceError","addToSet","placed","excludes","rank","removeFromSet","isInSet","_","sameSet","setFrom","none","Slice","openStart","openEnd","prototypeAccessors$1","replaceOuter","ref","$along","extra","resolveNoCache","prepareSliceForReplace","index_es_close","replaceThreeWay","$start","$end","joinable","addRange","checkJoin","addNode","replaceTwoWay","parentOffset","main","sub","compatibleContent","$before","$after","startIndex","endIndex","textOffset","validContent","insertAt","insertInto","insert","canReplace","removeBetween","removeRange","ref$1","indexTo","offsetTo","maxOpen","openIsolating","isolating","n$1","ResolvedPos","path","prototypeAccessors$2","resolveDepth","val","dOff","tmp","marksAcross","isInline","sharedDepth","blockRange","pred","inlineContent","NodeRange","sameParent","str","rem","resolveCached","resolveCache","resolveCachePos","resolveCacheSize","prototypeAccessors$1$1","emptyAttrs","Node","prototypeAccessors$3","isTextblock","isAtom","startPos","hasMarkup","defaultAttrs","mark","includeParents","childAfter","childBefore","rangeHasMark","toDebugString","wrapMarks","contentMatchAt","contentMatch","matchFragment","replacement","one","two","validEnd","allowsMarks","canReplaceWith","matchType","canAppend","check","markFromJSON","TextNode","ContentMatch","wrapCache","prototypeAccessors$4","defaultType","edgeCount","string","nodeTypes","TokenStream","expr","parseExpr","nfa","labeled","explore","states","known","indexOf","nullFrom","states$1","cmp","dfa","connect","exprs","loop","edge","loop$1","cur","i$1","next$1","i$2","next$2","edges","work","dead","hasRequiredAttrs","checkForDeadEnds","frag","compatible","fillBefore","toEnd","search","finished","tp","findWrapping","computeWrapping","active","via","scan","prototypeAccessors$1$2","parseExprSeq","eat","parseExprSubscript","typeName","type$1","groups","resolveName","parseExprAtom","parseExprRange","parseNum","attrName","hasDefault","computeAttrs","built","given","initAttrs","Attribute","NodeType","markSet","prototypeAccessors$5","atom","isRequired","createChecked","allowsMarkType","markType","allowedMarks","topType","topNode","prototypeAccessors$1$3","MarkType","excluded","instance","index_es_Schema","contentExprCache","prop$1","contentExpr","markExpr","gatherMarks","prop$2","excl","topNodeType","wrappings","ok","mark$1","text$1","DOMParser","this$1","tags","styles","ParseContext","addAll","finish","parseSlice","matchTag","matches","namespace","namespaceURI","matchesContext","matchStyle","schemaRules","priority","rules$1","name$1","fromSchema","domParser","blockTags","address","article","aside","canvas","dd","div","dl","fieldset","figcaption","figure","footer","form","h1","h2","h3","h4","h5","h6","hgroup","li","noscript","ol","pre","section","tfoot","ul","ignoreTags","object","script","listTags","OPT_PRESERVE_WS","OPT_PRESERVE_WS_FULL","wsOptionsFor","NodeContext","pendingMarks","solid","activeMarks","fill","wrap","applyPending","nextType","markMayApply","isOpen","topContext","topOptions","topMatch","findPositions","needsBlock","prototypeAccessors$6","currentPos","selector","msMatchesSelector","webkitMatchesSelector","mozMatchesSelector","v","returned","addDOM","addTextNode","readStyles","parseStyles","addPendingMark","addElement","removePendingMark","domNodeBefore","previousSibling","insertNode","findInText","findInside","prevItem","appendChild","normalizeList","ruleFromNode","ignore","sync","oldNeedsBlock","leafFallback","addElementByRule","ownerDocument","createTextNode","enter","startIn","getContent","contentDOM","contentElement","querySelector","findAround","childNodes","findAtPoint","findPlace","route","cx","enterInner","textblockFromContext","closeExtra","preserveWS","topOpen","compareDocumentPosition","textNode","option","useRoot","minDepth","part","$context","deflt","lastIndexOf","DOMSerializer","gatherToDOM","serializeFragment","createDocumentFragment","keep","rendered","spanning","markDOM","serializeMark","serializeNode","renderSpec","onContent","serializeNodeAndMarks","structure","xmlNS","tagName","space","createElementNS","space$1","setAttributeNS","setAttribute","innerContent","domSerializer","nodesFromSchema","marksFromSchema","high","settings","subset","prefix","defaultPrefix","registerAlias","Emitter","tail","properties","noop","__webpack_exports__","baseKeymap","chainCommands","exitCode","lift","setBlockType","toggleMark","wrapIn","prosemirror_transform__WEBPACK_IMPORTED_MODULE_0__","prosemirror_model__WEBPACK_IMPORTED_MODULE_1__","prosemirror_state__WEBPACK_IMPORTED_MODULE_2__","deleteSelection","textblockAt","side","only","findCutBefore","findCutAfter","defaultBlockAt","above","replaceWith","splitBlock","atEnd","can","$first","deleteBarrier","$cut","conn","clearIncompatible","joinMaybeClear","canDelAfter","joinAt","selAfter","at","afterText","afterDepth","selectTextblockSide","selectTextblockStart","selectTextblockEnd","wrapping","applicable","$cursor","markApplies","storedMarks","removeStoredMark","addStoredMark","has","removeMark","spaceStart","spaceEnd","addMark","commands","backspace","isSelectable","delStep","del","pcBaseKeymap","insertText","Mod-Enter","Shift-Backspace","Mod-a","macBaseKeymap","Ctrl-h","Alt-Backspace","Ctrl-d","Ctrl-Alt-Backspace","Alt-Delete","Alt-d","Ctrl-a","Ctrl-e","os","cleanUrl","infostring","langPrefix","quote","raw","headerIds","headerPrefix","xhtml","flags","sanitize","baseUrl","rtrim","splitCells","normal","pedantic","gfm","cap","bull","listStart","listItems","t","l","isordered","istask","ischecked","newline","lastToken","trimRight","codeBlockStyle","fences","nptable","bullet","smartLists","charAt","sanitizer","def","lheading","fmt","precision","argIndex","leadingZero","nextArg","slurpNumber","digits","parseInt","parseFloat","toFixed","toUpperCase","vsprintf","replacements","printf","AllSelection","EditorState","NodeSelection","Plugin","PluginKey","Selection","SelectionRange","TextSelection","prosemirror_model__WEBPACK_IMPORTED_MODULE_0__","prosemirror_transform__WEBPACK_IMPORTED_MODULE_1__","classesById","lastNode","lastParent","replaceRange","selectionToInsertionEnd","deleteRange","replaceRangeWith","textOnly","findSelectionIn","bias","cls","id","selectionClass","warnedAboutTextSelection","checkTextSelection","ensureMarks","TextBookmark","dPos","deleted","mapResult","NodeBookmark","selectable","atStart","AllBookmark","startLen","_newFrom","newTo","UPDATED_SEL","UPDATED_MARKS","UPDATED_SCROLL","Transaction","curSelectionFor","Date","now","curSelection","selectionSet","setStoredMarks","storedMarksSet","addStep","inheritMarks","isGeneric","scrolledIntoView","FieldDesc","desc","baseFields","_marks","_old","Configuration","pluginsByKey","fields","filterTransaction","rootTr","transactions","trs","newState","applyInner","haveNew","appendTransaction","oldState","newInstance","field","$config","pluginFields","bindProps","Function","createKey","Decoration","DecorationSet","EditorView","prosemirror_state__WEBPACK_IMPORTED_MODULE_0__","prosemirror_transform__WEBPACK_IMPORTED_MODULE_2__","nav","agent","ie_edge","ie_upto10","ie_11up","ie_version","documentMode","gecko","_chrome","chrome_version","safari","vendor","ios","maxTouchPoints","android","webkit","documentElement","webkit_version","domIndex","assignedSlot","host","reusedRange","textRange","createRange","setEnd","setStart","isEquivalentPosition","off","targetNode","targetOff","scanFor","atomElements","hasBlockDesc","contentEditable","pmViewDesc","selectionCollapsed","domSel","collapsed","isCollapsed","rangeCount","getRangeAt","keyEvent","createEvent","initEvent","windowRect","clientWidth","clientHeight","getSide","clientRect","getBoundingClientRect","scaleX","offsetWidth","scaleY","offsetHeight","scrollRectIntoView","startDOM","scrollThreshold","someProp","scrollMargin","atTop","bounding","moveX","moveY","defaultView","scrollBy","startX","scrollLeft","startY","scrollTop","dX","dY","scrollStack","restoreScrollStack","dTop","preventScrollSupported","findOffsetInNode","coords","closest","coordsClosest","dxClosest","rowBot","rowTop","childIndex","rects","getClientRects","dx","len","singleRect","inRect","findOffsetInText","posAtCoords","caretPositionFromPoint","offsetNode","caretRangeFromPoint","startContainer","startOffset","elementFromPoint","box","startI","targetKludge","outside","docView","nearestDesc","posBefore","posAfter","posFromDOM","posFromCaret","posFromElement","inside","posAtStart","border","BIDI","coordsAtPos","domFromPos","supportEmptyRange","takeSide","flattenV","rectBefore","rectAfter","flattenH","ignoreForCoords","y","withFlushedState","viewState","activeElement","updateState","focus","maybeRTL","cachedState","cachedDir","cachedResult","nearest","boxes","endOfTextblockVertical","domSelection","modify","oldRange","oldNode","focusNode","oldOff","focusOffset","oldBidiLevel","caretBidiLevel","domAfterPos","removeAllRanges","endOfTextblockHorizontal","NOT_DIRTY","CHILD_DIRTY","CONTENT_DIRTY","NODE_DIRTY","ViewDesc","dirty","widget","outerDeco","innerDeco","destroy","posBeforeChild","posAtEnd","domBefore","domAfter","onlyNodes","nodeDOM","getDesc","localPosFromDOM","descAt","TrailingHackViewDesc","WidgetViewDesc","domAtom","fromOffset","toOffset","childBase","parseRange","emptyChildAt","force","anchorDOM","headDOM","getSelection","brKludge","anchorNode","anchorOffset","domSelExtended","extend","collapse","DOMException","mutation","contentLost","startInside","endInside","markDirty","stop","stopEvent","ignoreSelection","CompositionViewDesc","textDOM","mut","oldValue","MarkViewDesc","custom","nodeViews","reparseInView","replaceNodes","NodeViewDesc","updateChildren","descObj","applyOuterDeco","CustomNodeViewDesc","TextViewDesc","whitespace","sameOuterDeco","composition","composing","localCompositionInfo","localComposition","compositionInChild","updater","ViewTreeUpdater","deco","onWidget","onNode","locals","forChild","decoIndex","restNode","parentIndex","widgets","compareSide","cutAt","iterDeco","insideNode","syncToMarks","placeWidget","compIndex","findNodeMatch","findIndexWithChild","updateNodeAt","updateNextNode","addTextblockHacks","destroyRest","changed","protectLocalComposition","renderDescs","parentDOM","descs","written","childDOM","rm","insertBefore","trackWrites","oldCSS","cssText","getComputedStyle","listStyle","iosHacks","nearbyTextNode","textPos","childStart","findTextInFragment","removeChild","compositionNodes","updateInner","updateOuterDeco","needsWrap","oldDOM","patchOuterDeco","computeOuterDeco","removeAttribute","docViewDesc","pmIsDeco","inParent","selectNode","deselectNode","ignoreMutation","OuterDecoLevel","noDeco","outerDOM","prevComputed","curComputed","curDOM","patchAttributes","prevList","curList","removeProperty","lock","preMatch","parentDesc","curDesc","descI","fI","outer","destroyBetween","maxKeep","matchesMark","markDesc","targetDesc","matchesNode","domNode","nextDOM","matchesWidget","addHackNode","matchesHack","hack","selectionFromDOM","inWidget","nearestDescNode","isOnEdge","selectionBetween","editorOwnsSelection","editable","hasFocus","hasSelection","selectionToDOM","syncNodeSelection","mouseDown","allowDefault","curSel","domObserver","currentSelection","delayedSelectionSync","setCurSelection","disconnectSelection","cursorWrapper","img","disabled","selectCursorWrapper","resetEditableFrom","resetEditableTo","brokenSelectBetweenUneditable","temporarilyEditableNear","resetEditable","removeEventListener","hideSelectionGuard","setTimeout","removeClassOnSelectionChange","connectSelection","setEditable","wasDraggable","lastSelectedViewDesc","clearNodeSelection","hasFocusAndSelection","moveSelectionBlock","$side","selectHorizontally","mods","nodePos","nodeLen","isIgnorable","skipIgnoredNodesLeft","moveNode","moveOffset","isBlockNode","setSelFocus","skipIgnoredNodesRight","selectVertically","beyond","stopNativeHorizontalDelete","nextNode","switchEditable","captureKeyDown","getMods","safariDownArrowBug","serializeForClipboard","serializer","detachedDoc","wrappers","wrapMap","wrapper","parseFromClipboard","plainText","inCode","asText","parsed","metas","firstTag","readHTML","restoreReplacedSpaces","contextNode","sliceData","inlineParents","addContext","closeSlice","lastWrap","inLast","addToSibling","closeRight","wrapped","withWrappers","normalizeSiblings","sibling","closeRange","thead","tbody","caption","colgroup","td","th","_detachedDoc","implementation","createHTMLDocument","handlers","editHandlers","InputState","lastKeyCode","lastKeyCodeTime","lastClick","lastSelectionOrigin","lastSelectionTime","lastIOSEnter","lastIOSEnterFallbackTimeout","lastAndroidDelete","composingTimeout","compositionEndedAt","domChangeCount","eventHandlers","setSelectionOrigin","ensureListeners","currentHandlers","runCustomHandler","handler","defaultPrevented","eventBelongsToView","bubbles","eventCoords","clientX","clientY","runHandlerOnContext","propName","updateSelection","focused","handleSingleClick","selectedNode","selectAt","selectClickedNode","selectClickedLeaf","handleTripleClick","button","defaultTripleClick","forceDOMFlush","endComposition","keydown","_event","inOrNearComposition","forceFlush","keyup","keypress","charCode","selectNodeModifier","mousedown","flushed","click","dy","isNear","targetPos","mightDrag","startDoc","addAttr","setUneditable","up","move","abs","buttons","timeStamp","touchdown","contextmenu","timeoutComposition","scheduleComposeEnd","delay","clearTimeout","clearComposition","timestampFromCustomEvent","markParentsDirty","forceUpdate","flushingSoon","compositionstart","compositionupdate","flush","markCursor","compositionend","brokenClipboardAPI","doPaste","singleNode","sliceSingleNode","replaceSelection","clipboardData","clearData","setData","selectNodeContents","blur","captureCopy","paste","getData","capturePaste","dragCopyModifier","dragstart","dataTransfer","effectAllowed","dragging","dragend","dragover","dragenter","drop","eventPos","$mouse","insertPos","isNode","beforeInsert","relatedTarget","beforeinput","flushSoon","compareObjs","WidgetType","noSpec","oldOffset","InlineType","inclusiveStart","inclusiveEnd","local","decorations","buildTree","predicate","findInner","childOff","mapInner","newLocal","mapped","valid","onRemove","oldChildren","oldStart","oldEnd","newStart","newEnd","dSize","mustRebuild","fromLocal","toLocal","childOffset","childNode","gather","mapAndGatherRemainingDecorations","byPos","mapChildren","addInner","baseOffset","takeSpansForNode","moveSpans","withoutNulls","removeInner","removed","dec","localSet","DecorationGroup","removeOverlap","localsInner","is","members","mappedDecos","member","spans","hasNulls","localStart","subtree","working","insertAhead","viewDecorations","observeOptions","childList","characterData","characterDataOldValue","attributeOldValue","useCharData","SelectionState","DOMObserver","handleDOMChange","queue","observer","onCharData","suppressingSelectionUpdates","MutationObserver","mutations","removedNodes","prevValue","onSelectionChange","takeRecords","observe","take","disconnect","container","commonAncestorContainer","ignoreSelectionChange","typeOver","registerMutation","brs","cssChecked","whiteSpace","checkCSS","attributeName","addedNodes","parseRule","readDOMChange","shared","from_","to_","parseBetween","preferredPos","preferredSide","compare","change","endA","endB","adjust","findDiff","resolveSelection","nextSel","$fromA","inlineChange","old","$newStart","$newEnd","skipClosingAndOpening","looksLikeJoin","suppressSelectionUpdates","markChange","chFrom","chTo","curMarks","prevMarks","isMarkChange","parsedSel","fromEnd","mayOpen","_root","mounted","prevDirectPlugins","pluginViews","_props","directPlugins","checkStateComponent","mount","getEditable","updateCursorWrapper","buildNodeViews","computeDocDeco","initInput","updatePluginViews","updateStateInner","reconfigured","redraw","updateSel","nA","nB","changedNodeViews","scroll","scrollToSelection","updateDoc","oldScrollPos","overflowAnchor","refDOM","refTop","innerHeight","localRect","storeScrollPos","forceSelUpdate","sel1","sel2","selectionContextChanged","chromeKludge","anchorInRightPlace","newRefTop","resetScrollPos","prevState","pluginView","destroyPluginViews","setActive","stored","preventScroll","focusPreventScroll","getPrototypeOf","destroyInput","isDestroyed","dispatchEvent","dispatchTransaction","contenteditable","translate","InputRule","inputRules","textblockTypeInputRule","undoInputRule","wrappingInputRule","cutOff","stringHandler","MAX_MATCH","handleTextInput","run","isInputRules","textBefore","undoable","toUndo","regexp","joinPredicate","noopTest","edit","_paragraph","_label","_title","getRegex","_tag","_comment","autolink","reflink","nolink","strong","em","br","_punctuation","_escapes","_scheme","_email","_attribute","_href","_extended_email","_backpedal","breaks","findClosingBracket","prevCapZero","inLink","inRawBlock","lastParenIndex","linkLen","outputLink","escapes","codespan","mangle","smartypants","image","ch","random","createCell","cellType","createTable","rowsCount","colsCount","withHeaderRow","roles","getTableNodeTypes","headerCells","headerCell","findChildren","descend","findBlockNodes","findParentNode","findParentNodeClosestToPos","findSelectedNodeOfType","isNodeSelection","equalNodeType","getMarkAttrs","markItem","getMarkRange","endPos","getNodeAttrs","nodeItem","markIsActive","nodeEqualsType","nodeIsActive","wrapInList","listType","doJoin","outerRange","$insert","joinBefore","splitDepth","splitPos","doWrapInList","splitListItem","itemType","grandParent","depthBefore","depthAfter","liftListItem","endOfList","liftToOuterList","indexBefore","liftOutOfList","sinkListItem","nestedBefore","markInputRule","prosemirror_inputrules_dist","markEnd","markStart","matchStart","matchEnd","textStart","textEnd","getMarksBetween","nodeInputRule","pasteRule","transformPasted","markPasteRule","isLink","replaceText","splitToDefaultListItem","keepItem","typesAfter","innerType","rest","baseType","canSplit","toggleBlockType","toggletype","isList","bullet_list","ordered_list","todo_list","toggleList","parentList","toggleWrap","updateMark","escapeTest","escapeReplace","escapeTestNoEncode","escapeReplaceNoEncode","escapeReplacements","&","<",">","\"","'","getEscapeReplacement","unescapeTest","caret","nonWordAndColonTest","originIndependentUrl","baseUrls","justDomain","protocol","domain","resolveUrl","relativeBase","suffLen","currChar","encode","prot","decodeURIComponent","encodeURI","tableRow","curr","Mapping","ReplaceAroundStep","ReplaceStep","Step","Transform","canJoin","dropPoint","joinPoint","liftTarget","replaceStep","lower16","factor16","pow","makeRecover","recoverIndex","DEL_BEFORE","DEL_AFTER","DEL_ACROSS","DEL_SIDE","MapResult","delInfo","recover","deletedBefore","deletedAfter","deletedAcross","StepMap","inverted","diff","recoverOffset","assoc","_map","simple","oldIndex","newIndex","oldSize","newSize","mirror","mirrors","setMirror","startSize","mirr","totalSize","inverse","appendMappingInverted","corr","stepsByID","stepType","stepClass","StepResult","failed","fail","mapFragment","AddMarkStep","oldSlice","fromReplace","RemoveMarkStep","contentBetween","gapFrom","gapTo","gap","inserted","canCut","innerRange","around","findWrappingOutside","innerMatch","findWrappingInside","withAttrs","pass","fits","fitsTrivially","Fitter","fit","unplaced","frontier","findFittable","placeNodes","openMore","dropNode","moveInline","mustMoveInline","placedSize","sliceDepth","contentAt","frontierDepth","inject","openAtEnd","dropFromFragment","closeFrontierNode","openFrontierNode","taken","openEndCount","closeNodeStart","addToFragment","contentAfterFits","findCloseLevel","dropInner","invalidMarks","definesContent","definingForContent","closeFragment","oldOpen","newOpen","coveredDepths","TransformError","targetDepths","preferredTarget","definingAsContext","preferredTargetIndex","leftNodes","preferredDepth","openDepth","targetDepth","expand","startSteps","point","insertPoint","covered","gapStart","gapEnd","splitting","canChangeType","startM","endM","newNode","typeAfter","removing","adding","newSet","toRemove","parentType","delSteps","allowed","newDefaults","dist_DropCursorView","editorView","cursorPos","timeout","color","setCursor","updateOverlay","nodeRect","parentLeft","parentTop","offsetParent","pageXOffset","pageYOffset","disableDropCursor","scheduleRemoval","dist_GapCursor","dist_GapBookmark","closedBefore","closedAfter","override","allowGapCursor","mustMove","$cur","findGapCursorFrom","$found","clickPos","drawGapCursor","prosemirror_view_dist","tiptap_esm_ComponentView","editor","extension","getPos","isMark","getMarkPos","captureEvents","createDOM","vm","$refs","vue_runtime_esm","selected","updateAttrs","propsData","$mount","$el","updateComponentProps","originalSilent","entries","newAttrs","transaction","dragHandle","once","isCopy","isPaste","isCut","isDrag","posAtDOM","resolvedPos","$destroy","fn","_callbacks","callbacks","Extension","tiptap_esm_ExtensionManager","extensions","bindEditor","Proxy","allPlugins","extensionKeymaps","nodeMarkKeymaps","excludedExtensions","allowedExtensions","extensionInputRules","nodeMarkInputRules","allInputRules","extensionPasteRules","pasteRules","nodeMarkPasteRules","allPasteRules","allCommands","handle","_name","_value","commandName","commandValue","minMax","Doc","tiptap_esm_Paragraph","Text","css","tiptap_esm_Editor","editorProps","autoFocus","emptyDocument","useBuiltInExtensions","disableInputRules","disablePasteRules","dropCursor","enableDropCursor","enableGapCursor","parseOptions","injectCSS","onInit","onTransaction","onUpdate","onFocus","onBlur","onPaste","onDrop","createExtensions","createNodes","createMarks","createSchema","createPlugins","keymaps","createKeymaps","createInputRules","createPasteRules","createView","createCommands","setActiveNodesAndMarks","on","word","camelCase","emit","builtInExtensions","createDocument","prosemirror_commands_dist","createSelectionBetween","_view","tabindex","htmlString","parseFromString","firstElementChild","createState","handlePaste","handleDrop","setProps","initNodeViews","getHTML","getJSON","emitUpdate","resolvedFrom","resolvedEnd","setContent","activeMarkAttrs","activeNodes","isActive","handlePlugins","reconfigure","EditorContent","watch","immediate","$nextTick","setParentComponent","Menu","preventHide","mousedownHandler","capture","blurHandler","EditorMenuBar","registerPlugin","MenuBar","$scopedSlots"],"mappings":"yFAIAA,EAAAC,cAEAC,OAAAC,GACA,OAAAA,EAGAD,GAAAC,GACA,OAAAA,EAGAD,SAAAC,GACA,OAAAA,EAGAD,IAAAC,GACA,OAAAA,EAGAD,KAAAC,GACA,OAAAA,EAGAD,KAAAC,GACA,OAAAA,EAGAD,KAAAE,EAAAC,EAAAF,GACA,SAAAA,EAGAD,MAAAE,EAAAC,EAAAF,GACA,SAAAA,EAGAD,KACA,gHCkDA,IAzFO,IAAAI,GACPC,EAAA,YACAC,EAAA,MACAC,GAAA,QACAC,GAAA,UACAC,GAAA,QACAC,GAAA,QACAC,GAAA,UACAC,GAAA,MACAC,GAAA,WACAC,GAAA,SACAC,GAAA,IACAC,GAAA,SACAC,GAAA,WACAC,GAAA,MACAC,GAAA,OACAC,GAAA,YACAC,GAAA,UACAC,GAAA,aACAC,GAAA,YACAC,GAAA,cACAC,GAAA,SACAC,GAAA,SACAC,GAAA,IACAC,GAAA,IACAC,GAAA,OACAC,GAAA,OACAC,IAAA,IACAC,IAAA,IACAC,IAAA,IACAC,IAAA,IACAC,IAAA,IACAC,IAAA,IACAC,IAAA,UACAC,IAAA,aACAC,IAAA,QACAC,IAAA,QACAC,IAAA,UACAC,IAAA,UACAC,IAAA,MACAC,IAAA,MACAC,IAAA,IACAC,IAAA,IACAC,IAAA,IACAC,IAAA,IACAC,IAAA,IACAC,IAAA,IACAC,IAAA,IACAC,IAAA,IACAC,IAAA,IACAC,IAAA,KACAC,IAAA,IACAC,IAAA,KAGOC,GACPC,GAAA,IACAC,GAAA,IACAC,GAAA,IACAC,GAAA,IACAC,GAAA,IACAC,GAAA,IACAC,GAAA,IACAC,GAAA,IACAC,GAAA,IACAC,GAAA,IACAxC,GAAA,IACAC,GAAA,IACAiB,IAAA,IACAC,IAAA,IACAC,IAAA,IACAC,IAAA,IACAC,IAAA,IACAC,IAAA,IACAC,IAAA,IACAC,IAAA,IACAC,IAAA,IACAC,IAAA,IACAC,IAAA,IACAC,IAAA,KAGAY,EAAA,oBAAAC,WAAA,gBAAAC,KAAAD,UAAAE,WAEAC,GADA,oBAAAH,WAAA,aAAAI,KAAAJ,UAAAE,WACA,oBAAAF,WAAA,MAAAI,KAAAJ,UAAAK,WACAC,EAAA,oBAAAN,WAAA,gDAA6EC,KAAAD,UAAAE,WAC7EK,EAAAJ,GAAAJ,MAAA,MAGAS,EAAA,EAAeA,EAAA,GAAQA,IAAAzE,EAAA,GAAAyE,GAAAzE,EAAA,GAAAyE,GAAAC,OAAAD,GAGvB,IAAAA,EAAA,EAAeA,GAAA,GAASA,IAAAzE,EAAAyE,EAAA,SAAAA,EAGxB,IAAAA,EAAA,GAAgBA,GAAA,GAASA,IACzBzE,EAAAyE,GAAAC,OAAAC,aAAAF,EAAA,IACApB,EAAAoB,GAAAC,OAAAC,aAAAF,GAIA,QAAAG,KAAA5E,EAAAqD,EAAAwB,eAAAD,KAAAvB,EAAAuB,GAAA5E,EAAA4E,oBClGA,MAAME,EAAG,oBAAAb,WAAA,qBAAAI,KAAAJ,UAAAK,UACT,SAAAS,EAAAC,GACA,IAGAC,EAAAC,EAAA7B,EAAA8B,EAHAC,EAAAJ,EAAAK,MAAA,UAAAC,EAAAF,IAAAG,OAAA,GACA,SAAAD,IACAA,EAAA,KAEA,QAAAb,EAAA,EAAmBA,EAAAW,EAAAG,OAAA,EAAsBd,IAAA,CACzC,IAAAe,EAAAJ,EAAAX,GACA,qBAAAJ,KAAAmB,GACAL,GAAA,OACA,eAAAd,KAAAmB,GACAP,GAAA,OACA,yBAAAZ,KAAAmB,GACAN,GAAA,OACA,iBAAAb,KAAAmB,GACAnC,GAAA,MACA,cAAAgB,KAAAmB,GAOA,UAAAC,MAAA,+BAAAD,GANgBV,EAChBK,GAAA,EAEAD,GAAA,GAaA,OARAD,IACAK,EAAA,OAAAA,GACAJ,IACAI,EAAA,QAAAA,GACAH,IACAG,EAAA,QAAAA,GACAjC,IACAiC,EAAA,SAAAA,GACAA,EAQA,SAAAI,EAAAV,EAAAW,EAAAtC,GASA,OARAsC,EAAAC,SACAZ,EAAA,OAAAA,GACAW,EAAAE,UACAb,EAAA,QAAAA,GACAW,EAAAG,UACAd,EAAA,QAAAA,IACA,IAAA3B,GAAAsC,EAAAI,WACAf,EAAA,SAAAA,GACAA,EAiCA,SAAAgB,EAAAC,GACA,WAAeC,EAAA,GAAQC,OAASC,cAAAC,EAAAJ,MAOhC,SAAAI,EAAAJ,GACA,IAAAK,EAzDA,SAAAA,GACA,IAAAC,EAAAC,OAAAC,OAAA,MACA,QAAAC,KAAAJ,EACAC,EAAAxB,EAAA2B,IAAAJ,EAAAI,GACA,OAAAH,EAqDAI,CAAAV,GACA,gBAAAW,EAAAjB,GACA,IAA0BkB,EAA1B7B,EDMO,SAAAW,GACP,IAGAX,IAHAR,IAAAmB,EAAAE,SAAAF,EAAAC,QAAAD,EAAAG,UACAvB,GAAAoB,EAAAI,UAAAJ,EAAAmB,KAAA,GAAAnB,EAAAmB,IAAAvB,QACA,gBAAAI,EAAAmB,MACAnB,EAAAmB,MACAnB,EAAAI,SAAA1C,EAAArD,GAAA2F,EAAAoB,UACApB,EAAAmB,KAAA,eASA,MAPA,OAAA9B,MAAA,UACA,OAAAA,MAAA,UAEA,QAAAA,MAAA,aACA,MAAAA,MAAA,WACA,SAAAA,MAAA,cACA,QAAAA,MAAA,aACAA,ECrBmBgC,CAAOrB,GAAAsB,EAAA,GAAAjC,EAAAO,QAAA,KAAAP,EAC1BkC,EAAAZ,EAAAZ,EAAAV,EAAAW,GAAAsB,IACA,GAAAC,KAAAN,EAAAO,MAAAP,EAAAQ,SAAAR,GACA,SACA,GAAAK,IAAAtB,EAAAI,UAAAJ,EAAAC,QAAAD,EAAAG,SAAAd,EAAAqC,WAAA,UACAR,EAAwB7G,EAAI2F,EAAAoB,WAAAF,GAAA7B,EAAA,CAK5B,IAAAsC,EAAAhB,EAAAZ,EAAAmB,EAAAlB,GAAA,IACA,GAAA2B,KAAAV,EAAAO,MAAAP,EAAAQ,SAAAR,GACA,cAEA,GAAAK,GAAAtB,EAAAI,SAAA,CAGA,IAAAwB,EAAAjB,EAAAZ,EAAAV,EAAAW,GAAA,IACA,GAAA4B,KAAAX,EAAAO,MAAAP,EAAAQ,SAAAR,GACA,SAEA,mCCtHA,MAAAY,EAAcC,EAAQ,QACtBC,EAAeD,EAAQ,QACvBE,EAAiBF,EAAQ,QACzBG,EAAqBH,EAAQ,QAC7BI,EAAoBJ,EAAQ,QAC5BK,EAAgBL,EAAQ,SACxBM,MACAA,EAAAC,yBACAA,EAAAC,OACAA,GACIR,EAAQ,SACZS,YACAA,EAAAC,eACAA,EAAAC,SACAA,GACIX,EAAQ,QAKZ,SAAAY,EAAAC,EAAAC,EAAAC,GAEA,YAAAF,GAAA,OAAAA,EACA,UAAA7C,MAAA,kDAEA,oBAAA6C,EACA,UAAA7C,MAAA,wCACAe,OAAAiC,UAAAC,SAAAC,KAAAL,GAAA,qBAGA,GAAAE,GAAA,mBAAAD,EAAA,CACAC,IACAA,EAAAD,EACAA,EAAA,MAGAA,EAAAR,KAAkBM,EAAAD,SAAAG,OAClBP,EAAAO,GACA,MAAAK,EAAAL,EAAAK,UACA,IAAAC,EACAC,EACArE,EAAA,EAEA,IACAoE,EAAArB,EAAAuB,IAAAT,EAAAC,GACK,MAAAS,GACL,OAAAR,EAAAQ,GAGAF,EAAAD,EAAAtD,OAEA,MAAA0D,EAAA,SAAAC,GACA,GAAAA,EAEA,OADAX,EAAAK,YACAJ,EAAAU,GAGA,IAAAC,EAEA,IACAA,EAAAzB,EAAA0B,MAAAP,EAAAN,GACO,MAAAS,GACPE,EAAAF,EAKA,OAFAT,EAAAK,YAEAM,EACAV,EAAAU,GACAV,EAAA,KAAAW,IAGA,IAAAP,KAAArD,OAAA,EACA,OAAA0D,IAKA,UAFAV,EAAAK,WAEAE,EAAA,OAAAG,IAEA,KAAUxE,EAAAoE,EAAAtD,OAAmBd,KAC7B,SAAA4E,GACA,SAAAA,EAAAC,OACAR,GAAAG,IAEAL,EAAAS,EAAAxJ,KAAAwJ,EAAAE,KAAA,SAAAL,EAAAtE,GACA,OAAAsE,EAAAD,EAAAC,GACA,MAAAtE,OAAAyE,EAAAxJ,OACAiJ,GAAAG,KAEAI,EAAAxJ,KAAA+E,EACAyE,EAAAG,SAAA,SACAV,GAAAG,QAXA,CAaOJ,EAAApE,SAKP,IAGA,OAFA8D,EAAAR,KAAkBM,EAAAD,SAAAG,OAClBP,EAAAO,GACAb,EAAA0B,MAAA5B,EAAAuB,IAAAT,EAAAC,MACG,MAAAS,GAEH,GADAA,EAAAS,SAAA,+DACAlB,GAAAF,EAAAD,UAAAsB,OACA,uCACAzB,EAAAe,EAAAS,QAAA,OACA,SAEA,MAAAT,GAQAX,EAAAsB,QACAtB,EAAAuB,WAAA,SAAArB,GAGA,OAFAR,EAAAM,EAAAD,SAAAG,GACAJ,EAAAE,EAAAD,UACAC,GAGAA,EAAAH,cAEAG,EAAAD,WAMAC,EAAAX,SACAW,EAAAwB,OAAAnC,EAAA0B,MAEAf,EAAAV,WACAU,EAAAT,eAEAS,EAAAb,QACAa,EAAAyB,MAAAtC,EAAAuB,IAEAV,EAAAR,cACAQ,EAAA0B,YAAAlC,EAAAmC,OAEA3B,EAAAP,UAEAO,EAAAe,MAAAf,EAEA3I,EAAAC,QAAA0I,0BCrJA,MAAAV,EAAiBF,EAAQ,QACzBK,EAAgBL,EAAQ,QACxBI,EAAoBJ,EAAQ,QAC5BG,EAAqBH,EAAQ,SAC7BW,SAAOA,GAAcX,EAAQ,SAC7BM,MACAA,EAAAkC,SACAA,GACIxC,EAAQ,QAKZ/H,EAAAC,cAAA+H,EACA9H,YAAA+J,GACAO,KAAArB,UACAqB,KAAAb,MAAA,KACAa,KAAAP,WAAAvB,EACA8B,KAAAP,QAAAQ,SAAAD,KAAAP,QAAAQ,UAAA,IAAAxC,EACAuC,KAAAC,SAAAD,KAAAP,QAAAQ,SACAD,KAAAC,SAAAR,QAAAO,KAAAP,QACAO,KAAAE,QAAA,IAAAtC,EAMAlI,aAAAiJ,EAAAc,GAEA,OADA,IAAAjC,EAAAiC,GACAP,MAAAP,GAMAjJ,MAAAiJ,GACAqB,KAAAG,OAAA,IAAAxC,EAAAgB,EAAAyB,MAAAJ,KAAAP,SAEAO,KAAAK,WAAA,IAAA1C,EACAgB,EAAAyB,MACAvC,KAAcmC,KAAAP,SAAiBQ,SAAA,IAAAvC,KAE/BsC,KAAArB,SAAA2B,UAEA,IAAArB,EAAA,GACA,KAAAe,KAAAO,QACAtB,GAAAe,KAAAQ,MAGA,OAAAvB,EAMAvJ,OAEA,OADAsK,KAAAb,MAAAa,KAAArB,OAAA8B,MACAT,KAAAb,MAMAzJ,OACA,OAAAsK,KAAArB,OAAAqB,KAAArB,OAAAtD,OAAA,MAMA3F,YACA,IAAAgL,EAAAV,KAAAb,MAAAxJ,KAEA,cAAAqK,KAAAW,OAAAvB,MACAsB,GAAA,KAAAV,KAAAO,OAAA5K,KAGA,OAAAqK,KAAAG,OAAAL,OAAAY,GAMAhL,MACA,IAAAgL,EAAA,GACA,OAAAV,KAAAb,MAAAC,MACA,YACA,SAEA,SACA,OAAAY,KAAAC,SAAAW,KAEA,cACA,OAAAZ,KAAAC,SAAAY,QACAb,KAAAG,OAAAL,OAAAE,KAAAb,MAAAxJ,MACAqK,KAAAb,MAAA2B,MACAf,EAAAC,KAAAK,WAAAP,OAAAE,KAAAb,MAAAxJ,OACAqK,KAAAE,SAEA,WACA,OAAAF,KAAAC,SAAAvF,KAAAsF,KAAAb,MAAAxJ,KACAqK,KAAAb,MAAAE,KACAW,KAAAb,MAAAG,SAEA,aACA,IACA/E,EACAwG,EACAC,EACAC,EAJAC,EAAA,GAQA,IADAF,EAAA,GACAzG,EAAA,EAAmBA,EAAAyF,KAAAb,MAAA+B,OAAA7F,OAA8Bd,IACjDyG,GAAAhB,KAAAC,SAAAkB,UACAnB,KAAAG,OAAAL,OAAAE,KAAAb,MAAA+B,OAAA3G,KACa2G,QAAA,EAAAE,MAAApB,KAAAb,MAAAiC,MAAA7G,KAKb,IAFA2G,GAAAlB,KAAAC,SAAAoB,SAAAL,GAEAzG,EAAA,EAAmBA,EAAAyF,KAAAb,MAAAmC,MAAAjG,OAA6Bd,IAAA,CAIhD,IAHAwG,EAAAf,KAAAb,MAAAmC,MAAA/G,GAEAyG,EAAA,GACAC,EAAA,EAAqBA,EAAAF,EAAA1F,OAAgB4F,IACrCD,GAAAhB,KAAAC,SAAAkB,UACAnB,KAAAG,OAAAL,OAAAiB,EAAAE,KACeC,QAAA,EAAAE,MAAApB,KAAAb,MAAAiC,MAAAH,KAIfP,GAAAV,KAAAC,SAAAoB,SAAAL,GAEA,OAAAhB,KAAAC,SAAAsB,MAAAL,EAAAR,GAEA,uBAGA,IAFAA,EAAA,GAEA,mBAAAV,KAAAO,OAAAnB,MACAsB,GAAAV,KAAAQ,MAGA,OAAAR,KAAAC,SAAAuB,WAAAd,GAEA,kBACAA,EAAA,GACA,MAAAe,EAAAzB,KAAAb,MAAAsC,QACAC,EAAA1B,KAAAb,MAAAuC,MAEA,kBAAA1B,KAAAO,OAAAnB,MACAsB,GAAAV,KAAAQ,MAGA,OAAAR,KAAAC,SAAA0B,KAAAjB,EAAAe,EAAAC,GAEA,uBACAhB,EAAA,GACA,MAAAkB,EAAA5B,KAAAb,MAAAyC,MACAC,EAAA7B,KAAAb,MAAA0C,QACAC,EAAA9B,KAAAb,MAAA2C,KAEA,GAAA9B,KAAAb,MAAA2C,KACA,GAAAF,EACA,YAAA5B,KAAAW,OAAAvB,KAAA,CACA,MAAA2C,EAAA/B,KAAAW,OACAoB,EAAApM,KAAAqK,KAAAC,SAAA+B,SAAAH,GAAA,IAAAE,EAAApM,UAEAqK,KAAArB,OAAAsD,MACA7C,KAAA,OACAzJ,KAAAqK,KAAAC,SAAA+B,SAAAH,UAIAnB,GAAAV,KAAAC,SAAA+B,SAAAH,GAIA,uBAAA7B,KAAAO,OAAAnB,MACAsB,GAAAkB,GAAA,SAAA5B,KAAAb,MAAAC,KAEAY,KAAAQ,MADAR,KAAAkC,YAGA,OAAAlC,KAAAC,SAAAkC,SAAAzB,EAAAoB,EAAAD,GAEA,WAEA,OAAA7B,KAAAC,SAAAmC,KAAApC,KAAAb,MAAAxJ,MAEA,gBACA,OAAAqK,KAAAC,SAAAoC,UAAArC,KAAAG,OAAAL,OAAAE,KAAAb,MAAAxJ,OAEA,WACA,OAAAqK,KAAAC,SAAAoC,UAAArC,KAAAkC,aAEA,SACA,MAAAI,EAAA,eAAAtC,KAAAb,MAAAC,KAAA,wBACA,IAAAY,KAAAP,QAAAD,OAGA,UAAAjE,MAAA+G,GAFAC,QAAAC,IAAAF,siBCrLA,IAAAG,EAAAC,EAGA,uBAAAC,QAAA,CAEA,IAAAC,EAAA,IAAAD,QACAF,EAAA,CAAA7F,GAAAgG,EAAAC,IAAAjG,IACA8F,EAAA,EAAA9F,EAAAkG,KACAF,EAAAG,IAAAnG,EAAAkG,GACAA,QAEC,CACD,IAAAF,KACAI,EAAA,GACAC,EAAA,EACAR,EAAA,CAAA7F,IACA,QAAArC,EAAA,EAAmBA,EAAAqI,EAAAvH,OAAkBd,GAAA,EACrC,GAAAqI,EAAArI,IAAAqC,EAAA,OAAAgG,EAAArI,EAAA,KAEAmI,EAAA,EAAA9F,EAAAkG,KACAG,GAAAD,IAAAC,EAAA,GACAL,EAAAK,KAAArG,EACAgG,EAAAK,KAAAH,UAIAI,EACAxN,YAAAyN,EAAAC,EAAAC,EAAAC,GACAtD,KAAAmD,OACAnD,KAAAoD,MACApD,KAAAqD,QACArD,KAAAsD,gBAQAC,EACA7N,YAAA8N,EAAAC,EAAArH,EAAAsH,GAEA1D,KAAAwD,QAEAxD,KAAAyD,SAGAzD,KAAA5D,MAGA4D,KAAA0D,WAKAhO,SAAAiO,GACA,QAAApJ,EAAA,EAAmBA,EAAAyF,KAAA5D,IAAAf,OAAqBd,IAAA,CACxC,IAAAqJ,EAAA5D,KAAA5D,IAAA7B,GACA,GAAAqJ,GAAAD,EAAA,SACA,IAAAR,EAAA5I,EAAAyF,KAAAwD,MACAJ,EAAA7I,EAAAyF,KAAAwD,MAAA,EACAH,EAAAF,EAAA,EACAG,EAAAF,EAAA,EACA,QAAAnC,EAAA,EAAqBoC,EAAArD,KAAAwD,OAAAxD,KAAA5D,IAAA7B,EAAA0G,IAAA2C,EAAiD3C,IACtEoC,IACA,IACA,IAAApC,EAAA,EACAqC,EAAAtD,KAAAyD,QAAAzD,KAAA5D,IAAA7B,EAAAyF,KAAAwD,MAAAvC,IAAA2C,EACA3C,IAEAqC,IACA,WAAAJ,EAAAC,EAAAC,EAAAC,EAAAC,GAEA,UAAAO,WAAA,uBAAAF,EAAA,UAKAjO,SAAAiO,GACA,QAAApJ,EAAA,EAAmBA,EAAAyF,KAAA5D,IAAAf,OAAqBd,IACxC,GAAAyF,KAAA5D,IAAA7B,IAAAoJ,EAAA,OAAApJ,EAAAyF,KAAAwD,MACA,UAAAK,WAAA,uBAAAF,EAAA,UAMAjO,SAAAiO,EAAAG,EAAAC,GACA,IAAAZ,KAASA,EAAAE,QAAAD,MAAAE,UAA2BtD,KAAAgE,SAAAL,GACpC,eAAAG,GACAC,EAAA,KAAAZ,EAAAE,GAAArD,KAAAwD,OAAA,KACAxD,KAAA5D,IAAAgH,EAAApD,KAAAwD,OAAAO,EAAA,EAAAZ,EAAA,EAAAE,KAEAU,EAAA,KAAAX,EAAAE,GAAAtD,KAAAyD,QAAA,KACAzD,KAAA5D,IAAA+G,EAAAnD,KAAAwD,OAAAO,EAAA,EAAAX,EAAA,EAAAE,IAMA5N,YAAAuO,EAAAC,GACA,IACAf,KAAAgB,EACAd,MAAAe,EACAhB,IAAAiB,EACAf,OAAAgB,GACKtE,KAAAgE,SAAAC,IAELd,KAAAoB,EACAlB,MAAAmB,EACApB,IAAAqB,EACAnB,OAAAoB,GACK1E,KAAAgE,SAAAE,GACL,WAAAhB,EACAyB,KAAAC,IAAAT,EAAAI,GACAI,KAAAC,IAAAP,EAAAI,GACAE,KAAAE,IAAAT,EAAAI,GACAG,KAAAE,IAAAP,EAAAI,IAOAhP,YAAAoP,GACA,IAAA1J,KACA2J,KACA,QAAAhE,EAAA+D,EAAA1B,IAA4BrC,EAAA+D,EAAAxB,OAAmBvC,IAC/C,QAAAiE,EAAAF,EAAA3B,KAA+B6B,EAAAF,EAAAzB,MAAkB2B,IAAA,CACjD,IAAAC,EAAAlE,EAAAf,KAAAwD,MAAAwB,EACArB,EAAA3D,KAAA5D,IAAA6I,GACAF,EAAApB,KACAoB,EAAApB,IAAA,EAEAqB,GAAAF,EAAA3B,MAAA6B,GAAAhF,KAAA5D,IAAA6I,EAAA,IAAAtB,GACA5C,GAAA+D,EAAA1B,KAAArC,GAAAf,KAAA5D,IAAA6I,EAAAjF,KAAAwD,QAAAG,GAEAvI,EAAA6G,KAAA0B,IAGA,OAAAvI,EAMA1F,WAAAqL,EAAAiE,EAAAzD,GACA,QAAAhH,EAAA,EAAA2K,EAAA,GAAmC3K,IAAA,CACnC,IAAA4K,EAAAD,EAAA3D,EAAA6D,MAAA7K,GAAA8K,SACA,GAAA9K,GAAAwG,EAAA,CACA,IAAAkE,EAAAD,EAAAjE,EAAAf,KAAAwD,MACA8B,GAAAvE,EAAA,GAAAf,KAAAwD,MAEA,KAAAyB,EAAAK,GAAAtF,KAAA5D,IAAA6I,GAAAC,GAAAD,IACA,OAAAA,GAAAK,EAAAH,EAAA,EAAAnF,KAAA5D,IAAA6I,GAEAC,EAAAC,GAMAzP,WAAA6L,GACA,OAAAkB,EAAAlB,IAAAmB,EAAAnB,EAKA,SAAAA,GACA,YAAAA,EAAAnC,KAAAmG,KAAAC,UACA,UAAA3B,WAAA,qBAAAtC,EAAAnC,KAAAtE,MACA,IAAA0I,EA2EA,SAAAjC,GACA,IAAAiC,GAAA,EACAiC,GAAA,EACA,QAAA1E,EAAA,EAAmBA,EAAAQ,EAAAmE,WAAwB3E,IAAA,CAC3C,IAAA4E,EAAApE,EAAA6D,MAAArE,GACA6E,EAAA,EACA,GAAAH,EACA,QAAAxE,EAAA,EAAqBA,EAAAF,EAASE,IAAA,CAC9B,IAAA4E,EAAAtE,EAAA6D,MAAAnE,GACA,QAAA1G,EAAA,EAAuBA,EAAAsL,EAAAH,WAAwBnL,IAAA,CAC/C,IAAAyG,EAAA6E,EAAAT,MAAA7K,GACA0G,EAAAD,EAAA8E,MAAAC,QAAAhF,IAAA6E,GAAA5E,EAAA8E,MAAAE,UAGA,QAAAzL,EAAA,EAAmBA,EAAAoL,EAAAD,WAAwBnL,IAAA,CAC3C,IAAAyG,EAAA2E,EAAAP,MAAA7K,GACAqL,GAAA5E,EAAA8E,MAAAE,QACAhF,EAAA8E,MAAAC,QAAA,IAAAN,GAAA,IAEA,GAAAjC,IAAAoC,EACApC,GAAAoC,IAAApC,EAAAmB,KAAAE,IAAArB,EAAAoC,IAEA,OAAApC,EAjGAyC,CAAA1E,GACAkC,EAAAlC,EAAAmE,WACAtJ,KACA8J,EAAA,EACAxC,EAAA,KACAyC,KACA,QAAA5L,EAAA,EAAAuE,EAAA0E,EAAAC,EAAqClJ,EAAAuE,EAAOvE,IAAA6B,EAAA7B,GAAA,EAE5C,QAAAwG,EAAA,EAAA4C,EAAA,EAA4B5C,EAAA0C,EAAc1C,IAAA,CAC1C,IAAA4E,EAAApE,EAAA6D,MAAArE,GACA4C,IACA,QAAApJ,EAAA,GAAqBA,IAAA,CACrB,KAAA2L,EAAA9J,EAAAf,QAAA,GAAAe,EAAA8J,QACA,GAAA3L,GAAAoL,EAAAD,WAAA,MACA,IAAAU,EAAAT,EAAAP,MAAA7K,IACAyL,QAASA,EAAAD,UAAAM,YAA6BD,EAAAN,MACtC,QAAAQ,EAAA,EAAqBA,EAAAP,EAAaO,IAAA,CAClC,GAAAA,EAAAvF,GAAA0C,EAAA,EACAC,WAAAzB,MACA7C,KAAA,mBACAuE,MACA4C,EAAAR,EAAAO,IAEA,MAEA,IAAA5E,EAAAwE,EAAAI,EAAA9C,EACA,QAAAgD,EAAA,EAAuBA,EAAAR,EAAaQ,IAAA,CACpC,GAAApK,EAAAsF,EAAA8E,GAAApK,EAAAsF,EAAA8E,GAAA7C,GAEAD,WAAAzB,MACA7C,KAAA,YACA2B,MACA4C,MACA4C,EAAAP,EAAAQ,IAEA,IAAAC,EAAAJ,KAAAG,GACA,GAAAC,EAAA,CACA,IAAAC,GAAAhF,EAAA8E,GAAAhD,EAAA,EACAmD,EAAAR,EAAAO,GAEA,MAAAC,GACAA,GAAAF,GAAA,GAAAN,EAAAO,EAAA,IAEAP,EAAAO,GAAAD,EACAN,EAAAO,EAAA,MACaC,GAAAF,GACbN,EAAAO,EAAA,OAKAR,GAAAF,EACArC,GAAAyC,EAAAf,SAEA,IAAAuB,GAAA7F,EAAA,GAAAyC,EACAqD,EAAA,EACA,KAAAX,EAAAU,GAAA,GAAAxK,EAAA8J,MAAAW,IACAA,IACAnD,WAAAzB,MAA0C7C,KAAA,UAAA2B,MAAAwF,EAAAM,IAC1ClD,IAGA,IAAAmD,EAAA,IAAAvD,EAAAC,EAAAC,EAAArH,EAAAsH,GACAqD,GAAA,EAKA,QAAAxM,EAAA,GAAiBwM,GAAAxM,EAAA4L,EAAA9K,OAAoCd,GAAA,EACrD,MAAA4L,EAAA5L,IAAA4L,EAAA5L,EAAA,GAAAkJ,IAAAsD,GAAA,GACAA,GA8BA,SAAA3K,EAAA+J,EAAA5E,GACAnF,EAAAsH,WAAAtH,EAAAsH,aACA,QAAAnJ,EAAA,EAAAwK,KAA4BxK,EAAA6B,MAAAf,OAAoBd,IAAA,CAChD,IAAAoJ,EAAAvH,MAAA7B,GACA,GAAAwK,EAAApB,GAAA,SACAoB,EAAApB,IAAA,EACA,IAAAqD,EAAAzF,EAAA0F,OAAAtD,GACAuD,EAAA,KACA,QAAAjG,EAAA,EAAmBA,EAAA+F,EAAAlB,MAAAE,QAAwB/E,IAAA,CAC3C,IAAA+D,GAAAzK,EAAA0G,GAAA7E,EAAAoH,MACA2D,EAAAhB,EAAA,EAAAnB,GAEA,MAAAmC,GACAH,EAAAlB,MAAAO,UAAAW,EAAAlB,MAAAO,SAAApF,IAAAkG,KAEAD,MAAAE,EAAAJ,EAAAlB,SAAA7E,GAAAkG,GAEAD,GACA9K,EAAAsH,SAAA2D,SACAjI,KAAA,oBACAuE,MACA0C,SAAAa,KAnDAI,CAAAR,EAAAX,EAAA5E,GAEA,OAAAuF,EAhFAS,CAAAhG,KAsIA,SAAA6F,EAAAtB,GACA,GAAAA,EAAAO,SAAA,OAAAP,EAAAO,SAAAmB,QACA,IAAApM,KACA,QAAAb,EAAA,EAAiBA,EAAAuL,EAAAE,QAAmBzL,IAAAa,EAAA6G,KAAA,GACpC,OAAA7G,EAKA,SAAAqM,EAAAC,EAAAC,GACA,IAAAC,EAAAF,EAAAG,aAAA,iBACAC,EACAF,GAAA,eAAAzN,KAAAyN,GACAA,EAAAzM,MAAA,KAAAiB,IAAA2L,GAAAC,OAAAD,IACA,KACA/B,EAAAgC,OAAAN,EAAAG,aAAA,eACAzM,GACA4K,UACAD,QAAAiC,OAAAN,EAAAG,aAAA,eACAxB,SAAAyB,KAAAzM,QAAA2K,EAAA8B,EAAA,MAEA,QAAAtL,KAAAmL,EAAA,CACA,IAAAM,EAAAN,EAAAnL,GAAA0L,WACApF,EAAAmF,KAAAP,GACA,MAAA5E,IAAA1H,EAAAoB,GAAAsG,GAEA,OAAA1H,EAGA,SAAA+M,EAAAnB,EAAAW,GACA,IAAA7B,KACA,GAAAkB,EAAAlB,MAAAE,UAAAF,EAAAE,QAAAgB,EAAAlB,MAAAE,SACA,GAAAgB,EAAAlB,MAAAC,UAAAD,EAAAC,QAAAiB,EAAAlB,MAAAC,SACAiB,EAAAlB,MAAAO,WACAP,EAAA,iBAAAkB,EAAAlB,MAAAO,SAAA+B,KAAA,MACA,QAAA5L,KAAAmL,EAAA,CACA,IAAAU,EAAAV,EAAAnL,GAAA8L,WACAD,KAAArB,EAAAlB,MAAAtJ,GAAAsJ,GAEA,OAAAA,EAyFA,SAAAyC,EAAAC,GACA,IAAApN,EAAAoN,EAAAC,OAAAF,eACA,IAAAnN,EAAA,CACAA,EAAAoN,EAAAC,OAAAF,kBACA,QAAAzN,KAAA0N,EAAAE,MAAA,CACA,IAAAtJ,EAAAoJ,EAAAE,MAAA5N,GACA6N,EAAAvJ,EAAAmG,KAAAC,UACAmD,IAAAvN,EAAAuN,GAAAvJ,IAGA,OAAAhE,EAKA,IAAkBwN,EAAA,EAAS,kBAE3B,SAAAC,EAAAC,GACA,QAAAC,EAAAD,EAAAhI,MAAA,EAA8BiI,EAAA,EAAOA,IACrC,UAAAD,EAAA9B,KAAA+B,GAAA3J,KAAAmG,KAAAC,UACA,OAAAsD,EAAA9B,KAAA,GAAAgC,QAAAF,EAAAG,OAAAF,EAAA,IACA,YAYA,SAAAG,EAAAjM,GACA,IAAAkM,EAAAlM,EAAAmM,UAAAD,MACA,QAAAJ,EAAAI,EAAArI,MAA2BiI,EAAA,EAAOA,IAClC,UAAAI,EAAAnC,KAAA+B,GAAA3J,KAAAmG,KAAAC,UAAA,SACA,SAGA,SAAA6D,EAAApM,GACA,IAAAqM,EAAArM,EAAAmM,UACA,OAAAE,EAAAC,YACAD,EAAAC,YAAA5F,IAAA2F,EAAAE,UAAA7F,IACA2F,EAAAC,YACAD,EAAAE,UACGF,EAAAtC,MAAA,QAAAsC,EAAAtC,KAAA5H,KAAAmG,KAAAC,UACH8D,EAAAG,QAEAZ,EAAAS,EAAAH,QAGA,SAAAL,GACA,IACA,IAAAY,EAAAZ,EAAAa,UAAAhG,EAAAmF,EAAAnF,IACA+F,EACAA,IAAAE,WAAAjG,IACA,CACA,IAAAgF,EAAAe,EAAAtK,KAAAmG,KAAAC,UACA,WAAAmD,GAAA,eAAAA,EAAA,OAAAG,EAAAe,IAAAb,QAAArF,GAEA,IACA,IAAAsF,EAAAH,EAAAgB,WAAAnG,EAAAmF,EAAAnF,IACAsF,EACAA,IAAAc,UAAApG,IACA,CACA,IAAAgF,EAAAM,EAAA7J,KAAAmG,KAAAC,UACA,WAAAmD,GAAA,eAAAA,EACA,OAAAG,EAAAe,IAAAb,QAAArF,EAAAsF,EAAA5D,WAnBA2E,CAAAV,EAAAH,OAuBA,SAAAc,EAAAnB,GACA,aAAAA,EAAAoB,OAAA9K,KAAAmG,KAAAC,WAAAsD,EAAAa,UAOA,SAAAQ,EAAAC,EAAAC,GACA,OAAAD,EAAAtJ,OAAAuJ,EAAAvJ,OAAAsJ,EAAAzG,KAAA0G,EAAA3I,OAAA,IAAA0I,EAAAzG,KAAA0G,EAAAC,KAAA,GAWA,SAAAC,EAAAzB,EAAAhF,EAAAC,GACA,IAAArC,EAAAoH,EAAApH,OAAA,GAEA8I,EADAjH,EAAAV,IAAAiG,EAAA9B,MAAA,IACAuD,SAAAzB,EAAAnF,IAAAjC,EAAAoC,EAAAC,GACA,aAAAyG,EAAA,KAAA1B,EAAA9B,KAAA,GAAAgC,QAAAtH,EAAA8I,GAGA,SAAAC,EAAA3E,EAAAhL,EAAAgI,GACA,IAAA1H,KACA,QAAAoB,KAAAsJ,EAAA1K,EAAAoB,GAAAsJ,EAAAtJ,GAEA,OADApB,EAAAN,GAAAgI,EACA1H,EAGA,SAAAsP,EAAA5E,EAAAnC,EAAA4C,EAAA,GACA,IAAAnL,EAAAqP,EAAA3E,EAAA,UAAAA,EAAAE,QAAAO,GAMA,OALAnL,EAAAiL,WACAjL,EAAAiL,SAAAjL,EAAAiL,SAAAmB,QACApM,EAAAiL,SAAAsE,OAAAhH,EAAA4C,GACAnL,EAAAiL,SAAAuE,KAAApE,KAAA,KAAApL,EAAAiL,SAAA,OAEAjL,QA2BMyP,UAAsBjC,EAAA,EAM5BlT,YAAA6T,EAAAC,EAAAD,GACA,IAAAhI,EAAAgI,EAAAvC,MAAA,GACA5K,EAAAmH,EAAAV,IAAAtB,GACAG,EAAA6H,EAAA7H,OAAA,GACAoD,EAAA1I,EAAA0O,YAAAvB,EAAA5F,IAAAjC,EAAA8H,EAAA7F,IAAAjC,GACAmI,EAAAN,EAAAvC,KAAA,GACA1F,EAAAlF,EAAA2O,YAAAjG,GAAAkG,OAAAC,MAAAzB,EAAA7F,IAAAjC,GAGAJ,EAAA+F,QAAAmC,EAAA7F,IAAAjC,GACA,IAAAwJ,EAAA5J,EAAAlF,IAAAuH,IACA,IAAA3C,EAAAO,EAAA0F,OAAAtD,GACAwH,EAAAxH,EAAAjC,EAAA,EACA,WAAiBkH,EAAA,EACjBiB,EAAAb,QAAAmC,GACAtB,EAAAb,QAAAmC,EAAAnK,EAAAoK,QAAAC,SAGAC,MAAAJ,EAAA,GAAAK,MAAAL,EAAA,GAAAM,IAAAN,GAIAlL,KAAAuJ,cAIAvJ,KAAAwJ,YAGA9T,IAAAmU,EAAA4B,GACA,IAAAlC,EAAAM,EAAAb,QAAAyC,EAAArP,IAAA4D,KAAAuJ,YAAA5F,MACA6F,EAAAK,EAAAb,QAAAyC,EAAArP,IAAA4D,KAAAwJ,UAAA7F,MACA,GACAsG,EAAAV,IACAU,EAAAT,IACAW,EAAAZ,EAAAC,GACA,CACA,IAAAkC,EAAA1L,KAAAuJ,YAAAvC,MAAA,IAAAuC,EAAAvC,MAAA,GACA,OAAA0E,GAAA1L,KAAA2L,iBACed,EAAae,aAAArC,EAAAC,GAC5BkC,GAAA1L,KAAA6L,iBACehB,EAAaiB,aAAAvC,EAAAC,GAC5B,IAAsBqB,EAAatB,EAAAC,GAEnC,OAAWZ,EAAA,EAAamD,QAAAxC,EAAAC,GAMxB9T,UACA,IAAA6L,EAAAvB,KAAAuJ,YAAAvC,MAAA,GACA5K,EAAAmH,EAAAV,IAAAtB,GACAG,EAAA1B,KAAAuJ,YAAA7H,OAAA,GACAoD,EAAA1I,EAAA0O,YACA9K,KAAAuJ,YAAA5F,IAAAjC,EACA1B,KAAAwJ,UAAA7F,IAAAjC,GAEAqD,KACAiH,KACA,QAAAjL,EAAA+D,EAAA1B,IAA4BrC,EAAA+D,EAAAxB,OAAmBvC,IAAA,CAC/C,IAAAkL,KACA,IACA,IAAAhH,EAAAlE,EAAA3E,EAAAoH,MAAAsB,EAAA3B,KAAA6B,EAAAF,EAAA3B,KACA6B,EAAAF,EAAAzB,MACA2B,IAAAC,IACA,CACA,IAAAtB,EAAAvH,MAAA6I,GACA,IAAAF,EAAApB,GAAA,CACAoB,EAAApB,IAAA,EACA,IAAAuI,EAAA9P,EAAA4H,SAAAL,GACA3C,EAAAO,EAAA0F,OAAAtD,GACAwI,EAAArH,EAAA3B,KAAA+I,EAAA/I,KACAiJ,EAAAF,EAAA7I,MAAAyB,EAAAzB,MACA,GAAA8I,EAAA,GAAAC,EAAA,GACA,IAAAtG,EAAA9E,EAAA8E,MACAqG,EAAA,IAAArG,EAAA4E,EAAA5E,EAAA,EAAAqG,IACAC,EAAA,IACAtG,EAAA4E,EACA5E,EACAA,EAAAE,QAAAoG,EACAA,IAGApL,EADAkL,EAAA/I,KAAA2B,EAAA3B,KACAnC,EAAA5B,KAAAiN,cAAAvG,GACA9E,EAAA5B,KAAA7C,OAAAuJ,EAAA9E,EAAAoK,SAEA,GAAAc,EAAA9I,IAAA0B,EAAA1B,KAAA8I,EAAA5I,OAAAwB,EAAAxB,OAAA,CACA,IAAAwC,EAAA2E,EACAzJ,EAAA8E,MACA,UACAnB,KAAAC,IAAAsH,EAAA5I,OAAAwB,EAAAxB,QACAqB,KAAAE,IAAAqH,EAAA9I,IAAA0B,EAAA1B,MAEApC,EAAAkL,EAAA9I,IAAA0B,EAAA1B,IAAApC,EAAA5B,KAAAiN,cAAAvG,GACA9E,EAAA5B,KAAA7C,OAAAuJ,EAAA9E,EAAAoK,SAEAa,EAAAhK,KAAAjB,IAGAgL,EAAA/J,KAAAV,EAAA6D,MAAArE,GAAA1E,KAAsCiQ,EAAA,EAAQnB,KAAAc,KAG9C,MAAAM,EACAvM,KAAA6L,kBAAA7L,KAAA2L,iBAAApK,EAAAyK,EACA,WAAeM,EAAA,EAAMA,EAAA,EAAQnB,KAAAoB,GAAA,KAG7B7W,QAAA8W,EAAApB,EAAwBkB,EAAA,EAAKG,OAC7B,IAAAC,EAAAF,EAAAG,MAAAtR,OACA6P,EAAAlL,KAAAkL,OACA,QAAA3Q,EAAA,EAAmBA,EAAA2Q,EAAA7P,OAAmBd,IAAA,CACtC,IAAAgR,MAAWA,EAAAC,OAAaN,EAAA3Q,GACxBkR,EAAAe,EAAAf,QAAAjE,MAAAkF,GACAF,EAAAI,QACAnB,EAAArP,IAAAmP,EAAA5H,KACA8H,EAAArP,IAAAoP,EAAA7H,KACApJ,EAAY+R,EAAA,EAAKG,MAAArB,GAGjB,IAAA9B,EAAcV,EAAA,EAASiE,SACvBL,EAAA3C,IAAAb,QAAAwD,EAAAf,QAAAjE,MAAAkF,GAAAtQ,IAAA4D,KAAA8M,MACA,GAEAxD,GAAAkD,EAAAO,aAAAzD,GAGA5T,YAAA8W,EAAAxF,GACAhH,KAAA4M,QAAAJ,EAAA,IAAyBF,EAAA,EAAMA,EAAA,EAAQnB,KAAAnE,GAAA,MAGvCtR,YAAAsX,GACA,IAAAzL,EAAAvB,KAAAuJ,YAAAvC,MAAA,GACA5K,EAAAmH,EAAAV,IAAAtB,GACAG,EAAA1B,KAAAuJ,YAAA7H,OAAA,GACAJ,EAAAlF,EAAA2O,YACA3O,EAAA0O,YAAA9K,KAAAuJ,YAAA5F,IAAAjC,EAAA1B,KAAAwJ,UAAA7F,IAAAjC,IAEA,QAAAnH,EAAA,EAAmBA,EAAA+G,EAAAjG,OAAkBd,IACrCyS,EAAAzL,EAAA0F,OAAA3F,EAAA/G,IAAAmH,EAAAJ,EAAA/G,IAMA7E,iBACA,IAAAuX,EAAAjN,KAAAuJ,YAAAtE,OAAA,GACAiI,EAAAlN,KAAAwJ,UAAAvE,OAAA,GACA,GAAAN,KAAAC,IAAAqI,EAAAC,GAAA,WACA,IAAAC,EAAAF,EAAAjN,KAAAuJ,YAAAI,UAAA7D,MAAAC,QACAqH,EAAAF,EAAAlN,KAAAwJ,UAAAG,UAAA7D,MAAAC,QACA,OAAApB,KAAAE,IAAAsI,EAAAC,IAAApN,KAAAwJ,UAAAxC,MAAA,GAAAtB,WAMAhQ,oBAAA6T,EAAAC,EAAAD,GACA,IAAAnN,EAAAmH,EAAAV,IAAA0G,EAAAvC,MAAA,IACAtF,EAAA6H,EAAA7H,OAAA,GACA2L,EAAAjR,EAAA4H,SAAAuF,EAAA5F,IAAAjC,GACA4L,EAAAlR,EAAA4H,SAAAwF,EAAA7F,IAAAjC,GACAmI,EAAAN,EAAAvC,KAAA,GAgBA,OAfAqG,EAAAjK,KAAAkK,EAAAlK,KACAiK,EAAAjK,IAAA,IACAmG,EAAAM,EAAAb,QAAAtH,EAAAtF,MAAAiR,EAAAlK,QACAmK,EAAAhK,OAAAlH,EAAAqH,SACA+F,EAAAK,EAAAb,QACAtH,EAAAtF,QAAAoH,OAAApH,EAAAqH,OAAA,GAAA6J,EAAAjK,MAAA,OAGAiK,EAAAlK,IAAA,IACAoG,EAAAK,EAAAb,QAAAtH,EAAAtF,MAAAkR,EAAAnK,QACAkK,EAAA/J,OAAAlH,EAAAqH,SACA8F,EAAAM,EAAAb,QACAtH,EAAAtF,QAAAoH,OAAApH,EAAAqH,OAAA,GAAA4J,EAAAhK,MAAA,MAGA,IAAewH,EAAatB,EAAAC,GAM5B9T,iBACA,IAAA0G,EAAAmH,EAAAV,IAAA7C,KAAAuJ,YAAAvC,MAAA,IACAtF,EAAA1B,KAAAuJ,YAAA7H,OAAA,GACA6L,EAAAnR,EAAAoR,SAAAxN,KAAAuJ,YAAA5F,IAAAjC,GACA+L,EAAArR,EAAAoR,SAAAxN,KAAAwJ,UAAA7F,IAAAjC,GACA,GAAAiD,KAAAC,IAAA2I,EAAAE,GAAA,WACA,IAAAC,EAAAH,EAAAvN,KAAAuJ,YAAAI,UAAA7D,MAAAE,QACA2H,EAAAF,EAAAzN,KAAAwJ,UAAAG,UAAA7D,MAAAE,QACA,OAAArB,KAAAE,IAAA6I,EAAAC,IAAAvR,EAAAoH,MAGA9N,GAAAkY,GACA,OACAA,aAAuB/C,GACvB+C,EAAArE,YAAA5F,KAAA3D,KAAAuJ,YAAA5F,KACAiK,EAAApE,UAAA7F,KAAA3D,KAAAwJ,UAAA7F,IAOAjO,oBAAA6T,EAAAC,EAAAD,GACA,IAAAnN,EAAAmH,EAAAV,IAAA0G,EAAAvC,MAAA,IACAtF,EAAA6H,EAAA7H,OAAA,GACA2L,EAAAjR,EAAA4H,SAAAuF,EAAA5F,IAAAjC,GACA4L,EAAAlR,EAAA4H,SAAAwF,EAAA7F,IAAAjC,GACAmI,EAAAN,EAAAvC,KAAA,GAgBA,OAfAqG,EAAAlK,MAAAmK,EAAAnK,MACAkK,EAAAlK,KAAA,IACAoG,EAAAM,EAAAb,QAAAtH,EAAAtF,MAAAiR,EAAAjK,IAAAhH,EAAAoH,SACA8J,EAAAjK,MAAAjH,EAAAoH,QACAgG,EAAAK,EAAAb,QACAtH,EAAAtF,QAAAoH,OAAA8J,EAAAlK,IAAA,UAGAkK,EAAAnK,KAAA,IACAqG,EAAAK,EAAAb,QAAAtH,EAAAtF,MAAAkR,EAAAlK,IAAAhH,EAAAoH,SACA6J,EAAAhK,MAAAjH,EAAAoH,QACA+F,EAAAM,EAAAb,QACAtH,EAAAtF,QAAAoH,OAAA6J,EAAAjK,IAAA,SAGA,IAAeyH,EAAatB,EAAAC,GAG5B9T,SACA,OACA0J,KAAA,OACAyO,OAAA7N,KAAAuJ,YAAA5F,IACAmK,KAAA9N,KAAAwJ,UAAA7F,KAIAjO,gBAAAmU,EAAAkE,GACA,WAAelD,EAAahB,EAAAb,QAAA+E,EAAAF,QAAAhE,EAAAb,QAAA+E,EAAAD,OAI5BpY,cAAAmU,EAAAmE,EAAAC,EAAAD,GACA,WAAenD,EAAahB,EAAAb,QAAAgF,GAAAnE,EAAAb,QAAAiF,IAG5BvY,cACA,WAAewY,EAAYlO,KAAAuJ,YAAA5F,IAAA3D,KAAAwJ,UAAA7F,MAI3BkH,EAAatM,UAAA4P,SAAA,EAEbvF,EAAA,EAASwF,OAAA,OAAgBvD,SAEnBqD,EACNxY,YAAAmY,EAAAC,GACA9N,KAAA6N,SACA7N,KAAA8N,OAEApY,IAAA+V,GACA,WAAeyC,EAAYzC,EAAArP,IAAA4D,KAAA6N,QAAApC,EAAArP,IAAA4D,KAAA8N,OAE3BpY,QAAAmU,GACA,IAAAN,EAAAM,EAAAb,QAAAhJ,KAAA6N,QACArE,EAAAK,EAAAb,QAAAhJ,KAAA8N,MACA,MACA,OAAAvE,EAAAW,OAAA9K,KAAAmG,KAAAC,WACA,OAAAgE,EAAAU,OAAA9K,KAAAmG,KAAAC,WACA+D,EAAAtE,QAAAsE,EAAAW,OAAAxE,YACA8D,EAAAvE,QAAAuE,EAAAU,OAAAxE,YACAyE,EAAAZ,EAAAC,GAEA,IAAiBqB,EAAatB,EAAAC,GACdZ,EAAA,EAASyF,KAAA7E,EAAA,IAqYHlN,OAAAgS,EAAA,EAAAhS,EACtBiS,UAAAC,EAAA,YACAC,WAAAD,EAAA,WACAE,QAAAF,EAAA,WACAG,UAAAH,EAAA,UAEAI,kBAAAC,EAAA,YACAC,mBAAAD,EAAA,WACAE,gBAAAF,EAAA,WACAG,kBAAAH,EAAA,UAEAI,UAAAC,EACAC,gBAAAD,EACAE,OAAAF,EACAG,aAAAH,IAGA,SAAAI,EAAArS,EAAAC,EAAAkM,GACA,OAAAA,EAAAmG,GAAAtS,EAAAmM,aACAlM,KAAAD,EAAAuP,GAAAO,aAAA3D,GAAAoG,mBACA,GAGA,SAAAhB,EAAA1K,EAAAC,GACA,OAAA9G,EAAAC,EAAAR,KACA,IAAA4M,EAAArM,EAAAmM,UACA,GAAAE,aAAuBuB,EACvB,OAAAyE,EACArS,EACAC,EACQ0L,EAAA,EAASyF,KAAA/E,EAAAE,UAAAzF,IAGjB,YAAAD,IAAAwF,EAAAmD,MAAA,SACA,IAAAnC,EAAAmF,EAAA/S,EAAAoH,EAAAC,GACA,SAAAuG,EAAA,SACA,YAAAxG,EACA,OAAAwL,EACArS,EACAC,EACQ0L,EAAA,EAASyF,KAAApR,EAAA4M,IAAAb,QAAAM,EAAAwE,KAAA/J,OAEZ,CACL,IAEA2L,EAFAC,EAAA1S,EAAA4M,IAAAb,QAAAsB,GACAsF,EAAArF,EAAAoF,EAAA7L,EAAAC,GAMA,OAAAuL,EAAArS,EAAAC,EAJAwS,EAAAE,EAA0BhH,EAAA,EAASyF,KAAAuB,EAAA,GACnC7L,EAAA,EACiB6E,EAAA,EAASyF,KAAApR,EAAA4M,IAAAb,QAAA2G,EAAA1G,QAAA,QACNL,EAAA,EAASyF,KAAApR,EAAA4M,IAAAb,QAAA2G,EAAAjG,OAAA,UAM7B,SAAAmF,EAAA/K,EAAAC,GACA,OAAA9G,EAAAC,EAAAR,KACA,IAAA4M,EAAArM,EAAAmM,UACA,KAAAE,aAAyBuB,GAAa,CACtC,IAAAP,EAAAmF,EAAA/S,EAAAoH,EAAAC,GACA,SAAAuG,EAAA,SACAhB,EAAA,IAAgBuB,EAAa5N,EAAA4M,IAAAb,QAAAsB,IAE7B,IAAAnB,EAAAoB,EAAAjB,EAAAE,UAAA1F,EAAAC,GACA,QAAAoF,GACAmG,EACArS,EACAC,EACA,IAAU2N,EAAavB,EAAAC,YAAAJ,KAKvB,SAAA+F,EAAAjS,EAAAC,GACA,IAAAoM,EAAArM,EAAAmM,UACA,KAAAE,aAAuBuB,GAAa,SACpC,GAAA3N,EAAA,CACA,IAAAsP,EAAAvP,EAAAuP,GACAqD,EAAAtH,EAAAtL,EAAAuL,QAAAxH,KAAAqL,gBAAAjB,QACA9B,EAAAwG,YAAA,CAAA9O,EAAA2C,KACA3C,EAAAoK,QAAAmE,GAAAM,IACArD,EAAAI,QACAJ,EAAAf,QAAArP,IAAAuH,EAAA,GACA6I,EAAAf,QAAArP,IAAAuH,EAAA3C,EAAAqE,SAAA,GACA,IAAciH,EAAA,EAAKuD,EAAA,QAGnBrD,EAAAuD,YAAA7S,EAAAsP,GAEA,SAyHA,SAAAiD,EAAA/S,EAAAoH,EAAAC,GACA,KAAArH,EAAAO,MAAAmM,qBAAwCR,EAAA,GAAa,YACrD,IAAAO,MAAOA,GAAQzM,EAAAO,MAAAmM,UACf,QAAAL,EAAAI,EAAArI,MAAA,EAA+BiI,GAAA,EAAQA,IAAA,CACvC,IAAAmB,EAAAf,EAAAnC,KAAA+B,GAEA,IADAhF,EAAA,EAAAoF,EAAAlE,MAAA8D,GAAAI,EAAA6G,WAAAjH,MACAhF,EAAA,IAAAmG,EAAAxE,YAAA,YACA,GACA,QAAAwE,EAAA9K,KAAAmG,KAAAC,WACA,eAAA0E,EAAA9K,KAAAmG,KAAAC,UACA,CACA,IAAAyK,EAAA9G,EAAAF,OAAAF,GACAmH,EACA,QAAApM,EAAAC,EAAA,cAAAA,EAAA,iBACA,OAAArH,EAAAyT,eAAAD,GAAAD,EAAA,MAGA,YAgBA,IAAyBrH,EAAA,EAAS,cAuHlC,SAAAwH,EAAAnT,GACA,IAKA6H,EALAwE,EAAArM,EAAAmM,UACAN,EAAAO,EAAApM,GACAsE,EAAAuH,EAAA9B,MAAA,GACAqJ,EAAAvH,EAAApH,OAAA,GACAtF,EAAAmH,EAAAV,IAAAtB,GAWA,OARAuD,EADAwE,aAAqBuB,EACrBzO,EAAA0O,YACAxB,EAAAC,YAAA5F,IAAA0M,EACA/G,EAAAE,UAAA7F,IAAA0M,GAEAjU,EAAA4H,SAAA8E,EAAAnF,IAAA0M,IACAA,aACAvL,EAAA1I,MACA0I,EAAAvD,QACAuD,EA8cA,SAAAwL,EAAAlR,EAAA0F,EAAAyL,GAEA,MAAAC,EAAA1L,EAAA1I,IAAA2O,aACA5H,KAAA,EACAC,IAAA,EACAC,MAAA,OAAAjE,EAAA0F,EAAA1I,IAAAoH,MAAA,EACAF,OAAA,UAAAlE,EAAA0F,EAAA1I,IAAAqH,OAAA,IAGA,QAAAlJ,EAAA,EAAiBA,EAAAiW,EAAAnV,OAA0Bd,IAAA,CAC3C,MAAAyG,EAAA8D,EAAAvD,MAAA0F,OAAAuJ,EAAAjW,IACA,GAAAyG,KAAA5B,OAAAmR,EAAAE,YACA,SAIA,SAMA,SAAAC,EAAAtR,EAAAK,GAGA,OAFAA,MAAwBkR,oBAAA,IAExBA,mBApEA,SAAAvR,GACA,gBAAAnC,EAAAC,GACA,IAAAgM,EAAAjM,GAAA,SACA,GAAAC,EAAA,CACA,IAAAqT,EAAAhI,EAAAtL,EAAAuL,QACA1D,EAAAsL,EAAAnT,GACAuP,EAAAvP,EAAAuP,GACAlL,EAAAwD,EAAA1I,IAAA2O,YACA,UAAA3L,EACA,IAAA8D,EAAA4B,EAAA3B,KAAA,EAAA2B,EAAAzB,MAAAyB,EAAA1I,IAAAqH,QACA,OAAArE,EACA,IAAA8D,EAAA,EAAA4B,EAAA1B,IAAA0B,EAAA1I,IAAAoH,MAAAsB,EAAAxB,QACAwB,GAEA4D,EAAApH,EAAAlF,IAAAuH,GAAAmB,EAAAvD,MAAA0F,OAAAtD,IACA,IACA,IAAApJ,EAAA,EACAA,EAAA+G,EAAAjG,OACAd,IAEAmO,EAAAnO,GAAA6E,MAAAmR,EAAAE,aACAjE,EAAAoE,cACA9L,EAAAuL,WAAA/O,EAAA/G,GACAgW,EAAAvP,KACA0H,EAAAnO,GAAAuL,OAEA,MAAA0G,EAAAG,MAAAtR,OACA,IACA,IAAAd,EAAA,EACAA,EAAA+G,EAAAjG,OACAd,IAEAiS,EAAAoE,cACA9L,EAAAuL,WAAA/O,EAAA/G,GACAgW,EAAAE,YACA/H,EAAAnO,GAAAuL,OAEA5I,EAAAsP,GAEA,UA6BAqE,CAAAzR,GAEA,SAAAnC,EAAAC,GACA,IAAAgM,EAAAjM,GAAA,SACA,GAAAC,EAAA,CACA,IAAAqT,EAAAhI,EAAAtL,EAAAuL,QACA1D,EAAAsL,EAAAnT,GACAuP,EAAAvP,EAAAuP,GAEAsE,EAAAR,EAAA,MAAAxL,EAAAyL,GACAQ,EAAAT,EAAA,SAAAxL,EAAAyL,GASAS,GANA,WAAA5R,EACA0R,EACA,QAAA1R,GACA2R,GAGA,IAEAE,EACA,UAAA7R,EACA,IAAA8D,EAAA,EAAA8N,EAAA,EAAAlM,EAAA1I,IAAAqH,QACA,OAAArE,EACA,IAAA8D,EAAA8N,EAAA,EAAAlM,EAAA1I,IAAAoH,MAAA,GACAsB,EAEAoM,EACA,UAAA9R,EACA2R,EACAR,EAAAvP,KACAuP,EAAAE,YACA,OAAArR,EACA0R,EACAP,EAAAvP,KACAuP,EAAAE,YACAF,EAAAvP,KAEA8D,EAAA1I,IAAA2O,YAAAkG,GAAAE,QAAAC,IACA,MAAAnB,EAAAmB,EAAAtM,EAAAuL,WACArP,EAAAwL,EAAA3C,IAAA5C,OAAAgJ,GAEAjP,GACAwL,EAAAoE,cAAAX,EAAAiB,EAAAlQ,EAAA8E,SAIA5I,EAAAsP,GAEA,UAMAkE,EAAA,OAA2CC,oBAAA,IAI3CD,EAAA,UACAC,oBAAA,IAKAD,EAAA,QACAC,oBAAA,IA6IA,IAAgB/H,EAAA,EAAS,uBC/tEzB,IAAsBA,EAAA,EAAS,UCtD/B,IAKAyI,EAAA,aAEAA,EAAA9S,UAAA+S,OAAA,SAAA1D,GACA,OAAAA,EAAAvS,QACAuS,EAAAyD,EAAAlG,KAAAyC,IAEA5N,KAAA3E,QAAAuS,GACAA,EAAAvS,OAZA,KAYA2E,KAAAuR,WAAA3D,IACA5N,KAAA3E,OAbA,KAaAuS,EAAA4D,YAAAxR,OACAA,KAAAyR,YAAA7D,IANsB5N,MAWtBqR,EAAA9S,UAAAmT,QAAA,SAAA9D,GACA,OAAAA,EAAAvS,OACAgW,EAAAlG,KAAAyC,GAAA0D,OAAAtR,MADsBA,MAItBqR,EAAA9S,UAAAkT,YAAA,SAAA7D,GACA,WAAA+D,EAAA3R,KAAA4N,IAKAyD,EAAA9S,UAAAiJ,MAAA,SAAA2D,EAAA2B,GAIA,YAHA,IAAA3B,MAAA,QACA,IAAA2B,MAAA9M,KAAA3E,QAEA8P,GAAA2B,EAAmBuE,EAAA5E,MACnBzM,KAAA4R,WAAAjN,KAAAE,IAAA,EAAAsG,GAAAxG,KAAAC,IAAA5E,KAAA3E,OAAAyR,KAKAuE,EAAA9S,UAAAsE,IAAA,SAAAtI,GACA,KAAAA,EAAA,GAAAA,GAAAyF,KAAA3E,QACA,OAAA2E,KAAA6R,SAAAtX,IAQA8W,EAAA9S,UAAA4S,QAAA,SAAAnE,EAAA7B,EAAA2B,QACA,IAAA3B,MAAA,QACA,IAAA2B,MAAA9M,KAAA3E,QAEA8P,GAAA2B,EACK9M,KAAA8R,aAAA9E,EAAA7B,EAAA2B,EAAA,GAEA9M,KAAA+R,qBAAA/E,EAAA7B,EAAA2B,EAAA,IAMLuE,EAAA9S,UAAAnC,IAAA,SAAA4Q,EAAA7B,EAAA2B,QACA,IAAA3B,MAAA,QACA,IAAA2B,MAAA9M,KAAA3E,QAEA,IAAAD,KAEA,OADA4E,KAAAmR,QAAA,SAAAa,EAAAzX,GAAkC,OAAAa,EAAA6G,KAAA+K,EAAAgF,EAAAzX,KAAiC4Q,EAAA2B,GACnE1R,GAMAiW,EAAAlG,KAAA,SAAA8G,GACA,OAAAA,aAAAZ,EAAuCY,EACvCA,KAAA5W,OAAA,IAAA6W,EAAAD,GAAAZ,EAAA5E,OAGA,IAAAyF,EAAA,SAAAb,GACA,SAAAa,EAAAD,GACAZ,EAAA5S,KAAAuB,MACAA,KAAAiS,SAGAZ,IAAAa,EAAAC,UAAAd,GACAa,EAAA3T,UAAAjC,OAAAC,OAAA8U,KAAA9S,WACA2T,EAAA3T,UAAA6T,YAAAF,EAEA,IAAAG,GAA4BhX,QAAUiX,cAAA,GAAqBxR,OAASwR,cAAA,IAyCpE,OAvCAJ,EAAA3T,UAAAgU,QAAA,WACA,OAAAvS,KAAAiS,QAGAC,EAAA3T,UAAAqT,WAAA,SAAAzG,EAAA2B,GACA,UAAA3B,GAAA2B,GAAA9M,KAAA3E,OAAyC2E,KACzC,IAAAkS,EAAAlS,KAAAiS,OAAAzK,MAAA2D,EAAA2B,KAGAoF,EAAA3T,UAAAsT,SAAA,SAAAtX,GACA,OAAAyF,KAAAiS,OAAA1X,IAGA2X,EAAA3T,UAAAuT,aAAA,SAAA9E,EAAA7B,EAAA2B,EAAApL,GACA,QAAAnH,EAAA4Q,EAAsB5Q,EAAAuS,EAAQvS,IACvB,QAAAyS,EAAAhN,KAAAiS,OAAA1X,GAAAmH,EAAAnH,GAA8C,UAGrD2X,EAAA3T,UAAAwT,qBAAA,SAAA/E,EAAA7B,EAAA2B,EAAApL,GACA,QAAAnH,EAAA4Q,EAAA,EAA0B5Q,GAAAuS,EAASvS,IAC5B,QAAAyS,EAAAhN,KAAAiS,OAAA1X,GAAAmH,EAAAnH,GAA8C,UAGrD2X,EAAA3T,UAAAgT,WAAA,SAAA3D,GACA,GAAA5N,KAAA3E,OAAAuS,EAAAvS,QApHA,IAqHO,WAAA6W,EAAAlS,KAAAiS,OAAAO,OAAA5E,EAAA2E,aAGPL,EAAA3T,UAAAiT,YAAA,SAAA5D,GACA,GAAA5N,KAAA3E,OAAAuS,EAAAvS,QAzHA,IA0HO,WAAA6W,EAAAtE,EAAA2E,UAAAC,OAAAxS,KAAAiS,UAGPI,EAAAhX,OAAAwH,IAAA,WAA+C,OAAA7C,KAAAiS,OAAA5W,QAE/CgX,EAAAvR,MAAA+B,IAAA,WAA8C,UAE9CvG,OAAAmW,iBAAAP,EAAA3T,UAAA8T,GAEAH,EAnDA,CAoDCb,GAIDA,EAAA5E,MAAA,IAAAyF,MAEA,IAAAP,EAAA,SAAAN,GACA,SAAAM,EAAAxO,EAAAE,GACAgO,EAAA5S,KAAAuB,MACAA,KAAAmD,OACAnD,KAAAqD,QACArD,KAAA3E,OAAA8H,EAAA9H,OAAAgI,EAAAhI,OACA2E,KAAAc,MAAA6D,KAAAE,IAAA1B,EAAArC,MAAAuC,EAAAvC,OAAA,EA2DA,OAxDAuQ,IAAAM,EAAAQ,UAAAd,GACAM,EAAApT,UAAAjC,OAAAC,OAAA8U,KAAA9S,WACAoT,EAAApT,UAAA6T,YAAAT,EAEAA,EAAApT,UAAAgU,QAAA,WACA,OAAAvS,KAAAmD,KAAAoP,UAAAC,OAAAxS,KAAAqD,MAAAkP,YAGAZ,EAAApT,UAAAsT,SAAA,SAAAtX,GACA,OAAAA,EAAAyF,KAAAmD,KAAA9H,OAAA2E,KAAAmD,KAAAN,IAAAtI,GAAAyF,KAAAqD,MAAAR,IAAAtI,EAAAyF,KAAAmD,KAAA9H,SAGAsW,EAAApT,UAAAuT,aAAA,SAAA9E,EAAA7B,EAAA2B,EAAApL,GACA,IAAAgR,EAAA1S,KAAAmD,KAAA9H,OACA,QAAA8P,EAAAuH,IACA,IAAA1S,KAAAmD,KAAA2O,aAAA9E,EAAA7B,EAAAxG,KAAAC,IAAAkI,EAAA4F,GAAAhR,QAEAoL,EAAA4F,IACA,IAAA1S,KAAAqD,MAAAyO,aAAA9E,EAAArI,KAAAE,IAAAsG,EAAAuH,EAAA,GAAA/N,KAAAC,IAAA5E,KAAA3E,OAAAyR,GAAA4F,EAAAhR,EAAAgR,UADA,IAKAf,EAAApT,UAAAwT,qBAAA,SAAA/E,EAAA7B,EAAA2B,EAAApL,GACA,IAAAgR,EAAA1S,KAAAmD,KAAA9H,OACA,QAAA8P,EAAAuH,IACA,IAAA1S,KAAAqD,MAAA0O,qBAAA/E,EAAA7B,EAAAuH,EAAA/N,KAAAE,IAAAiI,EAAA4F,KAAAhR,EAAAgR,QAEA5F,EAAA4F,IACA,IAAA1S,KAAAmD,KAAA4O,qBAAA/E,EAAArI,KAAAC,IAAAuG,EAAAuH,GAAA5F,EAAApL,UADA,IAKAiQ,EAAApT,UAAAqT,WAAA,SAAAzG,EAAA2B,GACA,MAAA3B,GAAA2B,GAAA9M,KAAA3E,OAAyC,OAAA2E,KACzC,IAAA0S,EAAA1S,KAAAmD,KAAA9H,OACA,OAAAyR,GAAA4F,EAAwB1S,KAAAmD,KAAAqE,MAAA2D,EAAA2B,GACxB3B,GAAAuH,EAA0B1S,KAAAqD,MAAAmE,MAAA2D,EAAAuH,EAAA5F,EAAA4F,GAC1B1S,KAAAmD,KAAAqE,MAAA2D,EAAAuH,GAAApB,OAAAtR,KAAAqD,MAAAmE,MAAA,EAAAsF,EAAA4F,KAGAf,EAAApT,UAAAgT,WAAA,SAAA3D,GACA,IAAA+E,EAAA3S,KAAAqD,MAAAkO,WAAA3D,GACA,GAAA+E,EAAgB,WAAAhB,EAAA3R,KAAAmD,KAAAwP,IAGhBhB,EAAApT,UAAAiT,YAAA,SAAA5D,GACA,IAAA+E,EAAA3S,KAAAmD,KAAAqO,YAAA5D,GACA,GAAA+E,EAAgB,WAAAhB,EAAAgB,EAAA3S,KAAAqD,QAGhBsO,EAAApT,UAAAkT,YAAA,SAAA7D,GACA,OAAA5N,KAAAmD,KAAArC,OAAA6D,KAAAE,IAAA7E,KAAAqD,MAAAvC,MAAA8M,EAAA9M,OAAA,EACO,IAAA6Q,EAAA3R,KAAAmD,KAAA,IAAAwO,EAAA3R,KAAAqD,MAAAuK,IACP,IAAA+D,EAAA3R,KAAA4N,IAGA+D,EAjEA,CAkECN,GAIcuB,EAFfvB,EC1LA,MAAAwB,EAAA,UACMC,EACNpd,YAAAqd,EAAAC,GACAhT,KAAA+S,QACA/S,KAAAgT,aAIAtd,SAAAuH,EAAAgW,GACA,MAAAjT,KAAAgT,WACA,YACA,IAQAE,EAAAxG,EARApC,EAAAtK,KAAA+S,MAAA1X,OACA,MAAeiP,IAAA,CAEf,GADAtK,KAAA+S,MAAAlQ,IAAAyH,EAAA,GACAlB,UAAA,GACAkB,EACA,OAIA2I,IACAC,EAAAlT,KAAAmT,UAAA7I,EAAAtK,KAAA+S,MAAA1X,QACAqR,EAAAwG,EAAAE,KAAA/X,QAEA,IACA+N,EAAAiK,EADAC,EAAArW,EAAAuP,GAEA+G,KAAAC,KA+BA,OA9BAxT,KAAA+S,MAAA5B,QAAA,CAAAsC,EAAAlZ,KACA,IAAAkZ,EAAAC,KAOA,OANAR,IACAA,EAAAlT,KAAAmT,UAAA7I,EAAA/P,EAAA,GACAmS,EAAAwG,EAAAE,KAAA/X,QAEAqR,SACA8G,EAAAvR,KAAAwR,GAGA,GAAAP,EAAA,CACAM,EAAAvR,KAAA,IAAA0R,EAAAF,EAAArX,MACA,IAAAA,EAAAsX,EAAAD,EAAAC,KAAAtX,IAAA8W,EAAA1L,MAAAkF,IACAgH,GAAAJ,EAAAM,UAAAF,GAAA7J,MACAzN,EAAAkX,EAAA7H,QAAA2H,KAAAE,EAAA7H,QAAA2H,KAAA/X,OAAA,GACAkY,EAAAtR,KAAA,IAAA0R,EAAAvX,OAAAyX,SAAAN,EAAAlY,OAAAmY,EAAAnY,UAEAqR,IACAtQ,GACA8W,EAAAY,UAAA1X,EAAAsQ,QAGA4G,EAAAM,UAAAH,EAAAC,MAEA,OAAAD,EAAArK,WACAA,EAAA8J,EAAAO,EAAArK,UAAAhN,IAAA8W,EAAA1L,MAAAkF,IAAA+G,EAAArK,UACAiK,EAAA,IAAgCP,EAAM9S,KAAA+S,MAAAvL,MAAA,EAAA8C,GAAAgH,OAAAkC,EAAAlT,UAAAkS,OAAAe,IAAAvT,KAAAgT,WAAA,IACtC,QAHA,GAKShT,KAAA+S,MAAA1X,OAAA,IACOgY,YAAAC,YAAAlK,aAGhB1T,aAAA4d,EAAAlK,EAAA2K,EAAAd,GACA,IAAAe,KAAAhB,EAAAhT,KAAAgT,WACAiB,EAAAjU,KAAA+S,MAAAmB,GAAAjB,GAAAgB,EAAA5Y,OAAA4Y,EAAApR,IAAAoR,EAAA5Y,OAAA,QACA,QAAAd,EAAA,EAAuBA,EAAA+Y,EAAA3G,MAAAtR,OAA4Bd,IAAA,CACnD,IACA4Z,EADAT,EAAAJ,EAAA3G,MAAApS,GAAA6Z,OAAAd,EAAAe,KAAA9Z,IACAkZ,EAAA,IAAAE,EAAAL,EAAA7H,QAAA2H,KAAA7Y,GAAAmZ,EAAAtK,IACA+K,EAAAD,KAAArW,MAAA4V,MACAA,EAAAU,EACA5Z,EACAyZ,EAAAvT,MAEAwT,IAAAzM,MAAA,EAAAyM,EAAA5Y,OAAA,IAEA2Y,EAAA/R,KAAAwR,GACArK,IACA4J,IACA5J,OAAAyK,GAEAZ,IACAiB,EAAAT,GAEA,IAAAa,EAAAtB,EAAAe,EAAAjT,MAKA,OAJAwT,EAAAC,IACAN,EAwGA,SAAAlB,EAAAxM,GACA,IAAAiO,EAOA,OANAzB,EAAA5B,QAAA,CAAAsC,EAAAlZ,KACA,GAAAkZ,EAAArK,WAAA,GAAA7C,IAEA,OADAiO,EAAAja,GACA,IAGAwY,EAAAvL,MAAAgN,GAhHAC,CAAAR,EAAAK,GACAtB,GAAAsB,GAEA,IAAmBxB,EAAMmB,EAAA3C,OAAA0C,GAAAhB,GAEzBtd,UAAAyV,EAAA2B,GACA,IAAAsG,EAAA,IAAuBsB,EAAA,EAMvB,OALA1U,KAAA+S,MAAA5B,QAAA,CAAAsC,EAAAlZ,KACA,IAAAoa,EAAA,MAAAlB,EAAAmB,cAAAra,EAAAkZ,EAAAmB,cAAAzJ,EACAiI,OAAA/X,OAAAoY,EAAAmB,kBAAAf,EACAT,EAAAU,UAAAL,EAAArX,IAAAuY,IACSxJ,EAAA2B,GACTsG,EAEA1d,QAAAmf,GACA,UAAA7U,KAAAgT,WACAhT,KACA,IAAmB8S,EAAM9S,KAAA+S,MAAAzB,OAAAuD,EAAAzY,OAAA,IAAAuX,EAAAvX,KAAA4D,KAAAgT,YAMzBtd,QAAAof,EAAAC,GACA,IAAA/U,KAAAgT,WACA,OAAAhT,KACA,IAAAgV,KAAAtT,EAAAiD,KAAAE,IAAA,EAAA7E,KAAA+S,MAAA1X,OAAA0Z,GACAtJ,EAAAqJ,EAAArJ,QACAwJ,EAAAH,EAAAnI,MAAAtR,OACA2X,EAAAhT,KAAAgT,WACAhT,KAAA+S,MAAA5B,QAAAsC,IAAoCA,EAAArK,WACpC4J,KAA2BtR,GAC3B,IAAAwT,EAAAH,EACA/U,KAAA+S,MAAA5B,QAAAsC,IACA,IAAA9P,EAAA8H,EAAA0J,YAAAD,GACA,SAAAvR,EACA,OACAsR,EAAAtQ,KAAAC,IAAAqQ,EAAAtR,GACA,IAAAvH,EAAAqP,EAAA2H,KAAAzP,GACA,GAAA8P,EAAAC,KAAA,CACA,IAAAA,EAAAoB,EAAAnI,MAAAhJ,GAAAyQ,OAAAU,EAAAT,KAAA1Q,IACAyF,EAAAqK,EAAArK,WAAAqK,EAAArK,UAAAhN,IAAAqP,EAAAjE,MAAA0N,EAAA,EAAAvR,IACAyF,GACA4J,IACAgC,EAAA/S,KAAA,IAAA0R,EAAAvX,EAAAsX,EAAAtK,SAGA4L,EAAA/S,KAAA,IAAA0R,EAAAvX,KAESsF,GACT,IAAA0T,KACA,QAAA7a,EAAAwa,EAAkCxa,EAAA0a,EAAc1a,IAChD6a,EAAAnT,KAAA,IAAA0R,EAAAlI,EAAA2H,KAAA7Y,KACA,IAAAwY,EAAA/S,KAAA+S,MAAAvL,MAAA,EAAA9F,GAAA4P,OAAA8D,GAAA9D,OAAA0D,GACAK,EAAA,IAAyBvC,EAAMC,EAAAC,GAG/B,OAFAqC,EAAAC,iBAAAzC,IACAwC,IAAAE,SAAAvV,KAAA+S,MAAA1X,OAAA2Z,EAAA3Z,SACAga,EAEA3f,iBACA,IAAA8f,EAAA,EAGA,OAFAxV,KAAA+S,MAAA5B,QAAAsC,IAAoCA,EAAAC,MACpC8B,MACAA,EAQA9f,SAAA+f,EAAAzV,KAAA+S,MAAA1X,QACA,IAAA6X,EAAAlT,KAAAmT,UAAA,EAAAsC,GAAA/I,EAAAwG,EAAAE,KAAA/X,OACA0X,KAAA2C,EAAA,EA2BA,OA1BA1V,KAAA+S,MAAA5B,QAAA,CAAAsC,EAAAlZ,KACA,GAAAA,GAAAkb,EACA1C,EAAA9Q,KAAAwR,GACAA,EAAArK,WACAsM,SAEA,GAAAjC,EAAAC,KAAA,CACA,IAAAA,EAAAD,EAAAC,KAAAtX,IAAA8W,EAAA1L,MAAAkF,IAAAtQ,EAAAsX,KAAAiC,SAIA,GAHAjJ,IACAtQ,GACA8W,EAAAY,UAAA1X,EAAAsQ,GACAgH,EAAA,CACA,IAAAtK,EAAAqK,EAAArK,WAAAqK,EAAArK,UAAAhN,IAAA8W,EAAA1L,MAAAkF,IACAtD,GACAsM,IACA,IAAAvB,EAAAyB,EAAA,IAAAjC,EAAAvX,EAAAgY,SAAAV,EAAAtK,GAAAyM,EAAA9C,EAAA1X,OAAA,GACA8Y,EAAApB,EAAA1X,QAAA0X,EAAA8C,GAAAhY,MAAA+X,IACA7C,EAAA8C,GAAA1B,EAEApB,EAAA9Q,KAAA2T,SAGAnC,EAAArX,KACAsQ,KAES1M,KAAA+S,MAAA1X,OAAA,GACT,IAAmByX,EAAOF,EAAYzH,KAAA4H,EAAAzS,WAAAoV,IAGtC5C,EAAMrG,MAAA,IAAaqG,EAAOF,EAAYnG,MAAA,SAWtCkH,EACAje,YAEA0G,EAEAsX,EAIAtK,EAGAwL,GACA5U,KAAA5D,MACA4D,KAAA0T,OACA1T,KAAAoJ,YACApJ,KAAA4U,eAEAlf,MAAAkY,GACA,GAAA5N,KAAA0T,MAAA9F,EAAA8F,OAAA9F,EAAAxE,UAAA,CACA,IAAAsK,EAAA9F,EAAA8F,KAAA7V,MAAAmC,KAAA0T,MACA,GAAAA,EACA,WAAAC,EAAAD,EAAAiC,SAAAvB,SAAAV,EAAA1T,KAAAoJ,mBAOA0M,EACApgB,YAAAqJ,EAAAgX,EAAAC,EAAAC,GACAjW,KAAAjB,OACAiB,KAAA+V,SACA/V,KAAAgW,aACAhW,KAAAiW,YAGA,MAAA1B,EAAA,GA+CA,SAAA2B,EAAA9Z,GACA,IAAAhB,KAEA,OADAgB,EAAA+U,QAAA,CAAAgF,EAAAC,EAAAjL,EAAA2B,IAAA1R,EAAA6G,KAAAkJ,EAAA2B,IACA1R,EAEA,SAAAib,EAAAnL,EAAAO,GACA,IAAAP,EACA,YACA,IAAA9P,KACA,QAAAb,EAAA,EAAmBA,EAAA2Q,EAAA7P,OAAmBd,GAAA,GACtC,IAAA4Q,EAAAM,EAAArP,IAAA8O,EAAA3Q,GAAA,GAAAuS,EAAArB,EAAArP,IAAA8O,EAAA3Q,EAAA,OACA4Q,GAAA2B,GACA1R,EAAA6G,KAAAkJ,EAAA2B,GAEA,OAAA1R,EAIA,SAAAkb,EAAAC,EAAAtZ,EAAAC,EAAAsZ,GACA,IAAAvD,EAAAwD,EAAAxZ,GACA8W,EAAA2C,EAAA7T,IAAA5F,GAAAsI,KAAAoR,OACAlW,GAAA+V,EAAAD,EAAAR,OAAAQ,EAAAxX,MAAA6X,SAAA3Z,EAAAgW,GACA,IAAAxS,EACA,OACA,IAAA2I,EAAA3I,EAAA2I,UAAAJ,QAAAvI,EAAA6S,UAAAzJ,KACAgN,GAAAL,EAAAD,EAAAxX,KAAAwX,EAAAR,QAAAe,aAAArW,EAAA6S,UAAArW,EAAAmM,UAAA2N,cAAAhD,EAAAd,GACA+D,EAAA,IAAAlB,EAAAU,EAAAK,EAAApW,EAAA4S,UAAAmD,EAAA/V,EAAA4S,UAAAwD,EAAA,QACA3Z,EAAAuD,EAAA6S,UAAAvG,aAAA3D,GAAA6N,QAAAP,GAAwEF,OAAAU,aAAAF,IAA8BxH,kBAEtG,IAAA2H,GAAA,EAAAC,EAAA,KAKA,SAAAX,EAAAxZ,GACA,IAAAoa,EAAApa,EAAAoa,QACA,GAAAD,GAAAC,EAAA,CACAF,GAAA,EACAC,EAAAC,EACA,QAAA9c,EAAA,EAAuBA,EAAA8c,EAAAhc,OAAoBd,IAC3C,GAAA8c,EAAA9c,GAAAgL,KAAA+R,qBAAA,CACAH,GAAA,EACA,OAGA,OAAAA,EAUA,MAAAT,EAAA,IAAuB9N,EAAA,EAAS,WAChC2O,EAAA,IAA4B3O,EAAA,EAAS,gBAUrC,SAAS4O,EAAOb,MAGhB,OAFAA,GAAc7V,MAAA6V,EAAA7V,OAAA,IACd2W,cAAAd,EAAAc,eAAA,KACA,IAAe7O,EAAA,GACfhM,IAAA8Z,EACAzZ,OACAya,KAAA,IACA,IAAA5B,EAAwChD,EAAMrG,MAAQqG,EAAMrG,MAAA,QAE5DkL,MAAA,CAAAnL,EAAAoL,EAAA3a,KAxHA,SAAAsZ,EAAAtZ,EAAAuP,EAAA/M,GACA,IAAAoY,EAAAC,EAAAtL,EAAAuL,QAAArB,GACA,GAAAoB,EACA,OAAAA,EAAAZ,aACA1K,EAAAuL,QAAAR,KACAhB,EAAA,IAAAT,EAAAS,EAAAxX,KAAAwX,EAAAR,OAAA,SACA,IAAAiC,EAAAxL,EAAAuL,QAAA,uBACA,MAAAvL,EAAAG,MAAAtR,OACA,OAAAkb,EAEA,GAAAyB,KAAAD,QAAArB,GACA,OAAAsB,EAAAD,QAAArB,GAAAF,KACA,IAAAV,EAAAS,EAAAxX,KAAA+X,aAAAtK,OAAAqH,EAAApU,EAAAgX,EAAAxZ,IAAAsZ,EAAAR,OAAAG,EAAA1J,EAAAf,QAAA2H,KAAA5G,EAAAG,MAAAtR,OAAA,IAAAkb,EAAAN,UAEA,IAAAH,EAAAS,EAAAxX,KAAAwX,EAAAR,OAAAe,aAAAtK,OAAAqH,EAAApU,EAAAgX,EAAAxZ,IAAA,KAAAsZ,EAAAN,UAEA,QAAAzJ,EAAAuL,QAAA,iBAAAC,IAAA,IAAAA,EAAAD,QAAA,gBAOA,OAAAF,EAAArL,EAAAuL,QAAA,YAGA,IAAAjC,EAAAS,EAAAxX,KAAA8Y,QAAArL,EAAAqL,GAAAtB,EAAAR,OAAA8B,QAAArL,EAAAqL,GAAAxB,EAAAE,EAAAP,WAAAxJ,EAAAf,SAAA8K,EAAAN,UAGA,IAAAH,EAAAS,EAAAxX,KAAAkZ,QAAAzL,EAAAf,QAAA2H,MAAAmD,EAAAR,OAAAkC,QAAAzL,EAAAf,QAAA2H,MAAAiD,EAAAE,EAAAP,WAAAxJ,EAAAf,SAAA8K,EAAAN,UAbA,CAEA,IAAAiC,EAAA,GAAA3B,EAAAN,WAAA+B,IAAAzB,EAAAN,UAAAzJ,EAAA2L,MAAA,GAAA1Y,EAAAgY,gBAcA,SAAAnE,EAAA0C,GACA,IAAAA,EACA,SACA,IAAA1C,EAAAvD,WACA,SACA,IAAAqI,GAAA,EAMA,OALA9E,EAAA7H,QAAA2H,KAAA,GAAAjC,QAAA,CAAAzP,EAAA4I,KACA,QAAA/P,EAAA,EAAuBA,EAAAyb,EAAA3a,OAAuBd,GAAA,EAC9CmH,GAAAsU,EAAAzb,EAAA,IAAA+P,GAAA0L,EAAAzb,KACA6d,GAAA,KAEAA,EAxBAC,CAAA7L,EAAA+J,EAAAP,aACAA,EAAAgC,EAAA3B,EAAAE,EAAAP,WAAAxJ,EAAAf,SAAAyK,EAAA1J,EAAAf,QAAA2H,KAAA5G,EAAAG,MAAAtR,OAAA,IACA,WAAAya,EAAAS,EAAAxX,KAAA+X,aAAAtK,EAAA0L,EAAAjb,EAAAmM,UAAA2N,mBAAAlD,EAAApU,EAAAgX,EAAAxZ,IAAwJ6V,EAAMrG,MAAAuJ,EAAAxJ,EAAA2L,QAoG9JG,CAAAV,EAAA3a,EAAAuP,EAAAmK,IAGAA,SACA1a,OACAsc,iBACA7iB,YAAAgH,EAAAoC,GACA,IAAA0Z,EAAA1Z,EAAA0Z,UACAC,EAAA,eAAAD,EAAAE,GAAA,eAAAF,EAAAhC,GAAA,KACA,QAAAiC,IAEA3Z,EAAA6Z,iBACAF,EAAA/b,EAAAO,MAAAP,EAAAQ,gBASA,MAAAwb,GAAA,CAAAzb,EAAAC,KACA,IAAA0a,EAAAlB,EAAAkC,SAAA3b,GACA,SAAA2a,GAAA,GAAAA,EAAA7Y,KAAAiU,cAEA9V,GACAoZ,EAAAsB,EAAA3a,EAAAC,GAAA,IACA,IAKAsZ,GAAA,CAAAvZ,EAAAC,KACA,IAAA0a,EAAAlB,EAAAkC,SAAA3b,GACA,SAAA2a,GAAA,GAAAA,EAAA7B,OAAA/C,cAEA9V,GACAoZ,EAAAsB,EAAA3a,EAAAC,GAAA,IACA;;;;;;MC5YM2b,WAAmBC,EAAA,EACzBhe,WACA,mBAGA0N,aACA,OACA4C,QAAA,SACA2N,MAAA,QACAC,UAAA,EACAC,WAAA,EACAC,WACAC,IAAA,eAEAC,MAAA,sBAIA1jB,UAAA0J,KACAA,IAEA,UAAiB9C,OAAA+c,EAAA,EAAA/c,CAAU8C,GAG3B1J,MAAA0J,KACAA,IAEA,OACAka,SAAgBhd,OAAA+c,EAAA,EAAA/c,CAAU8C,IAI1B1J,YAAA0J,KACAA,IAEA,OAAY9C,OAAA+c,EAAA,EAAA/c,CAAiB,WAAA8C,WAKvBma,WAAmBT,EAAA,EACzBhe,WACA,oBAGA0N,aACA,OACA4C,QAAA,aACA2N,MAAA,QACAG,WACAC,IAAA,OAEAC,MAAA,cAIA1jB,UAAA0J,KACAA,EAAAoJ,OACAA,IAEA,UAAiBlM,OAAA+c,EAAA,EAAA/c,CAAU8C,EAAAoJ,EAAAE,MAAA8Q,WAG3B9jB,MAAA0J,KACAA,EAAAoJ,OACAA,IAEA,OACAiR,eAAsBnd,OAAA+c,EAAA,EAAA/c,CAAU8C,EAAAoJ,EAAAE,MAAA8Q,YAIhC9jB,YAAA0J,KACAA,IAEA,OAAY9C,OAAA+c,EAAA,EAAA/c,CAAiB,iBAAA8C,WAKvBsa,WAAkBZ,EAAA,EACxBhe,WACA,mBAGA0N,aACA,OACA4C,QAAA,QACAuO,MAAA,GACAZ,MAAA,QACAre,MAAA,EACAse,UAAA,EACAC,WAAA,EACAC,WACAC,IAAA,MACAS,mBAAA,SAEAR,MAAA,wBAIA1jB,UAAA0J,KACAA,EAAAoJ,OACAA,IAEA,UAAiBlM,OAAA+c,EAAA,EAAA/c,CAAe8C,EAAAoJ,EAAAE,MAAArG,WAGhC3M,MAAA0J,KACAA,IAEA,OACAya,gBAAuBvd,OAAA+c,EAAA,EAAA/c,CAAY8C,IAInC1J,YAAA0J,KACAA,IAEA,OAAY9C,OAAA+c,EAAA,EAAA/c,CAAsB,QAAA8C,WAsM5B0a,WAAgBhB,EAAA,EACtBhe,WACA,gBAGAif,qBACA,OACAC,QAAA,cAIAxR,aACA,OACA1C,OACAmU,OACAC,QAAA,IAGA9O,QAAA,UACA2N,MAAA,QACAC,UAAA,EACAC,WAAA,EACAC,SAAAlZ,KAAAP,QAAAua,OAAA5d,IAAA6d,KACAd,QAAiBc,IACjBnU,OACAmU,YAGAb,MAAApS,QAA0BA,EAAAlB,MAAAmU,QAAiB,IAI3CvkB,UAAA0J,KACAA,EAAAoJ,OACAA,IAEA,OAAA1C,GAAoBxJ,OAAA+c,EAAA,EAAA/c,CAAe8C,EAAAoJ,EAAAE,MAAArG,UAAAyD,GAGnCpQ,MAAA0J,KACAA,IAEA,OAAAY,KAAAP,QAAAua,OAAAG,OAAA,CAAApH,EAAAkH,SAA0DlH,MAE1Drd,eAAuBukB,KAAU3d,OAAA+c,EAAA,EAAA/c,CAAY8C,GAC7C6a,iBAMAvkB,YAAA0J,KACAA,IAEA,OAAAY,KAAAP,QAAAua,OAAA5d,IAAA6d,GAA4C3d,OAAA+c,EAAA,EAAA/c,CAAsB,IAAA8d,gBAAqBH,WAAO7a,EAAA,MAC9F6a,mBAMMI,WAAuBvB,EAAA,EAC7Bhe,WACA,wBAGA0N,aACA,OACAuQ,MAAA,QACAG,WACAC,IAAA,OAEAC,MAAA,YAIA1jB,UAAA0J,KACAA,IAEA,WAAAnC,EAAAC,MAAAD,EAAAuP,GAAA8N,qBAAAlb,EAAA7C,WAGA7G,YAAA0J,KACAA,IAEA,OAAY9C,OAAA+c,EAAA,EAAA/c,CAAa,2BAAA8C,WAwHnBmb,WAAiBzB,EAAA,EACvBhe,WACA,kBAGA0N,aACA,OACA4C,QAAA,mBACA4N,UAAA,EACAC,WAAA,EACAC,WACAC,IAAA,OAEAC,MAAA,cAIA1jB,MAAA0J,KACAA,IAEA,OACAob,MAAale,OAAA+c,EAAA,EAAA/c,CAAa8C,GAC1Bqb,IAAWne,OAAA+c,EAAA,EAAA/c,CAAY8C,GACvBsb,YAAmBpe,OAAA+c,EAAA,EAAA/c,CAAY8C,WAyXzBub,WAAoB7B,EAAA,EAC1Bhe,WACA,qBAGA0N,aACA,OACA1C,OACA8U,OACAV,QAAA,IAGA9O,QAAA,aACA2N,MAAA,QACAG,WACAC,IAAA,KACA0B,SAAAnT,KACAkT,MAAAlT,EAAAoT,aAAA,UAAApT,EAAAG,aAAA,eAGAuR,MAAApS,GAAA,IAAAA,EAAAlB,MAAA8U,OAAA,eACAlZ,MAAAsF,EAAAlB,MAAA8U,OACO,IAIPllB,UAAA0J,KACAA,EAAAoJ,OACAA,IAEA,UAAiBlM,OAAA+c,EAAA,EAAA/c,CAAU8C,EAAAoJ,EAAAE,MAAA8Q,WAG3B9jB,MAAA0J,KACAA,EAAAoJ,OACAA,IAEA,OACAuS,eAAsBze,OAAA+c,EAAA,EAAA/c,CAAU8C,EAAAoJ,EAAAE,MAAA8Q,YAIhC9jB,YAAA0J,KACAA,IAEA,OAAY9C,OAAA+c,EAAA,EAAA/c,CAAiB,cAAA8C,EAAA4b,KAC7BJ,OAAAI,EAAA,KACK,CAAAA,EAAAhU,MAAAtB,WAAAsB,EAAAlB,MAAA8U,SAAAI,EAAA,OJ1lBL,SAAAvb,GACA,IAAAkI,EAAAlI,EAAAwb,mBACAC,GACAlV,SAAckU,QAAA,GACdnU,SAAcmU,QAAA,GACd7T,UAAe6T,QAAA,OAEf,QAAA1d,KAAAmL,EACAuT,EAAA1e,IAAuB0d,QAAAvS,EAAAnL,GAAA0d,SAOvBza,EAAA0b,WAeA1b,EAAA2b,YAYA3b,EAAA2b,YIqjBiBC,EACjBF,WAAA,QACAC,YAAA,SACAH,gBACAK,YACApB,QAAA,KAEAhS,WAAAR,GACAA,EAAA6T,MAAAC,iBAAA,KAGA9lB,WAAAoN,EAAAgD,GACA,GAAAhD,EAAA,CACA,MAAAyY,GACAA,SAAsBzV,EAAAyV,OAAA,uBAAsCzY,MAE5DxG,OAAAmf,OAAA3V,EAAAyV,eA8NMG,WAAa5C,EAAA,EACnBhe,WACA,aAGA0N,aACA,OACA0Q,WACAC,IAAA,WAEAA,IAAA,IACA0B,SAAA7T,GAAA,WAAAA,EAAAuU,MAAAI,YAAA,OAEAJ,MAAA,cACAV,SAAA/X,GAAA,4BAAmD3I,KAAA2I,IAAA,OAEnDsW,MAAA,kBAIA1jB,MAAA0J,KACAA,IAEA,OACAwc,QAAetf,OAAA+c,EAAA,EAAA/c,CAAU8C,IAIzB1J,UAAA0J,KACAA,IAEA,UAAiB9C,OAAA+c,EAAA,EAAA/c,CAAU8C,GAG3B1J,YAAA0J,KACAA,IAEA,OAAY9C,OAAA+c,EAAA,EAAA/c,CAAa,kCAAA8C,IAGzB1J,YAAA0J,KACAA,IAEA,OAAY9C,OAAA+c,EAAA,EAAA/c,CAAa,kCAAA8C,WAgDnByc,WAAe/C,EAAA,EACrBhe,WACA,eAGA0N,aACA,OACA0Q,WACAC,IAAA,MAEAA,IAAA,OAEAoC,MAAA,sBAEAnC,MAAA,cAIA1jB,MAAA0J,KACAA,IAEA,OACA0c,QAAexf,OAAA+c,EAAA,EAAA/c,CAAU8C,IAIzB1J,UAAA0J,KACAA,IAEA,UAAiB9C,OAAA+c,EAAA,EAAA/c,CAAU8C,GAG3B1J,YAAA0J,KACAA,IAEA,OAAY9C,OAAA+c,EAAA,EAAA/c,CAAa,yBAAA8C,GAAkC9C,OAAA+c,EAAA,EAAA/c,CAAa,2BAAA8C,IAGxE1J,YAAA0J,KACAA,IAEA,OAAY9C,OAAA+c,EAAA,EAAA/c,CAAa,aAAA8C,GAAsB9C,OAAA+c,EAAA,EAAA/c,CAAa,eAAA8C,WAKtD2c,WAAajD,EAAA,EACnBhe,WACA,aAGAif,qBACA,OACAiC,aAAA,EACAC,OAAA,MAIAzT,aACA,OACA1C,OACAlQ,MACAskB,QAAA,MAEA+B,QACA/B,QAAA,OAGAgC,WAAA,EACAhD,WACAC,IAAA,UACA0B,SAAAnT,KACA9R,KAAA8R,EAAAG,aAAA,QACAoU,OAAAvU,EAAAG,aAAA,cAGAuR,MAAApS,IAAA,QAA4BA,EAAAlB,MAC5BqW,IAAA,+BACAF,OAAAjV,EAAAlB,MAAAmW,QAAAjc,KAAAP,QAAAwc,QACO,IAIPvmB,UAAA0J,KACAA,IAEA,OAAA0G,GACAA,EAAAlQ,KACe0G,OAAA+c,EAAA,EAAA/c,CAAU8C,EAAA0G,GAGZxJ,OAAA+c,EAAA,EAAA/c,CAAU8C,GAIvB1J,YAAA0J,KACAA,IAEA,OAAY9C,OAAA+c,EAAA,EAAA/c,CAAS,oGAA+D8C,EAAAgd,KACpFxmB,KAAAwmB,MAIA/E,cACA,OAAArX,KAAAP,QAAAuc,aAIA,IAAgBlD,EAAA,GAChB7c,OACAogB,YAAA,CAAA3f,EAAAiH,EAAAlI,KACA,MAAA+M,OACAA,GACW9L,EAAAO,MACX6I,EAAwBxJ,OAAAggB,EAAA,EAAAhgB,CAAYI,EAAAO,MAAAuL,EAAAmR,MAAA4C,MAEpCzW,EAAAlQ,MAAA6F,EAAAwgB,kBAAAO,oBACA/gB,EAAAghB,kBACAC,OAAAC,KAAA7W,EAAAlQ,KAAAkQ,EAAAmW,wBA0DMW,WAAkB9D,EAAA,EACxBhe,WACA,kBAGA0N,aACA,OACA0Q,WACAC,IAAA,MAEAoC,MAAA,kBACAV,SAAA/X,GAAA,cAAAA,IAEAsW,MAAA,aAIA1jB,MAAA0J,KACAA,IAEA,OACAyd,QAAevgB,OAAA+c,EAAA,EAAA/c,CAAU8C,IAIzB1J,UAAA0J,KACAA,IAEA,UAAiB9C,OAAA+c,EAAA,EAAA/c,CAAU8C,UAuIrB0d,WAAgBhE,EAAA,EACtBhe,WACA,gBAGAif,qBACA,OACAjZ,MAAA,GACA2W,cAAA,IAIA/hB,OASA,OAPAqnB,QAAerE,GACfsE,QAAexG,GACfyG,cAAqBzG,GAErB0G,QAAexE,GACfyE,cAAqB3G,IAKrBa,cACA,OAAYG,GACZ1W,MAAAd,KAAAP,QAAAqB,MACA2W,cAAAzX,KAAAP,QAAAgY,iBAIA/hB,WACA,OACAgjB,KAAA,IAAkBA,GAClBlC,KAAA,IAAkBA,GAClB4G,UAAA,KD5vCA,SAAAngB,GACA,IAAA2a,EAAAlB,EAAAkC,SAAA3b,GACA,OAAA2a,IAAA7Y,KAAAiU,WAAA,IC2vCAqK,UAAA,KDtvCA,SAAApgB,GACA,IAAA2a,EAAAlB,EAAAkC,SAAA3b,GACA,OAAA2a,IAAA7B,OAAA/C,WAAA,0CE3aA,IAAAsK,EAAgB/f,EAAQ,QAExBggB,EAAAhhB,EAAAhB,OAcA,SAAAgB,EAAAihB,GAGA,OAFAC,EAAAC,YAAAF,EAAAE,aAAAF,EAAA1iB,KAEA2iB,EAEA,SAAAA,EAAAE,GAKA,OAJAA,IACAA,EAAAL,EAAA3F,MAAA,KAAAiG,YAGA,IAAAJ,EAAAG,IAtBAnoB,EAAAC,QAAA8nB,EAEAA,EAAAM,KAAAthB,EAAAuhB,WACAP,EAAAQ,MAAAxhB,EAAAsH,YACA0Z,EAAAS,UAAAzhB,EAAA0hB,gBACAV,EAAAW,OAAA3hB,EAAA4hB,aACAZ,EAAAne,KAAA7C,EAAA6hB,WACAb,EAAAc,IAAA9hB,EAAA+hB,UAEAf,EAAAhhB,6BCfA,SAAAgiB,EAAAC,GAuBA,OAtBAA,aAAAC,IACAD,EAAAE,MAAAF,EAAAG,OAAAH,EAAAzb,IAAA,WACA,UAAAxH,MAAA,qBAEKijB,aAAAI,MACLJ,EAAAK,IAAAL,EAAAE,MAAAF,EAAAG,OAAA,WACA,UAAApjB,MAAA,sBAKAe,OAAAwiB,OAAAN,GAEAliB,OAAAyiB,oBAAAP,GAAArN,QAAA,SAAArW,GACA,IAAA0B,EAAAgiB,EAAA1jB,GAGA,iBAAA0B,GAAAF,OAAA0iB,SAAAxiB,IACA+hB,EAAA/hB,KAIAgiB,EAGA,IAAAS,EAAAV,EACAW,EAAAX,EACAU,EAAA/E,QAAAgF,QAGAC,EAIAzpB,YAAA0pB,QAEAvL,IAAAuL,EAAAC,OAAAD,EAAAC,SAEArf,KAAAqf,KAAAD,EAAAC,KACArf,KAAAsf,gBAAA,EAGA5pB,cACAsK,KAAAsf,gBAAA,GAQA,SAAAC,EAAAzc,GACA,OAAAA,EACA8J,QAAA,cACAA,QAAA,aACAA,QAAA,aACAA,QAAA,eACAA,QAAA,eAWA,SAAA4S,EAAAC,KAAAC,GAEA,MAAAtkB,EAAAkB,OAAAC,OAAA,MAEA,UAAAK,KAAA6iB,EACArkB,EAAAwB,GAAA6iB,EAAA7iB,GAOA,OALA8iB,EAAAvO,QAAA,SAAAqN,GACA,UAAA5hB,KAAA4hB,EACApjB,EAAAwB,GAAA4hB,EAAA5hB,KAGsB,EAetB,MAAA+iB,EAAA,UAMAC,EAAA5Y,KACAA,EAAA6Y,WAIAC,EAOApqB,YAAAqqB,EAAAtgB,GACAO,KAAAggB,OAAA,GACAhgB,KAAAigB,YAAAxgB,EAAAwgB,YACAF,EAAAG,KAAAlgB,MAOAtK,QAAAC,GACAqK,KAAAggB,QAAAT,EAAA5pB,GAOAD,SAAAsR,GACA,IAAA4Y,EAAA5Y,GAAA,OAEA,IAAAmZ,EAAAnZ,EAAA6Y,KACA7Y,EAAAoZ,cACAD,KAAqBngB,KAAAigB,cAAmBE,KAExCngB,KAAAqgB,KAAAF,GAOAzqB,UAAAsR,GACA4Y,EAAA5Y,KAEAhH,KAAAggB,QAAAL,GAMAjqB,QACA,OAAAsK,KAAAggB,OASAtqB,KAAAyqB,GACAngB,KAAAggB,wBAAmCG,aAQnCG,EACA5qB,cAEAsK,KAAAugB,UAAqBC,aACrBxgB,KAAAygB,OAAAzgB,KAAAugB,UAGAnd,UACA,OAAApD,KAAAygB,MAAAzgB,KAAAygB,MAAAplB,OAAA,GAGAqlB,WAAc,OAAA1gB,KAAAugB,SAGd7qB,IAAAsR,GACAhH,KAAAoD,IAAAod,SAAAve,KAAA+E,GAIAtR,SAAAmqB,GAEA,MAAA7Y,GAAkB6Y,OAAAW,aAClBxgB,KAAA6e,IAAA7X,GACAhH,KAAAygB,MAAAxe,KAAA+E,GAGAtR,YACA,GAAAsK,KAAAygB,MAAAplB,OAAA,EACA,OAAA2E,KAAAygB,MAAAhgB,MAMA/K,gBACA,KAAAsK,KAAA2gB,eAGAjrB,SACA,OAAAkrB,KAAAC,UAAA7gB,KAAAugB,SAAA,QAOA7qB,KAAAorB,GAEA,OAAA9gB,KAAAoS,YAAA2O,MAAAD,EAAA9gB,KAAAugB,UASA7qB,aAAAorB,EAAA9Z,GAQA,MAPA,iBAAAA,EACA8Z,EAAAE,QAAAha,GACKA,EAAAwZ,WACLM,EAAAG,SAAAja,GACAA,EAAAwZ,SAAArP,QAAA/L,GAAApF,KAAA+gB,MAAAD,EAAA1b,IACA0b,EAAAH,UAAA3Z,IAEA8Z,EAMAprB,iBAAAsR,GACA,iBAAAA,GACAA,EAAAwZ,WAEAxZ,EAAAwZ,SAAAU,MAAAC,GAAA,iBAAAA,GAGAna,EAAAwZ,UAAAxZ,EAAAwZ,SAAApY,KAAA,KAEApB,EAAAwZ,SAAArP,QAAA/L,IACAkb,EAAAc,UAAAhc,aA0BAic,UAAAf,EAIA5qB,YAAA+J,GACA6L,QACAtL,KAAAP,UAOA/J,WAAAC,EAAAkqB,GACA,KAAAlqB,IAEAqK,KAAAihB,SAAApB,GACA7f,KAAAghB,QAAArrB,GACAqK,KAAA2gB,aAMAjrB,QAAAC,GACA,KAAAA,GAEAqK,KAAA6e,IAAAlpB,GAOAD,eAAA4rB,EAAAxmB,GAEA,MAAAkM,EAAAsa,EAAAZ,KACA1Z,EAAA6Y,KAAA/kB,EACAkM,EAAAoZ,aAAA,EACApgB,KAAA6e,IAAA7X,GAGAtR,SAEA,OADA,IAAAoqB,EAAA9f,UAAAP,SACAqD,QAGApN,WACA,UAgBA,SAAA6rB,EAAAC,GACA,OAAAA,EACA,iBAAAA,IAEAA,EAAAD,OAHA,KAoDA,MAAAE,EAAA,iDA4CA,MAIAC,EAAA,yEA6BAC,GACAC,MAAA,eAAAC,UAAA,GAEAC,GACA3B,UAAA,SACAyB,MAAA,IACAtX,IAAA,IACAyX,QAAA,MACAC,UAAAL,IAEAM,GACA9B,UAAA,SACAyB,MAAA,IACAtX,IAAA,IACAyX,QAAA,MACAC,UAAAL,IAEAO,GACAN,MAAA,8IAUAO,EAAA,SAAAP,EAAAtX,EAAA8X,MACA,MAAAhD,EAAAI,GAEAW,UAAA,UACAyB,QACAtX,MACA0X,aAEAI,GAQA,OANAhD,EAAA4C,SAAA/f,KAAAigB,GACA9C,EAAA4C,SAAA/f,MACAke,UAAA,SACAyB,MAAA,6CACAC,UAAA,IAEAzC,GAEAiD,EAAAF,EAAA,UACAG,EAAAH,EAAA,eACAI,EAAAJ,EAAA,SACAK,GACArC,UAAA,SACAyB,MAjFA,oBAkFAC,UAAA,GAEAY,GACAtC,UAAA,SACAyB,MAAAF,EACAG,UAAA,GAEAa,GACAvC,UAAA,SACAyB,MAzFA,eA0FAC,UAAA,GAEAc,GACAxC,UAAA,SACAyB,MAAAgB,mHASAf,UAAA,GAEAgB,GAOAjB,MAAA,kBACAI,WACA7B,UAAA,SACAyB,MAAA,KACAtX,IAAA,aACAyX,QAAA,KACAC,UACAL,GAEAC,MAAA,KACAtX,IAAA,KACAuX,UAAA,EACAG,UAAAL,QAKAmB,GACA3C,UAAA,QACAyB,MAvIA,eAwIAC,UAAA,GAEAkB,GACA5C,UAAA,QACAyB,MA3IA,gBA4IAC,UAAA,GAEAmB,GAEApB,MAAA,uBACAC,UAAA,GAoBA,IAAAoB,EAAA3mB,OAAAwiB,QACA3M,UAAA,KACA+Q,iBAzKA,OA0KAC,SAzKA,eA0KAC,oBAzKA,gBA0KAR,UAzKA,oBA0KAlB,cACA2B,iBAzKA,eA0KAC,eAzKA,+IA0KAC,QArKA,CAAAC,QACA,MAAAC,EAAA,YAQA,OAPAD,EAAAE,SACAF,EAAA5B,MApGA,YAAA+B,GAEA,OADAA,EAAAvnB,IAAAwnB,GAAArC,EAAAqC,IAAAxb,KAAA,IAmGAoK,CACAiR,EACA,OACAD,EAAAE,OACA,SAEAlE,GACAW,UAAA,OACAyB,MAAA6B,EACAnZ,IAAA,IACAuX,UAAA,EAEAgC,WAAA,CAAAC,EAAAC,KACA,IAAAD,EAAA7e,OAAA8e,EAAAC,gBAEGR,IAoJH7B,mBACAG,mBACAG,oBACAC,qBACAC,UACAE,sBACAC,uBACAC,oBACAC,cACAC,gBACAC,qBACAC,kBACAE,cACAC,aACAC,wBACAC,eACAiB,kBApCA,SAAA7E,GACA,OAAA9iB,OAAAmf,OAAA2D,GAGAyE,WAAA,CAAAC,EAAAC,KAAgCA,EAAA1E,KAAA6E,YAAAJ,EAAA,IAEhCK,SAAA,CAAAL,EAAAC,KAA8BA,EAAA1E,KAAA6E,cAAAJ,EAAA,IAAAC,EAAAC,oBAyD9B,SAAAI,EAAApJ,EAAAqJ,GAEA,MADArJ,EAAAsJ,MAAAtJ,EAAA/V,MAAA,IAEAof,EAAAL,cAiCA,SAAAO,EAAAnF,EAAAoF,GACAC,MAAAC,QAAAtF,EAAA2C,WAEA3C,EAAA2C,QA7UA,YAAA4B,GAEA,MADA,IAAAA,EAAAvnB,IAAAwnB,GAAArC,EAAAqC,IAAAxb,KAAA,SA4UAuc,IAAAvF,EAAA2C,UAyBA,MAAA6C,GACA,KACA,MACA,MACA,KACA,MACA,KACA,KACA,OACA,SACA,OACA,SAGAC,EAAA,UAQA,SAAAC,EAAAC,EAAAC,EAAA7E,EAAA0E,GAEA,MAAAI,KAiBA,MAbA,iBAAAF,EACAG,EAAA/E,EAAA4E,EAAA5pB,MAAA,MACGspB,MAAAC,QAAAK,GACHG,EAAA/E,EAAA4E,GAEAzoB,OAAA6oB,KAAAJ,GAAA5T,QAAA,SAAAgP,GAEA7jB,OAAAmf,OACAwJ,EACAH,EAAAC,EAAA5E,GAAA6E,EAAA7E,MAIA8E,EAYA,SAAAC,EAAA/E,EAAAiF,GACAJ,IACAI,IAAAhpB,IAAAwnB,KAAAyB,gBAEAD,EAAAjU,QAAA,SAAAmU,GACA,MAAAC,EAAAD,EAAAnqB,MAAA,KACA8pB,EAAAM,EAAA,KAAApF,EAaA,SAAAmF,EAAAE,GAGA,GAAAA,EACA,OAAAxd,OAAAwd,GAGA,OAOA,SAAAF,GACA,OAAAV,EAAAa,SAAAH,EAAAD,eARAK,CAAAJ,GAAA,IApBAK,CAAAJ,EAAA,GAAAA,EAAA,QA0CA,SAAAK,EAAAC,GAAAxO,QAAoCA,IAOpC,SAAAyO,EAAAhjB,EAAAijB,GACA,WAAA3L,OACAmH,EAAAze,GACA,KAAA+iB,EAAAG,iBAAA,SAAAD,EAAA,eAiBAE,EACAvwB,cACAsK,KAAAkmB,gBAEAlmB,KAAAmmB,WACAnmB,KAAAomB,QAAA,EACApmB,KAAAqmB,SAAA,EAIA3wB,QAAA8rB,EAAAgC,GACAA,EAAA6C,SAAArmB,KAAAqmB,WAEArmB,KAAAkmB,aAAAlmB,KAAAomB,SAAA5C,EACAxjB,KAAAmmB,QAAAlkB,MAAAuhB,EAAAhC,IACAxhB,KAAAomB,SA5eA,SAAA5E,GACA,WAAApH,OAAAoH,EAAAhjB,WAAA,KAAAxE,KAAA,IAAAqB,OAAA,EA2eAirB,CAAA9E,GAAA,EAGA9rB,UACA,IAAAsK,KAAAmmB,QAAA9qB,SAGA2E,KAAAhG,KAAA,YAEA,MAAAusB,EAAAvmB,KAAAmmB,QAAA/pB,IAAA+kB,KAAA,IACAnhB,KAAAwmB,UAAAV,EArdA,SAAAW,EAAAC,EAAA,KACA,IAAAC,EAAA,EAEA,OAAAF,EAAArqB,IAAAwqB,IAEA,MAAAC,EADAF,GAAA,EAEA,IAAAnF,EAAAD,EAAAqF,GACA3nB,EAAA,GAEA,KAAAuiB,EAAAnmB,OAAA,IACA,MAAA2f,EAAAyG,EAAAznB,KAAAwnB,GACA,IAAAxG,EAAA,CACA/b,GAAAuiB,EACA,MAEAviB,GAAAuiB,EAAAsF,UAAA,EAAA9L,EAAA/V,OACAuc,IAAAsF,UAAA9L,EAAA/V,MAAA+V,EAAA,GAAA3f,QACA,OAAA2f,EAAA,OAAAA,EAAA,GAEA/b,GAAA,KAAAzE,OAAAwN,OAAAgT,EAAA,IAAA6L,IAEA5nB,GAAA+b,EAAA,GACA,MAAAA,EAAA,IACA2L,KAIA,OAAA1nB,IACG7C,IAAAolB,OAAgBA,MAAGpZ,KAAAse,GAybtBte,CAAAme,IAAA,GACAvmB,KAAA+mB,UAAA,EAIArxB,KAAAqS,GACA/H,KAAAwmB,UAAAO,UAAA/mB,KAAA+mB,UACA,MAAA/L,EAAAhb,KAAAwmB,UAAAxsB,KAAA+N,GACA,IAAAiT,EAAmB,YAGnB,MAAAzgB,EAAAygB,EAAAgM,UAAA,CAAA7F,EAAA5mB,MAAA,QAAAsZ,IAAAsN,GAEA8F,EAAAjnB,KAAAkmB,aAAA3rB,GAKA,OAFAygB,EAAArQ,OAAA,EAAApQ,GAEA+B,OAAAmf,OAAAT,EAAAiM,UAmCAC,EACAxxB,cAEAsK,KAAAmnB,SAEAnnB,KAAAonB,gBACApnB,KAAAwV,MAAA,EAEAxV,KAAA+mB,UAAA,EACA/mB,KAAAqnB,WAAA,EAIA3xB,WAAAuP,GACA,GAAAjF,KAAAonB,aAAAniB,GAAA,OAAAjF,KAAAonB,aAAAniB,GAEA,MAAAqiB,EAAA,IAAArB,EAIA,OAHAjmB,KAAAmnB,MAAA3f,MAAAvC,GAAAkM,QAAA,EAAAqQ,EAAAgC,KAAA8D,EAAAC,QAAA/F,EAAAgC,IACA8D,EAAAE,UACAxnB,KAAAonB,aAAAniB,GAAAqiB,EACAA,EAGA5xB,6BACA,WAAAsK,KAAAqnB,WAGA3xB,cACAsK,KAAAqnB,WAAA,EAIA3xB,QAAA8rB,EAAAgC,GACAxjB,KAAAmnB,MAAAllB,MAAAuf,EAAAgC,IACA,UAAAA,EAAApkB,MAAAY,KAAAwV,QAIA9f,KAAAqS,GACA,MAAA+b,EAAA9jB,KAAAynB,WAAAznB,KAAAqnB,YACAvD,EAAAiD,UAAA/mB,KAAA+mB,UACA,IAAA3rB,EAAA0oB,EAAA9pB,KAAA+N,GAiCA,GAAA/H,KAAA0nB,6BACA,GAAAtsB,KAAA6J,QAAAjF,KAAA+mB,eAAwD,CACxD,MAAAY,EAAA3nB,KAAAynB,WAAA,GACAE,EAAAZ,UAAA/mB,KAAA+mB,UAAA,EACA3rB,EAAAusB,EAAA3tB,KAAA+N,GAYA,OARA3M,IACA4E,KAAAqnB,YAAAjsB,EAAAirB,SAAA,EACArmB,KAAAqnB,aAAArnB,KAAAwV,OAEAxV,KAAA4nB,eAIAxsB,GA6IA,GAHAyqB,EAAAgC,qBAAAhC,EAAAgC,uBAGAhC,EAAA7D,UAAA6D,EAAA7D,SAAAyD,SAAA,QACA,UAAAlqB,MAAA,6FAMA,OAFAsqB,EAAAiC,iBAAAtI,EAAAqG,EAAAiC,sBAjFA,SAAAC,EAAA3I,EAAAlV,GACA,MAAA8d,EAAA,EACA,GAAA5I,EAAA6I,WAAA,OAAAD,GA7XA,SAAA5I,EAAAoF,GACA,GAAApF,EAAApE,MAAA,CACA,GAAAoE,EAAAwC,OAAAxC,EAAA9U,IAAA,UAAA/O,MAAA,4CAEA6jB,EAAAwC,MAAAxC,EAAApE,aACAoE,EAAApE,SA8XA7J,QAAA+W,KAAA9I,EAAAlV,IAEA2b,EAAAgC,mBAAA1W,QAAA+W,KAAA9I,EAAAlV,IAGAkV,EAAA+I,cAAA,MA1aA,SAAA/I,EAAAlV,GACAA,GACAkV,EAAAgJ,gBAOAhJ,EAAAwC,MAAA,OAAAxC,EAAAgJ,cAAAjtB,MAAA,KAAAiN,KAAA,2BACAgX,EAAA+I,cAAA/D,EACAhF,EAAAiJ,SAAAjJ,EAAAiJ,UAAAjJ,EAAAgJ,qBACAhJ,EAAAgJ,mBAKAvU,IAAAuL,EAAAyC,YAAAzC,EAAAyC,UAAA,KA+ZA0C,EAlYA,SAAAnF,EAAAoF,QAEA3Q,IAAAuL,EAAAyC,YAAAzC,EAAAyC,UAAA,KAmYA1Q,QAAA+W,KAAA9I,EAAAlV,IAEAkV,EAAA6I,YAAA,EAEA,IAAAK,EAAA,KAWA,GAVA,iBAAAlJ,EAAAiJ,WACAC,EAAAlJ,EAAAiJ,SAAAE,gBACAnJ,EAAAiJ,SAAAE,UAGAnJ,EAAAiJ,WACAjJ,EAAAiJ,SAAAvD,EAAA1F,EAAAiJ,SAAAxC,EAAAG,mBAIA5G,EAAAoJ,SAAAF,EACA,UAAA/sB,MAAA,kGAgCA,OA3BA+sB,KAAAlJ,EAAAoJ,SAAA,MACAR,EAAAS,iBAAA3C,EAAAwC,GAAA,GAEApe,IACAkV,EAAAwC,QAAAxC,EAAAwC,MAAA,SACAoG,EAAAU,QAAA5C,EAAA1G,EAAAwC,OACAxC,EAAAuJ,iBAAAvJ,EAAA9U,IAAA8U,EAAAwC,OACAxC,EAAA9U,KAAA8U,EAAAwJ,iBAAAxJ,EAAA9U,IAAA,SACA8U,EAAA9U,MAAA0d,EAAAa,MAAA/C,EAAA1G,EAAA9U,MACA0d,EAAAc,cAAAvH,EAAAnC,EAAA9U,MAAA,GACA8U,EAAAwJ,gBAAA1e,EAAA4e,gBACAd,EAAAc,gBAAA1J,EAAA9U,IAAA,QAAAJ,EAAA4e,gBAGA1J,EAAA2C,UAAAiG,EAAAe,UAAAjD,EAA0E1G,EAAA,UAC1EA,EAAA4C,WAAA5C,EAAA4C,aAEA5C,EAAA4C,YAAAxP,UAAA4M,EAAA4C,SAAA5lB,IAAA,SAAA4sB,GACA,OAoDA,SAAA5J,GAUA,OATAA,EAAA6J,WAAA7J,EAAA8J,iBACA9J,EAAA8J,eAAA9J,EAAA6J,SAAA7sB,IAAA,SAAA+sB,GACA,OAAA3J,EAAAJ,GAA4B6J,SAAA,MAAiBE,MAO7C/J,EAAA8J,eACA9J,EAAA8J,eA3BA,SAAAE,EAAAhK,GACA,QAAAA,IAEAA,EAAAwJ,gBAAAQ,EAAAhK,EAAAiK,SA+BAD,CAAAhK,GACAI,EAAAJ,GAA0BiK,OAAAjK,EAAAiK,OAAA7J,EAAAJ,EAAAiK,QAAA,OAG1B/sB,OAAA0iB,SAAAI,GACAI,EAAAJ,GAIAA,EA/EAkK,CAAA,SAAAN,EAAA5J,EAAA4J,MAEA5J,EAAA4C,SAAA7Q,QAAA,SAAA6X,GAAuCjB,EAAA,EAAAC,KAEvC5I,EAAAiK,QACAtB,EAAA3I,EAAAiK,OAAAnf,GAGA8d,EAAAV,QA3HA,SAAAlI,GACA,MAAAmK,EAAA,IAAArC,EAWA,OATA9H,EAAA4C,SAAA7Q,QAAAqY,GAAAD,EAAAhC,QAAAiC,EAAA5H,OAA0D6H,KAAAD,EAAApqB,KAAA,WAE1DggB,EAAA0J,eACAS,EAAAhC,QAAAnI,EAAA0J,eAAsC1pB,KAAA,QAEtCggB,EAAA2C,SACAwH,EAAAhC,QAAAnI,EAAA2C,SAAgC3iB,KAAA,YAGhCmqB,EA+GAG,CAAA1B,GACAA,EAaAD,CAAA,GAoEA,SAAA4B,EAAAC,GACA,MAAAC,GACA5tB,OAAA,gCACAojB,KAAA,WACA,OACAyK,iBAAA,GACAC,iBAAA,IAGAC,UACAt0B,YACA,OAAAsK,KAAA+pB,gBAAA,GAEA,QAAA/pB,KAAA8pB,kBAEAp0B,cAEA,IAAAsK,KAAAiqB,aAAAL,EAAAM,YAAAlqB,KAAA6lB,UAGA,OAFAtjB,QAAA4nB,sBAAwCnqB,KAAA6lB,+CACxC7lB,KAAA+pB,iBAAA,EACAxK,EAAAvf,KAAAtF,MAGA,IAAAU,KAQA,OAPA4E,KAAAiqB,YACA7uB,EAAAwuB,EAAAQ,cAAApqB,KAAAtF,MACAsF,KAAA8pB,iBAAA1uB,EAAAyqB,WAEAzqB,EAAAwuB,EAAAlrB,UAAAsB,KAAA6lB,SAAA7lB,KAAAtF,KAAAsF,KAAAqqB,gBACArqB,KAAA8pB,iBAAA9pB,KAAA6lB,UAEAzqB,EAAA0H,OAEApN,aACA,OAAAsK,KAAA6lB,UAtCA,SAAA/iB,GACA,OAAAwnB,QAAAxnB,GAAA,KAAAA,GAqCAynB,CAAAvqB,KAAAwqB,aAEAH,eAAA,KACA,GAKA30B,OAAA+0B,GACA,OAAAA,EAAA,UACAA,EAAA,QACAC,MAAA1qB,KAAAmgB,UACAwK,UAAqBC,UAAA5qB,KAAA6qB,mBAarB,OAAUhB,YAAAiB,WALVp1B,QAAAq1B,GACAA,EAAAC,UAAA,cAAAnB,MAUA,MAAAoB,GACAC,yBAAA,EAA8B/J,KAAA/lB,SAAAzF,WAC9B,MAAAw1B,EAAAC,EAAAjK,GACA,IAAAgK,EAAA9vB,OAAA,OAEA,MAAAgwB,EAAAC,SAAAb,cAAA,OACAY,EAAAT,UAAAxvB,EAAA0H,MACA1H,EAAA0H,MA2DA,SAAA2c,EAAAoL,EAAA/nB,GACA,IAAAyoB,EAAA,EACAnwB,EAAA,GACA,MAAAowB,KAEA,SAAAC,IACA,OAAAhM,EAAApkB,QAAAwvB,EAAAxvB,OAGAokB,EAAA,GAAAoH,SAAAgE,EAAA,GAAAhE,OACApH,EAAA,GAAAoH,OAAAgE,EAAA,GAAAhE,OAAApH,EAAAoL,EAkBA,UAAAA,EAAA,GAAApvB,MAAAgkB,EAAAoL,EArBApL,EAAApkB,OAAAokB,EAAAoL,EA2BA,SAAAlO,EAAA3V,GAMA5L,GAAA,IAAA+d,EAAAnS,MAAA5K,IAAAqC,KAAAuI,EAAA0kB,WAJA,SAAAC,GACA,UAAAA,EAAAC,SAAA,KAAArM,EAAAoM,EAAA7oB,OAAA,MAGAsF,KAAA,QAMA,SAAAyjB,EAAA7kB,GACA5L,GAAA,KAAA+d,EAAAnS,GAAA,IAMA,SAAA8kB,EAAArwB,IACA,UAAAA,QAAAkhB,EAAAkP,GAAApwB,EAAAuL,MAGA,KAAAyY,EAAApkB,QAAAwvB,EAAAxvB,QAAA,CACA,IAAA0wB,EAAAN,IAGA,GAFArwB,GAAAmkB,EAAAzc,EAAAgkB,UAAAyE,EAAAQ,EAAA,GAAAlF,SACA0E,EAAAQ,EAAA,GAAAlF,OACAkF,IAAAtM,EAAA,CAOA+L,EAAAlrB,UAAA6Q,QAAA0a,GACA,GACAC,EAAAC,EAAAphB,OAAA,SACAohB,EAAAN,UACOM,IAAAtM,GAAAsM,EAAA1wB,QAAA0wB,EAAA,GAAAlF,SAAA0E,GACPC,EAAAlrB,UAAA6Q,QAAAwL,OAEA,UAAAoP,EAAA,GAAAtwB,MACA+vB,EAAAvpB,KAAA8pB,EAAA,GAAA/kB,MAEAwkB,EAAA/qB,MAEAqrB,EAAAC,EAAAphB,OAAA,SAGA,OAAAvP,EAAAmkB,EAAAzc,EAAAkpB,OAAAT,IA9IAU,CAAAd,EAAAC,EAAAC,GAAA11B,KAgBA,SAAAwjB,EAAAnS,GACA,OAAAA,EAAA4kB,SAAAvG,cAMA,SAAA+F,EAAApkB,GAEA,MAAA5L,KA0BA,OAzBA,SAAA8wB,EAAAllB,EAAA6f,GACA,QAAAzhB,EAAA4B,EAAA4C,WAAqCxE,EAAOA,IAAA+mB,YAC5C,IAAA/mB,EAAAgnB,SACAvF,GAAAzhB,EAAAinB,UAAAhxB,OACO,IAAA+J,EAAAgnB,WACPhxB,EAAA6G,MACAxG,MAAA,QACAorB,SACA7f,KAAA5B,IAEAyhB,EAAAqF,EAAA9mB,EAAAyhB,GAIA1N,EAAA/T,GAAA4V,MAAA,oBACA5f,EAAA6G,MACAxG,MAAA,OACAorB,SACA7f,KAAA5B,KAKA,OAAAyhB,EAvBA,CAwBG7f,EAAA,GACH5L,EAwGA,MAAAkxB,KAKAC,EAAAhtB,IACAgD,QAAAgqB,MAAAhtB,IAOA4qB,EAAA,CAAA5qB,KAAAokB,KACAphB,QAAAC,aAAuBjD,OAAQokB,IAO/B6I,EAAA,CAAAC,EAAAltB,KACA+sB,KAA0BG,KAAWltB,OAErCgD,QAAAC,wBAAkCiqB,MAAYltB,KAC9C+sB,KAAsBG,KAAWltB,MAAQ,IAQzCmtB,EAAAnN,EACAoN,EAAAnN,EACAoN,EAAAC,OAAA,WAs/BA,IAAAnuB,EAh/BA,SAAAkrB,GAGA,MAAAkD,EAAAxwB,OAAAC,OAAA,MAEAwwB,EAAAzwB,OAAAC,OAAA,MAEA8a,KAIA,IAAA2V,GAAA,EACA,MAAAC,EAAA,yBACAC,EAAA,sFAEAC,GAA8BC,mBAAA,EAAAtyB,KAAA,aAAAknB,aAK9B,IAAAviB,GACA4tB,cAAA,qBACAC,iBAAA,8BACArN,YAAA,QACAsN,WAAA,KACAC,OAAA,EACAV,UAAA,KAGAW,UAAApM,GASA,SAAAqM,EAAAC,GACA,OAAAluB,EAAA4tB,cAAAlzB,KAAAwzB,GAiDA,SAAAjvB,EAAAkvB,EAAAC,EAAAxD,EAAAyD,GACA,IAAApzB,EAAA,GACAizB,EAAA,GACA,iBAAAE,GACAnzB,EAAAkzB,EACAvD,EAAAwD,EAAAxD,eACAsD,EAAAE,EAAAhI,SAGAiI,OAAAja,IAGA2Y,EAAA,gEACAA,EAAA,kHACAmB,EAAAC,EACAlzB,EAAAmzB,GAIA,MAAAE,GACArzB,OACAmrB,SAAA8H,GAIAK,EAAA,mBAAAD,GAIA,MAAA3yB,EAAA2yB,EAAA3yB,OACA2yB,EAAA3yB,OACA6yB,EAAAF,EAAAlI,SAAAkI,EAAArzB,KAAA2vB,EAAAyD,GAMA,OAJA1yB,EAAAV,KAAAqzB,EAAArzB,KAEAszB,EAAA,kBAAA5yB,GAEAA,EAYA,SAAA6yB,EAAAN,EAAAO,EAAA7D,EAAAyD,GAOA,SAAAK,EAAA/O,EAAApE,GACA,MAAAoT,EAAAvI,EAAAG,iBAAAhL,EAAA,GAAAqK,cAAArK,EAAA,GACA,OAAA1e,OAAAiC,UAAA5D,eAAA8D,KAAA2gB,EAAAiJ,SAAA+F,IAAAhP,EAAAiJ,SAAA+F,GAmEA,SAAAC,IACA,MAAAjrB,EAAAkrB,YA3BA,WACA,QAAAC,EAAA,OAEA,IAAAnzB,EAAA,KAEA,oBAAAgI,EAAAkrB,YAAA,CACA,IAAAxB,EAAA1pB,EAAAkrB,aAEA,YADAhN,EAAAN,QAAAuN,GAGAnzB,EAAA6yB,EAAA7qB,EAAAkrB,YAAAC,GAAA,EAAAC,EAAAprB,EAAAkrB,cACAE,EAAAprB,EAAAkrB,aAAiElzB,EAAA,SAEjEA,EAAAgvB,EAAAmE,EAAAnrB,EAAAkrB,YAAAjzB,OAAA+H,EAAAkrB,YAAA,MAOAlrB,EAAAye,UAAA,IACAA,GAAAzmB,EAAAymB,WAEAP,EAAAmN,eAAArzB,EAAAkmB,QAAAlmB,EAAAyqB,UAKA6I,GAlEA,WACA,IAAAtrB,EAAAilB,SAEA,YADA/G,EAAAN,QAAAuN,GAIA,IAAAxH,EAAA,EACA3jB,EAAAqlB,iBAAA1B,UAAA,EACA,IAAA/L,EAAA5X,EAAAqlB,iBAAAzuB,KAAAu0B,GACAI,EAAA,GAEA,KAAA3T,GAAA,CACA2T,GAAAJ,EAAAzH,UAAAC,EAAA/L,EAAA/V,OACA,MAAAoa,EAAA8O,EAAA/qB,EAAA4X,GACA,GAAAqE,EAAA,CACA,MAAAQ,EAAA+O,GAAAvP,EAKA,GAJAiC,EAAAN,QAAA2N,GACAA,EAAA,GAEA9M,GAAA+M,EACA/O,EAAAgP,WAAA,KAGAF,GAAA3T,EAAA,OACW,CACX,MAAA8T,EAAAjJ,EAAAiC,iBAAAjI,MACAyB,EAAAyN,WAAA/T,EAAA,GAAA8T,SAGAH,GAAA3T,EAAA,GAEA+L,EAAA3jB,EAAAqlB,iBAAA1B,UACA/L,EAAA5X,EAAAqlB,iBAAAzuB,KAAAu0B,GAEAI,GAAAJ,EAAAvC,OAAAjF,GACAzF,EAAAN,QAAA2N,GAiCAK,GAEAT,EAAA,GAMA,SAAAU,EAAA7P,GAKA,OAJAA,EAAAe,WACAmB,EAAAL,SAAA4E,EAAAiC,iBAAA1I,EAAAe,YAAAf,EAAAe,WAEA/c,EAAA9G,OAAAC,OAAA6iB,GAAiClV,QAAUpH,MAAAM,KAuC3C,SAAA8rB,EAAAC,GACA,WAAA/rB,EAAAkkB,QAAAD,YAGAkH,GAAAY,EAAA,GACA,IAIAC,GAAA,EACA,GAUA,SAAAC,EAAArU,GACA,MAAAmU,EAAAnU,EAAA,GACAsU,EAAAtU,EAAAyO,KAEA1F,EAAA,IAAA5E,EAAAmQ,GAEAC,GAAAD,EAAAnH,cAAAmH,EAAA,aACA,UAAAE,KAAAD,EACA,GAAAC,IACAA,EAAAxU,EAAA+I,GACAA,EAAAzE,gBAAA,OAAA4P,EAAAC,GAuBA,OApBAG,KAAA3G,iBACA2G,EAAAzG,MA/7CA,SAAA/lB,GACA,WAAAsX,OAAAtX,EAAA8J,QAAA,wBAAsD,aA87CtD7O,CAAAoxB,IAGAG,EAAAG,KACAlB,GAAAY,GAEAG,EAAAI,eACAnB,GAAAY,GAEAd,IACAiB,EAAAK,aAAAL,EAAAI,eACAnB,EAAAY,IAGAF,EAAAK,GAKAA,EAAAK,YAAA,EAAAR,EAAA9zB,OAQA,SAAAu0B,EAAA5U,GACA,MAAAmU,EAAAnU,EAAA,GACA6U,EAAA3B,EAAAlC,OAAAhR,EAAA/V,OAEA6qB,EA9FA,SAAAC,EAAA3Q,EAAApE,EAAA6U,GACA,IAAAG,EAh1CA,SAAAxO,EAAA2N,GACA,MAAAnU,EAAAwG,KAAAxnB,KAAAm1B,GACA,OAAAnU,GAAA,IAAAA,EAAA/V,MA80CA4pB,CAAAzP,EAAAyJ,MAAAgH,GAEA,GAAAG,EAAA,CACA,GAAA5Q,EAAA,WACA,MAAA2E,EAAA,IAAA5E,EAAAC,GACAA,EAAA,UAAApE,EAAA+I,GACAA,EAAAzE,iBAAA0Q,GAAA,GAGA,GAAAA,EAAA,CACA,KAAA5Q,EAAA6Q,YAAA7Q,EAAAlV,QACAkV,IAAAlV,OAEA,OAAAkV,GAKA,GAAAA,EAAAwJ,eACA,OAAAmH,EAAA3Q,EAAAlV,OAAA8Q,EAAA6U,GA0EAE,CAAA3sB,EAAA4X,EAAA6U,GACA,IAAAC,EAAqB,OAAAlD,EAErB,MAAAsD,EAAA9sB,EACA8sB,EAAAT,KACAlB,GAAAY,GAEAe,EAAAC,WAAAD,EAAAE,aACA7B,GAAAY,GAEAd,IACA6B,EAAAE,aACA7B,EAAAY,IAGA,GACA/rB,EAAA+c,WACAmB,EAAAX,YAEAvd,EAAAqsB,MAAArsB,EAAAkrB,cACAzM,GAAAze,EAAAye,WAEAze,IAAA8G,aACO9G,IAAA0sB,EAAA5lB,QAOP,OANA4lB,EAAAzG,SACAyG,EAAAnH,iBACAmH,EAAAzG,OAAAR,MAAAiH,EAAAjH,OAEAoG,EAAAa,EAAAzG,SAEA6G,EAAAC,UAAA,EAAAhB,EAAA9zB,OAcA,IAAAg1B,KAQA,SAAAC,EAAAC,EAAAvV,GACA,MAAAmU,EAAAnU,KAAA,GAKA,GAFAuT,GAAAgC,EAEA,MAAApB,EAEA,OADAd,IACA,EAOA,aAAAgC,EAAAjxB,MAAA,QAAA4b,EAAA5b,MAAAixB,EAAAprB,QAAA+V,EAAA/V,OAAA,KAAAkqB,EAAA,CAGA,GADAZ,GAAAL,EAAA1mB,MAAAwT,EAAA/V,MAAA+V,EAAA/V,MAAA,IACA+nB,EAAA,CAEA,MAAAhuB,EAAA,IAAAzD,MAAA,uBAGA,MAFAyD,EAAA2uB,eACA3uB,EAAAwxB,QAAAH,EAAA5G,KACAzqB,EAEA,SAIA,GAFAqxB,EAAArV,EAEA,UAAAA,EAAA5b,KACA,OAAAiwB,EAAArU,GACO,eAAAA,EAAA5b,OAAAirB,EAAA,CAGP,MAAArrB,EAAA,IAAAzD,MAAA,mBAAA4zB,EAAA,gBAAA/rB,EAAA+c,WAAA,kBAEA,MADAnhB,EAAAogB,KAAAhc,EACApE,EACO,WAAAgc,EAAA5b,KAAA,CACP,MAAAmsB,EAAAqE,EAAA5U,GACA,GAAAuQ,IAAAqB,EACA,OAAArB,EAOA,eAAAvQ,EAAA5b,MAAA,KAAA+vB,EAEA,SAOA,GAAAsB,EAAA,KAAAA,EAAA,EAAAzV,EAAA/V,MAEA,MADA,IAAA1J,MAAA,6DAiBA,OADAgzB,GAAAY,EACAA,EAAA9zB,OAGA,MAAAwqB,EAAAqE,EAAAyD,GACA,IAAA9H,EAEA,MADA0G,EAAAW,EAAAtgB,QAAA,KAA0C+gB,IAC1C,IAAApyB,MAAA,sBAAAoyB,EAAA,KAGA,MAAA+C,EAAA9K,EAAAC,GAA0CxO,YAC1C,IAAAjc,EAAA,GAEAgI,EAAA0qB,GAAA4C,EAEA,MAAAlC,KACAlN,EAAA,IAAA7hB,EAAAguB,UAAAhuB,IA5GA,WACA,MAAAkC,KACA,QAAAgvB,EAAAvtB,EAA6ButB,IAAA9K,EAAsB8K,IAAAzmB,OACnDymB,EAAAxQ,WACAxe,EAAA0F,QAAAspB,EAAAxQ,WAGAxe,EAAAwP,QAAAsC,GAAA6N,EAAAL,SAAAxN,IAsGAmd,GACA,IAAArC,EAAA,GACA1M,EAAA,EACA5c,EAAA,EACAwrB,EAAA,EACArB,GAAA,EAEA,IAGA,IAFAhsB,EAAAkkB,QAAAM,gBAEa,CACb6I,IACArB,EAGAA,GAAA,EAEAhsB,EAAAkkB,QAAAM,cAEAxkB,EAAAkkB,QAAAP,UAAA9hB,EAEA,MAAA+V,EAAA5X,EAAAkkB,QAAAttB,KAAAk0B,GAGA,IAAAlT,EAAA,MAEA,MACA6V,EAAAP,EADApC,EAAApH,UAAA7hB,EAAA+V,EAAA/V,OACA+V,GACA/V,EAAA+V,EAAA/V,MAAA4rB,EAOA,OALAP,EAAApC,EAAAlC,OAAA/mB,IACAqc,EAAAwP,gBACAxP,EAAAyP,WACA31B,EAAAkmB,EAAA0P,UAKAnP,UAAAld,KAAAssB,MAAApP,GACA/e,MAAA1H,EACAyqB,SAAA8H,EACA5L,SAAA,EACAT,UACAle,OAEK,MAAApE,GACL,GAAAA,EAAAO,SAAAP,EAAAO,QAAAkmB,SAAA,WACA,OACA1D,SAAA,EACAmP,WACAC,IAAAnyB,EAAAO,QACAwuB,QAAAG,EAAA1mB,MAAAvC,EAAA,IAAAA,EAAA,KACAma,KAAApgB,EAAAogB,MAEAgS,MAAAh2B,EACAymB,UAAA,EACA/e,MAAA4pB,EAAAwB,GACA5M,WAEO,GAAA0L,EACP,OACAjL,SAAA,EACAF,UAAA,EACA/e,MAAA4pB,EAAAwB,GACA5M,UACAuE,SAAA8H,EACAvqB,MACAiuB,YAAAryB,GAGA,MAAAA,GAsCA,SAAAorB,EAAA1vB,EAAA42B,GACAA,KAAA7xB,EAAAqtB,WAAAxwB,OAAA6oB,KAAA2H,GACA,MAAAyE,EA5BA,SAAA72B,GACA,MAAAU,GACAymB,UAAA,EACAP,QAAA,IAAA7hB,EAAAguB,UAAAhuB,GACAqD,MAAA4pB,EAAAhyB,GACAqnB,SAAA,EACA3e,IAAA+pB,GAGA,OADA/xB,EAAAkmB,QAAAN,QAAAtmB,GACAU,EAmBAo2B,CAAA92B,GAEA+2B,EAAAH,EAAAtmB,OAAAkf,GAAAlf,OAAA0mB,GAAAt1B,IAAAtB,GACAmzB,EAAAnzB,EAAAJ,GAAA,IAEA+2B,EAAApqB,QAAAkqB,GAEA,MAAAI,EAAAF,EAAAG,KAAA,CAAA3tB,EAAAC,KAEA,GAAAD,EAAA4d,YAAA3d,EAAA2d,UAAA,OAAA3d,EAAA2d,UAAA5d,EAAA4d,UAIA,GAAA5d,EAAA4hB,UAAA3hB,EAAA2hB,SAAA,CACA,GAAAqE,EAAAjmB,EAAA4hB,UAAAgM,aAAA3tB,EAAA2hB,SACA,SACS,GAAAqE,EAAAhmB,EAAA2hB,UAAAgM,aAAA5tB,EAAA4hB,SACT,SAQA,YAGAiM,EAAAC,GAAAJ,EAGAv2B,EAAA02B,EAGA,OAFA12B,EAAA42B,YAAAD,EAEA32B,EA0CA,MAAA62B,GACAC,0BAAA,EAAiC/Q,SACjC1hB,EAAA+tB,QACArM,EAAAyJ,UAAAzJ,EAAAyJ,UAAAhe,QAAA,UAAAA,QAAA,qBAGAse,yBAAA,EAAgC9vB,aAChCqE,EAAA+tB,QACApyB,EAAA0H,MAAA1H,EAAA0H,MAAA8J,QAAA,iBAKAulB,EAAA,mBAEAC,GACAlH,yBAAA,EAAgC9vB,aAChCqE,EAAA8tB,aACAnyB,EAAA0H,MAAA1H,EAAA0H,MAAA8J,QAAAulB,EAAArO,GACAA,EAAAlX,QAAA,MAAAnN,EAAA8tB,gBAYA,SAAA8E,EAAAC,GAEA,IAAAtrB,EAAA,KACA,MAAA6e,EA1oBA,SAAA0M,GACA,IAAAC,EAAAD,EAAApS,UAAA,IAEAqS,GAAAD,EAAAE,WAAAF,EAAAE,WAAAtS,UAAA,GAGA,MAAAnF,EAAAvb,EAAA6tB,iBAAAtzB,KAAAw4B,GACA,GAAAxX,EAAA,CACA,MAAA6K,EAAAqE,EAAAlP,EAAA,IAKA,OAJA6K,IACAsE,EAAA+C,EAAAtgB,QAAA,KAA2CoO,EAAA,KAC3CmP,EAAA,oDAAAoI,IAEA1M,EAAA7K,EAAA,kBAGA,OAAAwX,EACAr3B,MAAA,OACAu3B,KAAAC,GAAAjF,EAAAiF,IAAAzI,EAAAyI,IAwnBAC,CAAAN,GAEA,GAAA5E,EAAA7H,GAAA,OAGAmI,EAAA,2BACO7M,GAAAmR,EAAAzM,aAGP,MAAAlwB,GADAqR,EAAAsrB,GACAO,YACAz3B,EAAAyqB,EAAAnnB,EAAA/I,GAA+CkwB,WAAAwE,gBAAA,IAAiCD,EAAAz0B,GAGhFq4B,EAAA,0BAAoC7M,GAAAmR,EAAAl3B,SAAAzF,SAEpC28B,EAAA1H,UAAAxvB,EAAA0H,MAzDA,SAAAwvB,EAAAQ,EAAAC,GACA,MAAAlN,EAAAiN,EAAA/F,EAAA+F,GAAAC,EAEAT,EAAAU,UAAAnU,IAAA,QACAgH,GAAAyM,EAAAU,UAAAnU,IAAAgH,GAsDAoN,CAAAX,EAAAzM,EAAAzqB,EAAAyqB,UACAyM,EAAAl3B,QACAyqB,SAAAzqB,EAAAyqB,SAEArE,GAAApmB,EAAAymB,UACAqR,UAAA93B,EAAAymB,WAEAzmB,EAAA42B,cACAM,EAAAN,aACAnM,SAAAzqB,EAAA42B,YAAAnM,SAEArE,GAAApmB,EAAA42B,YAAAnQ,UACAqR,UAAA93B,EAAA42B,YAAAnQ,YAwBA,MAAAsR,EAAA,KACAA,EAAAC,SACAD,EAAAC,QAAA,EAEA5G,EAAA,2EAEAlB,SAAA+H,iBAAA,YACAliB,QAAAkhB,KAUA,IAAAiB,GAAA,EAKA,SAAAC,IAEA,YAAAjI,SAAAkI,WAKAlI,SAAA+H,iBAAA,YACAliB,QAAAkhB,GALAiB,GAAA,EA6FA,SAAApJ,EAAApvB,GAEA,OADAA,MAAA,IAAAuqB,cACAyH,EAAAhyB,IAAAgyB,EAAAC,EAAAjyB,IAQA,SAAA24B,EAAAC,GAAA/F,aAAuCA,IACvC,iBAAA+F,IACAA,OAEAA,EAAAviB,QAAAwiB,IAAgC5G,EAAA4G,EAAAtO,eAAAsI,IAOhC,SAAA+D,EAAA52B,GACA,MAAAuE,EAAA6qB,EAAApvB,GACA,OAAAuE,MAAA+tB,kBAuCA,SAAAY,EAAAvyB,EAAAkoB,GACA,MAAA6L,EAAA/zB,EACA4b,EAAAlG,QAAA,SAAAyiB,GACAA,EAAApE,IACAoE,EAAApE,GAAA7L,KAjJA,oBAAAjH,eAAAmX,kBACAnX,OAAAmX,iBAAA,mBAPA,WAEAP,GAAAC,MAKA,GA8KAj3B,OAAAmf,OAAAmO,GACAlrB,YACA0rB,gBACAmJ,eACAO,UAvBA,SAAAC,GAIA,OAHAvH,EAAA,wDACAA,EAAA,+EAzTA,SAAApqB,GACA,OAAA3C,EAAA8tB,YAAA9tB,EAAA+tB,MAIAprB,EAAAwK,QAAAqgB,EAAAjS,GACA,OAAAA,EACAvb,EAAA+tB,MAAA,OAAAxS,EACOvb,EAAA8tB,WACPvS,EAAApO,QAAA,MAAAnN,EAAA8tB,YAEAvS,GATA5Y,EAyTA0xB,CAAAC,IAoBA1B,mBAEA2B,eAfA,SAAA7S,GAIA,OAHAqL,EAAA,6DACAA,EAAA,6CAEA6F,EAAAlR,IAYA8S,UA5OA,SAAAC,GACAA,EAAA1G,QACAhB,EAAA,sDACAA,EAAA,gFAEA/sB,EAAAktB,EAAAltB,EAAAy0B,IAwOAf,mBACAgB,uBApNA,WACA3H,EAAA,iFACA8G,GAAA,GAmNAc,iBAhLA,SAAAzG,EAAA0G,GACA,IAAAh1B,EAAA,KACA,IACAA,EAAAg1B,EAAAzK,GACK,MAAA0K,GAGL,GAFA/H,EAAA,wDAAwC3f,QAAA,KAAuC+gB,KAE/EX,EAAuB,MAAAsH,EAAwB/H,EAAA+H,GAK/Cj1B,EAAA8tB,EAGA9tB,EAAAvE,OAAAuE,EAAAvE,KAAA6yB,GACAb,EAAAa,GAAAtuB,EACAA,EAAAk1B,cAAAF,EAAAG,KAAA,KAAA5K,GAEAvqB,EAAA0tB,SACA0G,EAAAp0B,EAAA0tB,SAAqCY,kBA6JrC8G,mBApJA,SAAA9G,UACAb,EAAAa,GACA,UAAAgG,KAAAr3B,OAAA6oB,KAAA4H,GACAA,EAAA4G,KAAAhG,UACAZ,EAAA4G,IAiJAe,cAzIA,WACA,OAAAp4B,OAAA6oB,KAAA2H,IAyIA5C,cACAuJ,kBACAkB,gBA/HA,SAAA75B,GACA0xB,EAAA,6DACAA,EAAA,6EAEA,MAAAntB,EAAA6qB,EAAApvB,GACA,GAAAuE,EAAe,OAAAA,EAGf,MADA,IAAA9D,MAAA,iDAAmCqR,QAAA,KAAqD9R,KAyHxF42B,gBACAlS,QAAAmN,EACAiI,UA/DA,SAAAhB,IArBA,SAAAA,GAEAA,EAAA,2BAAAA,EAAA,6BACAA,EAAA,4BAAAvU,IACAuU,EAAA,yBACAt3B,OAAAmf,QAAyB8W,MAAAlT,EAAA8B,IAAiB9B,OAI1CuU,EAAA,0BAAAA,EAAA,4BACAA,EAAA,2BAAAvU,IACAuU,EAAA,wBACAt3B,OAAAmf,QAAyB8W,MAAAlT,EAAA8B,IAAiB9B,OAU1CwV,CAAAjB,GACAvc,EAAApV,KAAA2xB,IA+DAkB,UAAAnL,EAAAC,GAAAkB,YAGAlB,EAAAmL,UAAA,WAA+B/H,GAAA,GAC/BpD,EAAAoL,SAAA,WAA8BhI,GAAA,GAC9BpD,EAAAqL,cA/uCA,SAivCA,UAAAr4B,KAAAqmB,EAEA,iBAAAA,EAAArmB,IAEAqiB,EAAAgE,EAAArmB,IAWA,OANAN,OAAAmf,OAAAmO,EAAA3G,GAGA2G,EAAAgL,UAAA3C,GACArI,EAAAgL,UAAA3J,GACArB,EAAAgL,UAAAxC,GACAxI,EAIAsL,KAEA1/B,EAAAC,QAAAiJ,sBCj9EAlJ,EAAAC,cACAC,cACAsK,KAAA+E,QAMArP,KAAAoN,GACA,IAAAqyB,EAAAryB,EACAuiB,cACA+P,OAEAxoB,QAAA,sBAEAA,QAAA,gEAA0E,IAC1EA,QAAA,WAEA,GAAA5M,KAAA+E,KAAApK,eAAAw6B,GAAA,CACA,MAAAE,EAAAF,EACA,GACAn1B,KAAA+E,KAAAswB,KACAF,EAAAE,EAAA,IAAAr1B,KAAA+E,KAAAswB,SACOr1B,KAAA+E,KAAApK,eAAAw6B,IAIP,OAFAn1B,KAAA+E,KAAAowB,GAAA,EAEAA,uCC5BA,SAAAG,EAAAlqB,GACApL,KAAAoL,4UAGAkqB,EAAA/2B,WACA6T,YAAAkjB,EAEA5C,KAAA,SAAA91B,GACA,QAAArC,EAAA,EAAmBA,EAAAyF,KAAAoL,QAAA/P,OAAyBd,GAAA,EAC5C,GAAAyF,KAAAoL,QAAA7Q,KAAAqC,EAAA,OAAArC,EACA,UAMAsI,IAAA,SAAAjG,GACA,IAAA24B,EAAAv1B,KAAA0yB,KAAA91B,GACA,UAAA24B,OAAA1hB,EAAA7T,KAAAoL,QAAAmqB,EAAA,IAOAC,OAAA,SAAA54B,EAAAkG,EAAA2yB,GACA,IAAAC,EAAAD,MAAA74B,EAAAoD,KAAA21B,OAAAF,GAAAz1B,KACAu1B,EAAAG,EAAAhD,KAAA91B,GAAAwO,EAAAsqB,EAAAtqB,QAAA5D,QAOA,OANA,GAAA+tB,EACAnqB,EAAAnJ,KAAAwzB,GAAA74B,EAAAkG,IAEAsI,EAAAmqB,EAAA,GAAAzyB,EACA2yB,IAAArqB,EAAAmqB,GAAAE,IAEA,IAAAH,EAAAlqB,IAKAuqB,OAAA,SAAA/4B,GACA,IAAA24B,EAAAv1B,KAAA0yB,KAAA91B,GACA,OAAA24B,EAAA,OAAAv1B,KACA,IAAAoL,EAAApL,KAAAoL,QAAA5D,QAEA,OADA4D,EAAAT,OAAA4qB,EAAA,GACA,IAAAD,EAAAlqB,IAKAwqB,WAAA,SAAAh5B,EAAAkG,GACA,WAAAwyB,GAAA14B,EAAAkG,GAAA0P,OAAAxS,KAAA21B,OAAA/4B,GAAAwO,WAKAyqB,SAAA,SAAAj5B,EAAAkG,GACA,IAAAsI,EAAApL,KAAA21B,OAAA/4B,GAAAwO,QAAA5D,QAEA,OADA4D,EAAAnJ,KAAArF,EAAAkG,GACA,IAAAwyB,EAAAlqB,IAMAoI,UAAA,SAAAsiB,EAAAl5B,EAAAkG,GACA,IAAAizB,EAAA/1B,KAAA21B,OAAA/4B,GAAAwO,EAAA2qB,EAAA3qB,QAAA5D,QACA+tB,EAAAQ,EAAArD,KAAAoD,GAEA,OADA1qB,EAAAT,QAAA,GAAA4qB,EAAAnqB,EAAA/P,OAAAk6B,EAAA,EAAA34B,EAAAkG,GACA,IAAAwyB,EAAAlqB,IAMA+F,QAAA,SAAAnE,GACA,QAAAzS,EAAA,EAAmBA,EAAAyF,KAAAoL,QAAA/P,OAAyBd,GAAA,EAC5CyS,EAAAhN,KAAAoL,QAAA7Q,GAAAyF,KAAAoL,QAAA7Q,EAAA,KAMAmX,QAAA,SAAAtV,GAEA,OADAA,EAAAk5B,EAAAnqB,KAAA/O,IACAiP,KACA,IAAAiqB,EAAAl5B,EAAAgP,QAAAoH,OAAAxS,KAAAg2B,SAAA55B,GAAAgP,UADApL,MAOAsR,OAAA,SAAAlV,GAEA,OADAA,EAAAk5B,EAAAnqB,KAAA/O,IACAiP,KACA,IAAAiqB,EAAAt1B,KAAAg2B,SAAA55B,GAAAgP,QAAAoH,OAAApW,EAAAgP,UADApL,MAOAg2B,SAAA,SAAA55B,GACA,IAAAhB,EAAA4E,KACA5D,EAAAk5B,EAAAnqB,KAAA/O,GACA,QAAA7B,EAAA,EAAmBA,EAAA6B,EAAAgP,QAAA/P,OAAwBd,GAAA,EAC3Ca,IAAAu6B,OAAAv5B,EAAAgP,QAAA7Q,IACA,OAAAa,GAKAiQ,WACA,OAAArL,KAAAoL,QAAA/P,QAAA,IAQAi6B,EAAAnqB,KAAA,SAAArI,GACA,GAAAA,aAAAwyB,EAAA,OAAAxyB,EACA,IAAAsI,KACA,GAAAtI,EAAA,QAAAtG,KAAAsG,EAAAsI,EAAAnJ,KAAAzF,EAAAsG,EAAAtG,IACA,WAAA84B,EAAAlqB,IAGe,IAAAkB,EAAA,ECtEf,IAAA2pB,EAAA,SAAA7qB,EAAAC,GAMA,GALArL,KAAAoL,UAIApL,KAAAqL,QAAA,EACA,MAAAA,EAAqB,QAAA9Q,EAAA,EAAgBA,EAAA6Q,EAAA/P,OAAoBd,IACpDyF,KAAAqL,MAAAD,EAAA7Q,GAAA8K,UAGLgN,GAA0BzI,YAAc0I,cAAA,GAAqBvI,WAAauI,cAAA,GAAqB5M,YAAc4M,cAAA,IAM7G2jB,EAAA13B,UAAA23B,aAAA,SAAA/qB,EAAA2B,EAAAE,EAAAmpB,EAAAjsB,QACA,IAAAisB,MAAA,GAEA,QAAA57B,EAAA,EAAAoJ,EAAA,EAA0BA,EAAAmJ,EAAUvS,IAAA,CACpC,IAAA6K,EAAApF,KAAAoL,QAAA7Q,GAAA+P,EAAA3G,EAAAyB,EAAAC,SACA,GAAAiF,EAAAa,IAAA,IAAA6B,EAAA5H,EAAA+wB,EAAAxyB,EAAAuG,EAAA3P,IAAA6K,EAAAgG,QAAAC,KAAA,CACA,IAAA3J,EAAAiC,EAAA,EACAyB,EAAA8wB,aAAAvxB,KAAAE,IAAA,EAAAsG,EAAAzJ,GACAiD,KAAAC,IAAAQ,EAAAgG,QAAAC,KAAAyB,EAAApL,GACAsL,EAAAmpB,EAAAz0B,GAEAiC,EAAA2G,IAOA2rB,EAAA13B,UAAA63B,YAAA,SAAAppB,GACAhN,KAAAk2B,aAAA,EAAAl2B,KAAAqL,KAAA2B,IAIAipB,EAAA13B,UAAA83B,YAAA,SAAAlrB,EAAA2B,EAAAwpB,EAAAC,GACA,IAAA5gC,EAAA,GAAA6gC,GAAA,EAaA,OAZAx2B,KAAAk2B,aAAA/qB,EAAA2B,EAAA,SAAA9F,EAAArD,GACAqD,EAAAyvB,QACA9gC,GAAAqR,EAAArR,KAAA6R,MAAA7C,KAAAE,IAAAsG,EAAAxH,KAAAmJ,EAAAnJ,GACA6yB,GAAAF,GACKtvB,EAAA0vB,QAAAH,GACL5gC,GAAA4gC,EACAC,GAAAF,IACKE,GAAAxvB,EAAA2vB,UACLhhC,GAAA2gC,EACAE,GAAA,IAEG,GACH7gC,GAMAsgC,EAAA13B,UAAA+S,OAAA,SAAA1D,GACA,IAAAA,EAAAvC,KAAoB,OAAArL,KACpB,IAAAA,KAAAqL,KAAmB,OAAAuC,EACnB,IAAAiI,EAAA7V,KAAA+J,UAAA6sB,EAAAhpB,EAAAhE,WAAAwB,EAAApL,KAAAoL,QAAA5D,QAAAjN,EAAA,EAKA,IAJAsb,EAAA4gB,QAAA5gB,EAAAghB,WAAAD,KACAxrB,IAAA/P,OAAA,GAAAwa,EAAAihB,SAAAjhB,EAAAlgB,KAAAihC,EAAAjhC,MACA4E,EAAA,GAEQA,EAAAqT,EAAAxC,QAAA/P,OAA0Bd,IAAO6Q,EAAAnJ,KAAA2L,EAAAxC,QAAA7Q,IACzC,WAAA07B,EAAA7qB,EAAApL,KAAAqL,KAAAuC,EAAAvC,OAKA4qB,EAAA13B,UAAAw4B,IAAA,SAAA5rB,EAAA2B,GAEA,GADA,MAAAA,IAAmBA,EAAA9M,KAAAqL,MACnB,GAAAF,GAAA2B,GAAA9M,KAAAqL,KAAqC,OAAArL,KACrC,IAAA5E,KAAAiQ,EAAA,EACA,GAAAyB,EAAA3B,EAAkB,QAAA5Q,EAAA,EAAAoJ,EAAA,EAAyBA,EAAAmJ,EAAUvS,IAAA,CACrD,IAAA6K,EAAApF,KAAAoL,QAAA7Q,GAAA+P,EAAA3G,EAAAyB,EAAAC,SACAiF,EAAAa,KACAxH,EAAAwH,GAAAb,EAAAwC,KAEW1H,EADXA,EAAAqxB,OACWrxB,EAAA2xB,IAAApyB,KAAAE,IAAA,EAAAsG,EAAAxH,GAAAgB,KAAAC,IAAAQ,EAAAzP,KAAA0F,OAAAyR,EAAAnJ,IAEAyB,EAAA2xB,IAAApyB,KAAAE,IAAA,EAAAsG,EAAAxH,EAAA,GAAAgB,KAAAC,IAAAQ,EAAAgG,QAAAC,KAAAyB,EAAAnJ,EAAA,KAEXvI,EAAA6G,KAAAmD,GACAiG,GAAAjG,EAAAC,UAEA1B,EAAA2G,EAEA,WAAA2rB,EAAA76B,EAAAiQ,IAGA4qB,EAAA13B,UAAAy4B,WAAA,SAAA7rB,EAAA2B,GACA,OAAA3B,GAAA2B,EAAmBmpB,EAAAxpB,MACnB,GAAAtB,GAAA2B,GAAA9M,KAAAoL,QAAA/P,OAA+C2E,KAC/C,IAAAi2B,EAAAj2B,KAAAoL,QAAA5D,MAAA2D,EAAA2B,KAMAmpB,EAAA13B,UAAA04B,aAAA,SAAAhyB,EAAA+B,GACA,IAAA2pB,EAAA3wB,KAAAoL,QAAAnG,GACA,GAAA0rB,GAAA3pB,EAAwB,OAAAhH,KACxB,IAAA3D,EAAA2D,KAAAoL,QAAA5D,QACA6D,EAAArL,KAAAqL,KAAArE,EAAA3B,SAAAsrB,EAAAtrB,SAEA,OADAhJ,EAAA4I,GAAA+B,EACA,IAAAivB,EAAA55B,EAAAgP,IAMA4qB,EAAA13B,UAAAq3B,WAAA,SAAA5uB,GACA,WAAAivB,GAAAjvB,GAAAwL,OAAAxS,KAAAoL,SAAApL,KAAAqL,KAAArE,EAAA3B,WAMA4wB,EAAA13B,UAAAs3B,SAAA,SAAA7uB,GACA,WAAAivB,EAAAj2B,KAAAoL,QAAAoH,OAAAxL,GAAAhH,KAAAqL,KAAArE,EAAA3B,WAKA4wB,EAAA13B,UAAAgR,GAAA,SAAA3B,GACA,GAAA5N,KAAAoL,QAAA/P,QAAAuS,EAAAxC,QAAA/P,OAAoD,SACpD,QAAAd,EAAA,EAAiBA,EAAAyF,KAAAoL,QAAA/P,OAAyBd,IACrC,IAAAyF,KAAAoL,QAAA7Q,GAAAgV,GAAA3B,EAAAxC,QAAA7Q,IAA6C,SAClD,UAKA8X,EAAAzI,WAAA/G,IAAA,WAAiD,OAAA7C,KAAAoL,QAAA/P,OAAA2E,KAAAoL,QAAA,SAIjDiH,EAAAtI,UAAAlH,IAAA,WAAgD,OAAA7C,KAAAoL,QAAA/P,OAAA2E,KAAAoL,QAAApL,KAAAoL,QAAA/P,OAAA,SAIhDgX,EAAA3M,WAAA7C,IAAA,WAAiD,OAAA7C,KAAAoL,QAAA/P,QAKjD46B,EAAA13B,UAAA6G,MAAA,SAAAH,GACA,IAAAswB,EAAAv1B,KAAAoL,QAAAnG,GACA,IAAAswB,EAAe,UAAA1xB,WAAA,SAAAoB,EAAA,qBAAAjF,MACf,OAAAu1B,GAKAU,EAAA13B,UAAA24B,WAAA,SAAAjyB,GACA,OAAAjF,KAAAoL,QAAAnG,IAMAgxB,EAAA13B,UAAA4S,QAAA,SAAAnE,GACA,QAAAzS,EAAA,EAAA0Q,EAAA,EAAwB1Q,EAAAyF,KAAAoL,QAAA/P,OAAyBd,IAAA,CACjD,IAAA6K,EAAApF,KAAAoL,QAAA7Q,GACAyS,EAAA5H,EAAA6F,EAAA1Q,GACA0Q,GAAA7F,EAAAC,WAOA4wB,EAAA13B,UAAA44B,cAAA,SAAAvpB,EAAAjK,GAGA,YAFA,IAAAA,MAAA,GAzOA,SAAAwzB,EAAAlzB,EAAAC,EAAAP,GACA,QAAApJ,EAAA,GAAkBA,IAAA,CAClB,GAAAA,GAAA0J,EAAAyB,YAAAnL,GAAA2J,EAAAwB,WACO,OAAAzB,EAAAyB,YAAAxB,EAAAwB,WAAA,KAAA/B,EAEP,IAAAyzB,EAAAnzB,EAAAmB,MAAA7K,GAAA88B,EAAAnzB,EAAAkB,MAAA7K,GACA,GAAA68B,GAAAC,EAAA,CAEA,IAAAD,EAAAP,WAAAQ,GAAqC,OAAA1zB,EAErC,GAAAyzB,EAAAX,QAAAW,EAAAzhC,MAAA0hC,EAAA1hC,KAAA,CACA,QAAAsL,EAAA,EAAqBm2B,EAAAzhC,KAAAsL,IAAAo2B,EAAA1hC,KAAAsL,GAAkCA,IAC9C0C,IACT,OAAAA,EAEA,GAAAyzB,EAAAhsB,QAAAC,MAAAgsB,EAAAjsB,QAAAC,KAAA,CACA,IAAAsH,EAAAwkB,EAAAC,EAAAhsB,QAAAisB,EAAAjsB,QAAAzH,EAAA,GACA,SAAAgP,EAA0B,OAAAA,EAE1BhP,GAAAyzB,EAAA/xB,cAb2B1B,GAAAyzB,EAAA/xB,UAqO3B8xB,CAAAn3B,KAAA4N,EAAAjK,IAQAsyB,EAAA13B,UAAA+4B,YAAA,SAAA1pB,EAAAjK,EAAA4zB,GAIA,YAHA,IAAA5zB,MAAA3D,KAAAqL,WACA,IAAAksB,MAAA3pB,EAAAvC,MA9NA,SAAAisB,EAAArzB,EAAAC,EAAAszB,EAAAC,GACA,QAAAC,EAAAzzB,EAAAyB,WAAAiyB,EAAAzzB,EAAAwB,aAAiD,CACjD,MAAAgyB,GAAA,GAAAC,EACO,OAAAD,GAAAC,EAAA,MAA2B1zB,EAAAuzB,EAAAtzB,EAAAuzB,GAElC,IAAAL,EAAAnzB,EAAAmB,QAAAsyB,GAAAL,EAAAnzB,EAAAkB,QAAAuyB,GAAAtsB,EAAA+rB,EAAA/xB,SACA,GAAA+xB,GAAAC,EAAA,CAKA,IAAAD,EAAAP,WAAAQ,GAAqC,OAASpzB,EAAAuzB,EAAAtzB,EAAAuzB,GAE9C,GAAAL,EAAAX,QAAAW,EAAAzhC,MAAA0hC,EAAA1hC,KAAA,CAEA,IADA,IAAAiiC,EAAA,EAAAC,EAAAlzB,KAAAC,IAAAwyB,EAAAzhC,KAAA0F,OAAAg8B,EAAA1hC,KAAA0F,QACAu8B,EAAAC,GAAAT,EAAAzhC,KAAAyhC,EAAAzhC,KAAA0F,OAAAu8B,EAAA,IAAAP,EAAA1hC,KAAA0hC,EAAA1hC,KAAA0F,OAAAu8B,EAAA,IACAA,IAAeJ,IAAQC,IAEvB,OAAcxzB,EAAAuzB,EAAAtzB,EAAAuzB,GAEd,GAAAL,EAAAhsB,QAAAC,MAAAgsB,EAAAjsB,QAAAC,KAAA,CACA,IAAAsH,EAAA2kB,EAAAF,EAAAhsB,QAAAisB,EAAAjsB,QAAAosB,EAAA,EAAAC,EAAA,GACA,GAAA9kB,EAAkB,OAAAA,EAElB6kB,GAAAnsB,EAAiBosB,GAAApsB,OAjBjBmsB,GAAAnsB,EAAmBosB,GAAApsB,GAyNnBisB,CAAAt3B,KAAA4N,EAAAjK,EAAA4zB,IAOAtB,EAAA13B,UAAAyoB,UAAA,SAAArjB,EAAAm0B,GAGA,QAFA,IAAAA,OAAA,GAEA,GAAAn0B,EAAiB,OAAAo0B,EAAA,EAAAp0B,GACjB,GAAAA,GAAA3D,KAAAqL,KAAyB,OAAA0sB,EAAA/3B,KAAAoL,QAAA/P,OAAAsI,GACzB,GAAAA,EAAA3D,KAAAqL,MAAA1H,EAAA,EAAmC,UAAAE,WAAA,YAAAF,EAAA,mCACnC,QAAApJ,EAAA,EAAAqJ,EAAA,GAA8BrJ,IAAA,CAC9B,IAAA+P,EAAA1G,EAAA5D,KAAAoF,MAAA7K,GAAA8K,SACA,GAAAiF,GAAA3G,EACA,OAAA2G,GAAA3G,GAAAm0B,EAAA,EAAoCC,EAAAx9B,EAAA,EAAA+P,GACpCytB,EAAAx9B,EAAAqJ,GAEAA,EAAA0G,IAMA2rB,EAAA13B,UAAAC,SAAA,WAAoD,UAAAwB,KAAAg4B,gBAAA,KAEpD/B,EAAA13B,UAAAy5B,cAAA,WAA8D,OAAAh4B,KAAAoL,QAAAhD,KAAA,OAI9D6tB,EAAA13B,UAAA05B,OAAA,WACA,OAAAj4B,KAAAoL,QAAA/P,OAAA2E,KAAAoL,QAAAhP,IAAA,SAAAmK,GAA8D,OAAAA,EAAA0xB,WAAqB,MAKnFhC,EAAAiC,SAAA,SAAA1vB,EAAA1F,GACA,IAAAA,EAAe,OAAAmzB,EAAAxpB,MACf,IAAAgY,MAAAC,QAAA5hB,GAA8B,UAAAe,WAAA,uCAC9B,WAAAoyB,EAAAnzB,EAAA1G,IAAAoM,EAAA2vB,gBAMAlC,EAAAmC,UAAA,SAAAvjB,GACA,IAAAA,EAAAxZ,OAAsB,OAAA46B,EAAAxpB,MAEtB,IADA,IAAA4rB,EAAAhtB,EAAA,EACA9Q,EAAA,EAAiBA,EAAAsa,EAAAxZ,OAAkBd,IAAA,CACnC,IAAAyM,EAAA6N,EAAAta,GACA8Q,GAAArE,EAAA3B,SACA9K,GAAAyM,EAAAyvB,QAAA5hB,EAAAta,EAAA,GAAAs8B,WAAA7vB,IACAqxB,IAAoBA,EAAAxjB,EAAArN,MAAA,EAAAjN,IACpB89B,IAAAh9B,OAAA,GAAA2L,EAAA8vB,SAAAuB,IAAAh9B,OAAA,GAAA1F,KAAAqR,EAAArR,OACK0iC,GACLA,EAAAp2B,KAAA+E,GAGA,WAAAivB,EAAAoC,GAAAxjB,EAAAxJ,IAQA4qB,EAAA9qB,KAAA,SAAAzC,GACA,IAAAA,EAAe,OAAAutB,EAAAxpB,MACf,GAAA/D,aAAAutB,EAAkC,OAAAvtB,EAClC,GAAA+b,MAAAC,QAAAhc,GAA6B,OAAA1I,KAAAo4B,UAAA1vB,GAC7B,GAAAA,EAAA5C,MAAoB,WAAAmwB,GAAAvtB,KAAArD,UACpB,UAAAxB,WAAA,mBAAA6E,EAAA,kBACAA,EAAAwtB,aAAA,yEAGA55B,OAAAmW,iBAAAwjB,EAAA13B,UAAA8T,GAEA,IAAAkjB,GAAatwB,MAAA,EAAA4hB,OAAA,GACb,SAAAkR,EAAA9yB,EAAA4hB,GAGA,OAFA0O,EAAAtwB,QACAswB,EAAA1O,SACA0O,EASA,SAAA+C,EAAAr0B,EAAAC,GACA,GAAAD,IAAAC,EAAgB,SAChB,IAAAD,GAAA,iBAAAA,IACAC,GAAA,iBAAAA,EAAqC,SACrC,IAAA2Q,EAAA4P,MAAAC,QAAAzgB,GACA,GAAAwgB,MAAAC,QAAAxgB,IAAA2Q,EAAkC,SAClC,GAAAA,EAAA,CACA,GAAA5Q,EAAA5I,QAAA6I,EAAA7I,OAA+B,SAC/B,QAAAd,EAAA,EAAmBA,EAAA0J,EAAA5I,OAAcd,IAAO,IAAA+9B,EAAAr0B,EAAA1J,GAAA2J,EAAA3J,IAAgC,aACrE,CACH,QAAA0Q,KAAAhH,EAAsB,KAAAgH,KAAA/G,GAAAo0B,EAAAr0B,EAAAgH,GAAA/G,EAAA+G,KAA6C,SACnE,QAAAstB,KAAAr0B,EAAwB,KAAAq0B,KAAAt0B,GAAmB,SAE3C,SAfAgyB,EAAAxpB,MAAA,IAAAwpB,KAAA,GAwBA,IAAAuC,EAAA,SAAAp5B,EAAA0G,GAGA9F,KAAAZ,OAGAY,KAAA8F,SAyGA,SAAA2yB,EAAAl5B,GACA,IAAAP,EAAAzD,MAAAkD,KAAAuB,KAAAT,GAEA,OADAP,EAAAmT,UAAAsmB,EAAAl6B,UACAS,EAnGAw5B,EAAAj6B,UAAAm6B,SAAA,SAAA31B,GAEA,IADA,IAAA1G,EAAAs8B,GAAA,EACAp+B,EAAA,EAAiBA,EAAAwI,EAAA1H,OAAgBd,IAAA,CACjC,IAAAqT,EAAA7K,EAAAxI,GACA,GAAAyF,KAAAuP,GAAA3B,GAAyB,OAAA7K,EACzB,GAAA/C,KAAAZ,KAAAw5B,SAAAhrB,EAAAxO,MACA/C,IAAkBA,EAAA0G,EAAAyE,MAAA,EAAAjN,QACb,IAAAqT,EAAAxO,KAAAw5B,SAAA54B,KAAAZ,MACL,OAAA2D,GAEA41B,GAAA/qB,EAAAxO,KAAAy5B,KAAA74B,KAAAZ,KAAAy5B,OACAx8B,IAAoBA,EAAA0G,EAAAyE,MAAA,EAAAjN,IACpB8B,EAAA4F,KAAAjC,MACA24B,GAAA,GAEAt8B,GAAiBA,EAAA4F,KAAA2L,IAKjB,OAFAvR,IAAcA,EAAA0G,EAAAyE,SACdmxB,GAAgBt8B,EAAA4F,KAAAjC,MAChB3D,GAMAm8B,EAAAj6B,UAAAu6B,cAAA,SAAA/1B,GACA,QAAAxI,EAAA,EAAiBA,EAAAwI,EAAA1H,OAAgBd,IAC5B,GAAAyF,KAAAuP,GAAAxM,EAAAxI,IACE,OAAAwI,EAAAyE,MAAA,EAAAjN,GAAAiY,OAAAzP,EAAAyE,MAAAjN,EAAA,IACP,OAAAwI,GAKAy1B,EAAAj6B,UAAAw6B,QAAA,SAAAh2B,GACA,QAAAxI,EAAA,EAAiBA,EAAAwI,EAAA1H,OAAgBd,IAC5B,GAAAyF,KAAAuP,GAAAxM,EAAAxI,IAAuB,SAC5B,UAMAi+B,EAAAj6B,UAAAgR,GAAA,SAAA3B,GACA,OAAA5N,MAAA4N,GACA5N,KAAAZ,MAAAwO,EAAAxO,MAAAk5B,EAAAt4B,KAAA8F,MAAA8H,EAAA9H,QAKA0yB,EAAAj6B,UAAA05B,OAAA,WACA,IAAAzZ,GAAapf,KAAAY,KAAAZ,KAAAtE,MACb,QAAAk+B,KAAAh5B,KAAA8F,MAAA,CACA0Y,EAAA1Y,MAAA9F,KAAA8F,MACA,MAEA,OAAA0Y,GAIAga,EAAAN,SAAA,SAAA1vB,EAAAuF,GACA,IAAAA,EAAc,UAAAlK,WAAA,mCACd,IAAAzE,EAAAoJ,EAAAmR,MAAA5L,EAAA3O,MACA,IAAAA,EAAc,UAAAyE,WAAA,yBAAAkK,EAAA,wBACd,OAAA3O,EAAA7C,OAAAwR,EAAAjI,QAKA0yB,EAAAS,QAAA,SAAAh1B,EAAAC,GACA,GAAAD,GAAAC,EAAe,SACf,GAAAD,EAAA5I,QAAA6I,EAAA7I,OAA6B,SAC7B,QAAAd,EAAA,EAAiBA,EAAA0J,EAAA5I,OAAcd,IAC1B,IAAA0J,EAAA1J,GAAAgV,GAAArL,EAAA3J,IAAsB,SAC3B,UAMAi+B,EAAAU,QAAA,SAAAvf,GACA,IAAAA,GAAA,GAAAA,EAAAte,OAAoC,OAAAm9B,EAAAW,KACpC,GAAAxf,aAAA6e,EAA8B,OAAA7e,GAC9B,IAAAtd,EAAAsd,EAAAnS,QAEA,OADAnL,EAAAu1B,KAAA,SAAA3tB,EAAAC,GAA6B,OAAAD,EAAA7E,KAAAy5B,KAAA30B,EAAA9E,KAAAy5B,OAC7Bx8B,GAIAm8B,EAAAW,QAYAV,EAAAl6B,UAAAjC,OAAAC,OAAAhB,MAAAgD,WACAk6B,EAAAl6B,UAAA6T,YAAAqmB,EACAA,EAAAl6B,UAAAzD,KAAA,eAKA,IAAAs+B,EAAA,SAAAhuB,EAAAiuB,EAAAC,GAEAt5B,KAAAoL,UAEApL,KAAAq5B,YAEAr5B,KAAAs5B,WAGAC,GAA4BluB,MAAQiH,cAAA,IA8FpC,SAAA1F,EAAArB,EAAAC,EAAAhE,GACA,GAAAA,EAAA6xB,UAAA9tB,EAAAzK,MACK,UAAA23B,EAAA,mDACL,GAAAltB,EAAAzK,MAAA0G,EAAA6xB,WAAA7tB,EAAA1K,MAAA0G,EAAA8xB,QACK,UAAAb,EAAA,4BACL,OAGA,SAAAe,EAAAjuB,EAAAC,EAAAhE,EAAA1G,GACA,IAAAmE,EAAAsG,EAAAtG,MAAAnE,GAAAkG,EAAAuE,EAAAvE,KAAAlG,GACA,GAAAmE,GAAAuG,EAAAvG,MAAAnE,MAAAyK,EAAAzK,MAAA0G,EAAA6xB,UAAA,CACA,IAAA1mB,EAAA6mB,EAAAjuB,EAAAC,EAAAhE,EAAA1G,EAAA,GACA,OAAAkG,EAAA3K,KAAA2K,EAAAoE,QAAA6rB,aAAAhyB,EAAA0N,IACG,GAAAnL,EAAA4D,QAAAC,KAEA,IAAA7D,EAAA6xB,WAAA7xB,EAAA8xB,SAAA/tB,EAAAzK,UAAA0K,EAAA1K,SAGA,CACH,IAAA24B,EAgFA,SAAAjyB,EAAAkyB,GAGA,IAFA,IAAAC,EAAAD,EAAA54B,MAAA0G,EAAA6xB,UACAryB,EADA0yB,EAAA1yB,KAAA2yB,GACAt9B,KAAAmL,EAAA4D,SACA7Q,EAAAo/B,EAAA,EAAyBp/B,GAAA,EAAQA,IAC5ByM,EAAA0yB,EAAA1yB,KAAAzM,GAAA8B,KAAA45B,EAAA9qB,KAAAnE,IACL,OAAUtF,MAAAsF,EAAA4yB,eAAApyB,EAAA6xB,UAAAM,GACVrvB,IAAAtD,EAAA4yB,eAAA5yB,EAAAoE,QAAAC,KAAA7D,EAAA8xB,QAAAK,IAtFAE,CAAAryB,EAAA+D,GACA7J,EAAA+3B,EAAA/3B,MACA4I,EAAAmvB,EAAAnvB,IACA,OAAWwvB,EAAK9yB,EA8ChB,SAAA+yB,EAAAxuB,EAAAyuB,EAAAC,EAAAzuB,EAAA1K,GACA,IAAAu4B,EAAA9tB,EAAAzK,SAAAo5B,EAAA3uB,EAAAyuB,EAAAl5B,EAAA,GACA,IAAAw4B,EAAA9tB,EAAA1K,SAAAo5B,EAAAD,EAAAzuB,EAAA1K,EAAA,GAEA,IAAAsK,KACA+uB,EAAA,KAAA5uB,EAAAzK,EAAAsK,GACAiuB,GAAAC,GAAAU,EAAA/0B,MAAAnE,IAAAm5B,EAAAh1B,MAAAnE,IACAs5B,EAAAf,EAAAC,GACAe,EAAYP,EAAKT,EAAAU,EAAAxuB,EAAAyuB,EAAAC,EAAAzuB,EAAA1K,EAAA,IAAAsK,KAEjBiuB,GACOgB,EAASP,EAAKT,EAAAiB,EAAA/uB,EAAAyuB,EAAAl5B,EAAA,IAAAsK,GACrB+uB,EAAAH,EAAAC,EAAAn5B,EAAAsK,GACAkuB,GACOe,EAASP,EAAKR,EAAAgB,EAAAL,EAAAzuB,EAAA1K,EAAA,IAAAsK,IAErB+uB,EAAA3uB,EAAA,KAAA1K,EAAAsK,GACA,WAAA6qB,EAAA7qB,GA/DgB2uB,CAAAxuB,EAAA7J,EAAA4I,EAAAkB,EAAA1K,IANhB,IAAAoJ,EAAAqB,EAAArB,OAAAkB,EAAAlB,EAAAkB,QACA,OAAW0uB,EAAK5vB,EAAAkB,EAAA2rB,IAAA,EAAAxrB,EAAAgvB,cAAAjpB,OAAA9J,EAAA4D,SAAAkG,OAAAlG,EAAA2rB,IAAAvrB,EAAA+uB,gBAHhB,OAAWT,EAAK9yB,EAAAszB,EAAA/uB,EAAAC,EAAA1K,IAThB04B,CAAAjuB,EAAAC,EAAAhE,EAAA,GAqBA,SAAA4yB,EAAAI,EAAAC,GACA,IAAAA,EAAAr7B,KAAAs7B,kBAAAF,EAAAp7B,MACK,UAAAq5B,EAAA,eAAAgC,EAAAr7B,KAAAtE,KAAA,SAAA0/B,EAAAp7B,KAAAtE,MAGL,SAAAo/B,EAAAS,EAAAC,EAAA95B,GACA,IAAAkG,EAAA2zB,EAAA3zB,KAAAlG,GAEA,OADAs5B,EAAApzB,EAAA4zB,EAAA5zB,KAAAlG,IACAkG,EAGA,SAAAqzB,EAAAj1B,EAAA6W,GACA,IAAApG,EAAAoG,EAAA5gB,OAAA,EACAwa,GAAA,GAAAzQ,EAAAqxB,QAAArxB,EAAAyxB,WAAA5a,EAAApG,IACKoG,EAAApG,GAAAzQ,EAAA0xB,SAAA7a,EAAApG,GAAAlgB,KAAAyP,EAAAzP,MAEAsmB,EAAAha,KAAAmD,GAGL,SAAA+0B,EAAAH,EAAAC,EAAAn5B,EAAAmb,GACA,IAAAjV,GAAAizB,GAAAD,GAAAhzB,KAAAlG,GACA+5B,EAAA,EAAAC,EAAAb,IAAAh1B,MAAAnE,GAAAkG,EAAAtB,WACAs0B,IACAa,EAAAb,EAAA/0B,MAAAnE,GACAk5B,EAAAl5B,QACA+5B,IACKb,EAAAe,aACLV,EAAAL,EAAArwB,UAAAsS,GACA4e,MAGA,QAAAtgC,EAAAsgC,EAA0BtgC,EAAAugC,EAAcvgC,IAAO8/B,EAAArzB,EAAA5B,MAAA7K,GAAA0hB,GAC/Cge,KAAAn5B,UAAAm5B,EAAAc,YACKV,EAAAJ,EAAAnwB,WAAAmS,GAGL,SAAS6d,EAAK9yB,EAAAoE,GACd,IAAApE,EAAA5H,KAAA47B,aAAA5vB,GACK,UAAAqtB,EAAA,4BAAAzxB,EAAA5H,KAAAtE,MACL,OAAAkM,EAAA3K,KAAA+O,GAuBA,SAAAkvB,EAAA/uB,EAAAC,EAAA1K,GACA,IAAAsK,MACA+uB,EAAA,KAAA5uB,EAAAzK,EAAAsK,GACAG,EAAAzK,UAEAu5B,EAAYP,EADZI,EAAA3uB,EAAAC,EAAA1K,EAAA,GACiBw5B,EAAA/uB,EAAAC,EAAA1K,EAAA,IAAAsK,GAGjB,OADA+uB,EAAA3uB,EAAA,KAAA1K,EAAAsK,GACA,IAAA6qB,EAAA7qB,GA1LAmuB,EAAAluB,KAAAxI,IAAA,WACA,OAAA7C,KAAAoL,QAAAC,KAAArL,KAAAq5B,UAAAr5B,KAAAs5B,SAGAF,EAAA76B,UAAA08B,SAAA,SAAAt3B,EAAA4I,GACA,IAAAnB,EAoEA,SAAA8vB,EAAA9vB,EAAApP,EAAAm/B,EAAAjxB,GACA,IAAAuvB,EAAAruB,EAAA4b,UAAAhrB,GACA,IAAAiJ,EAAAw0B,EAAAx0B,MACA,IAAA4hB,EAAA4S,EAAA5S,OACA,IAAAzhB,EAAAgG,EAAA8rB,WAAAjyB,GACA,GAAA4hB,GAAA7qB,GAAAoJ,EAAAqxB,OACA,OAAAvsB,MAAAkxB,WAAAn2B,IAAAk2B,GAA6D,KAC7D/vB,EAAA2rB,IAAA,EAAA/6B,GAAAsV,OAAA6pB,GAAA7pB,OAAAlG,EAAA2rB,IAAA/6B,IAEA,IAAA2W,EAAAuoB,EAAA91B,EAAAgG,QAAApP,EAAA6qB,EAAA,EAAAsU,GACA,OAAAxoB,GAAAvH,EAAA6rB,aAAAhyB,EAAAG,EAAA/I,KAAAsW,IA9EAuoB,CAAAl7B,KAAAoL,QAAAzH,EAAA3D,KAAAq5B,UAAA9sB,EAAA,MACA,OAAAnB,GAAA,IAAAguB,EAAAhuB,EAAApL,KAAAq5B,UAAAr5B,KAAAs5B,UAGAF,EAAA76B,UAAA88B,cAAA,SAAAlwB,EAAA2B,GACA,WAAAssB,EA+CA,SAAAkC,EAAAlwB,EAAAD,EAAA2B,GACA,IAAA2sB,EAAAruB,EAAA4b,UAAA7b,GACA,IAAAlG,EAAAw0B,EAAAx0B,MACA,IAAA4hB,EAAA4S,EAAA5S,OACA,IAAAzhB,EAAAgG,EAAA8rB,WAAAjyB,GACA,IAAAs2B,EAAAnwB,EAAA4b,UAAAla,GACA,IAAA0uB,EAAAD,EAAAt2B,MACA,IAAAw2B,EAAAF,EAAA1U,OACA,GAAAA,GAAA1b,GAAA/F,EAAAqxB,OAAA,CACA,GAAAgF,GAAA3uB,IAAA1B,EAAAhG,MAAAo2B,GAAA/E,OAA2D,UAAA5yB,WAAA,2BAC3D,OAAAuH,EAAA2rB,IAAA,EAAA5rB,GAAAmG,OAAAlG,EAAA2rB,IAAAjqB,IAEA,GAAA7H,GAAAu2B,EAAyB,UAAA33B,WAAA,2BACzB,OAAAuH,EAAA6rB,aAAAhyB,EAAAG,EAAA/I,KAAAi/B,EAAAl2B,EAAAgG,QAAAD,EAAA0b,EAAA,EAAA/Z,EAAA+Z,EAAA,KA5DAyU,CAAAt7B,KAAAoL,QAAAD,EAAAnL,KAAAq5B,UAAAvsB,EAAA9M,KAAAq5B,WAAAr5B,KAAAq5B,UAAAr5B,KAAAs5B,UAKAF,EAAA76B,UAAAgR,GAAA,SAAA3B,GACA,OAAA5N,KAAAoL,QAAAmE,GAAA3B,EAAAxC,UAAApL,KAAAq5B,WAAAzrB,EAAAyrB,WAAAr5B,KAAAs5B,SAAA1rB,EAAA0rB,SAGAF,EAAA76B,UAAAC,SAAA,WACA,OAAAwB,KAAAoL,QAAA,IAAApL,KAAAq5B,UAAA,IAAAr5B,KAAAs5B,QAAA,KAKAF,EAAA76B,UAAA05B,OAAA,WACA,IAAAj4B,KAAAoL,QAAAC,KAA2B,YAC3B,IAAA0C,GAAc3C,QAAApL,KAAAoL,QAAA6sB,UAGd,OAFAj4B,KAAAq5B,UAAA,IAA2BtrB,EAAAsrB,UAAAr5B,KAAAq5B,WAC3Br5B,KAAAs5B,QAAA,IAAyBvrB,EAAAurB,QAAAt5B,KAAAs5B,SACzBvrB,GAKAqrB,EAAAlB,SAAA,SAAA1vB,EAAAuF,GACA,IAAAA,EAAc,OAAAqrB,EAAA3sB,MACd,IAAA4sB,EAAAtrB,EAAAsrB,WAAA,EAAAC,EAAAvrB,EAAAurB,SAAA,EACA,oBAAAD,GAAA,iBAAAC,EACK,UAAAz1B,WAAA,oCACL,WAAAu1B,EAAAnD,EAAAiC,SAAA1vB,EAAAuF,EAAA3C,SAAA2C,EAAAsrB,WAAA,EAAAtrB,EAAAurB,SAAA,IAMAF,EAAAsC,QAAA,SAAAnvB,EAAAovB,QACA,IAAAA,OAAA,GAGA,IADA,IAAAtC,EAAA,EAAAC,EAAA,EACA/yB,EAAAgG,EAAA3C,WAAmCrD,MAAAmwB,SAAAiF,IAAAp1B,EAAAnH,KAAAmG,KAAAq2B,WAA6Dr1B,IAAAqD,WAAoByvB,IACpH,QAAAwC,EAAAtvB,EAAAxC,UAAoC8xB,MAAAnF,SAAAiF,IAAAE,EAAAz8B,KAAAmG,KAAAq2B,WAAmEC,IAAA9xB,UAAuBuvB,IAC9H,WAAAF,EAAA7sB,EAAA8sB,EAAAC,IAGAh9B,OAAAmW,iBAAA2mB,EAAA76B,UAAAg7B,GAiCAH,EAAA3sB,MAAA,IAAA2sB,EAAAnD,EAAAxpB,MAAA,KAsHA,IAAAqvB,EAAA,SAAAn4B,EAAAo4B,EAAAxB,GAEAv6B,KAAA2D,MACA3D,KAAA+7B,OAKA/7B,KAAAc,MAAAi7B,EAAA1gC,OAAA,IAEA2E,KAAAu6B,gBAGAyB,GAA4B9xB,QAAUoI,cAAA,GAAqBzI,KAAOyI,cAAA,GAAqByoB,YAAczoB,cAAA,GAAqB3I,WAAa2I,cAAA,GAAqBxI,YAAcwI,cAAA,IAE1KwpB,EAAAv9B,UAAA09B,aAAA,SAAAC,GACA,aAAAA,EAAoBl8B,KAAAc,MACpBo7B,EAAA,EAAgBl8B,KAAAc,MAAAo7B,EAChBA,GAOAF,EAAA9xB,OAAArH,IAAA,WAA+C,OAAA7C,KAAAgH,KAAAhH,KAAAc,QAI/Ck7B,EAAAnyB,IAAAhH,IAAA,WAA4C,OAAA7C,KAAAgH,KAAA,IAK5C80B,EAAAv9B,UAAAyI,KAAA,SAAAlG,GAAoD,OAAAd,KAAA+7B,KAAA,EAAA/7B,KAAAi8B,aAAAn7B,KAMpDg7B,EAAAv9B,UAAA0G,MAAA,SAAAnE,GAAsD,OAAAd,KAAA+7B,KAAA,EAAA/7B,KAAAi8B,aAAAn7B,GAAA,IAKtDg7B,EAAAv9B,UAAAyR,WAAA,SAAAlP,GAEA,OADAA,EAAAd,KAAAi8B,aAAAn7B,GACAd,KAAAiF,MAAAnE,OAAAd,KAAAc,OAAAd,KAAA+6B,WAAA,MAMAe,EAAAv9B,UAAAmD,MAAA,SAAAZ,GAEA,WADAA,EAAAd,KAAAi8B,aAAAn7B,IACA,EAAAd,KAAA+7B,KAAA,EAAAj7B,EAAA,MAMAg7B,EAAAv9B,UAAA+L,IAAA,SAAAxJ,GAEA,OADAA,EAAAd,KAAAi8B,aAAAn7B,GACAd,KAAA0B,MAAAZ,GAAAd,KAAAgH,KAAAlG,GAAAsK,QAAAC,MAOAywB,EAAAv9B,UAAA0K,OAAA,SAAAnI,GAEA,KADAA,EAAAd,KAAAi8B,aAAAn7B,IACe,UAAA+C,WAAA,kDACf,OAAA/C,GAAAd,KAAAc,MAAA,EAAAd,KAAA2D,IAAA3D,KAAA+7B,KAAA,EAAAj7B,EAAA,IAMAg7B,EAAAv9B,UAAAmL,MAAA,SAAA5I,GAEA,KADAA,EAAAd,KAAAi8B,aAAAn7B,IACe,UAAA+C,WAAA,iDACf,OAAA/C,GAAAd,KAAAc,MAAA,EAAAd,KAAA2D,IAAA3D,KAAA+7B,KAAA,EAAAj7B,EAAA,GAAAd,KAAA+7B,KAAA,EAAAj7B,GAAAuE,UAOA22B,EAAAjB,WAAAl4B,IAAA,WAAmD,OAAA7C,KAAA2D,IAAA3D,KAAA+7B,KAAA/7B,KAAA+7B,KAAA1gC,OAAA,IAMnD2gC,EAAAryB,UAAA9G,IAAA,WACA,IAAAqH,EAAAlK,KAAAkK,OAAAjF,EAAAjF,KAAAiF,MAAAjF,KAAAc,OACA,GAAAmE,GAAAiF,EAAAxE,WAAmC,YACnC,IAAAy2B,EAAAn8B,KAAA2D,IAAA3D,KAAA+7B,KAAA/7B,KAAA+7B,KAAA1gC,OAAA,GAAA+J,EAAA8E,EAAA9E,MAAAH,GACA,OAAAk3B,EAAAjyB,EAAA9E,MAAAH,GAAA8xB,IAAAoF,GAAA/2B,GAOA42B,EAAAlyB,WAAAjH,IAAA,WACA,IAAAoC,EAAAjF,KAAAiF,MAAAjF,KAAAc,OACAq7B,EAAAn8B,KAAA2D,IAAA3D,KAAA+7B,KAAA/7B,KAAA+7B,KAAA1gC,OAAA,GACA,OAAA8gC,EAAan8B,KAAAkK,OAAA9E,MAAAH,GAAA8xB,IAAA,EAAAoF,GACb,GAAAl3B,EAAA,KAAAjF,KAAAkK,OAAA9E,MAAAH,EAAA,IAQA62B,EAAAv9B,UAAAob,MAAA,WACA,IAAAzP,EAAAlK,KAAAkK,OAAAjF,EAAAjF,KAAAiF,QAGA,MAAAiF,EAAAkB,QAAAC,KAAiC,OAAAmtB,EAAAW,KAGjC,GAAAn5B,KAAA+6B,WAAwB,OAAA7wB,EAAA9E,MAAAH,GAAA0U,MAExB,IAAA6gB,EAAAtwB,EAAAgtB,WAAAjyB,EAAA,GAAA2I,EAAA1D,EAAAgtB,WAAAjyB,GAGA,IAAAu1B,EAAA,CAAc,IAAA4B,EAAA5B,EAAgBA,EAAA5sB,EAAcA,EAAAwuB,EAK5C,IADA,IAAAziB,EAAA6gB,EAAA7gB,MACApf,EAAA,EAAiBA,EAAAof,EAAAte,OAAkBd,KAC9B,IAAAof,EAAApf,GAAA6E,KAAAmG,KAAA2W,WAAAtO,GAAA+L,EAAApf,GAAAw+B,QAAAnrB,EAAA+L,SACEA,IAAApf,KAAAu+B,cAAAnf,IAEP,OAAAA,GAUAmiB,EAAAv9B,UAAA89B,YAAA,SAAApC,GACA,IAAAvwB,EAAA1J,KAAAkK,OAAAgtB,WAAAl3B,KAAAiF,SACA,IAAAyE,MAAA4yB,SAAkC,YAGlC,IADA,IAAA3iB,EAAAjQ,EAAAiQ,MAAApZ,EAAA05B,EAAA/vB,OAAAgtB,WAAA+C,EAAAh1B,SACA1K,EAAA,EAAiBA,EAAAof,EAAAte,OAAkBd,KAC9B,IAAAof,EAAApf,GAAA6E,KAAAmG,KAAA2W,WAAA3b,GAAAoZ,EAAApf,GAAAw+B,QAAAx4B,EAAAoZ,SACEA,IAAApf,KAAAu+B,cAAAnf,IACP,OAAAA,GAMAmiB,EAAAv9B,UAAAg+B,YAAA,SAAA54B,GACA,QAAA7C,EAAAd,KAAAc,MAA8BA,EAAA,EAAWA,IACpC,GAAAd,KAAA0B,MAAAZ,IAAA6C,GAAA3D,KAAAsK,IAAAxJ,IAAA6C,EAA0D,OAAA7C,EAC/D,UAWAg7B,EAAAv9B,UAAAi+B,WAAA,SAAA5uB,EAAA6uB,GAGA,QAFA,IAAA7uB,MAAA5N,MAEA4N,EAAAjK,IAAA3D,KAAA2D,IAA6B,OAAAiK,EAAA4uB,WAAAx8B,MAC7B,QAAA+I,EAAA/I,KAAAc,OAAAd,KAAAkK,OAAAwyB,eAAA18B,KAAA2D,KAAAiK,EAAAjK,IAAA,KAAyFoF,GAAA,EAAQA,IAC5F,GAAA6E,EAAAjK,KAAA3D,KAAAsK,IAAAvB,MAAA0zB,KAAAz8B,KAAAgH,KAAA+B,KACE,WAAA4zB,EAAA38B,KAAA4N,EAAA7E,IAKP+yB,EAAAv9B,UAAAq+B,WAAA,SAAAhvB,GACA,OAAA5N,KAAA2D,IAAA3D,KAAAu6B,cAAA3sB,EAAAjK,IAAAiK,EAAA2sB,cAKAuB,EAAAv9B,UAAAsG,IAAA,SAAA+I,GACA,OAAAA,EAAAjK,IAAA3D,KAAA2D,IAAAiK,EAAA5N,MAKA87B,EAAAv9B,UAAAqG,IAAA,SAAAgJ,GACA,OAAAA,EAAAjK,IAAA3D,KAAA2D,IAAAiK,EAAA5N,MAGA87B,EAAAv9B,UAAAC,SAAA,WAEA,IADA,IAAAq+B,EAAA,GACAtiC,EAAA,EAAiBA,GAAAyF,KAAAc,MAAiBvG,IAC7BsiC,MAAA,QAAA78B,KAAAgH,KAAAzM,GAAA6E,KAAAtE,KAAA,IAAAkF,KAAAiF,MAAA1K,EAAA,GACL,OAAAsiC,EAAA,IAAA78B,KAAAu6B,cAGAuB,EAAA9yB,QAAA,SAAAa,EAAAlG,GACA,KAAAA,GAAA,GAAAA,GAAAkG,EAAAuB,QAAAC,MAA+C,UAAAxH,WAAA,YAAAF,EAAA,iBAG/C,IAFA,IAAAo4B,KACAr6B,EAAA,EAAA64B,EAAA52B,EACAqD,EAAA6C,IAAuB,CACvB,IAAA4vB,EAAAzyB,EAAAoE,QAAA4b,UAAAuT,GACAt1B,EAAAw0B,EAAAx0B,MACA4hB,EAAA4S,EAAA5S,OACAiW,EAAAvC,EAAA1T,EAEA,GADAkV,EAAA95B,KAAA+E,EAAA/B,EAAAvD,EAAAmlB,IACAiW,EAAe,MAEf,IADA91B,IAAA5B,MAAAH,IACAwxB,OAAsB,MACtB8D,EAAAuC,EAAA,EACAp7B,GAAAmlB,EAAA,EAEA,WAAAiV,EAAAn4B,EAAAo4B,EAAAxB,IAGAuB,EAAAiB,cAAA,SAAAlzB,EAAAlG,GACA,QAAApJ,EAAA,EAAiBA,EAAAyiC,EAAA3hC,OAAyBd,IAAA,CAC1C,IAAAkO,EAAAu0B,EAAAziC,GACA,GAAAkO,EAAA9E,QAAA8E,EAAAoB,OAAiD,OAAApB,EAEjD,IAAArN,EAAA4hC,EAAAC,GAAAnB,EAAA9yB,QAAAa,EAAAlG,GAEA,OADAs5B,KAAA,GAAAC,EACA9hC,GAGAkB,OAAAmW,iBAAAqpB,EAAAv9B,UAAAy9B,GAEA,IAAAgB,KAAAC,EAAA,EAAAC,EAAA,GAIAP,EAAA,SAAApxB,EAAAC,EAAA1K,GAMAd,KAAAuL,QAGAvL,KAAAwL,MAEAxL,KAAAc,SAGAq8B,GAA8Bz7B,OAAS4Q,cAAA,GAAqBhI,KAAOgI,cAAA,GAAqBpI,QAAUoI,cAAA,GAAqBuoB,YAAcvoB,cAAA,GAAqBwoB,UAAYxoB,cAAA,IAGtK6qB,EAAAz7B,MAAAmB,IAAA,WAAgD,OAAA7C,KAAAuL,MAAAtC,OAAAjJ,KAAAc,MAAA,IAEhDq8B,EAAA7yB,IAAAzH,IAAA,WAA8C,OAAA7C,KAAAwL,IAAA9B,MAAA1J,KAAAc,MAAA,IAG9Cq8B,EAAAjzB,OAAArH,IAAA,WAAiD,OAAA7C,KAAAuL,MAAAvE,KAAAhH,KAAAc,QAEjDq8B,EAAAtC,WAAAh4B,IAAA,WAAqD,OAAA7C,KAAAuL,MAAAtG,MAAAjF,KAAAc,QAErDq8B,EAAArC,SAAAj4B,IAAA,WAAmD,OAAA7C,KAAAwL,IAAAwE,WAAAhQ,KAAAc,QAEnDxE,OAAAmW,iBAAAkqB,EAAAp+B,UAAA4+B,GAEA,IAAAC,EAAA9gC,OAAAC,OAAA,MAcA8gC,EAAA,SAAAj+B,EAAA0G,EAAAsF,EAAAuO,GAGA3Z,KAAAZ,OAMAY,KAAA8F,QAIA9F,KAAAoL,WAAA6qB,EAAAxpB,MAKAzM,KAAA2Z,SAAA6e,EAAAW,MAGAmE,GAA4Bj4B,UAAYiN,cAAA,GAAqB5M,YAAc4M,cAAA,GAAqBugB,aAAevgB,cAAA,GAAqB1I,YAAc0I,cAAA,GAAqBvI,WAAauI,cAAA,GAAqBqkB,SAAWrkB,cAAA,GAAqBirB,aAAejrB,cAAA,GAAqBoqB,eAAiBpqB,cAAA,GAAqBgqB,UAAYhqB,cAAA,GAAqBmkB,QAAUnkB,cAAA,GAAqBokB,QAAUpkB,cAAA,GAAqBkrB,QAAUlrB,cAAA,IAW5ZgrB,EAAAj4B,SAAAxC,IAAA,WAAiD,OAAA7C,KAAA02B,OAAA,IAAA12B,KAAAoL,QAAAC,MAIjDiyB,EAAA53B,WAAA7C,IAAA,WAAmD,OAAA7C,KAAAoL,QAAA1F,YAKnD23B,EAAA9+B,UAAA6G,MAAA,SAAAH,GAA+C,OAAAjF,KAAAoL,QAAAhG,MAAAH,IAI/Co4B,EAAA9+B,UAAA24B,WAAA,SAAAjyB,GAAyD,OAAAjF,KAAAoL,QAAA8rB,WAAAjyB,IAKzDo4B,EAAA9+B,UAAA4S,QAAA,SAAAnE,GAA+ChN,KAAAoL,QAAA+F,QAAAnE,IAU/CqwB,EAAA9+B,UAAA23B,aAAA,SAAA/qB,EAAA2B,EAAAE,EAAAywB,QACA,IAAAA,MAAA,GAEAz9B,KAAAoL,QAAA8qB,aAAA/qB,EAAA2B,EAAAE,EAAAywB,EAAAz9B,OAMAq9B,EAAA9+B,UAAA63B,YAAA,SAAAppB,GACAhN,KAAAk2B,aAAA,EAAAl2B,KAAAoL,QAAAC,KAAA2B,IAMAswB,EAAAzK,YAAAhwB,IAAA,WAAoD,OAAA7C,KAAAq2B,YAAA,EAAAr2B,KAAAoL,QAAAC,KAAA,KAOpDgyB,EAAA9+B,UAAA83B,YAAA,SAAAlrB,EAAA2B,EAAAwpB,EAAAC,GACA,OAAAv2B,KAAAoL,QAAAirB,YAAAlrB,EAAA2B,EAAAwpB,EAAAC,IAMA+G,EAAA1zB,WAAA/G,IAAA,WAAmD,OAAA7C,KAAAoL,QAAAxB,YAKnD0zB,EAAAvzB,UAAAlH,IAAA,WAAkD,OAAA7C,KAAAoL,QAAArB,WAIlDszB,EAAA9+B,UAAAgR,GAAA,SAAA3B,GACA,OAAA5N,MAAA4N,GAAA5N,KAAA62B,WAAAjpB,IAAA5N,KAAAoL,QAAAmE,GAAA3B,EAAAxC,UAMAiyB,EAAA9+B,UAAAs4B,WAAA,SAAAjpB,GACA,OAAA5N,KAAA09B,UAAA9vB,EAAAxO,KAAAwO,EAAA9H,MAAA8H,EAAA+L,QAMA0jB,EAAA9+B,UAAAm/B,UAAA,SAAAt+B,EAAA0G,EAAA6T,GACA,OAAA3Z,KAAAZ,SACAk5B,EAAAt4B,KAAA8F,SAAA1G,EAAAu+B,cAAAP,IACA5E,EAAAS,QAAAj5B,KAAA2Z,SAAA6e,EAAAW,OAMAkE,EAAA9+B,UAAAlC,KAAA,SAAA+O,GAGA,YAFA,IAAAA,MAAA,MAEAA,GAAApL,KAAAoL,QAAgCpL,KAChC,IAAAA,KAAAoS,YAAApS,KAAAZ,KAAAY,KAAA8F,MAAAsF,EAAApL,KAAA2Z,QAMA0jB,EAAA9+B,UAAAq/B,KAAA,SAAAjkB,GACA,OAAAA,GAAA3Z,KAAA2Z,MAAA3Z,KAAA,IAAAA,KAAAoS,YAAApS,KAAAZ,KAAAY,KAAA8F,MAAA9F,KAAAoL,QAAAuO,IAOA0jB,EAAA9+B,UAAAw4B,IAAA,SAAA5rB,EAAA2B,GACA,UAAA3B,GAAA2B,GAAA9M,KAAAoL,QAAAC,KAA6CrL,KAC7CA,KAAA3D,KAAA2D,KAAAoL,QAAA2rB,IAAA5rB,EAAA2B,KAMAuwB,EAAA9+B,UAAAiJ,MAAA,SAAA2D,EAAA2B,EAAA+wB,GAIA,QAHA,IAAA/wB,MAAA9M,KAAAoL,QAAAC,WACA,IAAAwyB,OAAA,GAEA1yB,GAAA2B,EAAmB,OAAAssB,EAAA3sB,MAEnB,IAAAlB,EAAAvL,KAAAgJ,QAAAmC,GAAAK,EAAAxL,KAAAgJ,QAAA8D,GACAhM,EAAA+8B,EAAA,EAAAtyB,EAAAgxB,YAAAzvB,GACApL,EAAA6J,EAAA7J,MAAAZ,GACAsK,EADAG,EAAAvE,KAAAlG,GACAsK,QAAA2rB,IAAAxrB,EAAA5H,IAAAjC,EAAA8J,EAAA7H,IAAAjC,GACA,WAAA03B,EAAAhuB,EAAAG,EAAAzK,QAAA0K,EAAA1K,UAUAu8B,EAAA9+B,UAAAqO,QAAA,SAAAzB,EAAA2B,EAAAtF,GACA,OAAAoF,EAAA5M,KAAAgJ,QAAAmC,GAAAnL,KAAAgJ,QAAA8D,GAAAtF,IAKA61B,EAAA9+B,UAAA0I,OAAA,SAAAtD,GACA,QAAAqD,EAAAhH,OAAwB,CACxB,IAAAy5B,EAAAzyB,EAAAoE,QAAA4b,UAAArjB,GACAsB,EAAAw0B,EAAAx0B,MACA4hB,EAAA4S,EAAA5S,OAEA,KADA7f,IAAAkwB,WAAAjyB,IACgB,YAChB,GAAA4hB,GAAAljB,GAAAqD,EAAAyvB,OAAuC,OAAAzvB,EACvCrD,GAAAkjB,EAAA,IAQAwW,EAAA9+B,UAAAu/B,WAAA,SAAAn6B,GACA,IAAA81B,EAAAz5B,KAAAoL,QAAA4b,UAAArjB,GACAsB,EAAAw0B,EAAAx0B,MACA4hB,EAAA4S,EAAA5S,OACA,OAAU7f,KAAAhH,KAAAoL,QAAA8rB,WAAAjyB,WAAA4hB,WAOVwW,EAAA9+B,UAAAw/B,YAAA,SAAAp6B,GACA,MAAAA,EAAiB,OAASqD,KAAA,KAAA/B,MAAA,EAAA4hB,OAAA,GAC1B,IAAA4S,EAAAz5B,KAAAoL,QAAA4b,UAAArjB,GACAsB,EAAAw0B,EAAAx0B,MACA4hB,EAAA4S,EAAA5S,OACA,GAAAA,EAAAljB,EAAqB,OAASqD,KAAAhH,KAAAoL,QAAAhG,MAAAH,WAAA4hB,UAC9B,IAAA7f,EAAAhH,KAAAoL,QAAAhG,MAAAH,EAAA,GACA,OAAU+B,OAAA/B,QAAA,EAAA4hB,SAAA7f,EAAA3B,WAMVg4B,EAAA9+B,UAAAyK,QAAA,SAAArF,GAAiD,OAAAm4B,EAAAiB,cAAA/8B,KAAA2D,IAEjD05B,EAAA9+B,UAAAq7B,eAAA,SAAAj2B,GAA+D,OAAAm4B,EAAA9yB,QAAAhJ,KAAA2D,IAK/D05B,EAAA9+B,UAAAy/B,aAAA,SAAA7yB,EAAA2B,EAAA1N,GACA,IAAAm2B,GAAA,EAKA,OAJAzoB,EAAA3B,GAAkBnL,KAAAk2B,aAAA/qB,EAAA2B,EAAA,SAAA9F,GAElB,OADA5H,EAAA25B,QAAA/xB,EAAA2S,SAAmC4b,GAAA,IACnCA,IAEAA,GAKA+H,EAAA3G,QAAA9zB,IAAA,WAAgD,OAAA7C,KAAAZ,KAAAu3B,SAKhD2G,EAAAC,YAAA16B,IAAA,WAAoD,OAAA7C,KAAAZ,KAAAm+B,aAIpDD,EAAAZ,cAAA75B,IAAA,WAAsD,OAAA7C,KAAAZ,KAAAs9B,eAKtDY,EAAAhB,SAAAz5B,IAAA,WAAiD,OAAA7C,KAAAZ,KAAAk9B,UAIjDgB,EAAA7G,OAAA5zB,IAAA,WAA+C,OAAA7C,KAAAZ,KAAAq3B,QAI/C6G,EAAA5G,OAAA7zB,IAAA,WAA+C,OAAA7C,KAAAZ,KAAAs3B,QAQ/C4G,EAAAE,OAAA36B,IAAA,WAA+C,OAAA7C,KAAAZ,KAAAo+B,QAK/CH,EAAA9+B,UAAAC,SAAA,WACA,GAAAwB,KAAAZ,KAAAmG,KAAA04B,cAAqC,OAAAj+B,KAAAZ,KAAAmG,KAAA04B,cAAAj+B,MACrC,IAAAlF,EAAAkF,KAAAZ,KAAAtE,KAGA,OAFAkF,KAAAoL,QAAAC,OACKvQ,GAAA,IAAAkF,KAAAoL,QAAA4sB,gBAAA,KACLkG,EAAAl+B,KAAA2Z,MAAA7e,IAKAuiC,EAAA9+B,UAAA4/B,eAAA,SAAAl5B,GACA,IAAA+V,EAAAhb,KAAAZ,KAAAg/B,aAAAC,cAAAr+B,KAAAoL,QAAA,EAAAnG,GACA,IAAA+V,EAAe,UAAAzf,MAAA,wDACf,OAAAyf,GASAqiB,EAAA9+B,UAAA68B,WAAA,SAAAjwB,EAAA2B,EAAAwxB,EAAA58B,EAAA4I,QACA,IAAAg0B,MAAArI,EAAAxpB,YACA,IAAA/K,MAAA,QACA,IAAA4I,MAAAg0B,EAAA54B,YAEA,IAAA64B,EAAAv+B,KAAAm+B,eAAAhzB,GAAAkzB,cAAAC,EAAA58B,EAAA4I,GACAk0B,EAAAD,KAAAF,cAAAr+B,KAAAoL,QAAA0B,GACA,IAAA0xB,MAAAC,SAA8B,SAC9B,QAAAlkC,EAAAmH,EAAqBnH,EAAA+P,EAAS/P,IAAO,IAAAyF,KAAAZ,KAAAs/B,YAAAJ,EAAAl5B,MAAA7K,GAAAof,OAA0D,SAC/F,UAMA0jB,EAAA9+B,UAAAogC,eAAA,SAAAxzB,EAAA2B,EAAA1N,EAAAua,GACA,GAAAA,IAAA3Z,KAAAZ,KAAAs/B,YAAA/kB,GAA+C,SAC/C,IAAAjY,EAAA1B,KAAAm+B,eAAAhzB,GAAAyzB,UAAAx/B,GACAkL,EAAA5I,KAAA28B,cAAAr+B,KAAAoL,QAAA0B,GACA,QAAAxC,KAAAm0B,UAQApB,EAAA9+B,UAAAsgC,UAAA,SAAAjxB,GACA,OAAAA,EAAAxC,QAAAC,KAA2BrL,KAAAo7B,WAAAp7B,KAAA0F,WAAA1F,KAAA0F,WAAAkI,EAAAxC,SACnBpL,KAAAZ,KAAAs7B,kBAAA9sB,EAAAxO,OAMRi+B,EAAA9+B,UAAAugC,MAAA,WACA,IAAA9+B,KAAAZ,KAAA47B,aAAAh7B,KAAAoL,SACK,UAAAvH,WAAA,4BAAA7D,KAAAZ,KAAA,UAAAY,KAAAoL,QAAA5M,WAAAgJ,MAAA,OACLxH,KAAAoL,QAAA+F,QAAA,SAAAnK,GAAwC,OAAAA,EAAA83B,WAKxCzB,EAAA9+B,UAAA05B,OAAA,WACA,IAAAzZ,GAAapf,KAAAY,KAAAZ,KAAAtE,MACb,QAAAk+B,KAAAh5B,KAAA8F,MAAA,CACA0Y,EAAA1Y,MAAA9F,KAAA8F,MACA,MAMA,OAJA9F,KAAAoL,QAAAC,OACKmT,EAAApT,QAAApL,KAAAoL,QAAA6sB,UACLj4B,KAAA2Z,MAAAte,SACKmjB,EAAA7E,MAAA3Z,KAAA2Z,MAAAvd,IAAA,SAAAmK,GAA0C,OAAAA,EAAA0xB,YAC/CzZ,GAKA6e,EAAAnF,SAAA,SAAA1vB,EAAAuF,GACA,IAAAA,EAAc,UAAAlK,WAAA,mCACd,IAAA8V,EAAA,KACA,GAAA5L,EAAA4L,MAAA,CACA,IAAA8K,MAAAC,QAAA3W,EAAA4L,OAAqC,UAAA9V,WAAA,uCACrC8V,EAAA5L,EAAA4L,MAAAvd,IAAAoM,EAAAu2B,cAEA,WAAAhxB,EAAA3O,KAAA,CACA,oBAAA2O,EAAApY,KAAuC,UAAAkO,WAAA,6BACvC,OAAA2E,EAAA7S,KAAAoY,EAAApY,KAAAgkB,GAEA,IAAAvO,EAAA6qB,EAAAiC,SAAA1vB,EAAAuF,EAAA3C,SACA,OAAA5C,EAAA4jB,SAAAre,EAAA3O,MAAA7C,OAAAwR,EAAAjI,MAAAsF,EAAAuO,IAGArd,OAAAmW,iBAAA4qB,EAAA9+B,UAAA++B,GAEA,IAAA0B,EAAA,SAAA3B,GACA,SAAA2B,EAAA5/B,EAAA0G,EAAAsF,EAAAuO,GAGA,GAFA0jB,EAAA5+B,KAAAuB,KAAAZ,EAAA0G,EAAA,KAAA6T,IAEAvO,EAAmB,UAAAvH,WAAA,oCAEnB7D,KAAArK,KAAAyV,EAGAiyB,IAAA2B,EAAA7sB,UAAAkrB,GACA2B,EAAAzgC,UAAAjC,OAAAC,OAAA8gC,KAAA9+B,WACAygC,EAAAzgC,UAAA6T,YAAA4sB,EAEA,IAAAzF,GAA8B1G,aAAevgB,cAAA,GAAqBjN,UAAYiN,cAAA,IA0C9E,OAxCA0sB,EAAAzgC,UAAAC,SAAA,WACA,OAAAwB,KAAAZ,KAAAmG,KAAA04B,cAAuCj+B,KAAAZ,KAAAmG,KAAA04B,cAAAj+B,MACvCk+B,EAAAl+B,KAAA2Z,MAAAiH,KAAAC,UAAA7gB,KAAArK,QAGA4jC,EAAA1G,YAAAhwB,IAAA,WAAsD,OAAA7C,KAAArK,MAEtDqpC,EAAAzgC,UAAA83B,YAAA,SAAAlrB,EAAA2B,GAAoE,OAAA9M,KAAArK,KAAA6R,MAAA2D,EAAA2B,IAEpEysB,EAAAl0B,SAAAxC,IAAA,WAAmD,OAAA7C,KAAArK,KAAA0F,QAEnD2jC,EAAAzgC,UAAAq/B,KAAA,SAAAjkB,GACA,OAAAA,GAAA3Z,KAAA2Z,MAAA3Z,KAAA,IAAAg/B,EAAAh/B,KAAAZ,KAAAY,KAAA8F,MAAA9F,KAAArK,KAAAgkB,IAGAqlB,EAAAzgC,UAAAu4B,SAAA,SAAAnhC,GACA,OAAAA,GAAAqK,KAAArK,KAA4BqK,KAC5B,IAAAg/B,EAAAh/B,KAAAZ,KAAAY,KAAA8F,MAAAnQ,EAAAqK,KAAA2Z,QAGAqlB,EAAAzgC,UAAAw4B,IAAA,SAAA5rB,EAAA2B,GAIA,YAHA,IAAA3B,MAAA,QACA,IAAA2B,MAAA9M,KAAArK,KAAA0F,QAEA,GAAA8P,GAAA2B,GAAA9M,KAAArK,KAAA0F,OAA8C2E,KAC9CA,KAAA82B,SAAA92B,KAAArK,KAAA6R,MAAA2D,EAAA2B,KAGAkyB,EAAAzgC,UAAAgR,GAAA,SAAA3B,GACA,OAAA5N,KAAA62B,WAAAjpB,IAAA5N,KAAArK,MAAAiY,EAAAjY,MAGAqpC,EAAAzgC,UAAA05B,OAAA,WACA,IAAAniC,EAAAunC,EAAA9+B,UAAA05B,OAAAx5B,KAAAuB,MAEA,OADAlK,EAAAH,KAAAqK,KAAArK,KACAG,GAGAwG,OAAAmW,iBAAAusB,EAAAzgC,UAAAg7B,GAEAyF,EAvDA,CAwDC3B,GAED,SAAAa,EAAAvkB,EAAAkjB,GACA,QAAAtiC,EAAAof,EAAAte,OAAA,EAAgCd,GAAA,EAAQA,IACnCsiC,EAAAljB,EAAApf,GAAA6E,KAAAtE,KAAA,IAAA+hC,EAAA,IACL,OAAAA,EAOA,IAAAoC,EAAA,SAAAR,GAGAz+B,KAAAy+B,WACAz+B,KAAAO,QACAP,KAAAk/B,cAGAC,GAA4BzC,eAAiBpqB,cAAA,GAAqB8sB,aAAe9sB,cAAA,GAAqB+sB,WAAa/sB,cAAA,IAEnH2sB,EAAA//B,MAAA,SAAAogC,EAAAC,GACA,IAAAxT,EAAA,IAAAyT,EAAAF,EAAAC,GACA,SAAAxT,EAAAxrB,KAA4B,OAAA0+B,EAAAxyB,MAC5B,IAAAgzB,EAAAC,EAAA3T,GACAA,EAAAxrB,MAAoBwrB,EAAA/sB,IAAA,4BACpB,IAAAgc,EAuVA,SAAA2kB,GACA,IAAAC,EAAAtjC,OAAAC,OAAA,MACA,OAEA,SAAAsjC,EAAAC,GACA,IAAA7gC,KACA6gC,EAAA3uB,QAAA,SAAAnK,GACA24B,EAAA34B,GAAAmK,QAAA,SAAAsoB,GACA,IAAAjQ,EAAAiQ,EAAAjQ,KACA1c,EAAA2sB,EAAA3sB,GAEA,GAAA0c,EAAA,CACA,IAAAuW,EAAA9gC,EAAA+gC,QAAAxW,GAAAzmB,EAAAg9B,GAAA,GAAA9gC,EAAA8gC,EAAA,GACAE,EAAAN,EAAA7yB,GAAAqE,QAAA,SAAAnK,GACAjE,GAAqB9D,EAAAgD,KAAAunB,EAAAzmB,OACrB,GAAAA,EAAAi9B,QAAAh5B,IAAwCjE,EAAAd,KAAA+E,UAIxC,IAAA/J,EAAA2iC,EAAAE,EAAA13B,KAAA,UAAA62B,EAAAa,EAAAE,QAAAL,EAAAtkC,OAAA,OACA,QAAAd,EAAA,EAAmBA,EAAA0E,EAAA5D,OAAgBd,GAAA,GACnC,IAAA2lC,EAAAjhC,EAAA1E,EAAA,GAAAq3B,KAAAuO,GACAljC,EAAAsD,KAAA0B,KAAAhD,EAAA1E,GAAAqlC,EAAAM,EAAA93B,KAAA,OAAAy3B,EAAAK,IAEA,OAAAjjC,EAtBA4iC,CAAAI,EAAAN,EAAA,IAzVAS,CAkQA,SAAAX,GACA,IAAAE,OAEA,OADAU,EAWA,SAAA7Y,EAAAiY,EAAAt0B,GACA,aAAAs0B,EAAArgC,KACA,OAAAqgC,EAAAa,MAAAnmB,OAAA,SAAAlb,EAAAwgC,GAAqD,OAAAxgC,EAAAuT,OAAAgV,EAAAiY,EAAAt0B,SAChD,UAAAs0B,EAAArgC,KACL,QAAA7E,EAAA,GAAsBA,IAAA,CACtB,IAAAgG,EAAAinB,EAAAiY,EAAAa,MAAA/lC,GAAA4Q,GACA,GAAA5Q,GAAAklC,EAAAa,MAAAjlC,OAAA,EAAyC,OAAAkF,EACzC8/B,EAAA9/B,EAAA4K,EAAAnE,SAEK,YAAAy4B,EAAArgC,KAAA,CACL,IAAAmhC,EAAAv5B,IAGA,OAFAw5B,EAAAr1B,EAAAo1B,GACAF,EAAA7Y,EAAAiY,OAAAc,OACAC,EAAAD,IACK,WAAAd,EAAArgC,KAAA,CACL,IAAAqhC,EAAAz5B,IAGA,OAFAq5B,EAAA7Y,EAAAiY,OAAAt0B,GAAAs1B,GACAJ,EAAA7Y,EAAAiY,OAAAgB,OACAD,EAAAC,IACK,UAAAhB,EAAArgC,KACL,OAAAohC,EAAAr1B,IAAAqH,OAAAgV,EAAAiY,OAAAt0B,IACK,YAAAs0B,EAAArgC,KAAA,CAEL,IADA,IAAAshC,EAAAv1B,EACAw1B,EAAA,EAAuBA,EAAAlB,EAAA76B,IAAgB+7B,IAAA,CACvC,IAAAC,EAAA55B,IACAq5B,EAAA7Y,EAAAiY,OAAAiB,GAAAE,GACAF,EAAAE,EAEA,OAAAnB,EAAA56B,IACAw7B,EAAA7Y,EAAAiY,OAAAiB,WAEA,QAAAG,EAAApB,EAAA76B,IAAgCi8B,EAAApB,EAAA56B,IAAgBg8B,IAAA,CAChD,IAAAC,EAAA95B,IACAw5B,EAAAE,EAAAI,GACAT,EAAA7Y,EAAAiY,OAAAiB,GAAAI,GACAJ,EAAAI,EAGA,OAAAN,EAAAE,IACK,WAAAjB,EAAArgC,KACL,OAAAohC,EAAAr1B,EAAA,KAAAs0B,EAAA38B,SAnDA0kB,CAAAiY,EAAA,GAAAz4B,KACA24B,EAEA,SAAA34B,IAAmB,OAAA24B,EAAA19B,SAAA,EACnB,SAAAu+B,EAAAr1B,EAAA2B,EAAA0c,GACA,IAAAgX,GAAgBhX,OAAA1c,MAEhB,OADA6yB,EAAAx0B,GAAAlJ,KAAAu+B,GACAA,EAEA,SAAAH,EAAAU,EAAAj0B,GAA+Bi0B,EAAA5vB,QAAA,SAAAqvB,GAAgC,OAAAA,EAAA1zB,QA7Q/D6yB,CAAAF,IAEA,OAiXA,SAAAzkB,EAAA+Q,GACA,QAAAxxB,EAAA,EAAAymC,GAAAhmB,GAAiCzgB,EAAAymC,EAAA3lC,OAAiBd,IAAA,CAElD,IADA,IAAA0C,EAAA+jC,EAAAzmC,GAAA0mC,GAAAhkC,EAAAwhC,SAAA/1B,KACAzH,EAAA,EAAmBA,EAAAhE,EAAAsD,KAAAlF,OAAuB4F,GAAA,GAC1C,IAAA+F,EAAA/J,EAAAsD,KAAAU,GAAAV,EAAAtD,EAAAsD,KAAAU,EAAA,GACAyH,EAAAzG,KAAA+E,EAAAlM,OACAmmC,GAAAj6B,EAAAyvB,QAAAzvB,EAAAk6B,qBAA8DD,GAAA,IAC9D,GAAAD,EAAAhB,QAAAz/B,IAAqCygC,EAAA/+B,KAAA1B,GAErC0gC,GAAelV,EAAA/sB,IAAA,+BAAA0J,EAAAN,KAAA,mCA3Xf+4B,CAAAnmB,EAAA+Q,GACA/Q,GAMAikB,EAAA1gC,UAAAqgC,UAAA,SAAAx/B,GACA,QAAA7E,EAAA,EAAiBA,EAAAyF,KAAAO,KAAAlF,OAAsBd,GAAA,EAClC,GAAAyF,KAAAO,KAAAhG,IAAA6E,EAA4B,OAAAY,KAAAO,KAAAhG,EAAA,GACjC,aAMA0kC,EAAA1gC,UAAA8/B,cAAA,SAAA+C,EAAA1/B,EAAA4I,QACA,IAAA5I,MAAA,QACA,IAAA4I,MAAA82B,EAAA17B,YAGA,IADA,IAAAg7B,EAAA1gC,KACAzF,EAAAmH,EAAqBg/B,GAAAnmC,EAAA+P,EAAgB/P,IAChCmmC,IAAA9B,UAAAwC,EAAAh8B,MAAA7K,GAAA6E,MACL,OAAAshC,GAGAvB,EAAAzC,cAAA75B,IAAA,WACA,IAAA+zB,EAAA52B,KAAAO,KAAA,GACA,QAAAq2B,KAAA0F,UAMA6C,EAAAC,YAAAv8B,IAAA,WACA,QAAAtI,EAAA,EAAiBA,EAAAyF,KAAAO,KAAAlF,OAAsBd,GAAA,GACvC,IAAA6E,EAAAY,KAAAO,KAAAhG,GACA,IAAA6E,EAAAq3B,SAAAr3B,EAAA8hC,mBAAoD,OAAA9hC,IAIpD6/B,EAAA1gC,UAAA8iC,WAAA,SAAAzzB,GACA,QAAArT,EAAA,EAAiBA,EAAAyF,KAAAO,KAAAlF,OAAsBd,GAAA,EAClC,QAAA0G,EAAA,EAAgBA,EAAA2M,EAAArN,KAAAlF,OAAuB4F,GAAA,EACrC,GAAAjB,KAAAO,KAAAhG,IAAAqT,EAAArN,KAAAU,GAAqC,SAC5C,UAUAg+B,EAAA1gC,UAAA+iC,WAAA,SAAA53B,EAAA63B,EAAA1G,QACA,IAAA0G,OAAA,QACA,IAAA1G,MAAA,GAEA,IAAA91B,GAAA/E,MAgBA,OAfA,SAAAwhC,EAAAxmB,EAAAzK,GACA,IAAAkxB,EAAAzmB,EAAAqjB,cAAA30B,EAAAmxB,GACA,GAAA4G,KAAAF,GAAAE,EAAAhD,UACO,OAAAxI,EAAA9qB,KAAAoF,EAAAnU,IAAA,SAAAslC,GAA+C,OAAAA,EAAAr1B,mBAEtD,QAAA9R,EAAA,EAAmBA,EAAAygB,EAAAza,KAAAlF,OAAuBd,GAAA,GAC1C,IAAA6E,EAAA4b,EAAAza,KAAAhG,GAAAgG,EAAAya,EAAAza,KAAAhG,EAAA,GACA,IAAA6E,EAAAq3B,SAAAr3B,EAAA8hC,qBAAA,GAAAn8B,EAAAi7B,QAAAz/B,GAAA,CACAwE,EAAA9C,KAAA1B,GACA,IAAAg1B,EAAAiM,EAAAjhC,EAAAgQ,EAAAiC,OAAApT,IACA,GAAAm2B,EAAoB,OAAAA,IAKpBiM,CAAAxhC,UAQAi/B,EAAA1gC,UAAAojC,aAAA,SAAA1lB,GACA,QAAA1hB,EAAA,EAAiBA,EAAAyF,KAAAk/B,UAAA7jC,OAA2Bd,GAAA,EACvC,GAAAyF,KAAAk/B,UAAA3kC,IAAA0hB,EAAmC,OAAAjc,KAAAk/B,UAAA3kC,EAAA,GACxC,IAAAyvB,EAAAhqB,KAAA4hC,gBAAA3lB,GAEA,OADAjc,KAAAk/B,UAAAj9B,KAAAga,EAAA+N,GACAA,GAGAiV,EAAA1gC,UAAAqjC,gBAAA,SAAA3lB,GAEA,IADA,IAAAlX,EAAAzI,OAAAC,OAAA,MAAAslC,IAA6C7mB,MAAAhb,KAAAZ,KAAA,KAAA0iC,IAAA,OAC7CD,EAAAxmC,QAAA,CACA,IAAAs1B,EAAAkR,EAAA1oC,QAAA6hB,EAAA2V,EAAA3V,MACA,GAAAA,EAAA4jB,UAAA3iB,GAAA,CAEA,IADA,IAAA7gB,KACAojB,EAAAmS,EAA6BnS,EAAApf,KAAUof,IAAAsjB,IAC9B1mC,EAAA6G,KAAAuc,EAAApf,MACT,OAAAhE,EAAAkF,UAEA,QAAA/F,EAAA,EAAmBA,EAAAygB,EAAAza,KAAAlF,OAAuBd,GAAA,GAC1C,IAAA6E,EAAA4b,EAAAza,KAAAhG,GACA6E,EAAAs3B,QAAAt3B,EAAA8hC,oBAAA9hC,EAAAtE,QAAAiK,GAAA4rB,EAAAvxB,OAAA4b,EAAAza,KAAAhG,EAAA,GAAAkkC,WACAoD,EAAA5/B,MAAqB+Y,MAAA5b,EAAAg/B,aAAAh/B,OAAA0iC,IAAAnR,IACrB5rB,EAAA3F,EAAAtE,OAAA,MASAqkC,EAAAE,UAAAx8B,IAAA,WACA,OAAA7C,KAAAO,KAAAlF,QAAA,GAMA4jC,EAAA1gC,UAAAiiC,KAAA,SAAAj6B,GACA,IAAAhM,EAAAgM,GAAA,EACA,GAAAhM,GAAAyF,KAAAO,KAAAlF,OAA8B,UAAAwI,WAAA,cAAA0C,EAAA,iCAC9B,OAAUnH,KAAAY,KAAAO,KAAAhG,GAAAgG,KAAAP,KAAAO,KAAAhG,EAAA,KAGV0kC,EAAA1gC,UAAAC,SAAA,WACA,IAAAuG,KAOA,OANA,SAAAg9B,EAAAje,GACA/e,EAAA9C,KAAA6hB,GACA,QAAAvpB,EAAA,EAAmBA,EAAAupB,EAAAvjB,KAAAlF,OAAmBd,GAAA,GAC/B,GAAAwK,EAAAi7B,QAAAlc,EAAAvjB,KAAAhG,KAAqCwnC,EAAAje,EAAAvjB,KAAAhG,IAE5CwnC,CAAA/hC,MACA+E,EAAA3I,IAAA,SAAA0nB,EAAAvpB,GAEA,IADA,IAAA0E,EAAA1E,GAAAupB,EAAA2a,SAAA,aACAkC,EAAA,EAAqBA,EAAA7c,EAAAvjB,KAAAlF,OAAqBslC,GAAA,EACnC1hC,IAAA0hC,EAAA,SAAA7c,EAAAvjB,KAAAogC,GAAA7lC,KAAA,KAAAiK,EAAAi7B,QAAAlc,EAAAvjB,KAAAogC,EAAA,IACP,OAAA1hC,IACGmJ,KAAA,OAGH9L,OAAAmW,iBAAAwsB,EAAA1gC,UAAA4gC,GAEAF,EAAAxyB,MAAA,IAAAwyB,GAAA,GAEA,IAAAO,EAAA,SAAAF,EAAAC,GACAv/B,KAAAs/B,SACAt/B,KAAAu/B,YACAv/B,KAAAG,OAAA,KACAH,KAAA2D,IAAA,EACA3D,KAAArB,OAAA2gC,EAAAnkC,MAAA,kBACA,IAAA6E,KAAArB,OAAAqB,KAAArB,OAAAtD,OAAA,IAAkD2E,KAAArB,OAAA8B,MAClD,IAAAT,KAAArB,OAAA,IAA6BqB,KAAArB,OAAA0I,WAG7B26B,GAA8BzhC,MAAQ+R,cAAA,IAUtC,SAAAotB,EAAA3T,GACA,IAAAuU,KACA,GAAMA,EAAAr+B,KAAAggC,EAAAlW,UACNA,EAAAmW,IAAA,MACA,UAAA5B,EAAAjlC,OAAAilC,EAAA,IAAyClhC,KAAA,SAAAkhC,SAGzC,SAAA2B,EAAAlW,GACA,IAAAuU,KACA,GAAMA,EAAAr+B,KAAAkgC,EAAApW,UACNA,EAAAxrB,MAAA,KAAAwrB,EAAAxrB,MAAA,KAAAwrB,EAAAxrB,MACA,UAAA+/B,EAAAjlC,OAAAilC,EAAA,IAAyClhC,KAAA,MAAAkhC,SAGzC,SAAA6B,EAAApW,GAEA,IADA,IAAA0T,EA4CA,SAAA1T,GACA,GAAAA,EAAAmW,IAAA,MACA,IAAAzC,EAAAC,EAAA3T,GAEA,OADAA,EAAAmW,IAAA,MAA2BnW,EAAA/sB,IAAA,yBAC3BygC,EACG,SAAAtlC,KAAA4xB,EAAAxrB,MAAA,CACH,IAAA+/B,EAlBA,SAAAvU,EAAAjxB,GACA,IAAAyV,EAAAwb,EAAAwT,UAAAngC,EAAAmR,EAAAzV,GACA,GAAAsE,EAAa,OAAAA,GACb,IAAAhE,KACA,QAAAgnC,KAAA7xB,EAAA,CACA,IAAA8xB,EAAA9xB,EAAA6xB,GACAC,EAAAC,OAAAtC,QAAAllC,IAAA,GAA2CM,EAAA6G,KAAAogC,GAE3C,GAAAjnC,EAAAC,QAA2B0wB,EAAA/sB,IAAA,0BAAAlE,EAAA,WAC3B,OAAAM,EASAmnC,CAAAxW,IAAAxrB,MAAAnE,IAAA,SAAAgD,GAGA,OAFA,MAAA2sB,EAAA5rB,OAAkC4rB,EAAA5rB,OAAAf,EAAAk9B,SAClCvQ,EAAA5rB,QAAAf,EAAAk9B,UAAgDvQ,EAAA/sB,IAAA,oCAClCI,KAAA,OAAA0D,MAAA1D,KAGd,OADA2sB,EAAApoB,MACA,GAAA28B,EAAAjlC,OAAAilC,EAAA,IAA2ClhC,KAAA,SAAAkhC,SAE3CvU,EAAA/sB,IAAA,qBAAA+sB,EAAAxrB,KAAA,KA1DAiiC,CAAAzW,KAEA,GAAAA,EAAAmW,IAAA,KACOzC,GAASrgC,KAAA,OAAAqgC,aAChB,GAAA1T,EAAAmW,IAAA,KACOzC,GAASrgC,KAAA,OAAAqgC,aAChB,GAAA1T,EAAAmW,IAAA,KACOzC,GAASrgC,KAAA,MAAAqgC,YAChB,KAAA1T,EAAAmW,IAAA,KAEU,MADHzC,EAAAgD,EAAA1W,EAAA0T,GAGP,OAAAA,EAGA,SAAAiD,EAAA3W,GACA,KAAA5xB,KAAA4xB,EAAAxrB,OAA+BwrB,EAAA/sB,IAAA,yBAAA+sB,EAAAxrB,KAAA,KAC/B,IAAAnF,EAAA4M,OAAA+jB,EAAAxrB,MAEA,OADAwrB,EAAApoB,MACAvI,EAGA,SAAAqnC,EAAA1W,EAAA0T,GACA,IAAA76B,EAAA89B,EAAA3W,GAAAlnB,EAAAD,EAMA,OALAmnB,EAAAmW,IAAA,OAC6Br9B,EAA7B,KAAAknB,EAAAxrB,KAA6BmiC,EAAA3W,IACnB,GAEVA,EAAAmW,IAAA,MAAyBnW,EAAA/sB,IAAA,0BACfI,KAAA,QAAAwF,MAAAC,MAAA46B,QAwGV,SAAAU,EAAAl8B,EAAAC,GAAoB,OAAAA,EAAAD,EAKpB,SAAAg8B,EAAAN,EAAA34B,GACA,IAAA5L,KAEA,OAEA,SAAA2mC,EAAA/6B,GACA,IAAA+5B,EAAApB,EAAA34B,GACA,MAAA+5B,EAAA1lC,SAAA0lC,EAAA,GAAAvX,KAA8C,OAAAuY,EAAAhB,EAAA,GAAAj0B,IAC9C1R,EAAA6G,KAAA+E,GACA,QAAAzM,EAAA,EAAmBA,EAAAwmC,EAAA1lC,OAAkBd,IAAA,CACrC,IAAAk/B,EAAAsH,EAAAxmC,GACAivB,EAAAiQ,EAAAjQ,KACA1c,EAAA2sB,EAAA3sB,GACA0c,IAAA,GAAApuB,EAAA4kC,QAAAlzB,IAA8Ci1B,EAAAj1B,IAX9Ci1B,CAAA/6B,GACA5L,EAAAw2B,KAAAuO,GAgEA,SAAAxC,EAAA73B,GACA,IAAA5H,EAAA5B,OAAAC,OAAA,MACA,QAAAomC,KAAA78B,EAAA,CACA,IAAA6lB,EAAA7lB,EAAA68B,GACA,IAAAhX,EAAAiX,WAA2B,YAC3B1kC,EAAAykC,GAAAhX,EAAAzR,QAEA,OAAAhc,EAGA,SAAA2kC,EAAA/8B,EAAAhD,GACA,IAAAggC,EAAAxmC,OAAAC,OAAA,MACA,QAAAzB,KAAAgL,EAAA,CACA,IAAAi9B,EAAAjgC,KAAAhI,GACA,QAAA+Y,IAAAkvB,EAAA,CACA,IAAApX,EAAA7lB,EAAAhL,GACA,IAAA6wB,EAAAiX,WACY,UAAA/+B,WAAA,mCAAA/I,GADgBioC,EAAApX,EAAAzR,QAG5B4oB,EAAAhoC,GAAAioC,EAEA,OAAAD,EAGA,SAAAE,EAAAl9B,GACA,IAAA1K,EAAAkB,OAAAC,OAAA,MACA,GAAAuJ,EAAc,QAAAhL,KAAAgL,EAA0B1K,EAAAN,GAAA,IAAAmoC,EAAAn9B,EAAAhL,IACxC,OAAAM,EA/PA4mC,EAAAzhC,KAAAsC,IAAA,WAA+C,OAAA7C,KAAArB,OAAAqB,KAAA2D,MAE/C67B,EAAAjhC,UAAA2jC,IAAA,SAAA1hC,GAAgD,OAAAR,KAAAO,MAAAC,IAAAR,KAAA2D,QAAA,IAEhD67B,EAAAjhC,UAAAS,IAAA,SAAA69B,GAAgD,UAAA1e,YAAA0e,EAAA,4BAAA78B,KAAAs/B,OAAA,OAEhDhjC,OAAAmW,iBAAA+sB,EAAAjhC,UAAAyjC,GAgQA,IAAAkB,EAAA,SAAApoC,EAAA0N,EAAAjD,GAGAvF,KAAAlF,OAIAkF,KAAAwI,SAIAxI,KAAAuF,OAEAvF,KAAAsiC,OAAA/8B,EAAAwT,MAAAxT,EAAAwT,MAAA5d,MAAA,QACA6E,KAAA8F,MAAAk9B,EAAAz9B,EAAAO,OAEA9F,KAAA29B,eAAA39B,KAAA8F,OAIA9F,KAAAo+B,aAAA,KAKAp+B,KAAAmjC,QAAA,KAIAnjC,KAAA08B,cAAA,KAIA18B,KAAA22B,UAAApxB,EAAApF,QAAA,QAAArF,GAIAkF,KAAAy2B,OAAA,QAAA37B,GAGAsoC,GAA4B9G,UAAYhqB,cAAA,GAAqBirB,aAAejrB,cAAA,GAAqBokB,QAAUpkB,cAAA,GAAqBkrB,QAAUlrB,cAAA,IAI1I8wB,EAAA9G,SAAAz5B,IAAA,WAAiD,OAAA7C,KAAA22B,SAKjDyM,EAAA7F,YAAA16B,IAAA,WAAoD,OAAA7C,KAAA22B,SAAA32B,KAAA08B,eAIpD0G,EAAA1M,OAAA7zB,IAAA,WAA+C,OAAA7C,KAAAo+B,cAAAa,EAAAxyB,OAK/C22B,EAAA5F,OAAA36B,IAAA,WAA+C,OAAA7C,KAAA02B,QAAA12B,KAAAuF,KAAA89B,MAI/CH,EAAA3kC,UAAA2iC,iBAAA,WACA,QAAA36B,KAAAvG,KAAA8F,MAA6B,GAAA9F,KAAA8F,MAAAS,GAAA+8B,WAAgC,SAC7D,UAGAJ,EAAA3kC,UAAAm8B,kBAAA,SAAA9sB,GACA,OAAA5N,MAAA4N,GAAA5N,KAAAo+B,aAAAiD,WAAAzzB,EAAAwwB,eAGA8E,EAAA3kC,UAAAskC,aAAA,SAAA/8B,GACA,OAAAA,GAAA9F,KAAA29B,aAAoC39B,KAAA29B,aAC5BkF,EAAA7iC,KAAA8F,UAURo9B,EAAA3kC,UAAAhC,OAAA,SAAAuJ,EAAAsF,EAAAuO,GACA,GAAA3Z,KAAAy2B,OAAoB,UAAAl7B,MAAA,8CACpB,WAAA8hC,EAAAr9B,UAAA6iC,aAAA/8B,GAAAmwB,EAAA9qB,KAAAC,GAAAotB,EAAAU,QAAAvf,KAOAupB,EAAA3kC,UAAAglC,cAAA,SAAAz9B,EAAAsF,EAAAuO,GAEA,GADAvO,EAAA6qB,EAAA9qB,KAAAC,IACApL,KAAAg7B,aAAA5vB,GACK,UAAAvH,WAAA,4BAAA7D,KAAAlF,MACL,WAAAuiC,EAAAr9B,UAAA6iC,aAAA/8B,GAAAsF,EAAAotB,EAAAU,QAAAvf,KAUAupB,EAAA3kC,UAAA8N,cAAA,SAAAvG,EAAAsF,EAAAuO,GAGA,GAFA7T,EAAA9F,KAAA6iC,aAAA/8B,IACAsF,EAAA6qB,EAAA9qB,KAAAC,IACAC,KAAA,CACA,IAAApC,EAAAjJ,KAAAo+B,aAAAkD,WAAAl2B,GACA,IAAAnC,EAAkB,YAClBmC,EAAAnC,EAAAqI,OAAAlG,GAEA,IAAA1B,EAAA1J,KAAAo+B,aAAAC,cAAAjzB,GAAAk2B,WAAArL,EAAAxpB,OAAA,GACA,OAAA/C,EACA,IAAA2zB,EAAAr9B,KAAA8F,EAAAsF,EAAAkG,OAAA5H,GAAA8uB,EAAAU,QAAAvf,IADe,MAOfupB,EAAA3kC,UAAAy8B,aAAA,SAAA5vB,GACA,IAAAhQ,EAAA4E,KAAAo+B,aAAAC,cAAAjzB,GACA,IAAAhQ,MAAAqjC,SAAoC,SACpC,QAAAlkC,EAAA,EAAiBA,EAAA6Q,EAAA1F,WAAwBnL,IACpC,IAAAyF,KAAA0+B,YAAAtzB,EAAAhG,MAAA7K,GAAAof,OAAiD,SACtD,UAKAupB,EAAA3kC,UAAAilC,eAAA,SAAAC,GACA,aAAAzjC,KAAAmjC,SAAAnjC,KAAAmjC,QAAAnD,QAAAyD,IAAA,GAKAP,EAAA3kC,UAAAmgC,YAAA,SAAA/kB,GACA,SAAA3Z,KAAAmjC,QAA6B,SAC7B,QAAA5oC,EAAA,EAAiBA,EAAAof,EAAAte,OAAkBd,IAAO,IAAAyF,KAAAwjC,eAAA7pB,EAAApf,GAAA6E,MAA2C,SACrF,UAKA8jC,EAAA3kC,UAAAmlC,aAAA,SAAA/pB,GACA,SAAA3Z,KAAAmjC,QAA6B,OAAAxpB,EAE7B,IADA,IAAAtd,EACA9B,EAAA,EAAiBA,EAAAof,EAAAte,OAAkBd,IACnCyF,KAAAwjC,eAAA7pB,EAAApf,GAAA6E,MAEK/C,GACLA,EAAA4F,KAAA0X,EAAApf,IAFA8B,IAAkBA,EAAAsd,EAAAnS,MAAA,EAAAjN,IAKlB,OAAA8B,IAAAhB,OAAAgB,EAAAm8B,EAAA/rB,MAAAkN,GAGAupB,EAAA1b,QAAA,SAAA9e,EAAAF,GACA,IAAApN,EAAAkB,OAAAC,OAAA,MACAmM,EAAAyI,QAAA,SAAArW,EAAAyK,GAAuC,OAAAnK,EAAAN,GAAA,IAAAooC,EAAApoC,EAAA0N,EAAAjD,KAEvC,IAAAo+B,EAAAn7B,EAAAjD,KAAAq+B,SAAA,MACA,IAAAxoC,EAAAuoC,GAAyB,UAAA9/B,WAAA,yCAAA8/B,EAAA,MACzB,IAAAvoC,EAAAzF,KAAqB,UAAAkO,WAAA,oCACrB,QAAAm1B,KAAA59B,EAAAzF,KAAAmQ,MAAoC,UAAAjC,WAAA,iDAEpC,OAAAzI,GAGAkB,OAAAmW,iBAAAywB,EAAA3kC,UAAA6kC,GAIA,IAAAH,EAAA,SAAAxjC,GACAO,KAAA4iC,WAAAtmC,OAAAiC,UAAA5D,eAAA8D,KAAAgB,EAAA,WACAO,KAAAka,QAAAza,EAAAya,SAGA2pB,GAA8BP,YAAchxB,cAAA,IAE5CuxB,EAAAP,WAAAzgC,IAAA,WACA,OAAA7C,KAAA4iC,YAGAtmC,OAAAmW,iBAAAwwB,EAAA1kC,UAAAslC,GAQA,IAAAC,EAAA,SAAAhpC,EAAA+9B,EAAArwB,EAAAjD,GAGAvF,KAAAlF,OAIAkF,KAAAwI,SAIAxI,KAAAuF,OAEAvF,KAAA8F,MAAAk9B,EAAAz9B,EAAAO,OAEA9F,KAAA64B,OACA74B,KAAA+jC,SAAA,KACA,IAAA7lC,EAAAy/B,EAAA39B,KAAA8F,OACA9F,KAAAgkC,SAAA9lC,GAAA,IAAAs6B,EAAAx4B,KAAA9B,IAOA4lC,EAAAvlC,UAAAhC,OAAA,SAAAuJ,GACA,OAAAA,GAAA9F,KAAAgkC,SAAgChkC,KAAAgkC,SAChC,IAAAxL,EAAAx4B,KAAA6iC,EAAA7iC,KAAA8F,WAGAg+B,EAAAtc,QAAA,SAAA7N,EAAAnR,GACA,IAAApN,EAAAkB,OAAAC,OAAA,MAAAs8B,EAAA,EAEA,OADAlf,EAAAxI,QAAA,SAAArW,EAAAyK,GAAuC,OAAAnK,EAAAN,GAAA,IAAAgpC,EAAAhpC,EAAA+9B,IAAArwB,EAAAjD,KACvCnK,GAMA0oC,EAAAvlC,UAAAu6B,cAAA,SAAA/1B,GACA,QAAAxI,EAAA,EAAiBA,EAAAwI,EAAA1H,OAAgBd,IAC5B,GAAAwI,EAAAxI,GAAA6E,MAAAY,KACE,OAAA+C,EAAAyE,MAAA,EAAAjN,GAAAiY,OAAAzP,EAAAyE,MAAAjN,EAAA,IACP,OAAAwI,GAKA+gC,EAAAvlC,UAAAw6B,QAAA,SAAAh2B,GACA,QAAAxI,EAAA,EAAiBA,EAAAwI,EAAA1H,OAAgBd,IAC5B,GAAAwI,EAAAxI,GAAA6E,MAAAY,KAA2B,OAAA+C,EAAAxI,IAMhCupC,EAAAvlC,UAAAq6B,SAAA,SAAAhrB,GACA,OAAA5N,KAAA+jC,SAAA/D,QAAApyB,IAAA,GAwKA,IAAIq2B,EAAM,SAAA1+B,GAQV,QAAA/I,KADAwD,KAAAuF,QACAA,EAA0BvF,KAAAuF,KAAA/I,GAAA+I,EAAA/I,GAC1BwD,KAAAuF,KAAAmD,MAAoB4D,EAAUnB,KAAA5F,EAAAmD,OAC9B1I,KAAAuF,KAAAoU,MAAoBrN,EAAUnB,KAAA5F,EAAAoU,OAI9B3Z,KAAA0I,MAAAw6B,EAAA1b,QAAAxnB,KAAAuF,KAAAmD,MAAA1I,MAIAA,KAAA2Z,MAAAmqB,EAAAtc,QAAAxnB,KAAAuF,KAAAoU,MAAA3Z,MAEA,IAAAkkC,EAAA5nC,OAAAC,OAAA,MACA,QAAA4nC,KAAAnkC,KAAA0I,MAAA,CACA,GAAAy7B,KAAAnkC,KAAA2Z,MACO,UAAA9V,WAAAsgC,EAAA,sCACP,IAAA/kC,EAAAY,KAAA0I,MAAAy7B,GAAAC,EAAAhlC,EAAAmG,KAAA6F,SAAA,GAAAi5B,EAAAjlC,EAAAmG,KAAAoU,MACAva,EAAAg/B,aAAA8F,EAAAE,KACAF,EAAAE,GAAAnF,EAAA//B,MAAAklC,EAAApkC,KAAA0I,QACAtJ,EAAAs9B,cAAAt9B,EAAAg/B,aAAA1B,cACAt9B,EAAA+jC,QAAA,KAAAkB,EAAA,KACAA,EAAAC,EAAAtkC,KAAAqkC,EAAAlpC,MAAA,MACA,IAAAkpC,GAAAjlC,EAAAs9B,cAAA,QAEA,QAAA6H,KAAAvkC,KAAA2Z,MAAA,CACA,IAAA0oB,EAAAriC,KAAA2Z,MAAA4qB,GAAAC,EAAAnC,EAAA98B,KAAAqzB,SACAyJ,EAAA0B,SAAA,MAAAS,GAAAnC,GAAA,IAAAmC,KAAAF,EAAAtkC,KAAAwkC,EAAArpC,MAAA,MAGA6E,KAAAm4B,aAAAn4B,KAAAm4B,aAAA3D,KAAAx0B,MACAA,KAAA++B,aAAA/+B,KAAA++B,aAAAvK,KAAAx0B,MAKAA,KAAAykC,YAAAzkC,KAAA0I,MAAA1I,KAAAuF,KAAAq+B,SAAA,OAMA5jC,KAAAyI,OAAAnM,OAAAC,OAAA,MACAyD,KAAAyI,OAAAi8B,UAAApoC,OAAAC,OAAA,OAsDA,SAAA+nC,EAAA97B,EAAAmR,GAEA,IADA,IAAA4b,KACAh7B,EAAA,EAAiBA,EAAAof,EAAAte,OAAkBd,IAAA,CACnC,IAAAO,EAAA6e,EAAApf,GAAAqjC,EAAAp1B,EAAAmR,MAAA7e,GAAA6pC,EAAA/G,EACA,GAAAA,EACArI,EAAAtzB,KAAA27B,QAEA,QAAAphC,KAAAgM,EAAAmR,MAAA,CACA,IAAAirB,EAAAp8B,EAAAmR,MAAAnd,IACA,KAAA1B,GAAA8pC,EAAAr/B,KAAAwT,OAAA6rB,EAAAr/B,KAAAwT,MAAA5d,MAAA,KAAA6kC,QAAAllC,IAAA,IACWy6B,EAAAtzB,KAAA0iC,EAAAC,GAGX,IAAAD,EAAc,UAAAxmB,YAAA,uBAAAxE,EAAApf,GAAA,KAEd,OAAAg7B,EA7DA0O,EAAM1lC,UAAAyI,KAAA,SAAA5H,EAAA0G,EAAAsF,EAAAuO,GACN,oBAAAva,EACKA,EAAAY,KAAAosB,SAAAhtB,OACL,MAAAA,aAAA8jC,GACK,UAAAr/B,WAAA,sBAAAzE,GACL,GAAAA,EAAAoJ,QAAAxI,KACK,UAAA6D,WAAA,yCAAAzE,EAAAtE,KAAA,KAEL,OAAAsE,EAAAmkC,cAAAz9B,EAAAsF,EAAAuO,IAMAsqB,EAAM1lC,UAAA5I,KAAA,SAAAkvC,EAAAlrB,GACN,IAAAva,EAAAY,KAAA0I,MAAA/S,KACA,WAAAqpC,EAAA5/B,IAAAu+B,aAAAkH,EAAArM,EAAAU,QAAAvf,KAKAsqB,EAAM1lC,UAAAq/B,KAAA,SAAAx+B,EAAA0G,GAEN,MADA,iBAAA1G,IAAgCA,EAAAY,KAAA2Z,MAAAva,IAChCA,EAAA7C,OAAAuJ,IAMAm+B,EAAM1lC,UAAA45B,aAAA,SAAApqB,GACN,OAAAsvB,EAAAnF,SAAAl4B,KAAA+N,IAMAk2B,EAAM1lC,UAAAwgC,aAAA,SAAAhxB,GACN,OAAAyqB,EAAAN,SAAAl4B,KAAA+N,IAGAk2B,EAAM1lC,UAAA6tB,SAAA,SAAAtxB,GACN,IAAAy6B,EAAAv1B,KAAA0I,MAAA5N,GACA,IAAAy6B,EAAe,UAAA1xB,WAAA,sBAAA/I,GACf,OAAAy6B,GA2JA,IAAAuP,GAAA,SAAAt8B,EAAA2e,GACA,IAAA4d,EAAA/kC,KAIAA,KAAAwI,SAIAxI,KAAAmnB,QACAnnB,KAAAglC,QACAhlC,KAAAilC,UAEA9d,EAAAhW,QAAA,SAAAsY,GACAA,EAAAtQ,IAAmB4rB,EAAAC,KAAA/iC,KAAAwnB,GACnBA,EAAAlO,OAA0BwpB,EAAAE,OAAAhjC,KAAAwnB,MAM1Bqb,GAAAvmC,UAAAW,MAAA,SAAAwI,EAAAjI,QACA,IAAAA,UAEA,IAAAsuB,EAAA,IAAAmX,GAAAllC,KAAAP,GAAA,GAEA,OADAsuB,EAAAoX,OAAAz9B,EAAA,KAAAjI,EAAA0L,KAAA1L,EAAAqN,IACAihB,EAAAqX,UAUAN,GAAAvmC,UAAA8mC,WAAA,SAAA39B,EAAAjI,QACA,IAAAA,UAEA,IAAAsuB,EAAA,IAAAmX,GAAAllC,KAAAP,GAAA,GAEA,OADAsuB,EAAAoX,OAAAz9B,EAAA,KAAAjI,EAAA0L,KAAA1L,EAAAqN,IACAssB,EAAAsC,QAAA3N,EAAAqX,WAGAN,GAAAvmC,UAAA+mC,SAAA,SAAA59B,EAAAqmB,GACA,QAAAxzB,EAAA,EAAiBA,EAAAyF,KAAAglC,KAAA3pC,OAAsBd,IAAA,CACvC,IAAAkvB,EAAAzpB,KAAAglC,KAAAzqC,GACA,GAAAgrC,GAAA79B,EAAA+hB,EAAAtQ,YACAtF,IAAA4V,EAAA+b,WAAA99B,EAAA+9B,cAAAhc,EAAA+b,cACA/b,EAAAsE,WAAA2X,eAAAjc,EAAAsE,UAAA,CACA,GAAAtE,EAAA5O,SAAA,CACA,IAAAzf,EAAAquB,EAAA5O,SAAAnT,GACA,QAAAtM,EAA+B,SAC/BquB,EAAA3jB,MAAA1K,EAEA,OAAAquB,KAKAqb,GAAAvmC,UAAAonC,WAAA,SAAAnpC,EAAAsG,EAAAirB,GACA,QAAAxzB,EAAA,EAAiBA,EAAAyF,KAAAilC,OAAA5pC,OAAwBd,IAAA,CACzC,IAAAkvB,EAAAzpB,KAAAilC,OAAA1qC,GACA,QAAAkvB,EAAAlO,MAAAykB,QAAAxjC,IACAitB,EAAAsE,YAAA2X,eAAAjc,EAAAsE,UAIAtE,EAAAlO,MAAAlgB,OAAAmB,EAAAnB,SACA,IAAAouB,EAAAlO,MAAApe,WAAAX,EAAAnB,SAAAouB,EAAAlO,MAAA/T,MAAAhL,EAAAnB,OAAA,IAAAyH,IANA,CAQA,GAAA2mB,EAAA5O,SAAA,CACA,IAAAzf,EAAAquB,EAAA5O,SAAA/X,GACA,QAAA1H,EAA6B,SAC7BquB,EAAA3jB,MAAA1K,EAEA,OAAAquB,KAKAqb,GAAAc,YAAA,SAAAp9B,GACA,IAAApN,KACA,SAAA+/B,EAAA1R,GAEA,IADA,IAAAoc,EAAA,MAAApc,EAAAoc,SAAA,GAAApc,EAAAoc,SAAAtrC,EAAA,EACUA,EAAAa,EAAAC,OAAmBd,IAAA,CAC7B,IAAAgG,EAAAnF,EAAAb,GACA,IADA,MAAAgG,EAAAslC,SAAA,GAAAtlC,EAAAslC,UACAA,EAAoC,MAEpCzqC,EAAAuP,OAAApQ,EAAA,EAAAkvB,GAGA,IAAA8W,EAAA,SAAAzlC,GACA,IAAAqsB,EAAA3e,EAAAmR,MAAA7e,GAAAyK,KAAA2T,SACAiO,GAAgBA,EAAAhW,QAAA,SAAAsY,GAChB0R,EAAA1R,EAAAptB,GAAAotB,IACAA,EAAAmU,KAAA9iC,KAIA,QAAAA,KAAA0N,EAAAmR,MAAA4mB,EAAAzlC,GACA,IAAA2lC,EAAA,SAAA3lC,GACA,IAAAgrC,EAAAt9B,EAAAE,MAAAq9B,GAAAxgC,KAAA2T,SACA4sB,GAAkBA,EAAA30B,QAAA,SAAAsY,GAClB0R,EAAA1R,EAAAptB,GAAAotB,IACAA,EAAAziB,KAAA++B,KAIA,QAAAA,KAAAv9B,EAAAE,MAAA+3B,IACA,OAAArlC,GAOA0pC,GAAAkB,WAAA,SAAAx9B,GACA,OAAAA,EAAAC,OAAAw9B,YACAz9B,EAAAC,OAAAw9B,UAAA,IAAAnB,GAAAt8B,EAAAs8B,GAAAc,YAAAp9B,MAIA,IAAA09B,IACAC,SAAA,EAAAC,SAAA,EAAAC,OAAA,EAAA7kC,YAAA,EAAA8kC,QAAA,EACAC,IAAA,EAAAC,KAAA,EAAAC,IAAA,EAAAC,UAAA,EAAAC,YAAA,EAAAC,QAAA,EACAC,QAAA,EAAAC,MAAA,EAAAC,IAAA,EAAAC,IAAA,EAAAC,IAAA,EAAAC,IAAA,EAAAC,IAAA,EACAC,IAAA,EAAAlmC,QAAA,EAAAmmC,QAAA,EAAAzmC,IAAA,EAAA0mC,IAAA,EAAAC,UAAA,EAAAC,IAAA,EACA1nC,QAAA,EAAAmL,GAAA,EAAAw8B,KAAA,EAAAC,SAAA,EAAAnmC,OAAA,EAAAomC,OAAA,EAAAC,IAAA,GAIAC,IACA/5B,MAAA,EAAAy5B,UAAA,EAAAO,QAAA,EAAAC,QAAA,EAAAxsB,OAAA,EAAA1lB,OAAA,GAIAmyC,IAAgBR,IAAA,EAAAI,IAAA,GAGhBK,GAAA,EAAAC,GAAA,EAEA,SAAAC,GAAAvuB,GACA,OAAAA,EAAAquB,GAAA,aAAAruB,EAAAsuB,GAAA,GAGA,IAAAE,GAAA,SAAAhpC,EAAA0G,EAAA6T,EAAA0uB,EAAAC,EAAAttB,EAAAvb,GACAO,KAAAZ,OACAY,KAAA8F,QACA9F,KAAAsoC,QACAtoC,KAAAgb,UAVA,EAUAvb,EAAA,KAAAL,EAAAg/B,cACAp+B,KAAAP,UACAO,KAAAoL,WAEApL,KAAA2Z,QAEA3Z,KAAAuoC,YAAA/P,EAAAW,KAEAn5B,KAAAqoC,gBAGAD,GAAA7pC,UAAAojC,aAAA,SAAA36B,GACA,IAAAhH,KAAAgb,MAAA,CACA,IAAAhb,KAAAZ,KAAqB,SACrB,IAAAopC,EAAAxoC,KAAAZ,KAAAg/B,aAAAkD,WAAArL,EAAA9qB,KAAAnE,IACA,IAAAwhC,EAEK,CACL,IAAAC,EAAA/mC,EAAA1B,KAAAZ,KAAAg/B,aACA,OAAAqK,EAAA/mC,EAAAigC,aAAA36B,EAAA5H,QACAY,KAAAgb,MAAAtZ,EACA+mC,GAEA,KAPAzoC,KAAAgb,MAAAhb,KAAAZ,KAAAg/B,aAAAC,cAAAmK,GAWA,OAAAxoC,KAAAgb,MAAA2mB,aAAA36B,EAAA5H,OAGAgpC,GAAA7pC,UAAA6mC,OAAA,SAAA9L,GACA,KAAAt5B,KAAAP,QAAAwoC,IAAA,CACA,IAAAnkB,EAAAjO,EAAA7V,KAAAoL,QAAApL,KAAAoL,QAAA/P,OAAA,GACAwa,KAAA4gB,SAAA3S,EAAA,oBAAA9pB,KAAA6b,EAAAlgB,SACAkgB,EAAAlgB,KAAA0F,QAAAyoB,EAAA,GAAAzoB,OAA4C2E,KAAAoL,QAAA3K,MAChCT,KAAAoL,QAAApL,KAAAoL,QAAA/P,OAAA,GAAAwa,EAAAihB,SAAAjhB,EAAAlgB,KAAA6R,MAAA,EAAAqO,EAAAlgB,KAAA0F,OAAAyoB,EAAA,GAAAzoB,UAGZ,IAAA+P,EAAA6qB,EAAA9qB,KAAAnL,KAAAoL,SAGA,OAFAkuB,GAAAt5B,KAAAgb,QACK5P,IAAAkG,OAAAtR,KAAAgb,MAAAsmB,WAAArL,EAAAxpB,OAAA,KACLzM,KAAAZ,KAAAY,KAAAZ,KAAA7C,OAAAyD,KAAA8F,MAAAsF,EAAApL,KAAA2Z,OAAAvO,GAGAg9B,GAAA7pC,UAAAmqC,aAAA,SAAAC,GACA,QAAApuC,EAAA,EAAAqE,EAAAoB,KAAAqoC,aAA8C9tC,EAAAqE,EAAAvD,OAAoBd,IAAA,CAClE,IAAAqjC,EAAAh/B,EAAArE,IACAyF,KAAAZ,KAAAY,KAAAZ,KAAAokC,eAAA5F,EAAAx+B,MAAAwpC,GAAAhL,EAAAx+B,KAAAupC,MACA/K,EAAA7E,QAAA/4B,KAAAuoC,eACAvoC,KAAAuoC,YAAA3K,EAAAlF,SAAA14B,KAAAuoC,aACAvoC,KAAAqoC,aAAAzK,EAAA9E,cAAA94B,KAAAqoC,iBAKA,IAAAnD,GAAA,SAAAvlC,EAAAF,EAAAkd,GAEA3c,KAAAL,SAEAK,KAAAP,UACAO,KAAA6oC,OAAAlsB,EACA,IAAAmsB,EAAAlF,EAAAnkC,EAAAmkC,QACAmF,EAAAZ,GAAA1oC,EAAAma,qBAAA+C,EAxEA,EAwEA,GAEKmsB,EADLlF,EACK,IAAAwE,GAAAxE,EAAAxkC,KAAAwkC,EAAA99B,MAAA0yB,EAAAW,KAAAX,EAAAW,MAAA,EACL15B,EAAAupC,UAAApF,EAAAxkC,KAAAg/B,aAAA2K,GAEK,IAAAX,GADLzrB,EACK,KAEAhd,EAAA6I,OAAAi8B,YAFA,KAAAjM,EAAAW,KAAAX,EAAAW,MAAA,OAAA4P,GAGL/oC,KAAA0I,OAAAogC,GAEA9oC,KAAA2c,KAAA,EACA3c,KAAA0yB,KAAAjzB,EAAAwpC,cACAjpC,KAAAkpC,YAAA,GAGAC,IAA4B/lC,KAAOkP,cAAA,GAAqB82B,YAAc92B,cAAA,IA4WtE,SAAAizB,GAAA79B,EAAA2hC,GACA,OAAA3hC,EAAA69B,SAAA79B,EAAA4hC,mBAAA5hC,EAAA6hC,uBAAA7hC,EAAA8hC,oBAAA/qC,KAAAiJ,EAAA2hC,GAWA,SAAAhtC,GAAAmiB,GACA,IAAAniB,KACA,QAAAG,KAAAgiB,EAAyBniB,EAAAG,GAAAgiB,EAAAhiB,GACzB,OAAAH,EAMA,SAAAusC,GAAAnF,EAAArX,GACA,IAAA1jB,EAAA0jB,EAAA5jB,OAAAE,MACA63B,EAAA,SAAAzlC,GACA,IAAAoP,EAAAxB,EAAA5N,GACA,GAAAoP,EAAAs5B,eAAAC,GAAA,CACA,IAAA1+B,KAAAg9B,EAAA,SAAA/mB,GACAjW,EAAA9C,KAAA+Y,GACA,QAAAzgB,EAAA,EAAqBA,EAAAygB,EAAAqkB,UAAqB9kC,IAAA,CAC1C,IAAAk/B,EAAAze,EAAAwlB,KAAAjmC,GACA6E,EAAAq6B,EAAAr6B,KACAmB,EAAAk5B,EAAAl5B,KACA,GAAAnB,GAAAgtB,EAA+B,SAC/B,GAAArnB,EAAAi7B,QAAAz/B,GAAA,GAAAwhC,EAAAxhC,GAAmD,WAGnD,OAAAwhC,EAAA73B,EAAAk0B,eAA6CqL,GAAA,QAA7C,IAGA,QAAA3uC,KAAA4N,EAAA,CACA,IAAAghC,EAAAnJ,EAAAzlC,GAEA,GAAA4uC,EAAA,OAAAA,EAAAD,GApZAN,GAAA/lC,IAAAP,IAAA,WACA,OAAA7C,KAAA0I,MAAA1I,KAAA2c,OAOAuoB,GAAA3mC,UAAAorC,OAAA,SAAAjiC,GACA,MAAAA,EAAA0kB,SACApsB,KAAA4pC,YAAAliC,QACG,MAAAA,EAAA0kB,SAAA,CACH,IAAA7Q,EAAA7T,EAAAG,aAAA,SACA8R,EAAA4B,EAAAvb,KAAA6pC,WAmWA,SAAAtuB,GACA,IAAkCuI,EAAlCtC,EAAA,6BAAkCpmB,KAClC,KAAA0oB,EAAAtC,EAAAxnB,KAAAuhB,IAA8BngB,EAAA6G,KAAA6hB,EAAA,GAAAA,EAAA,GAAAsR,QAC9B,OAAAh6B,EAtWA0uC,CAAAvuB,IAAA,KAAAnY,EAAApD,KAAAoD,IACA,SAAAuW,EAAwB,QAAApf,EAAA,EAAgBA,EAAAof,EAAAte,OAAkBd,IAAOyF,KAAA+pC,eAAApwB,EAAApf,IAEjE,GADAyF,KAAAgqC,WAAAtiC,GACA,MAAAiS,EAAwB,QAAAgnB,EAAA,EAAkBA,EAAAhnB,EAAAte,OAAoBslC,IAAS3gC,KAAAiqC,kBAAAtwB,EAAAgnB,GAAAv9B,KAIvE8hC,GAAA3mC,UAAAqrC,YAAA,SAAAliC,GACA,IAAA5E,EAAA4E,EAAA2kB,UACAjpB,EAAApD,KAAAoD,IACA,IAAAA,EAAAhE,KAAAgE,EAAAhE,KAAAs9B,cAAAt5B,EAAAgI,QAAA/P,QAAA+H,EAAAgI,QAAA,GAAAkxB,WAAA,mBAAAniC,KAAA2I,GAAA,CACA,GAAAM,EAAA3D,QAAAwoC,GAaK7kC,EAAA3D,QAAAyoC,KACLplC,IAAA8J,QAAA,uBATA,GAJA9J,IAAA8J,QAAA,yBAIA,mBAAAzS,KAAA2I,IAAA9C,KAAA2c,MAAA3c,KAAA0I,MAAArN,OAAA,GACA,IAAAyO,EAAA1G,EAAAgI,QAAAhI,EAAAgI,QAAA/P,OAAA,GACA6uC,EAAAxiC,EAAAyiC,kBACArgC,GACAogC,GAAA,MAAAA,EAAAte,UACA9hB,EAAA2sB,QAAA,mBAAAt8B,KAAA2P,EAAAnU,SACWmN,IAAA0E,MAAA,IAKX1E,GAAgB9C,KAAAoqC,WAAApqC,KAAAL,OAAA6I,OAAA7S,KAAAmN,IAChB9C,KAAAqqC,WAAA3iC,QAEA1H,KAAAsqC,WAAA5iC,IAOAw9B,GAAA3mC,UAAAyrC,WAAA,SAAAtiC,GACA,IAAA5M,EAAA4M,EAAAkkB,SAAAvG,cACA2iB,GAAArtC,eAAAG,IAuSA,SAAA4M,GACA,QAAAtC,EAAAsC,EAAAkC,WAAA2gC,EAAA,KAAmDnlC,EAAOA,IAAA+mB,YAAA,CAC1D,IAAArxB,EAAA,GAAAsK,EAAAgnB,SAAAhnB,EAAAwmB,SAAAvG,cAAA,KACAvqB,GAAAktC,GAAArtC,eAAAG,IAAAyvC,GACAA,EAAAC,YAAAplC,GACAA,EAAAmlC,GACK,MAAAzvC,EACLyvC,EAAAnlC,EACKtK,IACLyvC,EAAA,OAhTsCE,CAAA/iC,GACtC,IAAA+hB,EAAAzpB,KAAAP,QAAAirC,cAAA1qC,KAAAP,QAAAirC,aAAAhjC,IAAA1H,KAAAL,OAAA2lC,SAAA59B,EAAA1H,MACA,GAAAypB,IAAAkhB,OAAA9C,GAAAltC,eAAAG,GACAkF,KAAAsqC,WAAA5iC,QACG,IAAA+hB,KAAAgG,KAAA,CACHhG,KAAAgG,KAAArD,WAAqC1kB,EAAA+hB,EAAAgG,MACrC,IAAAmb,EAAAxnC,EAAApD,KAAAoD,IAAAynC,EAAA7qC,KAAAkpC,WACA,GAAAhD,GAAAvrC,eAAAG,GACA8vC,GAAA,EACAxnC,EAAAhE,OAAsBY,KAAAkpC,YAAA,QACjB,IAAAxhC,EAAAkC,WAEL,YADA5J,KAAA8qC,aAAApjC,GAGA1H,KAAAmlC,OAAAz9B,GACAkjC,GAAe5qC,KAAA4qC,KAAAxnC,GACfpD,KAAAkpC,WAAA2B,OAEA7qC,KAAA+qC,iBAAArjC,EAAA+hB,IAKAyb,GAAA3mC,UAAAusC,aAAA,SAAApjC,GACA,MAAAA,EAAAkkB,UAAA5rB,KAAAoD,IAAAhE,MAAAY,KAAAoD,IAAAhE,KAAAs9B,eACK18B,KAAA4pC,YAAAliC,EAAAsjC,cAAAC,eAAA,QAML/F,GAAA3mC,UAAAsrC,WAAA,SAAA5E,GAEA,IADA,IAAAtrB,EAAA6e,EAAAW,KACA5+B,EAAA,EAAiBA,EAAA0qC,EAAA5pC,OAAmBd,GAAA,GACpC,IAAAkvB,EAAAzpB,KAAAL,OAAAgmC,WAAAV,EAAA1qC,GAAA0qC,EAAA1qC,EAAA,GAAAyF,MACA,GAAAypB,EAAA,CACA,GAAAA,EAAAkhB,OAAsB,YACtBhxB,EAAA3Z,KAAAL,OAAA6I,OAAAmR,MAAA8P,EAAAmU,MAAArhC,OAAAktB,EAAA3jB,OAAA4yB,SAAA/e,IAEA,OAAAA,GAOAurB,GAAA3mC,UAAAwsC,iBAAA,SAAArjC,EAAA+hB,GACA,IAEAmhB,EAAAxe,EAAAwR,EAFAmH,EAAA/kC,KAGAypB,EAAAziB,MACAolB,EAAApsB,KAAAL,OAAA6I,OAAAE,MAAA+gB,EAAAziB,OACA0vB,OAEK12B,KAAAoqC,WAAAhe,EAAA7vB,OAAAktB,EAAA3jB,SACL9F,KAAA8qC,aAAApjC,GAFAkjC,EAAA5qC,KAAAkrC,MAAA9e,EAAA3C,EAAA3jB,MAAA2jB,EAAA7P,qBAMAgkB,EADA59B,KAAAL,OAAA6I,OAAAmR,MAAA8P,EAAAmU,MACArhC,OAAAktB,EAAA3jB,OACA9F,KAAA+pC,eAAAnM,IAEA,IAAAuN,EAAAnrC,KAAAoD,IAEA,GAAAgpB,KAAAsK,OACA12B,KAAAsqC,WAAA5iC,QACG,GAAA+hB,EAAA2hB,WACHprC,KAAAsqC,WAAA5iC,GACA+hB,EAAA2hB,WAAA1jC,EAAA1H,KAAAL,OAAA6I,QAAA2I,QAAA,SAAAnK,GAAsE,OAAA+9B,EAAAqF,WAAApjC,SACnE,CACH,IAAAqkC,EAAA5hB,EAAA6hB,eACA,iBAAAD,EAAwCA,EAAA3jC,EAAA6jC,cAAAF,GACxC,mBAAAA,IAA+CA,IAAA3jC,IAC/C2jC,IAAsBA,EAAA3jC,GACtB1H,KAAAwrC,WAAA9jC,EAAA2jC,GAAA,GACArrC,KAAAmlC,OAAAkG,EAAAT,GAEAA,IAAa5qC,KAAA4qC,KAAAO,GAAoBnrC,KAAA2c,QACjCihB,GAAa59B,KAAAiqC,kBAAArM,EAAAuN,IAObjG,GAAA3mC,UAAA4mC,OAAA,SAAAj7B,EAAA0gC,EAAA/P,EAAAC,GAEA,IADA,IAAA71B,EAAA41B,GAAA,EACAnzB,EAAAmzB,EAAA3wB,EAAAuhC,WAAA5Q,GAAA3wB,EAAAN,WACAU,EAAA,MAAAwwB,EAAA,KAAA5wB,EAAAuhC,WAAA3Q,GACApzB,GAAA4C,EAAkB5C,IAAAykB,cAAAlnB,EAClBjF,KAAA0rC,YAAAxhC,EAAAjF,GACAjF,KAAA2pC,OAAAjiC,GACAkjC,GAAA1E,GAAAvrC,eAAA+M,EAAAkkB,SAAAvG,gBACOrlB,KAAA4qC,QAEP5qC,KAAA0rC,YAAAxhC,EAAAjF,IAMAigC,GAAA3mC,UAAAotC,UAAA,SAAA3kC,GAEA,IADA,IAAA4kC,EAAAhB,EACA9pC,EAAAd,KAAA2c,KAA6B7b,GAAA,EAAYA,IAAA,CACzC,IAAA+qC,EAAA7rC,KAAA0I,MAAA5H,GACAy0B,EAAAsW,EAAAlK,aAAA36B,GACA,GAAAuuB,KAAAqW,KAAAvwC,OAAAk6B,EAAAl6B,UACAuwC,EAAArW,EACAqV,EAAAiB,GACAtW,EAAAl6B,QAA0B,MAE1B,GAAAwwC,EAAAvD,MAAmB,MAEnB,IAAAsD,EAAe,SACf5rC,KAAA4qC,QACA,QAAArwC,EAAA,EAAiBA,EAAAqxC,EAAAvwC,OAAkBd,IAC9ByF,KAAA8rC,WAAAF,EAAArxC,GAAA,SACL,UAKA2qC,GAAA3mC,UAAA6rC,WAAA,SAAApjC,GACA,GAAAA,EAAAs1B,UAAAt8B,KAAAkpC,aAAAlpC,KAAAoD,IAAAhE,KAAA,CACA,IAAAmzB,EAAAvyB,KAAA+rC,uBACAxZ,GAAgBvyB,KAAA8rC,WAAAvZ,GAEhB,GAAAvyB,KAAA2rC,UAAA3kC,GAAA,CACAhH,KAAAgsC,aACA,IAAA5oC,EAAApD,KAAAoD,IACAA,EAAAslC,aAAA1hC,EAAA5H,MACAgE,EAAA4X,QAAoB5X,EAAA4X,MAAA5X,EAAA4X,MAAA4jB,UAAA53B,EAAA5H,OAEpB,IADA,IAAAua,EAAAvW,EAAAmlC,YACAhuC,EAAA,EAAmBA,EAAAyM,EAAA2S,MAAAte,OAAuBd,IACnC6I,EAAAhE,OAAAgE,EAAAhE,KAAAokC,eAAAx8B,EAAA2S,MAAApf,GAAA6E,QACEua,EAAA3S,EAAA2S,MAAApf,GAAAm+B,SAAA/e,IAET,OADAvW,EAAAgI,QAAAnJ,KAAA+E,EAAA42B,KAAAjkB,KACA,EAEA,UAMAurB,GAAA3mC,UAAA2sC,MAAA,SAAA9rC,EAAA0G,EAAAmmC,GACA,IAAAtH,EAAA3kC,KAAA2rC,UAAAvsC,EAAA7C,OAAAuJ,IAEA,OADA6+B,GAAW3kC,KAAA8rC,WAAA1sC,EAAA0G,GAAA,EAAAmmC,GACXtH,GAIAO,GAAA3mC,UAAAutC,WAAA,SAAA1sC,EAAA0G,EAAAwiC,EAAA2D,GACAjsC,KAAAgsC,aACA,IAAA5oC,EAAApD,KAAAoD,IACAA,EAAAslC,aAAAtpC,GACAgE,EAAA4X,MAAA5X,EAAA4X,OAAA5X,EAAA4X,MAAA4jB,UAAAx/B,EAAA0G,GACA,IAAArG,EAAA,MAAAwsC,GAAA,EAAA7oC,EAAA3D,QAAA0oC,GAAA8D,GA1SA,EA2SA7oC,EAAA3D,SAAA,GAAA2D,EAAAgI,QAAA/P,SAAiEoE,GA3SjE,GA4SAO,KAAA0I,MAAAzG,KAAA,IAAAmmC,GAAAhpC,EAAA0G,EAAA1C,EAAAmlC,YAAAnlC,EAAAilC,aAAAC,EAAA,KAAA7oC,IACAO,KAAA2c,QAKAuoB,GAAA3mC,UAAAytC,WAAA,SAAA1S,GACA,IAAA/+B,EAAAyF,KAAA0I,MAAArN,OAAA,EACA,GAAAd,EAAAyF,KAAA2c,KAAA,CACA,KAAUpiB,EAAAyF,KAAA2c,KAAepiB,IAAOyF,KAAA0I,MAAAnO,EAAA,GAAA6Q,QAAAnJ,KAAAjC,KAAA0I,MAAAnO,GAAA6qC,OAAA9L,IAChCt5B,KAAA0I,MAAArN,OAAA2E,KAAA2c,KAAA,IAIAuoB,GAAA3mC,UAAA6mC,OAAA,WAGA,OAFAplC,KAAA2c,KAAA,EACA3c,KAAAgsC,WAAAhsC,KAAA6oC,QACA7oC,KAAA0I,MAAA,GAAA08B,OAAAplC,KAAA6oC,QAAA7oC,KAAAP,QAAAysC,UAGAhH,GAAA3mC,UAAAqsC,KAAA,SAAA99B,GACA,QAAAvS,EAAAyF,KAAA2c,KAAyBpiB,GAAA,EAAQA,IAAO,GAAAyF,KAAA0I,MAAAnO,IAAAuS,EAExC,YADA9M,KAAA2c,KAAApiB,IAKA4uC,GAAAC,WAAAvmC,IAAA,WACA7C,KAAAgsC,aAEA,IADA,IAAAroC,EAAA,EACApJ,EAAAyF,KAAA2c,KAAyBpiB,GAAA,EAAQA,IAAA,CAEjC,IADA,IAAA6Q,EAAApL,KAAA0I,MAAAnO,GAAA6Q,QACAnK,EAAAmK,EAAA/P,OAAA,EAAoC4F,GAAA,EAAQA,IACrC0C,GAAAyH,EAAAnK,GAAAoE,SACP9K,GAAYoJ,IAEZ,OAAAA,GAGAuhC,GAAA3mC,UAAAmtC,YAAA,SAAAxhC,EAAA2c,GACA,GAAA7mB,KAAA0yB,KAAkB,QAAAn4B,EAAA,EAAgBA,EAAAyF,KAAA0yB,KAAAr3B,OAAsBd,IACxDyF,KAAA0yB,KAAAn4B,GAAAyM,MAAAkD,GAAAlK,KAAA0yB,KAAAn4B,GAAAssB,YACO7mB,KAAA0yB,KAAAn4B,GAAAoJ,IAAA3D,KAAAopC,aAIPlE,GAAA3mC,UAAA+rC,WAAA,SAAApgC,GACA,GAAAlK,KAAA0yB,KAAkB,QAAAn4B,EAAA,EAAgBA,EAAAyF,KAAA0yB,KAAAr3B,OAAsBd,IACxD,MAAAyF,KAAA0yB,KAAAn4B,GAAAoJ,KAAA,GAAAuG,EAAAkiB,UAAAliB,EAAA8X,SAAAhiB,KAAA0yB,KAAAn4B,GAAAyM,QACOhH,KAAA0yB,KAAAn4B,GAAAoJ,IAAA3D,KAAAopC,aAIPlE,GAAA3mC,UAAAitC,WAAA,SAAAthC,EAAAkB,EAAAnC,GACA,GAAAiB,GAAAkB,GAAApL,KAAA0yB,KAAuC,QAAAn4B,EAAA,EAAgBA,EAAAyF,KAAA0yB,KAAAr3B,OAAsBd,IAAA,CAC7E,SAAAyF,KAAA0yB,KAAAn4B,GAAAoJ,KAAA,GAAAuG,EAAAkiB,UAAAliB,EAAA8X,SAAAhiB,KAAA0yB,KAAAn4B,GAAAyM,MACAoE,EAAA+gC,wBAAAnsC,KAAA0yB,KAAAn4B,GAAAyM,OACAiC,EAAA,OACSjJ,KAAA0yB,KAAAn4B,GAAAoJ,IAAA3D,KAAAopC,cAKTlE,GAAA3mC,UAAA8rC,WAAA,SAAA+B,GACA,GAAApsC,KAAA0yB,KAAkB,QAAAn4B,EAAA,EAAgBA,EAAAyF,KAAA0yB,KAAAr3B,OAAsBd,IACxDyF,KAAA0yB,KAAAn4B,GAAAyM,MAAAolC,IACOpsC,KAAA0yB,KAAAn4B,GAAAoJ,IAAA3D,KAAAopC,YAAAgD,EAAA/f,UAAAhxB,OAAA2E,KAAA0yB,KAAAn4B,GAAAssB,UAOPqe,GAAA3mC,UAAAmnC,eAAA,SAAA3X,GACA,IAAAgX,EAAA/kC,KAEA,GAAA+tB,EAAAiS,QAAA,QACK,OAAAjS,EAAA5yB,MAAA,YAAAyP,KAAA5K,KAAA0lC,eAAA1lC,MAEL,IAAA9E,EAAA6yB,EAAA5yB,MAAA,KACAkxC,EAAArsC,KAAAP,QAAAsuB,QACAue,IAAAtsC,KAAA6oC,QAAAwD,KAAAniC,OAAA9K,MAAAY,KAAA0I,MAAA,GAAAtJ,MACAmtC,IAAAF,IAAAvrC,MAAA,MAAAwrC,EAAA,KACAtxB,EAAA,SAAAzgB,EAAAuG,GACA,KAAUvG,GAAA,EAAQA,IAAA,CAClB,IAAAiyC,EAAAtxC,EAAAX,GACA,OAAAiyC,EAAA,CACA,GAAAjyC,GAAAW,EAAAG,OAAA,MAAAd,EAA8C,SAC9C,KAAcuG,GAAAyrC,EAAmBzrC,IACtB,GAAAka,EAAAzgB,EAAA,EAAAuG,GAA2B,SACtC,SAEA,IAAAP,EAAAO,EAAA,MAAAA,GAAAwrC,EAAAvH,EAAAr8B,MAAA5H,GAAA1B,KACAitC,GAAAvrC,GAAAyrC,EAAAF,EAAArlC,KAAAlG,EAAAyrC,GAAAntC,KACA,KACA,IAAAmB,KAAAzF,MAAA0xC,IAAA,GAAAjsC,EAAA+hC,OAAAtC,QAAAwM,GACW,SACX1rC,IAGA,UAEA,OAAAka,EAAA9f,EAAAG,OAAA,EAAA2E,KAAA2c,OAGAuoB,GAAA3mC,UAAAwtC,qBAAA,WACA,IAAAU,EAAAzsC,KAAAP,QAAAsuB,QACA,GAAA0e,EAAiB,QAAA1jC,EAAA0jC,EAAA3rC,MAA6BiI,GAAA,EAAQA,IAAA,CACtD,IAAA2jC,EAAAD,EAAAzlC,KAAA+B,GAAAo1B,eAAAsO,EAAAz8B,WAAAjH,IAAAq2B,YACA,GAAAsN,KAAAnP,aAAAmP,EAAA/O,aAA2D,OAAA+O,EAE3D,QAAA5xC,KAAAkF,KAAAL,OAAA6I,OAAAE,MAAA,CACA,IAAAtJ,EAAAY,KAAAL,OAAA6I,OAAAE,MAAA5N,GACA,GAAAsE,EAAAm+B,aAAAn+B,EAAAu+B,aAAgD,OAAAv+B,IAIhD8lC,GAAA3mC,UAAAwrC,eAAA,SAAAnM,GACA59B,KAAAoD,IAAAilC,aAAAzK,EAAAlF,SAAA14B,KAAAoD,IAAAilC,eAGAnD,GAAA3mC,UAAA0rC,kBAAA,SAAArM,EAAAnoB,GACA,QAAA3U,EAAAd,KAAA2c,KAA6B7b,GAAA,EAAYA,IAAA,CACzC,IAAAmZ,EAAAja,KAAA0I,MAAA5H,GAIA,GAHAmZ,EAAAouB,aAAAsE,YAAA/O,IACA,EAAqB3jB,EAAAouB,aAAAzK,EAAA9E,cAAA7e,EAAAouB,cACXpuB,EAAAsuB,YAAA3K,EAAA9E,cAAA7e,EAAAsuB,aACVtuB,GAAAxE,EAAwB,QAIxBnZ,OAAAmW,iBAAAyyB,GAAA3mC,UAAA4qC,IAsFA,IAAAyD,GAAA,SAAAlkC,EAAAiR,GAGA3Z,KAAA0I,YAGA1I,KAAA2Z,aA+JA,SAAAkzB,GAAAruB,GACA,IAAApjB,KACA,QAAAN,KAAA0jB,EAAA,CACA,IAAApF,EAAAoF,EAAA1jB,GAAAyK,KAAA6T,MACAA,IAAgBhe,EAAAN,GAAAse,GAEhB,OAAAhe,EAGA,SAAAyO,GAAApK,GAEA,OAAAA,EAAA6rB,UAAA5O,OAAA4O,SAlKAshB,GAAAruC,UAAAuuC,kBAAA,SAAAvgC,EAAA9M,EAAAwc,GACA,IAAA8oB,EAAA/kC,UACA,IAAAP,UAEAwc,IAAgBA,EAAApS,GAAApK,GAAAstC,0BAEhB,IAAA3pC,EAAA6Y,EAAA4lB,EAAA,KA4BA,OA3BAt1B,EAAA4E,QAAA,SAAAnK,GACA,GAAA66B,GAAA76B,EAAA2S,MAAAte,OAAA,CACAwmC,IAAoBA,MAEpB,IADA,IAAAmL,EAAA,EAAAC,EAAA,EACAD,EAAAnL,EAAAxmC,QAAA4xC,EAAAjmC,EAAA2S,MAAAte,QAAA,CACA,IAAAkF,EAAAyG,EAAA2S,MAAAszB,GACA,GAAAlI,EAAAprB,MAAApZ,EAAAnB,KAAAtE,MAAA,CACA,IAAAyF,EAAAgP,GAAAsyB,EAAAmL,MAAA,IAAAzsC,EAAAnB,KAAAmG,KAAA2nC,SAA0E,MAC1EF,GAAA,EAAkBC,SAF0BA,IAI5C,KAAAD,EAAAnL,EAAAxmC,QACA+H,EAAAy+B,EAAAphC,MACAohC,EAAAphC,MAEA,KAAAwsC,EAAAjmC,EAAA2S,MAAAte,QAAA,CACA,IAAAwjB,EAAA7X,EAAA2S,MAAAszB,KACAE,EAAApI,EAAAqI,cAAAvuB,EAAA7X,EAAAs1B,SAAA78B,GACA0tC,IACAtL,EAAA5/B,KAAA4c,EAAAzb,GACAA,EAAAonC,YAAA2C,EAAAzlC,KACAtE,EAAA+pC,EAAA9B,YAAA8B,EAAAzlC,MAIAtE,EAAAonC,YAAAzF,EAAAsI,cAAArmC,EAAAvH,MAGAwc,GASA2wB,GAAAruC,UAAA8uC,cAAA,SAAArmC,EAAAvH,QACA,IAAAA,UAEA,IAAAg6B,EACAmT,GAAAU,WAAAzjC,GAAApK,GAAAO,KAAA0I,MAAA1B,EAAA5H,KAAAtE,MAAAkM,IACAU,EAAA+xB,EAAA/xB,IACA2jC,EAAA5R,EAAA4R,WACA,GAAAA,EAAA,CACA,GAAArkC,EAAA0vB,OACO,UAAA7yB,WAAA,gDACPpE,EAAA8tC,UACO9tC,EAAA8tC,UAAAvmC,EAAAqkC,EAAA5rC,GAEAO,KAAA8sC,kBAAA9lC,EAAAoE,QAAA3L,EAAA4rC,GAEP,OAAA3jC,GAGAklC,GAAAruC,UAAAivC,sBAAA,SAAAxmC,EAAAvH,QACA,IAAAA,UAGA,IADA,IAAAiI,EAAA1H,KAAAqtC,cAAArmC,EAAAvH,GACAlF,EAAAyM,EAAA2S,MAAAte,OAAA,EAAqCd,GAAA,EAAQA,IAAA,CAC7C,IAAAkuC,EAAAzoC,KAAAotC,cAAApmC,EAAA2S,MAAApf,GAAAyM,EAAAs1B,SAAA78B,GACAgpC,KACAA,EAAA4C,YAAA5C,EAAA/gC,KAAA8iC,YAAA9iC,GACAA,EAAA+gC,EAAA/gC,KAGA,OAAAA,GAGAklC,GAAAruC,UAAA6uC,cAAA,SAAAxP,EAAAz9B,EAAAV,QACA,IAAAA,UAEA,IAAA2Z,EAAApZ,KAAA2Z,MAAAikB,EAAAx+B,KAAAtE,MACA,OAAAse,GAAAwzB,GAAAU,WAAAzjC,GAAApK,GAAA2Z,EAAAwkB,EAAAz9B,KAOAysC,GAAAU,WAAA,SAAAzjC,EAAA4jC,EAAAC,GAGA,QAFA,IAAAA,MAAA,MAEA,iBAAAD,EACK,OAAS/lC,IAAAmC,EAAAohC,eAAAwC,IACd,SAAAA,EAAArhB,SACK,OAAS1kB,IAAA+lC,GACd,IAAAE,EAAAF,EAAA,GAAAG,EAAAD,EAAA3N,QAAA,KACA4N,EAAA,IACAF,EAAAC,EAAAnmC,MAAA,EAAAomC,GACAD,IAAAnmC,MAAAomC,EAAA,IAEA,IAAAvC,EAAA,KAAA3jC,EAAAgmC,EAAA7jC,EAAAgkC,gBAAAH,EAAAC,GAAA9jC,EAAA4gB,cAAAkjB,GACA7nC,EAAA2nC,EAAA,GAAA/rC,EAAA,EACA,GAAAoE,GAAA,iBAAAA,GAAA,MAAAA,EAAAsmB,WAAA3H,MAAAC,QAAA5e,GAEA,QAAAhL,KADA4G,EAAA,EACAoE,EAA6B,SAAAA,EAAAhL,GAAA,CAC7B,IAAAgzC,EAAAhzC,EAAAklC,QAAA,KACA8N,EAAA,EAAwBpmC,EAAAqmC,eAAAjzC,EAAA0M,MAAA,EAAAsmC,GAAAhzC,EAAA0M,MAAAsmC,EAAA,GAAAhoC,EAAAhL,IACZ4M,EAAAsmC,aAAAlzC,EAAAgL,EAAAhL,IAGZ,QAAAP,EAAAmH,EAAqBnH,EAAAkzC,EAAApyC,OAAsBd,IAAA,CAC3C,IAAA6K,EAAAqoC,EAAAlzC,GACA,OAAA6K,EAAA,CACA,GAAA7K,EAAAkzC,EAAApyC,OAAA,GAAAd,EAAAmH,EACS,UAAAmC,WAAA,0DACT,OAAc6D,MAAA2jC,WAAA3jC,GAEd,IAAA+xB,EAAAmT,GAAAU,WAAAzjC,EAAAzE,EAAAsoC,GACA/6B,EAAA8mB,EAAA/xB,IACAumC,EAAAxU,EAAA4R,WAEA,GADA3jC,EAAA8iC,YAAA73B,GACAs7B,EAAA,CACA,GAAA5C,EAAyB,UAAAxnC,WAAA,0BACzBwnC,EAAA4C,GAIA,OAAUvmC,MAAA2jC,eAMVuB,GAAA5G,WAAA,SAAAx9B,GACA,OAAAA,EAAAC,OAAAylC,gBACA1lC,EAAAC,OAAAylC,cAAA,IAAAtB,GAAA5sC,KAAAmuC,gBAAA3lC,GAAAxI,KAAAouC,gBAAA5lC,MAMAokC,GAAAuB,gBAAA,SAAA3lC,GACA,IAAApN,EAAAyxC,GAAArkC,EAAAE,OAEA,OADAtN,EAAAzF,OAAqByF,EAAAzF,KAAA,SAAAqR,GAAgC,OAAAA,EAAArR,OACrDyF,GAKAwxC,GAAAwB,gBAAA,SAAA5lC,GACA,OAAAqkC,GAAArkC,EAAAmR,2CC5xGA,IAAA00B,EAAW9wC,EAAQ,QACnBggB,EAAYhgB,EAAQ,QAEpB9H,EAAAiJ,YACAjJ,EAAA20B,cA0DA,SAAAtnB,EAAArD,GACA,IAKArE,EACA22B,EACApB,EACA71B,EARAwzC,EAAA7uC,MACA8uC,EAAAD,EAAAC,QAAAF,EAAA3Z,gBACA8Z,EAAAF,EAAAE,OACAnzC,EAAAkzC,EAAAlzC,OACA4J,GAAA,EAMA,OAAAupC,QAAA36B,IAAA26B,IACAA,EAAAC,GAGA,oBAAA3rC,EACA,MAAAya,EAAA,wCAAAza,GAGAivB,GAAgBlQ,UAAA,EAAAgE,SAAA,KAAA/iB,UAChB1H,GAAYymB,UAAA,EAAAgE,SAAA,KAAA/iB,UAEZ,OAAAmC,EAAA5J,GACAP,EAAAyzC,EAAAtpC,GAEAopC,EAAAnkB,YAAApvB,MAIA61B,EAAAjyB,EAAA5D,EAAAgI,EAAArD,IACAomB,SAAA/qB,EAEA61B,EAAA9O,UAAAkQ,EAAAlQ,YACAkQ,EAAApB,GAGAA,EAAA9O,UAAAzmB,EAAAymB,YACAkQ,EAAA32B,EACAA,EAAAu1B,IAIAoB,EAAAlM,WACAzqB,EAAA22B,cAGA,OAAA32B,GAvGA3F,EAAA2+B,iBA2GA,SAAAt5B,EAAAojB,GACAmwB,EAAAja,iBAAAt5B,EAAAojB,IA3GAzoB,EAAAi/B,cA+GA,WACA,OAAA2Z,EAAA3Z,iBA/GAj/B,EAAAi5C,cAmHA,SAAA5zC,EAAA64B,GACA,IACA/2B,EADAR,EAAAtB,EAGA64B,KACAv3B,MACAtB,GAAA64B,GAGA,IAAA/2B,KAAAR,EACAiyC,EAAA5a,gBAAAr3B,EAAAQ,IAAoC+wB,aAAA/wB,KA3HpC+xC,EAAApwC,UAAAyiB,QA2JA,SAAAle,GACA,IACA6tB,EACAie,EAFAnuB,EAAAzgB,KAAAygB,MAIA,QAAA3d,EAAA,OAEA6tB,EAAAlQ,IAAAplB,OAAA,IACAuzC,EAAAje,EAAAnQ,SAAAmQ,EAAAnQ,SAAAnlB,OAAA,KAEA,SAAAuzC,EAAAxvC,KACAwvC,EAAA9rC,SAEA6tB,EAAAnQ,SAAAve,MAA2B7C,KAAA,OAAA0D,WAvK3B6rC,EAAApwC,UAAAwwB,WAoIA,SAAAjsB,EAAAhI,GACAkF,KAAAihB,SAAAnmB,GACAkF,KAAAghB,QAAAle,GACA9C,KAAA2gB,aAtIAguB,EAAApwC,UAAAkwB,eAyIA,SAAA7gB,EAAA9S,GACA,IAAA2lB,EAAAzgB,KAAAygB,MACAkQ,EAAAlQ,IAAAplB,OAAA,GACAo2B,EAAA7jB,EAAA2S,SAAAC,SACAxZ,EAAAlM,GAEAsE,KAAA,UACAuuC,QAAA,OACAkB,YAAqB1uB,WAAArlB,IACrB0lB,SAAAiR,GAEAA,EAEAd,EAAAnQ,SAAAmQ,EAAAnQ,SAAAhO,OAAAxL,IArJA2nC,EAAApwC,UAAA0iB,SAyKA,SAAAnmB,GACA,IAAA2lB,EAAAzgB,KAAAygB,MACAN,EAAAngB,KAAAP,QAAAwgB,YAAAnlB,EACA61B,EAAAlQ,IAAAplB,OAAA,GACA+J,GACAhG,KAAA,UACAuuC,QAAA,OACAkB,YAAiB1uB,eACjBK,aAGAmQ,EAAAnQ,SAAAve,KAAAmD,GACAqb,EAAAxe,KAAAmD,IApLAupC,EAAApwC,UAAAoiB,UAuLA,WACA3gB,KAAAygB,MAAAhgB,OAvLAkuC,EAAApwC,UAAAuyB,cAAAge,EACAH,EAAApwC,UAAAwyB,SAAA+d,EACAH,EAAApwC,UAAAyyB,OAwLA,WACA,UAvLA,IAAAyd,EAAA,QAGA,SAAA/vC,EAAA5D,EAAAgI,EAAArD,GACA,IAGArE,EAHA6N,EAAAolC,EAAApa,cAEAua,GADA/uC,OACA+uC,OAGA,oBAAA1zC,EACA,MAAAyiB,EAAA,uCAAAziB,GAGA,IAAAuzC,EAAAnkB,YAAApvB,GACA,MAAAyiB,EAAA,2CAAAziB,GAGA,oBAAAgI,EACA,MAAAya,EAAA,wCAAAza,GAeA,GAZA,OAAA0rC,QAAA36B,IAAA26B,IACAA,EAAAC,GAGAJ,EAAApa,WAAkBxG,UAAAkhB,EAAA1uB,YAAAuuB,IAElBpzC,EAAAizC,EAAA3vC,UAAAoE,GAAkC+iB,SAAA/qB,EAAAuvB,gBAAA,IAElCgkB,EAAApa,UAAAhrB,OAIA7N,EAAAi2B,YACA,MAAAj2B,EAAAi2B,YAGA,OACAxP,UAAAzmB,EAAAymB,UACAgE,SAAAzqB,EAAAyqB,SACA/iB,MAAA1H,EAAAkmB,QAAAf,SAAAC,UA8EA,SAAAmuB,EAAAlvC,GACAO,KAAAP,UACAO,KAAAugB,UAAmBC,aACnBxgB,KAAAygB,OAAAzgB,KAAAugB,UAiEA,SAAAuuB,yCC9MAvxC,EAAAwL,EAAAgmC,EAAA,sBAAAC,IAAAzxC,EAAAwL,EAAAgmC,EAAA,sBAAAE,IAAA1xC,EAAAwL,EAAAgmC,EAAA,sBAAAG,IAAA3xC,EAAAwL,EAAAgmC,EAAA,sBAAAI,IAAA5xC,EAAAwL,EAAAgmC,EAAA,sBAAAK,IAAA7xC,EAAAwL,EAAAgmC,EAAA,sBAAAM,IAAA9xC,EAAAwL,EAAAgmC,EAAA,sBAAAO,IAAA,IAAAC,EAAAhyC,EAAA,QAAAiyC,EAAAjyC,EAAA,QAAAkyC,EAAAlyC,EAAA,QAOA,MAAAmyC,EAAA,CAAAzyC,EAAAC,KACAD,EAAAmM,UAAAqD,QAEAvP,GACAA,EAAAD,EAAAuP,GAAAkjC,kBAAAlgC,mBACA,GAqDA,SAAAmgC,EAAA3oC,EAAA4oC,EAAAC,GAAA,GACA,QAAA9N,EAAA/6B,EAAyB+6B,EAAMA,EAAA,SAAA6N,EAAA7N,EAAAn4B,WAAAm4B,EAAAh4B,UAAA,CAC/B,GAAAg4B,EAAAxE,YACA,SACA,GAAAsS,GAAA,GAAA9N,EAAAr8B,WACA,SAEA,SA0BA,SAAAoqC,EAAAhnC,GACA,IAAAA,EAAAoB,OAAA9K,KAAAmG,KAAAq2B,UACA,QAAArhC,EAAAuO,EAAAhI,MAAA,EAAoCvG,GAAA,EAAQA,IAAA,CAC5C,GAAAuO,EAAA7D,MAAA1K,GAAA,EACA,OAAAuO,EAAAe,IAAAb,QAAAF,EAAAG,OAAA1O,EAAA,IACA,GAAAuO,EAAA9B,KAAAzM,GAAA6E,KAAAmG,KAAAq2B,UACA,MAEA,YAqEA,SAAAmU,EAAAjnC,GACA,IAAAA,EAAAoB,OAAA9K,KAAAmG,KAAAq2B,UACA,QAAArhC,EAAAuO,EAAAhI,MAAA,EAAoCvG,GAAA,EAAQA,IAAA,CAC5C,IAAA2P,EAAApB,EAAA9B,KAAAzM,GACA,GAAAuO,EAAA7D,MAAA1K,GAAA,EAAA2P,EAAAxE,WACA,OAAAoD,EAAAe,IAAAb,QAAAF,EAAAY,MAAAnP,EAAA,IACA,GAAA2P,EAAA9K,KAAAmG,KAAAq2B,UACA,MAEA,YAOA,MA4CAuT,EAAA,CAAAlyC,EAAAC,KACA,IAAAqO,MAASA,EAAAC,OAAavO,EAAAmM,UACtB2U,EAAAxS,EAAAixB,WAAAhxB,GAAAyQ,EAAA8B,GAAyDzhB,OAAAizC,EAAA,EAAAjzC,CAAUyhB,GACnE,aAAA9B,IAEA/e,GACAA,EAAAD,EAAAuP,GAAA2iC,KAAApxB,EAAA9B,GAAAzM,mBACA,IAeA,SAAAwgC,EAAAh1B,GACA,QAAAzgB,EAAA,EAAmBA,EAAAygB,EAAAqkB,UAAqB9kC,IAAA,CACxC,IAAA6E,KAAaA,GAAO4b,EAAAwlB,KAAAjmC,GACpB,GAAA6E,EAAAm+B,cAAAn+B,EAAA8hC,mBACA,OAAA9hC,EAEA,YAOA,MAAA8vC,EAAA,CAAAjyC,EAAAC,KACA,IAAAiM,MAASA,EAAAM,WAAiBxM,EAAAmM,UAC1B,IAAAD,EAAAe,OAAA9K,KAAAmG,KAAA7K,OAAAyO,EAAAyzB,WAAAnzB,GACA,SACA,IAAAwmC,EAAA9mC,EAAAnC,MAAA,GAAA0C,EAAAP,EAAA6G,YAAA,GAAA5Q,EAAA4wC,EAAAC,EAAA9R,eAAAz0B,IACA,IAAAtK,IAAA6wC,EAAAtR,eAAAj1B,IAAAtK,GACA,SACA,GAAAlC,EAAA,CACA,IAAAyG,EAAAwF,EAAAO,QAAA8C,EAAAvP,EAAAuP,GAAA0jC,YAAAvsC,IAAAvE,EAAAiN,iBACAG,EAAAO,aAAwB0iC,EAAA,EAASphC,KAAA7B,EAAA3C,IAAAb,QAAArF,GAAA,IACjCzG,EAAAsP,EAAAgD,kBAEA,UAgDA2gC,EAAA,CAAAlzC,EAAAC,KACA,IAAAqO,MAASA,EAAAC,OAAavO,EAAAmM,UACtB,GAAAnM,EAAAmM,qBAAmCqmC,EAAA,GAAaxyC,EAAAmM,UAAApC,KAAA2vB,QAChD,SAAAprB,EAAAgvB,eAAoCj+B,OAAAizC,EAAA,EAAAjzC,CAAQW,EAAA4M,IAAA0B,EAAA5H,QAE5CzG,GACAA,EAAAD,EAAAuP,GAAArR,MAAAoQ,EAAA5H,KAAA6L,mBACA,GAEA,IAAAjE,EAAArB,OAAAysB,QACA,SACA,GAAAz5B,EAAA,CACA,IAAAkzC,EAAA5kC,EAAA+uB,cAAA/uB,EAAAtB,OAAAkB,QAAAC,KACAmB,EAAAvP,EAAAuP,IACAvP,EAAAmM,qBAAuCqmC,EAAA,GAAaxyC,EAAAmM,qBAA+BqmC,EAAA,IACnFjjC,EAAAkjC,kBACA,IAAAhD,EAAA,GAAAnhC,EAAAzK,MAAA,KAAAkvC,EAAAzkC,EAAAvE,MAAA,GAAAm3B,eAAA5yB,EAAAyE,YAAA,KACAO,EAAA6/B,GAAA1D,IAAuCttC,KAAAstC,SAAc74B,EACrDw8B,EAAkB/zC,OAAAizC,EAAA,EAAAjzC,CAAQkQ,EAAA3C,IAAA2C,EAAAf,QAAArP,IAAAmP,EAAA5H,KAAA,EAAA4M,GAM1B,GALAA,GAAA8/B,IAA8B/zC,OAAAizC,EAAA,EAAAjzC,CAAQkQ,EAAA3C,IAAA2C,EAAAf,QAAArP,IAAAmP,EAAA5H,KAAA,EAAA+oC,IAAiDttC,KAAAstC,SAAc74B,KACrG64B,IACAn8B,IAA0BnR,KAAAstC,KAC1B2D,GAAA,GAEAA,IACA7jC,EAAArR,MAAAqR,EAAAf,QAAArP,IAAAmP,EAAA5H,KAAA,EAAA4M,IACA6/B,IAAA7kC,EAAAgvB,cAAAhvB,EAAArB,OAAA9K,MAAAstC,GAAA,CACA,IAAA9V,EAAApqB,EAAAf,QAAArP,IAAAmP,EAAAtC,UAAAqnC,EAAA9jC,EAAA3C,IAAAb,QAAA4tB,GACA8V,GAAAnhC,EAAAvE,MAAA,GAAA23B,eAAA2R,EAAArrC,QAAAqrC,EAAArrC,QAAA,EAAAynC,IACAlgC,EAAAoE,cAAApE,EAAAf,QAAArP,IAAAmP,EAAAtC,UAAAyjC,GAGAxvC,EAAAsP,EAAAgD,kBAEA,UAsDA,SAAA+gC,EAAAtzC,EAAAuzC,EAAAtzC,GACA,IAAAuzC,EAAAz1B,EAAA/R,EAAAunC,EAAA1mC,WAAAJ,EAAA8mC,EAAA7mC,UACA,GAAAV,EAAA7J,KAAAmG,KAAAq2B,WAAAlyB,EAAAtK,KAAAmG,KAAAq2B,UACA,SACA,GAtBA,SAAA3+B,EAAA6L,EAAA5L,GACA,IAAA+L,EAAAH,EAAAgB,WAAAJ,EAAAZ,EAAAa,UAAA1E,EAAA6D,EAAA7D,QACA,UAAAgE,GAAAS,GAAAT,EAAA7J,KAAAs7B,kBAAAhxB,EAAAtK,UAEA6J,EAAAmC,QAAAC,MAAAvC,EAAAoB,OAAAkxB,WAAAn2B,EAAA,EAAAA,IACA/H,GACAA,EAAAD,EAAAuP,GAAAmS,OAAA7V,EAAAnF,IAAAsF,EAAA5D,SAAAyD,EAAAnF,KAAA6L,kBACA,IAEA1G,EAAAoB,OAAAkxB,WAAAn2B,IAAA,KAAAyE,EAAA6zB,cAA4EjhC,OAAAizC,EAAA,EAAAjzC,CAAOW,EAAA4M,IAAAf,EAAAnF,OAEnFzG,GACAA,EAAAD,EAAAuP,GACAkkC,kBAAA5nC,EAAAnF,IAAAsF,EAAA7J,KAAA6J,EAAAk1B,eAAAl1B,EAAAvD,aACA0C,KAAAU,EAAAnF,KACA6L,kBACA,KAMAmhC,CAAA1zC,EAAAuzC,EAAAtzC,GACA,SACA,IAAA0zC,EAAAJ,EAAAtmC,OAAAkxB,WAAAoV,EAAAvrC,QAAAurC,EAAAvrC,QAAA,GACA,GAAA2rC,IACAH,GAAAz1B,EAAA/R,EAAAk1B,eAAAl1B,EAAAvD,aAAAi8B,aAAAj4B,EAAAtK,QACA4b,EAAA4jB,UAAA6R,EAAA,IAAA/mC,EAAAtK,MAAAq/B,SAAA,CACA,GAAAvhC,EAAA,CACA,IAAAoN,EAAAkmC,EAAA7sC,IAAA+F,EAAArE,SAAAojC,EAAwD+G,EAAA,EAAQ/iC,MAChE,QAAAlS,EAAAk2C,EAAAp1C,OAAA,EAAyCd,GAAA,EAAQA,IACjDkuC,EAAuB+G,EAAA,EAAQrkC,KAAAslC,EAAAl2C,GAAAgC,OAAA,KAAAksC,IAC/BA,EAAmB+G,EAAA,EAAQrkC,KAAAlC,EAAA5M,KAAAosC,IAC3B,IAAAj8B,EAAAvP,EAAAuP,GAAAkH,KAAA,IAAuC67B,EAAA,EAAiBiB,EAAA7sC,IAAA,EAAA2G,EAAAkmC,EAAA7sC,IAAA2G,EAAA,IAAuCklC,EAAA,EAAK/G,EAAA,KAAAgI,EAAAp1C,QAAA,IACpGw1C,EAAAvmC,EAAA,EAAAmmC,EAAAp1C,OACgBiB,OAAAizC,EAAA,EAAAjzC,CAAOkQ,EAAA3C,IAAAgnC,IACvBrkC,EAAApE,KAAAyoC,GACA3zC,EAAAsP,EAAAgD,kBAEA,SAEA,IAAAshC,EAAmBrB,EAAA,EAAS5iC,SAAA2jC,EAAA,GAC5BzyB,EAAA+yB,KAAAvlC,MAAAixB,WAAAsU,EAAAtlC,KAAAyQ,EAAA8B,GAAuFzhB,OAAAizC,EAAA,EAAAjzC,CAAUyhB,GACjG,SAAA9B,MAAAu0B,EAAA1vC,MAGA,OAFA5D,GACAA,EAAAD,EAAAuP,GAAA2iC,KAAApxB,EAAA9B,GAAAzM,mBACA,EAEA,GAAAohC,GAAAjB,EAAAjmC,EAAA,aAAAimC,EAAA1mC,EAAA,QACA,IAAA8nC,EAAA9nC,EAAAw/B,KACA,KACAA,EAAAxmC,KAAA8uC,IACAA,EAAAxT,aAEAwT,IAAAhnC,UAEA,IAAAinC,EAAAtnC,EAAAunC,EAAA,EACA,MAAcD,EAAAzT,YAAwByT,IAAApnC,WACtCqnC,IACA,GAAAF,EAAA3V,WAAA2V,EAAArrC,WAAAqrC,EAAArrC,WAAAsrC,EAAA5lC,SAAA,CACA,GAAAlO,EAAA,CACA,IAAAoN,EAA0BklC,EAAA,EAAQ/iC,MAClC,QAAAlS,EAAAkuC,EAAAptC,OAAA,EAA6Cd,GAAA,EAAQA,IACrD+P,EAA0BklC,EAAA,EAAQrkC,KAAAs9B,EAAAluC,GAAA8B,KAAAiO,IAElCpN,EADAD,EAAAuP,GAAAkH,KAAA,IAA2C67B,EAAA,EAAiBiB,EAAA7sC,IAAA8kC,EAAAptC,OAAAm1C,EAAA7sC,IAAA+F,EAAArE,SAAAmrC,EAAA7sC,IAAAstC,EAAAT,EAAA7sC,IAAA+F,EAAArE,SAAA4rC,EAAA,IAAuHzB,EAAA,EAAKllC,EAAAm+B,EAAAptC,OAAA,UACxLmU,kBAEA,UAGA,SAEA,SAAA0hC,EAAAtB,GACA,gBAAA3yC,EAAAC,GACA,IAAAoM,EAAArM,EAAAmM,UAAAN,EAAA8mC,EAAA,EAAAtmC,EAAAiC,MAAAjC,EAAAkC,IACA1K,EAAAgI,EAAAhI,MACA,KAAAgI,EAAA9B,KAAAlG,GAAAw7B,UAAA,CACA,IAAAx7B,EACA,SACAA,IAEA,QAAAgI,EAAA9B,KAAAlG,GAAAy8B,cAEArgC,GACAA,EAAAD,EAAAuP,GAAAO,aAA2C0iC,EAAA,EAAalzC,OAAAU,EAAA4M,IAAA+lC,EAAA,EAAA9mC,EAAApH,MAAAZ,GAAAgI,EAAAwB,IAAAxJ,OACxD,IAMA,MAAAqwC,EAAAD,GAAA,GAIAE,EAAAF,EAAA,GAMA,SAAA5B,EAAAljB,EAAAtmB,EAAA,MACA,gBAAA7I,EAAAC,GACA,IAAAqO,MAAaA,EAAAC,OAAavO,EAAAmM,UAC1B2U,EAAAxS,EAAAixB,WAAAhxB,GAAA6lC,EAAAtzB,GAA+DzhB,OAAAizC,EAAA,EAAAjzC,CAAYyhB,EAAAqO,EAAAtmB,GAC3E,QAAAurC,IAEAn0C,GACAA,EAAAD,EAAAuP,GAAAi8B,KAAA1qB,EAAAszB,GAAA7hC,mBACA,IAOA,SAAA4/B,EAAAhjB,EAAAtmB,EAAA,MACA,gBAAA7I,EAAAC,GACA,IAAAiO,KAAaA,EAAA2B,MAAW7P,EAAAmM,UACxBkoC,GAAA,EAcA,OAbAr0C,EAAA4M,IAAAqsB,aAAA/qB,EAAA2B,EAAA,CAAA9F,EAAArD,KACA,GAAA2tC,EACA,SACA,GAAAtqC,EAAAu2B,cAAAv2B,EAAA02B,UAAAtR,EAAAtmB,GAEA,GAAAkB,EAAA5H,MAAAgtB,EACAklB,GAAA,MAEA,CACA,IAAAxoC,EAAA7L,EAAA4M,IAAAb,QAAArF,GAAAsB,EAAA6D,EAAA7D,QACAqsC,EAAAxoC,EAAAoB,OAAAy0B,eAAA15B,IAAA,EAAAmnB,QAGAklB,IAEAp0C,GACAA,EAAAD,EAAAuP,GAAA4iC,aAAAjkC,EAAA2B,EAAAsf,EAAAtmB,GAAA0J,mBACA,IA0BA,SAAA6/B,EAAA5L,EAAA39B,EAAA,MACA,gBAAA7I,EAAAC,GACA,IAAAuP,MAAaA,EAAA8kC,UAAArmC,UAAyBjO,EAAAmM,UACtC,GAAAqD,IAAA8kC,IA1BA,SAAA1nC,EAAAqB,EAAA9L,GACA,QAAA7E,EAAA,EAAmBA,EAAA2Q,EAAA7P,OAAmBd,IAAA,CACtC,IAAAgR,MAAaA,EAAAC,OAAaN,EAAA3Q,GAC1B81C,EAAA,GAAA9kC,EAAAzK,OAAA+I,EAAAzK,KAAAokC,eAAApkC,GAMA,GALAyK,EAAAqsB,aAAA3qB,EAAA5H,IAAA6H,EAAA7H,IAAAqD,IACA,GAAAqpC,EACA,SACAA,EAAArpC,EAAA01B,eAAA11B,EAAA5H,KAAAokC,eAAApkC,KAEAixC,EACA,SAEA,SAcAmB,CAAAv0C,EAAA4M,IAAAqB,EAAAu4B,GACA,SACA,GAAAvmC,EACA,GAAAq0C,EACA9N,EAAA1K,QAAA97B,EAAAw0C,aAAAF,EAAA53B,SACAzc,EAAAD,EAAAuP,GAAAklC,iBAAAjO,IAEAvmC,EAAAD,EAAAuP,GAAAmlC,cAAAlO,EAAAlnC,OAAAuJ,SAEA,CACA,IAAA8rC,GAAA,EAAAplC,EAAAvP,EAAAuP,GACA,QAAAjS,EAAA,GAA+Bq3C,GAAAr3C,EAAA2Q,EAAA7P,OAA2Bd,IAAA,CAC1D,IAAAgR,MAAyBA,EAAAC,OAAaN,EAAA3Q,GACtCq3C,EAAA30C,EAAA4M,IAAAm0B,aAAAzyB,EAAA5H,IAAA6H,EAAA7H,IAAA8/B,GAEA,QAAAlpC,EAAA,EAA+BA,EAAA2Q,EAAA7P,OAAmBd,IAAA,CAClD,IAAAgR,MAAyBA,EAAAC,OAAaN,EAAA3Q,GACtC,GAAAq3C,EACAplC,EAAAqlC,WAAAtmC,EAAA5H,IAAA6H,EAAA7H,IAAA8/B,OAEA,CACA,IAAAt4B,EAAAI,EAAA5H,IAAAmJ,EAAAtB,EAAA7H,IAAAjC,EAAA6J,EAAA5B,UAAAW,EAAAkB,EAAA1B,WACAgoC,EAAApwC,KAAA+0B,OAAA,OAAAz8B,KAAA0H,EAAA/L,MAAA,GAAA0F,OAAA,EACA02C,EAAAznC,KAAAmsB,OAAA,OAAAz8B,KAAAsQ,EAAA3U,MAAA,GAAA0F,OAAA,EACA8P,EAAA2mC,EAAAhlC,IACA3B,GAAA2mC,EACAhlC,GAAAilC,GAEAvlC,EAAAwlC,QAAA7mC,EAAA2B,EAAA22B,EAAAlnC,OAAAuJ,KAGA5I,EAAAsP,EAAAgD,kBAGA,UA0DA,SAAAy/B,KAAAgD,GACA,gBAAAh1C,EAAAC,EAAAR,GACA,QAAAnC,EAAA,EAAuBA,EAAA03C,EAAA52C,OAAqBd,IAC5C,GAAA03C,EAAA13C,GAAA0C,EAAAC,EAAAR,GACA,SACA,UAGA,IAAAw1C,EAAAjD,EAAAS,EAnoBA,CAAAzyC,EAAAC,EAAAR,KACA,IAAA60C,QAASA,GAAUt0C,EAAAmM,UACnB,IAAAmoC,IAAA70C,KAAAyT,eAAA,WAAAlT,GACAs0C,EAAAhX,aAAA,GACA,SACA,IAAAiW,EAAAV,EAAAyB,GAEA,IAAAf,EAAA,CACA,IAAAzyB,EAAAwzB,EAAA/U,aAAAvgB,EAAA8B,GAA4DzhB,OAAAizC,EAAA,EAAAjzC,CAAUyhB,GACtE,aAAA9B,IAEA/e,GACAA,EAAAD,EAAAuP,GAAA2iC,KAAApxB,EAAA9B,GAAAzM,mBACA,GAEA,IAAAvG,EAAAunC,EAAA1mC,WAEA,IAAAb,EAAA7J,KAAAmG,KAAAq2B,WAAA2U,EAAAtzC,EAAAuzC,EAAAtzC,GACA,SAGA,MAAAq0C,EAAArnC,OAAAkB,QAAAC,OACAskC,EAAA1mC,EAAA,QAAuCwmC,EAAA,EAAa0C,aAAAlpC,IAAA,CACpD,IAAAmpC,EAAsB91C,OAAAizC,EAAA,EAAAjzC,CAAWW,EAAA4M,IAAA0nC,EAAAtoC,SAAAsoC,EAAA7nC,QAA+C8lC,EAAA,EAAK/iC,OACrF,GAAA2lC,KAAA5qC,MAAA6D,KAAA+mC,EAAAtlC,GAAAslC,EAAAjnC,KAAA,CACA,GAAAjO,EAAA,CACA,IAAAsP,EAAAvP,EAAAuP,GAAAkH,KAAA0+B,GACA5lC,EAAAO,aAAA4iC,EAAA1mC,EAAA,OAA6DwmC,EAAA,EAAS5iC,SAAAL,EAAA3C,IAAAb,QAAAwD,EAAAf,QAAArP,IAAAo0C,EAAA7sC,KAAA,QAChD8rC,EAAA,EAAalzC,OAAAiQ,EAAA3C,IAAA2mC,EAAA7sC,IAAAsF,EAAA5D,WACnCnI,EAAAsP,EAAAgD,kBAEA,UAIA,SAAAvG,EAAAu0B,QAAAgT,EAAA1vC,OAAAywC,EAAAzwC,MAAA,IACA5D,GACAA,EAAAD,EAAAuP,GAAAmS,OAAA6xB,EAAA7sC,IAAAsF,EAAA5D,SAAAmrC,EAAA7sC,KAAA6L,kBACA,KAqBA,CAAAvS,EAAAC,EAAAR,KACA,IAAAyM,MAASA,EAAAsD,SAAexP,EAAAmM,UAAAonC,EAAArnC,EACxB,IAAAsD,EACA,SACA,GAAAtD,EAAAe,OAAAqzB,YAAA,CACA,GAAA7gC,KAAAyT,eAAA,WAAAlT,GAAAkM,EAAAoxB,aAAA,EACA,SACAiW,EAAAV,EAAA3mC,GAEA,IAAAnC,EAAAwpC,KAAA1mC,WACA,SAAA9C,IAAkByoC,EAAA,EAAa0C,aAAAnrC,KAE/B9J,GACAA,EAAAD,EAAAuP,GAAAO,aAAuC0iC,EAAA,EAAalzC,OAAAU,EAAA4M,IAAA2mC,EAAA7sC,IAAAqD,EAAA3B,WAAAmK,kBACpD,MA2jBA6iC,EAAApD,EAAAS,EAxiBA,CAAAzyC,EAAAC,EAAAR,KACA,IAAA60C,QAASA,GAAUt0C,EAAAmM,UACnB,IAAAmoC,IAAA70C,KAAAyT,eAAA,UAAAlT,GACAs0C,EAAAhX,aAAAgX,EAAArnC,OAAAkB,QAAAC,MACA,SACA,IAAAmlC,EAAAT,EAAAwB,GAEA,IAAAf,EACA,SACA,IAAA9mC,EAAA8mC,EAAA7mC,UAEA,GAAA4mC,EAAAtzC,EAAAuzC,EAAAtzC,GACA,SAGA,MAAAq0C,EAAArnC,OAAAkB,QAAAC,OACAskC,EAAAjmC,EAAA,UAAwC+lC,EAAA,EAAa0C,aAAAzoC,IAAA,CACrD,IAAA0oC,EAAsB91C,OAAAizC,EAAA,EAAAjzC,CAAWW,EAAA4M,IAAA0nC,EAAAtoC,SAAAsoC,EAAA7nC,QAA+C8lC,EAAA,EAAK/iC,OACrF,GAAA2lC,KAAA5qC,MAAA6D,KAAA+mC,EAAAtlC,GAAAslC,EAAAjnC,KAAA,CACA,GAAAjO,EAAA,CACA,IAAAsP,EAAAvP,EAAAuP,GAAAkH,KAAA0+B,GACA5lC,EAAAO,aAAA4iC,EAAAjmC,EAAA,SAA8D+lC,EAAA,EAAS5iC,SAAAL,EAAA3C,IAAAb,QAAAwD,EAAAf,QAAArP,IAAAo0C,EAAA7sC,MAAA,GACjD8rC,EAAA,EAAalzC,OAAAiQ,EAAA3C,IAAA2C,EAAAf,QAAArP,IAAAo0C,EAAA7sC,OACnCzG,EAAAsP,EAAAgD,kBAEA,UAIA,SAAA9F,EAAA8zB,QAAAgT,EAAA1vC,OAAAywC,EAAAzwC,MAAA,IACA5D,GACAA,EAAAD,EAAAuP,GAAAmS,OAAA6xB,EAAA7sC,IAAA6sC,EAAA7sC,IAAA+F,EAAArE,UAAAmK,kBACA,KAYA,CAAAvS,EAAAC,EAAAR,KACA,IAAAyM,MAASA,EAAAsD,SAAexP,EAAAmM,UAAAonC,EAAArnC,EACxB,IAAAsD,EACA,SACA,GAAAtD,EAAAe,OAAAqzB,YAAA,CACA,GAAA7gC,KAAAyT,eAAA,UAAAlT,GAAAkM,EAAAoxB,aAAApxB,EAAAe,OAAAkB,QAAAC,KACA,SACAmlC,EAAAT,EAAA5mC,GAEA,IAAAnC,EAAAwpC,KAAA7mC,UACA,SAAA3C,IAAkByoC,EAAA,EAAa0C,aAAAnrC,KAE/B9J,GACAA,EAAAD,EAAAuP,GAAAO,aAAuC0iC,EAAA,EAAalzC,OAAAU,EAAA4M,IAAA2mC,EAAA7sC,MAAA6L,kBACpD,MA2fA,MAAA8iC,GACA93B,MAAAy0B,EAhbA,CAAAhyC,EAAAC,KACA,IAAAiM,MAASA,EAAAM,WAAiBxM,EAAAmM,UAC1B,SAAAD,EAAAe,OAAA9K,KAAAmG,KAAA7K,OAAAyO,EAAAyzB,WAAAnzB,KAEAvM,GACAA,EAAAD,EAAAuP,GAAA+lC,WAAA,MAAA/iC,kBACA,KAiCA,CAAAvS,EAAAC,KACA,IAAAoM,EAAArM,EAAAmM,WAAAmC,MAAgCA,EAAAC,OAAalC,EAC7C,GAAAA,aAAuBmmC,EAAA,GAAYlkC,EAAArB,OAAAwyB,eAAAlxB,EAAAtB,OAAAwyB,cACnC,SACA,IAAAt9B,EAAA4wC,EAAAxkC,EAAAtB,OAAAi0B,eAAA3yB,EAAAwE,eACA,IAAA5Q,MAAAm+B,YACA,SACA,GAAArgC,EAAA,CACA,IAAA0yC,IAAArkC,EAAAgvB,cAAA/uB,EAAAvG,QAAAuG,EAAAtB,OAAAxE,WAAA6F,EAAAC,GAAA7H,IACA6I,EAAAvP,EAAAuP,GAAA2uB,OAAAyU,EAAAxwC,EAAAiN,iBACAG,EAAAO,aAAwB0iC,EAAA,EAAalzC,OAAAiQ,EAAA3C,IAAA+lC,EAAA,IACrC1yC,EAAAsP,EAAAgD,kBAEA,UAMA,CAAAvS,EAAAC,KACA,IAAAq0C,QAASA,GAAUt0C,EAAAmM,UACnB,IAAAmoC,KAAArnC,OAAAkB,QAAAC,KACA,SACA,GAAAkmC,EAAAzwC,MAAA,GAAAywC,EAAA7nC,SAAA6nC,EAAAjnC,KAAA,IACA,IAAArB,EAAAsoC,EAAAtoC,SACA,GAAY3M,OAAAizC,EAAA,EAAAjzC,CAAQW,EAAA4M,IAAAZ,GAGpB,OAFA/L,GACAA,EAAAD,EAAAuP,GAAArR,MAAA8N,GAAAuG,mBACA,EAGA,IAAAuO,EAAAwzB,EAAA/U,aAAAvgB,EAAA8B,GAAwDzhB,OAAAizC,EAAA,EAAAjzC,CAAUyhB,GAClE,aAAA9B,IAEA/e,GACAA,EAAAD,EAAAuP,GAAA2iC,KAAApxB,EAAA9B,GAAAzM,mBACA,IAqWA2gC,GACAqC,YAAAtD,EACAjgC,UAAAijC,EACA/iC,gBAAA+iC,EACAO,kBAAAP,EACA9iC,OAAAijC,EACAhjC,aAAAgjC,EACAK,QArSA,CAAAz1C,EAAAC,KACAA,GACAA,EAAAD,EAAAuP,GAAAO,aAAA,IAA2C0iC,EAAA,EAAYxyC,EAAA4M,QACvD,IA0SA8oC,GACAC,SAAAN,EAAA,UACAO,gBAAAP,EAAA,iBACAQ,SAAAR,EAAA,OACAS,qBAAAT,EAAA,cACAU,aAAAV,EAAA,cACAW,QAAAX,EAAA,cACAY,SAAA/B,EACAgC,SAAA/B,GAEA,QAAAx0C,KAAA01C,EACAK,EAAA/1C,GAAA01C,EAAA11C,GACA,MAQAoyC,GARA,oBAAAj1C,UAAA,qBAAAI,KAAAJ,UAAAK,YAEA,oBAAAg5C,QAAAh5C,WAAA,UAAAg5C,GAAAh5C,YAMAu4C,EAAAL,wBC5sBA,MAAAp0C,SAAOA,GAAcX,EAAQ,SAC7B81C,SACAA,EAAAt1C,OACAA,GACIR,EAAQ,QAKZ/H,EAAAC,cACAC,YAAA+J,GACAO,KAAAP,WAAAvB,EAGAxI,KAAAgF,EAAA44C,EAAAh0C,GACA,MAAAD,GAAAi0C,GAAA,IAAAt4B,MAAA,UACA,GAAAhb,KAAAP,QAAAf,UAAA,CACA,MAAAO,EAAAe,KAAAP,QAAAf,UAAAhE,EAAA2E,GACA,MAAAJ,OAAAvE,IACA4E,GAAA,EACA5E,EAAAuE,GAIA,OAAAI,EAMA,qBACAW,KAAAP,QAAA8zC,WACAx1C,EAAAsB,GAAA,GACA,MACAC,EAAA5E,EAAAqD,EAAArD,GAAA,IACA,kBAVA,eACA4E,EAAA5E,EAAAqD,EAAArD,GAAA,IACA,gBAWAhF,WAAA89C,GACA,uBAAAA,EAAA,kBAGA99C,KAAA0M,GACA,OAAAA,EAGA1M,QAAAC,EAAAskB,EAAAw5B,EAAAvzC,GACA,OAAAF,KAAAP,QAAAi0C,UACA,KACAz5B,EACA,QACAja,KAAAP,QAAAk0C,aACAzzC,EAAAi1B,KAAAse,GACA,KACA99C,EACA,MACAskB,EACA,MAGA,KAAAA,EAAA,IAAAtkB,EAAA,MAAAskB,EAAA,MAGAvkB,KACA,OAAAsK,KAAAP,QAAAm0C,MAAA,mBAGAl+C,KAAAgL,EAAAe,EAAAC,GACA,MAAAtC,EAAAqC,EAAA,UAEA,UAAArC,GADAqC,GAAA,IAAAC,EAAA,WAAAA,EAAA,QACA,MAAAhB,EAAA,KAAAtB,EAAA,MAGA1J,SAAAC,GACA,aAAAA,EAAA,UAGAD,SAAAmM,GACA,iBACAA,EAAA,kBACA,+BACA7B,KAAAP,QAAAm0C,MAAA,SACA,KAGAl+C,UAAAC,GACA,YAAAA,EAAA,SAGAD,MAAAwL,EAAAR,GAGA,OAFAA,MAAA,UAAAA,EAAA,YAEA,qBAEAQ,EACA,aACAR,EACA,aAGAhL,SAAA0V,GACA,eAAAA,EAAA,UAGA1V,UAAA0V,EAAAyoC,GACA,MAAAz0C,EAAAy0C,EAAA3yC,OAAA,UAIA,OAHA2yC,EAAAzyC,MACA,IAAAhC,EAAA,WAAAy0C,EAAAzyC,MAAA,KACA,IAAAhC,EAAA,KACAgM,EAAA,KAAAhM,EAAA,MAIA1J,OAAAC,GACA,iBAAAA,EAAA,YAGAD,GAAAC,GACA,aAAAA,EAAA,QAGAD,SAAAC,GACA,eAAAA,EAAA,UAGAD,KACA,OAAAsK,KAAAP,QAAAm0C,MAAA,eAGAl+C,IAAAC,GACA,cAAAA,EAAA,SAGAD,KAAAE,EAAAC,EAAAF,GAEA,WADAC,EAAAy9C,EAAArzC,KAAAP,QAAAq0C,SAAA9zC,KAAAP,QAAAs0C,QAAAn+C,IAEA,OAAAD,EAEA,IAAAsJ,EAAA,YAAAlB,EAAAnI,GAAA,IAKA,OAJAC,IACAoJ,GAAA,WAAApJ,EAAA,KAEAoJ,GAAA,IAAAtJ,EAAA,OAIAD,MAAAE,EAAAC,EAAAF,GAEA,WADAC,EAAAy9C,EAAArzC,KAAAP,QAAAq0C,SAAA9zC,KAAAP,QAAAs0C,QAAAn+C,IAEA,OAAAD,EAGA,IAAAsJ,EAAA,aAAArJ,EAAA,UAAAD,EAAA,IAKA,OAJAE,IACAoJ,GAAA,WAAApJ,EAAA,KAEAoJ,GAAAe,KAAAP,QAAAm0C,MAAA,SAIAl+C,KAAAC,GACA,OAAAA,0BCjKA,MAAAuI,SAAOA,GAAcX,EAAQ,SAC7Bg1B,MAAOA,GAAWh1B,EAAQ,SAC1By2C,MACAA,EAAAC,WACAA,EAAAl2C,OACAA,GACIR,EAAQ,QAKZ/H,EAAAC,cAAA6H,EACA5H,YAAA+J,GACAO,KAAArB,UACAqB,KAAArB,OAAAyB,MAAA9D,OAAAC,OAAA,MACAyD,KAAAP,WAAAvB,EACA8B,KAAAmnB,MAAAoL,EAAA2hB,OAEAl0C,KAAAP,QAAA00C,SACAn0C,KAAAmnB,MAAAoL,EAAA4hB,SACKn0C,KAAAP,QAAA20C,MACLp0C,KAAAmnB,MAAAoL,EAAA6hB,KAOAjtB,mBACA,OAAAoL,EAMA78B,WAAA0I,EAAAqB,GAEA,OADA,IAAAnC,EAAAmC,GACAZ,IAAAT,GAMA1I,IAAA0I,GAKA,OAJAA,IACAwO,QAAA,iBACAA,QAAA,cAEA5M,KAAAb,MAAAf,GAAA,GAMA1I,MAAA0I,EAAAgF,GAEA,IAAA7C,EACAqB,EACAyyC,EACAC,EACApwC,EACAuP,EACA8gC,EACAC,EACAC,EACA7G,EACArzC,EACA4e,EACAu7B,EACAC,EACAC,EACAC,EAEA,IAlBAz2C,IAAAwO,QAAA,aAkBAxO,GAYA,IAVAi2C,EAAAr0C,KAAAmnB,MAAA2tB,QAAA96C,KAAAoE,MACAA,IAAA0oB,UAAAutB,EAAA,GAAAh5C,QACAg5C,EAAA,GAAAh5C,OAAA,GACA2E,KAAArB,OAAAsD,MACA7C,KAAA,WAMAi1C,EAAAr0C,KAAAmnB,MAAAzsB,KAAAV,KAAAoE,GAAA,CACA,MAAA22C,EAAA/0C,KAAArB,OAAAqB,KAAArB,OAAAtD,OAAA,GACA+C,IAAA0oB,UAAAutB,EAAA,GAAAh5C,QAEA05C,GAAA,cAAAA,EAAA31C,KACA21C,EAAAp/C,MAAA,KAAA0+C,EAAA,GAAAW,aAEAX,IAAA,GAAAznC,QAAA,UAAqC,IACrC5M,KAAArB,OAAAsD,MACA7C,KAAA,OACA61C,eAAA,WACAt/C,KAAAqK,KAAAP,QAAA00C,SAEAE,EADAL,EAAAK,EAAA,cAQA,GAAAA,EAAAr0C,KAAAmnB,MAAA+tB,OAAAl7C,KAAAoE,GACAA,IAAA0oB,UAAAutB,EAAA,GAAAh5C,QACA2E,KAAArB,OAAAsD,MACA7C,KAAA,OACAC,KAAAg1C,EAAA,GAAAA,EAAA,GAAAjf,OAAAif,EAAA,GACA1+C,KAAA0+C,EAAA,cAMA,GAAAA,EAAAr0C,KAAAmnB,MAAAtmB,QAAA7G,KAAAoE,GACAA,IAAA0oB,UAAAutB,EAAA,GAAAh5C,QACA2E,KAAArB,OAAAsD,MACA7C,KAAA,UACA0B,MAAAuzC,EAAA,GAAAh5C,OACA1F,KAAA0+C,EAAA,UAMA,IAAAA,EAAAr0C,KAAAmnB,MAAAguB,QAAAn7C,KAAAoE,MACAqV,GACArU,KAAA,QACA8B,OAAA+yC,EAAAI,EAAA,GAAAznC,QAAA,oBACAxL,MAAAizC,EAAA,GAAAznC,QAAA,iBAAAzR,MAAA,UACAmG,MAAA+yC,EAAA,GAAAA,EAAA,GAAAznC,QAAA,UAAAzR,MAAA,WAGA+F,OAAA7F,SAAAoY,EAAArS,MAAA/F,OARA,CAWA,IAFA+C,IAAA0oB,UAAAutB,EAAA,GAAAh5C,QAEAd,EAAA,EAAqBA,EAAAkZ,EAAArS,MAAA/F,OAAuBd,IAC5C,YAAAJ,KAAAsZ,EAAArS,MAAA7G,IACAkZ,EAAArS,MAAA7G,GAAA,QACa,aAAAJ,KAAAsZ,EAAArS,MAAA7G,IACbkZ,EAAArS,MAAA7G,GAAA,SACa,YAAAJ,KAAAsZ,EAAArS,MAAA7G,IACbkZ,EAAArS,MAAA7G,GAAA,OAEAkZ,EAAArS,MAAA7G,GAAA,KAIA,IAAAA,EAAA,EAAqBA,EAAAkZ,EAAAnS,MAAAjG,OAAuBd,IAC5CkZ,EAAAnS,MAAA/G,GAAA05C,EAAAxgC,EAAAnS,MAAA/G,GAAAkZ,EAAAvS,OAAA7F,QAGA2E,KAAArB,OAAAsD,KAAAwR,QAOA,GAAA4gC,EAAAr0C,KAAAmnB,MAAAvmB,GAAA5G,KAAAoE,GACAA,IAAA0oB,UAAAutB,EAAA,GAAAh5C,QACA2E,KAAArB,OAAAsD,MACA7C,KAAA,YAMA,GAAAi1C,EAAAr0C,KAAAmnB,MAAA3lB,WAAAxH,KAAAoE,GACAA,IAAA0oB,UAAAutB,EAAA,GAAAh5C,QAEA2E,KAAArB,OAAAsD,MACA7C,KAAA,qBAGAi1C,IAAA,GAAAznC,QAAA,eAKA5M,KAAAb,MAAAk1C,EAAAjxC,GAEApD,KAAArB,OAAAsD,MACA7C,KAAA,wBAOA,GAAAi1C,EAAAr0C,KAAAmnB,MAAAxlB,KAAA3H,KAAAoE,GAAA,CAsBA,IArBAA,IAAA0oB,UAAAutB,EAAA,GAAAh5C,QAIAk5C,GACAn1C,KAAA,aACAqC,QAJAkzC,GADAL,EAAAD,EAAA,IACAh5C,OAAA,EAKAqG,MAAAizC,GAAAL,EAAA,GACA1yC,OAAA,GAGA5B,KAAArB,OAAAsD,KAAAsyC,GAKAC,KACAj0C,GAAA,EACAm0C,GAJAL,IAAA,GAAAr5B,MAAAhb,KAAAmnB,MAAA1T,OAIApY,OACAd,EAAA,EAEcA,EAAAm6C,EAAOn6C,IAKrBqzC,GAJAn6B,EAAA4gC,EAAA95C,IAIAc,SACAoY,IAAA7G,QAAA,0BAIAozB,QAAA,SACA4N,GAAAn6B,EAAApY,OACAoY,EAAAzT,KAAAP,QAAA00C,SAEA1gC,EAAA7G,QAAA,YAAqC,IADrC6G,EAAA7G,QAAA,IAAAwN,OAAA,QAA4CwzB,EAAA,IAAgB,WAM5DrzC,IAAAm6C,EAAA,IACAxwC,EAAAquB,EAAA6iB,OAAAp7C,KAAAq6C,EAAA95C,EAAA,QACA+5C,EAAAj5C,OAAA,MAAA6I,EAAA7I,OACA6I,EAAA7I,OAAA,GAAA2E,KAAAP,QAAA41C,YAAAnxC,IAAAowC,KACAl2C,EAAAi2C,EAAA7sC,MAAAjN,EAAA,GAAA6N,KAAA,MAAAhK,EACA7D,EAAAm6C,EAAA,IAOA9yC,EAAArB,GAAA,eAAApG,KAAAsZ,GACAlZ,IAAAm6C,EAAA,IACAn0C,EAAA,OAAAkT,EAAA6hC,OAAA7hC,EAAApY,OAAA,GACAuG,MAAArB,IAGAqB,IACA2yC,EAAA3yC,OAAA,GAKAizC,OAAAhhC,GADA+gC,EAAA,cAAAz6C,KAAAsZ,MAGAohC,EAAA,MAAAphC,EAAA,GACAA,IAAA7G,QAAA,oBAGA6nC,GACAr1C,KAAA,kBACA0C,KAAA8yC,EACA/yC,QAAAgzC,EACAjzC,SAGA4yC,EAAAvyC,KAAAwyC,GACAz0C,KAAArB,OAAAsD,KAAAwyC,GAGAz0C,KAAAb,MAAAsU,GAAA,GAEAzT,KAAArB,OAAAsD,MACA7C,KAAA,kBAIA,GAAAm1C,EAAA3yC,MAGA,IAFA8yC,EAAAF,EAAAn5C,OACAd,EAAA,EACgBA,EAAAm6C,EAAOn6C,IACvBi6C,EAAAj6C,GAAAqH,OAAA,EAIA5B,KAAArB,OAAAsD,MACA7C,KAAA,kBAOA,GAAAi1C,EAAAr0C,KAAAmnB,MAAA/kB,KAAApI,KAAAoE,GACAA,IAAA0oB,UAAAutB,EAAA,GAAAh5C,QACA2E,KAAArB,OAAAsD,MACA7C,KAAAY,KAAAP,QAAAq0C,SACA,YACA,OACArM,KAAAznC,KAAAP,QAAA81C,YACA,QAAAlB,EAAA,eAAAA,EAAA,cAAAA,EAAA,IACA1+C,KAAAqK,KAAAP,QAAAq0C,SAAA9zC,KAAAP,QAAA81C,UAAAv1C,KAAAP,QAAA81C,UAAAlB,EAAA,IAAAt2C,EAAAs2C,EAAA,IAAAA,EAAA,UAMA,GAAAjxC,IAAAixC,EAAAr0C,KAAAmnB,MAAAquB,IAAAx7C,KAAAoE,IACAA,IAAA0oB,UAAAutB,EAAA,GAAAh5C,QACAg5C,EAAA,KAAAA,EAAA,GAAAA,EAAA,GAAAvtB,UAAA,EAAAutB,EAAA,GAAAh5C,OAAA,IACA8d,EAAAk7B,EAAA,GAAAhvB,cAAAzY,QAAA,YACA5M,KAAArB,OAAAyB,MAAA+Y,KACAnZ,KAAArB,OAAAyB,MAAA+Y,IACAvjB,KAAAy+C,EAAA,GACAx+C,MAAAw+C,EAAA,UAOA,IAAAA,EAAAr0C,KAAAmnB,MAAA5lB,MAAAvH,KAAAoE,MACAqV,GACArU,KAAA,QACA8B,OAAA+yC,EAAAI,EAAA,GAAAznC,QAAA,oBACAxL,MAAAizC,EAAA,GAAAznC,QAAA,iBAAAzR,MAAA,UACAmG,MAAA+yC,EAAA,GAAAA,EAAA,GAAAznC,QAAA,UAAAzR,MAAA,WAGA+F,OAAA7F,SAAAoY,EAAArS,MAAA/F,OARA,CAWA,IAFA+C,IAAA0oB,UAAAutB,EAAA,GAAAh5C,QAEAd,EAAA,EAAqBA,EAAAkZ,EAAArS,MAAA/F,OAAuBd,IAC5C,YAAAJ,KAAAsZ,EAAArS,MAAA7G,IACAkZ,EAAArS,MAAA7G,GAAA,QACa,aAAAJ,KAAAsZ,EAAArS,MAAA7G,IACbkZ,EAAArS,MAAA7G,GAAA,SACa,YAAAJ,KAAAsZ,EAAArS,MAAA7G,IACbkZ,EAAArS,MAAA7G,GAAA,OAEAkZ,EAAArS,MAAA7G,GAAA,KAIA,IAAAA,EAAA,EAAqBA,EAAAkZ,EAAAnS,MAAAjG,OAAuBd,IAC5CkZ,EAAAnS,MAAA/G,GAAA05C,EACAxgC,EAAAnS,MAAA/G,GAAAqS,QAAA,uBACA6G,EAAAvS,OAAA7F,QAGA2E,KAAArB,OAAAsD,KAAAwR,QAOA,GAAA4gC,EAAAr0C,KAAAmnB,MAAAsuB,SAAAz7C,KAAAoE,GACAA,IAAA0oB,UAAAutB,EAAA,GAAAh5C,QACA2E,KAAArB,OAAAsD,MACA7C,KAAA,UACA0B,MAAA,MAAAuzC,EAAA,GAAAiB,OAAA,OACA3/C,KAAA0+C,EAAA,UAMA,GAAAjxC,IAAAixC,EAAAr0C,KAAAmnB,MAAA9kB,UAAArI,KAAAoE,IACAA,IAAA0oB,UAAAutB,EAAA,GAAAh5C,QACA2E,KAAArB,OAAAsD,MACA7C,KAAA,YACAzJ,KAAA,OAAA0+C,EAAA,GAAAiB,OAAAjB,EAAA,GAAAh5C,OAAA,GACAg5C,EAAA,GAAA7sC,MAAA,MACA6sC,EAAA,UAMA,GAAAA,EAAAr0C,KAAAmnB,MAAAxxB,KAAAqE,KAAAoE,GAEAA,IAAA0oB,UAAAutB,EAAA,GAAAh5C,QACA2E,KAAArB,OAAAsD,MACA7C,KAAA,OACAzJ,KAAA0+C,EAAA,UAKA,GAAAj2C,EACA,UAAA7C,MAAA,0BAAA6C,EAAAjB,WAAA,IAIA,OAAA6C,KAAArB,gCCpYC,WAGD,IAAA6mC,EA4BA,SAAA7nB,EAAA+3B,GAsBA,IArBA,IAKA1sB,EAEA+K,EACAqI,EAEAuZ,EAVAC,EAAA,EACAjyB,KAAAnc,MAAA/I,KAAAmf,WACArjB,EAAA,EACAgM,EAAAmvC,EAAAr6C,OACAD,EAAA,GAEAkE,GAAA,EAGAu2C,GAAA,EAEAC,EAAA,WAA8B,OAAAnyB,EAAAiyB,MAC9BG,EAAA,WAEA,IADA,IAAAC,EAAA,GACA,KAAA77C,KAAAu7C,EAAAn7C,KACAy7C,GAAAN,EAAAn7C,KACAyuB,EAAA0sB,EAAAn7C,GAEA,OAAAy7C,EAAA36C,OAAA,EAAA46C,SAAAD,GAAA,MAGUz7C,EAAAgM,IAAOhM,EAEjB,GADAyuB,EAAA0sB,EAAAn7C,GACA+E,EAeA,OAdAA,GAAA,EACA,KAAA0pB,GACA6sB,GAAA,EACA7sB,EAAA0sB,IAAAn7C,IAEA,KAAAyuB,GAAA,KAAA0sB,EAAAn7C,EAAA,IACAs7C,GAAA,EAEA7sB,EAAA0sB,EADAn7C,GAAA,IAIAs7C,GAAA,EAEAF,EAAAI,IACA/sB,GACA,QACA5tB,GAAA66C,SAAAH,IAAA,IAAAt3C,SAAA,GACA,MACA,QAEA,iBADAu1B,EAAA+hB,MACA/hB,aAAAv5B,OACAY,GAAA24B,EAEA34B,GAAAZ,OAAAC,aAAAw7C,SAAAliB,EAAA,KACA,MACA,QACA34B,GAAA66C,SAAAH,IAAA,IACA,MACA,QACA1Z,EAAA5hC,OAAA07C,WAAAJ,KAAAK,QAAAR,GAAA,IACAv6C,GAAAy6C,EAAAzZ,IAAAxvB,QAAA,SACA,MACA,QACAxR,GAAAwlB,KAAAC,UAAAi1B,KACA,MACA,QACA16C,GAAA,IAAA66C,SAAAH,IAAA,IAAAt3C,SAAA,GACA,MACA,QACApD,GAAA06C,IACA,MACA,QACA16C,GAAA,KAAA66C,SAAAH,IAAA,IAAAt3C,SAAA,IACA,MACA,QACApD,GAAA,KAAA66C,SAAAH,IAAA,IAAAt3C,SAAA,IAAA43C,cACA,MACA,QACAh7C,GAAA4tB,MAGO,MAAAA,EACP1pB,GAAA,EAEAlE,GAAA4tB,EAGA,OAAA5tB,GA1GAoqC,EAAAhwC,EAAAC,QAAAkoB,GASAA,SACA6nB,EAAA6Q,SAUA,SAAAX,EAAAY,GACA,OAAA34B,EAAAhG,MAAA,MAAA+9B,GAAAljC,OAAA8jC,KATA,oBAAA/zC,SAAA,mBAAAA,QAAAC,MACAgjC,EAAA+Q,OAGA,WACAh0C,QAAAC,IAAAmb,EAAAhG,MAAA,KAAAiG,cAxBC,wCCXDrgB,EAAAwL,EAAAgmC,EAAA,sBAAAyH,IAAAj5C,EAAAwL,EAAAgmC,EAAA,sBAAA0H,IAAAl5C,EAAAwL,EAAAgmC,EAAA,sBAAA2H,IAAAn5C,EAAAwL,EAAAgmC,EAAA,sBAAA4H,IAAAp5C,EAAAwL,EAAAgmC,EAAA,sBAAA6H,IAAAr5C,EAAAwL,EAAAgmC,EAAA,sBAAA8H,IAAAt5C,EAAAwL,EAAAgmC,EAAA,sBAAA+H,IAAAv5C,EAAAwL,EAAAgmC,EAAA,sBAAAgI,IAAA,IAAAC,EAAAz5C,EAAA,QAAA05C,EAAA15C,EAAA,QAGA,MAAA25C,EAAA56C,OAAAC,OAAA,YAKAs6C,EAMAnhD,YAKA+T,EAKAN,EAAA+B,GACAlL,KAAAyJ,UACAzJ,KAAAmJ,QACAnJ,KAAAkL,WAAA,IAAA4rC,EAAArtC,EAAA7E,IAAAuE,GAAAM,EAAA5E,IAAAsE,KAKA0E,aAAkB,OAAA7N,KAAAyJ,QAAA9F,IAIlBmK,WAAgB,OAAA9N,KAAAmJ,MAAAxF,IAIhBwH,WAAgB,OAAAnL,KAAAuL,MAAA5H,IAIhBmJ,SAAc,OAAA9M,KAAAwL,IAAA7H,IAId4H,YACA,OAAAvL,KAAAkL,OAAA,GAAAK,MAKAC,UACA,OAAAxL,KAAAkL,OAAA,GAAAM,IAKAiB,YACA,IAAAvB,EAAAlL,KAAAkL,OACA,QAAA3Q,EAAA,EAAuBA,EAAA2Q,EAAA7P,OAAmBd,IAC1C,GAAA2Q,EAAA3Q,GAAAgR,MAAA5H,KAAAuH,EAAA3Q,GAAAiR,IAAA7H,IACA,SACA,SAKAjO,UACA,OAAAsK,KAAAuL,MAAA1B,IAAArC,MAAAxH,KAAAmL,KAAAnL,KAAA8M,IAAA,GAMApX,QAAA8W,EAAApB,EAA0B4rC,EAAA,EAAKvqC,OAI/B,IAAA0qC,EAAA/rC,UAAArB,UAAAqtC,EAAA,KACA,QAAA78C,EAAA,EAAuBA,EAAA6Q,EAAAkuB,QAAqB/+B,IAC5C68C,EAAAD,EACAA,IAAAptC,UAEA,IAAA2C,EAAAF,EAAAG,MAAAtR,OAAA6P,EAAAlL,KAAAkL,OACA,QAAA3Q,EAAA,EAAuBA,EAAA2Q,EAAA7P,OAAmBd,IAAA,CAC1C,IAAAgR,MAAiBA,EAAAC,OAAaN,EAAA3Q,GAAAkR,EAAAe,EAAAf,QAAAjE,MAAAkF,GAC9BF,EAAA6qC,aAAA5rC,EAAArP,IAAAmP,EAAA5H,KAAA8H,EAAArP,IAAAoP,EAAA7H,KAAApJ,EAA8Ey8C,EAAA,EAAKvqC,MAAArB,GACnF,GAAA7Q,GACA+8C,EAAA9qC,EAAAE,GAAAyqC,IAAA7a,SAAA8a,KAAA7Z,cAAA,MAOA7nC,YAAA8W,EAAAxF,GACA,IAAA0F,EAAAF,EAAAG,MAAAtR,OAAA6P,EAAAlL,KAAAkL,OACA,QAAA3Q,EAAA,EAAuBA,EAAA2Q,EAAA7P,OAAmBd,IAAA,CAC1C,IAAAgR,MAAiBA,EAAAC,OAAaN,EAAA3Q,GAAAkR,EAAAe,EAAAf,QAAAjE,MAAAkF,GAC9BvB,EAAAM,EAAArP,IAAAmP,EAAA5H,KAAAmJ,EAAArB,EAAArP,IAAAoP,EAAA7H,KACApJ,EACAiS,EAAA+qC,YAAApsC,EAAA2B,IAGAN,EAAAgrC,iBAAArsC,EAAA2B,EAAA9F,GACAswC,EAAA9qC,EAAAE,EAAA1F,EAAAs1B,UAAA,OAWA5mC,gBAAAoT,EAAA/E,EAAA0zC,GAAA,GACA,IAAA9kC,EAAA7J,EAAAoB,OAAAwyB,cAAA,IAAAqa,EAAAjuC,GACA4uC,EAAA5uC,EAAA9B,KAAA,GAAA8B,EAAAoB,OAAApB,EAAAnF,IAAAmF,EAAA7D,QAAAlB,EAAA0zC,GACA,GAAA9kC,EACA,OAAAA,EACA,QAAA7R,EAAAgI,EAAAhI,MAAA,EAAwCA,GAAA,EAAYA,IAAA,CACpD,IAAAy0B,EAAAxxB,EAAA,EACA2zC,EAAA5uC,EAAA9B,KAAA,GAAA8B,EAAA9B,KAAAlG,GAAAgI,EAAAG,OAAAnI,EAAA,GAAAgI,EAAA7D,MAAAnE,GAAAiD,EAAA0zC,GACAC,EAAA5uC,EAAA9B,KAAA,GAAA8B,EAAA9B,KAAAlG,GAAAgI,EAAAY,MAAA5I,EAAA,GAAAgI,EAAA7D,MAAAnE,GAAA,EAAAiD,EAAA0zC,GACA,GAAAliB,EACA,OAAAA,EAEA,YAOA7/B,YAAAoT,EAAA6uC,EAAA,GACA,OAAA33C,KAAA6M,SAAA/D,EAAA6uC,IAAA33C,KAAA6M,SAAA/D,GAAA6uC,IAAA,IAAAnB,EAAA1tC,EAAA9B,KAAA,IAQAtR,eAAAmU,GACA,OAAA6tC,EAAA7tC,IAAA,YAAA2sC,EAAA3sC,GAMAnU,aAAAmU,GACA,OAAA6tC,EAAA7tC,MAAAuB,QAAAC,KAAAxB,EAAAnE,YAAA,QAAA8wC,EAAA3sC,GAMAnU,gBAAAmU,EAAAkE,GACA,IAAAA,MAAA3O,KACA,UAAAyE,WAAA,wCACA,IAAA+zC,EAAAV,EAAAnpC,EAAA3O,MACA,IAAAw4C,EACA,UAAA/zC,gCAAsDkK,EAAA3O,gBACtD,OAAAw4C,EAAA1f,SAAAruB,EAAAkE,GAQArY,cAAAmiD,EAAAC,GACA,GAAAD,KAAAX,EACA,UAAArzC,WAAA,sCAAAg0C,GAGA,OAFAX,EAAAW,GAAAC,EACAA,EAAAv5C,UAAA6P,OAAAypC,EACAC,EAWApiD,cACA,OAAAqhD,EAAAhrC,QAAA/L,KAAAyJ,QAAAzJ,KAAAmJ,OAAA4N,eAGA8/B,EAAAt4C,UAAA4P,SAAA,QAIA2oC,EAIAphD,YAIA6V,EAIAC,GACAxL,KAAAuL,QACAvL,KAAAwL,OAGA,IAAAusC,GAAA,EACA,SAAAC,EAAAlvC,GACAivC,GAAAjvC,EAAAoB,OAAAwyB,gBACAqb,GAAA,EACAx1C,QAAA,6EAAAuG,EAAAoB,OAAA9K,KAAAtE,KAAA,YASAi8C,UAAAF,EAIAnhD,YAAA+T,EAAAN,EAAAM,GACAuuC,EAAAvuC,GACAuuC,EAAA7uC,GACAmC,MAAA7B,EAAAN,GAMAooC,cAAmB,OAAAvxC,KAAAyJ,QAAA9F,KAAA3D,KAAAmJ,MAAAxF,IAAA3D,KAAAmJ,MAAA,KACnBzT,IAAAmU,EAAA4B,GACA,IAAAtC,EAAAU,EAAAb,QAAAyC,EAAArP,IAAA4D,KAAA8N,OACA,IAAA3E,EAAAe,OAAAwyB,cACA,OAAAma,EAAAxoC,KAAAlF,GACA,IAAAM,EAAAI,EAAAb,QAAAyC,EAAArP,IAAA4D,KAAA6N,SACA,WAAAkpC,EAAAttC,EAAAS,OAAAwyB,cAAAjzB,EAAAN,KAEAzT,QAAA8W,EAAApB,EAA0B4rC,EAAA,EAAKvqC,OAE/B,GADAnB,MAAAsB,QAAAJ,EAAApB,GACAA,GAAuB4rC,EAAA,EAAKvqC,MAAA,CAC5B,IAAAkN,EAAA3Z,KAAAuL,MAAA8wB,YAAAr8B,KAAAwL,KACAmO,GACAnN,EAAAyrC,YAAAt+B,IAGAjkB,GAAAkY,GACA,OAAAA,aAAAmpC,GAAAnpC,EAAAC,QAAA7N,KAAA6N,QAAAD,EAAAE,MAAA9N,KAAA8N,KAEApY,cACA,WAAAwiD,EAAAl4C,KAAA6N,OAAA7N,KAAA8N,MAEApY,SACA,OAAgB0J,KAAA,OAAAyO,OAAA7N,KAAA6N,OAAAC,KAAA9N,KAAA8N,MAKhBpY,gBAAAmU,EAAAkE,GACA,oBAAAA,EAAAF,QAAA,iBAAAE,EAAAD,KACA,UAAAjK,WAAA,4CACA,WAAAkzC,EAAAltC,EAAAb,QAAA+E,EAAAF,QAAAhE,EAAAb,QAAA+E,EAAAD,OAKApY,cAAAmU,EAAAgE,EAAAC,EAAAD,GACA,IAAApE,EAAAI,EAAAb,QAAA6E,GACA,WAAA7N,KAAAyJ,EAAAqE,GAAAD,EAAApE,EAAAI,EAAAb,QAAA8E,IAUApY,eAAA+T,EAAAN,EAAAwuC,GACA,IAAAQ,EAAA1uC,EAAA9F,IAAAwF,EAAAxF,IAGA,GAFAg0C,IAAAQ,IACAR,EAAAQ,GAAA,SACAhvC,EAAAe,OAAAwyB,cAAA,CACA,IAAAnH,EAAAshB,EAAAhqC,SAAA1D,EAAAwuC,GAAA,IAAAd,EAAAhqC,SAAA1D,GAAAwuC,GAAA,GACA,IAAApiB,EAGA,OAAAshB,EAAAxoC,KAAAlF,EAAAwuC,GAFAxuC,EAAAosB,EAAApsB,MAcA,OAVAM,EAAAS,OAAAwyB,gBACA,GAAAyb,EACA1uC,EAAAN,GAGAM,GAAAotC,EAAAhqC,SAAApD,GAAAkuC,GAAA,IAAAd,EAAAhqC,SAAApD,EAAAkuC,GAAA,IAAAluC,SACA9F,IAAAwF,EAAAxF,KAAAw0C,EAAA,IACA1uC,EAAAN,IAGA,IAAA4tC,EAAAttC,EAAAN,IAGA0tC,EAAAzoC,OAAA,OAAA2oC,SACAmB,EACAxiD,YAAAmY,EAAAC,GACA9N,KAAA6N,SACA7N,KAAA8N,OAEApY,IAAA+V,GACA,WAAAysC,EAAAzsC,EAAArP,IAAA4D,KAAA6N,QAAApC,EAAArP,IAAA4D,KAAA8N,OAEApY,QAAAmU,GACA,OAAAktC,EAAAhrC,QAAAlC,EAAAb,QAAAhJ,KAAA6N,QAAAhE,EAAAb,QAAAhJ,KAAA8N,cAUA4oC,UAAAG,EAKAnhD,YAAAoT,GACA,IAAA9B,EAAA8B,EAAAa,UAEA2B,MAAAxC,EADAA,EAAA9B,KAAA,GAAAgC,QAAAF,EAAAnF,IAAAqD,EAAA3B,WAEArF,KAAAgH,OAEAtR,IAAAmU,EAAA4B,GACA,IAAA2sC,QAAaA,EAAAz0C,OAAe8H,EAAA4sC,UAAAr4C,KAAA6N,QAC5B/E,EAAAe,EAAAb,QAAArF,GACA,OAAAy0C,EACAvB,EAAAxoC,KAAAvF,GACA,IAAA4tC,EAAA5tC,GAEApT,UACA,WAAmBshD,EAAA,EAAMA,EAAA,EAAQ7rC,KAAAnL,KAAAgH,MAAA,KAEjCtR,GAAAkY,GACA,OAAAA,aAAA8oC,GAAA9oC,EAAAC,QAAA7N,KAAA6N,OAEAnY,SACA,OAAgB0J,KAAA,OAAAyO,OAAA7N,KAAA6N,QAEhBnY,cAAmB,WAAA4iD,EAAAt4C,KAAA6N,QAInBnY,gBAAAmU,EAAAkE,GACA,oBAAAA,EAAAF,OACA,UAAAhK,WAAA,4CACA,WAAA6yC,EAAA7sC,EAAAb,QAAA+E,EAAAF,SAKAnY,cAAAmU,EAAAsB,GACA,WAAAurC,EAAA7sC,EAAAb,QAAAmC,IAMAzV,oBAAAsR,GACA,OAAAA,EAAAyvB,SAAA,IAAAzvB,EAAA5H,KAAAmG,KAAAgzC,YAGA7B,EAAAn4C,UAAA4P,SAAA,EACA0oC,EAAAzoC,OAAA,OAAAsoC,SACA4B,EACA5iD,YAAAmY,GACA7N,KAAA6N,SAEAnY,IAAA+V,GACA,IAAA2sC,QAAaA,EAAAz0C,OAAe8H,EAAA4sC,UAAAr4C,KAAA6N,QAC5B,OAAAuqC,EAAA,IAAAF,EAAAv0C,KAAA,IAAA20C,EAAA30C,GAEAjO,QAAAmU,GACA,IAAAf,EAAAe,EAAAb,QAAAhJ,KAAA6N,QAAA7G,EAAA8B,EAAAa,UACA,OAAA3C,GAAA0vC,EAAAvE,aAAAnrC,GACA,IAAA0vC,EAAA5tC,GACA+tC,EAAAxoC,KAAAvF,UASA0tC,UAAAK,EAIAnhD,YAAAmU,GACAyB,MAAAzB,EAAAb,QAAA,GAAAa,EAAAb,QAAAa,EAAAuB,QAAAC,OAEA3V,QAAA8W,EAAApB,EAA0B4rC,EAAA,EAAKvqC,OAC/B,GAAArB,GAAuB4rC,EAAA,EAAKvqC,MAAA,CAC5BD,EAAAmS,OAAA,EAAAnS,EAAA3C,IAAAuB,QAAAC,MACA,IAAA/B,EAAAutC,EAAA2B,QAAAhsC,EAAA3C,KACAP,EAAAiG,GAAA/C,EAAApD,YACAoD,EAAAO,aAAAzD,QAGAgC,MAAAsB,QAAAJ,EAAApB,GAGA1V,SAAc,OAAS0J,KAAA,OAIvB1J,gBAAAmU,GAA0B,WAAA2sC,EAAA3sC,GAC1BnU,IAAAmU,GAAc,WAAA2sC,EAAA3sC,GACdnU,GAAAkY,GAAe,OAAAA,aAAA4oC,EACf9gD,cAAmB,OAAA+iD,GAEnB5B,EAAAzoC,OAAA,MAAAooC,GACA,MAAAiC,GACA/iD,MAAW,OAAAsK,MACXgJ,QAAAa,GAAkB,IAAA2sC,EAAA3sC,IAMlB,SAAA6tC,EAAA7tC,EAAA7C,EAAArD,EAAAsB,EAAAlB,EAAApO,GAAA,GACA,GAAAqR,EAAA01B,cACA,OAAAqa,EAAAx6C,OAAAsN,EAAAlG,GACA,QAAApJ,EAAA0K,GAAAlB,EAAA,OAA2CA,EAAA,EAAAxJ,EAAAyM,EAAAtB,WAAAnL,GAAA,EAAwCA,GAAAwJ,EAAA,CACnF,IAAAqB,EAAA4B,EAAA5B,MAAA7K,GACA,GAAA6K,EAAAo4B,QAKA,IAAA7nC,GAAA+gD,EAAAvE,aAAA/sC,GACA,OAAAsxC,EAAAn6C,OAAAsN,EAAAlG,GAAAI,EAAA,EAAAqB,EAAAC,SAAA,QANA,CACA,IAAAsN,EAAA+kC,EAAA7tC,EAAAzE,EAAAzB,EAAAI,IAAA,EAAAqB,EAAAM,WAAA,EAAA3B,EAAApO,GACA,GAAAgd,EACA,OAAAA,EAKAhP,GAAAyB,EAAAC,SAAAtB,EAEA,YAEA,SAAAuzC,EAAA9qC,EAAAksC,EAAAf,GACA,IAAA9hC,EAAArJ,EAAAG,MAAAtR,OAAA,EACA,GAAAwa,EAAA6iC,EACA,OACA,IAGApuC,EAHAoJ,EAAAlH,EAAAG,MAAAkJ,IACAnC,aAA0BujC,EAAA,GAAWvjC,aAAoBujC,EAAA,KAEzDzqC,EAAAf,QAAA2H,KAAAyC,GACA1E,QAAA,CAAAgF,EAAAC,EAAAuiC,EAAAC,KAAkD,MAAAtuC,IAClDA,EAAAsuC,KACApsC,EAAAO,aAAA8pC,EAAAxoC,KAAA7B,EAAA3C,IAAAb,QAAAsB,GAAAqtC,KAGA,MAAAkB,EAAA,EAAAC,EAAA,EAAAC,EAAA,QAoBAC,UAA0B/B,EAAA,EAI1BvhD,YAAAuH,GACAqO,MAAArO,EAAA4M,KAEA7J,KAAAi5C,gBAAA,EAGAj5C,KAAAkH,QAAA,EAEAlH,KAAA/E,KAAAqB,OAAAC,OAAA,MACAyD,KAAAmY,KAAA+gC,KAAAC,MACAn5C,KAAAo5C,aAAAn8C,EAAAmM,UACApJ,KAAAyxC,YAAAx0C,EAAAw0C,YAQAroC,gBAKA,OAJApJ,KAAAi5C,gBAAAj5C,KAAA2M,MAAAtR,SACA2E,KAAAo5C,aAAAp5C,KAAAo5C,aAAAh9C,IAAA4D,KAAA6J,IAAA7J,KAAAyL,QAAAjE,MAAAxH,KAAAi5C,kBACAj5C,KAAAi5C,gBAAAj5C,KAAA2M,MAAAtR,QAEA2E,KAAAo5C,aAMA1jD,aAAA0T,GACA,GAAAA,EAAAmC,MAAA1B,KAAA7J,KAAA6J,IACA,UAAAhG,WAAA,uEAKA,OAJA7D,KAAAo5C,aAAAhwC,EACApJ,KAAAi5C,gBAAAj5C,KAAA2M,MAAAtR,OACA2E,KAAAkH,SAAAlH,KAAAkH,QAAA2xC,IAAAC,EACA94C,KAAAyxC,YAAA,KACAzxC,KAKAq5C,mBACA,OAAAr5C,KAAAkH,QAAA2xC,GAAA,EAKAnjD,eAAAikB,GAGA,OAFA3Z,KAAAyxC,YAAA93B,EACA3Z,KAAAkH,SAAA4xC,EACA94C,KAOAtK,YAAAikB,GAGA,OAFaq9B,EAAA,EAAI/d,QAAAj5B,KAAAyxC,aAAAzxC,KAAAoJ,UAAAmC,MAAAoO,YACjB3Z,KAAAs5C,eAAA3/B,GACA3Z,KAKAtK,cAAAkoC,GACA,OAAA59B,KAAAi4C,YAAAra,EAAAlF,SAAA14B,KAAAyxC,aAAAzxC,KAAAoJ,UAAAD,MAAAwQ,UAKAjkB,iBAAAkoC,GACA,OAAA59B,KAAAi4C,YAAAra,EAAA9E,cAAA94B,KAAAyxC,aAAAzxC,KAAAoJ,UAAAD,MAAAwQ,UAKA4/B,qBACA,OAAAv5C,KAAAkH,QAAA4xC,GAAA,EAKApjD,QAAAge,EAAA7J,GACAyB,MAAAkuC,QAAA9lC,EAAA7J,GACA7J,KAAAkH,QAAAlH,KAAAkH,SAAA4xC,EACA94C,KAAAyxC,YAAA,KAKA/7C,QAAAyiB,GAEA,OADAnY,KAAAmY,OACAnY,KAKAtK,iBAAA8R,GAEA,OADAxH,KAAAoJ,UAAAwD,QAAA5M,KAAAwH,GACAxH,KAOAtK,qBAAAsR,EAAAyyC,GAAA,GACA,IAAArwC,EAAApJ,KAAAoJ,UAIA,OAHAqwC,IACAzyC,IAAA42B,KAAA59B,KAAAyxC,cAAAroC,EAAAqD,MAAArD,EAAAmC,MAAAoO,QAAAvQ,EAAAmC,MAAA8wB,YAAAjzB,EAAAoC,MAA6IwrC,EAAA,EAAI7d,QACjJ/vB,EAAA8mC,YAAAlwC,KAAAgH,GACAhH,KAKAtK,kBAEA,OADAsK,KAAAoJ,UAAAwD,QAAA5M,MACAA,KAMAtK,WAAAC,EAAAwV,EAAA2B,GACA,IAAAtE,EAAAxI,KAAA6J,IAAAzK,KAAAoJ,OACA,SAAA2C,EACA,OAAAxV,EAEAqK,KAAAsa,qBAAA9R,EAAA7S,SAAA,GADAqK,KAAA0vC,kBAGA,CAIA,GAHA,MAAA5iC,IACAA,EAAA3B,GACA2B,EAAA,MAAAA,EAAA3B,EAAA2B,GACAnX,EACA,OAAAqK,KAAAu3C,YAAApsC,EAAA2B,GACA,IAAA6M,EAAA3Z,KAAAyxC,YACA,IAAA93B,EAAA,CACA,IAAApO,EAAAvL,KAAA6J,IAAAb,QAAAmC,GACAwO,EAAA7M,GAAA3B,EAAAI,EAAAoO,QAAApO,EAAA8wB,YAAAr8B,KAAA6J,IAAAb,QAAA8D,IAKA,OAHA9M,KAAAw3C,iBAAArsC,EAAA2B,EAAAtE,EAAA7S,OAAAgkB,IACA3Z,KAAAoJ,UAAAqD,OACAzM,KAAA+M,aAAA8pC,EAAAxoC,KAAArO,KAAAoJ,UAAAoC,MACAxL,MAOAtK,QAAAkH,EAAAkG,GAEA,OADA9C,KAAA/E,KAAA,iBAAA2B,WAAAkG,EACA9C,KAKAtK,QAAAkH,GACA,OAAAoD,KAAA/E,KAAA,iBAAA2B,WAMA88C,gBACA,QAAA1gB,KAAAh5B,KAAA/E,KACA,SACA,SAMAvF,iBAEA,OADAsK,KAAAkH,SAAA6xC,EACA/4C,KAKA25C,uBACA,OAAA35C,KAAAkH,QAAA6xC,GAAA,GAIA,SAAAvkB,EAAAxnB,EAAA0oB,GACA,OAAAA,GAAA1oB,IAAAwnB,KAAAkB,GAAA1oB,QAEA4sC,EACAlkD,YAAAoF,EAAA++C,EAAAnkB,GACA11B,KAAAlF,OACAkF,KAAA0X,KAAA8c,EAAAqlB,EAAAniC,KAAAge,GACA11B,KAAA2X,MAAA6c,EAAAqlB,EAAAliC,MAAA+d,IAGA,MAAAokB,GACA,IAAAF,EAAA,OACAliC,KAAAf,GAAsBA,EAAA9M,KAAA8M,EAAAnO,OAAAi8B,YAAAp4B,gBACtBsL,MAAAnL,GAAmBA,EAAA3C,MAEnB,IAAA+vC,EAAA,aACAliC,KAAA,CAAAf,EAAAqtB,IAAgCrtB,EAAAvN,WAAAytC,EAAA2B,QAAAxU,EAAAn6B,KAChC8N,MAAAnL,GAAmBA,EAAApD,YAEnB,IAAAwwC,EAAA,eACAliC,KAAAf,GAAsBA,EAAA86B,aAAA,KACtB95B,MAAA,CAAAnL,EAAAutC,EAAAC,EAAA/8C,IAAwCA,EAAAmM,UAAAmoC,QAAA/kC,EAAAilC,YAAA,OAExC,IAAAmI,EAAA,qBACAliC,KAAA,IAAgB,EAChBC,MAAA,CAAAnL,EAAA7F,IAAyB6F,EAAAmtC,iBAAAhzC,EAAA,EAAAA,WAKzBszC,EACAvkD,YAAA8S,EAAA6O,GACArX,KAAAwI,SACAxI,KAAAqX,WACArX,KAAAk6C,aAAA59C,OAAAC,OAAA,MACAyD,KAAAm6C,OAAAL,EAAAtyC,QACA6P,GACAA,EAAAlG,QAAAyiB,IACA,GAAA5zB,KAAAk6C,aAAAtmB,EAAAh3B,KACA,UAAAiH,WAAA,iDAAA+vB,EAAAh3B,IAAA,KACAoD,KAAAqX,QAAApV,KAAA2xB,GACA5zB,KAAAk6C,aAAAtmB,EAAAh3B,KAAAg3B,EACAA,EAAAruB,KAAAtI,OACA+C,KAAAm6C,OAAAl4C,KAAA,IAAA23C,EAAAhmB,EAAAh3B,IAAAg3B,EAAAruB,KAAAtI,MAAA22B,aAaA6iB,EAIA/gD,YAIAihB,GACA3W,KAAA2W,SAKAnO,aACA,OAAAxI,KAAA2W,OAAAnO,OAKA6O,cACA,OAAArX,KAAA2W,OAAAU,QAKA3hB,MAAA8W,GACA,OAAAxM,KAAAsY,iBAAA9L,GAAAvP,MAKAvH,kBAAA8W,EAAAm+B,GAAA,GACA,QAAApwC,EAAA,EAAuBA,EAAAyF,KAAA2W,OAAAU,QAAAhc,OAAgCd,IACvD,GAAAA,GAAAowC,EAAA,CACA,IAAA/W,EAAA5zB,KAAA2W,OAAAU,QAAA9c,GACA,GAAAq5B,EAAAruB,KAAA60C,oBAAAxmB,EAAAruB,KAAA60C,kBAAA37C,KAAAm1B,EAAApnB,EAAAxM,MACA,SAEA,SASAtK,iBAAA2kD,GACA,IAAAr6C,KAAAo6C,kBAAAC,GACA,OAAoBp9C,MAAA+C,KAAAs6C,iBACpB,IAAAC,GAAAF,GAAAG,EAAAx6C,KAAAy6C,WAAAJ,GAAAt1C,EAAA,KAIA,OAAe,CACf,IAAA21C,GAAA,EACA,QAAAngD,EAAA,EAA2BA,EAAAyF,KAAA2W,OAAAU,QAAAhc,OAAgCd,IAAA,CAC3D,IAAAq5B,EAAA5zB,KAAA2W,OAAAU,QAAA9c,GACA,GAAAq5B,EAAAruB,KAAAo1C,kBAAA,CACA,IAAAp0C,EAAAxB,IAAAxK,GAAAgM,EAAA,EAAAq0C,EAAA71C,IAAAxK,GAAA0C,MAAA+C,KACAwM,EAAAjG,EAAAg0C,EAAAl/C,QACAu4B,EAAAruB,KAAAo1C,kBAAAl8C,KAAAm1B,EAAArtB,EAAAg0C,EAAA/yC,MAAAjB,GAAAg0C,EAAAK,EAAAJ,GACA,GAAAhuC,GAAAguC,EAAAJ,kBAAA5tC,EAAAjS,GAAA,CAEA,GADAiS,EAAAyK,QAAA,sBAAAojC,IACAt1C,EAAA,CACAA,KACA,QAAA9D,EAAA,EAA2CA,EAAAjB,KAAA2W,OAAAU,QAAAhc,OAAgC4F,IAC3E8D,EAAA9C,KAAAhB,EAAA1G,GAAmD0C,MAAAu9C,EAAAj0C,EAAAg0C,EAAAl/C,SAAqC4B,MAAA+C,KAAAuG,EAAA,IAExFg0C,EAAAt4C,KAAAuK,GACAguC,IAAAC,WAAAjuC,GACAkuC,GAAA,EAEA31C,IACAA,EAAAxK,IAAmC0C,MAAAu9C,EAAAj0C,EAAAg0C,EAAAl/C,UAGnC,IAAAq/C,EACA,OAAwBz9C,MAAAu9C,EAAAF,aAAAC,IAMxB7kD,WAAA8W,GACA,IAAAA,EAAAvD,OAAAsG,GAAAvP,KAAA6J,KACA,UAAAhG,WAAA,qCACA,IAAAg3C,EAAA,IAAApE,EAAAz2C,KAAA2W,QAAAwjC,EAAAn6C,KAAA2W,OAAAwjC,OACA,QAAA5/C,EAAA,EAAuBA,EAAA4/C,EAAA9+C,OAAmBd,IAAA,CAC1C,IAAAugD,EAAAX,EAAA5/C,GACAsgD,EAAAC,EAAAhgD,MAAAggD,EAAAnjC,MAAAnL,EAAAxM,KAAA86C,EAAAhgD,MAAAkF,KAAA66C,GAEA,OAAAA,EAKAruC,SAAc,WAAAwsC,EAAAh5C,MAIdtK,cAAAihB,GACA,IAAAokC,EAAA,IAAAd,EAAAtjC,EAAA9M,IAAA8M,EAAA9M,IAAAzK,KAAAoJ,OAAAmO,EAAAnO,OAAAmO,EAAAU,SACA2sB,EAAA,IAAAyS,EAAAsE,GACA,QAAAxgD,EAAA,EAAuBA,EAAAwgD,EAAAZ,OAAA9+C,OAA2Bd,IAClDypC,EAAA+W,EAAAZ,OAAA5/C,GAAAO,MAAAigD,EAAAZ,OAAA5/C,GAAAmd,KAAAf,EAAAqtB,GACA,OAAAA,EAUAtuC,YAAAihB,GACA,IAAAokC,EAAA,IAAAd,EAAAj6C,KAAAwI,OAAAmO,EAAAU,SACA8iC,EAAAY,EAAAZ,OAAAnW,EAAA,IAAAyS,EAAAsE,GACA,QAAAxgD,EAAA,EAAuBA,EAAA4/C,EAAA9+C,OAAmBd,IAAA,CAC1C,IAAAO,EAAAq/C,EAAA5/C,GAAAO,KACAkpC,EAAAlpC,GAAAkF,KAAArF,eAAAG,GAAAkF,KAAAlF,GAAAq/C,EAAA5/C,GAAAmd,KAAAf,EAAAqtB,GAEA,OAAAA,EASAtuC,OAAAslD,GACA,IAAA5/C,GAAsByO,IAAA7J,KAAA6J,IAAAouB,SAAA7uB,UAAApJ,KAAAoJ,UAAA6uB,UAGtB,GAFAj4B,KAAAyxC,cACAr2C,EAAAq2C,YAAAzxC,KAAAyxC,YAAAr1C,IAAA0nB,KAAAmU,WACA+iB,GAAA,iBAAAA,EACA,QAAAx+C,KAAAw+C,EAAA,CACA,UAAAx+C,GAAA,aAAAA,EACA,UAAAqH,WAAA,sDACA,IAAA+vB,EAAAonB,EAAAx+C,GAAAS,EAAA22B,EAAAruB,KAAAtI,MACAA,KAAAg7B,SACA78B,EAAAoB,GAAAS,EAAAg7B,OAAAx5B,KAAAm1B,EAAA5zB,KAAA4zB,EAAAh3B,OAEA,OAAAxB,EASA1F,gBAAAihB,EAAA5I,EAAAitC,GACA,IAAAjtC,EACA,UAAAlK,WAAA,0CACA,IAAA8S,EAAAnO,OACA,UAAA3E,WAAA,0CACA,IAAAk3C,EAAA,IAAAd,EAAAtjC,EAAAnO,OAAAmO,EAAAU,SACA2sB,EAAA,IAAAyS,EAAAsE,GAyBA,OAxBAA,EAAAZ,OAAAhpC,QAAA2pC,IACA,UAAAA,EAAAhgD,KACAkpC,EAAAn6B,IAA+BmtC,EAAA,EAAI9e,SAAAvhB,EAAAnO,OAAAuF,EAAAlE,UAEnC,gBAAAixC,EAAAhgD,KACAkpC,EAAA56B,UAAAytC,EAAA3e,SAAA8L,EAAAn6B,IAAAkE,EAAA3E,gBAEA,kBAAA0xC,EAAAhgD,KACAiT,EAAA0jC,cACAzN,EAAAyN,YAAA1jC,EAAA0jC,YAAAr1C,IAAAua,EAAAnO,OAAAu2B,mBAEA,CACA,GAAAic,EACA,QAAAx+C,KAAAw+C,EAAA,CACA,IAAApnB,EAAAonB,EAAAx+C,GAAAS,EAAA22B,EAAAruB,KAAAtI,MACA,GAAA22B,EAAAh3B,KAAAk+C,EAAAhgD,MAAAmC,KAAAi7B,UACA57B,OAAAiC,UAAA5D,eAAA8D,KAAAsP,EAAAvR,GAEA,YADAwnC,EAAA8W,EAAAhgD,MAAAmC,EAAAi7B,SAAAz5B,KAAAm1B,EAAAjd,EAAA5I,EAAAvR,GAAAwnC,IAIAA,EAAA8W,EAAAhgD,MAAAggD,EAAApjC,KAAAf,EAAAqtB,MAGAA,SAoBA2S,EAIAjhD,YAIA6P,GACAvF,KAAAuF,OAIAvF,KAAA/D,SACAsJ,EAAAtJ,OA9BA,SAAAg/C,EAAAz8B,EAAAkX,EAAAzZ,GACA,QAAAzf,KAAAgiB,EAAA,CACA,IAAA0d,EAAA1d,EAAAhiB,GACA0/B,aAAAgf,SACAhf,IAAA1H,KAAAkB,GACA,mBAAAl5B,IACA0/B,EAAA+e,EAAA/e,EAAAxG,OACAzZ,EAAAzf,GAAA0/B,EAEA,OAAAjgB,EAsBAg/B,CAAA11C,EAAAtJ,MAAA+D,UAAA/D,OACA+D,KAAApD,IAAA2I,EAAA3I,IAAA2I,EAAA3I,QAAAu+C,EAAA,UAKAzlD,SAAAuH,GAAqB,OAAAA,EAAA+C,KAAApD,MAErB,MAAAuoB,EAAA7oB,OAAAC,OAAA,MACA,SAAA4+C,EAAArgD,GACA,OAAAA,KAAAqqB,EACArqB,EAAA,OAAAqqB,EAAArqB,IACAqqB,EAAArqB,GAAA,EACAA,EAAA,WAQA87C,EAIAlhD,YAAAoF,EAAA,OAA+BkF,KAAApD,IAAAu+C,EAAArgD,GAK/BpF,IAAAuH,GAAgB,OAAAA,EAAA0Z,OAAAujC,aAAAl6C,KAAApD,KAIhBlH,SAAAuH,GAAqB,OAAAA,EAAA+C,KAAApD,4CCp+BrBW,EAAAwL,EAAAgmC,EAAA,sBAAAqM,KAAA79C,EAAAwL,EAAAgmC,EAAA,sBAAAsM,KAAA99C,EAAAwL,EAAAgmC,EAAA,sBAAAuM,KAAA,IAAAC,EAAAh+C,EAAA,QAAAiyC,EAAAjyC,EAAA,QAAAi+C,EAAAj+C,EAAA,QAIA,MAAAk+C,EAAA,oBAAA1hD,oBAAA,KACA8P,EAAA,oBAAAyhB,kBAAA,KACAowB,EAAAD,KAAAxhD,WAAA,GACA0hD,EAAA,cAAA3hD,KAAA0hD,GACAE,EAAA,UAAA5hD,KAAA0hD,GACAG,EAAA,wCAAyC7hD,KAAA0hD,GACzCrhD,KAAAuhD,GAAAC,GAAAF,GACAG,EAAAF,EAAAtwB,SAAAywB,aAAAF,KAAA,GAAAF,KAAA,KACAK,GAAA3hD,GAAA,gBAAAF,KAAAuhD,GACAM,IAAA,iBAAAhiD,KAAA0hD,KAAA,SACA,MAAAO,GAAA5hD,GAAA,gBAAAL,KAAA0hD,GACA5hD,IAAAmiD,EACAC,EAAAD,KAAA,KACAE,GAAA9hD,KAAAohD,GAAA,iBAAAthD,KAAAshD,EAAAW,QAEAC,EAAAF,IAAA,cAAAhiD,KAAAuhD,MAAAD,KAAAa,eAAA,GACApiD,EAAAmiD,KAAAZ,GAAA,MAAAthD,KAAAshD,EAAArhD,UACAmiD,EAAA,aAAApiD,KAAAuhD,GACAc,IAAA3yC,GAAA,wBAAAA,EAAA4yC,gBAAAlhC,MACAmhC,EAAAF,IAAA,uBAAAxiD,KAAAD,UAAAE,aAAA,WAEA0iD,EAAA,SAAA31C,GACA,QAAA/B,EAAA,GAAwBA,IAExB,KADA+B,IAAAmjC,iBAEA,OAAAllC,GAGAwtB,EAAA,SAAAzrB,GACA,IAAAkD,EAAAlD,EAAA41C,cAAA51C,EAAAyrB,WACA,OAAAvoB,GAAA,IAAAA,EAAAkiB,SAAAliB,EAAA2yC,KAAA3yC,GAEA,IAAA4yC,EAAA,KAIA,MAAAC,EAAA,SAAA/1C,EAAAmE,EAAA2B,GACA,IAAAiR,EAAA++B,MAAAxxB,SAAA0xB,eAGA,OAFAj/B,EAAAk/B,OAAAj2C,EAAA,MAAA8F,EAAA9F,EAAAqlB,UAAAhxB,OAAAyR,GACAiR,EAAAm/B,SAAAl2C,EAAAmE,GAAA,GACA4S,GAKAo/B,EAAA,SAAAn2C,EAAAo2C,EAAAC,EAAAC,GACA,OAAAD,IAAAE,EAAAv2C,EAAAo2C,EAAAC,EAAAC,GAAA,IACAC,EAAAv2C,EAAAo2C,EAAAC,EAAAC,EAAA,KAEAE,EAAA,gCACA,SAAAD,EAAAv2C,EAAAo2C,EAAAC,EAAAC,EAAAv5C,GACA,OAAW,CACX,GAAAiD,GAAAq2C,GAAAD,GAAAE,EACA,SACA,GAAAF,IAAAr5C,EAAA,IAAAsB,EAAA2B,IAAA,CACA,IAAAkD,EAAAlD,EAAAyrB,WACA,IAAAvoB,GAAA,GAAAA,EAAAkiB,UAAAqxB,EAAAz2C,IAAAw2C,EAAArjD,KAAA6M,EAAA4kB,WACA,SAAA5kB,EAAA02C,gBACA,SACAN,EAAAT,EAAA31C,IAAAjD,EAAA,OACAiD,EAAAkD,MAEA,OAAAlD,EAAAolB,SAOA,SALA,aADAplB,IAAAykC,WAAA2R,GAAAr5C,EAAA,UACA25C,gBACA,SACAN,EAAAr5C,EAAA,EAAAsB,EAAA2B,GAAA,IAOA,SAAA3B,EAAA2B,GACA,UAAAA,EAAAolB,SAAAplB,EAAAqlB,UAAAhxB,OAAA2L,EAAAykC,WAAApwC,OAcA,SAAAoiD,EAAA/1C,GACA,IAAAmyC,EACA,QAAAnZ,EAAAh5B,EAAuBg5B,KACvBmZ,EAAAnZ,EAAAid,YAD4Bjd,IAAAjO,YAG5B,OAAAonB,KAAA7yC,MAAA6yC,EAAA7yC,KAAA2vB,UAAAkjB,EAAAnyC,QAAAmyC,EAAAxO,YAAA3jC,GAIA,MAAAk2C,EAAA,SAAAC,GACA,IAAAC,EAAAD,EAAAE,YAGA,OAFAD,GAAAhkD,GAAA+jD,EAAAG,aAAAH,EAAAI,WAAA,GAAAH,YACAA,GAAA,GACAA,GAEA,SAAAI,EAAArhD,EAAAD,GACA,IAAAnB,EAAA6vB,SAAA6yB,YAAA,SAIA,OAHA1iD,EAAA2iD,UAAA,iBACA3iD,EAAAoB,UACApB,EAAAmB,IAAAnB,EAAAf,KAAAkC,EACAnB,EAGA,SAAA4iD,EAAAx0C,GACA,OAAY1G,KAAA,EAAAE,MAAAwG,EAAA4yC,gBAAA6B,YACZl7C,IAAA,EAAAE,OAAAuG,EAAA4yC,gBAAA8B,cAEA,SAAAC,EAAA17C,EAAA8sC,GACA,uBAAA9sC,MAAA8sC,GAEA,SAAA6O,EAAAz3C,GACA,IAAAlC,EAAAkC,EAAA03C,wBAEAC,EAAA75C,EAAAtB,MAAAwD,EAAA43C,aAAA,EACAC,EAAA/5C,EAAArB,OAAAuD,EAAA83C,cAAA,EAEA,OAAY37C,KAAA2B,EAAA3B,KAAAE,MAAAyB,EAAA3B,KAAA6D,EAAAs3C,YAAAK,EACZv7C,IAAA0B,EAAA1B,IAAAE,OAAAwB,EAAA1B,IAAA4D,EAAAu3C,aAAAM,GAEA,SAAAE,EAAAriD,EAAAoI,EAAAk6C,GACA,IAAAC,EAAAviD,EAAAwiD,SAAA,sBAAAC,EAAAziD,EAAAwiD,SAAA,mBACAr1C,EAAAnN,EAAAgL,IAAAsjC,cACA,QAAA9gC,EAAA80C,GAAAtiD,EAAAgL,IACAwC,EAD4CA,EAAAuoB,EAAAvoB,GAAA,CAG5C,MAAAA,EAAAkiB,SACA,SACA,IAAApa,EAAA9H,EACAk1C,EAAAptC,GAAAnI,EAAAnJ,KACA2+C,EAAAD,EAAAf,EAAAx0C,GAAA40C,EAAAzsC,GACAstC,EAAA,EAAAC,EAAA,EASA,GARAz6C,EAAA1B,IAAAi8C,EAAAj8C,IAAAo7C,EAAAS,EAAA,OACAM,IAAAF,EAAAj8C,IAAA0B,EAAA1B,IAAAo7C,EAAAW,EAAA,QACAr6C,EAAAxB,OAAA+7C,EAAA/7C,OAAAk7C,EAAAS,EAAA,YACAM,EAAAz6C,EAAAxB,OAAA+7C,EAAA/7C,OAAAk7C,EAAAW,EAAA,WACAr6C,EAAA3B,KAAAk8C,EAAAl8C,KAAAq7C,EAAAS,EAAA,QACAK,IAAAD,EAAAl8C,KAAA2B,EAAA3B,KAAAq7C,EAAAW,EAAA,SACAr6C,EAAAzB,MAAAg8C,EAAAh8C,MAAAm7C,EAAAS,EAAA,WACAK,EAAAx6C,EAAAzB,MAAAg8C,EAAAh8C,MAAAm7C,EAAAW,EAAA,UACAG,GAAAC,EACA,GAAAH,EACAv1C,EAAA21C,YAAAC,SAAAH,EAAAC,OAEA,CACA,IAAAG,EAAA1tC,EAAA2tC,WAAAC,EAAA5tC,EAAA6tC,UACAN,IACAvtC,EAAA6tC,WAAAN,GACAD,IACAttC,EAAA2tC,YAAAL,GACA,IAAAQ,EAAA9tC,EAAA2tC,WAAAD,EAAAK,EAAA/tC,EAAA6tC,UAAAD,EACA96C,GAAwB3B,KAAA2B,EAAA3B,KAAA28C,EAAA18C,IAAA0B,EAAA1B,IAAA28C,EAAA18C,MAAAyB,EAAAzB,MAAAy8C,EAAAx8C,OAAAwB,EAAAxB,OAAAy8C,GAGxB,GAAAX,EACA,OAuBA,SAAAY,EAAAt4C,GACA,IAAA+Y,KAAA5W,EAAAnC,EAAAsjC,cACA,QAAAtK,EAAAh5B,EAAuBg5B,IACvBjgB,EAAAxe,MAAoByF,IAAAg5B,EAAAt9B,IAAAs9B,EAAAmf,UAAA18C,KAAAu9B,EAAAif,aACpBj4C,GAAAmC,GAF4B62B,EAAAjO,EAAAiO,IAK5B,OAAAjgB,EAQA,SAAAw/B,EAAAx/B,EAAAy/B,GACA,QAAA3lD,EAAA,EAAmBA,EAAAkmB,EAAAplB,OAAkBd,IAAA,CACrC,IAAAmN,IAAaA,EAAAtE,MAAAD,QAAiBsd,EAAAlmB,GAC9BmN,EAAAm4C,WAAAz8C,EAAA88C,IACAx4C,EAAAm4C,UAAAz8C,EAAA88C,GACAx4C,EAAAi4C,YAAAx8C,IACAuE,EAAAi4C,WAAAx8C,IAGA,IAAAg9C,EAAA,KAoBA,SAAAC,EAAAp5C,EAAAq5C,GACA,IAAAC,EAAAC,EAAAC,EAAA,IAAA35B,EAAA,EACA45B,EAAAJ,EAAAj9C,IAAAs9C,EAAAL,EAAAj9C,IACA,QAAAgC,EAAA4B,EAAA4C,WAAA+2C,EAAA,EAAqDv7C,EAAOA,IAAA+mB,YAAAw0B,IAAA,CAC5D,IAAAC,EACA,MAAAx7C,EAAAgnB,SACAw0B,EAAAx7C,EAAAy7C,qBACA,OAAAz7C,EAAAgnB,SAGA,SAFAw0B,EAAA7D,EAAA33C,GAAAy7C,iBAGA,QAAAtmD,EAAA,EAAuBA,EAAAqmD,EAAAvlD,OAAkBd,IAAA,CACzC,IAAAuK,EAAA87C,EAAArmD,GACA,GAAAuK,EAAA1B,KAAAq9C,GAAA37C,EAAAxB,QAAAo9C,EAAA,CACAD,EAAA97C,KAAAE,IAAAC,EAAAxB,OAAAm9C,GACAC,EAAA/7C,KAAAC,IAAAE,EAAA1B,IAAAs9C,GACA,IAAAI,EAAAh8C,EAAA3B,KAAAk9C,EAAAl9C,KAAA2B,EAAA3B,KAAAk9C,EAAAl9C,KACA2B,EAAAzB,MAAAg9C,EAAAl9C,KAAAk9C,EAAAl9C,KAAA2B,EAAAzB,MAAA,EACA,GAAAy9C,EAAAN,EAAA,CACAF,EAAAl7C,EACAo7C,EAAAM,EACAP,EAAAO,GAAA,GAAAR,EAAAl0B,UACAjpB,KAAA2B,EAAAzB,MAAAg9C,EAAAl9C,KAAA2B,EAAAzB,MAAAyB,EAAA3B,KACAC,IAAAi9C,EAAAj9C,KACqBi9C,EACrB,GAAAj7C,EAAAgnB,UAAA00B,IACAj6B,EAAA85B,GAAAN,EAAAl9C,OAAA2B,EAAA3B,KAAA2B,EAAAzB,OAAA,QACA,WAGAi9C,IAAAD,EAAAl9C,MAAA2B,EAAAzB,OAAAg9C,EAAAj9C,KAAA0B,EAAA1B,KACAi9C,EAAAl9C,MAAA2B,EAAA3B,MAAAk9C,EAAAj9C,KAAA0B,EAAAxB,UACAujB,EAAA85B,EAAA,IAGA,OAAAL,GAAA,GAAAA,EAAAl0B,SAMA,SAAAplB,EAAAq5C,GACA,IAAAU,EAAA/5C,EAAAqlB,UAAAhxB,OACA0iB,EAAAuN,SAAA0xB,cACA,QAAAziD,EAAA,EAAmBA,EAAAwmD,EAASxmD,IAAA,CAC5BwjB,EAAAk/B,OAAAj2C,EAAAzM,EAAA,GACAwjB,EAAAm/B,SAAAl2C,EAAAzM,GACA,IAAAuK,EAAAk8C,EAAAjjC,EAAA,GACA,GAAAjZ,EAAA1B,KAAA0B,EAAAxB,QAEA29C,EAAAZ,EAAAv7C,GACA,OAAoBkC,OAAA6f,OAAAtsB,GAAA8lD,EAAAl9C,OAAA2B,EAAA3B,KAAA2B,EAAAzB,OAAA,QAEpB,OAAY2D,OAAA6f,OAAA,GAjBZq6B,CAAAZ,EAAAC,IACAD,GAAAE,GAAA,GAAAF,EAAAl0B,UACgBplB,OAAA6f,UAChBu5B,EAAAE,EAAAC,GAgBA,SAAAU,EAAAZ,EAAAv7C,GACA,OAAAu7C,EAAAl9C,MAAA2B,EAAA3B,KAAA,GAAAk9C,EAAAl9C,MAAA2B,EAAAzB,MAAA,GACAg9C,EAAAj9C,KAAA0B,EAAA1B,IAAA,GAAAi9C,EAAAj9C,KAAA0B,EAAAxB,OAAA,EA+DA,SAAA69C,EAAAzkD,EAAA2jD,GACA,IAAAr5C,EAAA6C,EAAAnN,EAAAgL,IAAAsjC,cAAAnkB,EAAA,EACA,GAAAhd,EAAAu3C,uBACA,IACA,IAAAz9C,EAAAkG,EAAAu3C,uBAAAf,EAAAl9C,KAAAk9C,EAAAj9C,KACAO,KACkB09C,WAAAr6C,EAAA6f,UAA2BljB,GAE7C,MAAAq1B,IAEA,IAAAhyB,GAAA6C,EAAAy3C,oBAAA,CACA,IAAAvjC,EAAAlU,EAAAy3C,oBAAAjB,EAAAl9C,KAAAk9C,EAAAj9C,KACA2a,KACcwjC,eAAAv6C,EAAAw6C,YAAA36B,GAA4C9I,GAE1D,IAEApa,EAFAqO,GAAAtV,EAAAgkB,KAAA+gC,iBAAA/kD,EAAAgkB,KAAA7W,GACA43C,iBAAApB,EAAAl9C,KAAAk9C,EAAAj9C,KAEA,IAAA4O,IAAAtV,EAAAgL,IAAAsa,SAAA,GAAAhQ,EAAAoa,SAAApa,EAAAygB,WAAAzgB,GAAA,CACA,IAAA0vC,EAAAhlD,EAAAgL,IAAAg3C,wBACA,IAAAuC,EAAAZ,EAAAqB,GACA,YAEA,KADA1vC,EA1CA,SAAAyvC,EAAAnvB,EAAA+tB,EAAAqB,GACA,IAAAX,EAAAzuB,EAAAmZ,WAAApwC,OACA,GAAA0lD,GAAAW,EAAAt+C,IAAAs+C,EAAAp+C,OACA,QAAAq+C,EAAAh9C,KAAAE,IAAA,EAAAF,KAAAC,IAAAm8C,EAAA,EAAAp8C,KAAAssB,MAAA8vB,GAAAV,EAAAj9C,IAAAs+C,EAAAt+C,MAAAs+C,EAAAp+C,OAAAo+C,EAAAt+C,MAAA,IAAA7I,EAAAonD,IAA6I,CAC7I,IAAAv8C,EAAAktB,EAAAmZ,WAAAlxC,GACA,MAAA6K,EAAAgnB,SAAA,CACA,IAAAw0B,EAAAx7C,EAAAy7C,iBACA,QAAA5/C,EAAA,EAA+BA,EAAA2/C,EAAAvlD,OAAkB4F,IAAA,CACjD,IAAA6D,EAAA87C,EAAA3/C,GACA,GAAAggD,EAAAZ,EAAAv7C,GACA,OAAA28C,EAAAr8C,EAAAi7C,EAAAv7C,IAGA,IAAAvK,KAAA,GAAAwmD,IAAAY,EACA,MAGA,OAAArvB,EAyBAmvB,CAAA/kD,EAAAgL,IAAA24C,EAAAqB,IAEA,YAGA,GAAAvF,EACA,QAAAlxC,EAAA+G,EAAyBhL,GAAAiE,EAAWA,EAAAwnB,EAAAxnB,GACpCA,EAAAgO,YACAjS,OAAA6M,GAGA,GADA7B,EA7FA,SAAAtK,EAAA24C,GACA,IAAAn2C,EAAAxC,EAAA+qB,WACA,OAAAvoB,GAAA,QAAA/P,KAAA+P,EAAA0hB,WAAAy0B,EAAAl9C,KAAAuE,EAAAg3C,wBAAAv7C,KACA+G,EACAxC,EAyFAk6C,CAAA5vC,EAAAquC,GACAr5C,EAAA,CACA,GAAAg1C,GAAA,GAAAh1C,EAAAolB,WAGAvF,EAAAliB,KAAAC,IAAAiiB,EAAA7f,EAAAykC,WAAApwC,SAGA2L,EAAAykC,WAAApwC,OAAA,CACA,IAAAqmD,EAAAnhD,EAAAyG,EAAAykC,WAAA5kB,GACA,OAAAtmB,EAAAqrB,WAAA81B,EAAAnhD,EAAAm+C,yBAAAr7C,OAAAg9C,EAAAl9C,MACAu+C,EAAAp+C,OAAA+8C,EAAAj9C,KACAyjB,IAKA7f,GAAAtK,EAAAgL,KAAAmf,GAAA7f,EAAAykC,WAAApwC,OAAA,MAAA2L,EAAA+C,UAAAqiB,UACAi0B,EAAAj9C,IAAA4D,EAAA+C,UAAA20C,wBAAAp7C,OACAK,EAAAjH,EAAAO,MAAA4M,IAAAuB,QAAAC,KAIA,GAAAwb,GAAA,GAAA7f,EAAAolB,UAAA,MAAAplB,EAAAykC,WAAA5kB,EAAA,GAAA+E,WACAjoB,EAvGA,SAAAjH,EAAAsK,EAAA6f,EAAAw5B,GAOA,IAAAwB,GAAA,EACA,QAAAnhB,EAAA15B,EACA05B,GAAAhkC,EAAAgL,KADyB,CAGzB,IAAAmyC,EAAAn9C,EAAAolD,QAAAC,YAAArhB,GAAA,GACA,IAAAmZ,EACA,YACA,GAAAA,EAAA7yC,KAAA2vB,SAAAkjB,EAAA3vC,OAAA,CACA,IAAApF,EAAA+0C,EAAAnyC,IAAAg3C,wBACA,GAAA55C,EAAA3B,KAAAk9C,EAAAl9C,MAAA2B,EAAA1B,IAAAi9C,EAAAj9C,IACAy+C,EAAAhI,EAAAmI,cACA,MAAAl9C,EAAAzB,MAAAg9C,EAAAl9C,MAAA2B,EAAAxB,OAAA+8C,EAAAj9C,KAGA,MAFAy+C,EAAAhI,EAAAoI,UAIAvhB,EAAAmZ,EAAAnyC,IAAA+qB,WAEA,OAAAovB,GAAA,EAAAA,EAAAnlD,EAAAolD,QAAAI,WAAAl7C,EAAA6f,EAAA,GA8EAs7B,CAAAzlD,EAAAsK,EAAA6f,EAAAw5B,IAEA,MAAA18C,IACAA,EAlHA,SAAAjH,EAAAsV,EAAAquC,GACA,IAAAr5C,KAASA,EAAA6f,UAAeu5B,EAAApuC,EAAAquC,GAAA1I,GAAA,EACxB,MAAA3wC,EAAAolB,WAAAplB,EAAA4C,WAAA,CACA,IAAA9E,EAAAkC,EAAA03C,wBACA/G,EAAA7yC,EAAA3B,MAAA2B,EAAAzB,OAAAg9C,EAAAl9C,MAAA2B,EAAA3B,KAAA2B,EAAAzB,OAAA,OAEA,OAAA3G,EAAAolD,QAAAI,WAAAl7C,EAAA6f,EAAA8wB,GA4GAyK,CAAA1lD,EAAAsV,EAAAquC,IACA,IAAAxG,EAAAn9C,EAAAolD,QAAAC,YAAA/vC,GAAA,GACA,OAAYrO,MAAA0+C,OAAAxI,IAAAyI,WAAAzI,EAAA0I,QAAA,GAEZ,SAAAvB,EAAA/kC,EAAA07B,GACA,IAAAiJ,EAAA3kC,EAAA4kC,iBACA,OAAAD,EAAAvlD,OAAAulD,EAAAjJ,EAAA,IAAAiJ,EAAAvlD,OAAA,GAAA4gB,EAAAyiC,wBAEA,MAAA8D,EAAA,4CAGA,SAAAC,EAAA/lD,EAAAiH,EAAAisC,GACA,IAAA5oC,KAASA,EAAA6f,SAAAwc,QAAqB3mC,EAAAolD,QAAAY,WAAA/+C,EAAAisC,EAAA,QAC9B+S,EAAAnG,GAAAR,EACA,MAAAh1C,EAAAolB,SAAA,CAGA,IAAAu2B,IAAAH,EAAAroD,KAAA6M,EAAAqlB,aAAAujB,EAAA,EAAA/oB,KAAA7f,EAAAqlB,UAAAhxB,QAeA,CACA,IAAA8P,EAAA0b,EAAA/Z,EAAA+Z,EAAA+7B,EAAAhT,EAAA,OAeA,OAdAA,EAAA,IAAA/oB,GACA/Z,IACA81C,GAAA,GAEAhT,GAAA,GAAA/oB,GAAA7f,EAAAqlB,UAAAhxB,QACA8P,IACAy3C,EAAA,GAEAhT,EAAA,EACAzkC,IAGA2B,IAEA+1C,EAAA7B,EAAAjE,EAAA/1C,EAAAmE,EAAA2B,GAAA81C,KAAA,GA/BA,CACA,IAAA99C,EAAAk8C,EAAAjE,EAAA/1C,EAAA6f,KAAA+oB,GAIA,GAAAoM,GAAAn1B,GAAA,KAAA1sB,KAAA6M,EAAAqlB,UAAAxF,EAAA,KAAAA,EAAA7f,EAAAqlB,UAAAhxB,OAAA,CACA,IAAAynD,EAAA9B,EAAAjE,EAAA/1C,EAAA6f,EAAA,EAAAA,EAAA,OACA,GAAAi8B,EAAA1/C,KAAA0B,EAAA1B,IAAA,CACA,IAAA2/C,EAAA/B,EAAAjE,EAAA/1C,EAAA6f,IAAA,OACA,GAAAk8B,EAAA3/C,KAAA0B,EAAA1B,IACA,OAAAy/C,EAAAE,IAAA5/C,KAAA2/C,EAAA3/C,OAGA,OAAA2B,GAuBA,IAFApI,EAAAO,MAAA4M,IAAAb,QAAArF,GAAA0/B,GAAA,IAEAn5B,OAAAwyB,cAAA,CACA,SAAA2G,GAAAxc,IAAA+oB,EAAA,GAAA/oB,GAAAxhB,EAAA2B,IAAA,CACA,IAAAiC,EAAAjC,EAAAykC,WAAA5kB,EAAA,GACA,MAAA5d,EAAAmjB,SACA,OAAA42B,EAAA/5C,EAAAy1C,yBAAA,GAEA,SAAArb,GAAAxc,EAAAxhB,EAAA2B,GAAA,CACA,IAAA0C,EAAA1C,EAAAykC,WAAA5kB,GACA,MAAAnd,EAAA0iB,SACA,OAAA42B,EAAAt5C,EAAAg1C,yBAAA,GAEA,OAAAsE,EAAAh8C,EAAA03C,wBAAA9O,GAAA,GAGA,SAAAvM,GAAAxc,IAAA+oB,EAAA,GAAA/oB,GAAAxhB,EAAA2B,IAAA,CACA,IAAAiC,EAAAjC,EAAAykC,WAAA5kB,EAAA,GACA5K,EAAA,GAAAhT,EAAAmjB,SAAA2wB,EAAA9zC,EAAA5D,EAAA4D,IAAA05C,EAAA,MAGA,GAAA15C,EAAAmjB,UAAA,MAAAnjB,EAAA2iB,UAAA3iB,EAAAkjB,YAAA,KAAAljB,EACA,GAAAgT,EACA,OAAA4mC,EAAA7B,EAAA/kC,EAAA,OAEA,SAAAonB,GAAAxc,EAAAxhB,EAAA2B,GAAA,CACA,IAAA0C,EAAA1C,EAAAykC,WAAA5kB,GACA,KAAAnd,EAAAi0C,YAAAj0C,EAAAi0C,WAAAsF,iBACAv5C,IAAAyiB,YACA,IAAAlQ,EAAAvS,EAAA,GAAAA,EAAA0iB,SAAA2wB,EAAArzC,EAAA,EAAAi5C,EAAA,KACA,GAAAj5C,EAAA0iB,SAAA1iB,EAAA,KADA,KAEA,GAAAuS,EACA,OAAA4mC,EAAA7B,EAAA/kC,GAAA,OAGA,OAAA4mC,EAAA7B,EAAA,GAAAh6C,EAAAolB,SAAA2wB,EAAA/1C,MAAA4oC,MAAA,GAEA,SAAAiT,EAAA/9C,EAAA3B,GACA,MAAA2B,EAAAtB,MACA,OAAAsB,EACA,IAAA8e,EAAAzgB,EAAA2B,EAAA3B,KAAA2B,EAAAzB,MACA,OAAYD,IAAA0B,EAAA1B,IAAAE,OAAAwB,EAAAxB,OAAAH,KAAAygB,EAAAvgB,MAAAugB,GAEZ,SAAAo/B,EAAAl+C,EAAA1B,GACA,MAAA0B,EAAArB,OACA,OAAAqB,EACA,IAAAo+C,EAAA9/C,EAAA0B,EAAA1B,IAAA0B,EAAAxB,OACA,OAAYF,IAAA8/C,EAAA5/C,OAAA4/C,EAAA//C,KAAA2B,EAAA3B,KAAAE,MAAAyB,EAAAzB,OAEZ,SAAA8/C,EAAAzmD,EAAAO,EAAA+P,GACA,IAAAo2C,EAAA1mD,EAAAO,MAAA4kC,EAAAnlC,EAAAgkB,KAAA2iC,cACAD,GAAAnmD,GACAP,EAAA4mD,YAAArmD,GACA4kC,GAAAnlC,EAAAgL,KACAhL,EAAA6mD,QACA,IACA,OAAAv2C,IAEA,QACAo2C,GAAAnmD,GACAP,EAAA4mD,YAAAF,GACAvhB,GAAAnlC,EAAAgL,KAAAm6B,GACAA,EAAA0hB,SAwCA,MAAAC,EAAA,kBAgCA,IAAAC,EAAA,KACAC,EAAA,KACAC,IAAA,EACA,SAAAxzC,GAAAzT,EAAAO,EAAA8G,GACA,OAAA0/C,GAAAxmD,GAAAymD,GAAA3/C,EACA4/C,IACAF,EAAAxmD,EACAymD,EAAA3/C,EACA4/C,GAAA,MAAA5/C,GAAA,QAAAA,EA3EA,SAAArH,EAAAO,EAAA8G,GACA,IAAAuF,EAAArM,EAAAmM,UACAN,EAAA,MAAA/E,EAAAuF,EAAAiC,MAAAjC,EAAAkC,IACA,OAAA23C,EAAAzmD,EAAAO,EAAA,KACA,IAAa+J,KAAAU,GAAYhL,EAAAolD,QAAAY,WAAA55C,EAAAnF,IAAA,MAAAI,GAAA,KACzB,OAAe,CACf,IAAA6/C,EAAAlnD,EAAAolD,QAAAC,YAAAr6C,GAAA,GACA,IAAAk8C,EACA,MACA,GAAAA,EAAA58C,KAAA2vB,QAAA,CACAjvB,EAAAk8C,EAAAl8C,IACA,MAEAA,EAAAk8C,EAAAl8C,IAAA+qB,WAEA,IAAA4tB,EAAAoC,EAAA/lD,EAAAoM,EAAAnF,IAAA,GACA,QAAAyB,EAAAsC,EAAAkC,WAAwCxE,EAAOA,IAAA+mB,YAAA,CAC/C,IAAA03B,EACA,MAAAz+C,EAAAgnB,SACAy3B,EAAAz+C,EAAAy7C,qBACA,OAAAz7C,EAAAgnB,SAGA,SAFAy3B,EAAA9G,EAAA33C,EAAA,EAAAA,EAAAinB,UAAAhxB,QAAAwlD,iBAGA,QAAAtmD,EAAA,EAA2BA,EAAAspD,EAAAxoD,OAAkBd,IAAA,CAC7C,IAAAmnD,EAAAmC,EAAAtpD,GACA,GAAAmnD,EAAAp+C,OAAAo+C,EAAAt+C,IAAA,IACA,MAAAW,EAAAs8C,EAAAj9C,IAAAs+C,EAAAt+C,IAAA,GAAAs+C,EAAAp+C,OAAA+8C,EAAAj9C,KACAs+C,EAAAp+C,OAAA+8C,EAAA/8C,OAAA,GAAA+8C,EAAA/8C,OAAAo+C,EAAAt+C,MACA,UAGA,WA4CA0gD,CAAApnD,EAAAO,EAAA8G,GAxCA,SAAArH,EAAAO,EAAA8G,GACA,IAAAoF,MAASA,GAAQlM,EAAAmM,UACjB,IAAAD,EAAAe,OAAAqzB,YACA,SACA,IAAA1W,EAAA1d,EAAAoxB,aAAAie,GAAA3xB,EAAAupB,EAAAvpB,GAAA1d,EAAAe,OAAAkB,QAAAC,KACA/B,EAAA5M,EAAAqnD,eAGA,OAAAP,EAAArpD,KAAAgP,EAAAe,OAAA2oB,cAAAvpB,EAAA06C,OAEAb,EAAAzmD,EAAAO,EAAA,KAMA,IAAAgnD,EAAA36C,EAAA20C,WAAA,GAAAiG,EAAA56C,EAAA66C,UAAAC,EAAA96C,EAAA+6C,YACAC,EAAAh7C,EAAAi7C,eAEAj7C,EAAA06C,OAAA,OAAAjgD,EAAA,aACA,IACA3I,IADA+N,EAAArI,MAAApE,EAAAolD,QAAA0C,YAAAr7C,EAAAF,UAAAvM,EAAAgL,KACAsa,SAAA,GAAA1Y,EAAA66C,UAAA/3B,SAAA9iB,EAAA66C,UAAA76C,EAAA66C,UAAA1xB,aACAyxB,GAAA56C,EAAA66C,WAAAC,GAAA96C,EAAA+6C,YAMA,OAJA/6C,EAAAm7C,kBACAn7C,EAAA6wB,SAAA8pB,GACA,MAAAK,IACAh7C,EAAAi7C,eAAAD,GACAlpD,IAnBA,QAAA2I,GAAA,YAAAA,EAAAy0C,EAAApI,EAgCAsU,CAAAhoD,EAAAO,EAAA8G,IAeA,MAAA4gD,GAAA,EAAAC,GAAA,EAAAC,GAAA,EAAAC,GAAA,QAGAC,GACArvD,YAAAwU,EAAAsW,EAAA9Y,EAGA2jC,GACArrC,KAAAkK,SACAlK,KAAAwgB,WACAxgB,KAAA0H,MACA1H,KAAAqrC,aACArrC,KAAAglD,MAAAL,GAGAj9C,EAAAi2C,WAAA39C,KAIAtK,cAAAuvD,GAA2B,SAC3BvvD,YAAAkoC,GAAuB,SACvBloC,YAAAsR,EAAAk+C,EAAAC,GAA6C,SAC7CzvD,YAAAk2B,GAA2B,SAI3Bl2B,YAAiB,YAGjBA,UAAA+F,GAAsB,SAEtB4P,WACA,IAAAA,EAAA,EACA,QAAA9Q,EAAA,EAAuBA,EAAAyF,KAAAwgB,SAAAnlB,OAA0Bd,IACjD8Q,GAAArL,KAAAwgB,SAAAjmB,GAAA8Q,KACA,OAAAA,EAIAk3C,aAAkB,SAClB7sD,UACAsK,KAAAkK,YAAA2J,EACA7T,KAAA0H,IAAAi2C,YAAA39C,OACAA,KAAA0H,IAAAi2C,gBAAA9pC,GACA,QAAAtZ,EAAA,EAAuBA,EAAAyF,KAAAwgB,SAAAnlB,OAA0Bd,IACjDyF,KAAAwgB,SAAAjmB,GAAA6qD,UAEA1vD,eAAA0P,GACA,QAAA7K,EAAA,EAAAoJ,EAAA3D,KAAAsiD,YAA+C/nD,IAAA,CAC/C,IAAAmmC,EAAA1gC,KAAAwgB,SAAAjmB,GACA,GAAAmmC,GAAAt7B,EACA,OAAAzB,EACAA,GAAA+8B,EAAAr1B,MAGA22C,gBACA,OAAAhiD,KAAAkK,OAAAm7C,eAAArlD,MAEAsiD,iBACA,OAAAtiD,KAAAkK,OAAAlK,KAAAkK,OAAAm7C,eAAArlD,WAAAuiD,OAAA,EAEAN,eACA,OAAAjiD,KAAAgiD,UAAAhiD,KAAAqL,KAEAi6C,eACA,OAAAtlD,KAAAsiD,WAAAtiD,KAAAqL,KAAA,EAAArL,KAAAuiD,OAEA7sD,gBAAAgS,EAAAmf,EAAA8wB,GAGA,GAAA33C,KAAAqrC,YAAArrC,KAAAqrC,WAAArpB,SAAA,GAAAta,EAAA0kB,SAAA1kB,IAAA+qB,YAAA,CACA,GAAAklB,EAAA,GACA,IAAA4N,EAAA1L,EACA,GAAAnyC,GAAA1H,KAAAqrC,WACAka,EAAA79C,EAAA+jC,WAAA5kB,EAAA,OAEA,CACA,KAAAnf,EAAA+qB,YAAAzyB,KAAAqrC,YACA3jC,IAAA+qB,WACA8yB,EAAA79C,EAAAyiC,gBAEA,KAAAob,MAAA1L,EAAA0L,EAAA5H,aAAA9D,EAAA3vC,QAAAlK,OACAulD,IAAApb,gBACA,OAAAob,EAAAvlD,KAAAqlD,eAAAxL,KAAAxuC,KAAArL,KAAAsiD,WAEA,CACA,IAAAkD,EAAA3L,EACA,GAAAnyC,GAAA1H,KAAAqrC,WACAma,EAAA99C,EAAA+jC,WAAA5kB,OAEA,CACA,KAAAnf,EAAA+qB,YAAAzyB,KAAAqrC,YACA3jC,IAAA+qB,WACA+yB,EAAA99C,EAAAykB,YAEA,KAAAq5B,MAAA3L,EAAA2L,EAAA7H,aAAA9D,EAAA3vC,QAAAlK,OACAwlD,IAAAr5B,YACA,OAAAq5B,EAAAxlD,KAAAqlD,eAAAxL,GAAA75C,KAAAslD,UAMA,IAAAlV,EACA,GAAA1oC,GAAA1H,KAAA0H,KAAA1H,KAAAqrC,WACA+E,EAAAvpB,EAAA81B,EAAA38C,KAAAqrC,iBAEA,GAAArrC,KAAAqrC,YAAArrC,KAAAqrC,YAAArrC,KAAA0H,KAAA1H,KAAA0H,IAAAsa,SAAAhiB,KAAAqrC,YACA+E,EAAA,EAAA1oC,EAAAykC,wBAAAnsC,KAAAqrC,iBAEA,GAAArrC,KAAA0H,IAAAkC,WAAA,CACA,MAAAid,EACA,QAAA2a,EAAA95B,GAAuC85B,IAAA/O,WAAA,CACvC,GAAA+O,GAAAxhC,KAAA0H,IAAA,CACA0oC,GAAA,EACA,MAEA,GAAA5O,EAAA2I,gBACA,MAEA,SAAAiG,GAAAvpB,GAAAnf,EAAA+jC,WAAApwC,OACA,QAAAmmC,EAAA95B,GAAuC85B,IAAA/O,WAAA,CACvC,GAAA+O,GAAAxhC,KAAA0H,IAAA,CACA0oC,GAAA,EACA,MAEA,GAAA5O,EAAArV,YACA,OAGA,aAAAikB,EAAAuH,EAAA,EAAAvH,GAAApwC,KAAAslD,SAAAtlD,KAAAsiD,WAIA5sD,YAAAgS,EAAA+9C,GAAA,GACA,QAAA7uB,GAAA,EAAA8J,EAAAh5B,EAAyCg5B,EAAKA,IAAAjO,WAAA,CAC9C,IAAAizB,EAAA7L,EAAA75C,KAAA2lD,QAAAjlB,GACA,GAAAmZ,KAAA4L,GAAA5L,EAAA7yC,MAAA,CAEA,IAAA4vB,KAAA8uB,EAAA7L,EAAA6L,WACA,GAAAA,EAAAt5B,SAAAs5B,EAAA1jC,SAAA,GAAAta,EAAA0kB,SAAA1kB,IAAA+qB,YAAAizB,GAAAh+C,GAGA,OAAAmyC,EAFAjjB,GAAA,IAMAlhC,QAAAgS,GACA,IAAAmyC,EAAAnyC,EAAAi2C,WACA,QAAAjd,EAAAmZ,EAA4BnZ,EAAKA,IAAAx2B,OACjC,GAAAw2B,GAAA1gC,KACA,OAAA65C,EAEAnkD,WAAAgS,EAAAmf,EAAA8wB,GACA,QAAA5V,EAAAr6B,EAA4Bq6B,EAAMA,IAAAtP,WAAA,CAClC,IAAAonB,EAAA75C,KAAA2lD,QAAA5jB,GACA,GAAA8X,EACA,OAAAA,EAAA+L,gBAAAl+C,EAAAmf,EAAA8wB,GAEA,SAIAjiD,OAAAiO,GACA,QAAApJ,EAAA,EAAAssB,EAAA,EAAmCtsB,EAAAyF,KAAAwgB,SAAAnlB,OAA0Bd,IAAA,CAC7D,IAAA6K,EAAApF,KAAAwgB,SAAAjmB,GAAA+P,EAAAuc,EAAAzhB,EAAAiG,KACA,GAAAwb,GAAAljB,GAAA2G,GAAAuc,EAAA,CACA,MAAAzhB,EAAAm9C,QAAAn9C,EAAAob,SAAAnlB,QACA+J,IAAAob,SAAA,GACA,OAAApb,EAEA,GAAAzB,EAAA2G,EACA,OAAAlF,EAAAygD,OAAAliD,EAAAkjB,EAAAzhB,EAAAm9C,QACA17B,EAAAvc,GAGA5U,WAAAiO,EAAAisC,GACA,IAAA5vC,KAAAqrC,WACA,OAAoBrkC,KAAAhH,KAAA0H,IAAAmf,OAAA,EAAAwc,KAAA1/B,EAAA,GAEpB,IAaAgD,EAbApM,EAAA,EAAAssB,EAAA,EACA,QAAAjjB,EAAA,EAA4BrJ,EAAAyF,KAAAwgB,SAAAnlB,OAA0Bd,IAAA,CACtD,IAAA6K,EAAApF,KAAAwgB,SAAAjmB,GAAA+P,EAAA1G,EAAAwB,EAAAiG,KACA,GAAAf,EAAA3G,GAAAyB,aAAA0gD,GAAA,CACAj/B,EAAAljB,EAAAC,EACA,MAEAA,EAAA0G,EAGA,GAAAuc,EACA,OAAA7mB,KAAAwgB,SAAAjmB,GAAAmoD,WAAA77B,EAAA7mB,KAAAwgB,SAAAjmB,GAAAgoD,OAAA3S,GAEA,KAAsBr1C,KAAAoM,EAAA3G,KAAAwgB,SAAAjmB,EAAA,IAAA8Q,MAAA1E,aAAAo/C,IAAAp/C,EAAAipC,MAAA,EAA8Fr1C,KAEpH,GAAAq1C,GAAA,GACA,IAAAjpC,EAAAukC,GAAA,EACA,MACAvkC,EAAApM,EAAAyF,KAAAwgB,SAAAjmB,EAAA,UACAoM,EAAAe,IAAA+qB,YAAAzyB,KAAAqrC,WAFmB9wC,IAAA2wC,GAAA,GAKnB,OAAAvkC,GAAAipC,GAAA1E,IAAAvkC,EAAA47C,SAAA57C,EAAAq/C,QACAr/C,EAAA+7C,WAAA/7C,EAAA0E,KAAAukC,IACoB5oC,KAAAhH,KAAAqrC,WAAAxkB,OAAAlgB,EAAAg2C,EAAAh2C,EAAAe,KAAA,KAEpB,CACA,IAAAnH,EAAA2qC,GAAA,EACA,MACA3qC,EAAAhG,EAAAyF,KAAAwgB,SAAAnlB,OAAA2E,KAAAwgB,SAAAjmB,GAAA,OACAgG,EAAAmH,IAAA+qB,YAAAzyB,KAAAqrC,WAFmB9wC,IAAA2wC,GAAA,GAKnB,OAAA3qC,GAAA2qC,IAAA3qC,EAAAgiD,SAAAhiD,EAAAylD,QACAzlD,EAAAmiD,WAAA,EAAA9S,IACoB5oC,KAAAhH,KAAAqrC,WAAAxkB,OAAAtmB,EAAAo8C,EAAAp8C,EAAAmH,KAAA1H,KAAAqrC,WAAAI,WAAApwC,SAKpB3F,WAAAyV,EAAA2B,EAAAhX,EAAA,GACA,MAAAkK,KAAAwgB,SAAAnlB,OACA,OAAoB2L,KAAAhH,KAAAqrC,WAAAlgC,OAAA2B,KAAAm5C,WAAA,EAAAC,SAAAlmD,KAAAqrC,WAAAI,WAAApwC,QACpB,IAAA4qD,GAAA,EAAAC,GAAA,EACA,QAAAr/B,EAAA/wB,EAAAyE,EAAA,GAAuCA,IAAA,CACvC,IAAA6K,EAAApF,KAAAwgB,SAAAjmB,GAAA+P,EAAAuc,EAAAzhB,EAAAiG,KACA,OAAA46C,GAAA96C,GAAAb,EAAA,CACA,IAAA67C,EAAAt/B,EAAAzhB,EAAAm9C,OAEA,GAAAp3C,GAAAg7C,GAAAr5C,GAAAxC,EAAAlF,EAAAm9C,QAAAn9C,EAAA4B,MACA5B,EAAAimC,YAAArrC,KAAAqrC,WAAArpB,SAAA5c,EAAAimC,YACA,OAAAjmC,EAAAghD,WAAAj7C,EAAA2B,EAAAq5C,GACAh7C,EAAA0b,EACA,QAAA5lB,EAAA1G,EAA+B0G,EAAA,EAAOA,IAAA,CACtC,IAAA0F,EAAA3G,KAAAwgB,SAAAvf,EAAA,GACA,GAAA0F,EAAA0E,MAAA1E,EAAAe,IAAA+qB,YAAAzyB,KAAAqrC,aAAA1kC,EAAA0/C,aAAA,IACAJ,EAAAtJ,EAAAh2C,EAAAe,KAAA,EACA,MAEAyD,GAAAxE,EAAA0E,MAEA,GAAA46C,IACAA,EAAA,GAEA,GAAAA,GAAA,IAAA37C,EAAAwC,GAAAvS,GAAAyF,KAAAwgB,SAAAnlB,OAAA,IACAyR,EAAAxC,EACA,QAAArJ,EAAA1G,EAAA,EAAmC0G,EAAAjB,KAAAwgB,SAAAnlB,OAA0B4F,IAAA,CAC7D,IAAAV,EAAAP,KAAAwgB,SAAAvf,GACA,GAAAV,EAAA8K,MAAA9K,EAAAmH,IAAA+qB,YAAAzyB,KAAAqrC,aAAA9qC,EAAA8lD,cAAA,IACAH,EAAAvJ,EAAAp8C,EAAAmH,KACA,MAEAoF,GAAAvM,EAAA8K,MAEA,GAAA66C,IACAA,EAAAlmD,KAAAqrC,WAAAI,WAAApwC,QACA,MAEAwrB,EAAAvc,EAEA,OAAgBtD,KAAAhH,KAAAqrC,WAAAlgC,OAAA2B,KAAAm5C,aAAAC,YAEhBxwD,aAAAk6C,GACA,GAAA5vC,KAAAuiD,SAAAviD,KAAAqrC,aAAArrC,KAAAwgB,SAAAnlB,OACA,SACA,IAAA+J,EAAApF,KAAAwgB,SAAAovB,EAAA,IAAA5vC,KAAAwgB,SAAAnlB,OAAA,GACA,UAAA+J,EAAAiG,MAAAjG,EAAAihD,aAAAzW,GAEAl6C,YAAAiO,GACA,IAAAqD,KAAaA,EAAA6f,UAAe7mB,KAAA0iD,WAAA/+C,EAAA,GAC5B,MAAAqD,EAAAolB,UAAAvF,GAAA7f,EAAAykC,WAAApwC,OACA,UAAAwI,WAAA,qBAAAF,GACA,OAAAqD,EAAAykC,WAAA5kB,GAOAnxB,aAAAmY,EAAAC,EAAA4S,EAAA4lC,GAAA,GAEA,IAAAn7C,EAAAxG,KAAAC,IAAAiJ,EAAAC,GAAAhB,EAAAnI,KAAAE,IAAAgJ,EAAAC,GACA,QAAAvT,EAAA,EAAAssB,EAAA,EAAmCtsB,EAAAyF,KAAAwgB,SAAAnlB,OAA0Bd,IAAA,CAC7D,IAAA6K,EAAApF,KAAAwgB,SAAAjmB,GAAA+P,EAAAuc,EAAAzhB,EAAAiG,KACA,GAAAF,EAAA0b,GAAA/Z,EAAAxC,EACA,OAAAlF,EAAA2H,aAAAc,EAAAgZ,EAAAzhB,EAAAm9C,OAAAz0C,EAAA+Y,EAAAzhB,EAAAm9C,OAAA7hC,EAAA4lC,GACAz/B,EAAAvc,EAEA,IAAAi8C,EAAAvmD,KAAA0iD,WAAA70C,KAAA,KACA24C,EAAA14C,GAAAD,EAAA04C,EAAAvmD,KAAA0iD,WAAA50C,KAAA,KACA+vC,EAAAn9B,EAAA+lC,eACAC,GAAA,EAKA,IAAA1K,GAAAG,IAAAtuC,GAAAC,EAAA,CACA,IAAA9G,KAAiBA,EAAA6f,UAAe0/B,EAChC,MAAAv/C,EAAAolB,UAGA,IAFAs6B,KAAA7/B,GAAA,MAAA7f,EAAAqlB,UAAAxF,EAAA,MAEAA,GAAA7f,EAAAqlB,UAAAhxB,OACA,QAAAqO,EAAAq4B,EAAA/6B,EAAgD+6B,EAAMA,IAAAtP,WAAA,CACtD,GAAA/oB,EAAAq4B,EAAA5V,YAAA,CACA,MAAAziB,EAAAkiB,WACA26B,EAAAC,GAAuDx/C,KAAA0C,EAAA+oB,WAAA5L,OAAA81B,EAAAjzC,GAAA,IACvD,MAEA,IAAAmwC,EAAA9X,EAAA4b,WACA,GAAA9D,KAAA7yC,MAAA6yC,EAAA7yC,KAAA2vB,QACA,WAIA,CACA,IAAAhwB,EAAAK,EAAAykC,WAAA5kB,EAAA,GACA6/B,EAAA//C,IAAA,MAAAA,EAAAilB,UAAA,SAAAjlB,EAAA+2C,kBAKA,GAAA1B,GAAA6B,EAAAsG,WAAAtG,EAAAsG,WAAAqC,EAAAx/C,MAAA,GAAA62C,EAAAsG,UAAA/3B,SAAA,CACA,IAAA1iB,EAAAm0C,EAAAsG,UAAA1Y,WAAAoS,EAAAwG,aACA36C,GAAA,SAAAA,EAAAg0C,kBACA4I,GAAA,GAEA,KAAAA,GAAAI,GAAAvK,IACAgB,EAAAoJ,EAAAv/C,KAAAu/C,EAAA1/B,OAAAg3B,EAAA8I,WAAA9I,EAAA+I,eACAzJ,EAAAqJ,EAAAx/C,KAAAw/C,EAAA3/B,OAAAg3B,EAAAsG,UAAAtG,EAAAwG,aACA,OAIA,IAAAwC,GAAA,EACA,IAAAhJ,EAAAiJ,QAAAj5C,GAAAC,KAAA44C,EAAA,CACA7I,EAAAkJ,SAAAR,EAAAv/C,KAAAu/C,EAAA1/B,QACA,IACAhZ,GAAAC,GACA+vC,EAAAiJ,OAAAN,EAAAx/C,KAAAw/C,EAAA3/B,QACAggC,GAAA,EAEA,MAAA7nD,GAKA,KAAAA,aAAAgoD,cACA,MAAAhoD,GAIA,IAAA6nD,EAAA,CACA,GAAAh5C,EAAAC,EAAA,CACA,IAAAsuB,EAAAmqB,EACAA,EAAAC,EACAA,EAAApqB,EAEA,IAAAre,EAAAuN,SAAA0xB,cACAj/B,EAAAk/B,OAAAuJ,EAAAx/C,KAAAw/C,EAAA3/B,QACA9I,EAAAm/B,SAAAqJ,EAAAv/C,KAAAu/C,EAAA1/B,QACAg3B,EAAA4G,kBACA5G,EAAA1jB,SAAApc,IAGAroB,eAAAuxD,GACA,OAAAjnD,KAAAqrC,YAAA,aAAA4b,EAAA7nD,KAEA8nD,kBACA,OAAAlnD,KAAAqrC,YAAArrC,KAAAqrC,YAAArrC,KAAA0H,MAAA1H,KAAA0H,IAAAsa,SAAAhiB,KAAAqrC,YAIA31C,UAAAyV,EAAA2B,GACA,QAAA+Z,EAAA,EAAAtsB,EAAA,EAAmCA,EAAAyF,KAAAwgB,SAAAnlB,OAA0Bd,IAAA,CAC7D,IAAA6K,EAAApF,KAAAwgB,SAAAjmB,GAAA+P,EAAAuc,EAAAzhB,EAAAiG,KACA,GAAAwb,GAAAvc,EAAAa,GAAAb,GAAAwC,GAAA+Z,EAAA1b,EAAAb,GAAAwC,EAAA+Z,EAAA,CACA,IAAAsgC,EAAAtgC,EAAAzhB,EAAAm9C,OAAA6E,EAAA98C,EAAAlF,EAAAm9C,OACA,GAAAp3C,GAAAg8C,GAAAr6C,GAAAs6C,EAOA,OANApnD,KAAAglD,MAAA75C,GAAA0b,GAAA/Z,GAAAxC,EAAAu6C,GAAAD,QACAz5C,GAAAg8C,GAAAr6C,GAAAs6C,IACAhiD,EAAA8hD,aAAA9hD,EAAAsC,IAAA+qB,YAAAzyB,KAAAqrC,WAGAjmC,EAAAiiD,UAAAl8C,EAAAg8C,EAAAr6C,EAAAq6C,GAFA/hD,EAAA4/C,MAAAF,IAMA1/C,EAAA4/C,MAAA5/C,EAAAsC,KAAAtC,EAAAimC,YAAAjmC,EAAAsC,IAAA+qB,YAAAzyB,KAAAqrC,YAAAjmC,EAAAob,SAAAnlB,OACAypD,GAAAD,GAGAh+B,EAAAvc,EAEAtK,KAAAglD,MAAAH,GAEAnvD,mBACA,IAAAukB,EAAA,EACA,QAAAjT,EAAAhH,KAAAkK,OAAoClD,EAAMA,IAAAkD,OAAA+P,IAAA,CAC1C,IAAA+qC,EAAA,GAAA/qC,EAAA4qC,GAAAD,GACA59C,EAAAg+C,UACAh+C,EAAAg+C,UAGAgB,cAAmB,SACnB/C,sBAA2B,gBAI3B8C,WAAAhB,GACArvD,YAAAwU,EAAA+6C,EAAAvoD,EAAAiH,GACA,IAAA+xB,EAAAhuB,EAAAu9C,EAAA7lD,KAAAga,MAQA,GAPA,mBAAA1R,IACAA,IAAAhL,EAAA,IACAg5B,EAEAA,EAAAxrB,OACAwrB,EAAAxrB,OAAAm7C,eAAA3vB,QADA,EADA/xB,KAIAshD,EAAA7lD,KAAAmG,KAAAkuC,IAAA,CACA,MAAA/rC,EAAA0kB,SAAA,CACA,IAAAqc,EAAAnd,SAAAb,cAAA,QACAge,EAAA+B,YAAA9iC,GACAA,EAAA+gC,EAEA/gC,EAAAg2C,gBAAA,QACAh2C,EAAAsrB,UAAAnU,IAAA,sBAEAvT,MAAApB,KAAAxC,EAAA,MACA1H,KAAAilD,SACAjlD,KAAAilD,SACAvvB,EAAA11B,KAEAtK,cAAAuvD,GACA,OAAAjlD,KAAAglD,OAAAL,IAAAM,EAAA7lD,KAAAmQ,GAAAvP,KAAAilD,OAAA7lD,MAEA1J,YAAiB,OAASi1C,QAAA,GAC1Bj1C,UAAA+F,GACA,IAAA6rD,EAAAtnD,KAAAilD,OAAA1/C,KAAAgiD,UACA,QAAAD,KAAA7rD,GAEA/F,eAAAuxD,GACA,mBAAAA,EAAA7nD,MAAAY,KAAAilD,OAAA1/C,KAAAiiD,gBAEA9xD,UACAsK,KAAAilD,OAAA7lD,KAAAgmD,QAAAplD,KAAA0H,KACA4D,MAAA85C,UAEAY,cAAmB,SACnBpW,WAAgB,OAAA5vC,KAAAilD,OAAA7lD,KAAAwwC,YAEhB6X,WAAA1C,GACArvD,YAAAwU,EAAAxC,EAAAggD,EAAA/xD,GACA2V,MAAApB,KAAAxC,EAAA,MACA1H,KAAA0nD,UACA1nD,KAAArK,OAEA0V,WAAgB,OAAArL,KAAArK,KAAA0F,OAChB3F,gBAAAgS,EAAAmf,GACA,OAAAnf,GAAA1H,KAAA0nD,QACA1nD,KAAAsiD,YAAAz7B,EAAA7mB,KAAAqL,KAAA,GACArL,KAAAsiD,WAAAz7B,EAEAnxB,WAAAiO,GACA,OAAgBqD,KAAAhH,KAAA0nD,QAAA7gC,OAAAljB,GAEhBjO,eAAAiyD,GACA,wBAAAA,EAAAvoD,MAAAuoD,EAAA1rC,OAAAoQ,WAAAs7B,EAAAC,gBAQAC,WAAA9C,GACArvD,YAAAwU,EAAA0zB,EAAAl2B,EAAA2jC,GACA//B,MAAApB,KAAAxC,EAAA2jC,GACArrC,KAAA49B,OAEAloC,cAAAwU,EAAA0zB,EAAAz9B,EAAAzD,GACA,IAAAorD,EAAAprD,EAAAqrD,UAAAnqB,EAAAx+B,KAAAtE,MACAyK,EAAAuiD,KAAAlqB,EAAAlhC,EAAAyD,GAGA,OAFAoF,KAAAmC,MACAnC,EAAmBiqC,EAAA,EAAalC,WAAAhiB,SAAAsS,EAAAx+B,KAAAmG,KAAA6T,MAAAwkB,EAAAz9B,KAChC,IAAA0nD,GAAA39C,EAAA0zB,EAAAr4B,EAAAmC,IAAAnC,EAAA8lC,YAAA9lC,EAAAmC,KAEAhS,YACA,OAAAsK,KAAAglD,MAAAF,IAAA9kD,KAAA49B,KAAAx+B,KAAAmG,KAAAyiD,cACA,MACgBpqB,KAAA59B,KAAA49B,KAAAx+B,KAAAtE,KAAAgL,MAAA9F,KAAA49B,KAAA93B,MAAAwlC,eAAAtrC,KAAAqrC,iBAAAx3B,GAEhBne,YAAAkoC,GAAuB,OAAA59B,KAAAglD,OAAAF,IAAA9kD,KAAA49B,KAAAruB,GAAAquB,GACvBloC,UAAAyV,EAAA2B,GAGA,GAFAxB,MAAA+7C,UAAAl8C,EAAA2B,GAEA9M,KAAAglD,OAAAL,GAAA,CACA,IAAAz6C,EAAAlK,KAAAkK,OACA,MAAAA,EAAAlD,MACAkD,WACAA,EAAA86C,MAAAhlD,KAAAglD,QACA96C,EAAA86C,MAAAhlD,KAAAglD,OACAhlD,KAAAglD,MAAAL,IAGAjvD,MAAAyV,EAAA2B,EAAApQ,GACA,IAAAL,EAAAwrD,GAAAtrD,OAAAyD,KAAAkK,OAAAlK,KAAA49B,MAAA,EAAAlhC,GACAgM,EAAA1I,KAAAwgB,SAAAnV,EAAArL,KAAAqL,KACAyB,EAAAzB,IACA3C,EAAAu/C,GAAAv/C,EAAAoE,EAAAzB,EAAA3O,IACAyO,EAAA,IACAzC,EAAAu/C,GAAAv/C,EAAA,EAAAyC,EAAAzO,IACA,QAAAnC,EAAA,EAAuBA,EAAAmO,EAAArN,OAAkBd,IACzCmO,EAAAnO,GAAA2P,OAAA7N,EAEA,OADAA,EAAAmkB,SAAA9X,EACArM,SAMA6rD,WAAAnD,GACArvD,YAAAwU,EAAAlD,EAAAk+C,EAAAC,EAAAz9C,EAAA2jC,EAAAqa,EAAAhpD,EAAAiH,GACA2H,MAAApB,KAAAxC,EAAA2jC,GACArrC,KAAAgH,OACAhH,KAAAklD,YACAllD,KAAAmlD,YACAnlD,KAAA0lD,UACAra,GACArrC,KAAAmoD,eAAAzrD,EAAAiH,GAWAjO,cAAAwU,EAAAlD,EAAAk+C,EAAAC,EAAAzoD,EAAAiH,GACA,IAAAykD,EAAAN,EAAAprD,EAAAqrD,UAAA/gD,EAAA5H,KAAAtE,MACAyK,EAAAuiD,KAAA9gD,EAAAtK,EAAA,IAGA0rD,EAEAA,EAAAl+C,OACAk+C,EAAAl+C,OAAAm7C,eAAA+C,QADA,EADAzkD,EAGSuhD,EAAAC,GACTz9C,EAAAnC,KAAAmC,IAAA2jC,EAAA9lC,KAAA8lC,WACA,GAAArkC,EAAAyvB,OACA,GAAA/uB,GAEA,MAAAA,EAAA0kB,SACA,UAAAvoB,WAAA,iDAFA6D,EAAA4jB,SAAA2f,eAAAjkC,EAAArR,WAIA+R,KACcA,MAAA2jC,cAAqBmE,EAAA,EAAalC,WAAAhiB,SAAAtkB,EAAA5H,KAAAmG,KAAA6T,MAAApS,KAEhDqkC,GAAArkC,EAAAyvB,QAAA,MAAA/uB,EAAAkkB,WACAlkB,EAAAoT,aAAA,qBACApT,EAAAg2C,gBAAA,SACA12C,EAAA5H,KAAAmG,KAAA0T,YACAvR,EAAAuR,WAAA,IAEA,IAAAysC,EAAAh+C,EAEA,OADAA,EAAA2gD,GAAA3gD,EAAAw9C,EAAAl+C,GACAzB,EACA6iD,EAAA,IAAAE,GAAAp+C,EAAAlD,EAAAk+C,EAAAC,EAAAz9C,EAAA2jC,GAAA,KAAAqa,EAAAngD,EAAA7I,EAAAiH,EAAA,GACAqD,EAAAyvB,OACA,IAAA8xB,GAAAr+C,EAAAlD,EAAAk+C,EAAAC,EAAAz9C,EAAAg+C,EAAAhpD,GAEA,IAAAwrD,GAAAh+C,EAAAlD,EAAAk+C,EAAAC,EAAAz9C,EAAA2jC,GAAA,KAAAqa,EAAAhpD,EAAAiH,EAAA,GAEAjO,YAEA,GAAAsK,KAAAgH,KAAA5H,KAAAmG,KAAAyiD,cACA,YAKA,IAAAv+B,GAAoBziB,KAAAhH,KAAAgH,KAAA5H,KAAAtE,KAAAgL,MAAA9F,KAAAgH,KAAAlB,OAGpB,GAFA,OAAA9F,KAAAgH,KAAA5H,KAAAopD,aACA/+B,EAAA7P,mBAAA,QACA5Z,KAAAqrC,WAGA,GAAArrC,KAAAknD,YAGA,CAIA,QAAA3sD,EAAAyF,KAAAwgB,SAAAnlB,OAAA,EAAkDd,GAAA,EAAQA,IAAA,CAC1D,IAAA6K,EAAApF,KAAAwgB,SAAAjmB,GACA,GAAAyF,KAAA0H,IAAAsa,SAAA5c,EAAAsC,IAAA+qB,YAAA,CACAhJ,EAAA6hB,eAAAlmC,EAAAsC,IAAA+qB,WACA,OAGAhJ,EAAA6hB,iBACA7hB,EAAA2hB,WAAA,KAAwCoE,EAAA,EAAQ/iC,aAdhDgd,EAAA6hB,eAAAtrC,KAAAqrC,gBAHA5hB,EAAA2hB,WAAA,KAAAprC,KAAAgH,KAAAoE,SAmBA,OAAAqe,EAEA/zB,YAAAsR,EAAAk+C,EAAAC,GACA,OAAAnlD,KAAAglD,OAAAL,IAAA39C,EAAAuI,GAAAvP,KAAAgH,OACAyhD,GAAAvD,EAAAllD,KAAAklD,YAAAC,EAAA51C,GAAAvP,KAAAmlD,WAEA95C,WAAgB,OAAArL,KAAAgH,KAAA3B,SAChBk9C,aAAkB,OAAAviD,KAAAgH,KAAA0vB,OAAA,IAKlBhhC,eAAAgH,EAAAiH,GACA,IAAAxD,EAAAH,KAAAgH,KAAA01B,cAAA0gB,EAAAz5C,EACA+kD,EAAAhsD,EAAAisD,UAAA3oD,KAAA4oD,qBAAAlsD,EAAAiH,GAAA,KACAklD,EAAAH,KAAA/kD,KAAA,EAAA+kD,EAAA,KACAI,EAAAJ,KAAA/kD,IAAA,EACAolD,EAAA,IAAAC,GAAAhpD,KAAA6oD,KAAA7hD,OA2nBA,SAAAkD,EAAA++C,EAAAC,EAAAC,GACA,IAAAC,EAAAH,EAAAG,OAAAl/C,GAAA2c,EAAA,EAEA,MAAAuiC,EAAA/tD,OAAA,CACA,QAAAd,EAAA,EAAuBA,EAAA2P,EAAAxE,WAAuBnL,IAAA,CAC9C,IAAA6K,EAAA8E,EAAA9E,MAAA7K,GACA4uD,EAAA/jD,EAAAgkD,EAAAH,EAAAI,SAAAxiC,EAAAzhB,GAAA7K,GACAssB,GAAAzhB,EAAAC,SAEA,OAEA,IAAAikD,EAAA,EAAAznB,KAAA0nB,EAAA,KACA,QAAAC,EAAA,IAA8B,CAC9B,GAAAF,EAAAF,EAAA/tD,QAAA+tD,EAAAE,GAAAx8C,IAAA+Z,EAAA,CACA,IAAA4iC,EAAAxE,EAAAmE,EAAAE,KACA,KAAAA,EAAAF,EAAA/tD,QAAA+tD,EAAAE,GAAAx8C,IAAA+Z,IACA4iC,OAAAxE,KAAAhjD,KAAAmnD,EAAAE,MACA,GAAAG,EAAA,CACAA,EAAA73B,KAAA83B,IACA,QAAAnvD,EAAA,EAA+BA,EAAAkvD,EAAApuD,OAAoBd,IACnD2uD,EAAAO,EAAAlvD,GAAAivD,IAAAD,QAGAL,EAAAjE,EAAAuE,IAAAD,GAGA,IAAAnkD,EAAAH,EACA,GAAAskD,EACAtkD,GAAA,EACAG,EAAAmkD,EACAA,EAAA,SAEA,MAAAC,EAAAt/C,EAAAxE,YAKA,MAJAT,EAAAukD,EACApkD,EAAA8E,EAAA9E,MAAAokD,KAKA,QAAAjvD,EAAA,EAAuBA,EAAAsnC,EAAAxmC,OAAmBd,IAC1CsnC,EAAAtnC,GAAAuS,IAAA+Z,GACAgb,EAAAl3B,OAAApQ,IAAA,GACA,KAAA+uD,EAAAF,EAAA/tD,QAAA+tD,EAAAE,GAAAn+C,MAAA0b,GAAAuiC,EAAAE,GAAAx8C,GAAA+Z,GACAgb,EAAA5/B,KAAAmnD,EAAAE,MACA,IAAAh/C,EAAAuc,EAAAzhB,EAAAC,SACA,GAAAD,EAAAqxB,OAAA,CACA,IAAAkzB,EAAAr/C,EACAg/C,EAAAF,EAAA/tD,QAAA+tD,EAAAE,GAAAn+C,KAAAw+C,IACAA,EAAAP,EAAAE,GAAAn+C,MACA,QAAA5Q,EAAA,EAA2BA,EAAAsnC,EAAAxmC,OAAmBd,IAC9CsnC,EAAAtnC,GAAAuS,GAAA68C,IACAA,EAAA9nB,EAAAtnC,GAAAuS,IACA68C,EAAAr/C,IACAi/C,EAAAnkD,EAAA2xB,IAAA4yB,EAAA9iC,GACAzhB,IAAA2xB,IAAA,EAAA4yB,EAAA9iC,GACAvc,EAAAq/C,EACA1kD,GAAA,GAGA,IAAAigD,EAAA9/C,EAAAk3B,WAAAl3B,EAAAsxB,OAAAmL,EAAA72B,OAAAjC,MAAA5I,QAAA0hC,EAAAr6B,QACA2hD,EAAA/jD,EAAA8/C,EAAA+D,EAAAI,SAAAxiC,EAAAzhB,GAAAH,GACA4hB,EAAAvc,GAvrBAs/C,CAAA5pD,KAAAgH,KAAAhH,KAAAmlD,UAAA,CAAAF,EAAA1qD,EAAAsvD,KACA5E,EAAA1/C,KAAAoU,MACAovC,EAAAe,YAAA7E,EAAA1/C,KAAAoU,MAAAxZ,EAAAzD,GACAuoD,EAAA7lD,KAAAwwC,MAAA,IAAAia,GACAd,EAAAe,YAAAvvD,GAAAyF,KAAAgH,KAAAtB,WAAgE8pC,EAAA,EAAIrW,KAAAn5B,KAAAgH,KAAA5B,MAAA7K,GAAAof,MAAAxZ,EAAAzD,GAGpEqsD,EAAAgB,YAAA9E,EAAAvoD,EAAA0gD,IACS,CAAAh4C,EAAA8/C,EAAAC,EAAA5qD,KAIT,IAAAyvD,EAFAjB,EAAAe,YAAA1kD,EAAAuU,MAAAxZ,EAAAzD,GAGAqsD,EAAAkB,cAAA7kD,EAAA8/C,EAAAC,EAAA5qD,IACAuuD,GAAApsD,EAAAO,MAAAmM,UAAA+B,KAAAiyC,GACA1gD,EAAAO,MAAAmM,UAAA0D,GAAAswC,EAAAh4C,EAAAC,WACA2kD,EAAAjB,EAAAmB,mBAAAxB,EAAA1hD,QAAA,GACA+hD,EAAAoB,aAAA/kD,EAAA8/C,EAAAC,EAAA6E,EAAAttD,IACAqsD,EAAAqB,eAAAhlD,EAAA8/C,EAAAC,EAAAzoD,EAAAnC,IAGAwuD,EAAA1uB,QAAAj1B,EAAA8/C,EAAAC,EAAAzoD,EAAA0gD,GAEAA,GAAAh4C,EAAAC,WAGA0jD,EAAAe,eAAA3pD,EAAAzD,GACAsD,KAAAgH,KAAAu2B,aACAwrB,EAAAsB,oBACAtB,EAAAuB,eAEAvB,EAAAwB,SAAAvqD,KAAAglD,OAAAH,MAEAgE,GACA7oD,KAAAwqD,wBAAA9tD,EAAAmsD,GAqNA,SAAA4B,EAAAC,EAAAC,EAAAjuD,GACA,IAAAgL,EAAAgjD,EAAA9gD,WAAAghD,GAAA,EACA,QAAArwD,EAAA,EAAmBA,EAAAowD,EAAAtvD,OAAkBd,IAAA,CACrC,IAAAs/C,EAAA8Q,EAAApwD,GAAAswD,EAAAhR,EAAAnyC,IACA,GAAAmjD,EAAAp4B,YAAAi4B,EAAA,CACA,KAAAG,GAAAnjD,GACAA,EAAAojD,GAAApjD,GACAkjD,GAAA,EAEAljD,IAAAykB,iBAGAy+B,GAAA,EACAF,EAAAK,aAAAF,EAAAnjD,GAEA,GAAAmyC,aAAAgO,GAAA,CACA,IAAAlkD,EAAA+D,IAAAyiC,gBAAAugB,EAAA3gD,UACA0gD,EAAA5Q,EAAAxO,WAAAwO,EAAAr5B,SAAA9jB,GACAgL,EAAA/D,IAAAwoB,YAAAu+B,EAAA9gD,YAGA,KAAAlC,GACAA,EAAAojD,GAAApjD,GACAkjD,GAAA,EAEAA,GAAAluD,EAAAsuD,aAAAN,IACAhuD,EAAAsuD,YAAA,MA9OAP,CAAAzqD,KAAAqrC,WAAArrC,KAAAwgB,SAAA9jB,GACA2/C,GAwpBA,SAAA30C,GACA,SAAAA,EAAAkkB,UAAA,MAAAlkB,EAAAkkB,SAAA,CACA,IAAAq/B,EAAAvjD,EAAA6T,MAAA2vC,QACAxjD,EAAA6T,MAAA2vC,QAAAD,EAAA,kCACAvuC,OAAAyuC,iBAAAzjD,GAAA0jD,UACA1jD,EAAA6T,MAAA2vC,QAAAD,GA5pBAI,CAAArrD,KAAA0H,MAGAhS,qBAAAgH,EAAAiH,GAGA,IAAAwH,KAAaA,EAAA2B,MAAWpQ,EAAAO,MAAAmM,UACxB,KAAA1M,EAAAO,MAAAmM,qBAA8CmyC,EAAA,IAAapwC,EAAAxH,GAAAmJ,EAAAnJ,EAAA3D,KAAAgH,KAAAoE,QAAAC,KAC3D,YACA,IAAA/B,EAAA5M,EAAAqnD,eACA3X,EAqpBA,SAAAplC,EAAA6f,GACA,OAAW,CACX,MAAA7f,EAAAolB,SACA,OAAAplB,EACA,MAAAA,EAAAolB,UAAAvF,EAAA,GACA,GAAA7f,EAAAykC,WAAApwC,OAAAwrB,GAAA,GAAA7f,EAAAykC,WAAA5kB,GAAAuF,SACA,OAAAplB,EAAAykC,WAAA5kB,GACA7f,IAAAykC,WAAA5kB,EAAA,GACAA,EAAAxhB,EAAA2B,OAEA,SAAAA,EAAAolB,UAAAvF,EAAA7f,EAAAykC,WAAApwC,QAKA,YAJA2L,IAAAykC,WAAA5kB,GACAA,EAAA,IAjqBAykC,CAAAhiD,EAAA66C,UAAA76C,EAAA+6C,aACA,IAAAjY,IAAApsC,KAAA0H,IAAAsa,SAAAoqB,EAAA3Z,YACA,YACA,GAAAzyB,KAAAgH,KAAA01B,cAAA,CAIA,IAAA/mC,EAAAy2C,EAAA/f,UACAk/B,EAiqBA,SAAAnqB,EAAAzrC,EAAAwV,EAAA2B,GACA,QAAAvS,EAAA,EAAAoJ,EAAA,EAA4BpJ,EAAA6mC,EAAA17B,YAAA/B,GAAAmJ,GAAkC,CAC9D,IAAA1H,EAAAg8B,EAAAh8B,MAAA7K,KAAAixD,EAAA7nD,EAEA,GADAA,GAAAyB,EAAAC,UACAD,EAAAqxB,OACA,SACA,IAAAoG,EAAAz3B,EAAAzP,KACA,KAAA4E,EAAA6mC,EAAA17B,YAAA,CACA,IAAAnF,EAAA6gC,EAAAh8B,MAAA7K,KAEA,GADAoJ,GAAApD,EAAA8E,UACA9E,EAAAk2B,OACA,MACAoG,GAAAt8B,EAAA5K,KAEA,GAAAgO,GAAAwH,EAAA,CACA,IAAAoqB,EAAAi2B,EAAA1+C,EAAA+vB,EAAA8P,YAAAh3C,EAAAmX,EAAA0+C,EAAA,MACA,GAAAj2B,GAAA,GAAAA,EAAA5/B,EAAA0F,OAAAmwD,GAAArgD,EACA,OAAAqgD,EAAAj2B,EACA,GAAApqB,GAAA2B,GAAA+vB,EAAAxhC,QAAAyR,EAAAnX,EAAA0F,OAAAmwD,GACA3uB,EAAAr1B,MAAAsF,EAAA0+C,EAAA1+C,EAAA0+C,EAAA71D,EAAA0F,SAAA1F,EACA,OAAAmX,GAGA,SAxrBA2+C,CAAAzrD,KAAAgH,KAAAoE,QAAAzV,EAAAwV,EAAAxH,EAAAmJ,EAAAnJ,GACA,OAAA4nD,EAAA,QAAyCvkD,KAAAolC,EAAAzoC,IAAA4nD,EAAA51D,QAGzC,OAAoBqR,KAAAolC,EAAAzoC,KAAA,EAAAhO,KAAA,IAGpBD,wBAAAgH,GAAAsK,KAAmCA,EAAArD,MAAAhO,SAEnC,GAAAqK,KAAA2lD,QAAA3+C,GACA,OAEA,IAAA48B,EAAA58B,EACA,KACA48B,EAAAnR,YAAAzyB,KAAAqrC,WADezH,IAAAnR,WAAA,CAGf,KAAAmR,EAAAuG,iBACAvG,EAAAnR,WAAAi5B,YAAA9nB,EAAAuG,iBACA,KAAAvG,EAAAzX,aACAyX,EAAAnR,WAAAi5B,YAAA9nB,EAAAzX,aACAyX,EAAA+Z,aACA/Z,EAAA+Z,gBAAA9pC,GAEA,IAAAgmC,EAAA,IAAA4N,GAAAznD,KAAA4jC,EAAA58B,EAAArR,GACA+G,EAAA4nB,MAAAqnC,iBAAA1pD,KAAA43C,GAEA75C,KAAAwgB,SAAAynC,GAAAjoD,KAAAwgB,SAAA7c,IAAAhO,EAAA0F,OAAAqB,EAAAm9C,GAIAnkD,OAAAsR,EAAAk+C,EAAAC,EAAAzoD,GACA,QAAAsD,KAAAglD,OAAAF,KACA99C,EAAA6vB,WAAA72B,KAAAgH,SAEAhH,KAAA4rD,YAAA5kD,EAAAk+C,EAAAC,EAAAzoD,IACA,GAEAhH,YAAAsR,EAAAk+C,EAAAC,EAAAzoD,GACAsD,KAAA6rD,gBAAA3G,GACAllD,KAAAgH,OACAhH,KAAAmlD,YACAnlD,KAAAqrC,YACArrC,KAAAmoD,eAAAzrD,EAAAsD,KAAAsiD,YACAtiD,KAAAglD,MAAAL,GAEAjvD,gBAAAwvD,GACA,GAAAuD,GAAAvD,EAAAllD,KAAAklD,WACA,OACA,IAAA4G,EAAA,GAAA9rD,KAAA0lD,QAAAt5B,SACA2/B,EAAA/rD,KAAA0H,IACA1H,KAAA0H,IAAAskD,GAAAhsD,KAAA0H,IAAA1H,KAAA0lD,QAAAuG,GAAAjsD,KAAAklD,UAAAllD,KAAAgH,KAAA8kD,GAAAG,GAAA/G,EAAAllD,KAAAgH,KAAA8kD,IACA9rD,KAAA0H,KAAAqkD,IACAA,EAAApO,gBAAA9pC,EACA7T,KAAA0H,IAAAi2C,WAAA39C,MAEAA,KAAAklD,YAGAxvD,aACA,GAAAsK,KAAA0lD,QAAAt5B,UACApsB,KAAA0lD,QAAA1yB,UAAAnU,IAAA,6BACA7e,KAAAqrC,YAAArrC,KAAAgH,KAAA5H,KAAAmG,KAAA0T,YACAjZ,KAAA0H,IAAAuR,WAAA,GAGAvjB,eACA,GAAAsK,KAAA0lD,QAAAt5B,UACApsB,KAAA0lD,QAAA1yB,UAAA2C,OAAA,6BACA31B,KAAAqrC,YAAArrC,KAAAgH,KAAA5H,KAAAmG,KAAA0T,WACAjZ,KAAA0H,IAAAwkD,gBAAA,aAEAlG,cAAmB,OAAAhmD,KAAAgH,KAAAw2B,QAInB,SAAA2uB,GAAAtiD,EAAAq7C,EAAAC,EAAAz9C,EAAAhL,GAEA,OADA2rD,GAAA3gD,EAAAw9C,EAAAr7C,GACA,IAAAq+C,QAAAr0C,EAAAhK,EAAAq7C,EAAAC,EAAAz9C,MAAAhL,EAAA,SAEA6rD,WAAAL,GACAxyD,YAAAwU,EAAAlD,EAAAk+C,EAAAC,EAAAz9C,EAAAg+C,EAAAhpD,GACA4O,MAAApB,EAAAlD,EAAAk+C,EAAAC,EAAAz9C,EAAA,KAAAg+C,EAAAhpD,EAAA,GAEAhH,YACA,IAAA+5B,EAAAzvB,KAAA0lD,QAAAjzB,WACA,KAAAhD,MAAAzvB,KAAA0H,MAAA+nB,EAAA28B,UACA38B,IAAAgD,WACA,OAAgBhD,SAAA,GAEhB/5B,OAAAsR,EAAAk+C,EAAAC,EAAAzoD,GACA,QAAAsD,KAAAglD,OAAAF,IAAA9kD,KAAAglD,OAAAL,KAAA3kD,KAAAqsD,aACArlD,EAAA6vB,WAAA72B,KAAAgH,SAEAhH,KAAA6rD,gBAAA3G,GACAllD,KAAAglD,OAAAL,IAAA39C,EAAArR,MAAAqK,KAAAgH,KAAArR,MAAAqR,EAAArR,MAAAqK,KAAA0lD,QAAAr5B,YACArsB,KAAA0lD,QAAAr5B,UAAArlB,EAAArR,KACA+G,EAAAsuD,aAAAhrD,KAAA0lD,UACAhpD,EAAAsuD,YAAA,OAEAhrD,KAAAgH,OACAhH,KAAAglD,MAAAL,IACA,GAEAjvD,WACA,IAAAg1D,EAAA1qD,KAAAkK,OAAAmhC,WACA,QAAA9kC,EAAAvG,KAAA0lD,QAAkCn/C,EAAGA,IAAAksB,WACrC,GAAAlsB,GAAAmkD,EACA,SACA,SAEAh1D,WAAAiO,GACA,OAAgBqD,KAAAhH,KAAA0lD,QAAA7+B,OAAAljB,GAEhBjO,gBAAAgS,EAAAmf,EAAA8wB,GACA,OAAAjwC,GAAA1H,KAAA0lD,QACA1lD,KAAAsiD,WAAA39C,KAAAC,IAAAiiB,EAAA7mB,KAAAgH,KAAArR,KAAA0F,QACAiQ,MAAAs6C,gBAAAl+C,EAAAmf,EAAA8wB,GAEAjiD,eAAAuxD,GACA,uBAAAA,EAAA7nD,MAAA,aAAA6nD,EAAA7nD,KAEA1J,MAAAyV,EAAA2B,EAAApQ,GACA,IAAAsK,EAAAhH,KAAAgH,KAAA+vB,IAAA5rB,EAAA2B,GAAApF,EAAA4jB,SAAA2f,eAAAjkC,EAAArR,MACA,WAAA4yD,GAAAvoD,KAAAkK,OAAAlD,EAAAhH,KAAAklD,UAAAllD,KAAAmlD,UAAAz9C,IAAAhL,GAEAhH,UAAAyV,EAAA2B,GACAxB,MAAA+7C,UAAAl8C,EAAA2B,GACA9M,KAAA0H,KAAA1H,KAAA0lD,SAAA,GAAAv6C,GAAA2B,GAAA9M,KAAA0lD,QAAAr5B,UAAAhxB,SACA2E,KAAAglD,MAAAF,IAEAkB,cAAmB,gBAInBF,WAAAf,GACArvD,YAAiB,OAASi1C,QAAA,GAC1Bj1C,YAAAk2B,GAA2B,OAAA5rB,KAAAglD,OAAAL,IAAA3kD,KAAA0H,IAAAkkB,YAC3Bo6B,cAAmB,SACnB/C,sBAA2B,aAAAjjD,KAAA0H,IAAAkkB,gBAK3B08B,WAAAJ,GACAxyD,YAAAwU,EAAAlD,EAAAk+C,EAAAC,EAAAz9C,EAAA2jC,EAAAqa,EAAAngD,EAAA7I,EAAAiH,GACA2H,MAAApB,EAAAlD,EAAAk+C,EAAAC,EAAAz9C,EAAA2jC,EAAAqa,EAAAhpD,EAAAiH,GACA3D,KAAAuF,OAKA7P,OAAAsR,EAAAk+C,EAAAC,EAAAzoD,GACA,GAAAsD,KAAAglD,OAAAF,GACA,SACA,GAAA9kD,KAAAuF,KAAAiwB,OAAA,CACA,IAAAp6B,EAAA4E,KAAAuF,KAAAiwB,OAAAxuB,EAAAk+C,EAAAC,GAGA,OAFA/pD,GACA4E,KAAA4rD,YAAA5kD,EAAAk+C,EAAAC,EAAAzoD,GACAtB,EAEA,SAAA4E,KAAAqrC,aAAArkC,EAAA0vB,SAIAprB,MAAAkqB,OAAAxuB,EAAAk+C,EAAAC,EAAAzoD,GAGAhH,aACAsK,KAAAuF,KAAA+mD,WAAAtsD,KAAAuF,KAAA+mD,aAAAhhD,MAAAghD,aAEA52D,eACAsK,KAAAuF,KAAAgnD,aAAAvsD,KAAAuF,KAAAgnD,eAAAjhD,MAAAihD,eAEA72D,aAAAmY,EAAAC,EAAA4S,EAAA4lC,GACAtmD,KAAAuF,KAAAwH,aAAA/M,KAAAuF,KAAAwH,aAAAc,EAAAC,EAAA4S,GACApV,MAAAyB,aAAAc,EAAAC,EAAA4S,EAAA4lC,GAEA5wD,UACAsK,KAAAuF,KAAA6/C,SACAplD,KAAAuF,KAAA6/C,UACA95C,MAAA85C,UAEA1vD,UAAA+F,GACA,QAAAuE,KAAAuF,KAAAgiD,WAAAvnD,KAAAuF,KAAAgiD,UAAA9rD,GAEA/F,eAAAuxD,GACA,OAAAjnD,KAAAuF,KAAAinD,eAAAxsD,KAAAuF,KAAAinD,eAAAvF,GAAA37C,MAAAkhD,eAAAvF,IAkCA,MAAAwF,GAAA,SAAA7gC,GACAA,IACA5rB,KAAA4rB,aAEA6gC,GAAAluD,UAAAjC,OAAAC,OAAA,MACA,MAAAmwD,IAAA,IAAAD,IACA,SAAAR,GAAA/G,EAAAl+C,EAAA8kD,GACA,MAAA5G,EAAA7pD,OACA,OAAAqxD,GACA,IAAAtpD,EAAA0oD,EAAAY,GAAA,OAAAD,GAAArxD,GAAAgI,GACA,QAAA7I,EAAA,EAAmBA,EAAA2qD,EAAA7pD,OAAsBd,IAAA,CACzC,IAAAuL,EAAAo/C,EAAA3qD,GAAA6E,KAAA0G,MACA,GAAAA,EAAA,CAEAA,EAAA8lB,UACAxwB,EAAA6G,KAAAmB,EAAA,IAAAqpD,GAAA3mD,EAAA8lB,WACA,QAAA9wB,KAAAgL,EAAA,CACA,IAAAo2B,EAAAp2B,EAAAhL,GACA,MAAAohC,IAEA4vB,GAAA,GAAA1wD,EAAAC,QACAD,EAAA6G,KAAAmB,EAAA,IAAAqpD,GAAAzlD,EAAAs1B,SAAA,eACA,SAAAxhC,EACAsI,EAAAsnB,OAAAtnB,EAAAsnB,MAAAtnB,EAAAsnB,MAAA,QAAAwR,EACA,SAAAphC,EACAsI,EAAAmY,OAAAnY,EAAAmY,MAAAnY,EAAAmY,MAAA,IAAuD,IAAA2gB,EACvD,YAAAphC,IACAsI,EAAAtI,GAAAohC,MAGA,OAAA9gC,EAEA,SAAA4wD,GAAAW,EAAAjH,EAAAkH,EAAAC,GAEA,GAAAD,GAAAF,IAAAG,GAAAH,GACA,OAAAhH,EACA,IAAAoH,EAAApH,EACA,QAAAnrD,EAAA,EAAmBA,EAAAsyD,EAAAxxD,OAAwBd,IAAA,CAC3C,IAAA0uD,EAAA4D,EAAAtyD,GAAAoM,EAAAimD,EAAAryD,GACA,GAAAA,EAAA,CACA,IAAA2P,EACAvD,KAAAilB,UAAAq9B,EAAAr9B,UAAAkhC,GAAAH,IACAziD,EAAA4iD,EAAAr6B,aAAAvoB,EAAA0hB,SAAAvG,eAAA4jC,EAAAr9B,SACAkhC,EAAA5iD,IAGAA,EAAAohB,SAAAb,cAAAw+B,EAAAr9B,WACAwgC,UAAA,EACAliD,EAAAsgC,YAAAsiB,GACAnmD,EAAA+lD,GAAA,GACAI,EAAA5iD,GAGA6iD,GAAAD,EAAAnmD,GAAA+lD,GAAA,GAAAzD,GAEA,OAAA6D,EAEA,SAAAC,GAAArlD,EAAAf,EAAA+5B,GACA,QAAA5lC,KAAA6L,EACA,SAAA7L,GAAA,SAAAA,GAAA,YAAAA,QAAA4lC,GACAh5B,EAAAwkD,gBAAApxD,GACA,QAAAA,KAAA4lC,EACA,SAAA5lC,GAAA,SAAAA,GAAA,YAAAA,GAAA4lC,EAAA5lC,IAAA6L,EAAA7L,IACA4M,EAAAsmC,aAAAlzC,EAAA4lC,EAAA5lC,IACA,GAAA6L,EAAA+jB,OAAAgW,EAAAhW,MAAA,CACA,IAAAsiC,EAAArmD,EAAA+jB,MAAA/jB,EAAA+jB,MAAAvvB,MAAA,KAAA6P,OAAAsf,YACA2iC,EAAAvsB,EAAAhW,MAAAgW,EAAAhW,MAAAvvB,MAAA,KAAA6P,OAAAsf,YACA,QAAA/vB,EAAA,EAAuBA,EAAAyyD,EAAA3xD,OAAqBd,KAC5C,GAAA0yD,EAAAjtB,QAAAgtB,EAAAzyD,KACAmN,EAAAsrB,UAAA2C,OAAAq3B,EAAAzyD,IACA,QAAAA,EAAA,EAAuBA,EAAA0yD,EAAA5xD,OAAoBd,KAC3C,GAAAyyD,EAAAhtB,QAAAitB,EAAA1yD,KACAmN,EAAAsrB,UAAAnU,IAAAouC,EAAA1yD,IACA,GAAAmN,EAAAsrB,UAAA33B,QACAqM,EAAAwkD,gBAAA,SAEA,GAAAvlD,EAAA4U,OAAAmlB,EAAAnlB,MAAA,CACA,GAAA5U,EAAA4U,MAAA,CACA,IAAiGuI,EAAjGtnB,EAAA,gFACA,KAAAsnB,EAAAtnB,EAAAxC,KAAA2M,EAAA4U,QACA7T,EAAA6T,MAAA2xC,eAAAppC,EAAA,IAEA4c,EAAAnlB,QACA7T,EAAA6T,MAAA2vC,SAAAxqB,EAAAnlB,QAGA,SAAA8sC,GAAA3gD,EAAAuhD,EAAAjiD,GACA,OAAAglD,GAAAtkD,IAAAglD,GAAAT,GAAAhD,EAAAjiD,EAAA,GAAAU,EAAA0kB,WAEA,SAAAq8B,GAAAxkD,EAAAC,GACA,GAAAD,EAAA5I,QAAA6I,EAAA7I,OACA,SACA,QAAAd,EAAA,EAAmBA,EAAA0J,EAAA5I,OAAcd,IACjC,IAAA0J,EAAA1J,GAAA6E,KAAAmQ,GAAArL,EAAA3J,GAAA6E,MACA,SACA,SAGA,SAAA0rD,GAAApjD,GACA,IAAAnH,EAAAmH,EAAAykB,YAEA,OADAzkB,EAAA+qB,WAAAi5B,YAAAhkD,GACAnH,QAIAyoD,GACAtzD,YAAA0N,EAAA+pD,GACAntD,KAAAmtD,OAGAntD,KAAAiF,MAAA,EAGAjF,KAAAygB,SAEAzgB,KAAAuqD,SAAA,EACAvqD,KAAAoD,MACApD,KAAAotD,SAqMA,SAAAhsB,EAAAisB,GACA,IAAAC,EAAAD,EAAAE,EAAAD,EAAA9sC,SAAAnlB,OACAmyD,EAAApsB,EAAA17B,WAAAsqB,EAAA,IAAAvR,IAAA8mB,KACAkoB,EAAA,KAAAD,EAAA,IACA,IAAA3T,EACA,OACA,GAAA0T,EAAA,CACA,IAAAhtD,EAAA+sD,EAAA9sC,SAAA+sC,EAAA,GACA,KAAAhtD,aAAAsnD,IAIA,CACAhO,EAAAt5C,EACAgtD,IACA,MANAD,EAAA/sD,EACAgtD,EAAAhtD,EAAAigB,SAAAnlB,WAQA,IAAAiyD,GAAAD,EACA,MAAAI,EAIAF,EAAAD,EAAApjD,OAAAsW,SAAAwf,QAAAstB,GACAA,IAAApjD,OAGA,IAAAlD,EAAA6yC,EAAA7yC,KACA,GAAAA,EAAA,CAEA,GAAAA,GAAAo6B,EAAAh8B,MAAAooD,EAAA,GACA,QACAA,EACAx9B,EAAAjtB,IAAA82C,EAAA2T,GACAjoB,EAAAtjC,KAAA43C,IAEA,OAAY50C,MAAAuoD,EAAAx9B,UAAAuV,UAAAjlC,WAzOZ8sD,CAAAhqD,EAAA4D,KAAAoE,QAAAhI,GAIA1N,eAAAgM,EAAA4I,GACA,GAAA5I,GAAA4I,EAAA,CAEA,QAAA/P,EAAAmH,EAA2BnH,EAAA+P,EAAS/P,IACpCyF,KAAAoD,IAAAod,SAAAjmB,GAAA6qD,UACAplD,KAAAoD,IAAAod,SAAA7V,OAAAjJ,EAAA4I,EAAA5I,GACA1B,KAAAuqD,SAAA,GAGA70D,cACAsK,KAAA0tD,eAAA1tD,KAAAiF,MAAAjF,KAAAoD,IAAAod,SAAAnlB,QAIA3F,YAAAikB,EAAAxZ,EAAAzD,GACA,IAAAswC,EAAA,EAAAlsC,EAAAd,KAAAygB,MAAAplB,QAAA,EACAsyD,EAAAhpD,KAAAC,IAAA9D,EAAA6Y,EAAAte,QACA,KAAA2xC,EAAA2gB,IACA3gB,GAAAlsC,EAAA,EAAAd,KAAAoD,IAAApD,KAAAygB,MAAAusB,EAAA,OACA4gB,YAAAj0C,EAAAqzB,MAAA,IAAArzB,EAAAqzB,GAAA5tC,KAAAmG,KAAA2nC,UACAF,IACA,KAAAA,EAAAlsC,GACAd,KAAAsqD,cACAtqD,KAAAoD,IAAA4hD,MAAAL,GACA3kD,KAAAiF,MAAAjF,KAAAygB,MAAAhgB,MACAT,KAAAoD,IAAApD,KAAAygB,MAAAhgB,MACAK,IAEA,KAAAA,EAAA6Y,EAAAte,QAAA,CACA2E,KAAAygB,MAAAxe,KAAAjC,KAAAoD,IAAApD,KAAAiF,MAAA,GACA,IAAAswB,GAAA,EACA,QAAAh7B,EAAAyF,KAAAiF,MAAoC1K,EAAAoK,KAAAC,IAAA5E,KAAAiF,MAAA,EAAAjF,KAAAoD,IAAAod,SAAAnlB,QAAwDd,IAC5F,GAAAyF,KAAAoD,IAAAod,SAAAjmB,GAAAqzD,YAAAj0C,EAAA7Y,IAAA,CACAy0B,EAAAh7B,EACA,MAGA,GAAAg7B,GAAA,EACAA,EAAAv1B,KAAAiF,QACAjF,KAAAuqD,SAAA,EACAvqD,KAAA0tD,eAAA1tD,KAAAiF,MAAAswB,IAEAv1B,KAAAoD,IAAApD,KAAAoD,IAAAod,SAAAxgB,KAAAiF,WAEA,CACA,IAAA4oD,EAAAhG,GAAAtrD,OAAAyD,KAAAoD,IAAAuW,EAAA7Y,GAAAX,EAAAzD,GACAsD,KAAAoD,IAAAod,SAAA7V,OAAA3K,KAAAiF,MAAA,EAAA4oD,GACA7tD,KAAAoD,IAAAyqD,EACA7tD,KAAAuqD,SAAA,EAEAvqD,KAAAiF,MAAA,EACAnE,KAKApL,cAAAsR,EAAAk+C,EAAAC,EAAAlgD,GACA,IAAA6oD,EAAAv4B,GAAA,EACA,GAAAtwB,GAAAjF,KAAAotD,SAAAnoD,QACA6oD,EAAA9tD,KAAAotD,SAAA7nB,QAAAtgC,EAAAjF,KAAAotD,SAAAnoD,QAAAiF,QAAAlK,KAAAoD,KACA0qD,EAAAC,YAAA/mD,EAAAk+C,EAAAC,GACA5vB,EAAAv1B,KAAAoD,IAAAod,SAAAwf,QAAA8tB,EAAA9tD,KAAAiF,YAGA,QAAA1K,EAAAyF,KAAAiF,MAAAnG,EAAA6F,KAAAC,IAAA5E,KAAAoD,IAAAod,SAAAnlB,OAAAd,EAAA,GAAmFA,EAAAuE,EAAOvE,IAAA,CAC1F,IAAA6K,EAAApF,KAAAoD,IAAAod,SAAAjmB,GACA,GAAA6K,EAAA2oD,YAAA/mD,EAAAk+C,EAAAC,KAAAnlD,KAAAotD,SAAAp9B,QAAA4hB,IAAAxsC,GAAA,CACAmwB,EAAAh7B,EACA,OAIA,QAAAg7B,EAAA,KAEAv1B,KAAA0tD,eAAA1tD,KAAAiF,MAAAswB,GACAv1B,KAAAiF,SACA,GAEAvP,aAAAsR,EAAAk+C,EAAAC,EAAAlgD,EAAAvI,GACA,IAAA0I,EAAApF,KAAAoD,IAAAod,SAAAvb,GAGA,OAFAG,EAAA4/C,OAAAF,IAAA1/C,EAAAsC,KAAAtC,EAAAimC,aACAjmC,EAAA4/C,MAAAH,MACAz/C,EAAAowB,OAAAxuB,EAAAk+C,EAAAC,EAAAzoD,KAEAsD,KAAA0tD,eAAA1tD,KAAAiF,SACAjF,KAAAiF,SACA,GAEAvP,mBAAAs4D,GACA,OAAe,CACf,IAAA9jD,EAAA8jD,EAAAv7B,WACA,IAAAvoB,EACA,SACA,GAAAA,GAAAlK,KAAAoD,IAAAioC,WAAA,CACA,IAAAwO,EAAAmU,EAAArQ,WACA,GAAA9D,EACA,QAAAt/C,EAAAyF,KAAAiF,MAA4C1K,EAAAyF,KAAAoD,IAAAod,SAAAnlB,OAA8Bd,IAC1E,GAAAyF,KAAAoD,IAAAod,SAAAjmB,IAAAs/C,EACA,OAAAt/C,EAEA,SAEAyzD,EAAA9jD,GAKAxU,eAAAsR,EAAAk+C,EAAAC,EAAAzoD,EAAAuI,GACA,QAAA1K,EAAAyF,KAAAiF,MAAgC1K,EAAAyF,KAAAoD,IAAAod,SAAAnlB,OAA8Bd,IAAA,CAC9D,IAAAgG,EAAAP,KAAAoD,IAAAod,SAAAjmB,GACA,GAAAgG,aAAA2nD,GAAA,CACA,IAAAkF,EAAAptD,KAAAotD,SAAAp9B,QAAAntB,IAAAtC,GACA,SAAA6sD,MAAAnoD,EACA,SACA,IAAAgpD,EAAA1tD,EAAAmH,IAOA,KAHA1H,KAAAmtD,OAAAc,GAAAjuD,KAAAmtD,MAAA,GAAAc,EAAA7hC,UAAA6hC,EAAAjsC,SAAAhiB,KAAAmtD,KAAA16B,gBACAzrB,EAAAyvB,QAAAl2B,EAAAyG,MAAAzG,EAAAyG,KAAAyvB,QAAAl2B,EAAAmlD,QAAAr5B,WAAArlB,EAAArR,MACA4K,EAAAykD,OAAAF,IAAA2D,GAAAvD,EAAA3kD,EAAA2kD,cACA3kD,EAAAi1B,OAAAxuB,EAAAk+C,EAAAC,EAAAzoD,GAKA,OAJAsD,KAAA0tD,eAAA1tD,KAAAiF,MAAA1K,GACAgG,EAAAmH,KAAAumD,IACAjuD,KAAAuqD,SAAA,GACAvqD,KAAAiF,SACA,EAEA,OAGA,SAGAvP,QAAAsR,EAAAk+C,EAAAC,EAAAzoD,EAAAiH,GACA3D,KAAAoD,IAAAod,SAAA7V,OAAA3K,KAAAiF,QAAA,EAAAijD,GAAA3rD,OAAAyD,KAAAoD,IAAA4D,EAAAk+C,EAAAC,EAAAzoD,EAAAiH,IACA3D,KAAAuqD,SAAA,EAEA70D,YAAAuvD,EAAAvoD,EAAAiH,GACA,IAAApD,EAAAP,KAAAiF,MAAAjF,KAAAoD,IAAAod,SAAAnlB,OAAA2E,KAAAoD,IAAAod,SAAAxgB,KAAAiF,OAAA,KACA,IAAA1E,MAAA2tD,cAAAjJ,IACAA,GAAA1kD,EAAA0kD,QAAA1kD,EAAA0kD,OAAA7lD,KAAAga,MAAAqZ,WAGA,CACA,IAAAonB,EAAA,IAAAkM,GAAA/lD,KAAAoD,IAAA6hD,EAAAvoD,EAAAiH,GACA3D,KAAAoD,IAAAod,SAAA7V,OAAA3K,KAAAiF,QAAA,EAAA40C,GACA75C,KAAAuqD,SAAA,OALAvqD,KAAAiF,QAUAvP,oBACA,IAAAqU,EAAA/J,KAAAoD,IAAAod,SAAAxgB,KAAAiF,MAAA,GAAAiF,EAAAlK,KAAAoD,IACA,KAAA2G,aAAA89C,IAEA99C,GADAG,EAAAH,GACAyW,SAAAtW,EAAAsW,SAAAnlB,OAAA,GAEA0O,GACAA,aAAAw+C,KACA,MAAApuD,KAAA4P,EAAA/C,KAAArR,SAEAwmD,GAAAriD,IAAAiQ,GAAA,SAAAA,EAAArC,IAAAg2C,iBACA19C,KAAAmuD,YAAA,MAAAjkD,GACAlK,KAAAmuD,YAAA,KAAAnuD,KAAAoD,MAGA1N,YAAAk2B,EAAA1hB,GACA,GAAAA,GAAAlK,KAAAoD,KAAApD,KAAAiF,MAAAiF,EAAAsW,SAAAnlB,QAAA6O,EAAAsW,SAAAxgB,KAAAiF,OAAAmpD,YAAAxiC,GACA5rB,KAAAiF,YAEA,CACA,IAAAyC,EAAA4jB,SAAAb,cAAAmB,GACA,OAAAA,IACAlkB,EAAAyY,UAAA,wBACAzY,EAAA3M,IAAA,IAEA,MAAA6wB,IACAlkB,EAAAyY,UAAA,6BACA,IAAAkuC,EAAA,IAAAvI,GAAA9lD,KAAAoD,OAAAsE,EAAA,MACAwC,GAAAlK,KAAAoD,IACA8G,EAAAsW,SAAAve,KAAAosD,GAEAnkD,EAAAsW,SAAA7V,OAAA3K,KAAAiF,QAAA,EAAAopD,GACAruD,KAAAuqD,SAAA,IA+CA,SAAAb,GAAAzlD,EAAAC,GACA,OAAAD,EAAA7E,KAAAwwC,KAAA1rC,EAAA9E,KAAAwwC,KAkIA,SAAAqY,GAAAv/C,EAAAyC,EAAA2B,EAAApQ,EAAA4hC,GACA,IAAAljC,KACA,QAAAb,EAAA,EAAA6iD,EAAA,EAA4B7iD,EAAAmO,EAAArN,OAAkBd,IAAA,CAC9C,IAAA6K,EAAAsD,EAAAnO,GAAAmH,EAAA07C,EAAA9yC,EAAA8yC,GAAAh4C,EAAAiG,KACA3J,GAAAoL,GAAAxC,GAAAa,EACA/P,EAAA6G,KAAAmD,IAGA1D,EAAAyJ,GACA/P,EAAA6G,KAAAmD,EAAAoC,MAAA,EAAA2D,EAAAzJ,EAAAhF,IACA4hC,IACAljC,EAAA6G,KAAAq8B,GACAA,OAAAzqB,GAEAvJ,EAAAwC,GACA1R,EAAA6G,KAAAmD,EAAAoC,MAAAsF,EAAApL,EAAA0D,EAAAiG,KAAA3O,KAGA,OAAAtB,EAGA,SAAAkzD,GAAA5xD,EAAAwzB,EAAA,MACA,IAAA2tB,EAAAnhD,EAAAqnD,eAAAl6C,EAAAnN,EAAAO,MAAA4M,IACA,IAAAg0C,EAAAsG,UACA,YACA,IAAApC,EAAArlD,EAAAolD,QAAAC,YAAAlE,EAAAsG,WAAAoK,EAAAxM,GAAA,GAAAA,EAAA12C,KACAyC,EAAApR,EAAAolD,QAAAI,WAAArE,EAAAsG,UAAAtG,EAAAwG,YAAA,GACA,GAAAv2C,EAAA,EACA,YACA,IAAArE,EAAAL,EAAAD,EAAAU,EAAAb,QAAA8E,GACA,GAAA8vC,EAAAC,GAAA,CAEA,IADAp0C,EAAAN,EACA44C,MAAA/6C,MACA+6C,IAAA73C,OACA,IAAAskD,EAAAzM,EAAA/6C,KACA,GAAA+6C,GAAAyM,EAAAhxB,QAAqD+d,EAAA,EAAapJ,aAAAqc,IAAAzM,EAAA73C,UAClEskD,EAAAlyB,WAv6DA,SAAAt1B,EAAA6f,EAAA3c,GACA,QAAAsuC,EAAA,GAAA3xB,EAAAupB,EAAAvpB,GAAAxhB,EAAA2B,GAAqEwxC,GAAApI,GAAkB,CACvF,GAAAppC,GAAAkD,EACA,SACA,IAAAjF,EAAA03C,EAAA31C,GAEA,KADAA,IAAAyrB,YAEA,SACA+lB,KAAA,GAAAvzC,EACAmrC,KAAAnrC,GAAAI,EAAA2B,IA85DAynD,CAAA5Q,EAAAsG,UAAAtG,EAAAwG,YAAAtC,EAAAr6C,MAAA,CACA,IAAA/D,EAAAo+C,EAAAC,UACA54C,EAAA,IAA4BmyC,EAAA,EAAaztC,GAAAnK,EAAAwF,EAAAU,EAAAb,QAAArF,SAGzC,CACA,IAAAkK,EAAAnR,EAAAolD,QAAAI,WAAArE,EAAA8I,WAAA9I,EAAA+I,aAAA,GACA,GAAA/4C,EAAA,EACA,YACApE,EAAAI,EAAAb,QAAA6E,GAEA,IAAAzE,EAAA,CAEAA,EAAAslD,GAAAhyD,EAAA+M,EAAAN,EADA,WAAA+mB,GAAAxzB,EAAAO,MAAAmM,UAAA0E,KAAA3E,EAAAxF,MAAA4qD,EAAA,MAGA,OAAAnlD,EAEA,SAAAulD,GAAAjyD,GACA,OAAAA,EAAAkyD,SAAAlyD,EAAAmyD,WACAC,GAAApyD,IAAA4uB,SAAA+3B,eAAA/3B,SAAA+3B,cAAArhC,SAAAtlB,EAAAgL,KAEA,SAAAqnD,GAAAryD,EAAA4pD,GAAA,GACA,IAAAh9C,EAAA5M,EAAAO,MAAAmM,UAEA,GADA4lD,GAAAtyD,EAAA4M,GACAqlD,GAAAjyD,GAAA,CAKA,IAAA4pD,GAAA5pD,EAAA4nB,MAAA2qC,WAAAvyD,EAAA4nB,MAAA2qC,UAAAC,cAAAp1D,EAAA,CACA,IAAA+jD,EAAAnhD,EAAAqnD,eAAAoL,EAAAzyD,EAAA0yD,YAAAC,iBACA,GAAAxR,EAAA8I,YAAAwI,EAAAxI,YACAxJ,EAAAU,EAAA8I,WAAA9I,EAAA+I,aAAAuI,EAAAxI,WAAAwI,EAAAvI,cAGA,OAFAlqD,EAAA4nB,MAAA2qC,UAAAK,sBAAA,OACA5yD,EAAA0yD,YAAAG,kBAKA,GADA7yD,EAAA0yD,YAAAI,sBACA9yD,EAAA+yD,eA8EA,SAAA/yD,GACA,IAAAmhD,EAAAnhD,EAAAqnD,eAAAhmC,EAAAuN,SAAA0xB,cACAh2C,EAAAtK,EAAA+yD,cAAA/nD,IAAAgoD,EAAA,OAAA1oD,EAAA4kB,SACA8jC,EACA3xC,EAAAk/B,OAAAj2C,EAAAyrB,WAAAkqB,EAAA31C,GAAA,GAEA+W,EAAAk/B,OAAAj2C,EAAA,GACA+W,EAAAgpC,UAAA,GACAlJ,EAAA4G,kBACA5G,EAAA1jB,SAAApc,IAMA2xC,IAAAhzD,EAAAO,MAAAmM,UAAA+E,SAAA9T,GAAAyhD,GAAA,KACA90C,EAAA2oD,UAAA,EACA3oD,EAAA2oD,UAAA,GA9FAC,CAAAlzD,OAEA,CACA,IAA4BmzD,EAAAC,GAA5BjiD,OAAaA,EAAAC,QAAexE,GAC5BymD,IAAAzmD,aAA8DiyC,EAAA,IAC9DjyC,EAAAiC,MAAArB,OAAAwyB,gBACAmzB,EAAAG,GAAAtzD,EAAA4M,EAAA6B,OACA7B,EAAAmD,OAAAnD,EAAAiC,MAAArB,OAAAwyB,gBACAozB,EAAAE,GAAAtzD,EAAA4M,EAAAwD,MAEApQ,EAAAolD,QAAA/0C,aAAAc,EAAAC,EAAApR,EAAAgkB,KAAA4lC,GACAyJ,KACAF,GACAI,GAAAJ,GACAC,GACAG,GAAAH,IAEAxmD,EAAA6E,QACAzR,EAAAgL,IAAAsrB,UAAA2C,OAAA,8BAGAj5B,EAAAgL,IAAAsrB,UAAAnU,IAAA,6BACA,sBAAAyM,UAwCA,SAAA5uB,GACA,IAAAmN,EAAAnN,EAAAgL,IAAAsjC,cACAnhC,EAAAqmD,oBAAA,kBAAAxzD,EAAA4nB,MAAA6rC,oBACA,IAAAtS,EAAAnhD,EAAAqnD,eACA/8C,EAAA62C,EAAA8I,WAAA9/B,EAAAg3B,EAAA+I,aACA/8C,EAAAgqB,iBAAA,kBAAAn3B,EAAA4nB,MAAA6rC,mBAAA,MACAtS,EAAA8I,YAAA3/C,GAAA62C,EAAA+I,cAAA//B,IACAhd,EAAAqmD,oBAAA,kBAAAxzD,EAAA4nB,MAAA6rC,oBACAC,WAAA,KACAzB,GAAAjyD,OAAAO,MAAAmM,UAAA+E,SACAzR,EAAAgL,IAAAsrB,UAAA2C,OAAA,8BACa,QAlDb06B,CAAA3zD,IAGAA,EAAA0yD,YAAAG,kBACA7yD,EAAA0yD,YAAAkB,oBAKA,MAAAP,GAAA5T,GAAAriD,GAAAoiD,EAAA,GACA,SAAA8T,GAAAtzD,EAAAiH,GACA,IAAAqD,KAASA,EAAA6f,UAAenqB,EAAAolD,QAAAY,WAAA/+C,EAAA,GACxB+F,EAAAmd,EAAA7f,EAAAykC,WAAApwC,OAAA2L,EAAAykC,WAAA5kB,GAAA,KACA5d,EAAA4d,EAAA7f,EAAAykC,WAAA5kB,EAAA,QACA,GAAAs1B,GAAAzyC,GAAA,SAAAA,EAAAg0C,gBACA,OAAA6S,GAAA7mD,GACA,KAAAA,GAAA,SAAAA,EAAAg0C,iBACAz0C,GAAA,SAAAA,EAAAy0C,iBAAA,CACA,GAAAh0C,EACA,OAAA6mD,GAAA7mD,GACA,GAAAT,EACA,OAAAsnD,GAAAtnD,IAGA,SAAAsnD,GAAAj+B,GAMA,OALAA,EAAAorB,gBAAA,OACAvB,GAAA7pB,EAAArZ,YACAqZ,EAAArZ,WAAA,EACAqZ,EAAAk+B,cAAA,GAEAl+B,EAEA,SAAA29B,GAAA39B,GACAA,EAAAorB,gBAAA,QACAprB,EAAAk+B,eACAl+B,EAAArZ,WAAA,EACAqZ,EAAAk+B,aAAA,MAsCA,SAAAxB,GAAAtyD,EAAA4M,GACA,GAAAA,aAAuBiyC,EAAA,EAAa,CACpC,IAAA1B,EAAAn9C,EAAAolD,QAAA+D,OAAAv8C,EAAA6B,MACA0uC,GAAAn9C,EAAA+zD,uBACAC,GAAAh0D,GACAm9C,GACAA,EAAAyS,aACA5vD,EAAA+zD,qBAAA5W,QAIA6W,GAAAh0D,GAIA,SAAAg0D,GAAAh0D,GACAA,EAAA+zD,uBACA/zD,EAAA+zD,qBAAAvmD,QACAxN,EAAA+zD,qBAAAlE,eACA7vD,EAAA+zD,0BAAA58C,GAGA,SAAA66C,GAAAhyD,EAAA+M,EAAAN,EAAAwuC,GACA,OAAAj7C,EAAAwiD,SAAA,yBAAAlyC,KAAAtQ,EAAA+M,EAAAN,KACWoyC,EAAA,EAAaxvC,QAAAtC,EAAAN,EAAAwuC,GAExB,SAAAgZ,GAAAj0D,GACA,QAAAA,EAAAkyD,UAAAlyD,EAAAgkB,KAAA2iC,eAAA3mD,EAAAgL,MAEAonD,GAAApyD,GAEA,SAAAoyD,GAAApyD,GACA,IAAA4M,EAAA5M,EAAAqnD,eACA,IAAAz6C,EAAAq9C,WACA,SACA,IAIA,OAAAjqD,EAAAgL,IAAAsa,SAAA,GAAA1Y,EAAAq9C,WAAAv6B,SAAA9iB,EAAAq9C,WAAAl0B,WAAAnpB,EAAAq9C,cACAjqD,EAAAkyD,UAAAlyD,EAAAgL,IAAAsa,SAAA,GAAA1Y,EAAA66C,UAAA/3B,SAAA9iB,EAAA66C,UAAA1xB,WAAAnpB,EAAA66C,YAEA,MAAAnrB,GACA,UASA,SAAA43B,GAAA3zD,EAAA8G,GACA,IAAA0F,QAASA,EAAAN,SAAiBlM,EAAAmM,UAC1BynD,EAAA9sD,EAAA,EAAA0F,EAAA5E,IAAAsE,GAAAM,EAAA7E,IAAAuE,GACA6wB,EAAA62B,EAAA3mD,OAAAwyB,cAAAm0B,EAAA/vD,MAAA7D,EAAA4M,IAAAb,QAAAjF,EAAA,EAAA8sD,EAAAnnD,QAAAmnD,EAAA5nD,UAAA,KAAA4nD,EACA,OAAA72B,GAAqBuhB,EAAA,EAAS1uC,SAAAmtB,EAAAj2B,GAE9B,SAAA4T,GAAAjb,EAAA4M,GAEA,OADA5M,EAAAQ,SAAAR,EAAAO,MAAAuP,GAAAO,aAAAzD,GAAAkG,mBACA,EAEA,SAAAshD,GAAAp0D,EAAAqH,EAAAgtD,GACA,IAAAznD,EAAA5M,EAAAO,MAAAmM,UACA,KAAAE,aAAuBiyC,EAAA,GA+BvB,IAAAjyC,aAA4BiyC,EAAA,GAAajyC,EAAAtC,KAAAs1B,SACzC,OAAA3kB,GAAAjb,EAAA,IAA+B6+C,EAAA,EAAax3C,EAAA,EAAAuF,EAAAkC,IAAAlC,EAAAiC,QAE5C,CACA,IAAAhL,EAAAqwD,GAAAl0D,EAAAO,MAAA8G,GACA,QAAAxD,GACAoX,GAAAjb,EAAA6D,IApCA,IAAA+I,EAAAmD,OAAAskD,EAAA/wB,QAAA,QACA,SAEA,GAAAtjC,EAAAyT,eAAApM,EAAA,mBACA,IAAAxD,EAAAqwD,GAAAl0D,EAAAO,MAAA8G,GACA,SAAAxD,gBAAyCg7C,EAAA,IACzC5jC,GAAAjb,EAAA6D,GAGA,KAAArG,GAAA62D,EAAA/wB,QAAA,UACA,IAAA6Z,EAAA1wC,EAAAG,EAAAH,MAAAnC,EAAAmC,EAAA4xB,WAAA,KAAAh3B,EAAA,EAAAoF,EAAAW,WAAAX,EAAAQ,UACA,IAAA3C,KAAAyvB,OACA,SACA,IAAAu6B,EAAAjtD,EAAA,EAAAoF,EAAAxF,IAAAqD,EAAA3B,SAAA8D,EAAAxF,IACA,SAAAqD,EAAAw2B,SAAAqc,EAAAn9C,EAAAolD,QAAA+D,OAAAmL,MAAAnX,EAAAxO,cAEgBkQ,EAAA,EAAapJ,aAAAnrC,GAC7B2Q,GAAAjb,EAAA,IAAuC6+C,EAAA,EAAax3C,EAAA,EAAArH,EAAAO,MAAA4M,IAAAb,QAAAG,EAAAxF,IAAAqD,EAAA3B,UAAA8D,MAEpDqzC,GAIA7kC,GAAAjb,EAAA,IAAuC6+C,EAAA,EAAa7+C,EAAAO,MAAA4M,IAAAb,QAAAjF,EAAA,EAAAitD,IAAAhqD,EAAA3B,cAiBpD,SAAA4rD,GAAAjqD,GACA,UAAAA,EAAAolB,SAAAplB,EAAAqlB,UAAAhxB,OAAA2L,EAAAykC,WAAApwC,OAEA,SAAA61D,GAAAxpD,GACA,IAAAmyC,EAAAnyC,EAAAi2C,WACA,OAAA9D,GAAA,GAAAA,EAAAxuC,OAAA3D,EAAAykB,aAAA,MAAAzkB,EAAAkkB,UAIA,SAAAulC,GAAAz0D,GACA,IAAA4M,EAAA5M,EAAAqnD,eACA/8C,EAAAsC,EAAA66C,UAAAt9B,EAAAvd,EAAA+6C,YACA,IAAAr9C,EACA,OACA,IAAAoqD,EAAAC,EAAA/K,GAAA,EAMA,IAFAtK,GAAA,GAAAh1C,EAAAolB,UAAAvF,EAAAoqC,GAAAjqD,IAAAkqD,GAAAlqD,EAAAykC,WAAA5kB,MACAy/B,GAAA,KAEA,GAAAz/B,EAAA,GACA,MAAA7f,EAAAolB,SACA,MAEA,CACA,IAAAnjB,EAAAjC,EAAAykC,WAAA5kB,EAAA,GACA,GAAAqqC,GAAAjoD,GACAmoD,EAAApqD,EACAqqD,IAAAxqC,MAEA,OAAA5d,EAAAmjB,SAKA,MAHAvF,GADA7f,EAAAiC,GACAojB,UAAAhxB,aAMA,IAAAi2D,GAAAtqD,GACA,MAEA,CACA,IAAAL,EAAAK,EAAAmjC,gBACA,KAAAxjC,GAAAuqD,GAAAvqD,IACAyqD,EAAApqD,EAAAyrB,WACA4+B,EAAA1U,EAAAh2C,GACAA,IAAAwjC,gBAEA,GAAAxjC,EAQAkgB,EAAAoqC,GADAjqD,EAAAL,OAPA,CAEA,IADAK,IAAAyrB,aACA/1B,EAAAgL,IACA,MACAmf,EAAA,IAQAy/B,EACAiL,GAAA70D,EAAA4M,EAAAtC,EAAA6f,GACAuqC,GACAG,GAAA70D,EAAA4M,EAAA8nD,EAAAC,GAIA,SAAAG,GAAA90D,GACA,IAAA4M,EAAA5M,EAAAqnD,eACA/8C,EAAAsC,EAAA66C,UAAAt9B,EAAAvd,EAAA+6C,YACA,IAAAr9C,EACA,OACA,IACAoqD,EAAAC,EADAtQ,EAAAkQ,GAAAjqD,GAEA,OACA,GAAA6f,EAAAk6B,EAAA,CACA,MAAA/5C,EAAAolB,SACA,MAEA,IAAA8kC,GADAlqD,EAAAykC,WAAA5kB,IAMA,MAJAuqC,EAAApqD,EACAqqD,IAAAxqC,MAKA,IAAAyqC,GAAAtqD,GACA,MAEA,CACA,IAAAzG,EAAAyG,EAAAmlB,YACA,KAAA5rB,GAAA2wD,GAAA3wD,IACA6wD,EAAA7wD,EAAAkyB,WACA4+B,EAAA1U,EAAAp8C,GAAA,EACAA,IAAA4rB,YAEA,GAAA5rB,EAQAsmB,EAAA,EACAk6B,EAAAkQ,GAFAjqD,EAAAzG,OAPA,CAEA,IADAyG,IAAAyrB,aACA/1B,EAAAgL,IACA,MACAmf,EAAAk6B,EAAA,IASAqQ,GACAG,GAAA70D,EAAA4M,EAAA8nD,EAAAC,GAEA,SAAAC,GAAA5pD,GACA,IAAAmyC,EAAAnyC,EAAAi2C,WACA,OAAA9D,KAAA7yC,MAAA6yC,EAAA7yC,KAAA2vB,QAEA,SAAA46B,GAAA70D,EAAA4M,EAAAtC,EAAA6f,GACA,GAAA+2B,EAAAt0C,GAAA,CACA,IAAAyU,EAAAuN,SAAA0xB,cACAj/B,EAAAk/B,OAAAj2C,EAAA6f,GACA9I,EAAAm/B,SAAAl2C,EAAA6f,GACAvd,EAAAm7C,kBACAn7C,EAAA6wB,SAAApc,QAEAzU,EAAAw9C,QACAx9C,EAAAw9C,OAAA9/C,EAAA6f,GAEAnqB,EAAA0yD,YAAAG,kBACA,IAAAtyD,MAASA,GAAQP,EAEjB0zD,WAAA,KACA1zD,EAAAO,UACA8xD,GAAAryD,IACK,IAKL,SAAA+0D,GAAA/0D,EAAAqH,EAAAgtD,GACA,IAAAznD,EAAA5M,EAAAO,MAAAmM,UACA,GAAAE,aAAuBiyC,EAAA,IAAajyC,EAAAmD,OAAAskD,EAAA/wB,QAAA,QACpC,SACA,GAAA9lC,GAAA62D,EAAA/wB,QAAA,QACA,SACA,IAAAz0B,MAASA,EAAAC,OAAalC,EACtB,IAAAiC,EAAArB,OAAAwyB,eAAAhgC,EAAAyT,eAAApM,EAAA,gBACA,IAAAxD,EAAAqwD,GAAAl0D,EAAAO,MAAA8G,GACA,GAAAxD,gBAAqCg7C,EAAA,EACrC,OAAA5jC,GAAAjb,EAAA6D,GAEA,IAAAgL,EAAArB,OAAAwyB,cAAA,CACA,IAAAkT,EAAA7rC,EAAA,EAAAwH,EAAAC,EACAkmD,EAAApoD,aAAoCiyC,EAAA,EAAeA,EAAA,EAASltC,KAAAuhC,EAAA7rC,GAAmBw3C,EAAA,EAAS1uC,SAAA+iC,EAAA7rC,GACxF,QAAA2tD,GAAA/5C,GAAAjb,EAAAg1D,GAEA,SAEA,SAAAC,GAAAj1D,EAAAqH,GACA,KAAArH,EAAAO,MAAAmM,qBAA0CmyC,EAAA,GAC1C,SACA,IAAApyC,MAASA,EAAAM,UAAAgD,SAAwB/P,EAAAO,MAAAmM,UACjC,IAAAD,EAAAyzB,WAAAnzB,GACA,SACA,IAAAgD,EACA,SACA,GAAA/P,EAAAyT,eAAApM,EAAA,wBACA,SACA,IAAA6tD,GAAAzoD,EAAA4xB,aAAAh3B,EAAA,EAAAoF,EAAAW,WAAAX,EAAAQ,WACA,GAAAioD,MAAAn7B,OAAA,CACA,IAAAjqB,EAAA9P,EAAAO,MAAAuP,GAMA,OALAzI,EAAA,EACAyI,EAAAmS,OAAAxV,EAAAxF,IAAAiuD,EAAAvsD,SAAA8D,EAAAxF,KAEA6I,EAAAmS,OAAAxV,EAAAxF,IAAAwF,EAAAxF,IAAAiuD,EAAAvsD,UACA3I,EAAAQ,SAAAsP,IACA,EAEA,SAEA,SAAAqlD,GAAAn1D,EAAAsK,EAAA/J,GACAP,EAAA0yD,YAAA9H,OACAtgD,EAAA02C,gBAAAzgD,EACAP,EAAA0yD,YAAA1tD,QAqCA,SAAAowD,GAAAp1D,EAAAjB,GACA,IAAAf,EAAAe,EAAAoB,QAAAk0D,EAbA,SAAAt1D,GACA,IAAAL,EAAA,GASA,OARAK,EAAAE,UACAP,GAAA,KACAK,EAAAG,UACAR,GAAA,KACAK,EAAAC,SACAN,GAAA,KACAK,EAAAI,WACAT,GAAA,KACAA,EAGA22D,CAAAt2D,GACA,UAAAf,GAAAR,GAAA,IAAAQ,GAAA,KAAAq2D,EACAY,GAAAj1D,GAAA,IAAAy0D,GAAAz0D,GAEA,IAAAhC,GAAAR,GAAA,IAAAQ,GAAA,KAAAq2D,EACAY,GAAAj1D,EAAA,IAAA80D,GAAA90D,GAEA,IAAAhC,GAAA,IAAAA,IAGA,IAAAA,GAAAR,GAAA,IAAAQ,GAAA,KAAAq2D,EACAD,GAAAp0D,GAAA,EAAAq0D,IAAAI,GAAAz0D,GAEA,IAAAhC,GAAAR,GAAA,IAAAQ,GAAA,KAAAq2D,EACAD,GAAAp0D,EAAA,EAAAq0D,IAAAS,GAAA90D,GAEA,IAAAhC,GAAAR,GAAA,IAAAQ,GAAA,KAAAq2D,EACAU,GAAA/0D,GAAA,EAAAq0D,IAAAI,GAAAz0D,GAEA,IAAAhC,GAAAR,GAAA,IAAAQ,GAAA,KAAAq2D,EAlDA,SAAAr0D,GACA,IAAAy/C,GAAAz/C,EAAAO,MAAAmM,UAAAD,MAAAoxB,aAAA,EACA,SACA,IAAA4pB,UAASA,EAAAE,eAAyB3nD,EAAAqnD,eAClC,GAAAI,GAAA,GAAAA,EAAA/3B,UAAA,GAAAi4B,GACAF,EAAAv6C,YAAA,SAAAu6C,EAAAv6C,WAAA8zC,gBAAA,CACA,IAAAt4C,EAAA++C,EAAAv6C,WACAioD,GAAAn1D,EAAA0I,EAAA,QACAgrD,WAAA,IAAAyB,GAAAn1D,EAAA0I,EAAA,aAEA,SAyCA4sD,CAAAt1D,IAAA+0D,GAAA/0D,EAAA,EAAAq0D,IAAAS,GAAA90D,GAEAq0D,IAAA72D,EAAA,WACA,IAAAQ,GAAA,IAAAA,GAAA,IAAAA,GAAA,IAAAA,IAMA,SAAAu3D,GAAAv1D,EAAA8K,GACA,IAAAumB,MAAA3iB,QAAuBA,EAAAiuB,YAAAC,WAA8B9xB,EACrD,KAAA6xB,EAAA,GAAAC,EAAA,MAAAluB,EAAA1F,YAAA,GAAA0F,EAAAxB,WAAAlE,YAAA,CACA2zB,IACAC,IACA,IAAAtyB,EAAAoE,EAAAxB,WACAmkB,EAAA9rB,KAAA+E,EAAA5H,KAAAtE,KAAAkM,EAAAlB,OAAAkB,EAAA5H,KAAAu+B,aAAA32B,EAAAlB,MAAA,MACAsF,EAAApE,EAAAoE,QAEA,IAAA8mD,EAAAx1D,EAAAwiD,SAAA,wBAA6D1P,EAAA,EAAaxJ,WAAAtpC,EAAAO,MAAAuL,QAC1EqB,EAAAsoD,KAAA1pB,EAAA5+B,EAAA4gB,cAAA,OACAge,EAAA+B,YAAA0nB,EAAAplB,kBAAA1hC,GAA4DkgB,SAAAzhB,KAC5D,IAAAiiD,EAAAliD,EAAA6+B,EAAA7+B,WAAAwoD,EAAA,EACA,KAAAxoD,GAAA,GAAAA,EAAAwiB,WAAA0/B,EAAAuG,GAAAzoD,EAAAgiB,SAAAvG,iBAAA,CACA,QAAA9qB,EAAAuxD,EAAAzwD,OAAA,EAA0Cd,GAAA,EAAQA,IAAA,CAClD,IAAA+3D,EAAAzoD,EAAA4gB,cAAAqhC,EAAAvxD,IACA,KAAAkuC,EAAA7+B,YACA0oD,EAAA9nB,YAAA/B,EAAA7+B,YACA6+B,EAAA+B,YAAA8nB,GACAF,IAEAxoD,EAAA6+B,EAAA7+B,WAMA,OAJAA,GAAA,GAAAA,EAAAwiB,UACAxiB,EAAAokC,aAAA,mBAAoD3U,KAAaC,IAAU84B,OAAgBA,IAAS,MAAUxxC,KAAAC,UAAAkN,OAGlGrmB,IAAA+gC,EAAA9yC,KAFZ+G,EAAAwiD,SAAA,0BAAAlyC,KAAAxF,KACAA,EAAA4D,QAAAirB,YAAA,EAAA7uB,EAAA4D,QAAAC,KAAA,SAIA,SAAAknD,GAAA71D,EAAA/G,EAAAyM,EAAAowD,EAAA/lB,GACA,IACA/kC,EAAAF,EADAirD,EAAAhmB,EAAAviC,OAAA9K,KAAAmG,KAAA7K,KAEA,IAAA0H,IAAAzM,EACA,YACA,IAAA+8D,EAAA/8D,IAAA68D,GAAAC,IAAArwD,GACA,GAAAswD,EAAA,CAEA,GADAh2D,EAAAwiD,SAAA,sBAAAlyC,IAAmDrX,EAAAqX,EAAArX,EAAA88D,GAAAD,KACnDC,EACA,OAAA98D,EAAA,IAA8B65C,EAAA,EAAMA,EAAA,EAAQrkC,KAAAzO,EAAAO,MAAAuL,OAAA7S,OAAAiX,QAAA,sBAAqE4iC,EAAA,EAAK/iC,MACtH,IAAAkmD,EAAAj2D,EAAAwiD,SAAA,sBAAAlyC,KAAArX,EAAA82C,EAAA+lB,IACA,GAAAG,EACAnrD,EAAAmrD,MAEA,CACA,IAAAh5C,EAAA8yB,EAAA9yB,SACAnR,OAAiBA,GAAS9L,EAAAO,MAAAi1D,EAA4B1iB,EAAA,EAAaxJ,WAAAx9B,GACnEd,EAAA4jB,SAAAb,cAAA,OACA90B,EAAAwF,MAAA,iBAAAgW,QAAAohB,IACA,IAAAtnB,EAAAvD,EAAA8iC,YAAAlf,SAAAb,cAAA,MACA8H,GACAtnB,EAAAu/B,YAAA0nB,EAAA7kB,cAAA7kC,EAAA7S,KAAA48B,EAAA5Y,aAKAjd,EAAAwiD,SAAA,sBAAAlyC,IAAmD5K,EAAA4K,EAAA5K,KACnDsF,EAsIA,SAAAtF,GACA,IAAAwwD,EAAA,sBAAA54D,KAAAoI,GACAwwD,IACAxwD,IAAAoF,MAAAorD,EAAA,GAAAv3D,SACA,IACAotC,EADAz2B,EAAAmgD,KAAA1nC,cAAA,OACAooC,EAAA,mBAAA74D,KAAAoI,IACAqmC,EAAAoqB,GAAAR,GAAAQ,EAAA,GAAAxtC,kBACAjjB,EAAAqmC,EAAArsC,IAAAmK,GAAA,IAAAA,EAAA,KAAA6B,KAAA,IAAAhG,EAAAqmC,EAAArsC,IAAAmK,GAAA,KAAAA,EAAA,KAAAjG,UAAA8H,KAAA,KAEA,GADA4J,EAAA4Y,UAAAxoB,EACAqmC,EACA,QAAAluC,EAAA,EAAuBA,EAAAkuC,EAAAptC,OAAiBd,IACxCyX,IAAAu5B,cAAA9C,EAAAluC,KAAAyX,EACA,OAAAA,EAlJA8gD,CAAA1wD,GACAo6C,GAwJA,SAAA90C,GACA,IAAAgB,EAAAhB,EAAA2rB,iBAAAv5B,EAAA,+DACA,QAAAS,EAAA,EAAmBA,EAAAmO,EAAArN,OAAkBd,IAAA,CACrC,IAAAyM,EAAA0B,EAAAnO,GACA,GAAAyM,EAAAykC,WAAApwC,QAAA,KAAA2L,EAAA6rB,aAAA7rB,EAAAyrB,YACAzrB,EAAAyrB,WAAAwE,aAAAvvB,EAAAsjC,cAAAC,eAAA,KAAAjkC,IA5JA+rD,CAAArrD,GAEA,IAAAsrD,EAAAtrD,KAAA6jC,cAAA,mBACA0nB,EAAAD,GAAA,gCAAAh5D,KAAAg5D,EAAAnrD,aAAA,sBACA,GAAAorD,KAAA,GACA,QAAA14D,GAAA04D,EAAA,GAAmC14D,EAAA,GAAAmN,EAAAkC,WAAyBrP,IAC5DmN,IAAAkC,WACA,IAAApC,EAAA,CACA,IAAA7H,EAAAjD,EAAAwiD,SAAA,oBAAAxiD,EAAAwiD,SAAA,cAAuF1P,EAAA,EAASxJ,WAAAtpC,EAAAO,MAAAuL,QAChGhB,EAAA7H,EAAA0lC,WAAA39B,GACAkS,sBAAA84C,IAAAO,GACAllC,QAAA0e,EACA/B,aAAAhjC,GACA,MAAAA,EAAAkkB,UAAAlkB,EAAAykB,cACAzkB,EAAA+qB,YAAAygC,GAAA/4D,KAAAuN,EAAA+qB,WAAA7G,UAEA,MAD4B+e,QAAA,KAK5B,GAAAsoB,EACAzrD,EA0IA,SAAAA,EAAAumB,GACA,IAAAvmB,EAAA6D,KACA,OAAA7D,EACA,IAAAqN,EAAArM,EAAAhB,EAAA4D,QAAAxB,WAAAxK,KAAAoJ,OACA,IACAqM,EAAA+L,KAAA1hB,MAAA6uB,GAEA,MAAAjvB,GACA,OAAA0I,EAEA,IAAA4D,QAASA,EAAAiuB,YAAAC,WAA8B9xB,EACvC,QAAAjN,EAAAsa,EAAAxZ,OAAA,EAAkCd,GAAA,EAAQA,GAAA,GAC1C,IAAA6E,EAAAoJ,EAAAE,MAAAmM,EAAAta,IACA,IAAA6E,KAAA8hC,mBACA,MACA91B,EAAkBokC,EAAA,EAAQrkC,KAAA/L,EAAA7C,OAAAsY,EAAAta,EAAA,GAAA6Q,IAC1BiuB,IACAC,IAEA,WAAekW,EAAA,EAAKpkC,EAAAiuB,EAAAC,GA7JpB65B,CAAAC,GAAA5rD,GAAAyrD,EAAA,IAAAA,EAAA,IAAAA,EAAA,SAIA,IADAzrD,EAAgBgoC,EAAA,EAAK9T,QAoBrB,SAAAnvB,EAAAkgC,GACA,GAAAlgC,EAAA7G,WAAA,EACA,OAAA6G,EACA,QAAAxD,EAAA0jC,EAAA3rC,MAAgCiI,GAAA,EAAQA,IAAA,CACxC,IAEAsqD,EAFAnpD,EAAAuiC,EAAAzlC,KAAA+B,GACAiS,EAAA9Q,EAAAi0B,eAAAsO,EAAAxnC,MAAA8D,IACA3N,KAmBA,GAlBAmR,EAAA4E,QAAAnK,IACA,IAAA5L,EACA,OACA,IAAAk4D,EAAA7qB,EAAAztB,EAAA2mB,aAAA36B,EAAA5H,MACA,IAAAqpC,EACA,OAAArtC,EAAA,KACA,GAAAk4D,EAAAl4D,EAAAC,QAAAg4D,EAAAh4D,QAAAk4D,GAAA9qB,EAAA4qB,EAAArsD,EAAA5L,IAAAC,OAAA,MACAD,IAAAC,OAAA,GAAAi4D,MAEA,CACAl4D,EAAAC,SACAD,IAAAC,OAAA,GAAAm4D,GAAAp4D,IAAAC,OAAA,GAAAg4D,EAAAh4D,SACA,IAAAo4D,EAAAC,GAAA1sD,EAAAyhC,GACArtC,EAAA6G,KAAAwxD,GACAz4C,IAAA4jB,UAAA60B,EAAAr0D,MACAi0D,EAAA5qB,KAGArtC,EACA,OAAmBo0C,EAAA,EAAQrkC,KAAA/P,GAE3B,OAAAmR,EAhDqBonD,CAAAnsD,EAAA4D,QAAAqhC,IAAA,IACrBpT,WAAA7xB,EAAA8xB,QAAA,CACA,IAAAD,EAAA,EAAAC,EAAA,EACA,QAAAtyB,EAAAQ,EAAA4D,QAAAxB,WAAqDyvB,EAAA7xB,EAAA6xB,YAAAryB,EAAA5H,KAAAmG,KAAAq2B,UAA0DvC,IAAAryB,IAAA4C,YAC/G,QAAA5C,EAAAQ,EAAA4D,QAAArB,UAAoDuvB,EAAA9xB,EAAA8xB,UAAAtyB,EAAA5H,KAAAmG,KAAAq2B,UAAsDtC,IAAAtyB,IAAA+C,WAC1GvC,EAAA4rD,GAAA5rD,EAAA6xB,EAAAC,GAIA,OADA58B,EAAAwiD,SAAA,kBAAAlyC,IAA2CxF,EAAAwF,EAAAxF,KAC3CA,EAEA,MAAA0rD,GAAA,gHAuCA,SAAAQ,GAAA1sD,EAAAyhC,EAAAt9B,EAAA,GACA,QAAA5Q,EAAAkuC,EAAAptC,OAAA,EAAiCd,GAAA4Q,EAAW5Q,IAC5CyM,EAAAyhC,EAAAluC,GAAAgC,OAAA,KAAoCizC,EAAA,EAAQrkC,KAAAnE,IAC5C,OAAAA,EAIA,SAAAusD,GAAA9qB,EAAA4qB,EAAArsD,EAAA4sD,EAAA9yD,GACA,GAAAA,EAAA2nC,EAAAptC,QAAAyF,EAAAuyD,EAAAh4D,QAAAotC,EAAA3nC,IAAAuyD,EAAAvyD,GAAA,CACA,IAAA6R,EAAA4gD,GAAA9qB,EAAA4qB,EAAArsD,EAAA4sD,EAAA7pD,UAAAjJ,EAAA,GACA,GAAA6R,EACA,OAAAihD,EAAAv3D,KAAAu3D,EAAAxoD,QAAA6rB,aAAA28B,EAAAluD,WAAA,EAAAiN,IAEA,GADAihD,EAAAz1B,eAAAy1B,EAAAluD,YACAk5B,UAAA99B,GAAA2nC,EAAAptC,OAAA,EAAA2L,EAAA5H,KAAAqpC,EAAA3nC,EAAA,IACA,OAAA8yD,EAAAv3D,KAAAu3D,EAAAxoD,QAAAkG,OAAuDk+B,EAAA,EAAQrkC,KAAAuoD,GAAA1sD,EAAAyhC,EAAA3nC,EAAA,OAG/D,SAAA0yD,GAAAxsD,EAAAlG,GACA,MAAAA,EACA,OAAAkG,EACA,IAAAuF,EAAAvF,EAAAoE,QAAA6rB,aAAAjwB,EAAAtB,WAAA,EAAA8tD,GAAAxsD,EAAA+C,UAAAjJ,EAAA,IACA0nC,EAAAxhC,EAAAm3B,eAAAn3B,EAAAtB,YAAA47B,WAA+DkO,EAAA,EAAQ/iC,OAAA,GACvE,OAAAzF,EAAA3K,KAAAkQ,EAAA+E,OAAAk3B,IAEA,SAAAqrB,GAAAtnD,EAAAqjC,EAAAzkC,EAAA2B,EAAAhM,EAAAw4B,GACA,IAAAtyB,EAAA4oC,EAAA,EAAArjC,EAAA3C,WAAA2C,EAAAxC,UAAA4I,EAAA3L,EAAAoE,QAMA,OALAtK,EAAAgM,EAAA,IACA6F,EAAAkhD,GAAAlhD,EAAAi9B,EAAAzkC,EAAA2B,EAAAhM,EAAA,EAAAw4B,IACAx4B,GAAAqK,IACAwH,EAAAi9B,EAAA,EAAA5oC,EAAAm3B,eAAA,GAAAmD,WAAA3uB,EAAApG,EAAA7G,WAAA,GAAA4zB,GAAAx4B,GAAAwQ,OAAAqB,GACAA,EAAArB,OAAAtK,EAAAm3B,eAAAn3B,EAAAtB,YAAA47B,WAA2EkO,EAAA,EAAQ/iC,OAAA,KACnFF,EAAA0qB,aAAA2Y,EAAA,IAAArjC,EAAA7G,WAAA,EAAAsB,EAAA3K,KAAAsW,IAEA,SAAAygD,GAAA5rD,EAAA6xB,EAAAC,GAKA,OAJAD,EAAA7xB,EAAA6xB,YACA7xB,EAAA,IAAoBgoC,EAAA,EAAKqkB,GAAArsD,EAAA4D,SAAA,EAAAiuB,EAAA7xB,EAAA6xB,UAAA,EAAA7xB,EAAA8xB,SAAAD,EAAA7xB,EAAA8xB,UACzBA,EAAA9xB,EAAA8xB,UACA9xB,EAAA,IAAoBgoC,EAAA,EAAKqkB,GAAArsD,EAAA4D,QAAA,EAAAkuB,EAAA9xB,EAAA8xB,QAAA,KAAA9xB,EAAA6xB,UAAAC,IACzB9xB,EAKA,MAAA6qD,IACAyB,OAAA,SACAC,OAAA,SACApsB,OAAA,SACAqsB,SAAA,SACAC,UAAA,SACAjvD,KAAA,oBACAwH,IAAA,iBACA0nD,IAAA,sBACAC,IAAA,uBAEA,IAAAC,GAAA,KACA,SAAAjC,KACA,OAAAiC,QAAA9oC,SAAA+oC,eAAAC,mBAAA,UAqDA,MAAAC,MACA,IAAAC,YACAC,GACA/+D,cACAsK,KAAAnE,UAAA,EACAmE,KAAAivD,UAAA,KACAjvD,KAAA00D,YAAA,KACA10D,KAAA20D,gBAAA,EACA30D,KAAA40D,WAA0Bz8C,KAAA,EAAAyL,EAAA,EAAAs/B,EAAA,EAAA9jD,KAAA,IAC1BY,KAAA60D,oBAAA,KACA70D,KAAA80D,kBAAA,EACA90D,KAAA+0D,aAAA,EACA/0D,KAAAg1D,6BAAA,EACAh1D,KAAAi1D,kBAAA,EACAj1D,KAAA2oD,WAAA,EACA3oD,KAAAk1D,kBAAA,EACAl1D,KAAA2rD,oBACA3rD,KAAAm1D,oBAAA,IACAn1D,KAAAo1D,eAAA,EACAp1D,KAAAq1D,cAAA/4D,OAAAC,OAAA,MACAyD,KAAAmwD,mBAAA,MAmBA,SAAAmF,GAAA54D,EAAAwzB,GACAxzB,EAAA4nB,MAAAuwC,oBAAA3kC,EACAxzB,EAAA4nB,MAAAwwC,kBAAA5b,KAAAC,MASA,SAAAoc,GAAA74D,GACAA,EAAAwiD,SAAA,kBAAAsW,IACA,QAAAp2D,KAAAo2D,EACA94D,EAAA4nB,MAAA+wC,cAAAj2D,IACA1C,EAAAgL,IAAAmsB,iBAAAz0B,EAAA1C,EAAA4nB,MAAA+wC,cAAAj2D,GAAA3D,IAAAg6D,GAAA/4D,EAAAjB,OAGA,SAAAg6D,GAAA/4D,EAAAjB,GACA,OAAAiB,EAAAwiD,SAAA,kBAAAqV,IACA,IAAAmB,EAAAnB,EAAA94D,EAAA2D,MACA,QAAAs2D,MAAAh5D,EAAAjB,MAAAk6D,oBAGA,SAAAC,GAAAl5D,EAAAjB,GACA,IAAAA,EAAAo6D,QACA,SACA,GAAAp6D,EAAAk6D,iBACA,SACA,QAAA3uD,EAAAvL,EAAAwgB,OAAiCjV,GAAAtK,EAAAgL,IAAkBV,IAAAyrB,WACnD,IAAAzrB,GAAA,IAAAA,EAAAolB,UACAplB,EAAA22C,YAAA32C,EAAA22C,WAAA4J,UAAA9rD,GACA,SACA,SA+DA,SAAAq6D,GAAAr6D,GAA6B,OAAS0H,KAAA1H,EAAAs6D,QAAA3yD,IAAA3H,EAAAu6D,SAKtC,SAAAC,GAAAv5D,EAAAw5D,EAAAvyD,EAAA0+C,EAAA5mD,GACA,OAAA4mD,EACA,SACA,IAAAv5C,EAAApM,EAAAO,MAAA4M,IAAAb,QAAAq5C,GACA,QAAA9nD,EAAAuO,EAAAhI,MAAA,EAAgCvG,EAAA,EAAOA,IACvC,GAAAmC,EAAAwiD,SAAAgX,EAAAlpD,GAAAzS,EAAAuO,EAAAhI,MAAAkM,EAAAtQ,EAAAiH,EAAAmF,EAAAa,UAAAb,EAAAG,OAAA1O,GAAAkB,GAAA,GACAuR,EAAAtQ,EAAAiH,EAAAmF,EAAA9B,KAAAzM,GAAAuO,EAAAG,OAAA1O,GAAAkB,GAAA,IACA,SAEA,SAEA,SAAA06D,GAAAz5D,EAAA0M,EAAA8mB,GACAxzB,EAAA05D,SACA15D,EAAA6mD,QACA,IAAA/2C,EAAA9P,EAAAO,MAAAuP,GAAAO,aAAA3D,GACA,WAAA8mB,GACA1jB,EAAAyK,QAAA,cACAva,EAAAQ,SAAAsP,GAsCA,SAAA6pD,GAAA35D,EAAAiH,EAAA0+C,EAAA5mD,EAAA6wD,GACA,OAAA2J,GAAAv5D,EAAA,gBAAAiH,EAAA0+C,EAAA5mD,IACAiB,EAAAwiD,SAAA,cAAAlyC,KAAAtQ,EAAAiH,EAAAlI,MACA6wD,EA7BA,SAAA5vD,EAAA2lD,GACA,OAAAA,EACA,SACA,IAAAiU,EAAAC,EAAAjtD,EAAA5M,EAAAO,MAAAmM,UACAE,aAAuBiyC,EAAA,IACvB+a,EAAAhtD,EAAAtC,MACA,IAAA8B,EAAApM,EAAAO,MAAA4M,IAAAb,QAAAq5C,GACA,QAAA9nD,EAAAuO,EAAAhI,MAAA,EAAgCvG,EAAA,EAAOA,IAAA,CACvC,IAAAyM,EAAAzM,EAAAuO,EAAAhI,MAAAgI,EAAAa,UAAAb,EAAA9B,KAAAzM,GACA,GAAYghD,EAAA,EAAapJ,aAAAnrC,GAAA,CAGzBuvD,EAFAD,GAAAhtD,EAAAiC,MAAAzK,MAAA,GACAvG,GAAA+O,EAAAiC,MAAAzK,OAAAgI,EAAAG,OAAAK,EAAAiC,MAAAzK,MAAA,IAAAwI,EAAAiC,MAAA5H,IACAmF,EAAAG,OAAAK,EAAAiC,MAAAzK,OAEAgI,EAAAG,OAAA1O,GACA,OAGA,aAAAg8D,IACAJ,GAAAz5D,EAA8B6+C,EAAA,EAAah/C,OAAAG,EAAAO,MAAA4M,IAAA0sD,GAAA,YAC3C,GASAC,CAAA95D,EAAA2lD,GAvCA,SAAA3lD,EAAA2lD,GACA,OAAAA,EACA,SACA,IAAAv5C,EAAApM,EAAAO,MAAA4M,IAAAb,QAAAq5C,GAAAr7C,EAAA8B,EAAAa,UACA,SAAA3C,KAAAw2B,QAA+B+d,EAAA,EAAapJ,aAAAnrC,MAC5CmvD,GAAAz5D,EAAA,IAAkC6+C,EAAA,EAAazyC,GAAA,YAC/C,GAiCA2tD,CAAA/5D,EAAA2lD,IAMA,SAAAqU,GAAAh6D,EAAAiH,EAAA0+C,EAAA5mD,GACA,OAAAw6D,GAAAv5D,EAAA,sBAAAiH,EAAA0+C,EAAA5mD,IACAiB,EAAAwiD,SAAA,oBAAAlyC,KAAAtQ,EAAAiH,EAAAlI,KAGA,SAAAiB,EAAA2lD,EAAA5mD,GACA,MAAAA,EAAAk7D,OACA,SACA,IAAA9sD,EAAAnN,EAAAO,MAAA4M,IACA,OAAAw4C,EACA,QAAAx4C,EAAA6yB,gBACAy5B,GAAAz5D,EAAkC6+C,EAAA,EAAah/C,OAAAsN,EAAA,EAAAA,EAAAuB,QAAAC,MAAA,YAC/C,GAIA,IAAAvC,EAAAe,EAAAb,QAAAq5C,GACA,QAAA9nD,EAAAuO,EAAAhI,MAAA,EAAgCvG,EAAA,EAAOA,IAAA,CACvC,IAAAyM,EAAAzM,EAAAuO,EAAAhI,MAAAgI,EAAAa,UAAAb,EAAA9B,KAAAzM,GACAy2D,EAAAloD,EAAAG,OAAA1O,GACA,GAAAyM,EAAA01B,cACAy5B,GAAAz5D,EAAkC6+C,EAAA,EAAah/C,OAAAsN,EAAAmnD,EAAA,EAAAA,EAAA,EAAAhqD,EAAAoE,QAAAC,MAAA,eAC/C,KAAiBkwC,EAAA,EAAapJ,aAAAnrC,GAG9B,SAFAmvD,GAAAz5D,EAAkC6+C,EAAA,EAAah/C,OAAAsN,EAAAmnD,GAAA,WAG/C,UAvBA4F,CAAAl6D,EAAA2lD,EAAA5mD,GA0BA,SAAAo7D,GAAAn6D,GACA,OAAAo6D,GAAAp6D,GA3JA83D,GAAAuC,QAAA,EAAAr6D,EAAAs6D,KACA,IAAAv7D,EAAAu7D,EAEA,GADAt6D,EAAA4nB,MAAAzoB,SAAA,IAAAJ,EAAAoB,SAAApB,EAAAI,UACAo7D,GAAAv6D,EAAAjB,KAEAiB,EAAA4nB,MAAAowC,YAAAj5D,EAAAoB,QACAH,EAAA4nB,MAAAqwC,gBAAAzb,KAAAC,OAIAoD,IAAAziD,GAAA,IAAA2B,EAAAoB,SAQA,GANA,KAAApB,EAAAoB,SACAH,EAAA0yD,YAAA8H,cAKA7a,GAAA,IAAA5gD,EAAAoB,SAAApB,EAAAE,SAAAF,EAAAC,QAAAD,EAAAG,QAUAc,EAAAwiD,SAAA,gBAAAlyC,KAAAtQ,EAAAjB,KAAAq2D,GAAAp1D,EAAAjB,GACAA,EAAAkd,iBAGA28C,GAAA54D,EAAA,WAdA,CACA,IAAAy8C,EAAAD,KAAAC,MACAz8C,EAAA4nB,MAAAywC,aAAA5b,EACAz8C,EAAA4nB,MAAA0wC,4BAAA5E,WAAA,KACA1zD,EAAA4nB,MAAAywC,cAAA5b,IACAz8C,EAAAwiD,SAAA,gBAAAlyC,KAAAtQ,EAAAwhD,EAAA,cACAxhD,EAAA4nB,MAAAywC,aAAA,IAES,QASTP,GAAA2C,MAAA,EAAAz6D,EAAAjB,KACA,IAAAA,EAAAoB,UACAH,EAAA4nB,MAAAzoB,UAAA,KAEA24D,GAAA4C,SAAA,EAAA16D,EAAAs6D,KACA,IAAAv7D,EAAAu7D,EACA,GAAAC,GAAAv6D,EAAAjB,OAAA47D,UACA57D,EAAAE,UAAAF,EAAAC,QAAAxB,GAAAuB,EAAAG,QACA,OACA,GAAAc,EAAAwiD,SAAA,iBAAAlyC,KAAAtQ,EAAAjB,IAEA,YADAA,EAAAkd,iBAGA,IAAArP,EAAA5M,EAAAO,MAAAmM,UACA,KAAAE,aAAyBiyC,EAAA,GAAajyC,EAAAiC,MAAAqxB,WAAAtzB,EAAAkC,MAAA,CACtC,IAAA7V,EAAA6E,OAAAC,aAAAgB,EAAA47D,UACA36D,EAAAwiD,SAAA,kBAAAlyC,KAAAtQ,EAAA4M,EAAAiC,MAAA5H,IAAA2F,EAAAkC,IAAA7H,IAAAhO,KACA+G,EAAAQ,SAAAR,EAAAO,MAAAuP,GAAA+lC,WAAA58C,GAAA6Z,kBACA/T,EAAAkd,oBAwGA,MAAA2+C,GAAAp9D,EAAA,oBACAq6D,GAAAgD,UAAA,EAAA76D,EAAAs6D,KACA,IAAAv7D,EAAAu7D,EACAt6D,EAAA4nB,MAAAzoB,SAAAJ,EAAAI,SACA,IAAA27D,EAAAX,GAAAn6D,GACAy8C,EAAAD,KAAAC,MAAA/5C,EAAA,cACA+5C,EAAAz8C,EAAA4nB,MAAAswC,UAAAz8C,KAAA,KA1GA,SAAA1c,EAAAg8D,GACA,IAAA3W,EAAA2W,EAAA7zC,EAAAnoB,EAAAs6D,QAAA2B,EAAAD,EAAAvU,EAAAznD,EAAAu6D,QACA,OAAAlV,IAAA4W,IAAA,IAwGAC,CAAAl8D,EAAAiB,EAAA4nB,MAAAswC,aAAAn5D,EAAA67D,MACA,eAAA56D,EAAA4nB,MAAAswC,UAAAx1D,KACAA,EAAA,cACA,eAAA1C,EAAA4nB,MAAAswC,UAAAx1D,OACAA,EAAA,gBAEA1C,EAAA4nB,MAAAswC,WAA4Bz8C,KAAAghC,EAAAv1B,EAAAnoB,EAAAs6D,QAAA7S,EAAAznD,EAAAu6D,QAAA52D,QAC5B,IAAAuE,EAAAjH,EAAAykD,YAAA2U,GAAAr6D,IACAkI,IAEA,eAAAvE,GACA1C,EAAA4nB,MAAA2qC,WACAvyD,EAAA4nB,MAAA2qC,UAAAlwD,OACArC,EAAA4nB,MAAA2qC,UAAA,UAUAv5D,YAAAgH,EAAAiH,EAAAlI,EAAA+7D,GAUA,IAAAna,EAAAua,EACA,GAVA53D,KAAAtD,OACAsD,KAAA2D,MACA3D,KAAAvE,QACAuE,KAAAw3D,UACAx3D,KAAAsvD,sBAAA,EACAtvD,KAAA63D,UAAA,KACA73D,KAAA83D,SAAAp7D,EAAAO,MAAA4M,IACA7J,KAAAssD,aAAA7wD,EAAA67D,IACAt3D,KAAAkvD,aAAAzzD,EAAAI,SAEA8H,EAAA0+C,QAAA,EACAhF,EAAA3gD,EAAAO,MAAA4M,IAAA5C,OAAAtD,EAAA0+C,QACAuV,EAAAj0D,EAAA0+C,WAEA,CACA,IAAAv5C,EAAApM,EAAAO,MAAA4M,IAAAb,QAAArF,OACA05C,EAAAv0C,EAAAoB,OACA0tD,EAAA9uD,EAAAhI,MAAAgI,EAAAG,SAAA,EAEA,MAAAgT,EAAAu7C,EAAA,KAAA/7D,EAAAwgB,OACA6xC,EAAA7xC,EAAAvf,EAAAolD,QAAAC,YAAA9lC,GAAA,QACAjc,KAAAic,OAAA6xC,IAAApmD,IAAA,KACA,IAAA0B,UAAaA,GAAY1M,EAAAO,OACzB,GAAAxB,EAAAk7D,QACAtZ,EAAAj+C,KAAAmG,KAAA0T,YAAA,IAAAokC,EAAAj+C,KAAAmG,KAAAgzC,YACAnvC,aAAiCmyC,EAAA,GAAanyC,EAAA+B,MAAAysD,GAAAxuD,EAAA0D,GAAA8qD,KAC9C53D,KAAA63D,WACA7wD,KAAAq2C,EACA15C,IAAAi0D,EACAG,WAAA/3D,KAAAic,QAAAjc,KAAAic,OAAAhD,WACA++C,iBAAAh4D,KAAAic,SAAA+/B,GAAAh8C,KAAAic,OAAAnB,aAAA,sBAEA9a,KAAAic,QAAAjc,KAAA63D,YAAA73D,KAAA63D,UAAAE,SAAA/3D,KAAA63D,UAAAG,iBACAh4D,KAAAtD,KAAA0yD,YAAA9H,OACAtnD,KAAA63D,UAAAE,UACA/3D,KAAAic,OAAAhD,WAAA,GACAjZ,KAAA63D,UAAAG,eACA5H,WAAA,KACApwD,KAAAtD,KAAA4nB,MAAA2qC,WAAAjvD,MACAA,KAAAic,OAAA+xB,aAAA,4BACiB,IACjBhuC,KAAAtD,KAAA0yD,YAAA1tD,SAEAhF,EAAAgkB,KAAAmT,iBAAA,UAAA7zB,KAAAi4D,GAAAj4D,KAAAi4D,GAAAzjC,KAAAx0B,OACAtD,EAAAgkB,KAAAmT,iBAAA,YAAA7zB,KAAAk4D,KAAAl4D,KAAAk4D,KAAA1jC,KAAAx0B,OACAs1D,GAAA54D,EAAA,WAEAhH,OACAsK,KAAAtD,KAAAgkB,KAAAwvC,oBAAA,UAAAlwD,KAAAi4D,IACAj4D,KAAAtD,KAAAgkB,KAAAwvC,oBAAA,YAAAlwD,KAAAk4D,MACAl4D,KAAA63D,WAAA73D,KAAAic,SACAjc,KAAAtD,KAAA0yD,YAAA9H,OACAtnD,KAAA63D,UAAAE,SACA/3D,KAAAic,OAAAiwC,gBAAA,aACAlsD,KAAA63D,UAAAG,eACAh4D,KAAAic,OAAAiwC,gBAAA,mBACAlsD,KAAAtD,KAAA0yD,YAAA1tD,SAEA1B,KAAAsvD,sBACAc,WAAA,IAAArB,GAAA/uD,KAAAtD,OACAsD,KAAAtD,KAAA4nB,MAAA2qC,UAAA,KAEAv5D,GAAA+F,GAEA,GADAuE,KAAAjB,QACAiB,KAAAtD,KAAAgL,IAAAsa,SAAAvmB,EAAAwgB,QACA,OACA,IAAAtY,EAAA3D,KAAA2D,IACA3D,KAAAtD,KAAAO,MAAA4M,KAAA7J,KAAA83D,WACAn0D,EAAA3D,KAAAtD,KAAAykD,YAAA2U,GAAAr6D,KACAuE,KAAAkvD,eAAAvrD,EACA2xD,GAAAt1D,KAAAtD,KAAA,WAEA25D,GAAAr2D,KAAAtD,KAAAiH,QAAA0+C,OAAA5mD,EAAAuE,KAAAssD,YACA7wD,EAAAkd,iBAEA,GAAAld,EAAAk7D,SACA32D,KAAAw3D,SAEArb,GAAAn8C,KAAA63D,YAAA73D,KAAA63D,UAAA7wD,KAAAw2B,QAQA1jC,KAAAkG,KAAAtD,KAAAO,MAAAmM,qBAAkEmyC,EAAA,IAClE52C,KAAAC,IAAAD,KAAAwzD,IAAAx0D,MAAA3D,KAAAtD,KAAAO,MAAAmM,UAAA+B,MAAAxG,KAAAwzD,IAAAx0D,MAAA3D,KAAAtD,KAAAO,MAAAmM,UAAA0D,MAAA,IACAqpD,GAAAn2D,KAAAtD,KAAuC6+C,EAAA,EAASltC,KAAArO,KAAAtD,KAAAO,MAAA4M,IAAAb,QAAArF,QAAA,WAChDlI,EAAAkd,kBAGA28C,GAAAt1D,KAAAtD,KAAA,WAGAhH,KAAA+F,IACAuE,KAAAkvD,eAAAvqD,KAAAwzD,IAAAn4D,KAAAvE,MAAAmoB,EAAAnoB,EAAAs6D,SAAA,GACApxD,KAAAwzD,IAAAn4D,KAAAvE,MAAAynD,EAAAznD,EAAAu6D,SAAA,KACAh2D,KAAAkvD,cAAA,GACAoG,GAAAt1D,KAAAtD,KAAA,WACA,GAAAjB,EAAA28D,SACAp4D,KAAAjB,SAhHArC,EAAAiH,EAAAlI,IAAA+7D,KAEA,eAAAp4D,EAzDA,SAAA1C,EAAAiH,EAAA0+C,EAAA5mD,GACA,OAAAw6D,GAAAv5D,EAAA,sBAAAiH,EAAA0+C,EAAA5mD,IACAiB,EAAAwiD,SAAA,oBAAAlyC,KAAAtQ,EAAAiH,EAAAlI,KAuDAi7D,IAAAh6D,EAAAiH,QAAA0+C,OAAA5mD,GACAA,EAAAkd,iBAGA28C,GAAA54D,EAAA,cAkHA,SAAAu6D,GAAAv6D,EAAAjB,GACA,QAAAiB,EAAAisD,cAYAxM,GAAAx3C,KAAAwzD,IAAA18D,EAAA48D,UAAA37D,EAAA4nB,MAAA6wC,oBAAA,OACAz4D,EAAA4nB,MAAA6wC,oBAAA,KACA,GApBAZ,GAAA+D,UAAA57D,KACAm6D,GAAAn6D,GACA44D,GAAA54D,EAAA,aAEA63D,GAAAgE,YAAA77D,IAAAm6D,GAAAn6D,IAqBA,MAAA87D,GAAAjc,EAAA,OA8CA,SAAAkc,GAAA/7D,EAAAg8D,GACAC,aAAAj8D,EAAA4nB,MAAA4wC,kBACAwD,GAAA,IACAh8D,EAAA4nB,MAAA4wC,iBAAA9E,WAAA,IAAA0G,GAAAp6D,GAAAg8D,IAEA,SAAAE,GAAAl8D,GAKA,IAJAA,EAAAisD,YACAjsD,EAAA4nB,MAAAqkC,WAAA,EACAjsD,EAAA4nB,MAAA6wC,mBAKA,WACA,IAAA15D,EAAA6vB,SAAA6yB,YAAA,SAEA,OADA1iD,EAAA2iD,UAAA,eACA3iD,EAAA48D,UARAQ,IAEAn8D,EAAA4nB,MAAAqnC,iBAAAtwD,OAAA,GACAqB,EAAA4nB,MAAAqnC,iBAAAlrD,MAAAq4D,mBAUA,SAAAhC,GAAAp6D,EAAAq8D,GAAA,GACA,KAAAxc,GAAA7/C,EAAA0yD,YAAA4J,cAAA,IAIA,GAFAt8D,EAAA0yD,YAAA8H,aACA0B,GAAAl8D,GACAq8D,GAAAr8D,EAAAolD,SAAAplD,EAAAolD,QAAAkD,MAAA,CACA,IAAA17C,EAAAglD,GAAA5xD,GAKA,OAJA4M,MAAAiG,GAAA7S,EAAAO,MAAAmM,WACA1M,EAAAQ,SAAAR,EAAAO,MAAAuP,GAAAO,aAAAzD,IAEA5M,EAAA4mD,YAAA5mD,EAAAO,QACA,EAEA,UA/EAu3D,GAAAyE,iBAAAzE,GAAA0E,kBAAAx8D,KACA,IAAAA,EAAAisD,UAAA,CACAjsD,EAAA0yD,YAAA+J,QACA,IAAAl8D,MAAaA,GAAQP,EAAAoM,EAAA7L,EAAAmM,UAAAmC,MACrB,GAAAtO,EAAAmM,UAAAqD,QACAxP,EAAAw0C,cACA3oC,EAAAiyB,YAAAjyB,EAAAyxB,cAAAzxB,EAAAgB,WAAA6P,MAAA/O,KAAAkZ,IAAA,IAAAA,EAAA1kB,KAAAmG,KAAA2W,YAEAxf,EAAA08D,WAAA18D,EAAAO,MAAAw0C,aAAA3oC,EAAA6Q,QACAm9C,GAAAp6D,GAAA,GACAA,EAAA08D,WAAA,UAOA,GAJAtC,GAAAp6D,GAIAs/C,GAAA/+C,EAAAmM,UAAAqD,OAAA3D,EAAAyxB,eAAAzxB,EAAAiyB,YAAAjyB,EAAAgB,WAAA6P,MAAAte,OAAA,CACA,IAAAiO,EAAA5M,EAAAqnD,eACA,QAAA/8C,EAAAsC,EAAA66C,UAAAt9B,EAAAvd,EAAA+6C,YAAwEr9C,GAAA,GAAAA,EAAAolB,UAAA,GAAAvF,GAA2C,CACnH,IAAA5d,EAAA4d,EAAA,EAAA7f,EAAA+C,UAAA/C,EAAAykC,WAAA5kB,EAAA,GACA,IAAA5d,EACA,MACA,MAAAA,EAAAmjB,SAAA,CACA9iB,EAAAy9C,SAAA99C,IAAAojB,UAAAhxB,QACA,MAGA2L,EAAAiC,EACA4d,GAAA,GAKAnqB,EAAA4nB,MAAAqkC,WAAA,EAEA8P,GAAA/7D,EAAA87D,MAEAhE,GAAA6E,eAAA,EAAA38D,EAAAjB,KACAiB,EAAAisD,YACAjsD,EAAA4nB,MAAAqkC,WAAA,EACAjsD,EAAA4nB,MAAA6wC,mBAAA15D,EAAA48D,UACAI,GAAA/7D,EAAA,OAgEA,MAAA48D,GAAAj/D,GAAAyhD,EAAA,IACAO,GAAAK,EAAA,IA2CA,SAAA6c,GAAA78D,EAAA/G,EAAAyM,EAAA3G,GACA,IAAA+L,EAAA+qD,GAAA71D,EAAA/G,EAAAyM,EAAA1F,EAAA4nB,MAAAzoB,SAAAa,EAAAO,MAAAmM,UAAAmC,OACA,GAAA7O,EAAAwiD,SAAA,cAAAlyC,KAAAtQ,EAAAjB,EAAA+L,GAAkEgoC,EAAA,EAAK/iC,QACvE,SACA,IAAAjF,EACA,SACA,IAAAgyD,EA5BA,SAAAhyD,GACA,UAAAA,EAAA6xB,WAAA,GAAA7xB,EAAA8xB,SAAA,GAAA9xB,EAAA4D,QAAA1F,WAAA8B,EAAA4D,QAAAxB,WAAA,KA2BA6vD,CAAAjyD,GACAgF,EAAAgtD,EACA98D,EAAAO,MAAAuP,GAAA8N,qBAAAk/C,EAAA98D,EAAA4nB,MAAAzoB,UACAa,EAAAO,MAAAuP,GAAAktD,iBAAAlyD,GAEA,OADA9K,EAAAQ,SAAAsP,EAAAgD,iBAAAyH,QAAA,YAAAA,QAAA,qBACA,EArDAs9C,GAAAl4D,KAAAm4D,GAAAz9B,IAAA,EAAAr6B,EAAAs6D,KACA,IAAAv7D,EAAAu7D,EACA1tD,EAAA5M,EAAAO,MAAAmM,UAAA2tB,EAAA,OAAAt7B,EAAA2D,KACA,GAAAkK,EAAAmD,MACA,OAEA,IAAA4S,EAAAi6C,GAAA,KAAA79D,EAAAk+D,cACAnyD,EAAA8B,EAAA8B,WAAA1D,IAAgCA,EAAA/R,QAAYs8D,GAAAv1D,EAAA8K,GAC5C6X,GACA5jB,EAAAkd,iBACA0G,EAAAu6C,YACAv6C,EAAAw6C,QAAA,YAAAnyD,EAAAkjB,WACAvL,EAAAw6C,QAAA,aAAAlkE,IAvCA,SAAA+G,EAAAgL,GAGA,IAAAhL,EAAAgL,IAAA+qB,WACA,OACA,IAAAgW,EAAA/rC,EAAAgL,IAAA+qB,WAAA+X,YAAAlf,SAAAb,cAAA,QACAge,EAAA+B,YAAA9iC,GACA+gC,EAAAltB,MAAA2vC,QAAA,6CACA,IAAA5hD,EAAAm9C,eAAA1oC,EAAAuN,SAAA0xB,cACAj/B,EAAA+7C,mBAAApyD,GAIAhL,EAAAgL,IAAAqyD,OACAzwD,EAAAm7C,kBACAn7C,EAAA6wB,SAAApc,GACAqyC,WAAA,KACA3nB,EAAAhW,YACAgW,EAAAhW,WAAAi5B,YAAAjjB,GACA/rC,EAAA6mD,SACK,IAsBLyW,CAAAt9D,EAAAgL,GAEAqvB,GACAr6B,EAAAQ,SAAAR,EAAAO,MAAAuP,GAAAkjC,kBAAAlgC,iBAAAyH,QAAA,oBAqCAu9C,GAAAyF,MAAA,EAAAv9D,EAAAs6D,KACA,IAAAv7D,EAAAu7D,EAKA,GAAAt6D,EAAAisD,YAAApM,EACA,OACA,IAAAl9B,EAAAi6C,GAAA,KAAA79D,EAAAk+D,cACAt6C,GAAAk6C,GAAA78D,EAAA2iB,EAAA66C,QAAA,cAAA76C,EAAA66C,QAAA,aAAAz+D,GACAA,EAAAkd,iBA1CA,SAAAjc,EAAAjB,GACA,IAAAiB,EAAAgL,IAAA+qB,WACA,OACA,IAAA+/B,EAAA91D,EAAA4nB,MAAAzoB,UAAAa,EAAAO,MAAAmM,UAAAmC,MAAArB,OAAA9K,KAAAmG,KAAA7K,KACAuhB,EAAAvf,EAAAgL,IAAA+qB,WAAA+X,YAAAlf,SAAAb,cAAA+nC,EAAA,mBACAA,IACAv2C,EAAAyhC,gBAAA,QACAzhC,EAAAV,MAAA2vC,QAAA,6CACAjvC,EAAAsnC,QACA6M,WAAA,KACA1zD,EAAA6mD,QACAtnC,EAAAwW,YACAxW,EAAAwW,WAAAi5B,YAAAzvC,GACAu2C,EACA+G,GAAA78D,EAAAuf,EAAAnZ,MAAA,KAAArH,GAEA89D,GAAA78D,EAAAuf,EAAA4W,YAAA5W,EAAA2O,UAAAnvB,IACK,IA2BL0+D,CAAAz9D,EAAAjB,KAQA,MAAA2+D,GAAAlgE,EAAA,mBACAq6D,GAAA8F,UAAA,EAAA39D,EAAAs6D,KACA,IAAAv7D,EAAAu7D,EACA/H,EAAAvyD,EAAA4nB,MAAA2qC,UAGA,GAFAA,GACAA,EAAAlwD,QACAtD,EAAA6+D,aACA,OACA,IAAAhxD,EAAA5M,EAAAO,MAAAmM,UACAzF,EAAA2F,EAAAmD,MAAA,KAAA/P,EAAAykD,YAAA2U,GAAAr6D,IACA,GAAAkI,UAAA2F,EAAA6B,MAAAxH,QAAA2F,aAAiEiyC,EAAA,EAAajyC,EAAAwD,GAAA,EAAAxD,EAAAwD,UAC9E,GAAAmiD,KAAA4I,UACAn7D,EAAAQ,SAAAR,EAAAO,MAAAuP,GAAAO,aAAiDwuC,EAAA,EAAah/C,OAAAG,EAAAO,MAAA4M,IAAAolD,EAAA4I,UAAAl0D,YAE9D,GAAAlI,EAAAwgB,QAAA,GAAAxgB,EAAAwgB,OAAAmQ,SAAA,CACA,IAAAytB,EAAAn9C,EAAAolD,QAAAC,YAAAtmD,EAAAwgB,QAAA,GACA49B,KAAA7yC,KAAA5H,KAAAmG,KAAA0T,WAAA4gC,GAAAn9C,EAAAolD,SACAplD,EAAAQ,SAAAR,EAAAO,MAAAuP,GAAAO,aAAqDwuC,EAAA,EAAah/C,OAAAG,EAAAO,MAAA4M,IAAAgwC,EAAAmI,aAElE,IAAAx6C,EAAA9K,EAAAO,MAAAmM,UAAAgC,WAAA1D,IAAiDA,EAAA/R,QAAYs8D,GAAAv1D,EAAA8K,GAC7D/L,EAAA6+D,aAAAV,YACAn+D,EAAA6+D,aAAAT,QAAAP,GAAA,mBAAA5xD,EAAAkjB,WAEAnvB,EAAA6+D,aAAAC,cAAA,WACAjB,IACA79D,EAAA6+D,aAAAT,QAAA,aAAAlkE,GACA+G,EAAA89D,SAAA,UA/BA9kE,YAAA8R,EAAA0wD,GACAl4D,KAAAwH,QACAxH,KAAAk4D,SA6BA1wD,GAAA/L,EAAA2+D,OAEA7F,GAAAkG,QAAA/9D,KACA,IAAA89D,EAAA99D,EAAA89D,SACA99C,OAAA0zC,WAAA,KACA1zD,EAAA89D,cACA99D,EAAA89D,SAAA,OACK,MAELhG,GAAAkG,SAAAlG,GAAAmG,UAAA,EAAA3hC,EAAAl6B,MAAA6Z,kBACA67C,GAAAoG,KAAA,EAAAl+D,EAAAs6D,KACA,IAAAv7D,EAAAu7D,EACAwD,EAAA99D,EAAA89D,SAEA,GADA99D,EAAA89D,SAAA,MACA/+D,EAAA6+D,aACA,OACA,IAAAO,EAAAn+D,EAAAykD,YAAA2U,GAAAr6D,IACA,IAAAo/D,EACA,OACA,IAAAC,EAAAp+D,EAAAO,MAAA4M,IAAAb,QAAA6xD,EAAAl3D,KACA,IAAAm3D,EACA,OACA,IAAAtzD,EAAAgzD,KAAAhzD,MACAA,EACA9K,EAAAwiD,SAAA,kBAAAlyC,IAA+CxF,EAAAwF,EAAAxF,KAG/CA,EAAA+qD,GAAA71D,EAAAjB,EAAA6+D,aAAAJ,QAAAZ,GAAA,qBAAAA,GAAA,KAAA79D,EAAA6+D,aAAAJ,QAAA,gBAAAY,GAEA,IAAA5C,KAAAsC,GAAA/+D,EAAA2+D,KACA,GAAA19D,EAAAwiD,SAAA,aAAAlyC,KAAAtQ,EAAAjB,EAAA+L,GAAiEgoC,EAAA,EAAK/iC,MAAAyrD,IAEtE,YADAz8D,EAAAkd,iBAGA,IAAAnR,EACA,OACA/L,EAAAkd,iBACA,IAAAoiD,EAAAvzD,EAA4BlL,OAAAk/C,EAAA,EAAAl/C,CAASI,EAAAO,MAAA4M,IAAAixD,EAAAn3D,IAAA6D,GAAAszD,EAAAn3D,IACrC,MAAAo3D,IACAA,EAAAD,EAAAn3D,KACA,IAAA6I,EAAA9P,EAAAO,MAAAuP,GACA0rD,GACA1rD,EAAAkjC,kBACA,IAAA/rC,EAAA6I,EAAAf,QAAArP,IAAA2+D,GACAC,EAAA,GAAAxzD,EAAA6xB,WAAA,GAAA7xB,EAAA8xB,SAAA,GAAA9xB,EAAA4D,QAAA1F,WACAu1D,EAAAzuD,EAAA3C,IAKA,GAJAmxD,EACAxuD,EAAAgrC,iBAAA7zC,IAAA6D,EAAA4D,QAAAxB,YAEA4C,EAAA6qC,aAAA1zC,IAAA6D,GACAgF,EAAA3C,IAAA0F,GAAA0rD,GACA,OACA,IAAAnyD,EAAA0D,EAAA3C,IAAAb,QAAArF,GACA,GAAAq3D,GAAkBzf,EAAA,EAAapJ,aAAA3qC,EAAA4D,QAAAxB,aAC/Bd,EAAAa,WAAAb,EAAAa,UAAAktB,WAAArvB,EAAA4D,QAAAxB,YACA4C,EAAAO,aAAA,IAA4BwuC,EAAA,EAAazyC,QAEzC,CACA,IAAAwB,EAAAkC,EAAAf,QAAArP,IAAA2+D,GACAvuD,EAAAf,QAAA2H,KAAA5G,EAAAf,QAAA2H,KAAA/X,OAAA,GAAA8V,QAAA,CAAAgF,EAAAC,EAAAuiC,EAAAC,IAAAtuC,EAAAsuC,GACApsC,EAAAO,aAAA2hD,GAAAhyD,EAAAoM,EAAA0D,EAAA3C,IAAAb,QAAAsB,KAEA5N,EAAA6mD,QACA7mD,EAAAQ,SAAAsP,EAAAyK,QAAA,qBAEAs9C,GAAAhR,MAAA7mD,KACAA,EAAA05D,UACA15D,EAAA0yD,YAAA9H,OACA5qD,EAAAgL,IAAAsrB,UAAAnU,IAAA,uBACAniB,EAAA0yD,YAAA1tD,QACAhF,EAAA05D,SAAA,EACAhG,WAAA,KACA1zD,EAAAolD,SAAAplD,EAAAmyD,aAAAnyD,EAAA0yD,YAAAC,iBAAA9/C,GAAA7S,EAAAqnD,iBACAgL,GAAAryD,IACS,OAGT63D,GAAAwF,KAAA,EAAAr9D,EAAAs6D,KACA,IAAAv7D,EAAAu7D,EACAt6D,EAAA05D,UACA15D,EAAA0yD,YAAA9H,OACA5qD,EAAAgL,IAAAsrB,UAAA2C,OAAA,uBACAj5B,EAAA0yD,YAAA1tD,QACAjG,EAAAy/D,eAAAx+D,EAAAgL,IAAAsa,SAAAvmB,EAAAy/D,gBACAx+D,EAAA0yD,YAAAC,iBAAA3wC,QACAhiB,EAAA05D,SAAA,KAGA7B,GAAA4G,YAAA,EAAAz+D,EAAAs6D,KAMA,GAAAl9D,GAAAyiD,GAAA,yBALAya,EAKAx+C,UAAA,CACA9b,EAAA0yD,YAAAgM,YACA,IAAAhG,eAAaA,GAAiB14D,EAAA4nB,MAC9B8rC,WAAA,KACA,GAAA1zD,EAAA4nB,MAAA8wC,kBACA,OAIA,GAFA14D,EAAAgL,IAAAqyD,OACAr9D,EAAA6mD,QACA7mD,EAAAwiD,SAAA,gBAAAlyC,KAAAtQ,EAAAwhD,EAAA,iBACA,OACA,IAAA3M,QAAiBA,GAAU70C,EAAAO,MAAAmM,UAE3BmoC,KAAA5tC,IAAA,GACAjH,EAAAQ,SAAAR,EAAAO,MAAAuP,GAAAmS,OAAA4yB,EAAA5tC,IAAA,EAAA4tC,EAAA5tC,KAAA6L,mBACS,OAIT,QAAAhT,MAAAg4D,GACAD,GAAA/3D,IAAAg4D,GAAAh4D,IAEA,SAAA6+D,GAAAp3D,EAAAC,GACA,GAAAD,GAAAC,EACA,SACA,QAAA+G,KAAAhH,EACA,GAAAA,EAAAgH,KAAA/G,EAAA+G,GACA,SACA,QAAAA,KAAA/G,EACA,KAAA+G,KAAAhH,GACA,SACA,eAEAq3D,GACA5lE,YAAA0jB,EAAA7T,GACAvF,KAAAoZ,QACApZ,KAAAuF,QAAAg2D,GACAv7D,KAAA4vC,KAAA5vC,KAAAuF,KAAAqqC,MAAA,EAEAl6C,IAAA+V,EAAA4U,EAAAwG,EAAA20C,GACA,IAAA73D,IAAaA,EAAAy0C,WAAe3sC,EAAA4sC,UAAAh4B,EAAAlV,KAAAqwD,EAAAx7D,KAAA4vC,KAAA,QAC5B,OAAAwI,EAAA,SAAAgD,GAAAz3C,EAAAkjB,EAAAljB,EAAAkjB,EAAA7mB,MAEAtK,QAAa,SACbA,GAAAkY,GACA,OAAA5N,MAAA4N,GACAA,aAAA0tD,KACAt7D,KAAAuF,KAAA3I,KAAAoD,KAAAuF,KAAA3I,KAAAgR,EAAArI,KAAA3I,KACAoD,KAAAoZ,OAAAxL,EAAAwL,OAAAiiD,GAAAr7D,KAAAuF,KAAAqI,EAAArI,OAEA7P,QAAAsR,GACAhH,KAAAuF,KAAA6/C,SACAplD,KAAAuF,KAAA6/C,QAAAp+C,UAGAy0D,GACA/lE,YAAAoQ,EAAAP,GACAvF,KAAA8F,QACA9F,KAAAuF,QAAAg2D,GAEA7lE,IAAA+V,EAAA4U,EAAAwG,EAAA20C,GACA,IAAArwD,EAAAM,EAAArP,IAAAikB,EAAAlV,KAAAqwD,EAAAx7D,KAAAuF,KAAAm2D,gBAAA,KAAA70C,EACA/Z,EAAArB,EAAArP,IAAAikB,EAAAvT,GAAA0uD,EAAAx7D,KAAAuF,KAAAo2D,aAAA,MAAA90C,EACA,OAAA1b,GAAA2B,EAAA,SAAAsuC,GAAAjwC,EAAA2B,EAAA9M,MAEAtK,MAAAsjC,EAAA3Y,GAAoB,OAAAA,EAAAlV,KAAAkV,EAAAvT,GACpBpX,GAAAkY,GACA,OAAA5N,MAAA4N,GACAA,aAAA6tD,IAAAJ,GAAAr7D,KAAA8F,MAAA8H,EAAA9H,QACAu1D,GAAAr7D,KAAAuF,KAAAqI,EAAArI,MAEA7P,UAAA2qB,GAAqB,OAAAA,EAAAjhB,gBAAAq8D,GACrB/lE,kBAEAwtC,GACAxtC,YAAAoQ,EAAAP,GACAvF,KAAA8F,QACA9F,KAAAuF,QAAAg2D,GAEA7lE,IAAA+V,EAAA4U,EAAAwG,EAAA20C,GACA,IAAArwD,EAAAM,EAAA4sC,UAAAh4B,EAAAlV,KAAAqwD,EAAA,GACA,GAAArwD,EAAAitC,QACA,YACA,IAAAtrC,EAAArB,EAAA4sC,UAAAh4B,EAAAvT,GAAA0uD,GAAA,GACA,OAAA1uD,EAAAsrC,SAAAtrC,EAAAnJ,KAAAwH,EAAAxH,IACA,KACA,IAAAy3C,GAAAjwC,EAAAxH,IAAAkjB,EAAA/Z,EAAAnJ,IAAAkjB,EAAA7mB,MAEAtK,MAAAsR,EAAAqZ,GACA,IAA6Bjb,GAA7BH,MAAaA,EAAA4hB,UAAgB7f,EAAAoE,QAAA4b,UAAA3G,EAAAlV,MAC7B,OAAA0b,GAAAxG,EAAAlV,QAAA/F,EAAA4B,EAAA5B,MAAAH,IAAAwxB,QAAA5P,EAAAzhB,EAAAC,UAAAgb,EAAAvT,GAEApX,GAAAkY,GACA,OAAA5N,MAAA4N,GACAA,aAAAs1B,IAAAm4B,GAAAr7D,KAAA8F,MAAA8H,EAAA9H,QACAu1D,GAAAr7D,KAAAuF,KAAAqI,EAAArI,MAEA7P,kBAOA0lD,GAIA1lD,YAIAyV,EAKA2B,EAIA1N,GACAY,KAAAmL,OACAnL,KAAA8M,KACA9M,KAAAZ,OAKA1J,KAAAyV,EAAA2B,GACA,WAAAsuC,GAAAjwC,EAAA2B,EAAA9M,KAAAZ,MAKA1J,GAAAkY,EAAAiZ,EAAA,GACA,OAAA7mB,KAAAZ,KAAAmQ,GAAA3B,EAAAxO,OAAAY,KAAAmL,KAAA0b,GAAAjZ,EAAAzC,MAAAnL,KAAA8M,GAAA+Z,GAAAjZ,EAAAd,GAKApX,IAAA+V,EAAAob,EAAA20C,GACA,OAAAx7D,KAAAZ,KAAAhD,IAAAqP,EAAAzL,KAAA6mB,EAAA20C,GAUA9lE,cAAAiO,EAAAyV,EAAA7T,GACA,WAAA61C,GAAAz3C,IAAA,IAAA23D,GAAAliD,EAAA7T,IAMA7P,cAAAyV,EAAA2B,EAAAhH,EAAAP,GACA,WAAA61C,GAAAjwC,EAAA2B,EAAA,IAAA2uD,GAAA31D,EAAAP,IAOA7P,YAAAyV,EAAA2B,EAAAhH,EAAAP,GACA,WAAA61C,GAAAjwC,EAAA2B,EAAA,IAAAo2B,GAAAp9B,EAAAP,IAMAA,WAAgB,OAAAvF,KAAAZ,KAAAmG,KAIhBpF,aAAkB,OAAAH,KAAAZ,gBAAAq8D,IAElB,MAAAtiC,MAAAoiC,YAOAlgB,GAIA3lD,YAAAkmE,EAAAp7C,GACAxgB,KAAA47D,QAAAvgE,OAAAugE,EAAAziC,GACAn5B,KAAAwgB,WAAAnlB,OAAAmlB,EAAA2Y,GAMAzjC,cAAAmU,EAAAgyD,GACA,OAAAA,EAAAxgE,OAAAygE,GAAAD,EAAAhyD,EAAA,EAAA0xD,IAAA9uD,GAUA/W,KAAAgM,EAAA4I,EAAAyxD,GACA,IAAA3gE,KAEA,OADA4E,KAAAg8D,UAAA,MAAAt6D,EAAA,EAAAA,EAAA,MAAA4I,EAAA,IAAAA,EAAAlP,EAAA,EAAA2gE,GACA3gE,EAEA1F,UAAAgM,EAAA4I,EAAAlP,EAAAyrB,EAAAk1C,GACA,QAAAxhE,EAAA,EAAuBA,EAAAyF,KAAA47D,MAAAvgE,OAAuBd,IAAA,CAC9C,IAAA8lB,EAAArgB,KAAA47D,MAAArhE,GACA8lB,EAAAlV,MAAAb,GAAA+V,EAAAvT,IAAApL,KAAAq6D,KAAA17C,EAAA9a,QACAnK,EAAA6G,KAAAoe,EAAAhkB,KAAAgkB,EAAAlV,KAAA0b,EAAAxG,EAAAvT,GAAA+Z,IAEA,QAAAtsB,EAAA,EAAuBA,EAAAyF,KAAAwgB,SAAAnlB,OAA0Bd,GAAA,EACjD,GAAAyF,KAAAwgB,SAAAjmB,GAAA+P,GAAAtK,KAAAwgB,SAAAjmB,EAAA,GAAAmH,EAAA,CACA,IAAAu6D,EAAAj8D,KAAAwgB,SAAAjmB,GAAA,EACAyF,KAAAwgB,SAAAjmB,EAAA,GAAAyhE,UAAAt6D,EAAAu6D,EAAA3xD,EAAA2xD,EAAA7gE,EAAAyrB,EAAAo1C,EAAAF,IAQArmE,IAAA+V,EAAA5B,EAAApK,GACA,OAAAO,MAAAyM,IAAA,GAAAhB,EAAA2H,KAAA/X,OACA2E,KACAA,KAAAk8D,SAAAzwD,EAAA5B,EAAA,IAAApK,GAAA87D,IAKA7lE,SAAA+V,EAAAzE,EAAA6f,EAAA20C,EAAA/7D,GACA,IAAA08D,EACA,QAAA5hE,EAAA,EAAuBA,EAAAyF,KAAA47D,MAAAvgE,OAAuBd,IAAA,CAC9C,IAAA6hE,EAAAp8D,KAAA47D,MAAArhE,GAAA6B,IAAAqP,EAAAob,EAAA20C,GACAY,KAAAh9D,KAAAi9D,MAAAr1D,EAAAo1D,IACAD,WAAAl6D,KAAAm6D,GACA38D,EAAA68D,UACA78D,EAAA68D,SAAAt8D,KAAA47D,MAAArhE,GAAAgL,MAEA,OAAAvF,KAAAwgB,SAAAnlB,OAyOA,SAAAkhE,EAAAJ,EAAA1wD,EAAAzE,EAAA6f,EAAA20C,EAAA/7D,GACA,IAAA+gB,EAAA+7C,EAAA/0D,QAGArO,EAAA,CAAAqjE,EAAAC,EAAAC,EAAAC,KACA,QAAApiE,EAAA,EAAuBA,EAAAimB,EAAAnlB,OAAqBd,GAAA,GAC5C,IAAAqiE,EAAAtyD,EAAAkW,EAAAjmB,EAAA,GACA,GAAA+P,EAAA,GAAAkyD,EAAAlyD,EAAAkxD,EACA,SACA,IAAA95D,EAAA8e,EAAAjmB,GAAAihE,EACAiB,GAAA/6D,EACA8e,EAAAjmB,EAAA,GAAAiiE,GAAA96D,GAAA,KAEAg7D,GAAA71C,IAAA+1C,EAAAD,EAAAD,GAAAD,EAAAD,MACAh8C,EAAAjmB,IAAAqiE,EACAp8C,EAAAjmB,EAAA,IAAAqiE,KAIA,QAAAriE,EAAA,EAAmBA,EAAAkR,EAAA2H,KAAA/X,OAAyBd,IAC5CkR,EAAA2H,KAAA7Y,GAAA4W,QAAAhY,GAGA,IAAA0jE,GAAA,EACA,QAAAtiE,EAAA,EAAmBA,EAAAimB,EAAAnlB,OAAqBd,GAAA,EACxC,GAAAimB,EAAAjmB,EAAA,MACA,OAAAimB,EAAAjmB,EAAA,IACAsiE,GAAA,EACAr8C,EAAAjmB,EAAA,MACA,SAEA,IAAA4Q,EAAAM,EAAArP,IAAAmgE,EAAAhiE,GAAAihE,GAAAsB,EAAA3xD,EAAA0b,EACA,GAAAi2C,EAAA,GAAAA,GAAA91D,EAAAoE,QAAAC,KAAA,CACAwxD,GAAA,EACA,SAGA,IAAA/vD,EAAArB,EAAArP,IAAAmgE,EAAAhiE,EAAA,GAAAihE,GAAA,GAAAuB,EAAAjwD,EAAA+Z,GACA5hB,MAAiBA,EAAA4hB,OAAAm2C,GAA6Bh2D,EAAAoE,QAAA4b,UAAA81C,GAC9CG,EAAAj2D,EAAAkwB,WAAAjyB,GACA,GAAAg4D,GAAAD,GAAAF,GAAAE,EAAAC,EAAA53D,UAAA03D,EAAA,CACA,IAAAX,EAAA57C,EAAAjmB,EAAA,GACA2hE,SAAAzwD,EAAAwxD,EAAA9xD,EAAA,EAAAoxD,EAAAhiE,GAAAihE,EAAA,EAAA/7D,GACA28D,GAAA3vD,IACA+T,EAAAjmB,GAAAuiE,EACAt8C,EAAAjmB,EAAA,GAAAwiE,EACAv8C,EAAAjmB,EAAA,GAAA6hE,IAGA57C,EAAAjmB,EAAA,MACAsiE,GAAA,QAIAA,GAAA,EAIA,GAAAA,EAAA,CACA,IAAAhB,EA2BA,SAAAr7C,EAAA+7C,EAAAV,EAAApwD,EAAAob,EAAA20C,EAAA/7D,GAEA,SAAAy9D,EAAAn6D,EAAAy4D,GACA,QAAAjhE,EAAA,EAAuBA,EAAAwI,EAAA64D,MAAAvgE,OAAsBd,IAAA,CAC7C,IAAA6hE,EAAAr5D,EAAA64D,MAAArhE,GAAA6B,IAAAqP,EAAAob,EAAA20C,GACAY,EACAP,EAAA55D,KAAAm6D,GACA38D,EAAA68D,UACA78D,EAAA68D,SAAAv5D,EAAA64D,MAAArhE,GAAAgL,MAEA,QAAAhL,EAAA,EAAuBA,EAAAwI,EAAAyd,SAAAnlB,OAAyBd,GAAA,EAChD2iE,EAAAn6D,EAAAyd,SAAAjmB,EAAA,GAAAwI,EAAAyd,SAAAjmB,GAAAihE,EAAA,GAEA,QAAAjhE,EAAA,EAAmBA,EAAAimB,EAAAnlB,OAAqBd,GAAA,GACxC,GAAAimB,EAAAjmB,EAAA,IACA2iE,EAAA18C,EAAAjmB,EAAA,GAAAgiE,EAAAhiE,GAAAihE,EAAA,GACA,OAAAK,EA3CAsB,CAAA38C,EAAA+7C,EAAAJ,EAAA1wD,EAAAob,EAAA20C,EAAA/7D,GACAqjC,EAAAg5B,GAAAD,EAAA70D,EAAA,EAAAvH,GACA08D,EAAAr5B,EAAA84B,MACA,QAAArhE,EAAA,EAAuBA,EAAAimB,EAAAnlB,OAAqBd,GAAA,EAC5CimB,EAAAjmB,EAAA,OACAimB,EAAA7V,OAAApQ,EAAA,GACAA,GAAA,GAEA,QAAAA,EAAA,EAAA0G,EAAA,EAA8B1G,EAAAuoC,EAAAtiB,SAAAnlB,OAA2Bd,GAAA,GACzD,IAAA4Q,EAAA23B,EAAAtiB,SAAAjmB,GACA,KAAA0G,EAAAuf,EAAAnlB,QAAAmlB,EAAAvf,GAAAkK,GACAlK,GAAA,EACAuf,EAAA7V,OAAA1J,EAAA,EAAA6hC,EAAAtiB,SAAAjmB,GAAAuoC,EAAAtiB,SAAAjmB,EAAA,GAAAuoC,EAAAtiB,SAAAjmB,EAAA,KAGA,WAAA8gD,GAAA8gB,EAAAvqC,KAAAwrC,IAAA58C,GAlTA68C,CAAAr9D,KAAAwgB,SAAA27C,MAAA1wD,EAAAzE,EAAA6f,EAAA20C,EAAA/7D,GAEA08D,EAAA,IAAA9gB,GAAA8gB,EAAAvqC,KAAAwrC,IAAAjkC,IAAA1sB,GAOA/W,IAAAmU,EAAAgyD,GACA,OAAAA,EAAAxgE,OAEA2E,MAAAyM,GACA4uC,GAAA9+C,OAAAsN,EAAAgyD,GACA77D,KAAAs9D,SAAAzzD,EAAAgyD,EAAA,GAHA77D,KAKAtK,SAAAmU,EAAAgyD,EAAAh1C,GACA,IAAArG,EAAAmgC,EAAA,EACA92C,EAAAsH,QAAA,CAAA8rD,EAAAD,KACA,IAAAznC,EAAAgoC,EAAAP,EAAAn2C,EACA,GAAA0O,EAAAioC,GAAA3B,EAAAoB,EAAAM,GAAA,CAIA,IAFA/8C,IACAA,EAAAxgB,KAAAwgB,SAAAhZ,SACAm5C,EAAAngC,EAAAnlB,QAAAmlB,EAAAmgC,GAAAqc,GACArc,GAAA,EACAngC,EAAAmgC,IAAAqc,EACAx8C,EAAAmgC,EAAA,GAAAngC,EAAAmgC,EAAA,GAAA2c,SAAAL,EAAA1nC,EAAAgoC,EAAA,GAEA/8C,EAAA7V,OAAAg2C,EAAA,EAAAqc,IAAAC,EAAA53D,SAAAy2D,GAAAvmC,EAAA0nC,EAAAM,EAAA,EAAAhC,KACA5a,GAAA,KAEA,IAAAib,EAAA6B,GAAA9c,EAAA+c,GAAA7B,MAAAh1C,GACA,QAAAtsB,EAAA,EAAuBA,EAAAqhE,EAAAvgE,OAAkBd,IACzCqhE,EAAArhE,GAAA6E,KAAAi9D,MAAAxyD,EAAA+xD,EAAArhE,KACAqhE,EAAAjxD,OAAApQ,IAAA,GACA,WAAA8gD,GAAAugB,EAAAvgE,OAAA2E,KAAA47D,MAAAppD,OAAAopD,GAAAhqC,KAAAwrC,IAAAp9D,KAAA47D,MAAAp7C,GAAAxgB,KAAAwgB,UAMA9qB,OAAAmmE,GACA,UAAAA,EAAAxgE,QAAA2E,MAAAyM,GACAzM,KACAA,KAAA29D,YAAA9B,EAAA,GAEAnmE,YAAAmmE,EAAAh1C,GACA,IAAArG,EAAAxgB,KAAAwgB,SAAAo7C,EAAA57D,KAAA47D,MACA,QAAArhE,EAAA,EAAuBA,EAAAimB,EAAAnlB,OAAqBd,GAAA,GAC5C,IAAAg7B,EACApqB,EAAAqV,EAAAjmB,GAAAssB,EAAA/Z,EAAA0T,EAAAjmB,EAAA,GAAAssB,EACA,QAAAxG,EAAApf,EAAA,EAAiCA,EAAA46D,EAAAxgE,OAAwB4F,KACzDof,EAAAw7C,EAAA56D,KACAof,EAAAlV,QAAAkV,EAAAvT,OACA+uD,EAAA56D,GAAA,MACAs0B,WAAAtzB,KAAAoe,IAGA,IAAAkV,EACA,SACA/U,GAAAxgB,KAAAwgB,WACAA,EAAAxgB,KAAAwgB,SAAAhZ,SACA,IAAAo2D,EAAAp9C,EAAAjmB,EAAA,GAAAojE,YAAApoC,EAAApqB,EAAA,GACAyyD,GAAAnxD,GACA+T,EAAAjmB,EAAA,GAAAqjE,GAGAp9C,EAAA7V,OAAApQ,EAAA,GACAA,GAAA,GAGA,GAAAqhE,EAAAvgE,OACA,QAAAglB,EAAA9lB,EAAA,EAAiCA,EAAAshE,EAAAxgE,OAAwBd,IACzD,GAAA8lB,EAAAw7C,EAAAthE,GACA,QAAA0G,EAAA,EAAmCA,EAAA26D,EAAAvgE,OAAkB4F,IACrD26D,EAAA36D,GAAAsO,GAAA8Q,EAAAwG,KACA+0C,GAAA57D,KAAA47D,QACAA,EAAA57D,KAAA47D,MAAAp0D,SACAo0D,EAAAjxD,OAAA1J,IAAA,IAGA,OAAAuf,GAAAxgB,KAAAwgB,UAAAo7C,GAAA57D,KAAA47D,MACA57D,KACA47D,EAAAvgE,QAAAmlB,EAAAnlB,OAAA,IAAAggD,GAAAugB,EAAAp7C,GAAA/T,GAKA/W,SAAAmxB,EAAA7f,GACA,GAAAhH,MAAAyM,GACA,OAAAzM,KACA,GAAAgH,EAAA0vB,OACA,OAAA2kB,GAAA5uC,MACA,IAAArH,EAAAw2D,EACA,QAAArhE,EAAA,EAAuBA,EAAAyF,KAAAwgB,SAAAnlB,OAA0Bd,GAAA,EACjD,GAAAyF,KAAAwgB,SAAAjmB,IAAAssB,EAAA,CACA7mB,KAAAwgB,SAAAjmB,IAAAssB,IACAzhB,EAAApF,KAAAwgB,SAAAjmB,EAAA,IACA,MAEA,IAAAmH,EAAAmlB,EAAA,EAAAvc,EAAA5I,EAAAsF,EAAAoE,QAAAC,KACA,QAAA9Q,EAAA,EAAuBA,EAAAyF,KAAA47D,MAAAvgE,OAAuBd,IAAA,CAC9C,IAAAsjE,EAAA79D,KAAA47D,MAAArhE,GACA,GAAAsjE,EAAA1yD,KAAAb,GAAAuzD,EAAA/wD,GAAApL,GAAAm8D,EAAAz+D,gBAAAq8D,GAAA,CACA,IAAAtwD,EAAAxG,KAAAE,IAAAnD,EAAAm8D,EAAA1yD,MAAAzJ,EAAAoL,EAAAnI,KAAAC,IAAA0F,EAAAuzD,EAAA/wD,IAAApL,EACAyJ,EAAA2B,IACA8uD,WAAA35D,KAAA47D,EAAAxhE,KAAA8O,EAAA2B,KAGA,GAAA8uD,EAAA,CACA,IAAAkC,EAAA,IAAAziB,GAAAugB,EAAAhqC,KAAAwrC,IAAAjkC,IACA,OAAA/zB,EAAA,IAAA24D,IAAAD,EAAA14D,IAAA04D,EAEA,OAAA14D,GAAAqH,GAKA/W,GAAAkY,GACA,GAAA5N,MAAA4N,EACA,SACA,KAAAA,aAAAytC,KACAr7C,KAAA47D,MAAAvgE,QAAAuS,EAAAguD,MAAAvgE,QACA2E,KAAAwgB,SAAAnlB,QAAAuS,EAAA4S,SAAAnlB,OACA,SACA,QAAAd,EAAA,EAAuBA,EAAAyF,KAAA47D,MAAAvgE,OAAuBd,IAC9C,IAAAyF,KAAA47D,MAAArhE,GAAAgV,GAAA3B,EAAAguD,MAAArhE,IACA,SACA,QAAAA,EAAA,EAAuBA,EAAAyF,KAAAwgB,SAAAnlB,OAA0Bd,GAAA,EACjD,GAAAyF,KAAAwgB,SAAAjmB,IAAAqT,EAAA4S,SAAAjmB,IACAyF,KAAAwgB,SAAAjmB,EAAA,IAAAqT,EAAA4S,SAAAjmB,EAAA,KACAyF,KAAAwgB,SAAAjmB,EAAA,GAAAgV,GAAA3B,EAAA4S,SAAAjmB,EAAA,IACA,SACA,SAKA7E,OAAAsR,GACA,OAAAg3D,GAAAh+D,KAAAi+D,YAAAj3D,IAKAtR,YAAAsR,GACA,GAAAhH,MAAAyM,GACA,OAAA0sB,GACA,GAAAnyB,EAAA01B,gBAAA18B,KAAA47D,MAAAhxD,KAAA6wD,GAAAyC,IACA,OAAAl+D,KAAA47D,MACA,IAAAxgE,KACA,QAAAb,EAAA,EAAuBA,EAAAyF,KAAA47D,MAAAvgE,OAAuBd,IAC9CyF,KAAA47D,MAAArhE,GAAA6E,gBAAAq8D,IACArgE,EAAA6G,KAAAjC,KAAA47D,MAAArhE,IAEA,OAAAa,GAMAigD,GAAA5uC,MAAA,IAAA4uC,UAIAA,GAAA2iB,iBACA,MAAAvxD,GAAA4uC,GAAA5uC,YAIAsxD,GACAroE,YAAAyoE,GACAn+D,KAAAm+D,UAEAzoE,IAAA+V,EAAA5B,GACA,MAAAu0D,EAAAp+D,KAAAm+D,QAAA/hE,IAAAiiE,KAAAjiE,IAAAqP,EAAA5B,EAAA0xD,KACA,OAAAwC,GAAA5yD,KAAAizD,GAEA1oE,SAAAmxB,EAAAzhB,GACA,GAAAA,EAAAsxB,OACA,OAAA2kB,GAAA5uC,MACA,IAAA8oB,KACA,QAAAh7B,EAAA,EAAuBA,EAAAyF,KAAAm+D,QAAA9iE,OAAyBd,IAAA,CAChD,IAAAa,EAAA4E,KAAAm+D,QAAA5jE,GAAA8uD,SAAAxiC,EAAAzhB,GACAhK,GAAAqR,KAEArR,aAAA2iE,GACAxoC,IAAA/iB,OAAApX,EAAA+iE,SAEA5oC,EAAAtzB,KAAA7G,IAEA,OAAA2iE,GAAA5yD,KAAAoqB,GAEA7/B,GAAAkY,GACA,KAAAA,aAAAmwD,KACAnwD,EAAAuwD,QAAA9iE,QAAA2E,KAAAm+D,QAAA9iE,OACA,SACA,QAAAd,EAAA,EAAuBA,EAAAyF,KAAAm+D,QAAA9iE,OAAyBd,IAChD,IAAAyF,KAAAm+D,QAAA5jE,GAAAgV,GAAA3B,EAAAuwD,QAAA5jE,IACA,SACA,SAEA7E,OAAAsR,GACA,IAAA5L,EAAAu2B,GAAA,EACA,QAAAp3B,EAAA,EAAuBA,EAAAyF,KAAAm+D,QAAA9iE,OAAyBd,IAAA,CAChD,IAAA6uD,EAAAppD,KAAAm+D,QAAA5jE,GAAA0jE,YAAAj3D,GACA,GAAAoiD,EAAA/tD,OAEA,GAAAD,EAGA,CACAu2B,IACAv2B,IAAAoM,QACAmqB,GAAA,GAEA,QAAA1wB,EAAA,EAA+BA,EAAAmoD,EAAA/tD,OAAmB4F,IAClD7F,EAAA6G,KAAAmnD,EAAAnoD,SARA7F,EAAAguD,EAWA,OAAAhuD,EAAA4iE,GAAArsC,EAAAv2B,IAAAw2B,KAAAwrC,KAAAjkC,GAIAzjC,YAAAyoE,GACA,OAAAA,EAAA9iE,QACA,cAAAoR,GACA,cAAA0xD,EAAA,GACA,mBAAAJ,GAAAI,KAgFA,SAAAV,GAAAa,EAAAz3C,GACA,IAAAA,IAAAy3C,EAAAjjE,OACA,OAAAijE,EACA,IAAAljE,KACA,QAAAb,EAAA,EAAmBA,EAAA+jE,EAAAjjE,OAAkBd,IAAA,CACrC,IAAA8lB,EAAAi+C,EAAA/jE,GACAa,EAAA6G,KAAA,IAAAm5C,GAAA/6B,EAAAlV,KAAA0b,EAAAxG,EAAAvT,GAAA+Z,EAAAxG,EAAAjhB,OAEA,OAAAhE,EAoBA,SAAAoiE,GAAAc,EAAAt3D,EAAA6f,GACA,GAAA7f,EAAA0vB,OACA,YACA,IAAApsB,EAAAuc,EAAA7f,EAAA3B,SAAAkwB,EAAA,KACA,QAAAlV,EAAA9lB,EAAA,EAAyBA,EAAA+jE,EAAAjjE,OAAkBd,KAC3C8lB,EAAAi+C,EAAA/jE,KAAA8lB,EAAAlV,KAAA0b,GAAAxG,EAAAvT,GAAAxC,KACAirB,WAAAtzB,KAAAoe,GACAi+C,EAAA/jE,GAAA,MAGA,OAAAg7B,EAEA,SAAAmoC,GAAA7oD,GACA,IAAAzZ,KACA,QAAAb,EAAA,EAAmBA,EAAAsa,EAAAxZ,OAAkBd,IACrC,MAAAsa,EAAAta,IACAa,EAAA6G,KAAA4S,EAAAta,IACA,OAAAa,EAMA,SAAA0gE,GAAAwC,EAAAt3D,EAAA6f,EAAApnB,GACA,IAAA+gB,KAAA+9C,GAAA,EACAv3D,EAAAmK,QAAA,CAAA8rD,EAAAuB,KACA,IAAAjpC,EAAAioC,GAAAc,EAAArB,EAAAuB,EAAA33C,GACA,GAAA0O,EAAA,CACAgpC,GAAA,EACA,IAAAE,EAAA3C,GAAAvmC,EAAA0nC,EAAAp2C,EAAA23C,EAAA,EAAA/+D,GACAg/D,GAAAhyD,IACA+T,EAAAve,KAAAu8D,IAAAvB,EAAA53D,SAAAo5D,MAGA,IAAArV,EAAAqU,GAAAc,EAAAb,GAAAY,MAAAz3C,GAAA+K,KAAAwrC,IACA,QAAA7iE,EAAA,EAAmBA,EAAA6uD,EAAA/tD,OAAmBd,IACtC6uD,EAAA7uD,GAAA6E,KAAAi9D,MAAAr1D,EAAAoiD,EAAA7uD,MACAkF,EAAA68D,UACA78D,EAAA68D,SAAAlT,EAAA7uD,GAAAgL,MACA6jD,EAAAz+C,OAAApQ,IAAA,IAEA,OAAA6uD,EAAA/tD,QAAAmlB,EAAAnlB,OAAA,IAAAggD,GAAA+N,EAAA5oC,GAAA/T,GAKA,SAAA2wD,GAAAn5D,EAAAC,GACA,OAAAD,EAAAkH,KAAAjH,EAAAiH,MAAAlH,EAAA6I,GAAA5I,EAAA4I,GAMA,SAAAkxD,GAAAM,GACA,IAAAI,EAAAJ,EACA,QAAA/jE,EAAA,EAAmBA,EAAAmkE,EAAArjE,OAAA,EAAwBd,IAAA,CAC3C,IAAA8lB,EAAAq+C,EAAAnkE,GACA,GAAA8lB,EAAAlV,MAAAkV,EAAAvT,GACA,QAAA7L,EAAA1G,EAAA,EAA+B0G,EAAAy9D,EAAArjE,OAAoB4F,IAAA,CACnD,IAAAV,EAAAm+D,EAAAz9D,GACA,GAAAV,EAAA4K,MAAAkV,EAAAlV,KAAA,CAYA5K,EAAA4K,KAAAkV,EAAAvT,KACA4xD,GAAAJ,IACAI,EAAAJ,EAAA92D,SAGAk3D,EAAAnkE,GAAA8lB,EAAAhkB,KAAAgkB,EAAAlV,KAAA5K,EAAA4K,MACAwzD,GAAAD,EAAAz9D,EAAAof,EAAAhkB,KAAAkE,EAAA4K,KAAAkV,EAAAvT,MAEA,MAnBAvM,EAAAuM,IAAAuT,EAAAvT,KACA4xD,GAAAJ,IACAI,EAAAJ,EAAA92D,SAGAk3D,EAAAz9D,GAAAV,EAAAlE,KAAAkE,EAAA4K,KAAAkV,EAAAvT,IACA6xD,GAAAD,EAAAz9D,EAAA,EAAAV,EAAAlE,KAAAgkB,EAAAvT,GAAAvM,EAAAuM,OAiBA,OAAA4xD,EAEA,SAAAC,GAAA9pD,EAAAta,EAAA0uD,GACA,KAAA1uD,EAAAsa,EAAAxZ,QAAA+hE,GAAAnU,EAAAp0C,EAAAta,IAAA,GACAA,IACAsa,EAAAlK,OAAApQ,EAAA,EAAA0uD,GAGA,SAAA2V,GAAAliE,GACA,IAAA64B,KAQA,OAPA74B,EAAAwiD,SAAA,cAAAlyC,IACA,IAAA5R,EAAA4R,EAAAtQ,EAAAO,OACA7B,MAAAqR,IACA8oB,EAAAtzB,KAAA7G,KAEAsB,EAAA+yD,eACAl6B,EAAAtzB,KAAAo5C,GAAA9+C,OAAAG,EAAAO,MAAA4M,KAAAnN,EAAA+yD,cAAAxG,QACA8U,GAAA5yD,KAAAoqB,GAGA,MAAAspC,IACAC,WAAA,EACAC,eAAA,EACAC,uBAAA,EACAtzC,YAAA,EACAuzC,mBAAA,EACAR,SAAA,GAGAS,GAAA7kE,GAAAyhD,GAAA,SACAqjB,GACAzpE,cACAsK,KAAA2mD,WAAA,KACA3mD,KAAA4mD,aAAA,EACA5mD,KAAAmkD,UAAA,KACAnkD,KAAAqkD,YAAA,EAEA3uD,IAAA4T,GACAtJ,KAAA2mD,WAAAr9C,EAAAq9C,WACA3mD,KAAA4mD,aAAAt9C,EAAAs9C,aACA5mD,KAAAmkD,UAAA76C,EAAA66C,UACAnkD,KAAAqkD,YAAA/6C,EAAA+6C,YAEA3uD,QACAsK,KAAA2mD,WAAA3mD,KAAAmkD,UAAA,KAEAzuD,GAAA4T,GACA,OAAAA,EAAAq9C,YAAA3mD,KAAA2mD,YAAAr9C,EAAAs9C,cAAA5mD,KAAA4mD,cACAt9C,EAAA66C,WAAAnkD,KAAAmkD,WAAA76C,EAAA+6C,aAAArkD,KAAAqkD,mBAGA+a,GACA1pE,YAAAgH,EAAA2iE,GACAr/D,KAAAtD,OACAsD,KAAAq/D,kBACAr/D,KAAAs/D,SACAt/D,KAAAg5D,cAAA,EACAh5D,KAAAu/D,SAAA,KACAv/D,KAAAqvD,iBAAA,IAAA8P,GACAn/D,KAAAw/D,WAAA,KACAx/D,KAAAy/D,6BAAA,EACAz/D,KAAAu/D,SAAA7iD,OAAAgjD,kBACA,IAAAhjD,OAAAgjD,iBAAAC,IACA,QAAAplE,EAAA,EAA+BA,EAAAolE,EAAAtkE,OAAsBd,IACrDyF,KAAAs/D,MAAAr9D,KAAA09D,EAAAplE,IAKAF,GAAAyhD,GAAA,IAAA6jB,EAAA/0D,KAAAkZ,GAAA,aAAAA,EAAA1kB,MAAA0kB,EAAA87C,aAAAvkE,QACA,iBAAAyoB,EAAA1kB,MAAA0kB,EAAA8jC,SAAAvsD,OAAAyoB,EAAA7H,OAAAoQ,UAAAhxB,QACA2E,KAAAo7D,YAEAp7D,KAAAm5D,UAEA+F,KACAl/D,KAAAw/D,WAAA1gE,KACAkB,KAAAs/D,MAAAr9D,MAAiCga,OAAAnd,EAAAmd,OAAA7c,KAAA,gBAAAwoD,SAAA9oD,EAAA+gE,YACjC7/D,KAAAo7D,eAGAp7D,KAAA8/D,kBAAA9/D,KAAA8/D,kBAAAtrC,KAAAx0B,MAEAtK,YACAsK,KAAAg5D,aAAA,IACAh5D,KAAAg5D,aAAAt8C,OAAA0zC,WAAA,KAAyDpwD,KAAAg5D,cAAA,EAAwBh5D,KAAAm5D,SAAgB,KAEjGzjE,aACAsK,KAAAg5D,cAAA,IACAt8C,OAAAi8C,aAAA34D,KAAAg5D,cACAh5D,KAAAg5D,cAAA,EACAh5D,KAAAm5D,SAGAzjE,QACAsK,KAAAu/D,WACAv/D,KAAAu/D,SAAAQ,cACA//D,KAAAu/D,SAAAS,QAAAhgE,KAAAtD,KAAAgL,IAAAm3D,KAEA7+D,KAAAw/D,YACAx/D,KAAAtD,KAAAgL,IAAAmsB,iBAAA,2BAAA7zB,KAAAw/D,YACAx/D,KAAAswD,mBAEA56D,OACA,GAAAsK,KAAAu/D,SAAA,CACA,IAAAU,EAAAjgE,KAAAu/D,SAAAQ,cACA,GAAAE,EAAA5kE,OAAA,CACA,QAAAd,EAAA,EAA+BA,EAAA0lE,EAAA5kE,OAAiBd,IAChDyF,KAAAs/D,MAAAr9D,KAAAg+D,EAAA1lE,IACAmiB,OAAA0zC,WAAA,IAAApwD,KAAAm5D,QAAA,IAEAn5D,KAAAu/D,SAAAW,aAEAlgE,KAAAw/D,YACAx/D,KAAAtD,KAAAgL,IAAAwoD,oBAAA,2BAAAlwD,KAAAw/D,YACAx/D,KAAAwvD,sBAEA95D,mBACAsK,KAAAtD,KAAAgL,IAAAsjC,cAAAnX,iBAAA,kBAAA7zB,KAAA8/D,mBAEApqE,sBACAsK,KAAAtD,KAAAgL,IAAAsjC,cAAAklB,oBAAA,kBAAAlwD,KAAA8/D,mBAEApqE,2BACAsK,KAAAy/D,6BAAA,EACArP,WAAA,IAAApwD,KAAAy/D,6BAAA,MAEA/pE,oBACA,GAAAi7D,GAAA3wD,KAAAtD,MAAA,CAEA,GAAAsD,KAAAy/D,4BACA,OAAA1Q,GAAA/uD,KAAAtD,MAIA,GAAArC,GAAAyhD,GAAA,KAAA97C,KAAAtD,KAAAO,MAAAmM,UAAAqD,MAAA,CACA,IAAAnD,EAAAtJ,KAAAtD,KAAAqnD,eAEA,GAAAz6C,EAAA66C,WAAAhH,EAAA7zC,EAAA66C,UAAA76C,EAAA+6C,YAAA/6C,EAAAq9C,WAAAr9C,EAAAs9C,cACA,OAAA5mD,KAAAo7D,YAEAp7D,KAAAm5D,SAEAzjE,kBACAsK,KAAAqvD,iBAAAtsD,IAAA/C,KAAAtD,KAAAqnD,gBAEAruD,sBAAA4T,GACA,MAAAA,EAAA00C,WACA,SACA,IAAAmiB,EAAA72D,EAAA20C,WAAA,GAAAmiB,wBACAvmB,EAAA75C,KAAAtD,KAAAolD,QAAAC,YAAAoe,GACA,OAAAtmB,KAAA2S,gBACAptD,KAAA,YACA6c,OAAA,GAAAkkD,EAAA/zC,SAAA+zC,EAAA1tC,WAAA0tC,KAEAngE,KAAAuvD,mBACA,QALA,EAQA75D,QACA,IAAAsK,KAAAtD,KAAAolD,SAAA9hD,KAAAg5D,cAAA,EACA,OACA,IAAA2G,EAAA3/D,KAAAu/D,SAAAv/D,KAAAu/D,SAAAQ,iBACA//D,KAAAs/D,MAAAjkE,SACAskE,EAAA3/D,KAAAs/D,MAAA9sD,OAAAmtD,GACA3/D,KAAAs/D,MAAAjkE,OAAA,GAEA,IAAAiO,EAAAtJ,KAAAtD,KAAAqnD,eACAr0C,GAAA1P,KAAAy/D,8BAAAz/D,KAAAqvD,iBAAA9/C,GAAAjG,IAAAqnD,GAAA3wD,KAAAtD,QAAAsD,KAAAqgE,sBAAA/2D,GACA6B,GAAA,EAAA2B,GAAA,EAAAwzD,GAAA,EAAAzpD,KACA,GAAA7W,KAAAtD,KAAAkyD,SACA,QAAAr0D,EAAA,EAA2BA,EAAAolE,EAAAtkE,OAAsBd,IAAA,CACjD,IAAAa,EAAA4E,KAAAugE,iBAAAZ,EAAAplE,GAAAsc,GACAzb,IACA+P,IAAA,EAAA/P,EAAA+P,KAAAxG,KAAAC,IAAAxJ,EAAA+P,QACA2B,IAAA,EAAA1R,EAAA0R,GAAAnI,KAAAE,IAAAzJ,EAAA0R,MACA1R,EAAAklE,WACAA,GAAA,IAIA,GAAAtkB,GAAAnlC,EAAAxb,OAAA,GACA,IAAAmlE,EAAA3pD,EAAA7L,OAAAzE,GAAA,MAAAA,EAAAqlB,UACA,MAAA40C,EAAAnlE,OAAA,CACA,IAAA4I,EAAAu8D,EAAA,GAAAt8D,EAAAs8D,EAAA,GACAv8D,EAAAwuB,YAAAxuB,EAAAwuB,uBAAAvuB,EAAAuuB,WACAvuB,EAAAyxB,SAEA1xB,EAAA0xB,WAGAxqB,GAAA,GAAAuE,KACAvE,GAAA,IACAnL,KAAAtD,KAAAolD,QAAAuF,UAAAl8C,EAAA2B,GAiEA,SAAApQ,GACA,GAAA+jE,GACA,OACAA,IAAA,EACA,UAAAtV,iBAAAzuD,EAAAgL,KAAAg5D,YACAn+D,QAAA,iLArEAo+D,CAAA3gE,KAAAtD,OAEAsD,KAAAq/D,gBAAAl0D,EAAA2B,EAAAwzD,EAAAzpD,GACA7W,KAAAtD,KAAAolD,SAAA9hD,KAAAtD,KAAAolD,QAAAkD,MACAhlD,KAAAtD,KAAA4mD,YAAAtjD,KAAAtD,KAAAO,OACA+C,KAAAqvD,iBAAA9/C,GAAAjG,IACAylD,GAAA/uD,KAAAtD,MACAsD,KAAAqvD,iBAAAtsD,IAAAuG,IAGA5T,iBAAAiyD,EAAA9wC,GAEA,GAAAA,EAAAmpB,QAAA2nB,EAAA1rC,SAAA,EACA,YACA,IAAA49B,EAAA75C,KAAAtD,KAAAolD,QAAAC,YAAA4F,EAAA1rC,QACA,iBAAA0rC,EAAAvoD,OACAy6C,GAAA75C,KAAAtD,KAAAolD,SAAA,mBAAA6F,EAAAiZ,eAEA,SAAAjZ,EAAAiZ,gBAAAjZ,EAAAC,WAAAD,EAAA1rC,OAAApU,aAAA,UACA,YACA,IAAAgyC,KAAA2S,eAAA7E,GACA,YACA,gBAAAA,EAAAvoD,KAAA,CACA,QAAA7E,EAAA,EAA2BA,EAAAotD,EAAAkZ,WAAAxlE,OAA2Bd,IACtDsc,EAAA5U,KAAA0lD,EAAAkZ,WAAAtmE,IACA,GAAAs/C,EAAAxO,YAAAwO,EAAAxO,YAAAwO,EAAAnyC,MAAAmyC,EAAAxO,WAAArpB,SAAA2lC,EAAA1rC,QACA,OAAwB9Q,KAAA0uC,EAAAmI,UAAAl1C,GAAA+sC,EAAAoI,UACxB,IAAAt7C,EAAAghD,EAAAxd,gBAAA5pC,EAAAonD,EAAAx7B,YACA,GAAA9xB,GAAAyhD,GAAA,IAAA6L,EAAAkZ,WAAAxlE,OAGA,QAAAd,EAAA,EAA+BA,EAAAotD,EAAAkZ,WAAAxlE,OAA2Bd,IAAA,CAC1D,IAAA4vC,gBAAyBA,EAAAhe,eAA+Bw7B,EAAAkZ,WAAAtmE,KACxD4vC,GAAA1lB,MAAAlmB,UAAAyhC,QAAAvhC,KAAAkpD,EAAAkZ,WAAA12B,GAAA,KACAxjC,EAAAwjC,KACAhe,GAAA1H,MAAAlmB,UAAAyhC,QAAAvhC,KAAAkpD,EAAAkZ,WAAA10C,GAAA,KACA5rB,EAAA4rB,GAGA,IAAA85B,EAAAt/C,KAAA8rB,YAAAk1B,EAAA1rC,OACA0gC,EAAAh2C,GAAA,IACAwE,EAAA0uC,EAAA+L,gBAAA+B,EAAA1rC,OAAAgqC,GAAA,GACAC,EAAA3lD,KAAAkyB,YAAAk1B,EAAA1rC,OACA0gC,EAAAp8C,GAAAonD,EAAA1rC,OAAAwvB,WAAApwC,OAEA,OAAoB8P,OAAA2B,GADpB+sC,EAAA+L,gBAAA+B,EAAA1rC,OAAAiqC,EAAA,IAGA,oBAAAyB,EAAAvoD,MACoB+L,KAAA0uC,EAAAyI,WAAAzI,EAAA0I,OAAAz1C,GAAA+sC,EAAAyL,SAAAzL,EAAA0I,SAIpBp3C,KAAA0uC,EAAAyI,WACAx1C,GAAA+sC,EAAAyL,SAKAgb,SAAA3Y,EAAA1rC,OAAAoQ,WAAAs7B,EAAAC,WAKA,IAAA6Y,IAAA,EA2DA,SAAA/1B,GAAAhjC,GACA,IAAAmyC,EAAAnyC,EAAAi2C,WACA,GAAA9D,EACA,OAAAA,EAAAinB,YAEA,SAAAp5D,EAAAkkB,UAAAlkB,EAAA+qB,WAAA,CAIA,GAAA0pB,GAAA,aAAAhiD,KAAAuN,EAAA+qB,WAAA7G,UAAA,CACA,IAAA6D,EAAAnE,SAAAb,cAAA,OAEA,OADAgF,EAAA+a,YAAAlf,SAAAb,cAAA,QACoBgF,QAEpB,GAAA/nB,EAAA+qB,WAAA1oB,WAAArC,GAAAy0C,GAAA,gBAAAhiD,KAAAuN,EAAA+qB,WAAA7G,UACA,OAAoB+e,QAAA,QAGpB,UAAAjjC,EAAAkkB,UAAAlkB,EAAAG,aAAA,oBACA,OAAgB8iC,QAAA,GAEhB,YAEA,SAAAo2B,GAAArkE,EAAAyO,EAAA2B,EAAAwzD,EAAAO,GACA,GAAA11D,EAAA,GACA,IAAA+kB,EAAAxzB,EAAA4nB,MAAAwwC,kBAAA5b,KAAAC,MAAA,GAAAz8C,EAAA4nB,MAAAuwC,oBAAA,KACAnlD,EAAA4+C,GAAA5xD,EAAAwzB,GACA,GAAAxgB,IAAAhT,EAAAO,MAAAmM,UAAAmG,GAAAG,GAAA,CACA,IAAAlD,EAAA9P,EAAAO,MAAAuP,GAAAO,aAAA2C,GACA,WAAAwgB,EACA1jB,EAAAyK,QAAA,cACA,OAAAiZ,GACA1jB,EAAAgD,iBACA9S,EAAAQ,SAAAsP,GAEA,OAEA,IAAAmuB,EAAAj+B,EAAAO,MAAA4M,IAAAb,QAAAmC,GACA61D,EAAArmC,EAAA4B,YAAAzvB,GACA3B,EAAAwvB,EAAA1xB,OAAA+3D,EAAA,GACAl0D,EAAApQ,EAAAO,MAAA4M,IAAAb,QAAA8D,GAAApD,MAAAs3D,EAAA,GACA,IAAA13D,EAAA5M,EAAAO,MAAAmM,UACAlK,EAvFA,SAAAxC,EAAAukE,EAAAC,GACA,IAEAxuC,GAFS1rB,KAAAkD,EAAA+7C,aAAAC,WAAA/6C,OAAA2B,MAA+CpQ,EAAAolD,QAAAsE,WAAA6a,EAAAC,GACxDrjB,EAAAnhD,EAAAqnD,eAEAl2C,EAAAgwC,EAAA8I,WAQA,GAPA94C,GAAAnR,EAAAgL,IAAAsa,SAAA,GAAAnU,EAAAue,SAAAve,IAAA4kB,cACAC,IAAiB1rB,KAAA6G,EAAAgZ,OAAAg3B,EAAA+I,eACjBhJ,EAAAC,IACAnrB,EAAAzwB,MAAuB+E,KAAA62C,EAAAsG,UAAAt9B,OAAAg3B,EAAAwG,eAIvBvqD,GAAA,IAAA4C,EAAA4nB,MAAAowC,YACA,QAAAtX,EAAA8I,EAAgC9I,EAAA6I,EAAkB7I,IAAA,CAClD,IAAAp2C,EAAAkD,EAAAuhC,WAAA2R,EAAA,GAAAvD,EAAA7yC,EAAA22C,WACA,SAAA32C,EAAA4kB,WAAAiuB,EAAA,CACAqM,EAAA9I,EACA,MAEA,IAAAvD,KAAAxuC,KACA,MAGA,IAAAysD,EAAAp7D,EAAAO,MAAA4M,IACAlK,EAAAjD,EAAAwiD,SAAA,cAA+C1P,EAAA,EAASxJ,WAAAtpC,EAAAO,MAAAuL,QACxD+C,EAAAusD,EAAA9uD,QAAAmC,GACA7B,EAAA,KAAAO,EAAAlK,EAAAT,MAAAgL,GACA05B,QAAAr4B,EAAArB,OACA8+B,SAAAz9B,EAAArB,OAAAi0B,eAAA5yB,EAAAtG,SACAinC,SAAA,EACA/gC,KAAA86C,EACAn5C,GAAAo5C,EACAtsC,mBAAA,OAAArO,EAAArB,OAAA9K,KAAAopD,YAAA,OACAvf,cAAAvW,EACAgY,gBACA3c,QAAAxiB,IAEA,GAAAmnB,GAAA,MAAAA,EAAA,GAAA/uB,IAAA,CACA,IAAAkK,EAAA6kB,EAAA,GAAA/uB,IAAAmK,EAAA4kB,EAAA,IAAAA,EAAA,GAAA/uB,IACA,MAAAmK,IACAA,EAAAD,GACAvE,GAAeuE,SAAA1C,EAAA2C,OAAA3C,GAEf,OAAYtB,MAAAP,MAAA6B,OAAA2B,MA4CZq0D,CAAAzkE,EAAAyO,EAAA2B,GAGA,GAAAhT,GAAA4C,EAAA+yD,eAAAvwD,EAAAoK,KAAApK,EAAAoK,IAAAuE,QAAAnR,EAAA+yD,cAAAxG,KAAA99C,MACAjM,EAAAoK,IAAAwE,MAAA5O,EAAAoK,IAAAuE,OAAA,CACA,IAAAlY,EAAA+G,EAAA+yD,cAAAxG,KAAA7pD,KAAAga,MAAA+S,YACA9gB,EAAA1V,KAAA02B,UAAA12B,EAAA02B,UAAAhxB,OAAA,EACA6D,EAAAoK,KAAqBuE,OAAA3O,EAAAoK,IAAAuE,OAAAxC,EAAAyC,KAAA5O,EAAAoK,IAAAuE,OAAAxC,GAErB,IACA+1D,EAAAC,EADAx3D,EAAAnN,EAAAO,MAAA4M,IAAAy3D,EAAAz3D,EAAArC,MAAAtI,EAAAiM,KAAAjM,EAAA4N,IAGA,IAAApQ,EAAA4nB,MAAAowC,aAAAxb,KAAAC,MAAA,IAAAz8C,EAAA4nB,MAAAqwC,iBACAyM,EAAA1kE,EAAAO,MAAAmM,UAAA0D,GACAu0D,EAAA,QAGAD,EAAA1kE,EAAAO,MAAAmM,UAAA+B,KACAk2D,EAAA,SAEA3kE,EAAA4nB,MAAAowC,YAAA,KACA,IAAA6M,EAoNA,SAAAt9D,EAAAC,EAAAP,EAAAy9D,EAAAC,GACA,IAAA3/D,EAAAuC,EAAAkzB,cAAAjzB,EAAAP,GACA,SAAAjC,EACA,YACA,IAASuC,EAAAu9D,EAAAt9D,EAAAu9D,GAAmBx9D,EAAAqzB,YAAApzB,EAAAP,EAAAM,EAAAoH,KAAA1H,EAAAO,EAAAmH,MAC5B,UAAAg2D,EAAA,CACA,IAAAK,EAAA/8D,KAAAE,IAAA,EAAAnD,EAAAiD,KAAAC,IAAA48D,EAAAC,IACAL,GAAAI,EAAAE,EAAAhgE,EAEA,GAAA8/D,EAAA9/D,GAAAuC,EAAAoH,KAAAnH,EAAAmH,KAAA,CACA,IAAA6sD,EAAAkJ,GAAA1/D,GAAA0/D,GAAAI,EAAA9/D,EAAA0/D,EAAA,EAEAK,GADA//D,GAAAw2D,IACAuJ,EAAAD,GACAA,EAAA9/D,OAEA,GAAA+/D,EAAA//D,EAAA,CACA,IAAAw2D,EAAAkJ,GAAA1/D,GAAA0/D,GAAAK,EAAA//D,EAAA0/D,EAAA,EAEAI,GADA9/D,GAAAw2D,IACAsJ,EAAAC,GACAA,EAAA//D,EAEA,OAAYA,QAAA8/D,OAAAC,QAzOZE,CAAAL,EAAAl2D,QAAAlM,EAAA2K,IAAAuB,QAAAlM,EAAAiM,KAAAi2D,EAAAC,GACA,IAAAhlB,GAAA3/C,EAAA4nB,MAAAywC,aAAA7b,KAAAC,MAAA,KAAAoD,IACAskB,EAAAj2D,KAAArE,GAAA,OAAAA,EAAAqlB,UAAA,KAAArlB,EAAAqlB,aACA21C,KAAAC,MAAAD,EAAAE,OACA/kE,EAAAwiD,SAAA,gBAAAlyC,KAAAtQ,EAAAwhD,EAAA,cAEA,YADAxhD,EAAA4nB,MAAAywC,aAAA,GAGA,IAAAwM,EAAA,CACA,KAAAjB,GAAAh3D,aAAuCiyC,EAAA,IAAajyC,EAAAmD,OAAAnD,EAAAH,MAAAyzB,WAAAtzB,EAAAG,WACpD/M,EAAAisD,WAAAzpD,EAAAoK,KAAApK,EAAAoK,IAAAuE,QAAA3O,EAAAoK,IAAAwE,KAGA,CACA,GAAA5O,EAAAoK,IAAA,CACA,IAAAA,EAAAs4D,GAAAllE,IAAAO,MAAA4M,IAAA3K,EAAAoK,KACAA,MAAAiG,GAAA7S,EAAAO,MAAAmM,YACA1M,EAAAQ,SAAAR,EAAAO,MAAAuP,GAAAO,aAAAzD,IAEA,OARAi4D,GAAsB7/D,MAAA4H,EAAA6B,KAAAq2D,KAAAl4D,EAAAwD,GAAA20D,KAAAn4D,EAAAwD,IAWtBpQ,EAAA4nB,MAAA8wC,iBAIA14D,EAAAO,MAAAmM,UAAA+B,KAAAzO,EAAAO,MAAAmM,UAAA0D,IACAy0D,EAAA7/D,OAAA6/D,EAAAE,MACA/kE,EAAAO,MAAAmM,qBAAwCmyC,EAAA,IACxCgmB,EAAA7/D,MAAAhF,EAAAO,MAAAmM,UAAA+B,MAAAo2D,EAAA7/D,OAAAhF,EAAAO,MAAAmM,UAAA+B,KAAA,GACAzO,EAAAO,MAAAmM,UAAA+B,MAAAjM,EAAAiM,KACAo2D,EAAA7/D,MAAAhF,EAAAO,MAAAmM,UAAA+B,KAEAo2D,EAAAC,KAAA9kE,EAAAO,MAAAmM,UAAA0D,IAAAy0D,EAAAC,MAAA9kE,EAAAO,MAAAmM,UAAA0D,GAAA,GACApQ,EAAAO,MAAAmM,UAAA0D,IAAA5N,EAAA4N,KACAy0D,EAAAE,MAAA/kE,EAAAO,MAAAmM,UAAA0D,GAAAy0D,EAAAC,KACAD,EAAAC,KAAA9kE,EAAAO,MAAAmM,UAAA0D,KAMAzS,GAAAyhD,GAAA,IAAAylB,EAAAE,MAAAF,EAAA7/D,MAAA,GACA6/D,EAAAC,MAAAD,EAAA7/D,OAAA6/D,EAAA7/D,MAAAxC,EAAAiM,MACA,MAAAjM,EAAA2K,IAAAwsB,YAAAkrC,EAAA7/D,MAAAxC,EAAAiM,KAAA,EAAAo2D,EAAA7/D,MAAAxC,EAAAiM,KAAA,KACAo2D,EAAA7/D,QACA6/D,EAAAC,OACAD,EAAAE,QAEA,IAIAI,EAJAt2D,EAAArM,EAAA2K,IAAA+vB,eAAA2nC,EAAA7/D,MAAAxC,EAAAiM,MACAK,EAAAtM,EAAA2K,IAAA+vB,eAAA2nC,EAAAE,KAAAviE,EAAAiM,MACA22D,EAAAj4D,EAAAb,QAAAu4D,EAAA7/D,OACAqgE,EAAAx2D,EAAAqxB,WAAApxB,IAAAD,EAAArB,OAAAwyB,eAAAolC,EAAAx3D,OAAAi3D,EAAAC,KAIA,IAAAnlB,GAAA3/C,EAAA4nB,MAAAywC,aAAA7b,KAAAC,MAAA,OACA4oB,GAAAlB,EAAAj2D,KAAArE,GAAA,OAAAA,EAAAqlB,UAAA,KAAArlB,EAAAqlB,aACAm2C,GAAAx2D,EAAA5H,IAAAzE,EAAA2K,IAAAuB,QAAAC,OACAw2D,EAAuBtmB,EAAA,EAAS1uC,SAAA3N,EAAA2K,IAAAb,QAAAuC,EAAA5H,IAAA,WAChCk+D,EAAA/zD,MAAAtC,EAAA7H,MACAjH,EAAAwiD,SAAA,gBAAAlyC,KAAAtQ,EAAAwhD,EAAA,cAEA,YADAxhD,EAAA4nB,MAAAywC,aAAA,GAIA,GAAAr4D,EAAAO,MAAAmM,UAAAyE,OAAA0zD,EAAA7/D,OA+GA,SAAAsgE,EAAAtgE,EAAA4I,EAAA23D,EAAAC,GACA,IAAAD,EAAA/3D,OAAAqzB,aAEAjzB,EAAA5I,GAAAwgE,EAAAv+D,IAAAs+D,EAAAt+D,KAEAw+D,GAAAF,GAAA,MAAAC,EAAAv+D,IACA,SACA,IAAAq2B,EAAAgoC,EAAAh5D,QAAAtH,GAEA,GAAAs4B,EAAAO,aAAAP,EAAA9vB,OAAAkB,QAAAC,OAAA2uB,EAAA9vB,OAAAqzB,YACA,SACA,IAAA3tB,EAAAoyD,EAAAh5D,QAAAm5D,GAAAnoC,GAAA,OAEA,SAAApqB,EAAA1F,OAAAqzB,aAAA3tB,EAAAjM,IAAA2G,GACA63D,GAAAvyD,GAAA,MAAAtF,IAGA23D,EAAA/3D,OAAAkB,QAAA2rB,IAAAkrC,EAAA1nC,cAAAhrB,GAAAK,EAAA1F,OAAAkB,SA/HAg3D,CAAAv4D,EAAA03D,EAAA7/D,MAAA6/D,EAAAC,KAAAj2D,EAAAC,IACA9O,EAAAwiD,SAAA,gBAAAlyC,KAAAtQ,EAAAwhD,EAAA,iBAGA,YAFA3B,GAAAziD,GACA4C,EAAA0yD,YAAAiT,4BAMAvoE,GAAAyiD,GAAAglB,EAAAE,MAAAF,EAAA7/D,QACAhF,EAAA4nB,MAAA2wC,kBAAA/b,KAAAC,OASAoD,IAAAwlB,GAAAx2D,EAAA7J,SAAA8J,EAAA9J,SAAA,GAAA8J,EAAA+uB,cAAAhvB,EAAAzK,OAAA0K,EAAA1K,OACA5B,EAAAoK,KAAApK,EAAAoK,IAAAuE,QAAA3O,EAAAoK,IAAAwE,MAAA5O,EAAAoK,IAAAwE,MAAAyzD,EAAAC,OACAD,EAAAE,MAAA,EACAj2D,EAAAtM,EAAA2K,IAAA+vB,eAAA2nC,EAAAE,KAAAviE,EAAAiM,MACAilD,WAAA,KACA1zD,EAAAwiD,SAAA,yBAAAlyC,GAAyD,OAAAA,EAAAtQ,EAAAwhD,EAAA,gBAChD,KAET,IACA1xC,EAAAilC,EAAA6wB,EADAC,EAAAhB,EAAA7/D,MAAA8gE,EAAAjB,EAAAC,KAEA,GAAAO,EACA,GAAAx2D,EAAA5H,KAAA6H,EAAA7H,IAGAtJ,GAAAyhD,GAAA,OAAAvwC,EAAAgvB,eACA79B,EAAA0yD,YAAAiT,2BACAjS,WAAA,IAAArB,GAAAryD,GAAA,KAEA8P,EAAA9P,EAAAO,MAAAuP,GAAAmS,OAAA4jD,EAAAC,GACA/wB,EAAA5nC,EAAAb,QAAAu4D,EAAA7/D,OAAA26B,YAAAxyB,EAAAb,QAAAu4D,EAAAC,YAEA,GACAD,EAAAC,MAAAD,EAAAE,OACAa,EA0CA,SAAA5hC,EAAA/5B,GACA,IACAvH,EAAAw+B,EAAApI,EADAitC,EAAA/hC,EAAA92B,WAAA+P,MAAA+oD,EAAA/7D,EAAAiD,WAAA+P,MACA9C,EAAA4rD,EAAA7E,EAAA8E,EACA,QAAAnoE,EAAA,EAAmBA,EAAAmoE,EAAArnE,OAAsBd,IACzCsc,EAAA6rD,EAAAnoE,GAAAu+B,cAAAjiB,GACA,QAAAtc,EAAA,EAAmBA,EAAAkoE,EAAApnE,OAAqBd,IACxCqjE,EAAA6E,EAAAloE,GAAAu+B,cAAA8kC,GACA,MAAA/mD,EAAAxb,QAAA,GAAAuiE,EAAAviE,OACAuiC,EAAA/mB,EAAA,GACAzX,EAAA,MACAo2B,EAAA,CAAAxuB,KAAA42B,OAAAlF,SAAA1xB,EAAA2S,aAEA,OAAA9C,EAAAxb,QAAA,GAAAuiE,EAAAviE,OAMA,YALAuiC,EAAAggC,EAAA,GACAx+D,EAAA,SACAo2B,EAAA,CAAAxuB,KAAA42B,OAAA9E,cAAA9xB,EAAA2S,SAKA,IAAAzS,KACA,QAAA3M,EAAA,EAAmBA,EAAAoM,EAAAjB,WAAqBnL,IACxC2M,EAAAjF,KAAAuzB,EAAA7uB,EAAAvB,MAAA7K,KACA,GAAQi1C,EAAA,EAAQrkC,KAAAjE,GAAAqI,GAAAmxB,GAChB,OAAgB9C,OAAAx+B,QAlEhBujE,CAAAp3D,EAAArB,OAAAkB,QAAA2rB,IAAAxrB,EAAAgvB,aAAA/uB,EAAA+uB,cAAAunC,EAAA53D,OAAAkB,QAAA2rB,IAAA+qC,EAAAvnC,aAAAgnC,EAAAC,KAAAM,EAAApgE,WACA8K,EAAA9P,EAAAO,MAAAuP,GACA,OAAA81D,EAAAljE,KACAoN,EAAAwlC,QAAAuwB,EAAAC,EAAAF,EAAA1kC,MAEApxB,EAAAqlC,WAAA0wB,EAAAC,EAAAF,EAAA1kC,WAEA,GAAAryB,EAAArB,OAAA9E,MAAAmG,EAAAtG,SAAAwxB,QAAAlrB,EAAAtG,SAAAuG,EAAAvG,SAAAuG,EAAAuvB,WAAA,MAEA,IAAAplC,EAAA4V,EAAArB,OAAAmsB,YAAA9qB,EAAAgvB,aAAA/uB,EAAA+uB,cACA,GAAA79B,EAAAwiD,SAAA,kBAAAlyC,KAAAtQ,EAAA6lE,EAAAC,EAAA7sE,IACA,OACA6W,EAAA9P,EAAAO,MAAAuP,GAAA+lC,WAAA58C,EAAA4sE,EAAAC,GAKA,GAFAh2D,IACAA,EAAA9P,EAAAO,MAAAuP,GAAAI,QAAA21D,EAAAC,EAAAtjE,EAAA2K,IAAArC,MAAA+5D,EAAA7/D,MAAAxC,EAAAiM,KAAAo2D,EAAAE,KAAAviE,EAAAiM,QACAjM,EAAAoK,IAAA,CACA,IAAAA,EAAAs4D,GAAAllE,EAAA8P,EAAA3C,IAAA3K,EAAAoK,KAMAA,KAAAxP,GAAAyiD,GAAA7/C,EAAAisD,WAAAr/C,EAAAmD,QACA80D,EAAA7/D,OAAA6/D,EAAAE,MAAA/kE,EAAA4nB,MAAA2wC,kBAAA/b,KAAAC,MAAA,OACA7vC,EAAAwE,MAAAy0D,GAAAj5D,EAAAwE,MAAAtB,EAAAf,QAAArP,IAAAomE,GAAA,IACAnoE,GAAAiP,EAAAmD,OAAAnD,EAAAwE,MAAAy0D,IACA/1D,EAAAO,aAAAzD,GAEAmoC,GACAjlC,EAAAyrC,YAAAxG,GACA/0C,EAAAQ,SAAAsP,EAAAgD,kBAEA,SAAAoyD,GAAAllE,EAAAmN,EAAA+4D,GACA,OAAAj+D,KAAAE,IAAA+9D,EAAA/0D,OAAA+0D,EAAA90D,MAAAjE,EAAAuB,QAAAC,KACA,KACAqjD,GAAAhyD,EAAAmN,EAAAb,QAAA45D,EAAA/0D,QAAAhE,EAAAb,QAAA45D,EAAA90D,OAkDA,SAAAq0D,GAAAr5D,EAAA+5D,EAAAC,GACA,IAAAhiE,EAAAgI,EAAAhI,MAAAwJ,EAAAu4D,EAAA/5D,EAAAwB,MAAAxB,EAAAnF,IACA,KAAA7C,EAAA,IAAA+hE,GAAA/5D,EAAAkH,WAAAlP,IAAAgI,EAAA9B,KAAAlG,GAAA4E,aACA5E,IACAwJ,IACAu4D,GAAA,EAEA,GAAAC,EAAA,CACA,IAAAviE,EAAAuI,EAAA9B,KAAAlG,GAAAo2B,WAAApuB,EAAAkH,WAAAlP,IACA,KAAAP,MAAAm2B,QACAn2B,IAAAqJ,WACAU,IAGA,OAAAA,QA2CAgxC,GAQA5lD,YAAAogC,EAAA75B,GACA+D,KAAA+iE,MAAA,KAIA/iE,KAAAo2D,SAAA,EAIAp2D,KAAAgrD,YAAA,KACAhrD,KAAAgjE,SAAA,EAIAhjE,KAAAo5D,WAAA,KAIAp5D,KAAAyvD,cAAA,KAIAzvD,KAAAywD,0BAAA58C,EAIA7T,KAAAskB,MAAA,IAAAmwC,GACAz0D,KAAAijE,qBACAjjE,KAAAkjE,eAMAljE,KAAAw6D,SAAA,KACAx6D,KAAAmjE,OAAAlnE,EACA+D,KAAA/C,MAAAhB,EAAAgB,MACA+C,KAAAojE,cAAAnnE,EAAAob,YACArX,KAAAojE,cAAAjyD,QAAAkyD,IACArjE,KAAA9C,SAAA8C,KAAA9C,SAAAs3B,KAAAx0B,MACAA,KAAA0H,IAAAouB,KAAAwtC,OAAAh4C,SAAAb,cAAA,OACAqL,IACAA,EAAA0U,YACA1U,EAAA0U,YAAAxqC,KAAA0H,KACA,mBAAAouB,EACAA,EAAA91B,KAAA0H,KACAouB,EAAAwtC,QACAtjE,KAAAgjE,SAAA,IAEAhjE,KAAA4uD,SAAA2U,GAAAvjE,MACAwjE,GAAAxjE,MACAA,KAAA+nD,UAAA0b,GAAAzjE,MACAA,KAAA8hD,QAAAqK,GAAAnsD,KAAA/C,MAAA4M,IAAA65D,GAAA1jE,MAAA4+D,GAAA5+D,WAAA0H,IAAA1H,MACAA,KAAAovD,YAAA,IAAAgQ,GAAAp/D,KAAA,CAAAmL,EAAA2B,EAAAwzD,EAAAzpD,IAAAkqD,GAAA/gE,KAAAmL,EAAA2B,EAAAwzD,EAAAzpD,IACA7W,KAAAovD,YAAA1tD,QAx/DA,SAAAhF,GACA,QAAAjB,KAAA84D,GAAA,CACA,IAAAmB,EAAAnB,GAAA94D,GACAiB,EAAAgL,IAAAmsB,iBAAAp4B,EAAAiB,EAAA4nB,MAAA+wC,cAAA55D,GAAA,CAAAA,KACAm6D,GAAAl5D,EAAAjB,IAAAg6D,GAAA/4D,EAAAjB,KACAiB,EAAAkyD,UAAAnzD,EAAA2D,QAAAo1D,IACAkB,EAAAh5D,EAAAjB,MAMA0gD,GACAz/C,EAAAgL,IAAAmsB,iBAAA,kBACA0hC,GAAA74D,GA2+DAinE,CAAA3jE,MACAA,KAAA4jE,oBAOAjb,gBAAqB,OAAA3oD,KAAAskB,MAAAqkC,UAIrB1sD,YACA,GAAA+D,KAAAmjE,OAAAlmE,OAAA+C,KAAA/C,MAAA,CACA,IAAA0J,EAAA3G,KAAAmjE,OACAnjE,KAAAmjE,UACA,QAAAroE,KAAA6L,EACA3G,KAAAmjE,OAAAroE,GAAA6L,EAAA7L,GACAkF,KAAAmjE,OAAAlmE,MAAA+C,KAAA/C,MAEA,OAAA+C,KAAAmjE,OAMAztE,OAAAuG,GACAA,EAAAsc,iBAAAvY,KAAAmjE,OAAA5qD,iBACAg9C,GAAAv1D,MACAA,KAAAmjE,OAAAlnE,EACAA,EAAAob,UACApb,EAAAob,QAAAlG,QAAAkyD,IACArjE,KAAAojE,cAAAnnE,EAAAob,SAEArX,KAAA6jE,iBAAA5nE,EAAAgB,OAAA,GAOAvH,SAAAuG,GACA,IAAAiL,KACA,QAAApM,KAAAkF,KAAAmjE,OACAj8D,EAAApM,GAAAkF,KAAAmjE,OAAAroE,GACAoM,EAAAjK,MAAA+C,KAAA/C,MACA,QAAAnC,KAAAmB,EACAiL,EAAApM,GAAAmB,EAAAnB,GACAkF,KAAAw1B,OAAAtuB,GAMAxR,YAAAuH,GACA+C,KAAA6jE,iBAAA5mE,EAAA+C,KAAA/C,MAAAoa,SAAApa,EAAAoa,SAEA3hB,iBAAAuH,EAAA6mE,GACA,IAAAn9D,EAAA3G,KAAA/C,MAAA8mE,GAAA,EAAAC,GAAA,EAQA,GALA/mE,EAAAw0C,aAAAzxC,KAAA2oD,YACAiQ,GAAA54D,MACAgkE,GAAA,GAEAhkE,KAAA/C,QACA6mE,EAAA,CACA,IAAA/b,EAAA0b,GAAAzjE,OAiVA,SAAAiE,EAAAC,GACA,IAAA+/D,EAAA,EAAAC,EAAA,EACA,QAAA1nE,KAAAyH,EAAA,CACA,GAAAA,EAAAzH,IAAA0H,EAAA1H,GACA,SACAynE,IAEA,QAAAjrC,KAAA90B,EACAggE,IACA,OAAAD,GAAAC,GAzVAC,CAAApc,EAAA/nD,KAAA+nD,aACA/nD,KAAA+nD,YACAgc,GAAA,GAEAxO,GAAAv1D,MAEAA,KAAA4uD,SAAA2U,GAAAvjE,MACAwjE,GAAAxjE,MACA,IAAAmlD,EAAAyZ,GAAA5+D,MAAAklD,EAAAwe,GAAA1jE,MACAokE,EAAAN,EAAA,QACA7mE,EAAAonE,kBAAA19D,EAAA09D,kBAAA,0BACAC,EAAAP,IAAA/jE,KAAA8hD,QAAAiM,YAAA9wD,EAAA4M,IAAAq7C,EAAAC,IACAmf,GAAArnE,EAAAmM,UAAAmG,GAAA5I,EAAAyC,aACA46D,GAAA,GACA,IAAAO,EAAA,YAAAH,GAAAJ,GAAA,MAAAhkE,KAAA0H,IAAA6T,MAAAipD,gBA1oJA,SAAA9nE,GACA,IACA+nE,EAAAC,EADA5/D,EAAApI,EAAAgL,IAAAg3C,wBAAAkB,EAAAj7C,KAAAE,IAAA,EAAAC,EAAA1B,KAEA,QAAAwgB,GAAA9e,EAAA3B,KAAA2B,EAAAzB,OAAA,EAAA6/C,EAAAtD,EAAA,EAA8DsD,EAAAv+C,KAAAC,IAAA+/D,YAAA7/D,EAAAxB,QAAwC4/C,GAAA,GACtG,IAAAx7C,EAAAhL,EAAAgkB,KAAA+gC,iBAAA79B,EAAAs/B,GACA,IAAAx7C,MAAAhL,EAAAgL,MAAAhL,EAAAgL,IAAAsa,SAAAta,GACA,SACA,IAAAk9D,EAAAl9D,EAAAg3C,wBACA,GAAAkmB,EAAAxhE,KAAAw8C,EAAA,IACA6kB,EAAA/8D,EACAg9D,EAAAE,EAAAxhE,IACA,OAGA,OAAYqhE,SAAAC,SAAAjkD,MAAAu/B,EAAAtjD,EAAAgL,MA4nJZm9D,CAAA7kE,MACA,GAAAgkE,EAAA,CACAhkE,KAAAovD,YAAA9H,OAMA,IAAAwd,EAAAR,IAAAjqE,GAAAP,KAAAkG,KAAA2oD,YACAhiD,EAAAyC,UAAAqD,QAAAxP,EAAAmM,UAAAqD,OA0SA,SAAAs4D,EAAAC,GACA,IAAAlkE,EAAA6D,KAAAC,IAAAmgE,EAAAt7D,QAAA8yB,YAAAwoC,EAAAj3D,MAAAk3D,EAAAv7D,QAAA8yB,YAAAyoC,EAAAl3D,OACA,OAAAi3D,EAAAt7D,QAAA/H,MAAAZ,IAAAkkE,EAAAv7D,QAAA/H,MAAAZ,GA5SAmkE,CAAAt+D,EAAAyC,UAAAnM,EAAAmM,WACA,GAAAk7D,EAAA,CAKA,IAAAY,EAAAprE,EAAAkG,KAAAgrD,YAAAhrD,KAAA+jD,eAAAI,UAAA,MACA4f,GAAA/jE,KAAA8hD,QAAAtsB,OAAAv4B,EAAA4M,IAAAq7C,EAAAC,EAAAnlD,QACAA,KAAA8hD,QAAA+J,oBACA7rD,KAAA8hD,QAAAsD,UACAplD,KAAA8hD,QAAAqK,GAAAlvD,EAAA4M,IAAAq7C,EAAAC,EAAAnlD,KAAA0H,IAAA1H,OAEAklE,IAAAllE,KAAAgrD,cACA8Z,GAAA,GAMAA,KACA9kE,KAAAskB,MAAA2qC,WAAAjvD,KAAAovD,YAAAC,iBAAA9/C,GAAAvP,KAAA+jD,iBAtqFA,SAAArnD,GACA,IAAA6pD,EAAA7pD,EAAAolD,QAAAY,WAAAhmD,EAAAO,MAAAmM,UAAAyE,OAAA,GACAgwC,EAAAnhD,EAAAqnD,eACA,OAAA5G,EAAAoJ,EAAAv/C,KAAAu/C,EAAA1/B,OAAAg3B,EAAA8I,WAAA9I,EAAA+I,cAmqFAue,CAAAnlE,OACA+uD,GAAA/uD,KAAA8kE,IAGA9V,GAAAhvD,KAAA/C,EAAAmM,WACApJ,KAAAovD,YAAAG,mBAEAvvD,KAAAovD,YAAA1tD,QAGA,GADA1B,KAAA4jE,kBAAAj9D,GACA,SAAAy9D,EACApkE,KAAA0H,IAAAm4C,UAAA,OAEA,mBAAAukB,EAAA,CACA,IAAAplB,EAAAh/C,KAAA+jD,eAAAI,UACA,GAAAnkD,KAAAk/C,SAAA,0BAAAlyC,KAAAhN,aACA,GAAA/C,EAAAmM,qBAAgDmyC,EAAA,EAAa,CAC7D,IAAAt/B,EAAAjc,KAAA8hD,QAAA0C,YAAAvnD,EAAAmM,UAAA+B,MACA,GAAA8Q,EAAAmQ,UACA2yB,EAAA/+C,KAAAic,EAAAyiC,wBAAAM,QAGAD,EAAA/+C,UAAAyiD,YAAAxlD,EAAAmM,UAAA0E,KAAA,GAAAkxC,QAGAulB,GArqJA,UAAAE,OAAyBA,EAAAC,SAAAjkD,UACzB,IAAA2kD,EAAAX,IAAA/lB,wBAAAt7C,IAAA,EACA68C,EAAAx/B,EAAA,GAAA2kD,EAAA,EAAAA,EAAAV,GAoqJAW,CAAAd,GAGA7uE,qBACA,IAAAgH,EACA,KAAAA,EAAAsD,KAAAkjE,YAAAziE,OACA/D,EAAA0oD,SACA1oD,EAAA0oD,UAEA1vD,kBAAA4vE,GACA,GAAAA,KAAAjuD,SAAArX,KAAA/C,MAAAoa,SAAArX,KAAAojE,eAAApjE,KAAAijE,kBAeA,QAAA1oE,EAAA,EAA2BA,EAAAyF,KAAAkjE,YAAA7nE,OAA6Bd,IAAA,CACxD,IAAAgrE,EAAAvlE,KAAAkjE,YAAA3oE,GACAgrE,EAAA/vC,QACA+vC,EAAA/vC,OAAAx1B,KAAAslE,OAlBA,CACAtlE,KAAAijE,kBAAAjjE,KAAAojE,cACApjE,KAAAwlE,qBACA,QAAAjrE,EAAA,EAA2BA,EAAAyF,KAAAojE,cAAA/nE,OAA+Bd,IAAA,CAC1D,IAAAq5B,EAAA5zB,KAAAojE,cAAA7oE,GACAq5B,EAAAruB,KAAA7I,MACAsD,KAAAkjE,YAAAjhE,KAAA2xB,EAAAruB,KAAA7I,KAAAsD,OAEA,QAAAzF,EAAA,EAA2BA,EAAAyF,KAAA/C,MAAAoa,QAAAhc,OAA+Bd,IAAA,CAC1D,IAAAq5B,EAAA5zB,KAAA/C,MAAAoa,QAAA9c,GACAq5B,EAAAruB,KAAA7I,MACAsD,KAAAkjE,YAAAjhE,KAAA2xB,EAAAruB,KAAA7I,KAAAsD,SAWAtK,SAAAwgE,EAAAlpD,GACA,IAAAlK,EAAAtG,EAAAwD,KAAAmjE,QAAAnjE,KAAAmjE,OAAAjN,GACA,SAAA15D,IAAAsG,EAAAkK,IAAAxQ,MACA,OAAAsG,EACA,QAAAvI,EAAA,EAAuBA,EAAAyF,KAAAojE,cAAA/nE,OAA+Bd,IAAA,CACtD,IAAAiC,EAAAwD,KAAAojE,cAAA7oE,GAAA0B,MAAAi6D,GACA,SAAA15D,IAAAsG,EAAAkK,IAAAxQ,MACA,OAAAsG,EAEA,IAAAuU,EAAArX,KAAA/C,MAAAoa,QACA,GAAAA,EACA,QAAA9c,EAAA,EAA2BA,EAAA8c,EAAAhc,OAAoBd,IAAA,CAC/C,IAAAiC,EAAA6a,EAAA9c,GAAA0B,MAAAi6D,GACA,SAAA15D,IAAAsG,EAAAkK,IAAAxQ,MACA,OAAAsG,GAMApN,WACA,OAAAsK,KAAA0gB,KAAA2iC,eAAArjD,KAAA0H,IAKAhS,QACAsK,KAAAovD,YAAA9H,OACAtnD,KAAA4uD,UAltJA,SAAAlnD,GACA,GAAAA,EAAA+9D,UACA,OAAA/9D,EAAA+9D,YACA,GAAAtlB,EACA,OAAAz4C,EAAA67C,MAAApD,GACA,IAAAulB,EAAA1lB,EAAAt4C,GACAA,EAAA67C,MAAA,MAAApD,GACAwlB,oBAEA,OADAxlB,GAAsCwlB,eAAA,IACtC,SAEK9xD,GACLssC,IACAA,GAAA,EACAF,EAAAylB,EAAA,IAqsJAE,CAAA5lE,KAAA0H,KACAqnD,GAAA/uD,MACAA,KAAAovD,YAAA1tD,QAQAgf,WACA,IAAAjY,EAAAzI,KAAA+iE,MACA,SAAAt6D,EACA,QAAA+4B,EAAAxhC,KAAA0H,IAAA+qB,WAAkD+O,EAAQA,IAAA/O,WAC1D,MAAA+O,EAAApV,UAAA,IAAAoV,EAAApV,UAAAoV,EAAAqb,KAGA,OAFArb,EAAAilB,eACAnqD,OAAAupE,eAAArkC,GAAAilB,aAAA,KAAAjlB,EAAAwJ,cAAAyb,iBACAzmD,KAAA+iE,MAAAvhC,EAGA,OAAA/4B,GAAA6iB,SAWA51B,YAAA2qD,GACA,OAAAc,EAAAnhD,KAAAqgD,GAUA3qD,YAAAiO,EAAAisC,EAAA,GACA,OAAA6S,EAAAziD,KAAA2D,EAAAisC,GAYAl6C,SAAAiO,EAAAisC,EAAA,GACA,OAAA5vC,KAAA8hD,QAAAY,WAAA/+C,EAAAisC,GAYAl6C,QAAAiO,GACA,IAAAk2C,EAAA75C,KAAA8hD,QAAA+D,OAAAliD,GACA,OAAAk2C,IAAA6L,QAAA,KAYAhwD,SAAAsR,EAAA6f,EAAA8wB,GAAA,GACA,IAAAh0C,EAAA3D,KAAA8hD,QAAAI,WAAAl7C,EAAA6f,EAAA8wB,GACA,SAAAh0C,EACA,UAAAE,WAAA,sCACA,OAAAF,EAUAjO,eAAAqO,EAAA9G,GACA,OAAAkT,GAAAnQ,KAAA/C,GAAA+C,KAAA/C,MAAA8G,GAMArO,UACAsK,KAAA8hD,WAnxEA,SAAAplD,GACAA,EAAA0yD,YAAA9H,OACA,QAAAloD,KAAA1C,EAAA4nB,MAAA+wC,cACA34D,EAAAgL,IAAAwoD,oBAAA9wD,EAAA1C,EAAA4nB,MAAA+wC,cAAAj2D,IACAu5D,aAAAj8D,EAAA4nB,MAAA4wC,kBACAyD,aAAAj8D,EAAA4nB,MAAA0wC,6BAgxEA8Q,CAAA9lE,MACAA,KAAAwlE,qBACAxlE,KAAAgjE,SACAhjE,KAAA8hD,QAAAtsB,OAAAx1B,KAAA/C,MAAA4M,OAAA+0D,GAAA5+D,YACAA,KAAA0H,IAAAmrB,YAAA,IAEA7yB,KAAA0H,IAAA+qB,YACAzyB,KAAA0H,IAAA+qB,WAAAi5B,YAAA1rD,KAAA0H,KAEA1H,KAAA8hD,QAAAsD,UACAplD,KAAA8hD,QAAA,MAOAikB,kBACA,aAAA/lE,KAAA8hD,QAKApsD,cAAA+F,GACA,OA9wEA,SAAAiB,EAAAjB,GACAg6D,GAAA/4D,EAAAjB,KAAA84D,GAAA94D,EAAA2D,QACA1C,EAAAkyD,UAAAnzD,EAAA2D,QAAAo1D,IACAD,GAAA94D,EAAA2D,MAAA1C,EAAAjB,GA2wEAuqE,CAAAhmE,KAAAvE,GAWA/F,SAAA8W,GACA,IAAAy5D,EAAAjmE,KAAAmjE,OAAA8C,oBACAA,EACAA,EAAAxnE,KAAAuB,KAAAwM,GAEAxM,KAAAsjD,YAAAtjD,KAAA/C,MAAA0a,MAAAnL,IAKA9W,eACA,OAAAsK,KAAA0gB,KAAA+lC,gBAGA,SAAAid,GAAAhnE,GACA,IAAAoJ,EAAAxJ,OAAAC,OAAA,MAkBA,OAjBAuJ,EAAA4kB,MAAA,cACA5kB,EAAAogE,gBAAA1rE,OAAAkC,EAAAkyD,UACA9oD,EAAAqgE,UAAA,KACAzpE,EAAAwiD,SAAA,aAAAp8C,IAGA,GAFA,mBAAAA,IACAA,IAAApG,EAAAO,QACA6F,EACA,QAAA6oB,KAAA7oB,EACA,SAAA6oB,IACA7lB,EAAA4kB,OAAA,IAAA5nB,EAAA6oB,IACA,SAAAA,EACA7lB,EAAAyV,OAAAzV,EAAAyV,MAAAzV,EAAAyV,MAAA,IAAiE,IAAAzY,EAAA6oB,GAEjE7lB,EAAA6lB,IAAA,mBAAAA,GAAA,YAAAA,IACA7lB,EAAA6lB,GAAAnxB,OAAAsI,EAAA6oB,QAGAyvB,GAAAp0C,KAAA,EAAAtK,EAAAO,MAAA4M,IAAAuB,QAAAC,KAAAvF,IAEA,SAAA09D,GAAA9mE,GACA,GAAAA,EAAA08D,WAAA,CACA,IAAA1xD,EAAA4jB,SAAAb,cAAA,OACA/iB,EAAAyY,UAAA,wBACAzY,EAAAsmC,aAAA,2BACAtmC,EAAAsmC,aAAA,UACAtxC,EAAA+yD,eAA8B/nD,MAAAuhD,KAAA7N,GAAA6J,OAAAvoD,EAAAO,MAAAmM,UAAA0E,KAAApG,GAA+D+rC,KAAA,EAAA95B,MAAAjd,EAAA08D,mBAG7F18D,EAAA+yD,cAAA,KAGA,SAAA8T,GAAA7mE,GACA,OAAAA,EAAAwiD,SAAA,WAAAp8C,IAAA,IAAAA,EAAApG,EAAAO,QAMA,SAAAwmE,GAAA/mE,GACA,IAAAtB,EAAAkB,OAAAC,OAAA,MACA,SAAAsiB,EAAAL,GACA,QAAAhiB,KAAAgiB,EACAliB,OAAAiC,UAAA5D,eAAA8D,KAAArD,EAAAoB,KACApB,EAAAoB,GAAAgiB,EAAAhiB,IAIA,OAFAE,EAAAwiD,SAAA,YAAArgC,GACAniB,EAAAwiD,SAAA,YAAArgC,GACAzjB,EAaA,SAAAioE,GAAAzvC,GACA,GAAAA,EAAAruB,KAAAtI,OAAA22B,EAAAruB,KAAA60C,mBAAAxmB,EAAAruB,KAAAo1C,kBACA,UAAA92C,WAAA,2GCtoKAtG,EAAAwL,EAAAgmC,EAAA,sBAAAq3B,IAAA7oE,EAAAwL,EAAAgmC,EAAA,sBAAAs3B,IAAA9oE,EAAAwL,EAAAgmC,EAAA,sBAAAu3B,IAAA/oE,EAAAwL,EAAAgmC,EAAA,sBAAAw3B,IAAAhpE,EAAAwL,EAAAgmC,EAAA,sBAAAy3B,IAAA,IAAAjrB,EAAAh+C,EAAA,QAAA05C,EAAA15C,EAAA,cASA6oE,EAkBA1wE,YAIAslB,EAAA06C,GACA11D,KAAAgb,QACAhb,KAAAgb,QACAhb,KAAA01D,QAAA,iBAAAA,EAGA,SAAAp2B,GACA,gBAAAriC,EAAA+d,EAAAtZ,EAAA4I,GACA,IAAA6wB,EAAAmE,EACA,GAAAtkB,EAAA,IACA,IAAA6L,EAAA7L,EAAA,GAAA2xB,YAAA3xB,EAAA,IACAmgB,GAAAngB,EAAA,GAAAxT,MAAAqf,EAAA7L,EAAA,GAAA3f,QAEA,IAAAorE,GADA/kE,GAAAmlB,GACAvc,EACAm8D,EAAA,IACAtrC,EAAAngB,EAAA,GAAAxT,MAAAqf,EAAA4/C,EAAA5/C,GAAAsU,EACAz5B,EAAA4I,GAGA,OAAArN,EAAAuP,GAAA+lC,WAAApX,EAAAz5B,EAAA4I,IAhBAo8D,CAAAhR,MAmBA,MAAAiR,EAAA,IAMA,SAAAN,GAAAl/C,MAAqBA,IACrB,IAAAyM,EAAA,IAAqB2nB,EAAA,GACrBt+C,OACAya,KAAA,IAAoB,KACpBhiB,MAAA8W,EAAA7F,GACA,IAAA++D,EAAAl5D,EAAAuL,QAAA/X,MACA,OAAA0lE,IAEAl5D,EAAA6sC,cAAA7sC,EAAAuD,WAAA,KAAApJ,KAGA1K,OACA2qE,gBAAA,CAAAlqE,EAAAyO,EAAA2B,EAAAnX,IACAkxE,EAAAnqE,EAAAyO,EAAA2B,EAAAnX,EAAAwxB,EAAAyM,GAEArb,iBACA8gD,eAAA38D,IACA0zD,WAAA,KACA,IAAA7e,QAA6BA,GAAU70C,EAAAO,MAAAmM,UACvCmoC,GACAs1B,EAAAnqE,EAAA60C,EAAA5tC,IAAA4tC,EAAA5tC,IAAA,GAAAwjB,EAAAyM,QAKAkzC,cAAA,IAEA,OAAAlzC,EAEA,SAAAizC,EAAAnqE,EAAAyO,EAAA2B,EAAAnX,EAAAwxB,EAAAyM,GACA,GAAAl3B,EAAAisD,UACA,SACA,IAAA1rD,EAAAP,EAAAO,MAAAsO,EAAAtO,EAAA4M,IAAAb,QAAAmC,GACA,GAAAI,EAAArB,OAAA9K,KAAAmG,KAAA7K,KACA,SACA,IAAAqsE,EAAAx7D,EAAArB,OAAAmsB,YAAA1xB,KAAAE,IAAA,EAAA0G,EAAAgvB,aAAAosC,GAAAp7D,EAAAgvB,aAAA,UAAA5kC,EACA,QAAA4E,EAAA,EAAmBA,EAAA4sB,EAAA9rB,OAAkBd,IAAA,CACrC,IAAAygB,EAAAmM,EAAA5sB,GAAAygB,MAAAhhB,KAAA+sE,GACAv6D,EAAAwO,GAAAmM,EAAA5sB,GAAAm7D,QAAAz4D,EAAA+d,EAAA7P,GAAA6P,EAAA,GAAA3f,OAAA1F,EAAA0F,QAAAyR,GACA,GAAAN,EAGA,OADA9P,EAAAQ,SAAAsP,EAAAyK,QAAA2c,GAA0CtgB,UAAA9G,EAAArB,OAAA2B,KAAAnX,WAC1C,EAEA,SAMA,MAAA4wE,EAAA,CAAAtpE,EAAAC,KACA,IAAAma,EAAApa,EAAAoa,QACA,QAAA9c,EAAA,EAAmBA,EAAA8c,EAAAhc,OAAoBd,IAAA,CACvC,IAAAysE,EAAApzC,EAAAvc,EAAA9c,GACA,GAAAq5B,EAAAruB,KAAAuhE,eAAAE,EAAApzC,EAAAhb,SAAA3b,IAAA,CACA,GAAAC,EAAA,CACA,IAAAsP,EAAAvP,EAAAuP,GAAAy6D,EAAAD,EAAA1zD,UACA,QAAArS,EAAAgmE,EAAAt6D,MAAAtR,OAAA,EAAqD4F,GAAA,EAAQA,IAC7DuL,EAAAkH,KAAAuzD,EAAAt6D,MAAA1L,GAAAmT,OAAA6yD,EAAA5yD,KAAApT,KACA,GAAA+lE,EAAArxE,KAAA,CACA,IAAAgkB,EAAAnN,EAAA3C,IAAAb,QAAAg+D,EAAA77D,MAAAwO,QACAnN,EAAA0jC,YAAA82B,EAAA77D,KAAA67D,EAAAl6D,GAAA7P,EAAAuL,OAAA7S,KAAAqxE,EAAArxE,KAAAgkB,SAGAnN,EAAAmS,OAAAqoD,EAAA77D,KAAA67D,EAAAl6D,IAEA5P,EAAAsP,GAEA,UAGA,UAMA,IAAA45D,EAAA,WAIA,IAAAA,EAAA,eAIA,IAAAA,EAAA,uCAAiD,KAIjD,IAAAA,EAAA,UAIA,IAAAA,EAAA,uCAAiD,KAIjD,IAAAA,EAAA,UAuBA,SAAAI,EAAAU,EAAA96C,EAAAvR,EAAA,KAAAssD,GACA,WAAAf,EAAAc,EAAA,CAAAjqE,EAAA+d,EAAAtZ,EAAA4I,KACA,IAAAxE,EAAA+U,aAAAqgC,SAAArgC,EAAAG,GAAAH,EACArO,EAAAvP,EAAAuP,GAAAmS,OAAAjd,EAAA4I,GACAyT,EAAAvR,EAAA3C,IAAAb,QAAAtH,GAAA86B,aAAA6U,EAAAtzB,GAA6FzhB,OAAA26C,EAAA,EAAA36C,CAAYyhB,EAAAqO,EAAAtmB,GACzG,IAAAurC,EACA,YACA7kC,EAAAi8B,KAAA1qB,EAAAszB,GACA,IAAApoC,EAAAuD,EAAA3C,IAAAb,QAAAtH,EAAA,GAAAoI,WAIA,OAHAb,KAAA7J,MAAAgtB,GAAiD9vB,OAAA26C,EAAA,EAAA36C,CAAOkQ,EAAA3C,IAAAnI,EAAA,MACxDylE,KAAAnsD,EAAA/R,KACAuD,EAAApE,KAAA1G,EAAA,GACA8K,IAWA,SAAA85D,EAAAY,EAAA96C,EAAAvR,EAAA,MACA,WAAAurD,EAAAc,EAAA,CAAAjqE,EAAA+d,EAAAtZ,EAAA4I,KACA,IAAA0vB,EAAA/8B,EAAA4M,IAAAb,QAAAtH,GACAoE,EAAA+U,aAAAqgC,SAAArgC,EAAAG,GAAAH,EACA,OAAAmf,EAAAhzB,MAAA,GAAA23B,eAAA3E,EAAA/0B,OAAA,GAAA+0B,EAAAhqB,YAAA,GAAAoc,GAEAnvB,EAAAuP,GACAmS,OAAAjd,EAAA4I,GACA8kC,aAAA1tC,IAAA0qB,EAAAtmB,GAHA,8BC/MA,MAAAshE,SACAA,EAAAC,KACAA,EAAAxpE,MACAA,GACIN,EAAQ,QAKZg1B,GACAuiB,QAAA,OACAp6C,KAAA,oBACAw6C,OAAA,6FACAt0C,GAAA,yDACAC,QAAA,iDACAW,WAAA,0CACAG,KAAA,oEACAS,KAAA,oZAUAozC,IAAA,mFACAL,QAAAiyB,EACA7lE,MAAA6lE,EACA3xB,SAAA,sCAGA6xB,WAAA,4EACA3xE,KAAA,UAGA4xE,OAAA,iCACAC,OAAA,gEACAj1C,EAAAijB,IAAA6xB,EAAA90C,EAAAijB,KACA5oC,QAAA,QAAA2lB,EAAAg1C,QACA36D,QAAA,QAAA2lB,EAAAi1C,QACAC,WAEAl1C,EAAA6iB,OAAA,sBACA7iB,EAAA9e,KAAA,+CACA8e,EAAA9e,KAAA4zD,EAAA90C,EAAA9e,KAAA,MACA7G,QAAA,QAAA2lB,EAAA6iB,QACAqyB,WAEAl1C,EAAA5wB,KAAA0lE,EAAA90C,EAAA5wB,MACAiL,QAAA,QAAA2lB,EAAA6iB,QACAxoC,QAAA,wEACAA,QAAA,gBAAA2lB,EAAAijB,IAAAj0B,OAAA,KACAkmD,WAEAl1C,EAAAm1C,KAAA,gWAMAn1C,EAAAo1C,SAAA,yBACAp1C,EAAAnwB,KAAAilE,EAAA90C,EAAAnwB,KAAA,KACAwK,QAAA,UAAA2lB,EAAAo1C,UACA/6D,QAAA,MAAA2lB,EAAAm1C,MACA96D,QAAA,wFACA66D,WAEAl1C,EAAAlwB,UAAAglE,EAAA90C,EAAA+0C,YACA16D,QAAA,KAAA2lB,EAAA3xB,IACAgM,QAAA,2BACAA,QAAA,gBACAA,QAAA,wBACAA,QAAA,2DACAA,QAAA,iCACAA,QAAA,6DACAA,QAAA,MAAA2lB,EAAAm1C,MACAD,WAEAl1C,EAAA/wB,WAAA6lE,EAAA90C,EAAA/wB,YACAoL,QAAA,YAAA2lB,EAAAlwB,WACAolE,WAMAl1C,EAAA2hB,OAAAr2C,KAAuB00B,GAMvBA,EAAA6hB,IAAAv2C,KAAoB00B,EAAA2hB,QACpBiB,QAAA,iIAGA5zC,MAAA,4HAKAgxB,EAAA6hB,IAAAe,QAAAkyB,EAAA90C,EAAA6hB,IAAAe,SACAvoC,QAAA,KAAA2lB,EAAA3xB,IACAgM,QAAA,2BACAA,QAAA,wBACAA,QAAA,qBACAA,QAAA,2DACAA,QAAA,iCACAA,QAAA,6DACAA,QAAA,MAAA2lB,EAAAm1C,MACAD,WAEAl1C,EAAA6hB,IAAA7yC,MAAA8lE,EAAA90C,EAAA6hB,IAAA7yC,OACAqL,QAAA,KAAA2lB,EAAA3xB,IACAgM,QAAA,2BACAA,QAAA,wBACAA,QAAA,qBACAA,QAAA,2DACAA,QAAA,iCACAA,QAAA,6DACAA,QAAA,MAAA2lB,EAAAm1C,MACAD,WAMAl1C,EAAA4hB,SAAAt2C,KAAyB00B,EAAA2hB,QACzB9xC,KAAAilE,EACA,8IAGAz6D,QAAA,UAAA2lB,EAAAo1C,UACA/6D,QAAA,4KAIA66D,WACAjyB,IAAA,oEACA30C,QAAA,6CACAq0C,OAAAkyB,EACA/kE,UAAAglE,EAAA90C,EAAA2hB,OAAAozB,YACA16D,QAAA,KAAA2lB,EAAA3xB,IACAgM,QAAA,6BACAA,QAAA,WAAA2lB,EAAAkjB,UACA7oC,QAAA,wBACAA,QAAA,cACAA,QAAA,YACAA,QAAA,YACA66D,aAMA,MAAAtnE,GACApC,OAAA,8CACA6pE,SAAA,sCACAxrD,IAAAgrD,EACAjuD,IAAA,2JAMAoD,KAAA,gDACAsrD,QAAA,wDACAC,OAAA,gEACAC,OAAA,gHACAC,GAAA,oOACAttE,KAAA,sCACAutE,GAAA,wBACA51B,IAAA+0B,EACAzxE,KAAA,6EAKAuyE,aAAA,sCACA/nE,EAAA6nE,GAAAX,EAAAlnE,EAAA6nE,IAAAp7D,QAAA,eAAAzM,EAAA+nE,cAAAT,WAEAtnE,EAAAgoE,SAAA,8CAEAhoE,EAAAioE,QAAA,+BACAjoE,EAAAkoE,OAAA,+IACAloE,EAAAynE,SAAAP,EAAAlnE,EAAAynE,UACAh7D,QAAA,SAAAzM,EAAAioE,SACAx7D,QAAA,QAAAzM,EAAAkoE,QACAZ,WAEAtnE,EAAAmoE,WAAA,8EAEAnoE,EAAAgZ,IAAAkuD,EAAAlnE,EAAAgZ,KACAvM,QAAA,UAAA2lB,EAAAo1C,UACA/6D,QAAA,YAAAzM,EAAAmoE,YACAb,WAEAtnE,EAAAonE,OAAA,4CACApnE,EAAAooE,MAAA,2CACApoE,EAAAqnE,OAAA,8DAEArnE,EAAAoc,KAAA8qD,EAAAlnE,EAAAoc,MACA3P,QAAA,QAAAzM,EAAAonE,QACA36D,QAAA,OAAAzM,EAAAooE,OACA37D,QAAA,QAAAzM,EAAAqnE,QACAC,WAEAtnE,EAAA0nE,QAAAR,EAAAlnE,EAAA0nE,SACAj7D,QAAA,QAAAzM,EAAAonE,QACAE,WAMAtnE,EAAA+zC,OAAAr2C,KAAwBsC,GAMxBA,EAAAg0C,SAAAt2C,KAA0BsC,EAAA+zC,QAC1B6zB,OAAA,iEACAC,GAAA,2DACAzrD,KAAA8qD,EAAA,2BACAz6D,QAAA,QAAAzM,EAAAonE,QACAE,WACAI,QAAAR,EAAA,iCACAz6D,QAAA,QAAAzM,EAAAonE,QACAE,aAOAtnE,EAAAi0C,IAAAv2C,KAAqBsC,EAAA+zC,QACrBn2C,OAAAspE,EAAAlnE,EAAApC,QAAA6O,QAAA,aAAA66D,WACAe,gBAAA,4EACApsD,IAAA,mEACAqsD,WAAA,yEACAp2B,IAAA,0BACA18C,KAAA,sNAGAwK,EAAAi0C,IAAAh4B,IAAAirD,EAAAlnE,EAAAi0C,IAAAh4B,IAAA,KACAxP,QAAA,QAAAzM,EAAAi0C,IAAAo0B,iBACAf,WAKAtnE,EAAAuoE,OAAA7qE,KAAwBsC,EAAAi0C,KACxB6zB,GAAAZ,EAAAlnE,EAAA8nE,IAAAr7D,QAAA,OAAmC,KAAA66D,WACnC9xE,KAAA0xE,EAAAlnE,EAAAi0C,IAAAz+C,MACAiX,QAAA,wBACAA,QAAA,UAAoB,KACpB66D,aAGAjyE,EAAAC,SACA88B,QACApyB,gCCxQA,MAAA1C,EAAiBF,EAAQ,SACzBW,SAAOA,GAAcX,EAAQ,SAC7B4C,OAAOA,GAAY5C,EAAQ,SAC3BorE,mBACAA,EAAA5qE,OACAA,GACIR,EAAQ,QAKZ/H,EAAAC,cAAAkI,EACAjI,YAAA0K,EAAAX,GAQA,GAPAO,KAAAP,WAAAvB,EACA8B,KAAAI,QACAJ,KAAAmnB,MAAAhnB,EAAA+zC,OACAl0C,KAAAP,QAAAQ,SAAAD,KAAAP,QAAAQ,UAAA,IAAAxC,EACAuC,KAAAC,SAAAD,KAAAP,QAAAQ,SACAD,KAAAC,SAAAR,QAAAO,KAAAP,SAEAO,KAAAI,MACA,UAAA7E,MAAA,6CAGAyE,KAAAP,QAAA00C,SACAn0C,KAAAmnB,MAAAhnB,EAAAg0C,SACKn0C,KAAAP,QAAA20C,MACLp0C,KAAAP,QAAAipE,OACA1oE,KAAAmnB,MAAAhnB,EAAAuoE,OAEA1oE,KAAAmnB,MAAAhnB,EAAAi0C,KAQAjtB,mBACA,OAAAhnB,EAMAzK,cAAA0I,EAAAgC,EAAAX,GAEA,OADA,IAAA9B,EAAAyC,EAAAX,GACAK,OAAA1B,GAMA1I,OAAA0I,GACA,IACAme,EACA5mB,EACAC,EACAC,EACAw+C,EACAu0B,EANA3pE,EAAA,GAQA,KAAAb,GAEA,GAAAi2C,EAAAr0C,KAAAmnB,MAAAppB,OAAA/D,KAAAoE,GACAA,IAAA0oB,UAAAutB,EAAA,GAAAh5C,QACA4D,GAAAlB,EAAAs2C,EAAA,SAKA,GAAAA,EAAAr0C,KAAAmnB,MAAAhO,IAAAnf,KAAAoE,IACA4B,KAAA6oE,QAAA,QAAA1uE,KAAAk6C,EAAA,IACAr0C,KAAA6oE,QAAA,EACS7oE,KAAA6oE,QAAA,UAAA1uE,KAAAk6C,EAAA,MACTr0C,KAAA6oE,QAAA,IAEA7oE,KAAA8oE,YAAA,iCAAA3uE,KAAAk6C,EAAA,IACAr0C,KAAA8oE,YAAA,EACS9oE,KAAA8oE,YAAA,mCAAA3uE,KAAAk6C,EAAA,MACTr0C,KAAA8oE,YAAA,GAGA1qE,IAAA0oB,UAAAutB,EAAA,GAAAh5C,QACA4D,GAAAe,KAAAC,SAAAmC,KAAApC,KAAAP,QAAAq0C,SACA9zC,KAAAP,QAAA81C,UACAv1C,KAAAP,QAAA81C,UAAAlB,EAAA,IACAt2C,EAAAs2C,EAAA,IACAA,EAAA,SAKA,GAAAA,EAAAr0C,KAAAmnB,MAAA5K,KAAAviB,KAAAoE,GAAA,CACA,MAAA2qE,EAAAJ,EAAAt0B,EAAA,SACA,GAAA00B,GAAA,GACA,MACAC,GADA,IAAA30B,EAAA,GAAArU,QAAA,UACAqU,EAAA,GAAAh5C,OAAA0tE,EACA10B,EAAA,GAAAA,EAAA,GAAAvtB,UAAA,EAAAiiD,GACA10B,EAAA,GAAAA,EAAA,GAAAvtB,UAAA,EAAAkiD,GAAA5zC,OACAif,EAAA,MAEAj2C,IAAA0oB,UAAAutB,EAAA,GAAAh5C,QACA2E,KAAA6oE,QAAA,EACAjzE,EAAAy+C,EAAA,GACAr0C,KAAAP,QAAA00C,UACA53B,EAAA,gCAAAviB,KAAApE,KAGAA,EAAA2mB,EAAA,GACA1mB,EAAA0mB,EAAA,IAEA1mB,EAAA,GAGAA,EAAAw+C,EAAA,GAAAA,EAAA,GAAA7sC,MAAA,SAEA5R,IAAAw/B,OAAAxoB,QAAA,sBACA3N,GAAAe,KAAAipE,WAAA50B,GACAz+C,KAAA+H,EAAAurE,QAAAtzE,GACAC,MAAA8H,EAAAurE,QAAArzE,KAEAmK,KAAA6oE,QAAA,OAKA,IAAAx0B,EAAAr0C,KAAAmnB,MAAA0gD,QAAA7tE,KAAAoE,MACAi2C,EAAAr0C,KAAAmnB,MAAA2gD,OAAA9tE,KAAAoE,IADA,CAKA,GAHAA,IAAA0oB,UAAAutB,EAAA,GAAAh5C,QACAkhB,GAAA83B,EAAA,IAAAA,EAAA,IAAAznC,QAAA,cACA2P,EAAAvc,KAAAI,MAAAmc,EAAA8I,kBACA9I,EAAA3mB,KAAA,CACAqJ,GAAAo1C,EAAA,GAAAiB,OAAA,GACAl3C,EAAAi2C,EAAA,GAAAvtB,UAAA,GAAA1oB,EACA,SAEA4B,KAAA6oE,QAAA,EACA5pE,GAAAe,KAAAipE,WAAA50B,EAAA93B,GACAvc,KAAA6oE,QAAA,OAKA,GAAAx0B,EAAAr0C,KAAAmnB,MAAA4gD,OAAA/tE,KAAAoE,GACAA,IAAA0oB,UAAAutB,EAAA,GAAAh5C,QACA4D,GAAAe,KAAAC,SAAA8nE,OAAA/nE,KAAAF,OAAAu0C,EAAA,IAAAA,EAAA,IAAAA,EAAA,IAAAA,EAAA,UAKA,GAAAA,EAAAr0C,KAAAmnB,MAAA6gD,GAAAhuE,KAAAoE,GACAA,IAAA0oB,UAAAutB,EAAA,GAAAh5C,QACA4D,GAAAe,KAAAC,SAAA+nE,GAAAhoE,KAAAF,OAAAu0C,EAAA,IAAAA,EAAA,IAAAA,EAAA,IAAAA,EAAA,IAAAA,EAAA,IAAAA,EAAA,UAKA,GAAAA,EAAAr0C,KAAAmnB,MAAAzsB,KAAAV,KAAAoE,GACAA,IAAA0oB,UAAAutB,EAAA,GAAAh5C,QACA4D,GAAAe,KAAAC,SAAAkpE,SAAAprE,EAAAs2C,EAAA,GAAAjf,QAAA,SAKA,GAAAif,EAAAr0C,KAAAmnB,MAAA8gD,GAAAjuE,KAAAoE,GACAA,IAAA0oB,UAAAutB,EAAA,GAAAh5C,QACA4D,GAAAe,KAAAC,SAAAgoE,UAKA,GAAA5zB,EAAAr0C,KAAAmnB,MAAAkrB,IAAAr4C,KAAAoE,GACAA,IAAA0oB,UAAAutB,EAAA,GAAAh5C,QACA4D,GAAAe,KAAAC,SAAAoyC,IAAAryC,KAAAF,OAAAu0C,EAAA,UAKA,GAAAA,EAAAr0C,KAAAmnB,MAAAygD,SAAA5tE,KAAAoE,GACAA,IAAA0oB,UAAAutB,EAAA,GAAAh5C,QAGAzF,EAFA,MAAAy+C,EAAA,GAEA,WADA1+C,EAAAoI,EAAAiC,KAAAopE,OAAA/0B,EAAA,MAGA1+C,EAAAoI,EAAAs2C,EAAA,IAGAp1C,GAAAe,KAAAC,SAAAsc,KAAA3mB,EAAA,KAAAD,QAKA,GAAAqK,KAAA6oE,UAAAx0B,EAAAr0C,KAAAmnB,MAAA/K,IAAApiB,KAAAoE,KAuBA,GAAAi2C,EAAAr0C,KAAAmnB,MAAAxxB,KAAAqE,KAAAoE,GACAA,IAAA0oB,UAAAutB,EAAA,GAAAh5C,QACA2E,KAAA8oE,WACA7pE,GAAAe,KAAAC,SAAAtK,KAAAqK,KAAAP,QAAAq0C,SAAA9zC,KAAAP,QAAA81C,UAAAv1C,KAAAP,QAAA81C,UAAAlB,EAAA,IAAAt2C,EAAAs2C,EAAA,IAAAA,EAAA,IAEAp1C,GAAAe,KAAAC,SAAAtK,KAAAoI,EAAAiC,KAAAqpE,YAAAh1B,EAAA,WAKA,GAAAj2C,EACA,UAAA7C,MAAA,0BAAA6C,EAAAjB,WAAA,QAlCA,CACA,SAAAk3C,EAAA,GAEAz+C,EAAA,WADAD,EAAAoI,EAAAs2C,EAAA,SAES,CAET,GACAu0B,EAAAv0B,EAAA,GACAA,EAAA,GAAAr0C,KAAAmnB,MAAAshD,WAAAzuE,KAAAq6C,EAAA,aACWu0B,IAAAv0B,EAAA,IACX1+C,EAAAoI,EAAAs2C,EAAA,IAEAz+C,EADA,SAAAy+C,EAAA,GACA,UAAA1+C,EAEAA,EAGAyI,IAAA0oB,UAAAutB,EAAA,GAAAh5C,QACA4D,GAAAe,KAAAC,SAAAsc,KAAA3mB,EAAA,KAAAD,GAoBA,OAAAsJ,EAGAvJ,eAAAC,GACA,OAAAA,IAAAiX,QAAAjP,EAAAwpB,MAAAghD,SAAA,MAAAxyE,EAMAD,WAAA2+C,EAAA93B,GACA,MAAA3mB,EAAA2mB,EAAA3mB,KACAC,EAAA0mB,EAAA1mB,MAAAkI,EAAAwe,EAAA1mB,OAAA,KAEA,YAAAw+C,EAAA,GAAAiB,OAAA,GACAt1C,KAAAC,SAAAsc,KAAA3mB,EAAAC,EAAAmK,KAAAF,OAAAu0C,EAAA,KACAr0C,KAAAC,SAAAqpE,MAAA1zE,EAAAC,EAAAkI,EAAAs2C,EAAA,KAMA3+C,YAAAC,GACA,OAAAqK,KAAAP,QAAA4pE,YACA1zE,EAEAiX,QAAA,YAEAA,QAAA,WAEAA,QAAA,0BAAgC,OAEhCA,QAAA,UAEAA,QAAA,+BAAgC,OAEhCA,QAAA,UAEAA,QAAA,SAAqB,KAfrBjX,EAqBAD,OAAAC,GACA,IAAAqK,KAAAP,QAAA2pE,OAAA,OAAAzzE,EACA,MAAA++C,EAAA/+C,EAAA0F,OACA,IAEAkuE,EAFAtqE,EAAA,GACA1E,EAAA,EAGA,KAAUA,EAAAm6C,EAAOn6C,IACjBgvE,EAAA5zE,EAAAwH,WAAA5C,GACAoK,KAAA6kE,SAAA,KACAD,EAAA,IAAAA,EAAA/qE,SAAA,KAEAS,GAAA,KAAAsqE,EAAA,IAGA,OAAAtqE;;;;;MCzRA,SAAAwqE,EAAAC,EAAAtuD,GACA,OAAAA,EACAsuD,EAAAnmC,cAAA,KAAAnoB,GAGAsuD,EAAAr9D,gBAqBA,SAAAs9D,EAAAnhE,EAAAohE,EAAAC,EAAAC,EAAA1uD,GACA,MAAA7K,EAnBA,SAAA/H,GACA,GAAAA,EAAAC,OAAAF,eACA,OAAAC,EAAAC,OAAAF,eAGA,MAAAwhE,KAUA,OATAztE,OAAA6oB,KAAA3c,EAAAE,OAAAyI,QAAA/R,IACA,MAAAgtB,EAAA5jB,EAAAE,MAAAtJ,GAEAgtB,EAAA7mB,KAAAC,YACAukE,EAAA39C,EAAA7mB,KAAAC,WAAA4mB,KAIA5jB,EAAAC,OAAAF,eAAAwhE,EACAA,EAIAC,CAAAxhE,GACAyhE,KACA3oE,KAEA,QAAA2D,EAAA,EAAqBA,EAAA4kE,EAAmB5kE,GAAA,GACxC,MAAAjE,EAAAyoE,EAAAl5D,EAAAvP,KAAAoa,GAMA,GAJApa,GACAM,EAAAW,KAAAjB,GAGA8oE,EAAA,CACA,MAAAI,EAAAT,EAAAl5D,EAAAE,YAAA2K,GAEA8uD,GACAD,EAAAhoE,KAAAioE,IAKA,MAAAl+D,KAEA,QAAA/G,EAAA,EAAqBA,EAAA2kE,EAAmB3kE,GAAA,EACxC+G,EAAA/J,KAAAsO,EAAAxP,IAAAwiC,cAAA,KAAAumC,GAAA,IAAA7kE,EAAAglE,EAAA3oE,IAGA,OAAAiP,EAAAhP,MAAAgiC,cAAA,KAAAv3B,GA8BA,SAAAm+D,EAAAnjE,EAAA+0D,EAAAqO,GACA,IAAApjE,EACA,UAAAzL,MAAA,4BACG,IAAAwgE,EACH,UAAAxgE,MAAA,iCAGA,OA9BA,SAAAyL,GAEA,MAAAojE,IAAAxsD,UAAAviB,OAAA,QAAAwY,IAAA+J,UAAA,KAAAA,UAAA,GAEA,IAAA5W,EACA,UAAAzL,MAAA,4BAGA,MAAAH,KAYA,OAVA4L,EAAAovB,YAAA,CAAAhxB,EAAAzB,KAMA,GALAvI,EAAA6G,MACA+E,KAAA5B,EACAzB,SAGAymE,EACA,WAGAhvE,EAUAmX,CAAAvL,EAAAojE,GAAAp/D,OAAA5F,GAAA22D,EAAA32D,EAAA4B,OAGA,SAAAqjE,EAAArjE,EAAAojE,GACA,OAAAD,EAAAnjE,EAAA5B,KAAAuxB,QAAAyzC,GAmBA,SAAAE,EAAAvO,GACA,OAAA3yD,IAhBA,SAAAN,EAAAizD,GACA,QAAAxhE,EAAAuO,EAAAhI,MAA0BvG,EAAA,EAAOA,GAAA,GACjC,MAAAyM,EAAA8B,EAAA9B,KAAAzM,GAEA,GAAAwhE,EAAA/0D,GACA,OACArD,IAAApJ,EAAA,EAAAuO,EAAAG,OAAA1O,GAAA,EACAmH,MAAAoH,EAAApH,MAAAnH,GACAuG,MAAAvG,EACAyM,UAOAujE,CAAAnhE,EAAAmC,MAAAwwD,GAOA,SAAAyO,EAAAp+C,GAEA,gBAAAhjB,GACA,GAPA,SAAAA,GACA,OAAAA,aAA8BmyC,EAAA,EAM9BkvB,CAAArhE,GAAA,CACA,MAAApC,KACAA,GACOoC,GACPmC,MACAA,GACOnC,EAEP,GA5EA,SAAAgjB,EAAAplB,GACA,OAAAyd,MAAAC,QAAA0H,MAAA4T,QAAAh5B,EAAA5H,OAAA,GAAA4H,EAAA5H,OAAAgtB,EA2EAs+C,CAAAt+C,EAAAplB,GACA,OACAA,OACArD,IAAA4H,EAAA5H,IACA7C,MAAAyK,EAAAzK,SAOA,SAAA6pE,EAAA1tE,EAAAmC,GACA,MAAA+L,KACAA,EAAA2B,GACAA,GACG7P,EAAAmM,UACH,IAAAuQ,KACA1c,EAAA4M,IAAAqsB,aAAA/qB,EAAA2B,EAAA9F,IACA2S,WAAA3S,EAAA2S,SAEA,MAAAikB,EAAAjkB,EAAA+Y,KAAAk4C,KAAAxrE,KAAAtE,OAAAsE,EAAAtE,MAEA,OAAA8iC,EACAA,EAAA93B,SAMA,SAAA+kE,EAAA/hE,EAAA,KAAA1J,EAAA,MACA,IAAA0J,IAAA1J,EACA,SAGA,MAAAsC,EAAAoH,EAAAoB,OAAA4zB,WAAAh1B,EAAAyxB,cAEA,IAAA74B,EAAAsF,KACA,SAGA,MAAAuV,EAAA7a,EAAAsF,KAAA2S,MAAA+Y,KAAAkL,KAAAx+B,UAEA,IAAAmd,EACA,SAGA,IAAAse,EAAA/xB,EAAA7D,QACAw4B,EAAA30B,EAAApH,UAAAmlB,OACAiU,EAAAD,EAAA,EACAiwC,EAAArtC,EAAA/7B,EAAAsF,KAAA3B,SAEA,KAAAw1B,EAAA,GAAAte,EAAAwc,QAAAjwB,EAAAoB,OAAA9E,MAAAy1B,EAAA,GAAAlhB,QACAkhB,GAAA,EACA4C,GAAA30B,EAAAoB,OAAA9E,MAAAy1B,GAAAx1B,SAGA,KAAAy1B,EAAAhyB,EAAAoB,OAAAxE,YAAA6W,EAAAwc,QAAAjwB,EAAAoB,OAAA9E,MAAA01B,GAAAnhB,QACAmxD,GAAAhiE,EAAAoB,OAAA9E,MAAA01B,GAAAz1B,SACAy1B,GAAA,EAGA,OACA3vB,KAAAsyB,EACA3wB,GAAAg+D,GAIA,SAAAC,EAAA9tE,EAAAmC,GACA,MAAA+L,KACAA,EAAA2B,GACAA,GACG7P,EAAAmM,UACH,IAAAV,KACAzL,EAAA4M,IAAAqsB,aAAA/qB,EAAA2B,EAAA9F,IACA0B,QAAA1B,KAEA,MAAAA,EAAA0B,EAAApI,UAAAoyB,KAAAs4C,KAAA5rE,KAAAtE,OAAAsE,EAAAtE,MAEA,OAAAkM,EACAA,EAAAlB,SAMA,SAAAmlE,EAAAhuE,EAAAmC,GACA,MAAA+L,KACAA,EAAAI,MACAA,EAAAuB,GACAA,EAAAL,MACAA,GACGxP,EAAAmM,UAEH,OAAAqD,IACArN,EAAA25B,QAAA97B,EAAAw0C,aAAAlmC,EAAAoO,WAGA1c,EAAA4M,IAAAm0B,aAAA7yB,EAAA2B,EAAA1N,GAGA,SAAA8rE,GAAA36D,MACAA,EAAAvJ,KACAA,IAEA,OAAAyd,MAAAC,QAAAnU,MAAAkV,SAAAze,EAAA5H,OAAA4H,EAAA5H,OAAAmR,EAGA,SAAA46D,EAAAluE,EAAAmC,EAAA0G,MACA,MAEAkB,EAAAwjE,EAAAprE,EAAAorE,CAAAvtE,EAAAmM,YAAAkhE,EAFAtjE,KAAA5H,SAEAkrE,CAAArtE,EAAAmM,WAEA,OAAA9M,OAAA6oB,KAAArf,GAAAzK,QAAA2L,EAIAA,OAAA02B,UAAAt+B,MAAoC4H,OAAAlB,SACpCA,MAJAkB,wwBCxLA,SAAAokE,EAAAC,EAAAvlE,EAAA,MACA,gBAAA7I,EAAAC,GACA,IAAAqO,MAAaA,EAAAC,OAAavO,EAAAmM,UAC1B2U,EAAAxS,EAAAixB,WAAAhxB,GAAA8/D,GAAA,EAAAC,EAAAxtD,EACA,IAAAA,EACA,SAEA,GAAAA,EAAAjd,OAAA,GAAAyK,EAAAvE,KAAA+W,EAAAjd,MAAA,GAAA1B,KAAAs7B,kBAAA2wC,IAAA,GAAAttD,EAAA8c,WAAA,CAEA,MAAAtvB,EAAAtG,MAAA8Y,EAAAjd,MAAA,GACA,SACA,IAAA0qE,EAAAvuE,EAAA4M,IAAAb,QAAA+U,EAAArc,MAAA,GACA6pE,EAAA,IAA6Bj/D,EAAA,EAASk/D,IAAAztD,EAAAjd,OACtCid,EAAA+c,SAAA/c,EAAA7T,OAAAxE,aACAqY,EAAA,IAA4BzR,EAAA,EAASf,EAAAtO,EAAA4M,IAAAb,QAAAwC,EAAAlB,IAAAyT,EAAAjd,QAAAid,EAAAjd,QACrCwqE,GAAA,EAEA,IAAA7iC,EAAmBnsC,OAAAoY,EAAA,EAAApY,CAAYivE,EAAAF,EAAAvlE,EAAAiY,GAC/B,QAAA0qB,IAEAvrC,GACAA,EAIA,SAAAsP,EAAAuR,EAAAq0C,EAAAqZ,EAAAJ,GACA,IAAAjgE,EAAkBkB,EAAA,EAAQG,MAC1B,QAAAlS,EAAA63D,EAAA/2D,OAAA,EAAqCd,GAAA,EAAQA,IAC7C6Q,EAAkBkB,EAAA,EAAQnB,KAAAinD,EAAA73D,GAAA6E,KAAA7C,OAAA61D,EAAA73D,GAAAuL,MAAAsF,IAC1BoB,EAAAkH,KAAA,IAAgBgB,EAAA,EAAiBqJ,EAAArc,OAAA+pE,EAAA,KAAA1tD,EAAAzT,IAAAyT,EAAArc,MAAAqc,EAAAzT,IAAA,IAA4EgC,EAAA,EAAKlB,EAAA,KAAAgnD,EAAA/2D,QAAA,IAClH,IAAAk6B,EAAA,EACA,QAAAh7B,EAAA,EAAmBA,EAAA63D,EAAA/2D,OAAqBd,IACxC63D,EAAA73D,GAAA6E,MAAAisE,IACA91C,EAAAh7B,EAAA,GACA,IAAAmxE,EAAAtZ,EAAA/2D,OAAAk6B,EACAo2C,EAAA5tD,EAAArc,MAAA0wD,EAAA/2D,QAAAowE,EAAA,KAAAvhE,EAAA6T,EAAA7T,OACA,QAAA3P,EAAAwjB,EAAA8c,WAAA/7B,EAAAif,EAAA+c,SAAAlE,GAAA,EAAoEr8B,EAAAuE,EAAOvE,IAAAq8B,GAAA,GAC3EA,GAAsBt6B,OAAAoY,EAAA,EAAApY,CAAQkQ,EAAA3C,IAAA8hE,EAAAD,KAC9Bl/D,EAAArR,MAAAwwE,EAAAD,GACAC,GAAA,EAAAD,GAEAC,GAAAzhE,EAAA9E,MAAA7K,GAAA8K,SAEA,OAAAmH,EAtBAo/D,CAAA3uE,EAAAuP,GAAAuR,EAAA0qB,EAAA6iC,EAAAD,GAAA77D,mBACA,IA2BA,SAAAq8D,EAAAC,GACA,gBAAA7uE,EAAAC,GACA,IAAAqO,MAAaA,EAAAC,MAAAxE,QAAmB/J,EAAAmM,UAChC,GAAApC,KAAA2vB,SAAAprB,EAAAzK,MAAA,IAAAyK,EAAAqxB,WAAApxB,GACA,SACA,IAAAugE,EAAAxgE,EAAAvE,MAAA,GACA,GAAA+kE,EAAA3sE,MAAA0sE,EACA,SACA,MAAAvgE,EAAArB,OAAAkB,QAAAC,MAAAE,EAAAvE,MAAA,GAAAtB,YAAA6F,EAAAyE,YAAA,IAIA,MAAAzE,EAAAzK,OAAAyK,EAAAvE,MAAA,GAAA5H,MAAA0sE,GACAvgE,EAAAtG,OAAA,IAAAsG,EAAAvE,MAAA,GAAAtB,WAAA,EACA,SACA,GAAAxI,EAAA,CACA,IAAAurC,EAA2Bn8B,EAAA,EAAQG,MACnCu/D,EAAAzgE,EAAAtG,OAAA,KAAAsG,EAAAtG,OAAA,OAGA,QAAA8D,EAAAwC,EAAAzK,MAAAkrE,EAAuDjjE,GAAAwC,EAAAzK,MAAA,EAAsBiI,IAC7E0/B,EAA2Bn8B,EAAA,EAAQnB,KAAAI,EAAAvE,KAAA+B,GAAA1M,KAAAosC,IACnC,IAAAwjC,EAAA1gE,EAAAyE,YAAA,GAAAzE,EAAAvE,MAAA,GAAAtB,WAAA,EACA6F,EAAAyE,YAAA,GAAAzE,EAAAvE,MAAA,GAAAtB,WAAA,IAEA+iC,IAAAn3B,OAAmChF,EAAA,EAAQnB,KAAA2gE,EAAAz/D,kBAC3C,IAAA3K,EAAA6J,EAAAtC,OAAAsC,EAAAzK,OAAAkrE,EAAA,IACAx/D,EAAAvP,EAAAuP,GAAAI,QAAAlL,EAAA6J,EAAA7B,OAAAuiE,GAAA,IAA+E3/D,EAAA,EAAKm8B,EAAA,EAAAujC,EAAA,IACpF1iE,GAAA,EACAkD,EAAA3C,IAAAqsB,aAAAx0B,EAAA8K,EAAA3C,IAAAuB,QAAAC,KAAA,CAAArE,EAAArD,KACA,GAAA2F,GAAA,EACA,SACAtC,EAAAu2B,aAAA,GAAAv2B,EAAAoE,QAAAC,OACA/B,EAAA3F,EAAA,KAEA2F,GAAA,GACAkD,EAAAO,aAAoCnE,EAAA,EAASyF,KAAA7B,EAAA3C,IAAAb,QAAAM,KAC7CpM,EAAAsP,EAAAgD,kBAEA,SAEA,IAAAm5B,EAAAn9B,EAAA7H,KAAA4H,EAAAjB,MAAAyhE,EAAA5tC,eAAA,GAAAiB,YAAA,KACA5yB,EAAAvP,EAAAuP,GAAAmS,OAAApT,EAAA5H,IAAA6H,EAAA7H,KACA4M,EAAAo4B,GAAA,MAAuCvpC,KAAAupC,SAAiB90B,EACxD,QAAavX,OAAAoY,EAAA,EAAApY,CAAQkQ,EAAA3C,IAAA0B,EAAA5H,IAAA,EAAA4M,KAErBrT,GACAA,EAAAsP,EAAArR,MAAAoQ,EAAA5H,IAAA,EAAA4M,GAAAf,mBACA,IAOA,SAAA08D,EAAAJ,GACA,gBAAA7uE,EAAAC,GACA,IAAAqO,MAAaA,EAAAC,OAAavO,EAAAmM,UAC1B2U,EAAAxS,EAAAixB,WAAAhxB,EAAAxE,KAAAtB,WAAA,GAAAsB,EAAA4C,WAAAxK,MAAA0sE,GACA,QAAA/tD,KAEA7gB,IAEAqO,EAAAvE,KAAA+W,EAAAjd,MAAA,GAAA1B,MAAA0sE,EAMA,SAAA7uE,EAAAC,EAAA4uE,EAAA/tD,GACA,IAAAvR,EAAAvP,EAAAuP,GAAAlC,EAAAyT,EAAAzT,IAAA6hE,EAAApuD,EAAAvS,IAAAlB,IAAAyT,EAAAjd,OACAwJ,EAAA6hE,IAGA3/D,EAAAkH,KAAA,IAAoBgB,EAAA,EAAiBpK,EAAA,EAAA6hE,EAAA7hE,EAAA6hE,EAAA,IAAyC7/D,EAAA,EAAMA,EAAA,EAAQnB,KAAA2gE,EAAAvvE,OAAA,KAAAwhB,EAAA7T,OAAA7N,SAAA,YAC5F0hB,EAAA,IAAoBzR,EAAA,EAASE,EAAA3C,IAAAb,QAAA+U,EAAAxS,MAAA5H,KAAA6I,EAAA3C,IAAAb,QAAAmjE,GAAApuD,EAAAjd,QAE7B,MAAAmb,EAAmB3f,OAAAoY,EAAA,EAAApY,CAAUyhB,GAC7B,aAAA9B,IAEA/e,EAAAsP,EAAA2iC,KAAApxB,EAAA9B,GAAAzM,mBACA,GAjBA48D,CAAAnvE,EAAAC,EAAA4uE,EAAA/tD,GAmBA,SAAA9gB,EAAAC,EAAA6gB,GACA,IAAAvR,EAAAvP,EAAAuP,GAAA7K,EAAAoc,EAAA7T,OAEA,QAAAvG,EAAAoa,EAAAzT,IAAA/P,EAAAwjB,EAAA+c,SAAA,EAAAh8B,EAAAif,EAAA8c,WAA2EtgC,EAAAuE,EAAOvE,IAClFoJ,GAAAhC,EAAAyD,MAAA7K,GAAA8K,SACAmH,EAAAmS,OAAAhb,EAAA,EAAAA,EAAA,GAEA,IAAAq2B,EAAAxtB,EAAA3C,IAAAb,QAAA+U,EAAArc,OAAA+R,EAAAumB,EAAArwB,UACA,GAAA6C,EAAAf,QAAArP,IAAA2hB,EAAAzT,MAAAyT,EAAArc,MAAAs4B,EAAArwB,UAAAtE,SACA,SACA,IAAAmzC,EAAA,GAAAz6B,EAAA8c,WAAAuV,EAAAryB,EAAA+c,UAAAn5B,EAAA+D,WACAwE,EAAA8vB,EAAAhzB,MAAA,GAAAqlE,EAAAryC,EAAA/0B,OAAA,GACA,IAAAiF,EAAAkxB,WAAAixC,GAAA7zB,EAAA,KAAA6zB,EAAA,EAAA54D,EAAArI,QAAAkG,OAAA8+B,EAAyG9jC,EAAA,EAAQG,MAASH,EAAA,EAAQnB,KAAAxJ,KAClI,SACA,IAAAD,EAAAs4B,EAAAr2B,IAAA2G,EAAA5I,EAAA+R,EAAApO,SAOA,OAHAmH,EAAAkH,KAAA,IAAgBgB,EAAA,EAAiBhT,GAAA82C,EAAA,KAAAluC,GAAA8lC,EAAA,KAAA1uC,EAAA,EAAA4I,EAAA,MAA2EgC,EAAA,GAAKksC,EAAYlsC,EAAA,EAAQG,MAASH,EAAA,EAAQnB,KAAAxJ,EAAAtF,KAAgBiQ,EAAA,EAAQG,SAC9K6E,OAAA8+B,EAAwB9jC,EAAA,EAAQG,MAASH,EAAA,EAAQnB,KAAAxJ,EAAAtF,KAAgBiQ,EAAA,EAAQG,SAAA+rC,EAAA,IAAApI,EAAA,KAAAoI,EAAA,MACzEt7C,EAAAsP,EAAAgD,mBACA,EAtCA88D,CAAArvE,EAAAC,EAAA6gB,MA4CA,SAAAwuD,EAAAT,GACA,gBAAA7uE,EAAAC,GACA,IAAAqO,MAAaA,EAAAC,OAAavO,EAAAmM,UAC1B2U,EAAAxS,EAAAixB,WAAAhxB,EAAAxE,KAAAtB,WAAA,GAAAsB,EAAA4C,WAAAxK,MAAA0sE,GACA,IAAA/tD,EACA,SACA,IAAA8c,EAAA9c,EAAA8c,WACA,MAAAA,EACA,SACA,IAAA3wB,EAAA6T,EAAA7T,OAAAJ,EAAAI,EAAA9E,MAAAy1B,EAAA,GACA,GAAA/wB,EAAA1K,MAAA0sE,EACA,SACA,GAAA5uE,EAAA,CACA,IAAAsvE,EAAA1iE,EAAAC,WAAAD,EAAAC,UAAA3K,MAAA8K,EAAA9K,KACAuT,EAAwBrG,EAAA,EAAQnB,KAAAqhE,EAAAV,EAAAvvE,SAAA,MAChCiL,EAAA,IAA4B8E,EAAA,EAAMA,EAAA,EAAQnB,KAAA2gE,EAAAvvE,OAAA,KAA4B+P,EAAA,EAAQnB,KAAAjB,EAAA9K,KAAA7C,OAAA,KAAAoW,MAAA65D,EAAA,OAC9EvjE,EAAA8U,EAAArc,MAAAgI,EAAAqU,EAAAzT,IACApN,EAAAD,EAAAuP,GAAAkH,KAAA,IAAuCgB,EAAA,EAAiBzL,GAAAujE,EAAA,KAAA9iE,EAAAT,EAAAS,EAAAlC,EAAA,OACxDgI,kBAEA;;;;;;ACxOA,SAAA+iC,EAAA58C,EAAA,IACA,OAAAsH,EAAAC,KACA,MAAAqO,MACAA,GACKtO,EAAAmM,WACLzF,IACAA,GACK4H,EAAA5H,IAEL,OADAzG,EAAAD,EAAAuP,GAAA+lC,WAAA58C,EAAAgO,KACA,GAgBA,SAAA8oE,EAAAvF,EAAAzjC,EAAA5oB,GACA,WAAa6xD,EAAA,EAASxF,EAAA,CAAAjqE,EAAA+d,EAAAtZ,EAAA4I,KACtB,MAAAxE,EAAA+U,aAAAqgC,SAAArgC,EAAAG,GAAAH,GACArO,GACAA,GACKvP,EACL6mB,EAAA9I,EAAA3f,OAAA,EACA,IAAAsxE,EAAAriE,EACAsiE,EAAAlrE,EAEA,GAAAsZ,EAAA8I,GAAA,CACA,MAAA+oD,EAAAnrE,EAAAsZ,EAAA,GAAAglB,QAAAhlB,EAAA8I,EAAA,IACAgpD,EAAAD,EAAA7xD,EAAA8I,EAAA,GAAAzoB,OAAA,EACA0xE,EAAAF,EAAA7xD,EAAA8I,EAAA,GAAA6oB,YAAA3xB,EAAA8I,IACAkpD,EAAAD,EAAA/xD,EAAA8I,GAAAzoB,OAQA,GAlCA,SAAAqG,EAAA4I,EAAArN,GACA,IAAA0c,KAQA,OAPA1c,EAAA4M,IAAAqsB,aAAAx0B,EAAA4I,EAAA,CAAAtD,EAAArD,KACAgW,WAAA3S,EAAA2S,MAAAvd,IAAAwhC,KACAl8B,MAAAiC,EACA2G,IAAA3G,EAAAqD,EAAA3B,SACAu4B,aAGAjkB,EAkBAszD,CAAAvrE,EAAA4I,EAAArN,GAAA+N,OAAAyI,IACA,MAAAswB,SACAA,GACStwB,EAAAmqB,KAAAx+B,KACT,OAAA2kC,EAAArR,KAAAtzB,KAAAtE,OAAA2oC,EAAA3oC,QACOkQ,OAAAyI,KAAAnJ,IAAAuiE,GAEPxxE,OACA,SAGA2xE,EAAAF,GACAtgE,EAAAmS,OAAAquD,EAAAF,GAGAC,EAAAF,GACArgE,EAAAmS,OAAAkuD,EAAAE,GAIAJ,GADAC,EAAAC,GACA7xD,EAAA8I,GAAAzoB,OAKA,OAFAmR,EAAAwlC,QAAA46B,EAAAD,EAAAlpC,EAAAlnC,OAAAuJ,IACA0G,EAAAklC,iBAAAjO,GACAj3B,IAIA,SAAA0gE,EAAAhG,EAAA9nE,EAAAyb,GACA,WAAa6xD,EAAA,EAASxF,EAAA,CAAAjqE,EAAA+d,EAAAtZ,EAAA4I,KACtB,MAAAxE,EAAA+U,aAAAqgC,SAAArgC,EAAAG,GAAAH,GACArO,GACAA,GACKvP,EAML,OAJA+d,EAAA,IACAxO,EAAA0jC,YAAAxuC,EAAA,EAAA4I,EAAAlL,EAAA7C,OAAAuJ,IAGA0G,IAIA,SAAA2gE,EAAAjG,EAAA9nE,EAAAyb,GACA,MAAA66C,EAAAnpD,IACA,MAAA7D,KAiCA,OAhCA6D,EAAA4E,QAAA/L,IACA,GAAAA,EAAAqxB,OAAA,CACA,MAAA9gC,KACAA,GACSyP,EACT,IACA4V,EADArX,EAAA,EAGA,GAGA,GAFAqX,EAAAksD,EAAAltE,KAAArE,GAEA,CACA,MAAA+L,EAAAsZ,EAAA/V,MACAqF,EAAA5I,EAAAsZ,EAAA,GAAA3f,OACAyK,EAAA+U,aAAAqgC,SAAArgC,EAAAG,EAAA,IAAAH,EAEAnZ,EAAA,GACAgH,EAAAzG,KAAAmD,EAAA2xB,IAAApzB,EAAAjC,IAGAgH,EAAAzG,KAAAmD,EAAA2xB,IAAAr1B,EAAA4I,GAAAszB,KAAAx+B,EAAA7C,OAAAuJ,GAAA4yB,SAAAtzB,EAAAuU,SACAhW,EAAA2G,SAES0Q,GAETrX,EAAAhO,EAAA0F,QACAqN,EAAAzG,KAAAmD,EAAA2xB,IAAApzB,SAGA+E,EAAAzG,KAAAmD,EAAA/I,KAAAq5D,EAAAtwD,EAAAgG,aAGWkB,EAAA,EAAQ8rB,UAAA1vB,IAGnB,WAAaE,EAAA,GACb3M,OACAmxE,gBAAA5lE,GAAA,IAAoC8E,EAAA,EAAKopD,EAAAluD,EAAA4D,SAAA5D,EAAA6xB,UAAA7xB,EAAA8xB,YAKzC,SAAA+zC,EAAAnG,EAAA9nE,EAAAyb,GACA,MAAA66C,EAAA,CAAAnpD,EAAArC,KACA,MAAAxB,KAqCA,OApCA6D,EAAA4E,QAAA/L,IACA,GAAAA,EAAAqxB,OAAA,CACA,MAAA9gC,KACAA,EAAAgkB,MACAA,GACSvU,EACT,IACA4V,EADArX,EAAA,EAEA,MAAA2pE,IAAA3zD,EAAA3O,OAAA4Y,GAAA,SAAAA,EAAAxkB,KAAAtE,MAAA,GAEA,MAAAwyE,GAAA,QAAAtyD,EAAAksD,EAAAltE,KAAArE,KACA,GAAAuU,KAAA9K,KAAAokC,eAAApkC,IAAA4b,EAAA,IACA,MAAAtZ,EAAAsZ,EAAA/V,MACAqF,EAAA5I,EAAAsZ,EAAA,GAAA3f,OACA0xE,EAAArrE,EAAAsZ,EAAA,GAAAglB,QAAAhlB,EAAA,IACAgyD,EAAAD,EAAA/xD,EAAA,GAAA3f,OACAyK,EAAA+U,aAAAqgC,SAAArgC,EAAAG,GAAAH,EAEAnZ,EAAA,GACAgH,EAAAzG,KAAAmD,EAAA2xB,IAAApzB,EAAAjC,IAIAgH,EAAAzG,KAAAmD,EAAA2xB,IAAAg2C,EAAAC,GAAApvC,KAAAx+B,EAAA7C,OAAAuJ,GAAA4yB,SAAAtzB,EAAAuU,SACAhW,EAAA2G,EAKA3G,EAAAhO,EAAA0F,QACAqN,EAAAzG,KAAAmD,EAAA2xB,IAAApzB,SAGA+E,EAAAzG,KAAAmD,EAAA/I,KAAAq5D,EAAAtwD,EAAAgG,QAAAhG,OAGWkH,EAAA,EAAQ8rB,UAAA1vB,IAGnB,WAAaE,EAAA,GACb3M,OACAmxE,gBAAA5lE,GAAA,IAAoC8E,EAAA,EAAKopD,EAAAluD,EAAA4D,SAAA5D,EAAA6xB,UAAA7xB,EAAA8xB,YAKzC,SAAAuY,EAAAzyC,GACA,OAAAnC,EAAAC,KACA,MAAAsP,GACAA,EAAApD,UACAA,GACKnM,EACL,IAAAkO,KACAA,EAAA2B,GACAA,GACK1D,EACL,MAAAmC,MACAA,EAAAkB,MACAA,GACKrD,EAEL,GAAAqD,EAAA,CACA,MAAAsR,EAAoBzhB,OAAAggB,EAAA,EAAAhgB,CAAYiP,EAAAnM,GAChC+L,EAAA4S,EAAA5S,KACA2B,EAAAiR,EAAAjR,GAIA,OADAN,EAAAqlC,WAAA1mC,EAAA2B,EAAA1N,GACAlC,EAAAsP,IAIA,SAAA+gE,EAAAxvD,EAAA,KAAA3e,EAAA0G,KAAoDyG,EAAaD,EAAA,EAAQG,OACzE,OAAAxP,EAAAC,KACA,MAAAqO,MACAA,EAAAC,IACAA,GACKvO,EAAAmM,UACLnE,EAAAsG,EAAAtG,QACAkG,EAAA4S,IAAA5S,KAAAI,EAAA5H,IACAmJ,EAAAiR,IAAAjR,GAAAtB,EAAA7H,IAEA,QAAA4H,EAAArB,OAAAy0B,eAAA15B,IAAA7F,KAIAlC,GACAA,EAAAD,EAAAuP,GAAA0jC,YAAA/kC,EAAA2B,EAAA1N,EAAA7C,OAAAuJ,EAAAyG,MAGA,IAwDA,SAAAihE,EAAA1B,GACA,gBAAA7uE,EAAAC,GACA,MAAAqO,MACAA,EAAAC,IACAA,EAAAxE,KACAA,GACK/J,EAAAmM,UACL,GAAApC,KAAA2vB,SAAAprB,EAAAzK,MAAA,IAAAyK,EAAAqxB,WAAApxB,GAAA,SACA,MAAAugE,EAAAxgE,EAAAvE,MAAA,GACA,GAAA+kE,EAAA3sE,MAAA0sE,EAAA,SAEA,MAAAvgE,EAAArB,OAAAkB,QAAAC,KAAA,CAIA,MAAAE,EAAAzK,OAAAyK,EAAAvE,MAAA,GAAA5H,MAAA0sE,GAAAvgE,EAAAtG,OAAA,IAAAsG,EAAAvE,MAAA,GAAAtB,WAAA,WAEA,GAAAxI,EAAA,CACA,IAAAurC,EAAmBn8B,EAAA,EAAQG,MAC3B,MAAAghE,EAAAliE,EAAAtG,OAAA,KAGA,QAAA8D,EAAAwC,EAAAzK,OAAA2sE,EAAA,KAAsD1kE,GAAAwC,EAAAzK,MAAA,EAAsBiI,IAAA0/B,EAAan8B,EAAA,EAAQnB,KAAAI,EAAAvE,KAAA+B,GAAA1M,KAAAosC,IAGjGA,IAAAn3B,OAA2BhF,EAAA,EAAQnB,KAAA2gE,EAAAz/D,kBACnC,MAAAG,EAAAvP,EAAAuP,GAAAI,QAAArB,EAAAtC,OAAAwkE,EAAA,SAAAliE,EAAA7B,OAAA,OAA6F4C,EAAA,EAAKm8B,EAAAglC,EAAA,QAClGjhE,EAAAO,aAAA9P,EAAAmM,UAAAgJ,YAAA/D,KAAA7B,EAAA3C,IAAAb,QAAAuC,EAAA5H,KAAA8pE,EAAA,QACAvwE,EAAAsP,EAAAgD,kBAGA,SAGA,MAAAm5B,EAAAn9B,EAAA7H,KAAA4H,EAAAjB,MAAAyhE,EAAA5tC,eAAA5yB,EAAAyE,YAAA,IAAAovB,YAAA,KACA5yB,EAAAvP,EAAAuP,GAAAmS,OAAApT,EAAA5H,IAAA6H,EAAA7H,KAIA,IAAA4M,EAAAo4B,KACAvpC,KAAA0sE,IAEA1sE,KAAAupC,IAOA,OALAp4B,QACAnR,KAAA0sE,GACK,SA1EL,SAAAjiE,EAAAlG,EAAA7C,EAAA,EAAA4sE,GACA,MAAA5kE,EAAAe,EAAAb,QAAArF,GACA7N,EAAAgT,EAAAhI,QACA6sE,EAAAD,OAAAryE,OAAA,IAAAyN,EAAAoB,OACA,GAAApU,EAAA,GAAAgT,EAAAoB,OAAA9K,KAAAmG,KAAAq2B,YAAA9yB,EAAAoB,OAAAkxB,WAAAtyB,EAAA7D,QAAA6D,EAAAoB,OAAAxE,cAAAioE,EAAAvuE,KAAA47B,aAAAlyB,EAAAoB,OAAAkB,QAAA4rB,WAAAluB,EAAA7D,QAAA6D,EAAAoB,OAAAxE,aAAA,SAEA,QAAAqD,EAAAD,EAAAhI,MAAA,EAAAvG,EAAAuG,EAAA,EAA6CiI,EAAAjT,EAAUiT,IAAAxO,IAAA,CACvD,MAAAyM,EAAA8B,EAAA9B,KAAA+B,GACA9D,EAAA6D,EAAA7D,MAAA8D,GACA,GAAA/B,EAAA5H,KAAAmG,KAAAq2B,UAAA,SACA,IAAAgyC,EAAA5mE,EAAAoE,QAAA4rB,WAAA/xB,EAAA+B,EAAAtB,YACA,MAAAgE,EAAAgkE,KAAAnzE,IAAAyM,EAMA,GALA0C,GAAA1C,IAAA4mE,IAAA32C,aAAA,EAAAvtB,EAAAtK,KAAA7C,OAAAmN,EAAA5D,UAKAkB,EAAAo0B,WAAAn2B,EAAA,EAAA+B,EAAAtB,YAAA,SAIA,MAAAT,EAAA6D,EAAAkH,WAAAla,GACA+3E,EAAAH,KAAA,GACA,OAAA5kE,EAAA9B,KAAAlR,GAAA6oC,eAAA15B,IAAA4oE,IAAAzuE,KAAA0J,EAAA9B,KAAAlR,EAAA,GAAAsJ,MAsDA0uE,CAAAthE,EAAA3C,IAAA0B,EAAA5H,IAAA,EAAA4M,KACArT,KAAAsP,EAAArR,MAAAoQ,EAAA5H,IAAA,EAAA4M,GAAAf,mBACA,IAKA,SAAAu+D,EAAA3uE,EAAA4uE,EAAAloE,MACA,OAAA7I,EAAAC,EAAAR,KAGA,OAFqBJ,OAAAggB,EAAA,EAAAhgB,CAAYW,EAAAmC,EAAA0G,GAGpBxJ,OAAAN,EAAA,EAAAM,CAAY0xE,EAAZ1xE,CAAYW,EAAAC,EAAAR,GAGdJ,OAAAN,EAAA,EAAAM,CAAY8C,EAAA0G,EAAZxJ,CAAYW,EAAAC,EAAAR,IAIvB,SAAAuxE,EAAAjnE,EAAAwB,GACA,OAAAxB,EAAA5H,OAAAoJ,EAAAE,MAAAwlE,aAAAlnE,EAAA5H,OAAAoJ,EAAAE,MAAAylE,cAAAnnE,EAAA5H,OAAAoJ,EAAAE,MAAA0lE,UAGA,SAAAC,EAAAhD,EAAAS,GACA,OAAA7uE,EAAAC,EAAAR,KACA,MAAA8L,OACAA,EAAAY,UACAA,GACKnM,GACLsO,MACAA,EAAAC,IACAA,GACKpC,EACL2U,EAAAxS,EAAAixB,WAAAhxB,GAEA,IAAAuS,EACA,SAGA,MAAAuwD,EAAuBhyE,OAAAggB,EAAA,EAAAhgB,CAAc0K,GAAAinE,EAAAjnE,EAAAwB,GAAdlM,CAAc8M,GAErC,GAAA2U,EAAAjd,OAAA,GAAAwtE,GAAAvwD,EAAAjd,MAAAwtE,EAAAxtE,OAAA,GACA,GAAAwtE,EAAAtnE,KAAA5H,OAAAisE,EACA,OAAea,EAAYJ,EAAZI,CAAYjvE,EAAAC,EAAAR,GAG3B,GAAAuxE,EAAAK,EAAAtnE,KAAAwB,IAAA6iE,EAAArwC,aAAAszC,EAAAtnE,KAAAoE,SAAA,CACA,MAAAoB,GACAA,GACSvP,EAOT,OANAuP,EAAAoE,cAAA09D,EAAA3qE,IAAA0nE,GAEAnuE,GACAA,EAAAsP,IAGA,GAIA,OAAW4+D,EAAUC,EAAVD,CAAUnuE,EAAAC,EAAAR,IAIrB,SAAA6xE,EAAAnvE,EAAA0G,MACA,OAAA7I,EAAAC,EAAAR,KAGA,OAFqBJ,OAAAggB,EAAA,EAAAhgB,CAAYW,EAAAmC,EAAA0G,GAGpBxJ,OAAAN,EAAA,EAAAM,CAAIW,EAAAC,GAGNZ,OAAAN,EAAA,EAAAM,CAAM8C,EAAA0G,EAANxJ,CAAMW,EAAAC,EAAAR,IAIjB,SAAA8xE,EAAApvE,EAAA0G,GACA,OAAA7I,EAAAC,KACA,MAAAsP,GACAA,EAAApD,UACAA,EAAAS,IACAA,GACK5M,GACLiO,OACAA,EAAAuB,MACAA,GACKrD,EAEL,GAAAqD,EAAA,CACA,MAAAtB,KACAA,EAAA2B,GACAA,GACUxQ,OAAAggB,EAAA,EAAAhgB,CAAY8M,EAAAmC,MAAAnM,GAEtByK,EAAAm0B,aAAA7yB,EAAA2B,EAAA1N,IACAoN,EAAAqlC,WAAA1mC,EAAA2B,EAAA1N,GAGAoN,EAAAwlC,QAAA7mC,EAAA2B,EAAA1N,EAAA7C,OAAAuJ,SAEAoF,EAAAiG,QAAAoqB,IACA,MAAA/vB,IACAA,EAAAD,MACAA,GACSgwB,EAET1xB,EAAAm0B,aAAAzyB,EAAA5H,IAAA6H,EAAA7H,IAAAvE,IACAoN,EAAAqlC,WAAAtmC,EAAA5H,IAAA6H,EAAA7H,IAAAvE,GAGAoN,EAAAwlC,QAAAzmC,EAAA5H,IAAA6H,EAAA7H,IAAAvE,EAAA7C,OAAAuJ,MAIA,OAAA5I,EAAAsP,yBCvcA,MAAAiiE,EAAA,UACAC,EAAA,WACAC,EAAA,qBACAC,EAAA,sBACAC,GACAC,IAAA,QACAC,IAAA,OACAC,IAAA,OACAC,IAAA,SACAC,IAAA,SAEAC,EAAA5F,GAAAsF,EAAAtF,GAeA,MAAA6F,EAAA,6CAEA,SAAArvE,EAAAqC,GAEA,OAAAA,EAAAwK,QAAAwiE,EAAA,CAAAp2C,EAAAzyB,IAEA,WADAA,IAAA8e,eACA,IACA,MAAA9e,EAAA+uC,OAAA,GACA,MAAA/uC,EAAA+uC,OAAA,GACA96C,OAAAC,aAAAw7C,SAAA1vC,EAAAugB,UAAA,QACAtsB,OAAAC,cAAA8L,EAAAugB,UAAA,IAEA,IAIA,MAAAuoD,EAAA,eAkBA,MAAAC,EAAA,UACAC,EAAA,gCA0BA,MAAAC,KACAC,EAAA,mBACAC,EAAA,oBACAC,EAAA,4BAEA,SAAAC,EAAA95E,EAAAF,GACA45E,EAAA,IAAA15E,KAIA25E,EAAAt1E,KAAArE,GACA05E,EAAA,IAAA15E,KAAA,IAEA05E,EAAA,IAAA15E,GAAAk+C,EAAAl+C,EAAA,SAIA,MAAA+5E,GAAA,KADA/5E,EAAA05E,EAAA,IAAA15E,IACAkqC,QAAA,KAEA,aAAApqC,EAAAkxB,UAAA,KACA+oD,EACAj6E,EAEAE,EAAA8W,QAAA8iE,EAAA,MAAA95E,EACG,MAAAA,EAAA0/C,OAAA,GACHu6B,EACAj6E,EAEAE,EAAA8W,QAAA+iE,EAAA,MAAA/5E,EAEAE,EAAAF,EA0DA,SAAAo+C,EAAAnX,EAAA7T,EAAA5U,GACA,MAAAsgC,EAAA7X,EAAAxhC,OACA,OAAAq5C,EACA,SAIA,IAAAo7B,EAAA,EAGA,KAAAA,EAAAp7B,GAAA,CACA,MAAAq7B,EAAAlzC,EAAAyY,OAAAZ,EAAAo7B,EAAA,GACA,GAAAC,IAAA/mD,GAAA5U,EAEK,IAAA27D,IAAA/mD,IAAA5U,EAGL,MAFA07D,SAFAA,IAQA,OAAAjzC,EAAA7Q,OAAA,EAAA0oB,EAAAo7B,GA+BAt6E,EAAAC,SACAsI,OAxNA,SAAAqE,EAAA4tE,GACA,GAAAA,GACA,GAAAvB,EAAAt0E,KAAAiI,GACA,OAAAA,EAAAwK,QAAA8hE,EAAAS,QAGA,GAAAR,EAAAx0E,KAAAiI,GACA,OAAAA,EAAAwK,QAAAgiE,EAAAO,GAIA,OAAA/sE,GA8MArC,WACAsnE,KA3LA,SAAAzgD,EAAAvoB,GACAuoB,IAAArF,QAAAqF,EACAvoB,KAAA,GACA,MAAAmgB,GACA5R,QAAA,CAAA9R,EAAAohC,KAEAA,GADAA,IAAA3a,QAAA2a,GACAtvB,QAAAyiE,EAAA,MACAzoD,IAAAha,QAAA9R,EAAAohC,GACA1d,GAEAipD,SAAA,IACA,IAAArtD,OAAAwM,EAAAvoB,IAGA,OAAAmgB,GA8KA60B,SAzKA,SAAAS,EAAAh+C,EAAAF,GACA,GAAAk+C,EAAA,CACA,IAAAm8B,EACA,IACAA,EAAAC,mBAAAnwE,EAAAnK,IACAgX,QAAA0iE,EAAA,IACAjqD,cACK,MAAAvmB,GACL,YAEA,OAAAmxE,EAAAjwC,QAAA,oBAAAiwC,EAAAjwC,QAAA,kBAAAiwC,EAAAjwC,QAAA,SACA,YAGAlqC,IAAAy5E,EAAAp1E,KAAAvE,KACAA,EAAAg6E,EAAA95E,EAAAF,IAEA,IACAA,EAAAu6E,UAAAv6E,GAAAgX,QAAA,YACG,MAAA9N,GACH,YAEA,OAAAlJ,GAoJAg6E,aACAxI,UAhHkBptE,KAAA,cAiHlB6D,MA/GA,SAAA2gB,GACA,IACAvC,EACArf,EAFArC,EAAA,EAIA,KAAQA,EAAAqjB,UAAAviB,OAAsBd,IAE9B,IAAAqC,KADAqf,EAAA2B,UAAArjB,GAEA+B,OAAAiC,UAAA5D,eAAA8D,KAAAwd,EAAArf,KACA4hB,EAAA5hB,GAAAqf,EAAArf,IAKA,OAAA4hB,GAkGAy1B,WA/FA,SAAAm8B,EAAA56D,GAGA,MAaAlU,EAbA8uE,EAAAxjE,QAAA,OAAAoO,EAAA6L,EAAAgW,KACA,IAAAv9B,GAAA,EACA+wE,EAAAxpD,EACA,OAAAwpD,GAAA,UAAAxzC,EAAAwzC,IAAA/wE,KACA,OAAAA,EAGA,IAGA,OAGAnE,MAAA,OACA,IAAAZ,EAAA,EAEA,GAAA+G,EAAAjG,OAAAma,EACAlU,EAAAqJ,OAAA6K,QAEA,KAAAlU,EAAAjG,OAAAma,GAAAlU,EAAAW,KAAA,IAGA,KAAQ1H,EAAA+G,EAAAjG,OAAkBd,IAE1B+G,EAAA/G,GAAA+G,EAAA/G,GAAA66B,OAAAxoB,QAAA,aAEA,OAAAtL,GAmEA0yC,QACA20B,mBAtCA,SAAA9rC,EAAA34B,GACA,QAAA24B,EAAAmD,QAAA97B,EAAA,IACA,SAEA,MAAAwwC,EAAA7X,EAAAxhC,OACA,IAAA4e,EAAA,EACA1f,EAAA,EACA,KAAQA,EAAAm6C,EAAOn6C,IACf,UAAAsiC,EAAAtiC,GACAA,SACK,GAAAsiC,EAAAtiC,KAAA2J,EAAA,GACL+V,SACK,GAAA4iB,EAAAtiC,KAAA2J,EAAA,MACL+V,EACA,EACA,OAAA1f,EAIA,UAoBAuD,yBAjBA,SAAAO,GACAA,KAAAy1C,WAAAz1C,EAAAmB,QACA+C,QAAA4nB,KAAA,gPClOA5sB,EAAAwL,EAAAgmC,EAAA,sBAAAuhC,IAAA/yE,EAAAwL,EAAAgmC,EAAA,sBAAAwhC,IAAAhzE,EAAAwL,EAAAgmC,EAAA,sBAAAyhC,IAAAjzE,EAAAwL,EAAAgmC,EAAA,sBAAA0hC,IAAAlzE,EAAAwL,EAAAgmC,EAAA,sBAAA2hC,IAAAnzE,EAAAwL,EAAAgmC,EAAA,sBAAA4hC,IAAApzE,EAAAwL,EAAAgmC,EAAA,sBAAA++B,IAAAvwE,EAAAwL,EAAAgmC,EAAA,sBAAA6hC,IAAArzE,EAAAwL,EAAAgmC,EAAA,sBAAApN,IAAApkC,EAAAwL,EAAAgmC,EAAA,sBAAA8hC,IAAAtzE,EAAAwL,EAAAgmC,EAAA,sBAAA+hC,IAAAvzE,EAAAwL,EAAAgmC,EAAA,sBAAAgiC,IAAA,IAAA/5B,EAAAz5C,EAAA,QAWA,MAAAyzE,EAAA,MACAC,EAAAtsE,KAAAusE,IAAA,MACA,SAAAC,EAAAlsE,EAAA4hB,GAAqC,OAAA5hB,EAAA4hB,EAAAoqD,EACrC,SAAAG,EAAAtuE,GAA8B,OAAAA,EAAAkuE,EAE9B,MAAAK,EAAA,EAAAC,EAAA,EAAAC,EAAA,EAAAC,EAAA,QAKAC,EAIA/7E,YAIAiO,EAIA+tE,EAIAC,GACA3xE,KAAA2D,MACA3D,KAAA0xE,UACA1xE,KAAA2xE,UAOAv5B,cAAmB,OAAAp4C,KAAA0xE,QAAAF,GAAA,EAInBI,oBAAyB,OAAA5xE,KAAA0xE,SAAAL,EAAAE,IAAA,EAIzBM,mBAAwB,OAAA7xE,KAAA0xE,SAAAJ,EAAAC,IAAA,EAMxBO,oBAAyB,OAAA9xE,KAAA0xE,QAAAH,GAAA,SAQzBQ,EAMAr8E,YAIAwV,EAIA8mE,GAAA,GAGA,GAFAhyE,KAAAkL,SACAlL,KAAAgyE,YACA9mE,EAAA7P,QAAA02E,EAAAtlE,MACA,OAAAslE,EAAAtlE,MAKA/W,QAAAoN,GACA,IAAAmvE,EAAA,EAAAhtE,EAAAmsE,EAAAtuE,GACA,IAAA9C,KAAAgyE,SACA,QAAAz3E,EAAA,EAA2BA,EAAA0K,EAAW1K,IACtC03E,GAAAjyE,KAAAkL,OAAA,EAAA3Q,EAAA,GAAAyF,KAAAkL,OAAA,EAAA3Q,EAAA,GACA,OAAAyF,KAAAkL,OAAA,EAAAjG,GAAAgtE,EAlFA,SAAAnvE,GAA+B,OAAAA,KAAAkuE,IAAAC,EAkF/BiB,CAAApvE,GAEApN,UAAAiO,EAAAwuE,EAAA,GAA+B,OAAAnyE,KAAAoyE,KAAAzuE,EAAAwuE,GAAA,GAC/Bz8E,IAAAiO,EAAAwuE,EAAA,GAAyB,OAAAnyE,KAAAoyE,KAAAzuE,EAAAwuE,GAAA,GAIzBz8E,KAAAiO,EAAAwuE,EAAAE,GACA,IAAAJ,EAAA,EAAAK,EAAAtyE,KAAAgyE,SAAA,IAAAO,EAAAvyE,KAAAgyE,SAAA,IACA,QAAAz3E,EAAA,EAAuBA,EAAAyF,KAAAkL,OAAA7P,OAAwBd,GAAA,GAC/C,IAAAmH,EAAA1B,KAAAkL,OAAA3Q,IAAAyF,KAAAgyE,SAAAC,EAAA,GACA,GAAAvwE,EAAAiC,EACA,MACA,IAAA6uE,EAAAxyE,KAAAkL,OAAA3Q,EAAA+3E,GAAAG,EAAAzyE,KAAAkL,OAAA3Q,EAAAg4E,GAAAjoE,EAAA5I,EAAA8wE,EACA,GAAA7uE,GAAA2G,EAAA,CACA,IACAlP,EAAAsG,EAAAuwE,IADAO,EAAA7uE,GAAAjC,GAAA,EAAAiC,GAAA2G,EAAA,EAAA6nE,KACA,IAAAM,GACA,GAAAJ,EACA,OAAAj3E,EACA,IAAAu2E,EAAAhuE,IAAAwuE,EAAA,EAAAzwE,EAAA4I,GAAA,KAAA6mE,EAAA52E,EAAA,EAAAoJ,EAAAjC,GACA2wC,EAAA1uC,GAAAjC,EAAA4vE,EAAA3tE,GAAA2G,EAAA+mE,EAAAE,EAGA,OAFAY,EAAA,EAAAxuE,GAAAjC,EAAAiC,GAAA2G,KACA+nC,GAAAm/B,GACA,IAAAC,EAAAr2E,EAAAi3C,EAAAs/B,GAEAM,GAAAQ,EAAAD,EAEA,OAAAH,EAAA1uE,EAAAsuE,EAAA,IAAAR,EAAA9tE,EAAAsuE,EAAA,QAKAv8E,QAAAiO,EAAAguE,GACA,IAAAM,EAAA,EAAAhtE,EAAAmsE,EAAAO,GACAW,EAAAtyE,KAAAgyE,SAAA,IAAAO,EAAAvyE,KAAAgyE,SAAA,IACA,QAAAz3E,EAAA,EAAuBA,EAAAyF,KAAAkL,OAAA7P,OAAwBd,GAAA,GAC/C,IAAAmH,EAAA1B,KAAAkL,OAAA3Q,IAAAyF,KAAAgyE,SAAAC,EAAA,GACA,GAAAvwE,EAAAiC,EACA,MACA,IAAA6uE,EAAAxyE,KAAAkL,OAAA3Q,EAAA+3E,GACA,GAAA3uE,GADAjC,EAAA8wE,GACAj4E,GAAA,EAAA0K,EACA,SACAgtE,GAAAjyE,KAAAkL,OAAA3Q,EAAAg4E,GAAAC,EAEA,SAMA98E,QAAAsX,GACA,IAAAslE,EAAAtyE,KAAAgyE,SAAA,IAAAO,EAAAvyE,KAAAgyE,SAAA,IACA,QAAAz3E,EAAA,EAAA03E,EAAA,EAAiC13E,EAAAyF,KAAAkL,OAAA7P,OAAwBd,GAAA,GACzD,IAAAmH,EAAA1B,KAAAkL,OAAA3Q,GAAAiiE,EAAA96D,GAAA1B,KAAAgyE,SAAAC,EAAA,GAAAvV,EAAAh7D,GAAA1B,KAAAgyE,SAAA,EAAAC,GACAO,EAAAxyE,KAAAkL,OAAA3Q,EAAA+3E,GAAAG,EAAAzyE,KAAAkL,OAAA3Q,EAAAg4E,GACAvlE,EAAAwvD,IAAAgW,EAAA9V,IAAA+V,GACAR,GAAAQ,EAAAD,GAOA98E,SACA,WAAAq8E,EAAA/xE,KAAAkL,QAAAlL,KAAAgyE,UAKAt8E,WACA,OAAAsK,KAAAgyE,SAAA,QAAApxD,KAAAC,UAAA7gB,KAAAkL,QAOAxV,cAAA6Q,GACA,UAAAA,EAAAwrE,EAAAtlE,MAAA,IAAAslE,EAAAxrE,EAAA,MAAAA,EAAA,QAAAA,KAMAwrE,EAAAtlE,MAAA,IAAAslE,YASAzB,EAIA56E,YAIA0d,KAIAs/D,EAKAvnE,EAAA,EAIA2B,EAAAsG,EAAA/X,QACA2E,KAAAoT,OACApT,KAAA0yE,SACA1yE,KAAAmL,OACAnL,KAAA8M,KAKApX,MAAAyV,EAAA,EAAA2B,EAAA9M,KAAAoT,KAAA/X,QACA,WAAAi1E,EAAAtwE,KAAAoT,KAAApT,KAAA0yE,OAAAvnE,EAAA2B,GAKApX,OACA,WAAA46E,EAAAtwE,KAAAoT,KAAA5L,QAAAxH,KAAA0yE,QAAA1yE,KAAA0yE,OAAAlrE,QAAAxH,KAAAmL,KAAAnL,KAAA8M,IAOApX,UAAA0G,EAAAu2E,GACA3yE,KAAA8M,GAAA9M,KAAAoT,KAAAnR,KAAA7F,GACA,MAAAu2E,GACA3yE,KAAA4yE,UAAA5yE,KAAAoT,KAAA/X,OAAA,EAAAs3E,GAMAj9E,cAAA+V,GACA,QAAAlR,EAAA,EAAAs4E,EAAA7yE,KAAAoT,KAAA/X,OAAqDd,EAAAkR,EAAA2H,KAAA/X,OAAyBd,IAAA,CAC9E,IAAAu4E,EAAArnE,EAAA0J,UAAA5a,GACAyF,KAAA8T,UAAArI,EAAA2H,KAAA7Y,GAAA,MAAAu4E,KAAAv4E,EAAAs4E,EAAAC,OAAAj/D,IAQAne,UAAA6Q,GACA,GAAAvG,KAAA0yE,OACA,QAAAn4E,EAAA,EAA2BA,EAAAyF,KAAA0yE,OAAAr3E,OAAwBd,IACnD,GAAAyF,KAAA0yE,OAAAn4E,IAAAgM,EACA,OAAAvG,KAAA0yE,OAAAn4E,KAAA,SAKA7E,UAAA6Q,EAAAud,GACA9jB,KAAA0yE,SACA1yE,KAAA0yE,WACA1yE,KAAA0yE,OAAAzwE,KAAAsE,EAAAud,GAKApuB,sBAAA+V,GACA,QAAAlR,EAAAkR,EAAA2H,KAAA/X,OAAA,EAAA03E,EAAA/yE,KAAAoT,KAAA/X,OAAAoQ,EAAA2H,KAAA/X,OAAiGd,GAAA,EAAQA,IAAA,CACzG,IAAAu4E,EAAArnE,EAAA0J,UAAA5a,GACAyF,KAAA8T,UAAArI,EAAA2H,KAAA7Y,GAAA6Z,SAAA,MAAA0+D,KAAAv4E,EAAAw4E,EAAAD,EAAA,OAAAj/D,IAMAne,SACA,IAAAs9E,EAAA,IAAA1C,EAEA,OADA0C,EAAAC,sBAAAjzE,MACAgzE,EAKAt9E,IAAAiO,EAAAwuE,EAAA,GACA,GAAAnyE,KAAA0yE,OACA,OAAA1yE,KAAAoyE,KAAAzuE,EAAAwuE,GAAA,GACA,QAAA53E,EAAAyF,KAAAmL,KAA+B5Q,EAAAyF,KAAA8M,GAAavS,IAC5CoJ,EAAA3D,KAAAoT,KAAA7Y,GAAA6B,IAAAuH,EAAAwuE,GACA,OAAAxuE,EAMAjO,UAAAiO,EAAAwuE,EAAA,GAA+B,OAAAnyE,KAAAoyE,KAAAzuE,EAAAwuE,GAAA,GAI/Bz8E,KAAAiO,EAAAwuE,EAAAE,GACA,IAAAX,EAAA,EACA,QAAAn3E,EAAAyF,KAAAmL,KAA+B5Q,EAAAyF,KAAA8M,GAAavS,IAAA,CAC5C,IAAAa,EAAA4E,KAAAoT,KAAA7Y,GAAA89C,UAAA10C,EAAAwuE,GACA,SAAA/2E,EAAAu2E,QAAA,CACA,IAAAuB,EAAAlzE,KAAAmV,UAAA5a,GACA,SAAA24E,KAAA34E,GAAA24E,EAAAlzE,KAAA8M,GAAA,CACAvS,EAAA24E,EACAvvE,EAAA3D,KAAAoT,KAAA8/D,GAAAvB,QAAAv2E,EAAAu2E,SACA,UAGAD,GAAAt2E,EAAAs2E,QACA/tE,EAAAvI,EAAAuI,IAEA,OAAA0uE,EAAA1uE,EAAA,IAAA8tE,EAAA9tE,EAAA+tE,EAAA,OAIA,MAAAyB,EAAA72E,OAAAC,OAAA,YAYAk0E,EAMA/6E,SAAc,OAAAq8E,EAAAtlE,MAMd/W,MAAAkY,GAAkB,YAKlBlY,gBAAA8S,EAAAuF,GACA,IAAAA,MAAAqlE,SACA,UAAAvvE,WAAA,mCACA,IAAAzE,EAAA+zE,EAAAplE,EAAAqlE,UACA,IAAAh0E,EACA,UAAAyE,2BAAiDkK,EAAAqlE,oBACjD,OAAAh0E,EAAA84B,SAAA1vB,EAAAuF,GAQArY,cAAAmiD,EAAAw7B,GACA,GAAAx7B,KAAAs7B,EACA,UAAAtvE,WAAA,iCAAAg0C,GAGA,OAFAs7B,EAAAt7B,GAAAw7B,EACAA,EAAA90E,UAAA6P,OAAAypC,EACAw7B,SAOAC,EAIA59E,YAIAmU,EAIA0pE,GACAvzE,KAAA6J,MACA7J,KAAAuzE,SAKA79E,UAAAmU,GAAoB,WAAAypE,EAAAzpE,EAAA,MAIpBnU,YAAA6J,GAA0B,WAAA+zE,EAAA,KAAA/zE,GAM1B7J,mBAAAmU,EAAAsB,EAAA2B,EAAAtF,GACA,IACA,OAAA8rE,EAAA3uC,GAAA96B,EAAA+C,QAAAzB,EAAA2B,EAAAtF,IAEA,MAAA1I,GACA,GAAAA,aAA6Bk4C,EAAA,EAC7B,OAAAs8B,EAAAE,KAAA10E,EAAAS,SACA,MAAAT,IAKA,SAAA20E,EAAAlnE,EAAAS,EAAA9C,GACA,IAAAkyD,KACA,QAAA7hE,EAAA,EAAmBA,EAAAgS,EAAA7G,WAAyBnL,IAAA,CAC5C,IAAA6K,EAAAmH,EAAAnH,MAAA7K,GACA6K,EAAAgG,QAAAC,OACAjG,IAAA/I,KAAAo3E,EAAAruE,EAAAgG,QAAA4B,EAAA5H,KACAA,EAAAk3B,WACAl3B,EAAA4H,EAAA5H,EAAA8E,EAAA3P,IACA6hE,EAAAn6D,KAAAmD,GAEA,OAAW4xC,EAAA,EAAQ5e,UAAAgkC,SAKnBsX,UAAAjD,EAIA/6E,YAIAyV,EAIA2B,EAIA8wB,GACAtyB,QACAtL,KAAAmL,OACAnL,KAAA8M,KACA9M,KAAA49B,OAEAloC,MAAAmU,GACA,IAAA8pE,EAAA9pE,EAAArC,MAAAxH,KAAAmL,KAAAnL,KAAA8M,IAAAvB,EAAA1B,EAAAb,QAAAhJ,KAAAmL,MACAjB,EAAAqB,EAAAvE,KAAAuE,EAAAgxB,YAAAv8B,KAAA8M,KACAtF,EAAA,IAAwBwvC,EAAA,EAAKy8B,EAAAE,EAAAvoE,QAAA,CAAApE,EAAAkD,IAC7BlD,EAAAw2B,QAAAtzB,EAAA9K,KAAAokC,eAAAxjC,KAAA49B,KAAAx+B,MAEA4H,EAAA42B,KAAA59B,KAAA49B,KAAAlF,SAAA1xB,EAAA2S,QADA3S,EAESkD,GAAAypE,EAAAt6C,UAAAs6C,EAAAr6C,SACT,OAAAg6C,EAAAM,YAAA/pE,EAAA7J,KAAAmL,KAAAnL,KAAA8M,GAAAtF,GAEA9R,SACA,WAAAm+E,EAAA7zE,KAAAmL,KAAAnL,KAAA8M,GAAA9M,KAAA49B,MAEAloC,IAAA+V,GACA,IAAAN,EAAAM,EAAA4sC,UAAAr4C,KAAAmL,KAAA,GAAA2B,EAAArB,EAAA4sC,UAAAr4C,KAAA8M,IAAA,GACA,OAAA3B,EAAAitC,SAAAtrC,EAAAsrC,SAAAjtC,EAAAxH,KAAAmJ,EAAAnJ,IACA,KACA,IAAA+vE,EAAAvoE,EAAAxH,IAAAmJ,EAAAnJ,IAAA3D,KAAA49B,MAEAloC,MAAAkY,GACA,OAAAA,aAAA8lE,GACA9lE,EAAAgwB,KAAAruB,GAAAvP,KAAA49B,OACA59B,KAAAmL,MAAAyC,EAAAd,IAAA9M,KAAA8M,IAAAc,EAAAzC,KACA,IAAAuoE,EAAA/uE,KAAAC,IAAA5E,KAAAmL,KAAAyC,EAAAzC,MAAAxG,KAAAE,IAAA7E,KAAA8M,GAAAc,EAAAd,IAAA9M,KAAA49B,MACA,KAEAloC,SACA,OAAgB09E,SAAA,UAAAx1C,KAAA59B,KAAA49B,KAAA3F,SAChB9sB,KAAAnL,KAAAmL,KAAA2B,GAAA9M,KAAA8M,IAKApX,gBAAA8S,EAAAuF,GACA,oBAAAA,EAAA5C,MAAA,iBAAA4C,EAAAjB,GACA,UAAAjJ,WAAA,0CACA,WAAA6vE,EAAA3lE,EAAA5C,KAAA4C,EAAAjB,GAAAtE,EAAAu2B,aAAAhxB,EAAA6vB,QAGA6yC,EAAAriE,OAAA,UAAAslE,SAIAG,UAAApD,EAIA/6E,YAIAyV,EAIA2B,EAIA8wB,GACAtyB,QACAtL,KAAAmL,OACAnL,KAAA8M,KACA9M,KAAA49B,OAEAloC,MAAAmU,GACA,IAAA8pE,EAAA9pE,EAAArC,MAAAxH,KAAAmL,KAAAnL,KAAA8M,IACAtF,EAAA,IAAwBwvC,EAAA,EAAKy8B,EAAAE,EAAAvoE,QAAApE,GAC7BA,EAAA42B,KAAA59B,KAAA49B,KAAA9E,cAAA9xB,EAAA2S,QACS9P,GAAA8pE,EAAAt6C,UAAAs6C,EAAAr6C,SACT,OAAAg6C,EAAAM,YAAA/pE,EAAA7J,KAAAmL,KAAAnL,KAAA8M,GAAAtF,GAEA9R,SACA,WAAAg+E,EAAA1zE,KAAAmL,KAAAnL,KAAA8M,GAAA9M,KAAA49B,MAEAloC,IAAA+V,GACA,IAAAN,EAAAM,EAAA4sC,UAAAr4C,KAAAmL,KAAA,GAAA2B,EAAArB,EAAA4sC,UAAAr4C,KAAA8M,IAAA,GACA,OAAA3B,EAAAitC,SAAAtrC,EAAAsrC,SAAAjtC,EAAAxH,KAAAmJ,EAAAnJ,IACA,KACA,IAAAkwE,EAAA1oE,EAAAxH,IAAAmJ,EAAAnJ,IAAA3D,KAAA49B,MAEAloC,MAAAkY,GACA,OAAAA,aAAAimE,GACAjmE,EAAAgwB,KAAAruB,GAAAvP,KAAA49B,OACA59B,KAAAmL,MAAAyC,EAAAd,IAAA9M,KAAA8M,IAAAc,EAAAzC,KACA,IAAA0oE,EAAAlvE,KAAAC,IAAA5E,KAAAmL,KAAAyC,EAAAzC,MAAAxG,KAAAE,IAAA7E,KAAA8M,GAAAc,EAAAd,IAAA9M,KAAA49B,MACA,KAEAloC,SACA,OAAgB09E,SAAA,aAAAx1C,KAAA59B,KAAA49B,KAAA3F,SAChB9sB,KAAAnL,KAAAmL,KAAA2B,GAAA9M,KAAA8M,IAKApX,gBAAA8S,EAAAuF,GACA,oBAAAA,EAAA5C,MAAA,iBAAA4C,EAAAjB,GACA,UAAAjJ,WAAA,6CACA,WAAAgwE,EAAA9lE,EAAA5C,KAAA4C,EAAAjB,GAAAtE,EAAAu2B,aAAAhxB,EAAA6vB,QAGA6yC,EAAAriE,OAAA,aAAAylE,SAKArD,UAAAC,EAUA/6E,YAIAyV,EAIA2B,EAIAtF,EAIAimC,GAAA,GACAniC,QACAtL,KAAAmL,OACAnL,KAAA8M,KACA9M,KAAAwH,QACAxH,KAAAytC,YAEA/3C,MAAAmU,GACA,OAAA7J,KAAAytC,WAAAqmC,EAAAjqE,EAAA7J,KAAAmL,KAAAnL,KAAA8M,IACAwmE,EAAAE,KAAA,6CACAF,EAAAM,YAAA/pE,EAAA7J,KAAAmL,KAAAnL,KAAA8M,GAAA9M,KAAAwH,OAEA9R,SACA,WAAAq8E,GAAA/xE,KAAAmL,KAAAnL,KAAA8M,GAAA9M,KAAAmL,KAAAnL,KAAAwH,MAAA6D,OAEA3V,OAAAmU,GACA,WAAA2mE,EAAAxwE,KAAAmL,KAAAnL,KAAAmL,KAAAnL,KAAAwH,MAAA6D,KAAAxB,EAAArC,MAAAxH,KAAAmL,KAAAnL,KAAA8M,KAEApX,IAAA+V,GACA,IAAAN,EAAAM,EAAA4sC,UAAAr4C,KAAAmL,KAAA,GAAA2B,EAAArB,EAAA4sC,UAAAr4C,KAAA8M,IAAA,GACA,OAAA3B,EAAA2mE,eAAAhlE,EAAAglE,cACA,KACA,IAAAtB,EAAArlE,EAAAxH,IAAAgB,KAAAE,IAAAsG,EAAAxH,IAAAmJ,EAAAnJ,KAAA3D,KAAAwH,OAEA9R,MAAAkY,GACA,KAAAA,aAAA4iE,IAAA5iE,EAAA6/B,WAAAztC,KAAAytC,UACA,YACA,GAAAztC,KAAAmL,KAAAnL,KAAAwH,MAAA6D,MAAAuC,EAAAzC,MAAAnL,KAAAwH,MAAA8xB,SAAA1rB,EAAApG,MAAA6xB,UAKA,IAAAzrB,EAAAd,IAAA9M,KAAAmL,MAAAnL,KAAAwH,MAAA6xB,WAAAzrB,EAAApG,MAAA8xB,QAMA,YANA,CACA,IAAA9xB,EAAAxH,KAAAwH,MAAA6D,KAAAuC,EAAApG,MAAA6D,MAAA,EAAkE2rC,EAAA,EAAKvqC,MACvE,IAAsBuqC,EAAA,EAAKppC,EAAApG,MAAA4D,QAAAkG,OAAAtR,KAAAwH,MAAA4D,SAAAwC,EAAApG,MAAA6xB,UAAAr5B,KAAAwH,MAAA8xB,SAC3B,WAAAk3C,EAAA5iE,EAAAzC,KAAAnL,KAAA8M,GAAAtF,EAAAxH,KAAAytC,YARA,CACA,IAAAjmC,EAAAxH,KAAAwH,MAAA6D,KAAAuC,EAAApG,MAAA6D,MAAA,EAAkE2rC,EAAA,EAAKvqC,MACvE,IAAsBuqC,EAAA,EAAKh3C,KAAAwH,MAAA4D,QAAAkG,OAAA1D,EAAApG,MAAA4D,SAAApL,KAAAwH,MAAA6xB,UAAAzrB,EAAApG,MAAA8xB,SAC3B,WAAAk3C,EAAAxwE,KAAAmL,KAAAnL,KAAA8M,IAAAc,EAAAd,GAAAc,EAAAzC,MAAA3D,EAAAxH,KAAAytC,YAWA/3C,SACA,IAAAqY,GAAoBqlE,SAAA,UAAAjoE,KAAAnL,KAAAmL,KAAA2B,GAAA9M,KAAA8M,IAKpB,OAJA9M,KAAAwH,MAAA6D,OACA0C,EAAAvG,MAAAxH,KAAAwH,MAAAywB,UACAj4B,KAAAytC,YACA1/B,EAAA0/B,WAAA,GACA1/B,EAKArY,gBAAA8S,EAAAuF,GACA,oBAAAA,EAAA5C,MAAA,iBAAA4C,EAAAjB,GACA,UAAAjJ,WAAA,0CACA,WAAA2sE,EAAAziE,EAAA5C,KAAA4C,EAAAjB,GAAmDkqC,EAAA,EAAK9e,SAAA1vB,EAAAuF,EAAAvG,SAAAuG,EAAA0/B,YAGxDgjC,EAAAriE,OAAA,UAAAoiE,SAMAD,UAAAE,EAOA/6E,YAIAyV,EAIA2B,EAIAinE,EAIAC,EAIAxsE,EAKA2zB,EAIAsS,GAAA,GACAniC,QACAtL,KAAAmL,OACAnL,KAAA8M,KACA9M,KAAA+zE,UACA/zE,KAAAg0E,QACAh0E,KAAAwH,QACAxH,KAAAm7B,SACAn7B,KAAAytC,YAEA/3C,MAAAmU,GACA,GAAA7J,KAAAytC,YAAAqmC,EAAAjqE,EAAA7J,KAAAmL,KAAAnL,KAAA+zE,UACAD,EAAAjqE,EAAA7J,KAAAg0E,MAAAh0E,KAAA8M,KACA,OAAAwmE,EAAAE,KAAA,iDACA,IAAAS,EAAApqE,EAAArC,MAAAxH,KAAA+zE,QAAA/zE,KAAAg0E,OACA,GAAAC,EAAA56C,WAAA46C,EAAA36C,QACA,OAAAg6C,EAAAE,KAAA,2BACA,IAAAU,EAAAl0E,KAAAwH,MAAAyzB,SAAAj7B,KAAAm7B,OAAA84C,EAAA7oE,SACA,OAAA8oE,EAEAZ,EAAAM,YAAA/pE,EAAA7J,KAAAmL,KAAAnL,KAAA8M,GAAAonE,GADAZ,EAAAE,KAAA,+BAGA99E,SACA,WAAAq8E,GAAA/xE,KAAAmL,KAAAnL,KAAA+zE,QAAA/zE,KAAAmL,KAAAnL,KAAAm7B,OACAn7B,KAAAg0E,MAAAh0E,KAAA8M,GAAA9M,KAAAg0E,MAAAh0E,KAAAwH,MAAA6D,KAAArL,KAAAm7B,SAEAzlC,OAAAmU,GACA,IAAAoqE,EAAAj0E,KAAAg0E,MAAAh0E,KAAA+zE,QACA,WAAAxD,EAAAvwE,KAAAmL,KAAAnL,KAAAmL,KAAAnL,KAAAwH,MAAA6D,KAAA4oE,EAAAj0E,KAAAmL,KAAAnL,KAAAm7B,OAAAn7B,KAAAmL,KAAAnL,KAAAm7B,OAAA84C,EAAApqE,EAAArC,MAAAxH,KAAAmL,KAAAnL,KAAA8M,IAAAuuB,cAAAr7B,KAAA+zE,QAAA/zE,KAAAmL,KAAAnL,KAAAg0E,MAAAh0E,KAAAmL,MAAAnL,KAAA+zE,QAAA/zE,KAAAmL,KAAAnL,KAAAytC,WAEA/3C,IAAA+V,GACA,IAAAN,EAAAM,EAAA4sC,UAAAr4C,KAAAmL,KAAA,GAAA2B,EAAArB,EAAA4sC,UAAAr4C,KAAA8M,IAAA,GACAinE,EAAAtoE,EAAArP,IAAA4D,KAAA+zE,SAAA,GAAAC,EAAAvoE,EAAArP,IAAA4D,KAAAg0E,MAAA,GACA,OAAA7oE,EAAA2mE,eAAAhlE,EAAAglE,eAAAiC,EAAA5oE,EAAAxH,KAAAqwE,EAAAlnE,EAAAnJ,IACA,KACA,IAAA4sE,EAAAplE,EAAAxH,IAAAmJ,EAAAnJ,IAAAowE,EAAAC,EAAAh0E,KAAAwH,MAAAxH,KAAAm7B,OAAAn7B,KAAAytC,WAEA/3C,SACA,IAAAqY,GAAoBqlE,SAAA,gBAAAjoE,KAAAnL,KAAAmL,KAAA2B,GAAA9M,KAAA8M,GACpBinE,QAAA/zE,KAAA+zE,QAAAC,MAAAh0E,KAAAg0E,MAAA74C,OAAAn7B,KAAAm7B,QAKA,OAJAn7B,KAAAwH,MAAA6D,OACA0C,EAAAvG,MAAAxH,KAAAwH,MAAAywB,UACAj4B,KAAAytC,YACA1/B,EAAA0/B,WAAA,GACA1/B,EAKArY,gBAAA8S,EAAAuF,GACA,oBAAAA,EAAA5C,MAAA,iBAAA4C,EAAAjB,IACA,iBAAAiB,EAAAgmE,SAAA,iBAAAhmE,EAAAimE,OAAA,iBAAAjmE,EAAAotB,OACA,UAAAt3B,WAAA,gDACA,WAAA0sE,EAAAxiE,EAAA5C,KAAA4C,EAAAjB,GAAAiB,EAAAgmE,QAAAhmE,EAAAimE,MAAmFh9B,EAAA,EAAK9e,SAAA1vB,EAAAuF,EAAAvG,OAAAuG,EAAAotB,SAAAptB,EAAA0/B,YAIxF,SAAAqmC,EAAAjqE,EAAAsB,EAAA2B,GACA,IAAAvB,EAAA1B,EAAAb,QAAAmC,GAAAnP,EAAA8Q,EAAA3B,EAAArK,EAAAyK,EAAAzK,MACA,KAAA9E,EAAA,GAAA8E,EAAA,GAAAyK,EAAAyE,WAAAlP,IAAAyK,EAAAvE,KAAAlG,GAAA4E,YACA5E,IACA9E,IAEA,GAAAA,EAAA,GACA,IAAAuE,EAAAgL,EAAAvE,KAAAlG,GAAAo2B,WAAA3rB,EAAAyE,WAAAlP,IACA,KAAA9E,EAAA,IACA,IAAAuE,KAAAm2B,OACA,SACAn2B,IAAAqJ,WACA5N,KAGA,SAiGA,SAAAm4E,EAAAntE,EAAAtF,EAAA4I,GACA,UAAA5I,GAAAsF,EAAAo0B,WAAA15B,EAAAsF,EAAAtB,eACA4E,GAAAtD,EAAAtB,YAAAsB,EAAAo0B,WAAA,EAAA9wB,IAOA,SAAAwmE,EAAA/yD,GACA,IACA3S,EADA2S,EAAA7T,OACAkB,QAAA4rB,WAAAjZ,EAAA8c,WAAA9c,EAAA+c,UACA,QAAAh6B,EAAAid,EAAAjd,SAAkCA,EAAA,CAClC,IAAAkG,EAAA+W,EAAAxS,MAAAvE,KAAAlG,GACAmE,EAAA8Y,EAAAxS,MAAAtG,MAAAnE,GAAAg6B,EAAA/c,EAAAvS,IAAAwE,WAAAlP,GACA,GAAAA,EAAAid,EAAAjd,OAAAkG,EAAAo0B,WAAAn2B,EAAA61B,EAAA1vB,GACA,OAAAtK,EACA,MAAAA,GAAAkG,EAAA5H,KAAAmG,KAAAq2B,YAAAu4C,EAAAntE,EAAA/B,EAAA61B,GACA,MAEA,YAoCA,SAAA6G,EAAA5jB,EAAAqO,EAAAtmB,EAAA,KAAAsuE,EAAAr2D,GACA,IAAAs2D,EAQA,SAAAt2D,EAAA3e,GACA,IAAA8K,OAASA,EAAA2wB,aAAAC,YAA+B/c,EACxCs2D,EAAAnqE,EAAAi0B,eAAAtD,GAAA8G,aAAAviC,GACA,IAAAi1E,EACA,YACA,IAAA5mB,EAAA4mB,EAAAh5E,OAAAg5E,EAAA,GAAAj1E,EACA,OAAA8K,EAAAy0B,eAAA9D,EAAAC,EAAA2yB,GAAA4mB,EAAA,KAdAC,CAAAv2D,EAAAqO,GACAzZ,EAAA0hE,GAeA,SAAAt2D,EAAA3e,GACA,IAAA8K,OAASA,EAAA2wB,aAAAC,YAA+B/c,EACxCpL,EAAAzI,EAAA9E,MAAAy1B,GACAwnB,EAAAjjD,EAAAg/B,aAAAuD,aAAAhvB,EAAAvT,MACA,IAAAijD,EACA,YACA,IACAkyB,GADAlyB,EAAAhnD,OAAAgnD,IAAAhnD,OAAA,GAAA+D,GACAg/B,aACA,QAAA7jC,EAAAsgC,EAA4B05C,GAAAh6E,EAAAugC,EAA4BvgC,IACxDg6E,IAAA31C,UAAA10B,EAAA9E,MAAA7K,GAAA6E,MACA,OAAAm1E,KAAA91C,SAEA4jB,EADA,KA1BAmyB,CAAAJ,EAAAhoD,GACA,OAAAzZ,EAEA0hE,EAAAj4E,IAAAq4E,GACAjiE,QAAiBpT,KAAAgtB,EAAAtmB,UAAwB0M,OAAAG,EAAAvW,IAAAq4E,IAFzC,KAIA,SAAAA,EAAAr1E,GAA0B,OAASA,OAAA0G,MAAA,MA2EnC,SAAAgoE,EAAAjkE,EAAAlG,EAAA7C,EAAA,EAAA4sE,GACA,IAAA5kE,EAAAe,EAAAb,QAAArF,GAAA7N,EAAAgT,EAAAhI,QACA6sE,EAAAD,OAAAryE,OAAA,IAAAyN,EAAAoB,OACA,GAAApU,EAAA,GAAAgT,EAAAoB,OAAA9K,KAAAmG,KAAAq2B,YACA9yB,EAAAoB,OAAAkxB,WAAAtyB,EAAA7D,QAAA6D,EAAAoB,OAAAxE,cACAioE,EAAAvuE,KAAA47B,aAAAlyB,EAAAoB,OAAAkB,QAAA4rB,WAAAluB,EAAA7D,QAAA6D,EAAAoB,OAAAxE,aACA,SACA,QAAAqD,EAAAD,EAAAhI,MAAA,EAAAvG,EAAAuG,EAAA,EAA+CiI,EAAAjT,EAAUiT,IAAAxO,IAAA,CACzD,IAAAyM,EAAA8B,EAAA9B,KAAA+B,GAAA9D,EAAA6D,EAAA7D,MAAA8D,GACA,GAAA/B,EAAA5H,KAAAmG,KAAAq2B,UACA,SACA,IAAAgyC,EAAA5mE,EAAAoE,QAAA4rB,WAAA/xB,EAAA+B,EAAAtB,YACAgE,EAAAgkE,KAAAnzE,IAAAyM,EAGA,GAFA0C,GAAA1C,IACA4mE,IAAA32C,aAAA,EAAAvtB,EAAAtK,KAAA7C,OAAAmN,EAAA5D,UACAkB,EAAAo0B,WAAAn2B,EAAA,EAAA+B,EAAAtB,cAAAgE,EAAAtK,KAAA47B,aAAA4yC,GACA,SAEA,IAAA3oE,EAAA6D,EAAAkH,WAAAla,GACA+3E,EAAAH,KAAA,GACA,OAAA5kE,EAAA9B,KAAAlR,GAAA6oC,eAAA15B,IAAA4oE,IAAAzuE,KAAA0J,EAAA9B,KAAAlR,EAAA,GAAAsJ,MAeA,SAAAuxE,EAAA9mE,EAAAlG,GACA,IAAAmF,EAAAe,EAAAb,QAAArF,GAAAsB,EAAA6D,EAAA7D,QACA,OAAAi1B,EAAApxB,EAAAgB,WAAAhB,EAAAa,YACAb,EAAAoB,OAAAkxB,WAAAn2B,IAAA,GAEA,SAAAi1B,EAAAj2B,EAAAC,GACA,SAAAD,IAAAC,GAAAD,EAAAyyB,SAAAzyB,EAAA46B,UAAA36B,IAOA,SAAA2sE,EAAAhnE,EAAAlG,EAAAI,GAAA,GACA,IAAA+E,EAAAe,EAAAb,QAAArF,GACA,QAAAoF,EAAAD,EAAAhI,OAA6BiI,IAAA,CAC7B,IAAAE,EAAAS,EAAAzE,EAAA6D,EAAA7D,MAAA8D,GAcA,GAbAA,GAAAD,EAAAhI,OACAmI,EAAAH,EAAAgB,WACAJ,EAAAZ,EAAAa,WAEA5F,EAAA,GACAkF,EAAAH,EAAA9B,KAAA+B,EAAA,GACA9D,IACAyE,EAAAZ,EAAA9B,KAAA+B,GAAAmuB,WAAAjyB,KAGAgE,EAAAH,EAAA9B,KAAA+B,GAAAmuB,WAAAjyB,EAAA,GACAyE,EAAAZ,EAAA9B,KAAA+B,EAAA,IAEAE,MAAAs0B,aAAArD,EAAAjxB,EAAAS,IACAZ,EAAA9B,KAAA+B,GAAAqyB,WAAAn2B,IAAA,GACA,OAAAtB,EACA,MAAAoF,EACA,MACApF,EAAAI,EAAA,EAAA+E,EAAAG,OAAAF,GAAAD,EAAAY,MAAAX,IAyCA,SAAA6nE,EAAA/mE,EAAAlG,EAAA6D,GACA,IAAAsB,EAAAe,EAAAb,QAAArF,GACA,IAAA6D,EAAA4D,QAAAC,KACA,OAAA1H,EACA,IAAAyH,EAAA5D,EAAA4D,QACA,QAAA7Q,EAAA,EAAmBA,EAAAiN,EAAA6xB,UAAqB9+B,IACxC6Q,IAAAxB,WAAAwB,QACA,QAAAspE,EAAA,EAAsBA,IAAA,GAAAltE,EAAA6xB,WAAA7xB,EAAA6D,KAAA,KAAsDqpE,IAC5E,QAAA3rE,EAAAD,EAAAhI,MAAgCiI,GAAA,EAAQA,IAAA,CACxC,IAAA4uC,EAAA5uC,GAAAD,EAAAhI,MAAA,EAAAgI,EAAAnF,MAAAmF,EAAApH,MAAAqH,EAAA,GAAAD,EAAAwB,IAAAvB,EAAA,WACAgyD,EAAAjyD,EAAA7D,MAAA8D,IAAA4uC,EAAA,OACAztC,EAAApB,EAAA9B,KAAA+B,GAAA4rE,GAAA,EACA,MAAAD,EACAC,EAAAzqE,EAAAkxB,WAAA2/B,IAAA3vD,OAEA,CACA,IAAAimC,EAAAnnC,EAAAi0B,eAAA48B,GAAAp5B,aAAAv2B,EAAAxB,WAAAxK,MACAu1E,EAAAtjC,GAAAnnC,EAAAy0B,eAAAo8B,IAAA1pB,EAAA,IAEA,GAAAsjC,EACA,UAAAh9B,EAAA7uC,EAAAnF,IAAAg0C,EAAA,EAAA7uC,EAAAG,OAAAF,EAAA,GAAAD,EAAAY,MAAAX,EAAA,GAGA,YASA,SAAAgoE,EAAAlnE,EAAAsB,EAAA2B,EAAA3B,EAAA3D,EAAmDwvC,EAAA,EAAKvqC,OACxD,GAAAtB,GAAA2B,IAAAtF,EAAA6D,KACA,YACA,IAAAE,EAAA1B,EAAAb,QAAAmC,GAAAK,EAAA3B,EAAAb,QAAA8D,GAEA,OAAA8nE,EAAArpE,EAAAC,EAAAhE,GACA,IAAAgpE,EAAArlE,EAAA2B,EAAAtF,GACA,IAAAqtE,EAAAtpE,EAAAC,EAAAhE,GAAAstE,MAEA,SAAAF,EAAArpE,EAAAC,EAAAhE,GACA,OAAAA,EAAA6xB,YAAA7xB,EAAA8xB,SAAA/tB,EAAA7J,SAAA8J,EAAA9J,SACA6J,EAAArB,OAAAkxB,WAAA7vB,EAAAtG,QAAAuG,EAAAvG,QAAAuC,EAAA4D,SAtZAqlE,EAAAriE,OAAA,gBAAAmiE,SA4aAsE,EACAn/E,YAAA6V,EAAAC,EAAAupE,GACA/0E,KAAAuL,QACAvL,KAAAwL,MACAxL,KAAA+0E,WACA/0E,KAAAg1E,YACAh1E,KAAA24B,OAAsBqe,EAAA,EAAQvqC,MAC9B,QAAAlS,EAAA,EAAuBA,GAAAgR,EAAAzK,MAAkBvG,IAAA,CACzC,IAAAyM,EAAAuE,EAAAvE,KAAAzM,GACAyF,KAAAg1E,SAAA/yE,MACA7C,KAAA4H,EAAA5H,KACA4b,MAAAhU,EAAAm3B,eAAA5yB,EAAAyE,WAAAzV,MAGA,QAAAA,EAAAgR,EAAAzK,MAAiCvG,EAAA,EAAOA,IACxCyF,KAAA24B,OAA0Bqe,EAAA,EAAQ7rC,KAAAI,EAAAvE,KAAAzM,GAAA8B,KAAA2D,KAAA24B,SAElC73B,YAAiB,OAAAd,KAAAg1E,SAAA35E,OAAA,EACjB3F,MAIA,KAAAsK,KAAA+0E,SAAA1pE,MAAA,CACA,IAAAypE,EAAA90E,KAAAi1E,eACAH,EACA90E,KAAAk1E,WAAAJ,GAEA90E,KAAAm1E,YAAAn1E,KAAAo1E,WAOA,IAAAC,EAAAr1E,KAAAs1E,iBAAAC,EAAAv1E,KAAA24B,OAAAttB,KAAArL,KAAAc,MAAAd,KAAAuL,MAAAzK,MACAyK,EAAAvL,KAAAuL,MAAAC,EAAAxL,KAAA6rB,MAAAwpD,EAAA,EAAAr1E,KAAAwL,IAAAD,EAAA1B,IAAAb,QAAAqsE,IACA,IAAA7pE,EACA,YAEA,IAAAJ,EAAApL,KAAA24B,OAAAU,EAAA9tB,EAAAzK,MAAAw4B,EAAA9tB,EAAA1K,MACA,KAAAu4B,GAAAC,GAAA,GAAAluB,EAAA1F,YACA0F,IAAAxB,WAAAwB,QACAiuB,IACAC,IAEA,IAAA9xB,EAAA,IAAwBwvC,EAAA,EAAK5rC,EAAAiuB,EAAAC,GAC7B,OAAA+7C,GAAA,EACA,IAAA9E,EAAAhlE,EAAA5H,IAAA0xE,EAAAr1E,KAAAwL,IAAA7H,IAAA3D,KAAAwL,IAAAlB,MAAA9C,EAAA+tE,GACA/tE,EAAA6D,MAAAE,EAAA5H,KAAA3D,KAAAwL,IAAA7H,IACA,IAAA6sE,EAAAjlE,EAAA5H,IAAA6H,EAAA7H,IAAA6D,GACA,KAKA9R,eAGA,QAAAg/E,EAAA,EAA0BA,GAAA,EAAWA,IACrC,QAAAc,EAAAx1E,KAAA+0E,SAAA17C,UAA0Dm8C,GAAA,EAAiBA,IAAA,CAC3E,IAAAjpE,EAAArC,EAAA,KAQA0sB,GALArqB,EAFAipE,GACAtrE,EAAAurE,EAAAz1E,KAAA+0E,SAAA3pE,QAAAoqE,EAAA,GAAA5rE,YACAwB,QAGApL,KAAA+0E,SAAA3pE,SAEAxB,WACA,QAAA8rE,EAAA11E,KAAAc,MAAoD40E,GAAA,EAAoBA,IAAA,CACxE,IAAuCjtC,GAAvCrpC,KAAyBA,EAAA4b,SAAchb,KAAAg1E,SAAAU,GAAAC,EAAA,KAIvC,MAAAjB,IAAA99C,EAAA5b,EAAA4jB,UAAAhI,EAAAx3B,QAAAu2E,EAAA36D,EAAAsmB,WAAwG0V,EAAA,EAAQ7rC,KAAAyrB,IAAA,IAChH1sB,GAAA9K,EAAAs7B,kBAAAxwB,EAAA9K,OACA,OAAgCo2E,aAAAE,gBAAAxrE,SAAAyrE,UAGhC,MAAAjB,GAAA99C,IAAA6R,EAAAztB,EAAA2mB,aAAA/K,EAAAx3B,OACA,OAAgCo2E,aAAAE,gBAAAxrE,SAAAu+B,QAGhC,GAAAv+B,GAAA8Q,EAAA4jB,UAAA10B,EAAA9K,MACA,QAKA1J,WACA,IAAA0V,QAAaA,EAAAiuB,YAAAC,WAA8Bt5B,KAAA+0E,SAC3CpiE,EAAA8iE,EAAArqE,EAAAiuB,GACA,SAAA1mB,EAAAjN,YAAAiN,EAAA/I,WAAA8sB,UAEA12B,KAAA+0E,SAAA,IAA4B/9B,EAAA,EAAK5rC,EAAAiuB,EAAA,EAAA10B,KAAAE,IAAAy0B,EAAA3mB,EAAAtH,KAAAguB,GAAAjuB,EAAAC,KAAAiuB,EAAAD,EAAA,OACjC,GAEA3jC,WACA,IAAA0V,QAAaA,EAAAiuB,YAAAC,WAA8Bt5B,KAAA+0E,SAC3CpiE,EAAA8iE,EAAArqE,EAAAiuB,GACA,GAAA1mB,EAAAjN,YAAA,GAAA2zB,EAAA,GACA,IAAAu8C,EAAAxqE,EAAAC,KAAAguB,KAAA1mB,EAAAtH,KACArL,KAAA+0E,SAAA,IAAgC/9B,EAAA,EAAK6+B,EAAAzqE,EAAAiuB,EAAA,KAAAA,EAAA,EAAAu8C,EAAAv8C,EAAA,EAAAC,QAGrCt5B,KAAA+0E,SAAA,IAAgC/9B,EAAA,EAAK6+B,EAAAzqE,EAAAiuB,EAAA,GAAAA,EAAAC,GAMrC5jC,YAAA8/E,WAAgBA,EAAAE,gBAAAxrE,SAAAyrE,SAAAltC,SAChB,KAAAzoC,KAAAc,MAAA40E,GACA11E,KAAA81E,oBACA,GAAArtC,EACA,QAAAluC,EAAA,EAA2BA,EAAAkuC,EAAAptC,OAAiBd,IAC5CyF,KAAA+1E,iBAAAttC,EAAAluC,IACA,IAAAiN,EAAAxH,KAAA+0E,SAAAxoE,EAAArC,IAAAkB,QAAA5D,EAAA4D,QACAiuB,EAAA7xB,EAAA6xB,UAAAm8C,EACAQ,EAAA,EAAAn3D,MACA7D,MAAaA,EAAA5b,QAAcY,KAAAg1E,SAAAU,GAC3B,GAAAC,EAAA,CACA,QAAAp7E,EAAA,EAA2BA,EAAAo7E,EAAAjwE,WAAuBnL,IAClDskB,EAAA5c,KAAA0zE,EAAAvwE,MAAA7K,IACAygB,IAAAqjB,cAAAs3C,GAKA,IAAAM,EAAA1pE,EAAAlB,KAAAmqE,GAAAhuE,EAAA4D,QAAAC,KAAA7D,EAAA8xB,SAGA,KAAA08C,EAAAzpE,EAAA7G,YAAA,CACA,IAAAnF,EAAAgM,EAAAnH,MAAA4wE,GAAAzwC,EAAAvqB,EAAA4jB,UAAAr+B,EAAAnB,MACA,IAAAmmC,EACA,SACAywC,EACA,MAAA38C,GAAA94B,EAAA6K,QAAAC,QACA2P,EAAAuqB,EACA1mB,EAAA5c,KAAAi0E,EAAA31E,EAAAq9B,KAAAx+B,EAAAskC,aAAAnjC,EAAAoZ,QAAA,GAAAq8D,EAAA38C,EAAA,EAAA28C,GAAAzpE,EAAA7G,WAAAuwE,GAAA,KAGA,IAAA10C,EAAAy0C,GAAAzpE,EAAA7G,WACA67B,IACA00C,GAAA,GACAj2E,KAAA24B,OAAAw9C,EAAAn2E,KAAA24B,OAAA+8C,EAAgE1+B,EAAA,EAAQ7rC,KAAA0T,IACxE7e,KAAAg1E,SAAAU,GAAA16D,QAGAumB,GAAA00C,EAAA,GAAA/rE,KAAA9K,MAAAY,KAAAg1E,SAAAh1E,KAAAc,OAAA1B,MAAAY,KAAAg1E,SAAA35E,OAAA,GACA2E,KAAA81E,oBAEA,QAAAv7E,EAAA,EAAAmmC,EAAAn0B,EAAuChS,EAAA07E,EAAkB17E,IAAA,CACzD,IAAAyM,EAAA05B,EAAA32B,UACA/J,KAAAg1E,SAAA/yE,MAAgC7C,KAAA4H,EAAA5H,KAAA4b,MAAAhU,EAAAm3B,eAAAn3B,EAAAtB,cAChCg7B,EAAA15B,EAAAoE,QAKApL,KAAA+0E,SAAAxzC,EACA,GAAAi0C,EAAgCx+B,EAAA,EAAKvqC,MACrC,IAAsBuqC,EAAA,EAAK6+B,EAAAruE,EAAA4D,QAAAoqE,EAAA,KAAAA,EAAA,EAAAS,EAAA,EAAAzuE,EAAA8xB,QAAAk8C,EAAA,GAF3B,IAAqCx+B,EAAA,EAAK6+B,EAAAruE,EAAA4D,QAAAoqE,EAAAQ,GAAAxuE,EAAA6xB,UAAA7xB,EAAA8xB,SAI1C5jC,iBACA,IAAAsK,KAAAwL,IAAAtB,OAAAqzB,YACA,SACA,IAAAtjB,EAAA7W,EAAApD,KAAAg1E,SAAAh1E,KAAAc,OACA,IAAAsC,EAAAhE,KAAAm+B,cAAA64C,EAAAp2E,KAAAwL,IAAAxL,KAAAwL,IAAA1K,MAAAsC,EAAAhE,KAAAgE,EAAA4X,OAAA,IACAhb,KAAAwL,IAAA1K,OAAAd,KAAAc,QAAAmZ,EAAAja,KAAAq2E,eAAAr2E,KAAAwL,OAAAyO,EAAAnZ,OAAAd,KAAAc,MACA,SACA,IAAAA,MAAaA,GAAQd,KAAAwL,IAAA9B,EAAA1J,KAAAwL,IAAA9B,MAAA5I,GACrB,KAAAA,EAAA,GAAA4I,GAAA1J,KAAAwL,IAAAlB,MAAAxJ,MACA4I,EACA,OAAAA,EAEAhU,eAAA8V,GACAu2B,EAAA,QAAAxnC,EAAAoK,KAAAC,IAAA5E,KAAAc,MAAA0K,EAAA1K,OAA2DvG,GAAA,EAAQA,IAAA,CACnE,IAAAygB,MAAiBA,EAAA5b,QAAcY,KAAAg1E,SAAAz6E,GAC/B+7E,EAAA/7E,EAAAiR,EAAA1K,OAAA0K,EAAAlB,IAAA/P,EAAA,IAAAiR,EAAA7H,KAAA6H,EAAA1K,OAAAvG,EAAA,IACAu6E,EAAAsB,EAAA5qE,EAAAjR,EAAA6E,EAAA4b,EAAAs7D,GACA,GAAAxB,EAAA,CAEA,QAAA/rE,EAAAxO,EAAA,EAA+BwO,GAAA,EAAQA,IAAA,CACvC,IAAAiS,MAAqBA,EAAA5b,QAAcY,KAAAg1E,SAAAjsE,GACnCw8B,EAAA6wC,EAAA5qE,EAAAzC,EAAA3J,EAAA4b,GAAA,GACA,IAAAuqB,KAAA7/B,WACA,SAAAq8B,EAEA,OAAoBjhC,MAAAvG,EAAAu6E,MAAA5c,KAAAoe,EAAA9qE,EAAA3B,IAAAb,QAAAwC,EAAA9B,MAAAnP,EAAA,IAAAiR,KAGpB9V,MAAA8V,GACA,IAAAqgB,EAAA7rB,KAAAq2E,eAAA7qE,GACA,IAAAqgB,EACA,YACA,KAAA7rB,KAAAc,MAAA+qB,EAAA/qB,OACAd,KAAA81E,oBACAjqD,EAAAipD,IAAApvE,aACA1F,KAAA24B,OAAAw9C,EAAAn2E,KAAA24B,OAAA9M,EAAA/qB,MAAA+qB,EAAAipD,MACAtpE,EAAAqgB,EAAAqsC,KACA,QAAAnvD,EAAA8iB,EAAA/qB,MAAA,EAAqCiI,GAAAyC,EAAA1K,MAAgBiI,IAAA,CACrD,IAAA/B,EAAAwE,EAAAxE,KAAA+B,GAAA8V,EAAA7X,EAAA5H,KAAAg/B,aAAAkD,WAAAt6B,EAAAoE,SAAA,EAAAI,EAAAvG,MAAA8D,IACA/I,KAAA+1E,iBAAA/uE,EAAA5H,KAAA4H,EAAAlB,MAAA+Y,GAEA,OAAArT,EAEA9V,iBAAA0J,EAAA0G,EAAA,KAAAsF,GACA,IAAAhI,EAAApD,KAAAg1E,SAAAh1E,KAAAc,OACAsC,EAAA4X,MAAA5X,EAAA4X,MAAA4jB,UAAAx/B,GACAY,KAAA24B,OAAAw9C,EAAAn2E,KAAA24B,OAAA34B,KAAAc,MAA6Dk2C,EAAA,EAAQ7rC,KAAA/L,EAAA7C,OAAAuJ,EAAAsF,KACrEpL,KAAAg1E,SAAA/yE,MAA4B7C,OAAA4b,MAAA5b,EAAAg/B,eAE5B1oC,oBACA,IACAmpB,EADA7e,KAAAg1E,SAAAv0E,MACAua,MAAAsmB,WAAwC0V,EAAA,EAAQvqC,OAAA,GAChDoS,EAAAnZ,aACA1F,KAAA24B,OAAAw9C,EAAAn2E,KAAA24B,OAAA34B,KAAAg1E,SAAA35E,OAAAwjB,KAGA,SAAAg3D,EAAAtpE,EAAAzL,EAAA0U,GACA,UAAA1U,EACAyL,EAAAyqB,WAAAxhB,EAAAjJ,EAAA7G,YACA6G,EAAA0qB,aAAA,EAAA1qB,EAAA3C,WAAAvN,KAAAw5E,EAAAtpE,EAAA3C,WAAAwB,QAAAtK,EAAA,EAAA0U,KAEA,SAAA2gE,EAAA5pE,EAAAzL,EAAAsK,GACA,UAAAtK,EACAyL,EAAA+E,OAAAlG,GACAmB,EAAA0qB,aAAA1qB,EAAA7G,WAAA,EAAA6G,EAAAxC,UAAA1N,KAAA85E,EAAA5pE,EAAAxC,UAAAqB,QAAAtK,EAAA,EAAAsK,KAEA,SAAAqqE,EAAAlpE,EAAAzL,GACA,QAAAvG,EAAA,EAAmBA,EAAAuG,EAAWvG,IAC9BgS,IAAA3C,WAAAwB,QACA,OAAAmB,EAEA,SAAA2pE,EAAAlvE,EAAAqyB,EAAAC,GACA,GAAAD,GAAA,EACA,OAAAryB,EACA,IAAAo6B,EAAAp6B,EAAAoE,QAQA,OAPAiuB,EAAA,IACA+H,IAAAnK,aAAA,EAAAi/C,EAAA90C,EAAAx3B,WAAAyvB,EAAA,KAAA+H,EAAA17B,WAAA4zB,EAAA,OACAD,EAAA,IACA+H,EAAAp6B,EAAA5H,KAAAg/B,aAAAkD,WAAAF,GAAA9vB,OAAA8vB,GACA9H,GAAA,IACA8H,IAAA9vB,OAAAtK,EAAA5H,KAAAg/B,aAAAC,cAAA+C,GAAAE,WAAqF0V,EAAA,EAAQvqC,OAAA,MAE7FzF,EAAA3K,KAAA+kC,GAEA,SAAAg1C,EAAA5qE,EAAA1K,EAAA1B,EAAA4b,EAAA2B,GACA,IAAA3V,EAAAwE,EAAAxE,KAAAlG,GAAAmE,EAAA0X,EAAAnR,EAAAwE,WAAAlP,GAAA0K,EAAAvG,MAAAnE,GACA,GAAAmE,GAAA+B,EAAAtB,aAAAtG,EAAAs7B,kBAAA1zB,EAAA5H,MACA,YACA,IAAA01E,EAAA95D,EAAAsmB,WAAAt6B,EAAAoE,SAAA,EAAAnG,GACA,OAAA6vE,IAEA,SAAA11E,EAAAmN,EAAA7K,GACA,QAAAnH,EAAAmH,EAAuBnH,EAAAgS,EAAA7G,WAAyBnL,IAChD,IAAA6E,EAAAs/B,YAAAnyB,EAAAnH,MAAA7K,GAAAof,OACA,SACA,SANA48D,CAAAn3E,EAAA4H,EAAAoE,QAAAnG,GAAA6vE,EAAA,KAQA,SAAA0B,EAAAp3E,GACA,OAAAA,EAAAmG,KAAAyT,UAAA5Z,EAAAmG,KAAAkxE,mBA+EA,SAAAC,EAAAnqE,EAAAzL,EAAA61E,EAAAC,EAAA1sE,GACA,GAAApJ,EAAA61E,EAAA,CACA,IAAA//C,EAAArqB,EAAA3C,WACA2C,IAAA0qB,aAAA,EAAAL,EAAAv6B,KAAAq6E,EAAA9/C,EAAAxrB,QAAAtK,EAAA,EAAA61E,EAAAC,EAAAhgD,KAEA,GAAA91B,EAAA81E,EAAA,CACA,IAAA57D,EAAA9Q,EAAAi0B,eAAA,GACAz8B,EAAAsZ,EAAAsmB,WAAA/0B,GAAA+E,OAAA/E,GACAA,EAAA7K,EAAA4P,OAAA0J,EAAAqjB,cAAA38B,GAAA4/B,WAAsE0V,EAAA,EAAQvqC,OAAA,IAE9E,OAAAF,EA4BA,SAAAsqE,EAAAtrE,EAAAC,GACA,IAAApQ,KACA,QAAA2N,EADApE,KAAAC,IAAA2G,EAAAzK,MAAA0K,EAAA1K,OAC0BiI,GAAA,EAAQA,IAAA,CAClC,IAAArH,EAAA6J,EAAA7J,MAAAqH,GACA,GAAArH,EAAA6J,EAAA5H,KAAA4H,EAAAzK,MAAAiI,IACAyC,EAAAlB,IAAAvB,GAAAyC,EAAA7H,KAAA6H,EAAA1K,MAAAiI,IACAwC,EAAAvE,KAAA+B,GAAA3J,KAAAmG,KAAAq2B,WACApwB,EAAAxE,KAAA+B,GAAA3J,KAAAmG,KAAAq2B,UACA,OACAl6B,GAAA8J,EAAA9J,MAAAqH,IACAA,GAAAwC,EAAAzK,OAAAiI,GAAAyC,EAAA1K,OAAAyK,EAAArB,OAAAwyB,eAAAlxB,EAAAtB,OAAAwyB,eACA3zB,GAAAyC,EAAA9J,MAAAqH,EAAA,IAAArH,EAAA,IACAtG,EAAA6G,KAAA8G,GAEA,OAAA3N,EAMA,IAAA07E,gBAAAv7E,SAEAu7E,EAAA,SAAAA,EAAAv3E,GACA,IAAAP,EAAAzD,MAAAkD,KAAAuB,KAAAT,GAEA,OADAP,EAAAmT,UAAA2kE,EAAAv4E,UACAS,IAEAT,UAAAjC,OAAAC,OAAAhB,MAAAgD,WACAu4E,EAAAv4E,UAAA6T,YAAA0kE,EACAA,EAAAv4E,UAAAzD,KAAA,uBAQA41E,EAIAh7E,YAKAmU,GACA7J,KAAA6J,MAIA7J,KAAA2M,SAIA3M,KAAAqU,QAIArU,KAAAyL,QAAA,IAAA6kE,EAKArnE,aAAkB,OAAAjJ,KAAAqU,KAAAhZ,OAAA2E,KAAAqU,KAAA,GAAArU,KAAA6J,IAKlBnU,KAAAge,GACA,IAAAtY,EAAA4E,KAAA4T,UAAAF,GACA,GAAAtY,EAAAm4E,OACA,UAAAuD,EAAA17E,EAAAm4E,QACA,OAAAvzE,KAMAtK,UAAAge,GACA,IAAAtY,EAAAsY,EAAAiE,MAAA3X,KAAA6J,KAGA,OAFAzO,EAAAm4E,QACAvzE,KAAAw5C,QAAA9lC,EAAAtY,EAAAyO,KACAzO,EAMA2U,iBACA,OAAA/P,KAAA2M,MAAAtR,OAAA,EAKA3F,QAAAge,EAAA7J,GACA7J,KAAAqU,KAAApS,KAAAjC,KAAA6J,KACA7J,KAAA2M,MAAA1K,KAAAyR,GACA1T,KAAAyL,QAAAqI,UAAAJ,EAAAiC,UACA3V,KAAA6J,MAMAnU,QAAAyV,EAAA2B,EAAA3B,EAAA3D,EAAqCwvC,EAAA,EAAKvqC,OAC1C,IAAAiH,EAAAq9D,EAAA/wE,KAAA6J,IAAAsB,EAAA2B,EAAAtF,GAGA,OAFAkM,GACA1T,KAAA0T,QACA1T,KAMAtK,YAAAyV,EAAA2B,EAAA1B,GACA,OAAApL,KAAA4M,QAAAzB,EAAA2B,EAAA,IAA0CkqC,EAAA,EAAMA,EAAA,EAAQ7rC,KAAAC,GAAA,MAKxD1V,OAAAyV,EAAA2B,GACA,OAAA9M,KAAA4M,QAAAzB,EAAA2B,EAAsCkqC,EAAA,EAAKvqC,OAK3C/W,OAAAiO,EAAAyH,GACA,OAAApL,KAAAkwC,YAAAvsC,IAAAyH,GAqBA1V,aAAAyV,EAAA2B,EAAAtF,GAEA,OA1QA,SAAAgF,EAAArB,EAAA2B,EAAAtF,GACA,IAAAA,EAAA6D,KACA,OAAAmB,EAAA+qC,YAAApsC,EAAA2B,GACA,IAAAvB,EAAAiB,EAAA3C,IAAAb,QAAAmC,GAAAK,EAAAgB,EAAA3C,IAAAb,QAAA8D,GACA,GAAA8nE,EAAArpE,EAAAC,EAAAhE,GACA,OAAAgF,EAAAkH,KAAA,IAAA88D,EAAArlE,EAAA2B,EAAAtF,IACA,IAAAuvE,EAAAF,EAAAtrE,EAAAiB,EAAA3C,IAAAb,QAAA8D,IAEA,GAAAiqE,IAAA17E,OAAA,IACA07E,EAAAt2E,MAGA,IAAAu2E,IAAAzrE,EAAAzK,MAAA,GACAi2E,EAAA1vE,QAAA2vE,GAKA,QAAAjuE,EAAAwC,EAAAzK,MAAA6C,EAAA4H,EAAA5H,IAAA,EAAkDoF,EAAA,EAAOA,IAAApF,IAAA,CACzD,IAAA4B,EAAAgG,EAAAvE,KAAA+B,GAAA3J,KAAAmG,KACA,GAAAA,EAAAyT,UAAAzT,EAAA0xE,mBAAA1xE,EAAAq2B,UACA,MACAm7C,EAAA/2C,QAAAj3B,IAAA,EACAiuE,EAAAjuE,EACAwC,EAAAtC,OAAAF,IAAApF,GACAozE,EAAApsE,OAAA,KAAA5B,GAIA,IAAAmuE,EAAAH,EAAA/2C,QAAAg3C,GACAG,KAAAC,EAAA5vE,EAAA6xB,UACA,QAAAjuB,EAAA5D,EAAA4D,QAAA7Q,EAAA,GAA6CA,IAAA,CAC7C,IAAAyM,EAAAoE,EAAAxB,WAEA,GADAutE,EAAAl1E,KAAA+E,GACAzM,GAAAiN,EAAA6xB,UACA,MACAjuB,EAAApE,EAAAoE,QAIA,QAAArC,EAAAquE,EAAA,EAAoCruE,GAAA,EAAQA,IAAA,CAC5C,IAAA3J,EAAA+3E,EAAApuE,GAAA3J,KAAAo2C,EAAAghC,EAAAp3E,GACA,GAAAo2C,GAAAjqC,EAAAvE,KAAAkwE,GAAA93E,QACAg4E,EAAAruE,OACA,GAAAysC,IAAAp2C,EAAAm+B,YACA,MAEA,QAAAt8B,EAAAuG,EAAA6xB,UAAiCp4B,GAAA,EAAQA,IAAA,CACzC,IAAAo2E,GAAAp2E,EAAAm2E,EAAA,IAAA5vE,EAAA6xB,UAAA,GACA8B,EAAAg8C,EAAAE,GACA,GAAAl8C,EAEA,QAAA5gC,EAAA,EAAuBA,EAAAw8E,EAAA17E,OAAyBd,IAAA,CAGhD,IAAA+8E,EAAAP,GAAAx8E,EAAA28E,GAAAH,EAAA17E,QAAAk8E,GAAA,EACAD,EAAA,IACAC,GAAA,EACAD,MAEA,IAAAptE,EAAAqB,EAAAvE,KAAAswE,EAAA,GAAAryE,EAAAsG,EAAAtG,MAAAqyE,EAAA,GACA,GAAAptE,EAAAy0B,eAAA15B,IAAAk2B,EAAA/7B,KAAA+7B,EAAAxhB,OACA,OAAAnN,EAAAI,QAAArB,EAAAtC,OAAAquE,GAAAC,EAAA/rE,EAAA9B,MAAA4tE,GAAAxqE,EAAA,IAAuGkqC,EAAA,EAAK0/B,EAAAlvE,EAAA4D,QAAA,EAAA5D,EAAA6xB,UAAAg+C,KAAA7vE,EAAA8xB,WAG5G,IAAAk+C,EAAAhrE,EAAAG,MAAAtR,OACA,QAAAd,EAAAw8E,EAAA17E,OAAA,EAAyCd,GAAA,IACzCiS,EAAAI,QAAAzB,EAAA2B,EAAAtF,KACAgF,EAAAG,MAAAtR,OAAAm8E,IAFiDj9E,IAAA,CAIjD,IAAAuG,EAAAi2E,EAAAx8E,GACAuG,EAAA,IAEAqK,EAAAI,EAAAtC,OAAAnI,GACAgM,EAAAtB,EAAA9B,MAAA5I,KA+LAu2C,CAAAr3C,KAAAmL,EAAA2B,EAAAtF,GACAxH,KAWAtK,iBAAAyV,EAAA2B,EAAA9F,GAEA,OA9LA,SAAAwF,EAAArB,EAAA2B,EAAA9F,GACA,IAAAA,EAAAs1B,UAAAnxB,GAAA2B,GAAAN,EAAA3C,IAAAb,QAAAmC,GAAAjB,OAAAkB,QAAAC,KAAA,CACA,IAAAosE,EAhcA,SAAA5tE,EAAAlG,EAAAyoB,GACA,IAAAtjB,EAAAe,EAAAb,QAAArF,GACA,GAAAmF,EAAAoB,OAAAy0B,eAAA71B,EAAA7D,QAAA6D,EAAA7D,QAAAmnB,GACA,OAAAzoB,EACA,MAAAmF,EAAAyxB,aACA,QAAAxxB,EAAAD,EAAAhI,MAAA,EAAoCiI,GAAA,EAAQA,IAAA,CAC5C,IAAA9D,EAAA6D,EAAA7D,MAAA8D,GACA,GAAAD,EAAA9B,KAAA+B,GAAA41B,eAAA15B,IAAAmnB,GACA,OAAAtjB,EAAAG,OAAAF,EAAA,GACA,GAAA9D,EAAA,EACA,YAEA,GAAA6D,EAAAyxB,cAAAzxB,EAAAoB,OAAAkB,QAAAC,KACA,QAAAtC,EAAAD,EAAAhI,MAAA,EAAoCiI,GAAA,EAAQA,IAAA,CAC5C,IAAA9D,EAAA6D,EAAAkH,WAAAjH,GACA,GAAAD,EAAA9B,KAAA+B,GAAA41B,eAAA15B,IAAAmnB,GACA,OAAAtjB,EAAAY,MAAAX,EAAA,GACA,GAAA9D,EAAA6D,EAAA9B,KAAA+B,GAAArD,WACA,YAEA,YA4aAgyE,CAAAlrE,EAAA3C,IAAAsB,EAAAnE,EAAA5H,MACA,MAAAq4E,IACAtsE,EAAA2B,EAAA2qE,GAEAjrE,EAAA6qC,aAAAlsC,EAAA2B,EAAA,IAAkCkqC,EAAA,EAAMA,EAAA,EAAQ7rC,KAAAnE,GAAA,MAuLhDwwC,CAAAx3C,KAAAmL,EAAA2B,EAAA9F,GACAhH,KAMAtK,YAAAyV,EAAA2B,GAEA,OA9LA,SAAAN,EAAArB,EAAA2B,GACA,IAAAvB,EAAAiB,EAAA3C,IAAAb,QAAAmC,GAAAK,EAAAgB,EAAA3C,IAAAb,QAAA8D,GACA6qE,EAAAd,EAAAtrE,EAAAC,GACA,QAAAjR,EAAA,EAAmBA,EAAAo9E,EAAAt8E,OAAoBd,IAAA,CACvC,IAAAuG,EAAA62E,EAAAp9E,GAAAsb,EAAAtb,GAAAo9E,EAAAt8E,OAAA,EACA,GAAAwa,GAAA,GAAA/U,GAAAyK,EAAAvE,KAAAlG,GAAA1B,KAAAg/B,aAAAK,SACA,OAAAjyB,EAAAmS,OAAApT,EAAA7J,MAAAZ,GAAA0K,EAAAlB,IAAAxJ,IACA,GAAAA,EAAA,IAAA+U,GAAAtK,EAAAvE,KAAAlG,EAAA,GAAAs6B,WAAA7vB,EAAAtG,MAAAnE,EAAA,GAAA0K,EAAAwE,WAAAlP,EAAA,KACA,OAAA0L,EAAAmS,OAAApT,EAAAtC,OAAAnI,GAAA0K,EAAA9B,MAAA5I,IAEA,QAAAiI,EAAA,EAAmBA,GAAAwC,EAAAzK,OAAAiI,GAAAyC,EAAA1K,MAAoCiI,IACvD,GAAAoC,EAAAI,EAAA7J,MAAAqH,IAAAwC,EAAAzK,MAAAiI,GAAA+D,EAAAvB,EAAAjB,IAAAvB,IAAAyC,EAAAlB,IAAAvB,GAAA+D,GAAAtB,EAAA1K,MAAAiI,EACA,OAAAyD,EAAAmS,OAAApT,EAAAtC,OAAAF,GAAA+D,GAEAN,EAAAmS,OAAAxT,EAAA2B,GA+KAyqC,CAAAv3C,KAAAmL,EAAA2B,GACA9M,KASAtK,KAAAqoB,EAAA9B,GAEA,OAv1BA,SAAAzP,EAAAuR,EAAA9B,GACA,IAAA1Q,MAASA,EAAAC,MAAA1K,SAAoBid,EAC7B65D,EAAArsE,EAAAtC,OAAAnI,EAAA,GAAA+2E,EAAArsE,EAAA9B,MAAA5I,EAAA,GACAY,EAAAk2E,EAAAttE,EAAAutE,EACA5uE,EAAiB+tC,EAAA,EAAQvqC,MAAA4sB,EAAA,EACzB,QAAAtwB,EAAAjI,EAAAg3E,GAAA,EAA0C/uE,EAAAkT,EAAYlT,IACtD+uE,GAAAvsE,EAAAtG,MAAA8D,GAAA,GACA+uE,GAAA,EACA7uE,EAAqB+tC,EAAA,EAAQ7rC,KAAAI,EAAAvE,KAAA+B,GAAA1M,KAAA4M,IAC7BowB,KAGA33B,IAEA,IAAAgI,EAAgBstC,EAAA,EAAQvqC,MAAA6sB,EAAA,EACxB,QAAAvwB,EAAAjI,EAAAg3E,GAAA,EAA0C/uE,EAAAkT,EAAYlT,IACtD+uE,GAAAtsE,EAAA9B,MAAAX,EAAA,GAAAyC,EAAAlB,IAAAvB,IACA+uE,GAAA,EACApuE,EAAoBstC,EAAA,EAAQ7rC,KAAAK,EAAAxE,KAAA+B,GAAA1M,KAAAqN,IAC5B4vB,KAGAhvB,IAEAkC,EAAAkH,KAAA,IAAA68D,EAAA7uE,EAAA4I,EAAAstE,EAAAC,EAAA,IAAoE7gC,EAAA,EAAK/tC,EAAAqI,OAAA5H,GAAA2vB,EAAAC,GAAArwB,EAAAoC,KAAAguB,GAAA,IA8zBzE8V,CAAAnvC,KAAA+d,EAAA9B,GACAjc,KAMAtK,KAAAiO,EAAA7C,EAAA,GAEA,OAjqBA,SAAA0L,EAAA7I,EAAA7C,GACA,IAAA4S,EAAA,IAAA88D,EAAA7sE,EAAA7C,EAAA6C,EAAA7C,EAAyDk2C,EAAA,EAAKvqC,OAAA,GAC9DD,EAAAkH,QA8pBAtL,CAAApI,KAAA2D,EAAA7C,GACAd,KAOAtK,KAAAqoB,EAAAq0C,GAEA,OAvyBA,SAAA5lD,EAAAuR,EAAAq0C,GACA,IAAAhnD,EAAkB4rC,EAAA,EAAQvqC,MAC1B,QAAAlS,EAAA63D,EAAA/2D,OAAA,EAAqCd,GAAA,EAAQA,IAAA,CAC7C,GAAA6Q,EAAAC,KAAA,CACA,IAAA2P,EAAAo3C,EAAA73D,GAAA6E,KAAAg/B,aAAAC,cAAAjzB,GACA,IAAA4P,MAAAyjB,SACA,UAAA56B,WAAA,0FAEAuH,EAAkB4rC,EAAA,EAAQ7rC,KAAAinD,EAAA73D,GAAA6E,KAAA7C,OAAA61D,EAAA73D,GAAAuL,MAAAsF,IAE1B,IAAA1J,EAAAqc,EAAArc,MAAA4I,EAAAyT,EAAAzT,IACAkC,EAAAkH,KAAA,IAAA68D,EAAA7uE,EAAA4I,EAAA5I,EAAA4I,EAAA,IAA8D0sC,EAAA,EAAK5rC,EAAA,KAAAgnD,EAAA/2D,QAAA,IA2xBnEotC,CAAAzoC,KAAA+d,EAAAq0C,GACApyD,KAMAtK,aAAAyV,EAAA2B,EAAA3B,EAAA/L,EAAA0G,EAAA,MAEA,OAlyBA,SAAA0G,EAAArB,EAAA2B,EAAA1N,EAAA0G,GACA,IAAA1G,EAAAm+B,YACA,UAAA15B,WAAA,oDACA,IAAA6I,EAAAF,EAAAG,MAAAtR,OACAmR,EAAA3C,IAAAqsB,aAAA/qB,EAAA2B,EAAA,CAAA9F,EAAArD,KACA,GAAAqD,EAAAu2B,cAAAv2B,EAAA02B,UAAAt+B,EAAA0G,IAUA,SAAA+D,EAAAlG,EAAAvE,GACA,IAAA0J,EAAAe,EAAAb,QAAArF,GAAAsB,EAAA6D,EAAA7D,QACA,OAAA6D,EAAAoB,OAAAy0B,eAAA15B,IAAA,EAAA7F,GAZA24E,CAAAvrE,EAAA3C,IAAA2C,EAAAf,QAAAjE,MAAAkF,GAAAtQ,IAAAuH,GAAAvE,GAAA,CAEAoN,EAAAkkC,kBAAAlkC,EAAAf,QAAAjE,MAAAkF,GAAAtQ,IAAAuH,EAAA,GAAAvE,GACA,IAAAqM,EAAAe,EAAAf,QAAAjE,MAAAkF,GACAsrE,EAAAvsE,EAAArP,IAAAuH,EAAA,GAAAs0E,EAAAxsE,EAAArP,IAAAuH,EAAAqD,EAAA3B,SAAA,GAEA,OADAmH,EAAAkH,KAAA,IAAA68D,EAAAyH,EAAAC,EAAAD,EAAA,EAAAC,EAAA,MAAkFjhC,EAAA,EAAMA,EAAA,EAAQ7rC,KAAA/L,EAAA7C,OAAAuJ,EAAA,KAAAkB,EAAA2S,QAAA,aAChG,KAsxBAy1B,CAAApvC,KAAAmL,EAAA2B,EAAA1N,EAAA0G,GACA9F,KAMAtK,cAAAiO,EAAAvE,EAAA0G,EAAA,KAAA6T,MAEA,OAnxBA,SAAAnN,EAAA7I,EAAAvE,EAAA0G,EAAA6T,GACA,IAAA3S,EAAAwF,EAAA3C,IAAA5C,OAAAtD,GACA,IAAAqD,EACA,UAAAnD,WAAA,6BACAzE,IACAA,EAAA4H,EAAA5H,MACA,IAAA84E,EAAA94E,EAAA7C,OAAAuJ,EAAA,KAAA6T,GAAA3S,EAAA2S,OACA,GAAA3S,EAAA0vB,OACA,OAAAlqB,EAAA0jC,YAAAvsC,IAAAqD,EAAA3B,SAAA6yE,GACA,IAAA94E,EAAA47B,aAAAh0B,EAAAoE,SACA,UAAAvH,WAAA,iCAAAzE,EAAAtE,MACA0R,EAAAkH,KAAA,IAAA68D,EAAA5sE,IAAAqD,EAAA3B,SAAA1B,EAAA,EAAAA,EAAAqD,EAAA3B,SAAA,MAAkG2xC,EAAA,EAAMA,EAAA,EAAQ7rC,KAAA+sE,GAAA,YAuwBhHtnE,CAAA5Q,KAAA2D,EAAAvE,EAAA0G,EAAA6T,GACA3Z,KASAtK,MAAAiO,EAAA7C,EAAA,EAAA4sE,GAEA,OAxvBA,SAAAlhE,EAAA7I,EAAA7C,EAAA,EAAA4sE,GACA,IAAA5kE,EAAA0D,EAAA3C,IAAAb,QAAArF,GAAAsF,EAA6C+tC,EAAA,EAAQvqC,MAAA/C,EAAgBstC,EAAA,EAAQvqC,MAC7E,QAAA1D,EAAAD,EAAAhI,MAAAhC,EAAAgK,EAAAhI,QAAAvG,EAAAuG,EAAA,EAAmEiI,EAAAjK,EAAOiK,IAAAxO,IAAA,CAC1E0O,EAAiB+tC,EAAA,EAAQ7rC,KAAArC,EAAA9B,KAAA+B,GAAA1M,KAAA4M,IACzB,IAAAkvE,EAAAzK,KAAAnzE,GACAmP,EAAgBstC,EAAA,EAAQ7rC,KAAAgtE,IAAA/4E,KAAA7C,OAAA47E,EAAAryE,MAAA4D,GAAAZ,EAAA9B,KAAA+B,GAAA1M,KAAAqN,IAExB8C,EAAAkH,KAAA,IAAA88D,EAAA7sE,IAAA,IAA0CqzC,EAAA,EAAK/tC,EAAAqI,OAAA5H,GAAA5I,MAAA,IAgvB/C3F,CAAA6E,KAAA2D,EAAA7C,EAAA4sE,GACA1tE,KAKAtK,QAAAyV,EAAA2B,EAAA8wB,GAEA,OA9/BA,SAAApxB,EAAArB,EAAA2B,EAAA8wB,GACA,IACAw6C,EAAAC,EADAza,KAAA/mD,KAEArK,EAAA3C,IAAAqsB,aAAA/qB,EAAA2B,EAAA,CAAA9F,EAAArD,EAAAuG,KACA,IAAAlD,EAAAs1B,SACA,OACA,IAAA3iB,EAAA3S,EAAA2S,MACA,IAAAikB,EAAA7E,QAAApf,IAAAzP,EAAA9K,KAAAokC,eAAA5F,EAAAx+B,MAAA,CACA,IAAAsC,EAAAiD,KAAAE,IAAAlB,EAAAwH,GAAAb,EAAA3F,KAAAC,IAAAjB,EAAAqD,EAAA3B,SAAAyH,GACAwrE,EAAA16C,EAAAlF,SAAA/e,GACA,QAAApf,EAAA,EAA2BA,EAAAof,EAAAte,OAAkBd,IAC7Cof,EAAApf,GAAAw+B,QAAAu/C,KACAF,KAAAtrE,IAAApL,GAAA02E,EAAAx6C,KAAAruB,GAAAoK,EAAApf,IACA69E,EAAAtrE,GAAAxC,EAEAszD,EAAA37D,KAAAm2E,EAAA,IAAAvE,EAAAnyE,EAAA4I,EAAAqP,EAAApf,MAGA89E,KAAAvrE,IAAApL,EACA22E,EAAAvrE,GAAAxC,EAEAuM,EAAA5U,KAAAo2E,EAAA,IAAA3E,EAAAhyE,EAAA4I,EAAAszB,OAGAggC,EAAAzsD,QAAApJ,GAAAyE,EAAAkH,KAAA3L,IACA8O,EAAA1F,QAAApJ,GAAAyE,EAAAkH,KAAA3L,IAo+BAiqC,CAAAhyC,KAAAmL,EAAA2B,EAAA8wB,GACA59B,KAQAtK,WAAAyV,EAAA2B,EAAA8wB,GAEA,OA7+BA,SAAApxB,EAAArB,EAAA2B,EAAA8wB,GACA,IAAA5N,KAAAtc,EAAA,EACAlH,EAAA3C,IAAAqsB,aAAA/qB,EAAA2B,EAAA,CAAA9F,EAAArD,KACA,IAAAqD,EAAAs1B,SACA,OACA5oB,IACA,IAAA6kE,EAAA,KACA,GAAA36C,aAA4BoZ,EAAA,EAAQ,CACpC,IAAAzhB,EAAAxyB,EAAAiE,EAAA2S,MACA,KAAA4b,EAAAqI,EAAA7E,QAAAh2B,KACAw1E,WAAAt2E,KAAAszB,GACAxyB,EAAAwyB,EAAAuD,cAAA/1B,QAGA66B,EACAA,EAAA7E,QAAA/xB,EAAA2S,SACA4+D,GAAA36C,IAGA26C,EAAAvxE,EAAA2S,MAEA,GAAA4+D,KAAAl9E,OAAA,CACA,IAAAiP,EAAA3F,KAAAC,IAAAjB,EAAAqD,EAAA3B,SAAAyH,GACA,QAAAvS,EAAA,EAA2BA,EAAAg+E,EAAAl9E,OAAqBd,IAAA,CAChD,IAAAg7B,EAAAha,EAAAg9D,EAAAh+E,GACA,QAAA0G,EAAA,EAA+BA,EAAA+uB,EAAA30B,OAAoB4F,IAAA,CACnD,IAAA6iB,EAAAkM,EAAA/uB,GACA6iB,EAAApQ,QAAA,GAAA6H,EAAAhM,GAAAygB,EAAA/uB,GAAAsa,SACAga,EAAAzR,GAEAyR,GACAA,EAAAzoB,GAAAxC,EACAirB,EAAA7hB,QAGAsc,EAAA/tB,MAAkCsZ,QAAApQ,KAAAxG,KAAAE,IAAAlB,EAAAwH,GAAA2B,GAAAxC,EAAAoJ,aAKlCsc,EAAA7e,QAAA2S,GAAAtX,EAAAkH,KAAA,IAAAmgE,EAAA/vD,EAAA3Y,KAAA2Y,EAAAhX,GAAAgX,EAAAvI,SAo8BAs2B,CAAA7xC,KAAAmL,EAAA2B,EAAA8wB,GACA59B,KAQAtK,kBAAAiO,EAAA60E,EAAAx9D,GAEA,OA78BA,SAAAxO,EAAA7I,EAAA60E,EAAAx9D,EAAAw9D,EAAAp6C,cACA,IAAAp3B,EAAAwF,EAAA3C,IAAA5C,OAAAtD,GACA80E,KAAA/3C,EAAA/8B,EAAA,EACA,QAAApJ,EAAA,EAAmBA,EAAAyM,EAAAtB,WAAqBnL,IAAA,CACxC,IAAA6K,EAAA4B,EAAA5B,MAAA7K,GAAA+P,EAAAo2B,EAAAt7B,EAAAC,SACAqzE,EAAA19D,EAAA4jB,UAAAx5B,EAAAhG,MACA,GAAAs5E,EAGA,CACA19D,EAAA09D,EACA,QAAAz3E,EAAA,EAA2BA,EAAAmE,EAAAuU,MAAAte,OAAwB4F,IACnDu3E,EAAAh1C,eAAAp+B,EAAAuU,MAAA1Y,GAAA7B,OACAoN,EAAAkH,KAAA,IAAAmgE,EAAAnzC,EAAAp2B,EAAAlF,EAAAuU,MAAA1Y,UANAw3E,EAAAx2E,KAAA,IAAAuuE,EAAA9vC,EAAAp2B,EAAoD0sC,EAAA,EAAKvqC,QAQzDi0B,EAAAp2B,EAEA,IAAA0Q,EAAAyjB,SAAA,CACA,IAAA+J,EAAAxtB,EAAAsmB,WAAoC0V,EAAA,EAAQvqC,OAAA,GAC5CD,EAAAI,QAAA8zB,IAAA,IAAiCsW,EAAA,EAAKxO,EAAA,MAEtC,QAAAjuC,EAAAk+E,EAAAp9E,OAAA,EAAqCd,GAAA,EAAQA,IAC7CiS,EAAAkH,KAAA+kE,EAAAl+E,IAs7BAm2C,CAAA1wC,KAAA2D,EAAA60E,EAAAx9D,GACAhb,2BC5wDA,SAAAhC,IACA,OACA+1C,QAAA,KACA20B,QAAA,EACAt0B,KAAA,EACAV,WAAA,EACAC,aAAA,GACAj1C,UAAA,KACA60C,WAAA,YACA61B,QAAA,EACAj1B,UAAA,EACAl0C,SAAA,KACA6zC,UAAA,EACAyB,UAAA,KACA/1C,QAAA,EACA61C,YAAA,EACAg0B,aAAA,EACAz1B,OAAA,GAQAp+C,EAAAC,SACAyI,UAxBA61C,QAAA,KACA20B,QAAA,EACAt0B,KAAA,EACAV,WAAA,EACAC,aAAA,GACAj1C,UAAA,KACA60C,WAAA,YACA61B,QAAA,EACAj1B,UAAA,EACAl0C,SAAA,KACA6zC,UAAA,EACAyB,UAAA,KACA/1C,QAAA,EACA61C,YAAA,EACAg0B,aAAA,EACAz1B,OAAA,GAUA51C,cACAC,eAPA,SAAA06E,GACAnjF,EAAAC,QAAAyI,SAAAy6E,qWCJMC,EACNljF,YAAAmjF,EAAAp5E,GACAO,KAAA64E,aACA74E,KAAA84E,UAAA,KACA94E,KAAAsyB,QAAA,KACAtyB,KAAA+4E,SAAA,EACA/4E,KAAAwD,MAAA/D,EAAA+D,OAAA,EACAxD,KAAAg5E,MAAAv5E,EAAAu5E,OAAA,QACAh5E,KAAA0qB,MAAAjrB,EAAAirB,MACA1qB,KAAAu0D,UAAA,yCAAAn4D,IAAAtB,IACA,IAAA46D,EAAA52D,IAAkCkB,KAAAlF,GAAAgE,IAElC,OADA+5E,EAAAnxE,IAAAmsB,iBAAA/4B,EAAA46D,IACoB56D,OAAA46D,aAGpBhgE,UACAsK,KAAAu0D,SAAApjD,QAAA,EAAgCrW,OAAA46D,aAAgB11D,KAAA64E,WAAAnxE,IAAAwoD,oBAAAp1D,EAAA46D,IAEhDhgE,OAAAmjF,EAAAvT,GACA,MAAAtlE,KAAA84E,WAAAxT,EAAAz7D,KAAAgvE,EAAA57E,MAAA4M,MACA7J,KAAA84E,UAAAD,EAAA57E,MAAA4M,IAAAuB,QAAAC,KACArL,KAAAi5E,UAAA,MAEAj5E,KAAAk5E,iBAGAxjF,UAAAiO,GACAA,GAAA3D,KAAA84E,YAEA94E,KAAA84E,UAAAn1E,EACA,MAAAA,GACA3D,KAAAsyB,QAAAG,WAAAi5B,YAAA1rD,KAAAsyB,SACAtyB,KAAAsyB,QAAA,MAGAtyB,KAAAk5E,iBAGAxjF,gBACA,IAAAoP,EAAAgE,EAAA9I,KAAA64E,WAAA57E,MAAA4M,IAAAb,QAAAhJ,KAAA84E,WACA,IAAAhwE,EAAAoB,OAAAwyB,cAAA,CACA,IAAAzzB,EAAAH,EAAAgB,WAAAJ,EAAAZ,EAAAa,UACA,GAAAV,GAAAS,EAAA,CACA,IAAAyvE,EAAAn5E,KAAA64E,WAAAnzB,QAAA1lD,KAAA84E,WAAA7vE,IAAA5D,SAAA,IACAq5C,wBACAt7C,EAAA6F,EAAAkwE,EAAA71E,OAAA61E,EAAA/1E,IACA6F,GAAAS,IACAtG,KAAApD,KAAA64E,WAAAnzB,QAAA1lD,KAAA84E,WAAAp6B,wBAAAt7C,KAAA,GACA0B,GAAwB3B,KAAAg2E,EAAAh2E,KAAAE,MAAA81E,EAAA91E,MAAAD,MAAApD,KAAAwD,MAAA,EAAAF,OAAAF,EAAApD,KAAAwD,MAAA,IAGxB,IAAAsB,EAAA,CACA,IAAAu7C,EAAArgD,KAAA64E,WAAAp2B,YAAAziD,KAAA84E,WACAh0E,GAAoB3B,KAAAk9C,EAAAl9C,KAAAnD,KAAAwD,MAAA,EAAAH,MAAAg9C,EAAAl9C,KAAAnD,KAAAwD,MAAA,EAAAJ,IAAAi9C,EAAAj9C,IAAAE,OAAA+8C,EAAA/8C,QAEpB,IAOA81E,EAAAC,EAPAnvE,EAAAlK,KAAA64E,WAAAnxE,IAAA4xE,aAQA,GAPAt5E,KAAAsyB,UACAtyB,KAAAsyB,QAAApoB,EAAAsgC,YAAAlf,SAAAb,cAAA,QACAzqB,KAAA0qB,QACA1qB,KAAAsyB,QAAAnS,UAAAngB,KAAA0qB,OACA1qB,KAAAsyB,QAAA/W,MAAA2vC,QAAA,4EAAgGlrD,KAAAg5E,QAGhG9uE,MAAAohB,SAAA5qB,MAAA,UAAAyqD,iBAAAjhD,GAAAmc,SACA+yD,GAAAG,YACAF,GAAAG,gBAEA,CACA,IAAA10E,EAAAoF,EAAAw0C,wBACA06B,EAAAt0E,EAAA3B,KAAA+G,EAAAy1C,WACA05B,EAAAv0E,EAAA1B,IAAA8G,EAAA21C,UAEA7/C,KAAAsyB,QAAA/W,MAAApY,KAAA2B,EAAA3B,KAAAi2E,EAAA,KACAp5E,KAAAsyB,QAAA/W,MAAAnY,IAAA0B,EAAA1B,IAAAi2E,EAAA,KACAr5E,KAAAsyB,QAAA/W,MAAA/X,MAAAsB,EAAAzB,MAAAyB,EAAA3B,KAAA,KACAnD,KAAAsyB,QAAA/W,MAAA9X,OAAAqB,EAAAxB,OAAAwB,EAAA1B,IAAA,KAEA1N,gBAAAqjF,GACApgB,aAAA34D,KAAA+4E,SACA/4E,KAAA+4E,QAAA3oB,WAAA,IAAApwD,KAAAi5E,UAAA,MAAAF,GAEArjF,SAAA+F,GACA,IAAAuE,KAAA64E,WAAAjqB,SACA,OACA,IAAAjrD,EAAA3D,KAAA64E,WAAA13B,aAA+Ch+C,KAAA1H,EAAAs6D,QAAA3yD,IAAA3H,EAAAu6D,UAC/ChvD,EAAArD,KAAA0+C,QAAA,GAAAriD,KAAA64E,WAAA57E,MAAA4M,IAAA5C,OAAAtD,EAAA0+C,QACAo3B,EAAAzyE,KAAA5H,KAAAmG,KAAAk0E,kBACA9pB,EAAA,mBAAA8pB,IAAAz5E,KAAA64E,WAAAl1E,EAAAlI,GAAAg+E,EACA,GAAA91E,IAAAgsD,EAAA,CACA,IAAA1zC,EAAAtY,MACA,GAAA3D,KAAA64E,WAAAre,UAAAx6D,KAAA64E,WAAAre,SAAAhzD,OAEA,OADAyU,EAAyB3f,OAAAoY,EAAA,EAAApY,CAAS0D,KAAA64E,WAAA57E,MAAA4M,IAAAoS,EAAAjc,KAAA64E,WAAAre,SAAAhzD,QAElC,OAAAxH,KAAAi5E,UAAA,MAEAj5E,KAAAi5E,UAAAh9D,GACAjc,KAAA05E,gBAAA,MAGAhkF,UACAsK,KAAA05E,gBAAA,IAEAhkF,OACAsK,KAAA05E,gBAAA,IAEAhkF,UAAA+F,GACAA,EAAAwgB,QAAAjc,KAAA64E,WAAAnxE,KAAA1H,KAAA64E,WAAAnxE,IAAAsa,SAAAvmB,EAAAy/D,gBACAl7D,KAAAi5E,UAAA,6BCpHMU,UAAkB39E,EAAA,EAIxBtG,YAAAoT,GACAwC,MAAAxC,KAEApT,IAAAmU,EAAA4B,GACA,IAAA3C,EAAAe,EAAAb,QAAAyC,EAAArP,IAAA4D,KAAA8N,OACA,OAAe6rE,EAAStd,MAAAvzD,GAAA,IAAmB6wE,EAAS7wE,GAAS9M,EAAA,EAASqS,KAAAvF,GAEtEpT,UAAe,OAAQ4W,EAAA,EAAKG,MAC5B/W,GAAAkY,GACA,OAAAA,aAAgC+rE,GAAS/rE,EAAAE,MAAA9N,KAAA8N,KAEzCpY,SACA,OAAgB0J,KAAA,YAAAuE,IAAA3D,KAAA8N,MAKhBpY,gBAAAmU,EAAAkE,GACA,oBAAAA,EAAApK,IACA,UAAAE,WAAA,wCACA,WAAmB81E,EAAS9vE,EAAAb,QAAA+E,EAAApK,MAK5BjO,cAAmB,WAAYkkF,EAAW55E,KAAA6N,QAI1CnY,aAAAoT,GACA,IAAAoB,EAAApB,EAAAoB,OACA,GAAAA,EAAAqzB,cAmEA,SAAAz0B,GACA,QAAAC,EAAAD,EAAAhI,MAA4BiI,GAAA,EAAQA,IAAA,CACpC,IAAA9D,EAAA6D,EAAA7D,MAAA8D,GAAAmB,EAAApB,EAAA9B,KAAA+B,GAEA,MAAA9D,EAMA,QAAAgE,EAAAiB,EAAA9E,MAAAH,EAAA,IAAmDgE,IAAAc,UAAA,CACnD,MAAAd,EAAAvD,aAAAuD,EAAAyzB,eAAAzzB,EAAAu0B,QAAAv0B,EAAA7J,KAAAmG,KAAAq2B,UACA,SACA,GAAA3yB,EAAAyzB,cACA,cATA,GAAAxyB,EAAA9K,KAAAmG,KAAAq2B,UACA,SAYA,SArFAi+C,CAAA/wE,KAuFA,SAAAA,GACA,QAAAC,EAAAD,EAAAhI,MAA4BiI,GAAA,EAAQA,IAAA,CACpC,IAAA9D,EAAA6D,EAAAkH,WAAAjH,GAAAmB,EAAApB,EAAA9B,KAAA+B,GACA,GAAA9D,GAAAiF,EAAAxE,WAKA,QAAAgE,EAAAQ,EAAA9E,MAAAH,IAA8CyE,IAAAE,WAAA,CAC9C,MAAAF,EAAAhE,aAAAgE,EAAAgzB,eAAAhzB,EAAA8zB,QAAA9zB,EAAAtK,KAAAmG,KAAAq2B,UACA,SACA,GAAAlyB,EAAAgzB,cACA,cARA,GAAAxyB,EAAA9K,KAAAmG,KAAAq2B,UACA,SAUA,SAtGAk+C,CAAAhxE,GACA,SACA,IAAAixE,EAAA7vE,EAAA9K,KAAAmG,KAAAy0E,eACA,SAAAD,EACA,OAAAA,EACA,IAAArtC,EAAAxiC,EAAAi0B,eAAAr1B,EAAA7D,SAAAm6B,YACA,OAAAsN,KAAAnP,YAKA7nC,yBAAAoT,EAAA/E,EAAAk2E,GAAA,GACAz4C,EAAA,OAAuB,CACvB,IAAAy4C,GAA6BN,EAAStd,MAAAvzD,GACtC,OAAAA,EACA,IAAAnF,EAAAmF,EAAAnF,IAAApD,EAAA,KAEA,QAAAwI,EAAAD,EAAAhI,OAAqCiI,IAAA,CACrC,IAAAmB,EAAApB,EAAA9B,KAAA+B,GACA,GAAAhF,EAAA,EAAA+E,EAAAkH,WAAAjH,GAAAmB,EAAAxE,WAAAoD,EAAA7D,MAAA8D,GAAA,GACAxI,EAAA2J,EAAA9E,MAAArB,EAAA,EAAA+E,EAAAkH,WAAAjH,GAAAD,EAAA7D,MAAA8D,GAAA,GACA,MAEA,MAAAA,EACA,YAEApF,GAAAI,EACA,IAAAm2E,EAAApxE,EAAAe,IAAAb,QAAArF,GACA,GAAoBg2E,EAAStd,MAAA6d,GAC7B,OAAAA,EAGA,OAAmB,CACnB,IAAA73B,EAAAt+C,EAAA,EAAAxD,EAAAqJ,WAAArJ,EAAAwJ,UACA,IAAAs4C,EAAA,CACA,GAAA9hD,EAAAi9B,SAAAj9B,EAAAk2B,SAAwDz6B,EAAA,EAAam2C,aAAA5xC,GAAA,CACrEuI,IAAAe,IAAAb,QAAArF,EAAApD,EAAA8E,SAAAtB,GACAk2E,GAAA,EACA,SAAAz4C,EAEA,MAEAjhC,EAAA8hD,EACA1+C,GAAAI,EACA,IAAAm2E,EAAApxE,EAAAe,IAAAb,QAAArF,GACA,GAAoBg2E,EAAStd,MAAA6d,GAC7B,OAAAA,EAEA,cAIAP,EAASp7E,UAAA4P,SAAA,EACTwrE,EAAS9sE,SAAY8sE,EAASQ,kBAC9Bn+E,EAAA,EAASoS,OAAA,YAAqBurE,SACxBC,EACNlkF,YAAAiO,GACA3D,KAAA2D,MAEAjO,IAAA+V,GACA,WAAmBmuE,EAAWnuE,EAAArP,IAAA4D,KAAA2D,MAE9BjO,QAAAmU,GACA,IAAAf,EAAAe,EAAAb,QAAAhJ,KAAA2D,KACA,OAAeg2E,EAAStd,MAAAvzD,GAAA,IAAmB6wE,EAAS7wE,GAAS9M,EAAA,EAASqS,KAAAvF,IA+DtE,MAAA5M,EAAsBI,OAAAgS,EAAA,EAAAhS,EACtBiS,UAAAC,EAAA,YACAC,WAAAD,EAAA,WACAE,QAAAF,EAAA,WACAG,UAAAH,EAAA,YAEA,SAAAA,EAAA1K,EAAAC,GACA,MAAAmM,EAAA,QAAApM,EAAAC,EAAA,cAAAA,EAAA,iBACA,gBAAA9G,EAAAC,EAAAR,GACA,IAAA4M,EAAArM,EAAAmM,UACA4wB,EAAAj2B,EAAA,EAAAuF,EAAAkC,IAAAlC,EAAAiC,MAAA0uE,EAAA3wE,EAAAmD,MACA,GAAAnD,aAA2BtN,EAAA,EAAa,CACxC,IAAAU,EAAAyT,eAAAD,IAAA,GAAA8pB,EAAAl5B,MACA,SACAm5E,GAAA,EACAjgD,EAAA/8B,EAAA4M,IAAAb,QAAAjF,EAAA,EAAAi2B,EAAAtwB,QAAAswB,EAAA/wB,UAEA,IAAAmxE,EAAqBT,EAASQ,kBAAAngD,EAAAj2B,EAAAk2E,GAC9B,QAAAG,IAEAl9E,GACAA,EAAAD,EAAAuP,GAAAO,aAAA,IAA+C4sE,EAASS,MACxD,IAGA,SAAA/9D,EAAA3f,EAAAiH,EAAAlI,GACA,IAAAiB,MAAAkyD,SACA,SACA,IAAA9lD,EAAApM,EAAAO,MAAA4M,IAAAb,QAAArF,GACA,IAASg2E,EAAStd,MAAAvzD,GAClB,SACA,IAAAuxE,EAAA39E,EAAAykD,aAAqCh+C,KAAA1H,EAAAs6D,QAAA3yD,IAAA3H,EAAAu6D,UACrC,QAAAqkB,KAAAh4B,QAAA,GAA4CrmD,EAAA,EAAam2C,aAAAz1C,EAAAO,MAAA4M,IAAA5C,OAAAozE,EAAAh4B,YAEzD3lD,EAAAQ,SAAAR,EAAAO,MAAAuP,GAAAO,aAAA,IAAiD4sE,EAAS7wE,MAC1D,GAMA,SAAAqyD,EAAAz+D,EAAAjB,GACA,4BAAAA,EAAA+c,aAAA9b,EAAAO,MAAAmM,qBAAwFuwE,GACxF,SACA,IAAApuE,MAASA,GAAQ7O,EAAAO,MAAAmM,UACjB+xB,EAAA5vB,EAAArB,OAAAi0B,eAAA5yB,EAAAtG,SAAA08B,aAAAjlC,EAAAO,MAAAuL,OAAAE,MAAA/S,MACA,IAAAwlC,EACA,SACA,IAAAiG,EAAe90B,EAAA,EAAQG,MACvB,QAAAlS,EAAA4gC,EAAA9/B,OAAA,EAAmCd,GAAA,EAAQA,IAC3C6mC,EAAe90B,EAAA,EAAQnB,KAAAgwB,EAAA5gC,GAAA8R,cAAA,KAAA+0B,IACvB,IAAA50B,EAAA9P,EAAAO,MAAAuP,GAAAI,QAAArB,EAAA5H,IAAA4H,EAAA5H,IAAA,IAA6D2I,EAAA,EAAK80B,EAAA,MAGlE,OAFA50B,EAAAO,aAAoB/Q,EAAA,EAAaqS,KAAA7B,EAAA3C,IAAAb,QAAAuC,EAAA5H,IAAA,KACjCjH,EAAAQ,SAAAsP,IACA,EAEA,SAAA8tE,EAAAr9E,GACA,KAAAA,EAAAmM,qBAAqCuwE,GACrC,YACA,IAAA3yE,EAAAskB,SAAAb,cAAA,OAEA,OADAzjB,EAAAmZ,UAAA,wBACWo6D,EAAA,EAAah+E,OAAAU,EAAA4M,KAAoB0wE,EAAA,EAAUt1B,OAAAhoD,EAAAmM,UAAA0E,KAAA9G,GAAqCpK,IAAA,sFChNrF49E,EACN9kF,YAAAs1B,GAAAyvD,OACAA,EAAAC,UACAA,EAAAxwE,OACAA,EAAAlD,KACAA,EAAAtK,KACAA,EAAAm/D,YACAA,EAAA8e,OACAA,IAEA36E,KAAAgrB,YACAhrB,KAAAy6E,SACAz6E,KAAA06E,YACA16E,KAAAkK,SACAlK,KAAAgH,OACAhH,KAAAtD,OACAsD,KAAA67D,cACA77D,KAAAg7D,SAAAh7D,KAAAgH,KAAA2S,MACA3Z,KAAA46E,QAAA56E,KAAAg7D,OACAh7D,KAAA26E,OAAA36E,KAAA46E,OAAA56E,KAAA66E,WAAAF,EACA36E,KAAA86E,eAAA,EACA96E,KAAA0H,IAAA1H,KAAA+6E,YACA/6E,KAAAqrC,WAAArrC,KAAAg7E,GAAAC,MAAA7vE,QAGA1V,YACA,MAAAm0B,EAAsBqxD,EAAA,QAAGp0B,OAAA9mD,KAAAgrB,WACzB/uB,GACAw+E,OAAAz6E,KAAAy6E,OACAzzE,KAAAhH,KAAAgH,KACAtK,KAAAsD,KAAAtD,KACAi+E,OAAA,IAAA36E,KAAA26E,SACA9e,YAAA77D,KAAA67D,YACAsf,UAAA,EACA17E,QAAAO,KAAA06E,UAAAj7E,QACA27E,YAAAt1E,GAAA9F,KAAAo7E,YAAAt1E,IAeA,MAZA,mBAAA9F,KAAA06E,UAAA3tE,eACA/M,KAAA+M,aAAA/M,KAAA06E,UAAA3tE,cAGA,mBAAA/M,KAAA06E,UAAAllD,SACAx1B,KAAAw1B,OAAAx1B,KAAA06E,UAAAllD,QAGAx1B,KAAAg7E,GAAA,IAAAnxD,GACA3f,OAAAlK,KAAAkK,OACAmxE,UAAAp/E,IACKq/E,SACLt7E,KAAAg7E,GAAAO,IAGA7lF,OAAAsR,EAAA60D,GACA,OAAA70D,EAAA5H,OAAAY,KAAAgH,KAAA5H,OAIA4H,IAAAhH,KAAAgH,MAAAhH,KAAA67D,kBAIA77D,KAAAgH,OACAhH,KAAA67D,cACA77D,KAAAw7E,sBACAx0E,OACA60D,iBAEA,IAGAnmE,qBAAAuG,GACA,IAAA+D,KAAAg7E,GAAA7X,OACA,OAMA,MAAAsY,EAA2BP,EAAA,QAAGvkE,OAAAnX,OAC1B07E,EAAA,QAAGvkE,OAAAnX,QAAA,EACPlD,OAAAo/E,QAAAz/E,GAAAkV,QAAA,EAAAvU,EAAAkG,MACA9C,KAAAg7E,GAAA7X,OAAAvmE,GAAAkG,IAIIo4E,EAAA,QAAGvkE,OAAAnX,OAAAi8E,EAGP/lF,YAAAoQ,GACA,IAAA9F,KAAAtD,KAAAkyD,SACA,OAGA,MAAA3xD,MACAA,GACK+C,KAAAtD,MACL0C,KACAA,GACKY,KAAAgH,KACLrD,EAAA3D,KAAA26E,SACAgB,MAAsB37E,KAAAgH,KAAAlB,SACtBA,GAEA81E,EAAA57E,KAAA46E,OAAA39E,EAAAuP,GAAAqlC,WAAAluC,EAAAwH,KAAAxH,EAAAmJ,GAAA1N,GAAA4yC,QAAAruC,EAAAwH,KAAAxH,EAAAmJ,GAAA1N,EAAA7C,OAAAo/E,IAAA1+E,EAAAuP,GAAAoE,cAAAjN,EAAA,KAAAg4E,GACA37E,KAAAtD,KAAAQ,SAAA0+E,GAKAlmF,eAAAuxD,GAEA,oBAAAA,EAAA7nD,QAIAY,KAAAqrC,aAIArrC,KAAAqrC,WAAArpB,SAAAilC,EAAAhrC,SAIAvmB,UAAA+F,GACA,sBAAAuE,KAAA06E,UAAAnzB,UACA,OAAAvnD,KAAA06E,UAAAnzB,UAAA9rD,GAGA,MAAAwd,IAAAjZ,KAAA06E,UAAAlyE,OAAAyQ,UAEA,GAAAA,GAAA,cAAAxd,EAAA2D,KAAA,CACA,MAAAy8E,EAAApgF,EAAAwgB,OAAAqkC,SAAA7kD,EAAAwgB,OAAAqkC,QAAA,sBACAu7B,IAAA77E,KAAA0H,MAAAm0E,GAAA77E,KAAA0H,IAAAsa,SAAA65D,MAGA77E,KAAA86E,eAAA,EACAxvD,SAAAuI,iBAAA,eACA7zB,KAAA86E,eAAA,IAEAgB,MAAA,KAKA,MAAAC,EAAA,SAAAtgF,EAAA2D,KACA48E,EAAA,UAAAvgF,EAAA2D,KACA68E,EAAA,QAAAxgF,EAAA2D,KACA88E,EAAAzgF,EAAA2D,KAAAyvB,WAAA,kBAAApzB,EAAA2D,KAEA,QAAA6Z,GAAAijE,GAAAH,GAAAC,GAAAC,IAIAj8E,KAAA86E,cAGAplF,aACAsK,KAAAw7E,sBACAL,UAAA,IAIAzlF,eACAsK,KAAAw7E,sBACAL,UAAA,IAIAzlF,aACA,MAAAiO,EAAA3D,KAAAtD,KAAAy/E,SAAAn8E,KAAA0H,KACA00E,EAAAp8E,KAAAtD,KAAAO,MAAA4M,IAAAb,QAAArF,GAEA,OADkBrH,OAAAggB,EAAA,EAAAhgB,CAAY8/E,EAAAp8E,KAAAgH,KAAA5H,MAI9B1J,UACAsK,KAAAg7E,GAAAqB,kBAKA1tC,EAEAj5C,GAAA+F,EAAA6gF,GASA,OARAt8E,KAAAu8E,WAAAv8E,KAAAu8E,eAEAv8E,KAAAu8E,WAAA9gF,KACAuE,KAAAu8E,WAAA9gF,OAGAuE,KAAAu8E,WAAA9gF,GAAAwG,KAAAq6E,GAEAt8E,KAGAtK,KAAA+F,KAAAkoB,GACA3jB,KAAAu8E,WAAAv8E,KAAAu8E,eACA,MAAAC,EAAAx8E,KAAAu8E,WAAA9gF,GAMA,OAJA+gF,GACAA,EAAArrE,QAAA7S,KAAAqZ,MAAA3X,KAAA2jB,IAGA3jB,KAMAtK,IAAA+F,EAAA6gF,GACA,GAAA1+D,UAAAviB,OAEK,CAEL,MAAAmhF,EAAAx8E,KAAAu8E,WAAAv8E,KAAAu8E,WAAA9gF,GAAA,KAEA+gF,IACAF,EACAt8E,KAAAu8E,WAAA9gF,GAAA+gF,EAAAxxE,OAAAwkB,OAAA8sD,UAEAt8E,KAAAu8E,WAAA9gF,SATAuE,KAAAu8E,cAcA,OAAAv8E,YAKAy8E,EACA/mF,YAAA+J,MACAO,KAAAP,YAAoBO,KAAA+Z,kBACpBta,GAIA/J,OACA,YAGAA,WAAA+kF,EAAA,MACAz6E,KAAAy6E,SAGA3/E,WACA,YAGAsE,WACA,kBAGA2a,qBACA,SAGA1C,cACA,SAGA3hB,aACA,SAGAA,aACA,SAGAA,OACA,gBAKMgnF,EACNhnF,YAAAinF,KAAAlC,GACAkC,EAAAxrE,QAAAupE,IACAA,EAAAkC,WAAAnC,GACAC,EAAAhjE,SAEA1X,KAAA28E,aAGAj0E,YACA,OAAA1I,KAAA28E,WAAA3xE,OAAA0vE,GAAA,SAAAA,EAAAt7E,MAAA+a,OAAA,CAAAzR,GACA5N,OACA0N,iBACYE,EACZhT,CAAAoF,GAAA0N,QAIA/I,cACA,MAAA/C,KACAA,GACKsD,KACL,OAAAA,KAAA28E,WAAAxiE,OAAA,CAAAzR,EAAAgyE,SAA0DhyE,EAC1DhT,CAAAglF,EAAA5/E,MAAA,IAAA+hF,MAAAnC,EAAAj7E,SACA/J,IAAA8oB,EAAAhiB,EAAAsG,GACA,MAAAynD,EAAA/rC,EAAAhiB,KAAAsG,EASA,OARAxG,OAAAmf,OAAA+C,GACA9oB,CAAA8G,GAAAsG,IAGAynD,GACA7tD,EAAA4mD,YAAA5mD,EAAAO,QAGA,WAOA0c,YACA,OAAA3Z,KAAA28E,WAAA3xE,OAAA0vE,GAAA,SAAAA,EAAAt7E,MAAA+a,OAAA,CAAAR,GACA7e,OACA0N,iBACYmR,EACZjkB,CAAAoF,GAAA0N,QAIA6O,cACA,OAAArX,KAAA28E,WAAA3xE,OAAA0vE,KAAArjE,SAAA8C,OAAA,CAAA2iE,GACAzlE,iBACKylE,KAAAzlE,OAGL3hB,SAAA8S,OACAA,IAEA,MAAAu0E,EAAA/8E,KAAA28E,WAAA3xE,OAAA0vE,IAAA,aAAAj1D,SAAAi1D,EAAAt7E,OAAA4L,OAAA0vE,KAAAv1D,MAAA/oB,IAAAs+E,KAAAv1D,MACA3c,YAEAw0E,EAAAh9E,KAAA28E,WAAA3xE,OAAA0vE,IAAA,eAAAj1D,SAAAi1D,EAAAt7E,OAAA4L,OAAA0vE,KAAAv1D,MAAA/oB,IAAAs+E,KAAAv1D,MACA/lB,KAAAoJ,KAAsBkyE,EAAAt7E,SAAes7E,EAAA5/E,MACrC0N,YAEA,UAAAu0E,KAAAC,GAAA5gF,IAAA+oB,GAAiE7oB,OAAAgS,EAAA,EAAAhS,CAAM6oB,IAGvEzvB,YAAA8S,OACAA,EAAAy0E,mBACAA,IAEA,KAAAA,aAAAx4D,QAAAw4D,EAAA,SACA,MAAAC,EAAAD,aAAAx4D,MAAAzkB,KAAA28E,WAAA3xE,OAAA0vE,IAAAuC,EAAAx3D,SAAAi1D,EAAA5/E,OAAAkF,KAAA28E,WACAQ,EAAAD,EAAAlyE,OAAA0vE,IAAA,aAAAj1D,SAAAi1D,EAAAt7E,OAAA4L,OAAA0vE,KAAArU,YAAAjqE,IAAAs+E,KAAArU,YACA79D,YAEA40E,EAAAF,EAAAlyE,OAAA0vE,IAAA,eAAAj1D,SAAAi1D,EAAAt7E,OAAA4L,OAAA0vE,KAAArU,YAAAjqE,IAAAs+E,KAAArU,YACAjnE,KAAAoJ,KAAsBkyE,EAAAt7E,SAAes7E,EAAA5/E,MACrC0N,YAEA,UAAA20E,KAAAC,GAAAjjE,OAAA,CAAAkjE,EAAAhX,QAAAgX,KAAAhX,OAGA3wE,YAAA8S,OACAA,EAAAy0E,mBACAA,IAEA,KAAAA,aAAAx4D,QAAAw4D,EAAA,SACA,MAAAC,EAAAD,aAAAx4D,MAAAzkB,KAAA28E,WAAA3xE,OAAA0vE,IAAAuC,EAAAx3D,SAAAi1D,EAAA5/E,OAAAkF,KAAA28E,WACAW,EAAAJ,EAAAlyE,OAAA0vE,IAAA,aAAAj1D,SAAAi1D,EAAAt7E,OAAA4L,OAAA0vE,KAAA6C,YAAAnhF,IAAAs+E,KAAA6C,YACA/0E,YAEAg1E,EAAAN,EAAAlyE,OAAA0vE,IAAA,eAAAj1D,SAAAi1D,EAAAt7E,OAAA4L,OAAA0vE,KAAA6C,YAAAnhF,IAAAs+E,KAAA6C,YACAn+E,KAAAoJ,KAAsBkyE,EAAAt7E,SAAes7E,EAAA5/E,MACrC0N,YAEA,UAAA80E,KAAAE,GAAArjE,OAAA,CAAAsjE,EAAAF,QAAAE,KAAAF,OAGA7nF,UAAA8S,OACAA,EAAA9L,KACAA,IAEA,OAAAsD,KAAA28E,WAAA3xE,OAAA0vE,KAAAzoC,UAAA93B,OAAA,CAAAujE,EAAAhD,KACA,MAAA5/E,KACAA,EAAAsE,KACAA,GACOs7E,EACPzoC,KACAnvC,EAAA43E,EAAAzoC,UACAzpC,aACA,eAAAid,SAAArmB,IACAA,KAAAoJ,KAA0BpJ,MAAKtE,SAI/B6c,EAAA,CAAA6X,EAAA1pB,MACApJ,EAAAkyD,WAIAlyD,EAAA6mD,QACA/zB,EAAA1pB,EAAA0pB,CAAA9yB,EAAAO,MAAAP,EAAAQ,SAAAR,IAGAihF,EAAA,CAAAC,EAAAC,KACAp5D,MAAAC,QAAAm5D,GACA5rC,EAAA2rC,GAAA93E,IAAA+3E,EAAA1sE,QAAA7S,GAAAqZ,EAAArZ,EAAAwH,KACS,mBAAA+3E,IACT5rC,EAAA2rC,GAAA93E,IAAA6R,EAAAkmE,EAAA/3E,MAYA,MARA,iBAAAhD,EACAxG,OAAAo/E,QAAA54E,GAAAqO,QAAA,EAAA2sE,EAAAC,MACAJ,EAAAG,EAAAC,KAGAJ,EAAA7iF,EAAAgI,OAGc46E,KACdzrC,eA2BAzZ,UAAAikD,EACA/mF,YAAA+J,MACA6L,MAAA7L,GAGAL,WACA,aAGA1C,WACA,YAGA8L,aACA,YAGA9S,UACA,cAKA,SAAAsoF,EAAAl7E,EAAA,EAAA8B,EAAA,EAAAC,EAAA,GACA,OAAAF,KAAAC,IAAAD,KAAAE,IAAAoxC,SAAAnzC,EAAA,IAAA8B,GAAAC,SAGAw4B,UAAAo/C,EACA/mF,YAAA+J,MACA6L,MAAA7L,GAGAL,WACA,aAGA1C,WACA,YAGA8L,aACA,YAGA9S,UACA,oBAKAuoF,UAAA5gD,EACAviC,WACA,YAGA0N,aACA,OACA4C,QAAA,iBAMM8yE,UAAS7gD,EACfviC,WACA,kBAGA0N,aACA,OACA4C,QAAA,UACA2N,MAAA,QACAE,WAAA,EACAC,WACAC,IAAA,MAEAC,MAAA,aAIA1jB,UAAA0J,KACAA,IAEA,UAAiB9C,OAAA+c,EAAA,EAAA/c,CAAY8C,UAK7B++E,UAAA9gD,EACAviC,WACA,aAGA0N,aACA,OACAuQ,MAAA,WAMA,IAAAqlE,EAAA,q7BAEMC,UAAM1vC,EACZj5C,YAAA+J,MACA6L,QACAtL,KAAA+Z,gBACAukE,eACA1vB,UAAA,EACA2vB,UAAA,KACA5B,cACAvxE,QAAA,GACAw4B,QAAA,MACA46C,eACAp/E,KAAA,MACAgM,UACAhM,KAAA,eAGAq/E,sBAAA,EACAC,mBAAA,EACAC,mBAAA,EACAC,cACAC,kBAAA,EACAC,iBAAA,EACAC,gBACAC,WAAA,EACAC,OAAA,OACAC,cAAA,OACAC,SAAA,OACAC,QAAA,OACAC,OAAA,OACAC,QAAA,OACAC,OAAA,QAEAv/E,KAAA0V,QAAA,6DACA1V,KAAA0X,KAAAjY,GAGA/J,KAAA+J,MACAO,KAAAN,eAAqBM,KAAA+Z,kBACrBta,IAEAO,KAAAo2D,SAAA,EACAp2D,KAAAoJ,WACA+B,KAAA,EACA2B,GAAA,GAEA9M,KAAAsyB,QAAAhH,SAAAb,cAAA,OACAzqB,KAAA28E,WAAA38E,KAAAw/E,mBACAx/E,KAAA0I,MAAA1I,KAAAy/E,cACAz/E,KAAA2Z,MAAA3Z,KAAA0/E,cACA1/E,KAAAwI,OAAAxI,KAAA2/E,eACA3/E,KAAAqX,QAAArX,KAAA4/E,gBACA5/E,KAAA6/E,QAAA7/E,KAAA8/E,gBACA9/E,KAAAqmE,WAAArmE,KAAA+/E,mBACA//E,KAAAu9E,WAAAv9E,KAAAggF,mBACAhgF,KAAAtD,KAAAsD,KAAAigF,aACAjgF,KAAAiyC,SAAAjyC,KAAAkgF,iBACAlgF,KAAAmgF,yBAEAngF,KAAAP,QAAAu/E,WArLA,SAAAZ,GACqC,CACrC,MAAA7iE,EAAA+P,SAAAb,cAAA,SACAlP,EAAAnc,KAAA,WACAmc,EAAAsX,YAAAurD,EACA,MAAAtwE,KACAA,GACKwd,UACL1hB,WACAA,GACKkE,EAELlE,EACAkE,EAAAi9C,aAAAxvC,EAAA3R,GAEAkE,EAAA08B,YAAAjvB,IAuKAyjE,CAAAZ,GAGA,OAAAp+E,KAAAP,QAAA8+E,WACAv+E,KAAAujD,MAAAvjD,KAAAP,QAAA8+E,WAGAv+E,KAAA0V,OAAAvE,QAAArW,IACAkF,KAAAogF,GAAAtlF,EAAAkF,KAAAP;;;;;;AA7mBA,SAAAo9B,GACA,OAAAA,EAAAjwB,QAAA,uBAAAyzE,EAAAp7E,IAAA,IAAAA,EAAAo7E,EAAAh7D,cAAAg7D,EAAAjqC,eAAAxpC,QAAA,WA4mBA0zE,OAAiDxlF,OAAK,YAEtDkF,KAAAugF,KAAA,QACA7jF,KAAAsD,KAAAtD,KACAO,MAAA+C,KAAA/C,QAGA+C,KAAA28E,WAAAjgF,KAAAsD,KAAAtD,KAGAhH,WAAA+J,GACAO,KAAAP,YAAoBO,KAAAP,WACpBA,GAGAO,KAAAtD,MAAAsD,KAAA/C,OACA+C,KAAAtD,KAAA4mD,YAAAtjD,KAAA/C,OAIAujF,wBACA,OAAAxgF,KAAAP,QAAAg/E,sBAIA,IAAAR,EAAA,IAAAE,EAAA,IAAuCD,MAGvCjhF,YACA,OAAA+C,KAAAtD,KAAAsD,KAAAtD,KAAAO,MAAA,KAGAvH,mBACA,WAAegnF,MAAgB18E,KAAAwgF,qBAAAxgF,KAAAP,QAAAk9E,YAAA38E,MAG/BtK,gBACA,OAAAsK,KAAA28E,WAAAtlE,QAGA3hB,gBACA,OAAAsK,KAAA28E,WAAAkD,SACAr3E,OAAAxI,KAAAwI,SAIA9S,mBACA,OAAAsK,KAAA28E,WAAAtW,YACA79D,OAAAxI,KAAAwI,OACAy0E,mBAAAj9E,KAAAP,QAAAi/E,oBAIAhpF,mBACA,OAAAsK,KAAA28E,WAAAY,YACA/0E,OAAAxI,KAAAwI,OACAy0E,mBAAAj9E,KAAAP,QAAAk/E,oBAIAjpF,iBACA,OAAAsK,KAAA28E,WAAA1qC,UACAzpC,OAAAxI,KAAAwI,OACA9L,KAAAsD,KAAAtD,OAIAhH,cACA,OAAAsK,KAAA28E,WAAAj0E,MAGAhT,cACA,OAAAsK,KAAA28E,WAAAhjE,MAGAjkB,eACA,WAAe4W,EAAA,GACfs3B,QAAA5jC,KAAAP,QAAAmkC,QACAl7B,MAAA1I,KAAA0I,MACAiR,MAAA3Z,KAAA2Z,QAIAjkB,cACA,OAAWsG,EAAA,EAAWO,QACtBiM,OAAAxI,KAAAwI,OACAqB,IAAA7J,KAAAygF,eAAAzgF,KAAAP,QAAA2L,SACAiM,YAAArX,KAAAqX,QAAiC/a,OAAAowE,EAAA,EAAApwE,EACjC6qB,MAAAnnB,KAAAqmE,gBACOrmE,KAAAu9E,cAAAv9E,KAAA6/E,QAAwCvjF,OAAAgS,EAAA,EAAAhS,EAC/C2S,UAAmBy9D,EAAA,IACTpwE,OAAAgS,EAAA,EAAAhS,CAAOokF,EAAA,MAAU1gF,KAAAP,QAAAo/E,kBF/sB3B,SAAAp/E,MACA,WAAezD,EAAA,GACfU,KAAAm8E,GAA0B,IAAYD,EAAcC,EAAAp5E,KE6sBem/E,CAAU5+E,KAAAP,QAAAm/E,mBAAA5+E,KAAAP,QAAAq/E,iBD7jB7E,IAAe9iF,EAAA,GACfC,OACA4/D,YAAAye,EACAqG,uBAAA,CAAAC,EAAAn3E,EAAAN,IACAM,EAAA9F,KAAAwF,EAAAxF,KAAmDg2E,EAAStd,MAAAlzD,GAAA,IAAoBwwE,EAASxwE,GAAA,KAEzFkT,cACAngB,gBACAqc,iBAA8B4iD,sBCqjB8H,IAAen/D,EAAA,GAC3KY,IAAA,IAAiBZ,EAAA,EAAS,YAC1BC,OACA2yD,SAAA,IAAA5uD,KAAAP,QAAAmvD,YAEO,IAAO5yD,EAAA,GACdC,OACAyvB,YACAm1D,SAAA,GAEAtoE,iBACAgrC,MAAA,CAAA7mD,EAAAjB,KACAuE,KAAAo2D,SAAA,EACAp2D,KAAAugF,KAAA,SACA9kF,QACAwB,MAAAP,EAAAO,MACAP,SAEA,MAAAk/E,EAAA57E,KAAA/C,MAAAuP,GAAAyK,QAAA,cACAjX,KAAAtD,KAAAQ,SAAA0+E,IAEA7hB,KAAA,CAAAr9D,EAAAjB,KACAuE,KAAAo2D,SAAA,EACAp2D,KAAAugF,KAAA,QACA9kF,QACAwB,MAAAP,EAAAO,MACAP,SAEA,MAAAk/E,EAAA57E,KAAA/C,MAAAuP,GAAAyK,QAAA,cACAjX,KAAAtD,KAAAQ,SAAA0+E,QAIO,IAAO5/E,EAAA,GACdC,MAAA+D,KAAAP,QAAA6+E,iBAKA5oF,eAAA0V,EAAA2zE,EAAA/+E,KAAAP,QAAAs/E,cACA,UAAA3zE,EACA,OAAApL,KAAAwI,OAAA2vB,aAAAn4B,KAAAP,QAAA++E,eAGA,oBAAApzE,EACA,IACA,OAAApL,KAAAwI,OAAA2vB,aAAA/sB,GACO,MAAAmhB,GAEP,OADAhqB,QAAA4nB,KAAA,kDAAA/e,EAAA,SAAAmhB,GACAvsB,KAAAwI,OAAA2vB,aAAAn4B,KAAAP,QAAA++E,eAIA,oBAAApzE,EAAA,CACA,MAAA01E,UAAiC11E,UAEjCknB,GADA,IAAA5V,OAAAooB,WACAi8C,gBAAAD,EAAA,aAAApgF,KAAAsgF,kBACA,OAAa10E,EAAA,EAAS05B,WAAAhmC,KAAAwI,QAAAtJ,MAAAozB,EAAAysD,GAGtB,SAGArpF,aACA,WAAe6kF,EAAA,EAAUv6E,KAAAsyB,SACzBr1B,MAAA+C,KAAAihF,cACAC,YAAA,IAAAv9D,KACA3jB,KAAAugF,KAAA,WAAA58D,IAEAw9D,WAAA,IAAAx9D,KACA3jB,KAAAugF,KAAA,UAAA58D,IAEAsiD,oBAAAjmE,KAAAimE,oBAAAzxC,KAAAx0B,QAIAtK,mBAAAs1B,EAAA,MACAA,GAIAhrB,KAAAtD,KAAA0kF,UACAr5B,UAAA/nD,KAAAqhF,eACAn3E,OAAA8gB,EACA2xD,eAAA38E,KAAAwgF,qBAAAxgF,KAAAP,QAAAk9E,gBAKAjnF,eAAAwU,OACAA,EAAAyyE,WACAA,IAEA,OAAAA,EAAA3xE,OAAA0vE,IAAA,eAAAj1D,SAAAi1D,EAAAt7E,OAAA4L,OAAA0vE,KAAAh+E,MAAAyd,OAAA,CAAA4tC,EAAA2yB,KAcA,UAAc3yB,EACdryD,CAAAglF,EAAA5/E,MAdA,CAAAkM,EAAAtK,EAAAi+E,EAAA9e,KACA,MAAA7wC,EAAA0vD,EAAAh+E,KACA,WAAmB89E,EAAaxvD,GAChCyvD,OAAAz6E,KACA06E,YACAxwE,SACAlD,OACAtK,OACAi+E,SACA9e,uBAUAnmE,oBAAAkmF,GACA,MAAAphC,EAAAx6C,KAAA/C,MAAA0a,MAAAikE,GACA57E,KAAAtD,KAAA4mD,YAAA9I,GACAx6C,KAAAoJ,WACA+B,KAAAnL,KAAA/C,MAAAmM,UAAA+B,KACA2B,GAAA9M,KAAA/C,MAAAmM,UAAA0D,IAEA9M,KAAAmgF,yBACAngF,KAAAugF,KAAA,eACAe,QAAAthF,KAAAshF,QAAA9sD,KAAAx0B,MACAuhF,QAAAvhF,KAAAuhF,QAAA/sD,KAAAx0B,MACA/C,MAAA+C,KAAA/C,MACA2+E,gBAGAA,EAAA7rE,aAAA6rE,EAAA7jE,QAAA,kBAIA/X,KAAAwhF,WAAA5F,GAGAlmF,WAAAkmF,GACA57E,KAAAugF,KAAA,UACAe,QAAAthF,KAAAshF,QAAA9sD,KAAAx0B,MACAuhF,QAAAvhF,KAAAuhF,QAAA/sD,KAAAx0B,MACA/C,MAAA+C,KAAA/C,MACA2+E,gBAIAlmF,iBAAA2wB,EAAA,MACA,GAAArmB,KAAAoJ,WAAA,OAAAid,EACA,OAAArmB,KAAAoJ,UAGA,aAAAid,IAAA,IAAAA,EACA,OACAlb,KAAA,EACA2B,GAAA,GAIA,WAAAuZ,EAAA,CACA,MAAAxc,IACAA,GACO7J,KAAA/C,MACP,OACAkO,KAAAtB,EAAAuB,QAAAC,KACAyB,GAAAjD,EAAAuB,QAAAC,MAIA,OACAF,KAAAkb,EACAvZ,GAAAuZ,GAIA3wB,MAAA2wB,EAAA,MACA,GAAArmB,KAAAtD,KAAA05D,SAAA,OAAA/vC,IAAA,IAAAA,EACA,OAGA,MAAAlb,KACAA,EAAA2B,GACAA,GACK9M,KAAA4hE,iBAAAv7C,GACLrmB,KAAA+M,aAAA5B,EAAA2B,GACAsjD,WAAA,IAAApwD,KAAAtD,KAAA6mD,QAAA,IAGA7tD,aAAAyV,EAAA,EAAA2B,EAAA,GACA,MAAAjD,IACAA,EAAA2C,GACAA,GACKxM,KAAA/C,MACLwkF,EAAAzD,EAAA7yE,EAAA,EAAAtB,EAAAuB,QAAAC,MACAq2E,EAAA1D,EAAAlxE,EAAA,EAAAjD,EAAAuB,QAAAC,MACAjC,EAAsBpN,EAAA,EAAaO,OAAAsN,EAAA43E,EAAAC,GACnC9F,EAAApvE,EAAAO,aAAA3D,GACApJ,KAAAtD,KAAAQ,SAAA0+E,GAGAlmF,OACAsK,KAAAtD,KAAAgL,IAAAqyD,OAGArkE,gBACA,OAAAkrB,KAAA1hB,MAAA0hB,KAAAC,WACAnY,MAAA1I,KAAA28E,WAAAj0E,MACAiR,MAAA3Z,KAAA28E,WAAAhjE,SAIAjkB,UACA,MAAA8wC,EAAAlb,SAAAb,cAAA,OACAle,EAAqBD,EAAA,EAAa05B,WAAAhmC,KAAAwI,QAAAskC,kBAAA9sC,KAAA/C,MAAA4M,IAAAuB,SAElC,OADAo7B,EAAAgE,YAAAj+B,GACAi6B,EAAA5b,UAGAl1B,UACA,OAAAsK,KAAA/C,MAAA4M,IAAAouB,SAGAviC,WAAA0V,KAAyBo2E,GAAA,EAAAzC,GACzB,MAAAl1E,IACAA,EAAA2C,GACAA,GACKxM,KAAA/C,MACLquB,EAAAtrB,KAAAygF,eAAAr1E,EAAA2zE,GACA31E,EAAsBpN,EAAA,EAAaO,OAAAsN,EAAA,EAAAA,EAAAuB,QAAAC,MACnCuwE,EAAApvE,EAAAO,aAAA3D,GAAAkR,qBAAAgR,GAAA,GAAArU,QAAA,iBAAAuqE,GACAxhF,KAAAtD,KAAAQ,SAAA0+E,GAGAlmF,aAAA8rF,GAAA,GACAxhF,KAAA2hF,WAAA3hF,KAAAP,QAAA++E,cAAAgD,GAGA9rF,yBACAsK,KAAAuoC,YAAAjsC,OAAAo/E,QAAA17E,KAAAwI,OAAAmR,OAAAQ,OAAA,CAAAR,GAAA7e,EAAA8iC,UAA2FjkB,EAC3FjkB,CAAAoF,GAAA,CAAAgL,OAA8BxJ,OAAAggB,EAAA,EAAAhgB,CAAY0D,KAAA/C,MAAA2gC,EAAA93B,SAE1C9F,KAAA4hF,gBAAAtlF,OAAAo/E,QAAA17E,KAAAwI,OAAAmR,OAAAQ,OAAA,CAAAR,GAAA7e,EAAA8iC,UAA+FjkB,EAC/FjkB,CAAAoF,GAAcwB,OAAAggB,EAAA,EAAAhgB,CAAY0D,KAAA/C,MAAA2gC,SAE1B59B,KAAA6hF,YAAAvlF,OAAAo/E,QAAA17E,KAAAwI,OAAAE,OAAAyR,OAAA,CAAAzR,GAAA5N,EAAAkM,UAA2F0B,EAC3FhT,CAAAoF,GAAA,CAAAgL,OAA8BxJ,OAAAggB,EAAA,EAAAhgB,CAAY0D,KAAA/C,MAAA+J,EAAAlB,SAI1CpQ,aAAA0J,EAAA,MACA,OAAAY,KAAA4hF,gBAAAxiF,GAGA1J,aAAA0J,EAAA,MACA,UAAgB9C,OAAAggB,EAAA,EAAAhgB,CAAY0D,KAAA/C,MAAA+C,KAAAwI,OAAAE,MAAAtJ,KAI5B0iF,eACA,OAAAxlF,OAAAo/E,YAA2B17E,KAAAuoC,eAC3BvoC,KAAA6hF,cACK1nE,OAAA,CAAA5J,GAAAzV,EAAAgI,UAAqCyN,EAC1C7a,CAAAoF,GAAA,CAAAgL,OAAyBhD,EAAAgD,SAIzBpQ,eAAAk+B,EAAA,KAAAmuD,GACA,MAAA1qE,EAAA,mBAAA0qE,IAAAnuD,EAAA5zB,KAAA/C,MAAAoa,UAAAuc,KAAA5zB,KAAA/C,MAAAoa,SACAmjC,EAAAx6C,KAAA/C,MAAA+kF,aACA3qE,YAEArX,KAAAtD,KAAA4mD,YAAA9I,GAGA9kD,iBAAAoF,EAAA,MACA,IAAAA,IAAAkF,KAAAtD,KAAAolD,QACA,OAGA,MAAAtH,EAAAx6C,KAAA/C,MAAA+kF,aACA3qE,QAAArX,KAAA/C,MAAAoa,QAAArM,OAAA4oB,MAAAh3B,IAAAiyB,cAA6E/zB,SAE7EkF,KAAAtD,KAAA4mD,YAAA9I,GAGA9kD,UACAsK,KAAAtD,MAIAsD,KAAAtD,KAAA0oD,WAKA,IAAA68B,GACAhmF,OACAw+E,QACAvgE,QAAA,KACA9a,KAAA9C,SAGA4lF,OACAzH,QACA0H,WAAA,EAEAzsF,QAAA+kF,GACAA,KAAAnoD,SACAtyB,KAAAoiF,UAAA,KACApiF,KAAAu7E,IAAA/wC,YAAAiwC,EAAAnoD,QAAA1oB,YACA6wE,EAAA4H,mBAAAriF,WAQA8rB,OAAArB,GACAA,EAAA,OAGA/0B,gBACAsK,KAAAy6E,OAAAnoD,QAAAtyB,KAAAu7E,YAKA+G,EACA5sF,aAAA+J,QACAA,IAEAO,KAAAP,UACAO,KAAAuiF,aAAA,EAEAviF,KAAAwiF,iBAAAxiF,KAAAqc,YAAAmY,KAAAx0B,MACAA,KAAAP,QAAA6yB,QAAAuB,iBAAA,YAAA7zB,KAAAwiF,kBACAC,SAAA,IAGAziF,KAAA0iF,YAAA,MACA1iF,KAAAuiF,YACAviF,KAAAuiF,aAAA,EAIAviF,KAAAP,QAAAg7E,OAAA8F,KAAA,4BAGAvgF,KAAAP,QAAAg7E,OAAA2F,GAAA,OAAApgF,KAAA0iF,aAGAhtF,cACAsK,KAAAuiF,aAAA,EAGA7sF,UACAsK,KAAAP,QAAA6yB,QAAA49B,oBAAA,YAAAlwD,KAAAwiF,kBACAxiF,KAAAP,QAAAg7E,OAAAr9B,IAAA,OAAAp9C,KAAA0iF,cAmBA,IAAAC,GACA1mF,OACAw+E,QACAvgE,QAAA,KACA9a,KAAA9C,SAIA+iB,KAAA,MAEA+2C,SAAA,IAIA8rB,OACAzH,QACA0H,WAAA,EAEAzsF,QAAA+kF,GACAA,GACAz6E,KAAAoiF,UAAA,KACA3H,EAAAmI,eAnCA,SAAAnjF,GACA,WAAazD,EAAA,GACbY,IAAA,IAAaZ,EAAA,EAAS,YAEtBU,KAAAm8E,GACA,IAAAyJ,GACAzJ,aACAp5E,cA4BAojF,EACApI,SACAnoD,QAAAtyB,KAAAu7E,OAEAv7E,KAAAo2D,QAAAqkB,EAAArkB,QACAqkB,EAAA2F,GAAA,aACApgF,KAAAo2D,SAAA,IAEAqkB,EAAA2F,GAAA,sBAAAhqB,IACAp2D,KAAAo2D,iBASA1gE,SACA,OAAAsK,KAAAy6E,OAIAz6E,KAAA8iF,aAAA5oE,SACAk8C,QAAAp2D,KAAAo2D,QACA7S,MAAAvjD,KAAAy6E,OAAAl3B,MACAtR,SAAAjyC,KAAAy6E,OAAAxoC,SACA6vC,SAAA9hF,KAAAy6E,OAAAqH,SACAnX,aAAA3qE,KAAAy6E,OAAA9P,aAAAn2C,KAAAx0B,KAAAy6E,QACA1P,aAAA/qE,KAAAy6E,OAAA1P,aAAAv2C,KAAAx0B,KAAAy6E,UATA,OAsNAn+E,OAIAguB,QA+MAhuB","file":"static/js/chunk-0e2d.04760e2c.js","sourcesContent":["/**\n * TextRenderer\n * returns only the textual part of the token\n */\nmodule.exports = class TextRenderer {\n // no need for block level renderers\n strong(text) {\n return text;\n }\n\n em(text) {\n return text;\n }\n\n codespan(text) {\n return text;\n }\n\n del(text) {\n return text;\n }\n\n html(text) {\n return text;\n }\n\n text(text) {\n return text;\n }\n\n link(href, title, text) {\n return '' + text;\n }\n\n image(href, title, text) {\n return '' + text;\n }\n\n br() {\n return '';\n }\n};\n","export var base = {\n 8: \"Backspace\",\n 9: \"Tab\",\n 10: \"Enter\",\n 12: \"NumLock\",\n 13: \"Enter\",\n 16: \"Shift\",\n 17: \"Control\",\n 18: \"Alt\",\n 20: \"CapsLock\",\n 27: \"Escape\",\n 32: \" \",\n 33: \"PageUp\",\n 34: \"PageDown\",\n 35: \"End\",\n 36: \"Home\",\n 37: \"ArrowLeft\",\n 38: \"ArrowUp\",\n 39: \"ArrowRight\",\n 40: \"ArrowDown\",\n 44: \"PrintScreen\",\n 45: \"Insert\",\n 46: \"Delete\",\n 59: \";\",\n 61: \"=\",\n 91: \"Meta\",\n 92: \"Meta\",\n 106: \"*\",\n 107: \"+\",\n 108: \",\",\n 109: \"-\",\n 110: \".\",\n 111: \"/\",\n 144: \"NumLock\",\n 145: \"ScrollLock\",\n 160: \"Shift\",\n 161: \"Shift\",\n 162: \"Control\",\n 163: \"Control\",\n 164: \"Alt\",\n 165: \"Alt\",\n 173: \"-\",\n 186: \";\",\n 187: \"=\",\n 188: \",\",\n 189: \"-\",\n 190: \".\",\n 191: \"/\",\n 192: \"`\",\n 219: \"[\",\n 220: \"\\\\\",\n 221: \"]\",\n 222: \"'\"\n}\n\nexport var shift = {\n 48: \")\",\n 49: \"!\",\n 50: \"@\",\n 51: \"#\",\n 52: \"$\",\n 53: \"%\",\n 54: \"^\",\n 55: \"&\",\n 56: \"*\",\n 57: \"(\",\n 59: \":\",\n 61: \"+\",\n 173: \"_\",\n 186: \":\",\n 187: \"+\",\n 188: \"<\",\n 189: \"_\",\n 190: \">\",\n 191: \"?\",\n 192: \"~\",\n 219: \"{\",\n 220: \"|\",\n 221: \"}\",\n 222: \"\\\"\"\n}\n\nvar chrome = typeof navigator != \"undefined\" && /Chrome\\/(\\d+)/.exec(navigator.userAgent)\nvar gecko = typeof navigator != \"undefined\" && /Gecko\\/\\d+/.test(navigator.userAgent)\nvar mac = typeof navigator != \"undefined\" && /Mac/.test(navigator.platform)\nvar ie = typeof navigator != \"undefined\" && /MSIE \\d|Trident\\/(?:[7-9]|\\d{2,})\\..*rv:(\\d+)/.exec(navigator.userAgent)\nvar brokenModifierNames = mac || chrome && +chrome[1] < 57\n\n// Fill in the digit keys\nfor (var i = 0; i < 10; i++) base[48 + i] = base[96 + i] = String(i)\n\n// The function keys\nfor (var i = 1; i <= 24; i++) base[i + 111] = \"F\" + i\n\n// And the alphabetic keys\nfor (var i = 65; i <= 90; i++) {\n base[i] = String.fromCharCode(i + 32)\n shift[i] = String.fromCharCode(i)\n}\n\n// For each code that doesn't have a shift-equivalent, copy the base name\nfor (var code in base) if (!shift.hasOwnProperty(code)) shift[code] = base[code]\n\nexport function keyName(event) {\n var ignoreKey = brokenModifierNames && (event.ctrlKey || event.altKey || event.metaKey) ||\n ie && event.shiftKey && event.key && event.key.length == 1 ||\n event.key == \"Unidentified\"\n var name = (!ignoreKey && event.key) ||\n (event.shiftKey ? shift : base)[event.keyCode] ||\n event.key || \"Unidentified\"\n // Edge sometimes produces wrong names (Issue #3)\n if (name == \"Esc\") name = \"Escape\"\n if (name == \"Del\") name = \"Delete\"\n // https://developer.microsoft.com/en-us/microsoft-edge/platform/issues/8860571/\n if (name == \"Left\") name = \"ArrowLeft\"\n if (name == \"Up\") name = \"ArrowUp\"\n if (name == \"Right\") name = \"ArrowRight\"\n if (name == \"Down\") name = \"ArrowDown\"\n return name\n}\n","import { keyName, base } from 'w3c-keyname';\nimport { Plugin } from 'prosemirror-state';\n\nconst mac = typeof navigator != \"undefined\" ? /Mac|iP(hone|[oa]d)/.test(navigator.platform) : false;\nfunction normalizeKeyName(name) {\n let parts = name.split(/-(?!$)/), result = parts[parts.length - 1];\n if (result == \"Space\")\n result = \" \";\n let alt, ctrl, shift, meta;\n for (let i = 0; i < parts.length - 1; i++) {\n let mod = parts[i];\n if (/^(cmd|meta|m)$/i.test(mod))\n meta = true;\n else if (/^a(lt)?$/i.test(mod))\n alt = true;\n else if (/^(c|ctrl|control)$/i.test(mod))\n ctrl = true;\n else if (/^s(hift)?$/i.test(mod))\n shift = true;\n else if (/^mod$/i.test(mod)) {\n if (mac)\n meta = true;\n else\n ctrl = true;\n }\n else\n throw new Error(\"Unrecognized modifier name: \" + mod);\n }\n if (alt)\n result = \"Alt-\" + result;\n if (ctrl)\n result = \"Ctrl-\" + result;\n if (meta)\n result = \"Meta-\" + result;\n if (shift)\n result = \"Shift-\" + result;\n return result;\n}\nfunction normalize(map) {\n let copy = Object.create(null);\n for (let prop in map)\n copy[normalizeKeyName(prop)] = map[prop];\n return copy;\n}\nfunction modifiers(name, event, shift) {\n if (event.altKey)\n name = \"Alt-\" + name;\n if (event.ctrlKey)\n name = \"Ctrl-\" + name;\n if (event.metaKey)\n name = \"Meta-\" + name;\n if (shift !== false && event.shiftKey)\n name = \"Shift-\" + name;\n return name;\n}\n/**\nCreate a keymap plugin for the given set of bindings.\n\nBindings should map key names to [command](https://prosemirror.net/docs/ref/#commands)-style\nfunctions, which will be called with `(EditorState, dispatch,\nEditorView)` arguments, and should return true when they've handled\nthe key. Note that the view argument isn't part of the command\nprotocol, but can be used as an escape hatch if a binding needs to\ndirectly interact with the UI.\n\nKey names may be strings like `\"Shift-Ctrl-Enter\"`—a key\nidentifier prefixed with zero or more modifiers. Key identifiers\nare based on the strings that can appear in\n[`KeyEvent.key`](https:developer.mozilla.org/en-US/docs/Web/API/KeyboardEvent/key).\nUse lowercase letters to refer to letter keys (or uppercase letters\nif you want shift to be held). You may use `\"Space\"` as an alias\nfor the `\" \"` name.\n\nModifiers can be given in any order. `Shift-` (or `s-`), `Alt-` (or\n`a-`), `Ctrl-` (or `c-` or `Control-`) and `Cmd-` (or `m-` or\n`Meta-`) are recognized. For characters that are created by holding\nshift, the `Shift-` prefix is implied, and should not be added\nexplicitly.\n\nYou can use `Mod-` as a shorthand for `Cmd-` on Mac and `Ctrl-` on\nother platforms.\n\nYou can add multiple keymap plugins to an editor. The order in\nwhich they appear determines their precedence (the ones early in\nthe array get to dispatch first).\n*/\nfunction keymap(bindings) {\n return new Plugin({ props: { handleKeyDown: keydownHandler(bindings) } });\n}\n/**\nGiven a set of bindings (using the same format as\n[`keymap`](https://prosemirror.net/docs/ref/#keymap.keymap)), return a [keydown\nhandler](https://prosemirror.net/docs/ref/#view.EditorProps.handleKeyDown) that handles them.\n*/\nfunction keydownHandler(bindings) {\n let map = normalize(bindings);\n return function (view, event) {\n let name = keyName(event), isChar = name.length == 1 && name != \" \", baseName;\n let direct = map[modifiers(name, event, !isChar)];\n if (direct && direct(view.state, view.dispatch, view))\n return true;\n if (isChar && (event.shiftKey || event.altKey || event.metaKey || name.charCodeAt(0) > 127) &&\n (baseName = base[event.keyCode]) && baseName != name) {\n // Try falling back to the keyCode when there's a modifier\n // active or the character produced isn't ASCII, and our table\n // produces a different name from the the keyCode. See #668,\n // #1060\n let fromCode = map[modifiers(baseName, event, true)];\n if (fromCode && fromCode(view.state, view.dispatch, view))\n return true;\n }\n else if (isChar && event.shiftKey) {\n // Otherwise, if shift is active, also try the binding with the\n // Shift- prefix enabled. See #997\n let withShift = map[modifiers(name, event, true)];\n if (withShift && withShift(view.state, view.dispatch, view))\n return true;\n }\n return false;\n };\n}\n\nexport { keydownHandler, keymap };\n","const Lexer = require('./Lexer.js');\nconst Parser = require('./Parser.js');\nconst Renderer = require('./Renderer.js');\nconst TextRenderer = require('./TextRenderer.js');\nconst InlineLexer = require('./InlineLexer.js');\nconst Slugger = require('./Slugger.js');\nconst {\n merge,\n checkSanitizeDeprecation,\n escape\n} = require('./helpers.js');\nconst {\n getDefaults,\n changeDefaults,\n defaults\n} = require('./defaults.js');\n\n/**\n * Marked\n */\nfunction marked(src, opt, callback) {\n // throw error in case of non string input\n if (typeof src === 'undefined' || src === null) {\n throw new Error('marked(): input parameter is undefined or null');\n }\n if (typeof src !== 'string') {\n throw new Error('marked(): input parameter is of type '\n + Object.prototype.toString.call(src) + ', string expected');\n }\n\n if (callback || typeof opt === 'function') {\n if (!callback) {\n callback = opt;\n opt = null;\n }\n\n opt = merge({}, marked.defaults, opt || {});\n checkSanitizeDeprecation(opt);\n const highlight = opt.highlight;\n let tokens,\n pending,\n i = 0;\n\n try {\n tokens = Lexer.lex(src, opt);\n } catch (e) {\n return callback(e);\n }\n\n pending = tokens.length;\n\n const done = function(err) {\n if (err) {\n opt.highlight = highlight;\n return callback(err);\n }\n\n let out;\n\n try {\n out = Parser.parse(tokens, opt);\n } catch (e) {\n err = e;\n }\n\n opt.highlight = highlight;\n\n return err\n ? callback(err)\n : callback(null, out);\n };\n\n if (!highlight || highlight.length < 3) {\n return done();\n }\n\n delete opt.highlight;\n\n if (!pending) return done();\n\n for (; i < tokens.length; i++) {\n (function(token) {\n if (token.type !== 'code') {\n return --pending || done();\n }\n return highlight(token.text, token.lang, function(err, code) {\n if (err) return done(err);\n if (code == null || code === token.text) {\n return --pending || done();\n }\n token.text = code;\n token.escaped = true;\n --pending || done();\n });\n })(tokens[i]);\n }\n\n return;\n }\n try {\n opt = merge({}, marked.defaults, opt || {});\n checkSanitizeDeprecation(opt);\n return Parser.parse(Lexer.lex(src, opt), opt);\n } catch (e) {\n e.message += '\\nPlease report this to https://github.com/markedjs/marked.';\n if ((opt || marked.defaults).silent) {\n return '<p>An error occurred:</p><pre>'\n + escape(e.message + '', true)\n + '</pre>';\n }\n throw e;\n }\n}\n\n/**\n * Options\n */\n\nmarked.options =\nmarked.setOptions = function(opt) {\n merge(marked.defaults, opt);\n changeDefaults(marked.defaults);\n return marked;\n};\n\nmarked.getDefaults = getDefaults;\n\nmarked.defaults = defaults;\n\n/**\n * Expose\n */\n\nmarked.Parser = Parser;\nmarked.parser = Parser.parse;\n\nmarked.Renderer = Renderer;\nmarked.TextRenderer = TextRenderer;\n\nmarked.Lexer = Lexer;\nmarked.lexer = Lexer.lex;\n\nmarked.InlineLexer = InlineLexer;\nmarked.inlineLexer = InlineLexer.output;\n\nmarked.Slugger = Slugger;\n\nmarked.parse = marked;\n\nmodule.exports = marked;\n","const Renderer = require('./Renderer.js');\nconst Slugger = require('./Slugger.js');\nconst InlineLexer = require('./InlineLexer.js');\nconst TextRenderer = require('./TextRenderer.js');\nconst { defaults } = require('./defaults.js');\nconst {\n merge,\n unescape\n} = require('./helpers.js');\n\n/**\n * Parsing & Compiling\n */\nmodule.exports = class Parser {\n constructor(options) {\n this.tokens = [];\n this.token = null;\n this.options = options || defaults;\n this.options.renderer = this.options.renderer || new Renderer();\n this.renderer = this.options.renderer;\n this.renderer.options = this.options;\n this.slugger = new Slugger();\n }\n\n /**\n * Static Parse Method\n */\n static parse(tokens, options) {\n const parser = new Parser(options);\n return parser.parse(tokens);\n };\n\n /**\n * Parse Loop\n */\n parse(tokens) {\n this.inline = new InlineLexer(tokens.links, this.options);\n // use an InlineLexer with a TextRenderer to extract pure text\n this.inlineText = new InlineLexer(\n tokens.links,\n merge({}, this.options, { renderer: new TextRenderer() })\n );\n this.tokens = tokens.reverse();\n\n let out = '';\n while (this.next()) {\n out += this.tok();\n }\n\n return out;\n };\n\n /**\n * Next Token\n */\n next() {\n this.token = this.tokens.pop();\n return this.token;\n };\n\n /**\n * Preview Next Token\n */\n peek() {\n return this.tokens[this.tokens.length - 1] || 0;\n };\n\n /**\n * Parse Text Tokens\n */\n parseText() {\n let body = this.token.text;\n\n while (this.peek().type === 'text') {\n body += '\\n' + this.next().text;\n }\n\n return this.inline.output(body);\n };\n\n /**\n * Parse Current Token\n */\n tok() {\n let body = '';\n switch (this.token.type) {\n case 'space': {\n return '';\n }\n case 'hr': {\n return this.renderer.hr();\n }\n case 'heading': {\n return this.renderer.heading(\n this.inline.output(this.token.text),\n this.token.depth,\n unescape(this.inlineText.output(this.token.text)),\n this.slugger);\n }\n case 'code': {\n return this.renderer.code(this.token.text,\n this.token.lang,\n this.token.escaped);\n }\n case 'table': {\n let header = '',\n i,\n row,\n cell,\n j;\n\n // header\n cell = '';\n for (i = 0; i < this.token.header.length; i++) {\n cell += this.renderer.tablecell(\n this.inline.output(this.token.header[i]),\n { header: true, align: this.token.align[i] }\n );\n }\n header += this.renderer.tablerow(cell);\n\n for (i = 0; i < this.token.cells.length; i++) {\n row = this.token.cells[i];\n\n cell = '';\n for (j = 0; j < row.length; j++) {\n cell += this.renderer.tablecell(\n this.inline.output(row[j]),\n { header: false, align: this.token.align[j] }\n );\n }\n\n body += this.renderer.tablerow(cell);\n }\n return this.renderer.table(header, body);\n }\n case 'blockquote_start': {\n body = '';\n\n while (this.next().type !== 'blockquote_end') {\n body += this.tok();\n }\n\n return this.renderer.blockquote(body);\n }\n case 'list_start': {\n body = '';\n const ordered = this.token.ordered,\n start = this.token.start;\n\n while (this.next().type !== 'list_end') {\n body += this.tok();\n }\n\n return this.renderer.list(body, ordered, start);\n }\n case 'list_item_start': {\n body = '';\n const loose = this.token.loose;\n const checked = this.token.checked;\n const task = this.token.task;\n\n if (this.token.task) {\n if (loose) {\n if (this.peek().type === 'text') {\n const nextToken = this.peek();\n nextToken.text = this.renderer.checkbox(checked) + ' ' + nextToken.text;\n } else {\n this.tokens.push({\n type: 'text',\n text: this.renderer.checkbox(checked)\n });\n }\n } else {\n body += this.renderer.checkbox(checked);\n }\n }\n\n while (this.next().type !== 'list_item_end') {\n body += !loose && this.token.type === 'text'\n ? this.parseText()\n : this.tok();\n }\n return this.renderer.listitem(body, task, checked);\n }\n case 'html': {\n // TODO parse inline content if parameter markdown=1\n return this.renderer.html(this.token.text);\n }\n case 'paragraph': {\n return this.renderer.paragraph(this.inline.output(this.token.text));\n }\n case 'text': {\n return this.renderer.paragraph(this.parseText());\n }\n default: {\n const errMsg = 'Token with \"' + this.token.type + '\" type was not found.';\n if (this.options.silent) {\n console.log(errMsg);\n } else {\n throw new Error(errMsg);\n }\n }\n }\n };\n};\n","import { PluginKey, Selection, SelectionRange, TextSelection, NodeSelection, Plugin } from 'prosemirror-state';\nimport { Fragment, Slice } from 'prosemirror-model';\nimport { keydownHandler } from 'prosemirror-keymap';\nimport { Decoration, DecorationSet } from 'prosemirror-view';\nimport { Transform } from 'prosemirror-transform';\n\n// Because working with row and column-spanning cells is not quite\n// trivial, this code builds up a descriptive structure for a given\n// table node. The structures are cached with the (persistent) table\n// nodes as key, so that they only have to be recomputed when the\n// content of the table changes.\n//\n// This does mean that they have to store table-relative, not\n// document-relative positions. So code that uses them will typically\n// compute the start position of the table and offset positions passed\n// to or gotten from this structure by that amount.\n\nlet readFromCache, addToCache;\n// Prefer using a weak map to cache table maps. Fall back on a\n// fixed-size cache if that's not supported.\nif (typeof WeakMap != 'undefined') {\n // eslint-disable-next-line\n let cache = new WeakMap();\n readFromCache = (key) => cache.get(key);\n addToCache = (key, value) => {\n cache.set(key, value);\n return value;\n };\n} else {\n let cache = [],\n cacheSize = 10,\n cachePos = 0;\n readFromCache = (key) => {\n for (let i = 0; i < cache.length; i += 2)\n if (cache[i] == key) return cache[i + 1];\n };\n addToCache = (key, value) => {\n if (cachePos == cacheSize) cachePos = 0;\n cache[cachePos++] = key;\n return (cache[cachePos++] = value);\n };\n}\n\nclass Rect {\n constructor(left, top, right, bottom) {\n this.left = left;\n this.top = top;\n this.right = right;\n this.bottom = bottom;\n }\n}\n\n// ::- A table map describes the structore of a given table. To avoid\n// recomputing them all the time, they are cached per table node. To\n// be able to do that, positions saved in the map are relative to the\n// start of the table, rather than the start of the document.\nclass TableMap {\n constructor(width, height, map, problems) {\n // :: number The width of the table\n this.width = width;\n // :: number The table's height\n this.height = height;\n // :: [number] A width * height array with the start position of\n // the cell covering that part of the table in each slot\n this.map = map;\n // An optional array of problems (cell overlap or non-rectangular\n // shape) for the table, used by the table normalizer.\n this.problems = problems;\n }\n\n // :: (number) → Rect\n // Find the dimensions of the cell at the given position.\n findCell(pos) {\n for (let i = 0; i < this.map.length; i++) {\n let curPos = this.map[i];\n if (curPos != pos) continue;\n let left = i % this.width,\n top = (i / this.width) | 0;\n let right = left + 1,\n bottom = top + 1;\n for (let j = 1; right < this.width && this.map[i + j] == curPos; j++)\n right++;\n for (\n let j = 1;\n bottom < this.height && this.map[i + this.width * j] == curPos;\n j++\n )\n bottom++;\n return new Rect(left, top, right, bottom);\n }\n throw new RangeError('No cell with offset ' + pos + ' found');\n }\n\n // :: (number) → number\n // Find the left side of the cell at the given position.\n colCount(pos) {\n for (let i = 0; i < this.map.length; i++)\n if (this.map[i] == pos) return i % this.width;\n throw new RangeError('No cell with offset ' + pos + ' found');\n }\n\n // :: (number, string, number) → ?number\n // Find the next cell in the given direction, starting from the cell\n // at `pos`, if any.\n nextCell(pos, axis, dir) {\n let { left, right, top, bottom } = this.findCell(pos);\n if (axis == 'horiz') {\n if (dir < 0 ? left == 0 : right == this.width) return null;\n return this.map[top * this.width + (dir < 0 ? left - 1 : right)];\n } else {\n if (dir < 0 ? top == 0 : bottom == this.height) return null;\n return this.map[left + this.width * (dir < 0 ? top - 1 : bottom)];\n }\n }\n\n // :: (number, number) → Rect\n // Get the rectangle spanning the two given cells.\n rectBetween(a, b) {\n let {\n left: leftA,\n right: rightA,\n top: topA,\n bottom: bottomA,\n } = this.findCell(a);\n let {\n left: leftB,\n right: rightB,\n top: topB,\n bottom: bottomB,\n } = this.findCell(b);\n return new Rect(\n Math.min(leftA, leftB),\n Math.min(topA, topB),\n Math.max(rightA, rightB),\n Math.max(bottomA, bottomB),\n );\n }\n\n // :: (Rect) → [number]\n // Return the position of all cells that have the top left corner in\n // the given rectangle.\n cellsInRect(rect) {\n let result = [],\n seen = {};\n for (let row = rect.top; row < rect.bottom; row++) {\n for (let col = rect.left; col < rect.right; col++) {\n let index = row * this.width + col,\n pos = this.map[index];\n if (seen[pos]) continue;\n seen[pos] = true;\n if (\n (col != rect.left || !col || this.map[index - 1] != pos) &&\n (row != rect.top || !row || this.map[index - this.width] != pos)\n )\n result.push(pos);\n }\n }\n return result;\n }\n\n // :: (number, number, Node) → number\n // Return the position at which the cell at the given row and column\n // starts, or would start, if a cell started there.\n positionAt(row, col, table) {\n for (let i = 0, rowStart = 0; ; i++) {\n let rowEnd = rowStart + table.child(i).nodeSize;\n if (i == row) {\n let index = col + row * this.width,\n rowEndIndex = (row + 1) * this.width;\n // Skip past cells from previous rows (via rowspan)\n while (index < rowEndIndex && this.map[index] < rowStart) index++;\n return index == rowEndIndex ? rowEnd - 1 : this.map[index];\n }\n rowStart = rowEnd;\n }\n }\n\n // :: (Node) → TableMap\n // Find the table map for the given table node.\n static get(table) {\n return readFromCache(table) || addToCache(table, computeMap(table));\n }\n}\n\n// Compute a table map.\nfunction computeMap(table) {\n if (table.type.spec.tableRole != 'table')\n throw new RangeError('Not a table node: ' + table.type.name);\n let width = findWidth(table),\n height = table.childCount;\n let map = [],\n mapPos = 0,\n problems = null,\n colWidths = [];\n for (let i = 0, e = width * height; i < e; i++) map[i] = 0;\n\n for (let row = 0, pos = 0; row < height; row++) {\n let rowNode = table.child(row);\n pos++;\n for (let i = 0; ; i++) {\n while (mapPos < map.length && map[mapPos] != 0) mapPos++;\n if (i == rowNode.childCount) break;\n let cellNode = rowNode.child(i),\n { colspan, rowspan, colwidth } = cellNode.attrs;\n for (let h = 0; h < rowspan; h++) {\n if (h + row >= height) {\n (problems || (problems = [])).push({\n type: 'overlong_rowspan',\n pos,\n n: rowspan - h,\n });\n break;\n }\n let start = mapPos + h * width;\n for (let w = 0; w < colspan; w++) {\n if (map[start + w] == 0) map[start + w] = pos;\n else\n (problems || (problems = [])).push({\n type: 'collision',\n row,\n pos,\n n: colspan - w,\n });\n let colW = colwidth && colwidth[w];\n if (colW) {\n let widthIndex = ((start + w) % width) * 2,\n prev = colWidths[widthIndex];\n if (\n prev == null ||\n (prev != colW && colWidths[widthIndex + 1] == 1)\n ) {\n colWidths[widthIndex] = colW;\n colWidths[widthIndex + 1] = 1;\n } else if (prev == colW) {\n colWidths[widthIndex + 1]++;\n }\n }\n }\n }\n mapPos += colspan;\n pos += cellNode.nodeSize;\n }\n let expectedPos = (row + 1) * width,\n missing = 0;\n while (mapPos < expectedPos) if (map[mapPos++] == 0) missing++;\n if (missing)\n (problems || (problems = [])).push({ type: 'missing', row, n: missing });\n pos++;\n }\n\n let tableMap = new TableMap(width, height, map, problems),\n badWidths = false;\n\n // For columns that have defined widths, but whose widths disagree\n // between rows, fix up the cells whose width doesn't match the\n // computed one.\n for (let i = 0; !badWidths && i < colWidths.length; i += 2)\n if (colWidths[i] != null && colWidths[i + 1] < height) badWidths = true;\n if (badWidths) findBadColWidths(tableMap, colWidths, table);\n\n return tableMap;\n}\n\nfunction findWidth(table) {\n let width = -1,\n hasRowSpan = false;\n for (let row = 0; row < table.childCount; row++) {\n let rowNode = table.child(row),\n rowWidth = 0;\n if (hasRowSpan)\n for (let j = 0; j < row; j++) {\n let prevRow = table.child(j);\n for (let i = 0; i < prevRow.childCount; i++) {\n let cell = prevRow.child(i);\n if (j + cell.attrs.rowspan > row) rowWidth += cell.attrs.colspan;\n }\n }\n for (let i = 0; i < rowNode.childCount; i++) {\n let cell = rowNode.child(i);\n rowWidth += cell.attrs.colspan;\n if (cell.attrs.rowspan > 1) hasRowSpan = true;\n }\n if (width == -1) width = rowWidth;\n else if (width != rowWidth) width = Math.max(width, rowWidth);\n }\n return width;\n}\n\nfunction findBadColWidths(map, colWidths, table) {\n if (!map.problems) map.problems = [];\n for (let i = 0, seen = {}; i < map.map.length; i++) {\n let pos = map.map[i];\n if (seen[pos]) continue;\n seen[pos] = true;\n let node = table.nodeAt(pos),\n updated = null;\n for (let j = 0; j < node.attrs.colspan; j++) {\n let col = (i + j) % map.width,\n colWidth = colWidths[col * 2];\n if (\n colWidth != null &&\n (!node.attrs.colwidth || node.attrs.colwidth[j] != colWidth)\n )\n (updated || (updated = freshColWidth(node.attrs)))[j] = colWidth;\n }\n if (updated)\n map.problems.unshift({\n type: 'colwidth mismatch',\n pos,\n colwidth: updated,\n });\n }\n}\n\nfunction freshColWidth(attrs) {\n if (attrs.colwidth) return attrs.colwidth.slice();\n let result = [];\n for (let i = 0; i < attrs.colspan; i++) result.push(0);\n return result;\n}\n\n// Helper for creating a schema that supports tables.\n\nfunction getCellAttrs(dom, extraAttrs) {\n let widthAttr = dom.getAttribute('data-colwidth');\n let widths =\n widthAttr && /^\\d+(,\\d+)*$/.test(widthAttr)\n ? widthAttr.split(',').map((s) => Number(s))\n : null;\n let colspan = Number(dom.getAttribute('colspan') || 1);\n let result = {\n colspan,\n rowspan: Number(dom.getAttribute('rowspan') || 1),\n colwidth: widths && widths.length == colspan ? widths : null,\n };\n for (let prop in extraAttrs) {\n let getter = extraAttrs[prop].getFromDOM;\n let value = getter && getter(dom);\n if (value != null) result[prop] = value;\n }\n return result;\n}\n\nfunction setCellAttrs(node, extraAttrs) {\n let attrs = {};\n if (node.attrs.colspan != 1) attrs.colspan = node.attrs.colspan;\n if (node.attrs.rowspan != 1) attrs.rowspan = node.attrs.rowspan;\n if (node.attrs.colwidth)\n attrs['data-colwidth'] = node.attrs.colwidth.join(',');\n for (let prop in extraAttrs) {\n let setter = extraAttrs[prop].setDOMAttr;\n if (setter) setter(node.attrs[prop], attrs);\n }\n return attrs;\n}\n\n// :: (Object) → Object\n//\n// This function creates a set of [node\n// specs](http://prosemirror.net/docs/ref/#model.SchemaSpec.nodes) for\n// `table`, `table_row`, and `table_cell` nodes types as used by this\n// module. The result can then be added to the set of nodes when\n// creating a a schema.\n//\n// options::- The following options are understood:\n//\n// tableGroup:: ?string\n// A group name (something like `\"block\"`) to add to the table\n// node type.\n//\n// cellContent:: string\n// The content expression for table cells.\n//\n// cellAttributes:: ?Object\n// Additional attributes to add to cells. Maps attribute names to\n// objects with the following properties:\n//\n// default:: any\n// The attribute's default value.\n//\n// getFromDOM:: ?(dom.Node) → any\n// A function to read the attribute's value from a DOM node.\n//\n// setDOMAttr:: ?(value: any, attrs: Object)\n// A function to add the attribute's value to an attribute\n// object that's used to render the cell's DOM.\nfunction tableNodes(options) {\n let extraAttrs = options.cellAttributes || {};\n let cellAttrs = {\n colspan: { default: 1 },\n rowspan: { default: 1 },\n colwidth: { default: null },\n };\n for (let prop in extraAttrs)\n cellAttrs[prop] = { default: extraAttrs[prop].default };\n\n return {\n table: {\n content: 'table_row+',\n tableRole: 'table',\n isolating: true,\n group: options.tableGroup,\n parseDOM: [{ tag: 'table' }],\n toDOM() {\n return ['table', ['tbody', 0]];\n },\n },\n table_row: {\n content: '(table_cell | table_header)*',\n tableRole: 'row',\n parseDOM: [{ tag: 'tr' }],\n toDOM() {\n return ['tr', 0];\n },\n },\n table_cell: {\n content: options.cellContent,\n attrs: cellAttrs,\n tableRole: 'cell',\n isolating: true,\n parseDOM: [\n { tag: 'td', getAttrs: (dom) => getCellAttrs(dom, extraAttrs) },\n ],\n toDOM(node) {\n return ['td', setCellAttrs(node, extraAttrs), 0];\n },\n },\n table_header: {\n content: options.cellContent,\n attrs: cellAttrs,\n tableRole: 'header_cell',\n isolating: true,\n parseDOM: [\n { tag: 'th', getAttrs: (dom) => getCellAttrs(dom, extraAttrs) },\n ],\n toDOM(node) {\n return ['th', setCellAttrs(node, extraAttrs), 0];\n },\n },\n };\n}\n\nfunction tableNodeTypes(schema) {\n let result = schema.cached.tableNodeTypes;\n if (!result) {\n result = schema.cached.tableNodeTypes = {};\n for (let name in schema.nodes) {\n let type = schema.nodes[name],\n role = type.spec.tableRole;\n if (role) result[role] = type;\n }\n }\n return result;\n}\n\n// Various helper function for working with tables\n\nconst key$1 = new PluginKey('selectingCells');\n\nfunction cellAround($pos) {\n for (let d = $pos.depth - 1; d > 0; d--)\n if ($pos.node(d).type.spec.tableRole == 'row')\n return $pos.node(0).resolve($pos.before(d + 1));\n return null;\n}\n\nfunction cellWrapping($pos) {\n for (let d = $pos.depth; d > 0; d--) {\n // Sometimes the cell can be in the same depth.\n const role = $pos.node(d).type.spec.tableRole;\n if (role === 'cell' || role === 'header_cell') return $pos.node(d);\n }\n return null;\n}\n\nfunction isInTable(state) {\n let $head = state.selection.$head;\n for (let d = $head.depth; d > 0; d--)\n if ($head.node(d).type.spec.tableRole == 'row') return true;\n return false;\n}\n\nfunction selectionCell(state) {\n let sel = state.selection;\n if (sel.$anchorCell) {\n return sel.$anchorCell.pos > sel.$headCell.pos\n ? sel.$anchorCell\n : sel.$headCell;\n } else if (sel.node && sel.node.type.spec.tableRole == 'cell') {\n return sel.$anchor;\n }\n return cellAround(sel.$head) || cellNear(sel.$head);\n}\n\nfunction cellNear($pos) {\n for (\n let after = $pos.nodeAfter, pos = $pos.pos;\n after;\n after = after.firstChild, pos++\n ) {\n let role = after.type.spec.tableRole;\n if (role == 'cell' || role == 'header_cell') return $pos.doc.resolve(pos);\n }\n for (\n let before = $pos.nodeBefore, pos = $pos.pos;\n before;\n before = before.lastChild, pos--\n ) {\n let role = before.type.spec.tableRole;\n if (role == 'cell' || role == 'header_cell')\n return $pos.doc.resolve(pos - before.nodeSize);\n }\n}\n\nfunction pointsAtCell($pos) {\n return $pos.parent.type.spec.tableRole == 'row' && $pos.nodeAfter;\n}\n\nfunction moveCellForward($pos) {\n return $pos.node(0).resolve($pos.pos + $pos.nodeAfter.nodeSize);\n}\n\nfunction inSameTable($a, $b) {\n return $a.depth == $b.depth && $a.pos >= $b.start(-1) && $a.pos <= $b.end(-1);\n}\n\nfunction findCell($pos) {\n return TableMap.get($pos.node(-1)).findCell($pos.pos - $pos.start(-1));\n}\n\nfunction colCount($pos) {\n return TableMap.get($pos.node(-1)).colCount($pos.pos - $pos.start(-1));\n}\n\nfunction nextCell($pos, axis, dir) {\n let start = $pos.start(-1),\n map = TableMap.get($pos.node(-1));\n let moved = map.nextCell($pos.pos - start, axis, dir);\n return moved == null ? null : $pos.node(0).resolve(start + moved);\n}\n\nfunction setAttr(attrs, name, value) {\n let result = {};\n for (let prop in attrs) result[prop] = attrs[prop];\n result[name] = value;\n return result;\n}\n\nfunction removeColSpan(attrs, pos, n = 1) {\n let result = setAttr(attrs, 'colspan', attrs.colspan - n);\n if (result.colwidth) {\n result.colwidth = result.colwidth.slice();\n result.colwidth.splice(pos, n);\n if (!result.colwidth.some((w) => w > 0)) result.colwidth = null;\n }\n return result;\n}\n\nfunction addColSpan(attrs, pos, n = 1) {\n let result = setAttr(attrs, 'colspan', attrs.colspan + n);\n if (result.colwidth) {\n result.colwidth = result.colwidth.slice();\n for (let i = 0; i < n; i++) result.colwidth.splice(pos, 0, 0);\n }\n return result;\n}\n\nfunction columnIsHeader(map, table, col) {\n let headerCell = tableNodeTypes(table.type.schema).header_cell;\n for (let row = 0; row < map.height; row++)\n if (table.nodeAt(map.map[col + row * map.width]).type != headerCell)\n return false;\n return true;\n}\n\n// This file defines a ProseMirror selection subclass that models\n\n// ::- A [`Selection`](http://prosemirror.net/docs/ref/#state.Selection)\n// subclass that represents a cell selection spanning part of a table.\n// With the plugin enabled, these will be created when the user\n// selects across cells, and will be drawn by giving selected cells a\n// `selectedCell` CSS class.\nclass CellSelection extends Selection {\n // :: (ResolvedPos, ?ResolvedPos)\n // A table selection is identified by its anchor and head cells. The\n // positions given to this constructor should point _before_ two\n // cells in the same table. They may be the same, to select a single\n // cell.\n constructor($anchorCell, $headCell = $anchorCell) {\n let table = $anchorCell.node(-1),\n map = TableMap.get(table),\n start = $anchorCell.start(-1);\n let rect = map.rectBetween($anchorCell.pos - start, $headCell.pos - start);\n let doc = $anchorCell.node(0);\n let cells = map.cellsInRect(rect).filter((p) => p != $headCell.pos - start);\n // Make the head cell the first range, so that it counts as the\n // primary part of the selection\n cells.unshift($headCell.pos - start);\n let ranges = cells.map((pos) => {\n let cell = table.nodeAt(pos),\n from = pos + start + 1;\n return new SelectionRange(\n doc.resolve(from),\n doc.resolve(from + cell.content.size),\n );\n });\n super(ranges[0].$from, ranges[0].$to, ranges);\n // :: ResolvedPos\n // A resolved position pointing _in front of_ the anchor cell (the one\n // that doesn't move when extending the selection).\n this.$anchorCell = $anchorCell;\n // :: ResolvedPos\n // A resolved position pointing in front of the head cell (the one\n // moves when extending the selection).\n this.$headCell = $headCell;\n }\n\n map(doc, mapping) {\n let $anchorCell = doc.resolve(mapping.map(this.$anchorCell.pos));\n let $headCell = doc.resolve(mapping.map(this.$headCell.pos));\n if (\n pointsAtCell($anchorCell) &&\n pointsAtCell($headCell) &&\n inSameTable($anchorCell, $headCell)\n ) {\n let tableChanged = this.$anchorCell.node(-1) != $anchorCell.node(-1);\n if (tableChanged && this.isRowSelection())\n return CellSelection.rowSelection($anchorCell, $headCell);\n else if (tableChanged && this.isColSelection())\n return CellSelection.colSelection($anchorCell, $headCell);\n else return new CellSelection($anchorCell, $headCell);\n }\n return TextSelection.between($anchorCell, $headCell);\n }\n\n // :: () → Slice\n // Returns a rectangular slice of table rows containing the selected\n // cells.\n content() {\n let table = this.$anchorCell.node(-1),\n map = TableMap.get(table),\n start = this.$anchorCell.start(-1);\n let rect = map.rectBetween(\n this.$anchorCell.pos - start,\n this.$headCell.pos - start,\n );\n let seen = {},\n rows = [];\n for (let row = rect.top; row < rect.bottom; row++) {\n let rowContent = [];\n for (\n let index = row * map.width + rect.left, col = rect.left;\n col < rect.right;\n col++, index++\n ) {\n let pos = map.map[index];\n if (!seen[pos]) {\n seen[pos] = true;\n let cellRect = map.findCell(pos),\n cell = table.nodeAt(pos);\n let extraLeft = rect.left - cellRect.left,\n extraRight = cellRect.right - rect.right;\n if (extraLeft > 0 || extraRight > 0) {\n let attrs = cell.attrs;\n if (extraLeft > 0) attrs = removeColSpan(attrs, 0, extraLeft);\n if (extraRight > 0)\n attrs = removeColSpan(\n attrs,\n attrs.colspan - extraRight,\n extraRight,\n );\n if (cellRect.left < rect.left)\n cell = cell.type.createAndFill(attrs);\n else cell = cell.type.create(attrs, cell.content);\n }\n if (cellRect.top < rect.top || cellRect.bottom > rect.bottom) {\n let attrs = setAttr(\n cell.attrs,\n 'rowspan',\n Math.min(cellRect.bottom, rect.bottom) -\n Math.max(cellRect.top, rect.top),\n );\n if (cellRect.top < rect.top) cell = cell.type.createAndFill(attrs);\n else cell = cell.type.create(attrs, cell.content);\n }\n rowContent.push(cell);\n }\n }\n rows.push(table.child(row).copy(Fragment.from(rowContent)));\n }\n\n const fragment =\n this.isColSelection() && this.isRowSelection() ? table : rows;\n return new Slice(Fragment.from(fragment), 1, 1);\n }\n\n replace(tr, content = Slice.empty) {\n let mapFrom = tr.steps.length,\n ranges = this.ranges;\n for (let i = 0; i < ranges.length; i++) {\n let { $from, $to } = ranges[i],\n mapping = tr.mapping.slice(mapFrom);\n tr.replace(\n mapping.map($from.pos),\n mapping.map($to.pos),\n i ? Slice.empty : content,\n );\n }\n let sel = Selection.findFrom(\n tr.doc.resolve(tr.mapping.slice(mapFrom).map(this.to)),\n -1,\n );\n if (sel) tr.setSelection(sel);\n }\n\n replaceWith(tr, node) {\n this.replace(tr, new Slice(Fragment.from(node), 0, 0));\n }\n\n forEachCell(f) {\n let table = this.$anchorCell.node(-1),\n map = TableMap.get(table),\n start = this.$anchorCell.start(-1);\n let cells = map.cellsInRect(\n map.rectBetween(this.$anchorCell.pos - start, this.$headCell.pos - start),\n );\n for (let i = 0; i < cells.length; i++)\n f(table.nodeAt(cells[i]), start + cells[i]);\n }\n\n // :: () → bool\n // True if this selection goes all the way from the top to the\n // bottom of the table.\n isColSelection() {\n let anchorTop = this.$anchorCell.index(-1),\n headTop = this.$headCell.index(-1);\n if (Math.min(anchorTop, headTop) > 0) return false;\n let anchorBot = anchorTop + this.$anchorCell.nodeAfter.attrs.rowspan,\n headBot = headTop + this.$headCell.nodeAfter.attrs.rowspan;\n return Math.max(anchorBot, headBot) == this.$headCell.node(-1).childCount;\n }\n\n // :: (ResolvedPos, ?ResolvedPos) → CellSelection\n // Returns the smallest column selection that covers the given anchor\n // and head cell.\n static colSelection($anchorCell, $headCell = $anchorCell) {\n let map = TableMap.get($anchorCell.node(-1)),\n start = $anchorCell.start(-1);\n let anchorRect = map.findCell($anchorCell.pos - start),\n headRect = map.findCell($headCell.pos - start);\n let doc = $anchorCell.node(0);\n if (anchorRect.top <= headRect.top) {\n if (anchorRect.top > 0)\n $anchorCell = doc.resolve(start + map.map[anchorRect.left]);\n if (headRect.bottom < map.height)\n $headCell = doc.resolve(\n start + map.map[map.width * (map.height - 1) + headRect.right - 1],\n );\n } else {\n if (headRect.top > 0)\n $headCell = doc.resolve(start + map.map[headRect.left]);\n if (anchorRect.bottom < map.height)\n $anchorCell = doc.resolve(\n start + map.map[map.width * (map.height - 1) + anchorRect.right - 1],\n );\n }\n return new CellSelection($anchorCell, $headCell);\n }\n\n // :: () → bool\n // True if this selection goes all the way from the left to the\n // right of the table.\n isRowSelection() {\n let map = TableMap.get(this.$anchorCell.node(-1)),\n start = this.$anchorCell.start(-1);\n let anchorLeft = map.colCount(this.$anchorCell.pos - start),\n headLeft = map.colCount(this.$headCell.pos - start);\n if (Math.min(anchorLeft, headLeft) > 0) return false;\n let anchorRight = anchorLeft + this.$anchorCell.nodeAfter.attrs.colspan,\n headRight = headLeft + this.$headCell.nodeAfter.attrs.colspan;\n return Math.max(anchorRight, headRight) == map.width;\n }\n\n eq(other) {\n return (\n other instanceof CellSelection &&\n other.$anchorCell.pos == this.$anchorCell.pos &&\n other.$headCell.pos == this.$headCell.pos\n );\n }\n\n // :: (ResolvedPos, ?ResolvedPos) → CellSelection\n // Returns the smallest row selection that covers the given anchor\n // and head cell.\n static rowSelection($anchorCell, $headCell = $anchorCell) {\n let map = TableMap.get($anchorCell.node(-1)),\n start = $anchorCell.start(-1);\n let anchorRect = map.findCell($anchorCell.pos - start),\n headRect = map.findCell($headCell.pos - start);\n let doc = $anchorCell.node(0);\n if (anchorRect.left <= headRect.left) {\n if (anchorRect.left > 0)\n $anchorCell = doc.resolve(start + map.map[anchorRect.top * map.width]);\n if (headRect.right < map.width)\n $headCell = doc.resolve(\n start + map.map[map.width * (headRect.top + 1) - 1],\n );\n } else {\n if (headRect.left > 0)\n $headCell = doc.resolve(start + map.map[headRect.top * map.width]);\n if (anchorRect.right < map.width)\n $anchorCell = doc.resolve(\n start + map.map[map.width * (anchorRect.top + 1) - 1],\n );\n }\n return new CellSelection($anchorCell, $headCell);\n }\n\n toJSON() {\n return {\n type: 'cell',\n anchor: this.$anchorCell.pos,\n head: this.$headCell.pos,\n };\n }\n\n static fromJSON(doc, json) {\n return new CellSelection(doc.resolve(json.anchor), doc.resolve(json.head));\n }\n\n // :: (Node, number, ?number) → CellSelection\n static create(doc, anchorCell, headCell = anchorCell) {\n return new CellSelection(doc.resolve(anchorCell), doc.resolve(headCell));\n }\n\n getBookmark() {\n return new CellBookmark(this.$anchorCell.pos, this.$headCell.pos);\n }\n}\n\nCellSelection.prototype.visible = false;\n\nSelection.jsonID('cell', CellSelection);\n\nclass CellBookmark {\n constructor(anchor, head) {\n this.anchor = anchor;\n this.head = head;\n }\n map(mapping) {\n return new CellBookmark(mapping.map(this.anchor), mapping.map(this.head));\n }\n resolve(doc) {\n let $anchorCell = doc.resolve(this.anchor),\n $headCell = doc.resolve(this.head);\n if (\n $anchorCell.parent.type.spec.tableRole == 'row' &&\n $headCell.parent.type.spec.tableRole == 'row' &&\n $anchorCell.index() < $anchorCell.parent.childCount &&\n $headCell.index() < $headCell.parent.childCount &&\n inSameTable($anchorCell, $headCell)\n )\n return new CellSelection($anchorCell, $headCell);\n else return Selection.near($headCell, 1);\n }\n}\n\nfunction drawCellSelection(state) {\n if (!(state.selection instanceof CellSelection)) return null;\n let cells = [];\n state.selection.forEachCell((node, pos) => {\n cells.push(\n Decoration.node(pos, pos + node.nodeSize, { class: 'selectedCell' }),\n );\n });\n return DecorationSet.create(state.doc, cells);\n}\n\nfunction isCellBoundarySelection({ $from, $to }) {\n if ($from.pos == $to.pos || $from.pos < $from.pos - 6) return false; // Cheap elimination\n let afterFrom = $from.pos,\n beforeTo = $to.pos,\n depth = $from.depth;\n for (; depth >= 0; depth--, afterFrom++)\n if ($from.after(depth + 1) < $from.end(depth)) break;\n for (let d = $to.depth; d >= 0; d--, beforeTo--)\n if ($to.before(d + 1) > $to.start(d)) break;\n return (\n afterFrom == beforeTo &&\n /row|table/.test($from.node(depth).type.spec.tableRole)\n );\n}\n\nfunction isTextSelectionAcrossCells({ $from, $to }) {\n let fromCellBoundaryNode;\n let toCellBoundaryNode;\n\n for (let i = $from.depth; i > 0; i--) {\n let node = $from.node(i);\n if (\n node.type.spec.tableRole === 'cell' ||\n node.type.spec.tableRole === 'header_cell'\n ) {\n fromCellBoundaryNode = node;\n break;\n }\n }\n\n for (let i = $to.depth; i > 0; i--) {\n let node = $to.node(i);\n if (\n node.type.spec.tableRole === 'cell' ||\n node.type.spec.tableRole === 'header_cell'\n ) {\n toCellBoundaryNode = node;\n break;\n }\n }\n\n return fromCellBoundaryNode !== toCellBoundaryNode && $to.parentOffset === 0;\n}\n\nfunction normalizeSelection(state, tr, allowTableNodeSelection) {\n let sel = (tr || state).selection,\n doc = (tr || state).doc,\n normalize,\n role;\n if (sel instanceof NodeSelection && (role = sel.node.type.spec.tableRole)) {\n if (role == 'cell' || role == 'header_cell') {\n normalize = CellSelection.create(doc, sel.from);\n } else if (role == 'row') {\n let $cell = doc.resolve(sel.from + 1);\n normalize = CellSelection.rowSelection($cell, $cell);\n } else if (!allowTableNodeSelection) {\n let map = TableMap.get(sel.node),\n start = sel.from + 1;\n let lastCell = start + map.map[map.width * map.height - 1];\n normalize = CellSelection.create(doc, start + 1, lastCell);\n }\n } else if (sel instanceof TextSelection && isCellBoundarySelection(sel)) {\n normalize = TextSelection.create(doc, sel.from);\n } else if (sel instanceof TextSelection && isTextSelectionAcrossCells(sel)) {\n normalize = TextSelection.create(doc, sel.$from.start(), sel.$from.end());\n }\n if (normalize) (tr || (tr = state.tr)).setSelection(normalize);\n return tr;\n}\n\n// Utilities used for copy/paste handling.\n\n// Utilities to help with copying and pasting table cells\n\n// : (Slice) → ?{width: number, height: number, rows: [Fragment]}\n// Get a rectangular area of cells from a slice, or null if the outer\n// nodes of the slice aren't table cells or rows.\nfunction pastedCells(slice) {\n if (!slice.size) return null;\n let { content, openStart, openEnd } = slice;\n while (\n content.childCount == 1 &&\n ((openStart > 0 && openEnd > 0) ||\n content.firstChild.type.spec.tableRole == 'table')\n ) {\n openStart--;\n openEnd--;\n content = content.firstChild.content;\n }\n let first = content.firstChild,\n role = first.type.spec.tableRole;\n let schema = first.type.schema,\n rows = [];\n if (role == 'row') {\n for (let i = 0; i < content.childCount; i++) {\n let cells = content.child(i).content;\n let left = i ? 0 : Math.max(0, openStart - 1);\n let right = i < content.childCount - 1 ? 0 : Math.max(0, openEnd - 1);\n if (left || right)\n cells = fitSlice(\n tableNodeTypes(schema).row,\n new Slice(cells, left, right),\n ).content;\n rows.push(cells);\n }\n } else if (role == 'cell' || role == 'header_cell') {\n rows.push(\n openStart || openEnd\n ? fitSlice(\n tableNodeTypes(schema).row,\n new Slice(content, openStart, openEnd),\n ).content\n : content,\n );\n } else {\n return null;\n }\n return ensureRectangular(schema, rows);\n}\n\n// : (Schema, [Fragment]) → {width: number, height: number, rows: [Fragment]}\n// Compute the width and height of a set of cells, and make sure each\n// row has the same number of cells.\nfunction ensureRectangular(schema, rows) {\n let widths = [];\n for (let i = 0; i < rows.length; i++) {\n let row = rows[i];\n for (let j = row.childCount - 1; j >= 0; j--) {\n let { rowspan, colspan } = row.child(j).attrs;\n for (let r = i; r < i + rowspan; r++)\n widths[r] = (widths[r] || 0) + colspan;\n }\n }\n let width = 0;\n for (let r = 0; r < widths.length; r++) width = Math.max(width, widths[r]);\n for (let r = 0; r < widths.length; r++) {\n if (r >= rows.length) rows.push(Fragment.empty);\n if (widths[r] < width) {\n let empty = tableNodeTypes(schema).cell.createAndFill(),\n cells = [];\n for (let i = widths[r]; i < width; i++) cells.push(empty);\n rows[r] = rows[r].append(Fragment.from(cells));\n }\n }\n return { height: rows.length, width, rows };\n}\n\nfunction fitSlice(nodeType, slice) {\n let node = nodeType.createAndFill();\n let tr = new Transform(node).replace(0, node.content.size, slice);\n return tr.doc;\n}\n\n// : ({width: number, height: number, rows: [Fragment]}, number, number) → {width: number, height: number, rows: [Fragment]}\n// Clip or extend (repeat) the given set of cells to cover the given\n// width and height. Will clip rowspan/colspan cells at the edges when\n// they stick out.\nfunction clipCells({ width, height, rows }, newWidth, newHeight) {\n if (width != newWidth) {\n let added = [],\n newRows = [];\n for (let row = 0; row < rows.length; row++) {\n let frag = rows[row],\n cells = [];\n for (let col = added[row] || 0, i = 0; col < newWidth; i++) {\n let cell = frag.child(i % frag.childCount);\n if (col + cell.attrs.colspan > newWidth)\n cell = cell.type.create(\n removeColSpan(\n cell.attrs,\n cell.attrs.colspan,\n col + cell.attrs.colspan - newWidth,\n ),\n cell.content,\n );\n cells.push(cell);\n col += cell.attrs.colspan;\n for (let j = 1; j < cell.attrs.rowspan; j++)\n added[row + j] = (added[row + j] || 0) + cell.attrs.colspan;\n }\n newRows.push(Fragment.from(cells));\n }\n rows = newRows;\n width = newWidth;\n }\n\n if (height != newHeight) {\n let newRows = [];\n for (let row = 0, i = 0; row < newHeight; row++, i++) {\n let cells = [],\n source = rows[i % height];\n for (let j = 0; j < source.childCount; j++) {\n let cell = source.child(j);\n if (row + cell.attrs.rowspan > newHeight)\n cell = cell.type.create(\n setAttr(\n cell.attrs,\n 'rowspan',\n Math.max(1, newHeight - cell.attrs.rowspan),\n ),\n cell.content,\n );\n cells.push(cell);\n }\n newRows.push(Fragment.from(cells));\n }\n rows = newRows;\n height = newHeight;\n }\n\n return { width, height, rows };\n}\n\n// Make sure a table has at least the given width and height. Return\n// true if something was changed.\nfunction growTable(tr, map, table, start, width, height, mapFrom) {\n let schema = tr.doc.type.schema,\n types = tableNodeTypes(schema),\n empty,\n emptyHead;\n if (width > map.width) {\n for (let row = 0, rowEnd = 0; row < map.height; row++) {\n let rowNode = table.child(row);\n rowEnd += rowNode.nodeSize;\n let cells = [],\n add;\n if (rowNode.lastChild == null || rowNode.lastChild.type == types.cell)\n add = empty || (empty = types.cell.createAndFill());\n else add = emptyHead || (emptyHead = types.header_cell.createAndFill());\n for (let i = map.width; i < width; i++) cells.push(add);\n tr.insert(tr.mapping.slice(mapFrom).map(rowEnd - 1 + start), cells);\n }\n }\n if (height > map.height) {\n let cells = [];\n for (\n let i = 0, start = (map.height - 1) * map.width;\n i < Math.max(map.width, width);\n i++\n ) {\n let header =\n i >= map.width\n ? false\n : table.nodeAt(map.map[start + i]).type == types.header_cell;\n cells.push(\n header\n ? emptyHead || (emptyHead = types.header_cell.createAndFill())\n : empty || (empty = types.cell.createAndFill()),\n );\n }\n\n let emptyRow = types.row.create(null, Fragment.from(cells)),\n rows = [];\n for (let i = map.height; i < height; i++) rows.push(emptyRow);\n tr.insert(tr.mapping.slice(mapFrom).map(start + table.nodeSize - 2), rows);\n }\n return !!(empty || emptyHead);\n}\n\n// Make sure the given line (left, top) to (right, top) doesn't cross\n// any rowspan cells by splitting cells that cross it. Return true if\n// something changed.\nfunction isolateHorizontal(tr, map, table, start, left, right, top, mapFrom) {\n if (top == 0 || top == map.height) return false;\n let found = false;\n for (let col = left; col < right; col++) {\n let index = top * map.width + col,\n pos = map.map[index];\n if (map.map[index - map.width] == pos) {\n found = true;\n let cell = table.nodeAt(pos);\n let { top: cellTop, left: cellLeft } = map.findCell(pos);\n tr.setNodeMarkup(\n tr.mapping.slice(mapFrom).map(pos + start),\n null,\n setAttr(cell.attrs, 'rowspan', top - cellTop),\n );\n tr.insert(\n tr.mapping.slice(mapFrom).map(map.positionAt(top, cellLeft, table)),\n cell.type.createAndFill(\n setAttr(cell.attrs, 'rowspan', cellTop + cell.attrs.rowspan - top),\n ),\n );\n col += cell.attrs.colspan - 1;\n }\n }\n return found;\n}\n\n// Make sure the given line (left, top) to (left, bottom) doesn't\n// cross any colspan cells by splitting cells that cross it. Return\n// true if something changed.\nfunction isolateVertical(tr, map, table, start, top, bottom, left, mapFrom) {\n if (left == 0 || left == map.width) return false;\n let found = false;\n for (let row = top; row < bottom; row++) {\n let index = row * map.width + left,\n pos = map.map[index];\n if (map.map[index - 1] == pos) {\n found = true;\n let cell = table.nodeAt(pos),\n cellLeft = map.colCount(pos);\n let updatePos = tr.mapping.slice(mapFrom).map(pos + start);\n tr.setNodeMarkup(\n updatePos,\n null,\n removeColSpan(\n cell.attrs,\n left - cellLeft,\n cell.attrs.colspan - (left - cellLeft),\n ),\n );\n tr.insert(\n updatePos + cell.nodeSize,\n cell.type.createAndFill(removeColSpan(cell.attrs, 0, left - cellLeft)),\n );\n row += cell.attrs.rowspan - 1;\n }\n }\n return found;\n}\n\n// Insert the given set of cells (as returned by `pastedCells`) into a\n// table, at the position pointed at by rect.\nfunction insertCells(state, dispatch, tableStart, rect, cells) {\n let table = tableStart ? state.doc.nodeAt(tableStart - 1) : state.doc,\n map = TableMap.get(table);\n let { top, left } = rect;\n let right = left + cells.width,\n bottom = top + cells.height;\n let tr = state.tr,\n mapFrom = 0;\n function recomp() {\n table = tableStart ? tr.doc.nodeAt(tableStart - 1) : tr.doc;\n map = TableMap.get(table);\n mapFrom = tr.mapping.maps.length;\n }\n // Prepare the table to be large enough and not have any cells\n // crossing the boundaries of the rectangle that we want to\n // insert into. If anything about it changes, recompute the table\n // map so that subsequent operations can see the current shape.\n if (growTable(tr, map, table, tableStart, right, bottom, mapFrom)) recomp();\n if (isolateHorizontal(tr, map, table, tableStart, left, right, top, mapFrom))\n recomp();\n if (\n isolateHorizontal(tr, map, table, tableStart, left, right, bottom, mapFrom)\n )\n recomp();\n if (isolateVertical(tr, map, table, tableStart, top, bottom, left, mapFrom))\n recomp();\n if (isolateVertical(tr, map, table, tableStart, top, bottom, right, mapFrom))\n recomp();\n\n for (let row = top; row < bottom; row++) {\n let from = map.positionAt(row, left, table),\n to = map.positionAt(row, right, table);\n tr.replace(\n tr.mapping.slice(mapFrom).map(from + tableStart),\n tr.mapping.slice(mapFrom).map(to + tableStart),\n new Slice(cells.rows[row - top], 0, 0),\n );\n }\n recomp();\n tr.setSelection(\n new CellSelection(\n tr.doc.resolve(tableStart + map.positionAt(top, left, table)),\n tr.doc.resolve(tableStart + map.positionAt(bottom - 1, right - 1, table)),\n ),\n );\n dispatch(tr);\n}\n\n// This file defines a number of helpers for wiring up user input to\n\nconst handleKeyDown = keydownHandler({\n ArrowLeft: arrow('horiz', -1),\n ArrowRight: arrow('horiz', 1),\n ArrowUp: arrow('vert', -1),\n ArrowDown: arrow('vert', 1),\n\n 'Shift-ArrowLeft': shiftArrow('horiz', -1),\n 'Shift-ArrowRight': shiftArrow('horiz', 1),\n 'Shift-ArrowUp': shiftArrow('vert', -1),\n 'Shift-ArrowDown': shiftArrow('vert', 1),\n\n Backspace: deleteCellSelection,\n 'Mod-Backspace': deleteCellSelection,\n Delete: deleteCellSelection,\n 'Mod-Delete': deleteCellSelection,\n});\n\nfunction maybeSetSelection(state, dispatch, selection) {\n if (selection.eq(state.selection)) return false;\n if (dispatch) dispatch(state.tr.setSelection(selection).scrollIntoView());\n return true;\n}\n\nfunction arrow(axis, dir) {\n return (state, dispatch, view) => {\n let sel = state.selection;\n if (sel instanceof CellSelection) {\n return maybeSetSelection(\n state,\n dispatch,\n Selection.near(sel.$headCell, dir),\n );\n }\n if (axis != 'horiz' && !sel.empty) return false;\n let end = atEndOfCell(view, axis, dir);\n if (end == null) return false;\n if (axis == 'horiz') {\n return maybeSetSelection(\n state,\n dispatch,\n Selection.near(state.doc.resolve(sel.head + dir), dir),\n );\n } else {\n let $cell = state.doc.resolve(end),\n $next = nextCell($cell, axis, dir),\n newSel;\n if ($next) newSel = Selection.near($next, 1);\n else if (dir < 0)\n newSel = Selection.near(state.doc.resolve($cell.before(-1)), -1);\n else newSel = Selection.near(state.doc.resolve($cell.after(-1)), 1);\n return maybeSetSelection(state, dispatch, newSel);\n }\n };\n}\n\nfunction shiftArrow(axis, dir) {\n return (state, dispatch, view) => {\n let sel = state.selection;\n if (!(sel instanceof CellSelection)) {\n let end = atEndOfCell(view, axis, dir);\n if (end == null) return false;\n sel = new CellSelection(state.doc.resolve(end));\n }\n let $head = nextCell(sel.$headCell, axis, dir);\n if (!$head) return false;\n return maybeSetSelection(\n state,\n dispatch,\n new CellSelection(sel.$anchorCell, $head),\n );\n };\n}\n\nfunction deleteCellSelection(state, dispatch) {\n let sel = state.selection;\n if (!(sel instanceof CellSelection)) return false;\n if (dispatch) {\n let tr = state.tr,\n baseContent = tableNodeTypes(state.schema).cell.createAndFill().content;\n sel.forEachCell((cell, pos) => {\n if (!cell.content.eq(baseContent))\n tr.replace(\n tr.mapping.map(pos + 1),\n tr.mapping.map(pos + cell.nodeSize - 1),\n new Slice(baseContent, 0, 0),\n );\n });\n if (tr.docChanged) dispatch(tr);\n }\n return true;\n}\n\nfunction handleTripleClick(view, pos) {\n let doc = view.state.doc,\n $cell = cellAround(doc.resolve(pos));\n if (!$cell) return false;\n view.dispatch(view.state.tr.setSelection(new CellSelection($cell)));\n return true;\n}\n\nfunction handlePaste(view, _, slice) {\n if (!isInTable(view.state)) return false;\n let cells = pastedCells(slice),\n sel = view.state.selection;\n if (sel instanceof CellSelection) {\n if (!cells)\n cells = {\n width: 1,\n height: 1,\n rows: [\n Fragment.from(\n fitSlice(tableNodeTypes(view.state.schema).cell, slice),\n ),\n ],\n };\n let table = sel.$anchorCell.node(-1),\n start = sel.$anchorCell.start(-1);\n let rect = TableMap.get(table).rectBetween(\n sel.$anchorCell.pos - start,\n sel.$headCell.pos - start,\n );\n cells = clipCells(cells, rect.right - rect.left, rect.bottom - rect.top);\n insertCells(view.state, view.dispatch, start, rect, cells);\n return true;\n } else if (cells) {\n let $cell = selectionCell(view.state),\n start = $cell.start(-1);\n insertCells(\n view.state,\n view.dispatch,\n start,\n TableMap.get($cell.node(-1)).findCell($cell.pos - start),\n cells,\n );\n return true;\n } else {\n return false;\n }\n}\n\nfunction handleMouseDown$1(view, startEvent) {\n if (startEvent.ctrlKey || startEvent.metaKey) return;\n\n let startDOMCell = domInCell(view, startEvent.target),\n $anchor;\n if (startEvent.shiftKey && view.state.selection instanceof CellSelection) {\n // Adding to an existing cell selection\n setCellSelection(view.state.selection.$anchorCell, startEvent);\n startEvent.preventDefault();\n } else if (\n startEvent.shiftKey &&\n startDOMCell &&\n ($anchor = cellAround(view.state.selection.$anchor)) != null &&\n cellUnderMouse(view, startEvent).pos != $anchor.pos\n ) {\n // Adding to a selection that starts in another cell (causing a\n // cell selection to be created).\n setCellSelection($anchor, startEvent);\n startEvent.preventDefault();\n } else if (!startDOMCell) {\n // Not in a cell, let the default behavior happen.\n return;\n }\n\n // Create and dispatch a cell selection between the given anchor and\n // the position under the mouse.\n function setCellSelection($anchor, event) {\n let $head = cellUnderMouse(view, event);\n let starting = key$1.getState(view.state) == null;\n if (!$head || !inSameTable($anchor, $head)) {\n if (starting) $head = $anchor;\n else return;\n }\n let selection = new CellSelection($anchor, $head);\n if (starting || !view.state.selection.eq(selection)) {\n let tr = view.state.tr.setSelection(selection);\n if (starting) tr.setMeta(key$1, $anchor.pos);\n view.dispatch(tr);\n }\n }\n\n // Stop listening to mouse motion events.\n function stop() {\n view.root.removeEventListener('mouseup', stop);\n view.root.removeEventListener('dragstart', stop);\n view.root.removeEventListener('mousemove', move);\n if (key$1.getState(view.state) != null)\n view.dispatch(view.state.tr.setMeta(key$1, -1));\n }\n\n function move(event) {\n let anchor = key$1.getState(view.state),\n $anchor;\n if (anchor != null) {\n // Continuing an existing cross-cell selection\n $anchor = view.state.doc.resolve(anchor);\n } else if (domInCell(view, event.target) != startDOMCell) {\n // Moving out of the initial cell -- start a new cell selection\n $anchor = cellUnderMouse(view, startEvent);\n if (!$anchor) return stop();\n }\n if ($anchor) setCellSelection($anchor, event);\n }\n view.root.addEventListener('mouseup', stop);\n view.root.addEventListener('dragstart', stop);\n view.root.addEventListener('mousemove', move);\n}\n\n// Check whether the cursor is at the end of a cell (so that further\n// motion would move out of the cell)\nfunction atEndOfCell(view, axis, dir) {\n if (!(view.state.selection instanceof TextSelection)) return null;\n let { $head } = view.state.selection;\n for (let d = $head.depth - 1; d >= 0; d--) {\n let parent = $head.node(d),\n index = dir < 0 ? $head.index(d) : $head.indexAfter(d);\n if (index != (dir < 0 ? 0 : parent.childCount)) return null;\n if (\n parent.type.spec.tableRole == 'cell' ||\n parent.type.spec.tableRole == 'header_cell'\n ) {\n let cellPos = $head.before(d);\n let dirStr =\n axis == 'vert' ? (dir > 0 ? 'down' : 'up') : dir > 0 ? 'right' : 'left';\n return view.endOfTextblock(dirStr) ? cellPos : null;\n }\n }\n return null;\n}\n\nfunction domInCell(view, dom) {\n for (; dom && dom != view.dom; dom = dom.parentNode)\n if (dom.nodeName == 'TD' || dom.nodeName == 'TH') return dom;\n}\n\nfunction cellUnderMouse(view, event) {\n let mousePos = view.posAtCoords({ left: event.clientX, top: event.clientY });\n if (!mousePos) return null;\n return mousePos ? cellAround(view.state.doc.resolve(mousePos.pos)) : null;\n}\n\n// This file defines helpers for normalizing tables, making sure no\n\nconst fixTablesKey = new PluginKey('fix-tables');\n\n// Helper for iterating through the nodes in a document that changed\n// compared to the given previous document. Useful for avoiding\n// duplicate work on each transaction.\nfunction changedDescendants(old, cur, offset, f) {\n let oldSize = old.childCount,\n curSize = cur.childCount;\n outer: for (let i = 0, j = 0; i < curSize; i++) {\n let child = cur.child(i);\n for (let scan = j, e = Math.min(oldSize, i + 3); scan < e; scan++) {\n if (old.child(scan) == child) {\n j = scan + 1;\n offset += child.nodeSize;\n continue outer;\n }\n }\n f(child, offset);\n if (j < oldSize && old.child(j).sameMarkup(child))\n changedDescendants(old.child(j), child, offset + 1, f);\n else child.nodesBetween(0, child.content.size, f, offset + 1);\n offset += child.nodeSize;\n }\n}\n\n// :: (EditorState, ?EditorState) → ?Transaction\n// Inspect all tables in the given state's document and return a\n// transaction that fixes them, if necessary. If `oldState` was\n// provided, that is assumed to hold a previous, known-good state,\n// which will be used to avoid re-scanning unchanged parts of the\n// document.\nfunction fixTables(state, oldState) {\n let tr,\n check = (node, pos) => {\n if (node.type.spec.tableRole == 'table')\n tr = fixTable(state, node, pos, tr);\n };\n if (!oldState) state.doc.descendants(check);\n else if (oldState.doc != state.doc)\n changedDescendants(oldState.doc, state.doc, 0, check);\n return tr;\n}\n\n// : (EditorState, Node, number, ?Transaction) → ?Transaction\n// Fix the given table, if necessary. Will append to the transaction\n// it was given, if non-null, or create a new one if necessary.\nfunction fixTable(state, table, tablePos, tr) {\n let map = TableMap.get(table);\n if (!map.problems) return tr;\n if (!tr) tr = state.tr;\n\n // Track which rows we must add cells to, so that we can adjust that\n // when fixing collisions.\n let mustAdd = [];\n for (let i = 0; i < map.height; i++) mustAdd.push(0);\n for (let i = 0; i < map.problems.length; i++) {\n let prob = map.problems[i];\n if (prob.type == 'collision') {\n let cell = table.nodeAt(prob.pos);\n for (let j = 0; j < cell.attrs.rowspan; j++)\n mustAdd[prob.row + j] += prob.n;\n tr.setNodeMarkup(\n tr.mapping.map(tablePos + 1 + prob.pos),\n null,\n removeColSpan(cell.attrs, cell.attrs.colspan - prob.n, prob.n),\n );\n } else if (prob.type == 'missing') {\n mustAdd[prob.row] += prob.n;\n } else if (prob.type == 'overlong_rowspan') {\n let cell = table.nodeAt(prob.pos);\n tr.setNodeMarkup(\n tr.mapping.map(tablePos + 1 + prob.pos),\n null,\n setAttr(cell.attrs, 'rowspan', cell.attrs.rowspan - prob.n),\n );\n } else if (prob.type == 'colwidth mismatch') {\n let cell = table.nodeAt(prob.pos);\n tr.setNodeMarkup(\n tr.mapping.map(tablePos + 1 + prob.pos),\n null,\n setAttr(cell.attrs, 'colwidth', prob.colwidth),\n );\n }\n }\n let first, last;\n for (let i = 0; i < mustAdd.length; i++)\n if (mustAdd[i]) {\n if (first == null) first = i;\n last = i;\n }\n // Add the necessary cells, using a heuristic for whether to add the\n // cells at the start or end of the rows (if it looks like a 'bite'\n // was taken out of the table, add cells at the start of the row\n // after the bite. Otherwise add them at the end).\n for (let i = 0, pos = tablePos + 1; i < map.height; i++) {\n let row = table.child(i);\n let end = pos + row.nodeSize;\n let add = mustAdd[i];\n if (add > 0) {\n let tableNodeType = 'cell';\n if (row.firstChild) {\n tableNodeType = row.firstChild.type.spec.tableRole;\n }\n let nodes = [];\n for (let j = 0; j < add; j++)\n nodes.push(tableNodeTypes(state.schema)[tableNodeType].createAndFill());\n let side = (i == 0 || first == i - 1) && last == i ? pos + 1 : end - 1;\n tr.insert(tr.mapping.map(side), nodes);\n }\n pos = end;\n }\n return tr.setMeta(fixTablesKey, { fixTables: true });\n}\n\n// This file defines a number of table-related commands.\n\n// Helper to get the selected rectangle in a table, if any. Adds table\n// map, table node, and table start offset to the object for\n// convenience.\nfunction selectedRect(state) {\n let sel = state.selection,\n $pos = selectionCell(state);\n let table = $pos.node(-1),\n tableStart = $pos.start(-1),\n map = TableMap.get(table);\n let rect;\n if (sel instanceof CellSelection)\n rect = map.rectBetween(\n sel.$anchorCell.pos - tableStart,\n sel.$headCell.pos - tableStart,\n );\n else rect = map.findCell($pos.pos - tableStart);\n rect.tableStart = tableStart;\n rect.map = map;\n rect.table = table;\n return rect;\n}\n\n// Add a column at the given position in a table.\nfunction addColumn(tr, { map, tableStart, table }, col) {\n let refColumn = col > 0 ? -1 : 0;\n if (columnIsHeader(map, table, col + refColumn))\n refColumn = col == 0 || col == map.width ? null : 0;\n\n for (let row = 0; row < map.height; row++) {\n let index = row * map.width + col;\n // If this position falls inside a col-spanning cell\n if (col > 0 && col < map.width && map.map[index - 1] == map.map[index]) {\n let pos = map.map[index],\n cell = table.nodeAt(pos);\n tr.setNodeMarkup(\n tr.mapping.map(tableStart + pos),\n null,\n addColSpan(cell.attrs, col - map.colCount(pos)),\n );\n // Skip ahead if rowspan > 1\n row += cell.attrs.rowspan - 1;\n } else {\n let type =\n refColumn == null\n ? tableNodeTypes(table.type.schema).cell\n : table.nodeAt(map.map[index + refColumn]).type;\n let pos = map.positionAt(row, col, table);\n tr.insert(tr.mapping.map(tableStart + pos), type.createAndFill());\n }\n }\n return tr;\n}\n\n// :: (EditorState, dispatch: ?(tr: Transaction)) → bool\n// Command to add a column before the column with the selection.\nfunction addColumnBefore(state, dispatch) {\n if (!isInTable(state)) return false;\n if (dispatch) {\n let rect = selectedRect(state);\n dispatch(addColumn(state.tr, rect, rect.left));\n }\n return true;\n}\n\n// :: (EditorState, dispatch: ?(tr: Transaction)) → bool\n// Command to add a column after the column with the selection.\nfunction addColumnAfter(state, dispatch) {\n if (!isInTable(state)) return false;\n if (dispatch) {\n let rect = selectedRect(state);\n dispatch(addColumn(state.tr, rect, rect.right));\n }\n return true;\n}\n\nfunction removeColumn(tr, { map, table, tableStart }, col) {\n let mapStart = tr.mapping.maps.length;\n for (let row = 0; row < map.height; ) {\n let index = row * map.width + col,\n pos = map.map[index],\n cell = table.nodeAt(pos);\n // If this is part of a col-spanning cell\n if (\n (col > 0 && map.map[index - 1] == pos) ||\n (col < map.width - 1 && map.map[index + 1] == pos)\n ) {\n tr.setNodeMarkup(\n tr.mapping.slice(mapStart).map(tableStart + pos),\n null,\n removeColSpan(cell.attrs, col - map.colCount(pos)),\n );\n } else {\n let start = tr.mapping.slice(mapStart).map(tableStart + pos);\n tr.delete(start, start + cell.nodeSize);\n }\n row += cell.attrs.rowspan;\n }\n}\n\n// :: (EditorState, dispatch: ?(tr: Transaction)) → bool\n// Command function that removes the selected columns from a table.\nfunction deleteColumn(state, dispatch) {\n if (!isInTable(state)) return false;\n if (dispatch) {\n let rect = selectedRect(state),\n tr = state.tr;\n if (rect.left == 0 && rect.right == rect.map.width) return false;\n for (let i = rect.right - 1; ; i--) {\n removeColumn(tr, rect, i);\n if (i == rect.left) break;\n rect.table = rect.tableStart\n ? tr.doc.nodeAt(rect.tableStart - 1)\n : tr.doc;\n rect.map = TableMap.get(rect.table);\n }\n dispatch(tr);\n }\n return true;\n}\n\nfunction rowIsHeader(map, table, row) {\n let headerCell = tableNodeTypes(table.type.schema).header_cell;\n for (let col = 0; col < map.width; col++)\n if (table.nodeAt(map.map[col + row * map.width]).type != headerCell)\n return false;\n return true;\n}\n\nfunction addRow(tr, { map, tableStart, table }, row) {\n let rowPos = tableStart;\n for (let i = 0; i < row; i++) rowPos += table.child(i).nodeSize;\n let cells = [],\n refRow = row > 0 ? -1 : 0;\n if (rowIsHeader(map, table, row + refRow))\n refRow = row == 0 || row == map.height ? null : 0;\n for (let col = 0, index = map.width * row; col < map.width; col++, index++) {\n // Covered by a rowspan cell\n if (\n row > 0 &&\n row < map.height &&\n map.map[index] == map.map[index - map.width]\n ) {\n let pos = map.map[index],\n attrs = table.nodeAt(pos).attrs;\n tr.setNodeMarkup(\n tableStart + pos,\n null,\n setAttr(attrs, 'rowspan', attrs.rowspan + 1),\n );\n col += attrs.colspan - 1;\n } else {\n let type =\n refRow == null\n ? tableNodeTypes(table.type.schema).cell\n : table.nodeAt(map.map[index + refRow * map.width]).type;\n cells.push(type.createAndFill());\n }\n }\n tr.insert(rowPos, tableNodeTypes(table.type.schema).row.create(null, cells));\n return tr;\n}\n\n// :: (EditorState, dispatch: ?(tr: Transaction)) → bool\n// Add a table row before the selection.\nfunction addRowBefore(state, dispatch) {\n if (!isInTable(state)) return false;\n if (dispatch) {\n let rect = selectedRect(state);\n dispatch(addRow(state.tr, rect, rect.top));\n }\n return true;\n}\n\n// :: (EditorState, dispatch: ?(tr: Transaction)) → bool\n// Add a table row after the selection.\nfunction addRowAfter(state, dispatch) {\n if (!isInTable(state)) return false;\n if (dispatch) {\n let rect = selectedRect(state);\n dispatch(addRow(state.tr, rect, rect.bottom));\n }\n return true;\n}\n\nfunction removeRow(tr, { map, table, tableStart }, row) {\n let rowPos = 0;\n for (let i = 0; i < row; i++) rowPos += table.child(i).nodeSize;\n let nextRow = rowPos + table.child(row).nodeSize;\n\n let mapFrom = tr.mapping.maps.length;\n tr.delete(rowPos + tableStart, nextRow + tableStart);\n\n for (let col = 0, index = row * map.width; col < map.width; col++, index++) {\n let pos = map.map[index];\n if (row > 0 && pos == map.map[index - map.width]) {\n // If this cell starts in the row above, simply reduce its rowspan\n let attrs = table.nodeAt(pos).attrs;\n tr.setNodeMarkup(\n tr.mapping.slice(mapFrom).map(pos + tableStart),\n null,\n setAttr(attrs, 'rowspan', attrs.rowspan - 1),\n );\n col += attrs.colspan - 1;\n } else if (row < map.width && pos == map.map[index + map.width]) {\n // Else, if it continues in the row below, it has to be moved down\n let cell = table.nodeAt(pos);\n let copy = cell.type.create(\n setAttr(cell.attrs, 'rowspan', cell.attrs.rowspan - 1),\n cell.content,\n );\n let newPos = map.positionAt(row + 1, col, table);\n tr.insert(tr.mapping.slice(mapFrom).map(tableStart + newPos), copy);\n col += cell.attrs.colspan - 1;\n }\n }\n}\n\n// :: (EditorState, dispatch: ?(tr: Transaction)) → bool\n// Remove the selected rows from a table.\nfunction deleteRow(state, dispatch) {\n if (!isInTable(state)) return false;\n if (dispatch) {\n let rect = selectedRect(state),\n tr = state.tr;\n if (rect.top == 0 && rect.bottom == rect.map.height) return false;\n for (let i = rect.bottom - 1; ; i--) {\n removeRow(tr, rect, i);\n if (i == rect.top) break;\n rect.table = rect.tableStart\n ? tr.doc.nodeAt(rect.tableStart - 1)\n : tr.doc;\n rect.map = TableMap.get(rect.table);\n }\n dispatch(tr);\n }\n return true;\n}\n\nfunction isEmpty(cell) {\n let c = cell.content;\n return (\n c.childCount == 1 &&\n c.firstChild.isTextblock &&\n c.firstChild.childCount == 0\n );\n}\n\nfunction cellsOverlapRectangle({ width, height, map }, rect) {\n let indexTop = rect.top * width + rect.left,\n indexLeft = indexTop;\n let indexBottom = (rect.bottom - 1) * width + rect.left,\n indexRight = indexTop + (rect.right - rect.left - 1);\n for (let i = rect.top; i < rect.bottom; i++) {\n if (\n (rect.left > 0 && map[indexLeft] == map[indexLeft - 1]) ||\n (rect.right < width && map[indexRight] == map[indexRight + 1])\n )\n return true;\n indexLeft += width;\n indexRight += width;\n }\n for (let i = rect.left; i < rect.right; i++) {\n if (\n (rect.top > 0 && map[indexTop] == map[indexTop - width]) ||\n (rect.bottom < height && map[indexBottom] == map[indexBottom + width])\n )\n return true;\n indexTop++;\n indexBottom++;\n }\n return false;\n}\n\n// :: (EditorState, dispatch: ?(tr: Transaction)) → bool\n// Merge the selected cells into a single cell. Only available when\n// the selected cells' outline forms a rectangle.\nfunction mergeCells(state, dispatch) {\n let sel = state.selection;\n if (\n !(sel instanceof CellSelection) ||\n sel.$anchorCell.pos == sel.$headCell.pos\n )\n return false;\n let rect = selectedRect(state),\n { map } = rect;\n if (cellsOverlapRectangle(map, rect)) return false;\n if (dispatch) {\n let tr = state.tr,\n seen = {},\n content = Fragment.empty,\n mergedPos,\n mergedCell;\n for (let row = rect.top; row < rect.bottom; row++) {\n for (let col = rect.left; col < rect.right; col++) {\n let cellPos = map.map[row * map.width + col],\n cell = rect.table.nodeAt(cellPos);\n if (seen[cellPos]) continue;\n seen[cellPos] = true;\n if (mergedPos == null) {\n mergedPos = cellPos;\n mergedCell = cell;\n } else {\n if (!isEmpty(cell)) content = content.append(cell.content);\n let mapped = tr.mapping.map(cellPos + rect.tableStart);\n tr.delete(mapped, mapped + cell.nodeSize);\n }\n }\n }\n tr.setNodeMarkup(\n mergedPos + rect.tableStart,\n null,\n setAttr(\n addColSpan(\n mergedCell.attrs,\n mergedCell.attrs.colspan,\n rect.right - rect.left - mergedCell.attrs.colspan,\n ),\n 'rowspan',\n rect.bottom - rect.top,\n ),\n );\n if (content.size) {\n let end = mergedPos + 1 + mergedCell.content.size;\n let start = isEmpty(mergedCell) ? mergedPos + 1 : end;\n tr.replaceWith(start + rect.tableStart, end + rect.tableStart, content);\n }\n tr.setSelection(\n new CellSelection(tr.doc.resolve(mergedPos + rect.tableStart)),\n );\n dispatch(tr);\n }\n return true;\n}\n// :: (EditorState, dispatch: ?(tr: Transaction)) → bool\n// Split a selected cell, whose rowpan or colspan is greater than one,\n// into smaller cells. Use the first cell type for the new cells.\nfunction splitCell(state, dispatch) {\n const nodeTypes = tableNodeTypes(state.schema);\n return splitCellWithType(({ node }) => {\n return nodeTypes[node.type.spec.tableRole];\n })(state, dispatch);\n}\n\n// :: (getCellType: ({ row: number, col: number, node: Node}) → NodeType) → (EditorState, dispatch: ?(tr: Transaction)) → bool\n// Split a selected cell, whose rowpan or colspan is greater than one,\n// into smaller cells with the cell type (th, td) returned by getType function.\nfunction splitCellWithType(getCellType) {\n return (state, dispatch) => {\n let sel = state.selection;\n let cellNode, cellPos;\n if (!(sel instanceof CellSelection)) {\n cellNode = cellWrapping(sel.$from);\n if (!cellNode) return false;\n cellPos = cellAround(sel.$from).pos;\n } else {\n if (sel.$anchorCell.pos != sel.$headCell.pos) return false;\n cellNode = sel.$anchorCell.nodeAfter;\n cellPos = sel.$anchorCell.pos;\n }\n if (cellNode.attrs.colspan == 1 && cellNode.attrs.rowspan == 1) {\n return false;\n }\n if (dispatch) {\n let baseAttrs = cellNode.attrs,\n attrs = [],\n colwidth = baseAttrs.colwidth;\n if (baseAttrs.rowspan > 1) baseAttrs = setAttr(baseAttrs, 'rowspan', 1);\n if (baseAttrs.colspan > 1) baseAttrs = setAttr(baseAttrs, 'colspan', 1);\n let rect = selectedRect(state),\n tr = state.tr;\n for (let i = 0; i < rect.right - rect.left; i++)\n attrs.push(\n colwidth\n ? setAttr(\n baseAttrs,\n 'colwidth',\n colwidth && colwidth[i] ? [colwidth[i]] : null,\n )\n : baseAttrs,\n );\n let lastCell;\n for (let row = rect.top; row < rect.bottom; row++) {\n let pos = rect.map.positionAt(row, rect.left, rect.table);\n if (row == rect.top) pos += cellNode.nodeSize;\n for (let col = rect.left, i = 0; col < rect.right; col++, i++) {\n if (col == rect.left && row == rect.top) continue;\n tr.insert(\n (lastCell = tr.mapping.map(pos + rect.tableStart, 1)),\n getCellType({ node: cellNode, row, col }).createAndFill(attrs[i]),\n );\n }\n }\n tr.setNodeMarkup(\n cellPos,\n getCellType({ node: cellNode, row: rect.top, col: rect.left }),\n attrs[0],\n );\n if (sel instanceof CellSelection)\n tr.setSelection(\n new CellSelection(\n tr.doc.resolve(sel.$anchorCell.pos),\n lastCell && tr.doc.resolve(lastCell),\n ),\n );\n dispatch(tr);\n }\n return true;\n };\n}\n\n// :: (string, any) → (EditorState, dispatch: ?(tr: Transaction)) → bool\n// Returns a command that sets the given attribute to the given value,\n// and is only available when the currently selected cell doesn't\n// already have that attribute set to that value.\nfunction setCellAttr(name, value) {\n return function (state, dispatch) {\n if (!isInTable(state)) return false;\n let $cell = selectionCell(state);\n if ($cell.nodeAfter.attrs[name] === value) return false;\n if (dispatch) {\n let tr = state.tr;\n if (state.selection instanceof CellSelection)\n state.selection.forEachCell((node, pos) => {\n if (node.attrs[name] !== value)\n tr.setNodeMarkup(pos, null, setAttr(node.attrs, name, value));\n });\n else\n tr.setNodeMarkup(\n $cell.pos,\n null,\n setAttr($cell.nodeAfter.attrs, name, value),\n );\n dispatch(tr);\n }\n return true;\n };\n}\n\nfunction deprecated_toggleHeader(type) {\n return function (state, dispatch) {\n if (!isInTable(state)) return false;\n if (dispatch) {\n let types = tableNodeTypes(state.schema);\n let rect = selectedRect(state),\n tr = state.tr;\n let cells = rect.map.cellsInRect(\n type == 'column'\n ? new Rect(rect.left, 0, rect.right, rect.map.height)\n : type == 'row'\n ? new Rect(0, rect.top, rect.map.width, rect.bottom)\n : rect,\n );\n let nodes = cells.map((pos) => rect.table.nodeAt(pos));\n for (\n let i = 0;\n i < cells.length;\n i++ // Remove headers, if any\n )\n if (nodes[i].type == types.header_cell)\n tr.setNodeMarkup(\n rect.tableStart + cells[i],\n types.cell,\n nodes[i].attrs,\n );\n if (tr.steps.length == 0)\n for (\n let i = 0;\n i < cells.length;\n i++ // No headers removed, add instead\n )\n tr.setNodeMarkup(\n rect.tableStart + cells[i],\n types.header_cell,\n nodes[i].attrs,\n );\n dispatch(tr);\n }\n return true;\n };\n}\n\nfunction isHeaderEnabledByType(type, rect, types) {\n // Get cell positions for first row or first column\n const cellPositions = rect.map.cellsInRect({\n left: 0,\n top: 0,\n right: type == 'row' ? rect.map.width : 1,\n bottom: type == 'column' ? rect.map.height : 1,\n });\n\n for (let i = 0; i < cellPositions.length; i++) {\n const cell = rect.table.nodeAt(cellPositions[i]);\n if (cell && cell.type !== types.header_cell) {\n return false;\n }\n }\n\n return true;\n}\n\n// :: (string, ?{ useDeprecatedLogic: bool }) → (EditorState, dispatch: ?(tr: Transaction)) → bool\n// Toggles between row/column header and normal cells (Only applies to first row/column).\n// For deprecated behavior pass `useDeprecatedLogic` in options with true.\nfunction toggleHeader(type, options) {\n options = options || { useDeprecatedLogic: false };\n\n if (options.useDeprecatedLogic) return deprecated_toggleHeader(type);\n\n return function (state, dispatch) {\n if (!isInTable(state)) return false;\n if (dispatch) {\n let types = tableNodeTypes(state.schema);\n let rect = selectedRect(state),\n tr = state.tr;\n\n let isHeaderRowEnabled = isHeaderEnabledByType('row', rect, types);\n let isHeaderColumnEnabled = isHeaderEnabledByType('column', rect, types);\n\n let isHeaderEnabled =\n type === 'column'\n ? isHeaderRowEnabled\n : type === 'row'\n ? isHeaderColumnEnabled\n : false;\n\n let selectionStartsAt = isHeaderEnabled ? 1 : 0;\n\n let cellsRect =\n type == 'column'\n ? new Rect(0, selectionStartsAt, 1, rect.map.height)\n : type == 'row'\n ? new Rect(selectionStartsAt, 0, rect.map.width, 1)\n : rect;\n\n let newType =\n type == 'column'\n ? isHeaderColumnEnabled\n ? types.cell\n : types.header_cell\n : type == 'row'\n ? isHeaderRowEnabled\n ? types.cell\n : types.header_cell\n : types.cell;\n\n rect.map.cellsInRect(cellsRect).forEach((relativeCellPos) => {\n const cellPos = relativeCellPos + rect.tableStart;\n const cell = tr.doc.nodeAt(cellPos);\n\n if (cell) {\n tr.setNodeMarkup(cellPos, newType, cell.attrs);\n }\n });\n\n dispatch(tr);\n }\n return true;\n };\n}\n\n// :: (EditorState, dispatch: ?(tr: Transaction)) → bool\n// Toggles whether the selected row contains header cells.\nlet toggleHeaderRow = toggleHeader('row', { useDeprecatedLogic: true });\n\n// :: (EditorState, dispatch: ?(tr: Transaction)) → bool\n// Toggles whether the selected column contains header cells.\nlet toggleHeaderColumn = toggleHeader('column', {\n useDeprecatedLogic: true,\n});\n\n// :: (EditorState, dispatch: ?(tr: Transaction)) → bool\n// Toggles whether the selected cells are header cells.\nlet toggleHeaderCell = toggleHeader('cell', {\n useDeprecatedLogic: true,\n});\n\nfunction findNextCell($cell, dir) {\n if (dir < 0) {\n let before = $cell.nodeBefore;\n if (before) return $cell.pos - before.nodeSize;\n for (\n let row = $cell.index(-1) - 1, rowEnd = $cell.before();\n row >= 0;\n row--\n ) {\n let rowNode = $cell.node(-1).child(row);\n if (rowNode.childCount) return rowEnd - 1 - rowNode.lastChild.nodeSize;\n rowEnd -= rowNode.nodeSize;\n }\n } else {\n if ($cell.index() < $cell.parent.childCount - 1)\n return $cell.pos + $cell.nodeAfter.nodeSize;\n let table = $cell.node(-1);\n for (\n let row = $cell.indexAfter(-1), rowStart = $cell.after();\n row < table.childCount;\n row++\n ) {\n let rowNode = table.child(row);\n if (rowNode.childCount) return rowStart + 1;\n rowStart += rowNode.nodeSize;\n }\n }\n}\n\n// :: (number) → (EditorState, dispatch: ?(tr: Transaction)) → bool\n// Returns a command for selecting the next (direction=1) or previous\n// (direction=-1) cell in a table.\nfunction goToNextCell(direction) {\n return function (state, dispatch) {\n if (!isInTable(state)) return false;\n let cell = findNextCell(selectionCell(state), direction);\n if (cell == null) return;\n if (dispatch) {\n let $cell = state.doc.resolve(cell);\n dispatch(\n state.tr\n .setSelection(TextSelection.between($cell, moveCellForward($cell)))\n .scrollIntoView(),\n );\n }\n return true;\n };\n}\n\n// :: (EditorState, ?(tr: Transaction)) → bool\n// Deletes the table around the selection, if any.\nfunction deleteTable(state, dispatch) {\n let $pos = state.selection.$anchor;\n for (let d = $pos.depth; d > 0; d--) {\n let node = $pos.node(d);\n if (node.type.spec.tableRole == 'table') {\n if (dispatch)\n dispatch(\n state.tr.delete($pos.before(d), $pos.after(d)).scrollIntoView(),\n );\n return true;\n }\n }\n return false;\n}\n\nclass TableView {\n constructor(node, cellMinWidth) {\n this.node = node;\n this.cellMinWidth = cellMinWidth;\n this.dom = document.createElement('div');\n this.dom.className = 'tableWrapper';\n this.table = this.dom.appendChild(document.createElement('table'));\n this.colgroup = this.table.appendChild(document.createElement('colgroup'));\n updateColumns(node, this.colgroup, this.table, cellMinWidth);\n this.contentDOM = this.table.appendChild(document.createElement('tbody'));\n }\n\n update(node) {\n if (node.type != this.node.type) return false;\n this.node = node;\n updateColumns(node, this.colgroup, this.table, this.cellMinWidth);\n return true;\n }\n\n ignoreMutation(record) {\n return (\n record.type == 'attributes' &&\n (record.target == this.table || this.colgroup.contains(record.target))\n );\n }\n}\n\nfunction updateColumns(\n node,\n colgroup,\n table,\n cellMinWidth,\n overrideCol,\n overrideValue,\n) {\n let totalWidth = 0,\n fixedWidth = true;\n let nextDOM = colgroup.firstChild,\n row = node.firstChild;\n for (let i = 0, col = 0; i < row.childCount; i++) {\n let { colspan, colwidth } = row.child(i).attrs;\n for (let j = 0; j < colspan; j++, col++) {\n let hasWidth =\n overrideCol == col ? overrideValue : colwidth && colwidth[j];\n let cssWidth = hasWidth ? hasWidth + 'px' : '';\n totalWidth += hasWidth || cellMinWidth;\n if (!hasWidth) fixedWidth = false;\n if (!nextDOM) {\n colgroup.appendChild(document.createElement('col')).style.width =\n cssWidth;\n } else {\n if (nextDOM.style.width != cssWidth) nextDOM.style.width = cssWidth;\n nextDOM = nextDOM.nextSibling;\n }\n }\n }\n\n while (nextDOM) {\n let after = nextDOM.nextSibling;\n nextDOM.parentNode.removeChild(nextDOM);\n nextDOM = after;\n }\n\n if (fixedWidth) {\n table.style.width = totalWidth + 'px';\n table.style.minWidth = '';\n } else {\n table.style.width = '';\n table.style.minWidth = totalWidth + 'px';\n }\n}\n\nconst key = new PluginKey('tableColumnResizing');\n\nfunction columnResizing({\n handleWidth = 5,\n cellMinWidth = 25,\n View = TableView,\n lastColumnResizable = true,\n} = {}) {\n let plugin = new Plugin({\n key,\n state: {\n init(_, state) {\n this.spec.props.nodeViews[tableNodeTypes(state.schema).table.name] = (\n node,\n view,\n ) => new View(node, cellMinWidth, view);\n return new ResizeState(-1, false);\n },\n apply(tr, prev) {\n return prev.apply(tr);\n },\n },\n props: {\n attributes(state) {\n let pluginState = key.getState(state);\n return pluginState.activeHandle > -1\n ? { class: 'resize-cursor' }\n : null;\n },\n\n handleDOMEvents: {\n mousemove(view, event) {\n handleMouseMove(\n view,\n event,\n handleWidth,\n cellMinWidth,\n lastColumnResizable,\n );\n },\n mouseleave(view) {\n handleMouseLeave(view);\n },\n mousedown(view, event) {\n handleMouseDown(view, event, cellMinWidth);\n },\n },\n\n decorations(state) {\n let pluginState = key.getState(state);\n if (pluginState.activeHandle > -1)\n return handleDecorations(state, pluginState.activeHandle);\n },\n\n nodeViews: {},\n },\n });\n return plugin;\n}\n\nclass ResizeState {\n constructor(activeHandle, dragging) {\n this.activeHandle = activeHandle;\n this.dragging = dragging;\n }\n\n apply(tr) {\n let state = this,\n action = tr.getMeta(key);\n if (action && action.setHandle != null)\n return new ResizeState(action.setHandle, null);\n if (action && action.setDragging !== undefined)\n return new ResizeState(state.activeHandle, action.setDragging);\n if (state.activeHandle > -1 && tr.docChanged) {\n let handle = tr.mapping.map(state.activeHandle, -1);\n if (!pointsAtCell(tr.doc.resolve(handle))) handle = null;\n state = new ResizeState(handle, state.dragging);\n }\n return state;\n }\n}\n\nfunction handleMouseMove(\n view,\n event,\n handleWidth,\n cellMinWidth,\n lastColumnResizable,\n) {\n let pluginState = key.getState(view.state);\n\n if (!pluginState.dragging) {\n let target = domCellAround(event.target),\n cell = -1;\n if (target) {\n let { left, right } = target.getBoundingClientRect();\n if (event.clientX - left <= handleWidth)\n cell = edgeCell(view, event, 'left');\n else if (right - event.clientX <= handleWidth)\n cell = edgeCell(view, event, 'right');\n }\n\n if (cell != pluginState.activeHandle) {\n if (!lastColumnResizable && cell !== -1) {\n let $cell = view.state.doc.resolve(cell);\n let table = $cell.node(-1),\n map = TableMap.get(table),\n start = $cell.start(-1);\n let col =\n map.colCount($cell.pos - start) + $cell.nodeAfter.attrs.colspan - 1;\n\n if (col == map.width - 1) {\n return;\n }\n }\n\n updateHandle(view, cell);\n }\n }\n}\n\nfunction handleMouseLeave(view) {\n let pluginState = key.getState(view.state);\n if (pluginState.activeHandle > -1 && !pluginState.dragging)\n updateHandle(view, -1);\n}\n\nfunction handleMouseDown(view, event, cellMinWidth) {\n let pluginState = key.getState(view.state);\n if (pluginState.activeHandle == -1 || pluginState.dragging) return false;\n\n let cell = view.state.doc.nodeAt(pluginState.activeHandle);\n let width = currentColWidth(view, pluginState.activeHandle, cell.attrs);\n view.dispatch(\n view.state.tr.setMeta(key, {\n setDragging: { startX: event.clientX, startWidth: width },\n }),\n );\n\n function finish(event) {\n window.removeEventListener('mouseup', finish);\n window.removeEventListener('mousemove', move);\n let pluginState = key.getState(view.state);\n if (pluginState.dragging) {\n updateColumnWidth(\n view,\n pluginState.activeHandle,\n draggedWidth(pluginState.dragging, event, cellMinWidth),\n );\n view.dispatch(view.state.tr.setMeta(key, { setDragging: null }));\n }\n }\n function move(event) {\n if (!event.which) return finish(event);\n let pluginState = key.getState(view.state);\n let dragged = draggedWidth(pluginState.dragging, event, cellMinWidth);\n displayColumnWidth(view, pluginState.activeHandle, dragged, cellMinWidth);\n }\n\n window.addEventListener('mouseup', finish);\n window.addEventListener('mousemove', move);\n event.preventDefault();\n return true;\n}\n\nfunction currentColWidth(view, cellPos, { colspan, colwidth }) {\n let width = colwidth && colwidth[colwidth.length - 1];\n if (width) return width;\n let dom = view.domAtPos(cellPos);\n let node = dom.node.childNodes[dom.offset];\n let domWidth = node.offsetWidth,\n parts = colspan;\n if (colwidth)\n for (let i = 0; i < colspan; i++)\n if (colwidth[i]) {\n domWidth -= colwidth[i];\n parts--;\n }\n return domWidth / parts;\n}\n\nfunction domCellAround(target) {\n while (target && target.nodeName != 'TD' && target.nodeName != 'TH')\n target =\n target.classList && target.classList.contains('ProseMirror')\n ? null\n : target.parentNode;\n return target;\n}\n\nfunction edgeCell(view, event, side) {\n let found = view.posAtCoords({ left: event.clientX, top: event.clientY });\n if (!found) return -1;\n let { pos } = found;\n let $cell = cellAround(view.state.doc.resolve(pos));\n if (!$cell) return -1;\n if (side == 'right') return $cell.pos;\n let map = TableMap.get($cell.node(-1)),\n start = $cell.start(-1);\n let index = map.map.indexOf($cell.pos - start);\n return index % map.width == 0 ? -1 : start + map.map[index - 1];\n}\n\nfunction draggedWidth(dragging, event, cellMinWidth) {\n let offset = event.clientX - dragging.startX;\n return Math.max(cellMinWidth, dragging.startWidth + offset);\n}\n\nfunction updateHandle(view, value) {\n view.dispatch(view.state.tr.setMeta(key, { setHandle: value }));\n}\n\nfunction updateColumnWidth(view, cell, width) {\n let $cell = view.state.doc.resolve(cell);\n let table = $cell.node(-1),\n map = TableMap.get(table),\n start = $cell.start(-1);\n let col = map.colCount($cell.pos - start) + $cell.nodeAfter.attrs.colspan - 1;\n let tr = view.state.tr;\n for (let row = 0; row < map.height; row++) {\n let mapIndex = row * map.width + col;\n // Rowspanning cell that has already been handled\n if (row && map.map[mapIndex] == map.map[mapIndex - map.width]) continue;\n let pos = map.map[mapIndex],\n { attrs } = table.nodeAt(pos);\n let index = attrs.colspan == 1 ? 0 : col - map.colCount(pos);\n if (attrs.colwidth && attrs.colwidth[index] == width) continue;\n let colwidth = attrs.colwidth\n ? attrs.colwidth.slice()\n : zeroes(attrs.colspan);\n colwidth[index] = width;\n tr.setNodeMarkup(start + pos, null, setAttr(attrs, 'colwidth', colwidth));\n }\n if (tr.docChanged) view.dispatch(tr);\n}\n\nfunction displayColumnWidth(view, cell, width, cellMinWidth) {\n let $cell = view.state.doc.resolve(cell);\n let table = $cell.node(-1),\n start = $cell.start(-1);\n let col =\n TableMap.get(table).colCount($cell.pos - start) +\n $cell.nodeAfter.attrs.colspan -\n 1;\n let dom = view.domAtPos($cell.start(-1)).node;\n while (dom.nodeName != 'TABLE') dom = dom.parentNode;\n updateColumns(table, dom.firstChild, dom, cellMinWidth, col, width);\n}\n\nfunction zeroes(n) {\n let result = [];\n for (let i = 0; i < n; i++) result.push(0);\n return result;\n}\n\nfunction handleDecorations(state, cell) {\n let decorations = [];\n let $cell = state.doc.resolve(cell);\n let table = $cell.node(-1);\n if (!table) {\n return DecorationSet.empty;\n }\n let map = TableMap.get(table);\n let start = $cell.start(-1);\n let col = map.colCount($cell.pos - start) + $cell.nodeAfter.attrs.colspan;\n for (let row = 0; row < map.height; row++) {\n let index = col + row * map.width - 1;\n // For positions that are have either a different cell or the end\n // of the table to their right, and either the top of the table or\n // a different cell above them, add a decoration\n if (\n (col == map.width || map.map[index] != map.map[index + 1]) &&\n (row == 0 || map.map[index - 1] != map.map[index - 1 - map.width])\n ) {\n let cellPos = map.map[index];\n let pos = start + cellPos + table.nodeAt(cellPos).nodeSize - 1;\n let dom = document.createElement('div');\n dom.className = 'column-resize-handle';\n decorations.push(Decoration.widget(pos, dom));\n }\n }\n return DecorationSet.create(state.doc, decorations);\n}\n\n// This file defines a plugin that handles the drawing of cell\n\n// :: () → Plugin\n//\n// Creates a [plugin](http://prosemirror.net/docs/ref/#state.Plugin)\n// that, when added to an editor, enables cell-selection, handles\n// cell-based copy/paste, and makes sure tables stay well-formed (each\n// row has the same width, and cells don't overlap).\n//\n// You should probably put this plugin near the end of your array of\n// plugins, since it handles mouse and arrow key events in tables\n// rather broadly, and other plugins, like the gap cursor or the\n// column-width dragging plugin, might want to get a turn first to\n// perform more specific behavior.\nfunction tableEditing({ allowTableNodeSelection = false } = {}) {\n return new Plugin({\n key: key$1,\n\n // This piece of state is used to remember when a mouse-drag\n // cell-selection is happening, so that it can continue even as\n // transactions (which might move its anchor cell) come in.\n state: {\n init() {\n return null;\n },\n apply(tr, cur) {\n let set = tr.getMeta(key$1);\n if (set != null) return set == -1 ? null : set;\n if (cur == null || !tr.docChanged) return cur;\n let { deleted, pos } = tr.mapping.mapResult(cur);\n return deleted ? null : pos;\n },\n },\n\n props: {\n decorations: drawCellSelection,\n\n handleDOMEvents: {\n mousedown: handleMouseDown$1,\n },\n\n createSelectionBetween(view) {\n if (key$1.getState(view.state) != null)\n return view.state.selection;\n },\n\n handleTripleClick,\n\n handleKeyDown,\n\n handlePaste,\n },\n\n appendTransaction(_, oldState, state) {\n return normalizeSelection(\n state,\n fixTables(state, oldState),\n allowTableNodeSelection,\n );\n },\n });\n}\n\nexport { CellSelection, TableMap, TableView, clipCells as __clipCells, insertCells as __insertCells, pastedCells as __pastedCells, addColSpan, addColumn, addColumnAfter, addColumnBefore, addRow, addRowAfter, addRowBefore, cellAround, colCount, columnIsHeader, columnResizing, key as columnResizingPluginKey, deleteColumn, deleteRow, deleteTable, findCell, fixTables, fixTablesKey, goToNextCell, handlePaste, inSameTable, isInTable, mergeCells, moveCellForward, nextCell, pointsAtCell, removeColSpan, removeColumn, removeRow, rowIsHeader, selectedRect, selectionCell, setAttr, setCellAttr, splitCell, splitCellWithType, tableEditing, key$1 as tableEditingKey, tableNodeTypes, tableNodes, toggleHeader, toggleHeaderCell, toggleHeaderColumn, toggleHeaderRow, updateColumns as updateColumnsOnResize };\n//# sourceMappingURL=index.js.map\n","import { PluginKey, Plugin, TextSelection } from 'prosemirror-state';\n\nclass Rebaseable {\n constructor(step, inverted, origin) {\n this.step = step;\n this.inverted = inverted;\n this.origin = origin;\n }\n}\n/**\nUndo a given set of steps, apply a set of other steps, and then\nredo them @internal\n*/\nfunction rebaseSteps(steps, over, transform) {\n for (let i = steps.length - 1; i >= 0; i--)\n transform.step(steps[i].inverted);\n for (let i = 0; i < over.length; i++)\n transform.step(over[i]);\n let result = [];\n for (let i = 0, mapFrom = steps.length; i < steps.length; i++) {\n let mapped = steps[i].step.map(transform.mapping.slice(mapFrom));\n mapFrom--;\n if (mapped && !transform.maybeStep(mapped).failed) {\n transform.mapping.setMirror(mapFrom, transform.steps.length - 1);\n result.push(new Rebaseable(mapped, mapped.invert(transform.docs[transform.docs.length - 1]), steps[i].origin));\n }\n }\n return result;\n}\n// This state field accumulates changes that have to be sent to the\n// central authority in the collaborating group and makes it possible\n// to integrate changes made by peers into our local document. It is\n// defined by the plugin, and will be available as the `collab` field\n// in the resulting editor state.\nclass CollabState {\n constructor(\n // The version number of the last update received from the central\n // authority. Starts at 0 or the value of the `version` property\n // in the option object, for the editor's value when the option\n // was enabled.\n version, \n // The local steps that havent been successfully sent to the\n // server yet.\n unconfirmed) {\n this.version = version;\n this.unconfirmed = unconfirmed;\n }\n}\nfunction unconfirmedFrom(transform) {\n let result = [];\n for (let i = 0; i < transform.steps.length; i++)\n result.push(new Rebaseable(transform.steps[i], transform.steps[i].invert(transform.docs[i]), transform));\n return result;\n}\nconst collabKey = new PluginKey(\"collab\");\n/**\nCreates a plugin that enables the collaborative editing framework\nfor the editor.\n*/\nfunction collab(config = {}) {\n let conf = {\n version: config.version || 0,\n clientID: config.clientID == null ? Math.floor(Math.random() * 0xFFFFFFFF) : config.clientID\n };\n return new Plugin({\n key: collabKey,\n state: {\n init: () => new CollabState(conf.version, []),\n apply(tr, collab) {\n let newState = tr.getMeta(collabKey);\n if (newState)\n return newState;\n if (tr.docChanged)\n return new CollabState(collab.version, collab.unconfirmed.concat(unconfirmedFrom(tr)));\n return collab;\n }\n },\n config: conf,\n // This is used to notify the history plugin to not merge steps,\n // so that the history can be rebased.\n historyPreserveItems: true\n });\n}\n/**\nCreate a transaction that represents a set of new steps received from\nthe authority. Applying this transaction moves the state forward to\nadjust to the authority's view of the document.\n*/\nfunction receiveTransaction(state, steps, clientIDs, options = {}) {\n // Pushes a set of steps (received from the central authority) into\n // the editor state (which should have the collab plugin enabled).\n // Will recognize its own changes, and confirm unconfirmed steps as\n // appropriate. Remaining unconfirmed steps will be rebased over\n // remote steps.\n let collabState = collabKey.getState(state);\n let version = collabState.version + steps.length;\n let ourID = collabKey.get(state).spec.config.clientID;\n // Find out which prefix of the steps originated with us\n let ours = 0;\n while (ours < clientIDs.length && clientIDs[ours] == ourID)\n ++ours;\n let unconfirmed = collabState.unconfirmed.slice(ours);\n steps = ours ? steps.slice(ours) : steps;\n // If all steps originated with us, we're done.\n if (!steps.length)\n return state.tr.setMeta(collabKey, new CollabState(version, unconfirmed));\n let nUnconfirmed = unconfirmed.length;\n let tr = state.tr;\n if (nUnconfirmed) {\n unconfirmed = rebaseSteps(unconfirmed, steps, tr);\n }\n else {\n for (let i = 0; i < steps.length; i++)\n tr.step(steps[i]);\n unconfirmed = [];\n }\n let newCollabState = new CollabState(version, unconfirmed);\n if (options && options.mapSelectionBackward && state.selection instanceof TextSelection) {\n tr.setSelection(TextSelection.between(tr.doc.resolve(tr.mapping.map(state.selection.anchor, -1)), tr.doc.resolve(tr.mapping.map(state.selection.head, -1)), -1));\n tr.updated &= ~1;\n }\n return tr.setMeta(\"rebased\", nUnconfirmed).setMeta(\"addToHistory\", false).setMeta(collabKey, newCollabState);\n}\n/**\nProvides data describing the editor's unconfirmed steps, which need\nto be sent to the central authority. Returns null when there is\nnothing to send.\n\n`origins` holds the _original_ transactions that produced each\nsteps. This can be useful for looking up time stamps and other\nmetadata for the steps, but note that the steps may have been\nrebased, whereas the origin transactions are still the old,\nunchanged objects.\n*/\nfunction sendableSteps(state) {\n let collabState = collabKey.getState(state);\n if (collabState.unconfirmed.length == 0)\n return null;\n return {\n version: collabState.version,\n steps: collabState.unconfirmed.map(s => s.step),\n clientID: collabKey.get(state).spec.config.clientID,\n get origins() {\n return this._origins || (this._origins = collabState.unconfirmed.map(s => s.origin));\n }\n };\n}\n/**\nGet the version up to which the collab plugin has synced with the\ncentral authority.\n*/\nfunction getVersion(state) {\n return collabKey.getState(state).version;\n}\n\nexport { collab, getVersion, rebaseSteps, receiveTransaction, sendableSteps };\n","var GOOD_LEAF_SIZE = 200;\n\n// :: class<T> A rope sequence is a persistent sequence data structure\n// that supports appending, prepending, and slicing without doing a\n// full copy. It is represented as a mostly-balanced tree.\nvar RopeSequence = function RopeSequence () {};\n\nRopeSequence.prototype.append = function append (other) {\n if (!other.length) { return this }\n other = RopeSequence.from(other);\n\n return (!this.length && other) ||\n (other.length < GOOD_LEAF_SIZE && this.leafAppend(other)) ||\n (this.length < GOOD_LEAF_SIZE && other.leafPrepend(this)) ||\n this.appendInner(other)\n};\n\n// :: (union<[T], RopeSequence<T>>) → RopeSequence<T>\n// Prepend an array or other rope to this one, returning a new rope.\nRopeSequence.prototype.prepend = function prepend (other) {\n if (!other.length) { return this }\n return RopeSequence.from(other).append(this)\n};\n\nRopeSequence.prototype.appendInner = function appendInner (other) {\n return new Append(this, other)\n};\n\n// :: (?number, ?number) → RopeSequence<T>\n// Create a rope repesenting a sub-sequence of this rope.\nRopeSequence.prototype.slice = function slice (from, to) {\n if ( from === void 0 ) from = 0;\n if ( to === void 0 ) to = this.length;\n\n if (from >= to) { return RopeSequence.empty }\n return this.sliceInner(Math.max(0, from), Math.min(this.length, to))\n};\n\n// :: (number) → T\n// Retrieve the element at the given position from this rope.\nRopeSequence.prototype.get = function get (i) {\n if (i < 0 || i >= this.length) { return undefined }\n return this.getInner(i)\n};\n\n// :: ((element: T, index: number) → ?bool, ?number, ?number)\n// Call the given function for each element between the given\n// indices. This tends to be more efficient than looping over the\n// indices and calling `get`, because it doesn't have to descend the\n// tree for every element.\nRopeSequence.prototype.forEach = function forEach (f, from, to) {\n if ( from === void 0 ) from = 0;\n if ( to === void 0 ) to = this.length;\n\n if (from <= to)\n { this.forEachInner(f, from, to, 0); }\n else\n { this.forEachInvertedInner(f, from, to, 0); }\n};\n\n// :: ((element: T, index: number) → U, ?number, ?number) → [U]\n// Map the given functions over the elements of the rope, producing\n// a flat array.\nRopeSequence.prototype.map = function map (f, from, to) {\n if ( from === void 0 ) from = 0;\n if ( to === void 0 ) to = this.length;\n\n var result = [];\n this.forEach(function (elt, i) { return result.push(f(elt, i)); }, from, to);\n return result\n};\n\n// :: (?union<[T], RopeSequence<T>>) → RopeSequence<T>\n// Create a rope representing the given array, or return the rope\n// itself if a rope was given.\nRopeSequence.from = function from (values) {\n if (values instanceof RopeSequence) { return values }\n return values && values.length ? new Leaf(values) : RopeSequence.empty\n};\n\nvar Leaf = /*@__PURE__*/(function (RopeSequence) {\n function Leaf(values) {\n RopeSequence.call(this);\n this.values = values;\n }\n\n if ( RopeSequence ) Leaf.__proto__ = RopeSequence;\n Leaf.prototype = Object.create( RopeSequence && RopeSequence.prototype );\n Leaf.prototype.constructor = Leaf;\n\n var prototypeAccessors = { length: { configurable: true },depth: { configurable: true } };\n\n Leaf.prototype.flatten = function flatten () {\n return this.values\n };\n\n Leaf.prototype.sliceInner = function sliceInner (from, to) {\n if (from == 0 && to == this.length) { return this }\n return new Leaf(this.values.slice(from, to))\n };\n\n Leaf.prototype.getInner = function getInner (i) {\n return this.values[i]\n };\n\n Leaf.prototype.forEachInner = function forEachInner (f, from, to, start) {\n for (var i = from; i < to; i++)\n { if (f(this.values[i], start + i) === false) { return false } }\n };\n\n Leaf.prototype.forEachInvertedInner = function forEachInvertedInner (f, from, to, start) {\n for (var i = from - 1; i >= to; i--)\n { if (f(this.values[i], start + i) === false) { return false } }\n };\n\n Leaf.prototype.leafAppend = function leafAppend (other) {\n if (this.length + other.length <= GOOD_LEAF_SIZE)\n { return new Leaf(this.values.concat(other.flatten())) }\n };\n\n Leaf.prototype.leafPrepend = function leafPrepend (other) {\n if (this.length + other.length <= GOOD_LEAF_SIZE)\n { return new Leaf(other.flatten().concat(this.values)) }\n };\n\n prototypeAccessors.length.get = function () { return this.values.length };\n\n prototypeAccessors.depth.get = function () { return 0 };\n\n Object.defineProperties( Leaf.prototype, prototypeAccessors );\n\n return Leaf;\n}(RopeSequence));\n\n// :: RopeSequence\n// The empty rope sequence.\nRopeSequence.empty = new Leaf([]);\n\nvar Append = /*@__PURE__*/(function (RopeSequence) {\n function Append(left, right) {\n RopeSequence.call(this);\n this.left = left;\n this.right = right;\n this.length = left.length + right.length;\n this.depth = Math.max(left.depth, right.depth) + 1;\n }\n\n if ( RopeSequence ) Append.__proto__ = RopeSequence;\n Append.prototype = Object.create( RopeSequence && RopeSequence.prototype );\n Append.prototype.constructor = Append;\n\n Append.prototype.flatten = function flatten () {\n return this.left.flatten().concat(this.right.flatten())\n };\n\n Append.prototype.getInner = function getInner (i) {\n return i < this.left.length ? this.left.get(i) : this.right.get(i - this.left.length)\n };\n\n Append.prototype.forEachInner = function forEachInner (f, from, to, start) {\n var leftLen = this.left.length;\n if (from < leftLen &&\n this.left.forEachInner(f, from, Math.min(to, leftLen), start) === false)\n { return false }\n if (to > leftLen &&\n this.right.forEachInner(f, Math.max(from - leftLen, 0), Math.min(this.length, to) - leftLen, start + leftLen) === false)\n { return false }\n };\n\n Append.prototype.forEachInvertedInner = function forEachInvertedInner (f, from, to, start) {\n var leftLen = this.left.length;\n if (from > leftLen &&\n this.right.forEachInvertedInner(f, from - leftLen, Math.max(to, leftLen) - leftLen, start + leftLen) === false)\n { return false }\n if (to < leftLen &&\n this.left.forEachInvertedInner(f, Math.min(from, leftLen), to, start) === false)\n { return false }\n };\n\n Append.prototype.sliceInner = function sliceInner (from, to) {\n if (from == 0 && to == this.length) { return this }\n var leftLen = this.left.length;\n if (to <= leftLen) { return this.left.slice(from, to) }\n if (from >= leftLen) { return this.right.slice(from - leftLen, to - leftLen) }\n return this.left.slice(from, leftLen).append(this.right.slice(0, to - leftLen))\n };\n\n Append.prototype.leafAppend = function leafAppend (other) {\n var inner = this.right.leafAppend(other);\n if (inner) { return new Append(this.left, inner) }\n };\n\n Append.prototype.leafPrepend = function leafPrepend (other) {\n var inner = this.left.leafPrepend(other);\n if (inner) { return new Append(inner, this.right) }\n };\n\n Append.prototype.appendInner = function appendInner (other) {\n if (this.left.depth >= Math.max(this.right.depth, other.depth) + 1)\n { return new Append(this.left, new Append(this.right, other)) }\n return new Append(this, other)\n };\n\n return Append;\n}(RopeSequence));\n\nvar ropeSequence = RopeSequence;\n\nexport default ropeSequence;\n","import RopeSequence from 'rope-sequence';\nimport { Mapping } from 'prosemirror-transform';\nimport { PluginKey, Plugin } from 'prosemirror-state';\n\n// ProseMirror's history isn't simply a way to roll back to a previous\n// state, because ProseMirror supports applying changes without adding\n// them to the history (for example during collaboration).\n//\n// To this end, each 'Branch' (one for the undo history and one for\n// the redo history) keeps an array of 'Items', which can optionally\n// hold a step (an actual undoable change), and always hold a position\n// map (which is needed to move changes below them to apply to the\n// current document).\n//\n// An item that has both a step and a selection bookmark is the start\n// of an 'event' — a group of changes that will be undone or redone at\n// once. (It stores only the bookmark, since that way we don't have to\n// provide a document until the selection is actually applied, which\n// is useful when compressing.)\n// Used to schedule history compression\nconst max_empty_items = 500;\nclass Branch {\n constructor(items, eventCount) {\n this.items = items;\n this.eventCount = eventCount;\n }\n // Pop the latest event off the branch's history and apply it\n // to a document transform.\n popEvent(state, preserveItems) {\n if (this.eventCount == 0)\n return null;\n let end = this.items.length;\n for (;; end--) {\n let next = this.items.get(end - 1);\n if (next.selection) {\n --end;\n break;\n }\n }\n let remap, mapFrom;\n if (preserveItems) {\n remap = this.remapping(end, this.items.length);\n mapFrom = remap.maps.length;\n }\n let transform = state.tr;\n let selection, remaining;\n let addAfter = [], addBefore = [];\n this.items.forEach((item, i) => {\n if (!item.step) {\n if (!remap) {\n remap = this.remapping(end, i + 1);\n mapFrom = remap.maps.length;\n }\n mapFrom--;\n addBefore.push(item);\n return;\n }\n if (remap) {\n addBefore.push(new Item(item.map));\n let step = item.step.map(remap.slice(mapFrom)), map;\n if (step && transform.maybeStep(step).doc) {\n map = transform.mapping.maps[transform.mapping.maps.length - 1];\n addAfter.push(new Item(map, undefined, undefined, addAfter.length + addBefore.length));\n }\n mapFrom--;\n if (map)\n remap.appendMap(map, mapFrom);\n }\n else {\n transform.maybeStep(item.step);\n }\n if (item.selection) {\n selection = remap ? item.selection.map(remap.slice(mapFrom)) : item.selection;\n remaining = new Branch(this.items.slice(0, end).append(addBefore.reverse().concat(addAfter)), this.eventCount - 1);\n return false;\n }\n }, this.items.length, 0);\n return { remaining: remaining, transform, selection: selection };\n }\n // Create a new branch with the given transform added.\n addTransform(transform, selection, histOptions, preserveItems) {\n let newItems = [], eventCount = this.eventCount;\n let oldItems = this.items, lastItem = !preserveItems && oldItems.length ? oldItems.get(oldItems.length - 1) : null;\n for (let i = 0; i < transform.steps.length; i++) {\n let step = transform.steps[i].invert(transform.docs[i]);\n let item = new Item(transform.mapping.maps[i], step, selection), merged;\n if (merged = lastItem && lastItem.merge(item)) {\n item = merged;\n if (i)\n newItems.pop();\n else\n oldItems = oldItems.slice(0, oldItems.length - 1);\n }\n newItems.push(item);\n if (selection) {\n eventCount++;\n selection = undefined;\n }\n if (!preserveItems)\n lastItem = item;\n }\n let overflow = eventCount - histOptions.depth;\n if (overflow > DEPTH_OVERFLOW) {\n oldItems = cutOffEvents(oldItems, overflow);\n eventCount -= overflow;\n }\n return new Branch(oldItems.append(newItems), eventCount);\n }\n remapping(from, to) {\n let maps = new Mapping;\n this.items.forEach((item, i) => {\n let mirrorPos = item.mirrorOffset != null && i - item.mirrorOffset >= from\n ? maps.maps.length - item.mirrorOffset : undefined;\n maps.appendMap(item.map, mirrorPos);\n }, from, to);\n return maps;\n }\n addMaps(array) {\n if (this.eventCount == 0)\n return this;\n return new Branch(this.items.append(array.map(map => new Item(map))), this.eventCount);\n }\n // When the collab module receives remote changes, the history has\n // to know about those, so that it can adjust the steps that were\n // rebased on top of the remote changes, and include the position\n // maps for the remote changes in its array of items.\n rebased(rebasedTransform, rebasedCount) {\n if (!this.eventCount)\n return this;\n let rebasedItems = [], start = Math.max(0, this.items.length - rebasedCount);\n let mapping = rebasedTransform.mapping;\n let newUntil = rebasedTransform.steps.length;\n let eventCount = this.eventCount;\n this.items.forEach(item => { if (item.selection)\n eventCount--; }, start);\n let iRebased = rebasedCount;\n this.items.forEach(item => {\n let pos = mapping.getMirror(--iRebased);\n if (pos == null)\n return;\n newUntil = Math.min(newUntil, pos);\n let map = mapping.maps[pos];\n if (item.step) {\n let step = rebasedTransform.steps[pos].invert(rebasedTransform.docs[pos]);\n let selection = item.selection && item.selection.map(mapping.slice(iRebased + 1, pos));\n if (selection)\n eventCount++;\n rebasedItems.push(new Item(map, step, selection));\n }\n else {\n rebasedItems.push(new Item(map));\n }\n }, start);\n let newMaps = [];\n for (let i = rebasedCount; i < newUntil; i++)\n newMaps.push(new Item(mapping.maps[i]));\n let items = this.items.slice(0, start).append(newMaps).append(rebasedItems);\n let branch = new Branch(items, eventCount);\n if (branch.emptyItemCount() > max_empty_items)\n branch = branch.compress(this.items.length - rebasedItems.length);\n return branch;\n }\n emptyItemCount() {\n let count = 0;\n this.items.forEach(item => { if (!item.step)\n count++; });\n return count;\n }\n // Compressing a branch means rewriting it to push the air (map-only\n // items) out. During collaboration, these naturally accumulate\n // because each remote change adds one. The `upto` argument is used\n // to ensure that only the items below a given level are compressed,\n // because `rebased` relies on a clean, untouched set of items in\n // order to associate old items with rebased steps.\n compress(upto = this.items.length) {\n let remap = this.remapping(0, upto), mapFrom = remap.maps.length;\n let items = [], events = 0;\n this.items.forEach((item, i) => {\n if (i >= upto) {\n items.push(item);\n if (item.selection)\n events++;\n }\n else if (item.step) {\n let step = item.step.map(remap.slice(mapFrom)), map = step && step.getMap();\n mapFrom--;\n if (map)\n remap.appendMap(map, mapFrom);\n if (step) {\n let selection = item.selection && item.selection.map(remap.slice(mapFrom));\n if (selection)\n events++;\n let newItem = new Item(map.invert(), step, selection), merged, last = items.length - 1;\n if (merged = items.length && items[last].merge(newItem))\n items[last] = merged;\n else\n items.push(newItem);\n }\n }\n else if (item.map) {\n mapFrom--;\n }\n }, this.items.length, 0);\n return new Branch(RopeSequence.from(items.reverse()), events);\n }\n}\nBranch.empty = new Branch(RopeSequence.empty, 0);\nfunction cutOffEvents(items, n) {\n let cutPoint;\n items.forEach((item, i) => {\n if (item.selection && (n-- == 0)) {\n cutPoint = i;\n return false;\n }\n });\n return items.slice(cutPoint);\n}\nclass Item {\n constructor(\n // The (forward) step map for this item.\n map, \n // The inverted step\n step, \n // If this is non-null, this item is the start of a group, and\n // this selection is the starting selection for the group (the one\n // that was active before the first step was applied)\n selection, \n // If this item is the inverse of a previous mapping on the stack,\n // this points at the inverse's offset\n mirrorOffset) {\n this.map = map;\n this.step = step;\n this.selection = selection;\n this.mirrorOffset = mirrorOffset;\n }\n merge(other) {\n if (this.step && other.step && !other.selection) {\n let step = other.step.merge(this.step);\n if (step)\n return new Item(step.getMap().invert(), step, this.selection);\n }\n }\n}\n// The value of the state field that tracks undo/redo history for that\n// state. Will be stored in the plugin state when the history plugin\n// is active.\nclass HistoryState {\n constructor(done, undone, prevRanges, prevTime) {\n this.done = done;\n this.undone = undone;\n this.prevRanges = prevRanges;\n this.prevTime = prevTime;\n }\n}\nconst DEPTH_OVERFLOW = 20;\n// Record a transformation in undo history.\nfunction applyTransaction(history, state, tr, options) {\n let historyTr = tr.getMeta(historyKey), rebased;\n if (historyTr)\n return historyTr.historyState;\n if (tr.getMeta(closeHistoryKey))\n history = new HistoryState(history.done, history.undone, null, 0);\n let appended = tr.getMeta(\"appendedTransaction\");\n if (tr.steps.length == 0) {\n return history;\n }\n else if (appended && appended.getMeta(historyKey)) {\n if (appended.getMeta(historyKey).redo)\n return new HistoryState(history.done.addTransform(tr, undefined, options, mustPreserveItems(state)), history.undone, rangesFor(tr.mapping.maps[tr.steps.length - 1]), history.prevTime);\n else\n return new HistoryState(history.done, history.undone.addTransform(tr, undefined, options, mustPreserveItems(state)), null, history.prevTime);\n }\n else if (tr.getMeta(\"addToHistory\") !== false && !(appended && appended.getMeta(\"addToHistory\") === false)) {\n // Group transforms that occur in quick succession into one event.\n let newGroup = history.prevTime == 0 || !appended && (history.prevTime < (tr.time || 0) - options.newGroupDelay ||\n !isAdjacentTo(tr, history.prevRanges));\n let prevRanges = appended ? mapRanges(history.prevRanges, tr.mapping) : rangesFor(tr.mapping.maps[tr.steps.length - 1]);\n return new HistoryState(history.done.addTransform(tr, newGroup ? state.selection.getBookmark() : undefined, options, mustPreserveItems(state)), Branch.empty, prevRanges, tr.time);\n }\n else if (rebased = tr.getMeta(\"rebased\")) {\n // Used by the collab module to tell the history that some of its\n // content has been rebased.\n return new HistoryState(history.done.rebased(tr, rebased), history.undone.rebased(tr, rebased), mapRanges(history.prevRanges, tr.mapping), history.prevTime);\n }\n else {\n return new HistoryState(history.done.addMaps(tr.mapping.maps), history.undone.addMaps(tr.mapping.maps), mapRanges(history.prevRanges, tr.mapping), history.prevTime);\n }\n}\nfunction isAdjacentTo(transform, prevRanges) {\n if (!prevRanges)\n return false;\n if (!transform.docChanged)\n return true;\n let adjacent = false;\n transform.mapping.maps[0].forEach((start, end) => {\n for (let i = 0; i < prevRanges.length; i += 2)\n if (start <= prevRanges[i + 1] && end >= prevRanges[i])\n adjacent = true;\n });\n return adjacent;\n}\nfunction rangesFor(map) {\n let result = [];\n map.forEach((_from, _to, from, to) => result.push(from, to));\n return result;\n}\nfunction mapRanges(ranges, mapping) {\n if (!ranges)\n return null;\n let result = [];\n for (let i = 0; i < ranges.length; i += 2) {\n let from = mapping.map(ranges[i], 1), to = mapping.map(ranges[i + 1], -1);\n if (from <= to)\n result.push(from, to);\n }\n return result;\n}\n// Apply the latest event from one branch to the document and shift the event\n// onto the other branch.\nfunction histTransaction(history, state, dispatch, redo) {\n let preserveItems = mustPreserveItems(state);\n let histOptions = historyKey.get(state).spec.config;\n let pop = (redo ? history.undone : history.done).popEvent(state, preserveItems);\n if (!pop)\n return;\n let selection = pop.selection.resolve(pop.transform.doc);\n let added = (redo ? history.done : history.undone).addTransform(pop.transform, state.selection.getBookmark(), histOptions, preserveItems);\n let newHist = new HistoryState(redo ? added : pop.remaining, redo ? pop.remaining : added, null, 0);\n dispatch(pop.transform.setSelection(selection).setMeta(historyKey, { redo, historyState: newHist }).scrollIntoView());\n}\nlet cachedPreserveItems = false, cachedPreserveItemsPlugins = null;\n// Check whether any plugin in the given state has a\n// `historyPreserveItems` property in its spec, in which case we must\n// preserve steps exactly as they came in, so that they can be\n// rebased.\nfunction mustPreserveItems(state) {\n let plugins = state.plugins;\n if (cachedPreserveItemsPlugins != plugins) {\n cachedPreserveItems = false;\n cachedPreserveItemsPlugins = plugins;\n for (let i = 0; i < plugins.length; i++)\n if (plugins[i].spec.historyPreserveItems) {\n cachedPreserveItems = true;\n break;\n }\n }\n return cachedPreserveItems;\n}\n/**\nSet a flag on the given transaction that will prevent further steps\nfrom being appended to an existing history event (so that they\nrequire a separate undo command to undo).\n*/\nfunction closeHistory(tr) {\n return tr.setMeta(closeHistoryKey, true);\n}\nconst historyKey = new PluginKey(\"history\");\nconst closeHistoryKey = new PluginKey(\"closeHistory\");\n/**\nReturns a plugin that enables the undo history for an editor. The\nplugin will track undo and redo stacks, which can be used with the\n[`undo`](https://prosemirror.net/docs/ref/#history.undo) and [`redo`](https://prosemirror.net/docs/ref/#history.redo) commands.\n\nYou can set an `\"addToHistory\"` [metadata\nproperty](https://prosemirror.net/docs/ref/#state.Transaction.setMeta) of `false` on a transaction\nto prevent it from being rolled back by undo.\n*/\nfunction history(config = {}) {\n config = { depth: config.depth || 100,\n newGroupDelay: config.newGroupDelay || 500 };\n return new Plugin({\n key: historyKey,\n state: {\n init() {\n return new HistoryState(Branch.empty, Branch.empty, null, 0);\n },\n apply(tr, hist, state) {\n return applyTransaction(hist, state, tr, config);\n }\n },\n config,\n props: {\n handleDOMEvents: {\n beforeinput(view, e) {\n let inputType = e.inputType;\n let command = inputType == \"historyUndo\" ? undo : inputType == \"historyRedo\" ? redo : null;\n if (!command)\n return false;\n e.preventDefault();\n return command(view.state, view.dispatch);\n }\n }\n }\n });\n}\n/**\nA command function that undoes the last change, if any.\n*/\nconst undo = (state, dispatch) => {\n let hist = historyKey.getState(state);\n if (!hist || hist.done.eventCount == 0)\n return false;\n if (dispatch)\n histTransaction(hist, state, dispatch, false);\n return true;\n};\n/**\nA command function that redoes the last undone change, if any.\n*/\nconst redo = (state, dispatch) => {\n let hist = historyKey.getState(state);\n if (!hist || hist.undone.eventCount == 0)\n return false;\n if (dispatch)\n histTransaction(hist, state, dispatch, true);\n return true;\n};\n/**\nThe amount of undoable events available in a given state.\n*/\nfunction undoDepth(state) {\n let hist = historyKey.getState(state);\n return hist ? hist.done.eventCount : 0;\n}\n/**\nThe amount of redoable events available in a given editor state.\n*/\nfunction redoDepth(state) {\n let hist = historyKey.getState(state);\n return hist ? hist.undone.eventCount : 0;\n}\n\nexport { closeHistory, history, redo, redoDepth, undo, undoDepth };\n","\n /*!\n * tiptap-extensions v1.35.1\n * (c) 2021 überdosis GbR (limited liability)\n * @license MIT\n */\n \nimport { Node, Plugin, PluginKey, Mark, Extension } from 'tiptap';\nimport { toggleWrap, wrappingInputRule, toggleList, toggleBlockType, setBlockType, textblockTypeInputRule, chainCommands, exitCode, nodeInputRule, splitListItem, sinkListItem, liftListItem, insertText, replaceText, splitToDefaultListItem, toggleMark, markInputRule, markPasteRule, updateMark, removeMark, pasteRule } from 'tiptap-commands';\nimport low from 'lowlight/lib/core';\nimport { DecorationSet, Decoration } from 'prosemirror-view';\nimport { findBlockNodes, createTable, getMarkAttrs, nodeEqualsType } from 'tiptap-utils';\nimport { Fragment } from 'prosemirror-model';\nimport { Plugin as Plugin$1, PluginKey as PluginKey$1, TextSelection } from 'prosemirror-state';\nimport { tableNodes, addColumnBefore, addColumnAfter, deleteColumn, addRowBefore, addRowAfter, deleteRow, deleteTable, mergeCells, splitCell, toggleHeaderColumn, toggleHeaderRow, toggleHeaderCell, setCellAttr, fixTables, goToNextCell, columnResizing, tableEditing } from 'prosemirror-tables';\nimport { Step } from 'prosemirror-transform';\nimport { sendableSteps, getVersion, receiveTransaction, collab } from 'prosemirror-collab';\nimport { history, undo, redo, undoDepth, redoDepth } from 'prosemirror-history';\n\nclass Blockquote extends Node {\n get name() {\n return 'blockquote';\n }\n\n get schema() {\n return {\n content: 'block*',\n group: 'block',\n defining: true,\n draggable: false,\n parseDOM: [{\n tag: 'blockquote'\n }],\n toDOM: () => ['blockquote', 0]\n };\n }\n\n commands({\n type\n }) {\n return () => toggleWrap(type);\n }\n\n keys({\n type\n }) {\n return {\n 'Ctrl->': toggleWrap(type)\n };\n }\n\n inputRules({\n type\n }) {\n return [wrappingInputRule(/^\\s*>\\s$/, type)];\n }\n\n}\n\nclass BulletList extends Node {\n get name() {\n return 'bullet_list';\n }\n\n get schema() {\n return {\n content: 'list_item+',\n group: 'block',\n parseDOM: [{\n tag: 'ul'\n }],\n toDOM: () => ['ul', 0]\n };\n }\n\n commands({\n type,\n schema\n }) {\n return () => toggleList(type, schema.nodes.list_item);\n }\n\n keys({\n type,\n schema\n }) {\n return {\n 'Shift-Ctrl-8': toggleList(type, schema.nodes.list_item)\n };\n }\n\n inputRules({\n type\n }) {\n return [wrappingInputRule(/^\\s*([-+*])\\s$/, type)];\n }\n\n}\n\nclass CodeBlock extends Node {\n get name() {\n return 'code_block';\n }\n\n get schema() {\n return {\n content: 'text*',\n marks: '',\n group: 'block',\n code: true,\n defining: true,\n draggable: false,\n parseDOM: [{\n tag: 'pre',\n preserveWhitespace: 'full'\n }],\n toDOM: () => ['pre', ['code', 0]]\n };\n }\n\n commands({\n type,\n schema\n }) {\n return () => toggleBlockType(type, schema.nodes.paragraph);\n }\n\n keys({\n type\n }) {\n return {\n 'Shift-Ctrl-\\\\': setBlockType(type)\n };\n }\n\n inputRules({\n type\n }) {\n return [textblockTypeInputRule(/^```$/, type)];\n }\n\n}\n\nfunction getDecorations({\n doc,\n name\n}) {\n const decorations = [];\n const blocks = findBlockNodes(doc).filter(item => item.node.type.name === name);\n\n const flatten = list => list.reduce((a, b) => a.concat(Array.isArray(b) ? flatten(b) : b), []);\n\n function parseNodes(nodes, className = []) {\n return nodes.map(node => {\n const classes = [...className, ...(node.properties ? node.properties.className : [])];\n\n if (node.children) {\n return parseNodes(node.children, classes);\n }\n\n return {\n text: node.value,\n classes\n };\n });\n }\n\n blocks.forEach(block => {\n let startPos = block.pos + 1;\n const nodes = low.highlightAuto(block.node.textContent).value;\n flatten(parseNodes(nodes)).map(node => {\n const from = startPos;\n const to = from + node.text.length;\n startPos = to;\n return { ...node,\n from,\n to\n };\n }).forEach(node => {\n const decoration = Decoration.inline(node.from, node.to, {\n class: node.classes.join(' ')\n });\n decorations.push(decoration);\n });\n });\n return DecorationSet.create(doc, decorations);\n}\n\nfunction HighlightPlugin({\n name\n}) {\n return new Plugin({\n name: new PluginKey('highlight'),\n state: {\n init: (_, {\n doc\n }) => getDecorations({\n doc,\n name\n }),\n apply: (transaction, decorationSet, oldState, newState) => {\n // TODO: find way to cache decorations\n // https://discuss.prosemirror.net/t/how-to-update-multiple-inline-decorations-on-node-change/1493\n const oldNodeName = oldState.selection.$head.parent.type.name;\n const newNodeName = newState.selection.$head.parent.type.name;\n const oldNodes = findBlockNodes(oldState.doc).filter(item => item.node.type.name === name);\n const newNodes = findBlockNodes(newState.doc).filter(item => item.node.type.name === name); // Apply decorations if selection includes named node, or transaction changes named node.\n\n if (transaction.docChanged && ([oldNodeName, newNodeName].includes(name) || newNodes.length !== oldNodes.length)) {\n return getDecorations({\n doc: transaction.doc,\n name\n });\n }\n\n return decorationSet.map(transaction.mapping, transaction.doc);\n }\n },\n props: {\n decorations(state) {\n return this.getState(state);\n }\n\n }\n });\n}\n\nclass CodeBlockHighlight extends Node {\n constructor(options = {}) {\n super(options);\n\n try {\n Object.entries(this.options.languages).forEach(([name, mapping]) => {\n low.registerLanguage(name, mapping);\n });\n } catch (err) {\n throw new Error('Invalid syntax highlight definitions: define at least one highlight.js language mapping');\n }\n }\n\n get name() {\n return 'code_block';\n }\n\n get defaultOptions() {\n return {\n languages: {}\n };\n }\n\n get schema() {\n return {\n content: 'text*',\n marks: '',\n group: 'block',\n code: true,\n defining: true,\n draggable: false,\n parseDOM: [{\n tag: 'pre',\n preserveWhitespace: 'full'\n }],\n toDOM: () => ['pre', ['code', 0]]\n };\n }\n\n commands({\n type,\n schema\n }) {\n return () => toggleBlockType(type, schema.nodes.paragraph);\n }\n\n keys({\n type\n }) {\n return {\n 'Shift-Ctrl-\\\\': setBlockType(type)\n };\n }\n\n inputRules({\n type\n }) {\n return [textblockTypeInputRule(/^```$/, type)];\n }\n\n get plugins() {\n return [HighlightPlugin({\n name: this.name\n })];\n }\n\n}\n\nclass HardBreak extends Node {\n get name() {\n return 'hard_break';\n }\n\n get schema() {\n return {\n inline: true,\n group: 'inline',\n selectable: false,\n parseDOM: [{\n tag: 'br'\n }],\n toDOM: () => ['br']\n };\n }\n\n commands({\n type\n }) {\n return () => chainCommands(exitCode, (state, dispatch) => {\n dispatch(state.tr.replaceSelectionWith(type.create()).scrollIntoView());\n return true;\n });\n }\n\n keys({\n type\n }) {\n const command = chainCommands(exitCode, (state, dispatch) => {\n dispatch(state.tr.replaceSelectionWith(type.create()).scrollIntoView());\n return true;\n });\n return {\n 'Mod-Enter': command,\n 'Shift-Enter': command\n };\n }\n\n}\n\nclass Heading extends Node {\n get name() {\n return 'heading';\n }\n\n get defaultOptions() {\n return {\n levels: [1, 2, 3, 4, 5, 6]\n };\n }\n\n get schema() {\n return {\n attrs: {\n level: {\n default: 1\n }\n },\n content: 'inline*',\n group: 'block',\n defining: true,\n draggable: false,\n parseDOM: this.options.levels.map(level => ({\n tag: `h${level}`,\n attrs: {\n level\n }\n })),\n toDOM: node => [`h${node.attrs.level}`, 0]\n };\n }\n\n commands({\n type,\n schema\n }) {\n return attrs => toggleBlockType(type, schema.nodes.paragraph, attrs);\n }\n\n keys({\n type\n }) {\n return this.options.levels.reduce((items, level) => ({ ...items,\n ...{\n [`Shift-Ctrl-${level}`]: setBlockType(type, {\n level\n })\n }\n }), {});\n }\n\n inputRules({\n type\n }) {\n return this.options.levels.map(level => textblockTypeInputRule(new RegExp(`^(#{1,${level}})\\\\s$`), type, () => ({\n level\n })));\n }\n\n}\n\nclass HorizontalRule extends Node {\n get name() {\n return 'horizontal_rule';\n }\n\n get schema() {\n return {\n group: 'block',\n parseDOM: [{\n tag: 'hr'\n }],\n toDOM: () => ['hr']\n };\n }\n\n commands({\n type\n }) {\n return () => (state, dispatch) => dispatch(state.tr.replaceSelectionWith(type.create()));\n }\n\n inputRules({\n type\n }) {\n return [nodeInputRule(/^(?:---|___\\s|\\*\\*\\*\\s)$/, type)];\n }\n\n}\n\n/**\n * Matches following attributes in Markdown-typed image: [, alt, src, title]\n *\n * Example:\n *  -> [, \"Lorem\", \"image.jpg\"]\n * ![](image.jpg \"Ipsum\") -> [, \"\", \"image.jpg\", \"Ipsum\"]\n * ![Lorem](image.jpg \"Ipsum\") -> [, \"Lorem\", \"image.jpg\", \"Ipsum\"]\n */\n\nconst IMAGE_INPUT_REGEX = /!\\[(.+|:?)]\\((\\S+)(?:(?:\\s+)[\"'](\\S+)[\"'])?\\)/;\nclass Image extends Node {\n get name() {\n return 'image';\n }\n\n get schema() {\n return {\n inline: true,\n attrs: {\n src: {},\n alt: {\n default: null\n },\n title: {\n default: null\n }\n },\n group: 'inline',\n draggable: true,\n parseDOM: [{\n tag: 'img[src]',\n getAttrs: dom => ({\n src: dom.getAttribute('src'),\n title: dom.getAttribute('title'),\n alt: dom.getAttribute('alt')\n })\n }],\n toDOM: node => ['img', node.attrs]\n };\n }\n\n commands({\n type\n }) {\n return attrs => (state, dispatch) => {\n const {\n selection\n } = state;\n const position = selection.$cursor ? selection.$cursor.pos : selection.$to.pos;\n const node = type.create(attrs);\n const transaction = state.tr.insert(position, node);\n dispatch(transaction);\n };\n }\n\n inputRules({\n type\n }) {\n return [nodeInputRule(IMAGE_INPUT_REGEX, type, match => {\n const [, alt, src, title] = match;\n return {\n src,\n alt,\n title\n };\n })];\n }\n\n get plugins() {\n return [new Plugin({\n props: {\n handleDOMEvents: {\n drop(view, event) {\n const hasFiles = event.dataTransfer && event.dataTransfer.files && event.dataTransfer.files.length;\n\n if (!hasFiles) {\n return;\n }\n\n const images = Array.from(event.dataTransfer.files).filter(file => /image/i.test(file.type));\n\n if (images.length === 0) {\n return;\n }\n\n event.preventDefault();\n const {\n schema\n } = view.state;\n const coordinates = view.posAtCoords({\n left: event.clientX,\n top: event.clientY\n });\n images.forEach(image => {\n const reader = new FileReader();\n\n reader.onload = readerEvent => {\n const node = schema.nodes.image.create({\n src: readerEvent.target.result\n });\n const transaction = view.state.tr.insert(coordinates.pos, node);\n view.dispatch(transaction);\n };\n\n reader.readAsDataURL(image);\n });\n }\n\n }\n }\n })];\n }\n\n}\n\nclass ListItem extends Node {\n get name() {\n return 'list_item';\n }\n\n get schema() {\n return {\n content: 'paragraph block*',\n defining: true,\n draggable: false,\n parseDOM: [{\n tag: 'li'\n }],\n toDOM: () => ['li', 0]\n };\n }\n\n keys({\n type\n }) {\n return {\n Enter: splitListItem(type),\n Tab: sinkListItem(type),\n 'Shift-Tab': liftListItem(type)\n };\n }\n\n}\n\nfunction getTextBetween(node, from, to, blockSeparator, inlineSeparator, leafText = '\\0') {\n let text = '';\n let blockSeparated = true;\n let inlineNode = null;\n node.content.nodesBetween(from, to, (innerNode, pos) => {\n if (innerNode.isText) {\n if (inlineNode) {\n inlineNode = null;\n return;\n }\n\n text += innerNode.text.slice(Math.max(from, pos) - pos, to - pos);\n blockSeparated = !blockSeparator;\n } else if (innerNode.isLeaf && leafText) {\n text += leafText;\n blockSeparated = !blockSeparator;\n } else if (innerNode.isInline && !innerNode.isLeaf) {\n text += inlineSeparator;\n\n if (innerNode.textContent) {\n text += innerNode.textContent;\n inlineNode = innerNode;\n }\n\n text += inlineSeparator;\n blockSeparated = !blockSeparated;\n } else if (!blockSeparated && innerNode.isBlock) {\n text += blockSeparator;\n blockSeparated = true;\n }\n }, 0);\n return text;\n} // Create a matcher that matches when a specific character is typed. Useful for @mentions and #tags.\n\n\nfunction triggerCharacter({\n char = '@',\n allowSpaces = false,\n startOfLine = false\n}) {\n return $position => {\n // cancel if top level node\n if ($position.depth <= 0) {\n return false;\n } // Matching expressions used for later\n\n\n const escapedChar = `\\\\${char}`;\n const suffix = new RegExp(`\\\\s${escapedChar}$`);\n const prefix = startOfLine ? '^' : '';\n const regexp = allowSpaces ? new RegExp(`${prefix}${escapedChar}.*?(?=\\\\s${escapedChar}|$)`, 'gm') : new RegExp(`${prefix}(?:^)?${escapedChar}[^\\\\s${escapedChar}]*`, 'gm'); // Lookup the boundaries of the current node\n\n const textFrom = $position.before();\n const textTo = $position.end();\n const text = getTextBetween($position.doc, textFrom, textTo, '\\0', '\\0');\n let match = regexp.exec(text);\n let position;\n\n while (match !== null) {\n // JavaScript doesn't have lookbehinds; this hacks a check that first character is \" \"\n // or the line beginning\n const matchPrefix = match.input.slice(Math.max(0, match.index - 1), match.index);\n\n if (/^[\\s\\0]?$/.test(matchPrefix)) {\n // The absolute position of the match in the document\n const from = match.index + $position.start();\n let to = from + match[0].length; // Edge case handling; if spaces are allowed and we're directly in between\n // two triggers\n\n if (allowSpaces && suffix.test(text.slice(to - 1, to + 1))) {\n match[0] += ' ';\n to += 1;\n } // If the $position is located within the matched substring, return that range\n\n\n if (from < $position.pos && to >= $position.pos) {\n position = {\n range: {\n from,\n to\n },\n query: match[0].slice(char.length),\n text: match[0]\n };\n }\n }\n\n match = regexp.exec(text);\n }\n\n return position;\n };\n}\n\nfunction SuggestionsPlugin({\n matcher = {\n char: '@',\n allowSpaces: false,\n startOfLine: false\n },\n appendText = null,\n suggestionClass = 'suggestion',\n command = () => false,\n items = [],\n onEnter = () => false,\n onChange = () => false,\n onExit = () => false,\n onKeyDown = () => false,\n onFilter = (searchItems, query) => {\n if (!query) {\n return searchItems;\n }\n\n return searchItems.filter(item => JSON.stringify(item).toLowerCase().includes(query.toLowerCase()));\n }\n}) {\n return new Plugin$1({\n key: new PluginKey$1('suggestions'),\n\n view() {\n return {\n update: async (view, prevState) => {\n const prev = this.key.getState(prevState);\n const next = this.key.getState(view.state); // See how the state changed\n\n const moved = prev.active && next.active && prev.range.from !== next.range.from;\n const started = !prev.active && next.active;\n const stopped = prev.active && !next.active;\n const changed = !started && !stopped && prev.query !== next.query;\n const handleStart = started || moved;\n const handleChange = changed && !moved;\n const handleExit = stopped || moved; // Cancel when suggestion isn't active\n\n if (!handleStart && !handleChange && !handleExit) {\n return;\n }\n\n const state = handleExit ? prev : next;\n const decorationNode = document.querySelector(`[data-decoration-id=\"${state.decorationId}\"]`); // build a virtual node for popper.js or tippy.js\n // this can be used for building popups without a DOM node\n\n const virtualNode = decorationNode ? {\n getBoundingClientRect() {\n return decorationNode.getBoundingClientRect();\n },\n\n clientWidth: decorationNode.clientWidth,\n clientHeight: decorationNode.clientHeight\n } : null;\n const props = {\n view,\n range: state.range,\n query: state.query,\n text: state.text,\n decorationNode,\n virtualNode,\n items: handleChange || handleStart ? await onFilter(Array.isArray(items) ? items : await items(), state.query) : [],\n command: ({\n range,\n attrs\n }) => {\n command({\n range,\n attrs,\n schema: view.state.schema\n })(view.state, view.dispatch, view);\n\n if (appendText) {\n insertText(appendText)(view.state, view.dispatch, view);\n }\n }\n }; // Trigger the hooks when necessary\n\n if (handleExit) {\n onExit(props);\n }\n\n if (handleChange) {\n onChange(props);\n }\n\n if (handleStart) {\n onEnter(props);\n }\n }\n };\n },\n\n state: {\n // Initialize the plugin's internal state.\n init() {\n return {\n active: false,\n range: {},\n query: null,\n text: null\n };\n },\n\n // Apply changes to the plugin state from a view transaction.\n apply(tr, prev) {\n const {\n selection\n } = tr;\n const next = { ...prev\n }; // We can only be suggesting if there is no selection\n\n if (selection.from === selection.to) {\n // Reset active state if we just left the previous suggestion range\n if (selection.from < prev.range.from || selection.from > prev.range.to) {\n next.active = false;\n } // Try to match against where our cursor currently is\n\n\n const $position = selection.$from;\n const match = triggerCharacter(matcher)($position);\n const decorationId = (Math.random() + 1).toString(36).substr(2, 5); // If we found a match, update the current state to show it\n\n if (match) {\n next.active = true;\n next.decorationId = prev.decorationId ? prev.decorationId : decorationId;\n next.range = match.range;\n next.query = match.query;\n next.text = match.text;\n } else {\n next.active = false;\n }\n } else {\n next.active = false;\n } // Make sure to empty the range if suggestion is inactive\n\n\n if (!next.active) {\n next.decorationId = null;\n next.range = {};\n next.query = null;\n next.text = null;\n }\n\n return next;\n }\n\n },\n props: {\n // Call the keydown hook if suggestion is active.\n handleKeyDown(view, event) {\n const {\n active,\n range\n } = this.getState(view.state);\n if (!active) return false;\n return onKeyDown({\n view,\n event,\n range\n });\n },\n\n // Setup decorator on the currently active suggestion.\n decorations(editorState) {\n const {\n active,\n range,\n decorationId\n } = this.getState(editorState);\n if (!active) return null;\n return DecorationSet.create(editorState.doc, [Decoration.inline(range.from, range.to, {\n nodeName: 'span',\n class: suggestionClass,\n 'data-decoration-id': decorationId\n })]);\n }\n\n }\n });\n}\n\nclass Mention extends Node {\n get name() {\n return 'mention';\n }\n\n get defaultOptions() {\n return {\n matcher: {\n char: '@',\n allowSpaces: false,\n startOfLine: false\n },\n mentionClass: 'mention',\n suggestionClass: 'mention-suggestion'\n };\n }\n\n getLabel(dom) {\n return dom.innerText.split(this.options.matcher.char).join('');\n }\n\n createFragment(schema, label) {\n return Fragment.fromJSON(schema, [{\n type: 'text',\n text: `${this.options.matcher.char}${label}`\n }]);\n }\n\n insertMention(range, attrs, schema) {\n const nodeType = schema.nodes[this.name];\n const nodeFragment = this.createFragment(schema, attrs.label);\n return replaceText(range, nodeType, attrs, nodeFragment);\n }\n\n get schema() {\n return {\n attrs: {\n id: {},\n label: {}\n },\n group: 'inline',\n inline: true,\n content: 'text*',\n selectable: false,\n atom: true,\n toDOM: node => ['span', {\n class: this.options.mentionClass,\n 'data-mention-id': node.attrs.id\n }, `${this.options.matcher.char}${node.attrs.label}`],\n parseDOM: [{\n tag: 'span[data-mention-id]',\n getAttrs: dom => {\n const id = dom.getAttribute('data-mention-id');\n const label = this.getLabel(dom);\n return {\n id,\n label\n };\n },\n getContent: (dom, schema) => {\n const label = this.getLabel(dom);\n return this.createFragment(schema, label);\n }\n }]\n };\n }\n\n commands({\n schema\n }) {\n return attrs => this.insertMention(null, attrs, schema);\n }\n\n get plugins() {\n return [SuggestionsPlugin({\n command: ({\n range,\n attrs,\n schema\n }) => this.insertMention(range, attrs, schema),\n appendText: ' ',\n matcher: this.options.matcher,\n items: this.options.items,\n onEnter: this.options.onEnter,\n onChange: this.options.onChange,\n onExit: this.options.onExit,\n onKeyDown: this.options.onKeyDown,\n onFilter: this.options.onFilter,\n suggestionClass: this.options.suggestionClass\n })];\n }\n\n}\n\nclass OrderedList extends Node {\n get name() {\n return 'ordered_list';\n }\n\n get schema() {\n return {\n attrs: {\n order: {\n default: 1\n }\n },\n content: 'list_item+',\n group: 'block',\n parseDOM: [{\n tag: 'ol',\n getAttrs: dom => ({\n order: dom.hasAttribute('start') ? +dom.getAttribute('start') : 1\n })\n }],\n toDOM: node => node.attrs.order === 1 ? ['ol', 0] : ['ol', {\n start: node.attrs.order\n }, 0]\n };\n }\n\n commands({\n type,\n schema\n }) {\n return () => toggleList(type, schema.nodes.list_item);\n }\n\n keys({\n type,\n schema\n }) {\n return {\n 'Shift-Ctrl-9': toggleList(type, schema.nodes.list_item)\n };\n }\n\n inputRules({\n type\n }) {\n return [wrappingInputRule(/^(\\d+)\\.\\s$/, type, match => ({\n order: +match[1]\n }), (match, node) => node.childCount + node.attrs.order === +match[1])];\n }\n\n}\n\nvar TableNodes = tableNodes({\n tableGroup: 'block',\n cellContent: 'block+',\n cellAttributes: {\n background: {\n default: null,\n\n getFromDOM(dom) {\n return dom.style.backgroundColor || null;\n },\n\n setDOMAttr(value, attrs) {\n if (value) {\n const style = {\n style: `${attrs.style || ''}background-color: ${value};`\n };\n Object.assign(attrs, style);\n }\n }\n\n }\n }\n});\n\nclass Table extends Node {\n get name() {\n return 'table';\n }\n\n get defaultOptions() {\n return {\n resizable: false\n };\n }\n\n get schema() {\n return TableNodes.table;\n }\n\n commands({\n schema\n }) {\n return {\n createTable: ({\n rowsCount,\n colsCount,\n withHeaderRow\n }) => (state, dispatch) => {\n const offset = state.tr.selection.anchor + 1;\n const nodes = createTable(schema, rowsCount, colsCount, withHeaderRow);\n const tr = state.tr.replaceSelectionWith(nodes).scrollIntoView();\n const resolvedPos = tr.doc.resolve(offset);\n tr.setSelection(TextSelection.near(resolvedPos));\n dispatch(tr);\n },\n addColumnBefore: () => addColumnBefore,\n addColumnAfter: () => addColumnAfter,\n deleteColumn: () => deleteColumn,\n addRowBefore: () => addRowBefore,\n addRowAfter: () => addRowAfter,\n deleteRow: () => deleteRow,\n deleteTable: () => deleteTable,\n toggleCellMerge: () => (state, dispatch) => {\n if (mergeCells(state, dispatch)) {\n return;\n }\n\n splitCell(state, dispatch);\n },\n mergeCells: () => mergeCells,\n splitCell: () => splitCell,\n toggleHeaderColumn: () => toggleHeaderColumn,\n toggleHeaderRow: () => toggleHeaderRow,\n toggleHeaderCell: () => toggleHeaderCell,\n setCellAttr: ({\n name,\n value\n }) => setCellAttr(name, value),\n fixTables: () => fixTables\n };\n }\n\n keys() {\n return {\n Tab: goToNextCell(1),\n 'Shift-Tab': goToNextCell(-1)\n };\n }\n\n get plugins() {\n return [...(this.options.resizable ? [columnResizing()] : []), tableEditing()];\n }\n\n}\n\nclass TableHeader extends Node {\n get name() {\n return 'table_header';\n }\n\n get schema() {\n return TableNodes.table_header;\n }\n\n}\n\nclass TableCell extends Node {\n get name() {\n return 'table_cell';\n }\n\n get schema() {\n return TableNodes.table_cell;\n }\n\n}\n\nclass TableRow extends Node {\n get name() {\n return 'table_row';\n }\n\n get schema() {\n return TableNodes.table_row;\n }\n\n}\n\nclass TodoItem extends Node {\n get name() {\n return 'todo_item';\n }\n\n get defaultOptions() {\n return {\n nested: false\n };\n }\n\n get view() {\n return {\n props: ['node', 'updateAttrs', 'view'],\n methods: {\n onChange() {\n this.updateAttrs({\n done: !this.node.attrs.done\n });\n }\n\n },\n template: `\n <li :data-type=\"node.type.name\" :data-done=\"node.attrs.done.toString()\" data-drag-handle>\n <span class=\"todo-checkbox\" contenteditable=\"false\" @click=\"onChange\"></span>\n <div class=\"todo-content\" ref=\"content\" :contenteditable=\"view.editable.toString()\"></div>\n </li>\n `\n };\n }\n\n get schema() {\n return {\n attrs: {\n done: {\n default: false\n }\n },\n draggable: true,\n content: this.options.nested ? '(paragraph|todo_list)+' : 'paragraph+',\n toDOM: node => {\n const {\n done\n } = node.attrs;\n return ['li', {\n 'data-type': this.name,\n 'data-done': done.toString()\n }, ['span', {\n class: 'todo-checkbox',\n contenteditable: 'false'\n }], ['div', {\n class: 'todo-content'\n }, 0]];\n },\n parseDOM: [{\n priority: 51,\n tag: `[data-type=\"${this.name}\"]`,\n getAttrs: dom => ({\n done: dom.getAttribute('data-done') === 'true'\n })\n }]\n };\n }\n\n keys({\n type\n }) {\n return {\n Enter: splitToDefaultListItem(type),\n Tab: this.options.nested ? sinkListItem(type) : () => {},\n 'Shift-Tab': liftListItem(type)\n };\n }\n\n}\n\nclass TodoList extends Node {\n get name() {\n return 'todo_list';\n }\n\n get schema() {\n return {\n group: 'block',\n content: 'todo_item+',\n toDOM: () => ['ul', {\n 'data-type': this.name\n }, 0],\n parseDOM: [{\n priority: 51,\n tag: `[data-type=\"${this.name}\"]`\n }]\n };\n }\n\n commands({\n type,\n schema\n }) {\n return () => toggleList(type, schema.nodes.todo_item);\n }\n\n inputRules({\n type\n }) {\n return [wrappingInputRule(/^\\s*(\\[ \\])\\s$/, type)];\n }\n\n}\n\nclass Bold extends Mark {\n get name() {\n return 'bold';\n }\n\n get schema() {\n return {\n parseDOM: [{\n tag: 'strong'\n }, {\n tag: 'b',\n getAttrs: node => node.style.fontWeight !== 'normal' && null\n }, {\n style: 'font-weight',\n getAttrs: value => /^(bold(er)?|[5-9]\\d{2,})$/.test(value) && null\n }],\n toDOM: () => ['strong', 0]\n };\n }\n\n keys({\n type\n }) {\n return {\n 'Mod-b': toggleMark(type)\n };\n }\n\n commands({\n type\n }) {\n return () => toggleMark(type);\n }\n\n inputRules({\n type\n }) {\n return [markInputRule(/(?:\\*\\*|__)([^*_]+)(?:\\*\\*|__)$/, type)];\n }\n\n pasteRules({\n type\n }) {\n return [markPasteRule(/(?:\\*\\*|__)([^*_]+)(?:\\*\\*|__)/g, type)];\n }\n\n}\n\nclass Code extends Mark {\n get name() {\n return 'code';\n }\n\n get schema() {\n return {\n excludes: '_',\n parseDOM: [{\n tag: 'code'\n }],\n toDOM: () => ['code', 0]\n };\n }\n\n keys({\n type\n }) {\n return {\n 'Mod-`': toggleMark(type)\n };\n }\n\n commands({\n type\n }) {\n return () => toggleMark(type);\n }\n\n inputRules({\n type\n }) {\n return [markInputRule(/(?:`)([^`]+)(?:`)$/, type)];\n }\n\n pasteRules({\n type\n }) {\n return [markPasteRule(/(?:`)([^`]+)(?:`)/g, type)];\n }\n\n}\n\nclass Italic extends Mark {\n get name() {\n return 'italic';\n }\n\n get schema() {\n return {\n parseDOM: [{\n tag: 'i'\n }, {\n tag: 'em'\n }, {\n style: 'font-style=italic'\n }],\n toDOM: () => ['em', 0]\n };\n }\n\n keys({\n type\n }) {\n return {\n 'Mod-i': toggleMark(type)\n };\n }\n\n commands({\n type\n }) {\n return () => toggleMark(type);\n }\n\n inputRules({\n type\n }) {\n return [markInputRule(/(?:^|[^_])(_([^_]+)_)$/, type), markInputRule(/(?:^|[^*])(\\*([^*]+)\\*)$/, type)];\n }\n\n pasteRules({\n type\n }) {\n return [markPasteRule(/_([^_]+)_/g, type), markPasteRule(/\\*([^*]+)\\*/g, type)];\n }\n\n}\n\nclass Link extends Mark {\n get name() {\n return 'link';\n }\n\n get defaultOptions() {\n return {\n openOnClick: true,\n target: null\n };\n }\n\n get schema() {\n return {\n attrs: {\n href: {\n default: null\n },\n target: {\n default: null\n }\n },\n inclusive: false,\n parseDOM: [{\n tag: 'a[href]',\n getAttrs: dom => ({\n href: dom.getAttribute('href'),\n target: dom.getAttribute('target')\n })\n }],\n toDOM: node => ['a', { ...node.attrs,\n rel: 'noopener noreferrer nofollow',\n target: node.attrs.target || this.options.target\n }, 0]\n };\n }\n\n commands({\n type\n }) {\n return attrs => {\n if (attrs.href) {\n return updateMark(type, attrs);\n }\n\n return removeMark(type);\n };\n }\n\n pasteRules({\n type\n }) {\n return [pasteRule(/https?:\\/\\/(www\\.)?[-a-zA-Z0-9@:%._+~#=]{1,256}\\.[a-zA-Z]{2,}\\b([-a-zA-Z0-9@:%_+.~#?&//=,()!]*)/gi, type, url => ({\n href: url\n }))];\n }\n\n get plugins() {\n if (!this.options.openOnClick) {\n return [];\n }\n\n return [new Plugin({\n props: {\n handleClick: (view, pos, event) => {\n const {\n schema\n } = view.state;\n const attrs = getMarkAttrs(view.state, schema.marks.link);\n\n if (attrs.href && event.target instanceof HTMLAnchorElement) {\n event.stopPropagation();\n window.open(attrs.href, attrs.target);\n }\n }\n }\n })];\n }\n\n}\n\nclass Strike extends Mark {\n get name() {\n return 'strike';\n }\n\n get schema() {\n return {\n parseDOM: [{\n tag: 's'\n }, {\n tag: 'del'\n }, {\n tag: 'strike'\n }, {\n style: 'text-decoration',\n getAttrs: value => value === 'line-through'\n }],\n toDOM: () => ['s', 0]\n };\n }\n\n keys({\n type\n }) {\n return {\n 'Mod-d': toggleMark(type)\n };\n }\n\n commands({\n type\n }) {\n return () => toggleMark(type);\n }\n\n inputRules({\n type\n }) {\n return [markInputRule(/~([^~]+)~$/, type)];\n }\n\n pasteRules({\n type\n }) {\n return [markPasteRule(/~([^~]+)~/g, type)];\n }\n\n}\n\nclass Underline extends Mark {\n get name() {\n return 'underline';\n }\n\n get schema() {\n return {\n parseDOM: [{\n tag: 'u'\n }, {\n style: 'text-decoration',\n getAttrs: value => value === 'underline'\n }],\n toDOM: () => ['u', 0]\n };\n }\n\n keys({\n type\n }) {\n return {\n 'Mod-u': toggleMark(type)\n };\n }\n\n commands({\n type\n }) {\n return () => toggleMark(type);\n }\n\n}\n\nclass Collaboration extends Extension {\n get name() {\n return 'collaboration';\n }\n\n init() {\n this.getSendableSteps = this.debounce(state => {\n const sendable = sendableSteps(state);\n\n if (sendable) {\n this.options.onSendable({\n editor: this.editor,\n sendable: {\n version: sendable.version,\n steps: sendable.steps.map(step => step.toJSON()),\n clientID: sendable.clientID\n }\n });\n }\n }, this.options.debounce);\n this.editor.on('transaction', ({\n state\n }) => {\n this.getSendableSteps(state);\n });\n }\n\n get defaultOptions() {\n return {\n version: 0,\n clientID: Math.floor(Math.random() * 0xFFFFFFFF),\n debounce: 250,\n onSendable: () => {},\n update: ({\n steps,\n version\n }) => {\n const {\n state,\n view,\n schema\n } = this.editor;\n\n if (getVersion(state) > version) {\n return;\n }\n\n view.dispatch(receiveTransaction(state, steps.map(item => Step.fromJSON(schema, item.step)), steps.map(item => item.clientID)));\n }\n };\n }\n\n get plugins() {\n return [collab({\n version: this.options.version,\n clientID: this.options.clientID\n })];\n }\n\n debounce(fn, delay) {\n let timeout;\n return function (...args) {\n if (timeout) {\n clearTimeout(timeout);\n }\n\n timeout = setTimeout(() => {\n fn(...args);\n timeout = null;\n }, delay);\n };\n }\n\n}\n\nclass Focus extends Extension {\n get name() {\n return 'focus';\n }\n\n get defaultOptions() {\n return {\n className: 'has-focus',\n nested: false\n };\n }\n\n get plugins() {\n return [new Plugin({\n props: {\n decorations: ({\n doc,\n plugins,\n selection\n }) => {\n const editablePlugin = plugins.find(plugin => plugin.key.startsWith('editable$'));\n const editable = editablePlugin.props.editable();\n const active = editable && this.options.className;\n const {\n focused\n } = this.editor;\n const {\n anchor\n } = selection;\n const decorations = [];\n\n if (!active || !focused) {\n return false;\n }\n\n doc.descendants((node, pos) => {\n const hasAnchor = anchor >= pos && anchor <= pos + node.nodeSize;\n\n if (hasAnchor && !node.isText) {\n const decoration = Decoration.node(pos, pos + node.nodeSize, {\n class: this.options.className\n });\n decorations.push(decoration);\n }\n\n return this.options.nested;\n });\n return DecorationSet.create(doc, decorations);\n }\n }\n })];\n }\n\n}\n\nclass History extends Extension {\n get name() {\n return 'history';\n }\n\n get defaultOptions() {\n return {\n depth: '',\n newGroupDelay: ''\n };\n }\n\n keys() {\n const keymap = {\n 'Mod-z': undo,\n 'Mod-y': redo,\n 'Shift-Mod-z': redo,\n // Russian language\n 'Mod-я': undo,\n 'Shift-Mod-я': redo\n };\n return keymap;\n }\n\n get plugins() {\n return [history({\n depth: this.options.depth,\n newGroupDelay: this.options.newGroupDelay\n })];\n }\n\n commands() {\n return {\n undo: () => undo,\n redo: () => redo,\n undoDepth: () => undoDepth,\n redoDepth: () => redoDepth\n };\n }\n\n}\n\nclass Placeholder extends Extension {\n get name() {\n return 'placeholder';\n }\n\n get defaultOptions() {\n return {\n emptyEditorClass: 'is-editor-empty',\n emptyNodeClass: 'is-empty',\n emptyNodeText: 'Write something …',\n showOnlyWhenEditable: true,\n showOnlyCurrent: true\n };\n }\n\n get plugins() {\n return [new Plugin({\n props: {\n decorations: ({\n doc,\n plugins,\n selection\n }) => {\n const editablePlugin = plugins.find(plugin => plugin.key.startsWith('editable$'));\n const editable = editablePlugin.props.editable();\n const active = editable || !this.options.showOnlyWhenEditable;\n const {\n anchor\n } = selection;\n const decorations = [];\n const isEditorEmpty = doc.textContent.length === 0;\n\n if (!active) {\n return false;\n }\n\n doc.descendants((node, pos) => {\n const hasAnchor = anchor >= pos && anchor <= pos + node.nodeSize;\n const isNodeEmpty = node.content.size === 0;\n\n if ((hasAnchor || !this.options.showOnlyCurrent) && isNodeEmpty) {\n const classes = [this.options.emptyNodeClass];\n\n if (isEditorEmpty) {\n classes.push(this.options.emptyEditorClass);\n }\n\n const decoration = Decoration.node(pos, pos + node.nodeSize, {\n class: classes.join(' '),\n 'data-empty-text': typeof this.options.emptyNodeText === 'function' ? this.options.emptyNodeText(node) : this.options.emptyNodeText\n });\n decorations.push(decoration);\n }\n\n return false;\n });\n return DecorationSet.create(doc, decorations);\n }\n }\n })];\n }\n\n}\n\nclass Search extends Extension {\n constructor(options = {}) {\n super(options);\n this.results = [];\n this.searchTerm = null;\n this._updating = false;\n }\n\n get name() {\n return 'search';\n }\n\n get defaultOptions() {\n return {\n autoSelectNext: true,\n findClass: 'find',\n searching: false,\n caseSensitive: false,\n disableRegex: true,\n alwaysSearch: false\n };\n }\n\n commands() {\n return {\n find: attrs => this.find(attrs),\n replace: attrs => this.replace(attrs),\n replaceAll: attrs => this.replaceAll(attrs),\n clearSearch: () => this.clear()\n };\n }\n\n get findRegExp() {\n return RegExp(this.searchTerm, !this.options.caseSensitive ? 'gui' : 'gu');\n }\n\n get decorations() {\n return this.results.map(deco => Decoration.inline(deco.from, deco.to, {\n class: this.options.findClass\n }));\n }\n\n _search(doc) {\n this.results = [];\n const mergedTextNodes = [];\n let index = 0;\n\n if (!this.searchTerm) {\n return;\n }\n\n doc.descendants((node, pos) => {\n if (node.isText) {\n if (mergedTextNodes[index]) {\n mergedTextNodes[index] = {\n text: mergedTextNodes[index].text + node.text,\n pos: mergedTextNodes[index].pos\n };\n } else {\n mergedTextNodes[index] = {\n text: node.text,\n pos\n };\n }\n } else {\n index += 1;\n }\n });\n mergedTextNodes.forEach(({\n text,\n pos\n }) => {\n const search = this.findRegExp;\n let m; // eslint-disable-next-line no-cond-assign\n\n while (m = search.exec(text)) {\n if (m[0] === '') {\n break;\n }\n\n this.results.push({\n from: pos + m.index,\n to: pos + m.index + m[0].length\n });\n }\n });\n }\n\n replace(replace) {\n return (state, dispatch) => {\n const firstResult = this.results[0];\n\n if (!firstResult) {\n return;\n }\n\n const {\n from,\n to\n } = this.results[0];\n dispatch(state.tr.insertText(replace, from, to));\n this.editor.commands.find(this.searchTerm);\n };\n }\n\n rebaseNextResult(replace, index, lastOffset = 0) {\n const nextIndex = index + 1;\n\n if (!this.results[nextIndex]) {\n return null;\n }\n\n const {\n from: currentFrom,\n to: currentTo\n } = this.results[index];\n const offset = currentTo - currentFrom - replace.length + lastOffset;\n const {\n from,\n to\n } = this.results[nextIndex];\n this.results[nextIndex] = {\n to: to - offset,\n from: from - offset\n };\n return offset;\n }\n\n replaceAll(replace) {\n return ({\n tr\n }, dispatch) => {\n let offset;\n\n if (!this.results.length) {\n return;\n }\n\n this.results.forEach(({\n from,\n to\n }, index) => {\n tr.insertText(replace, from, to);\n offset = this.rebaseNextResult(replace, index, offset);\n });\n dispatch(tr);\n this.editor.commands.find(this.searchTerm);\n };\n }\n\n find(searchTerm) {\n return (state, dispatch) => {\n this.searchTerm = this.options.disableRegex ? searchTerm.replace(/[-/\\\\^$*+?.()|[\\]{}]/g, '\\\\$&') : searchTerm;\n this.updateView(state, dispatch);\n };\n }\n\n clear() {\n return (state, dispatch) => {\n this.searchTerm = null;\n this.updateView(state, dispatch);\n };\n }\n\n updateView({\n tr\n }, dispatch) {\n this._updating = true;\n dispatch(tr);\n this._updating = false;\n }\n\n createDeco(doc) {\n this._search(doc);\n\n return this.decorations ? DecorationSet.create(doc, this.decorations) : [];\n }\n\n get plugins() {\n return [new Plugin({\n state: {\n init() {\n return DecorationSet.empty;\n },\n\n apply: (tr, old) => {\n if (this._updating || this.options.searching || tr.docChanged && this.options.alwaysSearch) {\n return this.createDeco(tr.doc);\n }\n\n if (tr.docChanged) {\n return old.map(tr.mapping, tr.doc);\n }\n\n return old;\n }\n },\n props: {\n decorations(state) {\n return this.getState(state);\n }\n\n }\n })];\n }\n\n}\n\nclass TrailingNode extends Extension {\n get name() {\n return 'trailing_node';\n }\n\n get defaultOptions() {\n return {\n node: 'paragraph',\n notAfter: ['paragraph']\n };\n }\n\n get plugins() {\n const plugin = new PluginKey(this.name);\n const disabledNodes = Object.entries(this.editor.schema.nodes).map(([, value]) => value).filter(node => this.options.notAfter.includes(node.name));\n return [new Plugin({\n key: plugin,\n view: () => ({\n update: view => {\n const {\n state\n } = view;\n const insertNodeAtEnd = plugin.getState(state);\n\n if (!insertNodeAtEnd) {\n return;\n }\n\n const {\n doc,\n schema,\n tr\n } = state;\n const type = schema.nodes[this.options.node];\n const transaction = tr.insert(doc.content.size, type.create());\n view.dispatch(transaction);\n }\n }),\n state: {\n init: (_, state) => {\n const lastNode = state.tr.doc.lastChild;\n return !nodeEqualsType({\n node: lastNode,\n types: disabledNodes\n });\n },\n apply: (tr, value) => {\n if (!tr.docChanged) {\n return value;\n }\n\n const lastNode = tr.doc.lastChild;\n return !nodeEqualsType({\n node: lastNode,\n types: disabledNodes\n });\n }\n }\n })];\n }\n\n}\n\nexport { Blockquote, Bold, BulletList, Code, CodeBlock, CodeBlockHighlight, Collaboration, Focus, HardBreak, Heading, HighlightPlugin as Highlight, History, HorizontalRule, Image, Italic, Link, ListItem, Mention, OrderedList, Placeholder, Search, Strike, SuggestionsPlugin as Suggestions, Table, TableCell, TableHeader, TableRow, TodoItem, TodoList, TrailingNode, Underline };\n","'use strict'\n\nvar formatter = require('format')\n\nvar fault = create(Error)\n\nmodule.exports = fault\n\nfault.eval = create(EvalError)\nfault.range = create(RangeError)\nfault.reference = create(ReferenceError)\nfault.syntax = create(SyntaxError)\nfault.type = create(TypeError)\nfault.uri = create(URIError)\n\nfault.create = create\n\n// Create a new `EConstructor`, with the formatted `format` as a first argument.\nfunction create(EConstructor) {\n FormattedError.displayName = EConstructor.displayName || EConstructor.name\n\n return FormattedError\n\n function FormattedError(format) {\n if (format) {\n format = formatter.apply(null, arguments)\n }\n\n return new EConstructor(format)\n }\n}\n","function deepFreeze(obj) {\n if (obj instanceof Map) {\n obj.clear = obj.delete = obj.set = function () {\n throw new Error('map is read-only');\n };\n } else if (obj instanceof Set) {\n obj.add = obj.clear = obj.delete = function () {\n throw new Error('set is read-only');\n };\n }\n\n // Freeze self\n Object.freeze(obj);\n\n Object.getOwnPropertyNames(obj).forEach(function (name) {\n var prop = obj[name];\n\n // Freeze prop if it is an object\n if (typeof prop == 'object' && !Object.isFrozen(prop)) {\n deepFreeze(prop);\n }\n });\n\n return obj;\n}\n\nvar deepFreezeEs6 = deepFreeze;\nvar _default = deepFreeze;\ndeepFreezeEs6.default = _default;\n\n/** @implements CallbackResponse */\nclass Response {\n /**\n * @param {CompiledMode} mode\n */\n constructor(mode) {\n // eslint-disable-next-line no-undefined\n if (mode.data === undefined) mode.data = {};\n\n this.data = mode.data;\n this.isMatchIgnored = false;\n }\n\n ignoreMatch() {\n this.isMatchIgnored = true;\n }\n}\n\n/**\n * @param {string} value\n * @returns {string}\n */\nfunction escapeHTML(value) {\n return value\n .replace(/&/g, '&')\n .replace(/</g, '<')\n .replace(/>/g, '>')\n .replace(/\"/g, '"')\n .replace(/'/g, ''');\n}\n\n/**\n * performs a shallow merge of multiple objects into one\n *\n * @template T\n * @param {T} original\n * @param {Record<string,any>[]} objects\n * @returns {T} a single new object\n */\nfunction inherit(original, ...objects) {\n /** @type Record<string,any> */\n const result = Object.create(null);\n\n for (const key in original) {\n result[key] = original[key];\n }\n objects.forEach(function(obj) {\n for (const key in obj) {\n result[key] = obj[key];\n }\n });\n return /** @type {T} */ (result);\n}\n\n/**\n * @typedef {object} Renderer\n * @property {(text: string) => void} addText\n * @property {(node: Node) => void} openNode\n * @property {(node: Node) => void} closeNode\n * @property {() => string} value\n */\n\n/** @typedef {{kind?: string, sublanguage?: boolean}} Node */\n/** @typedef {{walk: (r: Renderer) => void}} Tree */\n/** */\n\nconst SPAN_CLOSE = '</span>';\n\n/**\n * Determines if a node needs to be wrapped in <span>\n *\n * @param {Node} node */\nconst emitsWrappingTags = (node) => {\n return !!node.kind;\n};\n\n/** @type {Renderer} */\nclass HTMLRenderer {\n /**\n * Creates a new HTMLRenderer\n *\n * @param {Tree} parseTree - the parse tree (must support `walk` API)\n * @param {{classPrefix: string}} options\n */\n constructor(parseTree, options) {\n this.buffer = \"\";\n this.classPrefix = options.classPrefix;\n parseTree.walk(this);\n }\n\n /**\n * Adds texts to the output stream\n *\n * @param {string} text */\n addText(text) {\n this.buffer += escapeHTML(text);\n }\n\n /**\n * Adds a node open to the output stream (if needed)\n *\n * @param {Node} node */\n openNode(node) {\n if (!emitsWrappingTags(node)) return;\n\n let className = node.kind;\n if (!node.sublanguage) {\n className = `${this.classPrefix}${className}`;\n }\n this.span(className);\n }\n\n /**\n * Adds a node close to the output stream (if needed)\n *\n * @param {Node} node */\n closeNode(node) {\n if (!emitsWrappingTags(node)) return;\n\n this.buffer += SPAN_CLOSE;\n }\n\n /**\n * returns the accumulated buffer\n */\n value() {\n return this.buffer;\n }\n\n // helpers\n\n /**\n * Builds a span element\n *\n * @param {string} className */\n span(className) {\n this.buffer += `<span class=\"${className}\">`;\n }\n}\n\n/** @typedef {{kind?: string, sublanguage?: boolean, children: Node[]} | string} Node */\n/** @typedef {{kind?: string, sublanguage?: boolean, children: Node[]} } DataNode */\n/** */\n\nclass TokenTree {\n constructor() {\n /** @type DataNode */\n this.rootNode = { children: [] };\n this.stack = [this.rootNode];\n }\n\n get top() {\n return this.stack[this.stack.length - 1];\n }\n\n get root() { return this.rootNode; }\n\n /** @param {Node} node */\n add(node) {\n this.top.children.push(node);\n }\n\n /** @param {string} kind */\n openNode(kind) {\n /** @type Node */\n const node = { kind, children: [] };\n this.add(node);\n this.stack.push(node);\n }\n\n closeNode() {\n if (this.stack.length > 1) {\n return this.stack.pop();\n }\n // eslint-disable-next-line no-undefined\n return undefined;\n }\n\n closeAllNodes() {\n while (this.closeNode());\n }\n\n toJSON() {\n return JSON.stringify(this.rootNode, null, 4);\n }\n\n /**\n * @typedef { import(\"./html_renderer\").Renderer } Renderer\n * @param {Renderer} builder\n */\n walk(builder) {\n // this does not\n return this.constructor._walk(builder, this.rootNode);\n // this works\n // return TokenTree._walk(builder, this.rootNode);\n }\n\n /**\n * @param {Renderer} builder\n * @param {Node} node\n */\n static _walk(builder, node) {\n if (typeof node === \"string\") {\n builder.addText(node);\n } else if (node.children) {\n builder.openNode(node);\n node.children.forEach((child) => this._walk(builder, child));\n builder.closeNode(node);\n }\n return builder;\n }\n\n /**\n * @param {Node} node\n */\n static _collapse(node) {\n if (typeof node === \"string\") return;\n if (!node.children) return;\n\n if (node.children.every(el => typeof el === \"string\")) {\n // node.text = node.children.join(\"\");\n // delete node.children;\n node.children = [node.children.join(\"\")];\n } else {\n node.children.forEach((child) => {\n TokenTree._collapse(child);\n });\n }\n }\n}\n\n/**\n Currently this is all private API, but this is the minimal API necessary\n that an Emitter must implement to fully support the parser.\n\n Minimal interface:\n\n - addKeyword(text, kind)\n - addText(text)\n - addSublanguage(emitter, subLanguageName)\n - finalize()\n - openNode(kind)\n - closeNode()\n - closeAllNodes()\n - toHTML()\n\n*/\n\n/**\n * @implements {Emitter}\n */\nclass TokenTreeEmitter extends TokenTree {\n /**\n * @param {*} options\n */\n constructor(options) {\n super();\n this.options = options;\n }\n\n /**\n * @param {string} text\n * @param {string} kind\n */\n addKeyword(text, kind) {\n if (text === \"\") { return; }\n\n this.openNode(kind);\n this.addText(text);\n this.closeNode();\n }\n\n /**\n * @param {string} text\n */\n addText(text) {\n if (text === \"\") { return; }\n\n this.add(text);\n }\n\n /**\n * @param {Emitter & {root: DataNode}} emitter\n * @param {string} name\n */\n addSublanguage(emitter, name) {\n /** @type DataNode */\n const node = emitter.root;\n node.kind = name;\n node.sublanguage = true;\n this.add(node);\n }\n\n toHTML() {\n const renderer = new HTMLRenderer(this, this.options);\n return renderer.value();\n }\n\n finalize() {\n return true;\n }\n}\n\n/**\n * @param {string} value\n * @returns {RegExp}\n * */\nfunction escape(value) {\n return new RegExp(value.replace(/[-/\\\\^$*+?.()|[\\]{}]/g, '\\\\$&'), 'm');\n}\n\n/**\n * @param {RegExp | string } re\n * @returns {string}\n */\nfunction source(re) {\n if (!re) return null;\n if (typeof re === \"string\") return re;\n\n return re.source;\n}\n\n/**\n * @param {...(RegExp | string) } args\n * @returns {string}\n */\nfunction concat(...args) {\n const joined = args.map((x) => source(x)).join(\"\");\n return joined;\n}\n\n/**\n * Any of the passed expresssions may match\n *\n * Creates a huge this | this | that | that match\n * @param {(RegExp | string)[] } args\n * @returns {string}\n */\nfunction either(...args) {\n const joined = '(' + args.map((x) => source(x)).join(\"|\") + \")\";\n return joined;\n}\n\n/**\n * @param {RegExp} re\n * @returns {number}\n */\nfunction countMatchGroups(re) {\n return (new RegExp(re.toString() + '|')).exec('').length - 1;\n}\n\n/**\n * Does lexeme start with a regular expression match at the beginning\n * @param {RegExp} re\n * @param {string} lexeme\n */\nfunction startsWith(re, lexeme) {\n const match = re && re.exec(lexeme);\n return match && match.index === 0;\n}\n\n// BACKREF_RE matches an open parenthesis or backreference. To avoid\n// an incorrect parse, it additionally matches the following:\n// - [...] elements, where the meaning of parentheses and escapes change\n// - other escape sequences, so we do not misparse escape sequences as\n// interesting elements\n// - non-matching or lookahead parentheses, which do not capture. These\n// follow the '(' with a '?'.\nconst BACKREF_RE = /\\[(?:[^\\\\\\]]|\\\\.)*\\]|\\(\\??|\\\\([1-9][0-9]*)|\\\\./;\n\n// join logically computes regexps.join(separator), but fixes the\n// backreferences so they continue to match.\n// it also places each individual regular expression into it's own\n// match group, keeping track of the sequencing of those match groups\n// is currently an exercise for the caller. :-)\n/**\n * @param {(string | RegExp)[]} regexps\n * @param {string} separator\n * @returns {string}\n */\nfunction join(regexps, separator = \"|\") {\n let numCaptures = 0;\n\n return regexps.map((regex) => {\n numCaptures += 1;\n const offset = numCaptures;\n let re = source(regex);\n let out = '';\n\n while (re.length > 0) {\n const match = BACKREF_RE.exec(re);\n if (!match) {\n out += re;\n break;\n }\n out += re.substring(0, match.index);\n re = re.substring(match.index + match[0].length);\n if (match[0][0] === '\\\\' && match[1]) {\n // Adjust the backreference.\n out += '\\\\' + String(Number(match[1]) + offset);\n } else {\n out += match[0];\n if (match[0] === '(') {\n numCaptures++;\n }\n }\n }\n return out;\n }).map(re => `(${re})`).join(separator);\n}\n\n// Common regexps\nconst MATCH_NOTHING_RE = /\\b\\B/;\nconst IDENT_RE = '[a-zA-Z]\\\\w*';\nconst UNDERSCORE_IDENT_RE = '[a-zA-Z_]\\\\w*';\nconst NUMBER_RE = '\\\\b\\\\d+(\\\\.\\\\d+)?';\nconst C_NUMBER_RE = '(-?)(\\\\b0[xX][a-fA-F0-9]+|(\\\\b\\\\d+(\\\\.\\\\d*)?|\\\\.\\\\d+)([eE][-+]?\\\\d+)?)'; // 0x..., 0..., decimal, float\nconst BINARY_NUMBER_RE = '\\\\b(0b[01]+)'; // 0b...\nconst RE_STARTERS_RE = '!|!=|!==|%|%=|&|&&|&=|\\\\*|\\\\*=|\\\\+|\\\\+=|,|-|-=|/=|/|:|;|<<|<<=|<=|<|===|==|=|>>>=|>>=|>=|>>>|>>|>|\\\\?|\\\\[|\\\\{|\\\\(|\\\\^|\\\\^=|\\\\||\\\\|=|\\\\|\\\\||~';\n\n/**\n* @param { Partial<Mode> & {binary?: string | RegExp} } opts\n*/\nconst SHEBANG = (opts = {}) => {\n const beginShebang = /^#![ ]*\\//;\n if (opts.binary) {\n opts.begin = concat(\n beginShebang,\n /.*\\b/,\n opts.binary,\n /\\b.*/);\n }\n return inherit({\n className: 'meta',\n begin: beginShebang,\n end: /$/,\n relevance: 0,\n /** @type {ModeCallback} */\n \"on:begin\": (m, resp) => {\n if (m.index !== 0) resp.ignoreMatch();\n }\n }, opts);\n};\n\n// Common modes\nconst BACKSLASH_ESCAPE = {\n begin: '\\\\\\\\[\\\\s\\\\S]', relevance: 0\n};\nconst APOS_STRING_MODE = {\n className: 'string',\n begin: '\\'',\n end: '\\'',\n illegal: '\\\\n',\n contains: [BACKSLASH_ESCAPE]\n};\nconst QUOTE_STRING_MODE = {\n className: 'string',\n begin: '\"',\n end: '\"',\n illegal: '\\\\n',\n contains: [BACKSLASH_ESCAPE]\n};\nconst PHRASAL_WORDS_MODE = {\n begin: /\\b(a|an|the|are|I'm|isn't|don't|doesn't|won't|but|just|should|pretty|simply|enough|gonna|going|wtf|so|such|will|you|your|they|like|more)\\b/\n};\n/**\n * Creates a comment mode\n *\n * @param {string | RegExp} begin\n * @param {string | RegExp} end\n * @param {Mode | {}} [modeOptions]\n * @returns {Partial<Mode>}\n */\nconst COMMENT = function(begin, end, modeOptions = {}) {\n const mode = inherit(\n {\n className: 'comment',\n begin,\n end,\n contains: []\n },\n modeOptions\n );\n mode.contains.push(PHRASAL_WORDS_MODE);\n mode.contains.push({\n className: 'doctag',\n begin: '(?:TODO|FIXME|NOTE|BUG|OPTIMIZE|HACK|XXX):',\n relevance: 0\n });\n return mode;\n};\nconst C_LINE_COMMENT_MODE = COMMENT('//', '$');\nconst C_BLOCK_COMMENT_MODE = COMMENT('/\\\\*', '\\\\*/');\nconst HASH_COMMENT_MODE = COMMENT('#', '$');\nconst NUMBER_MODE = {\n className: 'number',\n begin: NUMBER_RE,\n relevance: 0\n};\nconst C_NUMBER_MODE = {\n className: 'number',\n begin: C_NUMBER_RE,\n relevance: 0\n};\nconst BINARY_NUMBER_MODE = {\n className: 'number',\n begin: BINARY_NUMBER_RE,\n relevance: 0\n};\nconst CSS_NUMBER_MODE = {\n className: 'number',\n begin: NUMBER_RE + '(' +\n '%|em|ex|ch|rem' +\n '|vw|vh|vmin|vmax' +\n '|cm|mm|in|pt|pc|px' +\n '|deg|grad|rad|turn' +\n '|s|ms' +\n '|Hz|kHz' +\n '|dpi|dpcm|dppx' +\n ')?',\n relevance: 0\n};\nconst REGEXP_MODE = {\n // this outer rule makes sure we actually have a WHOLE regex and not simply\n // an expression such as:\n //\n // 3 / something\n //\n // (which will then blow up when regex's `illegal` sees the newline)\n begin: /(?=\\/[^/\\n]*\\/)/,\n contains: [{\n className: 'regexp',\n begin: /\\//,\n end: /\\/[gimuy]*/,\n illegal: /\\n/,\n contains: [\n BACKSLASH_ESCAPE,\n {\n begin: /\\[/,\n end: /\\]/,\n relevance: 0,\n contains: [BACKSLASH_ESCAPE]\n }\n ]\n }]\n};\nconst TITLE_MODE = {\n className: 'title',\n begin: IDENT_RE,\n relevance: 0\n};\nconst UNDERSCORE_TITLE_MODE = {\n className: 'title',\n begin: UNDERSCORE_IDENT_RE,\n relevance: 0\n};\nconst METHOD_GUARD = {\n // excludes method names from keyword processing\n begin: '\\\\.\\\\s*' + UNDERSCORE_IDENT_RE,\n relevance: 0\n};\n\n/**\n * Adds end same as begin mechanics to a mode\n *\n * Your mode must include at least a single () match group as that first match\n * group is what is used for comparison\n * @param {Partial<Mode>} mode\n */\nconst END_SAME_AS_BEGIN = function(mode) {\n return Object.assign(mode,\n {\n /** @type {ModeCallback} */\n 'on:begin': (m, resp) => { resp.data._beginMatch = m[1]; },\n /** @type {ModeCallback} */\n 'on:end': (m, resp) => { if (resp.data._beginMatch !== m[1]) resp.ignoreMatch(); }\n });\n};\n\nvar MODES = /*#__PURE__*/Object.freeze({\n __proto__: null,\n MATCH_NOTHING_RE: MATCH_NOTHING_RE,\n IDENT_RE: IDENT_RE,\n UNDERSCORE_IDENT_RE: UNDERSCORE_IDENT_RE,\n NUMBER_RE: NUMBER_RE,\n C_NUMBER_RE: C_NUMBER_RE,\n BINARY_NUMBER_RE: BINARY_NUMBER_RE,\n RE_STARTERS_RE: RE_STARTERS_RE,\n SHEBANG: SHEBANG,\n BACKSLASH_ESCAPE: BACKSLASH_ESCAPE,\n APOS_STRING_MODE: APOS_STRING_MODE,\n QUOTE_STRING_MODE: QUOTE_STRING_MODE,\n PHRASAL_WORDS_MODE: PHRASAL_WORDS_MODE,\n COMMENT: COMMENT,\n C_LINE_COMMENT_MODE: C_LINE_COMMENT_MODE,\n C_BLOCK_COMMENT_MODE: C_BLOCK_COMMENT_MODE,\n HASH_COMMENT_MODE: HASH_COMMENT_MODE,\n NUMBER_MODE: NUMBER_MODE,\n C_NUMBER_MODE: C_NUMBER_MODE,\n BINARY_NUMBER_MODE: BINARY_NUMBER_MODE,\n CSS_NUMBER_MODE: CSS_NUMBER_MODE,\n REGEXP_MODE: REGEXP_MODE,\n TITLE_MODE: TITLE_MODE,\n UNDERSCORE_TITLE_MODE: UNDERSCORE_TITLE_MODE,\n METHOD_GUARD: METHOD_GUARD,\n END_SAME_AS_BEGIN: END_SAME_AS_BEGIN\n});\n\n// Grammar extensions / plugins\n// See: https://github.com/highlightjs/highlight.js/issues/2833\n\n// Grammar extensions allow \"syntactic sugar\" to be added to the grammar modes\n// without requiring any underlying changes to the compiler internals.\n\n// `compileMatch` being the perfect small example of now allowing a grammar\n// author to write `match` when they desire to match a single expression rather\n// than being forced to use `begin`. The extension then just moves `match` into\n// `begin` when it runs. Ie, no features have been added, but we've just made\n// the experience of writing (and reading grammars) a little bit nicer.\n\n// ------\n\n// TODO: We need negative look-behind support to do this properly\n/**\n * Skip a match if it has a preceding dot\n *\n * This is used for `beginKeywords` to prevent matching expressions such as\n * `bob.keyword.do()`. The mode compiler automatically wires this up as a\n * special _internal_ 'on:begin' callback for modes with `beginKeywords`\n * @param {RegExpMatchArray} match\n * @param {CallbackResponse} response\n */\nfunction skipIfhasPrecedingDot(match, response) {\n const before = match.input[match.index - 1];\n if (before === \".\") {\n response.ignoreMatch();\n }\n}\n\n\n/**\n * `beginKeywords` syntactic sugar\n * @type {CompilerExt}\n */\nfunction beginKeywords(mode, parent) {\n if (!parent) return;\n if (!mode.beginKeywords) return;\n\n // for languages with keywords that include non-word characters checking for\n // a word boundary is not sufficient, so instead we check for a word boundary\n // or whitespace - this does no harm in any case since our keyword engine\n // doesn't allow spaces in keywords anyways and we still check for the boundary\n // first\n mode.begin = '\\\\b(' + mode.beginKeywords.split(' ').join('|') + ')(?!\\\\.)(?=\\\\b|\\\\s)';\n mode.__beforeBegin = skipIfhasPrecedingDot;\n mode.keywords = mode.keywords || mode.beginKeywords;\n delete mode.beginKeywords;\n\n // prevents double relevance, the keywords themselves provide\n // relevance, the mode doesn't need to double it\n // eslint-disable-next-line no-undefined\n if (mode.relevance === undefined) mode.relevance = 0;\n}\n\n/**\n * Allow `illegal` to contain an array of illegal values\n * @type {CompilerExt}\n */\nfunction compileIllegal(mode, _parent) {\n if (!Array.isArray(mode.illegal)) return;\n\n mode.illegal = either(...mode.illegal);\n}\n\n/**\n * `match` to match a single expression for readability\n * @type {CompilerExt}\n */\nfunction compileMatch(mode, _parent) {\n if (!mode.match) return;\n if (mode.begin || mode.end) throw new Error(\"begin & end are not supported with match\");\n\n mode.begin = mode.match;\n delete mode.match;\n}\n\n/**\n * provides the default 1 relevance to all modes\n * @type {CompilerExt}\n */\nfunction compileRelevance(mode, _parent) {\n // eslint-disable-next-line no-undefined\n if (mode.relevance === undefined) mode.relevance = 1;\n}\n\n// keywords that should have no default relevance value\nconst COMMON_KEYWORDS = [\n 'of',\n 'and',\n 'for',\n 'in',\n 'not',\n 'or',\n 'if',\n 'then',\n 'parent', // common variable name\n 'list', // common variable name\n 'value' // common variable name\n];\n\nconst DEFAULT_KEYWORD_CLASSNAME = \"keyword\";\n\n/**\n * Given raw keywords from a language definition, compile them.\n *\n * @param {string | Record<string,string|string[]> | Array<string>} rawKeywords\n * @param {boolean} caseInsensitive\n */\nfunction compileKeywords(rawKeywords, caseInsensitive, className = DEFAULT_KEYWORD_CLASSNAME) {\n /** @type KeywordDict */\n const compiledKeywords = {};\n\n // input can be a string of keywords, an array of keywords, or a object with\n // named keys representing className (which can then point to a string or array)\n if (typeof rawKeywords === 'string') {\n compileList(className, rawKeywords.split(\" \"));\n } else if (Array.isArray(rawKeywords)) {\n compileList(className, rawKeywords);\n } else {\n Object.keys(rawKeywords).forEach(function(className) {\n // collapse all our objects back into the parent object\n Object.assign(\n compiledKeywords,\n compileKeywords(rawKeywords[className], caseInsensitive, className)\n );\n });\n }\n return compiledKeywords;\n\n // ---\n\n /**\n * Compiles an individual list of keywords\n *\n * Ex: \"for if when while|5\"\n *\n * @param {string} className\n * @param {Array<string>} keywordList\n */\n function compileList(className, keywordList) {\n if (caseInsensitive) {\n keywordList = keywordList.map(x => x.toLowerCase());\n }\n keywordList.forEach(function(keyword) {\n const pair = keyword.split('|');\n compiledKeywords[pair[0]] = [className, scoreForKeyword(pair[0], pair[1])];\n });\n }\n}\n\n/**\n * Returns the proper score for a given keyword\n *\n * Also takes into account comment keywords, which will be scored 0 UNLESS\n * another score has been manually assigned.\n * @param {string} keyword\n * @param {string} [providedScore]\n */\nfunction scoreForKeyword(keyword, providedScore) {\n // manual scores always win over common keywords\n // so you can force a score of 1 if you really insist\n if (providedScore) {\n return Number(providedScore);\n }\n\n return commonKeyword(keyword) ? 0 : 1;\n}\n\n/**\n * Determines if a given keyword is common or not\n *\n * @param {string} keyword */\nfunction commonKeyword(keyword) {\n return COMMON_KEYWORDS.includes(keyword.toLowerCase());\n}\n\n// compilation\n\n/**\n * Compiles a language definition result\n *\n * Given the raw result of a language definition (Language), compiles this so\n * that it is ready for highlighting code.\n * @param {Language} language\n * @param {{plugins: HLJSPlugin[]}} opts\n * @returns {CompiledLanguage}\n */\nfunction compileLanguage(language, { plugins }) {\n /**\n * Builds a regex with the case sensativility of the current language\n *\n * @param {RegExp | string} value\n * @param {boolean} [global]\n */\n function langRe(value, global) {\n return new RegExp(\n source(value),\n 'm' + (language.case_insensitive ? 'i' : '') + (global ? 'g' : '')\n );\n }\n\n /**\n Stores multiple regular expressions and allows you to quickly search for\n them all in a string simultaneously - returning the first match. It does\n this by creating a huge (a|b|c) regex - each individual item wrapped with ()\n and joined by `|` - using match groups to track position. When a match is\n found checking which position in the array has content allows us to figure\n out which of the original regexes / match groups triggered the match.\n\n The match object itself (the result of `Regex.exec`) is returned but also\n enhanced by merging in any meta-data that was registered with the regex.\n This is how we keep track of which mode matched, and what type of rule\n (`illegal`, `begin`, end, etc).\n */\n class MultiRegex {\n constructor() {\n this.matchIndexes = {};\n // @ts-ignore\n this.regexes = [];\n this.matchAt = 1;\n this.position = 0;\n }\n\n // @ts-ignore\n addRule(re, opts) {\n opts.position = this.position++;\n // @ts-ignore\n this.matchIndexes[this.matchAt] = opts;\n this.regexes.push([opts, re]);\n this.matchAt += countMatchGroups(re) + 1;\n }\n\n compile() {\n if (this.regexes.length === 0) {\n // avoids the need to check length every time exec is called\n // @ts-ignore\n this.exec = () => null;\n }\n const terminators = this.regexes.map(el => el[1]);\n this.matcherRe = langRe(join(terminators), true);\n this.lastIndex = 0;\n }\n\n /** @param {string} s */\n exec(s) {\n this.matcherRe.lastIndex = this.lastIndex;\n const match = this.matcherRe.exec(s);\n if (!match) { return null; }\n\n // eslint-disable-next-line no-undefined\n const i = match.findIndex((el, i) => i > 0 && el !== undefined);\n // @ts-ignore\n const matchData = this.matchIndexes[i];\n // trim off any earlier non-relevant match groups (ie, the other regex\n // match groups that make up the multi-matcher)\n match.splice(0, i);\n\n return Object.assign(match, matchData);\n }\n }\n\n /*\n Created to solve the key deficiently with MultiRegex - there is no way to\n test for multiple matches at a single location. Why would we need to do\n that? In the future a more dynamic engine will allow certain matches to be\n ignored. An example: if we matched say the 3rd regex in a large group but\n decided to ignore it - we'd need to started testing again at the 4th\n regex... but MultiRegex itself gives us no real way to do that.\n\n So what this class creates MultiRegexs on the fly for whatever search\n position they are needed.\n\n NOTE: These additional MultiRegex objects are created dynamically. For most\n grammars most of the time we will never actually need anything more than the\n first MultiRegex - so this shouldn't have too much overhead.\n\n Say this is our search group, and we match regex3, but wish to ignore it.\n\n regex1 | regex2 | regex3 | regex4 | regex5 ' ie, startAt = 0\n\n What we need is a new MultiRegex that only includes the remaining\n possibilities:\n\n regex4 | regex5 ' ie, startAt = 3\n\n This class wraps all that complexity up in a simple API... `startAt` decides\n where in the array of expressions to start doing the matching. It\n auto-increments, so if a match is found at position 2, then startAt will be\n set to 3. If the end is reached startAt will return to 0.\n\n MOST of the time the parser will be setting startAt manually to 0.\n */\n class ResumableMultiRegex {\n constructor() {\n // @ts-ignore\n this.rules = [];\n // @ts-ignore\n this.multiRegexes = [];\n this.count = 0;\n\n this.lastIndex = 0;\n this.regexIndex = 0;\n }\n\n // @ts-ignore\n getMatcher(index) {\n if (this.multiRegexes[index]) return this.multiRegexes[index];\n\n const matcher = new MultiRegex();\n this.rules.slice(index).forEach(([re, opts]) => matcher.addRule(re, opts));\n matcher.compile();\n this.multiRegexes[index] = matcher;\n return matcher;\n }\n\n resumingScanAtSamePosition() {\n return this.regexIndex !== 0;\n }\n\n considerAll() {\n this.regexIndex = 0;\n }\n\n // @ts-ignore\n addRule(re, opts) {\n this.rules.push([re, opts]);\n if (opts.type === \"begin\") this.count++;\n }\n\n /** @param {string} s */\n exec(s) {\n const m = this.getMatcher(this.regexIndex);\n m.lastIndex = this.lastIndex;\n let result = m.exec(s);\n\n // The following is because we have no easy way to say \"resume scanning at the\n // existing position but also skip the current rule ONLY\". What happens is\n // all prior rules are also skipped which can result in matching the wrong\n // thing. Example of matching \"booger\":\n\n // our matcher is [string, \"booger\", number]\n //\n // ....booger....\n\n // if \"booger\" is ignored then we'd really need a regex to scan from the\n // SAME position for only: [string, number] but ignoring \"booger\" (if it\n // was the first match), a simple resume would scan ahead who knows how\n // far looking only for \"number\", ignoring potential string matches (or\n // future \"booger\" matches that might be valid.)\n\n // So what we do: We execute two matchers, one resuming at the same\n // position, but the second full matcher starting at the position after:\n\n // /--- resume first regex match here (for [number])\n // |/---- full match here for [string, \"booger\", number]\n // vv\n // ....booger....\n\n // Which ever results in a match first is then used. So this 3-4 step\n // process essentially allows us to say \"match at this position, excluding\n // a prior rule that was ignored\".\n //\n // 1. Match \"booger\" first, ignore. Also proves that [string] does non match.\n // 2. Resume matching for [number]\n // 3. Match at index + 1 for [string, \"booger\", number]\n // 4. If #2 and #3 result in matches, which came first?\n if (this.resumingScanAtSamePosition()) {\n if (result && result.index === this.lastIndex) ; else { // use the second matcher result\n const m2 = this.getMatcher(0);\n m2.lastIndex = this.lastIndex + 1;\n result = m2.exec(s);\n }\n }\n\n if (result) {\n this.regexIndex += result.position + 1;\n if (this.regexIndex === this.count) {\n // wrap-around to considering all matches again\n this.considerAll();\n }\n }\n\n return result;\n }\n }\n\n /**\n * Given a mode, builds a huge ResumableMultiRegex that can be used to walk\n * the content and find matches.\n *\n * @param {CompiledMode} mode\n * @returns {ResumableMultiRegex}\n */\n function buildModeRegex(mode) {\n const mm = new ResumableMultiRegex();\n\n mode.contains.forEach(term => mm.addRule(term.begin, { rule: term, type: \"begin\" }));\n\n if (mode.terminatorEnd) {\n mm.addRule(mode.terminatorEnd, { type: \"end\" });\n }\n if (mode.illegal) {\n mm.addRule(mode.illegal, { type: \"illegal\" });\n }\n\n return mm;\n }\n\n /** skip vs abort vs ignore\n *\n * @skip - The mode is still entered and exited normally (and contains rules apply),\n * but all content is held and added to the parent buffer rather than being\n * output when the mode ends. Mostly used with `sublanguage` to build up\n * a single large buffer than can be parsed by sublanguage.\n *\n * - The mode begin ands ends normally.\n * - Content matched is added to the parent mode buffer.\n * - The parser cursor is moved forward normally.\n *\n * @abort - A hack placeholder until we have ignore. Aborts the mode (as if it\n * never matched) but DOES NOT continue to match subsequent `contains`\n * modes. Abort is bad/suboptimal because it can result in modes\n * farther down not getting applied because an earlier rule eats the\n * content but then aborts.\n *\n * - The mode does not begin.\n * - Content matched by `begin` is added to the mode buffer.\n * - The parser cursor is moved forward accordingly.\n *\n * @ignore - Ignores the mode (as if it never matched) and continues to match any\n * subsequent `contains` modes. Ignore isn't technically possible with\n * the current parser implementation.\n *\n * - The mode does not begin.\n * - Content matched by `begin` is ignored.\n * - The parser cursor is not moved forward.\n */\n\n /**\n * Compiles an individual mode\n *\n * This can raise an error if the mode contains certain detectable known logic\n * issues.\n * @param {Mode} mode\n * @param {CompiledMode | null} [parent]\n * @returns {CompiledMode | never}\n */\n function compileMode(mode, parent) {\n const cmode = /** @type CompiledMode */ (mode);\n if (mode.isCompiled) return cmode;\n\n [\n // do this early so compiler extensions generally don't have to worry about\n // the distinction between match/begin\n compileMatch\n ].forEach(ext => ext(mode, parent));\n\n language.compilerExtensions.forEach(ext => ext(mode, parent));\n\n // __beforeBegin is considered private API, internal use only\n mode.__beforeBegin = null;\n\n [\n beginKeywords,\n // do this later so compiler extensions that come earlier have access to the\n // raw array if they wanted to perhaps manipulate it, etc.\n compileIllegal,\n // default to 1 relevance if not specified\n compileRelevance\n ].forEach(ext => ext(mode, parent));\n\n mode.isCompiled = true;\n\n let keywordPattern = null;\n if (typeof mode.keywords === \"object\") {\n keywordPattern = mode.keywords.$pattern;\n delete mode.keywords.$pattern;\n }\n\n if (mode.keywords) {\n mode.keywords = compileKeywords(mode.keywords, language.case_insensitive);\n }\n\n // both are not allowed\n if (mode.lexemes && keywordPattern) {\n throw new Error(\"ERR: Prefer `keywords.$pattern` to `mode.lexemes`, BOTH are not allowed. (see mode reference) \");\n }\n\n // `mode.lexemes` was the old standard before we added and now recommend\n // using `keywords.$pattern` to pass the keyword pattern\n keywordPattern = keywordPattern || mode.lexemes || /\\w+/;\n cmode.keywordPatternRe = langRe(keywordPattern, true);\n\n if (parent) {\n if (!mode.begin) mode.begin = /\\B|\\b/;\n cmode.beginRe = langRe(mode.begin);\n if (mode.endSameAsBegin) mode.end = mode.begin;\n if (!mode.end && !mode.endsWithParent) mode.end = /\\B|\\b/;\n if (mode.end) cmode.endRe = langRe(mode.end);\n cmode.terminatorEnd = source(mode.end) || '';\n if (mode.endsWithParent && parent.terminatorEnd) {\n cmode.terminatorEnd += (mode.end ? '|' : '') + parent.terminatorEnd;\n }\n }\n if (mode.illegal) cmode.illegalRe = langRe(/** @type {RegExp | string} */ (mode.illegal));\n if (!mode.contains) mode.contains = [];\n\n mode.contains = [].concat(...mode.contains.map(function(c) {\n return expandOrCloneMode(c === 'self' ? mode : c);\n }));\n mode.contains.forEach(function(c) { compileMode(/** @type Mode */ (c), cmode); });\n\n if (mode.starts) {\n compileMode(mode.starts, parent);\n }\n\n cmode.matcher = buildModeRegex(cmode);\n return cmode;\n }\n\n if (!language.compilerExtensions) language.compilerExtensions = [];\n\n // self is not valid at the top-level\n if (language.contains && language.contains.includes('self')) {\n throw new Error(\"ERR: contains `self` is not supported at the top-level of a language. See documentation.\");\n }\n\n // we need a null object, which inherit will guarantee\n language.classNameAliases = inherit(language.classNameAliases || {});\n\n return compileMode(/** @type Mode */ (language));\n}\n\n/**\n * Determines if a mode has a dependency on it's parent or not\n *\n * If a mode does have a parent dependency then often we need to clone it if\n * it's used in multiple places so that each copy points to the correct parent,\n * where-as modes without a parent can often safely be re-used at the bottom of\n * a mode chain.\n *\n * @param {Mode | null} mode\n * @returns {boolean} - is there a dependency on the parent?\n * */\nfunction dependencyOnParent(mode) {\n if (!mode) return false;\n\n return mode.endsWithParent || dependencyOnParent(mode.starts);\n}\n\n/**\n * Expands a mode or clones it if necessary\n *\n * This is necessary for modes with parental dependenceis (see notes on\n * `dependencyOnParent`) and for nodes that have `variants` - which must then be\n * exploded into their own individual modes at compile time.\n *\n * @param {Mode} mode\n * @returns {Mode | Mode[]}\n * */\nfunction expandOrCloneMode(mode) {\n if (mode.variants && !mode.cachedVariants) {\n mode.cachedVariants = mode.variants.map(function(variant) {\n return inherit(mode, { variants: null }, variant);\n });\n }\n\n // EXPAND\n // if we have variants then essentially \"replace\" the mode with the variants\n // this happens in compileMode, where this function is called from\n if (mode.cachedVariants) {\n return mode.cachedVariants;\n }\n\n // CLONE\n // if we have dependencies on parents then we need a unique\n // instance of ourselves, so we can be reused with many\n // different parents without issue\n if (dependencyOnParent(mode)) {\n return inherit(mode, { starts: mode.starts ? inherit(mode.starts) : null });\n }\n\n if (Object.isFrozen(mode)) {\n return inherit(mode);\n }\n\n // no special dependency issues, just return ourselves\n return mode;\n}\n\nvar version = \"10.7.3\";\n\n// @ts-nocheck\n\nfunction hasValueOrEmptyAttribute(value) {\n return Boolean(value || value === \"\");\n}\n\nfunction BuildVuePlugin(hljs) {\n const Component = {\n props: [\"language\", \"code\", \"autodetect\"],\n data: function() {\n return {\n detectedLanguage: \"\",\n unknownLanguage: false\n };\n },\n computed: {\n className() {\n if (this.unknownLanguage) return \"\";\n\n return \"hljs \" + this.detectedLanguage;\n },\n highlighted() {\n // no idea what language to use, return raw code\n if (!this.autoDetect && !hljs.getLanguage(this.language)) {\n console.warn(`The language \"${this.language}\" you specified could not be found.`);\n this.unknownLanguage = true;\n return escapeHTML(this.code);\n }\n\n let result = {};\n if (this.autoDetect) {\n result = hljs.highlightAuto(this.code);\n this.detectedLanguage = result.language;\n } else {\n result = hljs.highlight(this.language, this.code, this.ignoreIllegals);\n this.detectedLanguage = this.language;\n }\n return result.value;\n },\n autoDetect() {\n return !this.language || hasValueOrEmptyAttribute(this.autodetect);\n },\n ignoreIllegals() {\n return true;\n }\n },\n // this avoids needing to use a whole Vue compilation pipeline just\n // to build Highlight.js\n render(createElement) {\n return createElement(\"pre\", {}, [\n createElement(\"code\", {\n class: this.className,\n domProps: { innerHTML: this.highlighted }\n })\n ]);\n }\n // template: `<pre><code :class=\"className\" v-html=\"highlighted\"></code></pre>`\n };\n\n const VuePlugin = {\n install(Vue) {\n Vue.component('highlightjs', Component);\n }\n };\n\n return { Component, VuePlugin };\n}\n\n/* plugin itself */\n\n/** @type {HLJSPlugin} */\nconst mergeHTMLPlugin = {\n \"after:highlightElement\": ({ el, result, text }) => {\n const originalStream = nodeStream(el);\n if (!originalStream.length) return;\n\n const resultNode = document.createElement('div');\n resultNode.innerHTML = result.value;\n result.value = mergeStreams(originalStream, nodeStream(resultNode), text);\n }\n};\n\n/* Stream merging support functions */\n\n/**\n * @typedef Event\n * @property {'start'|'stop'} event\n * @property {number} offset\n * @property {Node} node\n */\n\n/**\n * @param {Node} node\n */\nfunction tag(node) {\n return node.nodeName.toLowerCase();\n}\n\n/**\n * @param {Node} node\n */\nfunction nodeStream(node) {\n /** @type Event[] */\n const result = [];\n (function _nodeStream(node, offset) {\n for (let child = node.firstChild; child; child = child.nextSibling) {\n if (child.nodeType === 3) {\n offset += child.nodeValue.length;\n } else if (child.nodeType === 1) {\n result.push({\n event: 'start',\n offset: offset,\n node: child\n });\n offset = _nodeStream(child, offset);\n // Prevent void elements from having an end tag that would actually\n // double them in the output. There are more void elements in HTML\n // but we list only those realistically expected in code display.\n if (!tag(child).match(/br|hr|img|input/)) {\n result.push({\n event: 'stop',\n offset: offset,\n node: child\n });\n }\n }\n }\n return offset;\n })(node, 0);\n return result;\n}\n\n/**\n * @param {any} original - the original stream\n * @param {any} highlighted - stream of the highlighted source\n * @param {string} value - the original source itself\n */\nfunction mergeStreams(original, highlighted, value) {\n let processed = 0;\n let result = '';\n const nodeStack = [];\n\n function selectStream() {\n if (!original.length || !highlighted.length) {\n return original.length ? original : highlighted;\n }\n if (original[0].offset !== highlighted[0].offset) {\n return (original[0].offset < highlighted[0].offset) ? original : highlighted;\n }\n\n /*\n To avoid starting the stream just before it should stop the order is\n ensured that original always starts first and closes last:\n\n if (event1 == 'start' && event2 == 'start')\n return original;\n if (event1 == 'start' && event2 == 'stop')\n return highlighted;\n if (event1 == 'stop' && event2 == 'start')\n return original;\n if (event1 == 'stop' && event2 == 'stop')\n return highlighted;\n\n ... which is collapsed to:\n */\n return highlighted[0].event === 'start' ? original : highlighted;\n }\n\n /**\n * @param {Node} node\n */\n function open(node) {\n /** @param {Attr} attr */\n function attributeString(attr) {\n return ' ' + attr.nodeName + '=\"' + escapeHTML(attr.value) + '\"';\n }\n // @ts-ignore\n result += '<' + tag(node) + [].map.call(node.attributes, attributeString).join('') + '>';\n }\n\n /**\n * @param {Node} node\n */\n function close(node) {\n result += '</' + tag(node) + '>';\n }\n\n /**\n * @param {Event} event\n */\n function render(event) {\n (event.event === 'start' ? open : close)(event.node);\n }\n\n while (original.length || highlighted.length) {\n let stream = selectStream();\n result += escapeHTML(value.substring(processed, stream[0].offset));\n processed = stream[0].offset;\n if (stream === original) {\n /*\n On any opening or closing tag of the original markup we first close\n the entire highlighted node stack, then render the original tag along\n with all the following original tags at the same offset and then\n reopen all the tags on the highlighted stack.\n */\n nodeStack.reverse().forEach(close);\n do {\n render(stream.splice(0, 1)[0]);\n stream = selectStream();\n } while (stream === original && stream.length && stream[0].offset === processed);\n nodeStack.reverse().forEach(open);\n } else {\n if (stream[0].event === 'start') {\n nodeStack.push(stream[0].node);\n } else {\n nodeStack.pop();\n }\n render(stream.splice(0, 1)[0]);\n }\n }\n return result + escapeHTML(value.substr(processed));\n}\n\n/*\n\nFor the reasoning behind this please see:\nhttps://github.com/highlightjs/highlight.js/issues/2880#issuecomment-747275419\n\n*/\n\n/**\n * @type {Record<string, boolean>}\n */\nconst seenDeprecations = {};\n\n/**\n * @param {string} message\n */\nconst error = (message) => {\n console.error(message);\n};\n\n/**\n * @param {string} message\n * @param {any} args\n */\nconst warn = (message, ...args) => {\n console.log(`WARN: ${message}`, ...args);\n};\n\n/**\n * @param {string} version\n * @param {string} message\n */\nconst deprecated = (version, message) => {\n if (seenDeprecations[`${version}/${message}`]) return;\n\n console.log(`Deprecated as of ${version}. ${message}`);\n seenDeprecations[`${version}/${message}`] = true;\n};\n\n/*\nSyntax highlighting with language autodetection.\nhttps://highlightjs.org/\n*/\n\nconst escape$1 = escapeHTML;\nconst inherit$1 = inherit;\nconst NO_MATCH = Symbol(\"nomatch\");\n\n/**\n * @param {any} hljs - object that is extended (legacy)\n * @returns {HLJSApi}\n */\nconst HLJS = function(hljs) {\n // Global internal variables used within the highlight.js library.\n /** @type {Record<string, Language>} */\n const languages = Object.create(null);\n /** @type {Record<string, string>} */\n const aliases = Object.create(null);\n /** @type {HLJSPlugin[]} */\n const plugins = [];\n\n // safe/production mode - swallows more errors, tries to keep running\n // even if a single syntax or parse hits a fatal error\n let SAFE_MODE = true;\n const fixMarkupRe = /(^(<[^>]+>|\\t|)+|\\n)/gm;\n const LANGUAGE_NOT_FOUND = \"Could not find the language '{}', did you forget to load/include a language module?\";\n /** @type {Language} */\n const PLAINTEXT_LANGUAGE = { disableAutodetect: true, name: 'Plain text', contains: [] };\n\n // Global options used when within external APIs. This is modified when\n // calling the `hljs.configure` function.\n /** @type HLJSOptions */\n let options = {\n noHighlightRe: /^(no-?highlight)$/i,\n languageDetectRe: /\\blang(?:uage)?-([\\w-]+)\\b/i,\n classPrefix: 'hljs-',\n tabReplace: null,\n useBR: false,\n languages: null,\n // beta configuration options, subject to change, welcome to discuss\n // https://github.com/highlightjs/highlight.js/issues/1086\n __emitter: TokenTreeEmitter\n };\n\n /* Utility functions */\n\n /**\n * Tests a language name to see if highlighting should be skipped\n * @param {string} languageName\n */\n function shouldNotHighlight(languageName) {\n return options.noHighlightRe.test(languageName);\n }\n\n /**\n * @param {HighlightedHTMLElement} block - the HTML element to determine language for\n */\n function blockLanguage(block) {\n let classes = block.className + ' ';\n\n classes += block.parentNode ? block.parentNode.className : '';\n\n // language-* takes precedence over non-prefixed class names.\n const match = options.languageDetectRe.exec(classes);\n if (match) {\n const language = getLanguage(match[1]);\n if (!language) {\n warn(LANGUAGE_NOT_FOUND.replace(\"{}\", match[1]));\n warn(\"Falling back to no-highlight mode for this block.\", block);\n }\n return language ? match[1] : 'no-highlight';\n }\n\n return classes\n .split(/\\s+/)\n .find((_class) => shouldNotHighlight(_class) || getLanguage(_class));\n }\n\n /**\n * Core highlighting function.\n *\n * OLD API\n * highlight(lang, code, ignoreIllegals, continuation)\n *\n * NEW API\n * highlight(code, {lang, ignoreIllegals})\n *\n * @param {string} codeOrlanguageName - the language to use for highlighting\n * @param {string | HighlightOptions} optionsOrCode - the code to highlight\n * @param {boolean} [ignoreIllegals] - whether to ignore illegal matches, default is to bail\n * @param {CompiledMode} [continuation] - current continuation mode, if any\n *\n * @returns {HighlightResult} Result - an object that represents the result\n * @property {string} language - the language name\n * @property {number} relevance - the relevance score\n * @property {string} value - the highlighted HTML code\n * @property {string} code - the original raw code\n * @property {CompiledMode} top - top of the current mode stack\n * @property {boolean} illegal - indicates whether any illegal matches were found\n */\n function highlight(codeOrlanguageName, optionsOrCode, ignoreIllegals, continuation) {\n let code = \"\";\n let languageName = \"\";\n if (typeof optionsOrCode === \"object\") {\n code = codeOrlanguageName;\n ignoreIllegals = optionsOrCode.ignoreIllegals;\n languageName = optionsOrCode.language;\n // continuation not supported at all via the new API\n // eslint-disable-next-line no-undefined\n continuation = undefined;\n } else {\n // old API\n deprecated(\"10.7.0\", \"highlight(lang, code, ...args) has been deprecated.\");\n deprecated(\"10.7.0\", \"Please use highlight(code, options) instead.\\nhttps://github.com/highlightjs/highlight.js/issues/2277\");\n languageName = codeOrlanguageName;\n code = optionsOrCode;\n }\n\n /** @type {BeforeHighlightContext} */\n const context = {\n code,\n language: languageName\n };\n // the plugin can change the desired language or the code to be highlighted\n // just be changing the object it was passed\n fire(\"before:highlight\", context);\n\n // a before plugin can usurp the result completely by providing it's own\n // in which case we don't even need to call highlight\n const result = context.result\n ? context.result\n : _highlight(context.language, context.code, ignoreIllegals, continuation);\n\n result.code = context.code;\n // the plugin can change anything in result to suite it\n fire(\"after:highlight\", result);\n\n return result;\n }\n\n /**\n * private highlight that's used internally and does not fire callbacks\n *\n * @param {string} languageName - the language to use for highlighting\n * @param {string} codeToHighlight - the code to highlight\n * @param {boolean?} [ignoreIllegals] - whether to ignore illegal matches, default is to bail\n * @param {CompiledMode?} [continuation] - current continuation mode, if any\n * @returns {HighlightResult} - result of the highlight operation\n */\n function _highlight(languageName, codeToHighlight, ignoreIllegals, continuation) {\n /**\n * Return keyword data if a match is a keyword\n * @param {CompiledMode} mode - current mode\n * @param {RegExpMatchArray} match - regexp match data\n * @returns {KeywordData | false}\n */\n function keywordData(mode, match) {\n const matchText = language.case_insensitive ? match[0].toLowerCase() : match[0];\n return Object.prototype.hasOwnProperty.call(mode.keywords, matchText) && mode.keywords[matchText];\n }\n\n function processKeywords() {\n if (!top.keywords) {\n emitter.addText(modeBuffer);\n return;\n }\n\n let lastIndex = 0;\n top.keywordPatternRe.lastIndex = 0;\n let match = top.keywordPatternRe.exec(modeBuffer);\n let buf = \"\";\n\n while (match) {\n buf += modeBuffer.substring(lastIndex, match.index);\n const data = keywordData(top, match);\n if (data) {\n const [kind, keywordRelevance] = data;\n emitter.addText(buf);\n buf = \"\";\n\n relevance += keywordRelevance;\n if (kind.startsWith(\"_\")) {\n // _ implied for relevance only, do not highlight\n // by applying a class name\n buf += match[0];\n } else {\n const cssClass = language.classNameAliases[kind] || kind;\n emitter.addKeyword(match[0], cssClass);\n }\n } else {\n buf += match[0];\n }\n lastIndex = top.keywordPatternRe.lastIndex;\n match = top.keywordPatternRe.exec(modeBuffer);\n }\n buf += modeBuffer.substr(lastIndex);\n emitter.addText(buf);\n }\n\n function processSubLanguage() {\n if (modeBuffer === \"\") return;\n /** @type HighlightResult */\n let result = null;\n\n if (typeof top.subLanguage === 'string') {\n if (!languages[top.subLanguage]) {\n emitter.addText(modeBuffer);\n return;\n }\n result = _highlight(top.subLanguage, modeBuffer, true, continuations[top.subLanguage]);\n continuations[top.subLanguage] = /** @type {CompiledMode} */ (result.top);\n } else {\n result = highlightAuto(modeBuffer, top.subLanguage.length ? top.subLanguage : null);\n }\n\n // Counting embedded language score towards the host language may be disabled\n // with zeroing the containing mode relevance. Use case in point is Markdown that\n // allows XML everywhere and makes every XML snippet to have a much larger Markdown\n // score.\n if (top.relevance > 0) {\n relevance += result.relevance;\n }\n emitter.addSublanguage(result.emitter, result.language);\n }\n\n function processBuffer() {\n if (top.subLanguage != null) {\n processSubLanguage();\n } else {\n processKeywords();\n }\n modeBuffer = '';\n }\n\n /**\n * @param {Mode} mode - new mode to start\n */\n function startNewMode(mode) {\n if (mode.className) {\n emitter.openNode(language.classNameAliases[mode.className] || mode.className);\n }\n top = Object.create(mode, { parent: { value: top } });\n return top;\n }\n\n /**\n * @param {CompiledMode } mode - the mode to potentially end\n * @param {RegExpMatchArray} match - the latest match\n * @param {string} matchPlusRemainder - match plus remainder of content\n * @returns {CompiledMode | void} - the next mode, or if void continue on in current mode\n */\n function endOfMode(mode, match, matchPlusRemainder) {\n let matched = startsWith(mode.endRe, matchPlusRemainder);\n\n if (matched) {\n if (mode[\"on:end\"]) {\n const resp = new Response(mode);\n mode[\"on:end\"](match, resp);\n if (resp.isMatchIgnored) matched = false;\n }\n\n if (matched) {\n while (mode.endsParent && mode.parent) {\n mode = mode.parent;\n }\n return mode;\n }\n }\n // even if on:end fires an `ignore` it's still possible\n // that we might trigger the end node because of a parent mode\n if (mode.endsWithParent) {\n return endOfMode(mode.parent, match, matchPlusRemainder);\n }\n }\n\n /**\n * Handle matching but then ignoring a sequence of text\n *\n * @param {string} lexeme - string containing full match text\n */\n function doIgnore(lexeme) {\n if (top.matcher.regexIndex === 0) {\n // no more regexs to potentially match here, so we move the cursor forward one\n // space\n modeBuffer += lexeme[0];\n return 1;\n } else {\n // no need to move the cursor, we still have additional regexes to try and\n // match at this very spot\n resumeScanAtSamePosition = true;\n return 0;\n }\n }\n\n /**\n * Handle the start of a new potential mode match\n *\n * @param {EnhancedMatch} match - the current match\n * @returns {number} how far to advance the parse cursor\n */\n function doBeginMatch(match) {\n const lexeme = match[0];\n const newMode = match.rule;\n\n const resp = new Response(newMode);\n // first internal before callbacks, then the public ones\n const beforeCallbacks = [newMode.__beforeBegin, newMode[\"on:begin\"]];\n for (const cb of beforeCallbacks) {\n if (!cb) continue;\n cb(match, resp);\n if (resp.isMatchIgnored) return doIgnore(lexeme);\n }\n\n if (newMode && newMode.endSameAsBegin) {\n newMode.endRe = escape(lexeme);\n }\n\n if (newMode.skip) {\n modeBuffer += lexeme;\n } else {\n if (newMode.excludeBegin) {\n modeBuffer += lexeme;\n }\n processBuffer();\n if (!newMode.returnBegin && !newMode.excludeBegin) {\n modeBuffer = lexeme;\n }\n }\n startNewMode(newMode);\n // if (mode[\"after:begin\"]) {\n // let resp = new Response(mode);\n // mode[\"after:begin\"](match, resp);\n // }\n return newMode.returnBegin ? 0 : lexeme.length;\n }\n\n /**\n * Handle the potential end of mode\n *\n * @param {RegExpMatchArray} match - the current match\n */\n function doEndMatch(match) {\n const lexeme = match[0];\n const matchPlusRemainder = codeToHighlight.substr(match.index);\n\n const endMode = endOfMode(top, match, matchPlusRemainder);\n if (!endMode) { return NO_MATCH; }\n\n const origin = top;\n if (origin.skip) {\n modeBuffer += lexeme;\n } else {\n if (!(origin.returnEnd || origin.excludeEnd)) {\n modeBuffer += lexeme;\n }\n processBuffer();\n if (origin.excludeEnd) {\n modeBuffer = lexeme;\n }\n }\n do {\n if (top.className) {\n emitter.closeNode();\n }\n if (!top.skip && !top.subLanguage) {\n relevance += top.relevance;\n }\n top = top.parent;\n } while (top !== endMode.parent);\n if (endMode.starts) {\n if (endMode.endSameAsBegin) {\n endMode.starts.endRe = endMode.endRe;\n }\n startNewMode(endMode.starts);\n }\n return origin.returnEnd ? 0 : lexeme.length;\n }\n\n function processContinuations() {\n const list = [];\n for (let current = top; current !== language; current = current.parent) {\n if (current.className) {\n list.unshift(current.className);\n }\n }\n list.forEach(item => emitter.openNode(item));\n }\n\n /** @type {{type?: MatchType, index?: number, rule?: Mode}}} */\n let lastMatch = {};\n\n /**\n * Process an individual match\n *\n * @param {string} textBeforeMatch - text preceeding the match (since the last match)\n * @param {EnhancedMatch} [match] - the match itself\n */\n function processLexeme(textBeforeMatch, match) {\n const lexeme = match && match[0];\n\n // add non-matched text to the current mode buffer\n modeBuffer += textBeforeMatch;\n\n if (lexeme == null) {\n processBuffer();\n return 0;\n }\n\n // we've found a 0 width match and we're stuck, so we need to advance\n // this happens when we have badly behaved rules that have optional matchers to the degree that\n // sometimes they can end up matching nothing at all\n // Ref: https://github.com/highlightjs/highlight.js/issues/2140\n if (lastMatch.type === \"begin\" && match.type === \"end\" && lastMatch.index === match.index && lexeme === \"\") {\n // spit the \"skipped\" character that our regex choked on back into the output sequence\n modeBuffer += codeToHighlight.slice(match.index, match.index + 1);\n if (!SAFE_MODE) {\n /** @type {AnnotatedError} */\n const err = new Error('0 width match regex');\n err.languageName = languageName;\n err.badRule = lastMatch.rule;\n throw err;\n }\n return 1;\n }\n lastMatch = match;\n\n if (match.type === \"begin\") {\n return doBeginMatch(match);\n } else if (match.type === \"illegal\" && !ignoreIllegals) {\n // illegal match, we do not continue processing\n /** @type {AnnotatedError} */\n const err = new Error('Illegal lexeme \"' + lexeme + '\" for mode \"' + (top.className || '<unnamed>') + '\"');\n err.mode = top;\n throw err;\n } else if (match.type === \"end\") {\n const processed = doEndMatch(match);\n if (processed !== NO_MATCH) {\n return processed;\n }\n }\n\n // edge case for when illegal matches $ (end of line) which is technically\n // a 0 width match but not a begin/end match so it's not caught by the\n // first handler (when ignoreIllegals is true)\n if (match.type === \"illegal\" && lexeme === \"\") {\n // advance so we aren't stuck in an infinite loop\n return 1;\n }\n\n // infinite loops are BAD, this is a last ditch catch all. if we have a\n // decent number of iterations yet our index (cursor position in our\n // parsing) still 3x behind our index then something is very wrong\n // so we bail\n if (iterations > 100000 && iterations > match.index * 3) {\n const err = new Error('potential infinite loop, way more iterations than matches');\n throw err;\n }\n\n /*\n Why might be find ourselves here? Only one occasion now. An end match that was\n triggered but could not be completed. When might this happen? When an `endSameasBegin`\n rule sets the end rule to a specific match. Since the overall mode termination rule that's\n being used to scan the text isn't recompiled that means that any match that LOOKS like\n the end (but is not, because it is not an exact match to the beginning) will\n end up here. A definite end match, but when `doEndMatch` tries to \"reapply\"\n the end rule and fails to match, we wind up here, and just silently ignore the end.\n\n This causes no real harm other than stopping a few times too many.\n */\n\n modeBuffer += lexeme;\n return lexeme.length;\n }\n\n const language = getLanguage(languageName);\n if (!language) {\n error(LANGUAGE_NOT_FOUND.replace(\"{}\", languageName));\n throw new Error('Unknown language: \"' + languageName + '\"');\n }\n\n const md = compileLanguage(language, { plugins });\n let result = '';\n /** @type {CompiledMode} */\n let top = continuation || md;\n /** @type Record<string,CompiledMode> */\n const continuations = {}; // keep continuations for sub-languages\n const emitter = new options.__emitter(options);\n processContinuations();\n let modeBuffer = '';\n let relevance = 0;\n let index = 0;\n let iterations = 0;\n let resumeScanAtSamePosition = false;\n\n try {\n top.matcher.considerAll();\n\n for (;;) {\n iterations++;\n if (resumeScanAtSamePosition) {\n // only regexes not matched previously will now be\n // considered for a potential match\n resumeScanAtSamePosition = false;\n } else {\n top.matcher.considerAll();\n }\n top.matcher.lastIndex = index;\n\n const match = top.matcher.exec(codeToHighlight);\n // console.log(\"match\", match[0], match.rule && match.rule.begin)\n\n if (!match) break;\n\n const beforeMatch = codeToHighlight.substring(index, match.index);\n const processedCount = processLexeme(beforeMatch, match);\n index = match.index + processedCount;\n }\n processLexeme(codeToHighlight.substr(index));\n emitter.closeAllNodes();\n emitter.finalize();\n result = emitter.toHTML();\n\n return {\n // avoid possible breakage with v10 clients expecting\n // this to always be an integer\n relevance: Math.floor(relevance),\n value: result,\n language: languageName,\n illegal: false,\n emitter: emitter,\n top: top\n };\n } catch (err) {\n if (err.message && err.message.includes('Illegal')) {\n return {\n illegal: true,\n illegalBy: {\n msg: err.message,\n context: codeToHighlight.slice(index - 100, index + 100),\n mode: err.mode\n },\n sofar: result,\n relevance: 0,\n value: escape$1(codeToHighlight),\n emitter: emitter\n };\n } else if (SAFE_MODE) {\n return {\n illegal: false,\n relevance: 0,\n value: escape$1(codeToHighlight),\n emitter: emitter,\n language: languageName,\n top: top,\n errorRaised: err\n };\n } else {\n throw err;\n }\n }\n }\n\n /**\n * returns a valid highlight result, without actually doing any actual work,\n * auto highlight starts with this and it's possible for small snippets that\n * auto-detection may not find a better match\n * @param {string} code\n * @returns {HighlightResult}\n */\n function justTextHighlightResult(code) {\n const result = {\n relevance: 0,\n emitter: new options.__emitter(options),\n value: escape$1(code),\n illegal: false,\n top: PLAINTEXT_LANGUAGE\n };\n result.emitter.addText(code);\n return result;\n }\n\n /**\n Highlighting with language detection. Accepts a string with the code to\n highlight. Returns an object with the following properties:\n\n - language (detected language)\n - relevance (int)\n - value (an HTML string with highlighting markup)\n - second_best (object with the same structure for second-best heuristically\n detected language, may be absent)\n\n @param {string} code\n @param {Array<string>} [languageSubset]\n @returns {AutoHighlightResult}\n */\n function highlightAuto(code, languageSubset) {\n languageSubset = languageSubset || options.languages || Object.keys(languages);\n const plaintext = justTextHighlightResult(code);\n\n const results = languageSubset.filter(getLanguage).filter(autoDetection).map(name =>\n _highlight(name, code, false)\n );\n results.unshift(plaintext); // plaintext is always an option\n\n const sorted = results.sort((a, b) => {\n // sort base on relevance\n if (a.relevance !== b.relevance) return b.relevance - a.relevance;\n\n // always award the tie to the base language\n // ie if C++ and Arduino are tied, it's more likely to be C++\n if (a.language && b.language) {\n if (getLanguage(a.language).supersetOf === b.language) {\n return 1;\n } else if (getLanguage(b.language).supersetOf === a.language) {\n return -1;\n }\n }\n\n // otherwise say they are equal, which has the effect of sorting on\n // relevance while preserving the original ordering - which is how ties\n // have historically been settled, ie the language that comes first always\n // wins in the case of a tie\n return 0;\n });\n\n const [best, secondBest] = sorted;\n\n /** @type {AutoHighlightResult} */\n const result = best;\n result.second_best = secondBest;\n\n return result;\n }\n\n /**\n Post-processing of the highlighted markup:\n\n - replace TABs with something more useful\n - replace real line-breaks with '<br>' for non-pre containers\n\n @param {string} html\n @returns {string}\n */\n function fixMarkup(html) {\n if (!(options.tabReplace || options.useBR)) {\n return html;\n }\n\n return html.replace(fixMarkupRe, match => {\n if (match === '\\n') {\n return options.useBR ? '<br>' : match;\n } else if (options.tabReplace) {\n return match.replace(/\\t/g, options.tabReplace);\n }\n return match;\n });\n }\n\n /**\n * Builds new class name for block given the language name\n *\n * @param {HTMLElement} element\n * @param {string} [currentLang]\n * @param {string} [resultLang]\n */\n function updateClassName(element, currentLang, resultLang) {\n const language = currentLang ? aliases[currentLang] : resultLang;\n\n element.classList.add(\"hljs\");\n if (language) element.classList.add(language);\n }\n\n /** @type {HLJSPlugin} */\n const brPlugin = {\n \"before:highlightElement\": ({ el }) => {\n if (options.useBR) {\n el.innerHTML = el.innerHTML.replace(/\\n/g, '').replace(/<br[ /]*>/g, '\\n');\n }\n },\n \"after:highlightElement\": ({ result }) => {\n if (options.useBR) {\n result.value = result.value.replace(/\\n/g, \"<br>\");\n }\n }\n };\n\n const TAB_REPLACE_RE = /^(<[^>]+>|\\t)+/gm;\n /** @type {HLJSPlugin} */\n const tabReplacePlugin = {\n \"after:highlightElement\": ({ result }) => {\n if (options.tabReplace) {\n result.value = result.value.replace(TAB_REPLACE_RE, (m) =>\n m.replace(/\\t/g, options.tabReplace)\n );\n }\n }\n };\n\n /**\n * Applies highlighting to a DOM node containing code. Accepts a DOM node and\n * two optional parameters for fixMarkup.\n *\n * @param {HighlightedHTMLElement} element - the HTML element to highlight\n */\n function highlightElement(element) {\n /** @type HTMLElement */\n let node = null;\n const language = blockLanguage(element);\n\n if (shouldNotHighlight(language)) return;\n\n // support for v10 API\n fire(\"before:highlightElement\",\n { el: element, language: language });\n\n node = element;\n const text = node.textContent;\n const result = language ? highlight(text, { language, ignoreIllegals: true }) : highlightAuto(text);\n\n // support for v10 API\n fire(\"after:highlightElement\", { el: element, result, text });\n\n element.innerHTML = result.value;\n updateClassName(element, language, result.language);\n element.result = {\n language: result.language,\n // TODO: remove with version 11.0\n re: result.relevance,\n relavance: result.relevance\n };\n if (result.second_best) {\n element.second_best = {\n language: result.second_best.language,\n // TODO: remove with version 11.0\n re: result.second_best.relevance,\n relavance: result.second_best.relevance\n };\n }\n }\n\n /**\n * Updates highlight.js global options with the passed options\n *\n * @param {Partial<HLJSOptions>} userOptions\n */\n function configure(userOptions) {\n if (userOptions.useBR) {\n deprecated(\"10.3.0\", \"'useBR' will be removed entirely in v11.0\");\n deprecated(\"10.3.0\", \"Please see https://github.com/highlightjs/highlight.js/issues/2559\");\n }\n options = inherit$1(options, userOptions);\n }\n\n /**\n * Highlights to all <pre><code> blocks on a page\n *\n * @type {Function & {called?: boolean}}\n */\n // TODO: remove v12, deprecated\n const initHighlighting = () => {\n if (initHighlighting.called) return;\n initHighlighting.called = true;\n\n deprecated(\"10.6.0\", \"initHighlighting() is deprecated. Use highlightAll() instead.\");\n\n const blocks = document.querySelectorAll('pre code');\n blocks.forEach(highlightElement);\n };\n\n // Higlights all when DOMContentLoaded fires\n // TODO: remove v12, deprecated\n function initHighlightingOnLoad() {\n deprecated(\"10.6.0\", \"initHighlightingOnLoad() is deprecated. Use highlightAll() instead.\");\n wantsHighlight = true;\n }\n\n let wantsHighlight = false;\n\n /**\n * auto-highlights all pre>code elements on the page\n */\n function highlightAll() {\n // if we are called too early in the loading process\n if (document.readyState === \"loading\") {\n wantsHighlight = true;\n return;\n }\n\n const blocks = document.querySelectorAll('pre code');\n blocks.forEach(highlightElement);\n }\n\n function boot() {\n // if a highlight was requested before DOM was loaded, do now\n if (wantsHighlight) highlightAll();\n }\n\n // make sure we are in the browser environment\n if (typeof window !== 'undefined' && window.addEventListener) {\n window.addEventListener('DOMContentLoaded', boot, false);\n }\n\n /**\n * Register a language grammar module\n *\n * @param {string} languageName\n * @param {LanguageFn} languageDefinition\n */\n function registerLanguage(languageName, languageDefinition) {\n let lang = null;\n try {\n lang = languageDefinition(hljs);\n } catch (error$1) {\n error(\"Language definition for '{}' could not be registered.\".replace(\"{}\", languageName));\n // hard or soft error\n if (!SAFE_MODE) { throw error$1; } else { error(error$1); }\n // languages that have serious errors are replaced with essentially a\n // \"plaintext\" stand-in so that the code blocks will still get normal\n // css classes applied to them - and one bad language won't break the\n // entire highlighter\n lang = PLAINTEXT_LANGUAGE;\n }\n // give it a temporary name if it doesn't have one in the meta-data\n if (!lang.name) lang.name = languageName;\n languages[languageName] = lang;\n lang.rawDefinition = languageDefinition.bind(null, hljs);\n\n if (lang.aliases) {\n registerAliases(lang.aliases, { languageName });\n }\n }\n\n /**\n * Remove a language grammar module\n *\n * @param {string} languageName\n */\n function unregisterLanguage(languageName) {\n delete languages[languageName];\n for (const alias of Object.keys(aliases)) {\n if (aliases[alias] === languageName) {\n delete aliases[alias];\n }\n }\n }\n\n /**\n * @returns {string[]} List of language internal names\n */\n function listLanguages() {\n return Object.keys(languages);\n }\n\n /**\n intended usage: When one language truly requires another\n\n Unlike `getLanguage`, this will throw when the requested language\n is not available.\n\n @param {string} name - name of the language to fetch/require\n @returns {Language | never}\n */\n function requireLanguage(name) {\n deprecated(\"10.4.0\", \"requireLanguage will be removed entirely in v11.\");\n deprecated(\"10.4.0\", \"Please see https://github.com/highlightjs/highlight.js/pull/2844\");\n\n const lang = getLanguage(name);\n if (lang) { return lang; }\n\n const err = new Error('The \\'{}\\' language is required, but not loaded.'.replace('{}', name));\n throw err;\n }\n\n /**\n * @param {string} name - name of the language to retrieve\n * @returns {Language | undefined}\n */\n function getLanguage(name) {\n name = (name || '').toLowerCase();\n return languages[name] || languages[aliases[name]];\n }\n\n /**\n *\n * @param {string|string[]} aliasList - single alias or list of aliases\n * @param {{languageName: string}} opts\n */\n function registerAliases(aliasList, { languageName }) {\n if (typeof aliasList === 'string') {\n aliasList = [aliasList];\n }\n aliasList.forEach(alias => { aliases[alias.toLowerCase()] = languageName; });\n }\n\n /**\n * Determines if a given language has auto-detection enabled\n * @param {string} name - name of the language\n */\n function autoDetection(name) {\n const lang = getLanguage(name);\n return lang && !lang.disableAutodetect;\n }\n\n /**\n * Upgrades the old highlightBlock plugins to the new\n * highlightElement API\n * @param {HLJSPlugin} plugin\n */\n function upgradePluginAPI(plugin) {\n // TODO: remove with v12\n if (plugin[\"before:highlightBlock\"] && !plugin[\"before:highlightElement\"]) {\n plugin[\"before:highlightElement\"] = (data) => {\n plugin[\"before:highlightBlock\"](\n Object.assign({ block: data.el }, data)\n );\n };\n }\n if (plugin[\"after:highlightBlock\"] && !plugin[\"after:highlightElement\"]) {\n plugin[\"after:highlightElement\"] = (data) => {\n plugin[\"after:highlightBlock\"](\n Object.assign({ block: data.el }, data)\n );\n };\n }\n }\n\n /**\n * @param {HLJSPlugin} plugin\n */\n function addPlugin(plugin) {\n upgradePluginAPI(plugin);\n plugins.push(plugin);\n }\n\n /**\n *\n * @param {PluginEvent} event\n * @param {any} args\n */\n function fire(event, args) {\n const cb = event;\n plugins.forEach(function(plugin) {\n if (plugin[cb]) {\n plugin[cb](args);\n }\n });\n }\n\n /**\n Note: fixMarkup is deprecated and will be removed entirely in v11\n\n @param {string} arg\n @returns {string}\n */\n function deprecateFixMarkup(arg) {\n deprecated(\"10.2.0\", \"fixMarkup will be removed entirely in v11.0\");\n deprecated(\"10.2.0\", \"Please see https://github.com/highlightjs/highlight.js/issues/2534\");\n\n return fixMarkup(arg);\n }\n\n /**\n *\n * @param {HighlightedHTMLElement} el\n */\n function deprecateHighlightBlock(el) {\n deprecated(\"10.7.0\", \"highlightBlock will be removed entirely in v12.0\");\n deprecated(\"10.7.0\", \"Please use highlightElement now.\");\n\n return highlightElement(el);\n }\n\n /* Interface definition */\n Object.assign(hljs, {\n highlight,\n highlightAuto,\n highlightAll,\n fixMarkup: deprecateFixMarkup,\n highlightElement,\n // TODO: Remove with v12 API\n highlightBlock: deprecateHighlightBlock,\n configure,\n initHighlighting,\n initHighlightingOnLoad,\n registerLanguage,\n unregisterLanguage,\n listLanguages,\n getLanguage,\n registerAliases,\n requireLanguage,\n autoDetection,\n inherit: inherit$1,\n addPlugin,\n // plugins for frameworks\n vuePlugin: BuildVuePlugin(hljs).VuePlugin\n });\n\n hljs.debugMode = function() { SAFE_MODE = false; };\n hljs.safeMode = function() { SAFE_MODE = true; };\n hljs.versionString = version;\n\n for (const key in MODES) {\n // @ts-ignore\n if (typeof MODES[key] === \"object\") {\n // @ts-ignore\n deepFreezeEs6(MODES[key]);\n }\n }\n\n // merge all the modes/regexs into our main object\n Object.assign(hljs, MODES);\n\n // built-in plugins, likely to be moved out of core in the future\n hljs.addPlugin(brPlugin); // slated to be removed in v11\n hljs.addPlugin(mergeHTMLPlugin);\n hljs.addPlugin(tabReplacePlugin);\n return hljs;\n};\n\n// export an \"instance\" of the highlighter\nvar highlight = HLJS({});\n\nmodule.exports = highlight;\n","/**\n * Slugger generates header id\n */\nmodule.exports = class Slugger {\n constructor() {\n this.seen = {};\n }\n\n /**\n * Convert string to unique id\n */\n slug(value) {\n let slug = value\n .toLowerCase()\n .trim()\n // remove html tags\n .replace(/<[!\\/a-z].*?>/ig, '')\n // remove unwanted chars\n .replace(/[\\u2000-\\u206F\\u2E00-\\u2E7F\\\\'!\"#$%&()*+,./:;<=>?@[\\]^`{|}~]/g, '')\n .replace(/\\s/g, '-');\n\n if (this.seen.hasOwnProperty(slug)) {\n const originalSlug = slug;\n do {\n this.seen[originalSlug]++;\n slug = originalSlug + '-' + this.seen[originalSlug];\n } while (this.seen.hasOwnProperty(slug));\n }\n this.seen[slug] = 0;\n\n return slug;\n };\n};\n","// ::- Persistent data structure representing an ordered mapping from\n// strings to values, with some convenient update methods.\nfunction OrderedMap(content) {\n this.content = content;\n}\n\nOrderedMap.prototype = {\n constructor: OrderedMap,\n\n find: function(key) {\n for (var i = 0; i < this.content.length; i += 2)\n if (this.content[i] === key) return i\n return -1\n },\n\n // :: (string) → ?any\n // Retrieve the value stored under `key`, or return undefined when\n // no such key exists.\n get: function(key) {\n var found = this.find(key);\n return found == -1 ? undefined : this.content[found + 1]\n },\n\n // :: (string, any, ?string) → OrderedMap\n // Create a new map by replacing the value of `key` with a new\n // value, or adding a binding to the end of the map. If `newKey` is\n // given, the key of the binding will be replaced with that key.\n update: function(key, value, newKey) {\n var self = newKey && newKey != key ? this.remove(newKey) : this;\n var found = self.find(key), content = self.content.slice();\n if (found == -1) {\n content.push(newKey || key, value);\n } else {\n content[found + 1] = value;\n if (newKey) content[found] = newKey;\n }\n return new OrderedMap(content)\n },\n\n // :: (string) → OrderedMap\n // Return a map with the given key removed, if it existed.\n remove: function(key) {\n var found = this.find(key);\n if (found == -1) return this\n var content = this.content.slice();\n content.splice(found, 2);\n return new OrderedMap(content)\n },\n\n // :: (string, any) → OrderedMap\n // Add a new key to the start of the map.\n addToStart: function(key, value) {\n return new OrderedMap([key, value].concat(this.remove(key).content))\n },\n\n // :: (string, any) → OrderedMap\n // Add a new key to the end of the map.\n addToEnd: function(key, value) {\n var content = this.remove(key).content.slice();\n content.push(key, value);\n return new OrderedMap(content)\n },\n\n // :: (string, string, any) → OrderedMap\n // Add a key after the given key. If `place` is not found, the new\n // key is added to the end.\n addBefore: function(place, key, value) {\n var without = this.remove(key), content = without.content.slice();\n var found = without.find(place);\n content.splice(found == -1 ? content.length : found, 0, key, value);\n return new OrderedMap(content)\n },\n\n // :: ((key: string, value: any))\n // Call the given function for each key/value pair in the map, in\n // order.\n forEach: function(f) {\n for (var i = 0; i < this.content.length; i += 2)\n f(this.content[i], this.content[i + 1]);\n },\n\n // :: (union<Object, OrderedMap>) → OrderedMap\n // Create a new map by prepending the keys in this map that don't\n // appear in `map` before the keys in `map`.\n prepend: function(map) {\n map = OrderedMap.from(map);\n if (!map.size) return this\n return new OrderedMap(map.content.concat(this.subtract(map).content))\n },\n\n // :: (union<Object, OrderedMap>) → OrderedMap\n // Create a new map by appending the keys in this map that don't\n // appear in `map` after the keys in `map`.\n append: function(map) {\n map = OrderedMap.from(map);\n if (!map.size) return this\n return new OrderedMap(this.subtract(map).content.concat(map.content))\n },\n\n // :: (union<Object, OrderedMap>) → OrderedMap\n // Create a map containing all the keys in this map that don't\n // appear in `map`.\n subtract: function(map) {\n var result = this;\n map = OrderedMap.from(map);\n for (var i = 0; i < map.content.length; i += 2)\n result = result.remove(map.content[i]);\n return result\n },\n\n // :: number\n // The amount of keys in this map.\n get size() {\n return this.content.length >> 1\n }\n};\n\n// :: (?union<Object, OrderedMap>) → OrderedMap\n// Return a map with the given content. If null, create an empty\n// map. If given an ordered map, return that map itself. If given an\n// object, create a map from the object's properties.\nOrderedMap.from = function(value) {\n if (value instanceof OrderedMap) return value\n var content = [];\n if (value) for (var prop in value) content.push(prop, value[prop]);\n return new OrderedMap(content)\n};\n\nexport default OrderedMap;\n","import OrderedMap from 'orderedmap';\n\nfunction findDiffStart(a, b, pos) {\n for (var i = 0;; i++) {\n if (i == a.childCount || i == b.childCount)\n { return a.childCount == b.childCount ? null : pos }\n\n var childA = a.child(i), childB = b.child(i);\n if (childA == childB) { pos += childA.nodeSize; continue }\n\n if (!childA.sameMarkup(childB)) { return pos }\n\n if (childA.isText && childA.text != childB.text) {\n for (var j = 0; childA.text[j] == childB.text[j]; j++)\n { pos++; }\n return pos\n }\n if (childA.content.size || childB.content.size) {\n var inner = findDiffStart(childA.content, childB.content, pos + 1);\n if (inner != null) { return inner }\n }\n pos += childA.nodeSize;\n }\n}\n\nfunction findDiffEnd(a, b, posA, posB) {\n for (var iA = a.childCount, iB = b.childCount;;) {\n if (iA == 0 || iB == 0)\n { return iA == iB ? null : {a: posA, b: posB} }\n\n var childA = a.child(--iA), childB = b.child(--iB), size = childA.nodeSize;\n if (childA == childB) {\n posA -= size; posB -= size;\n continue\n }\n\n if (!childA.sameMarkup(childB)) { return {a: posA, b: posB} }\n\n if (childA.isText && childA.text != childB.text) {\n var same = 0, minSize = Math.min(childA.text.length, childB.text.length);\n while (same < minSize && childA.text[childA.text.length - same - 1] == childB.text[childB.text.length - same - 1]) {\n same++; posA--; posB--;\n }\n return {a: posA, b: posB}\n }\n if (childA.content.size || childB.content.size) {\n var inner = findDiffEnd(childA.content, childB.content, posA - 1, posB - 1);\n if (inner) { return inner }\n }\n posA -= size; posB -= size;\n }\n}\n\n// ::- A fragment represents a node's collection of child nodes.\n//\n// Like nodes, fragments are persistent data structures, and you\n// should not mutate them or their content. Rather, you create new\n// instances whenever needed. The API tries to make this easy.\nvar Fragment = function Fragment(content, size) {\n this.content = content;\n // :: number\n // The size of the fragment, which is the total of the size of its\n // content nodes.\n this.size = size || 0;\n if (size == null) { for (var i = 0; i < content.length; i++)\n { this.size += content[i].nodeSize; } }\n};\n\nvar prototypeAccessors = { firstChild: { configurable: true },lastChild: { configurable: true },childCount: { configurable: true } };\n\n// :: (number, number, (node: Node, start: number, parent: Node, index: number) → ?bool, ?number)\n// Invoke a callback for all descendant nodes between the given two\n// positions (relative to start of this fragment). Doesn't descend\n// into a node when the callback returns `false`.\nFragment.prototype.nodesBetween = function nodesBetween (from, to, f, nodeStart, parent) {\n if ( nodeStart === void 0 ) nodeStart = 0;\n\n for (var i = 0, pos = 0; pos < to; i++) {\n var child = this.content[i], end = pos + child.nodeSize;\n if (end > from && f(child, nodeStart + pos, parent, i) !== false && child.content.size) {\n var start = pos + 1;\n child.nodesBetween(Math.max(0, from - start),\n Math.min(child.content.size, to - start),\n f, nodeStart + start);\n }\n pos = end;\n }\n};\n\n// :: ((node: Node, pos: number, parent: Node) → ?bool)\n// Call the given callback for every descendant node. The callback\n// may return `false` to prevent traversal of a given node's children.\nFragment.prototype.descendants = function descendants (f) {\n this.nodesBetween(0, this.size, f);\n};\n\n// : (number, number, ?string, ?string) → string\nFragment.prototype.textBetween = function textBetween (from, to, blockSeparator, leafText) {\n var text = \"\", separated = true;\n this.nodesBetween(from, to, function (node, pos) {\n if (node.isText) {\n text += node.text.slice(Math.max(from, pos) - pos, to - pos);\n separated = !blockSeparator;\n } else if (node.isLeaf && leafText) {\n text += leafText;\n separated = !blockSeparator;\n } else if (!separated && node.isBlock) {\n text += blockSeparator;\n separated = true;\n }\n }, 0);\n return text\n};\n\n// :: (Fragment) → Fragment\n// Create a new fragment containing the combined content of this\n// fragment and the other.\nFragment.prototype.append = function append (other) {\n if (!other.size) { return this }\n if (!this.size) { return other }\n var last = this.lastChild, first = other.firstChild, content = this.content.slice(), i = 0;\n if (last.isText && last.sameMarkup(first)) {\n content[content.length - 1] = last.withText(last.text + first.text);\n i = 1;\n }\n for (; i < other.content.length; i++) { content.push(other.content[i]); }\n return new Fragment(content, this.size + other.size)\n};\n\n// :: (number, ?number) → Fragment\n// Cut out the sub-fragment between the two given positions.\nFragment.prototype.cut = function cut (from, to) {\n if (to == null) { to = this.size; }\n if (from == 0 && to == this.size) { return this }\n var result = [], size = 0;\n if (to > from) { for (var i = 0, pos = 0; pos < to; i++) {\n var child = this.content[i], end = pos + child.nodeSize;\n if (end > from) {\n if (pos < from || end > to) {\n if (child.isText)\n { child = child.cut(Math.max(0, from - pos), Math.min(child.text.length, to - pos)); }\n else\n { child = child.cut(Math.max(0, from - pos - 1), Math.min(child.content.size, to - pos - 1)); }\n }\n result.push(child);\n size += child.nodeSize;\n }\n pos = end;\n } }\n return new Fragment(result, size)\n};\n\nFragment.prototype.cutByIndex = function cutByIndex (from, to) {\n if (from == to) { return Fragment.empty }\n if (from == 0 && to == this.content.length) { return this }\n return new Fragment(this.content.slice(from, to))\n};\n\n// :: (number, Node) → Fragment\n// Create a new fragment in which the node at the given index is\n// replaced by the given node.\nFragment.prototype.replaceChild = function replaceChild (index, node) {\n var current = this.content[index];\n if (current == node) { return this }\n var copy = this.content.slice();\n var size = this.size + node.nodeSize - current.nodeSize;\n copy[index] = node;\n return new Fragment(copy, size)\n};\n\n// : (Node) → Fragment\n// Create a new fragment by prepending the given node to this\n// fragment.\nFragment.prototype.addToStart = function addToStart (node) {\n return new Fragment([node].concat(this.content), this.size + node.nodeSize)\n};\n\n// : (Node) → Fragment\n// Create a new fragment by appending the given node to this\n// fragment.\nFragment.prototype.addToEnd = function addToEnd (node) {\n return new Fragment(this.content.concat(node), this.size + node.nodeSize)\n};\n\n// :: (Fragment) → bool\n// Compare this fragment to another one.\nFragment.prototype.eq = function eq (other) {\n if (this.content.length != other.content.length) { return false }\n for (var i = 0; i < this.content.length; i++)\n { if (!this.content[i].eq(other.content[i])) { return false } }\n return true\n};\n\n// :: ?Node\n// The first child of the fragment, or `null` if it is empty.\nprototypeAccessors.firstChild.get = function () { return this.content.length ? this.content[0] : null };\n\n// :: ?Node\n// The last child of the fragment, or `null` if it is empty.\nprototypeAccessors.lastChild.get = function () { return this.content.length ? this.content[this.content.length - 1] : null };\n\n// :: number\n// The number of child nodes in this fragment.\nprototypeAccessors.childCount.get = function () { return this.content.length };\n\n// :: (number) → Node\n// Get the child node at the given index. Raise an error when the\n// index is out of range.\nFragment.prototype.child = function child (index) {\n var found = this.content[index];\n if (!found) { throw new RangeError(\"Index \" + index + \" out of range for \" + this) }\n return found\n};\n\n// :: (number) → ?Node\n// Get the child node at the given index, if it exists.\nFragment.prototype.maybeChild = function maybeChild (index) {\n return this.content[index]\n};\n\n// :: ((node: Node, offset: number, index: number))\n// Call `f` for every child node, passing the node, its offset\n// into this parent node, and its index.\nFragment.prototype.forEach = function forEach (f) {\n for (var i = 0, p = 0; i < this.content.length; i++) {\n var child = this.content[i];\n f(child, p, i);\n p += child.nodeSize;\n }\n};\n\n// :: (Fragment) → ?number\n// Find the first position at which this fragment and another\n// fragment differ, or `null` if they are the same.\nFragment.prototype.findDiffStart = function findDiffStart$1 (other, pos) {\n if ( pos === void 0 ) pos = 0;\n\n return findDiffStart(this, other, pos)\n};\n\n// :: (Fragment) → ?{a: number, b: number}\n// Find the first position, searching from the end, at which this\n// fragment and the given fragment differ, or `null` if they are the\n// same. Since this position will not be the same in both nodes, an\n// object with two separate positions is returned.\nFragment.prototype.findDiffEnd = function findDiffEnd$1 (other, pos, otherPos) {\n if ( pos === void 0 ) pos = this.size;\n if ( otherPos === void 0 ) otherPos = other.size;\n\n return findDiffEnd(this, other, pos, otherPos)\n};\n\n// : (number, ?number) → {index: number, offset: number}\n// Find the index and inner offset corresponding to a given relative\n// position in this fragment. The result object will be reused\n// (overwritten) the next time the function is called. (Not public.)\nFragment.prototype.findIndex = function findIndex (pos, round) {\n if ( round === void 0 ) round = -1;\n\n if (pos == 0) { return retIndex(0, pos) }\n if (pos == this.size) { return retIndex(this.content.length, pos) }\n if (pos > this.size || pos < 0) { throw new RangeError((\"Position \" + pos + \" outside of fragment (\" + (this) + \")\")) }\n for (var i = 0, curPos = 0;; i++) {\n var cur = this.child(i), end = curPos + cur.nodeSize;\n if (end >= pos) {\n if (end == pos || round > 0) { return retIndex(i + 1, end) }\n return retIndex(i, curPos)\n }\n curPos = end;\n }\n};\n\n// :: () → string\n// Return a debugging string that describes this fragment.\nFragment.prototype.toString = function toString () { return \"<\" + this.toStringInner() + \">\" };\n\nFragment.prototype.toStringInner = function toStringInner () { return this.content.join(\", \") };\n\n// :: () → ?Object\n// Create a JSON-serializeable representation of this fragment.\nFragment.prototype.toJSON = function toJSON () {\n return this.content.length ? this.content.map(function (n) { return n.toJSON(); }) : null\n};\n\n// :: (Schema, ?Object) → Fragment\n// Deserialize a fragment from its JSON representation.\nFragment.fromJSON = function fromJSON (schema, value) {\n if (!value) { return Fragment.empty }\n if (!Array.isArray(value)) { throw new RangeError(\"Invalid input for Fragment.fromJSON\") }\n return new Fragment(value.map(schema.nodeFromJSON))\n};\n\n// :: ([Node]) → Fragment\n// Build a fragment from an array of nodes. Ensures that adjacent\n// text nodes with the same marks are joined together.\nFragment.fromArray = function fromArray (array) {\n if (!array.length) { return Fragment.empty }\n var joined, size = 0;\n for (var i = 0; i < array.length; i++) {\n var node = array[i];\n size += node.nodeSize;\n if (i && node.isText && array[i - 1].sameMarkup(node)) {\n if (!joined) { joined = array.slice(0, i); }\n joined[joined.length - 1] = node.withText(joined[joined.length - 1].text + node.text);\n } else if (joined) {\n joined.push(node);\n }\n }\n return new Fragment(joined || array, size)\n};\n\n// :: (?union<Fragment, Node, [Node]>) → Fragment\n// Create a fragment from something that can be interpreted as a set\n// of nodes. For `null`, it returns the empty fragment. For a\n// fragment, the fragment itself. For a node or array of nodes, a\n// fragment containing those nodes.\nFragment.from = function from (nodes) {\n if (!nodes) { return Fragment.empty }\n if (nodes instanceof Fragment) { return nodes }\n if (Array.isArray(nodes)) { return this.fromArray(nodes) }\n if (nodes.attrs) { return new Fragment([nodes], nodes.nodeSize) }\n throw new RangeError(\"Can not convert \" + nodes + \" to a Fragment\" +\n (nodes.nodesBetween ? \" (looks like multiple versions of prosemirror-model were loaded)\" : \"\"))\n};\n\nObject.defineProperties( Fragment.prototype, prototypeAccessors );\n\nvar found = {index: 0, offset: 0};\nfunction retIndex(index, offset) {\n found.index = index;\n found.offset = offset;\n return found\n}\n\n// :: Fragment\n// An empty fragment. Intended to be reused whenever a node doesn't\n// contain anything (rather than allocating a new empty fragment for\n// each leaf node).\nFragment.empty = new Fragment([], 0);\n\nfunction compareDeep(a, b) {\n if (a === b) { return true }\n if (!(a && typeof a == \"object\") ||\n !(b && typeof b == \"object\")) { return false }\n var array = Array.isArray(a);\n if (Array.isArray(b) != array) { return false }\n if (array) {\n if (a.length != b.length) { return false }\n for (var i = 0; i < a.length; i++) { if (!compareDeep(a[i], b[i])) { return false } }\n } else {\n for (var p in a) { if (!(p in b) || !compareDeep(a[p], b[p])) { return false } }\n for (var p$1 in b) { if (!(p$1 in a)) { return false } }\n }\n return true\n}\n\n// ::- A mark is a piece of information that can be attached to a node,\n// such as it being emphasized, in code font, or a link. It has a type\n// and optionally a set of attributes that provide further information\n// (such as the target of the link). Marks are created through a\n// `Schema`, which controls which types exist and which\n// attributes they have.\nvar Mark = function Mark(type, attrs) {\n // :: MarkType\n // The type of this mark.\n this.type = type;\n // :: Object\n // The attributes associated with this mark.\n this.attrs = attrs;\n};\n\n// :: ([Mark]) → [Mark]\n// Given a set of marks, create a new set which contains this one as\n// well, in the right position. If this mark is already in the set,\n// the set itself is returned. If any marks that are set to be\n// [exclusive](#model.MarkSpec.excludes) with this mark are present,\n// those are replaced by this one.\nMark.prototype.addToSet = function addToSet (set) {\n var copy, placed = false;\n for (var i = 0; i < set.length; i++) {\n var other = set[i];\n if (this.eq(other)) { return set }\n if (this.type.excludes(other.type)) {\n if (!copy) { copy = set.slice(0, i); }\n } else if (other.type.excludes(this.type)) {\n return set\n } else {\n if (!placed && other.type.rank > this.type.rank) {\n if (!copy) { copy = set.slice(0, i); }\n copy.push(this);\n placed = true;\n }\n if (copy) { copy.push(other); }\n }\n }\n if (!copy) { copy = set.slice(); }\n if (!placed) { copy.push(this); }\n return copy\n};\n\n// :: ([Mark]) → [Mark]\n// Remove this mark from the given set, returning a new set. If this\n// mark is not in the set, the set itself is returned.\nMark.prototype.removeFromSet = function removeFromSet (set) {\n for (var i = 0; i < set.length; i++)\n { if (this.eq(set[i]))\n { return set.slice(0, i).concat(set.slice(i + 1)) } }\n return set\n};\n\n// :: ([Mark]) → bool\n// Test whether this mark is in the given set of marks.\nMark.prototype.isInSet = function isInSet (set) {\n for (var i = 0; i < set.length; i++)\n { if (this.eq(set[i])) { return true } }\n return false\n};\n\n// :: (Mark) → bool\n// Test whether this mark has the same type and attributes as\n// another mark.\nMark.prototype.eq = function eq (other) {\n return this == other ||\n (this.type == other.type && compareDeep(this.attrs, other.attrs))\n};\n\n// :: () → Object\n// Convert this mark to a JSON-serializeable representation.\nMark.prototype.toJSON = function toJSON () {\n var obj = {type: this.type.name};\n for (var _ in this.attrs) {\n obj.attrs = this.attrs;\n break\n }\n return obj\n};\n\n// :: (Schema, Object) → Mark\nMark.fromJSON = function fromJSON (schema, json) {\n if (!json) { throw new RangeError(\"Invalid input for Mark.fromJSON\") }\n var type = schema.marks[json.type];\n if (!type) { throw new RangeError((\"There is no mark type \" + (json.type) + \" in this schema\")) }\n return type.create(json.attrs)\n};\n\n// :: ([Mark], [Mark]) → bool\n// Test whether two sets of marks are identical.\nMark.sameSet = function sameSet (a, b) {\n if (a == b) { return true }\n if (a.length != b.length) { return false }\n for (var i = 0; i < a.length; i++)\n { if (!a[i].eq(b[i])) { return false } }\n return true\n};\n\n// :: (?union<Mark, [Mark]>) → [Mark]\n// Create a properly sorted mark set from null, a single mark, or an\n// unsorted array of marks.\nMark.setFrom = function setFrom (marks) {\n if (!marks || marks.length == 0) { return Mark.none }\n if (marks instanceof Mark) { return [marks] }\n var copy = marks.slice();\n copy.sort(function (a, b) { return a.type.rank - b.type.rank; });\n return copy\n};\n\n// :: [Mark] The empty set of marks.\nMark.none = [];\n\n// ReplaceError:: class extends Error\n// Error type raised by [`Node.replace`](#model.Node.replace) when\n// given an invalid replacement.\n\nfunction ReplaceError(message) {\n var err = Error.call(this, message);\n err.__proto__ = ReplaceError.prototype;\n return err\n}\n\nReplaceError.prototype = Object.create(Error.prototype);\nReplaceError.prototype.constructor = ReplaceError;\nReplaceError.prototype.name = \"ReplaceError\";\n\n// ::- A slice represents a piece cut out of a larger document. It\n// stores not only a fragment, but also the depth up to which nodes on\n// both side are ‘open’ (cut through).\nvar Slice = function Slice(content, openStart, openEnd) {\n // :: Fragment The slice's content.\n this.content = content;\n // :: number The open depth at the start.\n this.openStart = openStart;\n // :: number The open depth at the end.\n this.openEnd = openEnd;\n};\n\nvar prototypeAccessors$1 = { size: { configurable: true } };\n\n// :: number\n// The size this slice would add when inserted into a document.\nprototypeAccessors$1.size.get = function () {\n return this.content.size - this.openStart - this.openEnd\n};\n\nSlice.prototype.insertAt = function insertAt (pos, fragment) {\n var content = insertInto(this.content, pos + this.openStart, fragment, null);\n return content && new Slice(content, this.openStart, this.openEnd)\n};\n\nSlice.prototype.removeBetween = function removeBetween (from, to) {\n return new Slice(removeRange(this.content, from + this.openStart, to + this.openStart), this.openStart, this.openEnd)\n};\n\n// :: (Slice) → bool\n// Tests whether this slice is equal to another slice.\nSlice.prototype.eq = function eq (other) {\n return this.content.eq(other.content) && this.openStart == other.openStart && this.openEnd == other.openEnd\n};\n\nSlice.prototype.toString = function toString () {\n return this.content + \"(\" + this.openStart + \",\" + this.openEnd + \")\"\n};\n\n// :: () → ?Object\n// Convert a slice to a JSON-serializable representation.\nSlice.prototype.toJSON = function toJSON () {\n if (!this.content.size) { return null }\n var json = {content: this.content.toJSON()};\n if (this.openStart > 0) { json.openStart = this.openStart; }\n if (this.openEnd > 0) { json.openEnd = this.openEnd; }\n return json\n};\n\n// :: (Schema, ?Object) → Slice\n// Deserialize a slice from its JSON representation.\nSlice.fromJSON = function fromJSON (schema, json) {\n if (!json) { return Slice.empty }\n var openStart = json.openStart || 0, openEnd = json.openEnd || 0;\n if (typeof openStart != \"number\" || typeof openEnd != \"number\")\n { throw new RangeError(\"Invalid input for Slice.fromJSON\") }\n return new Slice(Fragment.fromJSON(schema, json.content), json.openStart || 0, json.openEnd || 0)\n};\n\n// :: (Fragment, ?bool) → Slice\n// Create a slice from a fragment by taking the maximum possible\n// open value on both side of the fragment.\nSlice.maxOpen = function maxOpen (fragment, openIsolating) {\n if ( openIsolating === void 0 ) openIsolating=true;\n\n var openStart = 0, openEnd = 0;\n for (var n = fragment.firstChild; n && !n.isLeaf && (openIsolating || !n.type.spec.isolating); n = n.firstChild) { openStart++; }\n for (var n$1 = fragment.lastChild; n$1 && !n$1.isLeaf && (openIsolating || !n$1.type.spec.isolating); n$1 = n$1.lastChild) { openEnd++; }\n return new Slice(fragment, openStart, openEnd)\n};\n\nObject.defineProperties( Slice.prototype, prototypeAccessors$1 );\n\nfunction removeRange(content, from, to) {\n var ref = content.findIndex(from);\n var index = ref.index;\n var offset = ref.offset;\n var child = content.maybeChild(index);\n var ref$1 = content.findIndex(to);\n var indexTo = ref$1.index;\n var offsetTo = ref$1.offset;\n if (offset == from || child.isText) {\n if (offsetTo != to && !content.child(indexTo).isText) { throw new RangeError(\"Removing non-flat range\") }\n return content.cut(0, from).append(content.cut(to))\n }\n if (index != indexTo) { throw new RangeError(\"Removing non-flat range\") }\n return content.replaceChild(index, child.copy(removeRange(child.content, from - offset - 1, to - offset - 1)))\n}\n\nfunction insertInto(content, dist, insert, parent) {\n var ref = content.findIndex(dist);\n var index = ref.index;\n var offset = ref.offset;\n var child = content.maybeChild(index);\n if (offset == dist || child.isText) {\n if (parent && !parent.canReplace(index, index, insert)) { return null }\n return content.cut(0, dist).append(insert).append(content.cut(dist))\n }\n var inner = insertInto(child.content, dist - offset - 1, insert);\n return inner && content.replaceChild(index, child.copy(inner))\n}\n\n// :: Slice\n// The empty slice.\nSlice.empty = new Slice(Fragment.empty, 0, 0);\n\nfunction replace($from, $to, slice) {\n if (slice.openStart > $from.depth)\n { throw new ReplaceError(\"Inserted content deeper than insertion position\") }\n if ($from.depth - slice.openStart != $to.depth - slice.openEnd)\n { throw new ReplaceError(\"Inconsistent open depths\") }\n return replaceOuter($from, $to, slice, 0)\n}\n\nfunction replaceOuter($from, $to, slice, depth) {\n var index = $from.index(depth), node = $from.node(depth);\n if (index == $to.index(depth) && depth < $from.depth - slice.openStart) {\n var inner = replaceOuter($from, $to, slice, depth + 1);\n return node.copy(node.content.replaceChild(index, inner))\n } else if (!slice.content.size) {\n return close(node, replaceTwoWay($from, $to, depth))\n } else if (!slice.openStart && !slice.openEnd && $from.depth == depth && $to.depth == depth) { // Simple, flat case\n var parent = $from.parent, content = parent.content;\n return close(parent, content.cut(0, $from.parentOffset).append(slice.content).append(content.cut($to.parentOffset)))\n } else {\n var ref = prepareSliceForReplace(slice, $from);\n var start = ref.start;\n var end = ref.end;\n return close(node, replaceThreeWay($from, start, end, $to, depth))\n }\n}\n\nfunction checkJoin(main, sub) {\n if (!sub.type.compatibleContent(main.type))\n { throw new ReplaceError(\"Cannot join \" + sub.type.name + \" onto \" + main.type.name) }\n}\n\nfunction joinable($before, $after, depth) {\n var node = $before.node(depth);\n checkJoin(node, $after.node(depth));\n return node\n}\n\nfunction addNode(child, target) {\n var last = target.length - 1;\n if (last >= 0 && child.isText && child.sameMarkup(target[last]))\n { target[last] = child.withText(target[last].text + child.text); }\n else\n { target.push(child); }\n}\n\nfunction addRange($start, $end, depth, target) {\n var node = ($end || $start).node(depth);\n var startIndex = 0, endIndex = $end ? $end.index(depth) : node.childCount;\n if ($start) {\n startIndex = $start.index(depth);\n if ($start.depth > depth) {\n startIndex++;\n } else if ($start.textOffset) {\n addNode($start.nodeAfter, target);\n startIndex++;\n }\n }\n for (var i = startIndex; i < endIndex; i++) { addNode(node.child(i), target); }\n if ($end && $end.depth == depth && $end.textOffset)\n { addNode($end.nodeBefore, target); }\n}\n\nfunction close(node, content) {\n if (!node.type.validContent(content))\n { throw new ReplaceError(\"Invalid content for node \" + node.type.name) }\n return node.copy(content)\n}\n\nfunction replaceThreeWay($from, $start, $end, $to, depth) {\n var openStart = $from.depth > depth && joinable($from, $start, depth + 1);\n var openEnd = $to.depth > depth && joinable($end, $to, depth + 1);\n\n var content = [];\n addRange(null, $from, depth, content);\n if (openStart && openEnd && $start.index(depth) == $end.index(depth)) {\n checkJoin(openStart, openEnd);\n addNode(close(openStart, replaceThreeWay($from, $start, $end, $to, depth + 1)), content);\n } else {\n if (openStart)\n { addNode(close(openStart, replaceTwoWay($from, $start, depth + 1)), content); }\n addRange($start, $end, depth, content);\n if (openEnd)\n { addNode(close(openEnd, replaceTwoWay($end, $to, depth + 1)), content); }\n }\n addRange($to, null, depth, content);\n return new Fragment(content)\n}\n\nfunction replaceTwoWay($from, $to, depth) {\n var content = [];\n addRange(null, $from, depth, content);\n if ($from.depth > depth) {\n var type = joinable($from, $to, depth + 1);\n addNode(close(type, replaceTwoWay($from, $to, depth + 1)), content);\n }\n addRange($to, null, depth, content);\n return new Fragment(content)\n}\n\nfunction prepareSliceForReplace(slice, $along) {\n var extra = $along.depth - slice.openStart, parent = $along.node(extra);\n var node = parent.copy(slice.content);\n for (var i = extra - 1; i >= 0; i--)\n { node = $along.node(i).copy(Fragment.from(node)); }\n return {start: node.resolveNoCache(slice.openStart + extra),\n end: node.resolveNoCache(node.content.size - slice.openEnd - extra)}\n}\n\n// ::- You can [_resolve_](#model.Node.resolve) a position to get more\n// information about it. Objects of this class represent such a\n// resolved position, providing various pieces of context information,\n// and some helper methods.\n//\n// Throughout this interface, methods that take an optional `depth`\n// parameter will interpret undefined as `this.depth` and negative\n// numbers as `this.depth + value`.\nvar ResolvedPos = function ResolvedPos(pos, path, parentOffset) {\n // :: number The position that was resolved.\n this.pos = pos;\n this.path = path;\n // :: number\n // The number of levels the parent node is from the root. If this\n // position points directly into the root node, it is 0. If it\n // points into a top-level paragraph, 1, and so on.\n this.depth = path.length / 3 - 1;\n // :: number The offset this position has into its parent node.\n this.parentOffset = parentOffset;\n};\n\nvar prototypeAccessors$2 = { parent: { configurable: true },doc: { configurable: true },textOffset: { configurable: true },nodeAfter: { configurable: true },nodeBefore: { configurable: true } };\n\nResolvedPos.prototype.resolveDepth = function resolveDepth (val) {\n if (val == null) { return this.depth }\n if (val < 0) { return this.depth + val }\n return val\n};\n\n// :: Node\n// The parent node that the position points into. Note that even if\n// a position points into a text node, that node is not considered\n// the parent—text nodes are ‘flat’ in this model, and have no content.\nprototypeAccessors$2.parent.get = function () { return this.node(this.depth) };\n\n// :: Node\n// The root node in which the position was resolved.\nprototypeAccessors$2.doc.get = function () { return this.node(0) };\n\n// :: (?number) → Node\n// The ancestor node at the given level. `p.node(p.depth)` is the\n// same as `p.parent`.\nResolvedPos.prototype.node = function node (depth) { return this.path[this.resolveDepth(depth) * 3] };\n\n// :: (?number) → number\n// The index into the ancestor at the given level. If this points at\n// the 3rd node in the 2nd paragraph on the top level, for example,\n// `p.index(0)` is 1 and `p.index(1)` is 2.\nResolvedPos.prototype.index = function index (depth) { return this.path[this.resolveDepth(depth) * 3 + 1] };\n\n// :: (?number) → number\n// The index pointing after this position into the ancestor at the\n// given level.\nResolvedPos.prototype.indexAfter = function indexAfter (depth) {\n depth = this.resolveDepth(depth);\n return this.index(depth) + (depth == this.depth && !this.textOffset ? 0 : 1)\n};\n\n// :: (?number) → number\n// The (absolute) position at the start of the node at the given\n// level.\nResolvedPos.prototype.start = function start (depth) {\n depth = this.resolveDepth(depth);\n return depth == 0 ? 0 : this.path[depth * 3 - 1] + 1\n};\n\n// :: (?number) → number\n// The (absolute) position at the end of the node at the given\n// level.\nResolvedPos.prototype.end = function end (depth) {\n depth = this.resolveDepth(depth);\n return this.start(depth) + this.node(depth).content.size\n};\n\n// :: (?number) → number\n// The (absolute) position directly before the wrapping node at the\n// given level, or, when `depth` is `this.depth + 1`, the original\n// position.\nResolvedPos.prototype.before = function before (depth) {\n depth = this.resolveDepth(depth);\n if (!depth) { throw new RangeError(\"There is no position before the top-level node\") }\n return depth == this.depth + 1 ? this.pos : this.path[depth * 3 - 1]\n};\n\n// :: (?number) → number\n// The (absolute) position directly after the wrapping node at the\n// given level, or the original position when `depth` is `this.depth + 1`.\nResolvedPos.prototype.after = function after (depth) {\n depth = this.resolveDepth(depth);\n if (!depth) { throw new RangeError(\"There is no position after the top-level node\") }\n return depth == this.depth + 1 ? this.pos : this.path[depth * 3 - 1] + this.path[depth * 3].nodeSize\n};\n\n// :: number\n// When this position points into a text node, this returns the\n// distance between the position and the start of the text node.\n// Will be zero for positions that point between nodes.\nprototypeAccessors$2.textOffset.get = function () { return this.pos - this.path[this.path.length - 1] };\n\n// :: ?Node\n// Get the node directly after the position, if any. If the position\n// points into a text node, only the part of that node after the\n// position is returned.\nprototypeAccessors$2.nodeAfter.get = function () {\n var parent = this.parent, index = this.index(this.depth);\n if (index == parent.childCount) { return null }\n var dOff = this.pos - this.path[this.path.length - 1], child = parent.child(index);\n return dOff ? parent.child(index).cut(dOff) : child\n};\n\n// :: ?Node\n// Get the node directly before the position, if any. If the\n// position points into a text node, only the part of that node\n// before the position is returned.\nprototypeAccessors$2.nodeBefore.get = function () {\n var index = this.index(this.depth);\n var dOff = this.pos - this.path[this.path.length - 1];\n if (dOff) { return this.parent.child(index).cut(0, dOff) }\n return index == 0 ? null : this.parent.child(index - 1)\n};\n\n// :: () → [Mark]\n// Get the marks at this position, factoring in the surrounding\n// marks' [`inclusive`](#model.MarkSpec.inclusive) property. If the\n// position is at the start of a non-empty node, the marks of the\n// node after it (if any) are returned.\nResolvedPos.prototype.marks = function marks () {\n var parent = this.parent, index = this.index();\n\n // In an empty parent, return the empty array\n if (parent.content.size == 0) { return Mark.none }\n\n // When inside a text node, just return the text node's marks\n if (this.textOffset) { return parent.child(index).marks }\n\n var main = parent.maybeChild(index - 1), other = parent.maybeChild(index);\n // If the `after` flag is true of there is no node before, make\n // the node after this position the main reference.\n if (!main) { var tmp = main; main = other; other = tmp; }\n\n // Use all marks in the main node, except those that have\n // `inclusive` set to false and are not present in the other node.\n var marks = main.marks;\n for (var i = 0; i < marks.length; i++)\n { if (marks[i].type.spec.inclusive === false && (!other || !marks[i].isInSet(other.marks)))\n { marks = marks[i--].removeFromSet(marks); } }\n\n return marks\n};\n\n// :: (ResolvedPos) → ?[Mark]\n// Get the marks after the current position, if any, except those\n// that are non-inclusive and not present at position `$end`. This\n// is mostly useful for getting the set of marks to preserve after a\n// deletion. Will return `null` if this position is at the end of\n// its parent node or its parent node isn't a textblock (in which\n// case no marks should be preserved).\nResolvedPos.prototype.marksAcross = function marksAcross ($end) {\n var after = this.parent.maybeChild(this.index());\n if (!after || !after.isInline) { return null }\n\n var marks = after.marks, next = $end.parent.maybeChild($end.index());\n for (var i = 0; i < marks.length; i++)\n { if (marks[i].type.spec.inclusive === false && (!next || !marks[i].isInSet(next.marks)))\n { marks = marks[i--].removeFromSet(marks); } }\n return marks\n};\n\n// :: (number) → number\n// The depth up to which this position and the given (non-resolved)\n// position share the same parent nodes.\nResolvedPos.prototype.sharedDepth = function sharedDepth (pos) {\n for (var depth = this.depth; depth > 0; depth--)\n { if (this.start(depth) <= pos && this.end(depth) >= pos) { return depth } }\n return 0\n};\n\n// :: (?ResolvedPos, ?(Node) → bool) → ?NodeRange\n// Returns a range based on the place where this position and the\n// given position diverge around block content. If both point into\n// the same textblock, for example, a range around that textblock\n// will be returned. If they point into different blocks, the range\n// around those blocks in their shared ancestor is returned. You can\n// pass in an optional predicate that will be called with a parent\n// node to see if a range into that parent is acceptable.\nResolvedPos.prototype.blockRange = function blockRange (other, pred) {\n if ( other === void 0 ) other = this;\n\n if (other.pos < this.pos) { return other.blockRange(this) }\n for (var d = this.depth - (this.parent.inlineContent || this.pos == other.pos ? 1 : 0); d >= 0; d--)\n { if (other.pos <= this.end(d) && (!pred || pred(this.node(d))))\n { return new NodeRange(this, other, d) } }\n};\n\n// :: (ResolvedPos) → bool\n// Query whether the given position shares the same parent node.\nResolvedPos.prototype.sameParent = function sameParent (other) {\n return this.pos - this.parentOffset == other.pos - other.parentOffset\n};\n\n// :: (ResolvedPos) → ResolvedPos\n// Return the greater of this and the given position.\nResolvedPos.prototype.max = function max (other) {\n return other.pos > this.pos ? other : this\n};\n\n// :: (ResolvedPos) → ResolvedPos\n// Return the smaller of this and the given position.\nResolvedPos.prototype.min = function min (other) {\n return other.pos < this.pos ? other : this\n};\n\nResolvedPos.prototype.toString = function toString () {\n var str = \"\";\n for (var i = 1; i <= this.depth; i++)\n { str += (str ? \"/\" : \"\") + this.node(i).type.name + \"_\" + this.index(i - 1); }\n return str + \":\" + this.parentOffset\n};\n\nResolvedPos.resolve = function resolve (doc, pos) {\n if (!(pos >= 0 && pos <= doc.content.size)) { throw new RangeError(\"Position \" + pos + \" out of range\") }\n var path = [];\n var start = 0, parentOffset = pos;\n for (var node = doc;;) {\n var ref = node.content.findIndex(parentOffset);\n var index = ref.index;\n var offset = ref.offset;\n var rem = parentOffset - offset;\n path.push(node, index, start + offset);\n if (!rem) { break }\n node = node.child(index);\n if (node.isText) { break }\n parentOffset = rem - 1;\n start += offset + 1;\n }\n return new ResolvedPos(pos, path, parentOffset)\n};\n\nResolvedPos.resolveCached = function resolveCached (doc, pos) {\n for (var i = 0; i < resolveCache.length; i++) {\n var cached = resolveCache[i];\n if (cached.pos == pos && cached.doc == doc) { return cached }\n }\n var result = resolveCache[resolveCachePos] = ResolvedPos.resolve(doc, pos);\n resolveCachePos = (resolveCachePos + 1) % resolveCacheSize;\n return result\n};\n\nObject.defineProperties( ResolvedPos.prototype, prototypeAccessors$2 );\n\nvar resolveCache = [], resolveCachePos = 0, resolveCacheSize = 12;\n\n// ::- Represents a flat range of content, i.e. one that starts and\n// ends in the same node.\nvar NodeRange = function NodeRange($from, $to, depth) {\n // :: ResolvedPos A resolved position along the start of the\n // content. May have a `depth` greater than this object's `depth`\n // property, since these are the positions that were used to\n // compute the range, not re-resolved positions directly at its\n // boundaries.\n this.$from = $from;\n // :: ResolvedPos A position along the end of the content. See\n // caveat for [`$from`](#model.NodeRange.$from).\n this.$to = $to;\n // :: number The depth of the node that this range points into.\n this.depth = depth;\n};\n\nvar prototypeAccessors$1$1 = { start: { configurable: true },end: { configurable: true },parent: { configurable: true },startIndex: { configurable: true },endIndex: { configurable: true } };\n\n// :: number The position at the start of the range.\nprototypeAccessors$1$1.start.get = function () { return this.$from.before(this.depth + 1) };\n// :: number The position at the end of the range.\nprototypeAccessors$1$1.end.get = function () { return this.$to.after(this.depth + 1) };\n\n// :: Node The parent node that the range points into.\nprototypeAccessors$1$1.parent.get = function () { return this.$from.node(this.depth) };\n// :: number The start index of the range in the parent node.\nprototypeAccessors$1$1.startIndex.get = function () { return this.$from.index(this.depth) };\n// :: number The end index of the range in the parent node.\nprototypeAccessors$1$1.endIndex.get = function () { return this.$to.indexAfter(this.depth) };\n\nObject.defineProperties( NodeRange.prototype, prototypeAccessors$1$1 );\n\nvar emptyAttrs = Object.create(null);\n\n// ::- This class represents a node in the tree that makes up a\n// ProseMirror document. So a document is an instance of `Node`, with\n// children that are also instances of `Node`.\n//\n// Nodes are persistent data structures. Instead of changing them, you\n// create new ones with the content you want. Old ones keep pointing\n// at the old document shape. This is made cheaper by sharing\n// structure between the old and new data as much as possible, which a\n// tree shape like this (without back pointers) makes easy.\n//\n// **Do not** directly mutate the properties of a `Node` object. See\n// [the guide](/docs/guide/#doc) for more information.\nvar Node = function Node(type, attrs, content, marks) {\n // :: NodeType\n // The type of node that this is.\n this.type = type;\n\n // :: Object\n // An object mapping attribute names to values. The kind of\n // attributes allowed and required are\n // [determined](#model.NodeSpec.attrs) by the node type.\n this.attrs = attrs;\n\n // :: Fragment\n // A container holding the node's children.\n this.content = content || Fragment.empty;\n\n // :: [Mark]\n // The marks (things like whether it is emphasized or part of a\n // link) applied to this node.\n this.marks = marks || Mark.none;\n};\n\nvar prototypeAccessors$3 = { nodeSize: { configurable: true },childCount: { configurable: true },textContent: { configurable: true },firstChild: { configurable: true },lastChild: { configurable: true },isBlock: { configurable: true },isTextblock: { configurable: true },inlineContent: { configurable: true },isInline: { configurable: true },isText: { configurable: true },isLeaf: { configurable: true },isAtom: { configurable: true } };\n\n// text:: ?string\n// For text nodes, this contains the node's text content.\n\n// :: number\n// The size of this node, as defined by the integer-based [indexing\n// scheme](/docs/guide/#doc.indexing). For text nodes, this is the\n// amount of characters. For other leaf nodes, it is one. For\n// non-leaf nodes, it is the size of the content plus two (the start\n// and end token).\nprototypeAccessors$3.nodeSize.get = function () { return this.isLeaf ? 1 : 2 + this.content.size };\n\n// :: number\n// The number of children that the node has.\nprototypeAccessors$3.childCount.get = function () { return this.content.childCount };\n\n// :: (number) → Node\n// Get the child node at the given index. Raises an error when the\n// index is out of range.\nNode.prototype.child = function child (index) { return this.content.child(index) };\n\n// :: (number) → ?Node\n// Get the child node at the given index, if it exists.\nNode.prototype.maybeChild = function maybeChild (index) { return this.content.maybeChild(index) };\n\n// :: ((node: Node, offset: number, index: number))\n// Call `f` for every child node, passing the node, its offset\n// into this parent node, and its index.\nNode.prototype.forEach = function forEach (f) { this.content.forEach(f); };\n\n// :: (number, number, (node: Node, pos: number, parent: Node, index: number) → ?bool, ?number)\n// Invoke a callback for all descendant nodes recursively between\n// the given two positions that are relative to start of this node's\n// content. The callback is invoked with the node, its\n// parent-relative position, its parent node, and its child index.\n// When the callback returns false for a given node, that node's\n// children will not be recursed over. The last parameter can be\n// used to specify a starting position to count from.\nNode.prototype.nodesBetween = function nodesBetween (from, to, f, startPos) {\n if ( startPos === void 0 ) startPos = 0;\n\n this.content.nodesBetween(from, to, f, startPos, this);\n};\n\n// :: ((node: Node, pos: number, parent: Node) → ?bool)\n// Call the given callback for every descendant node. Doesn't\n// descend into a node when the callback returns `false`.\nNode.prototype.descendants = function descendants (f) {\n this.nodesBetween(0, this.content.size, f);\n};\n\n// :: string\n// Concatenates all the text nodes found in this fragment and its\n// children.\nprototypeAccessors$3.textContent.get = function () { return this.textBetween(0, this.content.size, \"\") };\n\n// :: (number, number, ?string, ?string) → string\n// Get all text between positions `from` and `to`. When\n// `blockSeparator` is given, it will be inserted whenever a new\n// block node is started. When `leafText` is given, it'll be\n// inserted for every non-text leaf node encountered.\nNode.prototype.textBetween = function textBetween (from, to, blockSeparator, leafText) {\n return this.content.textBetween(from, to, blockSeparator, leafText)\n};\n\n// :: ?Node\n// Returns this node's first child, or `null` if there are no\n// children.\nprototypeAccessors$3.firstChild.get = function () { return this.content.firstChild };\n\n// :: ?Node\n// Returns this node's last child, or `null` if there are no\n// children.\nprototypeAccessors$3.lastChild.get = function () { return this.content.lastChild };\n\n// :: (Node) → bool\n// Test whether two nodes represent the same piece of document.\nNode.prototype.eq = function eq (other) {\n return this == other || (this.sameMarkup(other) && this.content.eq(other.content))\n};\n\n// :: (Node) → bool\n// Compare the markup (type, attributes, and marks) of this node to\n// those of another. Returns `true` if both have the same markup.\nNode.prototype.sameMarkup = function sameMarkup (other) {\n return this.hasMarkup(other.type, other.attrs, other.marks)\n};\n\n// :: (NodeType, ?Object, ?[Mark]) → bool\n// Check whether this node's markup correspond to the given type,\n// attributes, and marks.\nNode.prototype.hasMarkup = function hasMarkup (type, attrs, marks) {\n return this.type == type &&\n compareDeep(this.attrs, attrs || type.defaultAttrs || emptyAttrs) &&\n Mark.sameSet(this.marks, marks || Mark.none)\n};\n\n// :: (?Fragment) → Node\n// Create a new node with the same markup as this node, containing\n// the given content (or empty, if no content is given).\nNode.prototype.copy = function copy (content) {\n if ( content === void 0 ) content = null;\n\n if (content == this.content) { return this }\n return new this.constructor(this.type, this.attrs, content, this.marks)\n};\n\n// :: ([Mark]) → Node\n// Create a copy of this node, with the given set of marks instead\n// of the node's own marks.\nNode.prototype.mark = function mark (marks) {\n return marks == this.marks ? this : new this.constructor(this.type, this.attrs, this.content, marks)\n};\n\n// :: (number, ?number) → Node\n// Create a copy of this node with only the content between the\n// given positions. If `to` is not given, it defaults to the end of\n// the node.\nNode.prototype.cut = function cut (from, to) {\n if (from == 0 && to == this.content.size) { return this }\n return this.copy(this.content.cut(from, to))\n};\n\n// :: (number, ?number) → Slice\n// Cut out the part of the document between the given positions, and\n// return it as a `Slice` object.\nNode.prototype.slice = function slice (from, to, includeParents) {\n if ( to === void 0 ) to = this.content.size;\n if ( includeParents === void 0 ) includeParents = false;\n\n if (from == to) { return Slice.empty }\n\n var $from = this.resolve(from), $to = this.resolve(to);\n var depth = includeParents ? 0 : $from.sharedDepth(to);\n var start = $from.start(depth), node = $from.node(depth);\n var content = node.content.cut($from.pos - start, $to.pos - start);\n return new Slice(content, $from.depth - depth, $to.depth - depth)\n};\n\n// :: (number, number, Slice) → Node\n// Replace the part of the document between the given positions with\n// the given slice. The slice must 'fit', meaning its open sides\n// must be able to connect to the surrounding content, and its\n// content nodes must be valid children for the node they are placed\n// into. If any of this is violated, an error of type\n// [`ReplaceError`](#model.ReplaceError) is thrown.\nNode.prototype.replace = function replace$1 (from, to, slice) {\n return replace(this.resolve(from), this.resolve(to), slice)\n};\n\n// :: (number) → ?Node\n// Find the node directly after the given position.\nNode.prototype.nodeAt = function nodeAt (pos) {\n for (var node = this;;) {\n var ref = node.content.findIndex(pos);\n var index = ref.index;\n var offset = ref.offset;\n node = node.maybeChild(index);\n if (!node) { return null }\n if (offset == pos || node.isText) { return node }\n pos -= offset + 1;\n }\n};\n\n// :: (number) → {node: ?Node, index: number, offset: number}\n// Find the (direct) child node after the given offset, if any,\n// and return it along with its index and offset relative to this\n// node.\nNode.prototype.childAfter = function childAfter (pos) {\n var ref = this.content.findIndex(pos);\n var index = ref.index;\n var offset = ref.offset;\n return {node: this.content.maybeChild(index), index: index, offset: offset}\n};\n\n// :: (number) → {node: ?Node, index: number, offset: number}\n// Find the (direct) child node before the given offset, if any,\n// and return it along with its index and offset relative to this\n// node.\nNode.prototype.childBefore = function childBefore (pos) {\n if (pos == 0) { return {node: null, index: 0, offset: 0} }\n var ref = this.content.findIndex(pos);\n var index = ref.index;\n var offset = ref.offset;\n if (offset < pos) { return {node: this.content.child(index), index: index, offset: offset} }\n var node = this.content.child(index - 1);\n return {node: node, index: index - 1, offset: offset - node.nodeSize}\n};\n\n// :: (number) → ResolvedPos\n// Resolve the given position in the document, returning an\n// [object](#model.ResolvedPos) with information about its context.\nNode.prototype.resolve = function resolve (pos) { return ResolvedPos.resolveCached(this, pos) };\n\nNode.prototype.resolveNoCache = function resolveNoCache (pos) { return ResolvedPos.resolve(this, pos) };\n\n// :: (number, number, MarkType) → bool\n// Test whether a mark of the given type occurs in this document\n// between the two given positions.\nNode.prototype.rangeHasMark = function rangeHasMark (from, to, type) {\n var found = false;\n if (to > from) { this.nodesBetween(from, to, function (node) {\n if (type.isInSet(node.marks)) { found = true; }\n return !found\n }); }\n return found\n};\n\n// :: bool\n// True when this is a block (non-inline node)\nprototypeAccessors$3.isBlock.get = function () { return this.type.isBlock };\n\n// :: bool\n// True when this is a textblock node, a block node with inline\n// content.\nprototypeAccessors$3.isTextblock.get = function () { return this.type.isTextblock };\n\n// :: bool\n// True when this node allows inline content.\nprototypeAccessors$3.inlineContent.get = function () { return this.type.inlineContent };\n\n// :: bool\n// True when this is an inline node (a text node or a node that can\n// appear among text).\nprototypeAccessors$3.isInline.get = function () { return this.type.isInline };\n\n// :: bool\n// True when this is a text node.\nprototypeAccessors$3.isText.get = function () { return this.type.isText };\n\n// :: bool\n// True when this is a leaf node.\nprototypeAccessors$3.isLeaf.get = function () { return this.type.isLeaf };\n\n// :: bool\n// True when this is an atom, i.e. when it does not have directly\n// editable content. This is usually the same as `isLeaf`, but can\n// be configured with the [`atom` property](#model.NodeSpec.atom) on\n// a node's spec (typically used when the node is displayed as an\n// uneditable [node view](#view.NodeView)).\nprototypeAccessors$3.isAtom.get = function () { return this.type.isAtom };\n\n// :: () → string\n// Return a string representation of this node for debugging\n// purposes.\nNode.prototype.toString = function toString () {\n if (this.type.spec.toDebugString) { return this.type.spec.toDebugString(this) }\n var name = this.type.name;\n if (this.content.size)\n { name += \"(\" + this.content.toStringInner() + \")\"; }\n return wrapMarks(this.marks, name)\n};\n\n// :: (number) → ContentMatch\n// Get the content match in this node at the given index.\nNode.prototype.contentMatchAt = function contentMatchAt (index) {\n var match = this.type.contentMatch.matchFragment(this.content, 0, index);\n if (!match) { throw new Error(\"Called contentMatchAt on a node with invalid content\") }\n return match\n};\n\n// :: (number, number, ?Fragment, ?number, ?number) → bool\n// Test whether replacing the range between `from` and `to` (by\n// child index) with the given replacement fragment (which defaults\n// to the empty fragment) would leave the node's content valid. You\n// can optionally pass `start` and `end` indices into the\n// replacement fragment.\nNode.prototype.canReplace = function canReplace (from, to, replacement, start, end) {\n if ( replacement === void 0 ) replacement = Fragment.empty;\n if ( start === void 0 ) start = 0;\n if ( end === void 0 ) end = replacement.childCount;\n\n var one = this.contentMatchAt(from).matchFragment(replacement, start, end);\n var two = one && one.matchFragment(this.content, to);\n if (!two || !two.validEnd) { return false }\n for (var i = start; i < end; i++) { if (!this.type.allowsMarks(replacement.child(i).marks)) { return false } }\n return true\n};\n\n// :: (number, number, NodeType, ?[Mark]) → bool\n// Test whether replacing the range `from` to `to` (by index) with a\n// node of the given type would leave the node's content valid.\nNode.prototype.canReplaceWith = function canReplaceWith (from, to, type, marks) {\n if (marks && !this.type.allowsMarks(marks)) { return false }\n var start = this.contentMatchAt(from).matchType(type);\n var end = start && start.matchFragment(this.content, to);\n return end ? end.validEnd : false\n};\n\n// :: (Node) → bool\n// Test whether the given node's content could be appended to this\n// node. If that node is empty, this will only return true if there\n// is at least one node type that can appear in both nodes (to avoid\n// merging completely incompatible nodes).\nNode.prototype.canAppend = function canAppend (other) {\n if (other.content.size) { return this.canReplace(this.childCount, this.childCount, other.content) }\n else { return this.type.compatibleContent(other.type) }\n};\n\n// :: ()\n// Check whether this node and its descendants conform to the\n// schema, and raise error when they do not.\nNode.prototype.check = function check () {\n if (!this.type.validContent(this.content))\n { throw new RangeError((\"Invalid content for node \" + (this.type.name) + \": \" + (this.content.toString().slice(0, 50)))) }\n this.content.forEach(function (node) { return node.check(); });\n};\n\n// :: () → Object\n// Return a JSON-serializeable representation of this node.\nNode.prototype.toJSON = function toJSON () {\n var obj = {type: this.type.name};\n for (var _ in this.attrs) {\n obj.attrs = this.attrs;\n break\n }\n if (this.content.size)\n { obj.content = this.content.toJSON(); }\n if (this.marks.length)\n { obj.marks = this.marks.map(function (n) { return n.toJSON(); }); }\n return obj\n};\n\n// :: (Schema, Object) → Node\n// Deserialize a node from its JSON representation.\nNode.fromJSON = function fromJSON (schema, json) {\n if (!json) { throw new RangeError(\"Invalid input for Node.fromJSON\") }\n var marks = null;\n if (json.marks) {\n if (!Array.isArray(json.marks)) { throw new RangeError(\"Invalid mark data for Node.fromJSON\") }\n marks = json.marks.map(schema.markFromJSON);\n }\n if (json.type == \"text\") {\n if (typeof json.text != \"string\") { throw new RangeError(\"Invalid text node in JSON\") }\n return schema.text(json.text, marks)\n }\n var content = Fragment.fromJSON(schema, json.content);\n return schema.nodeType(json.type).create(json.attrs, content, marks)\n};\n\nObject.defineProperties( Node.prototype, prototypeAccessors$3 );\n\nvar TextNode = /*@__PURE__*/(function (Node) {\n function TextNode(type, attrs, content, marks) {\n Node.call(this, type, attrs, null, marks);\n\n if (!content) { throw new RangeError(\"Empty text nodes are not allowed\") }\n\n this.text = content;\n }\n\n if ( Node ) TextNode.__proto__ = Node;\n TextNode.prototype = Object.create( Node && Node.prototype );\n TextNode.prototype.constructor = TextNode;\n\n var prototypeAccessors$1 = { textContent: { configurable: true },nodeSize: { configurable: true } };\n\n TextNode.prototype.toString = function toString () {\n if (this.type.spec.toDebugString) { return this.type.spec.toDebugString(this) }\n return wrapMarks(this.marks, JSON.stringify(this.text))\n };\n\n prototypeAccessors$1.textContent.get = function () { return this.text };\n\n TextNode.prototype.textBetween = function textBetween (from, to) { return this.text.slice(from, to) };\n\n prototypeAccessors$1.nodeSize.get = function () { return this.text.length };\n\n TextNode.prototype.mark = function mark (marks) {\n return marks == this.marks ? this : new TextNode(this.type, this.attrs, this.text, marks)\n };\n\n TextNode.prototype.withText = function withText (text) {\n if (text == this.text) { return this }\n return new TextNode(this.type, this.attrs, text, this.marks)\n };\n\n TextNode.prototype.cut = function cut (from, to) {\n if ( from === void 0 ) from = 0;\n if ( to === void 0 ) to = this.text.length;\n\n if (from == 0 && to == this.text.length) { return this }\n return this.withText(this.text.slice(from, to))\n };\n\n TextNode.prototype.eq = function eq (other) {\n return this.sameMarkup(other) && this.text == other.text\n };\n\n TextNode.prototype.toJSON = function toJSON () {\n var base = Node.prototype.toJSON.call(this);\n base.text = this.text;\n return base\n };\n\n Object.defineProperties( TextNode.prototype, prototypeAccessors$1 );\n\n return TextNode;\n}(Node));\n\nfunction wrapMarks(marks, str) {\n for (var i = marks.length - 1; i >= 0; i--)\n { str = marks[i].type.name + \"(\" + str + \")\"; }\n return str\n}\n\n// ::- Instances of this class represent a match state of a node\n// type's [content expression](#model.NodeSpec.content), and can be\n// used to find out whether further content matches here, and whether\n// a given position is a valid end of the node.\nvar ContentMatch = function ContentMatch(validEnd) {\n // :: bool\n // True when this match state represents a valid end of the node.\n this.validEnd = validEnd;\n this.next = [];\n this.wrapCache = [];\n};\n\nvar prototypeAccessors$4 = { inlineContent: { configurable: true },defaultType: { configurable: true },edgeCount: { configurable: true } };\n\nContentMatch.parse = function parse (string, nodeTypes) {\n var stream = new TokenStream(string, nodeTypes);\n if (stream.next == null) { return ContentMatch.empty }\n var expr = parseExpr(stream);\n if (stream.next) { stream.err(\"Unexpected trailing text\"); }\n var match = dfa(nfa(expr));\n checkForDeadEnds(match, stream);\n return match\n};\n\n// :: (NodeType) → ?ContentMatch\n// Match a node type, returning a match after that node if\n// successful.\nContentMatch.prototype.matchType = function matchType (type) {\n for (var i = 0; i < this.next.length; i += 2)\n { if (this.next[i] == type) { return this.next[i + 1] } }\n return null\n};\n\n// :: (Fragment, ?number, ?number) → ?ContentMatch\n// Try to match a fragment. Returns the resulting match when\n// successful.\nContentMatch.prototype.matchFragment = function matchFragment (frag, start, end) {\n if ( start === void 0 ) start = 0;\n if ( end === void 0 ) end = frag.childCount;\n\n var cur = this;\n for (var i = start; cur && i < end; i++)\n { cur = cur.matchType(frag.child(i).type); }\n return cur\n};\n\nprototypeAccessors$4.inlineContent.get = function () {\n var first = this.next[0];\n return first ? first.isInline : false\n};\n\n// :: ?NodeType\n// Get the first matching node type at this match position that can\n// be generated.\nprototypeAccessors$4.defaultType.get = function () {\n for (var i = 0; i < this.next.length; i += 2) {\n var type = this.next[i];\n if (!(type.isText || type.hasRequiredAttrs())) { return type }\n }\n};\n\nContentMatch.prototype.compatible = function compatible (other) {\n for (var i = 0; i < this.next.length; i += 2)\n { for (var j = 0; j < other.next.length; j += 2)\n { if (this.next[i] == other.next[j]) { return true } } }\n return false\n};\n\n// :: (Fragment, bool, ?number) → ?Fragment\n// Try to match the given fragment, and if that fails, see if it can\n// be made to match by inserting nodes in front of it. When\n// successful, return a fragment of inserted nodes (which may be\n// empty if nothing had to be inserted). When `toEnd` is true, only\n// return a fragment if the resulting match goes to the end of the\n// content expression.\nContentMatch.prototype.fillBefore = function fillBefore (after, toEnd, startIndex) {\n if ( toEnd === void 0 ) toEnd = false;\n if ( startIndex === void 0 ) startIndex = 0;\n\n var seen = [this];\n function search(match, types) {\n var finished = match.matchFragment(after, startIndex);\n if (finished && (!toEnd || finished.validEnd))\n { return Fragment.from(types.map(function (tp) { return tp.createAndFill(); })) }\n\n for (var i = 0; i < match.next.length; i += 2) {\n var type = match.next[i], next = match.next[i + 1];\n if (!(type.isText || type.hasRequiredAttrs()) && seen.indexOf(next) == -1) {\n seen.push(next);\n var found = search(next, types.concat(type));\n if (found) { return found }\n }\n }\n }\n\n return search(this, [])\n};\n\n// :: (NodeType) → ?[NodeType]\n// Find a set of wrapping node types that would allow a node of the\n// given type to appear at this position. The result may be empty\n// (when it fits directly) and will be null when no such wrapping\n// exists.\nContentMatch.prototype.findWrapping = function findWrapping (target) {\n for (var i = 0; i < this.wrapCache.length; i += 2)\n { if (this.wrapCache[i] == target) { return this.wrapCache[i + 1] } }\n var computed = this.computeWrapping(target);\n this.wrapCache.push(target, computed);\n return computed\n};\n\nContentMatch.prototype.computeWrapping = function computeWrapping (target) {\n var seen = Object.create(null), active = [{match: this, type: null, via: null}];\n while (active.length) {\n var current = active.shift(), match = current.match;\n if (match.matchType(target)) {\n var result = [];\n for (var obj = current; obj.type; obj = obj.via)\n { result.push(obj.type); }\n return result.reverse()\n }\n for (var i = 0; i < match.next.length; i += 2) {\n var type = match.next[i];\n if (!type.isLeaf && !type.hasRequiredAttrs() && !(type.name in seen) && (!current.type || match.next[i + 1].validEnd)) {\n active.push({match: type.contentMatch, type: type, via: current});\n seen[type.name] = true;\n }\n }\n }\n};\n\n// :: number\n// The number of outgoing edges this node has in the finite\n// automaton that describes the content expression.\nprototypeAccessors$4.edgeCount.get = function () {\n return this.next.length >> 1\n};\n\n// :: (number) → {type: NodeType, next: ContentMatch}\n// Get the _n_th outgoing edge from this node in the finite\n// automaton that describes the content expression.\nContentMatch.prototype.edge = function edge (n) {\n var i = n << 1;\n if (i >= this.next.length) { throw new RangeError((\"There's no \" + n + \"th edge in this content match\")) }\n return {type: this.next[i], next: this.next[i + 1]}\n};\n\nContentMatch.prototype.toString = function toString () {\n var seen = [];\n function scan(m) {\n seen.push(m);\n for (var i = 1; i < m.next.length; i += 2)\n { if (seen.indexOf(m.next[i]) == -1) { scan(m.next[i]); } }\n }\n scan(this);\n return seen.map(function (m, i) {\n var out = i + (m.validEnd ? \"*\" : \" \") + \" \";\n for (var i$1 = 0; i$1 < m.next.length; i$1 += 2)\n { out += (i$1 ? \", \" : \"\") + m.next[i$1].name + \"->\" + seen.indexOf(m.next[i$1 + 1]); }\n return out\n }).join(\"\\n\")\n};\n\nObject.defineProperties( ContentMatch.prototype, prototypeAccessors$4 );\n\nContentMatch.empty = new ContentMatch(true);\n\nvar TokenStream = function TokenStream(string, nodeTypes) {\n this.string = string;\n this.nodeTypes = nodeTypes;\n this.inline = null;\n this.pos = 0;\n this.tokens = string.split(/\\s*(?=\\b|\\W|$)/);\n if (this.tokens[this.tokens.length - 1] == \"\") { this.tokens.pop(); }\n if (this.tokens[0] == \"\") { this.tokens.unshift(); }\n};\n\nvar prototypeAccessors$1$2 = { next: { configurable: true } };\n\nprototypeAccessors$1$2.next.get = function () { return this.tokens[this.pos] };\n\nTokenStream.prototype.eat = function eat (tok) { return this.next == tok && (this.pos++ || true) };\n\nTokenStream.prototype.err = function err (str) { throw new SyntaxError(str + \" (in content expression '\" + this.string + \"')\") };\n\nObject.defineProperties( TokenStream.prototype, prototypeAccessors$1$2 );\n\nfunction parseExpr(stream) {\n var exprs = [];\n do { exprs.push(parseExprSeq(stream)); }\n while (stream.eat(\"|\"))\n return exprs.length == 1 ? exprs[0] : {type: \"choice\", exprs: exprs}\n}\n\nfunction parseExprSeq(stream) {\n var exprs = [];\n do { exprs.push(parseExprSubscript(stream)); }\n while (stream.next && stream.next != \")\" && stream.next != \"|\")\n return exprs.length == 1 ? exprs[0] : {type: \"seq\", exprs: exprs}\n}\n\nfunction parseExprSubscript(stream) {\n var expr = parseExprAtom(stream);\n for (;;) {\n if (stream.eat(\"+\"))\n { expr = {type: \"plus\", expr: expr}; }\n else if (stream.eat(\"*\"))\n { expr = {type: \"star\", expr: expr}; }\n else if (stream.eat(\"?\"))\n { expr = {type: \"opt\", expr: expr}; }\n else if (stream.eat(\"{\"))\n { expr = parseExprRange(stream, expr); }\n else { break }\n }\n return expr\n}\n\nfunction parseNum(stream) {\n if (/\\D/.test(stream.next)) { stream.err(\"Expected number, got '\" + stream.next + \"'\"); }\n var result = Number(stream.next);\n stream.pos++;\n return result\n}\n\nfunction parseExprRange(stream, expr) {\n var min = parseNum(stream), max = min;\n if (stream.eat(\",\")) {\n if (stream.next != \"}\") { max = parseNum(stream); }\n else { max = -1; }\n }\n if (!stream.eat(\"}\")) { stream.err(\"Unclosed braced range\"); }\n return {type: \"range\", min: min, max: max, expr: expr}\n}\n\nfunction resolveName(stream, name) {\n var types = stream.nodeTypes, type = types[name];\n if (type) { return [type] }\n var result = [];\n for (var typeName in types) {\n var type$1 = types[typeName];\n if (type$1.groups.indexOf(name) > -1) { result.push(type$1); }\n }\n if (result.length == 0) { stream.err(\"No node type or group '\" + name + \"' found\"); }\n return result\n}\n\nfunction parseExprAtom(stream) {\n if (stream.eat(\"(\")) {\n var expr = parseExpr(stream);\n if (!stream.eat(\")\")) { stream.err(\"Missing closing paren\"); }\n return expr\n } else if (!/\\W/.test(stream.next)) {\n var exprs = resolveName(stream, stream.next).map(function (type) {\n if (stream.inline == null) { stream.inline = type.isInline; }\n else if (stream.inline != type.isInline) { stream.err(\"Mixing inline and block content\"); }\n return {type: \"name\", value: type}\n });\n stream.pos++;\n return exprs.length == 1 ? exprs[0] : {type: \"choice\", exprs: exprs}\n } else {\n stream.err(\"Unexpected token '\" + stream.next + \"'\");\n }\n}\n\n// The code below helps compile a regular-expression-like language\n// into a deterministic finite automaton. For a good introduction to\n// these concepts, see https://swtch.com/~rsc/regexp/regexp1.html\n\n// : (Object) → [[{term: ?any, to: number}]]\n// Construct an NFA from an expression as returned by the parser. The\n// NFA is represented as an array of states, which are themselves\n// arrays of edges, which are `{term, to}` objects. The first state is\n// the entry state and the last node is the success state.\n//\n// Note that unlike typical NFAs, the edge ordering in this one is\n// significant, in that it is used to contruct filler content when\n// necessary.\nfunction nfa(expr) {\n var nfa = [[]];\n connect(compile(expr, 0), node());\n return nfa\n\n function node() { return nfa.push([]) - 1 }\n function edge(from, to, term) {\n var edge = {term: term, to: to};\n nfa[from].push(edge);\n return edge\n }\n function connect(edges, to) { edges.forEach(function (edge) { return edge.to = to; }); }\n\n function compile(expr, from) {\n if (expr.type == \"choice\") {\n return expr.exprs.reduce(function (out, expr) { return out.concat(compile(expr, from)); }, [])\n } else if (expr.type == \"seq\") {\n for (var i = 0;; i++) {\n var next = compile(expr.exprs[i], from);\n if (i == expr.exprs.length - 1) { return next }\n connect(next, from = node());\n }\n } else if (expr.type == \"star\") {\n var loop = node();\n edge(from, loop);\n connect(compile(expr.expr, loop), loop);\n return [edge(loop)]\n } else if (expr.type == \"plus\") {\n var loop$1 = node();\n connect(compile(expr.expr, from), loop$1);\n connect(compile(expr.expr, loop$1), loop$1);\n return [edge(loop$1)]\n } else if (expr.type == \"opt\") {\n return [edge(from)].concat(compile(expr.expr, from))\n } else if (expr.type == \"range\") {\n var cur = from;\n for (var i$1 = 0; i$1 < expr.min; i$1++) {\n var next$1 = node();\n connect(compile(expr.expr, cur), next$1);\n cur = next$1;\n }\n if (expr.max == -1) {\n connect(compile(expr.expr, cur), cur);\n } else {\n for (var i$2 = expr.min; i$2 < expr.max; i$2++) {\n var next$2 = node();\n edge(cur, next$2);\n connect(compile(expr.expr, cur), next$2);\n cur = next$2;\n }\n }\n return [edge(cur)]\n } else if (expr.type == \"name\") {\n return [edge(from, null, expr.value)]\n }\n }\n}\n\nfunction cmp(a, b) { return b - a }\n\n// Get the set of nodes reachable by null edges from `node`. Omit\n// nodes with only a single null-out-edge, since they may lead to\n// needless duplicated nodes.\nfunction nullFrom(nfa, node) {\n var result = [];\n scan(node);\n return result.sort(cmp)\n\n function scan(node) {\n var edges = nfa[node];\n if (edges.length == 1 && !edges[0].term) { return scan(edges[0].to) }\n result.push(node);\n for (var i = 0; i < edges.length; i++) {\n var ref = edges[i];\n var term = ref.term;\n var to = ref.to;\n if (!term && result.indexOf(to) == -1) { scan(to); }\n }\n }\n}\n\n// : ([[{term: ?any, to: number}]]) → ContentMatch\n// Compiles an NFA as produced by `nfa` into a DFA, modeled as a set\n// of state objects (`ContentMatch` instances) with transitions\n// between them.\nfunction dfa(nfa) {\n var labeled = Object.create(null);\n return explore(nullFrom(nfa, 0))\n\n function explore(states) {\n var out = [];\n states.forEach(function (node) {\n nfa[node].forEach(function (ref) {\n var term = ref.term;\n var to = ref.to;\n\n if (!term) { return }\n var known = out.indexOf(term), set = known > -1 && out[known + 1];\n nullFrom(nfa, to).forEach(function (node) {\n if (!set) { out.push(term, set = []); }\n if (set.indexOf(node) == -1) { set.push(node); }\n });\n });\n });\n var state = labeled[states.join(\",\")] = new ContentMatch(states.indexOf(nfa.length - 1) > -1);\n for (var i = 0; i < out.length; i += 2) {\n var states$1 = out[i + 1].sort(cmp);\n state.next.push(out[i], labeled[states$1.join(\",\")] || explore(states$1));\n }\n return state\n }\n}\n\nfunction checkForDeadEnds(match, stream) {\n for (var i = 0, work = [match]; i < work.length; i++) {\n var state = work[i], dead = !state.validEnd, nodes = [];\n for (var j = 0; j < state.next.length; j += 2) {\n var node = state.next[j], next = state.next[j + 1];\n nodes.push(node.name);\n if (dead && !(node.isText || node.hasRequiredAttrs())) { dead = false; }\n if (work.indexOf(next) == -1) { work.push(next); }\n }\n if (dead) { stream.err(\"Only non-generatable nodes (\" + nodes.join(\", \") + \") in a required position\"); }\n }\n}\n\n// For node types where all attrs have a default value (or which don't\n// have any attributes), build up a single reusable default attribute\n// object, and use it for all nodes that don't specify specific\n// attributes.\nfunction defaultAttrs(attrs) {\n var defaults = Object.create(null);\n for (var attrName in attrs) {\n var attr = attrs[attrName];\n if (!attr.hasDefault) { return null }\n defaults[attrName] = attr.default;\n }\n return defaults\n}\n\nfunction computeAttrs(attrs, value) {\n var built = Object.create(null);\n for (var name in attrs) {\n var given = value && value[name];\n if (given === undefined) {\n var attr = attrs[name];\n if (attr.hasDefault) { given = attr.default; }\n else { throw new RangeError(\"No value supplied for attribute \" + name) }\n }\n built[name] = given;\n }\n return built\n}\n\nfunction initAttrs(attrs) {\n var result = Object.create(null);\n if (attrs) { for (var name in attrs) { result[name] = new Attribute(attrs[name]); } }\n return result\n}\n\n// ::- Node types are objects allocated once per `Schema` and used to\n// [tag](#model.Node.type) `Node` instances. They contain information\n// about the node type, such as its name and what kind of node it\n// represents.\nvar NodeType = function NodeType(name, schema, spec) {\n // :: string\n // The name the node type has in this schema.\n this.name = name;\n\n // :: Schema\n // A link back to the `Schema` the node type belongs to.\n this.schema = schema;\n\n // :: NodeSpec\n // The spec that this type is based on\n this.spec = spec;\n\n this.groups = spec.group ? spec.group.split(\" \") : [];\n this.attrs = initAttrs(spec.attrs);\n\n this.defaultAttrs = defaultAttrs(this.attrs);\n\n // :: ContentMatch\n // The starting match of the node type's content expression.\n this.contentMatch = null;\n\n // : ?[MarkType]\n // The set of marks allowed in this node. `null` means all marks\n // are allowed.\n this.markSet = null;\n\n // :: bool\n // True if this node type has inline content.\n this.inlineContent = null;\n\n // :: bool\n // True if this is a block type\n this.isBlock = !(spec.inline || name == \"text\");\n\n // :: bool\n // True if this is the text node type.\n this.isText = name == \"text\";\n};\n\nvar prototypeAccessors$5 = { isInline: { configurable: true },isTextblock: { configurable: true },isLeaf: { configurable: true },isAtom: { configurable: true } };\n\n// :: bool\n// True if this is an inline type.\nprototypeAccessors$5.isInline.get = function () { return !this.isBlock };\n\n// :: bool\n// True if this is a textblock type, a block that contains inline\n// content.\nprototypeAccessors$5.isTextblock.get = function () { return this.isBlock && this.inlineContent };\n\n// :: bool\n// True for node types that allow no content.\nprototypeAccessors$5.isLeaf.get = function () { return this.contentMatch == ContentMatch.empty };\n\n// :: bool\n// True when this node is an atom, i.e. when it does not have\n// directly editable content.\nprototypeAccessors$5.isAtom.get = function () { return this.isLeaf || this.spec.atom };\n\n// :: () → bool\n// Tells you whether this node type has any required attributes.\nNodeType.prototype.hasRequiredAttrs = function hasRequiredAttrs () {\n for (var n in this.attrs) { if (this.attrs[n].isRequired) { return true } }\n return false\n};\n\nNodeType.prototype.compatibleContent = function compatibleContent (other) {\n return this == other || this.contentMatch.compatible(other.contentMatch)\n};\n\nNodeType.prototype.computeAttrs = function computeAttrs$1 (attrs) {\n if (!attrs && this.defaultAttrs) { return this.defaultAttrs }\n else { return computeAttrs(this.attrs, attrs) }\n};\n\n// :: (?Object, ?union<Fragment, Node, [Node]>, ?[Mark]) → Node\n// Create a `Node` of this type. The given attributes are\n// checked and defaulted (you can pass `null` to use the type's\n// defaults entirely, if no required attributes exist). `content`\n// may be a `Fragment`, a node, an array of nodes, or\n// `null`. Similarly `marks` may be `null` to default to the empty\n// set of marks.\nNodeType.prototype.create = function create (attrs, content, marks) {\n if (this.isText) { throw new Error(\"NodeType.create can't construct text nodes\") }\n return new Node(this, this.computeAttrs(attrs), Fragment.from(content), Mark.setFrom(marks))\n};\n\n// :: (?Object, ?union<Fragment, Node, [Node]>, ?[Mark]) → Node\n// Like [`create`](#model.NodeType.create), but check the given content\n// against the node type's content restrictions, and throw an error\n// if it doesn't match.\nNodeType.prototype.createChecked = function createChecked (attrs, content, marks) {\n content = Fragment.from(content);\n if (!this.validContent(content))\n { throw new RangeError(\"Invalid content for node \" + this.name) }\n return new Node(this, this.computeAttrs(attrs), content, Mark.setFrom(marks))\n};\n\n// :: (?Object, ?union<Fragment, Node, [Node]>, ?[Mark]) → ?Node\n// Like [`create`](#model.NodeType.create), but see if it is necessary to\n// add nodes to the start or end of the given fragment to make it\n// fit the node. If no fitting wrapping can be found, return null.\n// Note that, due to the fact that required nodes can always be\n// created, this will always succeed if you pass null or\n// `Fragment.empty` as content.\nNodeType.prototype.createAndFill = function createAndFill (attrs, content, marks) {\n attrs = this.computeAttrs(attrs);\n content = Fragment.from(content);\n if (content.size) {\n var before = this.contentMatch.fillBefore(content);\n if (!before) { return null }\n content = before.append(content);\n }\n var after = this.contentMatch.matchFragment(content).fillBefore(Fragment.empty, true);\n if (!after) { return null }\n return new Node(this, attrs, content.append(after), Mark.setFrom(marks))\n};\n\n// :: (Fragment) → bool\n// Returns true if the given fragment is valid content for this node\n// type with the given attributes.\nNodeType.prototype.validContent = function validContent (content) {\n var result = this.contentMatch.matchFragment(content);\n if (!result || !result.validEnd) { return false }\n for (var i = 0; i < content.childCount; i++)\n { if (!this.allowsMarks(content.child(i).marks)) { return false } }\n return true\n};\n\n// :: (MarkType) → bool\n// Check whether the given mark type is allowed in this node.\nNodeType.prototype.allowsMarkType = function allowsMarkType (markType) {\n return this.markSet == null || this.markSet.indexOf(markType) > -1\n};\n\n// :: ([Mark]) → bool\n// Test whether the given set of marks are allowed in this node.\nNodeType.prototype.allowsMarks = function allowsMarks (marks) {\n if (this.markSet == null) { return true }\n for (var i = 0; i < marks.length; i++) { if (!this.allowsMarkType(marks[i].type)) { return false } }\n return true\n};\n\n// :: ([Mark]) → [Mark]\n// Removes the marks that are not allowed in this node from the given set.\nNodeType.prototype.allowedMarks = function allowedMarks (marks) {\n if (this.markSet == null) { return marks }\n var copy;\n for (var i = 0; i < marks.length; i++) {\n if (!this.allowsMarkType(marks[i].type)) {\n if (!copy) { copy = marks.slice(0, i); }\n } else if (copy) {\n copy.push(marks[i]);\n }\n }\n return !copy ? marks : copy.length ? copy : Mark.empty\n};\n\nNodeType.compile = function compile (nodes, schema) {\n var result = Object.create(null);\n nodes.forEach(function (name, spec) { return result[name] = new NodeType(name, schema, spec); });\n\n var topType = schema.spec.topNode || \"doc\";\n if (!result[topType]) { throw new RangeError(\"Schema is missing its top node type ('\" + topType + \"')\") }\n if (!result.text) { throw new RangeError(\"Every schema needs a 'text' type\") }\n for (var _ in result.text.attrs) { throw new RangeError(\"The text node type should not have attributes\") }\n\n return result\n};\n\nObject.defineProperties( NodeType.prototype, prototypeAccessors$5 );\n\n// Attribute descriptors\n\nvar Attribute = function Attribute(options) {\n this.hasDefault = Object.prototype.hasOwnProperty.call(options, \"default\");\n this.default = options.default;\n};\n\nvar prototypeAccessors$1$3 = { isRequired: { configurable: true } };\n\nprototypeAccessors$1$3.isRequired.get = function () {\n return !this.hasDefault\n};\n\nObject.defineProperties( Attribute.prototype, prototypeAccessors$1$3 );\n\n// Marks\n\n// ::- Like nodes, marks (which are associated with nodes to signify\n// things like emphasis or being part of a link) are\n// [tagged](#model.Mark.type) with type objects, which are\n// instantiated once per `Schema`.\nvar MarkType = function MarkType(name, rank, schema, spec) {\n // :: string\n // The name of the mark type.\n this.name = name;\n\n // :: Schema\n // The schema that this mark type instance is part of.\n this.schema = schema;\n\n // :: MarkSpec\n // The spec on which the type is based.\n this.spec = spec;\n\n this.attrs = initAttrs(spec.attrs);\n\n this.rank = rank;\n this.excluded = null;\n var defaults = defaultAttrs(this.attrs);\n this.instance = defaults && new Mark(this, defaults);\n};\n\n// :: (?Object) → Mark\n// Create a mark of this type. `attrs` may be `null` or an object\n// containing only some of the mark's attributes. The others, if\n// they have defaults, will be added.\nMarkType.prototype.create = function create (attrs) {\n if (!attrs && this.instance) { return this.instance }\n return new Mark(this, computeAttrs(this.attrs, attrs))\n};\n\nMarkType.compile = function compile (marks, schema) {\n var result = Object.create(null), rank = 0;\n marks.forEach(function (name, spec) { return result[name] = new MarkType(name, rank++, schema, spec); });\n return result\n};\n\n// :: ([Mark]) → [Mark]\n// When there is a mark of this type in the given set, a new set\n// without it is returned. Otherwise, the input set is returned.\nMarkType.prototype.removeFromSet = function removeFromSet (set) {\n for (var i = 0; i < set.length; i++)\n { if (set[i].type == this)\n { return set.slice(0, i).concat(set.slice(i + 1)) } }\n return set\n};\n\n// :: ([Mark]) → ?Mark\n// Tests whether there is a mark of this type in the given set.\nMarkType.prototype.isInSet = function isInSet (set) {\n for (var i = 0; i < set.length; i++)\n { if (set[i].type == this) { return set[i] } }\n};\n\n// :: (MarkType) → bool\n// Queries whether a given mark type is\n// [excluded](#model.MarkSpec.excludes) by this one.\nMarkType.prototype.excludes = function excludes (other) {\n return this.excluded.indexOf(other) > -1\n};\n\n// SchemaSpec:: interface\n// An object describing a schema, as passed to the [`Schema`](#model.Schema)\n// constructor.\n//\n// nodes:: union<Object<NodeSpec>, OrderedMap<NodeSpec>>\n// The node types in this schema. Maps names to\n// [`NodeSpec`](#model.NodeSpec) objects that describe the node type\n// associated with that name. Their order is significant—it\n// determines which [parse rules](#model.NodeSpec.parseDOM) take\n// precedence by default, and which nodes come first in a given\n// [group](#model.NodeSpec.group).\n//\n// marks:: ?union<Object<MarkSpec>, OrderedMap<MarkSpec>>\n// The mark types that exist in this schema. The order in which they\n// are provided determines the order in which [mark\n// sets](#model.Mark.addToSet) are sorted and in which [parse\n// rules](#model.MarkSpec.parseDOM) are tried.\n//\n// topNode:: ?string\n// The name of the default top-level node for the schema. Defaults\n// to `\"doc\"`.\n\n// NodeSpec:: interface\n//\n// content:: ?string\n// The content expression for this node, as described in the [schema\n// guide](/docs/guide/#schema.content_expressions). When not given,\n// the node does not allow any content.\n//\n// marks:: ?string\n// The marks that are allowed inside of this node. May be a\n// space-separated string referring to mark names or groups, `\"_\"`\n// to explicitly allow all marks, or `\"\"` to disallow marks. When\n// not given, nodes with inline content default to allowing all\n// marks, other nodes default to not allowing marks.\n//\n// group:: ?string\n// The group or space-separated groups to which this node belongs,\n// which can be referred to in the content expressions for the\n// schema.\n//\n// inline:: ?bool\n// Should be set to true for inline nodes. (Implied for text nodes.)\n//\n// atom:: ?bool\n// Can be set to true to indicate that, though this isn't a [leaf\n// node](#model.NodeType.isLeaf), it doesn't have directly editable\n// content and should be treated as a single unit in the view.\n//\n// attrs:: ?Object<AttributeSpec>\n// The attributes that nodes of this type get.\n//\n// selectable:: ?bool\n// Controls whether nodes of this type can be selected as a [node\n// selection](#state.NodeSelection). Defaults to true for non-text\n// nodes.\n//\n// draggable:: ?bool\n// Determines whether nodes of this type can be dragged without\n// being selected. Defaults to false.\n//\n// code:: ?bool\n// Can be used to indicate that this node contains code, which\n// causes some commands to behave differently.\n//\n// defining:: ?bool\n// Determines whether this node is considered an important parent\n// node during replace operations (such as paste). Non-defining (the\n// default) nodes get dropped when their entire content is replaced,\n// whereas defining nodes persist and wrap the inserted content.\n// Likewise, in _inserted_ content the defining parents of the\n// content are preserved when possible. Typically,\n// non-default-paragraph textblock types, and possibly list items,\n// are marked as defining.\n//\n// isolating:: ?bool\n// When enabled (default is false), the sides of nodes of this type\n// count as boundaries that regular editing operations, like\n// backspacing or lifting, won't cross. An example of a node that\n// should probably have this enabled is a table cell.\n//\n// toDOM:: ?(node: Node) → DOMOutputSpec\n// Defines the default way a node of this type should be serialized\n// to DOM/HTML (as used by\n// [`DOMSerializer.fromSchema`](#model.DOMSerializer^fromSchema)).\n// Should return a DOM node or an [array\n// structure](#model.DOMOutputSpec) that describes one, with an\n// optional number zero (“hole”) in it to indicate where the node's\n// content should be inserted.\n//\n// For text nodes, the default is to create a text DOM node. Though\n// it is possible to create a serializer where text is rendered\n// differently, this is not supported inside the editor, so you\n// shouldn't override that in your text node spec.\n//\n// parseDOM:: ?[ParseRule]\n// Associates DOM parser information with this node, which can be\n// used by [`DOMParser.fromSchema`](#model.DOMParser^fromSchema) to\n// automatically derive a parser. The `node` field in the rules is\n// implied (the name of this node will be filled in automatically).\n// If you supply your own parser, you do not need to also specify\n// parsing rules in your schema.\n//\n// toDebugString:: ?(node: Node) -> string\n// Defines the default way a node of this type should be serialized\n// to a string representation for debugging (e.g. in error messages).\n\n// MarkSpec:: interface\n//\n// attrs:: ?Object<AttributeSpec>\n// The attributes that marks of this type get.\n//\n// inclusive:: ?bool\n// Whether this mark should be active when the cursor is positioned\n// at its end (or at its start when that is also the start of the\n// parent node). Defaults to true.\n//\n// excludes:: ?string\n// Determines which other marks this mark can coexist with. Should\n// be a space-separated strings naming other marks or groups of marks.\n// When a mark is [added](#model.Mark.addToSet) to a set, all marks\n// that it excludes are removed in the process. If the set contains\n// any mark that excludes the new mark but is not, itself, excluded\n// by the new mark, the mark can not be added an the set. You can\n// use the value `\"_\"` to indicate that the mark excludes all\n// marks in the schema.\n//\n// Defaults to only being exclusive with marks of the same type. You\n// can set it to an empty string (or any string not containing the\n// mark's own name) to allow multiple marks of a given type to\n// coexist (as long as they have different attributes).\n//\n// group:: ?string\n// The group or space-separated groups to which this mark belongs.\n//\n// spanning:: ?bool\n// Determines whether marks of this type can span multiple adjacent\n// nodes when serialized to DOM/HTML. Defaults to true.\n//\n// toDOM:: ?(mark: Mark, inline: bool) → DOMOutputSpec\n// Defines the default way marks of this type should be serialized\n// to DOM/HTML. When the resulting spec contains a hole, that is\n// where the marked content is placed. Otherwise, it is appended to\n// the top node.\n//\n// parseDOM:: ?[ParseRule]\n// Associates DOM parser information with this mark (see the\n// corresponding [node spec field](#model.NodeSpec.parseDOM)). The\n// `mark` field in the rules is implied.\n\n// AttributeSpec:: interface\n//\n// Used to [define](#model.NodeSpec.attrs) attributes on nodes or\n// marks.\n//\n// default:: ?any\n// The default value for this attribute, to use when no explicit\n// value is provided. Attributes that have no default must be\n// provided whenever a node or mark of a type that has them is\n// created.\n\n// ::- A document schema. Holds [node](#model.NodeType) and [mark\n// type](#model.MarkType) objects for the nodes and marks that may\n// occur in conforming documents, and provides functionality for\n// creating and deserializing such documents.\nvar Schema = function Schema(spec) {\n // :: SchemaSpec\n // The [spec](#model.SchemaSpec) on which the schema is based,\n // with the added guarantee that its `nodes` and `marks`\n // properties are\n // [`OrderedMap`](https://github.com/marijnh/orderedmap) instances\n // (not raw objects).\n this.spec = {};\n for (var prop in spec) { this.spec[prop] = spec[prop]; }\n this.spec.nodes = OrderedMap.from(spec.nodes);\n this.spec.marks = OrderedMap.from(spec.marks);\n\n // :: Object<NodeType>\n // An object mapping the schema's node names to node type objects.\n this.nodes = NodeType.compile(this.spec.nodes, this);\n\n // :: Object<MarkType>\n // A map from mark names to mark type objects.\n this.marks = MarkType.compile(this.spec.marks, this);\n\n var contentExprCache = Object.create(null);\n for (var prop$1 in this.nodes) {\n if (prop$1 in this.marks)\n { throw new RangeError(prop$1 + \" can not be both a node and a mark\") }\n var type = this.nodes[prop$1], contentExpr = type.spec.content || \"\", markExpr = type.spec.marks;\n type.contentMatch = contentExprCache[contentExpr] ||\n (contentExprCache[contentExpr] = ContentMatch.parse(contentExpr, this.nodes));\n type.inlineContent = type.contentMatch.inlineContent;\n type.markSet = markExpr == \"_\" ? null :\n markExpr ? gatherMarks(this, markExpr.split(\" \")) :\n markExpr == \"\" || !type.inlineContent ? [] : null;\n }\n for (var prop$2 in this.marks) {\n var type$1 = this.marks[prop$2], excl = type$1.spec.excludes;\n type$1.excluded = excl == null ? [type$1] : excl == \"\" ? [] : gatherMarks(this, excl.split(\" \"));\n }\n\n this.nodeFromJSON = this.nodeFromJSON.bind(this);\n this.markFromJSON = this.markFromJSON.bind(this);\n\n // :: NodeType\n // The type of the [default top node](#model.SchemaSpec.topNode)\n // for this schema.\n this.topNodeType = this.nodes[this.spec.topNode || \"doc\"];\n\n // :: Object\n // An object for storing whatever values modules may want to\n // compute and cache per schema. (If you want to store something\n // in it, try to use property names unlikely to clash.)\n this.cached = Object.create(null);\n this.cached.wrappings = Object.create(null);\n};\n\n// :: (union<string, NodeType>, ?Object, ?union<Fragment, Node, [Node]>, ?[Mark]) → Node\n// Create a node in this schema. The `type` may be a string or a\n// `NodeType` instance. Attributes will be extended\n// with defaults, `content` may be a `Fragment`,\n// `null`, a `Node`, or an array of nodes.\nSchema.prototype.node = function node (type, attrs, content, marks) {\n if (typeof type == \"string\")\n { type = this.nodeType(type); }\n else if (!(type instanceof NodeType))\n { throw new RangeError(\"Invalid node type: \" + type) }\n else if (type.schema != this)\n { throw new RangeError(\"Node type from different schema used (\" + type.name + \")\") }\n\n return type.createChecked(attrs, content, marks)\n};\n\n// :: (string, ?[Mark]) → Node\n// Create a text node in the schema. Empty text nodes are not\n// allowed.\nSchema.prototype.text = function text (text$1, marks) {\n var type = this.nodes.text;\n return new TextNode(type, type.defaultAttrs, text$1, Mark.setFrom(marks))\n};\n\n// :: (union<string, MarkType>, ?Object) → Mark\n// Create a mark with the given type and attributes.\nSchema.prototype.mark = function mark (type, attrs) {\n if (typeof type == \"string\") { type = this.marks[type]; }\n return type.create(attrs)\n};\n\n// :: (Object) → Node\n// Deserialize a node from its JSON representation. This method is\n// bound.\nSchema.prototype.nodeFromJSON = function nodeFromJSON (json) {\n return Node.fromJSON(this, json)\n};\n\n// :: (Object) → Mark\n// Deserialize a mark from its JSON representation. This method is\n// bound.\nSchema.prototype.markFromJSON = function markFromJSON (json) {\n return Mark.fromJSON(this, json)\n};\n\nSchema.prototype.nodeType = function nodeType (name) {\n var found = this.nodes[name];\n if (!found) { throw new RangeError(\"Unknown node type: \" + name) }\n return found\n};\n\nfunction gatherMarks(schema, marks) {\n var found = [];\n for (var i = 0; i < marks.length; i++) {\n var name = marks[i], mark = schema.marks[name], ok = mark;\n if (mark) {\n found.push(mark);\n } else {\n for (var prop in schema.marks) {\n var mark$1 = schema.marks[prop];\n if (name == \"_\" || (mark$1.spec.group && mark$1.spec.group.split(\" \").indexOf(name) > -1))\n { found.push(ok = mark$1); }\n }\n }\n if (!ok) { throw new SyntaxError(\"Unknown mark type: '\" + marks[i] + \"'\") }\n }\n return found\n}\n\n// ParseOptions:: interface\n// These are the options recognized by the\n// [`parse`](#model.DOMParser.parse) and\n// [`parseSlice`](#model.DOMParser.parseSlice) methods.\n//\n// preserveWhitespace:: ?union<bool, \"full\">\n// By default, whitespace is collapsed as per HTML's rules. Pass\n// `true` to preserve whitespace, but normalize newlines to\n// spaces, and `\"full\"` to preserve whitespace entirely.\n//\n// findPositions:: ?[{node: dom.Node, offset: number}]\n// When given, the parser will, beside parsing the content,\n// record the document positions of the given DOM positions. It\n// will do so by writing to the objects, adding a `pos` property\n// that holds the document position. DOM positions that are not\n// in the parsed content will not be written to.\n//\n// from:: ?number\n// The child node index to start parsing from.\n//\n// to:: ?number\n// The child node index to stop parsing at.\n//\n// topNode:: ?Node\n// By default, the content is parsed into the schema's default\n// [top node type](#model.Schema.topNodeType). You can pass this\n// option to use the type and attributes from a different node\n// as the top container.\n//\n// topMatch:: ?ContentMatch\n// Provide the starting content match that content parsed into the\n// top node is matched against.\n//\n// context:: ?ResolvedPos\n// A set of additional nodes to count as\n// [context](#model.ParseRule.context) when parsing, above the\n// given [top node](#model.ParseOptions.topNode).\n\n// ParseRule:: interface\n// A value that describes how to parse a given DOM node or inline\n// style as a ProseMirror node or mark.\n//\n// tag:: ?string\n// A CSS selector describing the kind of DOM elements to match. A\n// single rule should have _either_ a `tag` or a `style` property.\n//\n// namespace:: ?string\n// The namespace to match. This should be used with `tag`.\n// Nodes are only matched when the namespace matches or this property\n// is null.\n//\n// style:: ?string\n// A CSS property name to match. When given, this rule matches\n// inline styles that list that property. May also have the form\n// `\"property=value\"`, in which case the rule only matches if the\n// propery's value exactly matches the given value. (For more\n// complicated filters, use [`getAttrs`](#model.ParseRule.getAttrs)\n// and return false to indicate that the match failed.)\n//\n// priority:: ?number\n// Can be used to change the order in which the parse rules in a\n// schema are tried. Those with higher priority come first. Rules\n// without a priority are counted as having priority 50. This\n// property is only meaningful in a schema—when directly\n// constructing a parser, the order of the rule array is used.\n//\n// context:: ?string\n// When given, restricts this rule to only match when the current\n// context—the parent nodes into which the content is being\n// parsed—matches this expression. Should contain one or more node\n// names or node group names followed by single or double slashes.\n// For example `\"paragraph/\"` means the rule only matches when the\n// parent node is a paragraph, `\"blockquote/paragraph/\"` restricts\n// it to be in a paragraph that is inside a blockquote, and\n// `\"section//\"` matches any position inside a section—a double\n// slash matches any sequence of ancestor nodes. To allow multiple\n// different contexts, they can be separated by a pipe (`|`)\n// character, as in `\"blockquote/|list_item/\"`.\n//\n// node:: ?string\n// The name of the node type to create when this rule matches. Only\n// valid for rules with a `tag` property, not for style rules. Each\n// rule should have one of a `node`, `mark`, or `ignore` property\n// (except when it appears in a [node](#model.NodeSpec.parseDOM) or\n// [mark spec](#model.MarkSpec.parseDOM), in which case the `node`\n// or `mark` property will be derived from its position).\n//\n// mark:: ?string\n// The name of the mark type to wrap the matched content in.\n//\n// ignore:: ?bool\n// When true, ignore content that matches this rule.\n//\n// skip:: ?bool\n// When true, ignore the node that matches this rule, but do parse\n// its content.\n//\n// attrs:: ?Object\n// Attributes for the node or mark created by this rule. When\n// `getAttrs` is provided, it takes precedence.\n//\n// getAttrs:: ?(union<dom.Node, string>) → ?union<Object, false>\n// A function used to compute the attributes for the node or mark\n// created by this rule. Can also be used to describe further\n// conditions the DOM element or style must match. When it returns\n// `false`, the rule won't match. When it returns null or undefined,\n// that is interpreted as an empty/default set of attributes.\n//\n// Called with a DOM Element for `tag` rules, and with a string (the\n// style's value) for `style` rules.\n//\n// contentElement:: ?union<string, (dom.Node) → dom.Node>\n// For `tag` rules that produce non-leaf nodes or marks, by default\n// the content of the DOM element is parsed as content of the mark\n// or node. If the child nodes are in a descendent node, this may be\n// a CSS selector string that the parser must use to find the actual\n// content element, or a function that returns the actual content\n// element to the parser.\n//\n// getContent:: ?(dom.Node, schema: Schema) → Fragment\n// Can be used to override the content of a matched node. When\n// present, instead of parsing the node's child nodes, the result of\n// this function is used.\n//\n// preserveWhitespace:: ?union<bool, \"full\">\n// Controls whether whitespace should be preserved when parsing the\n// content inside the matched element. `false` means whitespace may\n// be collapsed, `true` means that whitespace should be preserved\n// but newlines normalized to spaces, and `\"full\"` means that\n// newlines should also be preserved.\n\n// ::- A DOM parser represents a strategy for parsing DOM content into\n// a ProseMirror document conforming to a given schema. Its behavior\n// is defined by an array of [rules](#model.ParseRule).\nvar DOMParser = function DOMParser(schema, rules) {\n var this$1 = this;\n\n // :: Schema\n // The schema into which the parser parses.\n this.schema = schema;\n // :: [ParseRule]\n // The set of [parse rules](#model.ParseRule) that the parser\n // uses, in order of precedence.\n this.rules = rules;\n this.tags = [];\n this.styles = [];\n\n rules.forEach(function (rule) {\n if (rule.tag) { this$1.tags.push(rule); }\n else if (rule.style) { this$1.styles.push(rule); }\n });\n};\n\n// :: (dom.Node, ?ParseOptions) → Node\n// Parse a document from the content of a DOM node.\nDOMParser.prototype.parse = function parse (dom, options) {\n if ( options === void 0 ) options = {};\n\n var context = new ParseContext(this, options, false);\n context.addAll(dom, null, options.from, options.to);\n return context.finish()\n};\n\n// :: (dom.Node, ?ParseOptions) → Slice\n// Parses the content of the given DOM node, like\n// [`parse`](#model.DOMParser.parse), and takes the same set of\n// options. But unlike that method, which produces a whole node,\n// this one returns a slice that is open at the sides, meaning that\n// the schema constraints aren't applied to the start of nodes to\n// the left of the input and the end of nodes at the end.\nDOMParser.prototype.parseSlice = function parseSlice (dom, options) {\n if ( options === void 0 ) options = {};\n\n var context = new ParseContext(this, options, true);\n context.addAll(dom, null, options.from, options.to);\n return Slice.maxOpen(context.finish())\n};\n\nDOMParser.prototype.matchTag = function matchTag (dom, context) {\n for (var i = 0; i < this.tags.length; i++) {\n var rule = this.tags[i];\n if (matches(dom, rule.tag) &&\n (rule.namespace === undefined || dom.namespaceURI == rule.namespace) &&\n (!rule.context || context.matchesContext(rule.context))) {\n if (rule.getAttrs) {\n var result = rule.getAttrs(dom);\n if (result === false) { continue }\n rule.attrs = result;\n }\n return rule\n }\n }\n};\n\nDOMParser.prototype.matchStyle = function matchStyle (prop, value, context) {\n for (var i = 0; i < this.styles.length; i++) {\n var rule = this.styles[i];\n if (rule.style.indexOf(prop) != 0 ||\n rule.context && !context.matchesContext(rule.context) ||\n // Test that the style string either precisely matches the prop,\n // or has an '=' sign after the prop, followed by the given\n // value.\n rule.style.length > prop.length &&\n (rule.style.charCodeAt(prop.length) != 61 || rule.style.slice(prop.length + 1) != value))\n { continue }\n if (rule.getAttrs) {\n var result = rule.getAttrs(value);\n if (result === false) { continue }\n rule.attrs = result;\n }\n return rule\n }\n};\n\n// : (Schema) → [ParseRule]\nDOMParser.schemaRules = function schemaRules (schema) {\n var result = [];\n function insert(rule) {\n var priority = rule.priority == null ? 50 : rule.priority, i = 0;\n for (; i < result.length; i++) {\n var next = result[i], nextPriority = next.priority == null ? 50 : next.priority;\n if (nextPriority < priority) { break }\n }\n result.splice(i, 0, rule);\n }\n\n var loop = function ( name ) {\n var rules = schema.marks[name].spec.parseDOM;\n if (rules) { rules.forEach(function (rule) {\n insert(rule = copy(rule));\n rule.mark = name;\n }); }\n };\n\n for (var name in schema.marks) loop( name );\n var loop$1 = function ( name ) {\n var rules$1 = schema.nodes[name$1].spec.parseDOM;\n if (rules$1) { rules$1.forEach(function (rule) {\n insert(rule = copy(rule));\n rule.node = name$1;\n }); }\n };\n\n for (var name$1 in schema.nodes) loop$1();\n return result\n};\n\n// :: (Schema) → DOMParser\n// Construct a DOM parser using the parsing rules listed in a\n// schema's [node specs](#model.NodeSpec.parseDOM), reordered by\n// [priority](#model.ParseRule.priority).\nDOMParser.fromSchema = function fromSchema (schema) {\n return schema.cached.domParser ||\n (schema.cached.domParser = new DOMParser(schema, DOMParser.schemaRules(schema)))\n};\n\n// : Object<bool> The block-level tags in HTML5\nvar blockTags = {\n address: true, article: true, aside: true, blockquote: true, canvas: true,\n dd: true, div: true, dl: true, fieldset: true, figcaption: true, figure: true,\n footer: true, form: true, h1: true, h2: true, h3: true, h4: true, h5: true,\n h6: true, header: true, hgroup: true, hr: true, li: true, noscript: true, ol: true,\n output: true, p: true, pre: true, section: true, table: true, tfoot: true, ul: true\n};\n\n// : Object<bool> The tags that we normally ignore.\nvar ignoreTags = {\n head: true, noscript: true, object: true, script: true, style: true, title: true\n};\n\n// : Object<bool> List tags.\nvar listTags = {ol: true, ul: true};\n\n// Using a bitfield for node context options\nvar OPT_PRESERVE_WS = 1, OPT_PRESERVE_WS_FULL = 2, OPT_OPEN_LEFT = 4;\n\nfunction wsOptionsFor(preserveWhitespace) {\n return (preserveWhitespace ? OPT_PRESERVE_WS : 0) | (preserveWhitespace === \"full\" ? OPT_PRESERVE_WS_FULL : 0)\n}\n\nvar NodeContext = function NodeContext(type, attrs, marks, pendingMarks, solid, match, options) {\n this.type = type;\n this.attrs = attrs;\n this.solid = solid;\n this.match = match || (options & OPT_OPEN_LEFT ? null : type.contentMatch);\n this.options = options;\n this.content = [];\n // Marks applied to this node itself\n this.marks = marks;\n // Marks applied to its children\n this.activeMarks = Mark.none;\n // Marks that can't apply here, but will be used in children if possible\n this.pendingMarks = pendingMarks;\n};\n\nNodeContext.prototype.findWrapping = function findWrapping (node) {\n if (!this.match) {\n if (!this.type) { return [] }\n var fill = this.type.contentMatch.fillBefore(Fragment.from(node));\n if (fill) {\n this.match = this.type.contentMatch.matchFragment(fill);\n } else {\n var start = this.type.contentMatch, wrap;\n if (wrap = start.findWrapping(node.type)) {\n this.match = start;\n return wrap\n } else {\n return null\n }\n }\n }\n return this.match.findWrapping(node.type)\n};\n\nNodeContext.prototype.finish = function finish (openEnd) {\n if (!(this.options & OPT_PRESERVE_WS)) { // Strip trailing whitespace\n var last = this.content[this.content.length - 1], m;\n if (last && last.isText && (m = /[ \\t\\r\\n\\u000c]+$/.exec(last.text))) {\n if (last.text.length == m[0].length) { this.content.pop(); }\n else { this.content[this.content.length - 1] = last.withText(last.text.slice(0, last.text.length - m[0].length)); }\n }\n }\n var content = Fragment.from(this.content);\n if (!openEnd && this.match)\n { content = content.append(this.match.fillBefore(Fragment.empty, true)); }\n return this.type ? this.type.create(this.attrs, content, this.marks) : content\n};\n\nNodeContext.prototype.applyPending = function applyPending (nextType) {\n for (var i = 0, pending = this.pendingMarks; i < pending.length; i++) {\n var mark = pending[i];\n if ((this.type ? this.type.allowsMarkType(mark.type) : markMayApply(mark.type, nextType)) &&\n !mark.isInSet(this.activeMarks)) {\n this.activeMarks = mark.addToSet(this.activeMarks);\n this.pendingMarks = mark.removeFromSet(this.pendingMarks);\n }\n }\n};\n\nvar ParseContext = function ParseContext(parser, options, open) {\n // : DOMParser The parser we are using.\n this.parser = parser;\n // : Object The options passed to this parse.\n this.options = options;\n this.isOpen = open;\n var topNode = options.topNode, topContext;\n var topOptions = wsOptionsFor(options.preserveWhitespace) | (open ? OPT_OPEN_LEFT : 0);\n if (topNode)\n { topContext = new NodeContext(topNode.type, topNode.attrs, Mark.none, Mark.none, true,\n options.topMatch || topNode.type.contentMatch, topOptions); }\n else if (open)\n { topContext = new NodeContext(null, null, Mark.none, Mark.none, true, null, topOptions); }\n else\n { topContext = new NodeContext(parser.schema.topNodeType, null, Mark.none, Mark.none, true, null, topOptions); }\n this.nodes = [topContext];\n // : [Mark] The current set of marks\n this.open = 0;\n this.find = options.findPositions;\n this.needsBlock = false;\n};\n\nvar prototypeAccessors$6 = { top: { configurable: true },currentPos: { configurable: true } };\n\nprototypeAccessors$6.top.get = function () {\n return this.nodes[this.open]\n};\n\n// : (dom.Node)\n// Add a DOM node to the content. Text is inserted as text node,\n// otherwise, the node is passed to `addElement` or, if it has a\n// `style` attribute, `addElementWithStyles`.\nParseContext.prototype.addDOM = function addDOM (dom) {\n if (dom.nodeType == 3) {\n this.addTextNode(dom);\n } else if (dom.nodeType == 1) {\n var style = dom.getAttribute(\"style\");\n var marks = style ? this.readStyles(parseStyles(style)) : null, top = this.top;\n if (marks != null) { for (var i = 0; i < marks.length; i++) { this.addPendingMark(marks[i]); } }\n this.addElement(dom);\n if (marks != null) { for (var i$1 = 0; i$1 < marks.length; i$1++) { this.removePendingMark(marks[i$1], top); } }\n }\n};\n\nParseContext.prototype.addTextNode = function addTextNode (dom) {\n var value = dom.nodeValue;\n var top = this.top;\n if ((top.type ? top.type.inlineContent : top.content.length && top.content[0].isInline) || /[^ \\t\\r\\n\\u000c]/.test(value)) {\n if (!(top.options & OPT_PRESERVE_WS)) {\n value = value.replace(/[ \\t\\r\\n\\u000c]+/g, \" \");\n // If this starts with whitespace, and there is no node before it, or\n // a hard break, or a text node that ends with whitespace, strip the\n // leading space.\n if (/^[ \\t\\r\\n\\u000c]/.test(value) && this.open == this.nodes.length - 1) {\n var nodeBefore = top.content[top.content.length - 1];\n var domNodeBefore = dom.previousSibling;\n if (!nodeBefore ||\n (domNodeBefore && domNodeBefore.nodeName == 'BR') ||\n (nodeBefore.isText && /[ \\t\\r\\n\\u000c]$/.test(nodeBefore.text)))\n { value = value.slice(1); }\n }\n } else if (!(top.options & OPT_PRESERVE_WS_FULL)) {\n value = value.replace(/\\r?\\n|\\r/g, \" \");\n }\n if (value) { this.insertNode(this.parser.schema.text(value)); }\n this.findInText(dom);\n } else {\n this.findInside(dom);\n }\n};\n\n// : (dom.Element)\n// Try to find a handler for the given tag and use that to parse. If\n// none is found, the element's content nodes are added directly.\nParseContext.prototype.addElement = function addElement (dom) {\n var name = dom.nodeName.toLowerCase();\n if (listTags.hasOwnProperty(name)) { normalizeList(dom); }\n var rule = (this.options.ruleFromNode && this.options.ruleFromNode(dom)) || this.parser.matchTag(dom, this);\n if (rule ? rule.ignore : ignoreTags.hasOwnProperty(name)) {\n this.findInside(dom);\n } else if (!rule || rule.skip) {\n if (rule && rule.skip.nodeType) { dom = rule.skip; }\n var sync, top = this.top, oldNeedsBlock = this.needsBlock;\n if (blockTags.hasOwnProperty(name)) {\n sync = true;\n if (!top.type) { this.needsBlock = true; }\n } else if (!dom.firstChild) {\n this.leafFallback(dom);\n return\n }\n this.addAll(dom);\n if (sync) { this.sync(top); }\n this.needsBlock = oldNeedsBlock;\n } else {\n this.addElementByRule(dom, rule);\n }\n};\n\n// Called for leaf DOM nodes that would otherwise be ignored\nParseContext.prototype.leafFallback = function leafFallback (dom) {\n if (dom.nodeName == \"BR\" && this.top.type && this.top.type.inlineContent)\n { this.addTextNode(dom.ownerDocument.createTextNode(\"\\n\")); }\n};\n\n// Run any style parser associated with the node's styles. Either\n// return an array of marks, or null to indicate some of the styles\n// had a rule with `ignore` set.\nParseContext.prototype.readStyles = function readStyles (styles) {\n var marks = Mark.none;\n for (var i = 0; i < styles.length; i += 2) {\n var rule = this.parser.matchStyle(styles[i], styles[i + 1], this);\n if (!rule) { continue }\n if (rule.ignore) { return null }\n marks = this.parser.schema.marks[rule.mark].create(rule.attrs).addToSet(marks);\n }\n return marks\n};\n\n// : (dom.Element, ParseRule) → bool\n// Look up a handler for the given node. If none are found, return\n// false. Otherwise, apply it, use its return value to drive the way\n// the node's content is wrapped, and return true.\nParseContext.prototype.addElementByRule = function addElementByRule (dom, rule) {\n var this$1 = this;\n\n var sync, nodeType, markType, mark;\n if (rule.node) {\n nodeType = this.parser.schema.nodes[rule.node];\n if (!nodeType.isLeaf) {\n sync = this.enter(nodeType, rule.attrs, rule.preserveWhitespace);\n } else if (!this.insertNode(nodeType.create(rule.attrs))) {\n this.leafFallback(dom);\n }\n } else {\n markType = this.parser.schema.marks[rule.mark];\n mark = markType.create(rule.attrs);\n this.addPendingMark(mark);\n }\n var startIn = this.top;\n\n if (nodeType && nodeType.isLeaf) {\n this.findInside(dom);\n } else if (rule.getContent) {\n this.findInside(dom);\n rule.getContent(dom, this.parser.schema).forEach(function (node) { return this$1.insertNode(node); });\n } else {\n var contentDOM = rule.contentElement;\n if (typeof contentDOM == \"string\") { contentDOM = dom.querySelector(contentDOM); }\n else if (typeof contentDOM == \"function\") { contentDOM = contentDOM(dom); }\n if (!contentDOM) { contentDOM = dom; }\n this.findAround(dom, contentDOM, true);\n this.addAll(contentDOM, sync);\n }\n if (sync) { this.sync(startIn); this.open--; }\n if (mark) { this.removePendingMark(mark, startIn); }\n};\n\n// : (dom.Node, ?NodeBuilder, ?number, ?number)\n// Add all child nodes between `startIndex` and `endIndex` (or the\n// whole node, if not given). If `sync` is passed, use it to\n// synchronize after every block element.\nParseContext.prototype.addAll = function addAll (parent, sync, startIndex, endIndex) {\n var index = startIndex || 0;\n for (var dom = startIndex ? parent.childNodes[startIndex] : parent.firstChild,\n end = endIndex == null ? null : parent.childNodes[endIndex];\n dom != end; dom = dom.nextSibling, ++index) {\n this.findAtPoint(parent, index);\n this.addDOM(dom);\n if (sync && blockTags.hasOwnProperty(dom.nodeName.toLowerCase()))\n { this.sync(sync); }\n }\n this.findAtPoint(parent, index);\n};\n\n// Try to find a way to fit the given node type into the current\n// context. May add intermediate wrappers and/or leave non-solid\n// nodes that we're in.\nParseContext.prototype.findPlace = function findPlace (node) {\n var route, sync;\n for (var depth = this.open; depth >= 0; depth--) {\n var cx = this.nodes[depth];\n var found = cx.findWrapping(node);\n if (found && (!route || route.length > found.length)) {\n route = found;\n sync = cx;\n if (!found.length) { break }\n }\n if (cx.solid) { break }\n }\n if (!route) { return false }\n this.sync(sync);\n for (var i = 0; i < route.length; i++)\n { this.enterInner(route[i], null, false); }\n return true\n};\n\n// : (Node) → ?Node\n// Try to insert the given node, adjusting the context when needed.\nParseContext.prototype.insertNode = function insertNode (node) {\n if (node.isInline && this.needsBlock && !this.top.type) {\n var block = this.textblockFromContext();\n if (block) { this.enterInner(block); }\n }\n if (this.findPlace(node)) {\n this.closeExtra();\n var top = this.top;\n top.applyPending(node.type);\n if (top.match) { top.match = top.match.matchType(node.type); }\n var marks = top.activeMarks;\n for (var i = 0; i < node.marks.length; i++)\n { if (!top.type || top.type.allowsMarkType(node.marks[i].type))\n { marks = node.marks[i].addToSet(marks); } }\n top.content.push(node.mark(marks));\n return true\n }\n return false\n};\n\n// : (NodeType, ?Object) → bool\n// Try to start a node of the given type, adjusting the context when\n// necessary.\nParseContext.prototype.enter = function enter (type, attrs, preserveWS) {\n var ok = this.findPlace(type.create(attrs));\n if (ok) { this.enterInner(type, attrs, true, preserveWS); }\n return ok\n};\n\n// Open a node of the given type\nParseContext.prototype.enterInner = function enterInner (type, attrs, solid, preserveWS) {\n this.closeExtra();\n var top = this.top;\n top.applyPending(type);\n top.match = top.match && top.match.matchType(type, attrs);\n var options = preserveWS == null ? top.options & ~OPT_OPEN_LEFT : wsOptionsFor(preserveWS);\n if ((top.options & OPT_OPEN_LEFT) && top.content.length == 0) { options |= OPT_OPEN_LEFT; }\n this.nodes.push(new NodeContext(type, attrs, top.activeMarks, top.pendingMarks, solid, null, options));\n this.open++;\n};\n\n// Make sure all nodes above this.open are finished and added to\n// their parents\nParseContext.prototype.closeExtra = function closeExtra (openEnd) {\n var i = this.nodes.length - 1;\n if (i > this.open) {\n for (; i > this.open; i--) { this.nodes[i - 1].content.push(this.nodes[i].finish(openEnd)); }\n this.nodes.length = this.open + 1;\n }\n};\n\nParseContext.prototype.finish = function finish () {\n this.open = 0;\n this.closeExtra(this.isOpen);\n return this.nodes[0].finish(this.isOpen || this.options.topOpen)\n};\n\nParseContext.prototype.sync = function sync (to) {\n for (var i = this.open; i >= 0; i--) { if (this.nodes[i] == to) {\n this.open = i;\n return\n } }\n};\n\nprototypeAccessors$6.currentPos.get = function () {\n this.closeExtra();\n var pos = 0;\n for (var i = this.open; i >= 0; i--) {\n var content = this.nodes[i].content;\n for (var j = content.length - 1; j >= 0; j--)\n { pos += content[j].nodeSize; }\n if (i) { pos++; }\n }\n return pos\n};\n\nParseContext.prototype.findAtPoint = function findAtPoint (parent, offset) {\n if (this.find) { for (var i = 0; i < this.find.length; i++) {\n if (this.find[i].node == parent && this.find[i].offset == offset)\n { this.find[i].pos = this.currentPos; }\n } }\n};\n\nParseContext.prototype.findInside = function findInside (parent) {\n if (this.find) { for (var i = 0; i < this.find.length; i++) {\n if (this.find[i].pos == null && parent.nodeType == 1 && parent.contains(this.find[i].node))\n { this.find[i].pos = this.currentPos; }\n } }\n};\n\nParseContext.prototype.findAround = function findAround (parent, content, before) {\n if (parent != content && this.find) { for (var i = 0; i < this.find.length; i++) {\n if (this.find[i].pos == null && parent.nodeType == 1 && parent.contains(this.find[i].node)) {\n var pos = content.compareDocumentPosition(this.find[i].node);\n if (pos & (before ? 2 : 4))\n { this.find[i].pos = this.currentPos; }\n }\n } }\n};\n\nParseContext.prototype.findInText = function findInText (textNode) {\n if (this.find) { for (var i = 0; i < this.find.length; i++) {\n if (this.find[i].node == textNode)\n { this.find[i].pos = this.currentPos - (textNode.nodeValue.length - this.find[i].offset); }\n } }\n};\n\n// : (string) → bool\n// Determines whether the given [context\n// string](#ParseRule.context) matches this context.\nParseContext.prototype.matchesContext = function matchesContext (context) {\n var this$1 = this;\n\n if (context.indexOf(\"|\") > -1)\n { return context.split(/\\s*\\|\\s*/).some(this.matchesContext, this) }\n\n var parts = context.split(\"/\");\n var option = this.options.context;\n var useRoot = !this.isOpen && (!option || option.parent.type == this.nodes[0].type);\n var minDepth = -(option ? option.depth + 1 : 0) + (useRoot ? 0 : 1);\n var match = function (i, depth) {\n for (; i >= 0; i--) {\n var part = parts[i];\n if (part == \"\") {\n if (i == parts.length - 1 || i == 0) { continue }\n for (; depth >= minDepth; depth--)\n { if (match(i - 1, depth)) { return true } }\n return false\n } else {\n var next = depth > 0 || (depth == 0 && useRoot) ? this$1.nodes[depth].type\n : option && depth >= minDepth ? option.node(depth - minDepth).type\n : null;\n if (!next || (next.name != part && next.groups.indexOf(part) == -1))\n { return false }\n depth--;\n }\n }\n return true\n };\n return match(parts.length - 1, this.open)\n};\n\nParseContext.prototype.textblockFromContext = function textblockFromContext () {\n var $context = this.options.context;\n if ($context) { for (var d = $context.depth; d >= 0; d--) {\n var deflt = $context.node(d).contentMatchAt($context.indexAfter(d)).defaultType;\n if (deflt && deflt.isTextblock && deflt.defaultAttrs) { return deflt }\n } }\n for (var name in this.parser.schema.nodes) {\n var type = this.parser.schema.nodes[name];\n if (type.isTextblock && type.defaultAttrs) { return type }\n }\n};\n\nParseContext.prototype.addPendingMark = function addPendingMark (mark) {\n this.top.pendingMarks = mark.addToSet(this.top.pendingMarks);\n};\n\nParseContext.prototype.removePendingMark = function removePendingMark (mark, upto) {\n for (var depth = this.open; depth >= 0; depth--) {\n var level = this.nodes[depth];\n var found = level.pendingMarks.lastIndexOf(mark);\n if (found > -1) { level.pendingMarks = mark.removeFromSet(level.pendingMarks); }\n else { level.activeMarks = mark.removeFromSet(level.activeMarks); }\n if (level == upto) { break }\n }\n};\n\nObject.defineProperties( ParseContext.prototype, prototypeAccessors$6 );\n\n// Kludge to work around directly nested list nodes produced by some\n// tools and allowed by browsers to mean that the nested list is\n// actually part of the list item above it.\nfunction normalizeList(dom) {\n for (var child = dom.firstChild, prevItem = null; child; child = child.nextSibling) {\n var name = child.nodeType == 1 ? child.nodeName.toLowerCase() : null;\n if (name && listTags.hasOwnProperty(name) && prevItem) {\n prevItem.appendChild(child);\n child = prevItem;\n } else if (name == \"li\") {\n prevItem = child;\n } else if (name) {\n prevItem = null;\n }\n }\n}\n\n// Apply a CSS selector.\nfunction matches(dom, selector) {\n return (dom.matches || dom.msMatchesSelector || dom.webkitMatchesSelector || dom.mozMatchesSelector).call(dom, selector)\n}\n\n// : (string) → [string]\n// Tokenize a style attribute into property/value pairs.\nfunction parseStyles(style) {\n var re = /\\s*([\\w-]+)\\s*:\\s*([^;]+)/g, m, result = [];\n while (m = re.exec(style)) { result.push(m[1], m[2].trim()); }\n return result\n}\n\nfunction copy(obj) {\n var copy = {};\n for (var prop in obj) { copy[prop] = obj[prop]; }\n return copy\n}\n\n// Used when finding a mark at the top level of a fragment parse.\n// Checks whether it would be reasonable to apply a given mark type to\n// a given node, by looking at the way the mark occurs in the schema.\nfunction markMayApply(markType, nodeType) {\n var nodes = nodeType.schema.nodes;\n var loop = function ( name ) {\n var parent = nodes[name];\n if (!parent.allowsMarkType(markType)) { return }\n var seen = [], scan = function (match) {\n seen.push(match);\n for (var i = 0; i < match.edgeCount; i++) {\n var ref = match.edge(i);\n var type = ref.type;\n var next = ref.next;\n if (type == nodeType) { return true }\n if (seen.indexOf(next) < 0 && scan(next)) { return true }\n }\n };\n if (scan(parent.contentMatch)) { return { v: true } }\n };\n\n for (var name in nodes) {\n var returned = loop( name );\n\n if ( returned ) return returned.v;\n }\n}\n\n// DOMOutputSpec:: interface\n// A description of a DOM structure. Can be either a string, which is\n// interpreted as a text node, a DOM node, which is interpreted as\n// itself, or an array.\n//\n// An array describes a DOM element. The first value in the array\n// should be a string—the name of the DOM element, optionally prefixed\n// by a namespace URL and a space. If the second element is plain\n// object, it is interpreted as a set of attributes for the element.\n// Any elements after that (including the 2nd if it's not an attribute\n// object) are interpreted as children of the DOM elements, and must\n// either be valid `DOMOutputSpec` values, or the number zero.\n//\n// The number zero (pronounced “hole”) is used to indicate the place\n// where a node's child nodes should be inserted. If it occurs in an\n// output spec, it should be the only child element in its parent\n// node.\n\n// ::- A DOM serializer knows how to convert ProseMirror nodes and\n// marks of various types to DOM nodes.\nvar DOMSerializer = function DOMSerializer(nodes, marks) {\n // :: Object<(node: Node) → DOMOutputSpec>\n // The node serialization functions.\n this.nodes = nodes || {};\n // :: Object<?(mark: Mark, inline: bool) → DOMOutputSpec>\n // The mark serialization functions.\n this.marks = marks || {};\n};\n\n// :: (Fragment, ?Object) → dom.DocumentFragment\n// Serialize the content of this fragment to a DOM fragment. When\n// not in the browser, the `document` option, containing a DOM\n// document, should be passed so that the serializer can create\n// nodes.\nDOMSerializer.prototype.serializeFragment = function serializeFragment (fragment, options, target) {\n var this$1 = this;\n if ( options === void 0 ) options = {};\n\n if (!target) { target = doc(options).createDocumentFragment(); }\n\n var top = target, active = null;\n fragment.forEach(function (node) {\n if (active || node.marks.length) {\n if (!active) { active = []; }\n var keep = 0, rendered = 0;\n while (keep < active.length && rendered < node.marks.length) {\n var next = node.marks[rendered];\n if (!this$1.marks[next.type.name]) { rendered++; continue }\n if (!next.eq(active[keep]) || next.type.spec.spanning === false) { break }\n keep += 2; rendered++;\n }\n while (keep < active.length) {\n top = active.pop();\n active.pop();\n }\n while (rendered < node.marks.length) {\n var add = node.marks[rendered++];\n var markDOM = this$1.serializeMark(add, node.isInline, options);\n if (markDOM) {\n active.push(add, top);\n top.appendChild(markDOM.dom);\n top = markDOM.contentDOM || markDOM.dom;\n }\n }\n }\n top.appendChild(this$1.serializeNode(node, options));\n });\n\n return target\n};\n\n// :: (Node, ?Object) → dom.Node\n// Serialize this node to a DOM node. This can be useful when you\n// need to serialize a part of a document, as opposed to the whole\n// document. To serialize a whole document, use\n// [`serializeFragment`](#model.DOMSerializer.serializeFragment) on\n// its [content](#model.Node.content).\nDOMSerializer.prototype.serializeNode = function serializeNode (node, options) {\n if ( options === void 0 ) options = {};\n\n var ref =\n DOMSerializer.renderSpec(doc(options), this.nodes[node.type.name](node));\n var dom = ref.dom;\n var contentDOM = ref.contentDOM;\n if (contentDOM) {\n if (node.isLeaf)\n { throw new RangeError(\"Content hole not allowed in a leaf node spec\") }\n if (options.onContent)\n { options.onContent(node, contentDOM, options); }\n else\n { this.serializeFragment(node.content, options, contentDOM); }\n }\n return dom\n};\n\nDOMSerializer.prototype.serializeNodeAndMarks = function serializeNodeAndMarks (node, options) {\n if ( options === void 0 ) options = {};\n\n var dom = this.serializeNode(node, options);\n for (var i = node.marks.length - 1; i >= 0; i--) {\n var wrap = this.serializeMark(node.marks[i], node.isInline, options);\n if (wrap) {\n(wrap.contentDOM || wrap.dom).appendChild(dom);\n dom = wrap.dom;\n }\n }\n return dom\n};\n\nDOMSerializer.prototype.serializeMark = function serializeMark (mark, inline, options) {\n if ( options === void 0 ) options = {};\n\n var toDOM = this.marks[mark.type.name];\n return toDOM && DOMSerializer.renderSpec(doc(options), toDOM(mark, inline))\n};\n\n// :: (dom.Document, DOMOutputSpec) → {dom: dom.Node, contentDOM: ?dom.Node}\n// Render an [output spec](#model.DOMOutputSpec) to a DOM node. If\n// the spec has a hole (zero) in it, `contentDOM` will point at the\n// node with the hole.\nDOMSerializer.renderSpec = function renderSpec (doc, structure, xmlNS) {\n if ( xmlNS === void 0 ) xmlNS = null;\n\n if (typeof structure == \"string\")\n { return {dom: doc.createTextNode(structure)} }\n if (structure.nodeType != null)\n { return {dom: structure} }\n var tagName = structure[0], space = tagName.indexOf(\" \");\n if (space > 0) {\n xmlNS = tagName.slice(0, space);\n tagName = tagName.slice(space + 1);\n }\n var contentDOM = null, dom = xmlNS ? doc.createElementNS(xmlNS, tagName) : doc.createElement(tagName);\n var attrs = structure[1], start = 1;\n if (attrs && typeof attrs == \"object\" && attrs.nodeType == null && !Array.isArray(attrs)) {\n start = 2;\n for (var name in attrs) { if (attrs[name] != null) {\n var space$1 = name.indexOf(\" \");\n if (space$1 > 0) { dom.setAttributeNS(name.slice(0, space$1), name.slice(space$1 + 1), attrs[name]); }\n else { dom.setAttribute(name, attrs[name]); }\n } }\n }\n for (var i = start; i < structure.length; i++) {\n var child = structure[i];\n if (child === 0) {\n if (i < structure.length - 1 || i > start)\n { throw new RangeError(\"Content hole must be the only child of its parent node\") }\n return {dom: dom, contentDOM: dom}\n } else {\n var ref = DOMSerializer.renderSpec(doc, child, xmlNS);\n var inner = ref.dom;\n var innerContent = ref.contentDOM;\n dom.appendChild(inner);\n if (innerContent) {\n if (contentDOM) { throw new RangeError(\"Multiple content holes\") }\n contentDOM = innerContent;\n }\n }\n }\n return {dom: dom, contentDOM: contentDOM}\n};\n\n// :: (Schema) → DOMSerializer\n// Build a serializer using the [`toDOM`](#model.NodeSpec.toDOM)\n// properties in a schema's node and mark specs.\nDOMSerializer.fromSchema = function fromSchema (schema) {\n return schema.cached.domSerializer ||\n (schema.cached.domSerializer = new DOMSerializer(this.nodesFromSchema(schema), this.marksFromSchema(schema)))\n};\n\n// : (Schema) → Object<(node: Node) → DOMOutputSpec>\n// Gather the serializers in a schema's node specs into an object.\n// This can be useful as a base to build a custom serializer from.\nDOMSerializer.nodesFromSchema = function nodesFromSchema (schema) {\n var result = gatherToDOM(schema.nodes);\n if (!result.text) { result.text = function (node) { return node.text; }; }\n return result\n};\n\n// : (Schema) → Object<(mark: Mark) → DOMOutputSpec>\n// Gather the serializers in a schema's mark specs into an object.\nDOMSerializer.marksFromSchema = function marksFromSchema (schema) {\n return gatherToDOM(schema.marks)\n};\n\nfunction gatherToDOM(obj) {\n var result = {};\n for (var name in obj) {\n var toDOM = obj[name].spec.toDOM;\n if (toDOM) { result[name] = toDOM; }\n }\n return result\n}\n\nfunction doc(options) {\n // declare global: window\n return options.document || window.document\n}\n\nexport { ContentMatch, DOMParser, DOMSerializer, Fragment, Mark, MarkType, Node, NodeRange, NodeType, ReplaceError, ResolvedPos, Schema, Slice };\n//# sourceMappingURL=index.es.js.map\n","'use strict'\n\nvar high = require('highlight.js/lib/core')\nvar fault = require('fault')\n\nexports.highlight = highlight\nexports.highlightAuto = highlightAuto\nexports.registerLanguage = registerLanguage\nexports.listLanguages = listLanguages\nexports.registerAlias = registerAlias\n\nEmitter.prototype.addText = text\nEmitter.prototype.addKeyword = addKeyword\nEmitter.prototype.addSublanguage = addSublanguage\nEmitter.prototype.openNode = open\nEmitter.prototype.closeNode = close\nEmitter.prototype.closeAllNodes = noop\nEmitter.prototype.finalize = noop\nEmitter.prototype.toHTML = toHtmlNoop\n\nvar defaultPrefix = 'hljs-'\n\n// Highlighting `value` in the language `name`.\nfunction highlight(name, value, options) {\n var before = high.configure({})\n var settings = options || {}\n var prefix = settings.prefix\n var result\n\n if (typeof name !== 'string') {\n throw fault('Expected `string` for name, got `%s`', name)\n }\n\n if (!high.getLanguage(name)) {\n throw fault('Unknown language: `%s` is not registered', name)\n }\n\n if (typeof value !== 'string') {\n throw fault('Expected `string` for value, got `%s`', value)\n }\n\n if (prefix === null || prefix === undefined) {\n prefix = defaultPrefix\n }\n\n high.configure({__emitter: Emitter, classPrefix: prefix})\n\n result = high.highlight(value, {language: name, ignoreIllegals: true})\n\n high.configure(before || {})\n\n /* istanbul ignore if - Highlight.js seems to use this (currently) for broken\n * grammars, so let’s keep it in there just to be sure. */\n if (result.errorRaised) {\n throw result.errorRaised\n }\n\n return {\n relevance: result.relevance,\n language: result.language,\n value: result.emitter.rootNode.children\n }\n}\n\nfunction highlightAuto(value, options) {\n var settings = options || {}\n var subset = settings.subset || high.listLanguages()\n var prefix = settings.prefix\n var length = subset.length\n var index = -1\n var result\n var secondBest\n var current\n var name\n\n if (prefix === null || prefix === undefined) {\n prefix = defaultPrefix\n }\n\n if (typeof value !== 'string') {\n throw fault('Expected `string` for value, got `%s`', value)\n }\n\n secondBest = {relevance: 0, language: null, value: []}\n result = {relevance: 0, language: null, value: []}\n\n while (++index < length) {\n name = subset[index]\n\n if (!high.getLanguage(name)) {\n continue\n }\n\n current = highlight(name, value, options)\n current.language = name\n\n if (current.relevance > secondBest.relevance) {\n secondBest = current\n }\n\n if (current.relevance > result.relevance) {\n secondBest = result\n result = current\n }\n }\n\n if (secondBest.language) {\n result.secondBest = secondBest\n }\n\n return result\n}\n\n// Register a language.\nfunction registerLanguage(name, syntax) {\n high.registerLanguage(name, syntax)\n}\n\n// Get a list of all registered languages.\nfunction listLanguages() {\n return high.listLanguages()\n}\n\n// Register more aliases for an already registered language.\nfunction registerAlias(name, alias) {\n var map = name\n var key\n\n if (alias) {\n map = {}\n map[name] = alias\n }\n\n for (key in map) {\n high.registerAliases(map[key], {languageName: key})\n }\n}\n\nfunction Emitter(options) {\n this.options = options\n this.rootNode = {children: []}\n this.stack = [this.rootNode]\n}\n\nfunction addKeyword(value, name) {\n this.openNode(name)\n this.addText(value)\n this.closeNode()\n}\n\nfunction addSublanguage(other, name) {\n var stack = this.stack\n var current = stack[stack.length - 1]\n var results = other.rootNode.children\n var node = name\n ? {\n type: 'element',\n tagName: 'span',\n properties: {className: [name]},\n children: results\n }\n : results\n\n current.children = current.children.concat(node)\n}\n\nfunction text(value) {\n var stack = this.stack\n var current\n var tail\n\n if (value === '') return\n\n current = stack[stack.length - 1]\n tail = current.children[current.children.length - 1]\n\n if (tail && tail.type === 'text') {\n tail.value += value\n } else {\n current.children.push({type: 'text', value: value})\n }\n}\n\nfunction open(name) {\n var stack = this.stack\n var className = this.options.classPrefix + name\n var current = stack[stack.length - 1]\n var child = {\n type: 'element',\n tagName: 'span',\n properties: {className: [className]},\n children: []\n }\n\n current.children.push(child)\n stack.push(child)\n}\n\nfunction close() {\n this.stack.pop()\n}\n\nfunction toHtmlNoop() {\n return ''\n}\n\nfunction noop() {}\n","import { liftTarget, replaceStep, canJoin, joinPoint, canSplit, ReplaceAroundStep, findWrapping } from 'prosemirror-transform';\nimport { Slice, Fragment } from 'prosemirror-model';\nimport { NodeSelection, Selection, AllSelection, TextSelection } from 'prosemirror-state';\n\n/**\nDelete the selection, if there is one.\n*/\nconst deleteSelection = (state, dispatch) => {\n if (state.selection.empty)\n return false;\n if (dispatch)\n dispatch(state.tr.deleteSelection().scrollIntoView());\n return true;\n};\n/**\nIf the selection is empty and at the start of a textblock, try to\nreduce the distance between that block and the one before it—if\nthere's a block directly before it that can be joined, join them.\nIf not, try to move the selected block closer to the next one in\nthe document structure by lifting it out of its parent or moving it\ninto a parent of the previous block. Will use the view for accurate\n(bidi-aware) start-of-textblock detection if given.\n*/\nconst joinBackward = (state, dispatch, view) => {\n let { $cursor } = state.selection;\n if (!$cursor || (view ? !view.endOfTextblock(\"backward\", state)\n : $cursor.parentOffset > 0))\n return false;\n let $cut = findCutBefore($cursor);\n // If there is no node before this, try to lift\n if (!$cut) {\n let range = $cursor.blockRange(), target = range && liftTarget(range);\n if (target == null)\n return false;\n if (dispatch)\n dispatch(state.tr.lift(range, target).scrollIntoView());\n return true;\n }\n let before = $cut.nodeBefore;\n // Apply the joining algorithm\n if (!before.type.spec.isolating && deleteBarrier(state, $cut, dispatch))\n return true;\n // If the node below has no content and the node above is\n // selectable, delete the node below and select the one above.\n if ($cursor.parent.content.size == 0 &&\n (textblockAt(before, \"end\") || NodeSelection.isSelectable(before))) {\n let delStep = replaceStep(state.doc, $cursor.before(), $cursor.after(), Slice.empty);\n if (delStep && delStep.slice.size < delStep.to - delStep.from) {\n if (dispatch) {\n let tr = state.tr.step(delStep);\n tr.setSelection(textblockAt(before, \"end\") ? Selection.findFrom(tr.doc.resolve(tr.mapping.map($cut.pos, -1)), -1)\n : NodeSelection.create(tr.doc, $cut.pos - before.nodeSize));\n dispatch(tr.scrollIntoView());\n }\n return true;\n }\n }\n // If the node before is an atom, delete it\n if (before.isAtom && $cut.depth == $cursor.depth - 1) {\n if (dispatch)\n dispatch(state.tr.delete($cut.pos - before.nodeSize, $cut.pos).scrollIntoView());\n return true;\n }\n return false;\n};\nfunction textblockAt(node, side, only = false) {\n for (let scan = node; scan; scan = (side == \"start\" ? scan.firstChild : scan.lastChild)) {\n if (scan.isTextblock)\n return true;\n if (only && scan.childCount != 1)\n return false;\n }\n return false;\n}\n/**\nWhen the selection is empty and at the start of a textblock, select\nthe node before that textblock, if possible. This is intended to be\nbound to keys like backspace, after\n[`joinBackward`](https://prosemirror.net/docs/ref/#commands.joinBackward) or other deleting\ncommands, as a fall-back behavior when the schema doesn't allow\ndeletion at the selected point.\n*/\nconst selectNodeBackward = (state, dispatch, view) => {\n let { $head, empty } = state.selection, $cut = $head;\n if (!empty)\n return false;\n if ($head.parent.isTextblock) {\n if (view ? !view.endOfTextblock(\"backward\", state) : $head.parentOffset > 0)\n return false;\n $cut = findCutBefore($head);\n }\n let node = $cut && $cut.nodeBefore;\n if (!node || !NodeSelection.isSelectable(node))\n return false;\n if (dispatch)\n dispatch(state.tr.setSelection(NodeSelection.create(state.doc, $cut.pos - node.nodeSize)).scrollIntoView());\n return true;\n};\nfunction findCutBefore($pos) {\n if (!$pos.parent.type.spec.isolating)\n for (let i = $pos.depth - 1; i >= 0; i--) {\n if ($pos.index(i) > 0)\n return $pos.doc.resolve($pos.before(i + 1));\n if ($pos.node(i).type.spec.isolating)\n break;\n }\n return null;\n}\n/**\nIf the selection is empty and the cursor is at the end of a\ntextblock, try to reduce or remove the boundary between that block\nand the one after it, either by joining them or by moving the other\nblock closer to this one in the tree structure. Will use the view\nfor accurate start-of-textblock detection if given.\n*/\nconst joinForward = (state, dispatch, view) => {\n let { $cursor } = state.selection;\n if (!$cursor || (view ? !view.endOfTextblock(\"forward\", state)\n : $cursor.parentOffset < $cursor.parent.content.size))\n return false;\n let $cut = findCutAfter($cursor);\n // If there is no node after this, there's nothing to do\n if (!$cut)\n return false;\n let after = $cut.nodeAfter;\n // Try the joining algorithm\n if (deleteBarrier(state, $cut, dispatch))\n return true;\n // If the node above has no content and the node below is\n // selectable, delete the node above and select the one below.\n if ($cursor.parent.content.size == 0 &&\n (textblockAt(after, \"start\") || NodeSelection.isSelectable(after))) {\n let delStep = replaceStep(state.doc, $cursor.before(), $cursor.after(), Slice.empty);\n if (delStep && delStep.slice.size < delStep.to - delStep.from) {\n if (dispatch) {\n let tr = state.tr.step(delStep);\n tr.setSelection(textblockAt(after, \"start\") ? Selection.findFrom(tr.doc.resolve(tr.mapping.map($cut.pos)), 1)\n : NodeSelection.create(tr.doc, tr.mapping.map($cut.pos)));\n dispatch(tr.scrollIntoView());\n }\n return true;\n }\n }\n // If the next node is an atom, delete it\n if (after.isAtom && $cut.depth == $cursor.depth - 1) {\n if (dispatch)\n dispatch(state.tr.delete($cut.pos, $cut.pos + after.nodeSize).scrollIntoView());\n return true;\n }\n return false;\n};\n/**\nWhen the selection is empty and at the end of a textblock, select\nthe node coming after that textblock, if possible. This is intended\nto be bound to keys like delete, after\n[`joinForward`](https://prosemirror.net/docs/ref/#commands.joinForward) and similar deleting\ncommands, to provide a fall-back behavior when the schema doesn't\nallow deletion at the selected point.\n*/\nconst selectNodeForward = (state, dispatch, view) => {\n let { $head, empty } = state.selection, $cut = $head;\n if (!empty)\n return false;\n if ($head.parent.isTextblock) {\n if (view ? !view.endOfTextblock(\"forward\", state) : $head.parentOffset < $head.parent.content.size)\n return false;\n $cut = findCutAfter($head);\n }\n let node = $cut && $cut.nodeAfter;\n if (!node || !NodeSelection.isSelectable(node))\n return false;\n if (dispatch)\n dispatch(state.tr.setSelection(NodeSelection.create(state.doc, $cut.pos)).scrollIntoView());\n return true;\n};\nfunction findCutAfter($pos) {\n if (!$pos.parent.type.spec.isolating)\n for (let i = $pos.depth - 1; i >= 0; i--) {\n let parent = $pos.node(i);\n if ($pos.index(i) + 1 < parent.childCount)\n return $pos.doc.resolve($pos.after(i + 1));\n if (parent.type.spec.isolating)\n break;\n }\n return null;\n}\n/**\nJoin the selected block or, if there is a text selection, the\nclosest ancestor block of the selection that can be joined, with\nthe sibling above it.\n*/\nconst joinUp = (state, dispatch) => {\n let sel = state.selection, nodeSel = sel instanceof NodeSelection, point;\n if (nodeSel) {\n if (sel.node.isTextblock || !canJoin(state.doc, sel.from))\n return false;\n point = sel.from;\n }\n else {\n point = joinPoint(state.doc, sel.from, -1);\n if (point == null)\n return false;\n }\n if (dispatch) {\n let tr = state.tr.join(point);\n if (nodeSel)\n tr.setSelection(NodeSelection.create(tr.doc, point - state.doc.resolve(point).nodeBefore.nodeSize));\n dispatch(tr.scrollIntoView());\n }\n return true;\n};\n/**\nJoin the selected block, or the closest ancestor of the selection\nthat can be joined, with the sibling after it.\n*/\nconst joinDown = (state, dispatch) => {\n let sel = state.selection, point;\n if (sel instanceof NodeSelection) {\n if (sel.node.isTextblock || !canJoin(state.doc, sel.to))\n return false;\n point = sel.to;\n }\n else {\n point = joinPoint(state.doc, sel.to, 1);\n if (point == null)\n return false;\n }\n if (dispatch)\n dispatch(state.tr.join(point).scrollIntoView());\n return true;\n};\n/**\nLift the selected block, or the closest ancestor block of the\nselection that can be lifted, out of its parent node.\n*/\nconst lift = (state, dispatch) => {\n let { $from, $to } = state.selection;\n let range = $from.blockRange($to), target = range && liftTarget(range);\n if (target == null)\n return false;\n if (dispatch)\n dispatch(state.tr.lift(range, target).scrollIntoView());\n return true;\n};\n/**\nIf the selection is in a node whose type has a truthy\n[`code`](https://prosemirror.net/docs/ref/#model.NodeSpec.code) property in its spec, replace the\nselection with a newline character.\n*/\nconst newlineInCode = (state, dispatch) => {\n let { $head, $anchor } = state.selection;\n if (!$head.parent.type.spec.code || !$head.sameParent($anchor))\n return false;\n if (dispatch)\n dispatch(state.tr.insertText(\"\\n\").scrollIntoView());\n return true;\n};\nfunction defaultBlockAt(match) {\n for (let i = 0; i < match.edgeCount; i++) {\n let { type } = match.edge(i);\n if (type.isTextblock && !type.hasRequiredAttrs())\n return type;\n }\n return null;\n}\n/**\nWhen the selection is in a node with a truthy\n[`code`](https://prosemirror.net/docs/ref/#model.NodeSpec.code) property in its spec, create a\ndefault block after the code block, and move the cursor there.\n*/\nconst exitCode = (state, dispatch) => {\n let { $head, $anchor } = state.selection;\n if (!$head.parent.type.spec.code || !$head.sameParent($anchor))\n return false;\n let above = $head.node(-1), after = $head.indexAfter(-1), type = defaultBlockAt(above.contentMatchAt(after));\n if (!type || !above.canReplaceWith(after, after, type))\n return false;\n if (dispatch) {\n let pos = $head.after(), tr = state.tr.replaceWith(pos, pos, type.createAndFill());\n tr.setSelection(Selection.near(tr.doc.resolve(pos), 1));\n dispatch(tr.scrollIntoView());\n }\n return true;\n};\n/**\nIf a block node is selected, create an empty paragraph before (if\nit is its parent's first child) or after it.\n*/\nconst createParagraphNear = (state, dispatch) => {\n let sel = state.selection, { $from, $to } = sel;\n if (sel instanceof AllSelection || $from.parent.inlineContent || $to.parent.inlineContent)\n return false;\n let type = defaultBlockAt($to.parent.contentMatchAt($to.indexAfter()));\n if (!type || !type.isTextblock)\n return false;\n if (dispatch) {\n let side = (!$from.parentOffset && $to.index() < $to.parent.childCount ? $from : $to).pos;\n let tr = state.tr.insert(side, type.createAndFill());\n tr.setSelection(TextSelection.create(tr.doc, side + 1));\n dispatch(tr.scrollIntoView());\n }\n return true;\n};\n/**\nIf the cursor is in an empty textblock that can be lifted, lift the\nblock.\n*/\nconst liftEmptyBlock = (state, dispatch) => {\n let { $cursor } = state.selection;\n if (!$cursor || $cursor.parent.content.size)\n return false;\n if ($cursor.depth > 1 && $cursor.after() != $cursor.end(-1)) {\n let before = $cursor.before();\n if (canSplit(state.doc, before)) {\n if (dispatch)\n dispatch(state.tr.split(before).scrollIntoView());\n return true;\n }\n }\n let range = $cursor.blockRange(), target = range && liftTarget(range);\n if (target == null)\n return false;\n if (dispatch)\n dispatch(state.tr.lift(range, target).scrollIntoView());\n return true;\n};\n/**\nSplit the parent block of the selection. If the selection is a text\nselection, also delete its content.\n*/\nconst splitBlock = (state, dispatch) => {\n let { $from, $to } = state.selection;\n if (state.selection instanceof NodeSelection && state.selection.node.isBlock) {\n if (!$from.parentOffset || !canSplit(state.doc, $from.pos))\n return false;\n if (dispatch)\n dispatch(state.tr.split($from.pos).scrollIntoView());\n return true;\n }\n if (!$from.parent.isBlock)\n return false;\n if (dispatch) {\n let atEnd = $to.parentOffset == $to.parent.content.size;\n let tr = state.tr;\n if (state.selection instanceof TextSelection || state.selection instanceof AllSelection)\n tr.deleteSelection();\n let deflt = $from.depth == 0 ? null : defaultBlockAt($from.node(-1).contentMatchAt($from.indexAfter(-1)));\n let types = atEnd && deflt ? [{ type: deflt }] : undefined;\n let can = canSplit(tr.doc, tr.mapping.map($from.pos), 1, types);\n if (!types && !can && canSplit(tr.doc, tr.mapping.map($from.pos), 1, deflt ? [{ type: deflt }] : undefined)) {\n if (deflt)\n types = [{ type: deflt }];\n can = true;\n }\n if (can) {\n tr.split(tr.mapping.map($from.pos), 1, types);\n if (!atEnd && !$from.parentOffset && $from.parent.type != deflt) {\n let first = tr.mapping.map($from.before()), $first = tr.doc.resolve(first);\n if (deflt && $from.node(-1).canReplaceWith($first.index(), $first.index() + 1, deflt))\n tr.setNodeMarkup(tr.mapping.map($from.before()), deflt);\n }\n }\n dispatch(tr.scrollIntoView());\n }\n return true;\n};\n/**\nActs like [`splitBlock`](https://prosemirror.net/docs/ref/#commands.splitBlock), but without\nresetting the set of active marks at the cursor.\n*/\nconst splitBlockKeepMarks = (state, dispatch) => {\n return splitBlock(state, dispatch && (tr => {\n let marks = state.storedMarks || (state.selection.$to.parentOffset && state.selection.$from.marks());\n if (marks)\n tr.ensureMarks(marks);\n dispatch(tr);\n }));\n};\n/**\nMove the selection to the node wrapping the current selection, if\nany. (Will not select the document node.)\n*/\nconst selectParentNode = (state, dispatch) => {\n let { $from, to } = state.selection, pos;\n let same = $from.sharedDepth(to);\n if (same == 0)\n return false;\n pos = $from.before(same);\n if (dispatch)\n dispatch(state.tr.setSelection(NodeSelection.create(state.doc, pos)));\n return true;\n};\n/**\nSelect the whole document.\n*/\nconst selectAll = (state, dispatch) => {\n if (dispatch)\n dispatch(state.tr.setSelection(new AllSelection(state.doc)));\n return true;\n};\nfunction joinMaybeClear(state, $pos, dispatch) {\n let before = $pos.nodeBefore, after = $pos.nodeAfter, index = $pos.index();\n if (!before || !after || !before.type.compatibleContent(after.type))\n return false;\n if (!before.content.size && $pos.parent.canReplace(index - 1, index)) {\n if (dispatch)\n dispatch(state.tr.delete($pos.pos - before.nodeSize, $pos.pos).scrollIntoView());\n return true;\n }\n if (!$pos.parent.canReplace(index, index + 1) || !(after.isTextblock || canJoin(state.doc, $pos.pos)))\n return false;\n if (dispatch)\n dispatch(state.tr\n .clearIncompatible($pos.pos, before.type, before.contentMatchAt(before.childCount))\n .join($pos.pos)\n .scrollIntoView());\n return true;\n}\nfunction deleteBarrier(state, $cut, dispatch) {\n let before = $cut.nodeBefore, after = $cut.nodeAfter, conn, match;\n if (before.type.spec.isolating || after.type.spec.isolating)\n return false;\n if (joinMaybeClear(state, $cut, dispatch))\n return true;\n let canDelAfter = $cut.parent.canReplace($cut.index(), $cut.index() + 1);\n if (canDelAfter &&\n (conn = (match = before.contentMatchAt(before.childCount)).findWrapping(after.type)) &&\n match.matchType(conn[0] || after.type).validEnd) {\n if (dispatch) {\n let end = $cut.pos + after.nodeSize, wrap = Fragment.empty;\n for (let i = conn.length - 1; i >= 0; i--)\n wrap = Fragment.from(conn[i].create(null, wrap));\n wrap = Fragment.from(before.copy(wrap));\n let tr = state.tr.step(new ReplaceAroundStep($cut.pos - 1, end, $cut.pos, end, new Slice(wrap, 1, 0), conn.length, true));\n let joinAt = end + 2 * conn.length;\n if (canJoin(tr.doc, joinAt))\n tr.join(joinAt);\n dispatch(tr.scrollIntoView());\n }\n return true;\n }\n let selAfter = Selection.findFrom($cut, 1);\n let range = selAfter && selAfter.$from.blockRange(selAfter.$to), target = range && liftTarget(range);\n if (target != null && target >= $cut.depth) {\n if (dispatch)\n dispatch(state.tr.lift(range, target).scrollIntoView());\n return true;\n }\n if (canDelAfter && textblockAt(after, \"start\", true) && textblockAt(before, \"end\")) {\n let at = before, wrap = [];\n for (;;) {\n wrap.push(at);\n if (at.isTextblock)\n break;\n at = at.lastChild;\n }\n let afterText = after, afterDepth = 1;\n for (; !afterText.isTextblock; afterText = afterText.firstChild)\n afterDepth++;\n if (at.canReplace(at.childCount, at.childCount, afterText.content)) {\n if (dispatch) {\n let end = Fragment.empty;\n for (let i = wrap.length - 1; i >= 0; i--)\n end = Fragment.from(wrap[i].copy(end));\n let tr = state.tr.step(new ReplaceAroundStep($cut.pos - wrap.length, $cut.pos + after.nodeSize, $cut.pos + afterDepth, $cut.pos + after.nodeSize - afterDepth, new Slice(end, wrap.length, 0), 0, true));\n dispatch(tr.scrollIntoView());\n }\n return true;\n }\n }\n return false;\n}\nfunction selectTextblockSide(side) {\n return function (state, dispatch) {\n let sel = state.selection, $pos = side < 0 ? sel.$from : sel.$to;\n let depth = $pos.depth;\n while ($pos.node(depth).isInline) {\n if (!depth)\n return false;\n depth--;\n }\n if (!$pos.node(depth).isTextblock)\n return false;\n if (dispatch)\n dispatch(state.tr.setSelection(TextSelection.create(state.doc, side < 0 ? $pos.start(depth) : $pos.end(depth))));\n return true;\n };\n}\n/**\nMoves the cursor to the start of current text block.\n*/\nconst selectTextblockStart = selectTextblockSide(-1);\n/**\nMoves the cursor to the end of current text block.\n*/\nconst selectTextblockEnd = selectTextblockSide(1);\n// Parameterized commands\n/**\nWrap the selection in a node of the given type with the given\nattributes.\n*/\nfunction wrapIn(nodeType, attrs = null) {\n return function (state, dispatch) {\n let { $from, $to } = state.selection;\n let range = $from.blockRange($to), wrapping = range && findWrapping(range, nodeType, attrs);\n if (!wrapping)\n return false;\n if (dispatch)\n dispatch(state.tr.wrap(range, wrapping).scrollIntoView());\n return true;\n };\n}\n/**\nReturns a command that tries to set the selected textblocks to the\ngiven node type with the given attributes.\n*/\nfunction setBlockType(nodeType, attrs = null) {\n return function (state, dispatch) {\n let { from, to } = state.selection;\n let applicable = false;\n state.doc.nodesBetween(from, to, (node, pos) => {\n if (applicable)\n return false;\n if (!node.isTextblock || node.hasMarkup(nodeType, attrs))\n return;\n if (node.type == nodeType) {\n applicable = true;\n }\n else {\n let $pos = state.doc.resolve(pos), index = $pos.index();\n applicable = $pos.parent.canReplaceWith(index, index + 1, nodeType);\n }\n });\n if (!applicable)\n return false;\n if (dispatch)\n dispatch(state.tr.setBlockType(from, to, nodeType, attrs).scrollIntoView());\n return true;\n };\n}\nfunction markApplies(doc, ranges, type) {\n for (let i = 0; i < ranges.length; i++) {\n let { $from, $to } = ranges[i];\n let can = $from.depth == 0 ? doc.type.allowsMarkType(type) : false;\n doc.nodesBetween($from.pos, $to.pos, node => {\n if (can)\n return false;\n can = node.inlineContent && node.type.allowsMarkType(type);\n });\n if (can)\n return true;\n }\n return false;\n}\n/**\nCreate a command function that toggles the given mark with the\ngiven attributes. Will return `false` when the current selection\ndoesn't support that mark. This will remove the mark if any marks\nof that type exist in the selection, or add it otherwise. If the\nselection is empty, this applies to the [stored\nmarks](https://prosemirror.net/docs/ref/#state.EditorState.storedMarks) instead of a range of the\ndocument.\n*/\nfunction toggleMark(markType, attrs = null) {\n return function (state, dispatch) {\n let { empty, $cursor, ranges } = state.selection;\n if ((empty && !$cursor) || !markApplies(state.doc, ranges, markType))\n return false;\n if (dispatch) {\n if ($cursor) {\n if (markType.isInSet(state.storedMarks || $cursor.marks()))\n dispatch(state.tr.removeStoredMark(markType));\n else\n dispatch(state.tr.addStoredMark(markType.create(attrs)));\n }\n else {\n let has = false, tr = state.tr;\n for (let i = 0; !has && i < ranges.length; i++) {\n let { $from, $to } = ranges[i];\n has = state.doc.rangeHasMark($from.pos, $to.pos, markType);\n }\n for (let i = 0; i < ranges.length; i++) {\n let { $from, $to } = ranges[i];\n if (has) {\n tr.removeMark($from.pos, $to.pos, markType);\n }\n else {\n let from = $from.pos, to = $to.pos, start = $from.nodeAfter, end = $to.nodeBefore;\n let spaceStart = start && start.isText ? /^\\s*/.exec(start.text)[0].length : 0;\n let spaceEnd = end && end.isText ? /\\s*$/.exec(end.text)[0].length : 0;\n if (from + spaceStart < to) {\n from += spaceStart;\n to -= spaceEnd;\n }\n tr.addMark(from, to, markType.create(attrs));\n }\n }\n dispatch(tr.scrollIntoView());\n }\n }\n return true;\n };\n}\nfunction wrapDispatchForJoin(dispatch, isJoinable) {\n return (tr) => {\n if (!tr.isGeneric)\n return dispatch(tr);\n let ranges = [];\n for (let i = 0; i < tr.mapping.maps.length; i++) {\n let map = tr.mapping.maps[i];\n for (let j = 0; j < ranges.length; j++)\n ranges[j] = map.map(ranges[j]);\n map.forEach((_s, _e, from, to) => ranges.push(from, to));\n }\n // Figure out which joinable points exist inside those ranges,\n // by checking all node boundaries in their parent nodes.\n let joinable = [];\n for (let i = 0; i < ranges.length; i += 2) {\n let from = ranges[i], to = ranges[i + 1];\n let $from = tr.doc.resolve(from), depth = $from.sharedDepth(to), parent = $from.node(depth);\n for (let index = $from.indexAfter(depth), pos = $from.after(depth + 1); pos <= to; ++index) {\n let after = parent.maybeChild(index);\n if (!after)\n break;\n if (index && joinable.indexOf(pos) == -1) {\n let before = parent.child(index - 1);\n if (before.type == after.type && isJoinable(before, after))\n joinable.push(pos);\n }\n pos += after.nodeSize;\n }\n }\n // Join the joinable points\n joinable.sort((a, b) => a - b);\n for (let i = joinable.length - 1; i >= 0; i--) {\n if (canJoin(tr.doc, joinable[i]))\n tr.join(joinable[i]);\n }\n dispatch(tr);\n };\n}\n/**\nWrap a command so that, when it produces a transform that causes\ntwo joinable nodes to end up next to each other, those are joined.\nNodes are considered joinable when they are of the same type and\nwhen the `isJoinable` predicate returns true for them or, if an\narray of strings was passed, if their node type name is in that\narray.\n*/\nfunction autoJoin(command, isJoinable) {\n let canJoin = Array.isArray(isJoinable) ? (node) => isJoinable.indexOf(node.type.name) > -1\n : isJoinable;\n return (state, dispatch, view) => command(state, dispatch && wrapDispatchForJoin(dispatch, canJoin), view);\n}\n/**\nCombine a number of command functions into a single function (which\ncalls them one by one until one returns true).\n*/\nfunction chainCommands(...commands) {\n return function (state, dispatch, view) {\n for (let i = 0; i < commands.length; i++)\n if (commands[i](state, dispatch, view))\n return true;\n return false;\n };\n}\nlet backspace = chainCommands(deleteSelection, joinBackward, selectNodeBackward);\nlet del = chainCommands(deleteSelection, joinForward, selectNodeForward);\n/**\nA basic keymap containing bindings not specific to any schema.\nBinds the following keys (when multiple commands are listed, they\nare chained with [`chainCommands`](https://prosemirror.net/docs/ref/#commands.chainCommands)):\n\n* **Enter** to `newlineInCode`, `createParagraphNear`, `liftEmptyBlock`, `splitBlock`\n* **Mod-Enter** to `exitCode`\n* **Backspace** and **Mod-Backspace** to `deleteSelection`, `joinBackward`, `selectNodeBackward`\n* **Delete** and **Mod-Delete** to `deleteSelection`, `joinForward`, `selectNodeForward`\n* **Mod-Delete** to `deleteSelection`, `joinForward`, `selectNodeForward`\n* **Mod-a** to `selectAll`\n*/\nconst pcBaseKeymap = {\n \"Enter\": chainCommands(newlineInCode, createParagraphNear, liftEmptyBlock, splitBlock),\n \"Mod-Enter\": exitCode,\n \"Backspace\": backspace,\n \"Mod-Backspace\": backspace,\n \"Shift-Backspace\": backspace,\n \"Delete\": del,\n \"Mod-Delete\": del,\n \"Mod-a\": selectAll\n};\n/**\nA copy of `pcBaseKeymap` that also binds **Ctrl-h** like Backspace,\n**Ctrl-d** like Delete, **Alt-Backspace** like Ctrl-Backspace, and\n**Ctrl-Alt-Backspace**, **Alt-Delete**, and **Alt-d** like\nCtrl-Delete.\n*/\nconst macBaseKeymap = {\n \"Ctrl-h\": pcBaseKeymap[\"Backspace\"],\n \"Alt-Backspace\": pcBaseKeymap[\"Mod-Backspace\"],\n \"Ctrl-d\": pcBaseKeymap[\"Delete\"],\n \"Ctrl-Alt-Backspace\": pcBaseKeymap[\"Mod-Delete\"],\n \"Alt-Delete\": pcBaseKeymap[\"Mod-Delete\"],\n \"Alt-d\": pcBaseKeymap[\"Mod-Delete\"],\n \"Ctrl-a\": selectTextblockStart,\n \"Ctrl-e\": selectTextblockEnd\n};\nfor (let key in pcBaseKeymap)\n macBaseKeymap[key] = pcBaseKeymap[key];\nconst mac = typeof navigator != \"undefined\" ? /Mac|iP(hone|[oa]d)/.test(navigator.platform)\n // @ts-ignore\n : typeof os != \"undefined\" && os.platform ? os.platform() == \"darwin\" : false;\n/**\nDepending on the detected platform, this will hold\n[`pcBasekeymap`](https://prosemirror.net/docs/ref/#commands.pcBaseKeymap) or\n[`macBaseKeymap`](https://prosemirror.net/docs/ref/#commands.macBaseKeymap).\n*/\nconst baseKeymap = mac ? macBaseKeymap : pcBaseKeymap;\n\nexport { autoJoin, baseKeymap, chainCommands, createParagraphNear, deleteSelection, exitCode, joinBackward, joinDown, joinForward, joinUp, lift, liftEmptyBlock, macBaseKeymap, newlineInCode, pcBaseKeymap, selectAll, selectNodeBackward, selectNodeForward, selectParentNode, selectTextblockEnd, selectTextblockStart, setBlockType, splitBlock, splitBlockKeepMarks, toggleMark, wrapIn };\n","const { defaults } = require('./defaults.js');\nconst {\n cleanUrl,\n escape\n} = require('./helpers.js');\n\n/**\n * Renderer\n */\nmodule.exports = class Renderer {\n constructor(options) {\n this.options = options || defaults;\n }\n\n code(code, infostring, escaped) {\n const lang = (infostring || '').match(/\\S*/)[0];\n if (this.options.highlight) {\n const out = this.options.highlight(code, lang);\n if (out != null && out !== code) {\n escaped = true;\n code = out;\n }\n }\n\n if (!lang) {\n return '<pre><code>'\n + (escaped ? code : escape(code, true))\n + '</code></pre>';\n }\n\n return '<pre><code class=\"'\n + this.options.langPrefix\n + escape(lang, true)\n + '\">'\n + (escaped ? code : escape(code, true))\n + '</code></pre>\\n';\n };\n\n blockquote(quote) {\n return '<blockquote>\\n' + quote + '</blockquote>\\n';\n };\n\n html(html) {\n return html;\n };\n\n heading(text, level, raw, slugger) {\n if (this.options.headerIds) {\n return '<h'\n + level\n + ' id=\"'\n + this.options.headerPrefix\n + slugger.slug(raw)\n + '\">'\n + text\n + '</h'\n + level\n + '>\\n';\n }\n // ignore IDs\n return '<h' + level + '>' + text + '</h' + level + '>\\n';\n };\n\n hr() {\n return this.options.xhtml ? '<hr/>\\n' : '<hr>\\n';\n };\n\n list(body, ordered, start) {\n const type = ordered ? 'ol' : 'ul',\n startatt = (ordered && start !== 1) ? (' start=\"' + start + '\"') : '';\n return '<' + type + startatt + '>\\n' + body + '</' + type + '>\\n';\n };\n\n listitem(text) {\n return '<li>' + text + '</li>\\n';\n };\n\n checkbox(checked) {\n return '<input '\n + (checked ? 'checked=\"\" ' : '')\n + 'disabled=\"\" type=\"checkbox\"'\n + (this.options.xhtml ? ' /' : '')\n + '> ';\n };\n\n paragraph(text) {\n return '<p>' + text + '</p>\\n';\n };\n\n table(header, body) {\n if (body) body = '<tbody>' + body + '</tbody>';\n\n return '<table>\\n'\n + '<thead>\\n'\n + header\n + '</thead>\\n'\n + body\n + '</table>\\n';\n };\n\n tablerow(content) {\n return '<tr>\\n' + content + '</tr>\\n';\n };\n\n tablecell(content, flags) {\n const type = flags.header ? 'th' : 'td';\n const tag = flags.align\n ? '<' + type + ' align=\"' + flags.align + '\">'\n : '<' + type + '>';\n return tag + content + '</' + type + '>\\n';\n };\n\n // span level renderer\n strong(text) {\n return '<strong>' + text + '</strong>';\n };\n\n em(text) {\n return '<em>' + text + '</em>';\n };\n\n codespan(text) {\n return '<code>' + text + '</code>';\n };\n\n br() {\n return this.options.xhtml ? '<br/>' : '<br>';\n };\n\n del(text) {\n return '<del>' + text + '</del>';\n };\n\n link(href, title, text) {\n href = cleanUrl(this.options.sanitize, this.options.baseUrl, href);\n if (href === null) {\n return text;\n }\n let out = '<a href=\"' + escape(href) + '\"';\n if (title) {\n out += ' title=\"' + title + '\"';\n }\n out += '>' + text + '</a>';\n return out;\n };\n\n image(href, title, text) {\n href = cleanUrl(this.options.sanitize, this.options.baseUrl, href);\n if (href === null) {\n return text;\n }\n\n let out = '<img src=\"' + href + '\" alt=\"' + text + '\"';\n if (title) {\n out += ' title=\"' + title + '\"';\n }\n out += this.options.xhtml ? '/>' : '>';\n return out;\n };\n\n text(text) {\n return text;\n };\n};\n","const { defaults } = require('./defaults.js');\nconst { block } = require('./rules.js');\nconst {\n rtrim,\n splitCells,\n escape\n} = require('./helpers.js');\n\n/**\n * Block Lexer\n */\nmodule.exports = class Lexer {\n constructor(options) {\n this.tokens = [];\n this.tokens.links = Object.create(null);\n this.options = options || defaults;\n this.rules = block.normal;\n\n if (this.options.pedantic) {\n this.rules = block.pedantic;\n } else if (this.options.gfm) {\n this.rules = block.gfm;\n }\n }\n\n /**\n * Expose Block Rules\n */\n static get rules() {\n return block;\n }\n\n /**\n * Static Lex Method\n */\n static lex(src, options) {\n const lexer = new Lexer(options);\n return lexer.lex(src);\n };\n\n /**\n * Preprocessing\n */\n lex(src) {\n src = src\n .replace(/\\r\\n|\\r/g, '\\n')\n .replace(/\\t/g, ' ');\n\n return this.token(src, true);\n };\n\n /**\n * Lexing\n */\n token(src, top) {\n src = src.replace(/^ +$/gm, '');\n let next,\n loose,\n cap,\n bull,\n b,\n item,\n listStart,\n listItems,\n t,\n space,\n i,\n tag,\n l,\n isordered,\n istask,\n ischecked;\n\n while (src) {\n // newline\n if (cap = this.rules.newline.exec(src)) {\n src = src.substring(cap[0].length);\n if (cap[0].length > 1) {\n this.tokens.push({\n type: 'space'\n });\n }\n }\n\n // code\n if (cap = this.rules.code.exec(src)) {\n const lastToken = this.tokens[this.tokens.length - 1];\n src = src.substring(cap[0].length);\n // An indented code block cannot interrupt a paragraph.\n if (lastToken && lastToken.type === 'paragraph') {\n lastToken.text += '\\n' + cap[0].trimRight();\n } else {\n cap = cap[0].replace(/^ {4}/gm, '');\n this.tokens.push({\n type: 'code',\n codeBlockStyle: 'indented',\n text: !this.options.pedantic\n ? rtrim(cap, '\\n')\n : cap\n });\n }\n continue;\n }\n\n // fences\n if (cap = this.rules.fences.exec(src)) {\n src = src.substring(cap[0].length);\n this.tokens.push({\n type: 'code',\n lang: cap[2] ? cap[2].trim() : cap[2],\n text: cap[3] || ''\n });\n continue;\n }\n\n // heading\n if (cap = this.rules.heading.exec(src)) {\n src = src.substring(cap[0].length);\n this.tokens.push({\n type: 'heading',\n depth: cap[1].length,\n text: cap[2]\n });\n continue;\n }\n\n // table no leading pipe (gfm)\n if (cap = this.rules.nptable.exec(src)) {\n item = {\n type: 'table',\n header: splitCells(cap[1].replace(/^ *| *\\| *$/g, '')),\n align: cap[2].replace(/^ *|\\| *$/g, '').split(/ *\\| */),\n cells: cap[3] ? cap[3].replace(/\\n$/, '').split('\\n') : []\n };\n\n if (item.header.length === item.align.length) {\n src = src.substring(cap[0].length);\n\n for (i = 0; i < item.align.length; i++) {\n if (/^ *-+: *$/.test(item.align[i])) {\n item.align[i] = 'right';\n } else if (/^ *:-+: *$/.test(item.align[i])) {\n item.align[i] = 'center';\n } else if (/^ *:-+ *$/.test(item.align[i])) {\n item.align[i] = 'left';\n } else {\n item.align[i] = null;\n }\n }\n\n for (i = 0; i < item.cells.length; i++) {\n item.cells[i] = splitCells(item.cells[i], item.header.length);\n }\n\n this.tokens.push(item);\n\n continue;\n }\n }\n\n // hr\n if (cap = this.rules.hr.exec(src)) {\n src = src.substring(cap[0].length);\n this.tokens.push({\n type: 'hr'\n });\n continue;\n }\n\n // blockquote\n if (cap = this.rules.blockquote.exec(src)) {\n src = src.substring(cap[0].length);\n\n this.tokens.push({\n type: 'blockquote_start'\n });\n\n cap = cap[0].replace(/^ *> ?/gm, '');\n\n // Pass `top` to keep the current\n // \"toplevel\" state. This is exactly\n // how markdown.pl works.\n this.token(cap, top);\n\n this.tokens.push({\n type: 'blockquote_end'\n });\n\n continue;\n }\n\n // list\n if (cap = this.rules.list.exec(src)) {\n src = src.substring(cap[0].length);\n bull = cap[2];\n isordered = bull.length > 1;\n\n listStart = {\n type: 'list_start',\n ordered: isordered,\n start: isordered ? +bull : '',\n loose: false\n };\n\n this.tokens.push(listStart);\n\n // Get each top-level item.\n cap = cap[0].match(this.rules.item);\n\n listItems = [];\n next = false;\n l = cap.length;\n i = 0;\n\n for (; i < l; i++) {\n item = cap[i];\n\n // Remove the list item's bullet\n // so it is seen as the next token.\n space = item.length;\n item = item.replace(/^ *([*+-]|\\d+\\.) */, '');\n\n // Outdent whatever the\n // list item contains. Hacky.\n if (~item.indexOf('\\n ')) {\n space -= item.length;\n item = !this.options.pedantic\n ? item.replace(new RegExp('^ {1,' + space + '}', 'gm'), '')\n : item.replace(/^ {1,4}/gm, '');\n }\n\n // Determine whether the next list item belongs here.\n // Backpedal if it does not belong in this list.\n if (i !== l - 1) {\n b = block.bullet.exec(cap[i + 1])[0];\n if (bull.length > 1 ? b.length === 1\n : (b.length > 1 || (this.options.smartLists && b !== bull))) {\n src = cap.slice(i + 1).join('\\n') + src;\n i = l - 1;\n }\n }\n\n // Determine whether item is loose or not.\n // Use: /(^|\\n)(?! )[^\\n]+\\n\\n(?!\\s*$)/\n // for discount behavior.\n loose = next || /\\n\\n(?!\\s*$)/.test(item);\n if (i !== l - 1) {\n next = item.charAt(item.length - 1) === '\\n';\n if (!loose) loose = next;\n }\n\n if (loose) {\n listStart.loose = true;\n }\n\n // Check for task list items\n istask = /^\\[[ xX]\\] /.test(item);\n ischecked = undefined;\n if (istask) {\n ischecked = item[1] !== ' ';\n item = item.replace(/^\\[[ xX]\\] +/, '');\n }\n\n t = {\n type: 'list_item_start',\n task: istask,\n checked: ischecked,\n loose: loose\n };\n\n listItems.push(t);\n this.tokens.push(t);\n\n // Recurse.\n this.token(item, false);\n\n this.tokens.push({\n type: 'list_item_end'\n });\n }\n\n if (listStart.loose) {\n l = listItems.length;\n i = 0;\n for (; i < l; i++) {\n listItems[i].loose = true;\n }\n }\n\n this.tokens.push({\n type: 'list_end'\n });\n\n continue;\n }\n\n // html\n if (cap = this.rules.html.exec(src)) {\n src = src.substring(cap[0].length);\n this.tokens.push({\n type: this.options.sanitize\n ? 'paragraph'\n : 'html',\n pre: !this.options.sanitizer\n && (cap[1] === 'pre' || cap[1] === 'script' || cap[1] === 'style'),\n text: this.options.sanitize ? (this.options.sanitizer ? this.options.sanitizer(cap[0]) : escape(cap[0])) : cap[0]\n });\n continue;\n }\n\n // def\n if (top && (cap = this.rules.def.exec(src))) {\n src = src.substring(cap[0].length);\n if (cap[3]) cap[3] = cap[3].substring(1, cap[3].length - 1);\n tag = cap[1].toLowerCase().replace(/\\s+/g, ' ');\n if (!this.tokens.links[tag]) {\n this.tokens.links[tag] = {\n href: cap[2],\n title: cap[3]\n };\n }\n continue;\n }\n\n // table (gfm)\n if (cap = this.rules.table.exec(src)) {\n item = {\n type: 'table',\n header: splitCells(cap[1].replace(/^ *| *\\| *$/g, '')),\n align: cap[2].replace(/^ *|\\| *$/g, '').split(/ *\\| */),\n cells: cap[3] ? cap[3].replace(/\\n$/, '').split('\\n') : []\n };\n\n if (item.header.length === item.align.length) {\n src = src.substring(cap[0].length);\n\n for (i = 0; i < item.align.length; i++) {\n if (/^ *-+: *$/.test(item.align[i])) {\n item.align[i] = 'right';\n } else if (/^ *:-+: *$/.test(item.align[i])) {\n item.align[i] = 'center';\n } else if (/^ *:-+ *$/.test(item.align[i])) {\n item.align[i] = 'left';\n } else {\n item.align[i] = null;\n }\n }\n\n for (i = 0; i < item.cells.length; i++) {\n item.cells[i] = splitCells(\n item.cells[i].replace(/^ *\\| *| *\\| *$/g, ''),\n item.header.length);\n }\n\n this.tokens.push(item);\n\n continue;\n }\n }\n\n // lheading\n if (cap = this.rules.lheading.exec(src)) {\n src = src.substring(cap[0].length);\n this.tokens.push({\n type: 'heading',\n depth: cap[2].charAt(0) === '=' ? 1 : 2,\n text: cap[1]\n });\n continue;\n }\n\n // top-level paragraph\n if (top && (cap = this.rules.paragraph.exec(src))) {\n src = src.substring(cap[0].length);\n this.tokens.push({\n type: 'paragraph',\n text: cap[1].charAt(cap[1].length - 1) === '\\n'\n ? cap[1].slice(0, -1)\n : cap[1]\n });\n continue;\n }\n\n // text\n if (cap = this.rules.text.exec(src)) {\n // Top-level should never reach here.\n src = src.substring(cap[0].length);\n this.tokens.push({\n type: 'text',\n text: cap[0]\n });\n continue;\n }\n\n if (src) {\n throw new Error('Infinite loop on byte: ' + src.charCodeAt(0));\n }\n }\n\n return this.tokens;\n };\n};\n","//\n// format - printf-like string formatting for JavaScript\n// github.com/samsonjs/format\n// @_sjs\n//\n// Copyright 2010 - 2013 Sami Samhuri <sami@samhuri.net>\n//\n// MIT License\n// http://sjs.mit-license.org\n//\n\n;(function() {\n\n //// Export the API\n var namespace;\n\n // CommonJS / Node module\n if (typeof module !== 'undefined') {\n namespace = module.exports = format;\n }\n\n // Browsers and other environments\n else {\n // Get the global object. Works in ES3, ES5, and ES5 strict mode.\n namespace = (function(){ return this || (1,eval)('this') }());\n }\n\n namespace.format = format;\n namespace.vsprintf = vsprintf;\n\n if (typeof console !== 'undefined' && typeof console.log === 'function') {\n namespace.printf = printf;\n }\n\n function printf(/* ... */) {\n console.log(format.apply(null, arguments));\n }\n\n function vsprintf(fmt, replacements) {\n return format.apply(null, [fmt].concat(replacements));\n }\n\n function format(fmt) {\n var argIndex = 1 // skip initial format argument\n , args = [].slice.call(arguments)\n , i = 0\n , n = fmt.length\n , result = ''\n , c\n , escaped = false\n , arg\n , tmp\n , leadingZero = false\n , precision\n , nextArg = function() { return args[argIndex++]; }\n , slurpNumber = function() {\n var digits = '';\n while (/\\d/.test(fmt[i])) {\n digits += fmt[i++];\n c = fmt[i];\n }\n return digits.length > 0 ? parseInt(digits) : null;\n }\n ;\n for (; i < n; ++i) {\n c = fmt[i];\n if (escaped) {\n escaped = false;\n if (c == '.') {\n leadingZero = false;\n c = fmt[++i];\n }\n else if (c == '0' && fmt[i + 1] == '.') {\n leadingZero = true;\n i += 2;\n c = fmt[i];\n }\n else {\n leadingZero = true;\n }\n precision = slurpNumber();\n switch (c) {\n case 'b': // number in binary\n result += parseInt(nextArg(), 10).toString(2);\n break;\n case 'c': // character\n arg = nextArg();\n if (typeof arg === 'string' || arg instanceof String)\n result += arg;\n else\n result += String.fromCharCode(parseInt(arg, 10));\n break;\n case 'd': // number in decimal\n result += parseInt(nextArg(), 10);\n break;\n case 'f': // floating point number\n tmp = String(parseFloat(nextArg()).toFixed(precision || 6));\n result += leadingZero ? tmp : tmp.replace(/^0/, '');\n break;\n case 'j': // JSON\n result += JSON.stringify(nextArg());\n break;\n case 'o': // number in octal\n result += '0' + parseInt(nextArg(), 10).toString(8);\n break;\n case 's': // string\n result += nextArg();\n break;\n case 'x': // lowercase hexadecimal\n result += '0x' + parseInt(nextArg(), 10).toString(16);\n break;\n case 'X': // uppercase hexadecimal\n result += '0x' + parseInt(nextArg(), 10).toString(16).toUpperCase();\n break;\n default:\n result += c;\n break;\n }\n } else if (c === '%') {\n escaped = true;\n } else {\n result += c;\n }\n }\n return result;\n }\n\n}());\n","import { Slice, Fragment, Mark, Node } from 'prosemirror-model';\nimport { ReplaceStep, ReplaceAroundStep, Transform } from 'prosemirror-transform';\n\nconst classesById = Object.create(null);\n/**\nSuperclass for editor selections. Every selection type should\nextend this. Should not be instantiated directly.\n*/\nclass Selection {\n /**\n Initialize a selection with the head and anchor and ranges. If no\n ranges are given, constructs a single range across `$anchor` and\n `$head`.\n */\n constructor(\n /**\n The resolved anchor of the selection (the side that stays in\n place when the selection is modified).\n */\n $anchor, \n /**\n The resolved head of the selection (the side that moves when\n the selection is modified).\n */\n $head, ranges) {\n this.$anchor = $anchor;\n this.$head = $head;\n this.ranges = ranges || [new SelectionRange($anchor.min($head), $anchor.max($head))];\n }\n /**\n The selection's anchor, as an unresolved position.\n */\n get anchor() { return this.$anchor.pos; }\n /**\n The selection's head.\n */\n get head() { return this.$head.pos; }\n /**\n The lower bound of the selection's main range.\n */\n get from() { return this.$from.pos; }\n /**\n The upper bound of the selection's main range.\n */\n get to() { return this.$to.pos; }\n /**\n The resolved lower bound of the selection's main range.\n */\n get $from() {\n return this.ranges[0].$from;\n }\n /**\n The resolved upper bound of the selection's main range.\n */\n get $to() {\n return this.ranges[0].$to;\n }\n /**\n Indicates whether the selection contains any content.\n */\n get empty() {\n let ranges = this.ranges;\n for (let i = 0; i < ranges.length; i++)\n if (ranges[i].$from.pos != ranges[i].$to.pos)\n return false;\n return true;\n }\n /**\n Get the content of this selection as a slice.\n */\n content() {\n return this.$from.doc.slice(this.from, this.to, true);\n }\n /**\n Replace the selection with a slice or, if no slice is given,\n delete the selection. Will append to the given transaction.\n */\n replace(tr, content = Slice.empty) {\n // Put the new selection at the position after the inserted\n // content. When that ended in an inline node, search backwards,\n // to get the position after that node. If not, search forward.\n let lastNode = content.content.lastChild, lastParent = null;\n for (let i = 0; i < content.openEnd; i++) {\n lastParent = lastNode;\n lastNode = lastNode.lastChild;\n }\n let mapFrom = tr.steps.length, ranges = this.ranges;\n for (let i = 0; i < ranges.length; i++) {\n let { $from, $to } = ranges[i], mapping = tr.mapping.slice(mapFrom);\n tr.replaceRange(mapping.map($from.pos), mapping.map($to.pos), i ? Slice.empty : content);\n if (i == 0)\n selectionToInsertionEnd(tr, mapFrom, (lastNode ? lastNode.isInline : lastParent && lastParent.isTextblock) ? -1 : 1);\n }\n }\n /**\n Replace the selection with the given node, appending the changes\n to the given transaction.\n */\n replaceWith(tr, node) {\n let mapFrom = tr.steps.length, ranges = this.ranges;\n for (let i = 0; i < ranges.length; i++) {\n let { $from, $to } = ranges[i], mapping = tr.mapping.slice(mapFrom);\n let from = mapping.map($from.pos), to = mapping.map($to.pos);\n if (i) {\n tr.deleteRange(from, to);\n }\n else {\n tr.replaceRangeWith(from, to, node);\n selectionToInsertionEnd(tr, mapFrom, node.isInline ? -1 : 1);\n }\n }\n }\n /**\n Find a valid cursor or leaf node selection starting at the given\n position and searching back if `dir` is negative, and forward if\n positive. When `textOnly` is true, only consider cursor\n selections. Will return null when no valid selection position is\n found.\n */\n static findFrom($pos, dir, textOnly = false) {\n let inner = $pos.parent.inlineContent ? new TextSelection($pos)\n : findSelectionIn($pos.node(0), $pos.parent, $pos.pos, $pos.index(), dir, textOnly);\n if (inner)\n return inner;\n for (let depth = $pos.depth - 1; depth >= 0; depth--) {\n let found = dir < 0\n ? findSelectionIn($pos.node(0), $pos.node(depth), $pos.before(depth + 1), $pos.index(depth), dir, textOnly)\n : findSelectionIn($pos.node(0), $pos.node(depth), $pos.after(depth + 1), $pos.index(depth) + 1, dir, textOnly);\n if (found)\n return found;\n }\n return null;\n }\n /**\n Find a valid cursor or leaf node selection near the given\n position. Searches forward first by default, but if `bias` is\n negative, it will search backwards first.\n */\n static near($pos, bias = 1) {\n return this.findFrom($pos, bias) || this.findFrom($pos, -bias) || new AllSelection($pos.node(0));\n }\n /**\n Find the cursor or leaf node selection closest to the start of\n the given document. Will return an\n [`AllSelection`](https://prosemirror.net/docs/ref/#state.AllSelection) if no valid position\n exists.\n */\n static atStart(doc) {\n return findSelectionIn(doc, doc, 0, 0, 1) || new AllSelection(doc);\n }\n /**\n Find the cursor or leaf node selection closest to the end of the\n given document.\n */\n static atEnd(doc) {\n return findSelectionIn(doc, doc, doc.content.size, doc.childCount, -1) || new AllSelection(doc);\n }\n /**\n Deserialize the JSON representation of a selection. Must be\n implemented for custom classes (as a static class method).\n */\n static fromJSON(doc, json) {\n if (!json || !json.type)\n throw new RangeError(\"Invalid input for Selection.fromJSON\");\n let cls = classesById[json.type];\n if (!cls)\n throw new RangeError(`No selection type ${json.type} defined`);\n return cls.fromJSON(doc, json);\n }\n /**\n To be able to deserialize selections from JSON, custom selection\n classes must register themselves with an ID string, so that they\n can be disambiguated. Try to pick something that's unlikely to\n clash with classes from other modules.\n */\n static jsonID(id, selectionClass) {\n if (id in classesById)\n throw new RangeError(\"Duplicate use of selection JSON ID \" + id);\n classesById[id] = selectionClass;\n selectionClass.prototype.jsonID = id;\n return selectionClass;\n }\n /**\n Get a [bookmark](https://prosemirror.net/docs/ref/#state.SelectionBookmark) for this selection,\n which is a value that can be mapped without having access to a\n current document, and later resolved to a real selection for a\n given document again. (This is used mostly by the history to\n track and restore old selections.) The default implementation of\n this method just converts the selection to a text selection and\n returns the bookmark for that.\n */\n getBookmark() {\n return TextSelection.between(this.$anchor, this.$head).getBookmark();\n }\n}\nSelection.prototype.visible = true;\n/**\nRepresents a selected range in a document.\n*/\nclass SelectionRange {\n /**\n Create a range.\n */\n constructor(\n /**\n The lower bound of the range.\n */\n $from, \n /**\n The upper bound of the range.\n */\n $to) {\n this.$from = $from;\n this.$to = $to;\n }\n}\nlet warnedAboutTextSelection = false;\nfunction checkTextSelection($pos) {\n if (!warnedAboutTextSelection && !$pos.parent.inlineContent) {\n warnedAboutTextSelection = true;\n console[\"warn\"](\"TextSelection endpoint not pointing into a node with inline content (\" + $pos.parent.type.name + \")\");\n }\n}\n/**\nA text selection represents a classical editor selection, with a\nhead (the moving side) and anchor (immobile side), both of which\npoint into textblock nodes. It can be empty (a regular cursor\nposition).\n*/\nclass TextSelection extends Selection {\n /**\n Construct a text selection between the given points.\n */\n constructor($anchor, $head = $anchor) {\n checkTextSelection($anchor);\n checkTextSelection($head);\n super($anchor, $head);\n }\n /**\n Returns a resolved position if this is a cursor selection (an\n empty text selection), and null otherwise.\n */\n get $cursor() { return this.$anchor.pos == this.$head.pos ? this.$head : null; }\n map(doc, mapping) {\n let $head = doc.resolve(mapping.map(this.head));\n if (!$head.parent.inlineContent)\n return Selection.near($head);\n let $anchor = doc.resolve(mapping.map(this.anchor));\n return new TextSelection($anchor.parent.inlineContent ? $anchor : $head, $head);\n }\n replace(tr, content = Slice.empty) {\n super.replace(tr, content);\n if (content == Slice.empty) {\n let marks = this.$from.marksAcross(this.$to);\n if (marks)\n tr.ensureMarks(marks);\n }\n }\n eq(other) {\n return other instanceof TextSelection && other.anchor == this.anchor && other.head == this.head;\n }\n getBookmark() {\n return new TextBookmark(this.anchor, this.head);\n }\n toJSON() {\n return { type: \"text\", anchor: this.anchor, head: this.head };\n }\n /**\n @internal\n */\n static fromJSON(doc, json) {\n if (typeof json.anchor != \"number\" || typeof json.head != \"number\")\n throw new RangeError(\"Invalid input for TextSelection.fromJSON\");\n return new TextSelection(doc.resolve(json.anchor), doc.resolve(json.head));\n }\n /**\n Create a text selection from non-resolved positions.\n */\n static create(doc, anchor, head = anchor) {\n let $anchor = doc.resolve(anchor);\n return new this($anchor, head == anchor ? $anchor : doc.resolve(head));\n }\n /**\n Return a text selection that spans the given positions or, if\n they aren't text positions, find a text selection near them.\n `bias` determines whether the method searches forward (default)\n or backwards (negative number) first. Will fall back to calling\n [`Selection.near`](https://prosemirror.net/docs/ref/#state.Selection^near) when the document\n doesn't contain a valid text position.\n */\n static between($anchor, $head, bias) {\n let dPos = $anchor.pos - $head.pos;\n if (!bias || dPos)\n bias = dPos >= 0 ? 1 : -1;\n if (!$head.parent.inlineContent) {\n let found = Selection.findFrom($head, bias, true) || Selection.findFrom($head, -bias, true);\n if (found)\n $head = found.$head;\n else\n return Selection.near($head, bias);\n }\n if (!$anchor.parent.inlineContent) {\n if (dPos == 0) {\n $anchor = $head;\n }\n else {\n $anchor = (Selection.findFrom($anchor, -bias, true) || Selection.findFrom($anchor, bias, true)).$anchor;\n if (($anchor.pos < $head.pos) != (dPos < 0))\n $anchor = $head;\n }\n }\n return new TextSelection($anchor, $head);\n }\n}\nSelection.jsonID(\"text\", TextSelection);\nclass TextBookmark {\n constructor(anchor, head) {\n this.anchor = anchor;\n this.head = head;\n }\n map(mapping) {\n return new TextBookmark(mapping.map(this.anchor), mapping.map(this.head));\n }\n resolve(doc) {\n return TextSelection.between(doc.resolve(this.anchor), doc.resolve(this.head));\n }\n}\n/**\nA node selection is a selection that points at a single node. All\nnodes marked [selectable](https://prosemirror.net/docs/ref/#model.NodeSpec.selectable) can be the\ntarget of a node selection. In such a selection, `from` and `to`\npoint directly before and after the selected node, `anchor` equals\n`from`, and `head` equals `to`..\n*/\nclass NodeSelection extends Selection {\n /**\n Create a node selection. Does not verify the validity of its\n argument.\n */\n constructor($pos) {\n let node = $pos.nodeAfter;\n let $end = $pos.node(0).resolve($pos.pos + node.nodeSize);\n super($pos, $end);\n this.node = node;\n }\n map(doc, mapping) {\n let { deleted, pos } = mapping.mapResult(this.anchor);\n let $pos = doc.resolve(pos);\n if (deleted)\n return Selection.near($pos);\n return new NodeSelection($pos);\n }\n content() {\n return new Slice(Fragment.from(this.node), 0, 0);\n }\n eq(other) {\n return other instanceof NodeSelection && other.anchor == this.anchor;\n }\n toJSON() {\n return { type: \"node\", anchor: this.anchor };\n }\n getBookmark() { return new NodeBookmark(this.anchor); }\n /**\n @internal\n */\n static fromJSON(doc, json) {\n if (typeof json.anchor != \"number\")\n throw new RangeError(\"Invalid input for NodeSelection.fromJSON\");\n return new NodeSelection(doc.resolve(json.anchor));\n }\n /**\n Create a node selection from non-resolved positions.\n */\n static create(doc, from) {\n return new NodeSelection(doc.resolve(from));\n }\n /**\n Determines whether the given node may be selected as a node\n selection.\n */\n static isSelectable(node) {\n return !node.isText && node.type.spec.selectable !== false;\n }\n}\nNodeSelection.prototype.visible = false;\nSelection.jsonID(\"node\", NodeSelection);\nclass NodeBookmark {\n constructor(anchor) {\n this.anchor = anchor;\n }\n map(mapping) {\n let { deleted, pos } = mapping.mapResult(this.anchor);\n return deleted ? new TextBookmark(pos, pos) : new NodeBookmark(pos);\n }\n resolve(doc) {\n let $pos = doc.resolve(this.anchor), node = $pos.nodeAfter;\n if (node && NodeSelection.isSelectable(node))\n return new NodeSelection($pos);\n return Selection.near($pos);\n }\n}\n/**\nA selection type that represents selecting the whole document\n(which can not necessarily be expressed with a text selection, when\nthere are for example leaf block nodes at the start or end of the\ndocument).\n*/\nclass AllSelection extends Selection {\n /**\n Create an all-selection over the given document.\n */\n constructor(doc) {\n super(doc.resolve(0), doc.resolve(doc.content.size));\n }\n replace(tr, content = Slice.empty) {\n if (content == Slice.empty) {\n tr.delete(0, tr.doc.content.size);\n let sel = Selection.atStart(tr.doc);\n if (!sel.eq(tr.selection))\n tr.setSelection(sel);\n }\n else {\n super.replace(tr, content);\n }\n }\n toJSON() { return { type: \"all\" }; }\n /**\n @internal\n */\n static fromJSON(doc) { return new AllSelection(doc); }\n map(doc) { return new AllSelection(doc); }\n eq(other) { return other instanceof AllSelection; }\n getBookmark() { return AllBookmark; }\n}\nSelection.jsonID(\"all\", AllSelection);\nconst AllBookmark = {\n map() { return this; },\n resolve(doc) { return new AllSelection(doc); }\n};\n// FIXME we'll need some awareness of text direction when scanning for selections\n// Try to find a selection inside the given node. `pos` points at the\n// position where the search starts. When `text` is true, only return\n// text selections.\nfunction findSelectionIn(doc, node, pos, index, dir, text = false) {\n if (node.inlineContent)\n return TextSelection.create(doc, pos);\n for (let i = index - (dir > 0 ? 0 : 1); dir > 0 ? i < node.childCount : i >= 0; i += dir) {\n let child = node.child(i);\n if (!child.isAtom) {\n let inner = findSelectionIn(doc, child, pos + dir, dir < 0 ? child.childCount : 0, dir, text);\n if (inner)\n return inner;\n }\n else if (!text && NodeSelection.isSelectable(child)) {\n return NodeSelection.create(doc, pos - (dir < 0 ? child.nodeSize : 0));\n }\n pos += child.nodeSize * dir;\n }\n return null;\n}\nfunction selectionToInsertionEnd(tr, startLen, bias) {\n let last = tr.steps.length - 1;\n if (last < startLen)\n return;\n let step = tr.steps[last];\n if (!(step instanceof ReplaceStep || step instanceof ReplaceAroundStep))\n return;\n let map = tr.mapping.maps[last], end;\n map.forEach((_from, _to, _newFrom, newTo) => { if (end == null)\n end = newTo; });\n tr.setSelection(Selection.near(tr.doc.resolve(end), bias));\n}\n\nconst UPDATED_SEL = 1, UPDATED_MARKS = 2, UPDATED_SCROLL = 4;\n/**\nAn editor state transaction, which can be applied to a state to\ncreate an updated state. Use\n[`EditorState.tr`](https://prosemirror.net/docs/ref/#state.EditorState.tr) to create an instance.\n\nTransactions track changes to the document (they are a subclass of\n[`Transform`](https://prosemirror.net/docs/ref/#transform.Transform)), but also other state changes,\nlike selection updates and adjustments of the set of [stored\nmarks](https://prosemirror.net/docs/ref/#state.EditorState.storedMarks). In addition, you can store\nmetadata properties in a transaction, which are extra pieces of\ninformation that client code or plugins can use to describe what a\ntransaction represents, so that they can update their [own\nstate](https://prosemirror.net/docs/ref/#state.StateField) accordingly.\n\nThe [editor view](https://prosemirror.net/docs/ref/#view.EditorView) uses a few metadata properties:\nit will attach a property `\"pointer\"` with the value `true` to\nselection transactions directly caused by mouse or touch input, and\na `\"uiEvent\"` property of that may be `\"paste\"`, `\"cut\"`, or `\"drop\"`.\n*/\nclass Transaction extends Transform {\n /**\n @internal\n */\n constructor(state) {\n super(state.doc);\n // The step count for which the current selection is valid.\n this.curSelectionFor = 0;\n // Bitfield to track which aspects of the state were updated by\n // this transaction.\n this.updated = 0;\n // Object used to store metadata properties for the transaction.\n this.meta = Object.create(null);\n this.time = Date.now();\n this.curSelection = state.selection;\n this.storedMarks = state.storedMarks;\n }\n /**\n The transaction's current selection. This defaults to the editor\n selection [mapped](https://prosemirror.net/docs/ref/#state.Selection.map) through the steps in the\n transaction, but can be overwritten with\n [`setSelection`](https://prosemirror.net/docs/ref/#state.Transaction.setSelection).\n */\n get selection() {\n if (this.curSelectionFor < this.steps.length) {\n this.curSelection = this.curSelection.map(this.doc, this.mapping.slice(this.curSelectionFor));\n this.curSelectionFor = this.steps.length;\n }\n return this.curSelection;\n }\n /**\n Update the transaction's current selection. Will determine the\n selection that the editor gets when the transaction is applied.\n */\n setSelection(selection) {\n if (selection.$from.doc != this.doc)\n throw new RangeError(\"Selection passed to setSelection must point at the current document\");\n this.curSelection = selection;\n this.curSelectionFor = this.steps.length;\n this.updated = (this.updated | UPDATED_SEL) & ~UPDATED_MARKS;\n this.storedMarks = null;\n return this;\n }\n /**\n Whether the selection was explicitly updated by this transaction.\n */\n get selectionSet() {\n return (this.updated & UPDATED_SEL) > 0;\n }\n /**\n Set the current stored marks.\n */\n setStoredMarks(marks) {\n this.storedMarks = marks;\n this.updated |= UPDATED_MARKS;\n return this;\n }\n /**\n Make sure the current stored marks or, if that is null, the marks\n at the selection, match the given set of marks. Does nothing if\n this is already the case.\n */\n ensureMarks(marks) {\n if (!Mark.sameSet(this.storedMarks || this.selection.$from.marks(), marks))\n this.setStoredMarks(marks);\n return this;\n }\n /**\n Add a mark to the set of stored marks.\n */\n addStoredMark(mark) {\n return this.ensureMarks(mark.addToSet(this.storedMarks || this.selection.$head.marks()));\n }\n /**\n Remove a mark or mark type from the set of stored marks.\n */\n removeStoredMark(mark) {\n return this.ensureMarks(mark.removeFromSet(this.storedMarks || this.selection.$head.marks()));\n }\n /**\n Whether the stored marks were explicitly set for this transaction.\n */\n get storedMarksSet() {\n return (this.updated & UPDATED_MARKS) > 0;\n }\n /**\n @internal\n */\n addStep(step, doc) {\n super.addStep(step, doc);\n this.updated = this.updated & ~UPDATED_MARKS;\n this.storedMarks = null;\n }\n /**\n Update the timestamp for the transaction.\n */\n setTime(time) {\n this.time = time;\n return this;\n }\n /**\n Replace the current selection with the given slice.\n */\n replaceSelection(slice) {\n this.selection.replace(this, slice);\n return this;\n }\n /**\n Replace the selection with the given node. When `inheritMarks` is\n true and the content is inline, it inherits the marks from the\n place where it is inserted.\n */\n replaceSelectionWith(node, inheritMarks = true) {\n let selection = this.selection;\n if (inheritMarks)\n node = node.mark(this.storedMarks || (selection.empty ? selection.$from.marks() : (selection.$from.marksAcross(selection.$to) || Mark.none)));\n selection.replaceWith(this, node);\n return this;\n }\n /**\n Delete the selection.\n */\n deleteSelection() {\n this.selection.replace(this);\n return this;\n }\n /**\n Replace the given range, or the selection if no range is given,\n with a text node containing the given string.\n */\n insertText(text, from, to) {\n let schema = this.doc.type.schema;\n if (from == null) {\n if (!text)\n return this.deleteSelection();\n return this.replaceSelectionWith(schema.text(text), true);\n }\n else {\n if (to == null)\n to = from;\n to = to == null ? from : to;\n if (!text)\n return this.deleteRange(from, to);\n let marks = this.storedMarks;\n if (!marks) {\n let $from = this.doc.resolve(from);\n marks = to == from ? $from.marks() : $from.marksAcross(this.doc.resolve(to));\n }\n this.replaceRangeWith(from, to, schema.text(text, marks));\n if (!this.selection.empty)\n this.setSelection(Selection.near(this.selection.$to));\n return this;\n }\n }\n /**\n Store a metadata property in this transaction, keyed either by\n name or by plugin.\n */\n setMeta(key, value) {\n this.meta[typeof key == \"string\" ? key : key.key] = value;\n return this;\n }\n /**\n Retrieve a metadata property for a given name or plugin.\n */\n getMeta(key) {\n return this.meta[typeof key == \"string\" ? key : key.key];\n }\n /**\n Returns true if this transaction doesn't contain any metadata,\n and can thus safely be extended.\n */\n get isGeneric() {\n for (let _ in this.meta)\n return false;\n return true;\n }\n /**\n Indicate that the editor should scroll the selection into view\n when updated to the state produced by this transaction.\n */\n scrollIntoView() {\n this.updated |= UPDATED_SCROLL;\n return this;\n }\n /**\n True when this transaction has had `scrollIntoView` called on it.\n */\n get scrolledIntoView() {\n return (this.updated & UPDATED_SCROLL) > 0;\n }\n}\n\nfunction bind(f, self) {\n return !self || !f ? f : f.bind(self);\n}\nclass FieldDesc {\n constructor(name, desc, self) {\n this.name = name;\n this.init = bind(desc.init, self);\n this.apply = bind(desc.apply, self);\n }\n}\nconst baseFields = [\n new FieldDesc(\"doc\", {\n init(config) { return config.doc || config.schema.topNodeType.createAndFill(); },\n apply(tr) { return tr.doc; }\n }),\n new FieldDesc(\"selection\", {\n init(config, instance) { return config.selection || Selection.atStart(instance.doc); },\n apply(tr) { return tr.selection; }\n }),\n new FieldDesc(\"storedMarks\", {\n init(config) { return config.storedMarks || null; },\n apply(tr, _marks, _old, state) { return state.selection.$cursor ? tr.storedMarks : null; }\n }),\n new FieldDesc(\"scrollToSelection\", {\n init() { return 0; },\n apply(tr, prev) { return tr.scrolledIntoView ? prev + 1 : prev; }\n })\n];\n// Object wrapping the part of a state object that stays the same\n// across transactions. Stored in the state's `config` property.\nclass Configuration {\n constructor(schema, plugins) {\n this.schema = schema;\n this.plugins = [];\n this.pluginsByKey = Object.create(null);\n this.fields = baseFields.slice();\n if (plugins)\n plugins.forEach(plugin => {\n if (this.pluginsByKey[plugin.key])\n throw new RangeError(\"Adding different instances of a keyed plugin (\" + plugin.key + \")\");\n this.plugins.push(plugin);\n this.pluginsByKey[plugin.key] = plugin;\n if (plugin.spec.state)\n this.fields.push(new FieldDesc(plugin.key, plugin.spec.state, plugin));\n });\n }\n}\n/**\nThe state of a ProseMirror editor is represented by an object of\nthis type. A state is a persistent data structure—it isn't\nupdated, but rather a new state value is computed from an old one\nusing the [`apply`](https://prosemirror.net/docs/ref/#state.EditorState.apply) method.\n\nA state holds a number of built-in fields, and plugins can\n[define](https://prosemirror.net/docs/ref/#state.PluginSpec.state) additional fields.\n*/\nclass EditorState {\n /**\n @internal\n */\n constructor(\n /**\n @internal\n */\n config) {\n this.config = config;\n }\n /**\n The schema of the state's document.\n */\n get schema() {\n return this.config.schema;\n }\n /**\n The plugins that are active in this state.\n */\n get plugins() {\n return this.config.plugins;\n }\n /**\n Apply the given transaction to produce a new state.\n */\n apply(tr) {\n return this.applyTransaction(tr).state;\n }\n /**\n @ignore\n */\n filterTransaction(tr, ignore = -1) {\n for (let i = 0; i < this.config.plugins.length; i++)\n if (i != ignore) {\n let plugin = this.config.plugins[i];\n if (plugin.spec.filterTransaction && !plugin.spec.filterTransaction.call(plugin, tr, this))\n return false;\n }\n return true;\n }\n /**\n Verbose variant of [`apply`](https://prosemirror.net/docs/ref/#state.EditorState.apply) that\n returns the precise transactions that were applied (which might\n be influenced by the [transaction\n hooks](https://prosemirror.net/docs/ref/#state.PluginSpec.filterTransaction) of\n plugins) along with the new state.\n */\n applyTransaction(rootTr) {\n if (!this.filterTransaction(rootTr))\n return { state: this, transactions: [] };\n let trs = [rootTr], newState = this.applyInner(rootTr), seen = null;\n // This loop repeatedly gives plugins a chance to respond to\n // transactions as new transactions are added, making sure to only\n // pass the transactions the plugin did not see before.\n for (;;) {\n let haveNew = false;\n for (let i = 0; i < this.config.plugins.length; i++) {\n let plugin = this.config.plugins[i];\n if (plugin.spec.appendTransaction) {\n let n = seen ? seen[i].n : 0, oldState = seen ? seen[i].state : this;\n let tr = n < trs.length &&\n plugin.spec.appendTransaction.call(plugin, n ? trs.slice(n) : trs, oldState, newState);\n if (tr && newState.filterTransaction(tr, i)) {\n tr.setMeta(\"appendedTransaction\", rootTr);\n if (!seen) {\n seen = [];\n for (let j = 0; j < this.config.plugins.length; j++)\n seen.push(j < i ? { state: newState, n: trs.length } : { state: this, n: 0 });\n }\n trs.push(tr);\n newState = newState.applyInner(tr);\n haveNew = true;\n }\n if (seen)\n seen[i] = { state: newState, n: trs.length };\n }\n }\n if (!haveNew)\n return { state: newState, transactions: trs };\n }\n }\n /**\n @internal\n */\n applyInner(tr) {\n if (!tr.before.eq(this.doc))\n throw new RangeError(\"Applying a mismatched transaction\");\n let newInstance = new EditorState(this.config), fields = this.config.fields;\n for (let i = 0; i < fields.length; i++) {\n let field = fields[i];\n newInstance[field.name] = field.apply(tr, this[field.name], this, newInstance);\n }\n return newInstance;\n }\n /**\n Start a [transaction](https://prosemirror.net/docs/ref/#state.Transaction) from this state.\n */\n get tr() { return new Transaction(this); }\n /**\n Create a new state.\n */\n static create(config) {\n let $config = new Configuration(config.doc ? config.doc.type.schema : config.schema, config.plugins);\n let instance = new EditorState($config);\n for (let i = 0; i < $config.fields.length; i++)\n instance[$config.fields[i].name] = $config.fields[i].init(config, instance);\n return instance;\n }\n /**\n Create a new state based on this one, but with an adjusted set\n of active plugins. State fields that exist in both sets of\n plugins are kept unchanged. Those that no longer exist are\n dropped, and those that are new are initialized using their\n [`init`](https://prosemirror.net/docs/ref/#state.StateField.init) method, passing in the new\n configuration object..\n */\n reconfigure(config) {\n let $config = new Configuration(this.schema, config.plugins);\n let fields = $config.fields, instance = new EditorState($config);\n for (let i = 0; i < fields.length; i++) {\n let name = fields[i].name;\n instance[name] = this.hasOwnProperty(name) ? this[name] : fields[i].init(config, instance);\n }\n return instance;\n }\n /**\n Serialize this state to JSON. If you want to serialize the state\n of plugins, pass an object mapping property names to use in the\n resulting JSON object to plugin objects. The argument may also be\n a string or number, in which case it is ignored, to support the\n way `JSON.stringify` calls `toString` methods.\n */\n toJSON(pluginFields) {\n let result = { doc: this.doc.toJSON(), selection: this.selection.toJSON() };\n if (this.storedMarks)\n result.storedMarks = this.storedMarks.map(m => m.toJSON());\n if (pluginFields && typeof pluginFields == 'object')\n for (let prop in pluginFields) {\n if (prop == \"doc\" || prop == \"selection\")\n throw new RangeError(\"The JSON fields `doc` and `selection` are reserved\");\n let plugin = pluginFields[prop], state = plugin.spec.state;\n if (state && state.toJSON)\n result[prop] = state.toJSON.call(plugin, this[plugin.key]);\n }\n return result;\n }\n /**\n Deserialize a JSON representation of a state. `config` should\n have at least a `schema` field, and should contain array of\n plugins to initialize the state with. `pluginFields` can be used\n to deserialize the state of plugins, by associating plugin\n instances with the property names they use in the JSON object.\n */\n static fromJSON(config, json, pluginFields) {\n if (!json)\n throw new RangeError(\"Invalid input for EditorState.fromJSON\");\n if (!config.schema)\n throw new RangeError(\"Required config field 'schema' missing\");\n let $config = new Configuration(config.schema, config.plugins);\n let instance = new EditorState($config);\n $config.fields.forEach(field => {\n if (field.name == \"doc\") {\n instance.doc = Node.fromJSON(config.schema, json.doc);\n }\n else if (field.name == \"selection\") {\n instance.selection = Selection.fromJSON(instance.doc, json.selection);\n }\n else if (field.name == \"storedMarks\") {\n if (json.storedMarks)\n instance.storedMarks = json.storedMarks.map(config.schema.markFromJSON);\n }\n else {\n if (pluginFields)\n for (let prop in pluginFields) {\n let plugin = pluginFields[prop], state = plugin.spec.state;\n if (plugin.key == field.name && state && state.fromJSON &&\n Object.prototype.hasOwnProperty.call(json, prop)) {\n instance[field.name] = state.fromJSON.call(plugin, config, json[prop], instance);\n return;\n }\n }\n instance[field.name] = field.init(config, instance);\n }\n });\n return instance;\n }\n}\n\nfunction bindProps(obj, self, target) {\n for (let prop in obj) {\n let val = obj[prop];\n if (val instanceof Function)\n val = val.bind(self);\n else if (prop == \"handleDOMEvents\")\n val = bindProps(val, self, {});\n target[prop] = val;\n }\n return target;\n}\n/**\nPlugins bundle functionality that can be added to an editor.\nThey are part of the [editor state](https://prosemirror.net/docs/ref/#state.EditorState) and\nmay influence that state and the view that contains it.\n*/\nclass Plugin {\n /**\n Create a plugin.\n */\n constructor(\n /**\n The plugin's [spec object](https://prosemirror.net/docs/ref/#state.PluginSpec).\n */\n spec) {\n this.spec = spec;\n /**\n The [props](https://prosemirror.net/docs/ref/#view.EditorProps) exported by this plugin.\n */\n this.props = {};\n if (spec.props)\n bindProps(spec.props, this, this.props);\n this.key = spec.key ? spec.key.key : createKey(\"plugin\");\n }\n /**\n Extract the plugin's state field from an editor state.\n */\n getState(state) { return state[this.key]; }\n}\nconst keys = Object.create(null);\nfunction createKey(name) {\n if (name in keys)\n return name + \"$\" + ++keys[name];\n keys[name] = 0;\n return name + \"$\";\n}\n/**\nA key is used to [tag](https://prosemirror.net/docs/ref/#state.PluginSpec.key) plugins in a way\nthat makes it possible to find them, given an editor state.\nAssigning a key does mean only one plugin of that type can be\nactive in a state.\n*/\nclass PluginKey {\n /**\n Create a plugin key.\n */\n constructor(name = \"key\") { this.key = createKey(name); }\n /**\n Get the active plugin with this key, if any, from an editor\n state.\n */\n get(state) { return state.config.pluginsByKey[this.key]; }\n /**\n Get the plugin's state from an editor state.\n */\n getState(state) { return state[this.key]; }\n}\n\nexport { AllSelection, EditorState, NodeSelection, Plugin, PluginKey, Selection, SelectionRange, TextSelection, Transaction };\n","import { TextSelection, NodeSelection, Selection, AllSelection } from 'prosemirror-state';\nimport { DOMSerializer, Fragment, Mark, Slice, DOMParser } from 'prosemirror-model';\nimport { dropPoint } from 'prosemirror-transform';\n\nconst nav = typeof navigator != \"undefined\" ? navigator : null;\nconst doc = typeof document != \"undefined\" ? document : null;\nconst agent = (nav && nav.userAgent) || \"\";\nconst ie_edge = /Edge\\/(\\d+)/.exec(agent);\nconst ie_upto10 = /MSIE \\d/.exec(agent);\nconst ie_11up = /Trident\\/(?:[7-9]|\\d{2,})\\..*rv:(\\d+)/.exec(agent);\nconst ie = !!(ie_upto10 || ie_11up || ie_edge);\nconst ie_version = ie_upto10 ? document.documentMode : ie_11up ? +ie_11up[1] : ie_edge ? +ie_edge[1] : 0;\nconst gecko = !ie && /gecko\\/(\\d+)/i.test(agent);\ngecko && +(/Firefox\\/(\\d+)/.exec(agent) || [0, 0])[1];\nconst _chrome = !ie && /Chrome\\/(\\d+)/.exec(agent);\nconst chrome = !!_chrome;\nconst chrome_version = _chrome ? +_chrome[1] : 0;\nconst safari = !ie && !!nav && /Apple Computer/.test(nav.vendor);\n// Is true for both iOS and iPadOS for convenience\nconst ios = safari && (/Mobile\\/\\w+/.test(agent) || !!nav && nav.maxTouchPoints > 2);\nconst mac = ios || (nav ? /Mac/.test(nav.platform) : false);\nconst android = /Android \\d/.test(agent);\nconst webkit = !!doc && \"webkitFontSmoothing\" in doc.documentElement.style;\nconst webkit_version = webkit ? +(/\\bAppleWebKit\\/(\\d+)/.exec(navigator.userAgent) || [0, 0])[1] : 0;\n\nconst domIndex = function (node) {\n for (var index = 0;; index++) {\n node = node.previousSibling;\n if (!node)\n return index;\n }\n};\nconst parentNode = function (node) {\n let parent = node.assignedSlot || node.parentNode;\n return parent && parent.nodeType == 11 ? parent.host : parent;\n};\nlet reusedRange = null;\n// Note that this will always return the same range, because DOM range\n// objects are every expensive, and keep slowing down subsequent DOM\n// updates, for some reason.\nconst textRange = function (node, from, to) {\n let range = reusedRange || (reusedRange = document.createRange());\n range.setEnd(node, to == null ? node.nodeValue.length : to);\n range.setStart(node, from || 0);\n return range;\n};\n// Scans forward and backward through DOM positions equivalent to the\n// given one to see if the two are in the same place (i.e. after a\n// text node vs at the end of that text node)\nconst isEquivalentPosition = function (node, off, targetNode, targetOff) {\n return targetNode && (scanFor(node, off, targetNode, targetOff, -1) ||\n scanFor(node, off, targetNode, targetOff, 1));\n};\nconst atomElements = /^(img|br|input|textarea|hr)$/i;\nfunction scanFor(node, off, targetNode, targetOff, dir) {\n for (;;) {\n if (node == targetNode && off == targetOff)\n return true;\n if (off == (dir < 0 ? 0 : nodeSize(node))) {\n let parent = node.parentNode;\n if (!parent || parent.nodeType != 1 || hasBlockDesc(node) || atomElements.test(node.nodeName) ||\n node.contentEditable == \"false\")\n return false;\n off = domIndex(node) + (dir < 0 ? 0 : 1);\n node = parent;\n }\n else if (node.nodeType == 1) {\n node = node.childNodes[off + (dir < 0 ? -1 : 0)];\n if (node.contentEditable == \"false\")\n return false;\n off = dir < 0 ? nodeSize(node) : 0;\n }\n else {\n return false;\n }\n }\n}\nfunction nodeSize(node) {\n return node.nodeType == 3 ? node.nodeValue.length : node.childNodes.length;\n}\nfunction isOnEdge(node, offset, parent) {\n for (let atStart = offset == 0, atEnd = offset == nodeSize(node); atStart || atEnd;) {\n if (node == parent)\n return true;\n let index = domIndex(node);\n node = node.parentNode;\n if (!node)\n return false;\n atStart = atStart && index == 0;\n atEnd = atEnd && index == nodeSize(node);\n }\n}\nfunction hasBlockDesc(dom) {\n let desc;\n for (let cur = dom; cur; cur = cur.parentNode)\n if (desc = cur.pmViewDesc)\n break;\n return desc && desc.node && desc.node.isBlock && (desc.dom == dom || desc.contentDOM == dom);\n}\n// Work around Chrome issue https://bugs.chromium.org/p/chromium/issues/detail?id=447523\n// (isCollapsed inappropriately returns true in shadow dom)\nconst selectionCollapsed = function (domSel) {\n let collapsed = domSel.isCollapsed;\n if (collapsed && chrome && domSel.rangeCount && !domSel.getRangeAt(0).collapsed)\n collapsed = false;\n return collapsed;\n};\nfunction keyEvent(keyCode, key) {\n let event = document.createEvent(\"Event\");\n event.initEvent(\"keydown\", true, true);\n event.keyCode = keyCode;\n event.key = event.code = key;\n return event;\n}\n\nfunction windowRect(doc) {\n return { left: 0, right: doc.documentElement.clientWidth,\n top: 0, bottom: doc.documentElement.clientHeight };\n}\nfunction getSide(value, side) {\n return typeof value == \"number\" ? value : value[side];\n}\nfunction clientRect(node) {\n let rect = node.getBoundingClientRect();\n // Adjust for elements with style \"transform: scale()\"\n let scaleX = (rect.width / node.offsetWidth) || 1;\n let scaleY = (rect.height / node.offsetHeight) || 1;\n // Make sure scrollbar width isn't included in the rectangle\n return { left: rect.left, right: rect.left + node.clientWidth * scaleX,\n top: rect.top, bottom: rect.top + node.clientHeight * scaleY };\n}\nfunction scrollRectIntoView(view, rect, startDOM) {\n let scrollThreshold = view.someProp(\"scrollThreshold\") || 0, scrollMargin = view.someProp(\"scrollMargin\") || 5;\n let doc = view.dom.ownerDocument;\n for (let parent = startDOM || view.dom;; parent = parentNode(parent)) {\n if (!parent)\n break;\n if (parent.nodeType != 1)\n continue;\n let elt = parent;\n let atTop = elt == doc.body;\n let bounding = atTop ? windowRect(doc) : clientRect(elt);\n let moveX = 0, moveY = 0;\n if (rect.top < bounding.top + getSide(scrollThreshold, \"top\"))\n moveY = -(bounding.top - rect.top + getSide(scrollMargin, \"top\"));\n else if (rect.bottom > bounding.bottom - getSide(scrollThreshold, \"bottom\"))\n moveY = rect.bottom - bounding.bottom + getSide(scrollMargin, \"bottom\");\n if (rect.left < bounding.left + getSide(scrollThreshold, \"left\"))\n moveX = -(bounding.left - rect.left + getSide(scrollMargin, \"left\"));\n else if (rect.right > bounding.right - getSide(scrollThreshold, \"right\"))\n moveX = rect.right - bounding.right + getSide(scrollMargin, \"right\");\n if (moveX || moveY) {\n if (atTop) {\n doc.defaultView.scrollBy(moveX, moveY);\n }\n else {\n let startX = elt.scrollLeft, startY = elt.scrollTop;\n if (moveY)\n elt.scrollTop += moveY;\n if (moveX)\n elt.scrollLeft += moveX;\n let dX = elt.scrollLeft - startX, dY = elt.scrollTop - startY;\n rect = { left: rect.left - dX, top: rect.top - dY, right: rect.right - dX, bottom: rect.bottom - dY };\n }\n }\n if (atTop)\n break;\n }\n}\n// Store the scroll position of the editor's parent nodes, along with\n// the top position of an element near the top of the editor, which\n// will be used to make sure the visible viewport remains stable even\n// when the size of the content above changes.\nfunction storeScrollPos(view) {\n let rect = view.dom.getBoundingClientRect(), startY = Math.max(0, rect.top);\n let refDOM, refTop;\n for (let x = (rect.left + rect.right) / 2, y = startY + 1; y < Math.min(innerHeight, rect.bottom); y += 5) {\n let dom = view.root.elementFromPoint(x, y);\n if (!dom || dom == view.dom || !view.dom.contains(dom))\n continue;\n let localRect = dom.getBoundingClientRect();\n if (localRect.top >= startY - 20) {\n refDOM = dom;\n refTop = localRect.top;\n break;\n }\n }\n return { refDOM: refDOM, refTop: refTop, stack: scrollStack(view.dom) };\n}\nfunction scrollStack(dom) {\n let stack = [], doc = dom.ownerDocument;\n for (let cur = dom; cur; cur = parentNode(cur)) {\n stack.push({ dom: cur, top: cur.scrollTop, left: cur.scrollLeft });\n if (dom == doc)\n break;\n }\n return stack;\n}\n// Reset the scroll position of the editor's parent nodes to that what\n// it was before, when storeScrollPos was called.\nfunction resetScrollPos({ refDOM, refTop, stack }) {\n let newRefTop = refDOM ? refDOM.getBoundingClientRect().top : 0;\n restoreScrollStack(stack, newRefTop == 0 ? 0 : newRefTop - refTop);\n}\nfunction restoreScrollStack(stack, dTop) {\n for (let i = 0; i < stack.length; i++) {\n let { dom, top, left } = stack[i];\n if (dom.scrollTop != top + dTop)\n dom.scrollTop = top + dTop;\n if (dom.scrollLeft != left)\n dom.scrollLeft = left;\n }\n}\nlet preventScrollSupported = null;\n// Feature-detects support for .focus({preventScroll: true}), and uses\n// a fallback kludge when not supported.\nfunction focusPreventScroll(dom) {\n if (dom.setActive)\n return dom.setActive(); // in IE\n if (preventScrollSupported)\n return dom.focus(preventScrollSupported);\n let stored = scrollStack(dom);\n dom.focus(preventScrollSupported == null ? {\n get preventScroll() {\n preventScrollSupported = { preventScroll: true };\n return true;\n }\n } : undefined);\n if (!preventScrollSupported) {\n preventScrollSupported = false;\n restoreScrollStack(stored, 0);\n }\n}\nfunction findOffsetInNode(node, coords) {\n let closest, dxClosest = 2e8, coordsClosest, offset = 0;\n let rowBot = coords.top, rowTop = coords.top;\n for (let child = node.firstChild, childIndex = 0; child; child = child.nextSibling, childIndex++) {\n let rects;\n if (child.nodeType == 1)\n rects = child.getClientRects();\n else if (child.nodeType == 3)\n rects = textRange(child).getClientRects();\n else\n continue;\n for (let i = 0; i < rects.length; i++) {\n let rect = rects[i];\n if (rect.top <= rowBot && rect.bottom >= rowTop) {\n rowBot = Math.max(rect.bottom, rowBot);\n rowTop = Math.min(rect.top, rowTop);\n let dx = rect.left > coords.left ? rect.left - coords.left\n : rect.right < coords.left ? coords.left - rect.right : 0;\n if (dx < dxClosest) {\n closest = child;\n dxClosest = dx;\n coordsClosest = dx && closest.nodeType == 3 ? {\n left: rect.right < coords.left ? rect.right : rect.left,\n top: coords.top\n } : coords;\n if (child.nodeType == 1 && dx)\n offset = childIndex + (coords.left >= (rect.left + rect.right) / 2 ? 1 : 0);\n continue;\n }\n }\n if (!closest && (coords.left >= rect.right && coords.top >= rect.top ||\n coords.left >= rect.left && coords.top >= rect.bottom))\n offset = childIndex + 1;\n }\n }\n if (closest && closest.nodeType == 3)\n return findOffsetInText(closest, coordsClosest);\n if (!closest || (dxClosest && closest.nodeType == 1))\n return { node, offset };\n return findOffsetInNode(closest, coordsClosest);\n}\nfunction findOffsetInText(node, coords) {\n let len = node.nodeValue.length;\n let range = document.createRange();\n for (let i = 0; i < len; i++) {\n range.setEnd(node, i + 1);\n range.setStart(node, i);\n let rect = singleRect(range, 1);\n if (rect.top == rect.bottom)\n continue;\n if (inRect(coords, rect))\n return { node, offset: i + (coords.left >= (rect.left + rect.right) / 2 ? 1 : 0) };\n }\n return { node, offset: 0 };\n}\nfunction inRect(coords, rect) {\n return coords.left >= rect.left - 1 && coords.left <= rect.right + 1 &&\n coords.top >= rect.top - 1 && coords.top <= rect.bottom + 1;\n}\nfunction targetKludge(dom, coords) {\n let parent = dom.parentNode;\n if (parent && /^li$/i.test(parent.nodeName) && coords.left < dom.getBoundingClientRect().left)\n return parent;\n return dom;\n}\nfunction posFromElement(view, elt, coords) {\n let { node, offset } = findOffsetInNode(elt, coords), bias = -1;\n if (node.nodeType == 1 && !node.firstChild) {\n let rect = node.getBoundingClientRect();\n bias = rect.left != rect.right && coords.left > (rect.left + rect.right) / 2 ? 1 : -1;\n }\n return view.docView.posFromDOM(node, offset, bias);\n}\nfunction posFromCaret(view, node, offset, coords) {\n // Browser (in caretPosition/RangeFromPoint) will agressively\n // normalize towards nearby inline nodes. Since we are interested in\n // positions between block nodes too, we first walk up the hierarchy\n // of nodes to see if there are block nodes that the coordinates\n // fall outside of. If so, we take the position before/after that\n // block. If not, we call `posFromDOM` on the raw node/offset.\n let outside = -1;\n for (let cur = node;;) {\n if (cur == view.dom)\n break;\n let desc = view.docView.nearestDesc(cur, true);\n if (!desc)\n return null;\n if (desc.node.isBlock && desc.parent) {\n let rect = desc.dom.getBoundingClientRect();\n if (rect.left > coords.left || rect.top > coords.top)\n outside = desc.posBefore;\n else if (rect.right < coords.left || rect.bottom < coords.top)\n outside = desc.posAfter;\n else\n break;\n }\n cur = desc.dom.parentNode;\n }\n return outside > -1 ? outside : view.docView.posFromDOM(node, offset, 1);\n}\nfunction elementFromPoint(element, coords, box) {\n let len = element.childNodes.length;\n if (len && box.top < box.bottom) {\n for (let startI = Math.max(0, Math.min(len - 1, Math.floor(len * (coords.top - box.top) / (box.bottom - box.top)) - 2)), i = startI;;) {\n let child = element.childNodes[i];\n if (child.nodeType == 1) {\n let rects = child.getClientRects();\n for (let j = 0; j < rects.length; j++) {\n let rect = rects[j];\n if (inRect(coords, rect))\n return elementFromPoint(child, coords, rect);\n }\n }\n if ((i = (i + 1) % len) == startI)\n break;\n }\n }\n return element;\n}\n// Given an x,y position on the editor, get the position in the document.\nfunction posAtCoords(view, coords) {\n let doc = view.dom.ownerDocument, node, offset = 0;\n if (doc.caretPositionFromPoint) {\n try { // Firefox throws for this call in hard-to-predict circumstances (#994)\n let pos = doc.caretPositionFromPoint(coords.left, coords.top);\n if (pos)\n ({ offsetNode: node, offset } = pos);\n }\n catch (_) { }\n }\n if (!node && doc.caretRangeFromPoint) {\n let range = doc.caretRangeFromPoint(coords.left, coords.top);\n if (range)\n ({ startContainer: node, startOffset: offset } = range);\n }\n let elt = (view.root.elementFromPoint ? view.root : doc)\n .elementFromPoint(coords.left, coords.top);\n let pos;\n if (!elt || !view.dom.contains(elt.nodeType != 1 ? elt.parentNode : elt)) {\n let box = view.dom.getBoundingClientRect();\n if (!inRect(coords, box))\n return null;\n elt = elementFromPoint(view.dom, coords, box);\n if (!elt)\n return null;\n }\n // Safari's caretRangeFromPoint returns nonsense when on a draggable element\n if (safari) {\n for (let p = elt; node && p; p = parentNode(p))\n if (p.draggable)\n node = undefined;\n }\n elt = targetKludge(elt, coords);\n if (node) {\n if (gecko && node.nodeType == 1) {\n // Firefox will sometimes return offsets into <input> nodes, which\n // have no actual children, from caretPositionFromPoint (#953)\n offset = Math.min(offset, node.childNodes.length);\n // It'll also move the returned position before image nodes,\n // even if those are behind it.\n if (offset < node.childNodes.length) {\n let next = node.childNodes[offset], box;\n if (next.nodeName == \"IMG\" && (box = next.getBoundingClientRect()).right <= coords.left &&\n box.bottom > coords.top)\n offset++;\n }\n }\n // Suspiciously specific kludge to work around caret*FromPoint\n // never returning a position at the end of the document\n if (node == view.dom && offset == node.childNodes.length - 1 && node.lastChild.nodeType == 1 &&\n coords.top > node.lastChild.getBoundingClientRect().bottom)\n pos = view.state.doc.content.size;\n // Ignore positions directly after a BR, since caret*FromPoint\n // 'round up' positions that would be more accurately placed\n // before the BR node.\n else if (offset == 0 || node.nodeType != 1 || node.childNodes[offset - 1].nodeName != \"BR\")\n pos = posFromCaret(view, node, offset, coords);\n }\n if (pos == null)\n pos = posFromElement(view, elt, coords);\n let desc = view.docView.nearestDesc(elt, true);\n return { pos, inside: desc ? desc.posAtStart - desc.border : -1 };\n}\nfunction singleRect(target, bias) {\n let rects = target.getClientRects();\n return !rects.length ? target.getBoundingClientRect() : rects[bias < 0 ? 0 : rects.length - 1];\n}\nconst BIDI = /[\\u0590-\\u05f4\\u0600-\\u06ff\\u0700-\\u08ac]/;\n// Given a position in the document model, get a bounding box of the\n// character at that position, relative to the window.\nfunction coordsAtPos(view, pos, side) {\n let { node, offset, atom } = view.docView.domFromPos(pos, side < 0 ? -1 : 1);\n let supportEmptyRange = webkit || gecko;\n if (node.nodeType == 3) {\n // These browsers support querying empty text ranges. Prefer that in\n // bidi context or when at the end of a node.\n if (supportEmptyRange && (BIDI.test(node.nodeValue) || (side < 0 ? !offset : offset == node.nodeValue.length))) {\n let rect = singleRect(textRange(node, offset, offset), side);\n // Firefox returns bad results (the position before the space)\n // when querying a position directly after line-broken\n // whitespace. Detect this situation and and kludge around it\n if (gecko && offset && /\\s/.test(node.nodeValue[offset - 1]) && offset < node.nodeValue.length) {\n let rectBefore = singleRect(textRange(node, offset - 1, offset - 1), -1);\n if (rectBefore.top == rect.top) {\n let rectAfter = singleRect(textRange(node, offset, offset + 1), -1);\n if (rectAfter.top != rect.top)\n return flattenV(rectAfter, rectAfter.left < rectBefore.left);\n }\n }\n return rect;\n }\n else {\n let from = offset, to = offset, takeSide = side < 0 ? 1 : -1;\n if (side < 0 && !offset) {\n to++;\n takeSide = -1;\n }\n else if (side >= 0 && offset == node.nodeValue.length) {\n from--;\n takeSide = 1;\n }\n else if (side < 0) {\n from--;\n }\n else {\n to++;\n }\n return flattenV(singleRect(textRange(node, from, to), takeSide), takeSide < 0);\n }\n }\n let $dom = view.state.doc.resolve(pos - (atom || 0));\n // Return a horizontal line in block context\n if (!$dom.parent.inlineContent) {\n if (atom == null && offset && (side < 0 || offset == nodeSize(node))) {\n let before = node.childNodes[offset - 1];\n if (before.nodeType == 1)\n return flattenH(before.getBoundingClientRect(), false);\n }\n if (atom == null && offset < nodeSize(node)) {\n let after = node.childNodes[offset];\n if (after.nodeType == 1)\n return flattenH(after.getBoundingClientRect(), true);\n }\n return flattenH(node.getBoundingClientRect(), side >= 0);\n }\n // Inline, not in text node (this is not Bidi-safe)\n if (atom == null && offset && (side < 0 || offset == nodeSize(node))) {\n let before = node.childNodes[offset - 1];\n let target = before.nodeType == 3 ? textRange(before, nodeSize(before) - (supportEmptyRange ? 0 : 1))\n // BR nodes tend to only return the rectangle before them.\n // Only use them if they are the last element in their parent\n : before.nodeType == 1 && (before.nodeName != \"BR\" || !before.nextSibling) ? before : null;\n if (target)\n return flattenV(singleRect(target, 1), false);\n }\n if (atom == null && offset < nodeSize(node)) {\n let after = node.childNodes[offset];\n while (after.pmViewDesc && after.pmViewDesc.ignoreForCoords)\n after = after.nextSibling;\n let target = !after ? null : after.nodeType == 3 ? textRange(after, 0, (supportEmptyRange ? 0 : 1))\n : after.nodeType == 1 ? after : null;\n if (target)\n return flattenV(singleRect(target, -1), true);\n }\n // All else failed, just try to get a rectangle for the target node\n return flattenV(singleRect(node.nodeType == 3 ? textRange(node) : node, -side), side >= 0);\n}\nfunction flattenV(rect, left) {\n if (rect.width == 0)\n return rect;\n let x = left ? rect.left : rect.right;\n return { top: rect.top, bottom: rect.bottom, left: x, right: x };\n}\nfunction flattenH(rect, top) {\n if (rect.height == 0)\n return rect;\n let y = top ? rect.top : rect.bottom;\n return { top: y, bottom: y, left: rect.left, right: rect.right };\n}\nfunction withFlushedState(view, state, f) {\n let viewState = view.state, active = view.root.activeElement;\n if (viewState != state)\n view.updateState(state);\n if (active != view.dom)\n view.focus();\n try {\n return f();\n }\n finally {\n if (viewState != state)\n view.updateState(viewState);\n if (active != view.dom && active)\n active.focus();\n }\n}\n// Whether vertical position motion in a given direction\n// from a position would leave a text block.\nfunction endOfTextblockVertical(view, state, dir) {\n let sel = state.selection;\n let $pos = dir == \"up\" ? sel.$from : sel.$to;\n return withFlushedState(view, state, () => {\n let { node: dom } = view.docView.domFromPos($pos.pos, dir == \"up\" ? -1 : 1);\n for (;;) {\n let nearest = view.docView.nearestDesc(dom, true);\n if (!nearest)\n break;\n if (nearest.node.isBlock) {\n dom = nearest.dom;\n break;\n }\n dom = nearest.dom.parentNode;\n }\n let coords = coordsAtPos(view, $pos.pos, 1);\n for (let child = dom.firstChild; child; child = child.nextSibling) {\n let boxes;\n if (child.nodeType == 1)\n boxes = child.getClientRects();\n else if (child.nodeType == 3)\n boxes = textRange(child, 0, child.nodeValue.length).getClientRects();\n else\n continue;\n for (let i = 0; i < boxes.length; i++) {\n let box = boxes[i];\n if (box.bottom > box.top + 1 &&\n (dir == \"up\" ? coords.top - box.top > (box.bottom - coords.top) * 2\n : box.bottom - coords.bottom > (coords.bottom - box.top) * 2))\n return false;\n }\n }\n return true;\n });\n}\nconst maybeRTL = /[\\u0590-\\u08ac]/;\nfunction endOfTextblockHorizontal(view, state, dir) {\n let { $head } = state.selection;\n if (!$head.parent.isTextblock)\n return false;\n let offset = $head.parentOffset, atStart = !offset, atEnd = offset == $head.parent.content.size;\n let sel = view.domSelection();\n // If the textblock is all LTR, or the browser doesn't support\n // Selection.modify (Edge), fall back to a primitive approach\n if (!maybeRTL.test($head.parent.textContent) || !sel.modify)\n return dir == \"left\" || dir == \"backward\" ? atStart : atEnd;\n return withFlushedState(view, state, () => {\n // This is a huge hack, but appears to be the best we can\n // currently do: use `Selection.modify` to move the selection by\n // one character, and see if that moves the cursor out of the\n // textblock (or doesn't move it at all, when at the start/end of\n // the document).\n let oldRange = sel.getRangeAt(0), oldNode = sel.focusNode, oldOff = sel.focusOffset;\n let oldBidiLevel = sel.caretBidiLevel // Only for Firefox\n ;\n sel.modify(\"move\", dir, \"character\");\n let parentDOM = $head.depth ? view.docView.domAfterPos($head.before()) : view.dom;\n let result = !parentDOM.contains(sel.focusNode.nodeType == 1 ? sel.focusNode : sel.focusNode.parentNode) ||\n (oldNode == sel.focusNode && oldOff == sel.focusOffset);\n // Restore the previous selection\n sel.removeAllRanges();\n sel.addRange(oldRange);\n if (oldBidiLevel != null)\n sel.caretBidiLevel = oldBidiLevel;\n return result;\n });\n}\nlet cachedState = null;\nlet cachedDir = null;\nlet cachedResult = false;\nfunction endOfTextblock(view, state, dir) {\n if (cachedState == state && cachedDir == dir)\n return cachedResult;\n cachedState = state;\n cachedDir = dir;\n return cachedResult = dir == \"up\" || dir == \"down\"\n ? endOfTextblockVertical(view, state, dir)\n : endOfTextblockHorizontal(view, state, dir);\n}\n\n// View descriptions are data structures that describe the DOM that is\n// used to represent the editor's content. They are used for:\n//\n// - Incremental redrawing when the document changes\n//\n// - Figuring out what part of the document a given DOM position\n// corresponds to\n//\n// - Wiring in custom implementations of the editing interface for a\n// given node\n//\n// They form a doubly-linked mutable tree, starting at `view.docView`.\nconst NOT_DIRTY = 0, CHILD_DIRTY = 1, CONTENT_DIRTY = 2, NODE_DIRTY = 3;\n// Superclass for the various kinds of descriptions. Defines their\n// basic structure and shared methods.\nclass ViewDesc {\n constructor(parent, children, dom, \n // This is the node that holds the child views. It may be null for\n // descs that don't have children.\n contentDOM) {\n this.parent = parent;\n this.children = children;\n this.dom = dom;\n this.contentDOM = contentDOM;\n this.dirty = NOT_DIRTY;\n // An expando property on the DOM node provides a link back to its\n // description.\n dom.pmViewDesc = this;\n }\n // Used to check whether a given description corresponds to a\n // widget/mark/node.\n matchesWidget(widget) { return false; }\n matchesMark(mark) { return false; }\n matchesNode(node, outerDeco, innerDeco) { return false; }\n matchesHack(nodeName) { return false; }\n // When parsing in-editor content (in domchange.js), we allow\n // descriptions to determine the parse rules that should be used to\n // parse them.\n parseRule() { return null; }\n // Used by the editor's event handler to ignore events that come\n // from certain descs.\n stopEvent(event) { return false; }\n // The size of the content represented by this desc.\n get size() {\n let size = 0;\n for (let i = 0; i < this.children.length; i++)\n size += this.children[i].size;\n return size;\n }\n // For block nodes, this represents the space taken up by their\n // start/end tokens.\n get border() { return 0; }\n destroy() {\n this.parent = undefined;\n if (this.dom.pmViewDesc == this)\n this.dom.pmViewDesc = undefined;\n for (let i = 0; i < this.children.length; i++)\n this.children[i].destroy();\n }\n posBeforeChild(child) {\n for (let i = 0, pos = this.posAtStart;; i++) {\n let cur = this.children[i];\n if (cur == child)\n return pos;\n pos += cur.size;\n }\n }\n get posBefore() {\n return this.parent.posBeforeChild(this);\n }\n get posAtStart() {\n return this.parent ? this.parent.posBeforeChild(this) + this.border : 0;\n }\n get posAfter() {\n return this.posBefore + this.size;\n }\n get posAtEnd() {\n return this.posAtStart + this.size - 2 * this.border;\n }\n localPosFromDOM(dom, offset, bias) {\n // If the DOM position is in the content, use the child desc after\n // it to figure out a position.\n if (this.contentDOM && this.contentDOM.contains(dom.nodeType == 1 ? dom : dom.parentNode)) {\n if (bias < 0) {\n let domBefore, desc;\n if (dom == this.contentDOM) {\n domBefore = dom.childNodes[offset - 1];\n }\n else {\n while (dom.parentNode != this.contentDOM)\n dom = dom.parentNode;\n domBefore = dom.previousSibling;\n }\n while (domBefore && !((desc = domBefore.pmViewDesc) && desc.parent == this))\n domBefore = domBefore.previousSibling;\n return domBefore ? this.posBeforeChild(desc) + desc.size : this.posAtStart;\n }\n else {\n let domAfter, desc;\n if (dom == this.contentDOM) {\n domAfter = dom.childNodes[offset];\n }\n else {\n while (dom.parentNode != this.contentDOM)\n dom = dom.parentNode;\n domAfter = dom.nextSibling;\n }\n while (domAfter && !((desc = domAfter.pmViewDesc) && desc.parent == this))\n domAfter = domAfter.nextSibling;\n return domAfter ? this.posBeforeChild(desc) : this.posAtEnd;\n }\n }\n // Otherwise, use various heuristics, falling back on the bias\n // parameter, to determine whether to return the position at the\n // start or at the end of this view desc.\n let atEnd;\n if (dom == this.dom && this.contentDOM) {\n atEnd = offset > domIndex(this.contentDOM);\n }\n else if (this.contentDOM && this.contentDOM != this.dom && this.dom.contains(this.contentDOM)) {\n atEnd = dom.compareDocumentPosition(this.contentDOM) & 2;\n }\n else if (this.dom.firstChild) {\n if (offset == 0)\n for (let search = dom;; search = search.parentNode) {\n if (search == this.dom) {\n atEnd = false;\n break;\n }\n if (search.previousSibling)\n break;\n }\n if (atEnd == null && offset == dom.childNodes.length)\n for (let search = dom;; search = search.parentNode) {\n if (search == this.dom) {\n atEnd = true;\n break;\n }\n if (search.nextSibling)\n break;\n }\n }\n return (atEnd == null ? bias > 0 : atEnd) ? this.posAtEnd : this.posAtStart;\n }\n // Scan up the dom finding the first desc that is a descendant of\n // this one.\n nearestDesc(dom, onlyNodes = false) {\n for (let first = true, cur = dom; cur; cur = cur.parentNode) {\n let desc = this.getDesc(cur), nodeDOM;\n if (desc && (!onlyNodes || desc.node)) {\n // If dom is outside of this desc's nodeDOM, don't count it.\n if (first && (nodeDOM = desc.nodeDOM) &&\n !(nodeDOM.nodeType == 1 ? nodeDOM.contains(dom.nodeType == 1 ? dom : dom.parentNode) : nodeDOM == dom))\n first = false;\n else\n return desc;\n }\n }\n }\n getDesc(dom) {\n let desc = dom.pmViewDesc;\n for (let cur = desc; cur; cur = cur.parent)\n if (cur == this)\n return desc;\n }\n posFromDOM(dom, offset, bias) {\n for (let scan = dom; scan; scan = scan.parentNode) {\n let desc = this.getDesc(scan);\n if (desc)\n return desc.localPosFromDOM(dom, offset, bias);\n }\n return -1;\n }\n // Find the desc for the node after the given pos, if any. (When a\n // parent node overrode rendering, there might not be one.)\n descAt(pos) {\n for (let i = 0, offset = 0; i < this.children.length; i++) {\n let child = this.children[i], end = offset + child.size;\n if (offset == pos && end != offset) {\n while (!child.border && child.children.length)\n child = child.children[0];\n return child;\n }\n if (pos < end)\n return child.descAt(pos - offset - child.border);\n offset = end;\n }\n }\n domFromPos(pos, side) {\n if (!this.contentDOM)\n return { node: this.dom, offset: 0, atom: pos + 1 };\n // First find the position in the child array\n let i = 0, offset = 0;\n for (let curPos = 0; i < this.children.length; i++) {\n let child = this.children[i], end = curPos + child.size;\n if (end > pos || child instanceof TrailingHackViewDesc) {\n offset = pos - curPos;\n break;\n }\n curPos = end;\n }\n // If this points into the middle of a child, call through\n if (offset)\n return this.children[i].domFromPos(offset - this.children[i].border, side);\n // Go back if there were any zero-length widgets with side >= 0 before this point\n for (let prev; i && !(prev = this.children[i - 1]).size && prev instanceof WidgetViewDesc && prev.side >= 0; i--) { }\n // Scan towards the first useable node\n if (side <= 0) {\n let prev, enter = true;\n for (;; i--, enter = false) {\n prev = i ? this.children[i - 1] : null;\n if (!prev || prev.dom.parentNode == this.contentDOM)\n break;\n }\n if (prev && side && enter && !prev.border && !prev.domAtom)\n return prev.domFromPos(prev.size, side);\n return { node: this.contentDOM, offset: prev ? domIndex(prev.dom) + 1 : 0 };\n }\n else {\n let next, enter = true;\n for (;; i++, enter = false) {\n next = i < this.children.length ? this.children[i] : null;\n if (!next || next.dom.parentNode == this.contentDOM)\n break;\n }\n if (next && enter && !next.border && !next.domAtom)\n return next.domFromPos(0, side);\n return { node: this.contentDOM, offset: next ? domIndex(next.dom) : this.contentDOM.childNodes.length };\n }\n }\n // Used to find a DOM range in a single parent for a given changed\n // range.\n parseRange(from, to, base = 0) {\n if (this.children.length == 0)\n return { node: this.contentDOM, from, to, fromOffset: 0, toOffset: this.contentDOM.childNodes.length };\n let fromOffset = -1, toOffset = -1;\n for (let offset = base, i = 0;; i++) {\n let child = this.children[i], end = offset + child.size;\n if (fromOffset == -1 && from <= end) {\n let childBase = offset + child.border;\n // FIXME maybe descend mark views to parse a narrower range?\n if (from >= childBase && to <= end - child.border && child.node &&\n child.contentDOM && this.contentDOM.contains(child.contentDOM))\n return child.parseRange(from, to, childBase);\n from = offset;\n for (let j = i; j > 0; j--) {\n let prev = this.children[j - 1];\n if (prev.size && prev.dom.parentNode == this.contentDOM && !prev.emptyChildAt(1)) {\n fromOffset = domIndex(prev.dom) + 1;\n break;\n }\n from -= prev.size;\n }\n if (fromOffset == -1)\n fromOffset = 0;\n }\n if (fromOffset > -1 && (end > to || i == this.children.length - 1)) {\n to = end;\n for (let j = i + 1; j < this.children.length; j++) {\n let next = this.children[j];\n if (next.size && next.dom.parentNode == this.contentDOM && !next.emptyChildAt(-1)) {\n toOffset = domIndex(next.dom);\n break;\n }\n to += next.size;\n }\n if (toOffset == -1)\n toOffset = this.contentDOM.childNodes.length;\n break;\n }\n offset = end;\n }\n return { node: this.contentDOM, from, to, fromOffset, toOffset };\n }\n emptyChildAt(side) {\n if (this.border || !this.contentDOM || !this.children.length)\n return false;\n let child = this.children[side < 0 ? 0 : this.children.length - 1];\n return child.size == 0 || child.emptyChildAt(side);\n }\n domAfterPos(pos) {\n let { node, offset } = this.domFromPos(pos, 0);\n if (node.nodeType != 1 || offset == node.childNodes.length)\n throw new RangeError(\"No node after pos \" + pos);\n return node.childNodes[offset];\n }\n // View descs are responsible for setting any selection that falls\n // entirely inside of them, so that custom implementations can do\n // custom things with the selection. Note that this falls apart when\n // a selection starts in such a node and ends in another, in which\n // case we just use whatever domFromPos produces as a best effort.\n setSelection(anchor, head, root, force = false) {\n // If the selection falls entirely in a child, give it to that child\n let from = Math.min(anchor, head), to = Math.max(anchor, head);\n for (let i = 0, offset = 0; i < this.children.length; i++) {\n let child = this.children[i], end = offset + child.size;\n if (from > offset && to < end)\n return child.setSelection(anchor - offset - child.border, head - offset - child.border, root, force);\n offset = end;\n }\n let anchorDOM = this.domFromPos(anchor, anchor ? -1 : 1);\n let headDOM = head == anchor ? anchorDOM : this.domFromPos(head, head ? -1 : 1);\n let domSel = root.getSelection();\n let brKludge = false;\n // On Firefox, using Selection.collapse to put the cursor after a\n // BR node for some reason doesn't always work (#1073). On Safari,\n // the cursor sometimes inexplicable visually lags behind its\n // reported position in such situations (#1092).\n if ((gecko || safari) && anchor == head) {\n let { node, offset } = anchorDOM;\n if (node.nodeType == 3) {\n brKludge = !!(offset && node.nodeValue[offset - 1] == \"\\n\");\n // Issue #1128\n if (brKludge && offset == node.nodeValue.length) {\n for (let scan = node, after; scan; scan = scan.parentNode) {\n if (after = scan.nextSibling) {\n if (after.nodeName == \"BR\")\n anchorDOM = headDOM = { node: after.parentNode, offset: domIndex(after) + 1 };\n break;\n }\n let desc = scan.pmViewDesc;\n if (desc && desc.node && desc.node.isBlock)\n break;\n }\n }\n }\n else {\n let prev = node.childNodes[offset - 1];\n brKludge = prev && (prev.nodeName == \"BR\" || prev.contentEditable == \"false\");\n }\n }\n // Firefox can act strangely when the selection is in front of an\n // uneditable node. See #1163 and https://bugzilla.mozilla.org/show_bug.cgi?id=1709536\n if (gecko && domSel.focusNode && domSel.focusNode != headDOM.node && domSel.focusNode.nodeType == 1) {\n let after = domSel.focusNode.childNodes[domSel.focusOffset];\n if (after && after.contentEditable == \"false\")\n force = true;\n }\n if (!(force || brKludge && safari) &&\n isEquivalentPosition(anchorDOM.node, anchorDOM.offset, domSel.anchorNode, domSel.anchorOffset) &&\n isEquivalentPosition(headDOM.node, headDOM.offset, domSel.focusNode, domSel.focusOffset))\n return;\n // Selection.extend can be used to create an 'inverted' selection\n // (one where the focus is before the anchor), but not all\n // browsers support it yet.\n let domSelExtended = false;\n if ((domSel.extend || anchor == head) && !brKludge) {\n domSel.collapse(anchorDOM.node, anchorDOM.offset);\n try {\n if (anchor != head)\n domSel.extend(headDOM.node, headDOM.offset);\n domSelExtended = true;\n }\n catch (err) {\n // In some cases with Chrome the selection is empty after calling\n // collapse, even when it should be valid. This appears to be a bug, but\n // it is difficult to isolate. If this happens fallback to the old path\n // without using extend.\n if (!(err instanceof DOMException))\n throw err;\n // declare global: DOMException\n }\n }\n if (!domSelExtended) {\n if (anchor > head) {\n let tmp = anchorDOM;\n anchorDOM = headDOM;\n headDOM = tmp;\n }\n let range = document.createRange();\n range.setEnd(headDOM.node, headDOM.offset);\n range.setStart(anchorDOM.node, anchorDOM.offset);\n domSel.removeAllRanges();\n domSel.addRange(range);\n }\n }\n ignoreMutation(mutation) {\n return !this.contentDOM && mutation.type != \"selection\";\n }\n get contentLost() {\n return this.contentDOM && this.contentDOM != this.dom && !this.dom.contains(this.contentDOM);\n }\n // Remove a subtree of the element tree that has been touched\n // by a DOM change, so that the next update will redraw it.\n markDirty(from, to) {\n for (let offset = 0, i = 0; i < this.children.length; i++) {\n let child = this.children[i], end = offset + child.size;\n if (offset == end ? from <= end && to >= offset : from < end && to > offset) {\n let startInside = offset + child.border, endInside = end - child.border;\n if (from >= startInside && to <= endInside) {\n this.dirty = from == offset || to == end ? CONTENT_DIRTY : CHILD_DIRTY;\n if (from == startInside && to == endInside &&\n (child.contentLost || child.dom.parentNode != this.contentDOM))\n child.dirty = NODE_DIRTY;\n else\n child.markDirty(from - startInside, to - startInside);\n return;\n }\n else {\n child.dirty = child.dom == child.contentDOM && child.dom.parentNode == this.contentDOM && !child.children.length\n ? CONTENT_DIRTY : NODE_DIRTY;\n }\n }\n offset = end;\n }\n this.dirty = CONTENT_DIRTY;\n }\n markParentsDirty() {\n let level = 1;\n for (let node = this.parent; node; node = node.parent, level++) {\n let dirty = level == 1 ? CONTENT_DIRTY : CHILD_DIRTY;\n if (node.dirty < dirty)\n node.dirty = dirty;\n }\n }\n get domAtom() { return false; }\n get ignoreForCoords() { return false; }\n}\n// A widget desc represents a widget decoration, which is a DOM node\n// drawn between the document nodes.\nclass WidgetViewDesc extends ViewDesc {\n constructor(parent, widget, view, pos) {\n let self, dom = widget.type.toDOM;\n if (typeof dom == \"function\")\n dom = dom(view, () => {\n if (!self)\n return pos;\n if (self.parent)\n return self.parent.posBeforeChild(self);\n });\n if (!widget.type.spec.raw) {\n if (dom.nodeType != 1) {\n let wrap = document.createElement(\"span\");\n wrap.appendChild(dom);\n dom = wrap;\n }\n dom.contentEditable = \"false\";\n dom.classList.add(\"ProseMirror-widget\");\n }\n super(parent, [], dom, null);\n this.widget = widget;\n this.widget = widget;\n self = this;\n }\n matchesWidget(widget) {\n return this.dirty == NOT_DIRTY && widget.type.eq(this.widget.type);\n }\n parseRule() { return { ignore: true }; }\n stopEvent(event) {\n let stop = this.widget.spec.stopEvent;\n return stop ? stop(event) : false;\n }\n ignoreMutation(mutation) {\n return mutation.type != \"selection\" || this.widget.spec.ignoreSelection;\n }\n destroy() {\n this.widget.type.destroy(this.dom);\n super.destroy();\n }\n get domAtom() { return true; }\n get side() { return this.widget.type.side; }\n}\nclass CompositionViewDesc extends ViewDesc {\n constructor(parent, dom, textDOM, text) {\n super(parent, [], dom, null);\n this.textDOM = textDOM;\n this.text = text;\n }\n get size() { return this.text.length; }\n localPosFromDOM(dom, offset) {\n if (dom != this.textDOM)\n return this.posAtStart + (offset ? this.size : 0);\n return this.posAtStart + offset;\n }\n domFromPos(pos) {\n return { node: this.textDOM, offset: pos };\n }\n ignoreMutation(mut) {\n return mut.type === 'characterData' && mut.target.nodeValue == mut.oldValue;\n }\n}\n// A mark desc represents a mark. May have multiple children,\n// depending on how the mark is split. Note that marks are drawn using\n// a fixed nesting order, for simplicity and predictability, so in\n// some cases they will be split more often than would appear\n// necessary.\nclass MarkViewDesc extends ViewDesc {\n constructor(parent, mark, dom, contentDOM) {\n super(parent, [], dom, contentDOM);\n this.mark = mark;\n }\n static create(parent, mark, inline, view) {\n let custom = view.nodeViews[mark.type.name];\n let spec = custom && custom(mark, view, inline);\n if (!spec || !spec.dom)\n spec = DOMSerializer.renderSpec(document, mark.type.spec.toDOM(mark, inline));\n return new MarkViewDesc(parent, mark, spec.dom, spec.contentDOM || spec.dom);\n }\n parseRule() {\n if ((this.dirty & NODE_DIRTY) || this.mark.type.spec.reparseInView)\n return null;\n return { mark: this.mark.type.name, attrs: this.mark.attrs, contentElement: this.contentDOM || undefined };\n }\n matchesMark(mark) { return this.dirty != NODE_DIRTY && this.mark.eq(mark); }\n markDirty(from, to) {\n super.markDirty(from, to);\n // Move dirty info to nearest node view\n if (this.dirty != NOT_DIRTY) {\n let parent = this.parent;\n while (!parent.node)\n parent = parent.parent;\n if (parent.dirty < this.dirty)\n parent.dirty = this.dirty;\n this.dirty = NOT_DIRTY;\n }\n }\n slice(from, to, view) {\n let copy = MarkViewDesc.create(this.parent, this.mark, true, view);\n let nodes = this.children, size = this.size;\n if (to < size)\n nodes = replaceNodes(nodes, to, size, view);\n if (from > 0)\n nodes = replaceNodes(nodes, 0, from, view);\n for (let i = 0; i < nodes.length; i++)\n nodes[i].parent = copy;\n copy.children = nodes;\n return copy;\n }\n}\n// Node view descs are the main, most common type of view desc, and\n// correspond to an actual node in the document. Unlike mark descs,\n// they populate their child array themselves.\nclass NodeViewDesc extends ViewDesc {\n constructor(parent, node, outerDeco, innerDeco, dom, contentDOM, nodeDOM, view, pos) {\n super(parent, [], dom, contentDOM);\n this.node = node;\n this.outerDeco = outerDeco;\n this.innerDeco = innerDeco;\n this.nodeDOM = nodeDOM;\n if (contentDOM)\n this.updateChildren(view, pos);\n }\n // By default, a node is rendered using the `toDOM` method from the\n // node type spec. But client code can use the `nodeViews` spec to\n // supply a custom node view, which can influence various aspects of\n // the way the node works.\n //\n // (Using subclassing for this was intentionally decided against,\n // since it'd require exposing a whole slew of finicky\n // implementation details to the user code that they probably will\n // never need.)\n static create(parent, node, outerDeco, innerDeco, view, pos) {\n let custom = view.nodeViews[node.type.name], descObj;\n let spec = custom && custom(node, view, () => {\n // (This is a function that allows the custom view to find its\n // own position)\n if (!descObj)\n return pos;\n if (descObj.parent)\n return descObj.parent.posBeforeChild(descObj);\n }, outerDeco, innerDeco);\n let dom = spec && spec.dom, contentDOM = spec && spec.contentDOM;\n if (node.isText) {\n if (!dom)\n dom = document.createTextNode(node.text);\n else if (dom.nodeType != 3)\n throw new RangeError(\"Text must be rendered as a DOM text node\");\n }\n else if (!dom) {\n ({ dom, contentDOM } = DOMSerializer.renderSpec(document, node.type.spec.toDOM(node)));\n }\n if (!contentDOM && !node.isText && dom.nodeName != \"BR\") { // Chrome gets confused by <br contenteditable=false>\n if (!dom.hasAttribute(\"contenteditable\"))\n dom.contentEditable = \"false\";\n if (node.type.spec.draggable)\n dom.draggable = true;\n }\n let nodeDOM = dom;\n dom = applyOuterDeco(dom, outerDeco, node);\n if (spec)\n return descObj = new CustomNodeViewDesc(parent, node, outerDeco, innerDeco, dom, contentDOM || null, nodeDOM, spec, view, pos + 1);\n else if (node.isText)\n return new TextViewDesc(parent, node, outerDeco, innerDeco, dom, nodeDOM, view);\n else\n return new NodeViewDesc(parent, node, outerDeco, innerDeco, dom, contentDOM || null, nodeDOM, view, pos + 1);\n }\n parseRule() {\n // Experimental kludge to allow opt-in re-parsing of nodes\n if (this.node.type.spec.reparseInView)\n return null;\n // FIXME the assumption that this can always return the current\n // attrs means that if the user somehow manages to change the\n // attrs in the dom, that won't be picked up. Not entirely sure\n // whether this is a problem\n let rule = { node: this.node.type.name, attrs: this.node.attrs };\n if (this.node.type.whitespace == \"pre\")\n rule.preserveWhitespace = \"full\";\n if (!this.contentDOM) {\n rule.getContent = () => this.node.content;\n }\n else if (!this.contentLost) {\n rule.contentElement = this.contentDOM;\n }\n else {\n // Chrome likes to randomly recreate parent nodes when\n // backspacing things. When that happens, this tries to find the\n // new parent.\n for (let i = this.children.length - 1; i >= 0; i--) {\n let child = this.children[i];\n if (this.dom.contains(child.dom.parentNode)) {\n rule.contentElement = child.dom.parentNode;\n break;\n }\n }\n if (!rule.contentElement)\n rule.getContent = () => Fragment.empty;\n }\n return rule;\n }\n matchesNode(node, outerDeco, innerDeco) {\n return this.dirty == NOT_DIRTY && node.eq(this.node) &&\n sameOuterDeco(outerDeco, this.outerDeco) && innerDeco.eq(this.innerDeco);\n }\n get size() { return this.node.nodeSize; }\n get border() { return this.node.isLeaf ? 0 : 1; }\n // Syncs `this.children` to match `this.node.content` and the local\n // decorations, possibly introducing nesting for marks. Then, in a\n // separate step, syncs the DOM inside `this.contentDOM` to\n // `this.children`.\n updateChildren(view, pos) {\n let inline = this.node.inlineContent, off = pos;\n let composition = view.composing ? this.localCompositionInfo(view, pos) : null;\n let localComposition = composition && composition.pos > -1 ? composition : null;\n let compositionInChild = composition && composition.pos < 0;\n let updater = new ViewTreeUpdater(this, localComposition && localComposition.node);\n iterDeco(this.node, this.innerDeco, (widget, i, insideNode) => {\n if (widget.spec.marks)\n updater.syncToMarks(widget.spec.marks, inline, view);\n else if (widget.type.side >= 0 && !insideNode)\n updater.syncToMarks(i == this.node.childCount ? Mark.none : this.node.child(i).marks, inline, view);\n // If the next node is a desc matching this widget, reuse it,\n // otherwise insert the widget as a new view desc.\n updater.placeWidget(widget, view, off);\n }, (child, outerDeco, innerDeco, i) => {\n // Make sure the wrapping mark descs match the node's marks.\n updater.syncToMarks(child.marks, inline, view);\n // Try several strategies for drawing this node\n let compIndex;\n if (updater.findNodeMatch(child, outerDeco, innerDeco, i)) ;\n else if (compositionInChild && view.state.selection.from > off &&\n view.state.selection.to < off + child.nodeSize &&\n (compIndex = updater.findIndexWithChild(composition.node)) > -1 &&\n updater.updateNodeAt(child, outerDeco, innerDeco, compIndex, view)) ;\n else if (updater.updateNextNode(child, outerDeco, innerDeco, view, i)) ;\n else {\n // Add it as a new view\n updater.addNode(child, outerDeco, innerDeco, view, off);\n }\n off += child.nodeSize;\n });\n // Drop all remaining descs after the current position.\n updater.syncToMarks([], inline, view);\n if (this.node.isTextblock)\n updater.addTextblockHacks();\n updater.destroyRest();\n // Sync the DOM if anything changed\n if (updater.changed || this.dirty == CONTENT_DIRTY) {\n // May have to protect focused DOM from being changed if a composition is active\n if (localComposition)\n this.protectLocalComposition(view, localComposition);\n renderDescs(this.contentDOM, this.children, view);\n if (ios)\n iosHacks(this.dom);\n }\n }\n localCompositionInfo(view, pos) {\n // Only do something if both the selection and a focused text node\n // are inside of this node\n let { from, to } = view.state.selection;\n if (!(view.state.selection instanceof TextSelection) || from < pos || to > pos + this.node.content.size)\n return null;\n let sel = view.domSelection();\n let textNode = nearbyTextNode(sel.focusNode, sel.focusOffset);\n if (!textNode || !this.dom.contains(textNode.parentNode))\n return null;\n if (this.node.inlineContent) {\n // Find the text in the focused node in the node, stop if it's not\n // there (may have been modified through other means, in which\n // case it should overwritten)\n let text = textNode.nodeValue;\n let textPos = findTextInFragment(this.node.content, text, from - pos, to - pos);\n return textPos < 0 ? null : { node: textNode, pos: textPos, text };\n }\n else {\n return { node: textNode, pos: -1, text: \"\" };\n }\n }\n protectLocalComposition(view, { node, pos, text }) {\n // The node is already part of a local view desc, leave it there\n if (this.getDesc(node))\n return;\n // Create a composition view for the orphaned nodes\n let topNode = node;\n for (;; topNode = topNode.parentNode) {\n if (topNode.parentNode == this.contentDOM)\n break;\n while (topNode.previousSibling)\n topNode.parentNode.removeChild(topNode.previousSibling);\n while (topNode.nextSibling)\n topNode.parentNode.removeChild(topNode.nextSibling);\n if (topNode.pmViewDesc)\n topNode.pmViewDesc = undefined;\n }\n let desc = new CompositionViewDesc(this, topNode, node, text);\n view.input.compositionNodes.push(desc);\n // Patch up this.children to contain the composition view\n this.children = replaceNodes(this.children, pos, pos + text.length, view, desc);\n }\n // If this desc must be updated to match the given node decoration,\n // do so and return true.\n update(node, outerDeco, innerDeco, view) {\n if (this.dirty == NODE_DIRTY ||\n !node.sameMarkup(this.node))\n return false;\n this.updateInner(node, outerDeco, innerDeco, view);\n return true;\n }\n updateInner(node, outerDeco, innerDeco, view) {\n this.updateOuterDeco(outerDeco);\n this.node = node;\n this.innerDeco = innerDeco;\n if (this.contentDOM)\n this.updateChildren(view, this.posAtStart);\n this.dirty = NOT_DIRTY;\n }\n updateOuterDeco(outerDeco) {\n if (sameOuterDeco(outerDeco, this.outerDeco))\n return;\n let needsWrap = this.nodeDOM.nodeType != 1;\n let oldDOM = this.dom;\n this.dom = patchOuterDeco(this.dom, this.nodeDOM, computeOuterDeco(this.outerDeco, this.node, needsWrap), computeOuterDeco(outerDeco, this.node, needsWrap));\n if (this.dom != oldDOM) {\n oldDOM.pmViewDesc = undefined;\n this.dom.pmViewDesc = this;\n }\n this.outerDeco = outerDeco;\n }\n // Mark this node as being the selected node.\n selectNode() {\n if (this.nodeDOM.nodeType == 1)\n this.nodeDOM.classList.add(\"ProseMirror-selectednode\");\n if (this.contentDOM || !this.node.type.spec.draggable)\n this.dom.draggable = true;\n }\n // Remove selected node marking from this node.\n deselectNode() {\n if (this.nodeDOM.nodeType == 1)\n this.nodeDOM.classList.remove(\"ProseMirror-selectednode\");\n if (this.contentDOM || !this.node.type.spec.draggable)\n this.dom.removeAttribute(\"draggable\");\n }\n get domAtom() { return this.node.isAtom; }\n}\n// Create a view desc for the top-level document node, to be exported\n// and used by the view class.\nfunction docViewDesc(doc, outerDeco, innerDeco, dom, view) {\n applyOuterDeco(dom, outerDeco, doc);\n return new NodeViewDesc(undefined, doc, outerDeco, innerDeco, dom, dom, dom, view, 0);\n}\nclass TextViewDesc extends NodeViewDesc {\n constructor(parent, node, outerDeco, innerDeco, dom, nodeDOM, view) {\n super(parent, node, outerDeco, innerDeco, dom, null, nodeDOM, view, 0);\n }\n parseRule() {\n let skip = this.nodeDOM.parentNode;\n while (skip && skip != this.dom && !skip.pmIsDeco)\n skip = skip.parentNode;\n return { skip: (skip || true) };\n }\n update(node, outerDeco, innerDeco, view) {\n if (this.dirty == NODE_DIRTY || (this.dirty != NOT_DIRTY && !this.inParent()) ||\n !node.sameMarkup(this.node))\n return false;\n this.updateOuterDeco(outerDeco);\n if ((this.dirty != NOT_DIRTY || node.text != this.node.text) && node.text != this.nodeDOM.nodeValue) {\n this.nodeDOM.nodeValue = node.text;\n if (view.trackWrites == this.nodeDOM)\n view.trackWrites = null;\n }\n this.node = node;\n this.dirty = NOT_DIRTY;\n return true;\n }\n inParent() {\n let parentDOM = this.parent.contentDOM;\n for (let n = this.nodeDOM; n; n = n.parentNode)\n if (n == parentDOM)\n return true;\n return false;\n }\n domFromPos(pos) {\n return { node: this.nodeDOM, offset: pos };\n }\n localPosFromDOM(dom, offset, bias) {\n if (dom == this.nodeDOM)\n return this.posAtStart + Math.min(offset, this.node.text.length);\n return super.localPosFromDOM(dom, offset, bias);\n }\n ignoreMutation(mutation) {\n return mutation.type != \"characterData\" && mutation.type != \"selection\";\n }\n slice(from, to, view) {\n let node = this.node.cut(from, to), dom = document.createTextNode(node.text);\n return new TextViewDesc(this.parent, node, this.outerDeco, this.innerDeco, dom, dom, view);\n }\n markDirty(from, to) {\n super.markDirty(from, to);\n if (this.dom != this.nodeDOM && (from == 0 || to == this.nodeDOM.nodeValue.length))\n this.dirty = NODE_DIRTY;\n }\n get domAtom() { return false; }\n}\n// A dummy desc used to tag trailing BR or IMG nodes created to work\n// around contentEditable terribleness.\nclass TrailingHackViewDesc extends ViewDesc {\n parseRule() { return { ignore: true }; }\n matchesHack(nodeName) { return this.dirty == NOT_DIRTY && this.dom.nodeName == nodeName; }\n get domAtom() { return true; }\n get ignoreForCoords() { return this.dom.nodeName == \"IMG\"; }\n}\n// A separate subclass is used for customized node views, so that the\n// extra checks only have to be made for nodes that are actually\n// customized.\nclass CustomNodeViewDesc extends NodeViewDesc {\n constructor(parent, node, outerDeco, innerDeco, dom, contentDOM, nodeDOM, spec, view, pos) {\n super(parent, node, outerDeco, innerDeco, dom, contentDOM, nodeDOM, view, pos);\n this.spec = spec;\n }\n // A custom `update` method gets to decide whether the update goes\n // through. If it does, and there's a `contentDOM` node, our logic\n // updates the children.\n update(node, outerDeco, innerDeco, view) {\n if (this.dirty == NODE_DIRTY)\n return false;\n if (this.spec.update) {\n let result = this.spec.update(node, outerDeco, innerDeco);\n if (result)\n this.updateInner(node, outerDeco, innerDeco, view);\n return result;\n }\n else if (!this.contentDOM && !node.isLeaf) {\n return false;\n }\n else {\n return super.update(node, outerDeco, innerDeco, view);\n }\n }\n selectNode() {\n this.spec.selectNode ? this.spec.selectNode() : super.selectNode();\n }\n deselectNode() {\n this.spec.deselectNode ? this.spec.deselectNode() : super.deselectNode();\n }\n setSelection(anchor, head, root, force) {\n this.spec.setSelection ? this.spec.setSelection(anchor, head, root)\n : super.setSelection(anchor, head, root, force);\n }\n destroy() {\n if (this.spec.destroy)\n this.spec.destroy();\n super.destroy();\n }\n stopEvent(event) {\n return this.spec.stopEvent ? this.spec.stopEvent(event) : false;\n }\n ignoreMutation(mutation) {\n return this.spec.ignoreMutation ? this.spec.ignoreMutation(mutation) : super.ignoreMutation(mutation);\n }\n}\n// Sync the content of the given DOM node with the nodes associated\n// with the given array of view descs, recursing into mark descs\n// because this should sync the subtree for a whole node at a time.\nfunction renderDescs(parentDOM, descs, view) {\n let dom = parentDOM.firstChild, written = false;\n for (let i = 0; i < descs.length; i++) {\n let desc = descs[i], childDOM = desc.dom;\n if (childDOM.parentNode == parentDOM) {\n while (childDOM != dom) {\n dom = rm(dom);\n written = true;\n }\n dom = dom.nextSibling;\n }\n else {\n written = true;\n parentDOM.insertBefore(childDOM, dom);\n }\n if (desc instanceof MarkViewDesc) {\n let pos = dom ? dom.previousSibling : parentDOM.lastChild;\n renderDescs(desc.contentDOM, desc.children, view);\n dom = pos ? pos.nextSibling : parentDOM.firstChild;\n }\n }\n while (dom) {\n dom = rm(dom);\n written = true;\n }\n if (written && view.trackWrites == parentDOM)\n view.trackWrites = null;\n}\nconst OuterDecoLevel = function (nodeName) {\n if (nodeName)\n this.nodeName = nodeName;\n};\nOuterDecoLevel.prototype = Object.create(null);\nconst noDeco = [new OuterDecoLevel];\nfunction computeOuterDeco(outerDeco, node, needsWrap) {\n if (outerDeco.length == 0)\n return noDeco;\n let top = needsWrap ? noDeco[0] : new OuterDecoLevel, result = [top];\n for (let i = 0; i < outerDeco.length; i++) {\n let attrs = outerDeco[i].type.attrs;\n if (!attrs)\n continue;\n if (attrs.nodeName)\n result.push(top = new OuterDecoLevel(attrs.nodeName));\n for (let name in attrs) {\n let val = attrs[name];\n if (val == null)\n continue;\n if (needsWrap && result.length == 1)\n result.push(top = new OuterDecoLevel(node.isInline ? \"span\" : \"div\"));\n if (name == \"class\")\n top.class = (top.class ? top.class + \" \" : \"\") + val;\n else if (name == \"style\")\n top.style = (top.style ? top.style + \";\" : \"\") + val;\n else if (name != \"nodeName\")\n top[name] = val;\n }\n }\n return result;\n}\nfunction patchOuterDeco(outerDOM, nodeDOM, prevComputed, curComputed) {\n // Shortcut for trivial case\n if (prevComputed == noDeco && curComputed == noDeco)\n return nodeDOM;\n let curDOM = nodeDOM;\n for (let i = 0; i < curComputed.length; i++) {\n let deco = curComputed[i], prev = prevComputed[i];\n if (i) {\n let parent;\n if (prev && prev.nodeName == deco.nodeName && curDOM != outerDOM &&\n (parent = curDOM.parentNode) && parent.nodeName.toLowerCase() == deco.nodeName) {\n curDOM = parent;\n }\n else {\n parent = document.createElement(deco.nodeName);\n parent.pmIsDeco = true;\n parent.appendChild(curDOM);\n prev = noDeco[0];\n curDOM = parent;\n }\n }\n patchAttributes(curDOM, prev || noDeco[0], deco);\n }\n return curDOM;\n}\nfunction patchAttributes(dom, prev, cur) {\n for (let name in prev)\n if (name != \"class\" && name != \"style\" && name != \"nodeName\" && !(name in cur))\n dom.removeAttribute(name);\n for (let name in cur)\n if (name != \"class\" && name != \"style\" && name != \"nodeName\" && cur[name] != prev[name])\n dom.setAttribute(name, cur[name]);\n if (prev.class != cur.class) {\n let prevList = prev.class ? prev.class.split(\" \").filter(Boolean) : [];\n let curList = cur.class ? cur.class.split(\" \").filter(Boolean) : [];\n for (let i = 0; i < prevList.length; i++)\n if (curList.indexOf(prevList[i]) == -1)\n dom.classList.remove(prevList[i]);\n for (let i = 0; i < curList.length; i++)\n if (prevList.indexOf(curList[i]) == -1)\n dom.classList.add(curList[i]);\n if (dom.classList.length == 0)\n dom.removeAttribute(\"class\");\n }\n if (prev.style != cur.style) {\n if (prev.style) {\n let prop = /\\s*([\\w\\-\\xa1-\\uffff]+)\\s*:(?:\"(?:\\\\.|[^\"])*\"|'(?:\\\\.|[^'])*'|\\(.*?\\)|[^;])*/g, m;\n while (m = prop.exec(prev.style))\n dom.style.removeProperty(m[1]);\n }\n if (cur.style)\n dom.style.cssText += cur.style;\n }\n}\nfunction applyOuterDeco(dom, deco, node) {\n return patchOuterDeco(dom, dom, noDeco, computeOuterDeco(deco, node, dom.nodeType != 1));\n}\nfunction sameOuterDeco(a, b) {\n if (a.length != b.length)\n return false;\n for (let i = 0; i < a.length; i++)\n if (!a[i].type.eq(b[i].type))\n return false;\n return true;\n}\n// Remove a DOM node and return its next sibling.\nfunction rm(dom) {\n let next = dom.nextSibling;\n dom.parentNode.removeChild(dom);\n return next;\n}\n// Helper class for incrementally updating a tree of mark descs and\n// the widget and node descs inside of them.\nclass ViewTreeUpdater {\n constructor(top, lock) {\n this.lock = lock;\n // Index into `this.top`'s child array, represents the current\n // update position.\n this.index = 0;\n // When entering a mark, the current top and index are pushed\n // onto this.\n this.stack = [];\n // Tracks whether anything was changed\n this.changed = false;\n this.top = top;\n this.preMatch = preMatch(top.node.content, top);\n }\n // Destroy and remove the children between the given indices in\n // `this.top`.\n destroyBetween(start, end) {\n if (start == end)\n return;\n for (let i = start; i < end; i++)\n this.top.children[i].destroy();\n this.top.children.splice(start, end - start);\n this.changed = true;\n }\n // Destroy all remaining children in `this.top`.\n destroyRest() {\n this.destroyBetween(this.index, this.top.children.length);\n }\n // Sync the current stack of mark descs with the given array of\n // marks, reusing existing mark descs when possible.\n syncToMarks(marks, inline, view) {\n let keep = 0, depth = this.stack.length >> 1;\n let maxKeep = Math.min(depth, marks.length);\n while (keep < maxKeep &&\n (keep == depth - 1 ? this.top : this.stack[(keep + 1) << 1])\n .matchesMark(marks[keep]) && marks[keep].type.spec.spanning !== false)\n keep++;\n while (keep < depth) {\n this.destroyRest();\n this.top.dirty = NOT_DIRTY;\n this.index = this.stack.pop();\n this.top = this.stack.pop();\n depth--;\n }\n while (depth < marks.length) {\n this.stack.push(this.top, this.index + 1);\n let found = -1;\n for (let i = this.index; i < Math.min(this.index + 3, this.top.children.length); i++) {\n if (this.top.children[i].matchesMark(marks[depth])) {\n found = i;\n break;\n }\n }\n if (found > -1) {\n if (found > this.index) {\n this.changed = true;\n this.destroyBetween(this.index, found);\n }\n this.top = this.top.children[this.index];\n }\n else {\n let markDesc = MarkViewDesc.create(this.top, marks[depth], inline, view);\n this.top.children.splice(this.index, 0, markDesc);\n this.top = markDesc;\n this.changed = true;\n }\n this.index = 0;\n depth++;\n }\n }\n // Try to find a node desc matching the given data. Skip over it and\n // return true when successful.\n findNodeMatch(node, outerDeco, innerDeco, index) {\n let found = -1, targetDesc;\n if (index >= this.preMatch.index &&\n (targetDesc = this.preMatch.matches[index - this.preMatch.index]).parent == this.top &&\n targetDesc.matchesNode(node, outerDeco, innerDeco)) {\n found = this.top.children.indexOf(targetDesc, this.index);\n }\n else {\n for (let i = this.index, e = Math.min(this.top.children.length, i + 5); i < e; i++) {\n let child = this.top.children[i];\n if (child.matchesNode(node, outerDeco, innerDeco) && !this.preMatch.matched.has(child)) {\n found = i;\n break;\n }\n }\n }\n if (found < 0)\n return false;\n this.destroyBetween(this.index, found);\n this.index++;\n return true;\n }\n updateNodeAt(node, outerDeco, innerDeco, index, view) {\n let child = this.top.children[index];\n if (child.dirty == NODE_DIRTY && child.dom == child.contentDOM)\n child.dirty = CONTENT_DIRTY;\n if (!child.update(node, outerDeco, innerDeco, view))\n return false;\n this.destroyBetween(this.index, index);\n this.index++;\n return true;\n }\n findIndexWithChild(domNode) {\n for (;;) {\n let parent = domNode.parentNode;\n if (!parent)\n return -1;\n if (parent == this.top.contentDOM) {\n let desc = domNode.pmViewDesc;\n if (desc)\n for (let i = this.index; i < this.top.children.length; i++) {\n if (this.top.children[i] == desc)\n return i;\n }\n return -1;\n }\n domNode = parent;\n }\n }\n // Try to update the next node, if any, to the given data. Checks\n // pre-matches to avoid overwriting nodes that could still be used.\n updateNextNode(node, outerDeco, innerDeco, view, index) {\n for (let i = this.index; i < this.top.children.length; i++) {\n let next = this.top.children[i];\n if (next instanceof NodeViewDesc) {\n let preMatch = this.preMatch.matched.get(next);\n if (preMatch != null && preMatch != index)\n return false;\n let nextDOM = next.dom;\n // Can't update if nextDOM is or contains this.lock, except if\n // it's a text node whose content already matches the new text\n // and whose decorations match the new ones.\n let locked = this.lock && (nextDOM == this.lock || nextDOM.nodeType == 1 && nextDOM.contains(this.lock.parentNode)) &&\n !(node.isText && next.node && next.node.isText && next.nodeDOM.nodeValue == node.text &&\n next.dirty != NODE_DIRTY && sameOuterDeco(outerDeco, next.outerDeco));\n if (!locked && next.update(node, outerDeco, innerDeco, view)) {\n this.destroyBetween(this.index, i);\n if (next.dom != nextDOM)\n this.changed = true;\n this.index++;\n return true;\n }\n break;\n }\n }\n return false;\n }\n // Insert the node as a newly created node desc.\n addNode(node, outerDeco, innerDeco, view, pos) {\n this.top.children.splice(this.index++, 0, NodeViewDesc.create(this.top, node, outerDeco, innerDeco, view, pos));\n this.changed = true;\n }\n placeWidget(widget, view, pos) {\n let next = this.index < this.top.children.length ? this.top.children[this.index] : null;\n if (next && next.matchesWidget(widget) &&\n (widget == next.widget || !next.widget.type.toDOM.parentNode)) {\n this.index++;\n }\n else {\n let desc = new WidgetViewDesc(this.top, widget, view, pos);\n this.top.children.splice(this.index++, 0, desc);\n this.changed = true;\n }\n }\n // Make sure a textblock looks and behaves correctly in\n // contentEditable.\n addTextblockHacks() {\n let lastChild = this.top.children[this.index - 1], parent = this.top;\n while (lastChild instanceof MarkViewDesc) {\n parent = lastChild;\n lastChild = parent.children[parent.children.length - 1];\n }\n if (!lastChild || // Empty textblock\n !(lastChild instanceof TextViewDesc) ||\n /\\n$/.test(lastChild.node.text)) {\n // Avoid bugs in Safari's cursor drawing (#1165) and Chrome's mouse selection (#1152)\n if ((safari || chrome) && lastChild && lastChild.dom.contentEditable == \"false\")\n this.addHackNode(\"IMG\", parent);\n this.addHackNode(\"BR\", this.top);\n }\n }\n addHackNode(nodeName, parent) {\n if (parent == this.top && this.index < parent.children.length && parent.children[this.index].matchesHack(nodeName)) {\n this.index++;\n }\n else {\n let dom = document.createElement(nodeName);\n if (nodeName == \"IMG\") {\n dom.className = \"ProseMirror-separator\";\n dom.alt = \"\";\n }\n if (nodeName == \"BR\")\n dom.className = \"ProseMirror-trailingBreak\";\n let hack = new TrailingHackViewDesc(this.top, [], dom, null);\n if (parent != this.top)\n parent.children.push(hack);\n else\n parent.children.splice(this.index++, 0, hack);\n this.changed = true;\n }\n }\n}\n// Iterate from the end of the fragment and array of descs to find\n// directly matching ones, in order to avoid overeagerly reusing those\n// for other nodes. Returns the fragment index of the first node that\n// is part of the sequence of matched nodes at the end of the\n// fragment.\nfunction preMatch(frag, parentDesc) {\n let curDesc = parentDesc, descI = curDesc.children.length;\n let fI = frag.childCount, matched = new Map, matches = [];\n outer: while (fI > 0) {\n let desc;\n for (;;) {\n if (descI) {\n let next = curDesc.children[descI - 1];\n if (next instanceof MarkViewDesc) {\n curDesc = next;\n descI = next.children.length;\n }\n else {\n desc = next;\n descI--;\n break;\n }\n }\n else if (curDesc == parentDesc) {\n break outer;\n }\n else {\n // FIXME\n descI = curDesc.parent.children.indexOf(curDesc);\n curDesc = curDesc.parent;\n }\n }\n let node = desc.node;\n if (!node)\n continue;\n if (node != frag.child(fI - 1))\n break;\n --fI;\n matched.set(desc, fI);\n matches.push(desc);\n }\n return { index: fI, matched, matches: matches.reverse() };\n}\nfunction compareSide(a, b) {\n return a.type.side - b.type.side;\n}\n// This function abstracts iterating over the nodes and decorations in\n// a fragment. Calls `onNode` for each node, with its local and child\n// decorations. Splits text nodes when there is a decoration starting\n// or ending inside of them. Calls `onWidget` for each widget.\nfunction iterDeco(parent, deco, onWidget, onNode) {\n let locals = deco.locals(parent), offset = 0;\n // Simple, cheap variant for when there are no local decorations\n if (locals.length == 0) {\n for (let i = 0; i < parent.childCount; i++) {\n let child = parent.child(i);\n onNode(child, locals, deco.forChild(offset, child), i);\n offset += child.nodeSize;\n }\n return;\n }\n let decoIndex = 0, active = [], restNode = null;\n for (let parentIndex = 0;;) {\n if (decoIndex < locals.length && locals[decoIndex].to == offset) {\n let widget = locals[decoIndex++], widgets;\n while (decoIndex < locals.length && locals[decoIndex].to == offset)\n (widgets || (widgets = [widget])).push(locals[decoIndex++]);\n if (widgets) {\n widgets.sort(compareSide);\n for (let i = 0; i < widgets.length; i++)\n onWidget(widgets[i], parentIndex, !!restNode);\n }\n else {\n onWidget(widget, parentIndex, !!restNode);\n }\n }\n let child, index;\n if (restNode) {\n index = -1;\n child = restNode;\n restNode = null;\n }\n else if (parentIndex < parent.childCount) {\n index = parentIndex;\n child = parent.child(parentIndex++);\n }\n else {\n break;\n }\n for (let i = 0; i < active.length; i++)\n if (active[i].to <= offset)\n active.splice(i--, 1);\n while (decoIndex < locals.length && locals[decoIndex].from <= offset && locals[decoIndex].to > offset)\n active.push(locals[decoIndex++]);\n let end = offset + child.nodeSize;\n if (child.isText) {\n let cutAt = end;\n if (decoIndex < locals.length && locals[decoIndex].from < cutAt)\n cutAt = locals[decoIndex].from;\n for (let i = 0; i < active.length; i++)\n if (active[i].to < cutAt)\n cutAt = active[i].to;\n if (cutAt < end) {\n restNode = child.cut(cutAt - offset);\n child = child.cut(0, cutAt - offset);\n end = cutAt;\n index = -1;\n }\n }\n let outerDeco = child.isInline && !child.isLeaf ? active.filter(d => !d.inline) : active.slice();\n onNode(child, outerDeco, deco.forChild(offset, child), index);\n offset = end;\n }\n}\n// List markers in Mobile Safari will mysteriously disappear\n// sometimes. This works around that.\nfunction iosHacks(dom) {\n if (dom.nodeName == \"UL\" || dom.nodeName == \"OL\") {\n let oldCSS = dom.style.cssText;\n dom.style.cssText = oldCSS + \"; list-style: square !important\";\n window.getComputedStyle(dom).listStyle;\n dom.style.cssText = oldCSS;\n }\n}\nfunction nearbyTextNode(node, offset) {\n for (;;) {\n if (node.nodeType == 3)\n return node;\n if (node.nodeType == 1 && offset > 0) {\n if (node.childNodes.length > offset && node.childNodes[offset].nodeType == 3)\n return node.childNodes[offset];\n node = node.childNodes[offset - 1];\n offset = nodeSize(node);\n }\n else if (node.nodeType == 1 && offset < node.childNodes.length) {\n node = node.childNodes[offset];\n offset = 0;\n }\n else {\n return null;\n }\n }\n}\n// Find a piece of text in an inline fragment, overlapping from-to\nfunction findTextInFragment(frag, text, from, to) {\n for (let i = 0, pos = 0; i < frag.childCount && pos <= to;) {\n let child = frag.child(i++), childStart = pos;\n pos += child.nodeSize;\n if (!child.isText)\n continue;\n let str = child.text;\n while (i < frag.childCount) {\n let next = frag.child(i++);\n pos += next.nodeSize;\n if (!next.isText)\n break;\n str += next.text;\n }\n if (pos >= from) {\n let found = childStart < to ? str.lastIndexOf(text, to - childStart - 1) : -1;\n if (found >= 0 && found + text.length + childStart >= from)\n return childStart + found;\n if (from == to && str.length >= (to + text.length) - childStart &&\n str.slice(to - childStart, to - childStart + text.length) == text)\n return to;\n }\n }\n return -1;\n}\n// Replace range from-to in an array of view descs with replacement\n// (may be null to just delete). This goes very much against the grain\n// of the rest of this code, which tends to create nodes with the\n// right shape in one go, rather than messing with them after\n// creation, but is necessary in the composition hack.\nfunction replaceNodes(nodes, from, to, view, replacement) {\n let result = [];\n for (let i = 0, off = 0; i < nodes.length; i++) {\n let child = nodes[i], start = off, end = off += child.size;\n if (start >= to || end <= from) {\n result.push(child);\n }\n else {\n if (start < from)\n result.push(child.slice(0, from - start, view));\n if (replacement) {\n result.push(replacement);\n replacement = undefined;\n }\n if (end > to)\n result.push(child.slice(to - start, child.size, view));\n }\n }\n return result;\n}\n\nfunction selectionFromDOM(view, origin = null) {\n let domSel = view.domSelection(), doc = view.state.doc;\n if (!domSel.focusNode)\n return null;\n let nearestDesc = view.docView.nearestDesc(domSel.focusNode), inWidget = nearestDesc && nearestDesc.size == 0;\n let head = view.docView.posFromDOM(domSel.focusNode, domSel.focusOffset, 1);\n if (head < 0)\n return null;\n let $head = doc.resolve(head), $anchor, selection;\n if (selectionCollapsed(domSel)) {\n $anchor = $head;\n while (nearestDesc && !nearestDesc.node)\n nearestDesc = nearestDesc.parent;\n let nearestDescNode = nearestDesc.node;\n if (nearestDesc && nearestDescNode.isAtom && NodeSelection.isSelectable(nearestDescNode) && nearestDesc.parent\n && !(nearestDescNode.isInline && isOnEdge(domSel.focusNode, domSel.focusOffset, nearestDesc.dom))) {\n let pos = nearestDesc.posBefore;\n selection = new NodeSelection(head == pos ? $head : doc.resolve(pos));\n }\n }\n else {\n let anchor = view.docView.posFromDOM(domSel.anchorNode, domSel.anchorOffset, 1);\n if (anchor < 0)\n return null;\n $anchor = doc.resolve(anchor);\n }\n if (!selection) {\n let bias = origin == \"pointer\" || (view.state.selection.head < $head.pos && !inWidget) ? 1 : -1;\n selection = selectionBetween(view, $anchor, $head, bias);\n }\n return selection;\n}\nfunction editorOwnsSelection(view) {\n return view.editable ? view.hasFocus() :\n hasSelection(view) && document.activeElement && document.activeElement.contains(view.dom);\n}\nfunction selectionToDOM(view, force = false) {\n let sel = view.state.selection;\n syncNodeSelection(view, sel);\n if (!editorOwnsSelection(view))\n return;\n // The delayed drag selection causes issues with Cell Selections\n // in Safari. And the drag selection delay is to workarond issues\n // which only present in Chrome.\n if (!force && view.input.mouseDown && view.input.mouseDown.allowDefault && chrome) {\n let domSel = view.domSelection(), curSel = view.domObserver.currentSelection;\n if (domSel.anchorNode && curSel.anchorNode &&\n isEquivalentPosition(domSel.anchorNode, domSel.anchorOffset, curSel.anchorNode, curSel.anchorOffset)) {\n view.input.mouseDown.delayedSelectionSync = true;\n view.domObserver.setCurSelection();\n return;\n }\n }\n view.domObserver.disconnectSelection();\n if (view.cursorWrapper) {\n selectCursorWrapper(view);\n }\n else {\n let { anchor, head } = sel, resetEditableFrom, resetEditableTo;\n if (brokenSelectBetweenUneditable && !(sel instanceof TextSelection)) {\n if (!sel.$from.parent.inlineContent)\n resetEditableFrom = temporarilyEditableNear(view, sel.from);\n if (!sel.empty && !sel.$from.parent.inlineContent)\n resetEditableTo = temporarilyEditableNear(view, sel.to);\n }\n view.docView.setSelection(anchor, head, view.root, force);\n if (brokenSelectBetweenUneditable) {\n if (resetEditableFrom)\n resetEditable(resetEditableFrom);\n if (resetEditableTo)\n resetEditable(resetEditableTo);\n }\n if (sel.visible) {\n view.dom.classList.remove(\"ProseMirror-hideselection\");\n }\n else {\n view.dom.classList.add(\"ProseMirror-hideselection\");\n if (\"onselectionchange\" in document)\n removeClassOnSelectionChange(view);\n }\n }\n view.domObserver.setCurSelection();\n view.domObserver.connectSelection();\n}\n// Kludge to work around Webkit not allowing a selection to start/end\n// between non-editable block nodes. We briefly make something\n// editable, set the selection, then set it uneditable again.\nconst brokenSelectBetweenUneditable = safari || chrome && chrome_version < 63;\nfunction temporarilyEditableNear(view, pos) {\n let { node, offset } = view.docView.domFromPos(pos, 0);\n let after = offset < node.childNodes.length ? node.childNodes[offset] : null;\n let before = offset ? node.childNodes[offset - 1] : null;\n if (safari && after && after.contentEditable == \"false\")\n return setEditable(after);\n if ((!after || after.contentEditable == \"false\") &&\n (!before || before.contentEditable == \"false\")) {\n if (after)\n return setEditable(after);\n else if (before)\n return setEditable(before);\n }\n}\nfunction setEditable(element) {\n element.contentEditable = \"true\";\n if (safari && element.draggable) {\n element.draggable = false;\n element.wasDraggable = true;\n }\n return element;\n}\nfunction resetEditable(element) {\n element.contentEditable = \"false\";\n if (element.wasDraggable) {\n element.draggable = true;\n element.wasDraggable = null;\n }\n}\nfunction removeClassOnSelectionChange(view) {\n let doc = view.dom.ownerDocument;\n doc.removeEventListener(\"selectionchange\", view.input.hideSelectionGuard);\n let domSel = view.domSelection();\n let node = domSel.anchorNode, offset = domSel.anchorOffset;\n doc.addEventListener(\"selectionchange\", view.input.hideSelectionGuard = () => {\n if (domSel.anchorNode != node || domSel.anchorOffset != offset) {\n doc.removeEventListener(\"selectionchange\", view.input.hideSelectionGuard);\n setTimeout(() => {\n if (!editorOwnsSelection(view) || view.state.selection.visible)\n view.dom.classList.remove(\"ProseMirror-hideselection\");\n }, 20);\n }\n });\n}\nfunction selectCursorWrapper(view) {\n let domSel = view.domSelection(), range = document.createRange();\n let node = view.cursorWrapper.dom, img = node.nodeName == \"IMG\";\n if (img)\n range.setEnd(node.parentNode, domIndex(node) + 1);\n else\n range.setEnd(node, 0);\n range.collapse(false);\n domSel.removeAllRanges();\n domSel.addRange(range);\n // Kludge to kill 'control selection' in IE11 when selecting an\n // invisible cursor wrapper, since that would result in those weird\n // resize handles and a selection that considers the absolutely\n // positioned wrapper, rather than the root editable node, the\n // focused element.\n if (!img && !view.state.selection.visible && ie && ie_version <= 11) {\n node.disabled = true;\n node.disabled = false;\n }\n}\nfunction syncNodeSelection(view, sel) {\n if (sel instanceof NodeSelection) {\n let desc = view.docView.descAt(sel.from);\n if (desc != view.lastSelectedViewDesc) {\n clearNodeSelection(view);\n if (desc)\n desc.selectNode();\n view.lastSelectedViewDesc = desc;\n }\n }\n else {\n clearNodeSelection(view);\n }\n}\n// Clear all DOM statefulness of the last node selection.\nfunction clearNodeSelection(view) {\n if (view.lastSelectedViewDesc) {\n if (view.lastSelectedViewDesc.parent)\n view.lastSelectedViewDesc.deselectNode();\n view.lastSelectedViewDesc = undefined;\n }\n}\nfunction selectionBetween(view, $anchor, $head, bias) {\n return view.someProp(\"createSelectionBetween\", f => f(view, $anchor, $head))\n || TextSelection.between($anchor, $head, bias);\n}\nfunction hasFocusAndSelection(view) {\n if (view.editable && view.root.activeElement != view.dom)\n return false;\n return hasSelection(view);\n}\nfunction hasSelection(view) {\n let sel = view.domSelection();\n if (!sel.anchorNode)\n return false;\n try {\n // Firefox will raise 'permission denied' errors when accessing\n // properties of `sel.anchorNode` when it's in a generated CSS\n // element.\n return view.dom.contains(sel.anchorNode.nodeType == 3 ? sel.anchorNode.parentNode : sel.anchorNode) &&\n (view.editable || view.dom.contains(sel.focusNode.nodeType == 3 ? sel.focusNode.parentNode : sel.focusNode));\n }\n catch (_) {\n return false;\n }\n}\nfunction anchorInRightPlace(view) {\n let anchorDOM = view.docView.domFromPos(view.state.selection.anchor, 0);\n let domSel = view.domSelection();\n return isEquivalentPosition(anchorDOM.node, anchorDOM.offset, domSel.anchorNode, domSel.anchorOffset);\n}\n\nfunction moveSelectionBlock(state, dir) {\n let { $anchor, $head } = state.selection;\n let $side = dir > 0 ? $anchor.max($head) : $anchor.min($head);\n let $start = !$side.parent.inlineContent ? $side : $side.depth ? state.doc.resolve(dir > 0 ? $side.after() : $side.before()) : null;\n return $start && Selection.findFrom($start, dir);\n}\nfunction apply(view, sel) {\n view.dispatch(view.state.tr.setSelection(sel).scrollIntoView());\n return true;\n}\nfunction selectHorizontally(view, dir, mods) {\n let sel = view.state.selection;\n if (sel instanceof TextSelection) {\n if (!sel.empty || mods.indexOf(\"s\") > -1) {\n return false;\n }\n else if (view.endOfTextblock(dir > 0 ? \"right\" : \"left\")) {\n let next = moveSelectionBlock(view.state, dir);\n if (next && (next instanceof NodeSelection))\n return apply(view, next);\n return false;\n }\n else if (!(mac && mods.indexOf(\"m\") > -1)) {\n let $head = sel.$head, node = $head.textOffset ? null : dir < 0 ? $head.nodeBefore : $head.nodeAfter, desc;\n if (!node || node.isText)\n return false;\n let nodePos = dir < 0 ? $head.pos - node.nodeSize : $head.pos;\n if (!(node.isAtom || (desc = view.docView.descAt(nodePos)) && !desc.contentDOM))\n return false;\n if (NodeSelection.isSelectable(node)) {\n return apply(view, new NodeSelection(dir < 0 ? view.state.doc.resolve($head.pos - node.nodeSize) : $head));\n }\n else if (webkit) {\n // Chrome and Safari will introduce extra pointless cursor\n // positions around inline uneditable nodes, so we have to\n // take over and move the cursor past them (#937)\n return apply(view, new TextSelection(view.state.doc.resolve(dir < 0 ? nodePos : nodePos + node.nodeSize)));\n }\n else {\n return false;\n }\n }\n }\n else if (sel instanceof NodeSelection && sel.node.isInline) {\n return apply(view, new TextSelection(dir > 0 ? sel.$to : sel.$from));\n }\n else {\n let next = moveSelectionBlock(view.state, dir);\n if (next)\n return apply(view, next);\n return false;\n }\n}\nfunction nodeLen(node) {\n return node.nodeType == 3 ? node.nodeValue.length : node.childNodes.length;\n}\nfunction isIgnorable(dom) {\n let desc = dom.pmViewDesc;\n return desc && desc.size == 0 && (dom.nextSibling || dom.nodeName != \"BR\");\n}\n// Make sure the cursor isn't directly after one or more ignored\n// nodes, which will confuse the browser's cursor motion logic.\nfunction skipIgnoredNodesLeft(view) {\n let sel = view.domSelection();\n let node = sel.focusNode, offset = sel.focusOffset;\n if (!node)\n return;\n let moveNode, moveOffset, force = false;\n // Gecko will do odd things when the selection is directly in front\n // of a non-editable node, so in that case, move it into the next\n // node if possible. Issue prosemirror/prosemirror#832.\n if (gecko && node.nodeType == 1 && offset < nodeLen(node) && isIgnorable(node.childNodes[offset]))\n force = true;\n for (;;) {\n if (offset > 0) {\n if (node.nodeType != 1) {\n break;\n }\n else {\n let before = node.childNodes[offset - 1];\n if (isIgnorable(before)) {\n moveNode = node;\n moveOffset = --offset;\n }\n else if (before.nodeType == 3) {\n node = before;\n offset = node.nodeValue.length;\n }\n else\n break;\n }\n }\n else if (isBlockNode(node)) {\n break;\n }\n else {\n let prev = node.previousSibling;\n while (prev && isIgnorable(prev)) {\n moveNode = node.parentNode;\n moveOffset = domIndex(prev);\n prev = prev.previousSibling;\n }\n if (!prev) {\n node = node.parentNode;\n if (node == view.dom)\n break;\n offset = 0;\n }\n else {\n node = prev;\n offset = nodeLen(node);\n }\n }\n }\n if (force)\n setSelFocus(view, sel, node, offset);\n else if (moveNode)\n setSelFocus(view, sel, moveNode, moveOffset);\n}\n// Make sure the cursor isn't directly before one or more ignored\n// nodes.\nfunction skipIgnoredNodesRight(view) {\n let sel = view.domSelection();\n let node = sel.focusNode, offset = sel.focusOffset;\n if (!node)\n return;\n let len = nodeLen(node);\n let moveNode, moveOffset;\n for (;;) {\n if (offset < len) {\n if (node.nodeType != 1)\n break;\n let after = node.childNodes[offset];\n if (isIgnorable(after)) {\n moveNode = node;\n moveOffset = ++offset;\n }\n else\n break;\n }\n else if (isBlockNode(node)) {\n break;\n }\n else {\n let next = node.nextSibling;\n while (next && isIgnorable(next)) {\n moveNode = next.parentNode;\n moveOffset = domIndex(next) + 1;\n next = next.nextSibling;\n }\n if (!next) {\n node = node.parentNode;\n if (node == view.dom)\n break;\n offset = len = 0;\n }\n else {\n node = next;\n offset = 0;\n len = nodeLen(node);\n }\n }\n }\n if (moveNode)\n setSelFocus(view, sel, moveNode, moveOffset);\n}\nfunction isBlockNode(dom) {\n let desc = dom.pmViewDesc;\n return desc && desc.node && desc.node.isBlock;\n}\nfunction setSelFocus(view, sel, node, offset) {\n if (selectionCollapsed(sel)) {\n let range = document.createRange();\n range.setEnd(node, offset);\n range.setStart(node, offset);\n sel.removeAllRanges();\n sel.addRange(range);\n }\n else if (sel.extend) {\n sel.extend(node, offset);\n }\n view.domObserver.setCurSelection();\n let { state } = view;\n // If no state update ends up happening, reset the selection.\n setTimeout(() => {\n if (view.state == state)\n selectionToDOM(view);\n }, 50);\n}\n// Check whether vertical selection motion would involve node\n// selections. If so, apply it (if not, the result is left to the\n// browser)\nfunction selectVertically(view, dir, mods) {\n let sel = view.state.selection;\n if (sel instanceof TextSelection && !sel.empty || mods.indexOf(\"s\") > -1)\n return false;\n if (mac && mods.indexOf(\"m\") > -1)\n return false;\n let { $from, $to } = sel;\n if (!$from.parent.inlineContent || view.endOfTextblock(dir < 0 ? \"up\" : \"down\")) {\n let next = moveSelectionBlock(view.state, dir);\n if (next && (next instanceof NodeSelection))\n return apply(view, next);\n }\n if (!$from.parent.inlineContent) {\n let side = dir < 0 ? $from : $to;\n let beyond = sel instanceof AllSelection ? Selection.near(side, dir) : Selection.findFrom(side, dir);\n return beyond ? apply(view, beyond) : false;\n }\n return false;\n}\nfunction stopNativeHorizontalDelete(view, dir) {\n if (!(view.state.selection instanceof TextSelection))\n return true;\n let { $head, $anchor, empty } = view.state.selection;\n if (!$head.sameParent($anchor))\n return true;\n if (!empty)\n return false;\n if (view.endOfTextblock(dir > 0 ? \"forward\" : \"backward\"))\n return true;\n let nextNode = !$head.textOffset && (dir < 0 ? $head.nodeBefore : $head.nodeAfter);\n if (nextNode && !nextNode.isText) {\n let tr = view.state.tr;\n if (dir < 0)\n tr.delete($head.pos - nextNode.nodeSize, $head.pos);\n else\n tr.delete($head.pos, $head.pos + nextNode.nodeSize);\n view.dispatch(tr);\n return true;\n }\n return false;\n}\nfunction switchEditable(view, node, state) {\n view.domObserver.stop();\n node.contentEditable = state;\n view.domObserver.start();\n}\n// Issue #867 / #1090 / https://bugs.chromium.org/p/chromium/issues/detail?id=903821\n// In which Safari (and at some point in the past, Chrome) does really\n// wrong things when the down arrow is pressed when the cursor is\n// directly at the start of a textblock and has an uneditable node\n// after it\nfunction safariDownArrowBug(view) {\n if (!safari || view.state.selection.$head.parentOffset > 0)\n return false;\n let { focusNode, focusOffset } = view.domSelection();\n if (focusNode && focusNode.nodeType == 1 && focusOffset == 0 &&\n focusNode.firstChild && focusNode.firstChild.contentEditable == \"false\") {\n let child = focusNode.firstChild;\n switchEditable(view, child, \"true\");\n setTimeout(() => switchEditable(view, child, \"false\"), 20);\n }\n return false;\n}\n// A backdrop key mapping used to make sure we always suppress keys\n// that have a dangerous default effect, even if the commands they are\n// bound to return false, and to make sure that cursor-motion keys\n// find a cursor (as opposed to a node selection) when pressed. For\n// cursor-motion keys, the code in the handlers also takes care of\n// block selections.\nfunction getMods(event) {\n let result = \"\";\n if (event.ctrlKey)\n result += \"c\";\n if (event.metaKey)\n result += \"m\";\n if (event.altKey)\n result += \"a\";\n if (event.shiftKey)\n result += \"s\";\n return result;\n}\nfunction captureKeyDown(view, event) {\n let code = event.keyCode, mods = getMods(event);\n if (code == 8 || (mac && code == 72 && mods == \"c\")) { // Backspace, Ctrl-h on Mac\n return stopNativeHorizontalDelete(view, -1) || skipIgnoredNodesLeft(view);\n }\n else if (code == 46 || (mac && code == 68 && mods == \"c\")) { // Delete, Ctrl-d on Mac\n return stopNativeHorizontalDelete(view, 1) || skipIgnoredNodesRight(view);\n }\n else if (code == 13 || code == 27) { // Enter, Esc\n return true;\n }\n else if (code == 37 || (mac && code == 66 && mods == \"c\")) { // Left arrow, Ctrl-b on Mac\n return selectHorizontally(view, -1, mods) || skipIgnoredNodesLeft(view);\n }\n else if (code == 39 || (mac && code == 70 && mods == \"c\")) { // Right arrow, Ctrl-f on Mac\n return selectHorizontally(view, 1, mods) || skipIgnoredNodesRight(view);\n }\n else if (code == 38 || (mac && code == 80 && mods == \"c\")) { // Up arrow, Ctrl-p on Mac\n return selectVertically(view, -1, mods) || skipIgnoredNodesLeft(view);\n }\n else if (code == 40 || (mac && code == 78 && mods == \"c\")) { // Down arrow, Ctrl-n on Mac\n return safariDownArrowBug(view) || selectVertically(view, 1, mods) || skipIgnoredNodesRight(view);\n }\n else if (mods == (mac ? \"m\" : \"c\") &&\n (code == 66 || code == 73 || code == 89 || code == 90)) { // Mod-[biyz]\n return true;\n }\n return false;\n}\n\nfunction serializeForClipboard(view, slice) {\n let context = [], { content, openStart, openEnd } = slice;\n while (openStart > 1 && openEnd > 1 && content.childCount == 1 && content.firstChild.childCount == 1) {\n openStart--;\n openEnd--;\n let node = content.firstChild;\n context.push(node.type.name, node.attrs != node.type.defaultAttrs ? node.attrs : null);\n content = node.content;\n }\n let serializer = view.someProp(\"clipboardSerializer\") || DOMSerializer.fromSchema(view.state.schema);\n let doc = detachedDoc(), wrap = doc.createElement(\"div\");\n wrap.appendChild(serializer.serializeFragment(content, { document: doc }));\n let firstChild = wrap.firstChild, needsWrap, wrappers = 0;\n while (firstChild && firstChild.nodeType == 1 && (needsWrap = wrapMap[firstChild.nodeName.toLowerCase()])) {\n for (let i = needsWrap.length - 1; i >= 0; i--) {\n let wrapper = doc.createElement(needsWrap[i]);\n while (wrap.firstChild)\n wrapper.appendChild(wrap.firstChild);\n wrap.appendChild(wrapper);\n wrappers++;\n }\n firstChild = wrap.firstChild;\n }\n if (firstChild && firstChild.nodeType == 1)\n firstChild.setAttribute(\"data-pm-slice\", `${openStart} ${openEnd}${wrappers ? ` -${wrappers}` : \"\"} ${JSON.stringify(context)}`);\n let text = view.someProp(\"clipboardTextSerializer\", f => f(slice)) ||\n slice.content.textBetween(0, slice.content.size, \"\\n\\n\");\n return { dom: wrap, text };\n}\n// Read a slice of content from the clipboard (or drop data).\nfunction parseFromClipboard(view, text, html, plainText, $context) {\n let inCode = $context.parent.type.spec.code;\n let dom, slice;\n if (!html && !text)\n return null;\n let asText = text && (plainText || inCode || !html);\n if (asText) {\n view.someProp(\"transformPastedText\", f => { text = f(text, inCode || plainText); });\n if (inCode)\n return text ? new Slice(Fragment.from(view.state.schema.text(text.replace(/\\r\\n?/g, \"\\n\"))), 0, 0) : Slice.empty;\n let parsed = view.someProp(\"clipboardTextParser\", f => f(text, $context, plainText));\n if (parsed) {\n slice = parsed;\n }\n else {\n let marks = $context.marks();\n let { schema } = view.state, serializer = DOMSerializer.fromSchema(schema);\n dom = document.createElement(\"div\");\n text.split(/(?:\\r\\n?|\\n)+/).forEach(block => {\n let p = dom.appendChild(document.createElement(\"p\"));\n if (block)\n p.appendChild(serializer.serializeNode(schema.text(block, marks)));\n });\n }\n }\n else {\n view.someProp(\"transformPastedHTML\", f => { html = f(html); });\n dom = readHTML(html);\n if (webkit)\n restoreReplacedSpaces(dom);\n }\n let contextNode = dom && dom.querySelector(\"[data-pm-slice]\");\n let sliceData = contextNode && /^(\\d+) (\\d+)(?: -(\\d+))? (.*)/.exec(contextNode.getAttribute(\"data-pm-slice\") || \"\");\n if (sliceData && sliceData[3])\n for (let i = +sliceData[3]; i > 0 && dom.firstChild; i--)\n dom = dom.firstChild;\n if (!slice) {\n let parser = view.someProp(\"clipboardParser\") || view.someProp(\"domParser\") || DOMParser.fromSchema(view.state.schema);\n slice = parser.parseSlice(dom, {\n preserveWhitespace: !!(asText || sliceData),\n context: $context,\n ruleFromNode(dom) {\n if (dom.nodeName == \"BR\" && !dom.nextSibling &&\n dom.parentNode && !inlineParents.test(dom.parentNode.nodeName))\n return { ignore: true };\n return null;\n }\n });\n }\n if (sliceData) {\n slice = addContext(closeSlice(slice, +sliceData[1], +sliceData[2]), sliceData[4]);\n }\n else { // HTML wasn't created by ProseMirror. Make sure top-level siblings are coherent\n slice = Slice.maxOpen(normalizeSiblings(slice.content, $context), true);\n if (slice.openStart || slice.openEnd) {\n let openStart = 0, openEnd = 0;\n for (let node = slice.content.firstChild; openStart < slice.openStart && !node.type.spec.isolating; openStart++, node = node.firstChild) { }\n for (let node = slice.content.lastChild; openEnd < slice.openEnd && !node.type.spec.isolating; openEnd++, node = node.lastChild) { }\n slice = closeSlice(slice, openStart, openEnd);\n }\n }\n view.someProp(\"transformPasted\", f => { slice = f(slice); });\n return slice;\n}\nconst inlineParents = /^(a|abbr|acronym|b|cite|code|del|em|i|ins|kbd|label|output|q|ruby|s|samp|span|strong|sub|sup|time|u|tt|var)$/i;\n// Takes a slice parsed with parseSlice, which means there hasn't been\n// any content-expression checking done on the top nodes, tries to\n// find a parent node in the current context that might fit the nodes,\n// and if successful, rebuilds the slice so that it fits into that parent.\n//\n// This addresses the problem that Transform.replace expects a\n// coherent slice, and will fail to place a set of siblings that don't\n// fit anywhere in the schema.\nfunction normalizeSiblings(fragment, $context) {\n if (fragment.childCount < 2)\n return fragment;\n for (let d = $context.depth; d >= 0; d--) {\n let parent = $context.node(d);\n let match = parent.contentMatchAt($context.index(d));\n let lastWrap, result = [];\n fragment.forEach(node => {\n if (!result)\n return;\n let wrap = match.findWrapping(node.type), inLast;\n if (!wrap)\n return result = null;\n if (inLast = result.length && lastWrap.length && addToSibling(wrap, lastWrap, node, result[result.length - 1], 0)) {\n result[result.length - 1] = inLast;\n }\n else {\n if (result.length)\n result[result.length - 1] = closeRight(result[result.length - 1], lastWrap.length);\n let wrapped = withWrappers(node, wrap);\n result.push(wrapped);\n match = match.matchType(wrapped.type);\n lastWrap = wrap;\n }\n });\n if (result)\n return Fragment.from(result);\n }\n return fragment;\n}\nfunction withWrappers(node, wrap, from = 0) {\n for (let i = wrap.length - 1; i >= from; i--)\n node = wrap[i].create(null, Fragment.from(node));\n return node;\n}\n// Used to group adjacent nodes wrapped in similar parents by\n// normalizeSiblings into the same parent node\nfunction addToSibling(wrap, lastWrap, node, sibling, depth) {\n if (depth < wrap.length && depth < lastWrap.length && wrap[depth] == lastWrap[depth]) {\n let inner = addToSibling(wrap, lastWrap, node, sibling.lastChild, depth + 1);\n if (inner)\n return sibling.copy(sibling.content.replaceChild(sibling.childCount - 1, inner));\n let match = sibling.contentMatchAt(sibling.childCount);\n if (match.matchType(depth == wrap.length - 1 ? node.type : wrap[depth + 1]))\n return sibling.copy(sibling.content.append(Fragment.from(withWrappers(node, wrap, depth + 1))));\n }\n}\nfunction closeRight(node, depth) {\n if (depth == 0)\n return node;\n let fragment = node.content.replaceChild(node.childCount - 1, closeRight(node.lastChild, depth - 1));\n let fill = node.contentMatchAt(node.childCount).fillBefore(Fragment.empty, true);\n return node.copy(fragment.append(fill));\n}\nfunction closeRange(fragment, side, from, to, depth, openEnd) {\n let node = side < 0 ? fragment.firstChild : fragment.lastChild, inner = node.content;\n if (depth < to - 1)\n inner = closeRange(inner, side, from, to, depth + 1, openEnd);\n if (depth >= from)\n inner = side < 0 ? node.contentMatchAt(0).fillBefore(inner, fragment.childCount > 1 || openEnd <= depth).append(inner)\n : inner.append(node.contentMatchAt(node.childCount).fillBefore(Fragment.empty, true));\n return fragment.replaceChild(side < 0 ? 0 : fragment.childCount - 1, node.copy(inner));\n}\nfunction closeSlice(slice, openStart, openEnd) {\n if (openStart < slice.openStart)\n slice = new Slice(closeRange(slice.content, -1, openStart, slice.openStart, 0, slice.openEnd), openStart, slice.openEnd);\n if (openEnd < slice.openEnd)\n slice = new Slice(closeRange(slice.content, 1, openEnd, slice.openEnd, 0, 0), slice.openStart, openEnd);\n return slice;\n}\n// Trick from jQuery -- some elements must be wrapped in other\n// elements for innerHTML to work. I.e. if you do `div.innerHTML =\n// \"<td>..</td>\"` the table cells are ignored.\nconst wrapMap = {\n thead: [\"table\"],\n tbody: [\"table\"],\n tfoot: [\"table\"],\n caption: [\"table\"],\n colgroup: [\"table\"],\n col: [\"table\", \"colgroup\"],\n tr: [\"table\", \"tbody\"],\n td: [\"table\", \"tbody\", \"tr\"],\n th: [\"table\", \"tbody\", \"tr\"]\n};\nlet _detachedDoc = null;\nfunction detachedDoc() {\n return _detachedDoc || (_detachedDoc = document.implementation.createHTMLDocument(\"title\"));\n}\nfunction readHTML(html) {\n let metas = /^(\\s*<meta [^>]*>)*/.exec(html);\n if (metas)\n html = html.slice(metas[0].length);\n let elt = detachedDoc().createElement(\"div\");\n let firstTag = /<([a-z][^>\\s]+)/i.exec(html), wrap;\n if (wrap = firstTag && wrapMap[firstTag[1].toLowerCase()])\n html = wrap.map(n => \"<\" + n + \">\").join(\"\") + html + wrap.map(n => \"</\" + n + \">\").reverse().join(\"\");\n elt.innerHTML = html;\n if (wrap)\n for (let i = 0; i < wrap.length; i++)\n elt = elt.querySelector(wrap[i]) || elt;\n return elt;\n}\n// Webkit browsers do some hard-to-predict replacement of regular\n// spaces with non-breaking spaces when putting content on the\n// clipboard. This tries to convert such non-breaking spaces (which\n// will be wrapped in a plain span on Chrome, a span with class\n// Apple-converted-space on Safari) back to regular spaces.\nfunction restoreReplacedSpaces(dom) {\n let nodes = dom.querySelectorAll(chrome ? \"span:not([class]):not([style])\" : \"span.Apple-converted-space\");\n for (let i = 0; i < nodes.length; i++) {\n let node = nodes[i];\n if (node.childNodes.length == 1 && node.textContent == \"\\u00a0\" && node.parentNode)\n node.parentNode.replaceChild(dom.ownerDocument.createTextNode(\" \"), node);\n }\n}\nfunction addContext(slice, context) {\n if (!slice.size)\n return slice;\n let schema = slice.content.firstChild.type.schema, array;\n try {\n array = JSON.parse(context);\n }\n catch (e) {\n return slice;\n }\n let { content, openStart, openEnd } = slice;\n for (let i = array.length - 2; i >= 0; i -= 2) {\n let type = schema.nodes[array[i]];\n if (!type || type.hasRequiredAttrs())\n break;\n content = Fragment.from(type.create(array[i + 1], content));\n openStart++;\n openEnd++;\n }\n return new Slice(content, openStart, openEnd);\n}\n\n// A collection of DOM events that occur within the editor, and callback functions\n// to invoke when the event fires.\nconst handlers = {};\nlet editHandlers = {};\nclass InputState {\n constructor() {\n this.shiftKey = false;\n this.mouseDown = null;\n this.lastKeyCode = null;\n this.lastKeyCodeTime = 0;\n this.lastClick = { time: 0, x: 0, y: 0, type: \"\" };\n this.lastSelectionOrigin = null;\n this.lastSelectionTime = 0;\n this.lastIOSEnter = 0;\n this.lastIOSEnterFallbackTimeout = -1;\n this.lastAndroidDelete = 0;\n this.composing = false;\n this.composingTimeout = -1;\n this.compositionNodes = [];\n this.compositionEndedAt = -2e8;\n this.domChangeCount = 0;\n this.eventHandlers = Object.create(null);\n this.hideSelectionGuard = null;\n }\n}\nfunction initInput(view) {\n for (let event in handlers) {\n let handler = handlers[event];\n view.dom.addEventListener(event, view.input.eventHandlers[event] = (event) => {\n if (eventBelongsToView(view, event) && !runCustomHandler(view, event) &&\n (view.editable || !(event.type in editHandlers)))\n handler(view, event);\n });\n }\n // On Safari, for reasons beyond my understanding, adding an input\n // event handler makes an issue where the composition vanishes when\n // you press enter go away.\n if (safari)\n view.dom.addEventListener(\"input\", () => null);\n ensureListeners(view);\n}\nfunction setSelectionOrigin(view, origin) {\n view.input.lastSelectionOrigin = origin;\n view.input.lastSelectionTime = Date.now();\n}\nfunction destroyInput(view) {\n view.domObserver.stop();\n for (let type in view.input.eventHandlers)\n view.dom.removeEventListener(type, view.input.eventHandlers[type]);\n clearTimeout(view.input.composingTimeout);\n clearTimeout(view.input.lastIOSEnterFallbackTimeout);\n}\nfunction ensureListeners(view) {\n view.someProp(\"handleDOMEvents\", currentHandlers => {\n for (let type in currentHandlers)\n if (!view.input.eventHandlers[type])\n view.dom.addEventListener(type, view.input.eventHandlers[type] = event => runCustomHandler(view, event));\n });\n}\nfunction runCustomHandler(view, event) {\n return view.someProp(\"handleDOMEvents\", handlers => {\n let handler = handlers[event.type];\n return handler ? handler(view, event) || event.defaultPrevented : false;\n });\n}\nfunction eventBelongsToView(view, event) {\n if (!event.bubbles)\n return true;\n if (event.defaultPrevented)\n return false;\n for (let node = event.target; node != view.dom; node = node.parentNode)\n if (!node || node.nodeType == 11 ||\n (node.pmViewDesc && node.pmViewDesc.stopEvent(event)))\n return false;\n return true;\n}\nfunction dispatchEvent(view, event) {\n if (!runCustomHandler(view, event) && handlers[event.type] &&\n (view.editable || !(event.type in editHandlers)))\n handlers[event.type](view, event);\n}\neditHandlers.keydown = (view, _event) => {\n let event = _event;\n view.input.shiftKey = event.keyCode == 16 || event.shiftKey;\n if (inOrNearComposition(view, event))\n return;\n view.input.lastKeyCode = event.keyCode;\n view.input.lastKeyCodeTime = Date.now();\n // Suppress enter key events on Chrome Android, because those tend\n // to be part of a confused sequence of composition events fired,\n // and handling them eagerly tends to corrupt the input.\n if (android && chrome && event.keyCode == 13)\n return;\n if (event.keyCode != 229)\n view.domObserver.forceFlush();\n // On iOS, if we preventDefault enter key presses, the virtual\n // keyboard gets confused. So the hack here is to set a flag that\n // makes the DOM change code recognize that what just happens should\n // be replaced by whatever the Enter key handlers do.\n if (ios && event.keyCode == 13 && !event.ctrlKey && !event.altKey && !event.metaKey) {\n let now = Date.now();\n view.input.lastIOSEnter = now;\n view.input.lastIOSEnterFallbackTimeout = setTimeout(() => {\n if (view.input.lastIOSEnter == now) {\n view.someProp(\"handleKeyDown\", f => f(view, keyEvent(13, \"Enter\")));\n view.input.lastIOSEnter = 0;\n }\n }, 200);\n }\n else if (view.someProp(\"handleKeyDown\", f => f(view, event)) || captureKeyDown(view, event)) {\n event.preventDefault();\n }\n else {\n setSelectionOrigin(view, \"key\");\n }\n};\neditHandlers.keyup = (view, event) => {\n if (event.keyCode == 16)\n view.input.shiftKey = false;\n};\neditHandlers.keypress = (view, _event) => {\n let event = _event;\n if (inOrNearComposition(view, event) || !event.charCode ||\n event.ctrlKey && !event.altKey || mac && event.metaKey)\n return;\n if (view.someProp(\"handleKeyPress\", f => f(view, event))) {\n event.preventDefault();\n return;\n }\n let sel = view.state.selection;\n if (!(sel instanceof TextSelection) || !sel.$from.sameParent(sel.$to)) {\n let text = String.fromCharCode(event.charCode);\n if (!view.someProp(\"handleTextInput\", f => f(view, sel.$from.pos, sel.$to.pos, text)))\n view.dispatch(view.state.tr.insertText(text).scrollIntoView());\n event.preventDefault();\n }\n};\nfunction eventCoords(event) { return { left: event.clientX, top: event.clientY }; }\nfunction isNear(event, click) {\n let dx = click.x - event.clientX, dy = click.y - event.clientY;\n return dx * dx + dy * dy < 100;\n}\nfunction runHandlerOnContext(view, propName, pos, inside, event) {\n if (inside == -1)\n return false;\n let $pos = view.state.doc.resolve(inside);\n for (let i = $pos.depth + 1; i > 0; i--) {\n if (view.someProp(propName, f => i > $pos.depth ? f(view, pos, $pos.nodeAfter, $pos.before(i), event, true)\n : f(view, pos, $pos.node(i), $pos.before(i), event, false)))\n return true;\n }\n return false;\n}\nfunction updateSelection(view, selection, origin) {\n if (!view.focused)\n view.focus();\n let tr = view.state.tr.setSelection(selection);\n if (origin == \"pointer\")\n tr.setMeta(\"pointer\", true);\n view.dispatch(tr);\n}\nfunction selectClickedLeaf(view, inside) {\n if (inside == -1)\n return false;\n let $pos = view.state.doc.resolve(inside), node = $pos.nodeAfter;\n if (node && node.isAtom && NodeSelection.isSelectable(node)) {\n updateSelection(view, new NodeSelection($pos), \"pointer\");\n return true;\n }\n return false;\n}\nfunction selectClickedNode(view, inside) {\n if (inside == -1)\n return false;\n let sel = view.state.selection, selectedNode, selectAt;\n if (sel instanceof NodeSelection)\n selectedNode = sel.node;\n let $pos = view.state.doc.resolve(inside);\n for (let i = $pos.depth + 1; i > 0; i--) {\n let node = i > $pos.depth ? $pos.nodeAfter : $pos.node(i);\n if (NodeSelection.isSelectable(node)) {\n if (selectedNode && sel.$from.depth > 0 &&\n i >= sel.$from.depth && $pos.before(sel.$from.depth + 1) == sel.$from.pos)\n selectAt = $pos.before(sel.$from.depth);\n else\n selectAt = $pos.before(i);\n break;\n }\n }\n if (selectAt != null) {\n updateSelection(view, NodeSelection.create(view.state.doc, selectAt), \"pointer\");\n return true;\n }\n else {\n return false;\n }\n}\nfunction handleSingleClick(view, pos, inside, event, selectNode) {\n return runHandlerOnContext(view, \"handleClickOn\", pos, inside, event) ||\n view.someProp(\"handleClick\", f => f(view, pos, event)) ||\n (selectNode ? selectClickedNode(view, inside) : selectClickedLeaf(view, inside));\n}\nfunction handleDoubleClick(view, pos, inside, event) {\n return runHandlerOnContext(view, \"handleDoubleClickOn\", pos, inside, event) ||\n view.someProp(\"handleDoubleClick\", f => f(view, pos, event));\n}\nfunction handleTripleClick(view, pos, inside, event) {\n return runHandlerOnContext(view, \"handleTripleClickOn\", pos, inside, event) ||\n view.someProp(\"handleTripleClick\", f => f(view, pos, event)) ||\n defaultTripleClick(view, inside, event);\n}\nfunction defaultTripleClick(view, inside, event) {\n if (event.button != 0)\n return false;\n let doc = view.state.doc;\n if (inside == -1) {\n if (doc.inlineContent) {\n updateSelection(view, TextSelection.create(doc, 0, doc.content.size), \"pointer\");\n return true;\n }\n return false;\n }\n let $pos = doc.resolve(inside);\n for (let i = $pos.depth + 1; i > 0; i--) {\n let node = i > $pos.depth ? $pos.nodeAfter : $pos.node(i);\n let nodePos = $pos.before(i);\n if (node.inlineContent)\n updateSelection(view, TextSelection.create(doc, nodePos + 1, nodePos + 1 + node.content.size), \"pointer\");\n else if (NodeSelection.isSelectable(node))\n updateSelection(view, NodeSelection.create(doc, nodePos), \"pointer\");\n else\n continue;\n return true;\n }\n}\nfunction forceDOMFlush(view) {\n return endComposition(view);\n}\nconst selectNodeModifier = mac ? \"metaKey\" : \"ctrlKey\";\nhandlers.mousedown = (view, _event) => {\n let event = _event;\n view.input.shiftKey = event.shiftKey;\n let flushed = forceDOMFlush(view);\n let now = Date.now(), type = \"singleClick\";\n if (now - view.input.lastClick.time < 500 && isNear(event, view.input.lastClick) && !event[selectNodeModifier]) {\n if (view.input.lastClick.type == \"singleClick\")\n type = \"doubleClick\";\n else if (view.input.lastClick.type == \"doubleClick\")\n type = \"tripleClick\";\n }\n view.input.lastClick = { time: now, x: event.clientX, y: event.clientY, type };\n let pos = view.posAtCoords(eventCoords(event));\n if (!pos)\n return;\n if (type == \"singleClick\") {\n if (view.input.mouseDown)\n view.input.mouseDown.done();\n view.input.mouseDown = new MouseDown(view, pos, event, !!flushed);\n }\n else if ((type == \"doubleClick\" ? handleDoubleClick : handleTripleClick)(view, pos.pos, pos.inside, event)) {\n event.preventDefault();\n }\n else {\n setSelectionOrigin(view, \"pointer\");\n }\n};\nclass MouseDown {\n constructor(view, pos, event, flushed) {\n this.view = view;\n this.pos = pos;\n this.event = event;\n this.flushed = flushed;\n this.delayedSelectionSync = false;\n this.mightDrag = null;\n this.startDoc = view.state.doc;\n this.selectNode = !!event[selectNodeModifier];\n this.allowDefault = event.shiftKey;\n let targetNode, targetPos;\n if (pos.inside > -1) {\n targetNode = view.state.doc.nodeAt(pos.inside);\n targetPos = pos.inside;\n }\n else {\n let $pos = view.state.doc.resolve(pos.pos);\n targetNode = $pos.parent;\n targetPos = $pos.depth ? $pos.before() : 0;\n }\n const target = flushed ? null : event.target;\n const targetDesc = target ? view.docView.nearestDesc(target, true) : null;\n this.target = targetDesc ? targetDesc.dom : null;\n let { selection } = view.state;\n if (event.button == 0 &&\n targetNode.type.spec.draggable && targetNode.type.spec.selectable !== false ||\n selection instanceof NodeSelection && selection.from <= targetPos && selection.to > targetPos)\n this.mightDrag = {\n node: targetNode,\n pos: targetPos,\n addAttr: !!(this.target && !this.target.draggable),\n setUneditable: !!(this.target && gecko && !this.target.hasAttribute(\"contentEditable\"))\n };\n if (this.target && this.mightDrag && (this.mightDrag.addAttr || this.mightDrag.setUneditable)) {\n this.view.domObserver.stop();\n if (this.mightDrag.addAttr)\n this.target.draggable = true;\n if (this.mightDrag.setUneditable)\n setTimeout(() => {\n if (this.view.input.mouseDown == this)\n this.target.setAttribute(\"contentEditable\", \"false\");\n }, 20);\n this.view.domObserver.start();\n }\n view.root.addEventListener(\"mouseup\", this.up = this.up.bind(this));\n view.root.addEventListener(\"mousemove\", this.move = this.move.bind(this));\n setSelectionOrigin(view, \"pointer\");\n }\n done() {\n this.view.root.removeEventListener(\"mouseup\", this.up);\n this.view.root.removeEventListener(\"mousemove\", this.move);\n if (this.mightDrag && this.target) {\n this.view.domObserver.stop();\n if (this.mightDrag.addAttr)\n this.target.removeAttribute(\"draggable\");\n if (this.mightDrag.setUneditable)\n this.target.removeAttribute(\"contentEditable\");\n this.view.domObserver.start();\n }\n if (this.delayedSelectionSync)\n setTimeout(() => selectionToDOM(this.view));\n this.view.input.mouseDown = null;\n }\n up(event) {\n this.done();\n if (!this.view.dom.contains(event.target))\n return;\n let pos = this.pos;\n if (this.view.state.doc != this.startDoc)\n pos = this.view.posAtCoords(eventCoords(event));\n if (this.allowDefault || !pos) {\n setSelectionOrigin(this.view, \"pointer\");\n }\n else if (handleSingleClick(this.view, pos.pos, pos.inside, event, this.selectNode)) {\n event.preventDefault();\n }\n else if (event.button == 0 &&\n (this.flushed ||\n // Safari ignores clicks on draggable elements\n (safari && this.mightDrag && !this.mightDrag.node.isAtom) ||\n // Chrome will sometimes treat a node selection as a\n // cursor, but still report that the node is selected\n // when asked through getSelection. You'll then get a\n // situation where clicking at the point where that\n // (hidden) cursor is doesn't change the selection, and\n // thus doesn't get a reaction from ProseMirror. This\n // works around that.\n (chrome && !(this.view.state.selection instanceof TextSelection) &&\n Math.min(Math.abs(pos.pos - this.view.state.selection.from), Math.abs(pos.pos - this.view.state.selection.to)) <= 2))) {\n updateSelection(this.view, Selection.near(this.view.state.doc.resolve(pos.pos)), \"pointer\");\n event.preventDefault();\n }\n else {\n setSelectionOrigin(this.view, \"pointer\");\n }\n }\n move(event) {\n if (!this.allowDefault && (Math.abs(this.event.x - event.clientX) > 4 ||\n Math.abs(this.event.y - event.clientY) > 4))\n this.allowDefault = true;\n setSelectionOrigin(this.view, \"pointer\");\n if (event.buttons == 0)\n this.done();\n }\n}\nhandlers.touchdown = view => {\n forceDOMFlush(view);\n setSelectionOrigin(view, \"pointer\");\n};\nhandlers.contextmenu = view => forceDOMFlush(view);\nfunction inOrNearComposition(view, event) {\n if (view.composing)\n return true;\n // See https://www.stum.de/2016/06/24/handling-ime-events-in-javascript/.\n // On Japanese input method editors (IMEs), the Enter key is used to confirm character\n // selection. On Safari, when Enter is pressed, compositionend and keydown events are\n // emitted. The keydown event triggers newline insertion, which we don't want.\n // This method returns true if the keydown event should be ignored.\n // We only ignore it once, as pressing Enter a second time *should* insert a newline.\n // Furthermore, the keydown event timestamp must be close to the compositionEndedAt timestamp.\n // This guards against the case where compositionend is triggered without the keyboard\n // (e.g. character confirmation may be done with the mouse), and keydown is triggered\n // afterwards- we wouldn't want to ignore the keydown event in this case.\n if (safari && Math.abs(event.timeStamp - view.input.compositionEndedAt) < 500) {\n view.input.compositionEndedAt = -2e8;\n return true;\n }\n return false;\n}\n// Drop active composition after 5 seconds of inactivity on Android\nconst timeoutComposition = android ? 5000 : -1;\neditHandlers.compositionstart = editHandlers.compositionupdate = view => {\n if (!view.composing) {\n view.domObserver.flush();\n let { state } = view, $pos = state.selection.$from;\n if (state.selection.empty &&\n (state.storedMarks ||\n (!$pos.textOffset && $pos.parentOffset && $pos.nodeBefore.marks.some(m => m.type.spec.inclusive === false)))) {\n // Need to wrap the cursor in mark nodes different from the ones in the DOM context\n view.markCursor = view.state.storedMarks || $pos.marks();\n endComposition(view, true);\n view.markCursor = null;\n }\n else {\n endComposition(view);\n // In firefox, if the cursor is after but outside a marked node,\n // the inserted text won't inherit the marks. So this moves it\n // inside if necessary.\n if (gecko && state.selection.empty && $pos.parentOffset && !$pos.textOffset && $pos.nodeBefore.marks.length) {\n let sel = view.domSelection();\n for (let node = sel.focusNode, offset = sel.focusOffset; node && node.nodeType == 1 && offset != 0;) {\n let before = offset < 0 ? node.lastChild : node.childNodes[offset - 1];\n if (!before)\n break;\n if (before.nodeType == 3) {\n sel.collapse(before, before.nodeValue.length);\n break;\n }\n else {\n node = before;\n offset = -1;\n }\n }\n }\n }\n view.input.composing = true;\n }\n scheduleComposeEnd(view, timeoutComposition);\n};\neditHandlers.compositionend = (view, event) => {\n if (view.composing) {\n view.input.composing = false;\n view.input.compositionEndedAt = event.timeStamp;\n scheduleComposeEnd(view, 20);\n }\n};\nfunction scheduleComposeEnd(view, delay) {\n clearTimeout(view.input.composingTimeout);\n if (delay > -1)\n view.input.composingTimeout = setTimeout(() => endComposition(view), delay);\n}\nfunction clearComposition(view) {\n if (view.composing) {\n view.input.composing = false;\n view.input.compositionEndedAt = timestampFromCustomEvent();\n }\n while (view.input.compositionNodes.length > 0)\n view.input.compositionNodes.pop().markParentsDirty();\n}\nfunction timestampFromCustomEvent() {\n let event = document.createEvent(\"Event\");\n event.initEvent(\"event\", true, true);\n return event.timeStamp;\n}\n/**\n@internal\n*/\nfunction endComposition(view, forceUpdate = false) {\n if (android && view.domObserver.flushingSoon >= 0)\n return;\n view.domObserver.forceFlush();\n clearComposition(view);\n if (forceUpdate || view.docView && view.docView.dirty) {\n let sel = selectionFromDOM(view);\n if (sel && !sel.eq(view.state.selection))\n view.dispatch(view.state.tr.setSelection(sel));\n else\n view.updateState(view.state);\n return true;\n }\n return false;\n}\nfunction captureCopy(view, dom) {\n // The extra wrapper is somehow necessary on IE/Edge to prevent the\n // content from being mangled when it is put onto the clipboard\n if (!view.dom.parentNode)\n return;\n let wrap = view.dom.parentNode.appendChild(document.createElement(\"div\"));\n wrap.appendChild(dom);\n wrap.style.cssText = \"position: fixed; left: -10000px; top: 10px\";\n let sel = getSelection(), range = document.createRange();\n range.selectNodeContents(dom);\n // Done because IE will fire a selectionchange moving the selection\n // to its start when removeAllRanges is called and the editor still\n // has focus (which will mess up the editor's selection state).\n view.dom.blur();\n sel.removeAllRanges();\n sel.addRange(range);\n setTimeout(() => {\n if (wrap.parentNode)\n wrap.parentNode.removeChild(wrap);\n view.focus();\n }, 50);\n}\n// This is very crude, but unfortunately both these browsers _pretend_\n// that they have a clipboard API—all the objects and methods are\n// there, they just don't work, and they are hard to test.\nconst brokenClipboardAPI = (ie && ie_version < 15) ||\n (ios && webkit_version < 604);\nhandlers.copy = editHandlers.cut = (view, _event) => {\n let event = _event;\n let sel = view.state.selection, cut = event.type == \"cut\";\n if (sel.empty)\n return;\n // IE and Edge's clipboard interface is completely broken\n let data = brokenClipboardAPI ? null : event.clipboardData;\n let slice = sel.content(), { dom, text } = serializeForClipboard(view, slice);\n if (data) {\n event.preventDefault();\n data.clearData();\n data.setData(\"text/html\", dom.innerHTML);\n data.setData(\"text/plain\", text);\n }\n else {\n captureCopy(view, dom);\n }\n if (cut)\n view.dispatch(view.state.tr.deleteSelection().scrollIntoView().setMeta(\"uiEvent\", \"cut\"));\n};\nfunction sliceSingleNode(slice) {\n return slice.openStart == 0 && slice.openEnd == 0 && slice.content.childCount == 1 ? slice.content.firstChild : null;\n}\nfunction capturePaste(view, event) {\n if (!view.dom.parentNode)\n return;\n let plainText = view.input.shiftKey || view.state.selection.$from.parent.type.spec.code;\n let target = view.dom.parentNode.appendChild(document.createElement(plainText ? \"textarea\" : \"div\"));\n if (!plainText)\n target.contentEditable = \"true\";\n target.style.cssText = \"position: fixed; left: -10000px; top: 10px\";\n target.focus();\n setTimeout(() => {\n view.focus();\n if (target.parentNode)\n target.parentNode.removeChild(target);\n if (plainText)\n doPaste(view, target.value, null, event);\n else\n doPaste(view, target.textContent, target.innerHTML, event);\n }, 50);\n}\nfunction doPaste(view, text, html, event) {\n let slice = parseFromClipboard(view, text, html, view.input.shiftKey, view.state.selection.$from);\n if (view.someProp(\"handlePaste\", f => f(view, event, slice || Slice.empty)))\n return true;\n if (!slice)\n return false;\n let singleNode = sliceSingleNode(slice);\n let tr = singleNode\n ? view.state.tr.replaceSelectionWith(singleNode, view.input.shiftKey)\n : view.state.tr.replaceSelection(slice);\n view.dispatch(tr.scrollIntoView().setMeta(\"paste\", true).setMeta(\"uiEvent\", \"paste\"));\n return true;\n}\neditHandlers.paste = (view, _event) => {\n let event = _event;\n // Handling paste from JavaScript during composition is very poorly\n // handled by browsers, so as a dodgy but preferable kludge, we just\n // let the browser do its native thing there, except on Android,\n // where the editor is almost always composing.\n if (view.composing && !android)\n return;\n let data = brokenClipboardAPI ? null : event.clipboardData;\n if (data && doPaste(view, data.getData(\"text/plain\"), data.getData(\"text/html\"), event))\n event.preventDefault();\n else\n capturePaste(view, event);\n};\nclass Dragging {\n constructor(slice, move) {\n this.slice = slice;\n this.move = move;\n }\n}\nconst dragCopyModifier = mac ? \"altKey\" : \"ctrlKey\";\nhandlers.dragstart = (view, _event) => {\n let event = _event;\n let mouseDown = view.input.mouseDown;\n if (mouseDown)\n mouseDown.done();\n if (!event.dataTransfer)\n return;\n let sel = view.state.selection;\n let pos = sel.empty ? null : view.posAtCoords(eventCoords(event));\n if (pos && pos.pos >= sel.from && pos.pos <= (sel instanceof NodeSelection ? sel.to - 1 : sel.to)) ;\n else if (mouseDown && mouseDown.mightDrag) {\n view.dispatch(view.state.tr.setSelection(NodeSelection.create(view.state.doc, mouseDown.mightDrag.pos)));\n }\n else if (event.target && event.target.nodeType == 1) {\n let desc = view.docView.nearestDesc(event.target, true);\n if (desc && desc.node.type.spec.draggable && desc != view.docView)\n view.dispatch(view.state.tr.setSelection(NodeSelection.create(view.state.doc, desc.posBefore)));\n }\n let slice = view.state.selection.content(), { dom, text } = serializeForClipboard(view, slice);\n event.dataTransfer.clearData();\n event.dataTransfer.setData(brokenClipboardAPI ? \"Text\" : \"text/html\", dom.innerHTML);\n // See https://github.com/ProseMirror/prosemirror/issues/1156\n event.dataTransfer.effectAllowed = \"copyMove\";\n if (!brokenClipboardAPI)\n event.dataTransfer.setData(\"text/plain\", text);\n view.dragging = new Dragging(slice, !event[dragCopyModifier]);\n};\nhandlers.dragend = view => {\n let dragging = view.dragging;\n window.setTimeout(() => {\n if (view.dragging == dragging)\n view.dragging = null;\n }, 50);\n};\neditHandlers.dragover = editHandlers.dragenter = (_, e) => e.preventDefault();\neditHandlers.drop = (view, _event) => {\n let event = _event;\n let dragging = view.dragging;\n view.dragging = null;\n if (!event.dataTransfer)\n return;\n let eventPos = view.posAtCoords(eventCoords(event));\n if (!eventPos)\n return;\n let $mouse = view.state.doc.resolve(eventPos.pos);\n if (!$mouse)\n return;\n let slice = dragging && dragging.slice;\n if (slice) {\n view.someProp(\"transformPasted\", f => { slice = f(slice); });\n }\n else {\n slice = parseFromClipboard(view, event.dataTransfer.getData(brokenClipboardAPI ? \"Text\" : \"text/plain\"), brokenClipboardAPI ? null : event.dataTransfer.getData(\"text/html\"), false, $mouse);\n }\n let move = !!(dragging && !event[dragCopyModifier]);\n if (view.someProp(\"handleDrop\", f => f(view, event, slice || Slice.empty, move))) {\n event.preventDefault();\n return;\n }\n if (!slice)\n return;\n event.preventDefault();\n let insertPos = slice ? dropPoint(view.state.doc, $mouse.pos, slice) : $mouse.pos;\n if (insertPos == null)\n insertPos = $mouse.pos;\n let tr = view.state.tr;\n if (move)\n tr.deleteSelection();\n let pos = tr.mapping.map(insertPos);\n let isNode = slice.openStart == 0 && slice.openEnd == 0 && slice.content.childCount == 1;\n let beforeInsert = tr.doc;\n if (isNode)\n tr.replaceRangeWith(pos, pos, slice.content.firstChild);\n else\n tr.replaceRange(pos, pos, slice);\n if (tr.doc.eq(beforeInsert))\n return;\n let $pos = tr.doc.resolve(pos);\n if (isNode && NodeSelection.isSelectable(slice.content.firstChild) &&\n $pos.nodeAfter && $pos.nodeAfter.sameMarkup(slice.content.firstChild)) {\n tr.setSelection(new NodeSelection($pos));\n }\n else {\n let end = tr.mapping.map(insertPos);\n tr.mapping.maps[tr.mapping.maps.length - 1].forEach((_from, _to, _newFrom, newTo) => end = newTo);\n tr.setSelection(selectionBetween(view, $pos, tr.doc.resolve(end)));\n }\n view.focus();\n view.dispatch(tr.setMeta(\"uiEvent\", \"drop\"));\n};\nhandlers.focus = view => {\n if (!view.focused) {\n view.domObserver.stop();\n view.dom.classList.add(\"ProseMirror-focused\");\n view.domObserver.start();\n view.focused = true;\n setTimeout(() => {\n if (view.docView && view.hasFocus() && !view.domObserver.currentSelection.eq(view.domSelection()))\n selectionToDOM(view);\n }, 20);\n }\n};\nhandlers.blur = (view, _event) => {\n let event = _event;\n if (view.focused) {\n view.domObserver.stop();\n view.dom.classList.remove(\"ProseMirror-focused\");\n view.domObserver.start();\n if (event.relatedTarget && view.dom.contains(event.relatedTarget))\n view.domObserver.currentSelection.clear();\n view.focused = false;\n }\n};\nhandlers.beforeinput = (view, _event) => {\n let event = _event;\n // We should probably do more with beforeinput events, but support\n // is so spotty that I'm still waiting to see where they are going.\n // Very specific hack to deal with backspace sometimes failing on\n // Chrome Android when after an uneditable node.\n if (chrome && android && event.inputType == \"deleteContentBackward\") {\n view.domObserver.flushSoon();\n let { domChangeCount } = view.input;\n setTimeout(() => {\n if (view.input.domChangeCount != domChangeCount)\n return; // Event already had some effect\n // This bug tends to close the virtual keyboard, so we refocus\n view.dom.blur();\n view.focus();\n if (view.someProp(\"handleKeyDown\", f => f(view, keyEvent(8, \"Backspace\"))))\n return;\n let { $cursor } = view.state.selection;\n // Crude approximation of backspace behavior when no command handled it\n if ($cursor && $cursor.pos > 0)\n view.dispatch(view.state.tr.delete($cursor.pos - 1, $cursor.pos).scrollIntoView());\n }, 50);\n }\n};\n// Make sure all handlers get registered\nfor (let prop in editHandlers)\n handlers[prop] = editHandlers[prop];\n\nfunction compareObjs(a, b) {\n if (a == b)\n return true;\n for (let p in a)\n if (a[p] !== b[p])\n return false;\n for (let p in b)\n if (!(p in a))\n return false;\n return true;\n}\nclass WidgetType {\n constructor(toDOM, spec) {\n this.toDOM = toDOM;\n this.spec = spec || noSpec;\n this.side = this.spec.side || 0;\n }\n map(mapping, span, offset, oldOffset) {\n let { pos, deleted } = mapping.mapResult(span.from + oldOffset, this.side < 0 ? -1 : 1);\n return deleted ? null : new Decoration(pos - offset, pos - offset, this);\n }\n valid() { return true; }\n eq(other) {\n return this == other ||\n (other instanceof WidgetType &&\n (this.spec.key && this.spec.key == other.spec.key ||\n this.toDOM == other.toDOM && compareObjs(this.spec, other.spec)));\n }\n destroy(node) {\n if (this.spec.destroy)\n this.spec.destroy(node);\n }\n}\nclass InlineType {\n constructor(attrs, spec) {\n this.attrs = attrs;\n this.spec = spec || noSpec;\n }\n map(mapping, span, offset, oldOffset) {\n let from = mapping.map(span.from + oldOffset, this.spec.inclusiveStart ? -1 : 1) - offset;\n let to = mapping.map(span.to + oldOffset, this.spec.inclusiveEnd ? 1 : -1) - offset;\n return from >= to ? null : new Decoration(from, to, this);\n }\n valid(_, span) { return span.from < span.to; }\n eq(other) {\n return this == other ||\n (other instanceof InlineType && compareObjs(this.attrs, other.attrs) &&\n compareObjs(this.spec, other.spec));\n }\n static is(span) { return span.type instanceof InlineType; }\n destroy() { }\n}\nclass NodeType {\n constructor(attrs, spec) {\n this.attrs = attrs;\n this.spec = spec || noSpec;\n }\n map(mapping, span, offset, oldOffset) {\n let from = mapping.mapResult(span.from + oldOffset, 1);\n if (from.deleted)\n return null;\n let to = mapping.mapResult(span.to + oldOffset, -1);\n if (to.deleted || to.pos <= from.pos)\n return null;\n return new Decoration(from.pos - offset, to.pos - offset, this);\n }\n valid(node, span) {\n let { index, offset } = node.content.findIndex(span.from), child;\n return offset == span.from && !(child = node.child(index)).isText && offset + child.nodeSize == span.to;\n }\n eq(other) {\n return this == other ||\n (other instanceof NodeType && compareObjs(this.attrs, other.attrs) &&\n compareObjs(this.spec, other.spec));\n }\n destroy() { }\n}\n/**\nDecoration objects can be provided to the view through the\n[`decorations` prop](https://prosemirror.net/docs/ref/#view.EditorProps.decorations). They come in\nseveral variants—see the static members of this class for details.\n*/\nclass Decoration {\n /**\n @internal\n */\n constructor(\n /**\n The start position of the decoration.\n */\n from, \n /**\n The end position. Will be the same as `from` for [widget\n decorations](https://prosemirror.net/docs/ref/#view.Decoration^widget).\n */\n to, \n /**\n @internal\n */\n type) {\n this.from = from;\n this.to = to;\n this.type = type;\n }\n /**\n @internal\n */\n copy(from, to) {\n return new Decoration(from, to, this.type);\n }\n /**\n @internal\n */\n eq(other, offset = 0) {\n return this.type.eq(other.type) && this.from + offset == other.from && this.to + offset == other.to;\n }\n /**\n @internal\n */\n map(mapping, offset, oldOffset) {\n return this.type.map(mapping, this, offset, oldOffset);\n }\n /**\n Creates a widget decoration, which is a DOM node that's shown in\n the document at the given position. It is recommended that you\n delay rendering the widget by passing a function that will be\n called when the widget is actually drawn in a view, but you can\n also directly pass a DOM node. `getPos` can be used to find the\n widget's current document position.\n */\n static widget(pos, toDOM, spec) {\n return new Decoration(pos, pos, new WidgetType(toDOM, spec));\n }\n /**\n Creates an inline decoration, which adds the given attributes to\n each inline node between `from` and `to`.\n */\n static inline(from, to, attrs, spec) {\n return new Decoration(from, to, new InlineType(attrs, spec));\n }\n /**\n Creates a node decoration. `from` and `to` should point precisely\n before and after a node in the document. That node, and only that\n node, will receive the given attributes.\n */\n static node(from, to, attrs, spec) {\n return new Decoration(from, to, new NodeType(attrs, spec));\n }\n /**\n The spec provided when creating this decoration. Can be useful\n if you've stored extra information in that object.\n */\n get spec() { return this.type.spec; }\n /**\n @internal\n */\n get inline() { return this.type instanceof InlineType; }\n}\nconst none = [], noSpec = {};\n/**\nA collection of [decorations](https://prosemirror.net/docs/ref/#view.Decoration), organized in such\na way that the drawing algorithm can efficiently use and compare\nthem. This is a persistent data structure—it is not modified,\nupdates create a new value.\n*/\nclass DecorationSet {\n /**\n @internal\n */\n constructor(local, children) {\n this.local = local.length ? local : none;\n this.children = children.length ? children : none;\n }\n /**\n Create a set of decorations, using the structure of the given\n document.\n */\n static create(doc, decorations) {\n return decorations.length ? buildTree(decorations, doc, 0, noSpec) : empty;\n }\n /**\n Find all decorations in this set which touch the given range\n (including decorations that start or end directly at the\n boundaries) and match the given predicate on their spec. When\n `start` and `end` are omitted, all decorations in the set are\n considered. When `predicate` isn't given, all decorations are\n assumed to match.\n */\n find(start, end, predicate) {\n let result = [];\n this.findInner(start == null ? 0 : start, end == null ? 1e9 : end, result, 0, predicate);\n return result;\n }\n findInner(start, end, result, offset, predicate) {\n for (let i = 0; i < this.local.length; i++) {\n let span = this.local[i];\n if (span.from <= end && span.to >= start && (!predicate || predicate(span.spec)))\n result.push(span.copy(span.from + offset, span.to + offset));\n }\n for (let i = 0; i < this.children.length; i += 3) {\n if (this.children[i] < end && this.children[i + 1] > start) {\n let childOff = this.children[i] + 1;\n this.children[i + 2].findInner(start - childOff, end - childOff, result, offset + childOff, predicate);\n }\n }\n }\n /**\n Map the set of decorations in response to a change in the\n document.\n */\n map(mapping, doc, options) {\n if (this == empty || mapping.maps.length == 0)\n return this;\n return this.mapInner(mapping, doc, 0, 0, options || noSpec);\n }\n /**\n @internal\n */\n mapInner(mapping, node, offset, oldOffset, options) {\n let newLocal;\n for (let i = 0; i < this.local.length; i++) {\n let mapped = this.local[i].map(mapping, offset, oldOffset);\n if (mapped && mapped.type.valid(node, mapped))\n (newLocal || (newLocal = [])).push(mapped);\n else if (options.onRemove)\n options.onRemove(this.local[i].spec);\n }\n if (this.children.length)\n return mapChildren(this.children, newLocal || [], mapping, node, offset, oldOffset, options);\n else\n return newLocal ? new DecorationSet(newLocal.sort(byPos), none) : empty;\n }\n /**\n Add the given array of decorations to the ones in the set,\n producing a new set. Needs access to the current document to\n create the appropriate tree structure.\n */\n add(doc, decorations) {\n if (!decorations.length)\n return this;\n if (this == empty)\n return DecorationSet.create(doc, decorations);\n return this.addInner(doc, decorations, 0);\n }\n addInner(doc, decorations, offset) {\n let children, childIndex = 0;\n doc.forEach((childNode, childOffset) => {\n let baseOffset = childOffset + offset, found;\n if (!(found = takeSpansForNode(decorations, childNode, baseOffset)))\n return;\n if (!children)\n children = this.children.slice();\n while (childIndex < children.length && children[childIndex] < childOffset)\n childIndex += 3;\n if (children[childIndex] == childOffset)\n children[childIndex + 2] = children[childIndex + 2].addInner(childNode, found, baseOffset + 1);\n else\n children.splice(childIndex, 0, childOffset, childOffset + childNode.nodeSize, buildTree(found, childNode, baseOffset + 1, noSpec));\n childIndex += 3;\n });\n let local = moveSpans(childIndex ? withoutNulls(decorations) : decorations, -offset);\n for (let i = 0; i < local.length; i++)\n if (!local[i].type.valid(doc, local[i]))\n local.splice(i--, 1);\n return new DecorationSet(local.length ? this.local.concat(local).sort(byPos) : this.local, children || this.children);\n }\n /**\n Create a new set that contains the decorations in this set, minus\n the ones in the given array.\n */\n remove(decorations) {\n if (decorations.length == 0 || this == empty)\n return this;\n return this.removeInner(decorations, 0);\n }\n removeInner(decorations, offset) {\n let children = this.children, local = this.local;\n for (let i = 0; i < children.length; i += 3) {\n let found;\n let from = children[i] + offset, to = children[i + 1] + offset;\n for (let j = 0, span; j < decorations.length; j++)\n if (span = decorations[j]) {\n if (span.from > from && span.to < to) {\n decorations[j] = null;\n (found || (found = [])).push(span);\n }\n }\n if (!found)\n continue;\n if (children == this.children)\n children = this.children.slice();\n let removed = children[i + 2].removeInner(found, from + 1);\n if (removed != empty) {\n children[i + 2] = removed;\n }\n else {\n children.splice(i, 3);\n i -= 3;\n }\n }\n if (local.length)\n for (let i = 0, span; i < decorations.length; i++)\n if (span = decorations[i]) {\n for (let j = 0; j < local.length; j++)\n if (local[j].eq(span, offset)) {\n if (local == this.local)\n local = this.local.slice();\n local.splice(j--, 1);\n }\n }\n if (children == this.children && local == this.local)\n return this;\n return local.length || children.length ? new DecorationSet(local, children) : empty;\n }\n /**\n @internal\n */\n forChild(offset, node) {\n if (this == empty)\n return this;\n if (node.isLeaf)\n return DecorationSet.empty;\n let child, local;\n for (let i = 0; i < this.children.length; i += 3)\n if (this.children[i] >= offset) {\n if (this.children[i] == offset)\n child = this.children[i + 2];\n break;\n }\n let start = offset + 1, end = start + node.content.size;\n for (let i = 0; i < this.local.length; i++) {\n let dec = this.local[i];\n if (dec.from < end && dec.to > start && (dec.type instanceof InlineType)) {\n let from = Math.max(start, dec.from) - start, to = Math.min(end, dec.to) - start;\n if (from < to)\n (local || (local = [])).push(dec.copy(from, to));\n }\n }\n if (local) {\n let localSet = new DecorationSet(local.sort(byPos), none);\n return child ? new DecorationGroup([localSet, child]) : localSet;\n }\n return child || empty;\n }\n /**\n @internal\n */\n eq(other) {\n if (this == other)\n return true;\n if (!(other instanceof DecorationSet) ||\n this.local.length != other.local.length ||\n this.children.length != other.children.length)\n return false;\n for (let i = 0; i < this.local.length; i++)\n if (!this.local[i].eq(other.local[i]))\n return false;\n for (let i = 0; i < this.children.length; i += 3)\n if (this.children[i] != other.children[i] ||\n this.children[i + 1] != other.children[i + 1] ||\n !this.children[i + 2].eq(other.children[i + 2]))\n return false;\n return true;\n }\n /**\n @internal\n */\n locals(node) {\n return removeOverlap(this.localsInner(node));\n }\n /**\n @internal\n */\n localsInner(node) {\n if (this == empty)\n return none;\n if (node.inlineContent || !this.local.some(InlineType.is))\n return this.local;\n let result = [];\n for (let i = 0; i < this.local.length; i++) {\n if (!(this.local[i].type instanceof InlineType))\n result.push(this.local[i]);\n }\n return result;\n }\n}\n/**\nThe empty set of decorations.\n*/\nDecorationSet.empty = new DecorationSet([], []);\n/**\n@internal\n*/\nDecorationSet.removeOverlap = removeOverlap;\nconst empty = DecorationSet.empty;\n// An abstraction that allows the code dealing with decorations to\n// treat multiple DecorationSet objects as if it were a single object\n// with (a subset of) the same interface.\nclass DecorationGroup {\n constructor(members) {\n this.members = members;\n }\n map(mapping, doc) {\n const mappedDecos = this.members.map(member => member.map(mapping, doc, noSpec));\n return DecorationGroup.from(mappedDecos);\n }\n forChild(offset, child) {\n if (child.isLeaf)\n return DecorationSet.empty;\n let found = [];\n for (let i = 0; i < this.members.length; i++) {\n let result = this.members[i].forChild(offset, child);\n if (result == empty)\n continue;\n if (result instanceof DecorationGroup)\n found = found.concat(result.members);\n else\n found.push(result);\n }\n return DecorationGroup.from(found);\n }\n eq(other) {\n if (!(other instanceof DecorationGroup) ||\n other.members.length != this.members.length)\n return false;\n for (let i = 0; i < this.members.length; i++)\n if (!this.members[i].eq(other.members[i]))\n return false;\n return true;\n }\n locals(node) {\n let result, sorted = true;\n for (let i = 0; i < this.members.length; i++) {\n let locals = this.members[i].localsInner(node);\n if (!locals.length)\n continue;\n if (!result) {\n result = locals;\n }\n else {\n if (sorted) {\n result = result.slice();\n sorted = false;\n }\n for (let j = 0; j < locals.length; j++)\n result.push(locals[j]);\n }\n }\n return result ? removeOverlap(sorted ? result : result.sort(byPos)) : none;\n }\n // Create a group for the given array of decoration sets, or return\n // a single set when possible.\n static from(members) {\n switch (members.length) {\n case 0: return empty;\n case 1: return members[0];\n default: return new DecorationGroup(members);\n }\n }\n}\nfunction mapChildren(oldChildren, newLocal, mapping, node, offset, oldOffset, options) {\n let children = oldChildren.slice();\n // Mark the children that are directly touched by changes, and\n // move those that are after the changes.\n let shift = (oldStart, oldEnd, newStart, newEnd) => {\n for (let i = 0; i < children.length; i += 3) {\n let end = children[i + 1], dSize;\n if (end < 0 || oldStart > end + oldOffset)\n continue;\n let start = children[i] + oldOffset;\n if (oldEnd >= start) {\n children[i + 1] = oldStart <= start ? -2 : -1;\n }\n else if (newStart >= offset && (dSize = (newEnd - newStart) - (oldEnd - oldStart))) {\n children[i] += dSize;\n children[i + 1] += dSize;\n }\n }\n };\n for (let i = 0; i < mapping.maps.length; i++)\n mapping.maps[i].forEach(shift);\n // Find the child nodes that still correspond to a single node,\n // recursively call mapInner on them and update their positions.\n let mustRebuild = false;\n for (let i = 0; i < children.length; i += 3)\n if (children[i + 1] < 0) { // Touched nodes\n if (children[i + 1] == -2) {\n mustRebuild = true;\n children[i + 1] = -1;\n continue;\n }\n let from = mapping.map(oldChildren[i] + oldOffset), fromLocal = from - offset;\n if (fromLocal < 0 || fromLocal >= node.content.size) {\n mustRebuild = true;\n continue;\n }\n // Must read oldChildren because children was tagged with -1\n let to = mapping.map(oldChildren[i + 1] + oldOffset, -1), toLocal = to - offset;\n let { index, offset: childOffset } = node.content.findIndex(fromLocal);\n let childNode = node.maybeChild(index);\n if (childNode && childOffset == fromLocal && childOffset + childNode.nodeSize == toLocal) {\n let mapped = children[i + 2]\n .mapInner(mapping, childNode, from + 1, oldChildren[i] + oldOffset + 1, options);\n if (mapped != empty) {\n children[i] = fromLocal;\n children[i + 1] = toLocal;\n children[i + 2] = mapped;\n }\n else {\n children[i + 1] = -2;\n mustRebuild = true;\n }\n }\n else {\n mustRebuild = true;\n }\n }\n // Remaining children must be collected and rebuilt into the appropriate structure\n if (mustRebuild) {\n let decorations = mapAndGatherRemainingDecorations(children, oldChildren, newLocal, mapping, offset, oldOffset, options);\n let built = buildTree(decorations, node, 0, options);\n newLocal = built.local;\n for (let i = 0; i < children.length; i += 3)\n if (children[i + 1] < 0) {\n children.splice(i, 3);\n i -= 3;\n }\n for (let i = 0, j = 0; i < built.children.length; i += 3) {\n let from = built.children[i];\n while (j < children.length && children[j] < from)\n j += 3;\n children.splice(j, 0, built.children[i], built.children[i + 1], built.children[i + 2]);\n }\n }\n return new DecorationSet(newLocal.sort(byPos), children);\n}\nfunction moveSpans(spans, offset) {\n if (!offset || !spans.length)\n return spans;\n let result = [];\n for (let i = 0; i < spans.length; i++) {\n let span = spans[i];\n result.push(new Decoration(span.from + offset, span.to + offset, span.type));\n }\n return result;\n}\nfunction mapAndGatherRemainingDecorations(children, oldChildren, decorations, mapping, offset, oldOffset, options) {\n // Gather all decorations from the remaining marked children\n function gather(set, oldOffset) {\n for (let i = 0; i < set.local.length; i++) {\n let mapped = set.local[i].map(mapping, offset, oldOffset);\n if (mapped)\n decorations.push(mapped);\n else if (options.onRemove)\n options.onRemove(set.local[i].spec);\n }\n for (let i = 0; i < set.children.length; i += 3)\n gather(set.children[i + 2], set.children[i] + oldOffset + 1);\n }\n for (let i = 0; i < children.length; i += 3)\n if (children[i + 1] == -1)\n gather(children[i + 2], oldChildren[i] + oldOffset + 1);\n return decorations;\n}\nfunction takeSpansForNode(spans, node, offset) {\n if (node.isLeaf)\n return null;\n let end = offset + node.nodeSize, found = null;\n for (let i = 0, span; i < spans.length; i++) {\n if ((span = spans[i]) && span.from > offset && span.to < end) {\n (found || (found = [])).push(span);\n spans[i] = null;\n }\n }\n return found;\n}\nfunction withoutNulls(array) {\n let result = [];\n for (let i = 0; i < array.length; i++)\n if (array[i] != null)\n result.push(array[i]);\n return result;\n}\n// Build up a tree that corresponds to a set of decorations. `offset`\n// is a base offset that should be subtracted from the `from` and `to`\n// positions in the spans (so that we don't have to allocate new spans\n// for recursive calls).\nfunction buildTree(spans, node, offset, options) {\n let children = [], hasNulls = false;\n node.forEach((childNode, localStart) => {\n let found = takeSpansForNode(spans, childNode, localStart + offset);\n if (found) {\n hasNulls = true;\n let subtree = buildTree(found, childNode, offset + localStart + 1, options);\n if (subtree != empty)\n children.push(localStart, localStart + childNode.nodeSize, subtree);\n }\n });\n let locals = moveSpans(hasNulls ? withoutNulls(spans) : spans, -offset).sort(byPos);\n for (let i = 0; i < locals.length; i++)\n if (!locals[i].type.valid(node, locals[i])) {\n if (options.onRemove)\n options.onRemove(locals[i].spec);\n locals.splice(i--, 1);\n }\n return locals.length || children.length ? new DecorationSet(locals, children) : empty;\n}\n// Used to sort decorations so that ones with a low start position\n// come first, and within a set with the same start position, those\n// with an smaller end position come first.\nfunction byPos(a, b) {\n return a.from - b.from || a.to - b.to;\n}\n// Scan a sorted array of decorations for partially overlapping spans,\n// and split those so that only fully overlapping spans are left (to\n// make subsequent rendering easier). Will return the input array if\n// no partially overlapping spans are found (the common case).\nfunction removeOverlap(spans) {\n let working = spans;\n for (let i = 0; i < working.length - 1; i++) {\n let span = working[i];\n if (span.from != span.to)\n for (let j = i + 1; j < working.length; j++) {\n let next = working[j];\n if (next.from == span.from) {\n if (next.to != span.to) {\n if (working == spans)\n working = spans.slice();\n // Followed by a partially overlapping larger span. Split that\n // span.\n working[j] = next.copy(next.from, span.to);\n insertAhead(working, j + 1, next.copy(span.to, next.to));\n }\n continue;\n }\n else {\n if (next.from < span.to) {\n if (working == spans)\n working = spans.slice();\n // The end of this one overlaps with a subsequent span. Split\n // this one.\n working[i] = span.copy(span.from, next.from);\n insertAhead(working, j, span.copy(next.from, span.to));\n }\n break;\n }\n }\n }\n return working;\n}\nfunction insertAhead(array, i, deco) {\n while (i < array.length && byPos(deco, array[i]) > 0)\n i++;\n array.splice(i, 0, deco);\n}\n// Get the decorations associated with the current props of a view.\nfunction viewDecorations(view) {\n let found = [];\n view.someProp(\"decorations\", f => {\n let result = f(view.state);\n if (result && result != empty)\n found.push(result);\n });\n if (view.cursorWrapper)\n found.push(DecorationSet.create(view.state.doc, [view.cursorWrapper.deco]));\n return DecorationGroup.from(found);\n}\n\nconst observeOptions = {\n childList: true,\n characterData: true,\n characterDataOldValue: true,\n attributes: true,\n attributeOldValue: true,\n subtree: true\n};\n// IE11 has very broken mutation observers, so we also listen to DOMCharacterDataModified\nconst useCharData = ie && ie_version <= 11;\nclass SelectionState {\n constructor() {\n this.anchorNode = null;\n this.anchorOffset = 0;\n this.focusNode = null;\n this.focusOffset = 0;\n }\n set(sel) {\n this.anchorNode = sel.anchorNode;\n this.anchorOffset = sel.anchorOffset;\n this.focusNode = sel.focusNode;\n this.focusOffset = sel.focusOffset;\n }\n clear() {\n this.anchorNode = this.focusNode = null;\n }\n eq(sel) {\n return sel.anchorNode == this.anchorNode && sel.anchorOffset == this.anchorOffset &&\n sel.focusNode == this.focusNode && sel.focusOffset == this.focusOffset;\n }\n}\nclass DOMObserver {\n constructor(view, handleDOMChange) {\n this.view = view;\n this.handleDOMChange = handleDOMChange;\n this.queue = [];\n this.flushingSoon = -1;\n this.observer = null;\n this.currentSelection = new SelectionState;\n this.onCharData = null;\n this.suppressingSelectionUpdates = false;\n this.observer = window.MutationObserver &&\n new window.MutationObserver(mutations => {\n for (let i = 0; i < mutations.length; i++)\n this.queue.push(mutations[i]);\n // IE11 will sometimes (on backspacing out a single character\n // text node after a BR node) call the observer callback\n // before actually updating the DOM, which will cause\n // ProseMirror to miss the change (see #930)\n if (ie && ie_version <= 11 && mutations.some(m => m.type == \"childList\" && m.removedNodes.length ||\n m.type == \"characterData\" && m.oldValue.length > m.target.nodeValue.length))\n this.flushSoon();\n else\n this.flush();\n });\n if (useCharData) {\n this.onCharData = e => {\n this.queue.push({ target: e.target, type: \"characterData\", oldValue: e.prevValue });\n this.flushSoon();\n };\n }\n this.onSelectionChange = this.onSelectionChange.bind(this);\n }\n flushSoon() {\n if (this.flushingSoon < 0)\n this.flushingSoon = window.setTimeout(() => { this.flushingSoon = -1; this.flush(); }, 20);\n }\n forceFlush() {\n if (this.flushingSoon > -1) {\n window.clearTimeout(this.flushingSoon);\n this.flushingSoon = -1;\n this.flush();\n }\n }\n start() {\n if (this.observer) {\n this.observer.takeRecords();\n this.observer.observe(this.view.dom, observeOptions);\n }\n if (this.onCharData)\n this.view.dom.addEventListener(\"DOMCharacterDataModified\", this.onCharData);\n this.connectSelection();\n }\n stop() {\n if (this.observer) {\n let take = this.observer.takeRecords();\n if (take.length) {\n for (let i = 0; i < take.length; i++)\n this.queue.push(take[i]);\n window.setTimeout(() => this.flush(), 20);\n }\n this.observer.disconnect();\n }\n if (this.onCharData)\n this.view.dom.removeEventListener(\"DOMCharacterDataModified\", this.onCharData);\n this.disconnectSelection();\n }\n connectSelection() {\n this.view.dom.ownerDocument.addEventListener(\"selectionchange\", this.onSelectionChange);\n }\n disconnectSelection() {\n this.view.dom.ownerDocument.removeEventListener(\"selectionchange\", this.onSelectionChange);\n }\n suppressSelectionUpdates() {\n this.suppressingSelectionUpdates = true;\n setTimeout(() => this.suppressingSelectionUpdates = false, 50);\n }\n onSelectionChange() {\n if (!hasFocusAndSelection(this.view))\n return;\n if (this.suppressingSelectionUpdates)\n return selectionToDOM(this.view);\n // Deletions on IE11 fire their events in the wrong order, giving\n // us a selection change event before the DOM changes are\n // reported.\n if (ie && ie_version <= 11 && !this.view.state.selection.empty) {\n let sel = this.view.domSelection();\n // Selection.isCollapsed isn't reliable on IE\n if (sel.focusNode && isEquivalentPosition(sel.focusNode, sel.focusOffset, sel.anchorNode, sel.anchorOffset))\n return this.flushSoon();\n }\n this.flush();\n }\n setCurSelection() {\n this.currentSelection.set(this.view.domSelection());\n }\n ignoreSelectionChange(sel) {\n if (sel.rangeCount == 0)\n return true;\n let container = sel.getRangeAt(0).commonAncestorContainer;\n let desc = this.view.docView.nearestDesc(container);\n if (desc && desc.ignoreMutation({\n type: \"selection\",\n target: container.nodeType == 3 ? container.parentNode : container\n })) {\n this.setCurSelection();\n return true;\n }\n }\n flush() {\n if (!this.view.docView || this.flushingSoon > -1)\n return;\n let mutations = this.observer ? this.observer.takeRecords() : [];\n if (this.queue.length) {\n mutations = this.queue.concat(mutations);\n this.queue.length = 0;\n }\n let sel = this.view.domSelection();\n let newSel = !this.suppressingSelectionUpdates && !this.currentSelection.eq(sel) && hasFocusAndSelection(this.view) && !this.ignoreSelectionChange(sel);\n let from = -1, to = -1, typeOver = false, added = [];\n if (this.view.editable) {\n for (let i = 0; i < mutations.length; i++) {\n let result = this.registerMutation(mutations[i], added);\n if (result) {\n from = from < 0 ? result.from : Math.min(result.from, from);\n to = to < 0 ? result.to : Math.max(result.to, to);\n if (result.typeOver)\n typeOver = true;\n }\n }\n }\n if (gecko && added.length > 1) {\n let brs = added.filter(n => n.nodeName == \"BR\");\n if (brs.length == 2) {\n let a = brs[0], b = brs[1];\n if (a.parentNode && a.parentNode.parentNode == b.parentNode)\n b.remove();\n else\n a.remove();\n }\n }\n if (from > -1 || newSel) {\n if (from > -1) {\n this.view.docView.markDirty(from, to);\n checkCSS(this.view);\n }\n this.handleDOMChange(from, to, typeOver, added);\n if (this.view.docView && this.view.docView.dirty)\n this.view.updateState(this.view.state);\n else if (!this.currentSelection.eq(sel))\n selectionToDOM(this.view);\n this.currentSelection.set(sel);\n }\n }\n registerMutation(mut, added) {\n // Ignore mutations inside nodes that were already noted as inserted\n if (added.indexOf(mut.target) > -1)\n return null;\n let desc = this.view.docView.nearestDesc(mut.target);\n if (mut.type == \"attributes\" &&\n (desc == this.view.docView || mut.attributeName == \"contenteditable\" ||\n // Firefox sometimes fires spurious events for null/empty styles\n (mut.attributeName == \"style\" && !mut.oldValue && !mut.target.getAttribute(\"style\"))))\n return null;\n if (!desc || desc.ignoreMutation(mut))\n return null;\n if (mut.type == \"childList\") {\n for (let i = 0; i < mut.addedNodes.length; i++)\n added.push(mut.addedNodes[i]);\n if (desc.contentDOM && desc.contentDOM != desc.dom && !desc.contentDOM.contains(mut.target))\n return { from: desc.posBefore, to: desc.posAfter };\n let prev = mut.previousSibling, next = mut.nextSibling;\n if (ie && ie_version <= 11 && mut.addedNodes.length) {\n // IE11 gives us incorrect next/prev siblings for some\n // insertions, so if there are added nodes, recompute those\n for (let i = 0; i < mut.addedNodes.length; i++) {\n let { previousSibling, nextSibling } = mut.addedNodes[i];\n if (!previousSibling || Array.prototype.indexOf.call(mut.addedNodes, previousSibling) < 0)\n prev = previousSibling;\n if (!nextSibling || Array.prototype.indexOf.call(mut.addedNodes, nextSibling) < 0)\n next = nextSibling;\n }\n }\n let fromOffset = prev && prev.parentNode == mut.target\n ? domIndex(prev) + 1 : 0;\n let from = desc.localPosFromDOM(mut.target, fromOffset, -1);\n let toOffset = next && next.parentNode == mut.target\n ? domIndex(next) : mut.target.childNodes.length;\n let to = desc.localPosFromDOM(mut.target, toOffset, 1);\n return { from, to };\n }\n else if (mut.type == \"attributes\") {\n return { from: desc.posAtStart - desc.border, to: desc.posAtEnd + desc.border };\n }\n else { // \"characterData\"\n return {\n from: desc.posAtStart,\n to: desc.posAtEnd,\n // An event was generated for a text change that didn't change\n // any text. Mark the dom change to fall back to assuming the\n // selection was typed over with an identical value if it can't\n // find another change.\n typeOver: mut.target.nodeValue == mut.oldValue\n };\n }\n }\n}\nlet cssChecked = false;\nfunction checkCSS(view) {\n if (cssChecked)\n return;\n cssChecked = true;\n if (getComputedStyle(view.dom).whiteSpace == \"normal\")\n console[\"warn\"](\"ProseMirror expects the CSS white-space property to be set, preferably to 'pre-wrap'. It is recommended to load style/prosemirror.css from the prosemirror-view package.\");\n}\n\n// Note that all referencing and parsing is done with the\n// start-of-operation selection and document, since that's the one\n// that the DOM represents. If any changes came in in the meantime,\n// the modification is mapped over those before it is applied, in\n// readDOMChange.\nfunction parseBetween(view, from_, to_) {\n let { node: parent, fromOffset, toOffset, from, to } = view.docView.parseRange(from_, to_);\n let domSel = view.domSelection();\n let find;\n let anchor = domSel.anchorNode;\n if (anchor && view.dom.contains(anchor.nodeType == 1 ? anchor : anchor.parentNode)) {\n find = [{ node: anchor, offset: domSel.anchorOffset }];\n if (!selectionCollapsed(domSel))\n find.push({ node: domSel.focusNode, offset: domSel.focusOffset });\n }\n // Work around issue in Chrome where backspacing sometimes replaces\n // the deleted content with a random BR node (issues #799, #831)\n if (chrome && view.input.lastKeyCode === 8) {\n for (let off = toOffset; off > fromOffset; off--) {\n let node = parent.childNodes[off - 1], desc = node.pmViewDesc;\n if (node.nodeName == \"BR\" && !desc) {\n toOffset = off;\n break;\n }\n if (!desc || desc.size)\n break;\n }\n }\n let startDoc = view.state.doc;\n let parser = view.someProp(\"domParser\") || DOMParser.fromSchema(view.state.schema);\n let $from = startDoc.resolve(from);\n let sel = null, doc = parser.parse(parent, {\n topNode: $from.parent,\n topMatch: $from.parent.contentMatchAt($from.index()),\n topOpen: true,\n from: fromOffset,\n to: toOffset,\n preserveWhitespace: $from.parent.type.whitespace == \"pre\" ? \"full\" : true,\n findPositions: find,\n ruleFromNode,\n context: $from\n });\n if (find && find[0].pos != null) {\n let anchor = find[0].pos, head = find[1] && find[1].pos;\n if (head == null)\n head = anchor;\n sel = { anchor: anchor + from, head: head + from };\n }\n return { doc, sel, from, to };\n}\nfunction ruleFromNode(dom) {\n let desc = dom.pmViewDesc;\n if (desc) {\n return desc.parseRule();\n }\n else if (dom.nodeName == \"BR\" && dom.parentNode) {\n // Safari replaces the list item or table cell with a BR\n // directly in the list node (?!) if you delete the last\n // character in a list item or table cell (#708, #862)\n if (safari && /^(ul|ol)$/i.test(dom.parentNode.nodeName)) {\n let skip = document.createElement(\"div\");\n skip.appendChild(document.createElement(\"li\"));\n return { skip };\n }\n else if (dom.parentNode.lastChild == dom || safari && /^(tr|table)$/i.test(dom.parentNode.nodeName)) {\n return { ignore: true };\n }\n }\n else if (dom.nodeName == \"IMG\" && dom.getAttribute(\"mark-placeholder\")) {\n return { ignore: true };\n }\n return null;\n}\nfunction readDOMChange(view, from, to, typeOver, addedNodes) {\n if (from < 0) {\n let origin = view.input.lastSelectionTime > Date.now() - 50 ? view.input.lastSelectionOrigin : null;\n let newSel = selectionFromDOM(view, origin);\n if (newSel && !view.state.selection.eq(newSel)) {\n let tr = view.state.tr.setSelection(newSel);\n if (origin == \"pointer\")\n tr.setMeta(\"pointer\", true);\n else if (origin == \"key\")\n tr.scrollIntoView();\n view.dispatch(tr);\n }\n return;\n }\n let $before = view.state.doc.resolve(from);\n let shared = $before.sharedDepth(to);\n from = $before.before(shared + 1);\n to = view.state.doc.resolve(to).after(shared + 1);\n let sel = view.state.selection;\n let parse = parseBetween(view, from, to);\n // Chrome sometimes leaves the cursor before the inserted text when\n // composing after a cursor wrapper. This moves it forward.\n if (chrome && view.cursorWrapper && parse.sel && parse.sel.anchor == view.cursorWrapper.deco.from &&\n parse.sel.head == parse.sel.anchor) {\n let text = view.cursorWrapper.deco.type.toDOM.nextSibling;\n let size = text && text.nodeValue ? text.nodeValue.length : 1;\n parse.sel = { anchor: parse.sel.anchor + size, head: parse.sel.anchor + size };\n }\n let doc = view.state.doc, compare = doc.slice(parse.from, parse.to);\n let preferredPos, preferredSide;\n // Prefer anchoring to end when Backspace is pressed\n if (view.input.lastKeyCode === 8 && Date.now() - 100 < view.input.lastKeyCodeTime) {\n preferredPos = view.state.selection.to;\n preferredSide = \"end\";\n }\n else {\n preferredPos = view.state.selection.from;\n preferredSide = \"start\";\n }\n view.input.lastKeyCode = null;\n let change = findDiff(compare.content, parse.doc.content, parse.from, preferredPos, preferredSide);\n if ((ios && view.input.lastIOSEnter > Date.now() - 225 || android) &&\n addedNodes.some(n => n.nodeName == \"DIV\" || n.nodeName == \"P\") &&\n (!change || change.endA >= change.endB) &&\n view.someProp(\"handleKeyDown\", f => f(view, keyEvent(13, \"Enter\")))) {\n view.input.lastIOSEnter = 0;\n return;\n }\n if (!change) {\n if (typeOver && sel instanceof TextSelection && !sel.empty && sel.$head.sameParent(sel.$anchor) &&\n !view.composing && !(parse.sel && parse.sel.anchor != parse.sel.head)) {\n change = { start: sel.from, endA: sel.to, endB: sel.to };\n }\n else {\n if (parse.sel) {\n let sel = resolveSelection(view, view.state.doc, parse.sel);\n if (sel && !sel.eq(view.state.selection))\n view.dispatch(view.state.tr.setSelection(sel));\n }\n return;\n }\n }\n view.input.domChangeCount++;\n // Handle the case where overwriting a selection by typing matches\n // the start or end of the selected content, creating a change\n // that's smaller than what was actually overwritten.\n if (view.state.selection.from < view.state.selection.to &&\n change.start == change.endB &&\n view.state.selection instanceof TextSelection) {\n if (change.start > view.state.selection.from && change.start <= view.state.selection.from + 2 &&\n view.state.selection.from >= parse.from) {\n change.start = view.state.selection.from;\n }\n else if (change.endA < view.state.selection.to && change.endA >= view.state.selection.to - 2 &&\n view.state.selection.to <= parse.to) {\n change.endB += (view.state.selection.to - change.endA);\n change.endA = view.state.selection.to;\n }\n }\n // IE11 will insert a non-breaking space _ahead_ of the space after\n // the cursor space when adding a space before another space. When\n // that happened, adjust the change to cover the space instead.\n if (ie && ie_version <= 11 && change.endB == change.start + 1 &&\n change.endA == change.start && change.start > parse.from &&\n parse.doc.textBetween(change.start - parse.from - 1, change.start - parse.from + 1) == \" \\u00a0\") {\n change.start--;\n change.endA--;\n change.endB--;\n }\n let $from = parse.doc.resolveNoCache(change.start - parse.from);\n let $to = parse.doc.resolveNoCache(change.endB - parse.from);\n let $fromA = doc.resolve(change.start);\n let inlineChange = $from.sameParent($to) && $from.parent.inlineContent && $fromA.end() >= change.endA;\n let nextSel;\n // If this looks like the effect of pressing Enter (or was recorded\n // as being an iOS enter press), just dispatch an Enter key instead.\n if (((ios && view.input.lastIOSEnter > Date.now() - 225 &&\n (!inlineChange || addedNodes.some(n => n.nodeName == \"DIV\" || n.nodeName == \"P\"))) ||\n (!inlineChange && $from.pos < parse.doc.content.size &&\n (nextSel = Selection.findFrom(parse.doc.resolve($from.pos + 1), 1, true)) &&\n nextSel.head == $to.pos)) &&\n view.someProp(\"handleKeyDown\", f => f(view, keyEvent(13, \"Enter\")))) {\n view.input.lastIOSEnter = 0;\n return;\n }\n // Same for backspace\n if (view.state.selection.anchor > change.start &&\n looksLikeJoin(doc, change.start, change.endA, $from, $to) &&\n view.someProp(\"handleKeyDown\", f => f(view, keyEvent(8, \"Backspace\")))) {\n if (android && chrome)\n view.domObserver.suppressSelectionUpdates(); // #820\n return;\n }\n // Chrome Android will occasionally, during composition, delete the\n // entire composition and then immediately insert it again. This is\n // used to detect that situation.\n if (chrome && android && change.endB == change.start)\n view.input.lastAndroidDelete = Date.now();\n // This tries to detect Android virtual keyboard\n // enter-and-pick-suggestion action. That sometimes (see issue\n // #1059) first fires a DOM mutation, before moving the selection to\n // the newly created block. And then, because ProseMirror cleans up\n // the DOM selection, it gives up moving the selection entirely,\n // leaving the cursor in the wrong place. When that happens, we drop\n // the new paragraph from the initial change, and fire a simulated\n // enter key afterwards.\n if (android && !inlineChange && $from.start() != $to.start() && $to.parentOffset == 0 && $from.depth == $to.depth &&\n parse.sel && parse.sel.anchor == parse.sel.head && parse.sel.head == change.endA) {\n change.endB -= 2;\n $to = parse.doc.resolveNoCache(change.endB - parse.from);\n setTimeout(() => {\n view.someProp(\"handleKeyDown\", function (f) { return f(view, keyEvent(13, \"Enter\")); });\n }, 20);\n }\n let chFrom = change.start, chTo = change.endA;\n let tr, storedMarks, markChange;\n if (inlineChange) {\n if ($from.pos == $to.pos) { // Deletion\n // IE11 sometimes weirdly moves the DOM selection around after\n // backspacing out the first element in a textblock\n if (ie && ie_version <= 11 && $from.parentOffset == 0) {\n view.domObserver.suppressSelectionUpdates();\n setTimeout(() => selectionToDOM(view), 20);\n }\n tr = view.state.tr.delete(chFrom, chTo);\n storedMarks = doc.resolve(change.start).marksAcross(doc.resolve(change.endA));\n }\n else if ( // Adding or removing a mark\n change.endA == change.endB &&\n (markChange = isMarkChange($from.parent.content.cut($from.parentOffset, $to.parentOffset), $fromA.parent.content.cut($fromA.parentOffset, change.endA - $fromA.start())))) {\n tr = view.state.tr;\n if (markChange.type == \"add\")\n tr.addMark(chFrom, chTo, markChange.mark);\n else\n tr.removeMark(chFrom, chTo, markChange.mark);\n }\n else if ($from.parent.child($from.index()).isText && $from.index() == $to.index() - ($to.textOffset ? 0 : 1)) {\n // Both positions in the same text node -- simply insert text\n let text = $from.parent.textBetween($from.parentOffset, $to.parentOffset);\n if (view.someProp(\"handleTextInput\", f => f(view, chFrom, chTo, text)))\n return;\n tr = view.state.tr.insertText(text, chFrom, chTo);\n }\n }\n if (!tr)\n tr = view.state.tr.replace(chFrom, chTo, parse.doc.slice(change.start - parse.from, change.endB - parse.from));\n if (parse.sel) {\n let sel = resolveSelection(view, tr.doc, parse.sel);\n // Chrome Android will sometimes, during composition, report the\n // selection in the wrong place. If it looks like that is\n // happening, don't update the selection.\n // Edge just doesn't move the cursor forward when you start typing\n // in an empty block or between br nodes.\n if (sel && !(chrome && android && view.composing && sel.empty &&\n (change.start != change.endB || view.input.lastAndroidDelete < Date.now() - 100) &&\n (sel.head == chFrom || sel.head == tr.mapping.map(chTo) - 1) ||\n ie && sel.empty && sel.head == chFrom))\n tr.setSelection(sel);\n }\n if (storedMarks)\n tr.ensureMarks(storedMarks);\n view.dispatch(tr.scrollIntoView());\n}\nfunction resolveSelection(view, doc, parsedSel) {\n if (Math.max(parsedSel.anchor, parsedSel.head) > doc.content.size)\n return null;\n return selectionBetween(view, doc.resolve(parsedSel.anchor), doc.resolve(parsedSel.head));\n}\n// Given two same-length, non-empty fragments of inline content,\n// determine whether the first could be created from the second by\n// removing or adding a single mark type.\nfunction isMarkChange(cur, prev) {\n let curMarks = cur.firstChild.marks, prevMarks = prev.firstChild.marks;\n let added = curMarks, removed = prevMarks, type, mark, update;\n for (let i = 0; i < prevMarks.length; i++)\n added = prevMarks[i].removeFromSet(added);\n for (let i = 0; i < curMarks.length; i++)\n removed = curMarks[i].removeFromSet(removed);\n if (added.length == 1 && removed.length == 0) {\n mark = added[0];\n type = \"add\";\n update = (node) => node.mark(mark.addToSet(node.marks));\n }\n else if (added.length == 0 && removed.length == 1) {\n mark = removed[0];\n type = \"remove\";\n update = (node) => node.mark(mark.removeFromSet(node.marks));\n }\n else {\n return null;\n }\n let updated = [];\n for (let i = 0; i < prev.childCount; i++)\n updated.push(update(prev.child(i)));\n if (Fragment.from(updated).eq(cur))\n return { mark, type };\n}\nfunction looksLikeJoin(old, start, end, $newStart, $newEnd) {\n if (!$newStart.parent.isTextblock ||\n // The content must have shrunk\n end - start <= $newEnd.pos - $newStart.pos ||\n // newEnd must point directly at or after the end of the block that newStart points into\n skipClosingAndOpening($newStart, true, false) < $newEnd.pos)\n return false;\n let $start = old.resolve(start);\n // Start must be at the end of a block\n if ($start.parentOffset < $start.parent.content.size || !$start.parent.isTextblock)\n return false;\n let $next = old.resolve(skipClosingAndOpening($start, true, true));\n // The next textblock must start before end and end near it\n if (!$next.parent.isTextblock || $next.pos > end ||\n skipClosingAndOpening($next, true, false) < end)\n return false;\n // The fragments after the join point must match\n return $newStart.parent.content.cut($newStart.parentOffset).eq($next.parent.content);\n}\nfunction skipClosingAndOpening($pos, fromEnd, mayOpen) {\n let depth = $pos.depth, end = fromEnd ? $pos.end() : $pos.pos;\n while (depth > 0 && (fromEnd || $pos.indexAfter(depth) == $pos.node(depth).childCount)) {\n depth--;\n end++;\n fromEnd = false;\n }\n if (mayOpen) {\n let next = $pos.node(depth).maybeChild($pos.indexAfter(depth));\n while (next && !next.isLeaf) {\n next = next.firstChild;\n end++;\n }\n }\n return end;\n}\nfunction findDiff(a, b, pos, preferredPos, preferredSide) {\n let start = a.findDiffStart(b, pos);\n if (start == null)\n return null;\n let { a: endA, b: endB } = a.findDiffEnd(b, pos + a.size, pos + b.size);\n if (preferredSide == \"end\") {\n let adjust = Math.max(0, start - Math.min(endA, endB));\n preferredPos -= endA + adjust - start;\n }\n if (endA < start && a.size < b.size) {\n let move = preferredPos <= start && preferredPos >= endA ? start - preferredPos : 0;\n start -= move;\n endB = start + (endB - endA);\n endA = start;\n }\n else if (endB < start) {\n let move = preferredPos <= start && preferredPos >= endB ? start - preferredPos : 0;\n start -= move;\n endA = start + (endA - endB);\n endB = start;\n }\n return { start, endA, endB };\n}\n\n/**\n@internal\n*/\nconst __serializeForClipboard = serializeForClipboard;\n/**\n@internal\n*/\nconst __parseFromClipboard = parseFromClipboard;\n/**\n@internal\n*/\nconst __endComposition = endComposition;\n/**\nAn editor view manages the DOM structure that represents an\neditable document. Its state and behavior are determined by its\n[props](https://prosemirror.net/docs/ref/#view.DirectEditorProps).\n*/\nclass EditorView {\n /**\n Create a view. `place` may be a DOM node that the editor should\n be appended to, a function that will place it into the document,\n or an object whose `mount` property holds the node to use as the\n document container. If it is `null`, the editor will not be\n added to the document.\n */\n constructor(place, props) {\n this._root = null;\n /**\n @internal\n */\n this.focused = false;\n /**\n Kludge used to work around a Chrome bug @internal\n */\n this.trackWrites = null;\n this.mounted = false;\n /**\n @internal\n */\n this.markCursor = null;\n /**\n @internal\n */\n this.cursorWrapper = null;\n /**\n @internal\n */\n this.lastSelectedViewDesc = undefined;\n /**\n @internal\n */\n this.input = new InputState;\n this.prevDirectPlugins = [];\n this.pluginViews = [];\n /**\n When editor content is being dragged, this object contains\n information about the dragged slice and whether it is being\n copied or moved. At any other time, it is null.\n */\n this.dragging = null;\n this._props = props;\n this.state = props.state;\n this.directPlugins = props.plugins || [];\n this.directPlugins.forEach(checkStateComponent);\n this.dispatch = this.dispatch.bind(this);\n this.dom = (place && place.mount) || document.createElement(\"div\");\n if (place) {\n if (place.appendChild)\n place.appendChild(this.dom);\n else if (typeof place == \"function\")\n place(this.dom);\n else if (place.mount)\n this.mounted = true;\n }\n this.editable = getEditable(this);\n updateCursorWrapper(this);\n this.nodeViews = buildNodeViews(this);\n this.docView = docViewDesc(this.state.doc, computeDocDeco(this), viewDecorations(this), this.dom, this);\n this.domObserver = new DOMObserver(this, (from, to, typeOver, added) => readDOMChange(this, from, to, typeOver, added));\n this.domObserver.start();\n initInput(this);\n this.updatePluginViews();\n }\n /**\n Holds `true` when a\n [composition](https://w3c.github.io/uievents/#events-compositionevents)\n is active.\n */\n get composing() { return this.input.composing; }\n /**\n The view's current [props](https://prosemirror.net/docs/ref/#view.EditorProps).\n */\n get props() {\n if (this._props.state != this.state) {\n let prev = this._props;\n this._props = {};\n for (let name in prev)\n this._props[name] = prev[name];\n this._props.state = this.state;\n }\n return this._props;\n }\n /**\n Update the view's props. Will immediately cause an update to\n the DOM.\n */\n update(props) {\n if (props.handleDOMEvents != this._props.handleDOMEvents)\n ensureListeners(this);\n this._props = props;\n if (props.plugins) {\n props.plugins.forEach(checkStateComponent);\n this.directPlugins = props.plugins;\n }\n this.updateStateInner(props.state, true);\n }\n /**\n Update the view by updating existing props object with the object\n given as argument. Equivalent to `view.update(Object.assign({},\n view.props, props))`.\n */\n setProps(props) {\n let updated = {};\n for (let name in this._props)\n updated[name] = this._props[name];\n updated.state = this.state;\n for (let name in props)\n updated[name] = props[name];\n this.update(updated);\n }\n /**\n Update the editor's `state` prop, without touching any of the\n other props.\n */\n updateState(state) {\n this.updateStateInner(state, this.state.plugins != state.plugins);\n }\n updateStateInner(state, reconfigured) {\n let prev = this.state, redraw = false, updateSel = false;\n // When stored marks are added, stop composition, so that they can\n // be displayed.\n if (state.storedMarks && this.composing) {\n clearComposition(this);\n updateSel = true;\n }\n this.state = state;\n if (reconfigured) {\n let nodeViews = buildNodeViews(this);\n if (changedNodeViews(nodeViews, this.nodeViews)) {\n this.nodeViews = nodeViews;\n redraw = true;\n }\n ensureListeners(this);\n }\n this.editable = getEditable(this);\n updateCursorWrapper(this);\n let innerDeco = viewDecorations(this), outerDeco = computeDocDeco(this);\n let scroll = reconfigured ? \"reset\"\n : state.scrollToSelection > prev.scrollToSelection ? \"to selection\" : \"preserve\";\n let updateDoc = redraw || !this.docView.matchesNode(state.doc, outerDeco, innerDeco);\n if (updateDoc || !state.selection.eq(prev.selection))\n updateSel = true;\n let oldScrollPos = scroll == \"preserve\" && updateSel && this.dom.style.overflowAnchor == null && storeScrollPos(this);\n if (updateSel) {\n this.domObserver.stop();\n // Work around an issue in Chrome, IE, and Edge where changing\n // the DOM around an active selection puts it into a broken\n // state where the thing the user sees differs from the\n // selection reported by the Selection object (#710, #973,\n // #1011, #1013, #1035).\n let forceSelUpdate = updateDoc && (ie || chrome) && !this.composing &&\n !prev.selection.empty && !state.selection.empty && selectionContextChanged(prev.selection, state.selection);\n if (updateDoc) {\n // If the node that the selection points into is written to,\n // Chrome sometimes starts misreporting the selection, so this\n // tracks that and forces a selection reset when our update\n // did write to the node.\n let chromeKludge = chrome ? (this.trackWrites = this.domSelection().focusNode) : null;\n if (redraw || !this.docView.update(state.doc, outerDeco, innerDeco, this)) {\n this.docView.updateOuterDeco([]);\n this.docView.destroy();\n this.docView = docViewDesc(state.doc, outerDeco, innerDeco, this.dom, this);\n }\n if (chromeKludge && !this.trackWrites)\n forceSelUpdate = true;\n }\n // Work around for an issue where an update arriving right between\n // a DOM selection change and the \"selectionchange\" event for it\n // can cause a spurious DOM selection update, disrupting mouse\n // drag selection.\n if (forceSelUpdate ||\n !(this.input.mouseDown && this.domObserver.currentSelection.eq(this.domSelection()) && anchorInRightPlace(this))) {\n selectionToDOM(this, forceSelUpdate);\n }\n else {\n syncNodeSelection(this, state.selection);\n this.domObserver.setCurSelection();\n }\n this.domObserver.start();\n }\n this.updatePluginViews(prev);\n if (scroll == \"reset\") {\n this.dom.scrollTop = 0;\n }\n else if (scroll == \"to selection\") {\n let startDOM = this.domSelection().focusNode;\n if (this.someProp(\"handleScrollToSelection\", f => f(this))) ;\n else if (state.selection instanceof NodeSelection) {\n let target = this.docView.domAfterPos(state.selection.from);\n if (target.nodeType == 1)\n scrollRectIntoView(this, target.getBoundingClientRect(), startDOM);\n }\n else {\n scrollRectIntoView(this, this.coordsAtPos(state.selection.head, 1), startDOM);\n }\n }\n else if (oldScrollPos) {\n resetScrollPos(oldScrollPos);\n }\n }\n destroyPluginViews() {\n let view;\n while (view = this.pluginViews.pop())\n if (view.destroy)\n view.destroy();\n }\n updatePluginViews(prevState) {\n if (!prevState || prevState.plugins != this.state.plugins || this.directPlugins != this.prevDirectPlugins) {\n this.prevDirectPlugins = this.directPlugins;\n this.destroyPluginViews();\n for (let i = 0; i < this.directPlugins.length; i++) {\n let plugin = this.directPlugins[i];\n if (plugin.spec.view)\n this.pluginViews.push(plugin.spec.view(this));\n }\n for (let i = 0; i < this.state.plugins.length; i++) {\n let plugin = this.state.plugins[i];\n if (plugin.spec.view)\n this.pluginViews.push(plugin.spec.view(this));\n }\n }\n else {\n for (let i = 0; i < this.pluginViews.length; i++) {\n let pluginView = this.pluginViews[i];\n if (pluginView.update)\n pluginView.update(this, prevState);\n }\n }\n }\n someProp(propName, f) {\n let prop = this._props && this._props[propName], value;\n if (prop != null && (value = f ? f(prop) : prop))\n return value;\n for (let i = 0; i < this.directPlugins.length; i++) {\n let prop = this.directPlugins[i].props[propName];\n if (prop != null && (value = f ? f(prop) : prop))\n return value;\n }\n let plugins = this.state.plugins;\n if (plugins)\n for (let i = 0; i < plugins.length; i++) {\n let prop = plugins[i].props[propName];\n if (prop != null && (value = f ? f(prop) : prop))\n return value;\n }\n }\n /**\n Query whether the view has focus.\n */\n hasFocus() {\n return this.root.activeElement == this.dom;\n }\n /**\n Focus the editor.\n */\n focus() {\n this.domObserver.stop();\n if (this.editable)\n focusPreventScroll(this.dom);\n selectionToDOM(this);\n this.domObserver.start();\n }\n /**\n Get the document root in which the editor exists. This will\n usually be the top-level `document`, but might be a [shadow\n DOM](https://developer.mozilla.org/en-US/docs/Web/Web_Components/Shadow_DOM)\n root if the editor is inside one.\n */\n get root() {\n let cached = this._root;\n if (cached == null)\n for (let search = this.dom.parentNode; search; search = search.parentNode) {\n if (search.nodeType == 9 || (search.nodeType == 11 && search.host)) {\n if (!search.getSelection)\n Object.getPrototypeOf(search).getSelection = () => search.ownerDocument.getSelection();\n return this._root = search;\n }\n }\n return cached || document;\n }\n /**\n Given a pair of viewport coordinates, return the document\n position that corresponds to them. May return null if the given\n coordinates aren't inside of the editor. When an object is\n returned, its `pos` property is the position nearest to the\n coordinates, and its `inside` property holds the position of the\n inner node that the position falls inside of, or -1 if it is at\n the top level, not in any node.\n */\n posAtCoords(coords) {\n return posAtCoords(this, coords);\n }\n /**\n Returns the viewport rectangle at a given document position.\n `left` and `right` will be the same number, as this returns a\n flat cursor-ish rectangle. If the position is between two things\n that aren't directly adjacent, `side` determines which element\n is used. When < 0, the element before the position is used,\n otherwise the element after.\n */\n coordsAtPos(pos, side = 1) {\n return coordsAtPos(this, pos, side);\n }\n /**\n Find the DOM position that corresponds to the given document\n position. When `side` is negative, find the position as close as\n possible to the content before the position. When positive,\n prefer positions close to the content after the position. When\n zero, prefer as shallow a position as possible.\n \n Note that you should **not** mutate the editor's internal DOM,\n only inspect it (and even that is usually not necessary).\n */\n domAtPos(pos, side = 0) {\n return this.docView.domFromPos(pos, side);\n }\n /**\n Find the DOM node that represents the document node after the\n given position. May return `null` when the position doesn't point\n in front of a node or if the node is inside an opaque node view.\n \n This is intended to be able to call things like\n `getBoundingClientRect` on that DOM node. Do **not** mutate the\n editor DOM directly, or add styling this way, since that will be\n immediately overriden by the editor as it redraws the node.\n */\n nodeDOM(pos) {\n let desc = this.docView.descAt(pos);\n return desc ? desc.nodeDOM : null;\n }\n /**\n Find the document position that corresponds to a given DOM\n position. (Whenever possible, it is preferable to inspect the\n document structure directly, rather than poking around in the\n DOM, but sometimes—for example when interpreting an event\n target—you don't have a choice.)\n \n The `bias` parameter can be used to influence which side of a DOM\n node to use when the position is inside a leaf node.\n */\n posAtDOM(node, offset, bias = -1) {\n let pos = this.docView.posFromDOM(node, offset, bias);\n if (pos == null)\n throw new RangeError(\"DOM position not inside the editor\");\n return pos;\n }\n /**\n Find out whether the selection is at the end of a textblock when\n moving in a given direction. When, for example, given `\"left\"`,\n it will return true if moving left from the current cursor\n position would leave that position's parent textblock. Will apply\n to the view's current state by default, but it is possible to\n pass a different state.\n */\n endOfTextblock(dir, state) {\n return endOfTextblock(this, state || this.state, dir);\n }\n /**\n Removes the editor from the DOM and destroys all [node\n views](https://prosemirror.net/docs/ref/#view.NodeView).\n */\n destroy() {\n if (!this.docView)\n return;\n destroyInput(this);\n this.destroyPluginViews();\n if (this.mounted) {\n this.docView.update(this.state.doc, [], viewDecorations(this), this);\n this.dom.textContent = \"\";\n }\n else if (this.dom.parentNode) {\n this.dom.parentNode.removeChild(this.dom);\n }\n this.docView.destroy();\n this.docView = null;\n }\n /**\n This is true when the view has been\n [destroyed](https://prosemirror.net/docs/ref/#view.EditorView.destroy) (and thus should not be\n used anymore).\n */\n get isDestroyed() {\n return this.docView == null;\n }\n /**\n Used for testing.\n */\n dispatchEvent(event) {\n return dispatchEvent(this, event);\n }\n /**\n Dispatch a transaction. Will call\n [`dispatchTransaction`](https://prosemirror.net/docs/ref/#view.DirectEditorProps.dispatchTransaction)\n when given, and otherwise defaults to applying the transaction to\n the current state and calling\n [`updateState`](https://prosemirror.net/docs/ref/#view.EditorView.updateState) with the result.\n This method is bound to the view instance, so that it can be\n easily passed around.\n */\n dispatch(tr) {\n let dispatchTransaction = this._props.dispatchTransaction;\n if (dispatchTransaction)\n dispatchTransaction.call(this, tr);\n else\n this.updateState(this.state.apply(tr));\n }\n /**\n @internal\n */\n domSelection() {\n return this.root.getSelection();\n }\n}\nfunction computeDocDeco(view) {\n let attrs = Object.create(null);\n attrs.class = \"ProseMirror\";\n attrs.contenteditable = String(view.editable);\n attrs.translate = \"no\";\n view.someProp(\"attributes\", value => {\n if (typeof value == \"function\")\n value = value(view.state);\n if (value)\n for (let attr in value) {\n if (attr == \"class\")\n attrs.class += \" \" + value[attr];\n if (attr == \"style\") {\n attrs.style = (attrs.style ? attrs.style + \";\" : \"\") + value[attr];\n }\n else if (!attrs[attr] && attr != \"contenteditable\" && attr != \"nodeName\")\n attrs[attr] = String(value[attr]);\n }\n });\n return [Decoration.node(0, view.state.doc.content.size, attrs)];\n}\nfunction updateCursorWrapper(view) {\n if (view.markCursor) {\n let dom = document.createElement(\"img\");\n dom.className = \"ProseMirror-separator\";\n dom.setAttribute(\"mark-placeholder\", \"true\");\n dom.setAttribute(\"alt\", \"\");\n view.cursorWrapper = { dom, deco: Decoration.widget(view.state.selection.head, dom, { raw: true, marks: view.markCursor }) };\n }\n else {\n view.cursorWrapper = null;\n }\n}\nfunction getEditable(view) {\n return !view.someProp(\"editable\", value => value(view.state) === false);\n}\nfunction selectionContextChanged(sel1, sel2) {\n let depth = Math.min(sel1.$anchor.sharedDepth(sel1.head), sel2.$anchor.sharedDepth(sel2.head));\n return sel1.$anchor.start(depth) != sel2.$anchor.start(depth);\n}\nfunction buildNodeViews(view) {\n let result = Object.create(null);\n function add(obj) {\n for (let prop in obj)\n if (!Object.prototype.hasOwnProperty.call(result, prop))\n result[prop] = obj[prop];\n }\n view.someProp(\"nodeViews\", add);\n view.someProp(\"markViews\", add);\n return result;\n}\nfunction changedNodeViews(a, b) {\n let nA = 0, nB = 0;\n for (let prop in a) {\n if (a[prop] != b[prop])\n return true;\n nA++;\n }\n for (let _ in b)\n nB++;\n return nA != nB;\n}\nfunction checkStateComponent(plugin) {\n if (plugin.spec.state || plugin.spec.filterTransaction || plugin.spec.appendTransaction)\n throw new RangeError(\"Plugins passed directly to the view must not have a state component\");\n}\n\nexport { Decoration, DecorationSet, EditorView, __endComposition, __parseFromClipboard, __serializeForClipboard };\n","import { Plugin } from 'prosemirror-state';\nimport { findWrapping, canJoin } from 'prosemirror-transform';\n\n/**\nInput rules are regular expressions describing a piece of text\nthat, when typed, causes something to happen. This might be\nchanging two dashes into an emdash, wrapping a paragraph starting\nwith `\"> \"` into a blockquote, or something entirely different.\n*/\nclass InputRule {\n // :: (RegExp, union<string, (state: EditorState, match: [string], start: number, end: number) → ?Transaction>)\n /**\n Create an input rule. The rule applies when the user typed\n something and the text directly in front of the cursor matches\n `match`, which should end with `$`.\n \n The `handler` can be a string, in which case the matched text, or\n the first matched group in the regexp, is replaced by that\n string.\n \n Or a it can be a function, which will be called with the match\n array produced by\n [`RegExp.exec`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/RegExp/exec),\n as well as the start and end of the matched range, and which can\n return a [transaction](https://prosemirror.net/docs/ref/#state.Transaction) that describes the\n rule's effect, or null to indicate the input was not handled.\n */\n constructor(\n /**\n @internal\n */\n match, handler) {\n this.match = match;\n this.match = match;\n this.handler = typeof handler == \"string\" ? stringHandler(handler) : handler;\n }\n}\nfunction stringHandler(string) {\n return function (state, match, start, end) {\n let insert = string;\n if (match[1]) {\n let offset = match[0].lastIndexOf(match[1]);\n insert += match[0].slice(offset + match[1].length);\n start += offset;\n let cutOff = start - end;\n if (cutOff > 0) {\n insert = match[0].slice(offset - cutOff, offset) + insert;\n start = end;\n }\n }\n return state.tr.insertText(insert, start, end);\n };\n}\nconst MAX_MATCH = 500;\n/**\nCreate an input rules plugin. When enabled, it will cause text\ninput that matches any of the given rules to trigger the rule's\naction.\n*/\nfunction inputRules({ rules }) {\n let plugin = new Plugin({\n state: {\n init() { return null; },\n apply(tr, prev) {\n let stored = tr.getMeta(this);\n if (stored)\n return stored;\n return tr.selectionSet || tr.docChanged ? null : prev;\n }\n },\n props: {\n handleTextInput(view, from, to, text) {\n return run(view, from, to, text, rules, plugin);\n },\n handleDOMEvents: {\n compositionend: (view) => {\n setTimeout(() => {\n let { $cursor } = view.state.selection;\n if ($cursor)\n run(view, $cursor.pos, $cursor.pos, \"\", rules, plugin);\n });\n }\n }\n },\n isInputRules: true\n });\n return plugin;\n}\nfunction run(view, from, to, text, rules, plugin) {\n if (view.composing)\n return false;\n let state = view.state, $from = state.doc.resolve(from);\n if ($from.parent.type.spec.code)\n return false;\n let textBefore = $from.parent.textBetween(Math.max(0, $from.parentOffset - MAX_MATCH), $from.parentOffset, null, \"\\ufffc\") + text;\n for (let i = 0; i < rules.length; i++) {\n let match = rules[i].match.exec(textBefore);\n let tr = match && rules[i].handler(state, match, from - (match[0].length - text.length), to);\n if (!tr)\n continue;\n view.dispatch(tr.setMeta(plugin, { transform: tr, from, to, text }));\n return true;\n }\n return false;\n}\n/**\nThis is a command that will undo an input rule, if applying such a\nrule was the last thing that the user did.\n*/\nconst undoInputRule = (state, dispatch) => {\n let plugins = state.plugins;\n for (let i = 0; i < plugins.length; i++) {\n let plugin = plugins[i], undoable;\n if (plugin.spec.isInputRules && (undoable = plugin.getState(state))) {\n if (dispatch) {\n let tr = state.tr, toUndo = undoable.transform;\n for (let j = toUndo.steps.length - 1; j >= 0; j--)\n tr.step(toUndo.steps[j].invert(toUndo.docs[j]));\n if (undoable.text) {\n let marks = tr.doc.resolve(undoable.from).marks();\n tr.replaceWith(undoable.from, undoable.to, state.schema.text(undoable.text, marks));\n }\n else {\n tr.delete(undoable.from, undoable.to);\n }\n dispatch(tr);\n }\n return true;\n }\n }\n return false;\n};\n\n/**\nConverts double dashes to an emdash.\n*/\nconst emDash = new InputRule(/--$/, \"—\");\n/**\nConverts three dots to an ellipsis character.\n*/\nconst ellipsis = new InputRule(/\\.\\.\\.$/, \"…\");\n/**\n“Smart” opening double quotes.\n*/\nconst openDoubleQuote = new InputRule(/(?:^|[\\s\\{\\[\\(\\<'\"\\u2018\\u201C])(\")$/, \"“\");\n/**\n“Smart” closing double quotes.\n*/\nconst closeDoubleQuote = new InputRule(/\"$/, \"”\");\n/**\n“Smart” opening single quotes.\n*/\nconst openSingleQuote = new InputRule(/(?:^|[\\s\\{\\[\\(\\<'\"\\u2018\\u201C])(')$/, \"‘\");\n/**\n“Smart” closing single quotes.\n*/\nconst closeSingleQuote = new InputRule(/'$/, \"’\");\n/**\nSmart-quote related input rules.\n*/\nconst smartQuotes = [openDoubleQuote, closeDoubleQuote, openSingleQuote, closeSingleQuote];\n\n/**\nBuild an input rule for automatically wrapping a textblock when a\ngiven string is typed. The `regexp` argument is\ndirectly passed through to the `InputRule` constructor. You'll\nprobably want the regexp to start with `^`, so that the pattern can\nonly occur at the start of a textblock.\n\n`nodeType` is the type of node to wrap in. If it needs attributes,\nyou can either pass them directly, or pass a function that will\ncompute them from the regular expression match.\n\nBy default, if there's a node with the same type above the newly\nwrapped node, the rule will try to [join](https://prosemirror.net/docs/ref/#transform.Transform.join) those\ntwo nodes. You can pass a join predicate, which takes a regular\nexpression match and the node before the wrapped node, and can\nreturn a boolean to indicate whether a join should happen.\n*/\nfunction wrappingInputRule(regexp, nodeType, getAttrs = null, joinPredicate) {\n return new InputRule(regexp, (state, match, start, end) => {\n let attrs = getAttrs instanceof Function ? getAttrs(match) : getAttrs;\n let tr = state.tr.delete(start, end);\n let $start = tr.doc.resolve(start), range = $start.blockRange(), wrapping = range && findWrapping(range, nodeType, attrs);\n if (!wrapping)\n return null;\n tr.wrap(range, wrapping);\n let before = tr.doc.resolve(start - 1).nodeBefore;\n if (before && before.type == nodeType && canJoin(tr.doc, start - 1) &&\n (!joinPredicate || joinPredicate(match, before)))\n tr.join(start - 1);\n return tr;\n });\n}\n/**\nBuild an input rule that changes the type of a textblock when the\nmatched text is typed into it. You'll usually want to start your\nregexp with `^` to that it is only matched at the start of a\ntextblock. The optional `getAttrs` parameter can be used to compute\nthe new node's attributes, and works the same as in the\n`wrappingInputRule` function.\n*/\nfunction textblockTypeInputRule(regexp, nodeType, getAttrs = null) {\n return new InputRule(regexp, (state, match, start, end) => {\n let $start = state.doc.resolve(start);\n let attrs = getAttrs instanceof Function ? getAttrs(match) : getAttrs;\n if (!$start.node(-1).canReplaceWith($start.index(-1), $start.indexAfter(-1), nodeType))\n return null;\n return state.tr\n .delete(start, end)\n .setBlockType(start, start, nodeType, attrs);\n });\n}\n\nexport { InputRule, closeDoubleQuote, closeSingleQuote, ellipsis, emDash, inputRules, openDoubleQuote, openSingleQuote, smartQuotes, textblockTypeInputRule, undoInputRule, wrappingInputRule };\n","const {\n noopTest,\n edit,\n merge\n} = require('./helpers.js');\n\n/**\n * Block-Level Grammar\n */\nconst block = {\n newline: /^\\n+/,\n code: /^( {4}[^\\n]+\\n*)+/,\n fences: /^ {0,3}(`{3,}(?=[^`\\n]*\\n)|~{3,})([^\\n]*)\\n(?:|([\\s\\S]*?)\\n)(?: {0,3}\\1[~`]* *(?:\\n+|$)|$)/,\n hr: /^ {0,3}((?:- *){3,}|(?:_ *){3,}|(?:\\* *){3,})(?:\\n+|$)/,\n heading: /^ {0,3}(#{1,6}) +([^\\n]*?)(?: +#+)? *(?:\\n+|$)/,\n blockquote: /^( {0,3}> ?(paragraph|[^\\n]*)(?:\\n|$))+/,\n list: /^( {0,3})(bull) [\\s\\S]+?(?:hr|def|\\n{2,}(?! )(?!\\1bull )\\n*|\\s*$)/,\n html: '^ {0,3}(?:' // optional indentation\n + '<(script|pre|style)[\\\\s>][\\\\s\\\\S]*?(?:</\\\\1>[^\\\\n]*\\\\n+|$)' // (1)\n + '|comment[^\\\\n]*(\\\\n+|$)' // (2)\n + '|<\\\\?[\\\\s\\\\S]*?\\\\?>\\\\n*' // (3)\n + '|<![A-Z][\\\\s\\\\S]*?>\\\\n*' // (4)\n + '|<!\\\\[CDATA\\\\[[\\\\s\\\\S]*?\\\\]\\\\]>\\\\n*' // (5)\n + '|</?(tag)(?: +|\\\\n|/?>)[\\\\s\\\\S]*?(?:\\\\n{2,}|$)' // (6)\n + '|<(?!script|pre|style)([a-z][\\\\w-]*)(?:attribute)*? */?>(?=[ \\\\t]*(?:\\\\n|$))[\\\\s\\\\S]*?(?:\\\\n{2,}|$)' // (7) open tag\n + '|</(?!script|pre|style)[a-z][\\\\w-]*\\\\s*>(?=[ \\\\t]*(?:\\\\n|$))[\\\\s\\\\S]*?(?:\\\\n{2,}|$)' // (7) closing tag\n + ')',\n def: /^ {0,3}\\[(label)\\]: *\\n? *<?([^\\s>]+)>?(?:(?: +\\n? *| *\\n *)(title))? *(?:\\n+|$)/,\n nptable: noopTest,\n table: noopTest,\n lheading: /^([^\\n]+)\\n {0,3}(=+|-+) *(?:\\n+|$)/,\n // regex template, placeholders will be replaced according to different paragraph\n // interruption rules of commonmark and the original markdown spec:\n _paragraph: /^([^\\n]+(?:\\n(?!hr|heading|lheading|blockquote|fences|list|html)[^\\n]+)*)/,\n text: /^[^\\n]+/\n};\n\nblock._label = /(?!\\s*\\])(?:\\\\[\\[\\]]|[^\\[\\]])+/;\nblock._title = /(?:\"(?:\\\\\"?|[^\"\\\\])*\"|'[^'\\n]*(?:\\n[^'\\n]+)*\\n?'|\\([^()]*\\))/;\nblock.def = edit(block.def)\n .replace('label', block._label)\n .replace('title', block._title)\n .getRegex();\n\nblock.bullet = /(?:[*+-]|\\d{1,9}\\.)/;\nblock.item = /^( *)(bull) ?[^\\n]*(?:\\n(?!\\1bull ?)[^\\n]*)*/;\nblock.item = edit(block.item, 'gm')\n .replace(/bull/g, block.bullet)\n .getRegex();\n\nblock.list = edit(block.list)\n .replace(/bull/g, block.bullet)\n .replace('hr', '\\\\n+(?=\\\\1?(?:(?:- *){3,}|(?:_ *){3,}|(?:\\\\* *){3,})(?:\\\\n+|$))')\n .replace('def', '\\\\n+(?=' + block.def.source + ')')\n .getRegex();\n\nblock._tag = 'address|article|aside|base|basefont|blockquote|body|caption'\n + '|center|col|colgroup|dd|details|dialog|dir|div|dl|dt|fieldset|figcaption'\n + '|figure|footer|form|frame|frameset|h[1-6]|head|header|hr|html|iframe'\n + '|legend|li|link|main|menu|menuitem|meta|nav|noframes|ol|optgroup|option'\n + '|p|param|section|source|summary|table|tbody|td|tfoot|th|thead|title|tr'\n + '|track|ul';\nblock._comment = /<!--(?!-?>)[\\s\\S]*?-->/;\nblock.html = edit(block.html, 'i')\n .replace('comment', block._comment)\n .replace('tag', block._tag)\n .replace('attribute', / +[a-zA-Z:_][\\w.:-]*(?: *= *\"[^\"\\n]*\"| *= *'[^'\\n]*'| *= *[^\\s\"'=<>`]+)?/)\n .getRegex();\n\nblock.paragraph = edit(block._paragraph)\n .replace('hr', block.hr)\n .replace('heading', ' {0,3}#{1,6} ')\n .replace('|lheading', '') // setex headings don't interrupt commonmark paragraphs\n .replace('blockquote', ' {0,3}>')\n .replace('fences', ' {0,3}(?:`{3,}(?=[^`\\\\n]*\\\\n)|~{3,})[^\\\\n]*\\\\n')\n .replace('list', ' {0,3}(?:[*+-]|1[.)]) ') // only lists starting from 1 can interrupt\n .replace('html', '</?(?:tag)(?: +|\\\\n|/?>)|<(?:script|pre|style|!--)')\n .replace('tag', block._tag) // pars can be interrupted by type (6) html blocks\n .getRegex();\n\nblock.blockquote = edit(block.blockquote)\n .replace('paragraph', block.paragraph)\n .getRegex();\n\n/**\n * Normal Block Grammar\n */\n\nblock.normal = merge({}, block);\n\n/**\n * GFM Block Grammar\n */\n\nblock.gfm = merge({}, block.normal, {\n nptable: '^ *([^|\\\\n ].*\\\\|.*)\\\\n' // Header\n + ' *([-:]+ *\\\\|[-| :]*)' // Align\n + '(?:\\\\n((?:(?!\\\\n|hr|heading|blockquote|code|fences|list|html).*(?:\\\\n|$))*)\\\\n*|$)', // Cells\n table: '^ *\\\\|(.+)\\\\n' // Header\n + ' *\\\\|?( *[-:]+[-| :]*)' // Align\n + '(?:\\\\n *((?:(?!\\\\n|hr|heading|blockquote|code|fences|list|html).*(?:\\\\n|$))*)\\\\n*|$)' // Cells\n});\n\nblock.gfm.nptable = edit(block.gfm.nptable)\n .replace('hr', block.hr)\n .replace('heading', ' {0,3}#{1,6} ')\n .replace('blockquote', ' {0,3}>')\n .replace('code', ' {4}[^\\\\n]')\n .replace('fences', ' {0,3}(?:`{3,}(?=[^`\\\\n]*\\\\n)|~{3,})[^\\\\n]*\\\\n')\n .replace('list', ' {0,3}(?:[*+-]|1[.)]) ') // only lists starting from 1 can interrupt\n .replace('html', '</?(?:tag)(?: +|\\\\n|/?>)|<(?:script|pre|style|!--)')\n .replace('tag', block._tag) // tables can be interrupted by type (6) html blocks\n .getRegex();\n\nblock.gfm.table = edit(block.gfm.table)\n .replace('hr', block.hr)\n .replace('heading', ' {0,3}#{1,6} ')\n .replace('blockquote', ' {0,3}>')\n .replace('code', ' {4}[^\\\\n]')\n .replace('fences', ' {0,3}(?:`{3,}(?=[^`\\\\n]*\\\\n)|~{3,})[^\\\\n]*\\\\n')\n .replace('list', ' {0,3}(?:[*+-]|1[.)]) ') // only lists starting from 1 can interrupt\n .replace('html', '</?(?:tag)(?: +|\\\\n|/?>)|<(?:script|pre|style|!--)')\n .replace('tag', block._tag) // tables can be interrupted by type (6) html blocks\n .getRegex();\n\n/**\n * Pedantic grammar (original John Gruber's loose markdown specification)\n */\n\nblock.pedantic = merge({}, block.normal, {\n html: edit(\n '^ *(?:comment *(?:\\\\n|\\\\s*$)'\n + '|<(tag)[\\\\s\\\\S]+?</\\\\1> *(?:\\\\n{2,}|\\\\s*$)' // closed tag\n + '|<tag(?:\"[^\"]*\"|\\'[^\\']*\\'|\\\\s[^\\'\"/>\\\\s]*)*?/?> *(?:\\\\n{2,}|\\\\s*$))')\n .replace('comment', block._comment)\n .replace(/tag/g, '(?!(?:'\n + 'a|em|strong|small|s|cite|q|dfn|abbr|data|time|code|var|samp|kbd|sub'\n + '|sup|i|b|u|mark|ruby|rt|rp|bdi|bdo|span|br|wbr|ins|del|img)'\n + '\\\\b)\\\\w+(?!:|[^\\\\w\\\\s@]*@)\\\\b')\n .getRegex(),\n def: /^ *\\[([^\\]]+)\\]: *<?([^\\s>]+)>?(?: +([\"(][^\\n]+[\")]))? *(?:\\n+|$)/,\n heading: /^ *(#{1,6}) *([^\\n]+?) *(?:#+ *)?(?:\\n+|$)/,\n fences: noopTest, // fences not supported\n paragraph: edit(block.normal._paragraph)\n .replace('hr', block.hr)\n .replace('heading', ' *#{1,6} *[^\\n]')\n .replace('lheading', block.lheading)\n .replace('blockquote', ' {0,3}>')\n .replace('|fences', '')\n .replace('|list', '')\n .replace('|html', '')\n .getRegex()\n});\n\n/**\n * Inline-Level Grammar\n */\nconst inline = {\n escape: /^\\\\([!\"#$%&'()*+,\\-./:;<=>?@\\[\\]\\\\^_`{|}~])/,\n autolink: /^<(scheme:[^\\s\\x00-\\x1f<>]*|email)>/,\n url: noopTest,\n tag: '^comment'\n + '|^</[a-zA-Z][\\\\w:-]*\\\\s*>' // self-closing tag\n + '|^<[a-zA-Z][\\\\w-]*(?:attribute)*?\\\\s*/?>' // open tag\n + '|^<\\\\?[\\\\s\\\\S]*?\\\\?>' // processing instruction, e.g. <?php ?>\n + '|^<![a-zA-Z]+\\\\s[\\\\s\\\\S]*?>' // declaration, e.g. <!DOCTYPE html>\n + '|^<!\\\\[CDATA\\\\[[\\\\s\\\\S]*?\\\\]\\\\]>', // CDATA section\n link: /^!?\\[(label)\\]\\(\\s*(href)(?:\\s+(title))?\\s*\\)/,\n reflink: /^!?\\[(label)\\]\\[(?!\\s*\\])((?:\\\\[\\[\\]]?|[^\\[\\]\\\\])+)\\]/,\n nolink: /^!?\\[(?!\\s*\\])((?:\\[[^\\[\\]]*\\]|\\\\[\\[\\]]|[^\\[\\]])*)\\](?:\\[\\])?/,\n strong: /^__([^\\s_])__(?!_)|^\\*\\*([^\\s*])\\*\\*(?!\\*)|^__([^\\s][\\s\\S]*?[^\\s])__(?!_)|^\\*\\*([^\\s][\\s\\S]*?[^\\s])\\*\\*(?!\\*)/,\n em: /^_([^\\s_])_(?!_)|^\\*([^\\s*<\\[])\\*(?!\\*)|^_([^\\s<][\\s\\S]*?[^\\s_])_(?!_|[^\\spunctuation])|^_([^\\s_<][\\s\\S]*?[^\\s])_(?!_|[^\\spunctuation])|^\\*([^\\s<\"][\\s\\S]*?[^\\s\\*])\\*(?!\\*|[^\\spunctuation])|^\\*([^\\s*\"<\\[][\\s\\S]*?[^\\s])\\*(?!\\*)/,\n code: /^(`+)([^`]|[^`][\\s\\S]*?[^`])\\1(?!`)/,\n br: /^( {2,}|\\\\)\\n(?!\\s*$)/,\n del: noopTest,\n text: /^(`+|[^`])(?:[\\s\\S]*?(?:(?=[\\\\<!\\[`*]|\\b_|$)|[^ ](?= {2,}\\n))|(?= {2,}\\n))/\n};\n\n// list of punctuation marks from common mark spec\n// without ` and ] to workaround Rule 17 (inline code blocks/links)\ninline._punctuation = '!\"#$%&\\'()*+,\\\\-./:;<=>?@\\\\[^_{|}~';\ninline.em = edit(inline.em).replace(/punctuation/g, inline._punctuation).getRegex();\n\ninline._escapes = /\\\\([!\"#$%&'()*+,\\-./:;<=>?@\\[\\]\\\\^_`{|}~])/g;\n\ninline._scheme = /[a-zA-Z][a-zA-Z0-9+.-]{1,31}/;\ninline._email = /[a-zA-Z0-9.!#$%&'*+/=?^_`{|}~-]+(@)[a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?(?:\\.[a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?)+(?![-_])/;\ninline.autolink = edit(inline.autolink)\n .replace('scheme', inline._scheme)\n .replace('email', inline._email)\n .getRegex();\n\ninline._attribute = /\\s+[a-zA-Z:_][\\w.:-]*(?:\\s*=\\s*\"[^\"]*\"|\\s*=\\s*'[^']*'|\\s*=\\s*[^\\s\"'=<>`]+)?/;\n\ninline.tag = edit(inline.tag)\n .replace('comment', block._comment)\n .replace('attribute', inline._attribute)\n .getRegex();\n\ninline._label = /(?:\\[[^\\[\\]]*\\]|\\\\.|`[^`]*`|[^\\[\\]\\\\`])*?/;\ninline._href = /<(?:\\\\[<>]?|[^\\s<>\\\\])*>|[^\\s\\x00-\\x1f]*/;\ninline._title = /\"(?:\\\\\"?|[^\"\\\\])*\"|'(?:\\\\'?|[^'\\\\])*'|\\((?:\\\\\\)?|[^)\\\\])*\\)/;\n\ninline.link = edit(inline.link)\n .replace('label', inline._label)\n .replace('href', inline._href)\n .replace('title', inline._title)\n .getRegex();\n\ninline.reflink = edit(inline.reflink)\n .replace('label', inline._label)\n .getRegex();\n\n/**\n * Normal Inline Grammar\n */\n\ninline.normal = merge({}, inline);\n\n/**\n * Pedantic Inline Grammar\n */\n\ninline.pedantic = merge({}, inline.normal, {\n strong: /^__(?=\\S)([\\s\\S]*?\\S)__(?!_)|^\\*\\*(?=\\S)([\\s\\S]*?\\S)\\*\\*(?!\\*)/,\n em: /^_(?=\\S)([\\s\\S]*?\\S)_(?!_)|^\\*(?=\\S)([\\s\\S]*?\\S)\\*(?!\\*)/,\n link: edit(/^!?\\[(label)\\]\\((.*?)\\)/)\n .replace('label', inline._label)\n .getRegex(),\n reflink: edit(/^!?\\[(label)\\]\\s*\\[([^\\]]*)\\]/)\n .replace('label', inline._label)\n .getRegex()\n});\n\n/**\n * GFM Inline Grammar\n */\n\ninline.gfm = merge({}, inline.normal, {\n escape: edit(inline.escape).replace('])', '~|])').getRegex(),\n _extended_email: /[A-Za-z0-9._+-]+(@)[a-zA-Z0-9-_]+(?:\\.[a-zA-Z0-9-_]*[a-zA-Z0-9])+(?![-_])/,\n url: /^((?:ftp|https?):\\/\\/|www\\.)(?:[a-zA-Z0-9\\-]+\\.?)+[^\\s<]*|^email/,\n _backpedal: /(?:[^?!.,:;*_~()&]+|\\([^)]*\\)|&(?![a-zA-Z0-9]+;$)|[?!.,:;*_~)]+(?!$))+/,\n del: /^~+(?=\\S)([\\s\\S]*?\\S)~+/,\n text: /^(`+|[^`])(?:[\\s\\S]*?(?:(?=[\\\\<!\\[`*~]|\\b_|https?:\\/\\/|ftp:\\/\\/|www\\.|$)|[^ ](?= {2,}\\n)|[^a-zA-Z0-9.!#$%&'*+\\/=?_`{\\|}~-](?=[a-zA-Z0-9.!#$%&'*+\\/=?_`{\\|}~-]+@))|(?= {2,}\\n|[a-zA-Z0-9.!#$%&'*+\\/=?_`{\\|}~-]+@))/\n});\n\ninline.gfm.url = edit(inline.gfm.url, 'i')\n .replace('email', inline.gfm._extended_email)\n .getRegex();\n/**\n * GFM + Line Breaks Inline Grammar\n */\n\ninline.breaks = merge({}, inline.gfm, {\n br: edit(inline.br).replace('{2,}', '*').getRegex(),\n text: edit(inline.gfm.text)\n .replace('\\\\b_', '\\\\b_| {2,}\\\\n')\n .replace(/\\{2,\\}/g, '*')\n .getRegex()\n});\n\nmodule.exports = {\n block,\n inline\n};\n","const Renderer = require('./Renderer.js');\nconst { defaults } = require('./defaults.js');\nconst { inline } = require('./rules.js');\nconst {\n findClosingBracket,\n escape\n} = require('./helpers.js');\n\n/**\n * Inline Lexer & Compiler\n */\nmodule.exports = class InlineLexer {\n constructor(links, options) {\n this.options = options || defaults;\n this.links = links;\n this.rules = inline.normal;\n this.options.renderer = this.options.renderer || new Renderer();\n this.renderer = this.options.renderer;\n this.renderer.options = this.options;\n\n if (!this.links) {\n throw new Error('Tokens array requires a `links` property.');\n }\n\n if (this.options.pedantic) {\n this.rules = inline.pedantic;\n } else if (this.options.gfm) {\n if (this.options.breaks) {\n this.rules = inline.breaks;\n } else {\n this.rules = inline.gfm;\n }\n }\n }\n\n /**\n * Expose Inline Rules\n */\n static get rules() {\n return inline;\n }\n\n /**\n * Static Lexing/Compiling Method\n */\n static output(src, links, options) {\n const inline = new InlineLexer(links, options);\n return inline.output(src);\n }\n\n /**\n * Lexing/Compiling\n */\n output(src) {\n let out = '',\n link,\n text,\n href,\n title,\n cap,\n prevCapZero;\n\n while (src) {\n // escape\n if (cap = this.rules.escape.exec(src)) {\n src = src.substring(cap[0].length);\n out += escape(cap[1]);\n continue;\n }\n\n // tag\n if (cap = this.rules.tag.exec(src)) {\n if (!this.inLink && /^<a /i.test(cap[0])) {\n this.inLink = true;\n } else if (this.inLink && /^<\\/a>/i.test(cap[0])) {\n this.inLink = false;\n }\n if (!this.inRawBlock && /^<(pre|code|kbd|script)(\\s|>)/i.test(cap[0])) {\n this.inRawBlock = true;\n } else if (this.inRawBlock && /^<\\/(pre|code|kbd|script)(\\s|>)/i.test(cap[0])) {\n this.inRawBlock = false;\n }\n\n src = src.substring(cap[0].length);\n out += this.renderer.html(this.options.sanitize\n ? (this.options.sanitizer\n ? this.options.sanitizer(cap[0])\n : escape(cap[0]))\n : cap[0]);\n continue;\n }\n\n // link\n if (cap = this.rules.link.exec(src)) {\n const lastParenIndex = findClosingBracket(cap[2], '()');\n if (lastParenIndex > -1) {\n const start = cap[0].indexOf('!') === 0 ? 5 : 4;\n const linkLen = start + cap[1].length + lastParenIndex;\n cap[2] = cap[2].substring(0, lastParenIndex);\n cap[0] = cap[0].substring(0, linkLen).trim();\n cap[3] = '';\n }\n src = src.substring(cap[0].length);\n this.inLink = true;\n href = cap[2];\n if (this.options.pedantic) {\n link = /^([^'\"]*[^\\s])\\s+(['\"])(.*)\\2/.exec(href);\n\n if (link) {\n href = link[1];\n title = link[3];\n } else {\n title = '';\n }\n } else {\n title = cap[3] ? cap[3].slice(1, -1) : '';\n }\n href = href.trim().replace(/^<([\\s\\S]*)>$/, '$1');\n out += this.outputLink(cap, {\n href: InlineLexer.escapes(href),\n title: InlineLexer.escapes(title)\n });\n this.inLink = false;\n continue;\n }\n\n // reflink, nolink\n if ((cap = this.rules.reflink.exec(src))\n || (cap = this.rules.nolink.exec(src))) {\n src = src.substring(cap[0].length);\n link = (cap[2] || cap[1]).replace(/\\s+/g, ' ');\n link = this.links[link.toLowerCase()];\n if (!link || !link.href) {\n out += cap[0].charAt(0);\n src = cap[0].substring(1) + src;\n continue;\n }\n this.inLink = true;\n out += this.outputLink(cap, link);\n this.inLink = false;\n continue;\n }\n\n // strong\n if (cap = this.rules.strong.exec(src)) {\n src = src.substring(cap[0].length);\n out += this.renderer.strong(this.output(cap[4] || cap[3] || cap[2] || cap[1]));\n continue;\n }\n\n // em\n if (cap = this.rules.em.exec(src)) {\n src = src.substring(cap[0].length);\n out += this.renderer.em(this.output(cap[6] || cap[5] || cap[4] || cap[3] || cap[2] || cap[1]));\n continue;\n }\n\n // code\n if (cap = this.rules.code.exec(src)) {\n src = src.substring(cap[0].length);\n out += this.renderer.codespan(escape(cap[2].trim(), true));\n continue;\n }\n\n // br\n if (cap = this.rules.br.exec(src)) {\n src = src.substring(cap[0].length);\n out += this.renderer.br();\n continue;\n }\n\n // del (gfm)\n if (cap = this.rules.del.exec(src)) {\n src = src.substring(cap[0].length);\n out += this.renderer.del(this.output(cap[1]));\n continue;\n }\n\n // autolink\n if (cap = this.rules.autolink.exec(src)) {\n src = src.substring(cap[0].length);\n if (cap[2] === '@') {\n text = escape(this.mangle(cap[1]));\n href = 'mailto:' + text;\n } else {\n text = escape(cap[1]);\n href = text;\n }\n out += this.renderer.link(href, null, text);\n continue;\n }\n\n // url (gfm)\n if (!this.inLink && (cap = this.rules.url.exec(src))) {\n if (cap[2] === '@') {\n text = escape(cap[0]);\n href = 'mailto:' + text;\n } else {\n // do extended autolink path validation\n do {\n prevCapZero = cap[0];\n cap[0] = this.rules._backpedal.exec(cap[0])[0];\n } while (prevCapZero !== cap[0]);\n text = escape(cap[0]);\n if (cap[1] === 'www.') {\n href = 'http://' + text;\n } else {\n href = text;\n }\n }\n src = src.substring(cap[0].length);\n out += this.renderer.link(href, null, text);\n continue;\n }\n\n // text\n if (cap = this.rules.text.exec(src)) {\n src = src.substring(cap[0].length);\n if (this.inRawBlock) {\n out += this.renderer.text(this.options.sanitize ? (this.options.sanitizer ? this.options.sanitizer(cap[0]) : escape(cap[0])) : cap[0]);\n } else {\n out += this.renderer.text(escape(this.smartypants(cap[0])));\n }\n continue;\n }\n\n if (src) {\n throw new Error('Infinite loop on byte: ' + src.charCodeAt(0));\n }\n }\n\n return out;\n }\n\n static escapes(text) {\n return text ? text.replace(InlineLexer.rules._escapes, '$1') : text;\n }\n\n /**\n * Compile Link\n */\n outputLink(cap, link) {\n const href = link.href,\n title = link.title ? escape(link.title) : null;\n\n return cap[0].charAt(0) !== '!'\n ? this.renderer.link(href, title, this.output(cap[1]))\n : this.renderer.image(href, title, escape(cap[1]));\n }\n\n /**\n * Smartypants Transformations\n */\n smartypants(text) {\n if (!this.options.smartypants) return text;\n return text\n // em-dashes\n .replace(/---/g, '\\u2014')\n // en-dashes\n .replace(/--/g, '\\u2013')\n // opening singles\n .replace(/(^|[-\\u2014/(\\[{\"\\s])'/g, '$1\\u2018')\n // closing singles & apostrophes\n .replace(/'/g, '\\u2019')\n // opening doubles\n .replace(/(^|[-\\u2014/(\\[{\\u2018\\s])\"/g, '$1\\u201c')\n // closing doubles\n .replace(/\"/g, '\\u201d')\n // ellipses\n .replace(/\\.{3}/g, '\\u2026');\n }\n\n /**\n * Mangle Links\n */\n mangle(text) {\n if (!this.options.mangle) return text;\n const l = text.length;\n let out = '',\n i = 0,\n ch;\n\n for (; i < l; i++) {\n ch = text.charCodeAt(i);\n if (Math.random() > 0.5) {\n ch = 'x' + ch.toString(16);\n }\n out += '&#' + ch + ';';\n }\n\n return out;\n }\n};\n","\n /*!\n * tiptap-utils v1.13.0\n * (c) 2021 überdosis GbR (limited liability)\n * @license MIT\n */\n \nimport { NodeSelection } from 'prosemirror-state';\n\nfunction createCell(cellType, cellContent) {\n if (cellContent) {\n return cellType.createChecked(null, cellContent);\n }\n\n return cellType.createAndFill();\n}\n\nfunction getTableNodeTypes(schema) {\n if (schema.cached.tableNodeTypes) {\n return schema.cached.tableNodeTypes;\n }\n\n const roles = {};\n Object.keys(schema.nodes).forEach(type => {\n const nodeType = schema.nodes[type];\n\n if (nodeType.spec.tableRole) {\n roles[nodeType.spec.tableRole] = nodeType;\n }\n }); // eslint-disable-next-line\n\n schema.cached.tableNodeTypes = roles;\n return roles;\n}\n\nfunction createTable(schema, rowsCount, colsCount, withHeaderRow, cellContent) {\n const types = getTableNodeTypes(schema);\n const headerCells = [];\n const cells = [];\n\n for (let index = 0; index < colsCount; index += 1) {\n const cell = createCell(types.cell, cellContent);\n\n if (cell) {\n cells.push(cell);\n }\n\n if (withHeaderRow) {\n const headerCell = createCell(types.header_cell, cellContent);\n\n if (headerCell) {\n headerCells.push(headerCell);\n }\n }\n }\n\n const rows = [];\n\n for (let index = 0; index < rowsCount; index += 1) {\n rows.push(types.row.createChecked(null, withHeaderRow && index === 0 ? headerCells : cells));\n }\n\n return types.table.createChecked(null, rows);\n}\n\nfunction equalNodeType(nodeType, node) {\n return Array.isArray(nodeType) && nodeType.indexOf(node.type) > -1 || node.type === nodeType;\n}\n\nfunction flatten(node) {\n // eslint-disable-next-line\n const descend = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : true;\n\n if (!node) {\n throw new Error('Invalid \"node\" parameter');\n }\n\n const result = []; // eslint-disable-next-line\n\n node.descendants((child, pos) => {\n result.push({\n node: child,\n pos\n });\n\n if (!descend) {\n return false;\n }\n });\n return result;\n}\n\nfunction findChildren(node, predicate, descend) {\n if (!node) {\n throw new Error('Invalid \"node\" parameter');\n } else if (!predicate) {\n throw new Error('Invalid \"predicate\" parameter');\n }\n\n return flatten(node, descend).filter(child => predicate(child.node));\n}\n\nfunction findBlockNodes(node, descend) {\n return findChildren(node, child => child.isBlock, descend);\n}\n\n// eslint-disable-next-line\nfunction findParentNodeClosestToPos($pos, predicate) {\n for (let i = $pos.depth; i > 0; i -= 1) {\n const node = $pos.node(i);\n\n if (predicate(node)) {\n return {\n pos: i > 0 ? $pos.before(i) : 0,\n start: $pos.start(i),\n depth: i,\n node\n };\n }\n }\n}\n\nfunction findParentNode(predicate) {\n return selection => findParentNodeClosestToPos(selection.$from, predicate);\n}\n\nfunction isNodeSelection(selection) {\n return selection instanceof NodeSelection;\n}\n\nfunction findSelectedNodeOfType(nodeType) {\n // eslint-disable-next-line\n return function (selection) {\n if (isNodeSelection(selection)) {\n const {\n node\n } = selection;\n const {\n $from\n } = selection;\n\n if (equalNodeType(nodeType, node)) {\n return {\n node,\n pos: $from.pos,\n depth: $from.depth\n };\n }\n }\n };\n}\n\nfunction getMarkAttrs(state, type) {\n const {\n from,\n to\n } = state.selection;\n let marks = [];\n state.doc.nodesBetween(from, to, node => {\n marks = [...marks, ...node.marks];\n });\n const mark = marks.find(markItem => markItem.type.name === type.name);\n\n if (mark) {\n return mark.attrs;\n }\n\n return {};\n}\n\nfunction getMarkRange($pos = null, type = null) {\n if (!$pos || !type) {\n return false;\n }\n\n const start = $pos.parent.childAfter($pos.parentOffset);\n\n if (!start.node) {\n return false;\n }\n\n const link = start.node.marks.find(mark => mark.type === type);\n\n if (!link) {\n return false;\n }\n\n let startIndex = $pos.index();\n let startPos = $pos.start() + start.offset;\n let endIndex = startIndex + 1;\n let endPos = startPos + start.node.nodeSize;\n\n while (startIndex > 0 && link.isInSet($pos.parent.child(startIndex - 1).marks)) {\n startIndex -= 1;\n startPos -= $pos.parent.child(startIndex).nodeSize;\n }\n\n while (endIndex < $pos.parent.childCount && link.isInSet($pos.parent.child(endIndex).marks)) {\n endPos += $pos.parent.child(endIndex).nodeSize;\n endIndex += 1;\n }\n\n return {\n from: startPos,\n to: endPos\n };\n}\n\nfunction getNodeAttrs(state, type) {\n const {\n from,\n to\n } = state.selection;\n let nodes = [];\n state.doc.nodesBetween(from, to, node => {\n nodes = [...nodes, node];\n });\n const node = nodes.reverse().find(nodeItem => nodeItem.type.name === type.name);\n\n if (node) {\n return node.attrs;\n }\n\n return {};\n}\n\nfunction markIsActive(state, type) {\n const {\n from,\n $from,\n to,\n empty\n } = state.selection;\n\n if (empty) {\n return !!type.isInSet(state.storedMarks || $from.marks());\n }\n\n return !!state.doc.rangeHasMark(from, to, type);\n}\n\nfunction nodeEqualsType({\n types,\n node\n}) {\n return Array.isArray(types) && types.includes(node.type) || node.type === types;\n}\n\nfunction nodeIsActive(state, type, attrs = {}) {\n const predicate = node => node.type === type;\n\n const node = findSelectedNodeOfType(type)(state.selection) || findParentNode(predicate)(state.selection);\n\n if (!Object.keys(attrs).length || !node) {\n return !!node;\n }\n\n return node.node.hasMarkup(type, { ...node.node.attrs,\n ...attrs\n });\n}\n\nexport { createCell, createTable, equalNodeType, findBlockNodes, findChildren, findParentNode, findParentNodeClosestToPos, findSelectedNodeOfType, flatten, getMarkAttrs, getMarkRange, getNodeAttrs, getTableNodeTypes, isNodeSelection, markIsActive, nodeEqualsType, nodeIsActive };\n","import { findWrapping, ReplaceAroundStep, canSplit, liftTarget } from 'prosemirror-transform';\nimport { NodeRange, Fragment, Slice } from 'prosemirror-model';\nimport { Selection } from 'prosemirror-state';\n\nconst olDOM = [\"ol\", 0], ulDOM = [\"ul\", 0], liDOM = [\"li\", 0];\n/**\nAn ordered list [node spec](https://prosemirror.net/docs/ref/#model.NodeSpec). Has a single\nattribute, `order`, which determines the number at which the list\nstarts counting, and defaults to 1. Represented as an `<ol>`\nelement.\n*/\nconst orderedList = {\n attrs: { order: { default: 1 } },\n parseDOM: [{ tag: \"ol\", getAttrs(dom) {\n return { order: dom.hasAttribute(\"start\") ? +dom.getAttribute(\"start\") : 1 };\n } }],\n toDOM(node) {\n return node.attrs.order == 1 ? olDOM : [\"ol\", { start: node.attrs.order }, 0];\n }\n};\n/**\nA bullet list node spec, represented in the DOM as `<ul>`.\n*/\nconst bulletList = {\n parseDOM: [{ tag: \"ul\" }],\n toDOM() { return ulDOM; }\n};\n/**\nA list item (`<li>`) spec.\n*/\nconst listItem = {\n parseDOM: [{ tag: \"li\" }],\n toDOM() { return liDOM; },\n defining: true\n};\nfunction add(obj, props) {\n let copy = {};\n for (let prop in obj)\n copy[prop] = obj[prop];\n for (let prop in props)\n copy[prop] = props[prop];\n return copy;\n}\n/**\nConvenience function for adding list-related node types to a map\nspecifying the nodes for a schema. Adds\n[`orderedList`](https://prosemirror.net/docs/ref/#schema-list.orderedList) as `\"ordered_list\"`,\n[`bulletList`](https://prosemirror.net/docs/ref/#schema-list.bulletList) as `\"bullet_list\"`, and\n[`listItem`](https://prosemirror.net/docs/ref/#schema-list.listItem) as `\"list_item\"`.\n\n`itemContent` determines the content expression for the list items.\nIf you want the commands defined in this module to apply to your\nlist structure, it should have a shape like `\"paragraph block*\"` or\n`\"paragraph (ordered_list | bullet_list)*\"`. `listGroup` can be\ngiven to assign a group name to the list node types, for example\n`\"block\"`.\n*/\nfunction addListNodes(nodes, itemContent, listGroup) {\n return nodes.append({\n ordered_list: add(orderedList, { content: \"list_item+\", group: listGroup }),\n bullet_list: add(bulletList, { content: \"list_item+\", group: listGroup }),\n list_item: add(listItem, { content: itemContent })\n });\n}\n/**\nReturns a command function that wraps the selection in a list with\nthe given type an attributes. If `dispatch` is null, only return a\nvalue to indicate whether this is possible, but don't actually\nperform the change.\n*/\nfunction wrapInList(listType, attrs = null) {\n return function (state, dispatch) {\n let { $from, $to } = state.selection;\n let range = $from.blockRange($to), doJoin = false, outerRange = range;\n if (!range)\n return false;\n // This is at the top of an existing list item\n if (range.depth >= 2 && $from.node(range.depth - 1).type.compatibleContent(listType) && range.startIndex == 0) {\n // Don't do anything if this is the top of the list\n if ($from.index(range.depth - 1) == 0)\n return false;\n let $insert = state.doc.resolve(range.start - 2);\n outerRange = new NodeRange($insert, $insert, range.depth);\n if (range.endIndex < range.parent.childCount)\n range = new NodeRange($from, state.doc.resolve($to.end(range.depth)), range.depth);\n doJoin = true;\n }\n let wrap = findWrapping(outerRange, listType, attrs, range);\n if (!wrap)\n return false;\n if (dispatch)\n dispatch(doWrapInList(state.tr, range, wrap, doJoin, listType).scrollIntoView());\n return true;\n };\n}\nfunction doWrapInList(tr, range, wrappers, joinBefore, listType) {\n let content = Fragment.empty;\n for (let i = wrappers.length - 1; i >= 0; i--)\n content = Fragment.from(wrappers[i].type.create(wrappers[i].attrs, content));\n tr.step(new ReplaceAroundStep(range.start - (joinBefore ? 2 : 0), range.end, range.start, range.end, new Slice(content, 0, 0), wrappers.length, true));\n let found = 0;\n for (let i = 0; i < wrappers.length; i++)\n if (wrappers[i].type == listType)\n found = i + 1;\n let splitDepth = wrappers.length - found;\n let splitPos = range.start + wrappers.length - (joinBefore ? 2 : 0), parent = range.parent;\n for (let i = range.startIndex, e = range.endIndex, first = true; i < e; i++, first = false) {\n if (!first && canSplit(tr.doc, splitPos, splitDepth)) {\n tr.split(splitPos, splitDepth);\n splitPos += 2 * splitDepth;\n }\n splitPos += parent.child(i).nodeSize;\n }\n return tr;\n}\n/**\nBuild a command that splits a non-empty textblock at the top level\nof a list item by also splitting that list item.\n*/\nfunction splitListItem(itemType) {\n return function (state, dispatch) {\n let { $from, $to, node } = state.selection;\n if ((node && node.isBlock) || $from.depth < 2 || !$from.sameParent($to))\n return false;\n let grandParent = $from.node(-1);\n if (grandParent.type != itemType)\n return false;\n if ($from.parent.content.size == 0 && $from.node(-1).childCount == $from.indexAfter(-1)) {\n // In an empty block. If this is a nested list, the wrapping\n // list item should be split. Otherwise, bail out and let next\n // command handle lifting.\n if ($from.depth == 3 || $from.node(-3).type != itemType ||\n $from.index(-2) != $from.node(-2).childCount - 1)\n return false;\n if (dispatch) {\n let wrap = Fragment.empty;\n let depthBefore = $from.index(-1) ? 1 : $from.index(-2) ? 2 : 3;\n // Build a fragment containing empty versions of the structure\n // from the outer list item to the parent node of the cursor\n for (let d = $from.depth - depthBefore; d >= $from.depth - 3; d--)\n wrap = Fragment.from($from.node(d).copy(wrap));\n let depthAfter = $from.indexAfter(-1) < $from.node(-2).childCount ? 1\n : $from.indexAfter(-2) < $from.node(-3).childCount ? 2 : 3;\n // Add a second list item with an empty default start node\n wrap = wrap.append(Fragment.from(itemType.createAndFill()));\n let start = $from.before($from.depth - (depthBefore - 1));\n let tr = state.tr.replace(start, $from.after(-depthAfter), new Slice(wrap, 4 - depthBefore, 0));\n let sel = -1;\n tr.doc.nodesBetween(start, tr.doc.content.size, (node, pos) => {\n if (sel > -1)\n return false;\n if (node.isTextblock && node.content.size == 0)\n sel = pos + 1;\n });\n if (sel > -1)\n tr.setSelection(Selection.near(tr.doc.resolve(sel)));\n dispatch(tr.scrollIntoView());\n }\n return true;\n }\n let nextType = $to.pos == $from.end() ? grandParent.contentMatchAt(0).defaultType : null;\n let tr = state.tr.delete($from.pos, $to.pos);\n let types = nextType ? [null, { type: nextType }] : undefined;\n if (!canSplit(tr.doc, $from.pos, 2, types))\n return false;\n if (dispatch)\n dispatch(tr.split($from.pos, 2, types).scrollIntoView());\n return true;\n };\n}\n/**\nCreate a command to lift the list item around the selection up into\na wrapping list.\n*/\nfunction liftListItem(itemType) {\n return function (state, dispatch) {\n let { $from, $to } = state.selection;\n let range = $from.blockRange($to, node => node.childCount > 0 && node.firstChild.type == itemType);\n if (!range)\n return false;\n if (!dispatch)\n return true;\n if ($from.node(range.depth - 1).type == itemType) // Inside a parent list\n return liftToOuterList(state, dispatch, itemType, range);\n else // Outer list node\n return liftOutOfList(state, dispatch, range);\n };\n}\nfunction liftToOuterList(state, dispatch, itemType, range) {\n let tr = state.tr, end = range.end, endOfList = range.$to.end(range.depth);\n if (end < endOfList) {\n // There are siblings after the lifted items, which must become\n // children of the last item\n tr.step(new ReplaceAroundStep(end - 1, endOfList, end, endOfList, new Slice(Fragment.from(itemType.create(null, range.parent.copy())), 1, 0), 1, true));\n range = new NodeRange(tr.doc.resolve(range.$from.pos), tr.doc.resolve(endOfList), range.depth);\n }\n const target = liftTarget(range);\n if (target == null)\n return false;\n dispatch(tr.lift(range, target).scrollIntoView());\n return true;\n}\nfunction liftOutOfList(state, dispatch, range) {\n let tr = state.tr, list = range.parent;\n // Merge the list items into a single big item\n for (let pos = range.end, i = range.endIndex - 1, e = range.startIndex; i > e; i--) {\n pos -= list.child(i).nodeSize;\n tr.delete(pos - 1, pos + 1);\n }\n let $start = tr.doc.resolve(range.start), item = $start.nodeAfter;\n if (tr.mapping.map(range.end) != range.start + $start.nodeAfter.nodeSize)\n return false;\n let atStart = range.startIndex == 0, atEnd = range.endIndex == list.childCount;\n let parent = $start.node(-1), indexBefore = $start.index(-1);\n if (!parent.canReplace(indexBefore + (atStart ? 0 : 1), indexBefore + 1, item.content.append(atEnd ? Fragment.empty : Fragment.from(list))))\n return false;\n let start = $start.pos, end = start + item.nodeSize;\n // Strip off the surrounding list. At the sides where we're not at\n // the end of the list, the existing list is closed. At sides where\n // this is the end, it is overwritten to its end.\n tr.step(new ReplaceAroundStep(start - (atStart ? 1 : 0), end + (atEnd ? 1 : 0), start + 1, end - 1, new Slice((atStart ? Fragment.empty : Fragment.from(list.copy(Fragment.empty)))\n .append(atEnd ? Fragment.empty : Fragment.from(list.copy(Fragment.empty))), atStart ? 0 : 1, atEnd ? 0 : 1), atStart ? 0 : 1));\n dispatch(tr.scrollIntoView());\n return true;\n}\n/**\nCreate a command to sink the list item around the selection down\ninto an inner list.\n*/\nfunction sinkListItem(itemType) {\n return function (state, dispatch) {\n let { $from, $to } = state.selection;\n let range = $from.blockRange($to, node => node.childCount > 0 && node.firstChild.type == itemType);\n if (!range)\n return false;\n let startIndex = range.startIndex;\n if (startIndex == 0)\n return false;\n let parent = range.parent, nodeBefore = parent.child(startIndex - 1);\n if (nodeBefore.type != itemType)\n return false;\n if (dispatch) {\n let nestedBefore = nodeBefore.lastChild && nodeBefore.lastChild.type == parent.type;\n let inner = Fragment.from(nestedBefore ? itemType.create() : null);\n let slice = new Slice(Fragment.from(itemType.create(null, Fragment.from(parent.type.create(null, inner)))), nestedBefore ? 3 : 1, 0);\n let before = range.start, after = range.end;\n dispatch(state.tr.step(new ReplaceAroundStep(before - (nestedBefore ? 3 : 1), after, before, after, slice, 1, true))\n .scrollIntoView());\n }\n return true;\n };\n}\n\nexport { addListNodes, bulletList, liftListItem, listItem, orderedList, sinkListItem, splitListItem, wrapInList };\n","\n /*!\n * tiptap-commands v1.17.0\n * (c) 2021 überdosis GbR (limited liability)\n * @license MIT\n */\n \nimport { setBlockType, lift, wrapIn } from 'prosemirror-commands';\nexport { autoJoin, baseKeymap, chainCommands, createParagraphNear, deleteSelection, exitCode, joinBackward, joinDown, joinForward, joinUp, lift, liftEmptyBlock, macBaseKeymap, newlineInCode, pcBaseKeymap, selectAll, selectNodeBackward, selectNodeForward, selectParentNode, setBlockType, splitBlock, splitBlockKeepMarks, toggleMark, wrapIn } from 'prosemirror-commands';\nimport { liftListItem, wrapInList } from 'prosemirror-schema-list';\nexport { addListNodes, liftListItem, sinkListItem, splitListItem, wrapInList } from 'prosemirror-schema-list';\nimport { InputRule } from 'prosemirror-inputrules';\nexport { textblockTypeInputRule, wrappingInputRule } from 'prosemirror-inputrules';\nimport { Plugin } from 'prosemirror-state';\nimport { Slice, Fragment } from 'prosemirror-model';\nimport { getMarkRange, nodeIsActive, findParentNode } from 'tiptap-utils';\n\nfunction insertText (text = '') {\n return (state, dispatch) => {\n const {\n $from\n } = state.selection;\n const {\n pos\n } = $from.pos;\n dispatch(state.tr.insertText(text, pos));\n return true;\n };\n}\n\nfunction getMarksBetween(start, end, state) {\n let marks = [];\n state.doc.nodesBetween(start, end, (node, pos) => {\n marks = [...marks, ...node.marks.map(mark => ({\n start: pos,\n end: pos + node.nodeSize,\n mark\n }))];\n });\n return marks;\n}\n\nfunction markInputRule (regexp, markType, getAttrs) {\n return new InputRule(regexp, (state, match, start, end) => {\n const attrs = getAttrs instanceof Function ? getAttrs(match) : getAttrs;\n const {\n tr\n } = state;\n const m = match.length - 1;\n let markEnd = end;\n let markStart = start;\n\n if (match[m]) {\n const matchStart = start + match[0].indexOf(match[m - 1]);\n const matchEnd = matchStart + match[m - 1].length - 1;\n const textStart = matchStart + match[m - 1].lastIndexOf(match[m]);\n const textEnd = textStart + match[m].length;\n const excludedMarks = getMarksBetween(start, end, state).filter(item => {\n const {\n excluded\n } = item.mark.type;\n return excluded.find(type => type.name === markType.name);\n }).filter(item => item.end > matchStart);\n\n if (excludedMarks.length) {\n return false;\n }\n\n if (textEnd < matchEnd) {\n tr.delete(textEnd, matchEnd);\n }\n\n if (textStart > matchStart) {\n tr.delete(matchStart, textStart);\n }\n\n markStart = matchStart;\n markEnd = markStart + match[m].length;\n }\n\n tr.addMark(markStart, markEnd, markType.create(attrs));\n tr.removeStoredMark(markType);\n return tr;\n });\n}\n\nfunction nodeInputRule (regexp, type, getAttrs) {\n return new InputRule(regexp, (state, match, start, end) => {\n const attrs = getAttrs instanceof Function ? getAttrs(match) : getAttrs;\n const {\n tr\n } = state;\n\n if (match[0]) {\n tr.replaceWith(start - 1, end, type.create(attrs));\n }\n\n return tr;\n });\n}\n\nfunction pasteRule (regexp, type, getAttrs) {\n const handler = fragment => {\n const nodes = [];\n fragment.forEach(child => {\n if (child.isText) {\n const {\n text\n } = child;\n let pos = 0;\n let match;\n\n do {\n match = regexp.exec(text);\n\n if (match) {\n const start = match.index;\n const end = start + match[0].length;\n const attrs = getAttrs instanceof Function ? getAttrs(match[0]) : getAttrs;\n\n if (start > 0) {\n nodes.push(child.cut(pos, start));\n }\n\n nodes.push(child.cut(start, end).mark(type.create(attrs).addToSet(child.marks)));\n pos = end;\n }\n } while (match);\n\n if (pos < text.length) {\n nodes.push(child.cut(pos));\n }\n } else {\n nodes.push(child.copy(handler(child.content)));\n }\n });\n return Fragment.fromArray(nodes);\n };\n\n return new Plugin({\n props: {\n transformPasted: slice => new Slice(handler(slice.content), slice.openStart, slice.openEnd)\n }\n });\n}\n\nfunction markPasteRule (regexp, type, getAttrs) {\n const handler = (fragment, parent) => {\n const nodes = [];\n fragment.forEach(child => {\n if (child.isText) {\n const {\n text,\n marks\n } = child;\n let pos = 0;\n let match;\n const isLink = !!marks.filter(x => x.type.name === 'link')[0]; // eslint-disable-next-line\n\n while (!isLink && (match = regexp.exec(text)) !== null) {\n if (parent && parent.type.allowsMarkType(type) && match[1]) {\n const start = match.index;\n const end = start + match[0].length;\n const textStart = start + match[0].indexOf(match[1]);\n const textEnd = textStart + match[1].length;\n const attrs = getAttrs instanceof Function ? getAttrs(match) : getAttrs; // adding text before markdown to nodes\n\n if (start > 0) {\n nodes.push(child.cut(pos, start));\n } // adding the markdown part to nodes\n\n\n nodes.push(child.cut(textStart, textEnd).mark(type.create(attrs).addToSet(child.marks)));\n pos = end;\n }\n } // adding rest of text to nodes\n\n\n if (pos < text.length) {\n nodes.push(child.cut(pos));\n }\n } else {\n nodes.push(child.copy(handler(child.content, child)));\n }\n });\n return Fragment.fromArray(nodes);\n };\n\n return new Plugin({\n props: {\n transformPasted: slice => new Slice(handler(slice.content), slice.openStart, slice.openEnd)\n }\n });\n}\n\nfunction removeMark (type) {\n return (state, dispatch) => {\n const {\n tr,\n selection\n } = state;\n let {\n from,\n to\n } = selection;\n const {\n $from,\n empty\n } = selection;\n\n if (empty) {\n const range = getMarkRange($from, type);\n from = range.from;\n to = range.to;\n }\n\n tr.removeMark(from, to, type);\n return dispatch(tr);\n };\n}\n\nfunction replaceText (range = null, type, attrs = {}, fragment = Fragment.empty) {\n return (state, dispatch) => {\n const {\n $from,\n $to\n } = state.selection;\n const index = $from.index();\n const from = range ? range.from : $from.pos;\n const to = range ? range.to : $to.pos;\n\n if (!$from.parent.canReplaceWith(index, index, type)) {\n return false;\n }\n\n if (dispatch) {\n dispatch(state.tr.replaceWith(from, to, type.create(attrs, fragment)));\n }\n\n return true;\n };\n}\n\nfunction setInlineBlockType (type, attrs = {}) {\n return (state, dispatch) => {\n const {\n $from\n } = state.selection;\n const index = $from.index();\n\n if (!$from.parent.canReplaceWith(index, index, type)) {\n return false;\n }\n\n if (dispatch) {\n dispatch(state.tr.replaceSelectionWith(type.create(attrs)));\n }\n\n return true;\n };\n}\n\n// see https://github.com/ProseMirror/prosemirror-transform/blob/main/src/structure.js\n// Since this piece of code was \"borrowed\" from prosemirror, ESLint rules are ignored.\n\n/* eslint-disable max-len, no-plusplus, no-undef, eqeqeq */\n\nfunction canSplit(doc, pos, depth = 1, typesAfter) {\n const $pos = doc.resolve(pos);\n const base = $pos.depth - depth;\n const innerType = typesAfter && typesAfter[typesAfter.length - 1] || $pos.parent;\n if (base < 0 || $pos.parent.type.spec.isolating || !$pos.parent.canReplace($pos.index(), $pos.parent.childCount) || !innerType.type.validContent($pos.parent.content.cutByIndex($pos.index(), $pos.parent.childCount))) return false;\n\n for (let d = $pos.depth - 1, i = depth - 2; d > base; d--, i--) {\n const node = $pos.node(d);\n const index = $pos.index(d);\n if (node.type.spec.isolating) return false;\n let rest = node.content.cutByIndex(index, node.childCount);\n const after = typesAfter && typesAfter[i] || node;\n if (after != node) rest = rest.replaceChild(0, after.type.create(after.attrs));\n /* Change starts from here */\n // if (!node.canReplace(index + 1, node.childCount) || !after.type.validContent(rest))\n // return false\n\n if (!node.canReplace(index + 1, node.childCount)) return false;\n /* Change ends here */\n }\n\n const index = $pos.indexAfter(base);\n const baseType = typesAfter && typesAfter[0];\n return $pos.node(base).canReplaceWith(index, index, baseType ? baseType.type : $pos.node(base + 1).type);\n} // this is a copy of splitListItem\n// see https://github.com/ProseMirror/prosemirror-schema-list/blob/main/src/schema-list.js\n\n\nfunction splitToDefaultListItem(itemType) {\n return function (state, dispatch) {\n const {\n $from,\n $to,\n node\n } = state.selection;\n if (node && node.isBlock || $from.depth < 2 || !$from.sameParent($to)) return false;\n const grandParent = $from.node(-1);\n if (grandParent.type != itemType) return false;\n\n if ($from.parent.content.size == 0) {\n // In an empty block. If this is a nested list, the wrapping\n // list item should be split. Otherwise, bail out and let next\n // command handle lifting.\n if ($from.depth == 2 || $from.node(-3).type != itemType || $from.index(-2) != $from.node(-2).childCount - 1) return false;\n\n if (dispatch) {\n let wrap = Fragment.empty;\n const keepItem = $from.index(-1) > 0; // Build a fragment containing empty versions of the structure\n // from the outer list item to the parent node of the cursor\n\n for (let d = $from.depth - (keepItem ? 1 : 2); d >= $from.depth - 3; d--) wrap = Fragment.from($from.node(d).copy(wrap)); // Add a second list item with an empty default start node\n\n\n wrap = wrap.append(Fragment.from(itemType.createAndFill()));\n const tr = state.tr.replace($from.before(keepItem ? null : -1), $from.after(-3), new Slice(wrap, keepItem ? 3 : 2, 2));\n tr.setSelection(state.selection.constructor.near(tr.doc.resolve($from.pos + (keepItem ? 3 : 2))));\n dispatch(tr.scrollIntoView());\n }\n\n return true;\n }\n\n const nextType = $to.pos == $from.end() ? grandParent.contentMatchAt($from.indexAfter(-1)).defaultType : null;\n const tr = state.tr.delete($from.pos, $to.pos);\n /* Change starts from here */\n // let types = nextType && [null, {type: nextType}]\n\n let types = nextType && [{\n type: itemType\n }, {\n type: nextType\n }];\n if (!types) types = [{\n type: itemType\n }, null];\n /* Change ends here */\n\n if (!canSplit(tr.doc, $from.pos, 2, types)) return false;\n if (dispatch) dispatch(tr.split($from.pos, 2, types).scrollIntoView());\n return true;\n };\n}\n/* eslint-enable max-len, no-plusplus, no-undef, eqeqeq */\n\nfunction toggleBlockType (type, toggletype, attrs = {}) {\n return (state, dispatch, view) => {\n const isActive = nodeIsActive(state, type, attrs);\n\n if (isActive) {\n return setBlockType(toggletype)(state, dispatch, view);\n }\n\n return setBlockType(type, attrs)(state, dispatch, view);\n };\n}\n\nfunction isList(node, schema) {\n return node.type === schema.nodes.bullet_list || node.type === schema.nodes.ordered_list || node.type === schema.nodes.todo_list;\n}\n\nfunction toggleList(listType, itemType) {\n return (state, dispatch, view) => {\n const {\n schema,\n selection\n } = state;\n const {\n $from,\n $to\n } = selection;\n const range = $from.blockRange($to);\n\n if (!range) {\n return false;\n }\n\n const parentList = findParentNode(node => isList(node, schema))(selection);\n\n if (range.depth >= 1 && parentList && range.depth - parentList.depth <= 1) {\n if (parentList.node.type === listType) {\n return liftListItem(itemType)(state, dispatch, view);\n }\n\n if (isList(parentList.node, schema) && listType.validContent(parentList.node.content)) {\n const {\n tr\n } = state;\n tr.setNodeMarkup(parentList.pos, listType);\n\n if (dispatch) {\n dispatch(tr);\n }\n\n return false;\n }\n }\n\n return wrapInList(listType)(state, dispatch, view);\n };\n}\n\nfunction toggleWrap (type, attrs = {}) {\n return (state, dispatch, view) => {\n const isActive = nodeIsActive(state, type, attrs);\n\n if (isActive) {\n return lift(state, dispatch);\n }\n\n return wrapIn(type, attrs)(state, dispatch, view);\n };\n}\n\nfunction updateMark (type, attrs) {\n return (state, dispatch) => {\n const {\n tr,\n selection,\n doc\n } = state;\n const {\n ranges,\n empty\n } = selection;\n\n if (empty) {\n const {\n from,\n to\n } = getMarkRange(selection.$from, type);\n\n if (doc.rangeHasMark(from, to, type)) {\n tr.removeMark(from, to, type);\n }\n\n tr.addMark(from, to, type.create(attrs));\n } else {\n ranges.forEach(ref$1 => {\n const {\n $to,\n $from\n } = ref$1;\n\n if (doc.rangeHasMark($from.pos, $to.pos, type)) {\n tr.removeMark($from.pos, $to.pos, type);\n }\n\n tr.addMark($from.pos, $to.pos, type.create(attrs));\n });\n }\n\n return dispatch(tr);\n };\n}\n\nexport { insertText, markInputRule, markPasteRule, nodeInputRule, pasteRule, removeMark, replaceText, setInlineBlockType, splitToDefaultListItem, toggleBlockType, toggleList, toggleWrap, updateMark };\n","/**\n * Helpers\n */\nconst escapeTest = /[&<>\"']/;\nconst escapeReplace = /[&<>\"']/g;\nconst escapeTestNoEncode = /[<>\"']|&(?!#?\\w+;)/;\nconst escapeReplaceNoEncode = /[<>\"']|&(?!#?\\w+;)/g;\nconst escapeReplacements = {\n '&': '&',\n '<': '<',\n '>': '>',\n '\"': '"',\n \"'\": '''\n};\nconst getEscapeReplacement = (ch) => escapeReplacements[ch];\nfunction escape(html, encode) {\n if (encode) {\n if (escapeTest.test(html)) {\n return html.replace(escapeReplace, getEscapeReplacement);\n }\n } else {\n if (escapeTestNoEncode.test(html)) {\n return html.replace(escapeReplaceNoEncode, getEscapeReplacement);\n }\n }\n\n return html;\n}\n\nconst unescapeTest = /&(#(?:\\d+)|(?:#x[0-9A-Fa-f]+)|(?:\\w+));?/ig;\n\nfunction unescape(html) {\n // explicitly match decimal, hex, and named HTML entities\n return html.replace(unescapeTest, (_, n) => {\n n = n.toLowerCase();\n if (n === 'colon') return ':';\n if (n.charAt(0) === '#') {\n return n.charAt(1) === 'x'\n ? String.fromCharCode(parseInt(n.substring(2), 16))\n : String.fromCharCode(+n.substring(1));\n }\n return '';\n });\n}\n\nconst caret = /(^|[^\\[])\\^/g;\nfunction edit(regex, opt) {\n regex = regex.source || regex;\n opt = opt || '';\n const obj = {\n replace: (name, val) => {\n val = val.source || val;\n val = val.replace(caret, '$1');\n regex = regex.replace(name, val);\n return obj;\n },\n getRegex: () => {\n return new RegExp(regex, opt);\n }\n };\n return obj;\n}\n\nconst nonWordAndColonTest = /[^\\w:]/g;\nconst originIndependentUrl = /^$|^[a-z][a-z0-9+.-]*:|^[?#]/i;\nfunction cleanUrl(sanitize, base, href) {\n if (sanitize) {\n let prot;\n try {\n prot = decodeURIComponent(unescape(href))\n .replace(nonWordAndColonTest, '')\n .toLowerCase();\n } catch (e) {\n return null;\n }\n if (prot.indexOf('javascript:') === 0 || prot.indexOf('vbscript:') === 0 || prot.indexOf('data:') === 0) {\n return null;\n }\n }\n if (base && !originIndependentUrl.test(href)) {\n href = resolveUrl(base, href);\n }\n try {\n href = encodeURI(href).replace(/%25/g, '%');\n } catch (e) {\n return null;\n }\n return href;\n}\n\nconst baseUrls = {};\nconst justDomain = /^[^:]+:\\/*[^/]*$/;\nconst protocol = /^([^:]+:)[\\s\\S]*$/;\nconst domain = /^([^:]+:\\/*[^/]*)[\\s\\S]*$/;\n\nfunction resolveUrl(base, href) {\n if (!baseUrls[' ' + base]) {\n // we can ignore everything in base after the last slash of its path component,\n // but we might need to add _that_\n // https://tools.ietf.org/html/rfc3986#section-3\n if (justDomain.test(base)) {\n baseUrls[' ' + base] = base + '/';\n } else {\n baseUrls[' ' + base] = rtrim(base, '/', true);\n }\n }\n base = baseUrls[' ' + base];\n const relativeBase = base.indexOf(':') === -1;\n\n if (href.substring(0, 2) === '//') {\n if (relativeBase) {\n return href;\n }\n return base.replace(protocol, '$1') + href;\n } else if (href.charAt(0) === '/') {\n if (relativeBase) {\n return href;\n }\n return base.replace(domain, '$1') + href;\n } else {\n return base + href;\n }\n}\n\nconst noopTest = { exec: function noopTest() {} };\n\nfunction merge(obj) {\n let i = 1,\n target,\n key;\n\n for (; i < arguments.length; i++) {\n target = arguments[i];\n for (key in target) {\n if (Object.prototype.hasOwnProperty.call(target, key)) {\n obj[key] = target[key];\n }\n }\n }\n\n return obj;\n}\n\nfunction splitCells(tableRow, count) {\n // ensure that every cell-delimiting pipe has a space\n // before it to distinguish it from an escaped pipe\n const row = tableRow.replace(/\\|/g, (match, offset, str) => {\n let escaped = false,\n curr = offset;\n while (--curr >= 0 && str[curr] === '\\\\') escaped = !escaped;\n if (escaped) {\n // odd number of slashes means | is escaped\n // so we leave it alone\n return '|';\n } else {\n // add space before unescaped |\n return ' |';\n }\n }),\n cells = row.split(/ \\|/);\n let i = 0;\n\n if (cells.length > count) {\n cells.splice(count);\n } else {\n while (cells.length < count) cells.push('');\n }\n\n for (; i < cells.length; i++) {\n // leading or trailing whitespace is ignored per the gfm spec\n cells[i] = cells[i].trim().replace(/\\\\\\|/g, '|');\n }\n return cells;\n}\n\n// Remove trailing 'c's. Equivalent to str.replace(/c*$/, '').\n// /c*$/ is vulnerable to REDOS.\n// invert: Remove suffix of non-c chars instead. Default falsey.\nfunction rtrim(str, c, invert) {\n const l = str.length;\n if (l === 0) {\n return '';\n }\n\n // Length of suffix matching the invert condition.\n let suffLen = 0;\n\n // Step left until we fail to match the invert condition.\n while (suffLen < l) {\n const currChar = str.charAt(l - suffLen - 1);\n if (currChar === c && !invert) {\n suffLen++;\n } else if (currChar !== c && invert) {\n suffLen++;\n } else {\n break;\n }\n }\n\n return str.substr(0, l - suffLen);\n}\n\nfunction findClosingBracket(str, b) {\n if (str.indexOf(b[1]) === -1) {\n return -1;\n }\n const l = str.length;\n let level = 0,\n i = 0;\n for (; i < l; i++) {\n if (str[i] === '\\\\') {\n i++;\n } else if (str[i] === b[0]) {\n level++;\n } else if (str[i] === b[1]) {\n level--;\n if (level < 0) {\n return i;\n }\n }\n }\n return -1;\n}\n\nfunction checkSanitizeDeprecation(opt) {\n if (opt && opt.sanitize && !opt.silent) {\n console.warn('marked(): sanitize and sanitizer parameters are deprecated since version 0.7.0, should not be used and will be removed in the future. Read more here: https://marked.js.org/#/USING_ADVANCED.md#options');\n }\n}\n\nmodule.exports = {\n escape,\n unescape,\n edit,\n cleanUrl,\n resolveUrl,\n noopTest,\n merge,\n splitCells,\n rtrim,\n findClosingBracket,\n checkSanitizeDeprecation\n};\n","import { ReplaceError, Slice, Fragment, MarkType } from 'prosemirror-model';\n\n// Recovery values encode a range index and an offset. They are\n// represented as numbers, because tons of them will be created when\n// mapping, for example, a large number of decorations. The number's\n// lower 16 bits provide the index, the remaining bits the offset.\n//\n// Note: We intentionally don't use bit shift operators to en- and\n// decode these, since those clip to 32 bits, which we might in rare\n// cases want to overflow. A 64-bit float can represent 48-bit\n// integers precisely.\nconst lower16 = 0xffff;\nconst factor16 = Math.pow(2, 16);\nfunction makeRecover(index, offset) { return index + offset * factor16; }\nfunction recoverIndex(value) { return value & lower16; }\nfunction recoverOffset(value) { return (value - (value & lower16)) / factor16; }\nconst DEL_BEFORE = 1, DEL_AFTER = 2, DEL_ACROSS = 4, DEL_SIDE = 8;\n/**\nAn object representing a mapped position with extra\ninformation.\n*/\nclass MapResult {\n /**\n @internal\n */\n constructor(\n /**\n The mapped version of the position.\n */\n pos, \n /**\n @internal\n */\n delInfo, \n /**\n @internal\n */\n recover) {\n this.pos = pos;\n this.delInfo = delInfo;\n this.recover = recover;\n }\n /**\n Tells you whether the position was deleted, that is, whether the\n step removed the token on the side queried (via the `assoc`)\n argument from the document.\n */\n get deleted() { return (this.delInfo & DEL_SIDE) > 0; }\n /**\n Tells you whether the token before the mapped position was deleted.\n */\n get deletedBefore() { return (this.delInfo & (DEL_BEFORE | DEL_ACROSS)) > 0; }\n /**\n True when the token after the mapped position was deleted.\n */\n get deletedAfter() { return (this.delInfo & (DEL_AFTER | DEL_ACROSS)) > 0; }\n /**\n Tells whether any of the steps mapped through deletes across the\n position (including both the token before and after the\n position).\n */\n get deletedAcross() { return (this.delInfo & DEL_ACROSS) > 0; }\n}\n/**\nA map describing the deletions and insertions made by a step, which\ncan be used to find the correspondence between positions in the\npre-step version of a document and the same position in the\npost-step version.\n*/\nclass StepMap {\n /**\n Create a position map. The modifications to the document are\n represented as an array of numbers, in which each group of three\n represents a modified chunk as `[start, oldSize, newSize]`.\n */\n constructor(\n /**\n @internal\n */\n ranges, \n /**\n @internal\n */\n inverted = false) {\n this.ranges = ranges;\n this.inverted = inverted;\n if (!ranges.length && StepMap.empty)\n return StepMap.empty;\n }\n /**\n @internal\n */\n recover(value) {\n let diff = 0, index = recoverIndex(value);\n if (!this.inverted)\n for (let i = 0; i < index; i++)\n diff += this.ranges[i * 3 + 2] - this.ranges[i * 3 + 1];\n return this.ranges[index * 3] + diff + recoverOffset(value);\n }\n mapResult(pos, assoc = 1) { return this._map(pos, assoc, false); }\n map(pos, assoc = 1) { return this._map(pos, assoc, true); }\n /**\n @internal\n */\n _map(pos, assoc, simple) {\n let diff = 0, oldIndex = this.inverted ? 2 : 1, newIndex = this.inverted ? 1 : 2;\n for (let i = 0; i < this.ranges.length; i += 3) {\n let start = this.ranges[i] - (this.inverted ? diff : 0);\n if (start > pos)\n break;\n let oldSize = this.ranges[i + oldIndex], newSize = this.ranges[i + newIndex], end = start + oldSize;\n if (pos <= end) {\n let side = !oldSize ? assoc : pos == start ? -1 : pos == end ? 1 : assoc;\n let result = start + diff + (side < 0 ? 0 : newSize);\n if (simple)\n return result;\n let recover = pos == (assoc < 0 ? start : end) ? null : makeRecover(i / 3, pos - start);\n let del = pos == start ? DEL_AFTER : pos == end ? DEL_BEFORE : DEL_ACROSS;\n if (assoc < 0 ? pos != start : pos != end)\n del |= DEL_SIDE;\n return new MapResult(result, del, recover);\n }\n diff += newSize - oldSize;\n }\n return simple ? pos + diff : new MapResult(pos + diff, 0, null);\n }\n /**\n @internal\n */\n touches(pos, recover) {\n let diff = 0, index = recoverIndex(recover);\n let oldIndex = this.inverted ? 2 : 1, newIndex = this.inverted ? 1 : 2;\n for (let i = 0; i < this.ranges.length; i += 3) {\n let start = this.ranges[i] - (this.inverted ? diff : 0);\n if (start > pos)\n break;\n let oldSize = this.ranges[i + oldIndex], end = start + oldSize;\n if (pos <= end && i == index * 3)\n return true;\n diff += this.ranges[i + newIndex] - oldSize;\n }\n return false;\n }\n /**\n Calls the given function on each of the changed ranges included in\n this map.\n */\n forEach(f) {\n let oldIndex = this.inverted ? 2 : 1, newIndex = this.inverted ? 1 : 2;\n for (let i = 0, diff = 0; i < this.ranges.length; i += 3) {\n let start = this.ranges[i], oldStart = start - (this.inverted ? diff : 0), newStart = start + (this.inverted ? 0 : diff);\n let oldSize = this.ranges[i + oldIndex], newSize = this.ranges[i + newIndex];\n f(oldStart, oldStart + oldSize, newStart, newStart + newSize);\n diff += newSize - oldSize;\n }\n }\n /**\n Create an inverted version of this map. The result can be used to\n map positions in the post-step document to the pre-step document.\n */\n invert() {\n return new StepMap(this.ranges, !this.inverted);\n }\n /**\n @internal\n */\n toString() {\n return (this.inverted ? \"-\" : \"\") + JSON.stringify(this.ranges);\n }\n /**\n Create a map that moves all positions by offset `n` (which may be\n negative). This can be useful when applying steps meant for a\n sub-document to a larger document, or vice-versa.\n */\n static offset(n) {\n return n == 0 ? StepMap.empty : new StepMap(n < 0 ? [0, -n, 0] : [0, 0, n]);\n }\n}\n/**\nA StepMap that contains no changed ranges.\n*/\nStepMap.empty = new StepMap([]);\n/**\nA mapping represents a pipeline of zero or more [step\nmaps](https://prosemirror.net/docs/ref/#transform.StepMap). It has special provisions for losslessly\nhandling mapping positions through a series of steps in which some\nsteps are inverted versions of earlier steps. (This comes up when\n‘[rebasing](/docs/guide/#transform.rebasing)’ steps for\ncollaboration or history management.)\n*/\nclass Mapping {\n /**\n Create a new mapping with the given position maps.\n */\n constructor(\n /**\n The step maps in this mapping.\n */\n maps = [], \n /**\n @internal\n */\n mirror, \n /**\n The starting position in the `maps` array, used when `map` or\n `mapResult` is called.\n */\n from = 0, \n /**\n The end position in the `maps` array.\n */\n to = maps.length) {\n this.maps = maps;\n this.mirror = mirror;\n this.from = from;\n this.to = to;\n }\n /**\n Create a mapping that maps only through a part of this one.\n */\n slice(from = 0, to = this.maps.length) {\n return new Mapping(this.maps, this.mirror, from, to);\n }\n /**\n @internal\n */\n copy() {\n return new Mapping(this.maps.slice(), this.mirror && this.mirror.slice(), this.from, this.to);\n }\n /**\n Add a step map to the end of this mapping. If `mirrors` is\n given, it should be the index of the step map that is the mirror\n image of this one.\n */\n appendMap(map, mirrors) {\n this.to = this.maps.push(map);\n if (mirrors != null)\n this.setMirror(this.maps.length - 1, mirrors);\n }\n /**\n Add all the step maps in a given mapping to this one (preserving\n mirroring information).\n */\n appendMapping(mapping) {\n for (let i = 0, startSize = this.maps.length; i < mapping.maps.length; i++) {\n let mirr = mapping.getMirror(i);\n this.appendMap(mapping.maps[i], mirr != null && mirr < i ? startSize + mirr : undefined);\n }\n }\n /**\n Finds the offset of the step map that mirrors the map at the\n given offset, in this mapping (as per the second argument to\n `appendMap`).\n */\n getMirror(n) {\n if (this.mirror)\n for (let i = 0; i < this.mirror.length; i++)\n if (this.mirror[i] == n)\n return this.mirror[i + (i % 2 ? -1 : 1)];\n }\n /**\n @internal\n */\n setMirror(n, m) {\n if (!this.mirror)\n this.mirror = [];\n this.mirror.push(n, m);\n }\n /**\n Append the inverse of the given mapping to this one.\n */\n appendMappingInverted(mapping) {\n for (let i = mapping.maps.length - 1, totalSize = this.maps.length + mapping.maps.length; i >= 0; i--) {\n let mirr = mapping.getMirror(i);\n this.appendMap(mapping.maps[i].invert(), mirr != null && mirr > i ? totalSize - mirr - 1 : undefined);\n }\n }\n /**\n Create an inverted version of this mapping.\n */\n invert() {\n let inverse = new Mapping;\n inverse.appendMappingInverted(this);\n return inverse;\n }\n /**\n Map a position through this mapping.\n */\n map(pos, assoc = 1) {\n if (this.mirror)\n return this._map(pos, assoc, true);\n for (let i = this.from; i < this.to; i++)\n pos = this.maps[i].map(pos, assoc);\n return pos;\n }\n /**\n Map a position through this mapping, returning a mapping\n result.\n */\n mapResult(pos, assoc = 1) { return this._map(pos, assoc, false); }\n /**\n @internal\n */\n _map(pos, assoc, simple) {\n let delInfo = 0;\n for (let i = this.from; i < this.to; i++) {\n let map = this.maps[i], result = map.mapResult(pos, assoc);\n if (result.recover != null) {\n let corr = this.getMirror(i);\n if (corr != null && corr > i && corr < this.to) {\n i = corr;\n pos = this.maps[corr].recover(result.recover);\n continue;\n }\n }\n delInfo |= result.delInfo;\n pos = result.pos;\n }\n return simple ? pos : new MapResult(pos, delInfo, null);\n }\n}\n\nconst stepsByID = Object.create(null);\n/**\nA step object represents an atomic change. It generally applies\nonly to the document it was created for, since the positions\nstored in it will only make sense for that document.\n\nNew steps are defined by creating classes that extend `Step`,\noverriding the `apply`, `invert`, `map`, `getMap` and `fromJSON`\nmethods, and registering your class with a unique\nJSON-serialization identifier using\n[`Step.jsonID`](https://prosemirror.net/docs/ref/#transform.Step^jsonID).\n*/\nclass Step {\n /**\n Get the step map that represents the changes made by this step,\n and which can be used to transform between positions in the old\n and the new document.\n */\n getMap() { return StepMap.empty; }\n /**\n Try to merge this step with another one, to be applied directly\n after it. Returns the merged step when possible, null if the\n steps can't be merged.\n */\n merge(other) { return null; }\n /**\n Deserialize a step from its JSON representation. Will call\n through to the step class' own implementation of this method.\n */\n static fromJSON(schema, json) {\n if (!json || !json.stepType)\n throw new RangeError(\"Invalid input for Step.fromJSON\");\n let type = stepsByID[json.stepType];\n if (!type)\n throw new RangeError(`No step type ${json.stepType} defined`);\n return type.fromJSON(schema, json);\n }\n /**\n To be able to serialize steps to JSON, each step needs a string\n ID to attach to its JSON representation. Use this method to\n register an ID for your step classes. Try to pick something\n that's unlikely to clash with steps from other modules.\n */\n static jsonID(id, stepClass) {\n if (id in stepsByID)\n throw new RangeError(\"Duplicate use of step JSON ID \" + id);\n stepsByID[id] = stepClass;\n stepClass.prototype.jsonID = id;\n return stepClass;\n }\n}\n/**\nThe result of [applying](https://prosemirror.net/docs/ref/#transform.Step.apply) a step. Contains either a\nnew document or a failure value.\n*/\nclass StepResult {\n /**\n @internal\n */\n constructor(\n /**\n The transformed document, if successful.\n */\n doc, \n /**\n The failure message, if unsuccessful.\n */\n failed) {\n this.doc = doc;\n this.failed = failed;\n }\n /**\n Create a successful step result.\n */\n static ok(doc) { return new StepResult(doc, null); }\n /**\n Create a failed step result.\n */\n static fail(message) { return new StepResult(null, message); }\n /**\n Call [`Node.replace`](https://prosemirror.net/docs/ref/#model.Node.replace) with the given\n arguments. Create a successful result if it succeeds, and a\n failed one if it throws a `ReplaceError`.\n */\n static fromReplace(doc, from, to, slice) {\n try {\n return StepResult.ok(doc.replace(from, to, slice));\n }\n catch (e) {\n if (e instanceof ReplaceError)\n return StepResult.fail(e.message);\n throw e;\n }\n }\n}\n\nfunction mapFragment(fragment, f, parent) {\n let mapped = [];\n for (let i = 0; i < fragment.childCount; i++) {\n let child = fragment.child(i);\n if (child.content.size)\n child = child.copy(mapFragment(child.content, f, child));\n if (child.isInline)\n child = f(child, parent, i);\n mapped.push(child);\n }\n return Fragment.fromArray(mapped);\n}\n/**\nAdd a mark to all inline content between two positions.\n*/\nclass AddMarkStep extends Step {\n /**\n Create a mark step.\n */\n constructor(\n /**\n The start of the marked range.\n */\n from, \n /**\n The end of the marked range.\n */\n to, \n /**\n The mark to add.\n */\n mark) {\n super();\n this.from = from;\n this.to = to;\n this.mark = mark;\n }\n apply(doc) {\n let oldSlice = doc.slice(this.from, this.to), $from = doc.resolve(this.from);\n let parent = $from.node($from.sharedDepth(this.to));\n let slice = new Slice(mapFragment(oldSlice.content, (node, parent) => {\n if (!node.isAtom || !parent.type.allowsMarkType(this.mark.type))\n return node;\n return node.mark(this.mark.addToSet(node.marks));\n }, parent), oldSlice.openStart, oldSlice.openEnd);\n return StepResult.fromReplace(doc, this.from, this.to, slice);\n }\n invert() {\n return new RemoveMarkStep(this.from, this.to, this.mark);\n }\n map(mapping) {\n let from = mapping.mapResult(this.from, 1), to = mapping.mapResult(this.to, -1);\n if (from.deleted && to.deleted || from.pos >= to.pos)\n return null;\n return new AddMarkStep(from.pos, to.pos, this.mark);\n }\n merge(other) {\n if (other instanceof AddMarkStep &&\n other.mark.eq(this.mark) &&\n this.from <= other.to && this.to >= other.from)\n return new AddMarkStep(Math.min(this.from, other.from), Math.max(this.to, other.to), this.mark);\n return null;\n }\n toJSON() {\n return { stepType: \"addMark\", mark: this.mark.toJSON(),\n from: this.from, to: this.to };\n }\n /**\n @internal\n */\n static fromJSON(schema, json) {\n if (typeof json.from != \"number\" || typeof json.to != \"number\")\n throw new RangeError(\"Invalid input for AddMarkStep.fromJSON\");\n return new AddMarkStep(json.from, json.to, schema.markFromJSON(json.mark));\n }\n}\nStep.jsonID(\"addMark\", AddMarkStep);\n/**\nRemove a mark from all inline content between two positions.\n*/\nclass RemoveMarkStep extends Step {\n /**\n Create a mark-removing step.\n */\n constructor(\n /**\n The start of the unmarked range.\n */\n from, \n /**\n The end of the unmarked range.\n */\n to, \n /**\n The mark to remove.\n */\n mark) {\n super();\n this.from = from;\n this.to = to;\n this.mark = mark;\n }\n apply(doc) {\n let oldSlice = doc.slice(this.from, this.to);\n let slice = new Slice(mapFragment(oldSlice.content, node => {\n return node.mark(this.mark.removeFromSet(node.marks));\n }, doc), oldSlice.openStart, oldSlice.openEnd);\n return StepResult.fromReplace(doc, this.from, this.to, slice);\n }\n invert() {\n return new AddMarkStep(this.from, this.to, this.mark);\n }\n map(mapping) {\n let from = mapping.mapResult(this.from, 1), to = mapping.mapResult(this.to, -1);\n if (from.deleted && to.deleted || from.pos >= to.pos)\n return null;\n return new RemoveMarkStep(from.pos, to.pos, this.mark);\n }\n merge(other) {\n if (other instanceof RemoveMarkStep &&\n other.mark.eq(this.mark) &&\n this.from <= other.to && this.to >= other.from)\n return new RemoveMarkStep(Math.min(this.from, other.from), Math.max(this.to, other.to), this.mark);\n return null;\n }\n toJSON() {\n return { stepType: \"removeMark\", mark: this.mark.toJSON(),\n from: this.from, to: this.to };\n }\n /**\n @internal\n */\n static fromJSON(schema, json) {\n if (typeof json.from != \"number\" || typeof json.to != \"number\")\n throw new RangeError(\"Invalid input for RemoveMarkStep.fromJSON\");\n return new RemoveMarkStep(json.from, json.to, schema.markFromJSON(json.mark));\n }\n}\nStep.jsonID(\"removeMark\", RemoveMarkStep);\n\n/**\nReplace a part of the document with a slice of new content.\n*/\nclass ReplaceStep extends Step {\n /**\n The given `slice` should fit the 'gap' between `from` and\n `to`—the depths must line up, and the surrounding nodes must be\n able to be joined with the open sides of the slice. When\n `structure` is true, the step will fail if the content between\n from and to is not just a sequence of closing and then opening\n tokens (this is to guard against rebased replace steps\n overwriting something they weren't supposed to).\n */\n constructor(\n /**\n The start position of the replaced range.\n */\n from, \n /**\n The end position of the replaced range.\n */\n to, \n /**\n The slice to insert.\n */\n slice, \n /**\n @internal\n */\n structure = false) {\n super();\n this.from = from;\n this.to = to;\n this.slice = slice;\n this.structure = structure;\n }\n apply(doc) {\n if (this.structure && contentBetween(doc, this.from, this.to))\n return StepResult.fail(\"Structure replace would overwrite content\");\n return StepResult.fromReplace(doc, this.from, this.to, this.slice);\n }\n getMap() {\n return new StepMap([this.from, this.to - this.from, this.slice.size]);\n }\n invert(doc) {\n return new ReplaceStep(this.from, this.from + this.slice.size, doc.slice(this.from, this.to));\n }\n map(mapping) {\n let from = mapping.mapResult(this.from, 1), to = mapping.mapResult(this.to, -1);\n if (from.deletedAcross && to.deletedAcross)\n return null;\n return new ReplaceStep(from.pos, Math.max(from.pos, to.pos), this.slice);\n }\n merge(other) {\n if (!(other instanceof ReplaceStep) || other.structure || this.structure)\n return null;\n if (this.from + this.slice.size == other.from && !this.slice.openEnd && !other.slice.openStart) {\n let slice = this.slice.size + other.slice.size == 0 ? Slice.empty\n : new Slice(this.slice.content.append(other.slice.content), this.slice.openStart, other.slice.openEnd);\n return new ReplaceStep(this.from, this.to + (other.to - other.from), slice, this.structure);\n }\n else if (other.to == this.from && !this.slice.openStart && !other.slice.openEnd) {\n let slice = this.slice.size + other.slice.size == 0 ? Slice.empty\n : new Slice(other.slice.content.append(this.slice.content), other.slice.openStart, this.slice.openEnd);\n return new ReplaceStep(other.from, this.to, slice, this.structure);\n }\n else {\n return null;\n }\n }\n toJSON() {\n let json = { stepType: \"replace\", from: this.from, to: this.to };\n if (this.slice.size)\n json.slice = this.slice.toJSON();\n if (this.structure)\n json.structure = true;\n return json;\n }\n /**\n @internal\n */\n static fromJSON(schema, json) {\n if (typeof json.from != \"number\" || typeof json.to != \"number\")\n throw new RangeError(\"Invalid input for ReplaceStep.fromJSON\");\n return new ReplaceStep(json.from, json.to, Slice.fromJSON(schema, json.slice), !!json.structure);\n }\n}\nStep.jsonID(\"replace\", ReplaceStep);\n/**\nReplace a part of the document with a slice of content, but\npreserve a range of the replaced content by moving it into the\nslice.\n*/\nclass ReplaceAroundStep extends Step {\n /**\n Create a replace-around step with the given range and gap.\n `insert` should be the point in the slice into which the content\n of the gap should be moved. `structure` has the same meaning as\n it has in the [`ReplaceStep`](https://prosemirror.net/docs/ref/#transform.ReplaceStep) class.\n */\n constructor(\n /**\n The start position of the replaced range.\n */\n from, \n /**\n The end position of the replaced range.\n */\n to, \n /**\n The start of preserved range.\n */\n gapFrom, \n /**\n The end of preserved range.\n */\n gapTo, \n /**\n The slice to insert.\n */\n slice, \n /**\n The position in the slice where the preserved range should be\n inserted.\n */\n insert, \n /**\n @internal\n */\n structure = false) {\n super();\n this.from = from;\n this.to = to;\n this.gapFrom = gapFrom;\n this.gapTo = gapTo;\n this.slice = slice;\n this.insert = insert;\n this.structure = structure;\n }\n apply(doc) {\n if (this.structure && (contentBetween(doc, this.from, this.gapFrom) ||\n contentBetween(doc, this.gapTo, this.to)))\n return StepResult.fail(\"Structure gap-replace would overwrite content\");\n let gap = doc.slice(this.gapFrom, this.gapTo);\n if (gap.openStart || gap.openEnd)\n return StepResult.fail(\"Gap is not a flat range\");\n let inserted = this.slice.insertAt(this.insert, gap.content);\n if (!inserted)\n return StepResult.fail(\"Content does not fit in gap\");\n return StepResult.fromReplace(doc, this.from, this.to, inserted);\n }\n getMap() {\n return new StepMap([this.from, this.gapFrom - this.from, this.insert,\n this.gapTo, this.to - this.gapTo, this.slice.size - this.insert]);\n }\n invert(doc) {\n let gap = this.gapTo - this.gapFrom;\n return new ReplaceAroundStep(this.from, this.from + this.slice.size + gap, this.from + this.insert, this.from + this.insert + gap, doc.slice(this.from, this.to).removeBetween(this.gapFrom - this.from, this.gapTo - this.from), this.gapFrom - this.from, this.structure);\n }\n map(mapping) {\n let from = mapping.mapResult(this.from, 1), to = mapping.mapResult(this.to, -1);\n let gapFrom = mapping.map(this.gapFrom, -1), gapTo = mapping.map(this.gapTo, 1);\n if ((from.deletedAcross && to.deletedAcross) || gapFrom < from.pos || gapTo > to.pos)\n return null;\n return new ReplaceAroundStep(from.pos, to.pos, gapFrom, gapTo, this.slice, this.insert, this.structure);\n }\n toJSON() {\n let json = { stepType: \"replaceAround\", from: this.from, to: this.to,\n gapFrom: this.gapFrom, gapTo: this.gapTo, insert: this.insert };\n if (this.slice.size)\n json.slice = this.slice.toJSON();\n if (this.structure)\n json.structure = true;\n return json;\n }\n /**\n @internal\n */\n static fromJSON(schema, json) {\n if (typeof json.from != \"number\" || typeof json.to != \"number\" ||\n typeof json.gapFrom != \"number\" || typeof json.gapTo != \"number\" || typeof json.insert != \"number\")\n throw new RangeError(\"Invalid input for ReplaceAroundStep.fromJSON\");\n return new ReplaceAroundStep(json.from, json.to, json.gapFrom, json.gapTo, Slice.fromJSON(schema, json.slice), json.insert, !!json.structure);\n }\n}\nStep.jsonID(\"replaceAround\", ReplaceAroundStep);\nfunction contentBetween(doc, from, to) {\n let $from = doc.resolve(from), dist = to - from, depth = $from.depth;\n while (dist > 0 && depth > 0 && $from.indexAfter(depth) == $from.node(depth).childCount) {\n depth--;\n dist--;\n }\n if (dist > 0) {\n let next = $from.node(depth).maybeChild($from.indexAfter(depth));\n while (dist > 0) {\n if (!next || next.isLeaf)\n return true;\n next = next.firstChild;\n dist--;\n }\n }\n return false;\n}\n\nfunction addMark(tr, from, to, mark) {\n let removed = [], added = [];\n let removing, adding;\n tr.doc.nodesBetween(from, to, (node, pos, parent) => {\n if (!node.isInline)\n return;\n let marks = node.marks;\n if (!mark.isInSet(marks) && parent.type.allowsMarkType(mark.type)) {\n let start = Math.max(pos, from), end = Math.min(pos + node.nodeSize, to);\n let newSet = mark.addToSet(marks);\n for (let i = 0; i < marks.length; i++) {\n if (!marks[i].isInSet(newSet)) {\n if (removing && removing.to == start && removing.mark.eq(marks[i]))\n removing.to = end;\n else\n removed.push(removing = new RemoveMarkStep(start, end, marks[i]));\n }\n }\n if (adding && adding.to == start)\n adding.to = end;\n else\n added.push(adding = new AddMarkStep(start, end, mark));\n }\n });\n removed.forEach(s => tr.step(s));\n added.forEach(s => tr.step(s));\n}\nfunction removeMark(tr, from, to, mark) {\n let matched = [], step = 0;\n tr.doc.nodesBetween(from, to, (node, pos) => {\n if (!node.isInline)\n return;\n step++;\n let toRemove = null;\n if (mark instanceof MarkType) {\n let set = node.marks, found;\n while (found = mark.isInSet(set)) {\n (toRemove || (toRemove = [])).push(found);\n set = found.removeFromSet(set);\n }\n }\n else if (mark) {\n if (mark.isInSet(node.marks))\n toRemove = [mark];\n }\n else {\n toRemove = node.marks;\n }\n if (toRemove && toRemove.length) {\n let end = Math.min(pos + node.nodeSize, to);\n for (let i = 0; i < toRemove.length; i++) {\n let style = toRemove[i], found;\n for (let j = 0; j < matched.length; j++) {\n let m = matched[j];\n if (m.step == step - 1 && style.eq(matched[j].style))\n found = m;\n }\n if (found) {\n found.to = end;\n found.step = step;\n }\n else {\n matched.push({ style, from: Math.max(pos, from), to: end, step });\n }\n }\n }\n });\n matched.forEach(m => tr.step(new RemoveMarkStep(m.from, m.to, m.style)));\n}\nfunction clearIncompatible(tr, pos, parentType, match = parentType.contentMatch) {\n let node = tr.doc.nodeAt(pos);\n let delSteps = [], cur = pos + 1;\n for (let i = 0; i < node.childCount; i++) {\n let child = node.child(i), end = cur + child.nodeSize;\n let allowed = match.matchType(child.type);\n if (!allowed) {\n delSteps.push(new ReplaceStep(cur, end, Slice.empty));\n }\n else {\n match = allowed;\n for (let j = 0; j < child.marks.length; j++)\n if (!parentType.allowsMarkType(child.marks[j].type))\n tr.step(new RemoveMarkStep(cur, end, child.marks[j]));\n }\n cur = end;\n }\n if (!match.validEnd) {\n let fill = match.fillBefore(Fragment.empty, true);\n tr.replace(cur, cur, new Slice(fill, 0, 0));\n }\n for (let i = delSteps.length - 1; i >= 0; i--)\n tr.step(delSteps[i]);\n}\n\nfunction canCut(node, start, end) {\n return (start == 0 || node.canReplace(start, node.childCount)) &&\n (end == node.childCount || node.canReplace(0, end));\n}\n/**\nTry to find a target depth to which the content in the given range\ncan be lifted. Will not go across\n[isolating](https://prosemirror.net/docs/ref/#model.NodeSpec.isolating) parent nodes.\n*/\nfunction liftTarget(range) {\n let parent = range.parent;\n let content = parent.content.cutByIndex(range.startIndex, range.endIndex);\n for (let depth = range.depth;; --depth) {\n let node = range.$from.node(depth);\n let index = range.$from.index(depth), endIndex = range.$to.indexAfter(depth);\n if (depth < range.depth && node.canReplace(index, endIndex, content))\n return depth;\n if (depth == 0 || node.type.spec.isolating || !canCut(node, index, endIndex))\n break;\n }\n return null;\n}\nfunction lift(tr, range, target) {\n let { $from, $to, depth } = range;\n let gapStart = $from.before(depth + 1), gapEnd = $to.after(depth + 1);\n let start = gapStart, end = gapEnd;\n let before = Fragment.empty, openStart = 0;\n for (let d = depth, splitting = false; d > target; d--)\n if (splitting || $from.index(d) > 0) {\n splitting = true;\n before = Fragment.from($from.node(d).copy(before));\n openStart++;\n }\n else {\n start--;\n }\n let after = Fragment.empty, openEnd = 0;\n for (let d = depth, splitting = false; d > target; d--)\n if (splitting || $to.after(d + 1) < $to.end(d)) {\n splitting = true;\n after = Fragment.from($to.node(d).copy(after));\n openEnd++;\n }\n else {\n end++;\n }\n tr.step(new ReplaceAroundStep(start, end, gapStart, gapEnd, new Slice(before.append(after), openStart, openEnd), before.size - openStart, true));\n}\n/**\nTry to find a valid way to wrap the content in the given range in a\nnode of the given type. May introduce extra nodes around and inside\nthe wrapper node, if necessary. Returns null if no valid wrapping\ncould be found. When `innerRange` is given, that range's content is\nused as the content to fit into the wrapping, instead of the\ncontent of `range`.\n*/\nfunction findWrapping(range, nodeType, attrs = null, innerRange = range) {\n let around = findWrappingOutside(range, nodeType);\n let inner = around && findWrappingInside(innerRange, nodeType);\n if (!inner)\n return null;\n return around.map(withAttrs)\n .concat({ type: nodeType, attrs }).concat(inner.map(withAttrs));\n}\nfunction withAttrs(type) { return { type, attrs: null }; }\nfunction findWrappingOutside(range, type) {\n let { parent, startIndex, endIndex } = range;\n let around = parent.contentMatchAt(startIndex).findWrapping(type);\n if (!around)\n return null;\n let outer = around.length ? around[0] : type;\n return parent.canReplaceWith(startIndex, endIndex, outer) ? around : null;\n}\nfunction findWrappingInside(range, type) {\n let { parent, startIndex, endIndex } = range;\n let inner = parent.child(startIndex);\n let inside = type.contentMatch.findWrapping(inner.type);\n if (!inside)\n return null;\n let lastType = inside.length ? inside[inside.length - 1] : type;\n let innerMatch = lastType.contentMatch;\n for (let i = startIndex; innerMatch && i < endIndex; i++)\n innerMatch = innerMatch.matchType(parent.child(i).type);\n if (!innerMatch || !innerMatch.validEnd)\n return null;\n return inside;\n}\nfunction wrap(tr, range, wrappers) {\n let content = Fragment.empty;\n for (let i = wrappers.length - 1; i >= 0; i--) {\n if (content.size) {\n let match = wrappers[i].type.contentMatch.matchFragment(content);\n if (!match || !match.validEnd)\n throw new RangeError(\"Wrapper type given to Transform.wrap does not form valid content of its parent wrapper\");\n }\n content = Fragment.from(wrappers[i].type.create(wrappers[i].attrs, content));\n }\n let start = range.start, end = range.end;\n tr.step(new ReplaceAroundStep(start, end, start, end, new Slice(content, 0, 0), wrappers.length, true));\n}\nfunction setBlockType(tr, from, to, type, attrs) {\n if (!type.isTextblock)\n throw new RangeError(\"Type given to setBlockType should be a textblock\");\n let mapFrom = tr.steps.length;\n tr.doc.nodesBetween(from, to, (node, pos) => {\n if (node.isTextblock && !node.hasMarkup(type, attrs) && canChangeType(tr.doc, tr.mapping.slice(mapFrom).map(pos), type)) {\n // Ensure all markup that isn't allowed in the new node type is cleared\n tr.clearIncompatible(tr.mapping.slice(mapFrom).map(pos, 1), type);\n let mapping = tr.mapping.slice(mapFrom);\n let startM = mapping.map(pos, 1), endM = mapping.map(pos + node.nodeSize, 1);\n tr.step(new ReplaceAroundStep(startM, endM, startM + 1, endM - 1, new Slice(Fragment.from(type.create(attrs, null, node.marks)), 0, 0), 1, true));\n return false;\n }\n });\n}\nfunction canChangeType(doc, pos, type) {\n let $pos = doc.resolve(pos), index = $pos.index();\n return $pos.parent.canReplaceWith(index, index + 1, type);\n}\n/**\nChange the type, attributes, and/or marks of the node at `pos`.\nWhen `type` isn't given, the existing node type is preserved,\n*/\nfunction setNodeMarkup(tr, pos, type, attrs, marks) {\n let node = tr.doc.nodeAt(pos);\n if (!node)\n throw new RangeError(\"No node at given position\");\n if (!type)\n type = node.type;\n let newNode = type.create(attrs, null, marks || node.marks);\n if (node.isLeaf)\n return tr.replaceWith(pos, pos + node.nodeSize, newNode);\n if (!type.validContent(node.content))\n throw new RangeError(\"Invalid content for node type \" + type.name);\n tr.step(new ReplaceAroundStep(pos, pos + node.nodeSize, pos + 1, pos + node.nodeSize - 1, new Slice(Fragment.from(newNode), 0, 0), 1, true));\n}\n/**\nCheck whether splitting at the given position is allowed.\n*/\nfunction canSplit(doc, pos, depth = 1, typesAfter) {\n let $pos = doc.resolve(pos), base = $pos.depth - depth;\n let innerType = (typesAfter && typesAfter[typesAfter.length - 1]) || $pos.parent;\n if (base < 0 || $pos.parent.type.spec.isolating ||\n !$pos.parent.canReplace($pos.index(), $pos.parent.childCount) ||\n !innerType.type.validContent($pos.parent.content.cutByIndex($pos.index(), $pos.parent.childCount)))\n return false;\n for (let d = $pos.depth - 1, i = depth - 2; d > base; d--, i--) {\n let node = $pos.node(d), index = $pos.index(d);\n if (node.type.spec.isolating)\n return false;\n let rest = node.content.cutByIndex(index, node.childCount);\n let after = (typesAfter && typesAfter[i]) || node;\n if (after != node)\n rest = rest.replaceChild(0, after.type.create(after.attrs));\n if (!node.canReplace(index + 1, node.childCount) || !after.type.validContent(rest))\n return false;\n }\n let index = $pos.indexAfter(base);\n let baseType = typesAfter && typesAfter[0];\n return $pos.node(base).canReplaceWith(index, index, baseType ? baseType.type : $pos.node(base + 1).type);\n}\nfunction split(tr, pos, depth = 1, typesAfter) {\n let $pos = tr.doc.resolve(pos), before = Fragment.empty, after = Fragment.empty;\n for (let d = $pos.depth, e = $pos.depth - depth, i = depth - 1; d > e; d--, i--) {\n before = Fragment.from($pos.node(d).copy(before));\n let typeAfter = typesAfter && typesAfter[i];\n after = Fragment.from(typeAfter ? typeAfter.type.create(typeAfter.attrs, after) : $pos.node(d).copy(after));\n }\n tr.step(new ReplaceStep(pos, pos, new Slice(before.append(after), depth, depth), true));\n}\n/**\nTest whether the blocks before and after a given position can be\njoined.\n*/\nfunction canJoin(doc, pos) {\n let $pos = doc.resolve(pos), index = $pos.index();\n return joinable($pos.nodeBefore, $pos.nodeAfter) &&\n $pos.parent.canReplace(index, index + 1);\n}\nfunction joinable(a, b) {\n return !!(a && b && !a.isLeaf && a.canAppend(b));\n}\n/**\nFind an ancestor of the given position that can be joined to the\nblock before (or after if `dir` is positive). Returns the joinable\npoint, if any.\n*/\nfunction joinPoint(doc, pos, dir = -1) {\n let $pos = doc.resolve(pos);\n for (let d = $pos.depth;; d--) {\n let before, after, index = $pos.index(d);\n if (d == $pos.depth) {\n before = $pos.nodeBefore;\n after = $pos.nodeAfter;\n }\n else if (dir > 0) {\n before = $pos.node(d + 1);\n index++;\n after = $pos.node(d).maybeChild(index);\n }\n else {\n before = $pos.node(d).maybeChild(index - 1);\n after = $pos.node(d + 1);\n }\n if (before && !before.isTextblock && joinable(before, after) &&\n $pos.node(d).canReplace(index, index + 1))\n return pos;\n if (d == 0)\n break;\n pos = dir < 0 ? $pos.before(d) : $pos.after(d);\n }\n}\nfunction join(tr, pos, depth) {\n let step = new ReplaceStep(pos - depth, pos + depth, Slice.empty, true);\n tr.step(step);\n}\n/**\nTry to find a point where a node of the given type can be inserted\nnear `pos`, by searching up the node hierarchy when `pos` itself\nisn't a valid place but is at the start or end of a node. Return\nnull if no position was found.\n*/\nfunction insertPoint(doc, pos, nodeType) {\n let $pos = doc.resolve(pos);\n if ($pos.parent.canReplaceWith($pos.index(), $pos.index(), nodeType))\n return pos;\n if ($pos.parentOffset == 0)\n for (let d = $pos.depth - 1; d >= 0; d--) {\n let index = $pos.index(d);\n if ($pos.node(d).canReplaceWith(index, index, nodeType))\n return $pos.before(d + 1);\n if (index > 0)\n return null;\n }\n if ($pos.parentOffset == $pos.parent.content.size)\n for (let d = $pos.depth - 1; d >= 0; d--) {\n let index = $pos.indexAfter(d);\n if ($pos.node(d).canReplaceWith(index, index, nodeType))\n return $pos.after(d + 1);\n if (index < $pos.node(d).childCount)\n return null;\n }\n return null;\n}\n/**\nFinds a position at or around the given position where the given\nslice can be inserted. Will look at parent nodes' nearest boundary\nand try there, even if the original position wasn't directly at the\nstart or end of that node. Returns null when no position was found.\n*/\nfunction dropPoint(doc, pos, slice) {\n let $pos = doc.resolve(pos);\n if (!slice.content.size)\n return pos;\n let content = slice.content;\n for (let i = 0; i < slice.openStart; i++)\n content = content.firstChild.content;\n for (let pass = 1; pass <= (slice.openStart == 0 && slice.size ? 2 : 1); pass++) {\n for (let d = $pos.depth; d >= 0; d--) {\n let bias = d == $pos.depth ? 0 : $pos.pos <= ($pos.start(d + 1) + $pos.end(d + 1)) / 2 ? -1 : 1;\n let insertPos = $pos.index(d) + (bias > 0 ? 1 : 0);\n let parent = $pos.node(d), fits = false;\n if (pass == 1) {\n fits = parent.canReplace(insertPos, insertPos, content);\n }\n else {\n let wrapping = parent.contentMatchAt(insertPos).findWrapping(content.firstChild.type);\n fits = wrapping && parent.canReplaceWith(insertPos, insertPos, wrapping[0]);\n }\n if (fits)\n return bias == 0 ? $pos.pos : bias < 0 ? $pos.before(d + 1) : $pos.after(d + 1);\n }\n }\n return null;\n}\n\n/**\n‘Fit’ a slice into a given position in the document, producing a\n[step](https://prosemirror.net/docs/ref/#transform.Step) that inserts it. Will return null if\nthere's no meaningful way to insert the slice here, or inserting it\nwould be a no-op (an empty slice over an empty range).\n*/\nfunction replaceStep(doc, from, to = from, slice = Slice.empty) {\n if (from == to && !slice.size)\n return null;\n let $from = doc.resolve(from), $to = doc.resolve(to);\n // Optimization -- avoid work if it's obvious that it's not needed.\n if (fitsTrivially($from, $to, slice))\n return new ReplaceStep(from, to, slice);\n return new Fitter($from, $to, slice).fit();\n}\nfunction fitsTrivially($from, $to, slice) {\n return !slice.openStart && !slice.openEnd && $from.start() == $to.start() &&\n $from.parent.canReplace($from.index(), $to.index(), slice.content);\n}\n// Algorithm for 'placing' the elements of a slice into a gap:\n//\n// We consider the content of each node that is open to the left to be\n// independently placeable. I.e. in <p(\"foo\"), p(\"bar\")>, when the\n// paragraph on the left is open, \"foo\" can be placed (somewhere on\n// the left side of the replacement gap) independently from p(\"bar\").\n//\n// This class tracks the state of the placement progress in the\n// following properties:\n//\n// - `frontier` holds a stack of `{type, match}` objects that\n// represent the open side of the replacement. It starts at\n// `$from`, then moves forward as content is placed, and is finally\n// reconciled with `$to`.\n//\n// - `unplaced` is a slice that represents the content that hasn't\n// been placed yet.\n//\n// - `placed` is a fragment of placed content. Its open-start value\n// is implicit in `$from`, and its open-end value in `frontier`.\nclass Fitter {\n constructor($from, $to, unplaced) {\n this.$from = $from;\n this.$to = $to;\n this.unplaced = unplaced;\n this.frontier = [];\n this.placed = Fragment.empty;\n for (let i = 0; i <= $from.depth; i++) {\n let node = $from.node(i);\n this.frontier.push({\n type: node.type,\n match: node.contentMatchAt($from.indexAfter(i))\n });\n }\n for (let i = $from.depth; i > 0; i--)\n this.placed = Fragment.from($from.node(i).copy(this.placed));\n }\n get depth() { return this.frontier.length - 1; }\n fit() {\n // As long as there's unplaced content, try to place some of it.\n // If that fails, either increase the open score of the unplaced\n // slice, or drop nodes from it, and then try again.\n while (this.unplaced.size) {\n let fit = this.findFittable();\n if (fit)\n this.placeNodes(fit);\n else\n this.openMore() || this.dropNode();\n }\n // When there's inline content directly after the frontier _and_\n // directly after `this.$to`, we must generate a `ReplaceAround`\n // step that pulls that content into the node after the frontier.\n // That means the fitting must be done to the end of the textblock\n // node after `this.$to`, not `this.$to` itself.\n let moveInline = this.mustMoveInline(), placedSize = this.placed.size - this.depth - this.$from.depth;\n let $from = this.$from, $to = this.close(moveInline < 0 ? this.$to : $from.doc.resolve(moveInline));\n if (!$to)\n return null;\n // If closing to `$to` succeeded, create a step\n let content = this.placed, openStart = $from.depth, openEnd = $to.depth;\n while (openStart && openEnd && content.childCount == 1) { // Normalize by dropping open parent nodes\n content = content.firstChild.content;\n openStart--;\n openEnd--;\n }\n let slice = new Slice(content, openStart, openEnd);\n if (moveInline > -1)\n return new ReplaceAroundStep($from.pos, moveInline, this.$to.pos, this.$to.end(), slice, placedSize);\n if (slice.size || $from.pos != this.$to.pos) // Don't generate no-op steps\n return new ReplaceStep($from.pos, $to.pos, slice);\n return null;\n }\n // Find a position on the start spine of `this.unplaced` that has\n // content that can be moved somewhere on the frontier. Returns two\n // depths, one for the slice and one for the frontier.\n findFittable() {\n // Only try wrapping nodes (pass 2) after finding a place without\n // wrapping failed.\n for (let pass = 1; pass <= 2; pass++) {\n for (let sliceDepth = this.unplaced.openStart; sliceDepth >= 0; sliceDepth--) {\n let fragment, parent = null;\n if (sliceDepth) {\n parent = contentAt(this.unplaced.content, sliceDepth - 1).firstChild;\n fragment = parent.content;\n }\n else {\n fragment = this.unplaced.content;\n }\n let first = fragment.firstChild;\n for (let frontierDepth = this.depth; frontierDepth >= 0; frontierDepth--) {\n let { type, match } = this.frontier[frontierDepth], wrap, inject = null;\n // In pass 1, if the next node matches, or there is no next\n // node but the parents look compatible, we've found a\n // place.\n if (pass == 1 && (first ? match.matchType(first.type) || (inject = match.fillBefore(Fragment.from(first), false))\n : parent && type.compatibleContent(parent.type)))\n return { sliceDepth, frontierDepth, parent, inject };\n // In pass 2, look for a set of wrapping nodes that make\n // `first` fit here.\n else if (pass == 2 && first && (wrap = match.findWrapping(first.type)))\n return { sliceDepth, frontierDepth, parent, wrap };\n // Don't continue looking further up if the parent node\n // would fit here.\n if (parent && match.matchType(parent.type))\n break;\n }\n }\n }\n }\n openMore() {\n let { content, openStart, openEnd } = this.unplaced;\n let inner = contentAt(content, openStart);\n if (!inner.childCount || inner.firstChild.isLeaf)\n return false;\n this.unplaced = new Slice(content, openStart + 1, Math.max(openEnd, inner.size + openStart >= content.size - openEnd ? openStart + 1 : 0));\n return true;\n }\n dropNode() {\n let { content, openStart, openEnd } = this.unplaced;\n let inner = contentAt(content, openStart);\n if (inner.childCount <= 1 && openStart > 0) {\n let openAtEnd = content.size - openStart <= openStart + inner.size;\n this.unplaced = new Slice(dropFromFragment(content, openStart - 1, 1), openStart - 1, openAtEnd ? openStart - 1 : openEnd);\n }\n else {\n this.unplaced = new Slice(dropFromFragment(content, openStart, 1), openStart, openEnd);\n }\n }\n // Move content from the unplaced slice at `sliceDepth` to the\n // frontier node at `frontierDepth`. Close that frontier node when\n // applicable.\n placeNodes({ sliceDepth, frontierDepth, parent, inject, wrap }) {\n while (this.depth > frontierDepth)\n this.closeFrontierNode();\n if (wrap)\n for (let i = 0; i < wrap.length; i++)\n this.openFrontierNode(wrap[i]);\n let slice = this.unplaced, fragment = parent ? parent.content : slice.content;\n let openStart = slice.openStart - sliceDepth;\n let taken = 0, add = [];\n let { match, type } = this.frontier[frontierDepth];\n if (inject) {\n for (let i = 0; i < inject.childCount; i++)\n add.push(inject.child(i));\n match = match.matchFragment(inject);\n }\n // Computes the amount of (end) open nodes at the end of the\n // fragment. When 0, the parent is open, but no more. When\n // negative, nothing is open.\n let openEndCount = (fragment.size + sliceDepth) - (slice.content.size - slice.openEnd);\n // Scan over the fragment, fitting as many child nodes as\n // possible.\n while (taken < fragment.childCount) {\n let next = fragment.child(taken), matches = match.matchType(next.type);\n if (!matches)\n break;\n taken++;\n if (taken > 1 || openStart == 0 || next.content.size) { // Drop empty open nodes\n match = matches;\n add.push(closeNodeStart(next.mark(type.allowedMarks(next.marks)), taken == 1 ? openStart : 0, taken == fragment.childCount ? openEndCount : -1));\n }\n }\n let toEnd = taken == fragment.childCount;\n if (!toEnd)\n openEndCount = -1;\n this.placed = addToFragment(this.placed, frontierDepth, Fragment.from(add));\n this.frontier[frontierDepth].match = match;\n // If the parent types match, and the entire node was moved, and\n // it's not open, close this frontier node right away.\n if (toEnd && openEndCount < 0 && parent && parent.type == this.frontier[this.depth].type && this.frontier.length > 1)\n this.closeFrontierNode();\n // Add new frontier nodes for any open nodes at the end.\n for (let i = 0, cur = fragment; i < openEndCount; i++) {\n let node = cur.lastChild;\n this.frontier.push({ type: node.type, match: node.contentMatchAt(node.childCount) });\n cur = node.content;\n }\n // Update `this.unplaced`. Drop the entire node from which we\n // placed it we got to its end, otherwise just drop the placed\n // nodes.\n this.unplaced = !toEnd ? new Slice(dropFromFragment(slice.content, sliceDepth, taken), slice.openStart, slice.openEnd)\n : sliceDepth == 0 ? Slice.empty\n : new Slice(dropFromFragment(slice.content, sliceDepth - 1, 1), sliceDepth - 1, openEndCount < 0 ? slice.openEnd : sliceDepth - 1);\n }\n mustMoveInline() {\n if (!this.$to.parent.isTextblock)\n return -1;\n let top = this.frontier[this.depth], level;\n if (!top.type.isTextblock || !contentAfterFits(this.$to, this.$to.depth, top.type, top.match, false) ||\n (this.$to.depth == this.depth && (level = this.findCloseLevel(this.$to)) && level.depth == this.depth))\n return -1;\n let { depth } = this.$to, after = this.$to.after(depth);\n while (depth > 1 && after == this.$to.end(--depth))\n ++after;\n return after;\n }\n findCloseLevel($to) {\n scan: for (let i = Math.min(this.depth, $to.depth); i >= 0; i--) {\n let { match, type } = this.frontier[i];\n let dropInner = i < $to.depth && $to.end(i + 1) == $to.pos + ($to.depth - (i + 1));\n let fit = contentAfterFits($to, i, type, match, dropInner);\n if (!fit)\n continue;\n for (let d = i - 1; d >= 0; d--) {\n let { match, type } = this.frontier[d];\n let matches = contentAfterFits($to, d, type, match, true);\n if (!matches || matches.childCount)\n continue scan;\n }\n return { depth: i, fit, move: dropInner ? $to.doc.resolve($to.after(i + 1)) : $to };\n }\n }\n close($to) {\n let close = this.findCloseLevel($to);\n if (!close)\n return null;\n while (this.depth > close.depth)\n this.closeFrontierNode();\n if (close.fit.childCount)\n this.placed = addToFragment(this.placed, close.depth, close.fit);\n $to = close.move;\n for (let d = close.depth + 1; d <= $to.depth; d++) {\n let node = $to.node(d), add = node.type.contentMatch.fillBefore(node.content, true, $to.index(d));\n this.openFrontierNode(node.type, node.attrs, add);\n }\n return $to;\n }\n openFrontierNode(type, attrs = null, content) {\n let top = this.frontier[this.depth];\n top.match = top.match.matchType(type);\n this.placed = addToFragment(this.placed, this.depth, Fragment.from(type.create(attrs, content)));\n this.frontier.push({ type, match: type.contentMatch });\n }\n closeFrontierNode() {\n let open = this.frontier.pop();\n let add = open.match.fillBefore(Fragment.empty, true);\n if (add.childCount)\n this.placed = addToFragment(this.placed, this.frontier.length, add);\n }\n}\nfunction dropFromFragment(fragment, depth, count) {\n if (depth == 0)\n return fragment.cutByIndex(count, fragment.childCount);\n return fragment.replaceChild(0, fragment.firstChild.copy(dropFromFragment(fragment.firstChild.content, depth - 1, count)));\n}\nfunction addToFragment(fragment, depth, content) {\n if (depth == 0)\n return fragment.append(content);\n return fragment.replaceChild(fragment.childCount - 1, fragment.lastChild.copy(addToFragment(fragment.lastChild.content, depth - 1, content)));\n}\nfunction contentAt(fragment, depth) {\n for (let i = 0; i < depth; i++)\n fragment = fragment.firstChild.content;\n return fragment;\n}\nfunction closeNodeStart(node, openStart, openEnd) {\n if (openStart <= 0)\n return node;\n let frag = node.content;\n if (openStart > 1)\n frag = frag.replaceChild(0, closeNodeStart(frag.firstChild, openStart - 1, frag.childCount == 1 ? openEnd - 1 : 0));\n if (openStart > 0) {\n frag = node.type.contentMatch.fillBefore(frag).append(frag);\n if (openEnd <= 0)\n frag = frag.append(node.type.contentMatch.matchFragment(frag).fillBefore(Fragment.empty, true));\n }\n return node.copy(frag);\n}\nfunction contentAfterFits($to, depth, type, match, open) {\n let node = $to.node(depth), index = open ? $to.indexAfter(depth) : $to.index(depth);\n if (index == node.childCount && !type.compatibleContent(node.type))\n return null;\n let fit = match.fillBefore(node.content, true, index);\n return fit && !invalidMarks(type, node.content, index) ? fit : null;\n}\nfunction invalidMarks(type, fragment, start) {\n for (let i = start; i < fragment.childCount; i++)\n if (!type.allowsMarks(fragment.child(i).marks))\n return true;\n return false;\n}\nfunction definesContent(type) {\n return type.spec.defining || type.spec.definingForContent;\n}\nfunction replaceRange(tr, from, to, slice) {\n if (!slice.size)\n return tr.deleteRange(from, to);\n let $from = tr.doc.resolve(from), $to = tr.doc.resolve(to);\n if (fitsTrivially($from, $to, slice))\n return tr.step(new ReplaceStep(from, to, slice));\n let targetDepths = coveredDepths($from, tr.doc.resolve(to));\n // Can't replace the whole document, so remove 0 if it's present\n if (targetDepths[targetDepths.length - 1] == 0)\n targetDepths.pop();\n // Negative numbers represent not expansion over the whole node at\n // that depth, but replacing from $from.before(-D) to $to.pos.\n let preferredTarget = -($from.depth + 1);\n targetDepths.unshift(preferredTarget);\n // This loop picks a preferred target depth, if one of the covering\n // depths is not outside of a defining node, and adds negative\n // depths for any depth that has $from at its start and does not\n // cross a defining node.\n for (let d = $from.depth, pos = $from.pos - 1; d > 0; d--, pos--) {\n let spec = $from.node(d).type.spec;\n if (spec.defining || spec.definingAsContext || spec.isolating)\n break;\n if (targetDepths.indexOf(d) > -1)\n preferredTarget = d;\n else if ($from.before(d) == pos)\n targetDepths.splice(1, 0, -d);\n }\n // Try to fit each possible depth of the slice into each possible\n // target depth, starting with the preferred depths.\n let preferredTargetIndex = targetDepths.indexOf(preferredTarget);\n let leftNodes = [], preferredDepth = slice.openStart;\n for (let content = slice.content, i = 0;; i++) {\n let node = content.firstChild;\n leftNodes.push(node);\n if (i == slice.openStart)\n break;\n content = node.content;\n }\n // Back up preferredDepth to cover defining textblocks directly\n // above it, possibly skipping a non-defining textblock.\n for (let d = preferredDepth - 1; d >= 0; d--) {\n let type = leftNodes[d].type, def = definesContent(type);\n if (def && $from.node(preferredTargetIndex).type != type)\n preferredDepth = d;\n else if (def || !type.isTextblock)\n break;\n }\n for (let j = slice.openStart; j >= 0; j--) {\n let openDepth = (j + preferredDepth + 1) % (slice.openStart + 1);\n let insert = leftNodes[openDepth];\n if (!insert)\n continue;\n for (let i = 0; i < targetDepths.length; i++) {\n // Loop over possible expansion levels, starting with the\n // preferred one\n let targetDepth = targetDepths[(i + preferredTargetIndex) % targetDepths.length], expand = true;\n if (targetDepth < 0) {\n expand = false;\n targetDepth = -targetDepth;\n }\n let parent = $from.node(targetDepth - 1), index = $from.index(targetDepth - 1);\n if (parent.canReplaceWith(index, index, insert.type, insert.marks))\n return tr.replace($from.before(targetDepth), expand ? $to.after(targetDepth) : to, new Slice(closeFragment(slice.content, 0, slice.openStart, openDepth), openDepth, slice.openEnd));\n }\n }\n let startSteps = tr.steps.length;\n for (let i = targetDepths.length - 1; i >= 0; i--) {\n tr.replace(from, to, slice);\n if (tr.steps.length > startSteps)\n break;\n let depth = targetDepths[i];\n if (depth < 0)\n continue;\n from = $from.before(depth);\n to = $to.after(depth);\n }\n}\nfunction closeFragment(fragment, depth, oldOpen, newOpen, parent) {\n if (depth < oldOpen) {\n let first = fragment.firstChild;\n fragment = fragment.replaceChild(0, first.copy(closeFragment(first.content, depth + 1, oldOpen, newOpen, first)));\n }\n if (depth > newOpen) {\n let match = parent.contentMatchAt(0);\n let start = match.fillBefore(fragment).append(fragment);\n fragment = start.append(match.matchFragment(start).fillBefore(Fragment.empty, true));\n }\n return fragment;\n}\nfunction replaceRangeWith(tr, from, to, node) {\n if (!node.isInline && from == to && tr.doc.resolve(from).parent.content.size) {\n let point = insertPoint(tr.doc, from, node.type);\n if (point != null)\n from = to = point;\n }\n tr.replaceRange(from, to, new Slice(Fragment.from(node), 0, 0));\n}\nfunction deleteRange(tr, from, to) {\n let $from = tr.doc.resolve(from), $to = tr.doc.resolve(to);\n let covered = coveredDepths($from, $to);\n for (let i = 0; i < covered.length; i++) {\n let depth = covered[i], last = i == covered.length - 1;\n if ((last && depth == 0) || $from.node(depth).type.contentMatch.validEnd)\n return tr.delete($from.start(depth), $to.end(depth));\n if (depth > 0 && (last || $from.node(depth - 1).canReplace($from.index(depth - 1), $to.indexAfter(depth - 1))))\n return tr.delete($from.before(depth), $to.after(depth));\n }\n for (let d = 1; d <= $from.depth && d <= $to.depth; d++) {\n if (from - $from.start(d) == $from.depth - d && to > $from.end(d) && $to.end(d) - to != $to.depth - d)\n return tr.delete($from.before(d), to);\n }\n tr.delete(from, to);\n}\n// Returns an array of all depths for which $from - $to spans the\n// whole content of the nodes at that depth.\nfunction coveredDepths($from, $to) {\n let result = [], minDepth = Math.min($from.depth, $to.depth);\n for (let d = minDepth; d >= 0; d--) {\n let start = $from.start(d);\n if (start < $from.pos - ($from.depth - d) ||\n $to.end(d) > $to.pos + ($to.depth - d) ||\n $from.node(d).type.spec.isolating ||\n $to.node(d).type.spec.isolating)\n break;\n if (start == $to.start(d) ||\n (d == $from.depth && d == $to.depth && $from.parent.inlineContent && $to.parent.inlineContent &&\n d && $to.start(d - 1) == start - 1))\n result.push(d);\n }\n return result;\n}\n\n/**\n@internal\n*/\nlet TransformError = class extends Error {\n};\nTransformError = function TransformError(message) {\n let err = Error.call(this, message);\n err.__proto__ = TransformError.prototype;\n return err;\n};\nTransformError.prototype = Object.create(Error.prototype);\nTransformError.prototype.constructor = TransformError;\nTransformError.prototype.name = \"TransformError\";\n/**\nAbstraction to build up and track an array of\n[steps](https://prosemirror.net/docs/ref/#transform.Step) representing a document transformation.\n\nMost transforming methods return the `Transform` object itself, so\nthat they can be chained.\n*/\nclass Transform {\n /**\n Create a transform that starts with the given document.\n */\n constructor(\n /**\n The current document (the result of applying the steps in the\n transform).\n */\n doc) {\n this.doc = doc;\n /**\n The steps in this transform.\n */\n this.steps = [];\n /**\n The documents before each of the steps.\n */\n this.docs = [];\n /**\n A mapping with the maps for each of the steps in this transform.\n */\n this.mapping = new Mapping;\n }\n /**\n The starting document.\n */\n get before() { return this.docs.length ? this.docs[0] : this.doc; }\n /**\n Apply a new step in this transform, saving the result. Throws an\n error when the step fails.\n */\n step(step) {\n let result = this.maybeStep(step);\n if (result.failed)\n throw new TransformError(result.failed);\n return this;\n }\n /**\n Try to apply a step in this transformation, ignoring it if it\n fails. Returns the step result.\n */\n maybeStep(step) {\n let result = step.apply(this.doc);\n if (!result.failed)\n this.addStep(step, result.doc);\n return result;\n }\n /**\n True when the document has been changed (when there are any\n steps).\n */\n get docChanged() {\n return this.steps.length > 0;\n }\n /**\n @internal\n */\n addStep(step, doc) {\n this.docs.push(this.doc);\n this.steps.push(step);\n this.mapping.appendMap(step.getMap());\n this.doc = doc;\n }\n /**\n Replace the part of the document between `from` and `to` with the\n given `slice`.\n */\n replace(from, to = from, slice = Slice.empty) {\n let step = replaceStep(this.doc, from, to, slice);\n if (step)\n this.step(step);\n return this;\n }\n /**\n Replace the given range with the given content, which may be a\n fragment, node, or array of nodes.\n */\n replaceWith(from, to, content) {\n return this.replace(from, to, new Slice(Fragment.from(content), 0, 0));\n }\n /**\n Delete the content between the given positions.\n */\n delete(from, to) {\n return this.replace(from, to, Slice.empty);\n }\n /**\n Insert the given content at the given position.\n */\n insert(pos, content) {\n return this.replaceWith(pos, pos, content);\n }\n /**\n Replace a range of the document with a given slice, using\n `from`, `to`, and the slice's\n [`openStart`](https://prosemirror.net/docs/ref/#model.Slice.openStart) property as hints, rather\n than fixed start and end points. This method may grow the\n replaced area or close open nodes in the slice in order to get a\n fit that is more in line with WYSIWYG expectations, by dropping\n fully covered parent nodes of the replaced region when they are\n marked [non-defining as\n context](https://prosemirror.net/docs/ref/#model.NodeSpec.definingAsContext), or including an\n open parent node from the slice that _is_ marked as [defining\n its content](https://prosemirror.net/docs/ref/#model.NodeSpec.definingForContent).\n \n This is the method, for example, to handle paste. The similar\n [`replace`](https://prosemirror.net/docs/ref/#transform.Transform.replace) method is a more\n primitive tool which will _not_ move the start and end of its given\n range, and is useful in situations where you need more precise\n control over what happens.\n */\n replaceRange(from, to, slice) {\n replaceRange(this, from, to, slice);\n return this;\n }\n /**\n Replace the given range with a node, but use `from` and `to` as\n hints, rather than precise positions. When from and to are the same\n and are at the start or end of a parent node in which the given\n node doesn't fit, this method may _move_ them out towards a parent\n that does allow the given node to be placed. When the given range\n completely covers a parent node, this method may completely replace\n that parent node.\n */\n replaceRangeWith(from, to, node) {\n replaceRangeWith(this, from, to, node);\n return this;\n }\n /**\n Delete the given range, expanding it to cover fully covered\n parent nodes until a valid replace is found.\n */\n deleteRange(from, to) {\n deleteRange(this, from, to);\n return this;\n }\n /**\n Split the content in the given range off from its parent, if there\n is sibling content before or after it, and move it up the tree to\n the depth specified by `target`. You'll probably want to use\n [`liftTarget`](https://prosemirror.net/docs/ref/#transform.liftTarget) to compute `target`, to make\n sure the lift is valid.\n */\n lift(range, target) {\n lift(this, range, target);\n return this;\n }\n /**\n Join the blocks around the given position. If depth is 2, their\n last and first siblings are also joined, and so on.\n */\n join(pos, depth = 1) {\n join(this, pos, depth);\n return this;\n }\n /**\n Wrap the given [range](https://prosemirror.net/docs/ref/#model.NodeRange) in the given set of wrappers.\n The wrappers are assumed to be valid in this position, and should\n probably be computed with [`findWrapping`](https://prosemirror.net/docs/ref/#transform.findWrapping).\n */\n wrap(range, wrappers) {\n wrap(this, range, wrappers);\n return this;\n }\n /**\n Set the type of all textblocks (partly) between `from` and `to` to\n the given node type with the given attributes.\n */\n setBlockType(from, to = from, type, attrs = null) {\n setBlockType(this, from, to, type, attrs);\n return this;\n }\n /**\n Change the type, attributes, and/or marks of the node at `pos`.\n When `type` isn't given, the existing node type is preserved,\n */\n setNodeMarkup(pos, type, attrs = null, marks = []) {\n setNodeMarkup(this, pos, type, attrs, marks);\n return this;\n }\n /**\n Split the node at the given position, and optionally, if `depth` is\n greater than one, any number of nodes above that. By default, the\n parts split off will inherit the node type of the original node.\n This can be changed by passing an array of types and attributes to\n use after the split.\n */\n split(pos, depth = 1, typesAfter) {\n split(this, pos, depth, typesAfter);\n return this;\n }\n /**\n Add the given mark to the inline content between `from` and `to`.\n */\n addMark(from, to, mark) {\n addMark(this, from, to, mark);\n return this;\n }\n /**\n Remove marks from inline nodes between `from` and `to`. When\n `mark` is a single mark, remove precisely that mark. When it is\n a mark type, remove all marks of that type. When it is null,\n remove all marks of any type.\n */\n removeMark(from, to, mark) {\n removeMark(this, from, to, mark);\n return this;\n }\n /**\n Removes all marks and nodes from the content of the node at\n `pos` that don't match the given new parent node type. Accepts\n an optional starting [content match](https://prosemirror.net/docs/ref/#model.ContentMatch) as\n third argument.\n */\n clearIncompatible(pos, parentType, match) {\n clearIncompatible(this, pos, parentType, match);\n return this;\n }\n}\n\nexport { AddMarkStep, MapResult, Mapping, RemoveMarkStep, ReplaceAroundStep, ReplaceStep, Step, StepMap, StepResult, Transform, TransformError, canJoin, canSplit, dropPoint, findWrapping, insertPoint, joinPoint, liftTarget, replaceStep };\n","function getDefaults() {\n return {\n baseUrl: null,\n breaks: false,\n gfm: true,\n headerIds: true,\n headerPrefix: '',\n highlight: null,\n langPrefix: 'language-',\n mangle: true,\n pedantic: false,\n renderer: null,\n sanitize: false,\n sanitizer: null,\n silent: false,\n smartLists: false,\n smartypants: false,\n xhtml: false\n };\n}\n\nfunction changeDefaults(newDefaults) {\n module.exports.defaults = newDefaults;\n}\n\nmodule.exports = {\n defaults: getDefaults(),\n getDefaults,\n changeDefaults\n};\n","import { Plugin } from 'prosemirror-state';\nimport { dropPoint } from 'prosemirror-transform';\n\n/**\nCreate a plugin that, when added to a ProseMirror instance,\ncauses a decoration to show up at the drop position when something\nis dragged over the editor.\n\nNodes may add a `disableDropCursor` property to their spec to\ncontrol the showing of a drop cursor inside them. This may be a\nboolean or a function, which will be called with a view and a\nposition, and should return a boolean.\n*/\nfunction dropCursor(options = {}) {\n return new Plugin({\n view(editorView) { return new DropCursorView(editorView, options); }\n });\n}\nclass DropCursorView {\n constructor(editorView, options) {\n this.editorView = editorView;\n this.cursorPos = null;\n this.element = null;\n this.timeout = -1;\n this.width = options.width || 1;\n this.color = options.color || \"black\";\n this.class = options.class;\n this.handlers = [\"dragover\", \"dragend\", \"drop\", \"dragleave\"].map(name => {\n let handler = (e) => { this[name](e); };\n editorView.dom.addEventListener(name, handler);\n return { name, handler };\n });\n }\n destroy() {\n this.handlers.forEach(({ name, handler }) => this.editorView.dom.removeEventListener(name, handler));\n }\n update(editorView, prevState) {\n if (this.cursorPos != null && prevState.doc != editorView.state.doc) {\n if (this.cursorPos > editorView.state.doc.content.size)\n this.setCursor(null);\n else\n this.updateOverlay();\n }\n }\n setCursor(pos) {\n if (pos == this.cursorPos)\n return;\n this.cursorPos = pos;\n if (pos == null) {\n this.element.parentNode.removeChild(this.element);\n this.element = null;\n }\n else {\n this.updateOverlay();\n }\n }\n updateOverlay() {\n let $pos = this.editorView.state.doc.resolve(this.cursorPos), rect;\n if (!$pos.parent.inlineContent) {\n let before = $pos.nodeBefore, after = $pos.nodeAfter;\n if (before || after) {\n let nodeRect = this.editorView.nodeDOM(this.cursorPos - (before ? before.nodeSize : 0))\n .getBoundingClientRect();\n let top = before ? nodeRect.bottom : nodeRect.top;\n if (before && after)\n top = (top + this.editorView.nodeDOM(this.cursorPos).getBoundingClientRect().top) / 2;\n rect = { left: nodeRect.left, right: nodeRect.right, top: top - this.width / 2, bottom: top + this.width / 2 };\n }\n }\n if (!rect) {\n let coords = this.editorView.coordsAtPos(this.cursorPos);\n rect = { left: coords.left - this.width / 2, right: coords.left + this.width / 2, top: coords.top, bottom: coords.bottom };\n }\n let parent = this.editorView.dom.offsetParent;\n if (!this.element) {\n this.element = parent.appendChild(document.createElement(\"div\"));\n if (this.class)\n this.element.className = this.class;\n this.element.style.cssText = \"position: absolute; z-index: 50; pointer-events: none; background-color: \" + this.color;\n }\n let parentLeft, parentTop;\n if (!parent || parent == document.body && getComputedStyle(parent).position == \"static\") {\n parentLeft = -pageXOffset;\n parentTop = -pageYOffset;\n }\n else {\n let rect = parent.getBoundingClientRect();\n parentLeft = rect.left - parent.scrollLeft;\n parentTop = rect.top - parent.scrollTop;\n }\n this.element.style.left = (rect.left - parentLeft) + \"px\";\n this.element.style.top = (rect.top - parentTop) + \"px\";\n this.element.style.width = (rect.right - rect.left) + \"px\";\n this.element.style.height = (rect.bottom - rect.top) + \"px\";\n }\n scheduleRemoval(timeout) {\n clearTimeout(this.timeout);\n this.timeout = setTimeout(() => this.setCursor(null), timeout);\n }\n dragover(event) {\n if (!this.editorView.editable)\n return;\n let pos = this.editorView.posAtCoords({ left: event.clientX, top: event.clientY });\n let node = pos && pos.inside >= 0 && this.editorView.state.doc.nodeAt(pos.inside);\n let disableDropCursor = node && node.type.spec.disableDropCursor;\n let disabled = typeof disableDropCursor == \"function\" ? disableDropCursor(this.editorView, pos, event) : disableDropCursor;\n if (pos && !disabled) {\n let target = pos.pos;\n if (this.editorView.dragging && this.editorView.dragging.slice) {\n target = dropPoint(this.editorView.state.doc, target, this.editorView.dragging.slice);\n if (target == null)\n return this.setCursor(null);\n }\n this.setCursor(target);\n this.scheduleRemoval(5000);\n }\n }\n dragend() {\n this.scheduleRemoval(20);\n }\n drop() {\n this.scheduleRemoval(20);\n }\n dragleave(event) {\n if (event.target == this.editorView.dom || !this.editorView.dom.contains(event.relatedTarget))\n this.setCursor(null);\n }\n}\n\nexport { dropCursor };\n","import { keydownHandler } from 'prosemirror-keymap';\nimport { Selection, NodeSelection, TextSelection, Plugin } from 'prosemirror-state';\nimport { Slice, Fragment } from 'prosemirror-model';\nimport { DecorationSet, Decoration } from 'prosemirror-view';\n\n/**\nGap cursor selections are represented using this class. Its\n`$anchor` and `$head` properties both point at the cursor position.\n*/\nclass GapCursor extends Selection {\n /**\n Create a gap cursor.\n */\n constructor($pos) {\n super($pos, $pos);\n }\n map(doc, mapping) {\n let $pos = doc.resolve(mapping.map(this.head));\n return GapCursor.valid($pos) ? new GapCursor($pos) : Selection.near($pos);\n }\n content() { return Slice.empty; }\n eq(other) {\n return other instanceof GapCursor && other.head == this.head;\n }\n toJSON() {\n return { type: \"gapcursor\", pos: this.head };\n }\n /**\n @internal\n */\n static fromJSON(doc, json) {\n if (typeof json.pos != \"number\")\n throw new RangeError(\"Invalid input for GapCursor.fromJSON\");\n return new GapCursor(doc.resolve(json.pos));\n }\n /**\n @internal\n */\n getBookmark() { return new GapBookmark(this.anchor); }\n /**\n @internal\n */\n static valid($pos) {\n let parent = $pos.parent;\n if (parent.isTextblock || !closedBefore($pos) || !closedAfter($pos))\n return false;\n let override = parent.type.spec.allowGapCursor;\n if (override != null)\n return override;\n let deflt = parent.contentMatchAt($pos.index()).defaultType;\n return deflt && deflt.isTextblock;\n }\n /**\n @internal\n */\n static findGapCursorFrom($pos, dir, mustMove = false) {\n search: for (;;) {\n if (!mustMove && GapCursor.valid($pos))\n return $pos;\n let pos = $pos.pos, next = null;\n // Scan up from this position\n for (let d = $pos.depth;; d--) {\n let parent = $pos.node(d);\n if (dir > 0 ? $pos.indexAfter(d) < parent.childCount : $pos.index(d) > 0) {\n next = parent.child(dir > 0 ? $pos.indexAfter(d) : $pos.index(d) - 1);\n break;\n }\n else if (d == 0) {\n return null;\n }\n pos += dir;\n let $cur = $pos.doc.resolve(pos);\n if (GapCursor.valid($cur))\n return $cur;\n }\n // And then down into the next node\n for (;;) {\n let inside = dir > 0 ? next.firstChild : next.lastChild;\n if (!inside) {\n if (next.isAtom && !next.isText && !NodeSelection.isSelectable(next)) {\n $pos = $pos.doc.resolve(pos + next.nodeSize * dir);\n mustMove = false;\n continue search;\n }\n break;\n }\n next = inside;\n pos += dir;\n let $cur = $pos.doc.resolve(pos);\n if (GapCursor.valid($cur))\n return $cur;\n }\n return null;\n }\n }\n}\nGapCursor.prototype.visible = false;\nGapCursor.findFrom = GapCursor.findGapCursorFrom;\nSelection.jsonID(\"gapcursor\", GapCursor);\nclass GapBookmark {\n constructor(pos) {\n this.pos = pos;\n }\n map(mapping) {\n return new GapBookmark(mapping.map(this.pos));\n }\n resolve(doc) {\n let $pos = doc.resolve(this.pos);\n return GapCursor.valid($pos) ? new GapCursor($pos) : Selection.near($pos);\n }\n}\nfunction closedBefore($pos) {\n for (let d = $pos.depth; d >= 0; d--) {\n let index = $pos.index(d), parent = $pos.node(d);\n // At the start of this parent, look at next one\n if (index == 0) {\n if (parent.type.spec.isolating)\n return true;\n continue;\n }\n // See if the node before (or its first ancestor) is closed\n for (let before = parent.child(index - 1);; before = before.lastChild) {\n if ((before.childCount == 0 && !before.inlineContent) || before.isAtom || before.type.spec.isolating)\n return true;\n if (before.inlineContent)\n return false;\n }\n }\n // Hit start of document\n return true;\n}\nfunction closedAfter($pos) {\n for (let d = $pos.depth; d >= 0; d--) {\n let index = $pos.indexAfter(d), parent = $pos.node(d);\n if (index == parent.childCount) {\n if (parent.type.spec.isolating)\n return true;\n continue;\n }\n for (let after = parent.child(index);; after = after.firstChild) {\n if ((after.childCount == 0 && !after.inlineContent) || after.isAtom || after.type.spec.isolating)\n return true;\n if (after.inlineContent)\n return false;\n }\n }\n return true;\n}\n\n/**\nCreate a gap cursor plugin. When enabled, this will capture clicks\nnear and arrow-key-motion past places that don't have a normally\nselectable position nearby, and create a gap cursor selection for\nthem. The cursor is drawn as an element with class\n`ProseMirror-gapcursor`. You can either include\n`style/gapcursor.css` from the package's directory or add your own\nstyles to make it visible.\n*/\nfunction gapCursor() {\n return new Plugin({\n props: {\n decorations: drawGapCursor,\n createSelectionBetween(_view, $anchor, $head) {\n return $anchor.pos == $head.pos && GapCursor.valid($head) ? new GapCursor($head) : null;\n },\n handleClick,\n handleKeyDown,\n handleDOMEvents: { beforeinput: beforeinput }\n }\n });\n}\nconst handleKeyDown = keydownHandler({\n \"ArrowLeft\": arrow(\"horiz\", -1),\n \"ArrowRight\": arrow(\"horiz\", 1),\n \"ArrowUp\": arrow(\"vert\", -1),\n \"ArrowDown\": arrow(\"vert\", 1)\n});\nfunction arrow(axis, dir) {\n const dirStr = axis == \"vert\" ? (dir > 0 ? \"down\" : \"up\") : (dir > 0 ? \"right\" : \"left\");\n return function (state, dispatch, view) {\n let sel = state.selection;\n let $start = dir > 0 ? sel.$to : sel.$from, mustMove = sel.empty;\n if (sel instanceof TextSelection) {\n if (!view.endOfTextblock(dirStr) || $start.depth == 0)\n return false;\n mustMove = false;\n $start = state.doc.resolve(dir > 0 ? $start.after() : $start.before());\n }\n let $found = GapCursor.findGapCursorFrom($start, dir, mustMove);\n if (!$found)\n return false;\n if (dispatch)\n dispatch(state.tr.setSelection(new GapCursor($found)));\n return true;\n };\n}\nfunction handleClick(view, pos, event) {\n if (!view || !view.editable)\n return false;\n let $pos = view.state.doc.resolve(pos);\n if (!GapCursor.valid($pos))\n return false;\n let clickPos = view.posAtCoords({ left: event.clientX, top: event.clientY });\n if (clickPos && clickPos.inside > -1 && NodeSelection.isSelectable(view.state.doc.nodeAt(clickPos.inside)))\n return false;\n view.dispatch(view.state.tr.setSelection(new GapCursor($pos)));\n return true;\n}\n// This is a hack that, when a composition starts while a gap cursor\n// is active, quickly creates an inline context for the composition to\n// happen in, to avoid it being aborted by the DOM selection being\n// moved into a valid position.\nfunction beforeinput(view, event) {\n if (event.inputType != \"insertCompositionText\" || !(view.state.selection instanceof GapCursor))\n return false;\n let { $from } = view.state.selection;\n let insert = $from.parent.contentMatchAt($from.index()).findWrapping(view.state.schema.nodes.text);\n if (!insert)\n return false;\n let frag = Fragment.empty;\n for (let i = insert.length - 1; i >= 0; i--)\n frag = Fragment.from(insert[i].createAndFill(null, frag));\n let tr = view.state.tr.replace($from.pos, $from.pos, new Slice(frag, 0, 0));\n tr.setSelection(TextSelection.near(tr.doc.resolve($from.pos + 1)));\n view.dispatch(tr);\n return false;\n}\nfunction drawGapCursor(state) {\n if (!(state.selection instanceof GapCursor))\n return null;\n let node = document.createElement(\"div\");\n node.className = \"ProseMirror-gapcursor\";\n return DecorationSet.create(state.doc, [Decoration.widget(state.selection.head, node, { key: \"gapcursor\" })]);\n}\n\nexport { GapCursor, gapCursor };\n","\n /*!\n * tiptap v1.32.1\n * (c) 2021 überdosis GbR (limited liability)\n * @license MIT\n */\n \nimport { EditorState, Plugin, PluginKey, TextSelection } from 'prosemirror-state';\nexport { NodeSelection, Plugin, PluginKey, TextSelection } from 'prosemirror-state';\nimport { EditorView } from 'prosemirror-view';\nimport { Schema, DOMParser, DOMSerializer } from 'prosemirror-model';\nimport { dropCursor } from 'prosemirror-dropcursor';\nimport { gapCursor } from 'prosemirror-gapcursor';\nimport { keymap } from 'prosemirror-keymap';\nimport { baseKeymap } from 'prosemirror-commands';\nimport { inputRules, undoInputRule } from 'prosemirror-inputrules';\nimport { getMarkRange, markIsActive, getMarkAttrs, nodeIsActive, getNodeAttrs } from 'tiptap-utils';\nimport Vue from 'vue';\nimport { setBlockType } from 'tiptap-commands';\n\nfunction camelCase (str) {\n return str.replace(/(?:^\\w|[A-Z]|\\b\\w)/g, (word, index) => index === 0 ? word.toLowerCase() : word.toUpperCase()).replace(/\\s+/g, '');\n}\n\nclass ComponentView {\n constructor(component, {\n editor,\n extension,\n parent,\n node,\n view,\n decorations,\n getPos\n }) {\n this.component = component;\n this.editor = editor;\n this.extension = extension;\n this.parent = parent;\n this.node = node;\n this.view = view;\n this.decorations = decorations;\n this.isNode = !!this.node.marks;\n this.isMark = !this.isNode;\n this.getPos = this.isMark ? this.getMarkPos : getPos;\n this.captureEvents = true;\n this.dom = this.createDOM();\n this.contentDOM = this.vm.$refs.content;\n }\n\n createDOM() {\n const Component = Vue.extend(this.component);\n const props = {\n editor: this.editor,\n node: this.node,\n view: this.view,\n getPos: () => this.getPos(),\n decorations: this.decorations,\n selected: false,\n options: this.extension.options,\n updateAttrs: attrs => this.updateAttrs(attrs)\n };\n\n if (typeof this.extension.setSelection === 'function') {\n this.setSelection = this.extension.setSelection;\n }\n\n if (typeof this.extension.update === 'function') {\n this.update = this.extension.update;\n }\n\n this.vm = new Component({\n parent: this.parent,\n propsData: props\n }).$mount();\n return this.vm.$el;\n }\n\n update(node, decorations) {\n if (node.type !== this.node.type) {\n return false;\n }\n\n if (node === this.node && this.decorations === decorations) {\n return true;\n }\n\n this.node = node;\n this.decorations = decorations;\n this.updateComponentProps({\n node,\n decorations\n });\n return true;\n }\n\n updateComponentProps(props) {\n if (!this.vm._props) {\n return;\n } // Update props in component\n // TODO: Avoid mutating a prop directly.\n // Maybe there is a better way to do this?\n\n\n const originalSilent = Vue.config.silent;\n Vue.config.silent = true;\n Object.entries(props).forEach(([key, value]) => {\n this.vm._props[key] = value;\n }); // this.vm._props.node = node\n // this.vm._props.decorations = decorations\n\n Vue.config.silent = originalSilent;\n }\n\n updateAttrs(attrs) {\n if (!this.view.editable) {\n return;\n }\n\n const {\n state\n } = this.view;\n const {\n type\n } = this.node;\n const pos = this.getPos();\n const newAttrs = { ...this.node.attrs,\n ...attrs\n };\n const transaction = this.isMark ? state.tr.removeMark(pos.from, pos.to, type).addMark(pos.from, pos.to, type.create(newAttrs)) : state.tr.setNodeMarkup(pos, null, newAttrs);\n this.view.dispatch(transaction);\n } // prevent a full re-render of the vue component on update\n // we'll handle prop updates in `update()`\n\n\n ignoreMutation(mutation) {\n // allow leaf nodes to be selected\n if (mutation.type === 'selection') {\n return false;\n }\n\n if (!this.contentDOM) {\n return true;\n }\n\n return !this.contentDOM.contains(mutation.target);\n } // disable (almost) all prosemirror event listener for node views\n\n\n stopEvent(event) {\n if (typeof this.extension.stopEvent === 'function') {\n return this.extension.stopEvent(event);\n }\n\n const draggable = !!this.extension.schema.draggable; // support a custom drag handle\n\n if (draggable && event.type === 'mousedown') {\n const dragHandle = event.target.closest && event.target.closest('[data-drag-handle]');\n const isValidDragHandle = dragHandle && (this.dom === dragHandle || this.dom.contains(dragHandle));\n\n if (isValidDragHandle) {\n this.captureEvents = false;\n document.addEventListener('dragend', () => {\n this.captureEvents = true;\n }, {\n once: true\n });\n }\n }\n\n const isCopy = event.type === 'copy';\n const isPaste = event.type === 'paste';\n const isCut = event.type === 'cut';\n const isDrag = event.type.startsWith('drag') || event.type === 'drop';\n\n if (draggable && isDrag || isCopy || isPaste || isCut) {\n return false;\n }\n\n return this.captureEvents;\n }\n\n selectNode() {\n this.updateComponentProps({\n selected: true\n });\n }\n\n deselectNode() {\n this.updateComponentProps({\n selected: false\n });\n }\n\n getMarkPos() {\n const pos = this.view.posAtDOM(this.dom);\n const resolvedPos = this.view.state.doc.resolve(pos);\n const range = getMarkRange(resolvedPos, this.node.type);\n return range;\n }\n\n destroy() {\n this.vm.$destroy();\n }\n\n}\n\nclass Emitter {\n // Add an event listener for given event\n on(event, fn) {\n this._callbacks = this._callbacks || {}; // Create namespace for this event\n\n if (!this._callbacks[event]) {\n this._callbacks[event] = [];\n }\n\n this._callbacks[event].push(fn);\n\n return this;\n }\n\n emit(event, ...args) {\n this._callbacks = this._callbacks || {};\n const callbacks = this._callbacks[event];\n\n if (callbacks) {\n callbacks.forEach(callback => callback.apply(this, args));\n }\n\n return this;\n } // Remove event listener for given event.\n // If fn is not provided, all event listeners for that event will be removed.\n // If neither is provided, all event listeners will be removed.\n\n\n off(event, fn) {\n if (!arguments.length) {\n this._callbacks = {};\n } else {\n // event listeners for the given event\n const callbacks = this._callbacks ? this._callbacks[event] : null;\n\n if (callbacks) {\n if (fn) {\n this._callbacks[event] = callbacks.filter(cb => cb !== fn); // remove specific handler\n } else {\n delete this._callbacks[event]; // remove all handlers\n }\n }\n }\n\n return this;\n }\n\n}\n\nclass Extension {\n constructor(options = {}) {\n this.options = { ...this.defaultOptions,\n ...options\n };\n }\n\n init() {\n return null;\n }\n\n bindEditor(editor = null) {\n this.editor = editor;\n }\n\n get name() {\n return null;\n }\n\n get type() {\n return 'extension';\n }\n\n get defaultOptions() {\n return {};\n }\n\n get plugins() {\n return [];\n }\n\n inputRules() {\n return [];\n }\n\n pasteRules() {\n return [];\n }\n\n keys() {\n return {};\n }\n\n}\n\nclass ExtensionManager {\n constructor(extensions = [], editor) {\n extensions.forEach(extension => {\n extension.bindEditor(editor);\n extension.init();\n });\n this.extensions = extensions;\n }\n\n get nodes() {\n return this.extensions.filter(extension => extension.type === 'node').reduce((nodes, {\n name,\n schema\n }) => ({ ...nodes,\n [name]: schema\n }), {});\n }\n\n get options() {\n const {\n view\n } = this;\n return this.extensions.reduce((nodes, extension) => ({ ...nodes,\n [extension.name]: new Proxy(extension.options, {\n set(obj, prop, value) {\n const changed = obj[prop] !== value;\n Object.assign(obj, {\n [prop]: value\n });\n\n if (changed) {\n view.updateState(view.state);\n }\n\n return true;\n }\n\n })\n }), {});\n }\n\n get marks() {\n return this.extensions.filter(extension => extension.type === 'mark').reduce((marks, {\n name,\n schema\n }) => ({ ...marks,\n [name]: schema\n }), {});\n }\n\n get plugins() {\n return this.extensions.filter(extension => extension.plugins).reduce((allPlugins, {\n plugins\n }) => [...allPlugins, ...plugins], []);\n }\n\n keymaps({\n schema\n }) {\n const extensionKeymaps = this.extensions.filter(extension => ['extension'].includes(extension.type)).filter(extension => extension.keys).map(extension => extension.keys({\n schema\n }));\n const nodeMarkKeymaps = this.extensions.filter(extension => ['node', 'mark'].includes(extension.type)).filter(extension => extension.keys).map(extension => extension.keys({\n type: schema[`${extension.type}s`][extension.name],\n schema\n }));\n return [...extensionKeymaps, ...nodeMarkKeymaps].map(keys => keymap(keys));\n }\n\n inputRules({\n schema,\n excludedExtensions\n }) {\n if (!(excludedExtensions instanceof Array) && excludedExtensions) return [];\n const allowedExtensions = excludedExtensions instanceof Array ? this.extensions.filter(extension => !excludedExtensions.includes(extension.name)) : this.extensions;\n const extensionInputRules = allowedExtensions.filter(extension => ['extension'].includes(extension.type)).filter(extension => extension.inputRules).map(extension => extension.inputRules({\n schema\n }));\n const nodeMarkInputRules = allowedExtensions.filter(extension => ['node', 'mark'].includes(extension.type)).filter(extension => extension.inputRules).map(extension => extension.inputRules({\n type: schema[`${extension.type}s`][extension.name],\n schema\n }));\n return [...extensionInputRules, ...nodeMarkInputRules].reduce((allInputRules, inputRules) => [...allInputRules, ...inputRules], []);\n }\n\n pasteRules({\n schema,\n excludedExtensions\n }) {\n if (!(excludedExtensions instanceof Array) && excludedExtensions) return [];\n const allowedExtensions = excludedExtensions instanceof Array ? this.extensions.filter(extension => !excludedExtensions.includes(extension.name)) : this.extensions;\n const extensionPasteRules = allowedExtensions.filter(extension => ['extension'].includes(extension.type)).filter(extension => extension.pasteRules).map(extension => extension.pasteRules({\n schema\n }));\n const nodeMarkPasteRules = allowedExtensions.filter(extension => ['node', 'mark'].includes(extension.type)).filter(extension => extension.pasteRules).map(extension => extension.pasteRules({\n type: schema[`${extension.type}s`][extension.name],\n schema\n }));\n return [...extensionPasteRules, ...nodeMarkPasteRules].reduce((allPasteRules, pasteRules) => [...allPasteRules, ...pasteRules], []);\n }\n\n commands({\n schema,\n view\n }) {\n return this.extensions.filter(extension => extension.commands).reduce((allCommands, extension) => {\n const {\n name,\n type\n } = extension;\n const commands = {};\n const value = extension.commands({\n schema,\n ...(['node', 'mark'].includes(type) ? {\n type: schema[`${type}s`][name]\n } : {})\n });\n\n const apply = (cb, attrs) => {\n if (!view.editable) {\n return false;\n }\n\n view.focus();\n return cb(attrs)(view.state, view.dispatch, view);\n };\n\n const handle = (_name, _value) => {\n if (Array.isArray(_value)) {\n commands[_name] = attrs => _value.forEach(callback => apply(callback, attrs));\n } else if (typeof _value === 'function') {\n commands[_name] = attrs => apply(_value, attrs);\n }\n };\n\n if (typeof value === 'object') {\n Object.entries(value).forEach(([commandName, commandValue]) => {\n handle(commandName, commandValue);\n });\n } else {\n handle(name, value);\n }\n\n return { ...allCommands,\n ...commands\n };\n }, {});\n }\n\n}\n\nfunction injectCSS (css) {\n if (process.env.NODE_ENV !== 'test') {\n const style = document.createElement('style');\n style.type = 'text/css';\n style.textContent = css;\n const {\n head\n } = document;\n const {\n firstChild\n } = head;\n\n if (firstChild) {\n head.insertBefore(style, firstChild);\n } else {\n head.appendChild(style);\n }\n }\n}\n\nclass Mark extends Extension {\n constructor(options = {}) {\n super(options);\n }\n\n get type() {\n return 'mark';\n }\n\n get view() {\n return null;\n }\n\n get schema() {\n return null;\n }\n\n command() {\n return () => {};\n }\n\n}\n\nfunction minMax(value = 0, min = 0, max = 0) {\n return Math.min(Math.max(parseInt(value, 10), min), max);\n}\n\nclass Node extends Extension {\n constructor(options = {}) {\n super(options);\n }\n\n get type() {\n return 'node';\n }\n\n get view() {\n return null;\n }\n\n get schema() {\n return null;\n }\n\n command() {\n return () => {};\n }\n\n}\n\nclass Doc extends Node {\n get name() {\n return 'doc';\n }\n\n get schema() {\n return {\n content: 'block+'\n };\n }\n\n}\n\nclass Paragraph extends Node {\n get name() {\n return 'paragraph';\n }\n\n get schema() {\n return {\n content: 'inline*',\n group: 'block',\n draggable: false,\n parseDOM: [{\n tag: 'p'\n }],\n toDOM: () => ['p', 0]\n };\n }\n\n commands({\n type\n }) {\n return () => setBlockType(type);\n }\n\n}\n\nclass Text extends Node {\n get name() {\n return 'text';\n }\n\n get schema() {\n return {\n group: 'inline'\n };\n }\n\n}\n\nvar css = \".ProseMirror {\\n position: relative;\\n}\\n\\n.ProseMirror {\\n word-wrap: break-word;\\n white-space: pre-wrap;\\n -webkit-font-variant-ligatures: none;\\n font-variant-ligatures: none;\\n}\\n\\n.ProseMirror pre {\\n white-space: pre-wrap;\\n}\\n\\n.ProseMirror-gapcursor {\\n display: none;\\n pointer-events: none;\\n position: absolute;\\n}\\n\\n.ProseMirror-gapcursor:after {\\n content: \\\"\\\";\\n display: block;\\n position: absolute;\\n top: -2px;\\n width: 20px;\\n border-top: 1px solid black;\\n animation: ProseMirror-cursor-blink 1.1s steps(2, start) infinite;\\n}\\n\\n@keyframes ProseMirror-cursor-blink {\\n to {\\n visibility: hidden;\\n }\\n}\\n\\n.ProseMirror-hideselection *::selection {\\n background: transparent;\\n}\\n\\n.ProseMirror-hideselection *::-moz-selection {\\n background: transparent;\\n}\\n\\n.ProseMirror-hideselection * {\\n caret-color: transparent;\\n}\\n\\n.ProseMirror-focused .ProseMirror-gapcursor {\\n display: block;\\n}\\n\";\n\nclass Editor extends Emitter {\n constructor(options = {}) {\n super();\n this.defaultOptions = {\n editorProps: {},\n editable: true,\n autoFocus: null,\n extensions: [],\n content: '',\n topNode: 'doc',\n emptyDocument: {\n type: 'doc',\n content: [{\n type: 'paragraph'\n }]\n },\n useBuiltInExtensions: true,\n disableInputRules: false,\n disablePasteRules: false,\n dropCursor: {},\n enableDropCursor: true,\n enableGapCursor: true,\n parseOptions: {},\n injectCSS: true,\n onInit: () => {},\n onTransaction: () => {},\n onUpdate: () => {},\n onFocus: () => {},\n onBlur: () => {},\n onPaste: () => {},\n onDrop: () => {}\n };\n this.events = ['init', 'transaction', 'update', 'focus', 'blur', 'paste', 'drop'];\n this.init(options);\n }\n\n init(options = {}) {\n this.setOptions({ ...this.defaultOptions,\n ...options\n });\n this.focused = false;\n this.selection = {\n from: 0,\n to: 0\n };\n this.element = document.createElement('div');\n this.extensions = this.createExtensions();\n this.nodes = this.createNodes();\n this.marks = this.createMarks();\n this.schema = this.createSchema();\n this.plugins = this.createPlugins();\n this.keymaps = this.createKeymaps();\n this.inputRules = this.createInputRules();\n this.pasteRules = this.createPasteRules();\n this.view = this.createView();\n this.commands = this.createCommands();\n this.setActiveNodesAndMarks();\n\n if (this.options.injectCSS) {\n injectCSS(css);\n }\n\n if (this.options.autoFocus !== null) {\n this.focus(this.options.autoFocus);\n }\n\n this.events.forEach(name => {\n this.on(name, this.options[camelCase(`on ${name}`)] || (() => {}));\n });\n this.emit('init', {\n view: this.view,\n state: this.state\n }); // give extension manager access to our view\n\n this.extensions.view = this.view;\n }\n\n setOptions(options) {\n this.options = { ...this.options,\n ...options\n };\n\n if (this.view && this.state) {\n this.view.updateState(this.state);\n }\n }\n\n get builtInExtensions() {\n if (!this.options.useBuiltInExtensions) {\n return [];\n }\n\n return [new Doc(), new Text(), new Paragraph()];\n }\n\n get state() {\n return this.view ? this.view.state : null;\n }\n\n createExtensions() {\n return new ExtensionManager([...this.builtInExtensions, ...this.options.extensions], this);\n }\n\n createPlugins() {\n return this.extensions.plugins;\n }\n\n createKeymaps() {\n return this.extensions.keymaps({\n schema: this.schema\n });\n }\n\n createInputRules() {\n return this.extensions.inputRules({\n schema: this.schema,\n excludedExtensions: this.options.disableInputRules\n });\n }\n\n createPasteRules() {\n return this.extensions.pasteRules({\n schema: this.schema,\n excludedExtensions: this.options.disablePasteRules\n });\n }\n\n createCommands() {\n return this.extensions.commands({\n schema: this.schema,\n view: this.view\n });\n }\n\n createNodes() {\n return this.extensions.nodes;\n }\n\n createMarks() {\n return this.extensions.marks;\n }\n\n createSchema() {\n return new Schema({\n topNode: this.options.topNode,\n nodes: this.nodes,\n marks: this.marks\n });\n }\n\n createState() {\n return EditorState.create({\n schema: this.schema,\n doc: this.createDocument(this.options.content),\n plugins: [...this.plugins, inputRules({\n rules: this.inputRules\n }), ...this.pasteRules, ...this.keymaps, keymap({\n Backspace: undoInputRule\n }), keymap(baseKeymap), ...(this.options.enableDropCursor ? [dropCursor(this.options.dropCursor)] : []), ...(this.options.enableGapCursor ? [gapCursor()] : []), new Plugin({\n key: new PluginKey('editable'),\n props: {\n editable: () => this.options.editable\n }\n }), new Plugin({\n props: {\n attributes: {\n tabindex: 0\n },\n handleDOMEvents: {\n focus: (view, event) => {\n this.focused = true;\n this.emit('focus', {\n event,\n state: view.state,\n view\n });\n const transaction = this.state.tr.setMeta('focused', true);\n this.view.dispatch(transaction);\n },\n blur: (view, event) => {\n this.focused = false;\n this.emit('blur', {\n event,\n state: view.state,\n view\n });\n const transaction = this.state.tr.setMeta('focused', false);\n this.view.dispatch(transaction);\n }\n }\n }\n }), new Plugin({\n props: this.options.editorProps\n })]\n });\n }\n\n createDocument(content, parseOptions = this.options.parseOptions) {\n if (content === null) {\n return this.schema.nodeFromJSON(this.options.emptyDocument);\n }\n\n if (typeof content === 'object') {\n try {\n return this.schema.nodeFromJSON(content);\n } catch (error) {\n console.warn('[tiptap warn]: Invalid content.', 'Passed value:', content, 'Error:', error);\n return this.schema.nodeFromJSON(this.options.emptyDocument);\n }\n }\n\n if (typeof content === 'string') {\n const htmlString = `<div>${content}</div>`;\n const parser = new window.DOMParser();\n const element = parser.parseFromString(htmlString, 'text/html').body.firstElementChild;\n return DOMParser.fromSchema(this.schema).parse(element, parseOptions);\n }\n\n return false;\n }\n\n createView() {\n return new EditorView(this.element, {\n state: this.createState(),\n handlePaste: (...args) => {\n this.emit('paste', ...args);\n },\n handleDrop: (...args) => {\n this.emit('drop', ...args);\n },\n dispatchTransaction: this.dispatchTransaction.bind(this)\n });\n }\n\n setParentComponent(component = null) {\n if (!component) {\n return;\n }\n\n this.view.setProps({\n nodeViews: this.initNodeViews({\n parent: component,\n extensions: [...this.builtInExtensions, ...this.options.extensions]\n })\n });\n }\n\n initNodeViews({\n parent,\n extensions\n }) {\n return extensions.filter(extension => ['node', 'mark'].includes(extension.type)).filter(extension => extension.view).reduce((nodeViews, extension) => {\n const nodeView = (node, view, getPos, decorations) => {\n const component = extension.view;\n return new ComponentView(component, {\n editor: this,\n extension,\n parent,\n node,\n view,\n getPos,\n decorations\n });\n };\n\n return { ...nodeViews,\n [extension.name]: nodeView\n };\n }, {});\n }\n\n dispatchTransaction(transaction) {\n const newState = this.state.apply(transaction);\n this.view.updateState(newState);\n this.selection = {\n from: this.state.selection.from,\n to: this.state.selection.to\n };\n this.setActiveNodesAndMarks();\n this.emit('transaction', {\n getHTML: this.getHTML.bind(this),\n getJSON: this.getJSON.bind(this),\n state: this.state,\n transaction\n });\n\n if (!transaction.docChanged || transaction.getMeta('preventUpdate')) {\n return;\n }\n\n this.emitUpdate(transaction);\n }\n\n emitUpdate(transaction) {\n this.emit('update', {\n getHTML: this.getHTML.bind(this),\n getJSON: this.getJSON.bind(this),\n state: this.state,\n transaction\n });\n }\n\n resolveSelection(position = null) {\n if (this.selection && position === null) {\n return this.selection;\n }\n\n if (position === 'start' || position === true) {\n return {\n from: 0,\n to: 0\n };\n }\n\n if (position === 'end') {\n const {\n doc\n } = this.state;\n return {\n from: doc.content.size,\n to: doc.content.size\n };\n }\n\n return {\n from: position,\n to: position\n };\n }\n\n focus(position = null) {\n if (this.view.focused && position === null || position === false) {\n return;\n }\n\n const {\n from,\n to\n } = this.resolveSelection(position);\n this.setSelection(from, to);\n setTimeout(() => this.view.focus(), 10);\n }\n\n setSelection(from = 0, to = 0) {\n const {\n doc,\n tr\n } = this.state;\n const resolvedFrom = minMax(from, 0, doc.content.size);\n const resolvedEnd = minMax(to, 0, doc.content.size);\n const selection = TextSelection.create(doc, resolvedFrom, resolvedEnd);\n const transaction = tr.setSelection(selection);\n this.view.dispatch(transaction);\n }\n\n blur() {\n this.view.dom.blur();\n }\n\n getSchemaJSON() {\n return JSON.parse(JSON.stringify({\n nodes: this.extensions.nodes,\n marks: this.extensions.marks\n }));\n }\n\n getHTML() {\n const div = document.createElement('div');\n const fragment = DOMSerializer.fromSchema(this.schema).serializeFragment(this.state.doc.content);\n div.appendChild(fragment);\n return div.innerHTML;\n }\n\n getJSON() {\n return this.state.doc.toJSON();\n }\n\n setContent(content = {}, emitUpdate = false, parseOptions) {\n const {\n doc,\n tr\n } = this.state;\n const document = this.createDocument(content, parseOptions);\n const selection = TextSelection.create(doc, 0, doc.content.size);\n const transaction = tr.setSelection(selection).replaceSelectionWith(document, false).setMeta('preventUpdate', !emitUpdate);\n this.view.dispatch(transaction);\n }\n\n clearContent(emitUpdate = false) {\n this.setContent(this.options.emptyDocument, emitUpdate);\n }\n\n setActiveNodesAndMarks() {\n this.activeMarks = Object.entries(this.schema.marks).reduce((marks, [name, mark]) => ({ ...marks,\n [name]: (attrs = {}) => markIsActive(this.state, mark, attrs)\n }), {});\n this.activeMarkAttrs = Object.entries(this.schema.marks).reduce((marks, [name, mark]) => ({ ...marks,\n [name]: getMarkAttrs(this.state, mark)\n }), {});\n this.activeNodes = Object.entries(this.schema.nodes).reduce((nodes, [name, node]) => ({ ...nodes,\n [name]: (attrs = {}) => nodeIsActive(this.state, node, attrs)\n }), {});\n }\n\n getMarkAttrs(type = null) {\n return this.activeMarkAttrs[type];\n }\n\n getNodeAttrs(type = null) {\n return { ...getNodeAttrs(this.state, this.schema.nodes[type])\n };\n }\n\n get isActive() {\n return Object.entries({ ...this.activeMarks,\n ...this.activeNodes\n }).reduce((types, [name, value]) => ({ ...types,\n [name]: (attrs = {}) => value(attrs)\n }), {});\n }\n\n registerPlugin(plugin = null, handlePlugins) {\n const plugins = typeof handlePlugins === 'function' ? handlePlugins(plugin, this.state.plugins) : [plugin, ...this.state.plugins];\n const newState = this.state.reconfigure({\n plugins\n });\n this.view.updateState(newState);\n }\n\n unregisterPlugin(name = null) {\n if (!name || !this.view.docView) {\n return;\n }\n\n const newState = this.state.reconfigure({\n plugins: this.state.plugins.filter(plugin => !plugin.key.startsWith(`${name}$`))\n });\n this.view.updateState(newState);\n }\n\n destroy() {\n if (!this.view) {\n return;\n }\n\n this.view.destroy();\n }\n\n}\n\nvar EditorContent = {\n props: {\n editor: {\n default: null,\n type: Object\n }\n },\n watch: {\n editor: {\n immediate: true,\n\n handler(editor) {\n if (editor && editor.element) {\n this.$nextTick(() => {\n this.$el.appendChild(editor.element.firstChild);\n editor.setParentComponent(this);\n });\n }\n }\n\n }\n },\n\n render(createElement) {\n return createElement('div');\n },\n\n beforeDestroy() {\n this.editor.element = this.$el;\n }\n\n};\n\nclass Menu {\n constructor({\n options\n }) {\n this.options = options;\n this.preventHide = false; // the mousedown event is fired before blur so we can prevent it\n\n this.mousedownHandler = this.handleClick.bind(this);\n this.options.element.addEventListener('mousedown', this.mousedownHandler, {\n capture: true\n });\n\n this.blurHandler = () => {\n if (this.preventHide) {\n this.preventHide = false;\n return;\n }\n\n this.options.editor.emit('menubar:focusUpdate', false);\n };\n\n this.options.editor.on('blur', this.blurHandler);\n }\n\n handleClick() {\n this.preventHide = true;\n }\n\n destroy() {\n this.options.element.removeEventListener('mousedown', this.mousedownHandler);\n this.options.editor.off('blur', this.blurHandler);\n }\n\n}\n\nfunction MenuBar (options) {\n return new Plugin({\n key: new PluginKey('menu_bar'),\n\n view(editorView) {\n return new Menu({\n editorView,\n options\n });\n }\n\n });\n}\n\nvar EditorMenuBar = {\n props: {\n editor: {\n default: null,\n type: Object\n }\n },\n\n data() {\n return {\n focused: false\n };\n },\n\n watch: {\n editor: {\n immediate: true,\n\n handler(editor) {\n if (editor) {\n this.$nextTick(() => {\n editor.registerPlugin(MenuBar({\n editor,\n element: this.$el\n }));\n this.focused = editor.focused;\n editor.on('focus', () => {\n this.focused = true;\n });\n editor.on('menubar:focusUpdate', focused => {\n this.focused = focused;\n });\n });\n }\n }\n\n }\n },\n\n render() {\n if (!this.editor) {\n return null;\n }\n\n return this.$scopedSlots.default({\n focused: this.focused,\n focus: this.editor.focus,\n commands: this.editor.commands,\n isActive: this.editor.isActive,\n getMarkAttrs: this.editor.getMarkAttrs.bind(this.editor),\n getNodeAttrs: this.editor.getNodeAttrs.bind(this.editor)\n });\n }\n\n};\n\nfunction textRange(node, from, to) {\n const range = document.createRange();\n range.setEnd(node, to == null ? node.nodeValue.length : to);\n range.setStart(node, Math.max(from, 0));\n return range;\n}\n\nfunction singleRect(object, bias) {\n const rects = object.getClientRects();\n return !rects.length ? object.getBoundingClientRect() : rects[bias < 0 ? 0 : rects.length - 1];\n}\n\nfunction coordsAtPos(view, pos, end = false) {\n const {\n node,\n offset\n } = view.docView.domFromPos(pos);\n let side;\n let rect;\n\n if (node.nodeType === 3) {\n if (end && offset < node.nodeValue.length) {\n rect = singleRect(textRange(node, offset - 1, offset), -1);\n side = 'right';\n } else if (offset < node.nodeValue.length) {\n rect = singleRect(textRange(node, offset, offset + 1), -1);\n side = 'left';\n }\n } else if (node.firstChild) {\n if (offset < node.childNodes.length) {\n const child = node.childNodes[offset];\n rect = singleRect(child.nodeType === 3 ? textRange(child) : child, -1);\n side = 'left';\n }\n\n if ((!rect || rect.top === rect.bottom) && offset) {\n const child = node.childNodes[offset - 1];\n rect = singleRect(child.nodeType === 3 ? textRange(child) : child, 1);\n side = 'right';\n }\n } else {\n rect = node.getBoundingClientRect();\n side = 'left';\n }\n\n const x = rect[side];\n return {\n top: rect.top,\n bottom: rect.bottom,\n left: x,\n right: x\n };\n}\n\nclass Menu$1 {\n constructor({\n options,\n editorView\n }) {\n this.options = { ...{\n element: null,\n keepInBounds: true,\n onUpdate: () => false\n },\n ...options\n };\n this.editorView = editorView;\n this.isActive = false;\n this.left = 0;\n this.bottom = 0;\n this.top = 0;\n this.preventHide = false; // the mousedown event is fired before blur so we can prevent it\n\n this.mousedownHandler = this.handleClick.bind(this);\n this.options.element.addEventListener('mousedown', this.mousedownHandler, {\n capture: true\n });\n\n this.focusHandler = ({\n view\n }) => {\n this.update(view);\n };\n\n this.options.editor.on('focus', this.focusHandler);\n\n this.blurHandler = ({\n event\n }) => {\n if (this.preventHide) {\n this.preventHide = false;\n return;\n }\n\n this.hide(event);\n };\n\n this.options.editor.on('blur', this.blurHandler);\n }\n\n handleClick() {\n this.preventHide = true;\n }\n\n update(view, lastState) {\n const {\n state\n } = view;\n\n if (view.composing) {\n return;\n } // Don't do anything if the document/selection didn't change\n\n\n if (lastState && lastState.doc.eq(state.doc) && lastState.selection.eq(state.selection)) {\n return;\n } // Hide the tooltip if the selection is empty\n\n\n if (state.selection.empty) {\n this.hide();\n return;\n } // Otherwise, reposition it and update its content\n\n\n const {\n from,\n to\n } = state.selection; // These are in screen coordinates\n // We can't use EditorView.cordsAtPos here because it can't handle linebreaks correctly\n // See: https://github.com/ProseMirror/prosemirror-view/pull/47\n\n const start = coordsAtPos(view, from);\n const end = coordsAtPos(view, to, true); // The box in which the tooltip is positioned, to use as base\n\n const parent = this.options.element.offsetParent;\n\n if (!parent) {\n this.hide();\n return;\n }\n\n const box = parent.getBoundingClientRect();\n const el = this.options.element.getBoundingClientRect(); // Find a center-ish x position from the selection endpoints (when\n // crossing lines, end may be more to the left)\n\n const left = (start.left + end.left) / 2 - box.left; // Keep the menuBubble in the bounding box of the offsetParent i\n\n this.left = Math.round(this.options.keepInBounds ? Math.min(box.width - el.width / 2, Math.max(left, el.width / 2)) : left);\n this.bottom = Math.round(box.bottom - start.top);\n this.top = Math.round(end.bottom - box.top);\n this.isActive = true;\n this.sendUpdate();\n }\n\n sendUpdate() {\n this.options.onUpdate({\n isActive: this.isActive,\n left: this.left,\n bottom: this.bottom,\n top: this.top\n });\n }\n\n hide(event) {\n if (event && event.relatedTarget && this.options.element.parentNode && this.options.element.parentNode.contains(event.relatedTarget)) {\n return;\n }\n\n this.isActive = false;\n this.sendUpdate();\n }\n\n destroy() {\n this.options.element.removeEventListener('mousedown', this.mousedownHandler);\n this.options.editor.off('focus', this.focusHandler);\n this.options.editor.off('blur', this.blurHandler);\n }\n\n}\n\nfunction MenuBubble (options) {\n return new Plugin({\n key: new PluginKey('menu_bubble'),\n\n view(editorView) {\n return new Menu$1({\n editorView,\n options\n });\n }\n\n });\n}\n\nvar EditorMenuBubble = {\n props: {\n editor: {\n default: null,\n type: Object\n },\n keepInBounds: {\n default: true,\n type: Boolean\n }\n },\n\n data() {\n return {\n menu: {\n isActive: false,\n left: 0,\n bottom: 0\n }\n };\n },\n\n watch: {\n editor: {\n immediate: true,\n\n handler(editor) {\n if (editor) {\n this.$nextTick(() => {\n editor.registerPlugin(MenuBubble({\n editor,\n element: this.$el,\n keepInBounds: this.keepInBounds,\n onUpdate: menu => {\n // the second check ensures event is fired only once\n if (menu.isActive && this.menu.isActive === false) {\n this.$emit('show', menu);\n } else if (!menu.isActive && this.menu.isActive === true) {\n this.$emit('hide', menu);\n }\n\n this.menu = menu;\n }\n }));\n });\n }\n }\n\n }\n },\n\n render() {\n if (!this.editor) {\n return null;\n }\n\n return this.$scopedSlots.default({\n focused: this.editor.view.focused,\n focus: this.editor.focus,\n commands: this.editor.commands,\n isActive: this.editor.isActive,\n getMarkAttrs: this.editor.getMarkAttrs.bind(this.editor),\n getNodeAttrs: this.editor.getNodeAttrs.bind(this.editor),\n menu: this.menu\n });\n },\n\n beforeDestroy() {\n this.editor.unregisterPlugin('menu_bubble');\n }\n\n};\n\nclass Menu$2 {\n constructor({\n options,\n editorView\n }) {\n this.options = { ...{\n resizeObserver: true,\n element: null,\n onUpdate: () => false\n },\n ...options\n };\n this.preventHide = false;\n this.editorView = editorView;\n this.isActive = false;\n this.top = 0; // the mousedown event is fired before blur so we can prevent it\n\n this.mousedownHandler = this.handleClick.bind(this);\n this.options.element.addEventListener('mousedown', this.mousedownHandler, {\n capture: true\n });\n\n this.focusHandler = ({\n view\n }) => {\n this.update(view);\n };\n\n this.options.editor.on('focus', this.focusHandler);\n\n this.blurHandler = ({\n event\n }) => {\n if (this.preventHide) {\n this.preventHide = false;\n return;\n }\n\n this.hide(event);\n };\n\n this.options.editor.on('blur', this.blurHandler); // sometimes we have to update the position\n // because of a loaded images for example\n\n if (this.options.resizeObserver && window.ResizeObserver) {\n this.resizeObserver = new ResizeObserver(() => {\n if (this.isActive) {\n this.update(this.editorView);\n }\n });\n this.resizeObserver.observe(this.editorView.dom);\n }\n }\n\n handleClick() {\n this.preventHide = true;\n }\n\n update(view, lastState) {\n const {\n state\n } = view; // Don't do anything if the document/selection didn't change\n\n if (lastState && lastState.doc.eq(state.doc) && lastState.selection.eq(state.selection)) {\n return;\n }\n\n if (!state.selection.empty) {\n this.hide();\n return;\n }\n\n const currentDom = view.domAtPos(state.selection.anchor);\n const isActive = currentDom.node.innerHTML === '<br>' && currentDom.node.tagName === 'P' && currentDom.node.parentNode === view.dom;\n\n if (!isActive) {\n this.hide();\n return;\n }\n\n const parent = this.options.element.offsetParent;\n\n if (!parent) {\n this.hide();\n return;\n }\n\n const editorBoundings = parent.getBoundingClientRect();\n const cursorBoundings = view.coordsAtPos(state.selection.anchor);\n const top = cursorBoundings.top - editorBoundings.top;\n this.isActive = true;\n this.top = top;\n this.sendUpdate();\n }\n\n sendUpdate() {\n this.options.onUpdate({\n isActive: this.isActive,\n top: this.top\n });\n }\n\n hide(event) {\n if (event && event.relatedTarget && this.options.element.parentNode && this.options.element.parentNode.contains(event.relatedTarget)) {\n return;\n }\n\n this.isActive = false;\n this.sendUpdate();\n }\n\n destroy() {\n this.options.element.removeEventListener('mousedown', this.mousedownHandler);\n\n if (this.resizeObserver) {\n this.resizeObserver.unobserve(this.editorView.dom);\n }\n\n this.options.editor.off('focus', this.focusHandler);\n this.options.editor.off('blur', this.blurHandler);\n }\n\n}\n\nfunction FloatingMenu (options) {\n return new Plugin({\n key: new PluginKey('floating_menu'),\n\n view(editorView) {\n return new Menu$2({\n editorView,\n options\n });\n }\n\n });\n}\n\nvar EditorFloatingMenu = {\n props: {\n editor: {\n default: null,\n type: Object\n }\n },\n\n data() {\n return {\n menu: {\n isActive: false,\n left: 0,\n bottom: 0\n }\n };\n },\n\n watch: {\n editor: {\n immediate: true,\n\n handler(editor) {\n if (editor) {\n this.$nextTick(() => {\n editor.registerPlugin(FloatingMenu({\n editor,\n element: this.$el,\n onUpdate: menu => {\n // the second check ensures event is fired only once\n if (menu.isActive && this.menu.isActive === false) {\n this.$emit('show', menu);\n } else if (!menu.isActive && this.menu.isActive === true) {\n this.$emit('hide', menu);\n }\n\n this.menu = menu;\n }\n }));\n });\n }\n }\n\n }\n },\n\n render() {\n if (!this.editor) {\n return null;\n }\n\n return this.$scopedSlots.default({\n focused: this.editor.view.focused,\n focus: this.editor.focus,\n commands: this.editor.commands,\n isActive: this.editor.isActive,\n getMarkAttrs: this.editor.getMarkAttrs.bind(this.editor),\n getNodeAttrs: this.editor.getNodeAttrs.bind(this.editor),\n menu: this.menu\n });\n },\n\n beforeDestroy() {\n this.editor.unregisterPlugin('floating_menu');\n }\n\n};\n\nexport { Doc, Editor, EditorContent, EditorFloatingMenu, EditorMenuBar, EditorMenuBubble, Extension, Mark, Node, Paragraph, Text };\n"],"sourceRoot":""}
projects / anni / blob